@tellahq/rescript 10.1.0-alpha.2 → 10.1.4-republish-2

package/lib/ocaml/lexing.ml

@@ -1,230 +0,0 @@
-(**************************************************************************)
-(*                                                                        *)
-(*                                 OCaml                                  *)
-(*                                                                        *)
-(*             Xavier Leroy, projet Cristal, INRIA Rocquencourt           *)
-(*                                                                        *)
-(*   Copyright 1996 Institut National de Recherche en Informatique et     *)
-(*     en Automatique.                                                    *)
-(*                                                                        *)
-(*   All rights reserved.  This file is distributed under the terms of    *)
-(*   the GNU Lesser General Public License version 2.1, with the          *)
-(*   special exception on linking described in the file LICENSE.          *)
-(*                                                                        *)
-(**************************************************************************)
-
-(* The run-time library for lexers generated by camllex *)
-
-type position = {
-  pos_fname : string;
-  pos_lnum : int;
-  pos_bol : int;
-  pos_cnum : int;
-}
-
-let dummy_pos = {
-  pos_fname = "";
-  pos_lnum = 0;
-  pos_bol = 0;
-  pos_cnum = -1;
-}
-
-type lexbuf =
-  { refill_buff : lexbuf -> unit;
-    mutable lex_buffer : bytes;
-    mutable lex_buffer_len : int;
-    mutable lex_abs_pos : int;
-    mutable lex_start_pos : int;
-    mutable lex_curr_pos : int;
-    mutable lex_last_pos : int;
-    mutable lex_last_action : int;
-    mutable lex_eof_reached : bool;
-    mutable lex_mem : int array;
-    mutable lex_start_p : position;
-    mutable lex_curr_p : position;
-  }
-
-type lex_tables =
-  { lex_base: string;
-    lex_backtrk: string;
-    lex_default: string;
-    lex_trans: string;
-    lex_check: string;
-    lex_base_code : string;
-    lex_backtrk_code : string;
-    lex_default_code : string;
-    lex_trans_code : string;
-    lex_check_code : string;
-    lex_code: string;}
-
-external c_engine : lex_tables -> int -> lexbuf -> int = "?lex_engine"
-external c_new_engine : lex_tables -> int -> lexbuf -> int
-                      = "?new_lex_engine"
-
-let engine tbl state buf =
-  let result = c_engine tbl state buf in
-  if result >= 0 then begin
-    buf.lex_start_p <- buf.lex_curr_p;
-    buf.lex_curr_p <- {buf.lex_curr_p
-                       with pos_cnum = buf.lex_abs_pos + buf.lex_curr_pos};
-  end;
-  result
-
-
-let new_engine tbl state buf =
-  let result = c_new_engine tbl state buf in
-  if result >= 0 then begin
-    buf.lex_start_p <- buf.lex_curr_p;
-    buf.lex_curr_p <- {buf.lex_curr_p
-                       with pos_cnum = buf.lex_abs_pos + buf.lex_curr_pos};
-  end;
-  result
-
-
-let lex_refill read_fun aux_buffer lexbuf =
-  let read =
-    read_fun aux_buffer (Bytes.length aux_buffer) in
-  let n =
-    if read > 0
-    then read
-    else (lexbuf.lex_eof_reached <- true; 0) in
-  (* Current state of the buffer:
-        <-------|---------------------|----------->
-        |  junk |      valid data     |   junk    |
-        ^       ^                     ^           ^
-        0    start_pos             buffer_end    Bytes.length buffer
-  *)
-  if lexbuf.lex_buffer_len + n > Bytes.length lexbuf.lex_buffer then begin
-    (* There is not enough space at the end of the buffer *)
-    if lexbuf.lex_buffer_len - lexbuf.lex_start_pos + n
-       <= Bytes.length lexbuf.lex_buffer
-    then begin
-      (* But there is enough space if we reclaim the junk at the beginning
-         of the buffer *)
-      Bytes.blit lexbuf.lex_buffer lexbuf.lex_start_pos
-                  lexbuf.lex_buffer 0
-                  (lexbuf.lex_buffer_len - lexbuf.lex_start_pos)
-    end else begin
-      (* We must grow the buffer.  Doubling its size will provide enough
-         space since n <= String.length aux_buffer <= String.length buffer.
-         Watch out for string length overflow, though. *)
-      let newlen =
-          (2 * Bytes.length lexbuf.lex_buffer)
-      in
-      if lexbuf.lex_buffer_len - lexbuf.lex_start_pos + n > newlen
-      then failwith "Lexing.lex_refill: cannot grow buffer";
-      let newbuf = Bytes.create newlen in
-      (* Copy the valid data to the beginning of the new buffer *)
-      Bytes.blit lexbuf.lex_buffer lexbuf.lex_start_pos
-                  newbuf 0
-                  (lexbuf.lex_buffer_len - lexbuf.lex_start_pos);
-      lexbuf.lex_buffer <- newbuf
-    end;
-    (* Reallocation or not, we have shifted the data left by
-       start_pos characters; update the positions *)
-    let s = lexbuf.lex_start_pos in
-    lexbuf.lex_abs_pos <- lexbuf.lex_abs_pos + s;
-    lexbuf.lex_curr_pos <- lexbuf.lex_curr_pos - s;
-    lexbuf.lex_start_pos <- 0;
-    lexbuf.lex_last_pos <- lexbuf.lex_last_pos - s;
-    lexbuf.lex_buffer_len <- lexbuf.lex_buffer_len - s ;
-    let t = lexbuf.lex_mem in
-    for i = 0 to Array.length t-1 do
-      let v = t.(i) in
-      if v >= 0 then
-        t.(i) <- v-s
-    done
-  end;
-  (* There is now enough space at the end of the buffer *)
-  Bytes.blit aux_buffer 0 lexbuf.lex_buffer lexbuf.lex_buffer_len n;
-  lexbuf.lex_buffer_len <- lexbuf.lex_buffer_len + n
-
-let zero_pos = {
-  pos_fname = "";
-  pos_lnum = 1;
-  pos_bol = 0;
-  pos_cnum = 0;
-}
-
-let from_function f =
-  { refill_buff = lex_refill f (Bytes.create 512);
-    lex_buffer = Bytes.create 1024;
-    lex_buffer_len = 0;
-    lex_abs_pos = 0;
-    lex_start_pos = 0;
-    lex_curr_pos = 0;
-    lex_last_pos = 0;
-    lex_last_action = 0;
-    lex_mem = [||];
-    lex_eof_reached = false;
-    lex_start_p = zero_pos;
-    lex_curr_p = zero_pos;
-  }
-
-
-let from_string s =
-  { refill_buff = (fun lexbuf -> lexbuf.lex_eof_reached <- true);
-    lex_buffer = Bytes.of_string s; (* have to make a copy for compatibility
-                                       with unsafe-string mode *)
-    lex_buffer_len = String.length s;
-    lex_abs_pos = 0;
-    lex_start_pos = 0;
-    lex_curr_pos = 0;
-    lex_last_pos = 0;
-    lex_last_action = 0;
-    lex_mem = [||];
-    lex_eof_reached = true;
-    lex_start_p = zero_pos;
-    lex_curr_p = zero_pos;
-  }
-
-let lexeme lexbuf =
-  let len = lexbuf.lex_curr_pos - lexbuf.lex_start_pos in
-  Bytes.sub_string lexbuf.lex_buffer lexbuf.lex_start_pos len
-
-let sub_lexeme lexbuf i1 i2 =
-  let len = i2-i1 in
-  Bytes.sub_string lexbuf.lex_buffer i1 len
-
-let sub_lexeme_opt lexbuf i1 i2 =
-  if i1 >= 0 then begin
-    let len = i2-i1 in
-    Some (Bytes.sub_string lexbuf.lex_buffer i1 len)
-  end else begin
-    None
-  end
-
-let sub_lexeme_char lexbuf i = Bytes.get lexbuf.lex_buffer i
-
-let sub_lexeme_char_opt lexbuf i =
-  if i >= 0 then
-    Some (Bytes.get lexbuf.lex_buffer i)
-  else
-    None
-
-
-let lexeme_char lexbuf i =
-  Bytes.get lexbuf.lex_buffer (lexbuf.lex_start_pos + i)
-
-let lexeme_start lexbuf = lexbuf.lex_start_p.pos_cnum
-let lexeme_end lexbuf = lexbuf.lex_curr_p.pos_cnum
-
-let lexeme_start_p lexbuf = lexbuf.lex_start_p
-let lexeme_end_p lexbuf = lexbuf.lex_curr_p
-
-let new_line lexbuf =
-  let lcp = lexbuf.lex_curr_p in
-  lexbuf.lex_curr_p <- { lcp with
-    pos_lnum = lcp.pos_lnum + 1;
-    pos_bol = lcp.pos_cnum;
-  }
-
-
-
-(* Discard data left in lexer buffer. *)
-
-let flush_input lb =
-  lb.lex_curr_pos <- 0;
-  lb.lex_abs_pos <- 0;
-  lb.lex_curr_p <- {lb.lex_curr_p with pos_cnum = 0};
-  lb.lex_buffer_len <- 0;

package/lib/ocaml/lexing.mli

@@ -1,172 +0,0 @@
-(**************************************************************************)
-(*                                                                        *)
-(*                                 OCaml                                  *)
-(*                                                                        *)
-(*             Xavier Leroy, projet Cristal, INRIA Rocquencourt           *)
-(*                                                                        *)
-(*   Copyright 1996 Institut National de Recherche en Informatique et     *)
-(*     en Automatique.                                                    *)
-(*                                                                        *)
-(*   All rights reserved.  This file is distributed under the terms of    *)
-(*   the GNU Lesser General Public License version 2.1, with the          *)
-(*   special exception on linking described in the file LICENSE.          *)
-(*                                                                        *)
-(**************************************************************************)
-
-(** The run-time library for lexers generated by [ocamllex]. *)
-
-(** {1 Positions} *)
-
-type position = {
-  pos_fname : string;
-  pos_lnum : int;
-  pos_bol : int;
-  pos_cnum : int;
-}
-(** A value of type [position] describes a point in a source file.
-   [pos_fname] is the file name; [pos_lnum] is the line number;
-   [pos_bol] is the offset of the beginning of the line (number
-   of characters between the beginning of the lexbuf and the beginning
-   of the line); [pos_cnum] is the offset of the position (number of
-   characters between the beginning of the lexbuf and the position).
-   The difference between [pos_cnum] and [pos_bol] is the character
-   offset within the line (i.e. the column number, assuming each
-   character is one column wide).
-
-   See the documentation of type [lexbuf] for information about
-   how the lexing engine will manage positions.
- *)
-
-val dummy_pos : position
-(** A value of type [position], guaranteed to be different from any
-   valid position.
- *)
-
-
-(** {1 Lexer buffers} *)
-
-
-type lexbuf =
-  { refill_buff : lexbuf -> unit;
-    mutable lex_buffer : bytes;
-    mutable lex_buffer_len : int;
-    mutable lex_abs_pos : int;
-    mutable lex_start_pos : int;
-    mutable lex_curr_pos : int;
-    mutable lex_last_pos : int;
-    mutable lex_last_action : int;
-    mutable lex_eof_reached : bool;
-    mutable lex_mem : int array;
-    mutable lex_start_p : position;
-    mutable lex_curr_p : position;
-  }
-(** The type of lexer buffers. A lexer buffer is the argument passed
-   to the scanning functions defined by the generated scanners.
-   The lexer buffer holds the current state of the scanner, plus
-   a function to refill the buffer from the input.
-
-   At each token, the lexing engine will copy [lex_curr_p] to
-   [lex_start_p], then change the [pos_cnum] field
-   of [lex_curr_p] by updating it with the number of characters read
-   since the start of the [lexbuf].  The other fields are left
-   unchanged by the lexing engine.  In order to keep them
-   accurate, they must be initialised before the first use of the
-   lexbuf, and updated by the relevant lexer actions (i.e. at each
-   end of line -- see also [new_line]).
- *)
-
-
-val from_string : string -> lexbuf
-(** Create a lexer buffer which reads from
-   the given string. Reading starts from the first character in
-   the string. An end-of-input condition is generated when the
-   end of the string is reached. *)
-
-val from_function : (bytes -> int -> int) -> lexbuf
-(** Create a lexer buffer with the given function as its reading method.
-   When the scanner needs more characters, it will call the given
-   function, giving it a byte sequence [s] and a byte
-   count [n]. The function should put [n] bytes or fewer in [s],
-   starting at index 0, and return the number of bytes
-   provided. A return value of 0 means end of input. *)
-
-
-(** {1 Functions for lexer semantic actions} *)
-
-
-(** The following functions can be called from the semantic actions
-   of lexer definitions (the ML code enclosed in braces that
-   computes the value returned by lexing functions). They give
-   access to the character string matched by the regular expression
-   associated with the semantic action. These functions must be
-   applied to the argument [lexbuf], which, in the code generated by
-   [ocamllex], is bound to the lexer buffer passed to the parsing
-   function. *)
-
-val lexeme : lexbuf -> string
-(** [Lexing.lexeme lexbuf] returns the string matched by
-           the regular expression. *)
-
-val lexeme_char : lexbuf -> int -> char
-(** [Lexing.lexeme_char lexbuf i] returns character number [i] in
-   the matched string. *)
-
-val lexeme_start : lexbuf -> int
-(** [Lexing.lexeme_start lexbuf] returns the offset in the
-   input stream of the first character of the matched string.
-   The first character of the stream has offset 0. *)
-
-val lexeme_end : lexbuf -> int
-(** [Lexing.lexeme_end lexbuf] returns the offset in the input stream
-   of the character following the last character of the matched
-   string. The first character of the stream has offset 0. *)
-
-val lexeme_start_p : lexbuf -> position
-(** Like [lexeme_start], but return a complete [position] instead
-    of an offset. *)
-
-val lexeme_end_p : lexbuf -> position
-(** Like [lexeme_end], but return a complete [position] instead
-    of an offset. *)
-
-val new_line : lexbuf -> unit
-(** Update the [lex_curr_p] field of the lexbuf to reflect the start
-    of a new line.  You can call this function in the semantic action
-    of the rule that matches the end-of-line character.
-    @since 3.11.0
-*)
-
-(** {1 Miscellaneous functions} *)
-
-val flush_input : lexbuf -> unit
-(** Discard the contents of the buffer and reset the current
-    position to 0.  The next use of the lexbuf will trigger a
-    refill. *)
-
-(**/**)
-
-(** {1  } *)
-
-(** The following definitions are used by the generated scanners only.
-   They are not intended to be used directly by user programs. *)
-
-val sub_lexeme : lexbuf -> int -> int -> string
-val sub_lexeme_opt : lexbuf -> int -> int -> string option
-val sub_lexeme_char : lexbuf -> int -> char
-val sub_lexeme_char_opt : lexbuf -> int -> char option
-
-type lex_tables =
-  { lex_base : string;
-    lex_backtrk : string;
-    lex_default : string;
-    lex_trans : string;
-    lex_check : string;
-    lex_base_code : string;
-    lex_backtrk_code : string;
-    lex_default_code : string;
-    lex_trans_code : string;
-    lex_check_code : string;
-    lex_code: string;}
-
-val engine : lex_tables -> int -> lexbuf -> int
-val new_engine : lex_tables -> int -> lexbuf -> int