Commit a57eb439 authored by Hans-Peter Deifel's avatar Hans-Peter Deifel 🐢
Browse files

Add vim modeline to all OCaml files

parent 2bda8737
......@@ -237,5 +237,7 @@ let _ =
| "nnf" -> choiceNNF ()
| "verify" -> choiceVerify ()
| "graph" -> choiceGraph ()
| "nom2fix" -> choiceNom2fix()
| "nom2fix" -> choiceNom2fix()
| _ -> printUsage ()
(* vim: set et sw=2 sts=2 ts=8 : *)
......@@ -497,3 +497,5 @@ let _ =
let (fl, tboxND, tboxD) = exportALCQuery tbox sf in
ALCGraph.isSat ~verbose:true fl tboxND tboxD
*)
(* vim: set et sw=2 sts=2 ts=8 : *)
......@@ -114,3 +114,5 @@ let _ =
}
in
Repl.start session
(* vim: set et sw=2 sts=2 ts=8 : *)
......@@ -1819,3 +1819,5 @@ let importTancs2000 filename =
with Stream.Failure ->
close_in file;
A.printError mk_exn ~ts "unexpected EOS"
(* vim: set et sw=2 sts=2 ts=8 : *)
......@@ -100,3 +100,5 @@ val createFactTBox : string -> formula list -> formula list -> definition list -
val createWill : string -> formula -> unit
val createOWL : string -> formula list -> formula list -> definition list -> unit
val importTancs2000 : string -> (formula list) * (formula list) * definition list
(* vim: set et sw=2 sts=2 ts=8 : *)
......@@ -399,3 +399,5 @@ let isSat ?(verbose = false) fl tboxND tboxD =
print_newline ()
end else ();
sat
(* vim: set et sw=2 sts=2 ts=8 : *)
......@@ -2,3 +2,5 @@ type formula = ALCFormula.formula
type definition = ALCFormula.definition
val isSat : ?verbose:bool -> formula list -> formula list -> definition list -> bool
(* vim: set et sw=2 sts=2 ts=8 : *)
......@@ -895,3 +895,5 @@ let rankingNoAnd = [ A.getTypeFormula (A.OR (A.TRUE, A.TRUE));
whose formulae are stored in the bitsets explicitly.
*)
let notyNoAnd = 7
(* vim: set et sw=2 sts=2 ts=8 : *)
......@@ -2352,3 +2352,5 @@ module HcFHt = Hashtbl.Make(
let hash (f : t) = f.HC.tag
end
)
(* vim: set et sw=2 sts=2 ts=8 : *)
......@@ -172,3 +172,5 @@ val hc_replace : HcFormula.t -> string -> hcFormula -> hcFormula -> hcFormula
val hc_freeIn : string -> hcFormula -> bool
module HcFHt : (Hashtbl.S with type key = hcFormula)
(* vim: set et sw=2 sts=2 ts=8 : *)
......@@ -111,3 +111,5 @@ let string_of_coalition sort bs =
let string_of_coalition_list sort bs_list =
String.concat "\n" (List.map (string_of_coalition sort) bs_list)
(* vim: set et sw=2 sts=2 ts=8 : *)
......@@ -15,3 +15,5 @@ val string_of_coalition_list : sort -> bset list -> string
(* vim: set et sw=2 sts=2 ts=8 : *)
......@@ -719,3 +719,5 @@ let getExpandingFunctionProducer = function
| DefaultImplication -> mkRule_DefaultImplication
| Choice -> mkRule_Choice
| Fusion -> mkRule_Fusion
(* vim: set et sw=2 sts=2 ts=8 : *)
......@@ -7,3 +7,5 @@ open CoAlgMisc
val getExpandingFunctionProducer : functors -> sort -> bset -> bset -> sort list -> stateExpander
(* vim: set et sw=2 sts=2 ts=8 : *)
......@@ -1291,3 +1291,5 @@ let ppFormulae nomTbl tbox (s, f) =
List.iter (fun (s, f) -> bsetAdd tboxTbl.(s) (C.HcFHt.find htF.(s) f)) hctbox;
tboxTable := tboxTbl;
(tbox1, (s, f1), initbs)
(* vim: set et sw=2 sts=2 ts=8 : *)
......@@ -370,3 +370,5 @@ val lfToAt : sort -> localFormula -> atFormula
val ppFormulae : (string -> sort option) -> CoAlgFormula.sortedFormula list -> CoAlgFormula.sortedFormula ->
CoAlgFormula.sortedFormula list * CoAlgFormula.sortedFormula * bset
(* vim: set et sw=2 sts=2 ts=8 : *)
......@@ -1127,3 +1127,5 @@ let isSat ?(verbose = false) sorts nomTable tbox sf =
print_newline ()
else ();
sat
(* vim: set et sw=2 sts=2 ts=8 : *)
......@@ -23,3 +23,5 @@ val initReasoner : sortTable -> (string -> CoAlgFormula.sort option) ->
val runReasonerStep : unit -> unit
val reasonerFinished : unit -> bool
val isRootSat : unit -> bool option
(* vim: set et sw=2 sts=2 ts=8 : *)
......@@ -61,3 +61,5 @@ let fromSome optionalvalue =
match optionalvalue with
| Some x -> x
| None -> raise No_value
(* vim: set et sw=2 sts=2 ts=8 : *)
......@@ -33,3 +33,5 @@ val (<<) : ('b -> 'c) -> ('a -> 'b) -> ('a -> 'c)
exception No_value
val fromSome : 'a option -> 'a
(* vim: set et sw=2 sts=2 ts=8 : *)
Supports Markdown
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment