+(* execute_ex env q *)
+(* [env] is the attributed uri environment in which the query [q] *)
+(* must be evaluated *)
+(* [q] is the query to evaluate *)
+(* It returns a [Mathql_semantics.result] *)
+let rec execute_ex env =
+ function
+ MQSelect (apvar, alist, abool) ->
+ select_ex env apvar (execute_ex env alist) abool
+ | MQUsedBy (alist, asvar) ->
+ use_ex (execute_ex env alist) asvar (get_prop_id "refObj") (* "F" (*"refObj"*) *)
+ | MQUse (alist, asvar) ->
+ use_ex (execute_ex env alist) asvar (get_prop_id "backPointer") (* "B" (*"backPointer"*) *)
+ | MQPattern (apreamble, apattern, afragid) ->
+ pattern_ex (apreamble, apattern, afragid)
+ | MQUnion (l1, l2) ->
+ union_ex (execute_ex env l1) (execute_ex env l2)
+ | MQDiff (l1, l2) ->
+ diff_ex (execute_ex env l1) (execute_ex env l2)
+ | MQSortedBy (l, o, f) ->
+ sortedby_ex (execute_ex env l) o f
+ | MQIntersect (l1, l2) ->
+ intersect_ex (execute_ex env l1) (execute_ex env l2)
+ | MQListRVar rvar -> [List.assoc rvar env]
+ | MQLetIn (lvar, l1, l2) ->
+ let t = Unix.time () in
+ let res =
+ (*CSC: The interesting code *)
+ let _ = letin_ex lvar (execute_ex env l1) in
+ execute_ex env l2
+ (*CSC: end of the interesting code *)
+ in
+ letdispose ();
+ print_string ("LETIN = " ^ string_of_int (List.length res) ^ ": ") ;
+ print_endline (string_of_float (Unix.time () -. t) ^ "s") ;
+ flush stdout ;
+ res
+ | MQListLVar lvar ->
+ letref_ex lvar
+ | MQReference l ->
+ let rec build_result = function
+ | [] -> []
+ | s :: tail ->
+ {uri = s ; attributes = [] ; extra = ""} :: build_result tail
+ in build_result (List.sort compare l)
+;;
+
+(* Let's initialize the execute in Select, creating a cyclical recursion *)
+Select.execute := execute_ex;;
+