This file is indexed.

/usr/lib/ocaml/facile/fcl_invariant.mli is in libfacile-ocaml-dev 1.1.1-1build2.

This file is owned by root:root, with mode 0o644.

The actual contents of the file can be viewed below.

  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
(***********************************************************************)
(*                                                                     *)
(*                           FaCiLe                                    *)
(*                 A Functional Constraint Library                     *)
(*                                                                     *)
(*            Nicolas Barnier, Pascal Brisset, LOG, CENA               *)
(*                                                                     *)
(* Copyright 2004 CENA. All rights reserved. This file is distributed  *)
(* under the terms of the GNU Lesser General Public License.           *)
(***********************************************************************)
(* $Id: fcl_invariant.mli,v 1.2 2004/09/08 09:54:23 barnier Exp $ *)

(** Backtrackable Invariant References *)

(** This module provides types and functions to create
   and handle Backtrackable Invariant References (noted BIR in the sequel).
   BIRs are single-valued variables whose values are restored
   upon backtracks and which are linked by "one-way" constraints.
   They maintain functional dependencies between "source" {e setable}
   BIRs (initialized with their creation value) and {e unsetable} BIRs
   built upon them. BIRs may be convenient to automatically handle
   heuristic criteria or the data structures of local search
   algorithms {% ~\cite{localizer97}%}. Note that circular dependencies
   are not allowed by the typing policy. *)

type ('a, 'b) t
type setable
type unsetable
type 'a setable_t = ('a, setable) t
type 'a unsetable_t = ('a, unsetable) t
(** Type of BIRs. Parameter ['a] stands for the
   type of the value of the BIR. Parameter ['b] is [setable] if the BIR
   can be assigned, [unsetable] if not. [setable_t] and [unsetable_t] are
   shortcuts. *)

(** {% \subsection{Creation and access} %} *)

val create : ?name:string -> 'a -> 'a setable_t
(** [create ~name:"" v] returns a setable BIR with initial content [v].
   An optional string can be given to name the BIR. *)
val constant : ?name:string -> 'a -> 'a unsetable_t
(** [constant ~name:"" cst] returns an unsetable BIR with initial
   content [cst]. An optional string can be given to name the BIR. *)
val set : 'a setable_t -> 'a -> unit
(** Assignment of a setable BIR. *)
val get : ('a, 'b) t -> 'a
(** Access to the content of a BIR. *)
val id : ('a, 'b) t -> int
(** [id r] returns a unique integer associated to BIR [r]. *)
val name : ('a, 'b) t -> string
(** [name r] returns the name (specified or generated) of BIR [r]. *)
val fprint : out_channel -> ?printer:(out_channel -> 'a -> unit) -> ('a, 'b) t -> unit
(** [fprint c ~printer:(fun _ _ -> ()) r] prints BIR [r] on channel [c].
   An optional custom printer can be given to display the value of [r]. *)

(** {% \subsection{Operations: generic, arithmetic, arrays} %} *)

val unary : ?name:string -> ('a -> 'b) -> (('a, 'c) t -> 'b unsetable_t)
(** [unary ~name:"Invariant.unary" f] wraps the unary function [f] into
   an operator on BIRs. An optional string can be given to name the
   operator. *)
val binary : ?name:string -> ('a -> 'b -> 'c) -> (('a, 'd) t -> ('b, 'e) t -> 'c unsetable_t)
(** [binary ~name:"Invariant.binary" f] wraps the binary function [f]
   into an operator on BIRs.
   An optional string can be given to name the operator. *)
val ternary : ?name:string -> ('a -> 'b -> 'c -> 'd) -> (('a, 'e) t -> ('b, 'f) t -> ('c, 'g) t -> 'd unsetable_t)
(** [ternary ~name:"Invariant.ternary" f] wraps the ternary function [f]
   into an operator on BIRs.
   An optional string can be given to name the operator. *)
val sum : (int, 'a) t array -> int unsetable_t
(** [sum a] returns a BIR equal to the sum of elements of [a]. *)

val prod : (int, 'a) t array -> int unsetable_t
(** [sum a] returns a BIR equal to the product of elements of [a]. *)


module Array : sig
  val get : ('a, 'b) t array -> (int, 'c) t -> 'a unsetable_t
(** [get a i] returns the BIR element number [i] of array [a]. *)
  val argmin : ('a, 'b) t array -> ('a -> 'c) -> int unsetable_t
(** [argmin a c] returns the BIR index of the minimum BIR value of [a] for
   criterion [c]. *)
  val min : ('a, 'b) t array -> ('a -> 'c) -> 'a unsetable_t
(** [min a c] returns the minimum BIR value of [a] for criterion [c]. *)
end


(** {% \subsection{From domain variables to BIRs} %} *)

(** Generic signature. *)
module type FD = sig
  type fd
  (** Type of a finite domain variable. *)

  type elt
  (** Type of elements in the domain. *)

  val min : fd -> elt unsetable_t
  val max : fd -> elt unsetable_t
  val size : fd -> int unsetable_t
  val is_var : fd -> bool unsetable_t
  (** BIR variants of [Fd.Var] access functions. *)

  val unary : ?name:string -> (fd -> 'a) -> fd -> 'a unsetable_t
  (** [unary ~name:"Invariant.XxxFd.unary" f v] Wrapper of any access
     function over [fd] type. *)
end

module Fd : FD
with
  type fd = Fcl_var.Fd.t
  and type elt = Fcl_var.Fd.elt
(** Module for accessing finite integer domain variables with BIRs. *)

module SetFd : FD
with
   type fd = Fcl_var.SetFd.t
   and type elt = Fcl_var.SetFd.elt
(** Module for accessing set domain variables with BIRs. *)