package ocaml-webworker

You can search for identifiers within the package.

in-package search v0.2.0

ocaml-webworker
- Ocaml_webworker
  - Browse_misc
  - Browse_raw
  - Browse_tree
  - Builtin_attributes
  - Cmt_cache
  - Code_execution_webworker
  - Completion
  - Destruct
    
    Predef_types
  - Env_compat
  - Expansion
  - Extend_helper
  - Extend_protocol
    
    Reader
    
    V0
  - File_cache
    
    Make
    
    Input
  - Location_aux
  - Logger
  - Longident2
  - Marg
  - Mbrowse
  - Mconfig
  - Misc2
    
    File_exists
    
    HookSig
    
    Int_literal_converter
    
    LongString
    
    MakeHooks
    
    M
    
    StringMap
    
    StringSet
  - Mreader
  - Msource
    
    Trace2
  - Msupport
  - Ocamldoc
  - Outline
  - Parmatch2
    
    Conv
    
    IdSet
  - Path_aux
    
    Map
    
    Ord
    
    Set
    
    Tbl
  - Pprintast2
  - Ppxsetup
    
    StringMap
  - Printf_compat
  - Query_json
  - Query_protocol
    
    Compl
  - Raw_compat
  - Saved_parts
  - Stat_cache
  - Std
    
    Char
    
    Either
    
    Format
    
    Glob
    
    Hashtbl
    
    Json
    
    Lexing
    
    List
    
    Lazy
    
    Obj
    
    Option
    
    Infix
    
    Shell
    
    String
    
    Map
    
    Set
  - String_compat
  - Sturgeon_stub
    
    Cursor
    
    Widget
    
    Nav
  - Syntaxerr_compat
  - Tail_analysis
  - Tast_helper
    
    Pat
  - Track_definition
    
    Fallback
    
    File
    
    File_switching
    
    Preferences
    
    Utils
  - Type_utils
    
    Printtyp
  - Typedtrie
    
    Trie
  - Untypeast2

Legend:
Library
Module
Module type
Parameter
Class
Class type

type node = Browse_raw.node

type t = (Env.t * node) list

val node_of_binary_part : Env.t -> Cmt_format.binary_part -> Browse_raw.node

val fold_node : 'a Browse_raw.f0 -> Env.t -> Browse_raw.node -> 'a -> 'a

val approximate_loc : 
  (Location.t -> Browse_raw.node -> Location.t) ->
  Browse_raw.node ->
  Location.t

val node_loc : Browse_raw.node -> Location.t

val node_merlin_loc : Browse_raw.node -> Location.t

val leaf_node : 'a list -> 'a

val leaf_loc : ('a * Browse_raw.node) list -> Location.t

val drop_leaf : 'a list -> 'a list option

val has_attr : 'a -> ('a Location.loc * 'b) list -> bool

val select_leafs : 
  Std.Lexing.position ->
  (Env.t * Browse_raw.node) list ->
  (Env.t * Browse_raw.node) list list

val compare_locations : Std.Lexing.position -> Location.t -> Location.t -> int

val best_node : 
  Std.Lexing.position ->
  ('a * Browse_raw.node) list list ->
  ('a * Browse_raw.node) list

val enclosing : 
  Std.Lexing.position ->
  (Env.t * Browse_raw.node) list list ->
  (Env.t * Browse_raw.node) list

val deepest_before : 
  Std.Lexing.position ->
  (Env.t * Browse_raw.node) list list ->
  (Env.t * Browse_raw.node) list

val of_structure : Typedtree.structure -> (Env.t * Browse_raw.node) list

val of_signature : Typedtree.signature -> (Env.t * Browse_raw.node) list

val of_typedtree : 
  [< `Implementation of Typedtree.structure
  | `Interface of Typedtree.signature ] ->
  (Env.t * Browse_raw.node) list

val optional_label_sugar : 
  Typedtree.expression_desc ->
  Typedtree.expression option

val is_recovered_expression : Typedtree.expression -> bool

val is_recovered_Texp_construct : Typedtree.expression_desc -> bool

val is_recovered : Browse_raw.node -> bool

val print_node : unit -> Browse_raw.node -> string

val print : unit -> ('a * Browse_raw.node) list -> string