better kept in git.
(* *)
(***********************************************************************)
-(*
- Time-stamp: <Last modified on 2013-04-25 16:20:41 CEST by Kim Nguyen>
-*)
-
INCLUDE "utils.ml"
open Format
(* *)
(***********************************************************************)
-(*
- Time-stamp: <Last modified on 2013-04-25 16:25:20 CEST by Kim Nguyen>
-*)
-
type predicate =
First_child
| Next_sibling
(* *)
(***********************************************************************)
-(*
- Time-stamp: <Last modified on 2013-03-18 22:41:45 CET by Kim Nguyen>
-*)
-
module N1 =
struct
type 'a t = {
(* *)
(***********************************************************************)
-(*
- Time-stamp: <Last modified on 2013-03-18 22:25:30 CET by Kim Nguyen>
-*)
-
(** N-dimentional caches *)
module N1 :
(* *)
(***********************************************************************)
-(*
- Time-stamp: <Last modified on 2013-03-04 23:01:55 CET by Kim Nguyen>
-*)
-
(** Type equipped with an equality and hash function.
If [equal a b] then [(hash a) = (hash b)]
*)
(* *)
(***********************************************************************)
-(*
- Time-stamp: <Last modified on 2013-04-25 17:22:15 CEST by Kim Nguyen>
-*)
-
INCLUDE "utils.ml"
open Format
(* *)
(***********************************************************************)
-(*
- Time-stamp: <Last modified on 2013-03-05 01:50:21 CET by Kim Nguyen>
-*)
-
INCLUDE "utils.ml"
include FiniteCofinite_sig
(* *)
(***********************************************************************)
-(*
- Time-stamp: <Last modified on 2013-03-04 22:44:50 CET by Kim Nguyen>
-*)
-
(** Implementation of hashconsed finite or cofinite sets.
*)
(* *)
(***********************************************************************)
-(*
- Time-stamp: <Last modified on 2013-03-04 22:44:15 CET by Kim Nguyen>
-*)
-
exception InfiniteSet
module type S =
sig
(* *)
(***********************************************************************)
-(*
- Time-stamp: <Last modified on 2013-04-04 18:46:09 CEST by Kim Nguyen>
-*)
-
INCLUDE "utils.ml"
open Format
(* *)
(***********************************************************************)
-(*
- Time-stamp: <Last modified on 2013-04-04 18:41:24 CEST by Kim Nguyen>
-*)
-
module type ATOM =
sig
type t
(* *)
(***********************************************************************)
-(*
- Time-stamp: <Last modified on 2013-03-18 00:16:08 CET by Kim Nguyen>
-*)
-
include Hcons_sig
module type TableBuilder =
(* *)
(***********************************************************************)
-(*
- Time-stamp: <Last modified on 2013-03-04 23:05:14 CET by Kim Nguyen>
-*)
-
(** Implementation of generic hashconsing. *)
include module type of Hcons_sig
(* *)
(***********************************************************************)
-(*
- Time-stamp: <Last modified on 2013-03-04 22:36:31 CET by Kim Nguyen>
-*)
-
(** Abstract signature of a module implementing an hashconsed datatype *)
module type Abstract =
sig
(* *)
(***********************************************************************)
-(*
- Time-stamp: <Last modified on 2013-04-18 11:21:16 CEST by Kim Nguyen>
-*)
-
include module type of Hlist_sig
module Make (H : Hcons.Abstract) : S with type elt = H.t
(* *)
(***********************************************************************)
-(*
- Time-stamp: <Last modified on 2013-03-13 18:21:28 CET by Kim Nguyen>
-*)
type ('a,'b) node = Nil | Cons of ('a * 'b)
module type S = sig
(* *)
(***********************************************************************)
-(*
- Time-stamp: <Last modified on 2013-03-04 23:00:19 CET by Kim Nguyen>
-*)
-
(** Various generic signatures and generic module and functor definitions
*)
INCLUDE "utils.ml"
(* *)
(***********************************************************************)
-(*
- Time-stamp: <Last modified on 2013-04-22 16:42:50 CEST by Kim Nguyen>
-*)
-
type node = {
tag : QName.t;
preorder : int;
(* *)
(***********************************************************************)
-(*
- Time-stamp: <Last modified on 2013-04-04 18:44:39 CEST by Kim Nguyen>
-*)
-
include Tree.S
(* *)
(***********************************************************************)
-(*
- Time-stamp: <Last modified on 2013-03-09 10:41:21 CET by Kim Nguyen>
-*)
-
open Format
exception InvalidUtf8Codepoint of int
(* *)
(***********************************************************************)
-(*
- Time-stamp: <Last modified on 2013-03-09 10:41:32 CET by Kim Nguyen>
-*)
-
exception InvalidUtf8Codepoint of int
val subscript : int -> string
(* *)
(***********************************************************************)
-(*
- Time-stamp: <Last modified on 2013-03-10 18:18:54 CET by Kim Nguyen>
-*)
-
(* Modified by Kim Nguyen *)
(* The Patricia trees are themselves deeply hash-consed. The module
provides a Make (and Weak) functor to build hash-consed patricia
(* *)
(***********************************************************************)
-(*
- Time-stamp: <Last modified on 2013-03-04 22:42:37 CET by Kim Nguyen>
-*)
-
include module type of Ptset_sig
module Make (H : Hcons.Abstract) : S with type elt = H.t
(* *)
(***********************************************************************)
-(*
- Time-stamp: <Last modified on 2013-03-04 23:32:36 CET by Kim Nguyen>
-*)
-
module type S =
sig
include Hcons.S
(* *)
(***********************************************************************)
-(*
- Time-stamp: <Last modified on 2013-03-10 23:05:56 CET by Kim Nguyen>
-*)
-
include Hcons.Make (struct
include String
let hash s = Hashtbl.hash s
(* *)
(***********************************************************************)
-(*
- Time-stamp: <Last modified on 2013-03-10 23:02:12 CET by Kim Nguyen>
-*)
-
(** Implementation of qualified names as hashconsed strings *)
include Hcons.S with type data = string
(* *)
(***********************************************************************)
-(*
- Time-stamp: <Last modified on 2013-03-09 17:54:35 CET by Kim Nguyen>
-*)
-
include FiniteCofinite.Make(Ptset.Make(QName))
let print_finite fmt e conv =
(* *)
(***********************************************************************)
-(*
- Time-stamp: <Last modified on 2013-03-09 17:53:53 CET by Kim Nguyen>
-*)
-
(** Implementation of sets of Qualified Names that can be finite
or cofinite *)
(* *)
(***********************************************************************)
-(*
- Time-stamp: <Last modified on 2013-04-04 18:45:59 CEST by Kim Nguyen>
-*)
-
open Format
type t = int
(* *)
(***********************************************************************)
-(*
- Time-stamp: <Last modified on 2013-03-04 23:02:21 CET by Kim Nguyen>
-*)
-
(** Implementation of states *)
include Common_sig.Type with type t = int
(* *)
(***********************************************************************)
-(*
- Time-stamp: <Last modified on 2013-04-04 18:46:16 CEST by Kim Nguyen>
-*)
-
open Format
include Ptset.Make (Hcons.PosInt)
(* *)
(***********************************************************************)
-(*
- Time-stamp: <Last modified on 2013-04-04 18:41:31 CEST by Kim Nguyen>
-*)
-
(** Implementation of sets of states *)
include Ptset.S with type elt = int
(* *)
(***********************************************************************)
-(*
- Time-stamp: <Last modified on 2013-04-25 15:05:36 CEST by Kim Nguyen>
-*)
-
open Format
let time f arg msg =
(* *)
(***********************************************************************)
-(*
- Time-stamp: <Last modified on 2013-04-22 16:29:52 CEST by Kim Nguyen>
-*)
-
(** The different kind of XML nodes and utility functions *)
module NodeKind =
(* *)
(***********************************************************************)
-(*
- Time-stamp: <Last modified on 2013-01-30 19:06:39 CET by Kim Nguyen>
-*)
-
type t = int
exception Overflow
(* *)
(***********************************************************************)
-(*
- Time-stamp: <Last modified on 2013-01-30 19:06:33 CET by Kim Nguyen>
-*)
-
(** This modules implements unique identifiers represented by integers *)
type t = private int
(* *)
(***********************************************************************)
-(*
- Time-stamp: <Last modified on 2013-04-18 11:22:00 CEST by Kim Nguyen>
-*)
-
-
type path = single_path list
and single_path = Absolute of step list | Relative of step list
and step = axis * test * expr list
(* *)
(***********************************************************************)
-(*
- Time-stamp: <Last modified on 2013-04-04 18:41:03 CEST by Kim Nguyen>
-*)
-
type path = single_path list
and single_path = Absolute of step list | Relative of step list
and step = axis * test * expr list
(* *)
(***********************************************************************)
-(*
- Time-stamp: <Last modified on 2013-04-04 18:43:48 CEST by Kim Nguyen>
-*)
-
open Ast
(* *)
(***********************************************************************)
-(*
- Time-stamp: <Last modified on 2013-04-04 18:41:11 CEST by Kim Nguyen>
-*)
-
val path : Ast.path -> Ata.t
(* *)
(***********************************************************************)
-(*
- Time-stamp: <Last modified on 2013-04-22 16:23:46 CEST by Kim Nguyen>
-*)
-
include Xpath_internal_parser
let parse (l : Ulexing.lexbuf) =
(* *)
(***********************************************************************)
-(*
- Time-stamp: <Last modified on 2013-03-13 14:14:15 CET by Kim Nguyen>
-*)
-
open Xpath_internal_parser
module L = Ulexing
(* *)
(***********************************************************************)
-(*
- Time-stamp: <Last modified on 2013-04-04 18:44:13 CEST by Kim Nguyen>
-*)
-
open Ast
open Tree
%}