package hack_parallel

You can search for identifiers within the package.

in-package search v0.2.0

Parallel and shared memory library

Install

Dune Dependency

github.com Readme Edit opam file Versions (3)

Authors

F

Facebook. Modifications by Rijnard van Tonder

Maintainers

R

Rijnard van Tonder <rvantonder@gmail.com>

Sources

1.0.0.tar.gz

sha256=4ebcdd0c0b23735228d13bbf401799174771a747a5aeb4f35b64dcfc68079e29

md5=26aff6c969020c1d2f588c574dc7d08a

doc/hack_parallel.utils/Utils/index.html

Module `Utils`

* Copyright (c) 2015, Facebook, Inc. * All rights reserved. * * This source code is licensed under the BSD-style license found in the * LICENSE file in the "hack" directory of this source tree. An additional grant * of patent rights can be found in the PATENTS file in the same directory. *

val debug : bool ref

val profile : bool ref

val log : (string -> unit) ref

val d : string -> unit

val dn : string -> unit

module Map : sig ... end

val spf : ('a, unit, string) format -> 'a

val print_endlinef : ('a, unit, string, unit) format4 -> 'a

val prerr_endlinef : ('a, unit, string, unit) format4 -> 'a

val opt : ('a -> 'b -> 'a * 'c) -> 'a -> 'b option -> 'a * 'c option

val opt_fold : ('a -> 'b -> 'a) -> 'a -> 'b option -> 'a

val singleton_if : bool -> 'a -> 'a list

val smap_inter : 'a SMap.t -> 'b SMap.t -> 'a SMap.t

val imap_inter : 'a IMap.t -> 'b IMap.t -> 'a IMap.t

val smap_inter_list : 'a SMap.t list -> 'a SMap.t

val imap_inter_list : 'a IMap.t list -> 'a IMap.t

val wfold_left2 : ('a -> 'b -> 'c -> 'a) -> 'a -> 'b list -> 'c list -> 'a

val sl : string list -> string

val maybe : ('a -> 'b -> unit) -> 'a -> 'b option -> unit

val unsafe_opt_note : string -> 'a option -> 'a

val unsafe_opt : 'a option -> 'a

val inter_list : SSet.t list -> SSet.t

val list_last : ('a -> 'b) -> ('a -> unit) -> 'a list -> unit

val is_prefix_dir : string -> string -> bool

val try_with_channel : out_channel -> (out_channel -> 'a) -> (exn -> 'a) -> 'a

val iter_n_acc : int -> ('a -> 'a * 'b) -> 'a -> 'a * 'b

val map_of_list : (SMap.key * 'a) list -> 'a SMap.t

val set_of_list : SSet.elt list -> SSet.t

val strip_ns : string -> string

val strip_all_ns : string -> string

val iter2_shortest : ('a -> 'b -> 'c) -> 'a list -> 'b list -> unit

val fold_fun_list : 'a -> ('a -> 'a) list -> 'a

val compose : ('a -> 'b) -> ('c -> 'a) -> 'c -> 'b

val try_finally : f:(unit -> 'a) -> finally:(unit -> unit) -> 'a

val with_context : 
  enter:(unit -> 'a) ->
  exit:(unit -> 'b) ->
  do_:(unit -> 'c) ->
  'c

val assert_false_log_backtrace : string option -> 'a

val infimum : 'a array -> 'b -> ('a -> 'b -> int) -> int option