+++ /dev/null
-*.cmi *.cmo *.cmx test test.opt
-configure
-config.status
-config.log
-config.cache
-Makefile
-META
-mlminidom.spec
+++ /dev/null
-minidom.cmo: minidom.cmi
-minidom.cmx: minidom.cmi
-ominidom.cmo: minidom.cmi ominidom.cmi
-ominidom.cmx: minidom.cmx ominidom.cmi
-test.cmo: minidom.cmi
-test.cmx: minidom.cmx
-ominidom.cmi: minidom.cmi
+++ /dev/null
-Luca Padovani <luca.padovani@cs.unibo.it>
-Claudio Sacerdoti Coen <sacerdot@cs.unibo.it>
-Stefano Zacchiroli <zack@cs.unibo.it>
+++ /dev/null
- GNU GENERAL PUBLIC LICENSE
- Version 2, June 1991
-
- Copyright (C) 1989, 1991 Free Software Foundation, Inc.
- 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
- Everyone is permitted to copy and distribute verbatim copies
- of this license document, but changing it is not allowed.
-
- Preamble
-
- The licenses for most software are designed to take away your
-freedom to share and change it. By contrast, the GNU General Public
-License is intended to guarantee your freedom to share and change free
-software--to make sure the software is free for all its users. This
-General Public License applies to most of the Free Software
-Foundation's software and to any other program whose authors commit to
-using it. (Some other Free Software Foundation software is covered by
-the GNU Library General Public License instead.) You can apply it to
-your programs, too.
-
- When we speak of free software, we are referring to freedom, not
-price. Our General Public Licenses are designed to make sure that you
-have the freedom to distribute copies of free software (and charge for
-this service if you wish), that you receive source code or can get it
-if you want it, that you can change the software or use pieces of it
-in new free programs; and that you know you can do these things.
-
- To protect your rights, we need to make restrictions that forbid
-anyone to deny you these rights or to ask you to surrender the rights.
-These restrictions translate to certain responsibilities for you if you
-distribute copies of the software, or if you modify it.
-
- For example, if you distribute copies of such a program, whether
-gratis or for a fee, you must give the recipients all the rights that
-you have. You must make sure that they, too, receive or can get the
-source code. And you must show them these terms so they know their
-rights.
-
- We protect your rights with two steps: (1) copyright the software, and
-(2) offer you this license which gives you legal permission to copy,
-distribute and/or modify the software.
-
- Also, for each author's protection and ours, we want to make certain
-that everyone understands that there is no warranty for this free
-software. If the software is modified by someone else and passed on, we
-want its recipients to know that what they have is not the original, so
-that any problems introduced by others will not reflect on the original
-authors' reputations.
-
- Finally, any free program is threatened constantly by software
-patents. We wish to avoid the danger that redistributors of a free
-program will individually obtain patent licenses, in effect making the
-program proprietary. To prevent this, we have made it clear that any
-patent must be licensed for everyone's free use or not licensed at all.
-
- The precise terms and conditions for copying, distribution and
-modification follow.
-\f
- GNU GENERAL PUBLIC LICENSE
- TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
-
- 0. This License applies to any program or other work which contains
-a notice placed by the copyright holder saying it may be distributed
-under the terms of this General Public License. The "Program", below,
-refers to any such program or work, and a "work based on the Program"
-means either the Program or any derivative work under copyright law:
-that is to say, a work containing the Program or a portion of it,
-either verbatim or with modifications and/or translated into another
-language. (Hereinafter, translation is included without limitation in
-the term "modification".) Each licensee is addressed as "you".
-
-Activities other than copying, distribution and modification are not
-covered by this License; they are outside its scope. The act of
-running the Program is not restricted, and the output from the Program
-is covered only if its contents constitute a work based on the
-Program (independent of having been made by running the Program).
-Whether that is true depends on what the Program does.
-
- 1. You may copy and distribute verbatim copies of the Program's
-source code as you receive it, in any medium, provided that you
-conspicuously and appropriately publish on each copy an appropriate
-copyright notice and disclaimer of warranty; keep intact all the
-notices that refer to this License and to the absence of any warranty;
-and give any other recipients of the Program a copy of this License
-along with the Program.
-
-You may charge a fee for the physical act of transferring a copy, and
-you may at your option offer warranty protection in exchange for a fee.
-
- 2. You may modify your copy or copies of the Program or any portion
-of it, thus forming a work based on the Program, and copy and
-distribute such modifications or work under the terms of Section 1
-above, provided that you also meet all of these conditions:
-
- a) You must cause the modified files to carry prominent notices
- stating that you changed the files and the date of any change.
-
- b) You must cause any work that you distribute or publish, that in
- whole or in part contains or is derived from the Program or any
- part thereof, to be licensed as a whole at no charge to all third
- parties under the terms of this License.
-
- c) If the modified program normally reads commands interactively
- when run, you must cause it, when started running for such
- interactive use in the most ordinary way, to print or display an
- announcement including an appropriate copyright notice and a
- notice that there is no warranty (or else, saying that you provide
- a warranty) and that users may redistribute the program under
- these conditions, and telling the user how to view a copy of this
- License. (Exception: if the Program itself is interactive but
- does not normally print such an announcement, your work based on
- the Program is not required to print an announcement.)
-\f
-These requirements apply to the modified work as a whole. If
-identifiable sections of that work are not derived from the Program,
-and can be reasonably considered independent and separate works in
-themselves, then this License, and its terms, do not apply to those
-sections when you distribute them as separate works. But when you
-distribute the same sections as part of a whole which is a work based
-on the Program, the distribution of the whole must be on the terms of
-this License, whose permissions for other licensees extend to the
-entire whole, and thus to each and every part regardless of who wrote it.
-
-Thus, it is not the intent of this section to claim rights or contest
-your rights to work written entirely by you; rather, the intent is to
-exercise the right to control the distribution of derivative or
-collective works based on the Program.
-
-In addition, mere aggregation of another work not based on the Program
-with the Program (or with a work based on the Program) on a volume of
-a storage or distribution medium does not bring the other work under
-the scope of this License.
-
- 3. You may copy and distribute the Program (or a work based on it,
-under Section 2) in object code or executable form under the terms of
-Sections 1 and 2 above provided that you also do one of the following:
-
- a) Accompany it with the complete corresponding machine-readable
- source code, which must be distributed under the terms of Sections
- 1 and 2 above on a medium customarily used for software interchange; or,
-
- b) Accompany it with a written offer, valid for at least three
- years, to give any third party, for a charge no more than your
- cost of physically performing source distribution, a complete
- machine-readable copy of the corresponding source code, to be
- distributed under the terms of Sections 1 and 2 above on a medium
- customarily used for software interchange; or,
-
- c) Accompany it with the information you received as to the offer
- to distribute corresponding source code. (This alternative is
- allowed only for noncommercial distribution and only if you
- received the program in object code or executable form with such
- an offer, in accord with Subsection b above.)
-
-The source code for a work means the preferred form of the work for
-making modifications to it. For an executable work, complete source
-code means all the source code for all modules it contains, plus any
-associated interface definition files, plus the scripts used to
-control compilation and installation of the executable. However, as a
-special exception, the source code distributed need not include
-anything that is normally distributed (in either source or binary
-form) with the major components (compiler, kernel, and so on) of the
-operating system on which the executable runs, unless that component
-itself accompanies the executable.
-
-If distribution of executable or object code is made by offering
-access to copy from a designated place, then offering equivalent
-access to copy the source code from the same place counts as
-distribution of the source code, even though third parties are not
-compelled to copy the source along with the object code.
-\f
- 4. You may not copy, modify, sublicense, or distribute the Program
-except as expressly provided under this License. Any attempt
-otherwise to copy, modify, sublicense or distribute the Program is
-void, and will automatically terminate your rights under this License.
-However, parties who have received copies, or rights, from you under
-this License will not have their licenses terminated so long as such
-parties remain in full compliance.
-
- 5. You are not required to accept this License, since you have not
-signed it. However, nothing else grants you permission to modify or
-distribute the Program or its derivative works. These actions are
-prohibited by law if you do not accept this License. Therefore, by
-modifying or distributing the Program (or any work based on the
-Program), you indicate your acceptance of this License to do so, and
-all its terms and conditions for copying, distributing or modifying
-the Program or works based on it.
-
- 6. Each time you redistribute the Program (or any work based on the
-Program), the recipient automatically receives a license from the
-original licensor to copy, distribute or modify the Program subject to
-these terms and conditions. You may not impose any further
-restrictions on the recipients' exercise of the rights granted herein.
-You are not responsible for enforcing compliance by third parties to
-this License.
-
- 7. If, as a consequence of a court judgment or allegation of patent
-infringement or for any other reason (not limited to patent issues),
-conditions are imposed on you (whether by court order, agreement or
-otherwise) that contradict the conditions of this License, they do not
-excuse you from the conditions of this License. If you cannot
-distribute so as to satisfy simultaneously your obligations under this
-License and any other pertinent obligations, then as a consequence you
-may not distribute the Program at all. For example, if a patent
-license would not permit royalty-free redistribution of the Program by
-all those who receive copies directly or indirectly through you, then
-the only way you could satisfy both it and this License would be to
-refrain entirely from distribution of the Program.
-
-If any portion of this section is held invalid or unenforceable under
-any particular circumstance, the balance of the section is intended to
-apply and the section as a whole is intended to apply in other
-circumstances.
-
-It is not the purpose of this section to induce you to infringe any
-patents or other property right claims or to contest validity of any
-such claims; this section has the sole purpose of protecting the
-integrity of the free software distribution system, which is
-implemented by public license practices. Many people have made
-generous contributions to the wide range of software distributed
-through that system in reliance on consistent application of that
-system; it is up to the author/donor to decide if he or she is willing
-to distribute software through any other system and a licensee cannot
-impose that choice.
-
-This section is intended to make thoroughly clear what is believed to
-be a consequence of the rest of this License.
-\f
- 8. If the distribution and/or use of the Program is restricted in
-certain countries either by patents or by copyrighted interfaces, the
-original copyright holder who places the Program under this License
-may add an explicit geographical distribution limitation excluding
-those countries, so that distribution is permitted only in or among
-countries not thus excluded. In such case, this License incorporates
-the limitation as if written in the body of this License.
-
- 9. The Free Software Foundation may publish revised and/or new versions
-of the General Public License from time to time. Such new versions will
-be similar in spirit to the present version, but may differ in detail to
-address new problems or concerns.
-
-Each version is given a distinguishing version number. If the Program
-specifies a version number of this License which applies to it and "any
-later version", you have the option of following the terms and conditions
-either of that version or of any later version published by the Free
-Software Foundation. If the Program does not specify a version number of
-this License, you may choose any version ever published by the Free Software
-Foundation.
-
- 10. If you wish to incorporate parts of the Program into other free
-programs whose distribution conditions are different, write to the author
-to ask for permission. For software which is copyrighted by the Free
-Software Foundation, write to the Free Software Foundation; we sometimes
-make exceptions for this. Our decision will be guided by the two goals
-of preserving the free status of all derivatives of our free software and
-of promoting the sharing and reuse of software generally.
-
- NO WARRANTY
-
- 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
-FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN
-OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
-PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
-OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
-MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS
-TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE
-PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
-REPAIR OR CORRECTION.
-
- 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
-WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
-REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
-INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
-OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
-TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
-YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
-PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
-POSSIBILITY OF SUCH DAMAGES.
-
- END OF TERMS AND CONDITIONS
-\f
- How to Apply These Terms to Your New Programs
-
- If you develop a new program, and you want it to be of the greatest
-possible use to the public, the best way to achieve this is to make it
-free software which everyone can redistribute and change under these terms.
-
- To do so, attach the following notices to the program. It is safest
-to attach them to the start of each source file to most effectively
-convey the exclusion of warranty; and each file should have at least
-the "copyright" line and a pointer to where the full notice is found.
-
- <one line to give the program's name and a brief idea of what it does.>
- Copyright (C) <year> <name of author>
-
- This program is free software; you can redistribute it and/or modify
- it under the terms of the GNU General Public License as published by
- the Free Software Foundation; either version 2 of the License, or
- (at your option) any later version.
-
- This program is distributed in the hope that it will be useful,
- but WITHOUT ANY WARRANTY; without even the implied warranty of
- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- GNU General Public License for more details.
-
- You should have received a copy of the GNU General Public License
- along with this program; if not, write to the Free Software
- Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
-
-
-Also add information on how to contact you by electronic and paper mail.
-
-If the program is interactive, make it output a short notice like this
-when it starts in an interactive mode:
-
- Gnomovision version 69, Copyright (C) year name of author
- Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
- This is free software, and you are welcome to redistribute it
- under certain conditions; type `show c' for details.
-
-The hypothetical commands `show w' and `show c' should show the appropriate
-parts of the General Public License. Of course, the commands you use may
-be called something other than `show w' and `show c'; they could even be
-mouse-clicks or menu items--whatever suits your program.
-
-You should also get your employer (if you work as a programmer) or your
-school, if any, to sign a "copyright disclaimer" for the program, if
-necessary. Here is a sample; alter the names:
-
- Yoyodyne, Inc., hereby disclaims all copyright interest in the program
- `Gnomovision' (which makes passes at compilers) written by James Hacker.
-
- <signature of Ty Coon>, 1 April 1989
- Ty Coon, President of Vice
-
-This General Public License does not permit incorporating your program into
-proprietary programs. If your program is a subroutine library, you may
-consider it more useful to permit linking proprietary applications with the
-library. If this is what you want to do, use the GNU Library General
-Public License instead of this License.
+++ /dev/null
-requires=""
-version="@VERSION@"
-archive(byte)="mlminidom.cma ml_minidom.o"
-archive(native)="mlminidom.cmxa ml_minidom.o"
-linkopts=""
+++ /dev/null
-PACKAGE = @PACKAGE@
-VERSION = @VERSION@
-INCLUDEDIR = @OCAML_INCLUDE_DIR@
-PREFIX =
-OBJECTS_C = ml_minidom.o
-OBJECTS = minidom.cmo ominidom.cmo
-OBJECTS_OPT = minidom.cmx ominidom.cmx
-INST = ml_minidom.h minidom.mli minidom.cmi ominidom.mli ominidom.cmi META
-DIST_FILES = Makefile.in configure.in configure *.ml *.mli test.xml ml_minidom.c ml_minidom.h META.in mlminidom.spec.in .depend
-DOC_FILES = AUTHORS COPYING ChangeLog NEWS README
-REQUIRES =
-PREDICATES =
-OCAMLC = ocamlfind ocamlc
-OCAMLOPT = ocamlfind ocamlopt
-OCAMLDEP = ocamldep
-DESTDIR = @OCAML_LIB_DIR@
-
-ARCHIVE = $(PACKAGE).cma
-ARCHIVE_C = $(PACKAGE).a
-ARCHIVE_OPT = $(PACKAGE).cmxa
-
-TMPDIR = .test
-TMPPKGDIR = $(TMPDIR)/$(PACKAGE)
-
-all: $(OBJECTS_C) $(ARCHIVE) test
-
-opt: $(OBJECTS_C) $(ARCHIVE_OPT) test.opt
-
-dist:
- rm -rf $(PACKAGE)-$(VERSION)
- mkdir $(PACKAGE)-$(VERSION)
- cp $(DIST_FILES) $(DOC_FILES) $(PACKAGE)-$(VERSION)
- tar cvfz $(PACKAGE)-$(VERSION).tar.gz $(PACKAGE)-$(VERSION)
- rm -rf $(PACKAGE)-$(VERSION)
-
-ml_minidom.o: ml_minidom.c
- gcc -c -I$(INCLUDEDIR) `glib-config --cflags` `minidom-config --cflags` $<
-
-.SUFFIXES: .cmo .cmi .cmx .ml .mli
-
-.ml.cmo:
- $(OCAMLC) -package "$(REQUIRES)" -predicates "$(PREDICATES)" \
- -c $<
-.mli.cmi:
- $(OCAMLC) -package "$(REQUIRES)" -predicates "$(PREDICATES)" \
- -c $<
-.ml.cmx:
- $(OCAMLOPT) -package "$(REQUIRES)" -predicates "$(PREDICATES)" \
- -c $<
-
-depend: *.ml *.mli
- $(OCAMLDEP) *.ml *.mli >.depend
-include .depend
-
-$(ARCHIVE): $(OBJECTS)
- $(OCAMLC) -a -custom -package "$(REQUIRES)" \
- -predicates "$(PREDICATES)" -o $@ $^ \
- -cclib "`glib-config --libs` `minidom-config --libs`"
-
-$(ARCHIVE_OPT): $(OBJECTS_OPT)
- $(OCAMLOPT) -a -package "$(REQUIRES)" \
- -predicates "$(PREDICATES)" -o $@ $^ \
- -cclib "`glib-config --libs` `minidom-config --libs`"
-
-test: test.ml $(OBJECTS_C) $(ARCHIVE)
- mkdir -p $(TMPPKGDIR)
- cp $(OBJECTS_C) $(ARCHIVE) $(INST) $(TMPPKGDIR)
- cp test.ml $(TMPDIR)
- cd $(TMPDIR) ; export OCAMLPATH=.:$$OCAMLPATH ; \
- $(OCAMLC) -package "$(PACKAGE)" -linkpkg -predicates "" -o $@ test.ml
- mv $(TMPDIR)/$@ .
- rm -r $(TMPDIR)
-
-test.opt: test.ml $(OBJECTS_C) $(ARCHIVE_C) $(ARCHIVE_OPT)
- mkdir -p $(TMPPKGDIR)
- cp $(OBJECTS_C) $(ARCHIVE_C) $(ARCHIVE_OPT) $(INST) $(TMPPKGDIR)
- cp test.ml $(TMPDIR)
- cd $(TMPDIR) ; export OCAMLPATH=.:$$OCAMLPATH ; \
- $(OCAMLOPT) -package "$(PACKAGE)" -linkpkg -predicates "" -o $@ test.ml
- mv $(TMPDIR)/$@ .
- rm -r $(TMPDIR)
-
-install:
- test ! -f $(ARCHIVE_OPT) || extra="$(ARCHIVE_C) $(ARCHIVE_OPT)" ; \
- ocamlfind install -destdir $(DESTDIR) $(PACKAGE) $(OBJECTS_C) $(ARCHIVE) $(INST) $$extra
-
-uninstall:
- ocamlfind remove $(PACKAGE)
-
-clean:
- rm -f *.o *.cm? test test.opt $(ARCHIVE) $(ARCHIVE_C) $(ARCHIVE_OPT)
- rm -rf $(TMPDIR)
-
-distclean: clean
- rm -f config.log config.cache config.status Makefile META mlminidom.spec
-
+++ /dev/null
-This is the Ocaml binding for minidom.
-
-To compile and install:
-
- ./configure
- make
- make opt
- make install
-
+++ /dev/null
-AC_INIT(minidom.ml)
-
-PACKAGE=mlminidom
-
-MLMINIDOM_MAJOR_VERSION=0
-MLMINIDOM_MINOR_VERSION=2
-MLMINIDOM_MICRO_VERSION=2
-MLMINIDOM_VERSION=$MLMINIDOM_MAJOR_VERSION.$MLMINIDOM_MINOR_VERSION.$MLMINIDOM_MICRO_VERSION
-VERSION=$MLMINIDOM_VERSION
-
-AC_CHECK_PROG(HAVE_GLIB, glib-config, yes, no)
-if test $HAVE_GLIB = "no"; then
- AC_MSG_ERROR(could not font glib configuration script, please make sure glib (dev) is installed)
-fi
-
-AC_CHECK_PROG(HAVE_MINIDOM, minidom-config, yes, no)
-if test $HAVE_MINIDOM = "no"; then
- AC_MSG_ERROR(could not find minidom configuration script, please make sure minidom is installed)
-fi
-
-AC_CHECK_PROG(HAVE_OCAMLC, ocamlc, yes, no)
-if test $HAVE_OCAMLC = "no"; then
- AC_MSG_ERROR(could not find ocamlc in PATH, please make sure ocaml is installed)
-fi
-
-AC_CHECK_PROG(HAVE_OCAMLFIND, ocamlfind, yes, no)
-if test $HAVE_OCAMLFIND = "no"; then
- AC_MSG_ERROR(could not find ocamlfind in PATH, please make sure findlib is installed)
-fi
-
-AC_MSG_CHECKING("for the ocaml library dir")
-OCAML_LIB_DIR=`ocamlc -where`
-AC_MSG_RESULT($OCAML_LIB_DIR)
-
-AC_CHECK_FILE(/usr/include/caml/mlvalues.h,
- OCAML_INCLUDE_DIR=/usr/include/caml,
- OCAML_INCLUDE_DIR=$OCAML_LIB_DIR/caml
-)
-
-AC_SUBST(PACKAGE)
-AC_SUBST(VERSION)
-AC_SUBST(OCAML_INCLUDE_DIR)
-AC_SUBST(OCAML_LIB_DIR)
-
-AC_OUTPUT([
- Makefile
- mlminidom.spec
- META
-])
+++ /dev/null
-mlminidom (0.2.2-1) unstable; urgency=low
-
- * New upstream release. Built with ocaml 3.04.
-
- -- Stefano Zacchiroli <zack@debian.org> Sun, 20 Jan 2002 15:18:38 +0100
-
-mlminidom (0.2.1-2) unstable; urgency=low
-
- * Bug fix: moved automagically generated configure from diff.gz to
- original tar.gz archive.
-
- -- Stefano Zacchiroli <zack@debian.org> Tue, 20 Nov 2001 01:06:27 +0100
-
-mlminidom (0.2.1-1) unstable; urgency=low
-
- * New upstream release
-
- -- Stefano Zacchiroli <zack@debian.org> Sat, 17 Nov 2001 09:24:02 +0100
-
-mlminidom (0.2.0-1) unstable; urgency=low
-
- * New upstream release
-
- -- Stefano Zacchiroli <zack@debian.org> Tue, 13 Nov 2001 19:41:58 +0100
-
-mlminidom (0.1.0-3) unstable; urgency=low
-
- * Fixed build on architecture which doesn't have native code compiler
- (closes: Bug#104702).
-
- -- Stefano Zacchiroli <zack@debian.org> Tue, 21 Aug 2001 11:14:51 +0200
-
-mlminidom (0.1.0-2) unstable; urgency=low
-
- * Added build-dep on libxml2-dev (closes: Bug#9887).
-
- -- Stefano Zacchiroli <zack@debian.org> Mon, 28 May 2001 12:28:25 +0200
-
-mlminidom (0.1.0-1) unstable; urgency=low
-
- * Initial Release (closes: Bug#93106).
-
- -- Stefano Zacchiroli <zack@debian.org> Wed, 4 Apr 2001 22:50:43 +0200
-
-Local variables:
-mode: debian-changelog
-End:
+++ /dev/null
-Source: mlminidom
-Section: devel
-Priority: optional
-Maintainer: Stefano Zacchiroli <zack@debian.org>
-Build-Depends: debhelper (>> 3.0.0), ocaml (>= 3.04), libglib1.2-dev, libminidom-dev, libxml2-dev, ocaml-findlib
-Standards-Version: 3.5.2
-
-Package: mlminidom
-Architecture: any
-Depends: ocaml (>= 3.04), libminidom0 (>= 0.1.3)
-Description: OCaml binding for minidom
- This is the OCaml binding for minidom, that is currently available in
- the libminidom0 package.
+++ /dev/null
-This package was debianized by Stefano Zacchiroli <zack@debian.org> on
-Wed, 4 Apr 2001 22:50:43 +0200.
-
-It was packed from source obtained via cvs, with this CVSROOT:
- :pserver:anonymous@phd.cs.unibo.it:/home/lpadovan/PHELM/
-
-Upstream Author(s):
- Luca Padovani <luca.padovani@cs.unibo.it>
- Claudio Sacerdoti Coen <sacerdot@cs.unibo.it>
- Stefano Zacchiroli <zack@cs.unibo.it>
-
-Copyright:
- Copyright (C) 2000, Luca Padovani <luca.padovani@cs.unibo.it>.
-
- This file is part of mlminidom, the Ocaml binding for minidom.
-
- mlminidom is free software; you can redistribute it and/or
- modify it under the terms of the GNU General Public License
- as published by the Free Software Foundation; either version 2
- of the License, or (at your option) any later version.
-
- mlminidom is distributed in the hope that it will be useful,
- but WITHOUT ANY WARRANTY; without even the implied warranty of
- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- GNU General Public License for more details.
-
- You should have received a copy of the GNU General Public License
- along with mlminidom; if not, write to the Free Software
- Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
-
- For details, send a mail to the author.
-
+++ /dev/null
-usr/lib/ocaml
+++ /dev/null
-AUTHORS
-README
+++ /dev/null
-#!/usr/bin/make -f
-# Sample debian/rules that uses debhelper.
-# GNU copyright 1997 to 1999 by Joey Hess.
-
-# Uncomment this to turn on verbose mode.
-#export DH_VERBOSE=1
-
-# This is the debhelper compatability version to use.
-export DH_COMPAT=2
-
-UPSTREAM_CHANGELOG = ChangeLog
-
-configure: configure-stamp
-configure-stamp:
- dh_testdir
- # Add here commands to configure the package.
- ./configure
-
- touch configure-stamp
-
-build: configure-stamp build-stamp
-build-stamp:
- dh_testdir
-
- # Add here commands to compile the package.
- $(MAKE)
- -test -x /usr/bin/ocamlopt && $(MAKE) opt
- #/usr/bin/docbook-to-man debian/mlminidom.sgml > mlminidom.1
-
- touch build-stamp
-
-clean:
- dh_testdir
- dh_testroot
- rm -f build-stamp configure-stamp
-
- # Add here commands to clean up after the build process.
- -$(MAKE) distclean
-
- dh_clean
-
-install: build
- dh_testdir
- dh_testroot
- dh_clean -k
- dh_installdirs
-
- # Add here commands to install the package into debian/mlminidom.
- $(MAKE) install DESTDIR=$(CURDIR)/debian/mlminidom/usr/lib/ocaml
-
-
-# Build architecture-independent files here.
-binary-indep: build install
-# We have nothing to do by default.
-
-# Build architecture-dependent files here.
-binary-arch: build install
- dh_testdir
- dh_testroot
-# dh_installdebconf
- dh_installdocs
- dh_installexamples
-# dh_installmenu
-# dh_installlogrotate
-# dh_installemacsen
-# dh_installpam
-# dh_installmime
-# dh_installinit
-# dh_installcron
-# dh_installmanpages
-# dh_installinfo
-# dh_undocumented
- if [ -s $(UPSTREAM_CHANGELOG) ]; then \
- dh_installchangelogs $(UPSTREAM_CHANGELOG); \
- else \
- dh_installchangelogs; \
- fi
- dh_link
- dh_strip
- dh_compress
- dh_fixperms
-# dh_makeshlibs
- dh_installdeb
-# dh_perl
- dh_shlibdeps
- dh_gencontrol
- dh_md5sums
- dh_builddeb
-
-binary: binary-indep binary-arch
-.PHONY: build clean binary-indep binary-arch binary install configure
+++ /dev/null
-(* Copyright (C) 2000, Luca Padovani <luca.padovani@cs.unibo.it>.
- *
- * This file is part of mlminidom, the Ocaml binding for minidom.
- *
- * mlminidom is free software; you can redistribute it and/or
- * modify it under the terms of the GNU General Public License
- * as published by the Free Software Foundation; either version 2
- * of the License, or (at your option) any later version.
- *
- * mlminidom is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- * GNU General Public License for more details.
- *
- * You should have received a copy of the GNU General Public License
- * along with mlminidom; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
- *
- * For details, send a mail to the author.
- *)
-
-type mDOMString
-type mDOMDoc
-type mDOMNode
-type mDOMAttr
-type mDOMEntity
-
-external string_of_mDOMString : mDOMString -> string = "ml_string_of_mDOMString"
-external mDOMString_of_string : string -> mDOMString = "ml_mDOMString_of_string"
-external mDOMString_eq : string -> string -> bool = "ml_mDOMString_eq"
-
-external doc_load : string -> mDOMDoc = "ml_doc_load"
-external doc_new : mDOMString -> mDOMDoc = "ml_doc_new"
-external doc_get_root_node : mDOMDoc -> mDOMNode = "ml_doc_get_root_node"
-
-external doc_add_entity : doc:mDOMDoc -> name:mDOMString -> content:mDOMString -> mDOMEntity = "ml_doc_add_entity"
-external doc_get_entity : doc:mDOMDoc -> name:mDOMString -> mDOMEntity option = "ml_doc_get_entity"
-external doc_get_predefined_entity : doc:mDOMDoc -> name:mDOMString -> mDOMEntity option = "ml_doc_get_predefined_entity"
-external entity_get_content : mDOMEntity -> mDOMString = "ml_entity_get_content"
-
-external node_is_text : mDOMNode -> bool = "ml_node_is_text"
-external node_is_element : mDOMNode -> bool = "ml_node_is_element"
-external node_is_blank : mDOMNode -> bool = "ml_node_is_blank"
-external node_is_entity_ref : mDOMNode -> bool = "ml_node_is_entity_ref"
-external node_get_type : mDOMNode -> int = "ml_node_get_type"
-external node_get_name : mDOMNode -> mDOMString option = "ml_node_get_name"
-external node_get_ns_uri : mDOMNode -> mDOMString option = "ml_node_get_ns_uri"
-external node_get_attribute : node:mDOMNode -> name:mDOMString -> mDOMString option = "ml_node_get_attribute"
-external node_get_attribute_ns : node:mDOMNode -> name:mDOMString -> ns_uri:mDOMString -> mDOMString option = "ml_node_get_attribute_ns"
-external node_has_attribute : node:mDOMNode -> name:mDOMString -> bool = "ml_node_has_attribute"
-external node_has_attribute_ns : node:mDOMNode -> name:mDOMString -> ns_uri:mDOMString -> bool = "ml_node_has_attribute_ns"
-external node_get_content : mDOMNode -> mDOMString option = "ml_node_get_content"
-external node_get_parent : mDOMNode -> mDOMNode option = "ml_node_get_parent"
-external node_get_prev_sibling : mDOMNode -> mDOMNode option = "ml_node_get_prev_sibling"
-external node_get_next_sibling : mDOMNode -> mDOMNode option = "ml_node_get_next_sibling"
-external node_get_first_child : mDOMNode -> mDOMNode option = "ml_node_get_first_child"
-external node_get_first_attribute : mDOMNode -> mDOMAttr option = "ml_node_get_first_attribute"
-external node_is_first : mDOMNode -> bool = "ml_node_is_first"
-external node_is_last : mDOMNode -> bool = "ml_node_is_last"
-
-external attr_get_name : mDOMAttr -> mDOMString option = "ml_attr_get_name"
-external attr_get_ns_uri : mDOMAttr -> mDOMString option = "ml_attr_get_ns_uri"
-external attr_get_value : mDOMAttr -> mDOMString option = "ml_attr_get_value"
-external attr_get_prev_sibling : mDOMAttr -> mDOMAttr option = "ml_attr_get_prev_sibling"
-external attr_get_next_sibling : mDOMAttr -> mDOMAttr option = "ml_attr_get_next_sibling"
-external attr_get_parent : mDOMAttr -> mDOMNode option = "ml_attr_get_parent"
-
-let rec node_list_of_node_first =
- function None -> []
- | Some node -> node :: (node_list_of_node_first (node_get_next_sibling node))
-
-let rec attr_list_of_attr_first =
- function None -> []
- | Some attr -> attr :: (attr_list_of_attr_first (attr_get_next_sibling attr))
-
-let node_get_children node =
- (node_list_of_node_first (node_get_first_child node))
-
-let node_get_attributes node =
- (attr_list_of_attr_first (node_get_first_attribute node))
-
+++ /dev/null
-(* Copyright (C) 2000, Luca Padovani <luca.padovani@cs.unibo.it>.
- *
- * This file is part of mlminidom, the Ocaml binding for minidom.
- *
- * mlminidom is free software; you can redistribute it and/or
- * modify it under the terms of the GNU General Public License
- * as published by the Free Software Foundation; either version 2
- * of the License, or (at your option) any later version.
- *
- * mlminidom is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- * GNU General Public License for more details.
- *
- * You should have received a copy of the GNU General Public License
- * along with mlminidom; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
- *
- * For details, send a mail to the author.
- *)
-
-type mDOMString
-type mDOMDoc
-type mDOMNode
-type mDOMAttr
-type mDOMEntity
-
-external string_of_mDOMString : mDOMString -> string = "ml_string_of_mDOMString"
-external mDOMString_of_string : string -> mDOMString = "ml_mDOMString_of_string"
-external mDOMString_eq : string -> string -> bool = "ml_mDOMString_eq"
-
-external doc_load : string -> mDOMDoc = "ml_doc_load"
-external doc_new : mDOMString -> mDOMDoc = "ml_doc_new"
-external doc_get_root_node : mDOMDoc -> mDOMNode = "ml_doc_get_root_node"
-
-external doc_add_entity : doc:mDOMDoc -> name:mDOMString -> content:mDOMString -> mDOMEntity = "ml_doc_add_entity"
-external doc_get_entity : doc:mDOMDoc -> name:mDOMString -> mDOMEntity option = "ml_doc_get_entity"
-external doc_get_predefined_entity : doc:mDOMDoc -> name:mDOMString -> mDOMEntity option = "ml_doc_get_predefined_entity"
-external entity_get_content : mDOMEntity -> mDOMString = "ml_entity_get_content"
-
-external node_is_text : mDOMNode -> bool = "ml_node_is_text"
-external node_is_element : mDOMNode -> bool = "ml_node_is_element"
-external node_is_blank : mDOMNode -> bool = "ml_node_is_blank"
-external node_is_entity_ref : mDOMNode -> bool = "ml_node_is_entity_ref"
-external node_get_type : mDOMNode -> int = "ml_node_get_type"
-external node_get_name : mDOMNode -> mDOMString option = "ml_node_get_name"
-external node_get_ns_uri : mDOMNode -> mDOMString option = "ml_node_get_ns_uri"
-external node_get_attribute : node:mDOMNode -> name:mDOMString -> mDOMString option = "ml_node_get_attribute"
-external node_get_attribute_ns : node:mDOMNode -> name:mDOMString -> ns_uri:mDOMString -> mDOMString option = "ml_node_get_attribute_ns"
-external node_has_attribute : node:mDOMNode -> name:mDOMString -> bool = "ml_node_has_attribute"
-external node_has_attribute_ns : node:mDOMNode -> name:mDOMString -> ns_uri:mDOMString -> bool = "ml_node_has_attribute_ns"
-external node_get_content : mDOMNode -> mDOMString option = "ml_node_get_content"
-external node_get_parent : mDOMNode -> mDOMNode option = "ml_node_get_parent"
-external node_get_prev_sibling : mDOMNode -> mDOMNode option = "ml_node_get_prev_sibling"
-external node_get_next_sibling : mDOMNode -> mDOMNode option = "ml_node_get_next_sibling"
-external node_get_first_child : mDOMNode -> mDOMNode option = "ml_node_get_first_child"
-external node_get_first_attribute : mDOMNode -> mDOMAttr option = "ml_node_get_first_attribute"
-external node_is_first : mDOMNode -> bool = "ml_node_is_first"
-external node_is_last : mDOMNode -> bool = "ml_node_is_last"
-
-external attr_get_name : mDOMAttr -> mDOMString option = "ml_attr_get_name"
-external attr_get_ns_uri : mDOMAttr -> mDOMString option = "ml_attr_get_ns_uri"
-external attr_get_value : mDOMAttr -> mDOMString option = "ml_attr_get_value"
-external attr_get_prev_sibling : mDOMAttr -> mDOMAttr option = "ml_attr_get_prev_sibling"
-external attr_get_next_sibling : mDOMAttr -> mDOMAttr option = "ml_attr_get_next_sibling"
-external attr_get_parent : mDOMAttr -> mDOMNode option = "ml_attr_get_parent"
-
-val node_get_children : mDOMNode -> mDOMNode list
-val node_get_attributes : mDOMNode -> mDOMAttr list
-
+++ /dev/null
-/* Copyright (C) 2000, Luca Padovani <luca.padovani@cs.unibo.it>.
- *
- * This file is part of mlminidom, the Ocaml binding for minidom.
- *
- * mlminidom is free software; you can redistribute it and/or
- * modify it under the terms of the GNU General Public License
- * as published by the Free Software Foundation; either version 2
- * of the License, or (at your option) any later version.
- *
- * mlminidom is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- * GNU General Public License for more details.
- *
- * You should have received a copy of the GNU General Public License
- * along with mlminidom; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
- *
- * For details, send a mail to the author.
- */
-
-#include <assert.h>
-#include <mlvalues.h>
-#include <memory.h>
-#include <custom.h>
-
-#include "minidom.h"
-
-#define Val_ptr(p) ((value) (p))
-#define Val_option(p,f) ((p != NULL) ? ml_some(f(p)) : Val_unit)
-#define mDOMString_val(v) ((mDOMStringRef) String_val(v))
-#define mDOMDocRef_val(r) (*((mDOMDocRef *)Data_custom_val(r)))
-
-static value
-Val_mDOMConstString(mDOMConstStringRef s)
-{
- return copy_string((char *) s);
-}
-
-static value
-Val_mDOMString(mDOMStringRef s)
-{
- value r = copy_string((char *) s);
- mdom_string_free(s);
- return r;
-}
-
-static value
-ml_some(value v)
-{
- CAMLparam1(v);
- value ret = alloc_small(1,0);
- Field(ret,0) = v;
- CAMLreturn(ret);
-}
-
-value
-ml_string_of_mDOMString(value s)
-{
- CAMLparam1(s);
- CAMLreturn(s);
-}
-
-value
-ml_mDOMString_of_string(value s)
-{
- CAMLparam1(s);
- CAMLreturn(s);
-}
-
-static void
-ml_doc_free(value doc)
-{
- mdom_doc_free(mDOMDocRef_val(doc));
-}
-
-static struct custom_operations ops =
- {"it.unibo.cs.helm.gtkmathview.mDOMDocRef",
- ml_doc_free,
- custom_compare_default,
- custom_hash_default,
- custom_serialize_default,
- custom_deserialize_default
- };
-
-value
-ml_doc_load(value file_name)
-{
- mDOMDocRef doc_ref;
-
- CAMLparam1(file_name);
- CAMLlocal1(val_doc_ref);
-
- doc_ref = mdom_load(String_val(file_name), FALSE, NULL);
- if (doc_ref == NULL) failwith("minidom: could not load document");
- val_doc_ref = alloc_custom(&ops, sizeof(mDOMDocRef), 1, 1);
-
- *((mDOMDocRef *)Data_custom_val(val_doc_ref)) = doc_ref;
-
- CAMLreturn(val_doc_ref);
-}
-
-value
-ml_doc_new(value s)
-{
- mDOMDocRef doc_ref;
-
- CAMLparam1(s);
- CAMLlocal1(val_doc_ref);
-
- doc_ref = mdom_doc_new(mDOMString_val(s));
- if (doc_ref == NULL) failwith("minidom: could not create new document");
- val_doc_ref = alloc_custom(&ops, sizeof(mDOMDocRef), 1, 1);
-
- *((mDOMDocRef *)Data_custom_val(val_doc_ref)) = doc_ref;
-
- CAMLreturn(val_doc_ref);
-}
-
-
-value
-ml_doc_get_root_node(value doc)
-{
- mDOMNodeRef root;
-
- CAMLparam1(doc);
- root = mdom_doc_get_root_node(mDOMDocRef_val(doc));
- if (root == NULL) failwith("minidom: document has no root node!");
-
- CAMLreturn((value) root);
-}
-
-value
-ml_doc_add_entity(value doc, value name, value content)
-{
- mDOMEntityRef ent;
-
- CAMLparam3(doc, name, content);
- ent = mdom_doc_add_entity(mDOMDocRef_val(doc), mDOMString_val(name), mDOMString_val(content));
- if (ent == NULL) failwith("minidom: could not add entity");
-
- CAMLreturn((value) ent);
-}
-
-value
-ml_doc_get_entity(value doc, value name)
-{
- mDOMEntityRef ent;
-
- CAMLparam2(doc, name);
- ent = mdom_doc_get_entity(mDOMDocRef_val(doc), mDOMString_val(name));
-
- CAMLreturn(Val_option(ent, Val_ptr));
-}
-
-value
-ml_doc_get_predefined_entity(value name)
-{
- mDOMEntityRef ent;
-
- CAMLparam1(name);
- ent = mdom_get_predefined_entity(mDOMString_val(name));
-
- CAMLreturn(Val_option(ent, Val_ptr));
-}
-
-value
-ml_entity_get_content(value ent)
-{
- CAMLparam1(ent);
- CAMLreturn(Val_mDOMConstString(mdom_entity_get_content((mDOMEntityRef) ent)));
-}
-
-value
-ml_node_is_text(value node)
-{
- CAMLparam1(node);
- CAMLreturn(Val_bool(mdom_node_is_text((mDOMNodeRef) node)));
-}
-
-value
-ml_node_is_element(value node)
-{
- CAMLparam1(node);
- CAMLreturn(Val_bool(mdom_node_is_element((mDOMNodeRef) node)));
-}
-
-value
-ml_node_is_blank(value node)
-{
- CAMLparam1(node);
- CAMLreturn(Val_bool(mdom_node_is_blank((mDOMNodeRef) node)));
-}
-
-value
-ml_node_is_entity_ref(value node)
-{
- CAMLparam1(node);
- CAMLreturn(Val_bool(mdom_node_is_entity_ref((mDOMNodeRef) node)));
-}
-
-value
-ml_node_get_type(value node)
-{
- CAMLparam1(node);
- CAMLreturn(Val_int(mdom_node_get_type((mDOMNodeRef) node)));
-}
-
-value
-ml_node_get_name(value node)
-{
- CAMLparam1(node);
- CAMLreturn(Val_option(mdom_node_get_name((mDOMNodeRef) node), Val_mDOMConstString));
-}
-
-value
-ml_node_has_attribute(value node, value name)
-{
- CAMLparam2(node,name);
- CAMLreturn(Val_bool(mdom_node_has_attribute((mDOMNodeRef) node, String_val(name))));
-}
-
-value
-ml_node_has_attribute_ns(value node, value name, value uri)
-{
- CAMLparam3(node,name,uri);
- CAMLreturn(Val_bool(mdom_node_has_attribute_ns((mDOMNodeRef) node, String_val(name), String_val(uri))));
-}
-
-value
-ml_node_get_content(value node)
-{
- CAMLparam1(node);
- CAMLreturn(Val_option(mdom_node_get_content((mDOMNodeRef) node), Val_mDOMString));
-}
-
-value
-ml_node_get_ns_uri(value node)
-{
- CAMLparam1(node);
- CAMLreturn(Val_option(mdom_node_get_ns_uri((mDOMNodeRef) node), Val_mDOMConstString));
-}
-
-value
-ml_node_get_attribute(value node, value name)
-{
- CAMLparam2(node,name);
- CAMLreturn(Val_option(mdom_node_get_attribute((mDOMNodeRef) node, String_val(name)), Val_mDOMString));
-}
-
-value
-ml_node_get_attribute_ns(value node, value name, value ns_uri)
-{
- CAMLparam2(node,name);
- CAMLreturn(Val_option(mdom_node_get_attribute_ns((mDOMNodeRef) node,
- String_val(name),
- String_val(ns_uri)), Val_mDOMString));
-}
-
-value
-ml_node_get_parent(value node)
-{
- CAMLparam1(node);
- CAMLreturn(Val_option(mdom_node_get_parent((mDOMNodeRef) node), Val_ptr));
-}
-
-value
-ml_node_get_prev_sibling(value node)
-{
- CAMLparam1(node);
- CAMLreturn(Val_option(mdom_node_get_prev_sibling((mDOMNodeRef) node), Val_ptr));
-}
-
-value
-ml_node_get_next_sibling(value node)
-{
- CAMLparam1(node);
- CAMLreturn(Val_option(mdom_node_get_next_sibling((mDOMNodeRef) node), Val_ptr));
-}
-
-value
-ml_node_get_first_child(value node)
-{
- CAMLparam1(node);
- CAMLreturn(Val_option(mdom_node_get_first_child((mDOMNodeRef) node), Val_ptr));
-}
-
-value
-ml_node_get_first_attribute(value node)
-{
- CAMLparam1(node);
- CAMLreturn(Val_option(mdom_node_get_first_attribute((mDOMNodeRef) node), Val_ptr));
-}
-
-value
-ml_node_is_first(value node)
-{
- CAMLparam1(node);
- CAMLreturn(Val_bool(mdom_node_is_first((mDOMNodeRef) node)));
-}
-
-value
-ml_node_is_last(value node)
-{
- CAMLparam1(node);
- CAMLreturn(Val_bool(mdom_node_is_last((mDOMNodeRef) node)));
-}
-
-value
-ml_attr_get_name(value attr)
-{
- CAMLparam1(attr);
- CAMLreturn(Val_option(mdom_attr_get_name((mDOMAttrRef) attr), Val_mDOMConstString));
-}
-
-value
-ml_attr_get_ns_uri(value attr)
-{
- CAMLparam1(attr);
- CAMLreturn(Val_option(mdom_attr_get_ns_uri((mDOMAttrRef) attr), Val_mDOMConstString));
-}
-
-value
-ml_attr_get_value(value attr)
-{
- CAMLparam1(attr);
- CAMLreturn(Val_option(mdom_attr_get_value((mDOMAttrRef) attr), Val_mDOMString));
-}
-
-value
-ml_attr_get_prev_sibling(value attr)
-{
- CAMLparam1(attr);
- CAMLreturn(Val_option(mdom_attr_get_prev_sibling((mDOMAttrRef) attr), Val_ptr));
-}
-
-value
-ml_attr_get_next_sibling(value attr)
-{
- CAMLparam1(attr);
- CAMLreturn(Val_option(mdom_attr_get_next_sibling((mDOMAttrRef) attr), Val_ptr));
-}
-
-value
-ml_attr_get_parent(value attr)
-{
- CAMLparam1(attr);
- CAMLreturn(Val_option(mdom_attr_get_parent((mDOMAttrRef) attr), Val_ptr));
-}
-
+++ /dev/null
-/* Copyright (C) 2000, Luca Padovani <luca.padovani@cs.unibo.it>.
- *
- * This file is part of mlminidom, the Ocaml binding for minidom.
- *
- * mlminidom is free software; you can redistribute it and/or
- * modify it under the terms of the GNU General Public License
- * as published by the Free Software Foundation; either version 2
- * of the License, or (at your option) any later version.
- *
- * mlminidom is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- * GNU General Public License for more details.
- *
- * You should have received a copy of the GNU General Public License
- * along with mlminidom; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
- *
- * For details, send a mail to the author.
- */
-
-#ifndef ml_minidom_h
-#define ml_minidom_h
-
-#define Val_ptr(p) ((value) (p))
-#ifndef Val_option
-#define Val_option(p,f) ((p != NULL) ? ml_some(f(p)) : Val_unit)
-#endif /* Val_option */
-#define mDOMString_val(v) ((mDOMStringRef) String_val(v))
-#define mDOMNode_val(v) ((mDOMNodeRef) v)
-
-#define mDOMNode_option_mDOMNodeRef(p) (((p) != NULL) ? ml_some((value) (p)) : Val_unit)
-#define mDOMNodeRef_mDOMNode_option(v) ((v == Val_unit) ? NULL : (mDOMNodeRef)Field((v),0))
-#define Val_mDOMNodeRef(p) (mDOMNode_option_mDOMNodeRef(p))
-#define mDOMNodeRef_val(v) (mDOMNodeRef_mDOMNode_option(v))
-#define mDOMDocRef_val(r) (*((mDOMDocRef *)Data_custom_val(r)))
-
-#endif /* ml_minidom_h */
+++ /dev/null
-Summary: The Ocaml binding for the minidom library
-Name: @PACKAGE@
-Version: @VERSION@
-Release: 1
-Copyright: GPL
-URL: http://www.cs.unibo.it/helm
-Packager: Luca Padovani <luca.padovani@cs.unibo.it>
-Requires: ocaml >= 3.00, minidom >= 0.0.1, glib, glib-devel
-Group: Applications/Publishing
-Source: www.cs.unibo.it:/~lpadovan/mml-widget/@PACKAGE@-@VERSION@.tar.gz
-%description
-The Ocaml binding for the minidom library
-
-%prep
-%setup
-
-%build
-./configure
-
-%install
-make
-make opt
-make install
-
-%files
-%doc AUTHORS COPYING ChangeLog NEWS README
-/usr/lib/ocaml/mlminidom
+++ /dev/null
-(* Copyright (C) 2000, Luca Padovani <luca.padovani@cs.unibo.it>.
- *
- * This file is part of mlminidom, the Ocaml binding for minidom.
- *
- * mlminidom is free software; you can redistribute it and/or
- * modify it under the terms of the GNU General Public License
- * as published by the Free Software Foundation; either version 2
- * of the License, or (at your option) any later version.
- *
- * mlminidom is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- * GNU General Public License for more details.
- *
- * You should have received a copy of the GNU General Public License
- * along with mlminidom; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
- *
- * For details, send a mail to the author.
- *)
-
-exception Node_has_no_parent;;
-exception Node_has_no_sibling of string;;
-exception Node_has_no_children;;
-exception Node_has_no_attributes;;
-exception Attribute_has_no_sibling of string;;
-exception Attribute_has_no_parent;;
-exception Undefined_entity;;
-
-let option_to_exception v e =
- match v with
- Some x -> x
- | None -> raise e
-;;
-
-class o_mDOMString (str: Minidom.mDOMString) =
- object
- method get_dom_string = str
- method get_string = Minidom.string_of_mDOMString str
- end;;
-
-let o_mDOMString_of_string str =
- new o_mDOMString (Minidom.mDOMString_of_string str)
-
-class o_mDOMEntity (ent : Minidom.mDOMEntity) =
- object
- method get_dom_entity = ent
- method get_content =
- new o_mDOMString (Minidom.entity_get_content ent)
- end
-;;
-
-class o_mDOMDoc (doc : Minidom.mDOMDoc) =
- object
- method get_dom_doc = doc
-
- method get_root_node =
- new o_mDOMNode (Minidom.doc_get_root_node doc)
- method add_entity (name : o_mDOMString) (value : o_mDOMString) =
- new o_mDOMEntity
- (Minidom.doc_add_entity doc
- (name#get_dom_string) (value#get_dom_string)
- )
- method get_entity (name : o_mDOMString) =
- match Minidom.doc_get_entity doc (name#get_dom_string) with
- | Some x -> new o_mDOMEntity x
- | None -> raise Undefined_entity
- method get_predefined_entity (name : o_mDOMString) =
- match Minidom.doc_get_predefined_entity doc (name#get_dom_string) with
- | Some x -> new o_mDOMEntity x
- | None -> raise Undefined_entity
- end
-and o_mDOMNode (node : Minidom.mDOMNode) =
- object
- method get_dom_node = node
-
- method is_text = Minidom.node_is_text node
- method is_element = Minidom.node_is_element node
- method is_blank = Minidom.node_is_blank node
- method is_entity_ref = Minidom.node_is_entity_ref node
-
- method get_type = Minidom.node_get_type node
- method get_name =
- match Minidom.node_get_name node with
- | Some x -> Some (new o_mDOMString x)
- | None -> None
- method get_ns_uri =
- match Minidom.node_get_ns_uri node with
- | Some x -> Some (new o_mDOMString x)
- | None -> None
- method get_attribute (name : o_mDOMString) =
- match Minidom.node_get_attribute node (name#get_dom_string) with
- | Some x -> Some (new o_mDOMString x)
- | None -> None
- method get_attribute_ns (name : o_mDOMString) (uri : o_mDOMString) =
- match
- Minidom.node_get_attribute_ns node
- (name#get_dom_string) (uri#get_dom_string)
- with
- | Some x -> Some (new o_mDOMString x)
- | None -> None
- method has_attribute (name : o_mDOMString) =
- Minidom.node_has_attribute node (name#get_dom_string)
- method has_attribute_ns (name : o_mDOMString) (uri : o_mDOMString) =
- Minidom.node_has_attribute_ns node (name#get_dom_string) (uri#get_dom_string)
- method get_content =
- match Minidom.node_get_content node with
- | Some x -> Some (new o_mDOMString x)
- | None -> None
- method get_parent =
- new o_mDOMNode
- (option_to_exception (Minidom.node_get_parent node) Node_has_no_parent)
- method get_prev_sibling =
- new o_mDOMNode
- (option_to_exception
- (Minidom.node_get_prev_sibling node)
- (Node_has_no_sibling "left")
- )
- method get_next_sibling =
- new o_mDOMNode
- (option_to_exception
- (Minidom.node_get_next_sibling node)
- (Node_has_no_sibling "right")
- )
- method get_first_child =
- new o_mDOMNode
- (option_to_exception
- (Minidom.node_get_first_child node)
- (Node_has_no_children)
- )
- method get_first_attribute =
- new o_mDOMAttr
- (option_to_exception
- (Minidom.node_get_first_attribute node)
- (Node_has_no_attributes)
- )
- method is_first = Minidom.node_is_first node
- method is_last = Minidom.node_is_last node
-
- method get_children =
- List.map (function x -> new o_mDOMNode x) (Minidom.node_get_children node)
- method get_attributes = List.map
- (function x -> new o_mDOMAttr x) (Minidom.node_get_attributes node)
- end
-and o_mDOMAttr (attr : Minidom.mDOMAttr) =
- object
- method get_dom_attr = attr
-
- method get_name =
- match Minidom.attr_get_name attr with
- | Some x -> Some (new o_mDOMString x)
- | None -> None
- method get_ns_uri =
- match Minidom.attr_get_ns_uri attr with
- | Some x -> Some (new o_mDOMString x)
- | None -> None
- method get_value =
- match Minidom.attr_get_value attr with
- | Some x -> Some (new o_mDOMString x)
- | None -> None
- method get_prev_sibling =
- new o_mDOMAttr
- (option_to_exception
- (Minidom.attr_get_prev_sibling attr)
- (Attribute_has_no_sibling "left")
- )
- method get_next_sibling =
- new o_mDOMAttr
- (option_to_exception
- (Minidom.attr_get_next_sibling attr)
- (Attribute_has_no_sibling "right")
- )
- method get_parent =
- new o_mDOMNode
- (option_to_exception
- (Minidom.attr_get_parent attr) Attribute_has_no_parent
- )
- end
-;;
-
+++ /dev/null
-(* Copyright (C) 2000, Luca Padovani <luca.padovani@cs.unibo.it>.
- *
- * This file is part of mlminidom, the Ocaml binding for minidom.
- *
- * mlminidom is free software; you can redistribute it and/or
- * modify it under the terms of the GNU General Public License
- * as published by the Free Software Foundation; either version 2
- * of the License, or (at your option) any later version.
- *
- * mlminidom is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- * GNU General Public License for more details.
- *
- * You should have received a copy of the GNU General Public License
- * along with mlminidom; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
- *
- * For details, send a mail to the author.
- *)
-
-exception Node_has_no_parent
-exception Node_has_no_sibling of string
-exception Node_has_no_children
-exception Node_has_no_attributes
-exception Attribute_has_no_sibling of string
-exception Attribute_has_no_parent
-exception Undefined_entity
-
-class o_mDOMString : Minidom.mDOMString ->
- object
- method get_dom_string : Minidom.mDOMString
- method get_string : string
- end
-
-val o_mDOMString_of_string : string -> o_mDOMString
-
-class o_mDOMEntity : Minidom.mDOMEntity ->
- object
- method get_content : o_mDOMString
- method get_dom_entity : Minidom.mDOMEntity
- end
-
-class o_mDOMDoc : Minidom.mDOMDoc ->
- object
- method add_entity : o_mDOMString -> o_mDOMString -> o_mDOMEntity
- method get_dom_doc : Minidom.mDOMDoc
- method get_entity : o_mDOMString -> o_mDOMEntity
- method get_predefined_entity : o_mDOMString -> o_mDOMEntity
- method get_root_node : o_mDOMNode
- end
-and o_mDOMNode : Minidom.mDOMNode ->
- object
- method get_attribute : o_mDOMString -> o_mDOMString option
- method get_attribute_ns :
- o_mDOMString -> o_mDOMString -> o_mDOMString option
- method has_attribute : o_mDOMString -> bool
- method has_attribute_ns : o_mDOMString -> o_mDOMString -> bool
- method get_attributes : o_mDOMAttr list
- method get_children : o_mDOMNode list
- method get_content : o_mDOMString option
- method get_dom_node : Minidom.mDOMNode
- method get_first_attribute : o_mDOMAttr
- method get_first_child : o_mDOMNode
- method get_name : o_mDOMString option
- method get_next_sibling : o_mDOMNode
- method get_ns_uri : o_mDOMString option
- method get_parent : o_mDOMNode
- method get_prev_sibling : o_mDOMNode
- method get_type : int
- method is_blank : bool
- method is_element : bool
- method is_entity_ref : bool
- method is_first : bool
- method is_last : bool
- method is_text : bool
- end
-and o_mDOMAttr : Minidom.mDOMAttr ->
- object
- method get_dom_attr : Minidom.mDOMAttr
- method get_name : o_mDOMString option
- method get_next_sibling : o_mDOMAttr
- method get_ns_uri : o_mDOMString option
- method get_parent : o_mDOMNode
- method get_prev_sibling : o_mDOMAttr
- method get_value : o_mDOMString option
- end
+++ /dev/null
-(* Copyright (C) 2000, Luca Padovani <luca.padovani@cs.unibo.it>.
- *
- * This file is part of mlminidom, the Ocaml binding for minidom.
- *
- * mlminidom is free software; you can redistribute it and/or
- * modify it under the terms of the GNU General Public License
- * as published by the Free Software Foundation; either version 2
- * of the License, or (at your option) any later version.
- *
- * mlminidom is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- * GNU General Public License for more details.
- *
- * You should have received a copy of the GNU General Public License
- * along with mlminidom; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
- *
- * For details, send a mail to the author.
- *)
-
-let doc = Minidom.doc_load "test.xml"
-
-let root = Minidom.doc_get_root_node doc
-
-let check_attribute_ns attr =
- Printf.printf "\n\n";
- let ns_uri = Minidom.attr_get_ns_uri attr
- and attr_name = Minidom.attr_get_name attr
- and attr_value = Minidom.attr_get_value attr
- and parent = Minidom.attr_get_parent attr
- in
- match parent,ns_uri,attr_name,attr_value with
- Some parent_node,Some uri,Some attribute_name,Some attribute_value ->
- let attr_info =
- (Minidom.node_get_attribute_ns parent_node attribute_name uri,
- Minidom.node_has_attribute_ns parent_node attribute_name uri)
- in begin
- match attr_info with
- Some attr1, true ->
- Printf.printf "found the attribute with ns %s (was %s)\n"
- (Minidom.string_of_mDOMString attr1) (Minidom.string_of_mDOMString attribute_value)
- | None, false ->
- Printf.printf "attribute not found (uri was %s)!!!!\n" (Minidom.string_of_mDOMString uri)
- | _,_ -> assert false
- end
- | _ ->
- Printf.printf "parent_node == NULL || uri == NULL || attribute_name == NULL || attribute_value == NULL\n"
-;;
-
-let print_attribute attr =
- check_attribute_ns attr;
- let ns_uri = Minidom.attr_get_ns_uri attr
- in
- begin
- match ns_uri with
- Some uri -> Printf.printf " %s:" (Minidom.string_of_mDOMString uri);
- | None -> ()
- end;
- match ((Minidom.attr_get_name attr), (Minidom.attr_get_value attr)) with
- (Some attr_name, Some attr_value) ->
- Printf.printf " %s=\"%s\"" (Minidom.string_of_mDOMString attr_name) (Minidom.string_of_mDOMString attr_value)
- | (Some attr_name, _) ->
- Printf.printf " ??? attribute %s has no value !!!" (Minidom.string_of_mDOMString attr_name)
- | (_,_) ->
- Printf.printf " ??? very strange attribute !!!"
-;;
-
-let rec print_node n node =
- if Minidom.node_is_blank node then ()
- else if Minidom.node_is_element node then begin
- match Minidom.node_get_name node with
- Some node_name ->
- begin
- let children = Minidom.node_get_children node
- and attributes = Minidom.node_get_attributes node
- and ns_uri = Minidom.node_get_ns_uri node
- and is_first,is_last = (Minidom.node_is_first node), (Minidom.node_is_last node)
- in
- for i = 1 to n do print_char ' ' done;
- Printf.printf "<";
- begin
- match ns_uri with
- Some uri -> Printf.printf "%s:" (Minidom.string_of_mDOMString uri)
- | None -> ()
- end;
- Printf.printf "%s" (Minidom.string_of_mDOMString node_name);
- List.iter print_attribute attributes;
- Printf.printf ">\n";
- List.iter (print_node (n + 2)) children;
- for i = 1 to n do print_char ' ' done;
- Printf.printf "</%s>\n" (Minidom.string_of_mDOMString node_name)
- end
- | None -> Printf.printf "??? this node has no name !!!\n"
- end else if Minidom.node_is_text node then begin
- match Minidom.node_get_content node with
- Some node_content ->
- for i = 1 to n do print_char ' ' done;
- Printf.printf "%s\n" (Minidom.string_of_mDOMString node_content)
- | None -> Printf.printf "??? this node has no content !!!\n"
- end else begin
- Printf.printf "don't know how to manage a node with type %d\n" (Minidom.node_get_type node)
- end
-;;
-
-print_node 0 root;;
+++ /dev/null
-<?xml version="1.0" encoding="iso-8859-1"?>
-<?cocoon-format type="text/xhtml"?>
-<m:math xmlns:helm="http://www.cs.unibo.it/helm" xmlns:m="http://www.w3.org/1998/Math/MathML">
- <m:mtable helm:xref="i0" columnalign="left" equalrows="false" align="baseline 1">
- <m:mtr>
- <m:mtd>
- <m:mrow>
- <m:mtext>DEFINITION and_ind() OF TYPE</m:mtext>
- </m:mrow>
- </m:mtd>
- </m:mtr>
- <m:mtr>
- <m:mtd>
- <m:mrow>
- <m:mphantom>
- <m:mtext>__</m:mtext>
- </m:mphantom>
- <m:semantics xmlns:xlink="http://www.w3.org/1999/xlink">
- <m:mrow helm:xref="i22">
- <m:mtable columnalign="left" equalrows="false" align="baseline 1">
- <m:mtr>
- <m:mtd>
- <m:mrow>
- <m:mo stretchy="false">(</m:mo>
- <m:mrow helm:xref="i23">
- <m:mtable columnalign="left" equalrows="false" align="baseline 1">
- <m:mtr>
- <m:mtd>
- <m:mo color="Blue">Π</m:mo>
- <m:mi>A</m:mi>
- <m:mo>:</m:mo>
- <m:mrow helm:xref="i24">
- <m:mo>Prop</m:mo>
- </m:mrow>
- </m:mtd>
- </m:mtr>
- <m:mtr>
- <m:mtd>
- <m:mrow>
- <m:mo>.</m:mo>
- <m:mrow helm:xref="i25">
- <m:mtable columnalign="left" equalrows="false" align="baseline 1">
- <m:mtr>
- <m:mtd>
- <m:mo color="Blue">Π</m:mo>
- <m:mi>B</m:mi>
- <m:mo>:</m:mo>
- <m:mrow helm:xref="i26">
- <m:mo>Prop</m:mo>
- </m:mrow>
- </m:mtd>
- </m:mtr>
- <m:mtr>
- <m:mtd>
- <m:mrow>
- <m:mo>.</m:mo>
- <m:mrow helm:xref="i27">
- <m:mtable columnalign="left" equalrows="false" align="baseline 1">
- <m:mtr>
- <m:mtd>
- <m:mo color="Blue">Π</m:mo>
- <m:mi>P</m:mi>
- <m:mo>:</m:mo>
- <m:mrow helm:xref="i28">
- <m:mo>Prop</m:mo>
- </m:mrow>
- </m:mtd>
- </m:mtr>
- <m:mtr>
- <m:mtd>
- <m:mrow>
- <m:mo>.</m:mo>
- <m:mrow helm:xref="i29">
- <m:mtable columnalign="left" equalrows="false" align="baseline 1">
- <m:mtr>
- <m:mtd>
- <m:mo color="Blue">Π</m:mo>
- <m:mi>f</m:mi>
- <m:mo>:</m:mo>
- <m:mrow helm:xref="i30">
- <m:mo stretchy="false">(</m:mo>
- <m:mi helm:xref="i31">A</m:mi>
- <m:mo color="Blue">→</m:mo>
- <m:mrow helm:xref="i32">
- <m:mo stretchy="false">(</m:mo>
- <m:mi helm:xref="i33">B</m:mi>
- <m:mo color="Blue">→</m:mo>
- <m:mi helm:xref="i34">P</m:mi>
- <m:mo stretchy="false">)</m:mo>
- </m:mrow>
- <m:mo stretchy="false">)</m:mo>
- </m:mrow>
- </m:mtd>
- </m:mtr>
- <m:mtr>
- <m:mtd>
- <m:mrow>
- <m:mo>.</m:mo>
- <m:mrow helm:xref="i35">
- <m:mo color="Blue">Π</m:mo>
- <m:mi>a</m:mi>
- <m:mo>:</m:mo>
- <m:mrow helm:xref="i36">
- <m:mo stretchy="false">(</m:mo>
- <m:mi xlink:href="cic:/coq/INIT/Logic/Conjunction/and.ind" helm:xref="i37">and</m:mi>
- <m:mphantom>
- <m:mtext>_</m:mtext>
- </m:mphantom>
- <m:mi helm:xref="i38">A</m:mi>
- <m:mphantom>
- <m:mtext>_</m:mtext>
- </m:mphantom>
- <m:mi helm:xref="i39">B</m:mi>
- <m:mo stretchy="false">)</m:mo>
- </m:mrow>
- <m:mo>.</m:mo>
- <m:mi helm:xref="i40">P</m:mi>
- </m:mrow>
- </m:mrow>
- </m:mtd>
- </m:mtr>
- </m:mtable>
- </m:mrow>
- </m:mrow>
- </m:mtd>
- </m:mtr>
- </m:mtable>
- </m:mrow>
- </m:mrow>
- </m:mtd>
- </m:mtr>
- </m:mtable>
- </m:mrow>
- </m:mrow>
- </m:mtd>
- </m:mtr>
- </m:mtable>
- </m:mrow>
- </m:mrow>
- </m:mtd>
- </m:mtr>
- <m:mtr>
- <m:mtd>
- <m:mrow>
- <m:mo color="#b03060">:></m:mo>
- <m:mrow helm:xref="i41">
- <m:mo>Prop</m:mo>
- </m:mrow>
- </m:mrow>
- </m:mtd>
- </m:mtr>
- <m:mtr>
- <m:mtd>
- <m:mrow>
- <m:mo stretchy="false">)</m:mo>
- </m:mrow>
- </m:mtd>
- </m:mtr>
- </m:mtable>
- </m:mrow>
- <m:annotation-xml encoding="MathML">
- <m:apply helm:xref="i22">
- <m:csymbol>cast</m:csymbol>
- <m:apply helm:xref="i23">
- <m:csymbol>prod</m:csymbol>
- <m:bvar>
- <m:ci>A</m:ci>
- <m:type>
- <m:apply helm:xref="i24">
- <m:csymbol>Prop</m:csymbol>
- </m:apply>
- </m:type>
- </m:bvar>
- <m:apply helm:xref="i25">
- <m:csymbol>prod</m:csymbol>
- <m:bvar>
- <m:ci>B</m:ci>
- <m:type>
- <m:apply helm:xref="i26">
- <m:csymbol>Prop</m:csymbol>
- </m:apply>
- </m:type>
- </m:bvar>
- <m:apply helm:xref="i27">
- <m:csymbol>prod</m:csymbol>
- <m:bvar>
- <m:ci>P</m:ci>
- <m:type>
- <m:apply helm:xref="i28">
- <m:csymbol>Prop</m:csymbol>
- </m:apply>
- </m:type>
- </m:bvar>
- <m:apply helm:xref="i29">
- <m:csymbol>prod</m:csymbol>
- <m:bvar>
- <m:ci>f</m:ci>
- <m:type>
- <m:apply helm:xref="i30">
- <m:csymbol>arrow</m:csymbol>
- <m:ci helm:xref="i31">A</m:ci>
- <m:apply helm:xref="i32">
- <m:csymbol>arrow</m:csymbol>
- <m:ci helm:xref="i33">B</m:ci>
- <m:ci helm:xref="i34">P</m:ci>
- </m:apply>
- </m:apply>
- </m:type>
- </m:bvar>
- <m:apply helm:xref="i35">
- <m:csymbol>prod</m:csymbol>
- <m:bvar>
- <m:ci>a</m:ci>
- <m:type>
- <m:apply helm:xref="i36">
- <m:csymbol>app</m:csymbol>
- <m:ci definitionURL="cic:/coq/INIT/Logic/Conjunction/and.ind" helm:xref="i37">and</m:ci>
- <m:ci helm:xref="i38">A</m:ci>
- <m:ci helm:xref="i39">B</m:ci>
- </m:apply>
- </m:type>
- </m:bvar>
- <m:ci helm:xref="i40">P</m:ci>
- </m:apply>
- </m:apply>
- </m:apply>
- </m:apply>
- </m:apply>
- <m:apply helm:xref="i41">
- <m:csymbol>Prop</m:csymbol>
- </m:apply>
- </m:apply>
- </m:annotation-xml>
- </m:semantics>
- </m:mrow>
- </m:mtd>
- </m:mtr>
- <m:mtr>
- <m:mtd>
- <m:mrow>
- <m:mtext>AS</m:mtext>
- </m:mrow>
- </m:mtd>
- </m:mtr>
- <m:mtr>
- <m:mtd>
- <m:mrow>
- <m:mphantom>
- <m:mtext>__</m:mtext>
- </m:mphantom>
- <m:semantics xmlns:xlink="http://www.w3.org/1999/xlink">
- <m:mrow helm:xref="i1">
- <m:mtable columnalign="left" equalrows="false" align="baseline 1">
- <m:mtr>
- <m:mtd>
- <m:mo color="Red">λ</m:mo>
- <m:mi>A</m:mi>
- <m:mo>:</m:mo>
- <m:mrow helm:xref="i2">
- <m:mo>Prop</m:mo>
- </m:mrow>
- </m:mtd>
- </m:mtr>
- <m:mtr>
- <m:mtd>
- <m:mrow>
- <m:mo>.</m:mo>
- <m:mrow helm:xref="i3">
- <m:mtable columnalign="left" equalrows="false" align="baseline 1">
- <m:mtr>
- <m:mtd>
- <m:mo color="Red">λ</m:mo>
- <m:mi>B</m:mi>
- <m:mo>:</m:mo>
- <m:mrow helm:xref="i4">
- <m:mo>Prop</m:mo>
- </m:mrow>
- </m:mtd>
- </m:mtr>
- <m:mtr>
- <m:mtd>
- <m:mrow>
- <m:mo>.</m:mo>
- <m:mrow helm:xref="i5">
- <m:mtable columnalign="left" equalrows="false" align="baseline 1">
- <m:mtr>
- <m:mtd>
- <m:mo color="Red">λ</m:mo>
- <m:mi>P</m:mi>
- <m:mo>:</m:mo>
- <m:mrow helm:xref="i6">
- <m:mo>Prop</m:mo>
- </m:mrow>
- </m:mtd>
- </m:mtr>
- <m:mtr>
- <m:mtd>
- <m:mrow>
- <m:mo>.</m:mo>
- <m:mrow helm:xref="i7">
- <m:mtable columnalign="left" equalrows="false" align="baseline 1">
- <m:mtr>
- <m:mtd>
- <m:mo color="Red">λ</m:mo>
- <m:mi>f</m:mi>
- <m:mo>:</m:mo>
- <m:mrow helm:xref="i8">
- <m:mo stretchy="false">(</m:mo>
- <m:mi helm:xref="i9">A</m:mi>
- <m:mo color="Blue">→</m:mo>
- <m:mrow helm:xref="i10">
- <m:mo stretchy="false">(</m:mo>
- <m:mi helm:xref="i11">B</m:mi>
- <m:mo color="Blue">→</m:mo>
- <m:mi helm:xref="i12">P</m:mi>
- <m:mo stretchy="false">)</m:mo>
- </m:mrow>
- <m:mo stretchy="false">)</m:mo>
- </m:mrow>
- </m:mtd>
- </m:mtr>
- <m:mtr>
- <m:mtd>
- <m:mrow>
- <m:mo>.</m:mo>
- <m:mrow helm:xref="i13">
- <m:mtable columnalign="left" equalrows="false" align="baseline 1">
- <m:mtr>
- <m:mtd>
- <m:mo color="Red">λ</m:mo>
- <m:mi>a</m:mi>
- <m:mo>:</m:mo>
- <m:mrow helm:xref="i14">
- <m:mo stretchy="false">(</m:mo>
- <m:mi xlink:href="cic:/coq/INIT/Logic/Conjunction/and.ind" helm:xref="i15">and</m:mi>
- <m:mphantom>
- <m:mtext>_</m:mtext>
- </m:mphantom>
- <m:mi helm:xref="i16">A</m:mi>
- <m:mphantom>
- <m:mtext>_</m:mtext>
- </m:mphantom>
- <m:mi helm:xref="i17">B</m:mi>
- <m:mo stretchy="false">)</m:mo>
- </m:mrow>
- </m:mtd>
- </m:mtr>
- <m:mtr>
- <m:mtd>
- <m:mrow>
- <m:mo>.</m:mo>
- <m:mrow helm:xref="i18">
- <m:mo><</m:mo>
- <m:mi helm:xref="i19">P</m:mi>
- <m:mo>></m:mo>
- <m:mo>CASES</m:mo>
- <m:mphantom>
- <m:mtext>_</m:mtext>
- </m:mphantom>
- <m:mi helm:xref="i20">a</m:mi>
- <m:mphantom>
- <m:mtext>_</m:mtext>
- </m:mphantom>
- <m:mo>OF</m:mo>
- <m:mrow>
- <m:mo stretchy="false">(</m:mo>
- <m:mi>conj</m:mi>
- <m:mphantom>
- <m:mtext>_</m:mtext>
- </m:mphantom>
- <m:mi>$1</m:mi>
- <m:mphantom>
- <m:mtext>_</m:mtext>
- </m:mphantom>
- <m:mi>$2</m:mi>
- <m:mo stretchy="false">)</m:mo>
- </m:mrow>
- <m:mo color="Green">⇒</m:mo>
- <m:mrow>
- <m:mo stretchy="false">(</m:mo>
- <m:mi helm:xref="i21">f</m:mi>
- <m:mphantom>
- <m:mtext>_</m:mtext>
- </m:mphantom>
- <m:mi>$1</m:mi>
- <m:mphantom>
- <m:mtext>_</m:mtext>
- </m:mphantom>
- <m:mi>$2</m:mi>
- <m:mo stretchy="false">)</m:mo>
- </m:mrow>
- <m:mphantom>
- <m:mtext>_</m:mtext>
- </m:mphantom>
- <m:mo>END</m:mo>
- </m:mrow>
- </m:mrow>
- </m:mtd>
- </m:mtr>
- </m:mtable>
- </m:mrow>
- </m:mrow>
- </m:mtd>
- </m:mtr>
- </m:mtable>
- </m:mrow>
- </m:mrow>
- </m:mtd>
- </m:mtr>
- </m:mtable>
- </m:mrow>
- </m:mrow>
- </m:mtd>
- </m:mtr>
- </m:mtable>
- </m:mrow>
- </m:mrow>
- </m:mtd>
- </m:mtr>
- </m:mtable>
- </m:mrow>
- <m:annotation-xml encoding="MathML">
- <m:lambda helm:xref="i1">
- <m:bvar>
- <m:ci>A</m:ci>
- <m:type>
- <m:apply helm:xref="i2">
- <m:csymbol>Prop</m:csymbol>
- </m:apply>
- </m:type>
- </m:bvar>
- <m:lambda helm:xref="i3">
- <m:bvar>
- <m:ci>B</m:ci>
- <m:type>
- <m:apply helm:xref="i4">
- <m:csymbol>Prop</m:csymbol>
- </m:apply>
- </m:type>
- </m:bvar>
- <m:lambda helm:xref="i5">
- <m:bvar>
- <m:ci>P</m:ci>
- <m:type>
- <m:apply helm:xref="i6">
- <m:csymbol>Prop</m:csymbol>
- </m:apply>
- </m:type>
- </m:bvar>
- <m:lambda helm:xref="i7">
- <m:bvar>
- <m:ci>f</m:ci>
- <m:type>
- <m:apply helm:xref="i8">
- <m:csymbol>arrow</m:csymbol>
- <m:ci helm:xref="i9">A</m:ci>
- <m:apply helm:xref="i10">
- <m:csymbol>arrow</m:csymbol>
- <m:ci helm:xref="i11">B</m:ci>
- <m:ci helm:xref="i12">P</m:ci>
- </m:apply>
- </m:apply>
- </m:type>
- </m:bvar>
- <m:lambda helm:xref="i13">
- <m:bvar>
- <m:ci>a</m:ci>
- <m:type>
- <m:apply helm:xref="i14">
- <m:csymbol>app</m:csymbol>
- <m:ci definitionURL="cic:/coq/INIT/Logic/Conjunction/and.ind" helm:xref="i15">and</m:ci>
- <m:ci helm:xref="i16">A</m:ci>
- <m:ci helm:xref="i17">B</m:ci>
- </m:apply>
- </m:type>
- </m:bvar>
- <m:apply helm:xref="i18">
- <m:csymbol>mutcase</m:csymbol>
- <m:ci helm:xref="i19">P</m:ci>
- <m:ci helm:xref="i20">a</m:ci>
- <m:apply>
- <m:csymbol>app</m:csymbol>
- <m:ci>conj</m:ci>
- <m:ci>$1</m:ci>
- <m:ci>$2</m:ci>
- </m:apply>
- <m:apply>
- <m:csymbol>app</m:csymbol>
- <m:ci helm:xref="i21">f</m:ci>
- <m:ci>$1</m:ci>
- <m:ci>$2</m:ci>
- </m:apply>
- </m:apply>
- </m:lambda>
- </m:lambda>
- </m:lambda>
- </m:lambda>
- </m:lambda>
- </m:annotation-xml>
- </m:semantics>
- </m:mrow>
- </m:mtd>
- </m:mtr>
- </m:mtable>
-</m:math>