res-4.0.3/.hg_archival.txt0000644000000000000000000000020112156113044013511 0ustar 00000000000000repo: 87bb9239641a82393e8de958a192e05adcb733a0 node: 0f68cc750cacf21f5372eaf71e9d0fea504ce91a branch: default tag: release-4.0.3 res-4.0.3/.hgignore0000644000000000000000000000006712156113044012240 0ustar 00000000000000^.*\.swp$ ^setup\.(log|data)$ ^_build/.*$ ^.*\.native$ res-4.0.3/.hgtags0000644000000000000000000000104612156113044011711 0ustar 00000000000000cbdce125069e1d9c16251d4f60e87477b6bf3399 release 3.0.0 8a698e453979fc76554924e6caea9d358fcc8f72 release 3.1.1 0000000000000000000000000000000000000000 release 3.1.1 0000000000000000000000000000000000000000 release 3.0.0 cbdce125069e1d9c16251d4f60e87477b6bf3399 release-3.0.0 8a698e453979fc76554924e6caea9d358fcc8f72 release-3.1.1 01bb0826ec007f6e1560aab353ec4b50050487bf release-3.2.0 9d88b2942b4f764b63daff2657b448b07ba2abe1 release-4.0.0 90fbae6f6462b062489da7be1c29216fdd86c529 release-4.0.1 a4be4a3e9dc46fd428e37b5853ed75fb03f90d48 release-4.0.2 res-4.0.3/API.odocl0000644000000000000000000000027612156113044012072 0ustar 00000000000000# OASIS_START # DO NOT EDIT (digest: 89eab6dae45df20abe5f63f242bc9ec9) lib/Nopres_impl lib/Nopres_intf lib/Pres_impl lib/Pres_intf lib/Res lib/Strat lib/Weak_impl lib/Weak_intf # OASIS_STOP res-4.0.3/AUTHORS.txt0000644000000000000000000000032712156113044012322 0ustar 00000000000000(* OASIS_START *) (* DO NOT EDIT (digest: cbda9aba8f6c8a053e342da5d20f3008) *) Authors of res Markus Mottl Current maintainers of res Markus Mottl (* OASIS_STOP *) res-4.0.3/CHANGES.txt0000644000000000000000000001272612156113044012253 0ustar 000000000000002013-06-12: Fixed a bug in the fill functions that made them not behave according to specification when filling past the end. 2012-07-20: Downgraded findlib version requirement to support the Debian testing branch. 2012-07-15: New major release version 4.0.0: * Upgraded to OCaml 4.00 * Switched to Oasis for packaging * Switched to OCamlBuild for the build process * Rewrote README in Markdown * Added stricter compilation flags 2009-06-01: Robustified implementation to avoid internal use of Obg.magic. 2008-09-16: Changed strategy API to greatly improve performance of growing/shrinking. 2008-05-09: Added unsafe_expose_array to parameterized resizable arrays. 2006-11-22: Updated OCamlMakefile. 2005-12-26: Fixed a build problem. 2005-10-24: Added sof_list. 2004-04-11: Removed use of unsafe external function that depends on current CVS-version. 2004-01-28: Renamed external function for compatibility with most recent OCaml-version. Updated OCamlMakefile. 2003-04-09: Updated OCamlMakefile. Fixed an installation problem. 2003-01-07: Updated OCamlMakefile to make use of "findlib". 2002-09-23: Fixed a bug in "remove_n" (arguments not fully checked). Slightly improved efficiency. 2002-09-11: Updated OCamlMakefile and license. Documented all modules for ocamldoc. Changed module Res for better accessibility. Made resizable weak arrays conform to module Weak again. 2002-05-04: Revised the whole installation procedure. See INSTALL for details. 2002-04-30: Updated OCamlMakefile: it does not ask for confirmation during installation anymore! 2001-06-30: Removed "Printexc.catch" from stupid_ga-example: is going to be deprecated in upcoming OCaml-release. 2001-06-24: Added special module for resizable integer arrays (again), because it is faster on many operations. 2001-01-30: Made Makefile more general (allows simpler addition of further examples). 2001-01-26: Made use of the new OCaml-keyword "include" for module inclusion. This makes the file "lib/res.ml" significantly shorter. This change requires an OCaml-version higher than 3.00. 2001-01-24: Updated OCamlMakefile 2000-06-24: Updated OCamlMakefile 2000-06-13: Updated OCamlMakefile 2000-06-11: Updated OCamlMakefile 2000-06-08: Added installation routine + updated OCamlMakefile again: This upgrade makes installation much easier! Read the updated INSTALL-file! 2000-06-07: Upgraded to new OCamlMakefile. 2000-04-28: Fixed *critical* bug: Filling and blitting accidently truncated the array if the last index of the operation was smaller than the one of the target array. Resizable bit-vectors should be *much* more efficient now (blitting, resizing, etc. about 30 (60) times faster, depending on your architecture!): I took the new implementation of Jean-Christophe Filliatre's bitv-library, which uses some very clever algorithms for efficient blitting. In the near (?) future I'll also add his functions for common logical, efficient operations on bit-strings (unless somebody wants to volunteer... ;-) 2000-03-23: Removed special module for resizable integer arrays: Integer arrays are not unboxed and won't be in the (near?) future: this would cause generic polymorphic functions such as equality, hashing and output_value to produce wrong results. Therefore, use the parameterized version instead. It is equally fast. 2000-03-08: New function (in all implementations): find_index - takes a predicate, a resizable array and a start index and returns the index of the first element that satisfies the predicate - see interface documentation for details. Fixed documentation of interfaces: in some cases the wrong name for possibly raised exceptions was provided. 2000-01-10: Added functions for converting standard arrays to resizable ones and strings to buffers. Added "create" and "screate" to the interface of parameterized arrays. This makes it easier to use it in place of the standard array. Removed "make" and "smake" from resizable weak arrays - not useful there. Updated documentation on how to use the index operators with the resizable datastructures and how to easily replace the standard arrays/strings with the resizable ones in large sources. 1999-12-25: Added support for weak arrays + small example 1999-11-04: Added support for bit-vectors (peeked at Jean-Christophe Filliatre's bitv-library for this). Added new example: stupid_ga.ml (a brain-dead genetic algorithm using bit-vectors) We now have a TODO-list ;-) 1999-10-23: Added three new functions: remove_range - removes a range of elements within a resizable array pos - returns the index of the first logically equal element posq - returns the index of the first physically equal element 1999-10-13: First release. res-4.0.3/COPYING.txt0000644000000000000000000006546712156113044012325 0ustar 00000000000000The Library is distributed under the terms of the GNU Lesser General Public License version 2.1 (included below). As a special exception to the GNU Lesser General Public License, you may link, statically or dynamically, a "work that uses the Library" with a publicly distributed version of the Library to produce an executable file containing portions of the Library, and distribute that executable file under terms of your choice, without any of the additional requirements listed in clause 6 of the GNU Lesser General Public License. By "a publicly distributed version of the Library", we mean either the unmodified Library as distributed by the authors, or a modified version of the Library that is distributed under the conditions defined in clause 3 of the GNU Lesser General Public License. This exception does not however invalidate any other reasons why the executable file might be covered by the GNU Lesser General Public License. --------------------------------------------------------------------------- GNU LESSER GENERAL PUBLIC LICENSE Version 2.1, February 1999 Copyright (C) 1991, 1999 Free Software Foundation, Inc. 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. [This is the first released version of the Lesser GPL. It also counts as the successor of the GNU Library Public License, version 2, hence the version number 2.1.] Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public Licenses are intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This license, the Lesser General Public License, applies to some specially designated software packages--typically libraries--of the Free Software Foundation and other authors who decide to use it. You can use it too, but we suggest you first think carefully about whether this license or the ordinary General Public License is the better strategy to use in any particular case, based on the explanations below. When we speak of free software, we are referring to freedom of use, 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 and use pieces of it in new free programs; and that you are informed that you can do these things. To protect your rights, we need to make restrictions that forbid distributors to deny you these rights or to ask you to surrender these rights. These restrictions translate to certain responsibilities for you if you distribute copies of the library or if you modify it. For example, if you distribute copies of the library, whether gratis or for a fee, you must give the recipients all the rights that we gave you. You must make sure that they, too, receive or can get the source code. If you link other code with the library, you must provide complete object files to the recipients, so that they can relink them with the library after making changes to the library and recompiling it. And you must show them these terms so they know their rights. We protect your rights with a two-step method: (1) we copyright the library, and (2) we offer you this license, which gives you legal permission to copy, distribute and/or modify the library. To protect each distributor, we want to make it very clear that there is no warranty for the free library. Also, if the library is modified by someone else and passed on, the recipients should know that what they have is not the original version, so that the original author's reputation will not be affected by problems that might be introduced by others. Finally, software patents pose a constant threat to the existence of any free program. We wish to make sure that a company cannot effectively restrict the users of a free program by obtaining a restrictive license from a patent holder. Therefore, we insist that any patent license obtained for a version of the library must be consistent with the full freedom of use specified in this license. Most GNU software, including some libraries, is covered by the ordinary GNU General Public License. This license, the GNU Lesser General Public License, applies to certain designated libraries, and is quite different from the ordinary General Public License. We use this license for certain libraries in order to permit linking those libraries into non-free programs. When a program is linked with a library, whether statically or using a shared library, the combination of the two is legally speaking a combined work, a derivative of the original library. The ordinary General Public License therefore permits such linking only if the entire combination fits its criteria of freedom. The Lesser General Public License permits more lax criteria for linking other code with the library. We call this license the "Lesser" General Public License because it does Less to protect the user's freedom than the ordinary General Public License. It also provides other free software developers Less of an advantage over competing non-free programs. These disadvantages are the reason we use the ordinary General Public License for many libraries. However, the Lesser license provides advantages in certain special circumstances. For example, on rare occasions, there may be a special need to encourage the widest possible use of a certain library, so that it becomes a de-facto standard. To achieve this, non-free programs must be allowed to use the library. A more frequent case is that a free library does the same job as widely used non-free libraries. In this case, there is little to gain by limiting the free library to free software only, so we use the Lesser General Public License. In other cases, permission to use a particular library in non-free programs enables a greater number of people to use a large body of free software. For example, permission to use the GNU C Library in non-free programs enables many more people to use the whole GNU operating system, as well as its variant, the GNU/Linux operating system. Although the Lesser General Public License is Less protective of the users' freedom, it does ensure that the user of a program that is linked with the Library has the freedom and the wherewithal to run that program using a modified version of the Library. The precise terms and conditions for copying, distribution and modification follow. Pay close attention to the difference between a "work based on the library" and a "work that uses the library". The former contains code derived from the library, whereas the latter must be combined with the library in order to run. GNU LESSER GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License Agreement applies to any software library or other program which contains a notice placed by the copyright holder or other authorized party saying it may be distributed under the terms of this Lesser General Public License (also called "this License"). Each licensee is addressed as "you". A "library" means a collection of software functions and/or data prepared so as to be conveniently linked with application programs (which use some of those functions and data) to form executables. The "Library", below, refers to any such software library or work which has been distributed under these terms. A "work based on the Library" means either the Library or any derivative work under copyright law: that is to say, a work containing the Library or a portion of it, either verbatim or with modifications and/or translated straightforwardly into another language. (Hereinafter, translation is included without limitation in the term "modification".) "Source code" for a work means the preferred form of the work for making modifications to it. For a library, 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 library. Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running a program using the Library is not restricted, and output from such a program is covered only if its contents constitute a work based on the Library (independent of the use of the Library in a tool for writing it). Whether that is true depends on what the Library does and what the program that uses the Library does. 1. You may copy and distribute verbatim copies of the Library's complete 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 distribute a copy of this License along with the Library. 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 Library or any portion of it, thus forming a work based on the Library, 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) The modified work must itself be a software library. b) You must cause the files modified to carry prominent notices stating that you changed the files and the date of any change. c) You must cause the whole of the work to be licensed at no charge to all third parties under the terms of this License. d) If a facility in the modified Library refers to a function or a table of data to be supplied by an application program that uses the facility, other than as an argument passed when the facility is invoked, then you must make a good faith effort to ensure that, in the event an application does not supply such function or table, the facility still operates, and performs whatever part of its purpose remains meaningful. (For example, a function in a library to compute square roots has a purpose that is entirely well-defined independent of the application. Therefore, Subsection 2d requires that any application-supplied function or table used by this function must be optional: if the application does not supply it, the square root function must still compute square roots.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Library, 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 Library, 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 Library. In addition, mere aggregation of another work not based on the Library with the Library (or with a work based on the Library) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may opt to apply the terms of the ordinary GNU General Public License instead of this License to a given copy of the Library. To do this, you must alter all the notices that refer to this License, so that they refer to the ordinary GNU General Public License, version 2, instead of to this License. (If a newer version than version 2 of the ordinary GNU General Public License has appeared, then you can specify that version instead if you wish.) Do not make any other change in these notices. Once this change is made in a given copy, it is irreversible for that copy, so the ordinary GNU General Public License applies to all subsequent copies and derivative works made from that copy. This option is useful when you wish to copy part of the code of the Library into a program that is not a library. 4. You may copy and distribute the Library (or a portion or derivative of it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you 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. If distribution of 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 satisfies the requirement to distribute the source code, even though third parties are not compelled to copy the source along with the object code. 5. A program that contains no derivative of any portion of the Library, but is designed to work with the Library by being compiled or linked with it, is called a "work that uses the Library". Such a work, in isolation, is not a derivative work of the Library, and therefore falls outside the scope of this License. However, linking a "work that uses the Library" with the Library creates an executable that is a derivative of the Library (because it contains portions of the Library), rather than a "work that uses the library". The executable is therefore covered by this License. Section 6 states terms for distribution of such executables. When a "work that uses the Library" uses material from a header file that is part of the Library, the object code for the work may be a derivative work of the Library even though the source code is not. Whether this is true is especially significant if the work can be linked without the Library, or if the work is itself a library. The threshold for this to be true is not precisely defined by law. If such an object file uses only numerical parameters, data structure layouts and accessors, and small macros and small inline functions (ten lines or less in length), then the use of the object file is unrestricted, regardless of whether it is legally a derivative work. (Executables containing this object code plus portions of the Library will still fall under Section 6.) Otherwise, if the work is a derivative of the Library, you may distribute the object code for the work under the terms of Section 6. Any executables containing that work also fall under Section 6, whether or not they are linked directly with the Library itself. 6. As an exception to the Sections above, you may also combine or link a "work that uses the Library" with the Library to produce a work containing portions of the Library, and distribute that work under terms of your choice, provided that the terms permit modification of the work for the customer's own use and reverse engineering for debugging such modifications. You must give prominent notice with each copy of the work that the Library is used in it and that the Library and its use are covered by this License. You must supply a copy of this License. If the work during execution displays copyright notices, you must include the copyright notice for the Library among them, as well as a reference directing the user to the copy of this License. Also, you must do one of these things: a) Accompany the work with the complete corresponding machine-readable source code for the Library including whatever changes were used in the work (which must be distributed under Sections 1 and 2 above); and, if the work is an executable linked with the Library, with the complete machine-readable "work that uses the Library", as object code and/or source code, so that the user can modify the Library and then relink to produce a modified executable containing the modified Library. (It is understood that the user who changes the contents of definitions files in the Library will not necessarily be able to recompile the application to use the modified definitions.) b) Use a suitable shared library mechanism for linking with the Library. A suitable mechanism is one that (1) uses at run time a copy of the library already present on the user's computer system, rather than copying library functions into the executable, and (2) will operate properly with a modified version of the library, if the user installs one, as long as the modified version is interface-compatible with the version that the work was made with. c) Accompany the work with a written offer, valid for at least three years, to give the same user the materials specified in Subsection 6a, above, for a charge no more than the cost of performing this distribution. d) If distribution of the work is made by offering access to copy from a designated place, offer equivalent access to copy the above specified materials from the same place. e) Verify that the user has already received a copy of these materials or that you have already sent this user a copy. For an executable, the required form of the "work that uses the Library" must include any data and utility programs needed for reproducing the executable from it. However, as a special exception, the materials to be 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. It may happen that this requirement contradicts the license restrictions of other proprietary libraries that do not normally accompany the operating system. Such a contradiction means you cannot use both them and the Library together in an executable that you distribute. 7. You may place library facilities that are a work based on the Library side-by-side in a single library together with other library facilities not covered by this License, and distribute such a combined library, provided that the separate distribution of the work based on the Library and of the other library facilities is otherwise permitted, and provided that you do these two things: a) Accompany the combined library with a copy of the same work based on the Library, uncombined with any other library facilities. This must be distributed under the terms of the Sections above. b) Give prominent notice with the combined library of the fact that part of it is a work based on the Library, and explaining where to find the accompanying uncombined form of the same work. 8. You may not copy, modify, sublicense, link with, or distribute the Library except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense, link with, or distribute the Library 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. 9. 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 Library or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Library (or any work based on the Library), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Library or works based on it. 10. Each time you redistribute the Library (or any work based on the Library), the recipient automatically receives a license from the original licensor to copy, distribute, link with or modify the Library 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 with this License. 11. 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 Library at all. For example, if a patent license would not permit royalty-free redistribution of the Library 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 Library. 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. 12. If the distribution and/or use of the Library is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Library 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. 13. The Free Software Foundation may publish revised and/or new versions of the Lesser 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 Library 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 Library does not specify a license version number, you may choose any version ever published by the Free Software Foundation. 14. If you wish to incorporate parts of the Library into other free programs whose distribution conditions are incompatible with these, 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 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE LIBRARY "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 LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 16. 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 LIBRARY 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 LIBRARY (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 LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. END OF TERMS AND CONDITIONS How to Apply These Terms to Your New Libraries If you develop a new library, and you want it to be of the greatest possible use to the public, we recommend making it free software that everyone can redistribute and change. You can do so by permitting redistribution under these terms (or, alternatively, under the terms of the ordinary General Public License). To apply these terms, attach the following notices to the library. 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) This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Also add information on how to contact you by electronic and paper mail. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the library, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the library `Frob' (a library for tweaking knobs) written by James Random Hacker. , 1 April 1990 Ty Coon, President of Vice That's all there is to it! res-4.0.3/INSTALL.txt0000644000000000000000000000155412156113044012306 0ustar 00000000000000(* OASIS_START *) (* DO NOT EDIT (digest: 42a41286558bc494a3150973a0536e6b) *) This is the INSTALL file for the res distribution. This package uses OASIS to generate its build system. See section OASIS for full information. Dependencies ============ In order to compile this package, you will need: * ocaml (>= 3.12) for all, doc API * findlib (>= 1.3.1) Installing ========== 1. Uncompress the source archive and go to the root of the package 2. Run 'ocaml setup.ml -configure' 3. Run 'ocaml setup.ml -build' 4. Run 'ocaml setup.ml -install' Uninstalling ============ 1. Go to the root of the package 2. Run 'ocaml setup.ml -uninstall' OASIS ===== OASIS is a program that generates a setup.ml file using a simple '_oasis' configuration file. The generated setup only depends on the standard OCaml installation: no additional library is required. (* OASIS_STOP *) res-4.0.3/Makefile0000644000000000000000000000127612156113044012100 0ustar 00000000000000# OASIS_START # DO NOT EDIT (digest: bc1e05bfc8b39b664f29dae8dbd3ebbb) SETUP = ocaml setup.ml build: setup.data $(SETUP) -build $(BUILDFLAGS) doc: setup.data build $(SETUP) -doc $(DOCFLAGS) test: setup.data build $(SETUP) -test $(TESTFLAGS) all: $(SETUP) -all $(ALLFLAGS) install: setup.data $(SETUP) -install $(INSTALLFLAGS) uninstall: setup.data $(SETUP) -uninstall $(UNINSTALLFLAGS) reinstall: setup.data $(SETUP) -reinstall $(REINSTALLFLAGS) clean: $(SETUP) -clean $(CLEANFLAGS) distclean: $(SETUP) -distclean $(DISTCLEANFLAGS) setup.data: $(SETUP) -configure $(CONFIGUREFLAGS) .PHONY: build doc test all install uninstall reinstall clean distclean configure # OASIS_STOP res-4.0.3/README.md0000644000000000000000000001564712156113044011726 0ustar 00000000000000RES - Automatically Resizing Contiguous Memory for OCaml ======================================================== --------------------------------------------------------------------------- What is RES? ------------ This OCaml-library consists of a set of modules which implement automatically resizing (= reallocating) data structures that consume a contiguous part of memory. This allows appending and removing of elements to/from arrays (both boxed and unboxed), strings (buffers), bit strings and weak arrays while still maintaining fast constant-time access to elements. There are also functors that allow the generation of similar modules which use different reallocation strategies. Features -------- * Fast constant-time access to indexed elements (e.g. in arrays and strings) is often a prerequisite for short execution times of programs. Still, operations like adding and/or removing elements to/from the end of such data structures are often needed. Unfortunately, having both properties at the same time sometimes requires reallocating this contiguous part of memory. This module does not eliminate this problem, but hides the process of reallocation from the user, i.e. it happens automatically. Thus, the user is liberated from this bug-attracting (e.g. index errors) task. * This library allows the user to parameterize allocation strategies at runtime. This is an important feature, because it is impossible for any allocation algorithm to perform optimally without having knowledge about the user program. For example, the programmer might know that a consecutive series of operations will alternately add and remove large batches of elements. In such a case it would be wise to keep a high reserve of available slots in the data structure, because otherwise it will resize very often during this procedure which requires a significant amount of time. By raising a corresponding threshold in appropriate places at runtime, programmers can fine-tune the behavior of e.g. their buffers for optimal performance and set this parameter back later to save memory. * Because optimal reallocation strategies may be quite complex, it was also a design goal to have users supply their own ones (if required). By using functors users can parameterize these data structures with their own reallocation strategies, giving them even more control over how and when reallocations are triggered. * Users may want to add support for additional low-level implementations that require reallocations. In this case, too, it is fairly easy to create new modules by using functors. * The library implements a large interface of functions, all of which are completely independent of the reallocation strategy and the low-level implementation. All the interfaces of the corresponding low-level implementations of data structures (e.g. array, string) are fully supported and have been extended with further functionality. There is even a new buffer module which can be used in every context of the standard one. * OCaml makes a distinction between unboxed and boxed arrays. If the type of an array is `float`, the representation will be unboxed in cases in which the array is not used in a polymorphic context (native code only). To benefit from these much faster representations there are specialized versions of automatically resizing arrays in the distribution. Usage ----- The API is fully documented and can be built as HTML using `make doc`. It is also available [online](http://mmottl.bitbucket.org/projects/res/api/). The preparameterized modules (default strategy) and the functors for mapping strategy-implementations to this kind of modules are contained and documented in file `lib/res.mli`. For examples of how to use the functors to implement new strategies and/or low-level representations, take a look at the implementation in `lib/res.ml`. Their function interface, however, is documented in files `lib/pres_intf.ml` (for parameterized "low-level" types like e.g. normal arrays) and in `lib/nopres_intf.ml` (for non-parameterized "low-level" types like e.g. float arrays, strings (buffers), etc.). ### Convenience It should be noted that it is possible to use the standard notation for accessing elements (e.g. `ar.(42)`) with resizable arrays (and even with `Buffer`, `Bits`, etc...). This requires a short explanation of how OCaml treats such syntactic sugar: All that OCaml does is that it replaces such syntax with an appropriate `Array.get` or `Array.set`. This may be _any_ module that happens to be bound to this name in the current scope. The same principle is true for the `String`-module and the `.[]`-operator. Thus, the following works: :::ocaml module Array = Res.Bits module String = Res.Buffer let () = let ar = Array.empty () in Array.add_one ar true; print_endline (string_of_bool ar.(0)); let str = String.empty () in String.add_one str 'x'; print_char str.[0]; print_newline () Do not forget that it is even possible to bind modules locally. Example: :::ocaml let () = let module Array = Res.Array in Printf.printf "%d\n" (Array.init 10 (fun x -> x * x)).(7) If you want to change one of your files to make use of resizable arrays instead of standard ones without much trouble, please read the following: You may want to "save" the standard `Array`-module and its type for later access: :::ocaml module StdArray = Array type 'a std_array = 'a array Make the resizable implementation (includes the index operators!) available: :::ocaml open Res Or more explicitly: :::ocaml module Array = Res.Array Or if you want to use a specific `Array`-implementation: :::ocaml module Array = Res.Bits Then set the type: :::ocaml type 'a array = 'a Array.t If you create standard arrays with the built-in syntax, change lines like: :::ocaml let ar = [| 1; 2; 3; 4 |] in to: :::ocaml let ar = Array.of_array [| 1; 2; 3; 4 |] in This should allow all of your sources to compile out-of-the-box with the additional functionality. In places where you still need the standard implementation you should have no problems to use the rebound module and type to do so. This trick works similarly for the old and the new Buffer-module. You might also want to replace the `String`-module in this fashion. The latter one, however, supports a number of functions like e.g. `escape`, which are not available then. --------------------------------------------------------------------------- Contact Information and Contributing ------------------------------------ In the case of bugs, feature requests, contributions and similar, you can contact me here: Up-to-date information should be available at: Enjoy! Markus Mottl in Rutherford, NJ on July 10, 2012 res-4.0.3/TODO.md0000644000000000000000000000034712156113044011525 0ustar 00000000000000 * Improve speed of resizable float arrays by implementing a fast creation function that does not initialize the memory. * Extend the functionality of bit-vectors with efficient functions for e.g. "land", "lor", etc... res-4.0.3/_oasis0000644000000000000000000000424012156113044011632 0ustar 00000000000000OASISFormat: 0.3 Name: res Version: 4.0.3 Synopsis: RES - Library for resizable, contiguous datastructures. Description: RES is a library containing resizable arrays, strings, and bitvectors. Authors: Markus Mottl Copyrights: (C) 1999-2012 Markus Mottl Maintainers: Markus Mottl LicenseFile: COPYING.txt License: LGPL-2.1+ with OCaml linking exception OCamlVersion: >= 3.12 FindlibVersion: >= 1.3.1 Homepage: https://bitbucket.org/mmottl/res #Categories: #FilesAB: Plugins: META (0.3), StdFiles (0.3), DevFiles (0.3) XStdFilesREADME: false BuildTools: ocamldoc, ocamlbuild Library res Path: lib FindlibName: res Modules: Nopres_impl, Nopres_intf, Pres_impl, Pres_intf, Res, Strat, Weak_impl, Weak_intf # Examples Flag examples Description: Build examples Default: true Executable buffer_ex Path: examples MainIs: buffer_ex.ml Build$: flag(examples) BuildDepends: res Install: false CompiledObject: best Executable defstrat Path: examples MainIs: defstrat.ml Build$: flag(examples) BuildDepends: res Install: false CompiledObject: best Executable stupid_ga Path: examples MainIs: stupid_ga.ml Build$: flag(examples) BuildDepends: res Install: false CompiledObject: best Executable weak_ex Path: examples MainIs: weak_ex.ml Build$: flag(examples) BuildDepends: res Install: false CompiledObject: best # Document API Title: API reference for RES Type: OCamlbuild (0.3) InstallDir: $docdir/api XOCamlbuildPath: . XOCamlbuildLibraries: res SourceRepository trunk Type: hg Location: ssh://hg@bitbucket.org/mmottl/res Browser: https://bitbucket.org/mmottl/res Tag: release-$(pkg_version) res-4.0.3/_tags0000644000000000000000000000150512156113044011453 0ustar 00000000000000# OASIS_START # DO NOT EDIT (digest: 6be96645fdcc7ac3cbe71a3ad5893afc) # Ignore VCS directories, you can use the same kind of rule outside # OASIS_START/STOP if you want to exclude directories that contains # useless stuff for the build process <**/.svn>: -traverse <**/.svn>: not_hygienic ".bzr": -traverse ".bzr": not_hygienic ".hg": -traverse ".hg": not_hygienic ".git": -traverse ".git": not_hygienic "_darcs": -traverse "_darcs": not_hygienic # Library res "lib/res.cmxs": use_res # Executable buffer_ex : use_res # Executable defstrat : use_res # Executable stupid_ga : use_res # Executable weak_ex : use_res : use_res # OASIS_STOP <**/*.ml{,i}>: warn_A, warn_e, warn_r, annot res-4.0.3/configure0000755000000000000000000000055412156113044012345 0ustar 00000000000000#!/bin/sh # OASIS_START # DO NOT EDIT (digest: 425187ed8bfdbdd207fd76392dd243a7) set -e FST=true for i in "$@"; do if $FST; then set -- FST=false fi case $i in --*=*) ARG=${i%%=*} VAL=${i##*=} set -- "$@" "$ARG" "$VAL" ;; *) set -- "$@" "$i" ;; esac done ocaml setup.ml -configure "$@" # OASIS_STOP res-4.0.3/examples/buffer_ex.ml0000644000000000000000000000053012156113044014545 0ustar 00000000000000(* Reads a file given as first argument into a buffer and prints it out again. Uses an exponentially growing read-ahead during reading (just for demonstration). *) let _ = let buf = Res.Buffer.empty () and file = open_in Sys.argv.(1) in Res.Buffer.add_full_channel_f buf file 50000 (( * ) 2); Res.Buffer.output_buffer stdout buf res-4.0.3/examples/defstrat.ml0000644000000000000000000000057612156113044014426 0ustar 00000000000000(* Demonstration of the default reallocation strategy in action *) open Res.Array let info v r = Printf.printf "virtual length: %3d real length: %3d\n" v r let _ = let ar = empty () in for _i = 1 to 100 do info (length ar) (real_length ar); add_one ar 42 done; for _i = 1 to 20 do info (length ar) (real_length ar); remove_n ar 5 done; info (length ar) (real_length ar) res-4.0.3/examples/stupid_ga.ml0000644000000000000000000000605712156113044014571 0ustar 00000000000000(* You want to write a GA in less than 100 lines using bit-vectors? Here you go... (brain-dead implementation) *) module type GA_SPEC = sig val ngenes : int (* Number of genes *) val mut_prob : int (* Mutation probability in % *) val recomb_prob : int (* Recombination probability *) val evaluate_indiv : Res.Bits.t -> float (* Evaluate Individual *) end module Ga (Spec : GA_SPEC) = struct open Spec module Genes = Res.Bits type genes = Genes.t type indiv = {mutable genes : genes; mutable fitness : float option} type population = indiv array let random_bit () = Random.int 2 > 0 let create_indiv () = {genes = Genes.init ngenes (fun _ -> random_bit ()); fitness = None} let print_indiv ch indiv = let print_genes ch = Genes.iter (fun g -> output_char ch (if g then '1' else '0')) and fitness = match indiv.fitness with None -> "N/A" | Some f -> string_of_float f in Printf.fprintf ch "%a -> (%s)" print_genes indiv.genes fitness let mutate_indiv indiv = let mutate_gene i _gene = if Random.int 100 < mut_prob then Genes.set indiv.genes i (if Genes.get indiv.genes i then false else true) in Genes.iteri mutate_gene indiv.genes; indiv.fitness <- None let evaluate_indiv indiv = match indiv.fitness with | Some x -> x | None -> let x = Spec.evaluate_indiv indiv.genes in indiv.fitness <- Some x; x let create_pop size = Array.init size (fun _ -> create_indiv ()) let mutate_pop = Array.iter mutate_indiv let recombine_indiv i1 i2 c = Genes.blit i2.genes c i1.genes c (ngenes - c); i1.fitness <- None let evaluate_pop pop = Array.fold_left (fun acc indiv -> if evaluate_indiv indiv < evaluate_indiv acc then indiv else acc) pop.(0) pop let recombine_pop p = let len = Array.length p in let recombine i indiv = if i + 1 < len && Random.int 100 < recomb_prob then let mate = i + Random.int (len - i - 1) + 1 in recombine_indiv indiv p.(mate) (Random.int ngenes) in Array.iteri recombine p let select_pop p = let compare a b = match a.fitness, b.fitness with | Some af, Some bf -> af >= bf | _ -> failwith "select_pop: unevaluated individual!" in Sort.array compare p; for i = 0 to Array.length p / 2 do p.(i) <- create_indiv () done; end module MyGA_Spec = struct let ngenes = 20 let mut_prob = 3 let recomb_prob = 70 (* Tries to evolve binary representation of 42 - cool! *) let evaluate_indiv genes = let sum = ref 0 in Res.Bits.iter (fun g -> sum := (!sum lsl 1) + (if g then 1 else 0)) genes; let res = float !sum -. float 42 in res *. res end module MyGA = Ga(MyGA_Spec) open MyGA let _ = Random.self_init (); let p = create_pop 100 in let best = ref p.(0) in while best := evaluate_pop p; !best.fitness <> Some 0.0 do Printf.printf "best so far: %a\n" print_indiv !best; flush stdout; select_pop p; recombine_pop p; mutate_pop p done; Printf.printf "The winner is: %a\n" print_indiv !best res-4.0.3/examples/weak_ex.ml0000644000000000000000000000076712156113044014237 0ustar 00000000000000(* Demonstrates the correct behaviour of resizable weak arrays. *) module W = Res.Weak module Array = W (* allows more convenient array access *) class foo = object end let ra = W.empty () let _ = W.add_one ra (Some (new foo)); match ra.(0) with | Some _ -> print_endline "Correctly allocated!" | _ -> print_endline "Already deallocated??" let _ = Gc.full_major (); match ra.(0) with | Some _ -> print_endline "Still not deallocated?" | _ -> print_endline "Correctly deallocated!" res-4.0.3/lib/META0000644000000000000000000000050312156113044011647 0ustar 00000000000000# OASIS_START # DO NOT EDIT (digest: 379716d6505aea6c1aee51b24b020eb8) version = "4.0.3" description = "RES - Library for resizable, contiguous datastructures." archive(byte) = "res.cma" archive(byte, plugin) = "res.cma" archive(native) = "res.cmxa" archive(native, plugin) = "res.cmxs" exists_if = "res.cma" # OASIS_STOP res-4.0.3/lib/nopres_impl.ml0000644000000000000000000002477612156113044014101 0ustar 00000000000000(* RES - Automatically Resizing Contiguous Memory for OCaml Copyright (C) 1999- Markus Mottl email: markus.mottl@gmail.com WWW: http://www.ocaml.info This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA *) module type Implementation = sig type el type t val name : string val length : t -> int val create : int -> t val make : int -> el -> t val unsafe_get : t -> int -> el val unsafe_set : t -> int -> el -> unit val unsafe_blit : t -> int -> t -> int -> int -> unit end module Make (S : Strat.T) (Impl : Implementation) = struct module Strategy = S type strategy = Strategy.t type el = Impl.el type t = { mutable ar : Impl.t; mutable vlix : int; mutable strategy : strategy } let name = Impl.name let invalid_arg str = invalid_arg (name ^ "." ^ str) let failwith str = failwith (name ^ "." ^ str) let length ra = ra.vlix + 1 let lix ra = ra.vlix let real_length ra = Impl.length ra.ar let real_lix ra = real_length ra - 1 let unsafe_get ra ix = Impl.unsafe_get ra.ar ix let unsafe_set ra ix el = Impl.unsafe_set ra.ar ix el let get ra n = if n > ra.vlix || n < 0 then invalid_arg "get" else unsafe_get ra n let set ra n el = if n > ra.vlix || n < 0 then invalid_arg "set" else unsafe_set ra n el let creator = Impl.create let empty_ar = Impl.create 0 let screate strategy n = let res = { ar = empty_ar; vlix = n - 1; strategy = strategy } in res.ar <- creator (Strategy.grow strategy n); res let smake strategy n x = let res = { ar = empty_ar; vlix = n - 1; strategy = strategy } in res.ar <- Impl.make (Strategy.grow strategy n) x; res let create_fresh n = screate Strategy.default n let create_from ra = { ar = creator (length ra); vlix = ra.vlix; strategy = ra.strategy } let sempty strategy = let res = { ar = empty_ar; vlix = -1; strategy = strategy } in res.ar <- creator (Strategy.grow strategy 0); res let empty () = sempty Strategy.default let create = screate Strategy.default let make = smake Strategy.default let sinit strategy n f = let res = smake strategy n (f 0) in let ar = res.ar in for i = 1 to n - 1 do Impl.unsafe_set ar i (f i) done; res let init n f = sinit Strategy.default n f let get_strategy ra = ra.strategy let resizer some_lix ({ ar = ar} as ra) len = let new_ar = creator len in for i = 0 to some_lix do Impl.unsafe_set new_ar i (Impl.unsafe_get ar i) done; ra.ar <- new_ar let enforce_strategy ra = let real_len = real_length ra in let new_len = length ra in let new_real_len = Strategy.shrink ra.strategy ~real_len ~new_len in if new_real_len <> -1 then resizer ra.vlix ra new_real_len let set_strategy ra strategy = ra.strategy <- strategy; enforce_strategy ra let put_strategy ra strategy = ra.strategy <- strategy let unsafe_blit_on_other ra1 ofs1 ra2 = Impl.unsafe_blit ra1.ar ofs1 ra2.ar let copy ra = let len = length ra in let ar = Impl.create len in Impl.unsafe_blit ra.ar 0 ar 0 len; { ra with ar = ar } let append ra1 ra2 = match ra1.vlix, ra2.vlix with | -1, -1 -> empty () | _, -1 -> copy ra1 | -1, _ -> copy ra2 | _ -> let len1 = length ra1 in let len2 = length ra2 in let res = create_fresh (len1 + len2) in unsafe_blit_on_other ra1 0 res 0 len1; unsafe_blit_on_other ra2 0 res len1 len2; res let rec concat_aux res offset = function | [] -> res | h::t -> if h.vlix < 0 then concat_aux res offset t else let len = length h in unsafe_blit_on_other h 0 res offset len; concat_aux res (offset + len) t let concat l = let len = List.fold_left (fun a el -> a + length el) 0 l in if len = 0 then empty () else concat_aux (create_fresh len) 0 l let unsafe_sub ra ofs len = let res = create_fresh len in unsafe_blit_on_other ra ofs res 0 len; res let sub ra ofs len = if ofs < 0 || len < 0 || ofs + len > length ra then invalid_arg "sub" else unsafe_sub ra ofs len let guarantee_ix ra ix = if real_lix ra < ix then resizer ra.vlix ra (Strategy.grow ra.strategy (ix + 1)) let maybe_grow_ix ra new_lix = guarantee_ix ra new_lix; ra.vlix <- new_lix let add_one ra x = let n = length ra in maybe_grow_ix ra n; unsafe_set ra n x let unsafe_remove_one ra = ra.vlix <- ra.vlix - 1; enforce_strategy ra let remove_one ra = if ra.vlix < 0 then failwith "remove_one" else unsafe_remove_one ra let unsafe_remove_n ra n = ra.vlix <- ra.vlix - n; enforce_strategy ra let remove_n ra n = if n > length ra || n < 0 then invalid_arg "remove_n" else unsafe_remove_n ra n let unsafe_remove_range ra ofs len = unsafe_blit_on_other ra (ofs + len) ra ofs (length ra - len); unsafe_remove_n ra len let remove_range ra ofs len = if ofs < 0 || len < 0 || ofs + len > length ra then invalid_arg "remove_range" else unsafe_remove_range ra ofs len let clear ra = ra.vlix <- -1; enforce_strategy ra let unsafe_swap { ar = ar } n m = let tmp = Impl.unsafe_get ar n in Impl.unsafe_set ar n (Impl.unsafe_get ar m); Impl.unsafe_set ar m tmp let swap ra n m = if n > ra.vlix || m > ra.vlix || n < 0 || m < 0 then invalid_arg "swap" else unsafe_swap ra n m let unsafe_swap_in_last ({ ar = ar } as ra) n = Impl.unsafe_set ar n (Impl.unsafe_get ar ra.vlix); unsafe_remove_one ra let swap_in_last ra n = if n > ra.vlix || n < 0 then invalid_arg "swap_in_last" else unsafe_swap_in_last ra n let unsafe_fill ({ ar = ar } as ra) ofs len x = let last = ofs + len - 1 in maybe_grow_ix ra (max last ra.vlix); for i = ofs to last do Impl.unsafe_set ar i x done let fill ra ofs len x = if ofs < 0 || len < 0 || ofs > length ra then invalid_arg "fill" else unsafe_fill ra ofs len x let unsafe_blit ra1 ofs1 ra2 ofs2 len = guarantee_ix ra2 (ofs2 + len - 1); unsafe_blit_on_other ra1 ofs1 ra2 ofs2 len let blit ra1 ofs1 ra2 ofs2 len = if len < 0 || ofs1 < 0 || ofs2 < 0 || ofs1 + len > length ra1 || ofs2 > length ra2 then invalid_arg "blit" else unsafe_blit ra1 ofs1 ra2 ofs2 len let rec to_list_aux ar i accu = if i < 0 then accu else to_list_aux ar (i - 1) (Impl.unsafe_get ar i :: accu) let to_list ra = to_list_aux ra.ar ra.vlix [] let rec of_list_aux ar i = function | [] -> () | h::t -> Impl.unsafe_set ar i h; of_list_aux ar (i + 1) t let of_list l = let ra = create_fresh (List.length l) in of_list_aux ra.ar 0 l; ra let sof_list strategy l = let ra = screate strategy (List.length l) in of_list_aux ra.ar 0 l; ra let to_array ({ ar = ar } as ra) = Array.init (length ra) (fun i -> Impl.unsafe_get ar i) let sof_array strategy ar = sinit strategy (Array.length ar) (fun i -> Array.unsafe_get ar i) let of_array ar = sof_array Strategy.default ar let iter f ({ ar = ar } as ra) = for i = 0 to ra.vlix do f (Impl.unsafe_get ar i) done let map f ({ ar = ar } as ra) = let res = create_from ra in let res_ar = res.ar in for i = 0 to res.vlix do Impl.unsafe_set res_ar i (f (Impl.unsafe_get ar i)) done; res let iteri f ({ ar = ar } as ra) = for i = 0 to ra.vlix do f i (Impl.unsafe_get ar i) done let mapi f ({ ar = ar } as ra) = let { ar = res_ar } as res = create_from ra in for i = 0 to res.vlix do Impl.unsafe_set res_ar i (f i (Impl.unsafe_get ar i)) done; res let fold_left f accu ({ ar = ar } as ra) = let res = ref accu in for i = 0 to ra.vlix do res := f !res (Impl.unsafe_get ar i) done; !res let fold_right f ({ ar = ar } as ra) accu = let res = ref accu in for i = ra.vlix downto 0 do res := f (Impl.unsafe_get ar i) !res done; !res let rec for_all_aux i p ra = i > ra.vlix || p (unsafe_get ra i) && for_all_aux (i + 1) p ra let for_all p ra = for_all_aux 0 p ra let rec exists_aux i p ra = i <= ra.vlix && (p (unsafe_get ra i) || exists_aux (i + 1) p ra) let exists p ra = exists_aux 0 p ra let rec mem_aux i x ra = i <= ra.vlix && (unsafe_get ra i = x || mem_aux (i + 1) x ra) let mem x ra = mem_aux 0 x ra let rec memq_aux i x ra = i <= ra.vlix && (unsafe_get ra i == x || memq_aux (i + 1) x ra) let memq x ra = memq_aux 0 x ra let rec pos_aux i x ra = if i > ra.vlix then None else if unsafe_get ra i = x then Some i else pos_aux (i + 1) x ra let pos x ra = pos_aux 0 x ra let rec posq_aux i x ra = if i > ra.vlix then None else if unsafe_get ra i == x then Some i else posq_aux (i + 1) x ra let posq x ra = posq_aux 0 x ra let rec find_aux i p ra = if i > ra.vlix then raise Not_found else let el = unsafe_get ra i in if p el then el else find_aux (i + 1) p ra let find p ra = find_aux 0 p ra let rec find_index_aux p ra i = if i > ra.vlix then raise Not_found else if p (unsafe_get ra i) then i else find_index_aux p ra (i + 1) let find_index p ra i = if i < 0 then invalid_arg "find_index" else find_index_aux p ra i let filter p ({ ar = ar } as ra) = let res = sempty ra.strategy in for i = 0 to ra.vlix do let el = Impl.unsafe_get ar i in if p el then add_one res el done; res let find_all = filter let filter_in_place p ({ ar = ar } as ra) = let dest = ref 0 in let pos = ref 0 in while !pos <= ra.vlix do let el = Impl.unsafe_get ar !pos in if p el then begin Impl.unsafe_set ar !dest el; incr dest end; incr pos done; unsafe_remove_n ra (!pos - !dest) let partition p ra = let res1, res2 as res = sempty ra.strategy, sempty ra.strategy in for i = 0 to ra.vlix do let el = unsafe_get ra i in if p el then add_one res1 el else add_one res2 el done; res end res-4.0.3/lib/nopres_intf.ml0000644000000000000000000003375712156113044014077 0ustar 00000000000000(* RES - Automatically Resizing Contiguous Memory for OCaml Copyright (C) 1999-2002 Markus Mottl email: markus.mottl@gmail.com WWW: http://www.ocaml.info This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA *) (** Interfaces to unparameterized resizable arrays and buffers *) (** Interface to unparameterized resizable arrays *) module type T = sig (** {6 Signatures and types} *) (** Module implementing the reallocation strategy *) module Strategy : Strat.T type strategy = Strategy.t (** Type of reallocation strategy *) type t (** Type of resizable arrays *) type el (** Type of the elements in the resizable array *) (** {6 Index and length information} *) val length : t -> int (** [length ra] @return (virtual) length of resizable array [ra] excluding the reserved space. *) val lix : t -> int (** [lix ra] @return (virtual) last index of resizable array [ra] excluding the reserved space. *) val real_length : t -> int (** [real_length ra] @return (real) length of resizable array [ra] including the reserved space. *) val real_lix : t -> int (** [real_lix ra] @return (real) last index of resizable array [ra] including the reserved space. *) (** {6 Getting and setting} *) val get : t -> int -> el (** [get ra n] @return the [n]th element of [ra]. @raise Invalid_argument if index out of bounds. *) val set : t -> int -> el -> unit (** [set ra n] sets the [n]th element of [ra]. @raise Invalid_argument if index out of bounds. *) (** {6 Creation of resizable arrays} *) val sempty : strategy -> t (** [sempty s] @return an empty resizable array using strategy [s]. *) val empty : unit -> t (** [empty ()] same as [sempty] but uses default strategy. *) val screate : strategy -> int -> t (** [screate s n] @return a resizable array with strategy [s] containing [n] arbitrary elements. {e Attention: the contents is {b not} specified!} *) val create : int -> t (** [create n] same as [screate] but uses default strategy. *) val smake : strategy -> int -> el -> t (** [smake s n el] @return a resizable array of length [n] containing element [el] only using strategy [s]. *) val make : int -> el -> t (** [make n el] same as [smake] but uses default strategy. *) val sinit : strategy -> int -> (int -> el) -> t (** [sinit s n f] @return an array of length [n] containing elements that were created by applying function [f] to the index, using strategy [s]. *) val init : int -> (int -> el) -> t (** [init n f] sames as [sinit] but uses default strategy. *) (** {6 Strategy handling} *) val get_strategy : t -> strategy (** [get_strategy ra] @return the reallocation strategy used by resizable array [ra]. *) val set_strategy : t -> strategy -> unit (** [set_strategy ra s] sets the reallocation strategy of resizable array [ra] to [s], possibly causing an immediate reallocation. *) val put_strategy : t -> strategy -> unit (** [put_strategy ra s] sets the reallocation strategy of resizable array [ra] to [s]. Reallocation is only done at later changes in size. *) val enforce_strategy : t -> unit (** [enforce_strategy ra] forces a reallocation if necessary (e.g. after a [put_strategy]. *) (** {6 Copying, blitting and range extraction} *) val copy : t -> t (** [copy ra] @return a copy of resizable array [ra]. The two arrays share the same strategy! *) val sub : t -> int -> int -> t (** [sub ra ofs len] @return a resizable subarray of length [len] from resizable array [ra] starting at offset [ofs] using the default strategy. @raise Invalid_argument if parameters do not denote a correct subarray. *) val fill : t -> int -> int -> el -> unit (** [fill ra ofs len el] fills resizable array [ra] from offset [ofs] with [len] elements [el], possibly adding elements at the end. Raises [Invalid_argument] if offset [ofs] is larger than the length of the array. *) val blit : t -> int -> t -> int -> int -> unit (** [blit ra1 ofs1 ra2 ofs2 len] blits resizable array [ra1] onto [ra2] reading [len] elements from offset [ofs1] and writing them to [ofs2], possibly adding elements at the end of ra2. Raises [Invalid_argument] if [ofs1] and [len] do not designate a valid subarray of [ra1] or if [ofs2] is larger than the length of [ra2]. *) (** {6 Combining resizable arrays} *) val append : t -> t -> t (** [append ra1 ra2] @return a new resizable array using the default strategy and copying [ra1] and [ra2] in this order onto it. *) val concat : t list -> t (** [concat l] @return a new resizable array using the default strategy and copying all resizable arrays in [l] in their respective order onto it. *) (** {6 Adding and removing elements} *) val add_one : t -> el -> unit (** [add_one ra el] adds element [el] to resizable array [ra], possibly causing a reallocation. *) val remove_one : t -> unit (** [remove_one ra] removes the last element of resizable array [ra], possibly causing a reallocation. @raise Failure if the array is empty. *) val remove_n : t -> int -> unit (** [remove_n ra n] removes the last n elements of resizable array [ra], possibly causing a reallocation. @raise Invalid_arg if there are not enough elements or [n < 0]. *) val remove_range : t -> int -> int -> unit (** [remove_range ra ofs len] removes [len] elements from resizable array [ra] starting at [ofs] and possibly causing a reallocation. @raise Invalid_argument if range is invalid. *) val clear : t -> unit (** [clear ra] removes all elements from resizable array [ra], possibly causing a reallocation. *) (** {6 Swapping} *) val swap : t -> int -> int -> unit (** [swap ra n m] swaps elements at indices [n] and [m]. @raise Invalid_argument if any index is out of range. *) val swap_in_last : t -> int -> unit (** [swap_in_last ra n] swaps the last element with the one at position [n]. @raise Invalid_argument if index [n] is out of range. *) (** {6 Array conversions} *) val to_array : t -> el array (** [to_array ra] converts a resizable array to a standard one. *) val sof_array : strategy -> el array -> t (** [sof_array s ar] converts a standard array to a resizable one, using strategy [s]. *) val of_array : el array -> t (** [of_array ar] converts a standard array to a resizable one using the default strategy. *) (** {6 List conversions} *) val to_list : t -> el list (** [to_list ra] converts resizable array [ra] to a list. *) val sof_list : strategy -> el list -> t (** [sof_list s l] creates a resizable array using strategy [s] and the elements in list [l]. *) val of_list : el list -> t (** [of_list l] creates a resizable array using the default strategy and the elements in list [l]. *) (** {6 Iterators} *) val iter : (el -> unit) -> t -> unit (** [iter f ra] applies the unit-function [f] to each element in resizable array [ra]. *) val map : (el -> el) -> t -> t (** [map f ra] @return a resizable array using the strategy of [ra] and mapping each element in [ra] to its corresponding position in the new array using function [f]. *) val iteri : (int -> el -> unit) -> t -> unit (** [iteri f ra] applies the unit-function [f] to each index and element in resizable array [ra]. *) val mapi : (int -> el -> el) -> t -> t (** [mapi f ra] @return a resizable array using the strategy of [ra] and mapping each element in [ra] to its corresponding position in the new array using function [f] and the index position. *) val fold_left : ('a -> el -> 'a) -> 'a -> t -> 'a (** [fold_left f a ra] left-folds values in resizable array [ra] using function [f] and start accumulator [a]. *) val fold_right : (el -> 'a -> 'a) -> t -> 'a -> 'a (** [fold_right f a ra] right-folds values in resizable array [ra] using function [f] and start accumulator [a]. *) (** {6 Scanning of resizable arrays} *) val for_all : (el -> bool) -> t -> bool (** [for_all p ra] @return [true] if all elements in resizable array [ra] satisfy the predicate [p], [false] otherwise. *) val exists : (el -> bool) -> t -> bool (** [exists p ra] @return [true] if at least one element in resizable array [ra] satisfies the predicate [p], [false] otherwise. *) val mem : el -> t -> bool (** [mem el ra] @return [true] if element [el] is logically equal to any element in resizable array [ra], [false] otherwise. *) val memq : el -> t -> bool (** [memq el ra] @return [true] if element [el] is physically equal to any element in resizable array [ra], [false] otherwise. *) val pos : el -> t -> int option (** [pos el ra] @return [Some index] if [el] is logically equal to the element at [index] in [ra], [None] otherwise. [index] is the index of the first element that matches. *) val posq : el -> t -> int option (** [posq el ra] @return [Some index] if [el] is physically equal to the element at [index] in [ra], [None] otherwise. [index] is the index of the first element that matches. *) (** {6 Searching of resizable arrays} *) val find : (el -> bool) -> t -> el (** [find p ra] @return the first element in resizable array [ra] that satisfies predicate [p]. @raise Not_found if there is no such element. *) val find_index : (el -> bool) -> t -> int -> int (** [find_index p ra pos] @return the index of the first element that satisfies predicate [p] in resizable array [ra], starting search at index [pos]. @raise Not_found if there is no such element or if [pos] is larger than the highest index. @raise Invalid_argument if [pos] is negative. *) val filter : (el -> bool) -> t -> t (** [filter p ra] @return a new resizable array by filtering out all elements in [ra] that satisfy predicate [p] using the same strategy as [ra]. *) val find_all : (el -> bool) -> t -> t (** [find_all p ra] is the same as [filter] *) val filter_in_place : (el -> bool) -> t -> unit (** [filter_in_place p ra] as [filter], but filters in place. *) val partition : (el -> bool) -> t -> t * t (** [partition p ra] @return a pair of resizable arrays, the left part containing only elements of [ra] that satisfy predicate [p], the right one only those that do not satisfy it. Both returned arrays are created using the strategy of [ra]. *) (** {6 {b UNSAFE STUFF - USE WITH CAUTION!}} *) val unsafe_get : t -> int -> el val unsafe_set : t -> int -> el -> unit val unsafe_sub : t -> int -> int -> t val unsafe_fill : t -> int -> int -> el -> unit val unsafe_blit : t -> int -> t -> int -> int -> unit val unsafe_remove_one : t -> unit val unsafe_remove_n : t -> int -> unit val unsafe_swap : t -> int -> int -> unit val unsafe_swap_in_last : t -> int -> unit end (** Extended interface to buffers (resizable strings) *) module type Buffer = sig include T (** Includes all functions that exist in non-parameterized arrays. *) (** {6 String conversions} *) val sof_string : strategy -> string -> t (** [sof_string s ar] converts a string to a resizable buffer using strategy [s]. *) val of_string : string -> t (** [of_string ar] converts a string to a resizable buffer using the default strategy. *) (** {6 Functions found in the standard [Buffer]-module} *) (** Note that the function [create n] ignores the parameter [n] and uses the default strategy instead. You can supply a different strategy with [creates s n] as described above. *) val contents : t -> string (** [contents b] @return a copy of the current contents of the buffer [b]. *) val reset : t -> unit (** [reset b] just clears the buffer, possibly resizing it. *) val add_char : t -> char -> unit (** [add_char b c] appends the character [c] at the end of the buffer [b]. *) val add_string : t -> string -> unit (** [add_string b s] appends the string [s] at the end of the buffer [b]. *) val add_substring : t -> string -> int -> int -> unit (** [add_substring b s ofs len] takes [len] characters from offset [ofs] in string [s] and appends them at the end of the buffer [b]. *) val add_buffer : t -> t -> unit (** [add_buffer b1 b2] appends the current contents of buffer [b2] at the end of buffer [b1]. [b2] is not modified. *) val add_channel : t -> in_channel -> int -> unit (** [add_channel b ic n] reads exactly [n] character from the input channel [ic] and stores them at the end of buffer [b]. @raise End_of_file if the channel contains fewer than [n] characters. *) val output_buffer : out_channel -> t -> unit (** [output_buffer oc b] writes the current contents of buffer [b] on the output channel [oc]. *) (** {6 Additional buffer functions} *) val add_full_channel : t -> in_channel -> unit (* [add_full_channel b ic] reads the whole channel [ic] into buffer [b]. *) val add_full_channel_f : t -> in_channel -> int -> (int -> int) -> unit (* [add_full_channel_f b ic n f] reads the whole channel [ic] into buffer [b], starting with read-ahead [n] and using function [f] to calculate the next read-ahead if end-of-file was still not found. *) end res-4.0.3/lib/pres_impl.ml0000644000000000000000000002706212156113044013533 0ustar 00000000000000(* RES - Automatically Resizing Contiguous Memory for OCaml Copyright (C) 1999- Markus Mottl email: markus.mottl@gmail.com WWW: http://www.ocaml.info This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA *) module type Implementation = sig type 'a t val name : string val length : 'a t -> int val make : int -> 'a -> 'a t val unsafe_get : 'a t -> int -> 'a val unsafe_set : 'a t -> int -> 'a -> unit end module Make (S : Strat.T) (Impl : Implementation) = struct module Strategy = S type strategy = Strategy.t type 'a t = { mutable ar : 'a option Impl.t; mutable vlix : int; mutable strategy : strategy } let name = Impl.name let invalid_arg str = invalid_arg (name ^ "." ^ str) let failwith str = failwith (name ^ "." ^ str) let length ra = ra.vlix + 1 let lix ra = ra.vlix let real_length ra = Impl.length ra.ar let real_lix ra = real_length ra - 1 let unsafe_get_ar ar ix = match Impl.unsafe_get ar ix with | None -> failwith "unsafe_get_ar: element undefined - concurrent access?" | Some el -> el let unsafe_get ra ix = unsafe_get_ar ra.ar ix let unsafe_set_ar ar ix el = Impl.unsafe_set ar ix (Some el) let unsafe_set ra ix el = unsafe_set_ar ra.ar ix el let get ra n = if n > ra.vlix || n < 0 then invalid_arg "get" else unsafe_get ra n let set ra n el = if n > ra.vlix || n < 0 then invalid_arg "set" else unsafe_set ra n el let creator n = Impl.make n None let screate_fresh strategy n = let res = { ar = creator 0; vlix = n - 1; strategy = strategy } in res.ar <- creator (Strategy.grow strategy n); res let create_fresh n = screate_fresh Strategy.default n let create_from ra = { ar = creator (length ra); vlix = ra.vlix; strategy = ra.strategy } let sempty strategy = let res = { ar = creator 0; vlix = -1; strategy = strategy } in res.ar <- creator (Strategy.grow strategy 0); res let empty () = sempty Strategy.default let screate strategy n x = let res = screate_fresh strategy n in let res_ar = res.ar in let el = Some x in for i = 0 to n - 1 do Impl.unsafe_set res_ar i el done; res let smake = screate let create n = smake Strategy.default n let make = create let sinit strategy n f = let res = screate_fresh strategy n in let res_ar = res.ar in for i = 0 to n - 1 do unsafe_set_ar res_ar i (f i) done; res let init n f = sinit Strategy.default n f let to_array ({ ar = ar } as ra) = Array.init (length ra) (fun i -> unsafe_get_ar ar i) let sof_array strategy ar = sinit strategy (Array.length ar) (fun i -> Array.unsafe_get ar i) let of_array ar = sof_array Strategy.default ar let get_strategy ra = ra.strategy let resizer some_lix ra len = let ar = creator len in let old_ar = ra.ar in for i = 0 to some_lix do Impl.unsafe_set ar i (Impl.unsafe_get old_ar i) done; ra.ar <- ar let enforce_strategy ra = let real_len = real_length ra in let new_len = length ra in let new_real_len = Strategy.shrink ra.strategy ~real_len ~new_len in if new_real_len <> -1 then resizer ra.vlix ra new_real_len let set_strategy ra strategy = ra.strategy <- strategy; enforce_strategy ra let put_strategy ra strategy = ra.strategy <- strategy let make_matrix sx sy init = let res = create_fresh sx in let res_ar = res.ar in for i = 0 to res.vlix do unsafe_set_ar res_ar i (make sy init) done; res let copy ({ ar = ar } as ra) = let new_ar = Impl.make (real_length ra) (Impl.unsafe_get ar 0) in for i = 1 to real_lix ra do Impl.unsafe_set new_ar i (Impl.unsafe_get ar i) done; { ra with ar = new_ar } let unsafe_blit_on_other { ar = ar1 } ofs1 { ar = ar2 } ofs2 len = let ofs_diff = ofs2 - ofs1 in for i = ofs1 to ofs1 + len - 1 do Impl.unsafe_set ar2 (i + ofs_diff) (Impl.unsafe_get ar1 i) done let append ra1 ra2 = match ra1.vlix, ra2.vlix with | -1, -1 -> empty () | _, -1 -> copy ra1 | -1, _ -> copy ra2 | _ -> let len1 = length ra1 in let len2 = length ra2 in let res = create_fresh (len1 + len2) in unsafe_blit_on_other ra1 0 res 0 len1; unsafe_blit_on_other ra2 0 res len1 len2; res let rec concat_aux res offset = function | [] -> res | h::t -> if h.vlix < 0 then concat_aux res offset t else let len = length h in unsafe_blit_on_other h 0 res offset len; concat_aux res (offset + len) t let concat l = let len = List.fold_left (fun a el -> a + length el) 0 l in if len = 0 then empty () else concat_aux (create_fresh len) 0 l let unsafe_sub ra ofs len = let res = create_fresh len in unsafe_blit_on_other ra ofs res 0 len; res let sub ra ofs len = if ofs < 0 || len < 0 || ofs + len > length ra then invalid_arg "sub" else unsafe_sub ra ofs len let guarantee_ix ra ix = if real_lix ra < ix then resizer ra.vlix ra (Strategy.grow ra.strategy (ix + 1)) let maybe_grow_ix ra new_lix = guarantee_ix ra new_lix; ra.vlix <- new_lix let add_one ra x = let n = length ra in maybe_grow_ix ra n; unsafe_set ra n x let unsafe_remove_one ra = Impl.unsafe_set ra.ar ra.vlix None; ra.vlix <- ra.vlix - 1; enforce_strategy ra let remove_one ra = if ra.vlix < 0 then failwith "remove_one" else unsafe_remove_one ra let unsafe_remove_n ra n = let old_vlix = ra.vlix in let old_ar = ra.ar in ra.vlix <- old_vlix - n; enforce_strategy ra; if old_ar == ra.ar then for i = ra.vlix + 1 to old_vlix do Impl.unsafe_set old_ar i None done let remove_n ra n = if n > length ra || n < 0 then invalid_arg "remove_n" else unsafe_remove_n ra n let unsafe_remove_range ra ofs len = unsafe_blit_on_other ra (ofs + len) ra ofs (length ra - len); unsafe_remove_n ra len let remove_range ra ofs len = if ofs < 0 || len < 0 || ofs + len > length ra then invalid_arg "remove_range" else unsafe_remove_range ra ofs len let clear ra = unsafe_remove_n ra (length ra) let unsafe_swap ra n m = let tmp = unsafe_get ra n in unsafe_set ra n (unsafe_get ra m); unsafe_set ra m tmp let swap ra n m = if n > ra.vlix || m > ra.vlix || n < 0 || m < 0 then invalid_arg "swap" else unsafe_swap ra n m let unsafe_swap_in_last ({ ar = ar } as ra) n = Impl.unsafe_set ar n (Impl.unsafe_get ar ra.vlix); unsafe_remove_one ra let swap_in_last ra n = if n > ra.vlix || n < 0 then invalid_arg "swap_in_last" else unsafe_swap_in_last ra n let unsafe_fill ra ofs len x = let last = ofs + len - 1 in maybe_grow_ix ra (max last ra.vlix); let el = Some x in let ar = ra.ar in for i = ofs to last do Impl.unsafe_set ar i el done let fill ra ofs len x = if ofs < 0 || len < 0 || ofs > length ra then invalid_arg "fill" else unsafe_fill ra ofs len x let unsafe_blit { ar = ar1 } ofs1 ({ ar = ar2 } as ra2) ofs2 len = guarantee_ix ra2 (ofs2 + len - 1); if ofs1 < ofs2 then for i = len - 1 downto 0 do Impl.unsafe_set ar2 (ofs2 + i) (Impl.unsafe_get ar1 (ofs1 + i)) done else for i = 0 to len - 1 do Impl.unsafe_set ar2 (ofs2 + i) (Impl.unsafe_get ar1 (ofs1 + i)) done let blit ra1 ofs1 ra2 ofs2 len = if len < 0 || ofs1 < 0 || ofs2 < 0 || ofs1 + len > length ra1 || ofs2 > length ra2 then invalid_arg "blit" else unsafe_blit ra1 ofs1 ra2 ofs2 len let rec to_list_aux ar i accu = if i < 0 then accu else to_list_aux ar (i - 1) (unsafe_get_ar ar i :: accu) let to_list ra = to_list_aux ra.ar ra.vlix [] let rec of_list_aux res_ar i = function | [] -> () | h::t -> unsafe_set_ar res_ar i h; of_list_aux res_ar (i + 1) t let of_list l = let res = create_fresh (List.length l) in of_list_aux res.ar 0 l; res let sof_list s l = let res = screate_fresh s (List.length l) in of_list_aux res.ar 0 l; res let iter f ({ ar = ar } as ra) = for i = 0 to ra.vlix do f (unsafe_get_ar ar i) done let map f ({ ar = ar } as ra) = let { ar = res_ar } as res = create_from ra in for i = 0 to res.vlix do unsafe_set_ar res_ar i (f (unsafe_get_ar ar i)) done; res let iteri f ({ ar = ar } as ra) = for i = 0 to ra.vlix do f i (unsafe_get_ar ar i) done let mapi f ({ ar = ar } as ra) = let { ar = res_ar } as res = create_from ra in for i = 0 to res.vlix do unsafe_set_ar res_ar i (f i (unsafe_get_ar ar i)) done; res let fold_left f accu ({ ar = ar } as ra) = let res = ref accu in for i = 0 to ra.vlix do res := f !res (unsafe_get_ar ar i) done; !res let fold_right f ({ ar = ar } as ra) accu = let res = ref accu in for i = ra.vlix downto 0 do res := f (unsafe_get_ar ar i) !res done; !res let rec for_all_aux i p ra = i > ra.vlix || p (unsafe_get ra i) && for_all_aux (i + 1) p ra let for_all p ra = for_all_aux 0 p ra let rec exists_aux i p ra = i <= ra.vlix && (p (unsafe_get ra i) || exists_aux (i + 1) p ra) let exists p ra = exists_aux 0 p ra let rec mem_aux i x ra = i <= ra.vlix && (unsafe_get ra i = x || mem_aux (i + 1) x ra) let mem x ra = mem_aux 0 x ra let rec memq_aux i x ra = i <= ra.vlix && (unsafe_get ra i == x || memq_aux (i + 1) x ra) let memq x ra = memq_aux 0 x ra let rec pos_aux i x ra = if i > ra.vlix then None else if unsafe_get ra i = x then Some i else pos_aux (i + 1) x ra let pos x ra = pos_aux 0 x ra let rec posq_aux i x ra = if i > ra.vlix then None else if unsafe_get ra i == x then Some i else posq_aux (i + 1) x ra let posq x ra = posq_aux 0 x ra let rec find_aux i p ra = if i > ra.vlix then raise Not_found else let el = unsafe_get ra i in if p el then el else find_aux (i + 1) p ra let find p ra = find_aux 0 p ra let rec find_index_aux p ra i = if i > ra.vlix then raise Not_found else if p (unsafe_get ra i) then i else find_index_aux p ra (i + 1) let find_index p ra i = if i < 0 then invalid_arg "find_index" else find_index_aux p ra i let filter p ({ ar = ar } as ra) = let res = sempty ra.strategy in for i = 0 to ra.vlix do let el = unsafe_get_ar ar i in if p el then add_one res el done; res let find_all = filter let filter_in_place p ({ ar = ar } as ra) = let dest = ref 0 in let pos = ref 0 in while !pos <= ra.vlix do let el = unsafe_get_ar ar !pos in if p el then begin unsafe_set_ar ar !dest el; incr dest end; incr pos done; unsafe_remove_n ra (!pos - !dest) let partition p ({ ar = ar } as ra) = let res1, res2 as res = sempty ra.strategy, sempty ra.strategy in for i = 0 to ra.vlix do let el = unsafe_get_ar ar i in if p el then add_one res1 el else add_one res2 el done; res end res-4.0.3/lib/pres_intf.ml0000644000000000000000000002754712156113044013542 0ustar 00000000000000(* RES - Automatically Resizing Contiguous Memory for OCaml Copyright (C) 1999-2002 Markus Mottl email: markus.mottl@gmail.com WWW: http://www.ocaml.info This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA *) (** Interface to parameterized resizable arrays *) module type T = sig (** {6 Signatures and types} *) (** Module implementing the reallocation strategy *) module Strategy : Strat.T type strategy = Strategy.t (** Type of reallocation strategy *) type 'a t (** Type of parameterized resizable arrays *) (** {6 Index and length information} *) val length : 'a t -> int (** [length ra] @return (virtual) length of resizable array [ra] excluding the reserved space. *) val lix : 'a t -> int (** [lix ra] @return (virtual) last index of resizable array [ra] excluding the reserved space. *) val real_length : 'a t -> int (** [real_length ra] @return (real) length of resizable array [ra] including the reserved space. *) val real_lix : 'a t -> int (** [real_lix ra] @return (real) last index of resizable array [ra] including the reserved space. *) (** {6 Getting and setting} *) val get : 'a t -> int -> 'a (** [get ra n] @return the [n]th element of [ra]. @raise Invalid_argument if index out of bounds. *) val set : 'a t -> int -> 'a -> unit (** [set ra n] sets the [n]th element of [ra]. @raise Invalid_argument if index out of bounds. *) (** {6 Creation of resizable arrays} *) val sempty : strategy -> 'a t (** [sempty s] @return an empty resizable array using strategy [s]. *) val empty : unit -> 'a t (** [empty ()] same as [sempty] but uses default strategy. *) val screate : strategy -> int -> 'a -> 'a t (** [screate s n el] @return a resizable array of length [n] containing element [el] only using strategy [s]. *) val create : int -> 'a -> 'a t (** [create n el] same as [screate] but uses default strategy. *) val smake : strategy -> int -> 'a -> 'a t (** [smake s n el] same as [screate]. *) val make : int -> 'a -> 'a t (** [make n el] same as [create]. *) val sinit : strategy -> int -> (int -> 'a) -> 'a t (** [sinit s n f] @return an array of length [n] containing elements that were created by applying function [f] to the index, using strategy [s]. *) val init : int -> (int -> 'a) -> 'a t (** [init n f] sames as [sinit] but uses default strategy. *) (** {6 Strategy handling} *) val get_strategy : 'a t -> strategy (** [get_strategy ra] @return the reallocation strategy used by resizable array [ra]. *) val set_strategy : 'a t -> strategy -> unit (** [set_strategy ra s] sets the reallocation strategy of resizable array [ra] to [s], possibly causing an immediate reallocation. *) val put_strategy : 'a t -> strategy -> unit (** [put_strategy ra s] sets the reallocation strategy of resizable array [ra] to [s]. Reallocation is only done at later changes in size. *) val enforce_strategy : 'a t -> unit (** [enforce_strategy ra] forces a reallocation if necessary (e.g. after a [put_strategy]. *) (** {6 Matrix functions} *) val make_matrix : int -> int -> 'a -> 'a t t (** [make_matrix sx sy el] creates a (resizable) matrix of dimensions [sx] and [sy] containing element [el] only. Both dimensions are controlled by the default strategy. *) (** {6 Copying, blitting and range extraction} *) val copy : 'a t -> 'a t (** [copy ra] @return a copy of resizable array [ra]. The two arrays share the same strategy! *) val sub : 'a t -> int -> int -> 'a t (** [sub ra ofs len] @return a resizable subarray of length [len] from resizable array [ra] starting at offset [ofs] using the default strategy. @raise Invalid_argument if parameters do not denote a correct subarray. *) val fill : 'a t -> int -> int -> 'a -> unit (** [fill ra ofs len el] fills resizable array [ra] from offset [ofs] with [len] elements [el], possibly adding elements at the end. Raises [Invalid_argument] if offset [ofs] is larger than the length of the array. *) val blit : 'a t -> int -> 'a t -> int -> int -> unit (** [blit ra1 ofs1 ra2 ofs2 len] blits resizable array [ra1] onto [ra2] reading [len] elements from offset [ofs1] and writing them to [ofs2], possibly adding elements at the end of ra2. Raises [Invalid_argument] if [ofs1] and [len] do not designate a valid subarray of [ra1] or if [ofs2] is larger than the length of [ra2]. *) (** {6 Combining resizable arrays} *) val append : 'a t -> 'a t -> 'a t (** [append ra1 ra2] @return a new resizable array using the default strategy and copying [ra1] and [ra2] in this order onto it. *) val concat : 'a t list -> 'a t (** [concat l] @return a new resizable array using the default strategy and copying all resizable arrays in [l] in their respective order onto it. *) (** {6 Adding and removing elements} *) val add_one : 'a t -> 'a -> unit (** [add_one ra el] adds element [el] to resizable array [ra], possibly causing a reallocation. *) val remove_one : 'a t -> unit (** [remove_one ra] removes the last element of resizable array [ra], possibly causing a reallocation. @raise Failure if the array is empty. *) val remove_n : 'a t -> int -> unit (** [remove_n ra n] removes the last n elements of resizable array [ra], possibly causing a reallocation. @raise Invalid_arg if there are not enough elements or [n < 0]. *) val remove_range : 'a t -> int -> int -> unit (** [remove_range ra ofs len] removes [len] elements from resizable array [ra] starting at [ofs] and possibly causing a reallocation. @raise Invalid_argument if range is invalid. *) val clear : 'a t -> unit (** [clear ra] removes all elements from resizable array [ra], possibly causing a reallocation. *) (** {6 Swapping} *) val swap : 'a t -> int -> int -> unit (** [swap ra n m] swaps elements at indices [n] and [m]. @raise Invalid_argument if any index is out of range. *) val swap_in_last : 'a t -> int -> unit (** [swap_in_last ra n] swaps the last element with the one at position [n]. @raise Invalid_argument if index [n] is out of range. *) (** {6 Array conversions} *) val to_array : 'a t -> 'a array (** [to_array ra] converts a resizable array to a standard one. *) val sof_array : strategy -> 'a array -> 'a t (** [sof_array s ar] converts a standard array to a resizable one, using strategy [s]. *) val of_array : 'a array -> 'a t (** [of_array ar] converts a standard array to a resizable one using the default strategy. *) (** {6 List conversions} *) val to_list : 'a t -> 'a list (** [to_list ra] converts resizable array [ra] to a list. *) val sof_list : strategy -> 'a list -> 'a t (** [sof_list s l] creates a resizable array using strategy [s] and the elements in list [l]. *) val of_list : 'a list -> 'a t (** [of_list l] creates a resizable array using the default strategy and the elements in list [l]. *) (** {6 Iterators} *) val iter : ('a -> unit) -> 'a t -> unit (** [iter f ra] applies the unit-function [f] to each element in resizable array [ra]. *) val map : ('a -> 'b) -> 'a t -> 'b t (** [map f ra] @return a resizable array using the strategy of [ra] and mapping each element in [ra] to its corresponding position in the new array using function [f]. *) val iteri : (int -> 'a -> unit) -> 'a t -> unit (** [iteri f ra] applies the unit-function [f] to each index and element in resizable array [ra]. *) val mapi : (int -> 'a -> 'b) -> 'a t -> 'b t (** [mapi f ra] @return a resizable array using the strategy of [ra] and mapping each element in [ra] to its corresponding position in the new array using function [f] and the index position. *) val fold_left : ('b -> 'a -> 'b) -> 'b -> 'a t -> 'b (** [fold_left f a ra] left-folds values in resizable array [ra] using function [f] and start accumulator [a]. *) val fold_right : ('a -> 'b -> 'b) -> 'a t -> 'b -> 'b (** [fold_right f a ra] right-folds values in resizable array [ra] using function [f] and start accumulator [a]. *) (** {6 Scanning of resizable arrays} *) val for_all : ('a -> bool) -> 'a t -> bool (** [for_all p ra] @return [true] if all elements in resizable array [ra] satisfy the predicate [p], [false] otherwise. *) val exists : ('a -> bool) -> 'a t -> bool (** [exists p ra] @return [true] if at least one element in resizable array [ra] satisfies the predicate [p], [false] otherwise. *) val mem : 'a -> 'a t -> bool (** [mem el ra] @return [true] if element [el] is logically equal to any element in resizable array [ra], [false] otherwise. *) val memq : 'a -> 'a t -> bool (** [memq el ra] @return [true] if element [el] is physically equal to any element in resizable array [ra], [false] otherwise. *) val pos : 'a -> 'a t -> int option (** [pos el ra] @return [Some index] if [el] is logically equal to the element at [index] in [ra], [None] otherwise. [index] is the index of the first element that matches. *) val posq : 'a -> 'a t -> int option (** [posq el ra] @return [Some index] if [el] is physically equal to the element at [index] in [ra], [None] otherwise. [index] is the index of the first element that matches. *) (** {6 Searching of resizable arrays} *) val find : ('a -> bool) -> 'a t -> 'a (** [find p ra] @return the first element in resizable array [ra] that satisfies predicate [p]. @raise Not_found if there is no such element. *) val find_index : ('a -> bool) -> 'a t -> int -> int (** [find_index p ra pos] @return the index of the first element that satisfies predicate [p] in resizable array [ra], starting search at index [pos]. @raise Not_found if there is no such element or if [pos] is larger than the highest index. @raise Invalid_argument if [pos] is negative. *) val filter : ('a -> bool) -> 'a t -> 'a t (** [filter p ra] @return a new resizable array by filtering out all elements in [ra] that satisfy predicate [p] using the same strategy as [ra]. *) val find_all : ('a -> bool) -> 'a t -> 'a t (** [find_all p ra] is the same as [filter] *) val filter_in_place : ('a -> bool) -> 'a t -> unit (** [filter_in_place p ra] as [filter], but filters in place. *) val partition : ('a -> bool) -> 'a t -> 'a t * 'a t (** [partition p ra] @return a pair of resizable arrays, the left part containing only elements of [ra] that satisfy predicate [p], the right one only those that do not satisfy it. Both returned arrays are created using the strategy of [ra]. *) (** {6 {b UNSAFE STUFF - USE WITH CAUTION!}} *) val unsafe_get : 'a t -> int -> 'a val unsafe_set : 'a t -> int -> 'a -> unit val unsafe_sub : 'a t -> int -> int -> 'a t val unsafe_fill : 'a t -> int -> int -> 'a -> unit val unsafe_blit : 'a t -> int -> 'a t -> int -> int -> unit val unsafe_remove_one : 'a t -> unit val unsafe_remove_n : 'a t -> int -> unit val unsafe_swap : 'a t -> int -> int -> unit val unsafe_swap_in_last : 'a t -> int -> unit end res-4.0.3/lib/res.ml0000644000000000000000000002021512156113044012323 0ustar 00000000000000(* RES - Automatically Resizing Contiguous Memory for OCaml Copyright (C) 1999- Markus Mottl email: markus.mottl@gmail.com WWW: http://www.ocaml.info This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA *) module DefStrat = struct type t = float * float * int let default = 1.5, 0.5, 16 let grow (waste, _, min_size) new_len = max (truncate (float new_len *. waste)) min_size let shrink (waste, shrink_trig, min_size) ~real_len ~new_len = if real_len > min_size && truncate (float real_len *. shrink_trig) > new_len then max (truncate (float new_len *. waste)) min_size else -1 end module BitDefStrat = struct include DefStrat let default = 1.5, 0.5, 1024 end module Array_impl = struct type 'a t = 'a array let name = "Res.Array" let length = Array.length let make = Array.make let unsafe_get = Array.get let unsafe_set = Array.set end module Unsafe_float_impl = struct type el = float type t = el array let length = Array.length let create n = Array.create n 0.0 let make = Array.make let unsafe_get = Array.unsafe_get let unsafe_set = Array.unsafe_set let unsafe_blit (ar1 : t) ofs1 ar2 ofs2 len = if ofs1 < ofs2 then for i = len - 1 downto 0 do unsafe_set ar2 (ofs2 + i) (unsafe_get ar1 (ofs1 + i)) done else for i = 0 to len - 1 do unsafe_set ar2 (ofs2 + i) (unsafe_get ar1 (ofs1 + i)) done end module Float_impl = struct include Unsafe_float_impl let name = "Res.Floats" let unsafe_get = Array.get let unsafe_set = Array.set let unsafe_blit ar1 ofs1 ar2 ofs2 len = if len < 0 || ofs1 < 0 || ofs1 > Array.length ar1 - len || ofs2 < 0 || ofs2 > Array.length ar2 - len then invalid_arg "Res.Floats.blit" else unsafe_blit ar1 ofs1 ar2 ofs2 len end (* TODO: create safe version *) (* Code of the Bit-module due to Jean-Christophe Filliatre *) module Bit_impl = struct type el = bool type t = { length : int; bits : int array } let name = "Res.Bits" let length v = v.length let bpi = Sys.word_size - 2 let bit_j = Array.init bpi (fun j -> 1 lsl j) let bit_not_j = Array.init bpi (fun j -> max_int - bit_j.(j)) let low_mask = Array.create (bpi + 1) 0 let () = for i = 1 to bpi do low_mask.(i) <- low_mask.(i-1) lor bit_j.(i - 1) done let keep_lowest_bits a j = a land low_mask.(j) let high_mask = Array.init (bpi + 1) (fun j -> low_mask.(j) lsl (bpi-j)) let keep_highest_bits a j = a land high_mask.(j) let make n b = let initv = if b then max_int else 0 in let r = n mod bpi in if r = 0 then { length = n; bits = Array.create (n / bpi) initv } else begin let s = n / bpi in let b = Array.create (s + 1) initv in b.(s) <- b.(s) land low_mask.(r); { length = n; bits = b } end let create n = make n false let pos n = let i = n / bpi in let j = n mod bpi in if j < 0 then (i - 1, j + bpi) else (i,j) let unsafe_get v n = let (i,j) = pos n in ((Array.unsafe_get v.bits i) land (Array.unsafe_get bit_j j)) > 0 let unsafe_set v n b = let (i,j) = pos n in if b then Array.unsafe_set v.bits i ((Array.unsafe_get v.bits i) lor (Array.unsafe_get bit_j j)) else Array.unsafe_set v.bits i ((Array.unsafe_get v.bits i) land (Array.unsafe_get bit_not_j j)) let blit_bits a i m v n = let (i',j) = pos n in if j == 0 then Array.unsafe_set v i' ((keep_lowest_bits (a lsr i) m) lor (keep_highest_bits (Array.unsafe_get v i') (bpi - m))) else let d = m + j - bpi in if d > 0 then begin Array.unsafe_set v i' (((keep_lowest_bits (a lsr i) (bpi - j)) lsl j) lor (keep_lowest_bits (Array.unsafe_get v i') j)); Array.unsafe_set v (i' + 1) ((keep_lowest_bits (a lsr (i + bpi - j)) d) lor (keep_highest_bits (Array.unsafe_get v (i' + 1)) (bpi - d))) end else Array.unsafe_set v i' (((keep_lowest_bits (a lsr i) m) lsl j) lor ((Array.unsafe_get v i') land (low_mask.(j) lor high_mask.(-d)))) let blit_int a v n = let (i,j) = pos n in if j == 0 then Array.unsafe_set v i a else begin Array.unsafe_set v i ( (keep_lowest_bits (Array.unsafe_get v i) j) lor ((keep_lowest_bits a (bpi - j)) lsl j)); Array.unsafe_set v (i + 1) ((keep_highest_bits (Array.unsafe_get v (i + 1)) (bpi - j)) lor (a lsr (bpi - j))) end let unsafe_blit v1 ofs1 v2 ofs2 len = let (bi,bj) = pos ofs1 in let (ei,ej) = pos (ofs1 + len - 1) in if bi == ei then blit_bits (Array.unsafe_get v1.bits bi) bj len v2.bits ofs2 else begin blit_bits (Array.unsafe_get v1.bits bi) bj (bpi - bj) v2.bits ofs2; let n = ref (ofs2 + bpi - bj) in for i = bi + 1 to ei - 1 do blit_int (Array.unsafe_get v1.bits i) v2.bits !n; n := !n + bpi done; blit_bits (Array.unsafe_get v1.bits ei) 0 (ej + 1) v2.bits !n end end module Buffer_impl = struct type el = char type t = string let length = String.length let create = String.create let make = String.make let name = "Res.Buffer" let unsafe_get = String.get let unsafe_set = String.set let unsafe_blit = String.blit end module MakeArray (S : Strat.T) = Pres_impl.Make (S) (Array_impl) module MakeFloats (S : Strat.T) = Nopres_impl.Make (S) (Float_impl) module MakeBits (S : Strat.T) = Nopres_impl.Make (S) (Bit_impl) module MakeWeak (S : Strat.T) = Weak_impl.Make (S) module MakeBuffer (S : Strat.T) = struct module B = Nopres_impl.Make (S) (Buffer_impl) include B let create _ = empty () let contents buf = String.sub buf.ar 0 (length buf) let reset = clear let add_char = add_one let add_string buf str = let old_buf_len = length buf in let len = String.length str in maybe_grow_ix buf (buf.vlix + len); String.blit str 0 buf.ar old_buf_len len let add_substring buf str ofs len = if ofs < 0 || len < 0 || ofs + len > String.length str then invalid_arg "add_substring"; let old_buf_len = length buf in maybe_grow_ix buf (buf.vlix + len); String.blit str ofs buf.ar old_buf_len len let add_buffer b1 b2 = add_substring b1 b2.ar 0 (length b2) let add_channel buf ch len = let old_buf_len = length buf in maybe_grow_ix buf (buf.vlix + len); try really_input ch buf.ar old_buf_len len with | End_of_file -> buf.vlix <- old_buf_len - 1; enforce_strategy buf let rec add_full_channel_f_aux buf ch len adjust = if len > 0 then begin let old_buf_len = length buf in maybe_grow_ix buf (buf.vlix + len); let r = input ch buf.ar old_buf_len len in if r > 0 then begin let diff = len - r in if diff > 0 then begin buf.vlix <- buf.vlix - diff; add_full_channel_f_aux buf ch len adjust end else add_full_channel_f_aux buf ch (adjust len) adjust end else buf.vlix <- buf.vlix - len end let add_full_channel_f buf ch len adjust = add_full_channel_f_aux buf ch len adjust; enforce_strategy buf let add_full_channel buf ch = add_full_channel_f buf ch 4096 (fun n -> n) let output_buffer ch buf = output ch buf.ar 0 (length buf) let sof_string strategy str = sinit strategy (String.length str) (fun i -> String.unsafe_get str i) let of_string = sof_string Strategy.default end module Array = MakeArray (DefStrat) module Floats = MakeFloats (DefStrat) module Bits = MakeBits (BitDefStrat) module Weak = MakeWeak (DefStrat) module Buffer = MakeBuffer (DefStrat) res-4.0.3/lib/res.mli0000644000000000000000000000662712156113044012507 0ustar 00000000000000(* RES - Automatically Resizing Contiguous Memory for OCaml Copyright (C) 1999- Markus Mottl email: markus.mottl@gmail.com WWW: http://www.ocaml.info This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA *) (** Global module for resizable datastructures and default implementations *) (** {6 Default strategies} *) (** Default strategy for resizable datastructures *) module DefStrat : (Strat.T with type t = float * float * int) (** [type t] is a triple [waste, shrink_trig, min_size], where [waste] (default: 1.5) indicates by how much the array should be grown in excess when reallocation is triggered, [shrink_trig] (default: 0.5) at which percentage of excess elements it should be shrinked and [min_size] (default: 16 elements) is the minimum size of the resizable array. *) module BitDefStrat : (Strat.T with type t = float * float * int) (** Same as [DefStrat], but the minimum size is 1024 elements (bits). *) (** {6 Default instantiation of standard resizable datastructures} *) (** Resizable parameterized array using the default reallocation strategy. *) module Array : (Pres_intf.T with module Strategy = DefStrat) (** Resizable float array using the default reallocation strategy. *) module Floats : (Nopres_intf.T with module Strategy = DefStrat and type el = float) (** Resizable bit vector using the default reallocation strategy. *) module Bits : (Nopres_intf.T with module Strategy = BitDefStrat and type el = bool) (** Resizable weak array using the default reallocation strategy. *) module Weak : (Weak_intf.T with module Strategy = DefStrat) (** Resizable buffer using the default reallocation strategy. *) module Buffer : (Nopres_intf.Buffer with module Strategy = DefStrat and type el = char) (** {6 Functors for creating standard resizable datastructures from strategies} *) (** Functor that creates resizable parameterized arrays from reallocation strategies. *) module MakeArray : functor (S : Strat.T) -> (Pres_intf.T with module Strategy = S) (** Functor that creates resizable float arrays from reallocation strategies. *) module MakeFloats : functor (S : Strat.T) -> (Nopres_intf.T with module Strategy = S and type el = float) (** Functor that creates resizable bit vectors from reallocation strategies. *) module MakeBits : functor (S : Strat.T) -> (Nopres_intf.T with module Strategy = S and type el = bool) (** Functor that creates resizable weak arrays from reallocation strategies. *) module MakeWeak : functor (S : Strat.T) -> (Weak_intf.T with module Strategy = S) (** Functor that creates resizable buffers (=string arrays) from reallocation strategies. *) module MakeBuffer : functor (S : Strat.T) -> (Nopres_intf.Buffer with module Strategy = S and type el = char) res-4.0.3/lib/res.mllib0000644000000000000000000000023612156113044013013 0ustar 00000000000000# OASIS_START # DO NOT EDIT (digest: fc51506e8ab9fe3b675e9f9abb5e59aa) Nopres_impl Nopres_intf Pres_impl Pres_intf Res Strat Weak_impl Weak_intf # OASIS_STOP res-4.0.3/lib/strat.ml0000644000000000000000000000400312156113044012664 0ustar 00000000000000(* RES - Automatically Resizing Contiguous Memory for OCaml Copyright (C) 1999- Markus Mottl email: markus.mottl@gmail.com WWW: http://www.ocaml.info This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA *) (** Interface to strategies *) module type T = sig type t (** The abstract type of strategies. *) val default : t (** Default strategy of this strategy implementation. *) val grow : t -> int -> int (** [grow strat new_len] @return the new real length of some contiguous datastructure using strategy [strat] given new virtual length [new_len]. The user should then use this new real length to resize the datastructure. Be careful, the new (real) length {b must} be larger than the new virtual length, otherwise your program will crash! *) val shrink : t -> real_len : int -> new_len : int -> int (** [shrink strat ~real_len ~new_len] @return the new real length of a resizable datastructure given its current real length [real_len] and its required new virtual length [new_len] wrt. strategy [strat]. The user should then use this new real length to resize the datastructure. If [-1] is returned, it is not necessary to resize. Be careful, the new (real) length {b must} be larger than the new (virtual) length, otherwise your program may crash! *) end res-4.0.3/lib/weak_impl.ml0000644000000000000000000002375112156113044013512 0ustar 00000000000000(* RES - Automatically Resizing Contiguous Memory for OCaml Copyright (C) 1999- Markus Mottl email: markus.mottl@gmail.com WWW: http://www.ocaml.info This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA *) (* TODO: make safe and improve *) module Make (S : Strat.T) = struct module Strategy = S type strategy = Strategy.t type 'a t = { mutable ar : 'a Weak.t; mutable vlix : int; mutable strategy : strategy } let name = "Res.Weak" let invalid_arg str = invalid_arg (name ^ "." ^ str) let failwith str = failwith (name ^ "." ^ str) let length ra = ra.vlix + 1 let lix ra = ra.vlix let real_length ra = Weak.length ra.ar let real_lix ra = real_length ra - 1 let unsafe_get ra ix = Weak.get ra.ar ix let unsafe_set ra ix el = Weak.set ra.ar ix el let check ra ix = Weak.check ra.ar ix let get ra n = if n > ra.vlix || n < 0 then invalid_arg "get" else unsafe_get ra n let get_copy ra n = if n > ra.vlix || n < 0 then invalid_arg "get_copy" else Weak.get_copy ra.ar n let set ra n = if n > ra.vlix || n < 0 then invalid_arg "set" else unsafe_set ra n let creator = Weak.create let screate_fresh strategy n = let res = {ar = creator 0; vlix = n - 1; strategy = strategy} in res.ar <- creator (Strategy.grow strategy n); res let create_fresh n = screate_fresh Strategy.default n let create_from ra = {ar = creator (length ra); vlix = ra.vlix; strategy = ra.strategy} let sempty strategy = let res = {ar = creator 0; vlix = -1; strategy = strategy} in res.ar <- creator (Strategy.grow strategy 0); res let empty () = sempty Strategy.default let smake strategy n x = let res = screate_fresh strategy n in for i = 0 to n - 1 do unsafe_set res i x done; res let make n = smake Strategy.default n let create n = make n None let screate strategy n = smake strategy n None let sinit strategy n f = let res = screate_fresh strategy n in for i = 0 to n - 1 do unsafe_set res i (f i) done; res let init n f = sinit Strategy.default n f let get_strategy ra = ra.strategy let resizer some_lix ra len = let ar = creator len in for i = 0 to some_lix do Weak.set ar i (unsafe_get ra i) done; ra.ar <- ar let enforce_strategy ra = let real_len = real_length ra in let new_len = length ra in let new_real_len = Strategy.shrink ra.strategy ~real_len ~new_len in if new_real_len <> -1 then resizer ra.vlix ra new_real_len let set_strategy ra strategy = ra.strategy <- strategy; enforce_strategy ra let put_strategy ra strategy = ra.strategy <- strategy let copy ra = let ar = Weak.create (real_length ra) in for i = 0 to real_lix ra do Weak.set ar i (unsafe_get ra i) done; {ra with ar = ar} let unsafe_blit_on_other ra1 ofs1 ra2 ofs2 len = let ofs_diff = ofs2 - ofs1 in for i = ofs1 to ofs1 + len - 1 do unsafe_set ra2 (i + ofs_diff) (unsafe_get ra1 i) done let append ra1 ra2 = match ra1.vlix, ra2.vlix with | -1, -1 -> empty () | _, -1 -> copy ra1 | -1, _ -> copy ra2 | _ -> let len1 = length ra1 in let len2 = length ra2 in let res = create_fresh (len1 + len2) in unsafe_blit_on_other ra1 0 res 0 len1; unsafe_blit_on_other ra2 0 res len1 len2; res let rec concat_aux res offset = function | [] -> res | h::t -> if h.vlix < 0 then concat_aux res offset t else let len = length h in unsafe_blit_on_other h 0 res offset len; concat_aux res (offset + len) t let concat l = let len = List.fold_left (fun a el -> a + length el) 0 l in if len = 0 then empty () else concat_aux (create_fresh len) 0 l let unsafe_sub ra ofs len = let res = create_fresh len in unsafe_blit_on_other ra ofs res 0 len; res let sub ra ofs len = if ofs < 0 || len < 0 || ofs + len > length ra then invalid_arg "sub" else unsafe_sub ra ofs len let guarantee_ix ra ix = if real_lix ra < ix then resizer ra.vlix ra (Strategy.grow ra.strategy (ix + 1)) let maybe_grow_ix ra new_lix = guarantee_ix ra new_lix; ra.vlix <- new_lix let add_one ra x = let n = length ra in maybe_grow_ix ra n; unsafe_set ra n x let unsafe_remove_one ra = unsafe_set ra ra.vlix None; ra.vlix <- ra.vlix - 1; enforce_strategy ra let remove_one ra = if ra.vlix < 0 then failwith "remove_one" else unsafe_remove_one ra let unsafe_remove_n ra n = let old_vlix = ra.vlix in let old_ar = ra.ar in ra.vlix <- old_vlix - n; enforce_strategy ra; if old_ar == ra.ar then for i = ra.vlix + 1 to old_vlix do unsafe_set ra i None done let remove_n ra n = if n > length ra || n < 0 then invalid_arg "remove_n" else unsafe_remove_n ra n let unsafe_remove_range ra ofs len = unsafe_blit_on_other ra (ofs + len) ra ofs (length ra - len); unsafe_remove_n ra len let remove_range ra ofs len = if ofs < 0 || len < 0 || ofs + len > length ra then invalid_arg "remove_range" else unsafe_remove_range ra ofs len let clear ra = unsafe_remove_n ra (length ra) let unsafe_swap ra n m = let tmp = unsafe_get ra n in unsafe_set ra n (unsafe_get ra m); unsafe_set ra m tmp let swap ra n m = if n > ra.vlix || m > ra.vlix || n < 0 || m < 0 then invalid_arg "swap" else unsafe_swap ra n m let unsafe_swap_in_last ra n = unsafe_set ra n (unsafe_get ra ra.vlix); unsafe_remove_one ra let swap_in_last ra n = if n > ra.vlix || n < 0 then invalid_arg "swap_in_last" else unsafe_swap_in_last ra n let unsafe_fill ra ofs len x = let last = ofs + len - 1 in maybe_grow_ix ra (max last ra.vlix); for i = ofs to last do unsafe_set ra i x done let fill ra ofs len x = if ofs < 0 || len < 0 || ofs > length ra then invalid_arg "fill" else unsafe_fill ra ofs len x let unsafe_blit ra1 ofs1 ra2 ofs2 len = guarantee_ix ra2 (ofs2 + len - 1); if ofs1 < ofs2 then for i = len - 1 downto 0 do unsafe_set ra2 (ofs2 + i) (unsafe_get ra1 (ofs1 + i)) done else for i = 0 to len - 1 do unsafe_set ra2 (ofs2 + i) (unsafe_get ra1 (ofs1 + i)) done let blit ra1 ofs1 ra2 ofs2 len = if len < 0 || ofs1 < 0 || ofs2 < 0 || ofs1 + len > length ra1 || ofs2 > length ra2 then invalid_arg "blit" else unsafe_blit ra1 ofs1 ra2 ofs2 len let to_std ra = let wa = Weak.create (length ra) in for i = 0 to ra.vlix do Weak.set wa i (unsafe_get ra i) done; wa let sof_std strategy ar = sinit strategy (Weak.length ar) (Weak.get ar) let of_std ar = sof_std Strategy.default ar let rec to_list_aux ra i accu = if i < 0 then accu else to_list_aux ra (i - 1) (unsafe_get ra i :: accu) let to_list ra = to_list_aux ra ra.vlix [] let rec of_list_aux res i = function | [] -> res | h::t -> unsafe_set res i h; of_list_aux res (i + 1) t let of_list l = of_list_aux (create_fresh (List.length l)) 0 l let iter f ra = for i = 0 to ra.vlix do f (unsafe_get ra i) done let iteri f ra = for i = 0 to ra.vlix do f i (unsafe_get ra i) done let fold_left f accu ra = let res = ref accu in for i = 0 to ra.vlix do res := f !res (unsafe_get ra i) done; !res let fold_right f ra accu = let res = ref accu in for i = ra.vlix downto 0 do res := f (unsafe_get ra i) !res done; !res let rec for_all_aux i p ra = if i > ra.vlix then true else if p (unsafe_get ra i) then for_all_aux (i + 1) p ra else false let for_all p ra = for_all_aux 0 p ra let rec exists_aux i p ra = if i > ra.vlix then false else if p (unsafe_get ra i) then true else exists_aux (i + 1) p ra let exists p ra = exists_aux 0 p ra let rec mem_aux i x ra = if i > ra.vlix then false else if unsafe_get ra i = x then true else mem_aux (i + 1) x ra let mem x ra = mem_aux 0 x ra let rec memq_aux i x ra = if i > ra.vlix then false else if unsafe_get ra i == x then true else memq_aux (i + 1) x ra let memq x ra = memq_aux 0 x ra let rec pos_aux i x ra = if i > ra.vlix then None else if unsafe_get ra i = x then Some i else pos_aux (i + 1) x ra let pos x ra = pos_aux 0 x ra let rec posq_aux i x ra = if i > ra.vlix then None else if unsafe_get ra i == x then Some i else posq_aux (i + 1) x ra let posq x ra = posq_aux 0 x ra let rec find_aux i p ra = if i > ra.vlix then raise Not_found else let el = unsafe_get ra i in if p el then el else find_aux (i + 1) p ra let find p ra = find_aux 0 p ra let rec find_index_aux p ra i = if i > ra.vlix then raise Not_found else if p (unsafe_get ra i) then i else find_index_aux p ra (i + 1) let find_index p ra i = if i < 0 then invalid_arg "find_index" else find_index_aux p ra i let filter p ra = let res = sempty ra.strategy in for i = 0 to ra.vlix do let el = unsafe_get ra i in if p el then add_one res el done; res let find_all = filter let filter_in_place p ra = let dest = ref 0 in let pos = ref 0 in while !pos <= ra.vlix do let el = unsafe_get ra !pos in if p el then begin unsafe_set ra !dest el; incr dest end; incr pos done; unsafe_remove_n ra (!pos - !dest) let partition p ra = let res1, res2 as res = sempty ra.strategy, sempty ra.strategy in for i = 0 to ra.vlix do let el = unsafe_get ra i in if p el then add_one res1 el else add_one res2 el done; res end res-4.0.3/lib/weak_intf.ml0000644000000000000000000002653012156113044013507 0ustar 00000000000000(* RES - Automatically Resizing Contiguous Memory for OCaml Copyright (C) 1999-2002 Markus Mottl email: markus.mottl@gmail.com WWW: http://www.ocaml.info This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA *) (** Interface to weak resizable arrays *) module type T = sig (** {6 Signatures and types} *) (** Module implementing the reallocation strategy *) module Strategy : Strat.T type strategy = Strategy.t (** Type of reallocation strategy *) type 'a t (** Type of parameterized resizable arrays *) (** {6 Index and length information} *) val length : 'a t -> int (** [length ra] @return (virtual) length of resizable array [ra] excluding the reserved space. *) val lix : 'a t -> int (** [lix ra] @return (virtual) last index of resizable array [ra] excluding the reserved space. *) val real_length : 'a t -> int (** [real_length ra] @return (real) length of resizable array [ra] including the reserved space. *) val real_lix : 'a t -> int (** [real_lix ra] @return (real) last index of resizable array [ra] including the reserved space. *) (** {6 Getting, setting and checking} *) val get : 'a t -> int -> 'a option (** [get ra n] @return the [n]th element of [ra]. @raise Invalid_argument if index out of bounds. *) val get_copy : 'a t -> int -> 'a option (** [get_copy ra n] see documentation of module [Weak] in the standard distribution. *) val check : 'a t -> int -> bool (** [check ra n] @return [true] if the [n]th cell of [ra] is full, [false] if it is empty. Note that even if [check ar n] returns [true], a subsequent {!get}[ ar n] can return [None]. *) val set : 'a t -> int -> 'a option -> unit (** [set ra n] sets the [n]th element of [ra]. @raise Invalid_argument if index out of bounds. *) (** {6 Creation of resizable arrays} *) val sempty : strategy -> 'a t (** [sempty s] @return an empty resizable array using strategy [s]. *) val empty : unit -> 'a t (** [empty ()] same as [sempty] but uses default strategy. *) val screate : strategy -> int -> 'a t (** [screate s n el] @return a resizable array of length [n] using strategy [s]. *) val create : int -> 'a t (** [create n] same as [screate] but uses default strategy. *) val sinit : strategy -> int -> (int -> 'a option) -> 'a t (** [sinit s n f] @return an array of length [n] containing elements that were created by applying function [f] to the index, using strategy [s]. *) val init : int -> (int -> 'a option) -> 'a t (** [init n f] sames as [sinit] but uses default strategy. *) (** {6 Strategy handling} *) val get_strategy : 'a t -> strategy (** [get_strategy ra] @return the reallocation strategy used by resizable array [ra]. *) val set_strategy : 'a t -> strategy -> unit (** [set_strategy ra s] sets the reallocation strategy of resizable array [ra] to [s], possibly causing an immediate reallocation. *) val put_strategy : 'a t -> strategy -> unit (** [put_strategy ra s] sets the reallocation strategy of resizable array [ra] to [s]. Reallocation is only done at later changes in size. *) val enforce_strategy : 'a t -> unit (** [enforce_strategy ra] forces a reallocation if necessary (e.g. after a [put_strategy]. *) (** {6 Copying, blitting and range extraction} *) val copy : 'a t -> 'a t (** [copy ra] @return a copy of resizable array [ra]. The two arrays share the same strategy! *) val sub : 'a t -> int -> int -> 'a t (** [sub ra ofs len] @return a resizable subarray of length [len] from resizable array [ra] starting at offset [ofs] using the default strategy. @raise Invalid_argument if parameters do not denote a correct subarray. *) val fill : 'a t -> int -> int -> 'a option -> unit (** [fill ra ofs len el] fills resizable array [ra] from offset [ofs] with [len] elements [el], possibly adding elements at the end. Raises [Invalid_argument] if offset [ofs] is larger than the length of the array. *) val blit : 'a t -> int -> 'a t -> int -> int -> unit (** [blit ra1 ofs1 ra2 ofs2 len] blits resizable array [ra1] onto [ra2] reading [len] elements from offset [ofs1] and writing them to [ofs2], possibly adding elements at the end of ra2. Raises [Invalid_argument] if [ofs1] and [len] do not designate a valid subarray of [ra1] or if [ofs2] is larger than the length of [ra2]. *) (** {6 Combining resizable arrays} *) val append : 'a t -> 'a t -> 'a t (** [append ra1 ra2] @return a new resizable array using the default strategy and copying [ra1] and [ra2] in this order onto it. *) val concat : 'a t list -> 'a t (** [concat l] @return a new resizable array using the default strategy and copying all resizable arrays in [l] in their respective order onto it. *) (** {6 Adding and removing elements} *) val add_one : 'a t -> 'a option -> unit (** [add_one ra el] adds element [el] to resizable array [ra], possibly causing a reallocation. *) val remove_one : 'a t -> unit (** [remove_one ra] removes the last element of resizable array [ra], possibly causing a reallocation. @raise Failure if the array is empty. *) val remove_n : 'a t -> int -> unit (** [remove_n ra n] removes the last n elements of resizable array [ra], possibly causing a reallocation. @raise Invalid_arg if there are not enough elements or [n < 0]. *) val remove_range : 'a t -> int -> int -> unit (** [remove_range ra ofs len] removes [len] elements from resizable array [ra] starting at [ofs] and possibly causing a reallocation. @raise Invalid_argument if range is invalid. *) val clear : 'a t -> unit (** [clear ra] removes all elements from resizable array [ra], possibly causing a reallocation. *) (** {6 Swapping} *) val swap : 'a t -> int -> int -> unit (** [swap ra n m] swaps elements at indices [n] and [m]. @raise Invalid_argument if any index is out of range. *) val swap_in_last : 'a t -> int -> unit (** [swap_in_last ra n] swaps the last element with the one at position [n]. @raise Invalid_argument if index [n] is out of range. *) (** {6 Standard conversions} *) val to_std : 'a t -> 'a Weak.t (** [to_std ra] converts a resizable weak array to a standard one. *) val sof_std : strategy -> 'a Weak.t -> 'a t (** [sof_std s ar] converts a standard weak array to a resizable one, using strategy [s]. *) val of_std : 'a Weak.t -> 'a t (** [of_std ar] converts a standard weak array to a resizable one using the default strategy. *) (** {6 List conversions} *) val to_list : 'a t -> 'a option list (** [to_list ra] converts resizable array [ra] to a list. *) val of_list : 'a option list -> 'a t (** [of_list l] creates a resizable array using the default strategy and the elements in list [l]. *) (** {6 Iterators} *) val iter : ('a option -> unit) -> 'a t -> unit (** [iter f ra] applies the unit-function [f] to each element in resizable array [ra]. *) val iteri : (int -> 'a option -> unit) -> 'a t -> unit (** [iteri f ra] applies the unit-function [f] to each index and element in resizable array [ra]. *) val fold_left : ('b -> 'a option -> 'b) -> 'b -> 'a t -> 'b (** [fold_left f a ra] left-folds values in resizable array [ra] using function [f] and start accumulator [a]. *) val fold_right : ('a option -> 'b -> 'b) -> 'a t -> 'b -> 'b (** [fold_right f a ra] right-folds values in resizable array [ra] using function [f] and start accumulator [a]. *) (** {6 Scanning of resizable arrays} *) val for_all : ('a option -> bool) -> 'a t -> bool (** [for_all p ra] @return [true] if all elements in resizable array [ra] satisfy the predicate [p], [false] otherwise. *) val exists : ('a option -> bool) -> 'a t -> bool (** [exists p ra] @return [true] if at least one element in resizable array [ra] satisfies the predicate [p], [false] otherwise. *) val mem : 'a option -> 'a t -> bool (** [mem el ra] @return [true] if element [el] is logically equal to any element in resizable array [ra], [false] otherwise. *) val memq : 'a option -> 'a t -> bool (** [memq el ra] @return [true] if element [el] is physically equal to any element in resizable array [ra], [false] otherwise. *) val pos : 'a option -> 'a t -> int option (** [pos el ra] @return [Some index] if [el] is logically equal to the element at [index] in [ra], [None] otherwise. [index] is the index of the first element that matches. *) val posq : 'a option -> 'a t -> int option (** [posq el ra] @return [Some index] if [el] is physically equal to the element at [index] in [ra], [None] otherwise. [index] is the index of the first element that matches. *) (** {6 Searching of resizable arrays} *) val find : ('a option -> bool) -> 'a t -> 'a option (** [find p ra] @return the first element in resizable array [ra] that satisfies predicate [p]. @raise Not_found if there is no such element. *) val find_index : ('a option -> bool) -> 'a t -> int -> int (** [find_index p ra pos] @return the index of the first element that satisfies predicate [p] in resizable array [ra], starting search at index [pos]. @raise Not_found if there is no such element or if [pos] is larger than the highest index. @raise Invalid_argument if [pos] is negative. *) val filter : ('a option -> bool) -> 'a t -> 'a t (** [filter p ra] @return a new resizable array by filtering out all elements in [ra] that satisfy predicate [p] using the same strategy as [ra]. *) val find_all : ('a option -> bool) -> 'a t -> 'a t (** [find_all p ra] is the same as [filter] *) val filter_in_place : ('a option -> bool) -> 'a t -> unit (** [filter_in_place p ra] as [filter], but filters in place. *) val partition : ('a option -> bool) -> 'a t -> 'a t * 'a t (** [partition p ra] @return a pair of resizable arrays, the left part containing only elements of [ra] that satisfy predicate [p], the right one only those that do not satisfy it. Both returned arrays are created using the strategy of [ra]. *) (** {6 {b UNSAFE STUFF - USE WITH CAUTION!}} *) val unsafe_get : 'a t -> int -> 'a option val unsafe_set : 'a t -> int -> 'a option -> unit val unsafe_sub : 'a t -> int -> int -> 'a t val unsafe_fill : 'a t -> int -> int -> 'a option -> unit val unsafe_blit : 'a t -> int -> 'a t -> int -> int -> unit val unsafe_remove_one : 'a t -> unit val unsafe_remove_n : 'a t -> int -> unit val unsafe_swap : 'a t -> int -> int -> unit val unsafe_swap_in_last : 'a t -> int -> unit end res-4.0.3/myocamlbuild.ml0000644000000000000000000003406512156113044013455 0ustar 00000000000000(* OASIS_START *) (* DO NOT EDIT (digest: 42a1b05aff8ce91364fd5390461707ab) *) module OASISGettext = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/oasis/OASISGettext.ml" *) let ns_ str = str let s_ str = str let f_ (str : ('a, 'b, 'c, 'd) format4) = str let fn_ fmt1 fmt2 n = if n = 1 then fmt1^^"" else fmt2^^"" let init = [] end module OASISExpr = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/oasis/OASISExpr.ml" *) open OASISGettext type test = string type flag = string type t = | EBool of bool | ENot of t | EAnd of t * t | EOr of t * t | EFlag of flag | ETest of test * string type 'a choices = (t * 'a) list let eval var_get t = let rec eval' = function | EBool b -> b | ENot e -> not (eval' e) | EAnd (e1, e2) -> (eval' e1) && (eval' e2) | EOr (e1, e2) -> (eval' e1) || (eval' e2) | EFlag nm -> let v = var_get nm in assert(v = "true" || v = "false"); (v = "true") | ETest (nm, vl) -> let v = var_get nm in (v = vl) in eval' t let choose ?printer ?name var_get lst = let rec choose_aux = function | (cond, vl) :: tl -> if eval var_get cond then vl else choose_aux tl | [] -> let str_lst = if lst = [] then s_ "" else String.concat (s_ ", ") (List.map (fun (cond, vl) -> match printer with | Some p -> p vl | None -> s_ "") lst) in match name with | Some nm -> failwith (Printf.sprintf (f_ "No result for the choice list '%s': %s") nm str_lst) | None -> failwith (Printf.sprintf (f_ "No result for a choice list: %s") str_lst) in choose_aux (List.rev lst) end # 117 "myocamlbuild.ml" module BaseEnvLight = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/base/BaseEnvLight.ml" *) module MapString = Map.Make(String) type t = string MapString.t let default_filename = Filename.concat (Sys.getcwd ()) "setup.data" let load ?(allow_empty=false) ?(filename=default_filename) () = if Sys.file_exists filename then begin let chn = open_in_bin filename in let st = Stream.of_channel chn in let line = ref 1 in let st_line = Stream.from (fun _ -> try match Stream.next st with | '\n' -> incr line; Some '\n' | c -> Some c with Stream.Failure -> None) in let lexer = Genlex.make_lexer ["="] st_line in let rec read_file mp = match Stream.npeek 3 lexer with | [Genlex.Ident nm; Genlex.Kwd "="; Genlex.String value] -> Stream.junk lexer; Stream.junk lexer; Stream.junk lexer; read_file (MapString.add nm value mp) | [] -> mp | _ -> failwith (Printf.sprintf "Malformed data file '%s' line %d" filename !line) in let mp = read_file MapString.empty in close_in chn; mp end else if allow_empty then begin MapString.empty end else begin failwith (Printf.sprintf "Unable to load environment, the file '%s' doesn't exist." filename) end let var_get name env = let rec var_expand str = let buff = Buffer.create ((String.length str) * 2) in Buffer.add_substitute buff (fun var -> try var_expand (MapString.find var env) with Not_found -> failwith (Printf.sprintf "No variable %s defined when trying to expand %S." var str)) str; Buffer.contents buff in var_expand (MapString.find name env) let var_choose lst env = OASISExpr.choose (fun nm -> var_get nm env) lst end # 215 "myocamlbuild.ml" module MyOCamlbuildFindlib = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/plugins/ocamlbuild/MyOCamlbuildFindlib.ml" *) (** OCamlbuild extension, copied from * http://brion.inria.fr/gallium/index.php/Using_ocamlfind_with_ocamlbuild * by N. Pouillard and others * * Updated on 2009/02/28 * * Modified by Sylvain Le Gall *) open Ocamlbuild_plugin (* these functions are not really officially exported *) let run_and_read = Ocamlbuild_pack.My_unix.run_and_read let blank_sep_strings = Ocamlbuild_pack.Lexers.blank_sep_strings let split s ch = let x = ref [] in let rec go s = let pos = String.index s ch in x := (String.before s pos)::!x; go (String.after s (pos + 1)) in try go s with Not_found -> !x let split_nl s = split s '\n' let before_space s = try String.before s (String.index s ' ') with Not_found -> s (* this lists all supported packages *) let find_packages () = List.map before_space (split_nl & run_and_read "ocamlfind list") (* this is supposed to list available syntaxes, but I don't know how to do it. *) let find_syntaxes () = ["camlp4o"; "camlp4r"] (* ocamlfind command *) let ocamlfind x = S[A"ocamlfind"; x] let dispatch = function | Before_options -> (* by using Before_options one let command line options have an higher priority *) (* on the contrary using After_options will guarantee to have the higher priority *) (* override default commands by ocamlfind ones *) Options.ocamlc := ocamlfind & A"ocamlc"; Options.ocamlopt := ocamlfind & A"ocamlopt"; Options.ocamldep := ocamlfind & A"ocamldep"; Options.ocamldoc := ocamlfind & A"ocamldoc"; Options.ocamlmktop := ocamlfind & A"ocamlmktop" | After_rules -> (* When one link an OCaml library/binary/package, one should use -linkpkg *) flag ["ocaml"; "link"; "program"] & A"-linkpkg"; (* For each ocamlfind package one inject the -package option when * compiling, computing dependencies, generating documentation and * linking. *) List.iter begin fun pkg -> flag ["ocaml"; "compile"; "pkg_"^pkg] & S[A"-package"; A pkg]; flag ["ocaml"; "ocamldep"; "pkg_"^pkg] & S[A"-package"; A pkg]; flag ["ocaml"; "doc"; "pkg_"^pkg] & S[A"-package"; A pkg]; flag ["ocaml"; "link"; "pkg_"^pkg] & S[A"-package"; A pkg]; flag ["ocaml"; "infer_interface"; "pkg_"^pkg] & S[A"-package"; A pkg]; end (find_packages ()); (* Like -package but for extensions syntax. Morover -syntax is useless * when linking. *) List.iter begin fun syntax -> flag ["ocaml"; "compile"; "syntax_"^syntax] & S[A"-syntax"; A syntax]; flag ["ocaml"; "ocamldep"; "syntax_"^syntax] & S[A"-syntax"; A syntax]; flag ["ocaml"; "doc"; "syntax_"^syntax] & S[A"-syntax"; A syntax]; flag ["ocaml"; "infer_interface"; "syntax_"^syntax] & S[A"-syntax"; A syntax]; end (find_syntaxes ()); (* The default "thread" tag is not compatible with ocamlfind. * Indeed, the default rules add the "threads.cma" or "threads.cmxa" * options when using this tag. When using the "-linkpkg" option with * ocamlfind, this module will then be added twice on the command line. * * To solve this, one approach is to add the "-thread" option when using * the "threads" package using the previous plugin. *) flag ["ocaml"; "pkg_threads"; "compile"] (S[A "-thread"]); flag ["ocaml"; "pkg_threads"; "doc"] (S[A "-I"; A "+threads"]); flag ["ocaml"; "pkg_threads"; "link"] (S[A "-thread"]); flag ["ocaml"; "pkg_threads"; "infer_interface"] (S[A "-thread"]) | _ -> () end module MyOCamlbuildBase = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/plugins/ocamlbuild/MyOCamlbuildBase.ml" *) (** Base functions for writing myocamlbuild.ml @author Sylvain Le Gall *) open Ocamlbuild_plugin module OC = Ocamlbuild_pack.Ocaml_compiler type dir = string type file = string type name = string type tag = string (* # 56 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/plugins/ocamlbuild/MyOCamlbuildBase.ml" *) type t = { lib_ocaml: (name * dir list) list; lib_c: (name * dir * file list) list; flags: (tag list * (spec OASISExpr.choices)) list; (* Replace the 'dir: include' from _tags by a precise interdepends in * directory. *) includes: (dir * dir list) list; } let env_filename = Pathname.basename BaseEnvLight.default_filename let dispatch_combine lst = fun e -> List.iter (fun dispatch -> dispatch e) lst let tag_libstubs nm = "use_lib"^nm^"_stubs" let nm_libstubs nm = nm^"_stubs" let dispatch t e = let env = BaseEnvLight.load ~filename:env_filename ~allow_empty:true () in match e with | Before_options -> let no_trailing_dot s = if String.length s >= 1 && s.[0] = '.' then String.sub s 1 ((String.length s) - 1) else s in List.iter (fun (opt, var) -> try opt := no_trailing_dot (BaseEnvLight.var_get var env) with Not_found -> Printf.eprintf "W: Cannot get variable %s" var) [ Options.ext_obj, "ext_obj"; Options.ext_lib, "ext_lib"; Options.ext_dll, "ext_dll"; ] | After_rules -> (* Declare OCaml libraries *) List.iter (function | nm, [] -> ocaml_lib nm | nm, dir :: tl -> ocaml_lib ~dir:dir (dir^"/"^nm); List.iter (fun dir -> List.iter (fun str -> flag ["ocaml"; "use_"^nm; str] (S[A"-I"; P dir])) ["compile"; "infer_interface"; "doc"]) tl) t.lib_ocaml; (* Declare directories dependencies, replace "include" in _tags. *) List.iter (fun (dir, include_dirs) -> Pathname.define_context dir include_dirs) t.includes; (* Declare C libraries *) List.iter (fun (lib, dir, headers) -> (* Handle C part of library *) flag ["link"; "library"; "ocaml"; "byte"; tag_libstubs lib] (S[A"-dllib"; A("-l"^(nm_libstubs lib)); A"-cclib"; A("-l"^(nm_libstubs lib))]); flag ["link"; "library"; "ocaml"; "native"; tag_libstubs lib] (S[A"-cclib"; A("-l"^(nm_libstubs lib))]); flag ["link"; "program"; "ocaml"; "byte"; tag_libstubs lib] (S[A"-dllib"; A("dll"^(nm_libstubs lib))]); (* When ocaml link something that use the C library, then one need that file to be up to date. *) dep ["link"; "ocaml"; "program"; tag_libstubs lib] [dir/"lib"^(nm_libstubs lib)^"."^(!Options.ext_lib)]; dep ["compile"; "ocaml"; "program"; tag_libstubs lib] [dir/"lib"^(nm_libstubs lib)^"."^(!Options.ext_lib)]; (* TODO: be more specific about what depends on headers *) (* Depends on .h files *) dep ["compile"; "c"] headers; (* Setup search path for lib *) flag ["link"; "ocaml"; "use_"^lib] (S[A"-I"; P(dir)]); ) t.lib_c; (* Add flags *) List.iter (fun (tags, cond_specs) -> let spec = BaseEnvLight.var_choose cond_specs env in flag tags & spec) t.flags | _ -> () let dispatch_default t = dispatch_combine [ dispatch t; MyOCamlbuildFindlib.dispatch; ] end # 476 "myocamlbuild.ml" open Ocamlbuild_plugin;; let package_default = { MyOCamlbuildBase.lib_ocaml = [("res", ["lib"])]; lib_c = []; flags = []; includes = [("examples", ["lib"])]; } ;; let dispatch_default = MyOCamlbuildBase.dispatch_default package_default;; # 490 "myocamlbuild.ml" (* OASIS_STOP *) let () = let additional_rules = function | After_rules -> flag ["compile"; "ocaml"] (S [A "-strict-sequence"]) | _ -> () in dispatch ( MyOCamlbuildBase.dispatch_combine [MyOCamlbuildBase.dispatch_default package_default; additional_rules]) res-4.0.3/setup.ml0000644000000000000000000047256212156113044012144 0ustar 00000000000000(* setup.ml generated for the first time by OASIS v0.3.0 *) (* OASIS_START *) (* DO NOT EDIT (digest: 405a2daafc5bbfccf17765313f84ad61) *) (* Regenerated by OASIS v0.3.0 Visit http://oasis.forge.ocamlcore.org for more information and documentation about functions used in this file. *) module OASISGettext = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/oasis/OASISGettext.ml" *) let ns_ str = str let s_ str = str let f_ (str : ('a, 'b, 'c, 'd) format4) = str let fn_ fmt1 fmt2 n = if n = 1 then fmt1^^"" else fmt2^^"" let init = [] end module OASISContext = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/oasis/OASISContext.ml" *) open OASISGettext type level = [ `Debug | `Info | `Warning | `Error] type t = { quiet: bool; info: bool; debug: bool; ignore_plugins: bool; ignore_unknown_fields: bool; printf: level -> string -> unit; } let printf lvl str = let beg = match lvl with | `Error -> s_ "E: " | `Warning -> s_ "W: " | `Info -> s_ "I: " | `Debug -> s_ "D: " in prerr_endline (beg^str) let default = ref { quiet = false; info = false; debug = false; ignore_plugins = false; ignore_unknown_fields = false; printf = printf; } let quiet = {!default with quiet = true} let args () = ["-quiet", Arg.Unit (fun () -> default := {!default with quiet = true}), (s_ " Run quietly"); "-info", Arg.Unit (fun () -> default := {!default with info = true}), (s_ " Display information message"); "-debug", Arg.Unit (fun () -> default := {!default with debug = true}), (s_ " Output debug message")] end module OASISString = struct (* # 1 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/oasis/OASISString.ml" *) (** Various string utilities. Mostly inspired by extlib and batteries ExtString and BatString libraries. @author Sylvain Le Gall *) let nsplitf str f = if str = "" then [] else let buf = Buffer.create 13 in let lst = ref [] in let push () = lst := Buffer.contents buf :: !lst; Buffer.clear buf in let str_len = String.length str in for i = 0 to str_len - 1 do if f str.[i] then push () else Buffer.add_char buf str.[i] done; push (); List.rev !lst (** [nsplit c s] Split the string [s] at char [c]. It doesn't include the separator. *) let nsplit str c = nsplitf str ((=) c) let find ~what ?(offset=0) str = let what_idx = ref 0 in let str_idx = ref offset in while !str_idx < String.length str && !what_idx < String.length what do if str.[!str_idx] = what.[!what_idx] then incr what_idx else what_idx := 0; incr str_idx done; if !what_idx <> String.length what then raise Not_found else !str_idx - !what_idx let sub_start str len = let str_len = String.length str in if len >= str_len then "" else String.sub str len (str_len - len) let sub_end ?(offset=0) str len = let str_len = String.length str in if len >= str_len then "" else String.sub str 0 (str_len - len) let starts_with ~what ?(offset=0) str = let what_idx = ref 0 in let str_idx = ref offset in let ok = ref true in while !ok && !str_idx < String.length str && !what_idx < String.length what do if str.[!str_idx] = what.[!what_idx] then incr what_idx else ok := false; incr str_idx done; if !what_idx = String.length what then true else false let strip_starts_with ~what str = if starts_with ~what str then sub_start str (String.length what) else raise Not_found let ends_with ~what ?(offset=0) str = let what_idx = ref ((String.length what) - 1) in let str_idx = ref ((String.length str) - 1) in let ok = ref true in while !ok && offset <= !str_idx && 0 <= !what_idx do if str.[!str_idx] = what.[!what_idx] then decr what_idx else ok := false; decr str_idx done; if !what_idx = -1 then true else false let strip_ends_with ~what str = if ends_with ~what str then sub_end str (String.length what) else raise Not_found let replace_chars f s = let buf = String.make (String.length s) 'X' in for i = 0 to String.length s - 1 do buf.[i] <- f s.[i] done; buf end module OASISUtils = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/oasis/OASISUtils.ml" *) open OASISGettext module MapString = Map.Make(String) let map_string_of_assoc assoc = List.fold_left (fun acc (k, v) -> MapString.add k v acc) MapString.empty assoc module SetString = Set.Make(String) let set_string_add_list st lst = List.fold_left (fun acc e -> SetString.add e acc) st lst let set_string_of_list = set_string_add_list SetString.empty let compare_csl s1 s2 = String.compare (String.lowercase s1) (String.lowercase s2) module HashStringCsl = Hashtbl.Make (struct type t = string let equal s1 s2 = (String.lowercase s1) = (String.lowercase s2) let hash s = Hashtbl.hash (String.lowercase s) end) let varname_of_string ?(hyphen='_') s = if String.length s = 0 then begin invalid_arg "varname_of_string" end else begin let buf = OASISString.replace_chars (fun c -> if ('a' <= c && c <= 'z') || ('A' <= c && c <= 'Z') || ('0' <= c && c <= '9') then c else hyphen) s; in let buf = (* Start with a _ if digit *) if '0' <= s.[0] && s.[0] <= '9' then "_"^buf else buf in String.lowercase buf end let varname_concat ?(hyphen='_') p s = let what = String.make 1 hyphen in let p = try OASISString.strip_ends_with ~what p with Not_found -> p in let s = try OASISString.strip_starts_with ~what s with Not_found -> s in p^what^s let is_varname str = str = varname_of_string str let failwithf fmt = Printf.ksprintf failwith fmt end module PropList = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/oasis/PropList.ml" *) open OASISGettext type name = string exception Not_set of name * string option exception No_printer of name exception Unknown_field of name * name let () = Printexc.register_printer (function | Not_set (nm, Some rsn) -> Some (Printf.sprintf (f_ "Field '%s' is not set: %s") nm rsn) | Not_set (nm, None) -> Some (Printf.sprintf (f_ "Field '%s' is not set") nm) | No_printer nm -> Some (Printf.sprintf (f_ "No default printer for value %s") nm) | Unknown_field (nm, schm) -> Some (Printf.sprintf (f_ "Field %s is not defined in schema %s") nm schm) | _ -> None) module Data = struct type t = (name, unit -> unit) Hashtbl.t let create () = Hashtbl.create 13 let clear t = Hashtbl.clear t (* # 71 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/oasis/PropList.ml" *) end module Schema = struct type ('ctxt, 'extra) value = { get: Data.t -> string; set: Data.t -> ?context:'ctxt -> string -> unit; help: (unit -> string) option; extra: 'extra; } type ('ctxt, 'extra) t = { name: name; fields: (name, ('ctxt, 'extra) value) Hashtbl.t; order: name Queue.t; name_norm: string -> string; } let create ?(case_insensitive=false) nm = { name = nm; fields = Hashtbl.create 13; order = Queue.create (); name_norm = (if case_insensitive then String.lowercase else fun s -> s); } let add t nm set get extra help = let key = t.name_norm nm in if Hashtbl.mem t.fields key then failwith (Printf.sprintf (f_ "Field '%s' is already defined in schema '%s'") nm t.name); Hashtbl.add t.fields key { set = set; get = get; help = help; extra = extra; }; Queue.add nm t.order let mem t nm = Hashtbl.mem t.fields nm let find t nm = try Hashtbl.find t.fields (t.name_norm nm) with Not_found -> raise (Unknown_field (nm, t.name)) let get t data nm = (find t nm).get data let set t data nm ?context x = (find t nm).set data ?context x let fold f acc t = Queue.fold (fun acc k -> let v = find t k in f acc k v.extra v.help) acc t.order let iter f t = fold (fun () -> f) () t let name t = t.name end module Field = struct type ('ctxt, 'value, 'extra) t = { set: Data.t -> ?context:'ctxt -> 'value -> unit; get: Data.t -> 'value; sets: Data.t -> ?context:'ctxt -> string -> unit; gets: Data.t -> string; help: (unit -> string) option; extra: 'extra; } let new_id = let last_id = ref 0 in fun () -> incr last_id; !last_id let create ?schema ?name ?parse ?print ?default ?update ?help extra = (* Default value container *) let v = ref None in (* If name is not given, create unique one *) let nm = match name with | Some s -> s | None -> Printf.sprintf "_anon_%d" (new_id ()) in (* Last chance to get a value: the default *) let default () = match default with | Some d -> d | None -> raise (Not_set (nm, Some (s_ "no default value"))) in (* Get data *) let get data = (* Get value *) try (Hashtbl.find data nm) (); match !v with | Some x -> x | None -> default () with Not_found -> default () in (* Set data *) let set data ?context x = let x = match update with | Some f -> begin try f ?context (get data) x with Not_set _ -> x end | None -> x in Hashtbl.replace data nm (fun () -> v := Some x) in (* Parse string value, if possible *) let parse = match parse with | Some f -> f | None -> fun ?context s -> failwith (Printf.sprintf (f_ "Cannot parse field '%s' when setting value %S") nm s) in (* Set data, from string *) let sets data ?context s = set ?context data (parse ?context s) in (* Output value as string, if possible *) let print = match print with | Some f -> f | None -> fun _ -> raise (No_printer nm) in (* Get data, as a string *) let gets data = print (get data) in begin match schema with | Some t -> Schema.add t nm sets gets extra help | None -> () end; { set = set; get = get; sets = sets; gets = gets; help = help; extra = extra; } let fset data t ?context x = t.set data ?context x let fget data t = t.get data let fsets data t ?context s = t.sets data ?context s let fgets data t = t.gets data end module FieldRO = struct let create ?schema ?name ?parse ?print ?default ?update ?help extra = let fld = Field.create ?schema ?name ?parse ?print ?default ?update ?help extra in fun data -> Field.fget data fld end end module OASISMessage = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/oasis/OASISMessage.ml" *) open OASISGettext open OASISContext let generic_message ~ctxt lvl fmt = let cond = if ctxt.quiet then false else match lvl with | `Debug -> ctxt.debug | `Info -> ctxt.info | _ -> true in Printf.ksprintf (fun str -> if cond then begin ctxt.printf lvl str end) fmt let debug ~ctxt fmt = generic_message ~ctxt `Debug fmt let info ~ctxt fmt = generic_message ~ctxt `Info fmt let warning ~ctxt fmt = generic_message ~ctxt `Warning fmt let error ~ctxt fmt = generic_message ~ctxt `Error fmt end module OASISVersion = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/oasis/OASISVersion.ml" *) open OASISGettext type s = string type t = string type comparator = | VGreater of t | VGreaterEqual of t | VEqual of t | VLesser of t | VLesserEqual of t | VOr of comparator * comparator | VAnd of comparator * comparator (* Range of allowed characters *) let is_digit c = '0' <= c && c <= '9' let is_alpha c = ('a' <= c && c <= 'z') || ('A' <= c && c <= 'Z') let is_special = function | '.' | '+' | '-' | '~' -> true | _ -> false let rec version_compare v1 v2 = if v1 <> "" || v2 <> "" then begin (* Compare ascii string, using special meaning for version * related char *) let val_ascii c = if c = '~' then -1 else if is_digit c then 0 else if c = '\000' then 0 else if is_alpha c then Char.code c else (Char.code c) + 256 in let len1 = String.length v1 in let len2 = String.length v2 in let p = ref 0 in (** Compare ascii part *) let compare_vascii () = let cmp = ref 0 in while !cmp = 0 && !p < len1 && !p < len2 && not (is_digit v1.[!p] && is_digit v2.[!p]) do cmp := (val_ascii v1.[!p]) - (val_ascii v2.[!p]); incr p done; if !cmp = 0 && !p < len1 && !p = len2 then val_ascii v1.[!p] else if !cmp = 0 && !p = len1 && !p < len2 then - (val_ascii v2.[!p]) else !cmp in (** Compare digit part *) let compare_digit () = let extract_int v p = let start_p = !p in while !p < String.length v && is_digit v.[!p] do incr p done; let substr = String.sub v !p ((String.length v) - !p) in let res = match String.sub v start_p (!p - start_p) with | "" -> 0 | s -> int_of_string s in res, substr in let i1, tl1 = extract_int v1 (ref !p) in let i2, tl2 = extract_int v2 (ref !p) in i1 - i2, tl1, tl2 in match compare_vascii () with | 0 -> begin match compare_digit () with | 0, tl1, tl2 -> if tl1 <> "" && is_digit tl1.[0] then 1 else if tl2 <> "" && is_digit tl2.[0] then -1 else version_compare tl1 tl2 | n, _, _ -> n end | n -> n end else begin 0 end let version_of_string str = str let string_of_version t = t let chop t = try let pos = String.rindex t '.' in String.sub t 0 pos with Not_found -> t let rec comparator_apply v op = match op with | VGreater cv -> (version_compare v cv) > 0 | VGreaterEqual cv -> (version_compare v cv) >= 0 | VLesser cv -> (version_compare v cv) < 0 | VLesserEqual cv -> (version_compare v cv) <= 0 | VEqual cv -> (version_compare v cv) = 0 | VOr (op1, op2) -> (comparator_apply v op1) || (comparator_apply v op2) | VAnd (op1, op2) -> (comparator_apply v op1) && (comparator_apply v op2) let rec string_of_comparator = function | VGreater v -> "> "^(string_of_version v) | VEqual v -> "= "^(string_of_version v) | VLesser v -> "< "^(string_of_version v) | VGreaterEqual v -> ">= "^(string_of_version v) | VLesserEqual v -> "<= "^(string_of_version v) | VOr (c1, c2) -> (string_of_comparator c1)^" || "^(string_of_comparator c2) | VAnd (c1, c2) -> (string_of_comparator c1)^" && "^(string_of_comparator c2) let rec varname_of_comparator = let concat p v = OASISUtils.varname_concat p (OASISUtils.varname_of_string (string_of_version v)) in function | VGreater v -> concat "gt" v | VLesser v -> concat "lt" v | VEqual v -> concat "eq" v | VGreaterEqual v -> concat "ge" v | VLesserEqual v -> concat "le" v | VOr (c1, c2) -> (varname_of_comparator c1)^"_or_"^(varname_of_comparator c2) | VAnd (c1, c2) -> (varname_of_comparator c1)^"_and_"^(varname_of_comparator c2) let version_0_3_or_after t = comparator_apply t (VGreaterEqual (string_of_version "0.3")) end module OASISLicense = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/oasis/OASISLicense.ml" *) (** License for _oasis fields @author Sylvain Le Gall *) type license = string type license_exception = string type license_version = | Version of OASISVersion.t | VersionOrLater of OASISVersion.t | NoVersion type license_dep_5_unit = { license: license; excption: license_exception option; version: license_version; } type license_dep_5 = | DEP5Unit of license_dep_5_unit | DEP5Or of license_dep_5 list | DEP5And of license_dep_5 list type t = | DEP5License of license_dep_5 | OtherLicense of string (* URL *) end module OASISExpr = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/oasis/OASISExpr.ml" *) open OASISGettext type test = string type flag = string type t = | EBool of bool | ENot of t | EAnd of t * t | EOr of t * t | EFlag of flag | ETest of test * string type 'a choices = (t * 'a) list let eval var_get t = let rec eval' = function | EBool b -> b | ENot e -> not (eval' e) | EAnd (e1, e2) -> (eval' e1) && (eval' e2) | EOr (e1, e2) -> (eval' e1) || (eval' e2) | EFlag nm -> let v = var_get nm in assert(v = "true" || v = "false"); (v = "true") | ETest (nm, vl) -> let v = var_get nm in (v = vl) in eval' t let choose ?printer ?name var_get lst = let rec choose_aux = function | (cond, vl) :: tl -> if eval var_get cond then vl else choose_aux tl | [] -> let str_lst = if lst = [] then s_ "" else String.concat (s_ ", ") (List.map (fun (cond, vl) -> match printer with | Some p -> p vl | None -> s_ "") lst) in match name with | Some nm -> failwith (Printf.sprintf (f_ "No result for the choice list '%s': %s") nm str_lst) | None -> failwith (Printf.sprintf (f_ "No result for a choice list: %s") str_lst) in choose_aux (List.rev lst) end module OASISTypes = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/oasis/OASISTypes.ml" *) type name = string type package_name = string type url = string type unix_dirname = string type unix_filename = string type host_dirname = string type host_filename = string type prog = string type arg = string type args = string list type command_line = (prog * arg list) type findlib_name = string type findlib_full = string type compiled_object = | Byte | Native | Best type dependency = | FindlibPackage of findlib_full * OASISVersion.comparator option | InternalLibrary of name type tool = | ExternalTool of name | InternalExecutable of name type vcs = | Darcs | Git | Svn | Cvs | Hg | Bzr | Arch | Monotone | OtherVCS of url type plugin_kind = [ `Configure | `Build | `Doc | `Test | `Install | `Extra ] type plugin_data_purpose = [ `Configure | `Build | `Install | `Clean | `Distclean | `Install | `Uninstall | `Test | `Doc | `Extra | `Other of string ] type 'a plugin = 'a * name * OASISVersion.t option type all_plugin = plugin_kind plugin type plugin_data = (all_plugin * plugin_data_purpose * (unit -> unit)) list (* # 102 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/oasis/OASISTypes.ml" *) type 'a conditional = 'a OASISExpr.choices type custom = { pre_command: (command_line option) conditional; post_command: (command_line option) conditional; } type common_section = { cs_name: name; cs_data: PropList.Data.t; cs_plugin_data: plugin_data; } type build_section = { bs_build: bool conditional; bs_install: bool conditional; bs_path: unix_dirname; bs_compiled_object: compiled_object; bs_build_depends: dependency list; bs_build_tools: tool list; bs_c_sources: unix_filename list; bs_data_files: (unix_filename * unix_filename option) list; bs_ccopt: args conditional; bs_cclib: args conditional; bs_dlllib: args conditional; bs_dllpath: args conditional; bs_byteopt: args conditional; bs_nativeopt: args conditional; } type library = { lib_modules: string list; lib_pack: bool; lib_internal_modules: string list; lib_findlib_parent: findlib_name option; lib_findlib_name: findlib_name option; lib_findlib_containers: findlib_name list; } type executable = { exec_custom: bool; exec_main_is: unix_filename; } type flag = { flag_description: string option; flag_default: bool conditional; } type source_repository = { src_repo_type: vcs; src_repo_location: url; src_repo_browser: url option; src_repo_module: string option; src_repo_branch: string option; src_repo_tag: string option; src_repo_subdir: unix_filename option; } type test = { test_type: [`Test] plugin; test_command: command_line conditional; test_custom: custom; test_working_directory: unix_filename option; test_run: bool conditional; test_tools: tool list; } type doc_format = | HTML of unix_filename | DocText | PDF | PostScript | Info of unix_filename | DVI | OtherDoc type doc = { doc_type: [`Doc] plugin; doc_custom: custom; doc_build: bool conditional; doc_install: bool conditional; doc_install_dir: unix_filename; doc_title: string; doc_authors: string list; doc_abstract: string option; doc_format: doc_format; doc_data_files: (unix_filename * unix_filename option) list; doc_build_tools: tool list; } type section = | Library of common_section * build_section * library | Executable of common_section * build_section * executable | Flag of common_section * flag | SrcRepo of common_section * source_repository | Test of common_section * test | Doc of common_section * doc type section_kind = [ `Library | `Executable | `Flag | `SrcRepo | `Test | `Doc ] type package = { oasis_version: OASISVersion.t; ocaml_version: OASISVersion.comparator option; findlib_version: OASISVersion.comparator option; name: package_name; version: OASISVersion.t; license: OASISLicense.t; license_file: unix_filename option; copyrights: string list; maintainers: string list; authors: string list; homepage: url option; synopsis: string; description: string option; categories: url list; conf_type: [`Configure] plugin; conf_custom: custom; build_type: [`Build] plugin; build_custom: custom; install_type: [`Install] plugin; install_custom: custom; uninstall_custom: custom; clean_custom: custom; distclean_custom: custom; files_ab: unix_filename list; sections: section list; plugins: [`Extra] plugin list; schema_data: PropList.Data.t; plugin_data: plugin_data; } end module OASISUnixPath = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/oasis/OASISUnixPath.ml" *) type unix_filename = string type unix_dirname = string type host_filename = string type host_dirname = string let current_dir_name = "." let parent_dir_name = ".." let is_current_dir fn = fn = current_dir_name || fn = "" let concat f1 f2 = if is_current_dir f1 then f2 else let f1' = try OASISString.strip_ends_with ~what:"/" f1 with Not_found -> f1 in f1'^"/"^f2 let make = function | hd :: tl -> List.fold_left (fun f p -> concat f p) hd tl | [] -> invalid_arg "OASISUnixPath.make" let dirname f = try String.sub f 0 (String.rindex f '/') with Not_found -> current_dir_name let basename f = try let pos_start = (String.rindex f '/') + 1 in String.sub f pos_start ((String.length f) - pos_start) with Not_found -> f let chop_extension f = try let last_dot = String.rindex f '.' in let sub = String.sub f 0 last_dot in try let last_slash = String.rindex f '/' in if last_slash < last_dot then sub else f with Not_found -> sub with Not_found -> f let capitalize_file f = let dir = dirname f in let base = basename f in concat dir (String.capitalize base) let uncapitalize_file f = let dir = dirname f in let base = basename f in concat dir (String.uncapitalize base) end module OASISHostPath = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/oasis/OASISHostPath.ml" *) open Filename module Unix = OASISUnixPath let make = function | [] -> invalid_arg "OASISHostPath.make" | hd :: tl -> List.fold_left Filename.concat hd tl let of_unix ufn = if Sys.os_type = "Unix" then ufn else make (List.map (fun p -> if p = Unix.current_dir_name then current_dir_name else if p = Unix.parent_dir_name then parent_dir_name else p) (OASISString.nsplit ufn '/')) end module OASISSection = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/oasis/OASISSection.ml" *) open OASISTypes let section_kind_common = function | Library (cs, _, _) -> `Library, cs | Executable (cs, _, _) -> `Executable, cs | Flag (cs, _) -> `Flag, cs | SrcRepo (cs, _) -> `SrcRepo, cs | Test (cs, _) -> `Test, cs | Doc (cs, _) -> `Doc, cs let section_common sct = snd (section_kind_common sct) let section_common_set cs = function | Library (_, bs, lib) -> Library (cs, bs, lib) | Executable (_, bs, exec) -> Executable (cs, bs, exec) | Flag (_, flg) -> Flag (cs, flg) | SrcRepo (_, src_repo) -> SrcRepo (cs, src_repo) | Test (_, tst) -> Test (cs, tst) | Doc (_, doc) -> Doc (cs, doc) (** Key used to identify section *) let section_id sct = let k, cs = section_kind_common sct in k, cs.cs_name let string_of_section sct = let k, nm = section_id sct in (match k with | `Library -> "library" | `Executable -> "executable" | `Flag -> "flag" | `SrcRepo -> "src repository" | `Test -> "test" | `Doc -> "doc") ^" "^nm let section_find id scts = List.find (fun sct -> id = section_id sct) scts module CSection = struct type t = section let id = section_id let compare t1 t2 = compare (id t1) (id t2) let equal t1 t2 = (id t1) = (id t2) let hash t = Hashtbl.hash (id t) end module MapSection = Map.Make(CSection) module SetSection = Set.Make(CSection) end module OASISBuildSection = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/oasis/OASISBuildSection.ml" *) end module OASISExecutable = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/oasis/OASISExecutable.ml" *) open OASISTypes let unix_exec_is (cs, bs, exec) is_native ext_dll suffix_program = let dir = OASISUnixPath.concat bs.bs_path (OASISUnixPath.dirname exec.exec_main_is) in let is_native_exec = match bs.bs_compiled_object with | Native -> true | Best -> is_native () | Byte -> false in OASISUnixPath.concat dir (cs.cs_name^(suffix_program ())), if not is_native_exec && not exec.exec_custom && bs.bs_c_sources <> [] then Some (dir^"/dll"^cs.cs_name^"_stubs"^(ext_dll ())) else None end module OASISLibrary = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/oasis/OASISLibrary.ml" *) open OASISTypes open OASISUtils open OASISGettext open OASISSection type library_name = name type findlib_part_name = name type 'a map_of_findlib_part_name = 'a OASISUtils.MapString.t exception InternalLibraryNotFound of library_name exception FindlibPackageNotFound of findlib_name type group_t = | Container of findlib_name * group_t list | Package of (findlib_name * common_section * build_section * library * group_t list) (* Look for a module file, considering capitalization or not. *) let find_module source_file_exists (cs, bs, lib) modul = let possible_base_fn = List.map (OASISUnixPath.concat bs.bs_path) [modul; OASISUnixPath.uncapitalize_file modul; OASISUnixPath.capitalize_file modul] in (* TODO: we should be able to be able to determine the source for every * files. Hence we should introduce a Module(source: fn) for the fields * Modules and InternalModules *) List.fold_left (fun acc base_fn -> match acc with | `No_sources _ -> begin let file_found = List.fold_left (fun acc ext -> if source_file_exists (base_fn^ext) then (base_fn^ext) :: acc else acc) [] [".ml"; ".mli"; ".mll"; ".mly"] in match file_found with | [] -> acc | lst -> `Sources (base_fn, lst) end | `Sources _ -> acc) (`No_sources possible_base_fn) possible_base_fn let source_unix_files ~ctxt (cs, bs, lib) source_file_exists = List.fold_left (fun acc modul -> match find_module source_file_exists (cs, bs, lib) modul with | `Sources (base_fn, lst) -> (base_fn, lst) :: acc | `No_sources _ -> OASISMessage.warning ~ctxt (f_ "Cannot find source file matching \ module '%s' in library %s") modul cs.cs_name; acc) [] (lib.lib_modules @ lib.lib_internal_modules) let generated_unix_files ~ctxt ~is_native ~has_native_dynlink ~ext_lib ~ext_dll ~source_file_exists (cs, bs, lib) = let find_modules lst ext = let find_module modul = match find_module source_file_exists (cs, bs, lib) modul with | `Sources (base_fn, _) -> [base_fn] | `No_sources lst -> OASISMessage.warning ~ctxt (f_ "Cannot find source file matching \ module '%s' in library %s") modul cs.cs_name; lst in List.map (fun nm -> List.map (fun base_fn -> base_fn ^"."^ext) (find_module nm)) lst in (* The headers that should be compiled along *) let headers = if lib.lib_pack then [] else find_modules lib.lib_modules "cmi" in (* The .cmx that be compiled along *) let cmxs = let should_be_built = (not lib.lib_pack) && (* Do not install .cmx packed submodules *) match bs.bs_compiled_object with | Native -> true | Best -> is_native | Byte -> false in if should_be_built then find_modules (lib.lib_modules @ lib.lib_internal_modules) "cmx" else [] in let acc_nopath = [] in (* Compute what libraries should be built *) let acc_nopath = (* Add the packed header file if required *) let add_pack_header acc = if lib.lib_pack then [cs.cs_name^".cmi"] :: acc else acc in let byte acc = add_pack_header ([cs.cs_name^".cma"] :: acc) in let native acc = let acc = add_pack_header (if has_native_dynlink then [cs.cs_name^".cmxs"] :: acc else acc) in [cs.cs_name^".cmxa"] :: [cs.cs_name^ext_lib] :: acc in match bs.bs_compiled_object with | Native -> byte (native acc_nopath) | Best when is_native -> byte (native acc_nopath) | Byte | Best -> byte acc_nopath in (* Add C library to be built *) let acc_nopath = if bs.bs_c_sources <> [] then begin ["lib"^cs.cs_name^"_stubs"^ext_lib] :: ["dll"^cs.cs_name^"_stubs"^ext_dll] :: acc_nopath end else acc_nopath in (* All the files generated *) List.rev_append (List.rev_map (List.rev_map (OASISUnixPath.concat bs.bs_path)) acc_nopath) (headers @ cmxs) type data = common_section * build_section * library type tree = | Node of (data option) * (tree MapString.t) | Leaf of data let findlib_mapping pkg = (* Map from library name to either full findlib name or parts + parent. *) let fndlb_parts_of_lib_name = let fndlb_parts cs lib = let name = match lib.lib_findlib_name with | Some nm -> nm | None -> cs.cs_name in let name = String.concat "." (lib.lib_findlib_containers @ [name]) in name in List.fold_left (fun mp -> function | Library (cs, _, lib) -> begin let lib_name = cs.cs_name in let fndlb_parts = fndlb_parts cs lib in if MapString.mem lib_name mp then failwithf (f_ "The library name '%s' is used more than once.") lib_name; match lib.lib_findlib_parent with | Some lib_name_parent -> MapString.add lib_name (`Unsolved (lib_name_parent, fndlb_parts)) mp | None -> MapString.add lib_name (`Solved fndlb_parts) mp end | Executable _ | Test _ | Flag _ | SrcRepo _ | Doc _ -> mp) MapString.empty pkg.sections in (* Solve the above graph to be only library name to full findlib name. *) let fndlb_name_of_lib_name = let rec solve visited mp lib_name lib_name_child = if SetString.mem lib_name visited then failwithf (f_ "Library '%s' is involved in a cycle \ with regard to findlib naming.") lib_name; let visited = SetString.add lib_name visited in try match MapString.find lib_name mp with | `Solved fndlb_nm -> fndlb_nm, mp | `Unsolved (lib_nm_parent, post_fndlb_nm) -> let pre_fndlb_nm, mp = solve visited mp lib_nm_parent lib_name in let fndlb_nm = pre_fndlb_nm^"."^post_fndlb_nm in fndlb_nm, MapString.add lib_name (`Solved fndlb_nm) mp with Not_found -> failwithf (f_ "Library '%s', which is defined as the findlib parent of \ library '%s', doesn't exist.") lib_name lib_name_child in let mp = MapString.fold (fun lib_name status mp -> match status with | `Solved _ -> (* Solved initialy, no need to go further *) mp | `Unsolved _ -> let _, mp = solve SetString.empty mp lib_name "" in mp) fndlb_parts_of_lib_name fndlb_parts_of_lib_name in MapString.map (function | `Solved fndlb_nm -> fndlb_nm | `Unsolved _ -> assert false) mp in (* Convert an internal library name to a findlib name. *) let findlib_name_of_library_name lib_nm = try MapString.find lib_nm fndlb_name_of_lib_name with Not_found -> raise (InternalLibraryNotFound lib_nm) in (* Add a library to the tree. *) let add sct mp = let fndlb_fullname = let cs, _, _ = sct in let lib_name = cs.cs_name in findlib_name_of_library_name lib_name in let rec add_children nm_lst (children : tree MapString.t) = match nm_lst with | (hd :: tl) -> begin let node = try add_node tl (MapString.find hd children) with Not_found -> (* New node *) new_node tl in MapString.add hd node children end | [] -> (* Should not have a nameless library. *) assert false and add_node tl node = if tl = [] then begin match node with | Node (None, children) -> Node (Some sct, children) | Leaf (cs', _, _) | Node (Some (cs', _, _), _) -> (* TODO: allow to merge Package, i.e. * archive(byte) = "foo.cma foo_init.cmo" *) let cs, _, _ = sct in failwithf (f_ "Library '%s' and '%s' have the same findlib name '%s'") cs.cs_name cs'.cs_name fndlb_fullname end else begin match node with | Leaf data -> Node (Some data, add_children tl MapString.empty) | Node (data_opt, children) -> Node (data_opt, add_children tl children) end and new_node = function | [] -> Leaf sct | hd :: tl -> Node (None, MapString.add hd (new_node tl) MapString.empty) in add_children (OASISString.nsplit fndlb_fullname '.') mp in let rec group_of_tree mp = MapString.fold (fun nm node acc -> let cur = match node with | Node (Some (cs, bs, lib), children) -> Package (nm, cs, bs, lib, group_of_tree children) | Node (None, children) -> Container (nm, group_of_tree children) | Leaf (cs, bs, lib) -> Package (nm, cs, bs, lib, []) in cur :: acc) mp [] in let group_mp = List.fold_left (fun mp -> function | Library (cs, bs, lib) -> add (cs, bs, lib) mp | _ -> mp) MapString.empty pkg.sections in let groups = group_of_tree group_mp in let library_name_of_findlib_name = Lazy.lazy_from_fun (fun () -> (* Revert findlib_name_of_library_name. *) MapString.fold (fun k v mp -> MapString.add v k mp) fndlb_name_of_lib_name MapString.empty) in let library_name_of_findlib_name fndlb_nm = try MapString.find fndlb_nm (Lazy.force library_name_of_findlib_name) with Not_found -> raise (FindlibPackageNotFound fndlb_nm) in groups, findlib_name_of_library_name, library_name_of_findlib_name let findlib_of_group = function | Container (fndlb_nm, _) | Package (fndlb_nm, _, _, _, _) -> fndlb_nm let root_of_group grp = let rec root_lib_aux = (* We do a DFS in the group. *) function | Container (_, children) -> List.fold_left (fun res grp -> if res = None then root_lib_aux grp else res) None children | Package (_, cs, bs, lib, _) -> Some (cs, bs, lib) in match root_lib_aux grp with | Some res -> res | None -> failwithf (f_ "Unable to determine root library of findlib library '%s'") (findlib_of_group grp) end module OASISFlag = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/oasis/OASISFlag.ml" *) end module OASISPackage = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/oasis/OASISPackage.ml" *) end module OASISSourceRepository = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/oasis/OASISSourceRepository.ml" *) end module OASISTest = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/oasis/OASISTest.ml" *) end module OASISDocument = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/oasis/OASISDocument.ml" *) end module OASISExec = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/oasis/OASISExec.ml" *) open OASISGettext open OASISUtils open OASISMessage (* TODO: I don't like this quote, it is there because $(rm) foo expands to * 'rm -f' foo... *) let run ~ctxt ?f_exit_code ?(quote=true) cmd args = let cmd = if quote then if Sys.os_type = "Win32" then if String.contains cmd ' ' then (* Double the 1st double quote... win32... sigh *) "\""^(Filename.quote cmd) else cmd else Filename.quote cmd else cmd in let cmdline = String.concat " " (cmd :: args) in info ~ctxt (f_ "Running command '%s'") cmdline; match f_exit_code, Sys.command cmdline with | None, 0 -> () | None, i -> failwithf (f_ "Command '%s' terminated with error code %d") cmdline i | Some f, i -> f i let run_read_output ~ctxt ?f_exit_code cmd args = let fn = Filename.temp_file "oasis-" ".txt" in try begin let () = run ~ctxt ?f_exit_code cmd (args @ [">"; Filename.quote fn]) in let chn = open_in fn in let routput = ref [] in begin try while true do routput := (input_line chn) :: !routput done with End_of_file -> () end; close_in chn; Sys.remove fn; List.rev !routput end with e -> (try Sys.remove fn with _ -> ()); raise e let run_read_one_line ~ctxt ?f_exit_code cmd args = match run_read_output ~ctxt ?f_exit_code cmd args with | [fst] -> fst | lst -> failwithf (f_ "Command return unexpected output %S") (String.concat "\n" lst) end module OASISFileUtil = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/oasis/OASISFileUtil.ml" *) open OASISGettext let file_exists_case fn = let dirname = Filename.dirname fn in let basename = Filename.basename fn in if Sys.file_exists dirname then if basename = Filename.current_dir_name then true else List.mem basename (Array.to_list (Sys.readdir dirname)) else false let find_file ?(case_sensitive=true) paths exts = (* Cardinal product of two list *) let ( * ) lst1 lst2 = List.flatten (List.map (fun a -> List.map (fun b -> a,b) lst2) lst1) in let rec combined_paths lst = match lst with | p1 :: p2 :: tl -> let acc = (List.map (fun (a,b) -> Filename.concat a b) (p1 * p2)) in combined_paths (acc :: tl) | [e] -> e | [] -> [] in let alternatives = List.map (fun (p,e) -> if String.length e > 0 && e.[0] <> '.' then p ^ "." ^ e else p ^ e) ((combined_paths paths) * exts) in List.find (if case_sensitive then file_exists_case else Sys.file_exists) alternatives let which ~ctxt prg = let path_sep = match Sys.os_type with | "Win32" -> ';' | _ -> ':' in let path_lst = OASISString.nsplit (Sys.getenv "PATH") path_sep in let exec_ext = match Sys.os_type with | "Win32" -> "" :: (OASISString.nsplit (Sys.getenv "PATHEXT") path_sep) | _ -> [""] in find_file ~case_sensitive:false [path_lst; [prg]] exec_ext (**/**) let rec fix_dir dn = (* Windows hack because Sys.file_exists "src\\" = false when * Sys.file_exists "src" = true *) let ln = String.length dn in if Sys.os_type = "Win32" && ln > 0 && dn.[ln - 1] = '\\' then fix_dir (String.sub dn 0 (ln - 1)) else dn let q = Filename.quote (**/**) let cp ~ctxt ?(recurse=false) src tgt = if recurse then match Sys.os_type with | "Win32" -> OASISExec.run ~ctxt "xcopy" [q src; q tgt; "/E"] | _ -> OASISExec.run ~ctxt "cp" ["-r"; q src; q tgt] else OASISExec.run ~ctxt (match Sys.os_type with | "Win32" -> "copy" | _ -> "cp") [q src; q tgt] let mkdir ~ctxt tgt = OASISExec.run ~ctxt (match Sys.os_type with | "Win32" -> "md" | _ -> "mkdir") [q tgt] let rec mkdir_parent ~ctxt f tgt = let tgt = fix_dir tgt in if Sys.file_exists tgt then begin if not (Sys.is_directory tgt) then OASISUtils.failwithf (f_ "Cannot create directory '%s', a file of the same name already \ exists") tgt end else begin mkdir_parent ~ctxt f (Filename.dirname tgt); if not (Sys.file_exists tgt) then begin f tgt; mkdir ~ctxt tgt end end let rmdir ~ctxt tgt = if Sys.readdir tgt = [||] then begin match Sys.os_type with | "Win32" -> OASISExec.run ~ctxt "rd" [q tgt] | _ -> OASISExec.run ~ctxt "rm" ["-r"; q tgt] end let glob ~ctxt fn = let basename = Filename.basename fn in if String.length basename >= 2 && basename.[0] = '*' && basename.[1] = '.' then begin let ext_len = (String.length basename) - 2 in let ext = String.sub basename 2 ext_len in let dirname = Filename.dirname fn in Array.fold_left (fun acc fn -> try let fn_ext = String.sub fn ((String.length fn) - ext_len) ext_len in if fn_ext = ext then (Filename.concat dirname fn) :: acc else acc with Invalid_argument _ -> acc) [] (Sys.readdir dirname) end else begin if file_exists_case fn then [fn] else [] end end # 2142 "setup.ml" module BaseEnvLight = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/base/BaseEnvLight.ml" *) module MapString = Map.Make(String) type t = string MapString.t let default_filename = Filename.concat (Sys.getcwd ()) "setup.data" let load ?(allow_empty=false) ?(filename=default_filename) () = if Sys.file_exists filename then begin let chn = open_in_bin filename in let st = Stream.of_channel chn in let line = ref 1 in let st_line = Stream.from (fun _ -> try match Stream.next st with | '\n' -> incr line; Some '\n' | c -> Some c with Stream.Failure -> None) in let lexer = Genlex.make_lexer ["="] st_line in let rec read_file mp = match Stream.npeek 3 lexer with | [Genlex.Ident nm; Genlex.Kwd "="; Genlex.String value] -> Stream.junk lexer; Stream.junk lexer; Stream.junk lexer; read_file (MapString.add nm value mp) | [] -> mp | _ -> failwith (Printf.sprintf "Malformed data file '%s' line %d" filename !line) in let mp = read_file MapString.empty in close_in chn; mp end else if allow_empty then begin MapString.empty end else begin failwith (Printf.sprintf "Unable to load environment, the file '%s' doesn't exist." filename) end let var_get name env = let rec var_expand str = let buff = Buffer.create ((String.length str) * 2) in Buffer.add_substitute buff (fun var -> try var_expand (MapString.find var env) with Not_found -> failwith (Printf.sprintf "No variable %s defined when trying to expand %S." var str)) str; Buffer.contents buff in var_expand (MapString.find name env) let var_choose lst env = OASISExpr.choose (fun nm -> var_get nm env) lst end # 2240 "setup.ml" module BaseContext = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/base/BaseContext.ml" *) open OASISContext let args = args let default = default end module BaseMessage = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/base/BaseMessage.ml" *) (** Message to user, overrid for Base @author Sylvain Le Gall *) open OASISMessage open BaseContext let debug fmt = debug ~ctxt:!default fmt let info fmt = info ~ctxt:!default fmt let warning fmt = warning ~ctxt:!default fmt let error fmt = error ~ctxt:!default fmt end module BaseEnv = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/base/BaseEnv.ml" *) open OASISGettext open OASISUtils open PropList module MapString = BaseEnvLight.MapString type origin_t = | ODefault | OGetEnv | OFileLoad | OCommandLine type cli_handle_t = | CLINone | CLIAuto | CLIWith | CLIEnable | CLIUser of (Arg.key * Arg.spec * Arg.doc) list type definition_t = { hide: bool; dump: bool; cli: cli_handle_t; arg_help: string option; group: string option; } let schema = Schema.create "environment" (* Environment data *) let env = Data.create () (* Environment data from file *) let env_from_file = ref MapString.empty (* Lexer for var *) let var_lxr = Genlex.make_lexer [] let rec var_expand str = let buff = Buffer.create ((String.length str) * 2) in Buffer.add_substitute buff (fun var -> try (* TODO: this is a quick hack to allow calling Test.Command * without defining executable name really. I.e. if there is * an exec Executable toto, then $(toto) should be replace * by its real name. It is however useful to have this function * for other variable that depend on the host and should be * written better than that. *) let st = var_lxr (Stream.of_string var) in match Stream.npeek 3 st with | [Genlex.Ident "utoh"; Genlex.Ident nm] -> OASISHostPath.of_unix (var_get nm) | [Genlex.Ident "utoh"; Genlex.String s] -> OASISHostPath.of_unix s | [Genlex.Ident "ocaml_escaped"; Genlex.Ident nm] -> String.escaped (var_get nm) | [Genlex.Ident "ocaml_escaped"; Genlex.String s] -> String.escaped s | [Genlex.Ident nm] -> var_get nm | _ -> failwithf (f_ "Unknown expression '%s' in variable expansion of %s.") var str with | Unknown_field (_, _) -> failwithf (f_ "No variable %s defined when trying to expand %S.") var str | Stream.Error e -> failwithf (f_ "Syntax error when parsing '%s' when trying to \ expand %S: %s") var str e) str; Buffer.contents buff and var_get name = let vl = try Schema.get schema env name with Unknown_field _ as e -> begin try MapString.find name !env_from_file with Not_found -> raise e end in var_expand vl let var_choose ?printer ?name lst = OASISExpr.choose ?printer ?name var_get lst let var_protect vl = let buff = Buffer.create (String.length vl) in String.iter (function | '$' -> Buffer.add_string buff "\\$" | c -> Buffer.add_char buff c) vl; Buffer.contents buff let var_define ?(hide=false) ?(dump=true) ?short_desc ?(cli=CLINone) ?arg_help ?group name (* TODO: type constraint on the fact that name must be a valid OCaml id *) dflt = let default = [ OFileLoad, (fun () -> MapString.find name !env_from_file); ODefault, dflt; OGetEnv, (fun () -> Sys.getenv name); ] in let extra = { hide = hide; dump = dump; cli = cli; arg_help = arg_help; group = group; } in (* Try to find a value that can be defined *) let var_get_low lst = let errors, res = List.fold_left (fun (errors, res) (o, v) -> if res = None then begin try errors, Some (v ()) with | Not_found -> errors, res | Failure rsn -> (rsn :: errors), res | e -> (Printexc.to_string e) :: errors, res end else errors, res) ([], None) (List.sort (fun (o1, _) (o2, _) -> Pervasives.compare o2 o1) lst) in match res, errors with | Some v, _ -> v | None, [] -> raise (Not_set (name, None)) | None, lst -> raise (Not_set (name, Some (String.concat (s_ ", ") lst))) in let help = match short_desc with | Some fs -> Some fs | None -> None in let var_get_lst = FieldRO.create ~schema ~name ~parse:(fun ?(context=ODefault) s -> [context, fun () -> s]) ~print:var_get_low ~default ~update:(fun ?context x old_x -> x @ old_x) ?help extra in fun () -> var_expand (var_get_low (var_get_lst env)) let var_redefine ?hide ?dump ?short_desc ?cli ?arg_help ?group name dflt = if Schema.mem schema name then begin (* TODO: look suspsicious, we want to memorize dflt not dflt () *) Schema.set schema env ~context:ODefault name (dflt ()); fun () -> var_get name end else begin var_define ?hide ?dump ?short_desc ?cli ?arg_help ?group name dflt end let var_ignore (e : unit -> string) = () let print_hidden = var_define ~hide:true ~dump:false ~cli:CLIAuto ~arg_help:"Print even non-printable variable. (debug)" "print_hidden" (fun () -> "false") let var_all () = List.rev (Schema.fold (fun acc nm def _ -> if not def.hide || bool_of_string (print_hidden ()) then nm :: acc else acc) [] schema) let default_filename = BaseEnvLight.default_filename let load ?allow_empty ?filename () = env_from_file := BaseEnvLight.load ?allow_empty ?filename () let unload () = env_from_file := MapString.empty; Data.clear env let dump ?(filename=default_filename) () = let chn = open_out_bin filename in let output nm value = Printf.fprintf chn "%s=%S\n" nm value in let mp_todo = (* Dump data from schema *) Schema.fold (fun mp_todo nm def _ -> if def.dump then begin try let value = Schema.get schema env nm in output nm value with Not_set _ -> () end; MapString.remove nm mp_todo) !env_from_file schema in (* Dump data defined outside of schema *) MapString.iter output mp_todo; (* End of the dump *) close_out chn let print () = let printable_vars = Schema.fold (fun acc nm def short_descr_opt -> if not def.hide || bool_of_string (print_hidden ()) then begin try let value = Schema.get schema env nm in let txt = match short_descr_opt with | Some s -> s () | None -> nm in (txt, value) :: acc with Not_set _ -> acc end else acc) [] schema in let max_length = List.fold_left max 0 (List.rev_map String.length (List.rev_map fst printable_vars)) in let dot_pad str = String.make ((max_length - (String.length str)) + 3) '.' in Printf.printf "\nConfiguration: \n"; List.iter (fun (name,value) -> Printf.printf "%s: %s %s\n" name (dot_pad name) value) (List.rev printable_vars); Printf.printf "\n%!" let args () = let arg_concat = OASISUtils.varname_concat ~hyphen:'-' in [ "--override", Arg.Tuple ( let rvr = ref "" in let rvl = ref "" in [ Arg.Set_string rvr; Arg.Set_string rvl; Arg.Unit (fun () -> Schema.set schema env ~context:OCommandLine !rvr !rvl) ] ), "var+val Override any configuration variable."; ] @ List.flatten (Schema.fold (fun acc name def short_descr_opt -> let var_set s = Schema.set schema env ~context:OCommandLine name s in let arg_name = OASISUtils.varname_of_string ~hyphen:'-' name in let hlp = match short_descr_opt with | Some txt -> txt () | None -> "" in let arg_hlp = match def.arg_help with | Some s -> s | None -> "str" in let default_value = try Printf.sprintf (f_ " [%s]") (Schema.get schema env name) with Not_set _ -> "" in let args = match def.cli with | CLINone -> [] | CLIAuto -> [ arg_concat "--" arg_name, Arg.String var_set, Printf.sprintf (f_ "%s %s%s") arg_hlp hlp default_value ] | CLIWith -> [ arg_concat "--with-" arg_name, Arg.String var_set, Printf.sprintf (f_ "%s %s%s") arg_hlp hlp default_value ] | CLIEnable -> let dflt = if default_value = " [true]" then s_ " [default: enabled]" else s_ " [default: disabled]" in [ arg_concat "--enable-" arg_name, Arg.Unit (fun () -> var_set "true"), Printf.sprintf (f_ " %s%s") hlp dflt; arg_concat "--disable-" arg_name, Arg.Unit (fun () -> var_set "false"), Printf.sprintf (f_ " %s%s") hlp dflt ] | CLIUser lst -> lst in args :: acc) [] schema) end module BaseArgExt = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/base/BaseArgExt.ml" *) open OASISUtils open OASISGettext let parse argv args = (* Simulate command line for Arg *) let current = ref 0 in try Arg.parse_argv ~current:current (Array.concat [[|"none"|]; argv]) (Arg.align args) (failwithf (f_ "Don't know what to do with arguments: '%s'")) (s_ "configure options:") with | Arg.Help txt -> print_endline txt; exit 0 | Arg.Bad txt -> prerr_endline txt; exit 1 end module BaseCheck = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/base/BaseCheck.ml" *) open BaseEnv open BaseMessage open OASISUtils open OASISGettext let prog_best prg prg_lst = var_redefine prg (fun () -> let alternate = List.fold_left (fun res e -> match res with | Some _ -> res | None -> try Some (OASISFileUtil.which ~ctxt:!BaseContext.default e) with Not_found -> None) None prg_lst in match alternate with | Some prg -> prg | None -> raise Not_found) let prog prg = prog_best prg [prg] let prog_opt prg = prog_best prg [prg^".opt"; prg] let ocamlfind = prog "ocamlfind" let version var_prefix cmp fversion () = (* Really compare version provided *) let var = var_prefix^"_version_"^(OASISVersion.varname_of_comparator cmp) in var_redefine ~hide:true var (fun () -> let version_str = match fversion () with | "[Distributed with OCaml]" -> begin try (var_get "ocaml_version") with Not_found -> warning (f_ "Variable ocaml_version not defined, fallback \ to default"); Sys.ocaml_version end | res -> res in let version = OASISVersion.version_of_string version_str in if OASISVersion.comparator_apply version cmp then version_str else failwithf (f_ "Cannot satisfy version constraint on %s: %s (version: %s)") var_prefix (OASISVersion.string_of_comparator cmp) version_str) () let package_version pkg = OASISExec.run_read_one_line ~ctxt:!BaseContext.default (ocamlfind ()) ["query"; "-format"; "%v"; pkg] let package ?version_comparator pkg () = let var = OASISUtils.varname_concat "pkg_" (OASISUtils.varname_of_string pkg) in let findlib_dir pkg = let dir = OASISExec.run_read_one_line ~ctxt:!BaseContext.default (ocamlfind ()) ["query"; "-format"; "%d"; pkg] in if Sys.file_exists dir && Sys.is_directory dir then dir else failwithf (f_ "When looking for findlib package %s, \ directory %s return doesn't exist") pkg dir in let vl = var_redefine var (fun () -> findlib_dir pkg) () in ( match version_comparator with | Some ver_cmp -> ignore (version var ver_cmp (fun _ -> package_version pkg) ()) | None -> () ); vl end module BaseOCamlcConfig = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/base/BaseOCamlcConfig.ml" *) open BaseEnv open OASISUtils open OASISGettext module SMap = Map.Make(String) let ocamlc = BaseCheck.prog_opt "ocamlc" let ocamlc_config_map = (* Map name to value for ocamlc -config output (name ^": "^value) *) let rec split_field mp lst = match lst with | line :: tl -> let mp = try let pos_semicolon = String.index line ':' in if pos_semicolon > 1 then ( let name = String.sub line 0 pos_semicolon in let linelen = String.length line in let value = if linelen > pos_semicolon + 2 then String.sub line (pos_semicolon + 2) (linelen - pos_semicolon - 2) else "" in SMap.add name value mp ) else ( mp ) with Not_found -> ( mp ) in split_field mp tl | [] -> mp in let cache = lazy (var_protect (Marshal.to_string (split_field SMap.empty (OASISExec.run_read_output ~ctxt:!BaseContext.default (ocamlc ()) ["-config"])) [])) in var_redefine "ocamlc_config_map" ~hide:true ~dump:false (fun () -> (* TODO: update if ocamlc change !!! *) Lazy.force cache) let var_define nm = (* Extract data from ocamlc -config *) let avlbl_config_get () = Marshal.from_string (ocamlc_config_map ()) 0 in let chop_version_suffix s = try String.sub s 0 (String.index s '+') with _ -> s in let nm_config, value_config = match nm with | "ocaml_version" -> "version", chop_version_suffix | _ -> nm, (fun x -> x) in var_redefine nm (fun () -> try let map = avlbl_config_get () in let value = SMap.find nm_config map in value_config value with Not_found -> failwithf (f_ "Cannot find field '%s' in '%s -config' output") nm (ocamlc ())) end module BaseStandardVar = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/base/BaseStandardVar.ml" *) open OASISGettext open OASISTypes open OASISExpr open BaseCheck open BaseEnv let ocamlfind = BaseCheck.ocamlfind let ocamlc = BaseOCamlcConfig.ocamlc let ocamlopt = prog_opt "ocamlopt" let ocamlbuild = prog "ocamlbuild" (**/**) let rpkg = ref None let pkg_get () = match !rpkg with | Some pkg -> pkg | None -> failwith (s_ "OASIS Package is not set") let var_cond = ref [] let var_define_cond ~since_version f dflt = let holder = ref (fun () -> dflt) in let since_version = OASISVersion.VGreaterEqual (OASISVersion.version_of_string since_version) in var_cond := (fun ver -> if OASISVersion.comparator_apply ver since_version then holder := f ()) :: !var_cond; fun () -> !holder () (**/**) let pkg_name = var_define ~short_desc:(fun () -> s_ "Package name") "pkg_name" (fun () -> (pkg_get ()).name) let pkg_version = var_define ~short_desc:(fun () -> s_ "Package version") "pkg_version" (fun () -> (OASISVersion.string_of_version (pkg_get ()).version)) let c = BaseOCamlcConfig.var_define let os_type = c "os_type" let system = c "system" let architecture = c "architecture" let ccomp_type = c "ccomp_type" let ocaml_version = c "ocaml_version" (* TODO: Check standard variable presence at runtime *) let standard_library_default = c "standard_library_default" let standard_library = c "standard_library" let standard_runtime = c "standard_runtime" let bytecomp_c_compiler = c "bytecomp_c_compiler" let native_c_compiler = c "native_c_compiler" let model = c "model" let ext_obj = c "ext_obj" let ext_asm = c "ext_asm" let ext_lib = c "ext_lib" let ext_dll = c "ext_dll" let default_executable_name = c "default_executable_name" let systhread_supported = c "systhread_supported" let flexlink = BaseCheck.prog "flexlink" let flexdll_version = var_define ~short_desc:(fun () -> "FlexDLL version (Win32)") "flexdll_version" (fun () -> let lst = OASISExec.run_read_output ~ctxt:!BaseContext.default (flexlink ()) ["-help"] in match lst with | line :: _ -> Scanf.sscanf line "FlexDLL version %s" (fun ver -> ver) | [] -> raise Not_found) (**/**) let p name hlp dflt = var_define ~short_desc:hlp ~cli:CLIAuto ~arg_help:"dir" name dflt let (/) a b = if os_type () = Sys.os_type then Filename.concat a b else if os_type () = "Unix" then OASISUnixPath.concat a b else OASISUtils.failwithf (f_ "Cannot handle os_type %s filename concat") (os_type ()) (**/**) let prefix = p "prefix" (fun () -> s_ "Install architecture-independent files dir") (fun () -> match os_type () with | "Win32" -> let program_files = Sys.getenv "PROGRAMFILES" in program_files/(pkg_name ()) | _ -> "/usr/local") let exec_prefix = p "exec_prefix" (fun () -> s_ "Install architecture-dependent files in dir") (fun () -> "$prefix") let bindir = p "bindir" (fun () -> s_ "User executables") (fun () -> "$exec_prefix"/"bin") let sbindir = p "sbindir" (fun () -> s_ "System admin executables") (fun () -> "$exec_prefix"/"sbin") let libexecdir = p "libexecdir" (fun () -> s_ "Program executables") (fun () -> "$exec_prefix"/"libexec") let sysconfdir = p "sysconfdir" (fun () -> s_ "Read-only single-machine data") (fun () -> "$prefix"/"etc") let sharedstatedir = p "sharedstatedir" (fun () -> s_ "Modifiable architecture-independent data") (fun () -> "$prefix"/"com") let localstatedir = p "localstatedir" (fun () -> s_ "Modifiable single-machine data") (fun () -> "$prefix"/"var") let libdir = p "libdir" (fun () -> s_ "Object code libraries") (fun () -> "$exec_prefix"/"lib") let datarootdir = p "datarootdir" (fun () -> s_ "Read-only arch-independent data root") (fun () -> "$prefix"/"share") let datadir = p "datadir" (fun () -> s_ "Read-only architecture-independent data") (fun () -> "$datarootdir") let infodir = p "infodir" (fun () -> s_ "Info documentation") (fun () -> "$datarootdir"/"info") let localedir = p "localedir" (fun () -> s_ "Locale-dependent data") (fun () -> "$datarootdir"/"locale") let mandir = p "mandir" (fun () -> s_ "Man documentation") (fun () -> "$datarootdir"/"man") let docdir = p "docdir" (fun () -> s_ "Documentation root") (fun () -> "$datarootdir"/"doc"/"$pkg_name") let htmldir = p "htmldir" (fun () -> s_ "HTML documentation") (fun () -> "$docdir") let dvidir = p "dvidir" (fun () -> s_ "DVI documentation") (fun () -> "$docdir") let pdfdir = p "pdfdir" (fun () -> s_ "PDF documentation") (fun () -> "$docdir") let psdir = p "psdir" (fun () -> s_ "PS documentation") (fun () -> "$docdir") let destdir = p "destdir" (fun () -> s_ "Prepend a path when installing package") (fun () -> raise (PropList.Not_set ("destdir", Some (s_ "undefined by construct")))) let findlib_version = var_define "findlib_version" (fun () -> BaseCheck.package_version "findlib") let is_native = var_define "is_native" (fun () -> try let _s : string = ocamlopt () in "true" with PropList.Not_set _ -> let _s : string = ocamlc () in "false") let ext_program = var_define "suffix_program" (fun () -> match os_type () with | "Win32" -> ".exe" | _ -> "") let rm = var_define ~short_desc:(fun () -> s_ "Remove a file.") "rm" (fun () -> match os_type () with | "Win32" -> "del" | _ -> "rm -f") let rmdir = var_define ~short_desc:(fun () -> s_ "Remove a directory.") "rmdir" (fun () -> match os_type () with | "Win32" -> "rd" | _ -> "rm -rf") let debug = var_define ~short_desc:(fun () -> s_ "Turn ocaml debug flag on") ~cli:CLIEnable "debug" (fun () -> "true") let profile = var_define ~short_desc:(fun () -> s_ "Turn ocaml profile flag on") ~cli:CLIEnable "profile" (fun () -> "false") let tests = var_define_cond ~since_version:"0.3" (fun () -> var_define ~short_desc:(fun () -> s_ "Compile tests executable and library and run them") ~cli:CLIEnable "tests" (fun () -> "false")) "true" let docs = var_define_cond ~since_version:"0.3" (fun () -> var_define ~short_desc:(fun () -> s_ "Create documentations") ~cli:CLIEnable "docs" (fun () -> "true")) "true" let native_dynlink = var_define ~short_desc:(fun () -> s_ "Compiler support generation of .cmxs.") ~cli:CLINone "native_dynlink" (fun () -> let res = let ocaml_lt_312 () = OASISVersion.comparator_apply (OASISVersion.version_of_string (ocaml_version ())) (OASISVersion.VLesser (OASISVersion.version_of_string "3.12.0")) in let flexdll_lt_030 () = OASISVersion.comparator_apply (OASISVersion.version_of_string (flexdll_version ())) (OASISVersion.VLesser (OASISVersion.version_of_string "0.30")) in let has_native_dynlink = let ocamlfind = ocamlfind () in try let fn = OASISExec.run_read_one_line ~ctxt:!BaseContext.default ocamlfind ["query"; "-predicates"; "native"; "dynlink"; "-format"; "%d/%a"] in Sys.file_exists fn with _ -> false in if not has_native_dynlink then false else if ocaml_lt_312 () then false else if (os_type () = "Win32" || os_type () = "Cygwin") && flexdll_lt_030 () then begin BaseMessage.warning (f_ ".cmxs generation disabled because FlexDLL needs to be \ at least 0.30. Please upgrade FlexDLL from %s to 0.30.") (flexdll_version ()); false end else true in string_of_bool res) let init pkg = rpkg := Some pkg; List.iter (fun f -> f pkg.oasis_version) !var_cond end module BaseFileAB = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/base/BaseFileAB.ml" *) open BaseEnv open OASISGettext open BaseMessage let to_filename fn = let fn = OASISHostPath.of_unix fn in if not (Filename.check_suffix fn ".ab") then warning (f_ "File '%s' doesn't have '.ab' extension") fn; Filename.chop_extension fn let replace fn_lst = let buff = Buffer.create 13 in List.iter (fun fn -> let fn = OASISHostPath.of_unix fn in let chn_in = open_in fn in let chn_out = open_out (to_filename fn) in ( try while true do Buffer.add_string buff (var_expand (input_line chn_in)); Buffer.add_char buff '\n' done with End_of_file -> () ); Buffer.output_buffer chn_out buff; Buffer.clear buff; close_in chn_in; close_out chn_out) fn_lst end module BaseLog = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/base/BaseLog.ml" *) open OASISUtils let default_filename = Filename.concat (Filename.dirname BaseEnv.default_filename) "setup.log" module SetTupleString = Set.Make (struct type t = string * string let compare (s11, s12) (s21, s22) = match String.compare s11 s21 with | 0 -> String.compare s12 s22 | n -> n end) let load () = if Sys.file_exists default_filename then begin let chn = open_in default_filename in let scbuf = Scanf.Scanning.from_file default_filename in let rec read_aux (st, lst) = if not (Scanf.Scanning.end_of_input scbuf) then begin let acc = try Scanf.bscanf scbuf "%S %S\n" (fun e d -> let t = e, d in if SetTupleString.mem t st then st, lst else SetTupleString.add t st, t :: lst) with Scanf.Scan_failure _ -> failwith (Scanf.bscanf scbuf "%l" (fun line -> Printf.sprintf "Malformed log file '%s' at line %d" default_filename line)) in read_aux acc end else begin close_in chn; List.rev lst end in read_aux (SetTupleString.empty, []) end else begin [] end let register event data = let chn_out = open_out_gen [Open_append; Open_creat; Open_text] 0o644 default_filename in Printf.fprintf chn_out "%S %S\n" event data; close_out chn_out let unregister event data = if Sys.file_exists default_filename then begin let lst = load () in let chn_out = open_out default_filename in let write_something = ref false in List.iter (fun (e, d) -> if e <> event || d <> data then begin write_something := true; Printf.fprintf chn_out "%S %S\n" e d end) lst; close_out chn_out; if not !write_something then Sys.remove default_filename end let filter events = let st_events = List.fold_left (fun st e -> SetString.add e st) SetString.empty events in List.filter (fun (e, _) -> SetString.mem e st_events) (load ()) let exists event data = List.exists (fun v -> (event, data) = v) (load ()) end module BaseBuilt = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/base/BaseBuilt.ml" *) open OASISTypes open OASISGettext open BaseStandardVar open BaseMessage type t = | BExec (* Executable *) | BExecLib (* Library coming with executable *) | BLib (* Library *) | BDoc (* Document *) let to_log_event_file t nm = "built_"^ (match t with | BExec -> "exec" | BExecLib -> "exec_lib" | BLib -> "lib" | BDoc -> "doc")^ "_"^nm let to_log_event_done t nm = "is_"^(to_log_event_file t nm) let register t nm lst = BaseLog.register (to_log_event_done t nm) "true"; List.iter (fun alt -> let registered = List.fold_left (fun registered fn -> if OASISFileUtil.file_exists_case fn then begin BaseLog.register (to_log_event_file t nm) (if Filename.is_relative fn then Filename.concat (Sys.getcwd ()) fn else fn); true end else registered) false alt in if not registered then warning (f_ "Cannot find an existing alternative files among: %s") (String.concat (s_ ", ") alt)) lst let unregister t nm = List.iter (fun (e, d) -> BaseLog.unregister e d) (BaseLog.filter [to_log_event_file t nm; to_log_event_done t nm]) let fold t nm f acc = List.fold_left (fun acc (_, fn) -> if OASISFileUtil.file_exists_case fn then begin f acc fn end else begin warning (f_ "File '%s' has been marked as built \ for %s but doesn't exist") fn (Printf.sprintf (match t with | BExec | BExecLib -> (f_ "executable %s") | BLib -> (f_ "library %s") | BDoc -> (f_ "documentation %s")) nm); acc end) acc (BaseLog.filter [to_log_event_file t nm]) let is_built t nm = List.fold_left (fun is_built (_, d) -> (try bool_of_string d with _ -> false)) false (BaseLog.filter [to_log_event_done t nm]) let of_executable ffn (cs, bs, exec) = let unix_exec_is, unix_dll_opt = OASISExecutable.unix_exec_is (cs, bs, exec) (fun () -> bool_of_string (is_native ())) ext_dll ext_program in let evs = (BExec, cs.cs_name, [[ffn unix_exec_is]]) :: (match unix_dll_opt with | Some fn -> [BExecLib, cs.cs_name, [[ffn fn]]] | None -> []) in evs, unix_exec_is, unix_dll_opt let of_library ffn (cs, bs, lib) = let unix_lst = OASISLibrary.generated_unix_files ~ctxt:!BaseContext.default ~source_file_exists:(fun fn -> OASISFileUtil.file_exists_case (OASISHostPath.of_unix fn)) ~is_native:(bool_of_string (is_native ())) ~has_native_dynlink:(bool_of_string (native_dynlink ())) ~ext_lib:(ext_lib ()) ~ext_dll:(ext_dll ()) (cs, bs, lib) in let evs = [BLib, cs.cs_name, List.map (List.map ffn) unix_lst] in evs, unix_lst end module BaseCustom = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/base/BaseCustom.ml" *) open BaseEnv open BaseMessage open OASISTypes open OASISGettext let run cmd args extra_args = OASISExec.run ~ctxt:!BaseContext.default ~quote:false (var_expand cmd) (List.map var_expand (args @ (Array.to_list extra_args))) let hook ?(failsafe=false) cstm f e = let optional_command lst = let printer = function | Some (cmd, args) -> String.concat " " (cmd :: args) | None -> s_ "No command" in match var_choose ~name:(s_ "Pre/Post Command") ~printer lst with | Some (cmd, args) -> begin try run cmd args [||] with e when failsafe -> warning (f_ "Command '%s' fail with error: %s") (String.concat " " (cmd :: args)) (match e with | Failure msg -> msg | e -> Printexc.to_string e) end | None -> () in let res = optional_command cstm.pre_command; f e in optional_command cstm.post_command; res end module BaseDynVar = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/base/BaseDynVar.ml" *) open OASISTypes open OASISGettext open BaseEnv open BaseBuilt let init pkg = (* TODO: disambiguate exec vs other variable by adding exec_VARNAME. *) (* TODO: provide compile option for library libary_byte_args_VARNAME... *) List.iter (function | Executable (cs, bs, exec) -> if var_choose bs.bs_build then var_ignore (var_redefine (* We don't save this variable *) ~dump:false ~short_desc:(fun () -> Printf.sprintf (f_ "Filename of executable '%s'") cs.cs_name) (OASISUtils.varname_of_string cs.cs_name) (fun () -> let fn_opt = fold BExec cs.cs_name (fun _ fn -> Some fn) None in match fn_opt with | Some fn -> fn | None -> raise (PropList.Not_set (cs.cs_name, Some (Printf.sprintf (f_ "Executable '%s' not yet built.") cs.cs_name))))) | Library _ | Flag _ | Test _ | SrcRepo _ | Doc _ -> ()) pkg.sections end module BaseTest = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/base/BaseTest.ml" *) open BaseEnv open BaseMessage open OASISTypes open OASISExpr open OASISGettext let test lst pkg extra_args = let one_test (failure, n) (test_plugin, cs, test) = if var_choose ~name:(Printf.sprintf (f_ "test %s run") cs.cs_name) ~printer:string_of_bool test.test_run then begin let () = info (f_ "Running test '%s'") cs.cs_name in let back_cwd = match test.test_working_directory with | Some dir -> let cwd = Sys.getcwd () in let chdir d = info (f_ "Changing directory to '%s'") d; Sys.chdir d in chdir dir; fun () -> chdir cwd | None -> fun () -> () in try let failure_percent = BaseCustom.hook test.test_custom (test_plugin pkg (cs, test)) extra_args in back_cwd (); (failure_percent +. failure, n + 1) with e -> begin back_cwd (); raise e end end else begin info (f_ "Skipping test '%s'") cs.cs_name; (failure, n) end in let (failed, n) = List.fold_left one_test (0.0, 0) lst in let failure_percent = if n = 0 then 0.0 else failed /. (float_of_int n) in let msg = Printf.sprintf (f_ "Tests had a %.2f%% failure rate") (100. *. failure_percent) in if failure_percent > 0.0 then failwith msg else info "%s" msg; (* Possible explanation why the tests where not run. *) if OASISVersion.version_0_3_or_after pkg.oasis_version && not (bool_of_string (BaseStandardVar.tests ())) && lst <> [] then BaseMessage.warning "Tests are turned off, consider enabling with \ 'ocaml setup.ml -configure --enable-tests'" end module BaseDoc = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/base/BaseDoc.ml" *) open BaseEnv open BaseMessage open OASISTypes open OASISGettext let doc lst pkg extra_args = let one_doc (doc_plugin, cs, doc) = if var_choose ~name:(Printf.sprintf (f_ "documentation %s build") cs.cs_name) ~printer:string_of_bool doc.doc_build then begin info (f_ "Building documentation '%s'") cs.cs_name; BaseCustom.hook doc.doc_custom (doc_plugin pkg (cs, doc)) extra_args end in List.iter one_doc lst; if OASISVersion.version_0_3_or_after pkg.oasis_version && not (bool_of_string (BaseStandardVar.docs ())) && lst <> [] then BaseMessage.warning "Docs are turned off, consider enabling with \ 'ocaml setup.ml -configure --enable-docs'" end module BaseSetup = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/base/BaseSetup.ml" *) open BaseEnv open BaseMessage open OASISTypes open OASISSection open OASISGettext open OASISUtils type std_args_fun = package -> string array -> unit type ('a, 'b) section_args_fun = name * (package -> (common_section * 'a) -> string array -> 'b) type t = { configure: std_args_fun; build: std_args_fun; doc: ((doc, unit) section_args_fun) list; test: ((test, float) section_args_fun) list; install: std_args_fun; uninstall: std_args_fun; clean: std_args_fun list; clean_doc: (doc, unit) section_args_fun list; clean_test: (test, unit) section_args_fun list; distclean: std_args_fun list; distclean_doc: (doc, unit) section_args_fun list; distclean_test: (test, unit) section_args_fun list; package: package; oasis_fn: string option; oasis_version: string; oasis_digest: Digest.t option; oasis_exec: string option; oasis_setup_args: string list; setup_update: bool; } (* Associate a plugin function with data from package *) let join_plugin_sections filter_map lst = List.rev (List.fold_left (fun acc sct -> match filter_map sct with | Some e -> e :: acc | None -> acc) [] lst) (* Search for plugin data associated with a section name *) let lookup_plugin_section plugin action nm lst = try List.assoc nm lst with Not_found -> failwithf (f_ "Cannot find plugin %s matching section %s for %s action") plugin nm action let configure t args = (* Run configure *) BaseCustom.hook t.package.conf_custom (fun () -> (* Reload if preconf has changed it *) begin try unload (); load (); with _ -> () end; (* Run plugin's configure *) t.configure t.package args; (* Dump to allow postconf to change it *) dump ()) (); (* Reload environment *) unload (); load (); (* Save environment *) print (); (* Replace data in file *) BaseFileAB.replace t.package.files_ab let build t args = BaseCustom.hook t.package.build_custom (t.build t.package) args let doc t args = BaseDoc.doc (join_plugin_sections (function | Doc (cs, e) -> Some (lookup_plugin_section "documentation" (s_ "build") cs.cs_name t.doc, cs, e) | _ -> None) t.package.sections) t.package args let test t args = BaseTest.test (join_plugin_sections (function | Test (cs, e) -> Some (lookup_plugin_section "test" (s_ "run") cs.cs_name t.test, cs, e) | _ -> None) t.package.sections) t.package args let all t args = let rno_doc = ref false in let rno_test = ref false in Arg.parse_argv ~current:(ref 0) (Array.of_list ((Sys.executable_name^" all") :: (Array.to_list args))) [ "-no-doc", Arg.Set rno_doc, s_ "Don't run doc target"; "-no-test", Arg.Set rno_test, s_ "Don't run test target"; ] (failwithf (f_ "Don't know what to do with '%s'")) ""; info "Running configure step"; configure t [||]; info "Running build step"; build t [||]; (* Load setup.log dynamic variables *) BaseDynVar.init t.package; if not !rno_doc then begin info "Running doc step"; doc t [||]; end else begin info "Skipping doc step" end; if not !rno_test then begin info "Running test step"; test t [||] end else begin info "Skipping test step" end let install t args = BaseCustom.hook t.package.install_custom (t.install t.package) args let uninstall t args = BaseCustom.hook t.package.uninstall_custom (t.uninstall t.package) args let reinstall t args = uninstall t args; install t args let clean, distclean = let failsafe f a = try f a with e -> warning (f_ "Action fail with error: %s") (match e with | Failure msg -> msg | e -> Printexc.to_string e) in let generic_clean t cstm mains docs tests args = BaseCustom.hook ~failsafe:true cstm (fun () -> (* Clean section *) List.iter (function | Test (cs, test) -> let f = try List.assoc cs.cs_name tests with Not_found -> fun _ _ _ -> () in failsafe (f t.package (cs, test)) args | Doc (cs, doc) -> let f = try List.assoc cs.cs_name docs with Not_found -> fun _ _ _ -> () in failsafe (f t.package (cs, doc)) args | Library _ | Executable _ | Flag _ | SrcRepo _ -> ()) t.package.sections; (* Clean whole package *) List.iter (fun f -> failsafe (f t.package) args) mains) () in let clean t args = generic_clean t t.package.clean_custom t.clean t.clean_doc t.clean_test args in let distclean t args = (* Call clean *) clean t args; (* Call distclean code *) generic_clean t t.package.distclean_custom t.distclean t.distclean_doc t.distclean_test args; (* Remove generated file *) List.iter (fun fn -> if Sys.file_exists fn then begin info (f_ "Remove '%s'") fn; Sys.remove fn end) (BaseEnv.default_filename :: BaseLog.default_filename :: (List.rev_map BaseFileAB.to_filename t.package.files_ab)) in clean, distclean let version t _ = print_endline t.oasis_version let update_setup_ml, no_update_setup_ml_cli = let b = ref true in b, ("-no-update-setup-ml", Arg.Clear b, s_ " Don't try to update setup.ml, even if _oasis has changed.") let update_setup_ml t = let oasis_fn = match t.oasis_fn with | Some fn -> fn | None -> "_oasis" in let oasis_exec = match t.oasis_exec with | Some fn -> fn | None -> "oasis" in let ocaml = Sys.executable_name in let setup_ml, args = match Array.to_list Sys.argv with | setup_ml :: args -> setup_ml, args | [] -> failwith (s_ "Expecting non-empty command line arguments.") in let ocaml, setup_ml = if Sys.executable_name = Sys.argv.(0) then (* We are not running in standard mode, probably the script * is precompiled. *) "ocaml", "setup.ml" else ocaml, setup_ml in let no_update_setup_ml_cli, _, _ = no_update_setup_ml_cli in let do_update () = let oasis_exec_version = OASISExec.run_read_one_line ~ctxt:!BaseContext.default ~f_exit_code: (function | 0 -> () | 1 -> failwithf (f_ "Executable '%s' is probably an old version \ of oasis (< 0.3.0), please update to version \ v%s.") oasis_exec t.oasis_version | 127 -> failwithf (f_ "Cannot find executable '%s', please install \ oasis v%s.") oasis_exec t.oasis_version | n -> failwithf (f_ "Command '%s version' exited with code %d.") oasis_exec n) oasis_exec ["version"] in if OASISVersion.comparator_apply (OASISVersion.version_of_string oasis_exec_version) (OASISVersion.VGreaterEqual (OASISVersion.version_of_string t.oasis_version)) then begin (* We have a version >= for the executable oasis, proceed with * update. *) (* TODO: delegate this check to 'oasis setup'. *) if Sys.os_type = "Win32" then failwithf (f_ "It is not possible to update the running script \ setup.ml on Windows. Please update setup.ml by \ running '%s'.") (String.concat " " (oasis_exec :: "setup" :: t.oasis_setup_args)) else begin OASISExec.run ~ctxt:!BaseContext.default ~f_exit_code: (function | 0 -> () | n -> failwithf (f_ "Unable to update setup.ml using '%s', \ please fix the problem and retry.") oasis_exec) oasis_exec ("setup" :: t.oasis_setup_args); OASISExec.run ~ctxt:!BaseContext.default ocaml (setup_ml :: args) end end else failwithf (f_ "The version of '%s' (v%s) doesn't match the version of \ oasis used to generate the %s file. Please install at \ least oasis v%s.") oasis_exec oasis_exec_version setup_ml t.oasis_version in if !update_setup_ml then begin try match t.oasis_digest with | Some dgst -> if Sys.file_exists oasis_fn && dgst <> Digest.file "_oasis" then begin do_update (); true end else false | None -> false with e -> error (f_ "Error when updating setup.ml. If you want to avoid this error, \ you can bypass the update of %s by running '%s %s %s %s'") setup_ml ocaml setup_ml no_update_setup_ml_cli (String.concat " " args); raise e end else false let setup t = let catch_exn = ref true in try let act_ref = ref (fun _ -> failwithf (f_ "No action defined, run '%s %s -help'") Sys.executable_name Sys.argv.(0)) in let extra_args_ref = ref [] in let allow_empty_env_ref = ref false in let arg_handle ?(allow_empty_env=false) act = Arg.Tuple [ Arg.Rest (fun str -> extra_args_ref := str :: !extra_args_ref); Arg.Unit (fun () -> allow_empty_env_ref := allow_empty_env; act_ref := act); ] in Arg.parse (Arg.align ([ "-configure", arg_handle ~allow_empty_env:true configure, s_ "[options*] Configure the whole build process."; "-build", arg_handle build, s_ "[options*] Build executables and libraries."; "-doc", arg_handle doc, s_ "[options*] Build documents."; "-test", arg_handle test, s_ "[options*] Run tests."; "-all", arg_handle ~allow_empty_env:true all, s_ "[options*] Run configure, build, doc and test targets."; "-install", arg_handle install, s_ "[options*] Install libraries, data, executables \ and documents."; "-uninstall", arg_handle uninstall, s_ "[options*] Uninstall libraries, data, executables \ and documents."; "-reinstall", arg_handle reinstall, s_ "[options*] Uninstall and install libraries, data, \ executables and documents."; "-clean", arg_handle ~allow_empty_env:true clean, s_ "[options*] Clean files generated by a build."; "-distclean", arg_handle ~allow_empty_env:true distclean, s_ "[options*] Clean files generated by a build and configure."; "-version", arg_handle ~allow_empty_env:true version, s_ " Display version of OASIS used to generate this setup.ml."; "-no-catch-exn", Arg.Clear catch_exn, s_ " Don't catch exception, useful for debugging."; ] @ (if t.setup_update then [no_update_setup_ml_cli] else []) @ (BaseContext.args ()))) (failwithf (f_ "Don't know what to do with '%s'")) (s_ "Setup and run build process current package\n"); (* Build initial environment *) load ~allow_empty:!allow_empty_env_ref (); (** Initialize flags *) List.iter (function | Flag (cs, {flag_description = hlp; flag_default = choices}) -> begin let apply ?short_desc () = var_ignore (var_define ~cli:CLIEnable ?short_desc (OASISUtils.varname_of_string cs.cs_name) (fun () -> string_of_bool (var_choose ~name:(Printf.sprintf (f_ "default value of flag %s") cs.cs_name) ~printer:string_of_bool choices))) in match hlp with | Some hlp -> apply ~short_desc:(fun () -> hlp) () | None -> apply () end | _ -> ()) t.package.sections; BaseStandardVar.init t.package; BaseDynVar.init t.package; if t.setup_update && update_setup_ml t then () else !act_ref t (Array.of_list (List.rev !extra_args_ref)) with e when !catch_exn -> error "%s" (Printexc.to_string e); exit 1 end # 4480 "setup.ml" module InternalConfigurePlugin = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/plugins/internal/InternalConfigurePlugin.ml" *) (** Configure using internal scheme @author Sylvain Le Gall *) open BaseEnv open OASISTypes open OASISUtils open OASISGettext open BaseMessage (** Configure build using provided series of check to be done * and then output corresponding file. *) let configure pkg argv = let var_ignore_eval var = let _s : string = var () in () in let errors = ref SetString.empty in let buff = Buffer.create 13 in let add_errors fmt = Printf.kbprintf (fun b -> errors := SetString.add (Buffer.contents b) !errors; Buffer.clear b) buff fmt in let warn_exception e = warning "%s" (Printexc.to_string e) in (* Check tools *) let check_tools lst = List.iter (function | ExternalTool tool -> begin try var_ignore_eval (BaseCheck.prog tool) with e -> warn_exception e; add_errors (f_ "Cannot find external tool '%s'") tool end | InternalExecutable nm1 -> (* Check that matching tool is built *) List.iter (function | Executable ({cs_name = nm2}, {bs_build = build}, _) when nm1 = nm2 -> if not (var_choose build) then add_errors (f_ "Cannot find buildable internal executable \ '%s' when checking build depends") nm1 | _ -> ()) pkg.sections) lst in let build_checks sct bs = if var_choose bs.bs_build then begin if bs.bs_compiled_object = Native then begin try var_ignore_eval BaseStandardVar.ocamlopt with e -> warn_exception e; add_errors (f_ "Section %s requires native compilation") (OASISSection.string_of_section sct) end; (* Check tools *) check_tools bs.bs_build_tools; (* Check depends *) List.iter (function | FindlibPackage (findlib_pkg, version_comparator) -> begin try var_ignore_eval (BaseCheck.package ?version_comparator findlib_pkg) with e -> warn_exception e; match version_comparator with | None -> add_errors (f_ "Cannot find findlib package %s") findlib_pkg | Some ver_cmp -> add_errors (f_ "Cannot find findlib package %s (%s)") findlib_pkg (OASISVersion.string_of_comparator ver_cmp) end | InternalLibrary nm1 -> (* Check that matching library is built *) List.iter (function | Library ({cs_name = nm2}, {bs_build = build}, _) when nm1 = nm2 -> if not (var_choose build) then add_errors (f_ "Cannot find buildable internal library \ '%s' when checking build depends") nm1 | _ -> ()) pkg.sections) bs.bs_build_depends end in (* Parse command line *) BaseArgExt.parse argv (BaseEnv.args ()); (* OCaml version *) begin match pkg.ocaml_version with | Some ver_cmp -> begin try var_ignore_eval (BaseCheck.version "ocaml" ver_cmp BaseStandardVar.ocaml_version) with e -> warn_exception e; add_errors (f_ "OCaml version %s doesn't match version constraint %s") (BaseStandardVar.ocaml_version ()) (OASISVersion.string_of_comparator ver_cmp) end | None -> () end; (* Findlib version *) begin match pkg.findlib_version with | Some ver_cmp -> begin try var_ignore_eval (BaseCheck.version "findlib" ver_cmp BaseStandardVar.findlib_version) with e -> warn_exception e; add_errors (f_ "Findlib version %s doesn't match version constraint %s") (BaseStandardVar.findlib_version ()) (OASISVersion.string_of_comparator ver_cmp) end | None -> () end; (* FlexDLL *) if BaseStandardVar.os_type () = "Win32" || BaseStandardVar.os_type () = "Cygwin" then begin try var_ignore_eval BaseStandardVar.flexlink with e -> warn_exception e; add_errors (f_ "Cannot find 'flexlink'") end; (* Check build depends *) List.iter (function | Executable (_, bs, _) | Library (_, bs, _) as sct -> build_checks sct bs | Doc (_, doc) -> if var_choose doc.doc_build then check_tools doc.doc_build_tools | Test (_, test) -> if var_choose test.test_run then check_tools test.test_tools | _ -> ()) pkg.sections; (* Check if we need native dynlink (presence of libraries that compile to * native) *) begin let has_cmxa = List.exists (function | Library (_, bs, _) -> var_choose bs.bs_build && (bs.bs_compiled_object = Native || (bs.bs_compiled_object = Best && bool_of_string (BaseStandardVar.is_native ()))) | _ -> false) pkg.sections in if has_cmxa then var_ignore_eval BaseStandardVar.native_dynlink end; (* Check errors *) if SetString.empty != !errors then begin List.iter (fun e -> error "%s" e) (SetString.elements !errors); failwithf (fn_ "%d configuration error" "%d configuration errors" (SetString.cardinal !errors)) (SetString.cardinal !errors) end end module InternalInstallPlugin = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/plugins/internal/InternalInstallPlugin.ml" *) (** Install using internal scheme @author Sylvain Le Gall *) open BaseEnv open BaseStandardVar open BaseMessage open OASISTypes open OASISLibrary open OASISGettext open OASISUtils let exec_hook = ref (fun (cs, bs, exec) -> cs, bs, exec) let lib_hook = ref (fun (cs, bs, lib) -> cs, bs, lib, []) let doc_hook = ref (fun (cs, doc) -> cs, doc) let install_file_ev = "install-file" let install_dir_ev = "install-dir" let install_findlib_ev = "install-findlib" let win32_max_command_line_length = 8000 let split_install_command ocamlfind findlib_name meta files = if Sys.os_type = "Win32" then (* Arguments for the first command: *) let first_args = ["install"; findlib_name; meta] in (* Arguments for remaining commands: *) let other_args = ["install"; findlib_name; "-add"] in (* Extract as much files as possible from [files], [len] is the current command line length: *) let rec get_files len acc files = match files with | [] -> (List.rev acc, []) | file :: rest -> let len = len + 1 + String.length file in if len > win32_max_command_line_length then (List.rev acc, files) else get_files len (file :: acc) rest in (* Split the command into several commands. *) let rec split args files = match files with | [] -> [] | _ -> (* Length of "ocamlfind install [META|-add]" *) let len = List.fold_left (fun len arg -> len + 1 (* for the space *) + String.length arg) (String.length ocamlfind) args in match get_files len [] files with | ([], _) -> failwith (s_ "Command line too long.") | (firsts, others) -> let cmd = args @ firsts in (* Use -add for remaining commands: *) let () = let findlib_ge_132 = OASISVersion.comparator_apply (OASISVersion.version_of_string (BaseStandardVar.findlib_version ())) (OASISVersion.VGreaterEqual (OASISVersion.version_of_string "1.3.2")) in if not findlib_ge_132 then failwithf (f_ "Installing the library %s require to use the flag \ '-add' of ocamlfind because the command line is too \ long. This flag is only available for findlib 1.3.2. \ Please upgrade findlib from %s to 1.3.2") findlib_name (BaseStandardVar.findlib_version ()) in let cmds = split other_args others in cmd :: cmds in (* The first command does not use -add: *) split first_args files else ["install" :: findlib_name :: meta :: files] let install pkg argv = let in_destdir = try let destdir = destdir () in (* Practically speaking destdir is prepended * at the beginning of the target filename *) fun fn -> destdir^fn with PropList.Not_set _ -> fun fn -> fn in let install_file ?tgt_fn src_file envdir = let tgt_dir = in_destdir (envdir ()) in let tgt_file = Filename.concat tgt_dir (match tgt_fn with | Some fn -> fn | None -> Filename.basename src_file) in (* Create target directory if needed *) OASISFileUtil.mkdir_parent ~ctxt:!BaseContext.default (fun dn -> info (f_ "Creating directory '%s'") dn; BaseLog.register install_dir_ev dn) tgt_dir; (* Really install files *) info (f_ "Copying file '%s' to '%s'") src_file tgt_file; OASISFileUtil.cp ~ctxt:!BaseContext.default src_file tgt_file; BaseLog.register install_file_ev tgt_file in (* Install data into defined directory *) let install_data srcdir lst tgtdir = let tgtdir = OASISHostPath.of_unix (var_expand tgtdir) in List.iter (fun (src, tgt_opt) -> let real_srcs = OASISFileUtil.glob ~ctxt:!BaseContext.default (Filename.concat srcdir src) in if real_srcs = [] then failwithf (f_ "Wildcard '%s' doesn't match any files") src; List.iter (fun fn -> install_file fn (fun () -> match tgt_opt with | Some s -> OASISHostPath.of_unix (var_expand s) | None -> tgtdir)) real_srcs) lst in (** Install all libraries *) let install_libs pkg = let files_of_library (f_data, acc) data_lib = let cs, bs, lib, lib_extra = !lib_hook data_lib in if var_choose bs.bs_install && BaseBuilt.is_built BaseBuilt.BLib cs.cs_name then begin let acc = (* Start with acc + lib_extra *) List.rev_append lib_extra acc in let acc = (* Add uncompiled header from the source tree *) let path = OASISHostPath.of_unix bs.bs_path in List.fold_left (fun acc modul -> try List.find OASISFileUtil.file_exists_case (List.map (Filename.concat path) [modul^".mli"; modul^".ml"; String.uncapitalize modul^".mli"; String.capitalize modul^".mli"; String.uncapitalize modul^".ml"; String.capitalize modul^".ml"]) :: acc with Not_found -> begin warning (f_ "Cannot find source header for module %s \ in library %s") modul cs.cs_name; acc end) acc lib.lib_modules in let acc = (* Get generated files *) BaseBuilt.fold BaseBuilt.BLib cs.cs_name (fun acc fn -> fn :: acc) acc in let f_data () = (* Install data associated with the library *) install_data bs.bs_path bs.bs_data_files (Filename.concat (datarootdir ()) pkg.name); f_data () in (f_data, acc) end else begin (f_data, acc) end in (* Install one group of library *) let install_group_lib grp = (* Iterate through all group nodes *) let rec install_group_lib_aux data_and_files grp = let data_and_files, children = match grp with | Container (_, children) -> data_and_files, children | Package (_, cs, bs, lib, children) -> files_of_library data_and_files (cs, bs, lib), children in List.fold_left install_group_lib_aux data_and_files children in (* Findlib name of the root library *) let findlib_name = findlib_of_group grp in (* Determine root library *) let root_lib = root_of_group grp in (* All files to install for this library *) let f_data, files = install_group_lib_aux (ignore, []) grp in (* Really install, if there is something to install *) if files = [] then begin warning (f_ "Nothing to install for findlib library '%s'") findlib_name end else begin let meta = (* Search META file *) let (_, bs, _) = root_lib in let res = Filename.concat bs.bs_path "META" in if not (OASISFileUtil.file_exists_case res) then failwithf (f_ "Cannot find file '%s' for findlib library %s") res findlib_name; res in let files = (* Make filename shorter to avoid hitting command max line length * too early, esp. on Windows. *) let remove_prefix p n = let plen = String.length p in let nlen = String.length n in if plen <= nlen && String.sub n 0 plen = p then begin let fn_sep = if Sys.os_type = "Win32" then '\\' else '/' in let cutpoint = plen + (if plen < nlen && n.[plen] = fn_sep then 1 else 0) in String.sub n cutpoint (nlen - cutpoint) end else n in List.map (remove_prefix (Sys.getcwd ())) files in info (f_ "Installing findlib library '%s'") findlib_name; let ocamlfind = ocamlfind () in let commands = split_install_command ocamlfind findlib_name meta files in List.iter (OASISExec.run ~ctxt:!BaseContext.default ocamlfind) commands; BaseLog.register install_findlib_ev findlib_name end; (* Install data files *) f_data (); in let group_libs, _, _ = findlib_mapping pkg in (* We install libraries in groups *) List.iter install_group_lib group_libs in let install_execs pkg = let install_exec data_exec = let (cs, bs, exec) = !exec_hook data_exec in if var_choose bs.bs_install && BaseBuilt.is_built BaseBuilt.BExec cs.cs_name then begin let exec_libdir () = Filename.concat (libdir ()) pkg.name in BaseBuilt.fold BaseBuilt.BExec cs.cs_name (fun () fn -> install_file ~tgt_fn:(cs.cs_name ^ ext_program ()) fn bindir) (); BaseBuilt.fold BaseBuilt.BExecLib cs.cs_name (fun () fn -> install_file fn exec_libdir) (); install_data bs.bs_path bs.bs_data_files (Filename.concat (datarootdir ()) pkg.name) end in List.iter (function | Executable (cs, bs, exec)-> install_exec (cs, bs, exec) | _ -> ()) pkg.sections in let install_docs pkg = let install_doc data = let (cs, doc) = !doc_hook data in if var_choose doc.doc_install && BaseBuilt.is_built BaseBuilt.BDoc cs.cs_name then begin let tgt_dir = OASISHostPath.of_unix (var_expand doc.doc_install_dir) in BaseBuilt.fold BaseBuilt.BDoc cs.cs_name (fun () fn -> install_file fn (fun () -> tgt_dir)) (); install_data Filename.current_dir_name doc.doc_data_files doc.doc_install_dir end in List.iter (function | Doc (cs, doc) -> install_doc (cs, doc) | _ -> ()) pkg.sections in install_libs pkg; install_execs pkg; install_docs pkg (* Uninstall already installed data *) let uninstall _ argv = List.iter (fun (ev, data) -> if ev = install_file_ev then begin if OASISFileUtil.file_exists_case data then begin info (f_ "Removing file '%s'") data; Sys.remove data end else begin warning (f_ "File '%s' doesn't exist anymore") data end end else if ev = install_dir_ev then begin if Sys.file_exists data && Sys.is_directory data then begin if Sys.readdir data = [||] then begin info (f_ "Removing directory '%s'") data; OASISFileUtil.rmdir ~ctxt:!BaseContext.default data end else begin warning (f_ "Directory '%s' is not empty (%s)") data (String.concat ", " (Array.to_list (Sys.readdir data))) end end else begin warning (f_ "Directory '%s' doesn't exist anymore") data end end else if ev = install_findlib_ev then begin info (f_ "Removing findlib library '%s'") data; OASISExec.run ~ctxt:!BaseContext.default (ocamlfind ()) ["remove"; data] end else failwithf (f_ "Unknown log event '%s'") ev; BaseLog.unregister ev data) (* We process event in reverse order *) (List.rev (BaseLog.filter [install_file_ev; install_dir_ev; install_findlib_ev;])) end # 5233 "setup.ml" module OCamlbuildCommon = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/plugins/ocamlbuild/OCamlbuildCommon.ml" *) (** Functions common to OCamlbuild build and doc plugin *) open OASISGettext open BaseEnv open BaseStandardVar let ocamlbuild_clean_ev = "ocamlbuild-clean" let ocamlbuildflags = var_define ~short_desc:(fun () -> "OCamlbuild additional flags") "ocamlbuildflags" (fun () -> "") (** Fix special arguments depending on environment *) let fix_args args extra_argv = List.flatten [ if (os_type ()) = "Win32" then [ "-classic-display"; "-no-log"; "-no-links"; "-install-lib-dir"; (Filename.concat (standard_library ()) "ocamlbuild") ] else []; if not (bool_of_string (is_native ())) || (os_type ()) = "Win32" then [ "-byte-plugin" ] else []; args; if bool_of_string (debug ()) then ["-tag"; "debug"] else []; if bool_of_string (profile ()) then ["-tag"; "profile"] else []; OASISString.nsplit (ocamlbuildflags ()) ' '; Array.to_list extra_argv; ] (** Run 'ocamlbuild -clean' if not already done *) let run_clean extra_argv = let extra_cli = String.concat " " (Array.to_list extra_argv) in (* Run if never called with these args *) if not (BaseLog.exists ocamlbuild_clean_ev extra_cli) then begin OASISExec.run ~ctxt:!BaseContext.default (ocamlbuild ()) (fix_args ["-clean"] extra_argv); BaseLog.register ocamlbuild_clean_ev extra_cli; at_exit (fun () -> try BaseLog.unregister ocamlbuild_clean_ev extra_cli with _ -> ()) end (** Run ocamlbuild, unregister all clean events *) let run_ocamlbuild args extra_argv = (* TODO: enforce that target in args must be UNIX encoded i.e. toto/index.html *) OASISExec.run ~ctxt:!BaseContext.default (ocamlbuild ()) (fix_args args extra_argv); (* Remove any clean event, we must run it again *) List.iter (fun (e, d) -> BaseLog.unregister e d) (BaseLog.filter [ocamlbuild_clean_ev]) (** Determine real build directory *) let build_dir extra_argv = let rec search_args dir = function | "-build-dir" :: dir :: tl -> search_args dir tl | _ :: tl -> search_args dir tl | [] -> dir in search_args "_build" (fix_args [] extra_argv) end module OCamlbuildPlugin = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/plugins/ocamlbuild/OCamlbuildPlugin.ml" *) (** Build using ocamlbuild @author Sylvain Le Gall *) open OASISTypes open OASISGettext open OASISUtils open BaseEnv open OCamlbuildCommon open BaseStandardVar open BaseMessage let cond_targets_hook = ref (fun lst -> lst) let build pkg argv = (* Return the filename in build directory *) let in_build_dir fn = Filename.concat (build_dir argv) fn in (* Return the unix filename in host build directory *) let in_build_dir_of_unix fn = in_build_dir (OASISHostPath.of_unix fn) in let cond_targets = List.fold_left (fun acc -> function | Library (cs, bs, lib) when var_choose bs.bs_build -> begin let evs, unix_files = BaseBuilt.of_library in_build_dir_of_unix (cs, bs, lib) in let ends_with nd fn = let nd_len = String.length nd in (String.length fn >= nd_len) && (String.sub fn (String.length fn - nd_len) nd_len) = nd in let tgts = List.flatten (List.filter (fun l -> l <> []) (List.map (List.filter (fun fn -> ends_with ".cma" fn || ends_with ".cmxs" fn || ends_with ".cmxa" fn || ends_with (ext_lib ()) fn || ends_with (ext_dll ()) fn)) unix_files)) in match tgts with | _ :: _ -> (evs, tgts) :: acc | [] -> failwithf (f_ "No possible ocamlbuild targets for library %s") cs.cs_name end | Executable (cs, bs, exec) when var_choose bs.bs_build -> begin let evs, unix_exec_is, unix_dll_opt = BaseBuilt.of_executable in_build_dir_of_unix (cs, bs, exec) in let target ext = let unix_tgt = (OASISUnixPath.concat bs.bs_path (OASISUnixPath.chop_extension exec.exec_main_is))^ext in let evs = (* Fix evs, we want to use the unix_tgt, without copying *) List.map (function | BaseBuilt.BExec, nm, lst when nm = cs.cs_name -> BaseBuilt.BExec, nm, [[in_build_dir_of_unix unix_tgt]] | ev -> ev) evs in evs, [unix_tgt] in (* Add executable *) let acc = match bs.bs_compiled_object with | Native -> (target ".native") :: acc | Best when bool_of_string (is_native ()) -> (target ".native") :: acc | Byte | Best -> (target ".byte") :: acc in acc end | Library _ | Executable _ | Test _ | SrcRepo _ | Flag _ | Doc _ -> acc) [] (* Keep the pkg.sections ordered *) (List.rev pkg.sections); in (* Check and register built files *) let check_and_register (bt, bnm, lst) = List.iter (fun fns -> if not (List.exists OASISFileUtil.file_exists_case fns) then failwithf (f_ "No one of expected built files %s exists") (String.concat (s_ ", ") (List.map (Printf.sprintf "'%s'") fns))) lst; (BaseBuilt.register bt bnm lst) in let cond_targets = (* Run the hook *) !cond_targets_hook cond_targets in (* Run a list of target... *) run_ocamlbuild (List.flatten (List.map snd cond_targets)) argv; (* ... and register events *) List.iter check_and_register (List.flatten (List.map fst cond_targets)) let clean pkg extra_args = run_clean extra_args; List.iter (function | Library (cs, _, _) -> BaseBuilt.unregister BaseBuilt.BLib cs.cs_name | Executable (cs, _, _) -> BaseBuilt.unregister BaseBuilt.BExec cs.cs_name; BaseBuilt.unregister BaseBuilt.BExecLib cs.cs_name | _ -> ()) pkg.sections end module OCamlbuildDocPlugin = struct (* # 21 "/Users/mmottl/.opam/4.00.1/build/oasis.0.3.0/src/plugins/ocamlbuild/OCamlbuildDocPlugin.ml" *) (* Create documentation using ocamlbuild .odocl files @author Sylvain Le Gall *) open OASISTypes open OASISGettext open OASISMessage open OCamlbuildCommon open BaseStandardVar let doc_build path pkg (cs, doc) argv = let index_html = OASISUnixPath.make [ path; cs.cs_name^".docdir"; "index.html"; ] in let tgt_dir = OASISHostPath.make [ build_dir argv; OASISHostPath.of_unix path; cs.cs_name^".docdir"; ] in run_ocamlbuild [index_html] argv; List.iter (fun glb -> BaseBuilt.register BaseBuilt.BDoc cs.cs_name [OASISFileUtil.glob ~ctxt:!BaseContext.default (Filename.concat tgt_dir glb)]) ["*.html"; "*.css"] let doc_clean t pkg (cs, doc) argv = run_clean argv; BaseBuilt.unregister BaseBuilt.BDoc cs.cs_name end # 5558 "setup.ml" open OASISTypes;; let setup_t = { BaseSetup.configure = InternalConfigurePlugin.configure; build = OCamlbuildPlugin.build; test = []; doc = [("API", OCamlbuildDocPlugin.doc_build ".")]; install = InternalInstallPlugin.install; uninstall = InternalInstallPlugin.uninstall; clean = [OCamlbuildPlugin.clean]; clean_test = []; clean_doc = [("API", OCamlbuildDocPlugin.doc_clean ".")]; distclean = []; distclean_test = []; distclean_doc = []; package = { oasis_version = "0.3"; ocaml_version = Some (OASISVersion.VGreaterEqual "3.12"); findlib_version = Some (OASISVersion.VGreaterEqual "1.3.1"); name = "res"; version = "4.0.3"; license = OASISLicense.DEP5License (OASISLicense.DEP5Unit { OASISLicense.license = "LGPL"; excption = Some "OCaml linking"; version = OASISLicense.VersionOrLater "2.1"; }); license_file = Some "COPYING.txt"; copyrights = ["(C) 1999-2012 Markus Mottl "]; maintainers = ["Markus Mottl "]; authors = ["Markus Mottl "]; homepage = Some "https://bitbucket.org/mmottl/res"; synopsis = "RES - Library for resizable, contiguous datastructures."; description = Some "RES is a library containing resizable arrays, strings, and bitvectors."; categories = []; conf_type = (`Configure, "internal", Some "0.3"); conf_custom = { pre_command = [(OASISExpr.EBool true, None)]; post_command = [(OASISExpr.EBool true, None)]; }; build_type = (`Build, "ocamlbuild", Some "0.3"); build_custom = { pre_command = [(OASISExpr.EBool true, None)]; post_command = [(OASISExpr.EBool true, None)]; }; install_type = (`Install, "internal", Some "0.3"); install_custom = { pre_command = [(OASISExpr.EBool true, None)]; post_command = [(OASISExpr.EBool true, None)]; }; uninstall_custom = { pre_command = [(OASISExpr.EBool true, None)]; post_command = [(OASISExpr.EBool true, None)]; }; clean_custom = { pre_command = [(OASISExpr.EBool true, None)]; post_command = [(OASISExpr.EBool true, None)]; }; distclean_custom = { pre_command = [(OASISExpr.EBool true, None)]; post_command = [(OASISExpr.EBool true, None)]; }; files_ab = []; sections = [ Library ({ cs_name = "res"; cs_data = PropList.Data.create (); cs_plugin_data = []; }, { bs_build = [(OASISExpr.EBool true, true)]; bs_install = [(OASISExpr.EBool true, true)]; bs_path = "lib"; bs_compiled_object = Best; bs_build_depends = []; bs_build_tools = [ExternalTool "ocamldoc"; ExternalTool "ocamlbuild"]; bs_c_sources = []; bs_data_files = []; bs_ccopt = [(OASISExpr.EBool true, [])]; bs_cclib = [(OASISExpr.EBool true, [])]; bs_dlllib = [(OASISExpr.EBool true, [])]; bs_dllpath = [(OASISExpr.EBool true, [])]; bs_byteopt = [(OASISExpr.EBool true, [])]; bs_nativeopt = [(OASISExpr.EBool true, [])]; }, { lib_modules = [ "Nopres_impl"; "Nopres_intf"; "Pres_impl"; "Pres_intf"; "Res"; "Strat"; "Weak_impl"; "Weak_intf" ]; lib_pack = false; lib_internal_modules = []; lib_findlib_parent = None; lib_findlib_name = Some "res"; lib_findlib_containers = []; }); Flag ({ cs_name = "examples"; cs_data = PropList.Data.create (); cs_plugin_data = []; }, { flag_description = Some "Build examples"; flag_default = [(OASISExpr.EBool true, true)]; }); Executable ({ cs_name = "buffer_ex"; cs_data = PropList.Data.create (); cs_plugin_data = []; }, { bs_build = [ (OASISExpr.EBool true, false); (OASISExpr.EFlag "examples", true) ]; bs_install = [(OASISExpr.EBool true, false)]; bs_path = "examples"; bs_compiled_object = Best; bs_build_depends = [InternalLibrary "res"]; bs_build_tools = [ExternalTool "ocamldoc"; ExternalTool "ocamlbuild"]; bs_c_sources = []; bs_data_files = []; bs_ccopt = [(OASISExpr.EBool true, [])]; bs_cclib = [(OASISExpr.EBool true, [])]; bs_dlllib = [(OASISExpr.EBool true, [])]; bs_dllpath = [(OASISExpr.EBool true, [])]; bs_byteopt = [(OASISExpr.EBool true, [])]; bs_nativeopt = [(OASISExpr.EBool true, [])]; }, {exec_custom = false; exec_main_is = "buffer_ex.ml"; }); Executable ({ cs_name = "defstrat"; cs_data = PropList.Data.create (); cs_plugin_data = []; }, { bs_build = [ (OASISExpr.EBool true, false); (OASISExpr.EFlag "examples", true) ]; bs_install = [(OASISExpr.EBool true, false)]; bs_path = "examples"; bs_compiled_object = Best; bs_build_depends = [InternalLibrary "res"]; bs_build_tools = [ExternalTool "ocamldoc"; ExternalTool "ocamlbuild"]; bs_c_sources = []; bs_data_files = []; bs_ccopt = [(OASISExpr.EBool true, [])]; bs_cclib = [(OASISExpr.EBool true, [])]; bs_dlllib = [(OASISExpr.EBool true, [])]; bs_dllpath = [(OASISExpr.EBool true, [])]; bs_byteopt = [(OASISExpr.EBool true, [])]; bs_nativeopt = [(OASISExpr.EBool true, [])]; }, {exec_custom = false; exec_main_is = "defstrat.ml"; }); Executable ({ cs_name = "stupid_ga"; cs_data = PropList.Data.create (); cs_plugin_data = []; }, { bs_build = [ (OASISExpr.EBool true, false); (OASISExpr.EFlag "examples", true) ]; bs_install = [(OASISExpr.EBool true, false)]; bs_path = "examples"; bs_compiled_object = Best; bs_build_depends = [InternalLibrary "res"]; bs_build_tools = [ExternalTool "ocamldoc"; ExternalTool "ocamlbuild"]; bs_c_sources = []; bs_data_files = []; bs_ccopt = [(OASISExpr.EBool true, [])]; bs_cclib = [(OASISExpr.EBool true, [])]; bs_dlllib = [(OASISExpr.EBool true, [])]; bs_dllpath = [(OASISExpr.EBool true, [])]; bs_byteopt = [(OASISExpr.EBool true, [])]; bs_nativeopt = [(OASISExpr.EBool true, [])]; }, {exec_custom = false; exec_main_is = "stupid_ga.ml"; }); Executable ({ cs_name = "weak_ex"; cs_data = PropList.Data.create (); cs_plugin_data = []; }, { bs_build = [ (OASISExpr.EBool true, false); (OASISExpr.EFlag "examples", true) ]; bs_install = [(OASISExpr.EBool true, false)]; bs_path = "examples"; bs_compiled_object = Best; bs_build_depends = [InternalLibrary "res"]; bs_build_tools = [ExternalTool "ocamldoc"; ExternalTool "ocamlbuild"]; bs_c_sources = []; bs_data_files = []; bs_ccopt = [(OASISExpr.EBool true, [])]; bs_cclib = [(OASISExpr.EBool true, [])]; bs_dlllib = [(OASISExpr.EBool true, [])]; bs_dllpath = [(OASISExpr.EBool true, [])]; bs_byteopt = [(OASISExpr.EBool true, [])]; bs_nativeopt = [(OASISExpr.EBool true, [])]; }, {exec_custom = false; exec_main_is = "weak_ex.ml"; }); Doc ({ cs_name = "API"; cs_data = PropList.Data.create (); cs_plugin_data = []; }, { doc_type = (`Doc, "OCamlbuild", Some "0.3"); doc_custom = { pre_command = [(OASISExpr.EBool true, None)]; post_command = [(OASISExpr.EBool true, None)]; }; doc_build = [ (OASISExpr.ENot (OASISExpr.EFlag "docs"), false); (OASISExpr.EFlag "docs", true) ]; doc_install = [(OASISExpr.EBool true, true)]; doc_install_dir = "$docdir/api"; doc_title = "API reference for RES"; doc_authors = []; doc_abstract = None; doc_format = OtherDoc; doc_data_files = []; doc_build_tools = [ExternalTool "ocamldoc"; ExternalTool "ocamlbuild"]; }); SrcRepo ({ cs_name = "trunk"; cs_data = PropList.Data.create (); cs_plugin_data = []; }, { src_repo_type = Hg; src_repo_location = "ssh://hg@bitbucket.org/mmottl/res"; src_repo_browser = Some "https://bitbucket.org/mmottl/res"; src_repo_module = None; src_repo_branch = None; src_repo_tag = Some "release-$(pkg_version)"; src_repo_subdir = None; }) ]; plugins = [ (`Extra, "META", Some "0.3"); (`Extra, "StdFiles", Some "0.3"); (`Extra, "DevFiles", Some "0.3") ]; schema_data = PropList.Data.create (); plugin_data = []; }; oasis_fn = Some "_oasis"; oasis_version = "0.3.0"; oasis_digest = Some "¹\018ÅðzN\025|\148Ë_tÆ\\À\158"; oasis_exec = None; oasis_setup_args = []; setup_update = false; };; let setup () = BaseSetup.setup setup_t;; # 5866 "setup.ml" (* OASIS_STOP *) let () = setup ();;