package plebeia

  1. Overview
  2. Docs
Legend:
Library
Module
Module type
Parameter
Class
Class type
module Monad : sig ... end
include module type of struct include Monad end
type 'a t = Fs_impl.cursor -> (Fs_impl.cursor * 'a, Error.t) Stdlib.result Lwt.t
val return : 'a -> 'a t
val bind : 'a t -> ('a -> 'b t) -> 'b t
val map : ('a -> 'b) -> 'a t -> 'b t
val mapM : ('a -> 'b t) -> 'a list -> 'b list t
val mapM_ : ('a -> unit t) -> 'a list -> unit t
val iterM : ('a -> unit t) -> 'a list -> unit t
val fold_leftM : ('a -> 'b -> 'a t) -> 'a -> 'b list -> 'a t
val parseM : ('a -> 'b list -> ('a * 'b list) t) -> 'a -> 'b list -> 'a t
module Infix = Monad.Infix
module Syntax = Monad.Syntax
val lift : 'a Fs_impl.Op.t -> 'a t
val lift_op : 'a Fs_impl.Op.t -> 'a t
val lift_lwt : 'a Lwt.t -> 'a t
val lift_result : ('a, Error.t) Result.t -> 'a t
val lift_result_lwt : ('a, Error.t) Result_lwt.t -> 'a t
val fail : Fs_types.FsError.t -> 'a t
val raw_cursor : Cursor.t t
val chdir_parent : unit t
val chdir_root : unit t
val chdir : ?dig:bool -> Fs_types.Name.t list -> unit t
val path : Fs_types.Path.t t
val set : Fs_types.Name.t list -> Fs_impl.cursor -> unit t
val copy : Fs_types.FsError.path -> Fs_types.Name.t list -> unit t
val write : Fs_types.Name.t list -> Value.t -> unit t
val rm : ?recursive:bool -> ?ignore_error:bool -> Fs_types.FsError.path -> bool t
val rmdir : ?ignore_error:bool -> Fs_types.FsError.path -> bool t
val compute_hash : Hash.Prefix.t t
val may_forget : unit t
val do_then : ('a -> 'b) -> ('a -> 'c) -> 'a -> 'c
val with_pushd_lwt : (Fs_impl.cursor -> (Fs_impl.cursor * 'a, Error.t) Result.t Lwt.t) -> Fs_impl.cursor -> (Fs_impl.cursor * 'a, Error.t) Result.t Lwt.t
module Segs = Segment.Segs
type job_stack = [
  1. | `Exit
  2. | `Right of job_stack
  3. | `Up of Segs.t * job_stack
]
type 'acc traverse_stat = {
  1. acc : 'acc;
  2. dests : job_stack;
  3. segs : Segs.t;
  4. c : Fs_impl.raw_cursor;
}
type 'acc folder = 'acc -> Segs.t -> Fs_impl.raw_cursor -> ([ `Continue | `Exit | `Up ] * 'acc, Error.t) Stdlib.result Lwt.t
val traverse : 'acc traverse_stat -> 'acc folder -> ('acc traverse_stat, Error.t) Stdlib.result Lwt.t
val raw_fold : 'acc -> Fs_impl.raw_cursor -> 'acc folder -> (Fs_impl.raw_cursor * 'acc, Error.t) Stdlib.result Lwt.t
val fold_here : 'acc -> ('acc -> Fs_types.Path.t -> Fs_impl.cursor -> ([ `Continue | `Exit | `Up ] * 'acc, Error.t) Stdlib.result Lwt.t) -> Fs_impl.cursor -> (Fs_impl.cursor * 'acc, Error.t) Result_lwt.t
val fold'_here : ?depth:[< `Eq of int | `Ge of int | `Gt of int | `Le of int | `Lt of int ] -> 'acc -> ('acc -> Fs_types.Path.t -> Fs_impl.cursor -> ('acc, Error.t) Stdlib.result Lwt.t) -> 'acc t
val at_dir : string -> Fs_types.FsError.path -> 'a t -> 'a t
val fold : 'a -> Fs_types.FsError.path -> ('a -> Fs_types.Path.t -> Fs_impl.cursor -> ([ `Continue | `Exit | `Up ] * 'a, Error.t) Stdlib.result Lwt.t) -> 'a t
val fold' : ?depth:[< `Eq of int | `Ge of int | `Gt of int | `Le of int | `Lt of int ] -> 'a -> Fs_types.FsError.path -> ('a -> Fs_types.Path.t -> Fs_impl.cursor -> ('a, Error.t) Stdlib.result Lwt.t) -> 'a t
val count : Fs_types.Path.t -> int option t
val rev_ls2_raw : offset:int -> length:int -> Fs_impl.cursor -> (Fs_impl.cursor * (string * Fs_impl.cursor) list, Error.t) Stdlib.result Lwt.t
val ls2 : offset:int -> length:int -> Fs_types.FsError.path -> (string * Fs_impl.cursor) list Monad.t
val run : 'a -> ('a -> 'b) -> 'b
OCaml

Innovation. Community. Security.