diff options
Diffstat (limited to 'src')
| -rwxr-xr-x | src/cell.ml | 2 | ||||
| -rwxr-xr-x | src/functions.ml | 2 | ||||
| -rw-r--r--[-rwxr-xr-x] | src/scTypes.ml | 39 | ||||
| -rwxr-xr-x | src/sheet.ml | 76 |
4 files changed, 59 insertions, 60 deletions
diff --git a/src/cell.ml b/src/cell.ml index e6f86d1..dc5dcdc 100755 --- a/src/cell.ml +++ b/src/cell.ml @@ -35,7 +35,7 @@ let to_hname x = begin let value' = value - 1 in
let rem = value' mod 26 in
let quot = (value' - rem) / 26
- in extract ((char_of_int (65 + rem))::acc) quot
+ in (extract[@tailcall]) ((char_of_int (65 + rem))::acc) quot
) else (
acc
)
diff --git a/src/functions.ml b/src/functions.ml index dfedfd0..0258ce0 100755 --- a/src/functions.ml +++ b/src/functions.ml @@ -46,7 +46,7 @@ fun printer typ -> match typ with | Num -> Format.fprintf printer "Num"
| String -> Format.fprintf printer "String"
| List t -> Format.fprintf printer "List[%a]"
- repr t
+ (repr[@tailcall]) t
module C = Catalog.Make(struct
diff --git a/src/scTypes.ml b/src/scTypes.ml index 31dc799..e85b2f1 100755..100644 --- a/src/scTypes.ml +++ b/src/scTypes.ml @@ -167,19 +167,32 @@ module Expr = struct module T = Type.Eval(E.T) module R = Refs.Eval(E.R) - let eval e t = begin - - let rec eval_expr : t -> E.repr = function - | Ref r -> E.ref (R.eval_ref r) t - | Value v -> E.value (T.eval_type v) t - | Call0 ident -> E.call0 ident t - | Call1 (ident, p1) -> E.call1 ident (eval_expr p1) t - | Call2 (ident, p1, p2) -> E.call2 ident (eval_expr p1) (eval_expr p2) t - | Call3 (ident, p1, p2, p3) -> E.call3 ident (eval_expr p1) (eval_expr p2) (eval_expr p3) t - | CallN (ident, exprs) -> E.callN ident (List.map (fun x -> eval_expr x) exprs) t - | Expression e -> E.expression (eval_expr e) t - in - E.observe (eval_expr e) + let eval e t = begin + + let rec _eval v k = begin match v with + | Ref r -> k @@ E.ref (R.eval_ref r) t + | Value v -> k @@ E.value (T.eval_type v) t + | Call0 ident -> k @@ E.call0 ident t + | Call1 (ident, p1) -> + _eval p1 (fun v1 -> + k @@ E.call1 ident v1 t) + | Call2 (ident, p1, p2) -> + _eval p1 (fun v1 -> + _eval p2 (fun v2 -> + k @@ E.call2 ident v1 v2 t)) + | Call3 (ident, p1, p2, p3) -> + (_eval[@tailcall]) p1 (fun v1 -> + (_eval[@tailcall]) p2 (fun v2 -> + (_eval[@tailcall]) p3 (fun v3 -> + k @@ E.call3 ident v1 v2 v3 t))) + | CallN (ident, exprs) -> + let mapped = List.map (fun x -> _eval x (fun x -> x)) exprs in + k @@ E.callN ident mapped t + | Expression e -> + (_eval[@tailcall]) e (fun v1 -> k @@ E.expression v1 t) + end in + + E.observe (_eval e (fun x -> x)) end end diff --git a/src/sheet.ml b/src/sheet.ml index cfe299d..b72786e 100755 --- a/src/sheet.ml +++ b/src/sheet.ml @@ -62,54 +62,40 @@ module Raw = struct None
end
- exception Cycle of Cell.Set.t * t
+ let traverse (f:(cell -> content -> t -> t option)) content (init, t) = begin
- (** Parse all the successors from an element, apply a function to each of
- them, and return them.
-
- The function is too long and should be rewriten… *)
- let rec traverse (f:(cell -> content -> t -> t option)) source (init, t) = begin
- try Cell.Set.fold (successors init f init source) source.sink (init, t)
- with Cycle (succ, t) -> (succ, t)
- end
-
- and successors init f parents source element (succ, t) = begin
-
- let content = Map.find element t in
-
- if Cell.Set.mem element parents then (
-
- (* if the cell has already been visited, mark it in error, and all the
- descendant *)
- let cycle_error = Some (ScTypes.Result.Error Errors.Cycle) in
+ let rec ts visited t next = begin
+ if Cell.Set.is_empty next then
+ Ok (visited, t)
+ else
+ let (id:cell) = Cell.Set.choose next in
- if content.value = cycle_error then (
- (* The content has already been updated, do not process it again *)
- (succ, t)
- ) else (
- let t = Map.add element { content with value = cycle_error } t
- and set_error cell content t =
- if content.value = cycle_error then
- None
- else
- Some (Map.add cell { content with value = cycle_error } t) in
- let succ, t = traverse set_error source (init, t) in
- raise (Cycle (succ, t))
- )
- ) else (
- begin match f element content t with
- | None ->
- (* The content does not change, we do not update the successors *)
- (succ, t)
- | Some t' ->
- let parents' = Cell.Set.add element parents
- and succ' = Cell.Set.add element succ in
- if (Cell.Set.is_empty content.sink) then
- (succ', t')
+ if Cell.Set.mem id init then
+ Error (visited, t)
else
- Cell.Set.fold (successors init f parents' source) content.sink (succ', t')
- end
- )
+ let content = Map.find id t in
+ let next' = Cell.Set.remove id next
+ and visited' = Cell.Set.add id visited in
+
+ begin match f id content t with
+ | None ->
+ (* The content does not change, we do not update the successors *)
+ (ts[@tailcall]) visited' t next'
+ | Some t' ->
+ let delta = Cell.Set.diff content.sink init in
+ let next'' = Cell.Set.union next' delta in
+
+ (ts[@tailcall]) visited' t' next''
+ end
+ end in
+
+ begin match ts init t content.sink with
+ | Ok (visited, t) -> (visited, t)
+ | Error (visited, t) ->
+ let cycle_error = Some (ScTypes.Result.Error Errors.Cycle) in
+ let setErr cell t : t= Map.add cell { content with value = cycle_error } t in
+ visited, Cell.Set.fold setErr visited t
+ end
end
(** Remove the cell from the sheet *)
|