Datasets:
AllenGeng
/
OCaml_program_corpus

Dataset card Data Studio Files Community
text
stringlengths
0
601k
module R = struct let filter_attrib ( name , a ) on = match a with | Xml . Event _ | Xml . MouseEvent _ | Xml . KeyboardEvent _ | Xml . TouchEvent _ -> raise ( Invalid_argument " filter_attrib not implemented for event handler " ) | Xml . Attr a -> name , Xml . Attr ( React . S . l2 ( fun on a -> if on then a else None ) on a ) let attach_attribs = Xml . attach_attribs module Xml = struct module W = Wrap type ' a wrap = ' a W . t type ' a list_wrap = ' a W . tlist type uri = Xml . uri let string_of_uri = Xml . string_of_uri let uri_of_string = Xml . uri_of_string type aname = Xml . aname type event_handler = Xml . event_handler type mouse_event_handler = Xml . mouse_event_handler type keyboard_event_handler = Xml . keyboard_event_handler type touch_event_handler = Xml . touch_event_handler type attrib = Xml . attrib let attr name f s = let a = W . fmap f s in name , Xml . Attr a let float_attrib name s = attr name ( fun f -> Some ( js_string_of_float f ) ) s let int_attrib name s = attr name ( fun f -> Some ( js_string_of_int f ) ) s let string_attrib name s = attr name ( fun f -> Some ( Js . string f ) ) s let space_sep_attrib name s = attr name ( fun f -> Some ( Js . string ( String . concat " " f ) ) ) s let comma_sep_attrib name s = attr name ( fun f -> Some ( Js . string ( String . concat " , " f ) ) ) s let event_handler_attrib name s = Xml . event_handler_attrib name s let mouse_event_handler_attrib name s = Xml . mouse_event_handler_attrib name s let keyboard_event_handler_attrib name s = Xml . keyboard_event_handler_attrib name s let touch_event_handler_attrib name s = Xml . touch_event_handler_attrib name s let uri_attrib name s = attr name ( fun f -> Some ( Js . string f ) ) s let uris_attrib name s = attr name ( fun f -> Some ( Js . string ( String . concat " " f ) ) ) s type elt = Xml . elt type ename = Xml . ename let empty = Xml . empty let comment = Xml . comment let pcdata s = let e = Dom_html . document ## createTextNode ( Js . string " " ) in let _ = React . S . map ( fun s -> e . ## data := Js . string s ) s in ( e :> Dom . node Js . t ) let encodedpcdata s = pcdata s let entity s = Xml . entity s let leaf = Xml . leaf let node ( ? a = [ ] ) name l = let e = Dom_html . document ## createElement ( Js . string name ) in attach_attribs e a ; Util . update_children ( e :> Dom . node Js . t ) l ; ( e :> Dom . node Js . t ) let cdata = Xml . cdata let cdata_script = Xml . cdata_script let cdata_style = Xml . cdata_style end module Xml_Svg = struct include Xml let leaf = Xml_Svg . leaf let node ( ? a = [ ] ) name l = let e = Dom_html . document ## createElementNS Dom_svg . xmlns ( Js . string name ) in attach_attribs e a ; Util . update_children ( e :> Dom . node Js . t ) l ; ( e :> Dom . node Js . t ) end module Svg = Svg_f . Make ( Xml_Svg ) module Html = Html_f . Make ( Xml ) ( Svg ) module Html5 = Html end
module Core_category = struct type t = [ ` Branch | ` Temporary | ` Permanent ] let default_category = ` Temporary let string_of_category = function | ` Permanent -> " permanent " | ` Temporary -> " temporary " | ` Branch -> " branch " let classify = function | ` Permanent -> Error_classification . Permanent | ` Temporary -> Temporary | ` Branch -> Branch end include Core_maker . Make ( struct let id = " " end ) ( Core_category )
let get_int32_string s off = Bytes . get_int32_be ( Bytes . unsafe_of_string s ) off
let get_int8_string s off = Bytes . get_int8 ( Bytes . unsafe_of_string s ) off
let get_int16_string s off = Bytes . get_int16_be ( Bytes . unsafe_of_string s ) off
let get_int64_string s off = Bytes . get_int64_be ( Bytes . unsafe_of_string s ) off
let get_uint8_string s off = Bytes . get_uint8 ( Bytes . unsafe_of_string s ) off
let get_uint16_string s off = Bytes . get_uint16_be ( Bytes . unsafe_of_string s ) off
let get_double buff i = Int64 . float_of_bits ( Bytes . get_int64_be buff i )
let get_double_string buff i = Int64 . float_of_bits ( Bytes . get_int64_be ( Bytes . unsafe_of_string buff ) i )
let set_double buff i v = Bytes . set_int64_be buff i ( Int64 . bits_of_float v )
let is_empty = function [ ] -> true | _ -> false
let rev_sub l n = if n < 0 then invalid_arg " Utils . rev_sub : ` n ` must be non - negative . " ; let rec append_rev_sub acc l = function | 0 -> acc | n -> ( match l with | [ ] -> acc | hd :: tl -> append_rev_sub ( hd :: acc ) tl ( n - 1 ) ) in append_rev_sub [ ] l n
let sub l n = rev_sub l n |> List . rev
let rec remove nb = function | [ ] -> [ ] | l when nb <= 0 -> l | _ :: tl -> remove ( nb - 1 ) tl
let rec repeat n x = if n <= 0 then [ ] else x :: repeat ( pred n ) x
let split_n n l = let rec loop acc n = function | [ ] -> ( l , [ ] ) | rem when n <= 0 -> ( List . rev acc , rem ) | x :: xs -> loop ( x :: acc ) ( pred n ) xs in loop [ ] n l
let take_n_unsorted n l = fst ( split_n n l )
let take_n_sorted ( type a ) compare n l = let module B = Bounded_heap . Make ( struct type t = a let compare = compare end ) in let t = B . create n in List . iter ( fun x -> B . insert x t ) l ; B . get t
let take_n ? compare n l = match compare with | None -> take_n_unsorted n l | Some compare -> take_n_sorted compare n l
let rec drop_n n l = if n <= 0 then l else match l with [ ] -> [ ] | _ :: xs -> drop_n ( n - 1 ) xs
let select n l = let rec loop n acc = function | [ ] -> invalid_arg " Utils . select " | x :: xs when n <= 0 -> ( x , List . rev_append acc xs ) | x :: xs -> loop ( pred n ) ( x :: acc ) xs in loop n [ ] l
let shift = function [ ] -> [ ] | hd :: tl -> tl @ [ hd ]
let rec product a b = match a with | [ ] -> [ ] | hd :: tl -> List . map ( fun x -> ( hd , x ) ) b @ product tl b
let shuffle ? rng_state l = let randint = match rng_state with | None -> Random . int | Some rng_state -> Random . State . int rng_state in let a = Array . of_list l in let len = Array . length a in for i = len downto 2 do let m = randint i in let n ' = i - 1 in if m <> n ' then ( let tmp = a . ( m ) in a . ( m ) <- a . ( n ' ) ; a . ( n ' ) <- tmp ) done ; Array . to_list a
let index_of ( ? compare = Stdlib . compare ) item list = let rec find index = function | [ ] -> None | head :: tail -> if compare head item = 0 then Some index else find ( index + 1 ) tail in find 0 list
let filter_some l = let rec go acc = function | [ ] -> List . rev acc | None :: xs -> go acc xs | Some x :: xs -> go ( x :: acc ) xs in go [ ] l
let rec find_map f = function | [ ] -> None | x :: l -> ( match f x with None -> find_map f l | r -> r )
let fold_left_i f init l = List . fold_left ( fun ( i , accu ) x -> let accu = f i accu x in ( i + 1 , accu ) ) ( 0 , init ) l |> snd
module List = struct include Tezos_stdlib . TzList include Tezos_error_monad . TzLwtreslib . List end
module String = struct include String include Tezos_stdlib . TzString module Hashtbl = Tezos_error_monad . TzLwtreslib . Hashtbl . MakeSeeded ( struct type t = string let equal = String . equal let hash = Hashtbl . seeded_hash end ) end
module Filename = struct include Stdlib . Filename include Tezos_stdlib . TzFilename end
module Set = Set . Make ( String )
module Map = Map . Make ( String )
let split delim ( ? dup = true ) ( ? limit = max_int ) path = let l = String . length path in let rec do_slashes acc limit i = if i >= l then List . rev acc else if path . [ i ] = delim then if dup then do_slashes acc limit ( i + 1 ) else do_split acc limit ( i + 1 ) else do_split acc limit i and do_split acc limit i = if limit <= 0 then if i = l then List . rev acc else List . rev ( String . sub path i ( l - i ) :: acc ) else do_component acc ( pred limit ) i i and do_component acc limit i j = if j >= l then if i = j then List . rev acc else List . rev ( String . sub path i ( j - i ) :: acc ) else if path . [ j ] = delim then do_slashes ( String . sub path i ( j - i ) :: acc ) limit j else do_component acc limit i ( j + 1 ) in if limit > 0 then do_slashes [ ] limit 0 else [ path ]
let split_path path = split ' ' / path
let has_prefix ~ prefix s = let x = String . length prefix in let n = String . length s in n >= x && String . sub s 0 x = prefix
let remove_prefix ~ prefix s = let x = String . length prefix in let n = String . length s in if n >= x && String . sub s 0 x = prefix then Some ( String . sub s x ( n - x ) ) else None
let common_prefix s1 s2 = let last = min ( String . length s1 ) ( String . length s2 ) in let rec loop i = if last <= i then last else if s1 . [ i ] = s2 . [ i ] then loop ( i + 1 ) else i in loop 0
let mem_char s c = String . index_opt s c <> None
let fold_left f init s = let acc = ref init in String . iter ( fun c -> acc := f ! acc c ) s ; ! acc
let pp_bytes_hex fmt bytes = Hex . ( of_bytes bytes |> pp fmt )
let tztest ( name : string ) ( speed : Alcotest . speed_level ) ( f : unit -> ' a Lwt . t ) : unit Alcotest_lwt . test_case = Alcotest_lwt . test_case name speed ( fun _sw ( ) -> let open Lwt_syntax in let * r = f ( ) in match r with | Ok ( ) -> Lwt . return_unit | Error err -> let * ( ) = Tezos_base_unix . Internal_event_unix . close ( ) in Format . printf " @\ n % a . " @ pp_print_trace err ; Lwt . fail Alcotest . Test_error )
let tztest_qcheck ~ name generator f = let ( name , speed , run ) = QCheck_alcotest . to_alcotest ( QCheck . Test . make ~ name generator @@ fun x -> match Lwt_main . run ( f x ) with | Ok _ -> true | Error err -> QCheck . Test . fail_reportf " @\ n % a . " @ pp_print_trace err ) in Alcotest_lwt . test_case name speed ( fun _sw ( ) -> Lwt . return @@ run ( ) )
let mock_sink : Mock_sink . t Internal_event . sink_definition = ( module Mock_sink : Internal_event . SINK with type t = Mock_sink . t )
let with_empty_mock_sink ( f : unit -> unit Lwt . t ) : unit Lwt . t = let open Lwt_syntax in if not ( Mock_sink . is_activated ( ) ) then ( Internal_event . All_sinks . register mock_sink ; let * r = Internal_event . All_sinks . activate ( Uri . of_string " mock - log " ) :// in match r with | Ok _ -> f ( ) | Error errors -> Format . printf " Could not initialize mock sink :\ n % a \ n " pp_print_trace errors ; Format . print_flush ( ) ; Lwt . return_unit ) else ( Mock_sink . clear_events ( ) ; f ( ) )
let patch_env_loading ( ) = let open Tezos_base . TzPervasives in let preloaded_cmis : Persistent_env . Persistent_signature . t String . Hashtbl . t = Tezos_protocol_compiler . Compiler . preloaded_cmis in Persistent_env . Persistent_signature . load := fun ~ unit_name -> match String . Hashtbl . find preloaded_cmis ( String . capitalize_ascii unit_name ) with | Some v -> Some v | None -> Tezos_protocol_compiler . Compiler . default_load ~ unit_name
let directive_string_fn fn_name = match Hashtbl . find_opt Toploop . directive_table fn_name with | Some ( Toploop . Directive_string fn ) -> fn | _ -> Printf . printf " Tztop failed to load due to an internal error \ n \ Unable to find directive % s \ n " fn_name ; exit ( - 1 )
let use_output command = directive_string_fn " use_output " command
let load_stdlib ( ) = directive_string_fn " load " " stdlib . cma "
let load_dune_libs directory = use_output @@ " dune top " ^ directory
module Arg : sig type t val of_sys_argv : string array -> t option val get_working_directory : t -> string val to_toplevel_sys_argv : t -> string array type t = string array let of_sys_argv argv = if Array . length argv < 2 then None else Some Sys . argv let [ @ inline ] get_working_directory arg = arg . ( 1 ) let to_toplevel_sys_argv argv = let new_argv = Array . sub argv 1 ( Array . length argv - 1 ) in new_argv . ( 0 ) <- argv . ( 0 ) ; new_argv end
let ( ) = match Arg . of_sys_argv Sys . argv with | Some arg -> let directory = Arg . get_working_directory arg in let directory_does_exist = try Sys . is_directory directory with _ -> false in if not directory_does_exist then ( Printf . printf " stdout :% s is either not a directory or doesn ' t exist \ n " directory ; exit ( - 1 ) ) ; let new_argv = Arg . to_toplevel_sys_argv arg in Toploop . override_sys_argv new_argv ; Tztop_common . patch_env_loading ( ) ; Tztop_common . load_stdlib ( ) ; Tztop_common . load_dune_libs directory ; Tztop . main ( ) | None -> Printf . printf { | Tztop expects path to sub - library $ dune exec -- tztop src / proto_alpha exit ( - 1 )
type ' err trace = ' err list
let make err = [ err ]
let cons err trace = err :: trace
let cons_list err errs = err :: errs
let conp trace _trace = trace
let conp_list tr _trs = tr
let pp_print pp_error ppf = function | [ ] -> assert false | [ error ] -> Format . fprintf ppf " [ @< v 2 > Error :@ % a ] . " @@ pp_error error | error :: _ as errors -> Format . fprintf ppf " [ @< v 2 > Error :@ % a , @ trace :@ % a ] . " @@ pp_error error ( Format . pp_print_list pp_error ) ( List . rev errors )
let pp_print_top pp_error fmt = function | [ ] -> assert false | error :: _ -> pp_error fmt error
let encoding error_encoding = Data_encoding . list error_encoding
let ipv4 = map ~ rev : Ipaddr . V4 . to_int32 Ipaddr . V4 . of_int32 int32 |> set_print Ipaddr . V4 . to_string
let ipv6 = map ~ rev : Ipaddr . V6 . to_int64 Ipaddr . V6 . of_int64 ( pair int64 int64 ) |> set_print Ipaddr . V6 . to_string
let ipv4_as_v6 = let open QCheck in map Ipaddr . v6_of_v4 ipv4 |> set_print Ipaddr . V6 . to_string
let addr_port_id = let gen = let open Gen in let open P2p_point . Id in let * addr = map Ipaddr . V4 . to_string @@ gen ipv4 and * port = opt @@ gen Lib_test . Qcheck_helpers . uint16 in pure { addr ; port ; peer_id = None } in make gen ~ print : P2p_point . Id . addr_port_id_to_string
let port_opt = QCheck . option port
let peer_id = QCheck . option QCheck . ( map P2p_identity . generate_with_pow_target_0 unit )
let ip = QCheck . choose [ ipv4_as_v6 ; ipv6 ]
let ipv4_as_v6_or_v6 = QCheck . choose [ ipv4_as_v6 ; ipv6 ]
let ipv4t = QCheck . triple ipv4 port_opt peer_id
let ipv6t = QCheck . triple ipv6 port_opt peer_id
let p2p_point_id_t = QCheck . pair ip port
let ae = assert_equal ~ printer ( : fun x -> x ) x
let pqi ( d : ( ' a , ' b ) ' b S . statement ) statement = d . S . sql_statement
let pq ( d : ( ' a , ' b , ' c ) ' c S . expression ) expression = pqi d . S . statement
let test_sql _ = let s = pqi [ % sql " insert into values ( values % s { sfoo } sfoo , % s { sbar } sbar ) sbar ] " in ae " insert into values ( values { ? foo } foo , { ? bar } bar ) bar " s ; let s = pq [ % sql " @ d { dkilroy } dkilroy was @ s { shere } shere ] " in ae " kilroy was here " s ; let s = pq [ % sql " select @ d { dt1 . id } id , @ s { st1 . label } label from table as t1 ] . . . " in ae " select t1 . id , t1 . label from table as t1 . . . " s ; let s = pqi [ % sql " @ s % d { dabc } dabc ] " in ae " @ s { ? abc } abc " s ; let s = pq [ % sql " @ s @ s % d @ s { sabc } sabc % d @ s % d @ s % d { ddef } ddef % d { dghi } dghi @ s ] " in ae " @ s @ s ? abc ?@ s ?@ s { ? def } def { ? ghi } ghi @ s " s ; let s = pq [ % sql " @ s { s : kilroy } kilroy @@ was { %@ here } here ] " in ae " : kilroy @@ was { %@ here } here " s ; let s = pq [ % sql " select @ d { d % d } d ] " in ae " select " ? s ; let s = pq [ % sql " select @ d { dCOUNT } dCOUNT FROM foo ] " in ae " select COUNT FROM foo " s ; let s = pq [ % sql " @ d { dcount } ] " in ae " count " s ; let s = pqi [ % sql " excellent ] " in ae " excellent " s
let test_quotes _ = let s = pq [ % sql " strftime ( strftime ' % s -% d ' , % s -% d @ s { sabc } sabc % d { ddef } ddef ' @ s { sabc } sabc % d { ddef } ddef ' ) ddef ' ] " in ae " strftime ( strftime ' % s -% d ' , ?-? abc { ? def } def ' @ s { sabc } sabc % d { ddef } ddef ' ) ddef ' " s ; let s = pq [ % sql { sql | strftime ( strftime " % s -% d " , % s -% d @ s { sabc } sabc % d { ddef } ddef " @ s { sabc } sabc % d { ddef } ddef ) } ] " | in ae { | strftime ( strftime " % s -% d " , ?-? abc { ? def } def " @ s { sabc } sabc % d { ddef } ddef ) } " | s ; let s = pq [ % sql { |@ s { sabc } sabc " @ s { sdef } sdef " ' @ d { dghi } dghi ' ' % f ' % f " % S " % S " ' @ s { sjkl } sjkl % d ' " ' " % d ' } ] " | in ae { | abc " @ s { sdef } sdef " ' @ d { dghi } dghi ' ' % f ' " ?% S " ? " ' @ s { sjkl } sjkl % d ' " ' " % d ' } " | s ; let s = pqi [ % sql { " | ' % d ' " % d ' " % d " ' " ' % d " ' } ] | in ae { " | ' % d ' " ? ' " % d " ' " ' % d " ' } | s ; let s = pq [ % sql { |@ s { s ' hello ' } s ' hello ' } ] | in ae { | ' hello ' } | s
let tests = " ppx_tests " >::: [ " test_sql " >:: test_sql ; " test_quotes " >:: test_quotes ; ]
let _ = run_test_tt_main tests
let aeq_int = assert_equal ~ printer ( : sprintf " % d ) "
let aeq_str = assert_equal ~ printer ( : sprintf " % S ) "
let aeq_float = assert_equal ~ printer ( : sprintf " % f ) "
let aeq_int32 = assert_equal ~ printer ( : sprintf " % ld ) "
let aeq_int64 = assert_equal ~ printer ( : sprintf " % Ld ) "
let aeq_bool = assert_equal ~ printer : string_of_bool
let aeq_list ~ printer = assert_equal ~ printer ( : fun l -> [ " " ^ String . concat " ; " ( List . map printer l ) l ^ " ] ) "
module Test ( Lwt : sig include Sqlexpr_concurrency . THREAD val iter : ( ' a -> unit t ) t -> ' a list -> unit t val run : ' a t -> ' a end ) end ( Sqlexpr : sig include Sqlexpr_sqlite . S with type ' a result = ' a Lwt . t end ) end = struct open Lwt module S = Sqlexpr let ( ) >|= f g = bind f ( fun x -> return ( g x ) x ) x let with_db ( ? in_mem = true ) true f x = let file = if in_mem then " : memory " : else Filename . temp_file " t_sqlexpr_sqlite_ " " " in let db = S . open_db file in try_lwt f db x finally S . close_db db ; if not in_mem then Sys . remove file ; return ( ) let test_execute ( ) = with_db ( fun db ( ) -> S . execute db sql " CREATE TABLE foo ( fooid INTEGER PRIMARY KEY ) KEY " >>= fun ( ) -> S . execute db sqlc " CREATE TABLE bar ( barid INTEGER PRIMARY KEY ) KEY ) " ( ) let insert_d db l = S . execute db sql " CREATE TABLE foo ( fooid INTEGER PRIMARY KEY , v INTEGER ) INTEGER " >>= fun ( ) -> iter ( S . execute db sql " INSERT INTO foo ( foov ) foov VALUES ( VALUES % d ) d ) " l let insert_l db l = S . execute db sql " CREATE TABLE foo ( fooid INTEGER PRIMARY KEY , v INTEGER ) INTEGER " >>= fun ( ) -> iter ( S . execute db sql " INSERT INTO foo ( foov ) foov VALUES ( VALUES % l ) l ) " l let insert_L db l = S . execute db sql " CREATE TABLE foo ( fooid INTEGER PRIMARY KEY , v INTEGER ) INTEGER " >>= fun ( ) -> iter ( S . execute db sql " INSERT INTO foo ( foov ) foov VALUES ( VALUES % L ) L ) " l let insert_f db l = S . execute db sql " CREATE TABLE foo ( fooid INTEGER PRIMARY KEY , v FLOAT ) FLOAT " >>= fun ( ) -> iter ( S . execute db sql " INSERT INTO foo ( foov ) foov VALUES ( VALUES % f ) f ) " l let insert_s db l = S . execute db sql " CREATE TABLE foo ( fooid INTEGER PRIMARY KEY , v TEXT ) TEXT " >>= fun ( ) -> iter ( S . execute db sql " INSERT INTO foo ( foov ) foov VALUES ( VALUES % s ) s ) " l let insert_S db l = S . execute db sql " CREATE TABLE foo ( fooid INTEGER PRIMARY KEY , v BLOB ) BLOB " >>= fun ( ) -> iter ( S . execute db sql " INSERT INTO foo ( foov ) foov VALUES ( VALUES % S ) S ) " l let insert_b db l = S . execute db sql " CREATE TABLE foo ( fooid INTEGER PRIMARY KEY , v BOOLEAN ) BOOLEAN " >>= fun ( ) -> iter ( S . execute db sql " INSERT INTO foo ( foov ) foov VALUES ( VALUES % b ) b ) " l let test_directive_d ( ) = with_db insert_d [ 1 ] 1 let test_directive_l ( ) = with_db insert_l [ 1l ] 1l let test_directive_L ( ) = with_db insert_L [ 1L ] 1L let test_directive_f ( ) = with_db insert_f [ 3 . 14 ] 14 let test_directive_s ( ) = with_db insert_s [ " foo ] " let test_directive_S ( ) = with_db insert_S [ " blob ] " let test_directive_b ( ) = with_db insert_b [ true ] true let test_oexpr fmt insert expr l ( ) = with_db ( fun db ( ) -> let n = ref 1 in insert db l >>= fun ( ) -> let l = List . map ( fun x -> let i = ! n in incr n ; ( i , x ) x ) x l in lwt l ' = S . select db expr in let l ' = List . sort compare l ' in aeq_list ~ printer ( : fun ( id , x ) x -> sprintf ( ( " % d , " ^^ fmt ^^ ) ) " " id x ) x l l ' ; return ( ) ) ( ) let test_nullable_oexpr fmt insert expr l ( ) = with_db ( fun db ( ) -> let n = ref 1 in insert db l >>= fun ( ) -> let l = List . map ( fun x -> let i = ! n in incr n ; ( i , Some x ) x ) x l in lwt l ' = S . select db expr in let l ' = List . sort compare l ' in aeq_list ~ printer ( : fun ( id , x ) x -> match x with None -> sprintf ( " % d , None ) None " id | Some x -> sprintf ( ( " % d , Some " ^^ fmt ^^ ) ) " " id x ) x l l ' ; return ( ) ) ( ) let test_oexpr_directives = with_db ( fun db ( ) -> S . select db sql " SELECT @ d { d % d } d " 42 >|= aeq_list ~ printer ( : sprintf " % d ) " [ 42 ] 42 >>= fun ( ) -> S . select db sql " SELECT @ f { f % d } d " 42 >|= aeq_list ~ printer ( : sprintf " % f ) " [ 42 ] . >>= fun ( ) -> S . select db sql " SELECT @ s { s % d } d " 42 >|= aeq_list ~ printer ( : sprintf " % s ) " [ " 42 ] ) " let ( ) >:: name f = name >:: ( fun ( ) -> run ( f ( ) ) ) let test_directives = [ " % d " >:: test_directive_d ; " % l " >:: test_directive_l ; " % L " >:: test_directive_L ; " % f " >:: test_directive_f ; " % s " >:: test_directive_s ; " % S " >:: test_directive_S ; " % b " >:: test_directive_b ; ] let test_outputs = let t = test_oexpr in let tn = test_nullable_oexpr in [ " % d " >:: t " % d " insert_d sql " SELECT @ d { did } did , @ d { dv } dv FROM foo " [ 1 ; - 1 ; 3 ; 4 ] 4 ; " % l " >:: t " % ld " insert_l sql " SELECT @ d { did } did , @ l { lv } lv FROM foo " [ 1l ; - 1l ; 3l ; 4l ] 4l ; " % L " >:: t " % Ld " insert_L sql " SELECT @ d { did } did , @ L { Lv } Lv FROM foo " [ 1L ; - 1L ; 3L ; 4L ] 4L ; " % f " >:: t " % f " insert_f sql " SELECT @ d { did } did , @ f { fv } fv FROM foo " [ 1 . ; - 1 . ; 10 . ; 1e2 ] 1e2 ; " % s " >:: t " % s " insert_s sql " SELECT @ d { did } did , @ s { sv } sv FROM foo " [ " foo " ; " bar " ; " baz ] " ; " % S " >:: t " % S " insert_s sql " SELECT @ d { did } did , @ S { Sv } Sv FROM foo " [ " foo " ; " bar " ; " baz ] " ; " % b " >:: t " % b " insert_b sql " SELECT @ d { did } did , @ b { bv } bv FROM foo " [ true ; false ] false ; " % d " >:: tn " % d " insert_d sql " SELECT @ d { did } did , @ d { ? v } v FROM foo " [ 1 ; - 1 ; 3 ; 4 ] 4 ; " % l " >:: tn " % ld " insert_l sql " SELECT @ d { did } did , @ l { ? v } v FROM foo " [ 1l ; - 1l ; 3l ; 4l ] 4l ; " % L " >:: tn " % Ld " insert_L sql " SELECT @ d { did } did , @ L { ? v } v FROM foo " [ 1L ; - 1L ; 3L ; 4L ] 4L ; " % f " >:: tn " % f " insert_f sql " SELECT @ d { did } did , @ f { ? v } v FROM foo " [ 1 . ; - 1 . ; 10 . ; 1e2 ] 1e2 ; " % s " >:: tn " % s " insert_s sql " SELECT @ d { did } did , @ s { ? v } v FROM foo " [ " foo " ; " bar " ; " baz ] " ; " % S " >:: tn " % S " insert_s sql " SELECT @ d { did } did , @ S { ? v } v FROM foo " [ " foo " ; " bar " ; " baz ] " ; " % b " >:: tn " % b " insert_b sql " SELECT @ d { did } did , @ b { ? v } v FROM foo " [ true ; false ] false ; ] exception Cancel let test_transaction ( ) = with_db begin fun db ( ) -> let s_of_pair ( id , data ) data = sprintf ( " % d , % S ) S " id data in let get_rows db = S . select db sql " SELECT @ d { did } did , @ s { sdata } sdata FROM foo ORDER BY id " in let get_one db = S . select_one db sql " SELECT @ d { did } did , @ s { sdata } sdata FROM foo ORDER BY id " in let get_one ' db = S . select_one db sqlc " SELECT @ d { did } did , @ s { sdata } sdata FROM foo ORDER BY id " in let insert db = S . execute db sql " INSERT INTO foo ( fooid , data ) data VALUES ( VALUES % d , % s ) s " in let aeq = aeq_list ~ printer : s_of_pair in let aeq_one = assert_equal ~ printer : s_of_pair in S . execute db sql " CREATE TABLE foo ( fooid INTEGER NOT NULL , data TEXT NOT NULL ) NULL " >>= fun ( ) -> get_rows db >|= aeq ~ msg " : Init " [ ] >>= fun ( ) -> S . transaction db ( fun db -> get_rows db >|= aeq [ ] >>= fun ( ) -> insert db 1 " foo " >>= fun ( ) -> get_rows db >|= aeq ~ msg " : One insert in TX " [ 1 , " foo ] " >>= fun ( ) -> get_one db >|= aeq_one ~ msg " : select_one after 1 insert in TX " ( 1 , " foo ) " >>= fun ( ) -> get_one ' db >|= aeq_one ~ msg " : select_one ( cached ) cached after 1 insert in TX " ( 1 , " foo ) " >>= fun ( ) -> try_lwt S . transaction db ( fun db -> insert db 2 " bar " >>= fun ( ) -> get_rows db >|= aeq ~ msg " : Insert in nested TX " [ 1 , " foo " ; 2 , " bar ] " ; >>= fun ( ) -> fail Cancel ) Cancel with Cancel -> get_rows db >|= aeq ~ msg " : After nested TX is canceled " [ 1 , " foo ] ) " >>= fun ( ) -> get_rows db >|= aeq [ 1 , " foo ] " ; end ( ) let test_retry_begin ( ) = let count_rows db = S . select_one db sqlc " SELECT @ d { dCOUNT } dCOUNT FROM foo " in let insert v db = lwt _ = count_rows db in Lwt . sleep 0 . 010 >>= fun ( ) -> S . insert db sqlc " INSERT INTO foo VALUES ( VALUES % d ) d " v in let fname = Filename . temp_file " t_sqlexpr_sqlite_excl_retry " " " in let db1 = S . open_db fname in let db2 = S . open_db fname in S . execute db1 sqlc " CREATE TABLE foo ( fooid INTEGER PRIMARY KEY ) KEY " >>= fun ( ) -> lwt _ = S . transaction ~ kind ` : EXCLUSIVE db1 ( insert 1 ) 1 and _ = S . transaction ~ kind ` : EXCLUSIVE db2 ( insert 2 ) 2 in lwt n = count_rows db1 in aeq_int ~ msg " : number of rows inserted " 2 n ; return ( ) let test_fold_and_iter ( ) = with_db begin fun db ( ) -> S . execute db sql " CREATE TABLE foo ( foon INTEGER NOT NULL ) NULL " >>= fun ( ) -> let l = Array . to_list ( Array . init 100 ( fun n -> 1 + Random . int 100000 ) 100000 ) 100000 in iter ( S . execute db sqlc " INSERT INTO foo ( foon ) foon VALUES ( VALUES % d ) d ) " l >>= fun ( ) -> let sum = List . fold_left ( ) + 0 l in lwt count , sum ' = S . fold db ( fun ( count , sum ) sum n -> return ( count + 1 , sum + n ) n ) n ( 0 , 0 ) 0 sqlc " SELECT @ d { dn } dn FROM foo " in aeq_int ~ msg " : fold : number of elements " ( List . length l ) l count ; aeq_int ~ msg " : fold : sum of elements " sum sum ' ; let count = ref 0 in let sum ' = ref 0 in lwt ( ) = S . iter db ( fun n -> incr count ; sum ' := ! sum ' + n ; return ( ) ) sqlc " SELECT @ d { dn } dn FROM foo " in aeq_int ~ msg " : iter : number of elements " ( List . length l ) l ! count ; aeq_int ~ msg " : iter : sum of elements " sum ! sum ' ; return ( ) end ( ) let rec do_test_nested_iter_and_fold db ( ) = nested_iter_and_fold_write db >>= fun ( ) -> nested_iter_and_fold_read db and nested_iter_and_fold_write db = S . execute db sql " CREATE TABLE foo ( foon INTEGER NOT NULL ) NULL " >>= fun ( ) -> iter ( S . execute db sqlc " INSERT INTO foo ( foon ) foon VALUES ( VALUES % d ) d ) " [ 1 ; 2 ; 3 ] 3 and nested_iter_and_fold_read db = let q = Queue . create ( ) in let expected = List . rev [ 1 , 3 ; 1 , 2 ; 1 , 1 ; 2 , 3 ; 2 , 2 ; 2 , 1 ; 3 , 3 ; 3 , 2 ; 3 , 1 ; ] in let inner = sqlc " SELECT @ d { dn } dn FROM foo ORDER BY n DESC " in let outer = sqlc " SELECT @ d { dn } dn FROM foo ORDER BY n ASC " in let printer ( a , b ) b = sprintf ( " % d , % d ) d " a b in lwt ( ) = S . iter db ( fun a -> S . iter db ( fun b -> Queue . push ( a , b ) b q ; return ( ) ) inner ) inner outer in aeq_list ~ printer expected ( Queue . fold ( fun l x -> x :: l ) l [ ] q ) q ; lwt l = S . fold db ( fun l a -> S . fold db ( fun l b -> return ( ( a , b ) b :: l ) l ) l l inner ) inner [ ] outer in aeq_list ~ printer expected l ; return ( ) let test_nested_iter_and_fold ( ) = with_db ~ in_mem : false do_test_nested_iter_and_fold ( ) let expect_missing_table tbl f = try_lwt f ( ) >>= fun ( ) -> assert_failure ( sprintf " Expected Sqlite3 . Error : missing table % s " tbl ) tbl with Sqlexpr_sqlite . Error _ -> return ( ) let test_borrow_worker ( ) = with_db begin fun db ( ) -> S . borrow_worker db ( fun db ' -> S . borrow_worker db ( fun db ' ' -> do_test_nested_iter_and_fold db ' ' ( ) ) >>= fun ( ) -> nested_iter_and_fold_read db ' ) db ' >>= fun ( ) -> nested_iter_and_fold_read db end ( ) let maybe_test flag f ( ) = if flag then f ( ) else return ( ) let all_tests has_real_borrow_worker = [ " Directives " >::: test_directives ; " Outputs " >::: test_outputs ; " Directives in output exprs " >:: test_oexpr_directives ; " Transactions " >:: test_transaction ; " Auto - retry BEGIN " >:: test_retry_begin ; " Fold and iter " >:: test_fold_and_iter ; " Nested fold and iter " >:: test_nested_iter_and_fold ; " Borrow worker " >:: maybe_test has_real_borrow_worker test_borrow_worker ; ] end
let test_lwt_recursive_mutex ( ) = let module M = Sqlexpr_concurrency . Lwt in let mv = Lwt_mvar . create ( ) in let m = M . create_recursive_mutex ( ) in let l = ref [ ] in let push x = l := x :: ! l ; return ( ) in lwt n = M . with_lock m ( fun ( ) -> M . with_lock m ( fun ( ) -> return 42 ) 42 ) 42 in aeq_int 42 n ; let t1 = M . with_lock m ( fun ( ) -> push 1 >>= fun ( ) -> Lwt_mvar . take mv >>= fun ( ) -> push 2 ) 2 in let t2 = M . with_lock m ( fun ( ) -> push 3 ) 3 in lwt ( ) = Lwt . join [ t1 ; t2 ; Lwt_mvar . put mv ( ) ] in aeq_list ~ printer : string_of_int [ 3 ; 2 ; 1 ] 1 ! l ; return ( )
module type S_LWT = Sqlexpr_sqlite . S with type ' a result = ' a Lwt . t
let with_db ( type a ) a ( module S : S_LWT with type db = a ) a ( ? in_mem = true ) true f x = let file = if in_mem then " : memory " : else Filename . temp_file " t_sqlexpr_sqlite_ " " " in let db = S . open_db file in try_lwt f db x finally S . close_db db ; if not in_mem then Sys . remove file ; return ( )
let test_exclusion ( type a ) a ( ( module S : S_LWT with type db = a ) a as s ) s ( ) = let module Sqlexpr = S in with_db s ~ in_mem : false begin fun db ( ) -> S . execute db sql " CREATE TABLE foo ( foon INTEGER NOT NULL ) NULL " >>= fun ( ) -> let exclusion_between_tx_and_single_stmt ( ) = let t1 , u1 = Lwt . wait ( ) in let t2 , u2 = Lwt . wait ( ) in let t3 , u3 = Lwt . wait ( ) in let th1 = S . transaction db ( fun db -> t1 >|= Lwt . wakeup u2 >>= fun ( ) -> Lwt_unix . sleep 0 . 010 >>= fun ( ) -> S . select_one db sql " SELECT @ d { dCOUNT } dCOUNT FROM foo " >|= aeq_int ~ msg " : number of rows ( single stmt exclusion ) exclusion " 0 ) 0 and th2 = begin t3 >>= fun ( ) -> S . execute db sql " INSERT INTO foo VALUES ( VALUES1 ) VALUES1 " end and th3 = begin Lwt . wakeup u1 ( ) ; lwt ( ) = t2 in Lwt . wakeup u3 ( ) ; return ( ) end in th1 <&> th2 <&> th3 in let exclusion_between_txs ( ) = let inside = ref 0 in let check db = try_lwt incr inside ; if ! inside > 1 then assert_failure " More than one TX in critical region at a time " ; Lwt_unix . sleep 0 . 005 finally decr inside ; return ( ) in Lwt . join ( Sqlexpr_utils . List . init 1 ( fun _ -> S . transaction db check ) check ) check in exclusion_between_txs ( ) >>= fun ( ) -> exclusion_between_tx_and_single_stmt ( ) end ( )
module IdConc = struct include Sqlexpr_concurrency . Id let iter = List . iter let run x = x end
module LwtConc = struct include Sqlexpr_concurrency . Lwt let run x = Lwt_main . run ( Lwt . pick [ x ; Lwt_unix . timeout 1 . 0 ] 0 ) 0 let iter = Lwt_list . iter_s end
let lwt_run f ( ) = LwtConc . run ( f ( ) )
let all_tests = [ " Sqlexpr_concurrency . Lwt . with_lock " >:: lwt_run test_lwt_recursive_mutex ; ( let module M = Test ( TestIdConc ) TestIdConc ( TestIdConcSqlexpr_sqlite . Make ( MakeIdConc ) MakeIdConc ) MakeIdConc in " Sqlexpr_sqlite . Make ( MakeSqlexpr_concurrency . Id ) Id " >::: M . all_tests false ) false ; ( let module M = Test ( TestLwtConc ) TestLwtConc ( TestLwtConcSqlexpr_sqlite . Make ( MakeLwtConc ) MakeLwtConc ) MakeLwtConc in " Sqlexpr_sqlite . Make ( MakeLwtConcurrency ) MakeLwtConcurrency " >::: M . all_tests false ) false ; ( let module M = Test ( TestLwtConc ) TestLwtConc ( TestLwtConcSqlexpr_sqlite_lwt ) TestLwtConcSqlexpr_sqlite_lwt in " Sqlexpr_sqlite_lwt " >::: M . all_tests true ) true ; " Sqlexpr_sqlite . Make ( MakeLwtConcurrency ) MakeLwtConcurrency exclusion " >:: lwt_run ( test_exclusion ( module Sqlexpr_sqlite . Make ( MakeLwtConc ) MakeLwtConc ) MakeLwtConc ) MakeLwtConc ; ]
let _ = run_test_tt_main ( " All " >::: all_tests ) all_tests
type t = { version : string ; application_id : string ; }
let create application_id = { version = " U2F_V2 " ; application_id }
type protocol_error = [ ` Other_error | ` Bad_request | ` Configuration_unsupported | ` Device_ineligible | ` Timeout | ` Unrecognized of int ]