package ppx_core

You can search for identifiers within the package.

in-package search v0.2.0

package ppx_core

ppx_core
- Ppx_core
  - Ast_builder
    
    Default
    
    Located
    
    Loc
    
    Make
    
    Loc
    
    Located
    
    S
    
    Located
  - Ast_pattern
    
    Packed
  - Ast_traverse
    
    fold
    
    fold_map
    
    iter
    
    lift
    
    map
    
    map_with_context
    
    map_with_path
    
    sexp_of
  - Attribute
    
    Context
    
    Floating
    
    Context
  - Caller_id
  - Context_free
    
    Rule
    
    Constant_kind
    
    map_top_down
  - Extension
    
    Context
    
    Expert
    
    For_context
    
    V2
  - File_path
  - Light
    
    fold
    
    fold_map
    
    iter
    
    lift
    
    map
    
    map_with_context
    
    type_is_recursive
  - Loc
  - Location
    
    Error
  - Longident
  - Merlin_helpers
  - Spellcheck
  - Std
    
    Reserved_namespaces
    
    type_is_recursive
  - fold
  - fold_map
  - iter
  - lift
  - map
  - map_with_context
  - type_is_recursive

Legend:
Library
Module
Module type
Parameter
Class
Class type

Overrides the Longident module of OCaml

type t = Ocaml_common.Longident.t =

| Lident of Base.String.t
| Ldot of t * Base.String.t
| Lapply of t * t

include Base.Comparable.S with type t := t

include Base.Comparable_intf.Polymorphic_compare with type t := t

include Base.Comparisons.Infix with type t := t

val (>=) : t -> t -> bool

val (<=) : t -> t -> bool

val (=) : t -> t -> bool

val (>) : t -> t -> bool

val (<) : t -> t -> bool

val (<>) : t -> t -> bool

val equal : t -> t -> bool

val compare : t -> t -> int

compare t1 t2 returns 0 if t1 is equal to t2, a negative integer if t1 is less than t2, and a positive integer if t1 is greater than t2.

val min : t -> t -> t

val max : t -> t -> t

val ascending : t -> t -> int

ascending is identical to compare. descending x y = ascending y x. These are intended to be mnemonic when used like List.sort ~cmp:ascending and List.sort ~cmp:descending, since they cause the list to be sorted in ascending or descending order, respectively.

val descending : t -> t -> int

val between : t -> low:t -> high:t -> bool

val clamp_exn : t -> min:t -> max:t -> t

clamp_exn t ~min ~max returns t', the closest value to t such that between t' ~low:min ~high:max is true.

Raises if not (min <= max).

val clamp : t -> min:t -> max:t -> t Base.Or_error.t

include Base.Comparator.S with type t := t

type comparator_witness

val comparator : (t, comparator_witness) Base.Comparator.comparator

include Base.Comparable_intf.Validate with type t := t

val validate_lbound : min:t Base.Maybe_bound.t -> t Base.Validate.check

val validate_ubound : max:t Base.Maybe_bound.t -> t Base.Validate.check

val validate_bound : 
  min:t Base.Maybe_bound.t ->
  max:t Base.Maybe_bound.t ->
  t Base.Validate.check

val flatten_exn : t -> Base.String.t Base.List.t

val last_exn : t -> Base.String.t

val parse : Base.String.t -> t

val name : t -> Base.String.t