Module Decompress_impl.LSource

Sourcemodule Safe : sig ... end
Sourcemodule Seq : sig ... end
Sourcemodule Hunk : sig ... end
Sourceval repeat : char -> int64
Sourcetype error =
  1. | Invalid_level of int
  2. | Invalid_wbits of int
Sourceval pp_error : Format.formatter -> error -> unit
Sourceexception Match of int * int
Sourceexception Literal of char
Sourceexception Break
Sourcetype 'i t = {
  1. i_off : int;
  2. i_pos : int;
  3. i_len : int;
  4. level : int;
  5. on : Hunk.t -> unit;
  6. state : 'i state;
}
Sourceand 'i state =
  1. | Deflate of int
  2. | Deffast of int
  3. | Choose of int
  4. | Exception of error
Sourceand 'i res =
  1. | Cont of 'i t
  2. | Wait of 'i t * Hunk.t Seq.t
  3. | Error of 'i t * error
    (*

    XXX: we don't have an Ok result because this algorithm does not decide if you need to stop the compression or not - this is decided by the user. It's illogic to force a `End state with this algorithm.

    *)
Sourceval pp_state : Format.formatter -> 'a state -> unit
Sourceval pp : Format.formatter -> 'a t -> unit
Sourceval await : 'a t -> Hunk.t Seq.t -> 'a res
Sourceval error : 'a t -> error -> 'b res
Sourceval _max_distance : int
Sourceval _max_length : int
Sourceval _size_of_int64 : int
Sourceval _idx_boundary : int
Sourcetype key = Int32.t option
Sourceval key : ([< `Read | `Write Read ], 'a) Safe.t -> int -> int -> key
Sourcemodule T : sig ... end
Sourceval longuest_substring : ([< `Read | `Write Read ], 'a) Safe.t -> int -> int -> int -> int option
Sourceval deflate : ?max_fardistance:int -> ([< `Read | `Write Read ], 'a) Safe.t -> 'b t -> Hunk.t Seq.t
Sourceval _hlog : int array
Sourceval deffast : 'a. ?accel:int -> ?max_fardistance:int -> (Safe.read, 'a) Safe.t -> 'a t -> Hunk.t Seq.t
Sourceval eval : (Safe.read, 'a) Safe.t -> 'a t -> [> `Await of 'a t * Hunk.t Seq.t | `Error of 'a t * error ]
Sourceval refill : int -> int -> 'a t -> 'a t
Sourceval used_in : 'a t -> int
Sourceval default : ?level:int -> ?on:(Hunk.t -> unit) -> int -> 'a t