AllenGeng/ocamlgithub · Datasets at Hugging Face

text stringlengths 12 786k
let string_of_connected_component ( ? len = 1024 ) x = let ob = Bi_outbuf . create len in let ( ) = write_connected_component ob x in Bi_outbuf . contents ob
let connected_component_of_string s = read_connected_component ( Yojson . Safe . init_lexer ( ) ) ( Lexing . from_string s )
module Style = struct type t = \| Loc \| Error \| Warning \| Kwd \| Id \| Prompt \| Details \| Ok \| Debug \| Success \| Ansi_styles of Ansi_color . Style . t list end
module Print_config = struct type t = Style . t -> Ansi_color . Style . t list open Ansi_color . Style let default : Style . t -> _ = function \| Loc -> [ bold ] \| Error -> [ bold ; fg_red ] \| Warning -> [ bold ; fg_magenta ] \| Kwd -> [ bold ; fg_blue ] \| Id -> [ bold ; fg_yellow ] \| Prompt -> [ bold ; fg_green ] \| Details -> [ dim ; fg_white ] \| Ok -> [ dim ; fg_green ] \| Debug -> [ underlined ; fg_bright_cyan ] \| Success -> [ bold ; fg_green ] \| Ansi_styles l -> l end
type t = { loc : Loc0 . t option ; paragraphs : Style . t Pp . t list ; hints : Style . t Pp . t list }
let make ? loc ? prefix ( ? hints = [ ] ) paragraphs = let paragraphs = match ( prefix , paragraphs ) with \| None , l -> l \| Some p , [ ] -> [ p ] \| Some p , x :: l -> Pp . concat ~ sep : Pp . space [ p ; x ] :: l in { loc ; hints ; paragraphs }
let pp { loc ; paragraphs ; hints } = let open Pp . O in let paragraphs = match hints with \| [ ] -> paragraphs \| _ -> List . append paragraphs ( List . map hints ~ f ( : fun hint -> Pp . verbatim " Hint " : ++ Pp . space ++ hint ) ) in let paragraphs = List . map paragraphs ~ f : Pp . box in let paragraphs = match loc with \| None -> paragraphs \| Some { Loc0 . start ; stop } -> let start_c = start . pos_cnum - start . pos_bol in let stop_c = stop . pos_cnum - start . pos_bol in Pp . tag Style . Loc ( Pp . textf " File % S , line % d , characters % d -% d " : start . pos_fname start . pos_lnum start_c stop_c ) :: paragraphs in Pp . vbox ( Pp . concat_map paragraphs ~ sep : Pp . nop ~ f ( : fun pp -> Pp . seq pp Pp . cut ) )
let print ( ? config = Print_config . default ) t = Ansi_color . print ( Pp . map_tags ( pp t ) ~ f : config )
let prerr ( ? config = Print_config . default ) t = Ansi_color . prerr ( Pp . map_tags ( pp t ) ~ f : config )
let levenshtein_distance s t = let m = String . length s and n = String . length t in let d = Array . make_matrix ~ dimx ( : m + 1 ) ~ dimy ( : n + 1 ) 0 in for i = 0 to m do d . ( i ) . ( 0 ) <- i done ; for j = 0 to n do d . ( 0 ) . ( j ) <- j done ; for j = 1 to n do for i = 1 to m do if s . [ i - 1 ] = t . [ j - 1 ] then d . ( i ) . ( j ) <- d . ( i - 1 ) . ( j - 1 ) else d . ( i ) . ( j ) <- min ( d . ( i - 1 ) . ( j ) + 1 ) ( min ( d . ( i ) . ( j - 1 ) + 1 ) ( d . ( i - 1 ) . ( j - 1 ) + 1 ) ) done done ; d . ( m ) . ( n )
let did_you_mean s ~ candidates = let candidates = List . filter candidates ~ f ( : fun candidate -> levenshtein_distance s candidate < 3 ) in match candidates with \| [ ] -> [ ] \| l -> [ Pp . textf " did you mean % s " ? ( String . enumerate_or l ) ]
let to_string t = Format . asprintf " % a " Pp . render_ignore_tags ( pp { t with loc = None } ) \|> String . drop_prefix ~ prefix " : Error : " \|> Option . value_exn \|> String . trim
let json = ` O [ ( " name " , ` String " OCaml ) " ; ( " qualities " , ` A [ ` O [ ( " name " , ` String " awesome ) " ] ; ` O [ ( " name " , ` String " simple ) " ] ; ` O [ ( " name " , ` String " fun ) " ] ] ) ]
let section heading = print_newline ( ) ; print_string " # " ; print_endline heading
let subsection heading = print_newline ( ) ; print_string " ## " ; print_endline heading
let test tmpl = subsection " parsed " ; print_endline " " ; --- print_endline ( Mustache . to_string tmpl ) tmpl ; print_endline " " ; --- subsection " rendered " ; print_endline " " ; --- print_endline ( Mustache . render tmpl json ) json ; print_endline " " ; --- ( )
let ( ) = section " Parsed template "
let parsed_template = Mustache . of_string " Hello { { name } name } name \ nMustache is :\ n { n { n # qualities } qualities } qualities \ n * { { name } name } name \ n { n { n / qualities } qualities } qualities \ n "
let ( ) = test parsed_template
let ( ) = section " Programmed template "
let programmed_template = let open Mustache in concat [ raw " Hello " ; escaped " name " ; raw " \ n " ; raw " Mustache is " : ; raw " \ n " ; section " qualities " @@ concat [ raw " * " ; escaped " name " ; raw " \ n " ] ]
let ( ) = test programmed_template
let ( ) = section " Output comparison "
let ( ) = let parsed_output = Mustache . render parsed_template json in let programmed_output = Mustache . render programmed_template json in if String . equal parsed_output programmed_output then print_endline " Outputs match as expected . " else print_endline " Outputs DO NOT match , this is suspcious . "
module type Sig = sig val register_migration : unit -> unit val register_cleaner : unit -> unit val lifecycles : Sihl . Container . lifecycle list val search : ? ctx ( : string * string ) list -> [ ` Desc \| ` Asc ] -> string option -> limit : int -> offset : int -> ( Model . t list * int ) Lwt . t val get : ? ctx ( : string * string ) list -> string -> Model . t option Lwt . t val get_by_email : ? ctx ( : string * string ) list -> string -> Model . t option Lwt . t val insert : ? ctx ( : string * string ) list -> Model . t -> unit Lwt . t val update : ? ctx ( : string * string ) list -> Model . t -> unit Lwt . t end
let status = let encode m = m \|> Model . status_to_string \|> Result . ok in let decode = Model . status_of_string in Caqti_type . ( custom ~ encode ~ decode string ) ; ;
let user = let open Sihl . Contract . User in let encode m = Ok ( m . id , ( m . email , ( m . username , ( m . name , ( m . given_name , ( m . password , ( m . status , ( m . admin , ( m . confirmed , ( m . created_at , m . updated_at ) ) ) ) ) ) ) ) ) ) in let decode ( id , ( email , ( username , ( name , ( given_name , ( password , ( status , ( admin , ( confirmed , ( created_at , updated_at ) ) ) ) ) ) ) ) ) ) = Ok { id ; email ; username ; name ; given_name ; password ; status ; admin ; confirmed ; created_at ; updated_at } in Caqti_type . ( custom ~ encode ~ decode ( tup2 string ( tup2 string ( tup2 ( option string ) ( tup2 ( option string ) ( tup2 ( option string ) ( tup2 string ( tup2 status ( tup2 bool ( tup2 bool ( tup2 ptime ptime ) ) ) ) ) ) ) ) ) ) ) ; ;
module MakeMariaDb ( MigrationService : Sihl . Contract . Migration . Sig ) : Sig = struct let lifecycles = [ Database . lifecycle ; MigrationService . lifecycle ] module Migration = struct let fix_collation = Migration . create_step ~ label " : fix collation " { sql \| SET collation_server = ' utf8mb4_unicode_ci ' \| sql } ; ; let create_users_table = Migration . create_step ~ label " : create users table " { sql \| CREATE TABLE IF NOT EXISTS user_users ( id BIGINT UNSIGNED AUTO_INCREMENT , uuid BINARY ( 16 ) NOT NULL , email VARCHAR ( 128 ) NOT NULL , password VARCHAR ( 128 ) NOT NULL , username VARCHAR ( 128 ) , status VARCHAR ( 128 ) NOT NULL , admin BOOLEAN NOT NULL DEFAULT false , confirmed BOOLEAN NOT NULL DEFAULT false , created_at TIMESTAMP DEFAULT CURRENT_TIMESTAMP , PRIMARY KEY ( id ) , CONSTRAINT unique_uuid UNIQUE KEY ( uuid ) , CONSTRAINT unique_email UNIQUE KEY ( email ) ) ENGINE = InnoDB DEFAULT CHARSET = utf8mb4 COLLATE = utf8mb4_unicode_ci \| sql } ; ; let add_updated_at_column = Sihl . Database . Migration . create_step ~ label " : add updated_at column " { sql \| ALTER TABLE user_users ADD COLUMN updated_at TIMESTAMP NOT NULL DEFAULT CURRENT_TIMESTAMP \| sql } ; ; let add_name_columns = Sihl . Database . Migration . create_step ~ label " : add name columns " { sql \| ALTER TABLE user_users ADD COLUMN name VARCHAR ( 128 ) NULL , ADD COLUMN given_name VARCHAR ( 128 ) NULL \| sql } ; ; let migration ( ) = Migration . ( empty " user " \|> add_step fix_collation \|> add_step create_users_table \|> add_step add_updated_at_column \|> add_step add_name_columns ) ; ; end let filter_fragment = { sql \| WHERE user_users . email LIKE $ 1 OR user_users . username LIKE $ 1 OR user_users . name LIKE $ 1 OR user_users . given_name LIKE $ 1 OR user_users . status LIKE $ 1 \| sql } ; ; let search_query = { sql \| SELECT COUNT OVER ( ) as total , LOWER ( CONCAT ( SUBSTR ( HEX ( uuid ) , 1 , 8 ) , ' ' , - SUBSTR ( HEX ( uuid ) , 9 , 4 ) , ' ' , - SUBSTR ( HEX ( uuid ) , 13 , 4 ) , ' ' , - SUBSTR ( HEX ( uuid ) , 17 , 4 ) , ' ' , - SUBSTR ( HEX ( uuid ) , 21 ) ) ) , email , username , name , given_name , password , status , admin , confirmed , created_at , updated_at FROM user_users \| sql } ; ; let request = Sihl . Database . prepare_search_request ~ search_query ~ filter_fragment ~ sort_by_field " : id " user ; ; let search ? ctx sort filter ~ limit ~ offset = Sihl . Database . run_search_request ? ctx request sort filter ~ limit ~ offset ; ; let get_request = let open Caqti_request . Infix in { sql \| SELECT LOWER ( CONCAT ( SUBSTR ( HEX ( uuid ) , 1 , 8 ) , ' ' , - SUBSTR ( HEX ( uuid ) , 9 , 4 ) , ' ' , - SUBSTR ( HEX ( uuid ) , 13 , 4 ) , ' ' , - SUBSTR ( HEX ( uuid ) , 17 , 4 ) , ' ' , - SUBSTR ( HEX ( uuid ) , 21 ) ) ) , email , username , name , given_name , password , status , admin , confirmed , created_at , updated_at FROM user_users WHERE user_users . uuid = UNHEX ( REPLACE ( , ? ' ' , - ' ' ) ) \| sql } \|> Caqti_type . string ->? user ; ; let get ? ctx id = Database . find_opt ? ctx get_request id let get_by_email_request = let open Caqti_request . Infix in { sql \| SELECT LOWER ( CONCAT ( SUBSTR ( HEX ( uuid ) , 1 , 8 ) , ' ' , - SUBSTR ( HEX ( uuid ) , 9 , 4 ) , ' ' , - SUBSTR ( HEX ( uuid ) , 13 , 4 ) , ' ' , - SUBSTR ( HEX ( uuid ) , 17 , 4 ) , ' ' , - SUBSTR ( HEX ( uuid ) , 21 ) ) ) , email , username , name , given_name , password , status , admin , confirmed , created_at , updated_at FROM user_users WHERE user_users . email LIKE ? \| sql } \|> Caqti_type . string ->? user ; ; let get_by_email ? ctx email = Database . find_opt ? ctx get_by_email_request email ; ; let insert_request = let open Caqti_request . Infix in { sql \| INSERT INTO user_users ( uuid , email , username , name , given_name , password , status , admin , confirmed , created_at , updated_at ) VALUES ( UNHEX ( REPLACE ( $ 1 , ' ' , - ' ' ) ) , LOWER ( $ 2 ) , $ 3 , $ 4 , $ 5 , $ 6 , $ 7 , $ 8 , $ 9 , $ 10 , $ 11 ) \| sql } \|> user . -> Caqti_type . unit ; ; let insert ? ctx user = Database . exec ? ctx insert_request user let update_request = let open Caqti_request . Infix in { sql \| UPDATE user_users SET email = LOWER ( $ 2 ) , username = $ 3 , name = $ 4 , given_name = $ 5 , password = $ 6 , status = $ 7 , admin = $ 8 , confirmed = $ 9 , created_at = $ 10 , updated_at = $ 11 WHERE user_users . uuid = UNHEX ( REPLACE ( $ 1 , ' ' , - ' ' ) ) \| sql } \|> user . -> Caqti_type . unit ; ; let update ? ctx user = Database . exec ? ctx update_request user let clean_request = let open Caqti_request . Infix in " TRUNCATE user_users " \|> Caqti_type . ( unit . -> unit ) ; ; let clean ? ctx ( ) = Database . exec ? ctx clean_request ( ) let register_migration ( ) = MigrationService . register_migration ( Migration . migration ( ) ) ; ; let register_cleaner ( ) = Cleaner . register_cleaner clean end
module MakePostgreSql ( MigrationService : Sihl . Contract . Migration . Sig ) : Sig = struct let lifecycles = [ Database . lifecycle ; MigrationService . lifecycle ] module Migration = struct let create_users_table = Migration . create_step ~ label " : create users table " { sql \| CREATE TABLE IF NOT EXISTS user_users ( id serial , uuid uuid NOT NULL , email VARCHAR ( 128 ) NOT NULL , password VARCHAR ( 128 ) NOT NULL , username VARCHAR ( 128 ) , status VARCHAR ( 128 ) NOT NULL , admin BOOLEAN NOT NULL DEFAULT false , confirmed BOOLEAN NOT NULL DEFAULT false , created_at TIMESTAMP WITH TIME ZONE DEFAULT CURRENT_TIMESTAMP , PRIMARY KEY ( id ) , UNIQUE ( uuid ) , UNIQUE ( email ) ) \| sql } ; ; let add_updated_at_column = Sihl . Database . Migration . create_step ~ label " : add updated_at column " { sql \| ALTER TABLE user_users ADD COLUMN updated_at TIMESTAMPTZ NOT NULL DEFAULT NOW ( ) \| sql } ; ; let remove_timezone = Sihl . Database . Migration . create_step ~ label " : remove timezone info from timestamps " { sql \| ALTER TABLE user_users ALTER COLUMN created_at TYPE TIMESTAMP , ALTER COLUMN updated_at TYPE TIMESTAMP \| sql } ; ; let add_name_columns = Sihl . Database . Migration . create_step ~ label " : add name columns " { sql \| ALTER TABLE user_users ADD COLUMN name VARCHAR ( 128 ) NULL , ADD COLUMN given_name VARCHAR ( 128 ) NULL \| sql } ; ; let migration ( ) = Migration . ( empty " user " \|> add_step create_users_table \|> add_step add_updated_at_column \|> add_step remove_timezone \|> add_step add_name_columns ) ; ; end let filter_fragment = { sql \| WHERE user_users . email LIKE $ 1 OR user_users . username LIKE $ 1 OR user_users . name LIKE $ 1 OR user_users . given_name LIKE $ 1 OR user_users . status LIKE $ 1 \| sql } ; ; let search_query = { sql \| SELECT COUNT OVER ( ) as total , uuid , email , username , name , given_name , password , status , admin , confirmed , created_at , updated_at FROM user_users \| sql } ; ; let request = Sihl . Database . prepare_search_request ~ search_query ~ filter_fragment ~ sort_by_field " : id " user ; ; let search ? ctx sort filter ~ limit ~ offset = Sihl . Database . run_search_request ? ctx request sort filter ~ limit ~ offset ; ; let get_request = let open Caqti_request . Infix in { sql \| SELECT uuid as id , email , username , name , given_name , password , status , admin , confirmed , created_at , updated_at FROM user_users WHERE user_users . uuid = $ 1 :: uuid \| sql } \|> Caqti_type . string ->? user ; ; let get ? ctx id = Database . find_opt ? ctx get_request id let get_by_email_request = let open Caqti_request . Infix in { sql \| SELECT uuid as id , email , username , name , given_name , password , status , admin , confirmed , created_at , updated_at FROM user_users WHERE LOWER ( user_users . email ) = LOWER ( ) ? \| sql } \|> Caqti_type . string ->? user ; ; let get_by_email ? ctx email = Database . find_opt ? ctx get_by_email_request email ; ; let insert_request = let open Caqti_request . Infix in { sql \| INSERT INTO user_users ( uuid , email , username , name , given_name , password , status , admin , confirmed , created_at , updated_at ) VALUES ( $ 1 :: uuid , LOWER ( $ 2 ) , $ 3 , $ 4 , $ 5 , $ 6 , $ 7 , $ 8 , $ 9 , $ 10 AT TIME ZONE ' UTC ' , $ 11 AT TIME ZONE ' UTC ' ) \| sql } \|> user . -> Caqti_type . unit ; ; let insert ? ctx user = Database . exec ? ctx insert_request user let update_request = let open Caqti_request . Infix in { sql \| UPDATE user_users SET email = LOWER ( $ 2 ) , username = $ 3 , name = $ 4 , given_name = $ 5 , password = $ 6 , status = $ 7 , admin = $ 8 , confirmed = $ 9 , created_at = $ 10 , updated_at = $ 11 WHERE user_users . uuid = $ 1 :: uuid \| sql } \|> user . -> Caqti_type . unit ; ; let update ? ctx user = Database . exec ? ctx update_request user let clean_request = let open Caqti_request . Infix in " TRUNCATE TABLE user_users CASCADE " \|> Caqti_type . ( unit . -> unit ) ; ; let clean ? ctx ( ) = Database . exec ? ctx clean_request ( ) let register_migration ( ) = MigrationService . register_migration ( Migration . migration ( ) ) ; ; let register_cleaner ( ) = Cleaner . register_cleaner clean end
let test_current_user = let current_user = Lwt_main . run begin Github . ( Monad . ( run ( User . current_info ~ token ( ) >\|= Response . value ) ) ) end in assert ( current_user . Github_t . user_info_ty = ` User ) ; Format . printf " Check current user : OK . . " @
let test_current_user_first_org = let org = Lwt_main . run begin Github . ( Monad . ( run begin let orgs = Organization . current_user_orgs ~ token ( ) in Stream . next orgs >>= function \| None -> Printf . eprintf " No organizations for the current user . \ n " ; exit 1 \| Some ( first_org , _ ) -> return first_org end ) ) end in assert ( org . Github_t . org_ty = ` Org ) ; Format . printf " Check current user first org : OK . . " @
let test_ocaml_organization = let ocaml_user = Lwt_main . run begin Github . ( Monad . ( run begin User . info ~ token ~ user " : ocaml " ( ) >\|= Response . value end ) ) end in assert ( ocaml_user . Github_t . user_info_ty = ` Org ) ; Format . printf " Check OCaml org : OK . . " @
let test_ocaml_repository = let opam_repository = Lwt_main . run begin Github . ( Monad . ( run begin Repo . info ~ token ~ user " : ocaml " ~ repo " : opam " ( ) >\|= Response . value end ) ) end in assert Github_t . ( opam_repository . repository_owner . user_ty = ` Org ) ; Format . printf " Check OCaml repo : OK . . " @
let mem u s = ISet . mem ( UChar . uint_code u ) u s
let add u s = ISet . add ( UChar . uint_code u ) u s
let add_range u1 u2 s = ISet . add_range ( UChar . uint_code u1 ) u1 ( UChar . uint_code u2 ) u2 s
let singleton u = ISet . singleton ( UChar . uint_code u ) u
let remove u s = ISet . remove ( UChar . uint_code u ) u s
let remove_range u1 u2 s = ISet . remove_range ( UChar . uint_code u1 ) u1 ( UChar . uint_code u2 ) u2 s
let from u s = ISet . from ( UChar . uint_code u ) u s
let after u s = ISet . after ( UChar . uint_code u ) u s
let until u s = ISet . until ( UChar . uint_code u ) u s
let before u s = ISet . before ( UChar . uint_code u ) u s
let iter f s = ISet . iter ( fun n -> f ( UChar . chr_of_uint n ) n ) n s
let iter_range f s = let f ' n1 n2 = f ( UChar . chr_of_uint n1 ) n1 ( UChar . chr_of_uint n2 ) n2 in ISet . iter_range f ' s
let fold f s a = let f ' n a = f ( UChar . chr_of_uint n ) n a in ISet . fold f ' s a
let fold_range f s a = let f ' n1 n2 a = f ( UChar . chr_of_uint n1 ) n1 ( UChar . chr_of_uint n2 ) n2 a in ISet . fold_range f ' s a
let for_all p s = let p ' n = p ( UChar . chr_of_uint n ) n in ISet . for_all p ' s
let exists p s = let p ' n = p ( UChar . chr_of_uint n ) n in ISet . exists p ' s
let filter p s = let p ' n = p ( UChar . chr_of_uint n ) n in ISet . filter p ' s
let partition p s = let p ' n = p ( UChar . chr_of_uint n ) n in ISet . partition p ' s
let elements s = List . map UChar . chr_of_uint ( ISet . elements s ) s
let ranges s = let f ( n1 , n2 ) n2 = ( UChar . chr_of_uint n1 , UChar . chr_of_uint n2 ) n2 in List . map f ( ISet . ranges s ) s
let min_elt s = UChar . chr_of_uint ( ISet . min_elt s ) s
let max_elt s = UChar . chr_of_uint ( ISet . max_elt s ) s
let choose s = UChar . chr_of_uint ( ISet . choose s ) s
let uset_of_iset s = s
let iset_of_uset s = s
let get_files_in_directory dir = let len = String . length dir in let dir = if len > 0 && Sys . os_type = " Win32 " && ( dir . [ len - 1 ] = ' ' / \|\| dir . [ len - 1 ] = ' ' ) \\ then String . sub dir ~ pos : 0 ~ len ( : len - 1 ) else dir in match try Some ( opendir dir ) with Unix_error _ -> None with None -> [ ] \| Some dirh -> let rec get_them l = match try Some ( readdir dirh ) with _ -> None with \| Some x -> get_them ( x :: l ) \| None -> closedir dirh ; l in List . sort ~ cmp : compare ( get_them [ ] )
let is_directory name = try ( stat name ) . st_kind = S_DIR with _ -> false
let concat dir name = let len = String . length dir in if len = 0 then name else if dir . [ len - 1 ] = ' ' / then dir ^ name else dir ^ " " / ^ name
let get_directories_in_files ~ path = List . filter ~ f ( : fun x -> is_directory ( concat path x ) )
let subshell ~ cmd = let rc = open_process_in cmd in let rec it l = match try Some ( input_line rc ) with _ -> None with Some x -> it ( x :: l ) \| None -> List . rev l in let answer = it [ ] in ignore ( close_process_in rc ) ; answer
module Make ( Text : UnicodeString . Type ) Type = struct let test ( ? char_gen = ( fun _ -> uchar_of_int ( Random . int 0x8000000 ) 0x8000000 ) 0x8000000 ) 0x8000000 ~ desc ~ log ( ) = random_test ~ desc ~ log ~ data ( : fun size -> Array . init size char_gen ) char_gen ~ body ( : fun a -> expect_pass ~ body ( : fun ( ) -> let s = Text . init ( Array . length a ) a ( Array . get a ) a in let len = Text . length s in expect_equal ~ msg ( : lazy " init ) " len ( Array . length a ) a ; for _ = 0 to 50 do let i = Random . int len in expect_equal ~ msg ( : lazy ( sprintf " set / get : location % d " i ) i ) i ( Text . get s i ) i a ( . i ) i done ; let r = ref 0 in Text . iter ( fun u -> expect_equal ~ msg ( : lazy ( sprintf " iter : location % d " ! r ) r ) r u a ( . ! r ) r ; incr r ) r s ; expect_equal ~ msg ( : lazy ( sprintf " iter : count % d " ! r ) r ) r ! r len ; let cur = ref ( Text . nth s 0 ) 0 in let r = ref 0 in while not ( Text . out_of_range s ! cur ) cur do expect_equal ~ msg ( : lazy ( sprintf " index look : location % d " ! r ) r ) r ( Text . look s ! cur ) cur a ( . ! r ) r ; cur := Text . next s ! cur ; incr r done ; expect_equal ~ msg ( : lazy ( sprintf " index : count % d " ! r ) r ) r ! r len ; for _ = 0 to 100 do let pos = Random . int len in let cur = Text . nth s pos in expect_equal ~ msg ( : lazy ( sprintf " nth : location % d " pos ) pos ) pos ( Text . look s cur ) cur a ( . pos ) pos ; if pos = 0 then ( ) else let cur ' = Text . prev s cur in expect_equal_app ~ msg ( : lazy ( sprintf " cursor prev : location % d " pos ) pos ) pos ( fun ( ) -> Text . look s cur ' ) cur ' ( ) ( fun i -> a ( . i ) i ) i ( pos - 1 ) 1 ; if pos = len - 1 then ( ) else let cur ' = Text . next s cur in expect_equal_app ~ msg ( : lazy ( sprintf " cursor next : location % d " pos ) pos ) pos ( fun ( ) -> Text . look s cur ' ) cur ' ( ) ( fun i -> a ( . i ) i ) i ( pos + 1 ) 1 ; done ; let b = Text . Buf . create 0 in let p = Random . int len in let s1 = Text . init p ( Array . get a ) a in let s2 = Text . init ( len - p ) p ( fun x -> Array . get a ( p + x ) x ) x in Text . Buf . add_string b s1 ; Text . Buf . add_string b s2 ; let s ' = Text . Buf . contents b in expect_true ~ msg ( : lazy " step 1 ) " ( Text . compare s s ' = 0 ) 0 ; Text . Buf . clear b ; Text . iter ( Text . Buf . add_char b ) b s ; let s ' = Text . Buf . contents b in expect_true ~ msg ( : lazy " step 2 ) " ( Text . compare s s ' = 0 ) 0 ; Text . Buf . clear b ; let b ' = Text . Buf . create 16 in let pos = Random . int len in for i = 0 to len - 1 do if i < pos then Text . Buf . add_char b a ( . i ) i else Text . Buf . add_char b ' a ( . i ) i done ; Text . Buf . add_buffer b b ' ; let s ' = Text . Buf . contents b in expect_true ~ msg ( : lazy " step 3 ) " ( Text . compare s s ' = 0 ) 0 ; Text . Buf . reset b ; Text . Buf . add_string b s ; let s ' = Text . Buf . contents b in expect_true ~ msg ( : lazy " step 4 ) " ( Text . compare s s ' = 0 ) 0 ) ) ; end
let location Location . { loc_start = b ; loc_end = e ; _ } = Loc . extract ( b , e )
let mk_id ( ? id_ats = [ ] ) ( ? id_loc = dummy_loc ) id_str = { id_str ; id_ats ; id_loc }
let mk_term ( ? term_loc = dummy_loc ) term_desc = { term_desc ; term_loc }
let mk_pattern ( ? pat_loc = dummy_loc ) pat_desc = { pat_desc ; pat_loc }
let ident_of_tvsymbol Ty . { tv_name = name } = mk_id name . id_str ~ id_loc ( : location name . id_loc )
let ident_of_lsymbol Symbols . { ls_name = name ; _ } = mk_id name . id_str ~ id_loc ( : location name . id_loc )
let constant = function \| P . Pconst_integer ( s , _ ) -> if s . [ 0 ] = ' ' - then let s = String . sub s 1 ( String . length s - 1 ) in let n = Number . int_literal ILitDec ~ neg : false s in Constant . ( ConstInt ( Number . neg_int n ) ) else let n = Number . int_literal ILitDec ~ neg : false s in Constant . ConstInt n \| P . Pconst_string ( s , _ , _ ) -> Constant . ConstStr s \| Pconst_float _ -> assert false \| _ -> assert false
let preid Preid . { pid_str ; pid_loc ; _ } = let pid_str = match query_syntax pid_str with Some s -> s \| _ -> pid_str in mk_id ~ id_loc ( : location pid_loc ) pid_str
let rec qualid = function \| Uast . Qpreid id -> Qident ( preid id ) \| Uast . Qdot ( q , id ) -> Qdot ( qualid q , preid id )
let rec pty = function \| Uast . PTtyvar id -> PTtyvar ( preid id ) \| Uast . PTtuple pty_list -> PTtuple ( List . map pty pty_list ) \| Uast . PTarrow ( _ , pty1 , pty2 ) -> PTarrow ( pty pty1 , pty pty2 ) \| Uast . PTtyapp ( q , pty_list ) -> PTtyapp ( qualid q , List . map pty pty_list )
let rec ty Ty . { ty_node } = match ty_node with \| Ty . Tyvar { tv_name } -> PTtyvar ( mk_id tv_name . id_str ~ id_loc ( : location tv_name . id_loc ) ) \| Ty . Tyapp ( ts , tyl ) when Ty . is_ts_tuple ts -> PTtuple ( List . map ty tyl ) \| Ty . Tyapp ( ts , tyl ) when Ty . is_ts_arrow ts -> let rec arrow_of_pty_list = function \| [ ] -> assert false \| [ pty ] -> pty \| arg :: ptyl -> PTarrow ( arg , arrow_of_pty_list ptyl ) in arrow_of_pty_list ( List . map ty tyl ) \| Ty . Tyapp ( { ts_ident ; _ } , tyl ) -> let id_loc = location ts_ident . id_loc in let id_str = match query_syntax ts_ident . id_str with \| None -> ts_ident . id_str \| Some s -> s in let qualid = mk_id id_str ~ id_loc in PTtyapp ( Qident qualid , List . map ty tyl )
let quant = function \| Uast . Tforall -> D . DTforall \| Uast . Texists -> D . DTexists \| Uast . Tlambda -> D . DTlambda
let rec pattern Uast . { pat_desc = p_desc ; pat_loc } = let pat_loc = location pat_loc in let mk_pat p = mk_pattern ~ pat_loc p in let qualid_pattern ( q , pat ) = ( qualid q , pattern pat ) in let pat_desc = function \| Uast . Pwild -> Pwild \| Uast . Pvar id -> Pvar ( preid id ) \| Uast . Papp ( q , pat_list ) -> Papp ( qualid q , List . map pattern pat_list ) \| Uast . Prec q_pat_list -> Prec ( List . map qualid_pattern q_pat_list ) \| Uast . Ptuple pat_list -> Ptuple ( List . map pattern pat_list ) \| Uast . Pas ( pat , id ) -> Pas ( pattern pat , preid id , false ) \| Uast . Por ( pat1 , pat2 ) -> Por ( pattern pat1 , pattern pat2 ) \| Uast . Pcast ( pat , ty ) -> Pcast ( pattern pat , pty ty ) in mk_pat ( pat_desc p_desc )
let binder ( id , ty ) = ( location id . Preid . pid_loc , Some ( preid id ) , false , Opt . map pty ty )
let rec term in_post Uast . { term_desc = t_desc ; term_loc } = let term_loc = location term_loc in let mk_term t = mk_term ~ term_loc t in let binop = function \| Uast . Tand -> D . DTand \| Uast . Tand_asym -> D . DTand_asym \| Uast . Tor -> D . DTor \| Uast . Tor_asym -> D . DTor_asym \| Uast . Timplies -> D . DTimplies \| Uast . Tiff -> D . DTiff in let attr a = ATstr ( Why3 . Ident . create_attribute a ) in let pat_term ( pat , t ) = ( pattern pat , term in_post t ) in let qualid_term ( q , t ) = ( qualid q , term in_post t ) in let term_desc = function \| Uast . Ttrue -> Ttrue \| Uast . Tfalse -> Tfalse \| Uast . Tconst c -> Tconst ( constant c ) \| Uast . Tpreid id -> Tident ( qualid id ) \| Uast . Tidapp ( q , tl ) -> Tidapp ( qualid q , List . map ( term in_post ) tl ) \| Uast . Tfield ( t , q ) -> Tidapp ( qualid q , [ term in_post t ] ) \| Uast . Tapply ( t1 , t2 ) -> Tapply ( term in_post t1 , term in_post t2 ) \| Uast . Tnot t -> Tnot ( term in_post t ) \| Uast . Tattr ( a , t ) -> Tattr ( attr a , term in_post t ) \| Uast . Tcast ( t , ty ) -> Tcast ( term in_post t , pty ty ) \| Uast . Ttuple t_list -> Ttuple ( List . map ( term in_post ) t_list ) \| Uast . Trecord q_t_list -> Trecord ( List . map qualid_term q_t_list ) \| Uast . Tscope ( q , t ) -> Tscope ( qualid q , term in_post t ) \| Uast . Tcase ( t , pt_list ) -> Tcase ( term in_post t , List . map pat_term pt_list ) \| Uast . Tlet ( id , t1 , t2 ) -> Tlet ( preid id , term in_post t1 , term in_post t2 ) \| Uast . Tinfix ( t1 , id , t2 ) -> Tinfix ( term in_post t1 , preid id , term in_post t2 ) \| Uast . Tbinop ( t1 , op , t2 ) -> Tbinop ( term in_post t1 , binop op , term in_post t2 ) \| Uast . Told t -> let lbl = if in_post then Dexpr . old_label else " ' Old " in Tat ( term in_post t , mk_id ~ id_loc : term_loc lbl ) \| Uast . Tif ( t1 , t2 , t3 ) -> Tif ( term in_post t1 , term in_post t2 , term in_post t3 ) \| Uast . Tupdate ( t , q_t_list ) -> Tupdate ( term in_post t , List . map qualid_term q_t_list ) \| Uast . Tquant ( q , bl , t ) -> Tquant ( quant q , List . map binder bl , [ ] , term in_post t ) in mk_term ( term_desc t_desc )
type mutability = [ ` Mutable \| ` Immutable ]
type ' a text = UChar . t array
type utext = [ ` Imutable ] Imutable text
type ustring = [ ` Mutable ] Mutable text
let look s i = get s i
let nth _ i = i
let first _ = 0
let last s = Array . length s - 1
let out_of_range s i = i < 0 \|\| i >= Array . length s
let next _ i = i + 1
let prev _ i = i - 1
let move _ i n = i + n
let compare_index _ ( i : int ) int ( j : int ) int = i - j
let make len init = Array . make len init
let of_string s = init ( String . length s ) s ( fun i -> UChar . of_char s [ . i ] i ) i
let rec compare_aux i t1 t2 = if i >= length t1 then if i >= length t2 then 0 else ~- 1 else if i >= length t2 then 1 else match UChar . compare ( get t1 i ) i ( get t2 i ) i with 0 -> compare_aux ( i + 1 ) 1 t1 t2 \| sgn -> sgn
let compare t1 t2 = compare_aux 0 t1 t2
module Buf = struct include XArray type buf = UChar . t xarray let create bufsize = XArray . make ~ bufsize 0 ( UChar . chr_of_uint 0 ) 0 let contents = array_of let contents_string = array_of let add_char = add_element let add_string = add_array let add_buffer = add_xarray end
type t = ( int , int16_unsigned_elt , c_layout ) c_layout Array1 . t
let rec validate_aux ( a : t ) t i = if i >= Array1 . dim a then ( ) else let n = a { . i } i in if n < 0xd800 \|\| n >= 0xe000 && n < 0xfffe then validate_aux a ( i + 1 ) 1 else if n >= 0xd800 && n < 0xdc00 then if i + 1 >= Array1 . dim a then raise Malformed_code else let n ' = a { . i + 1 } 1 in if n ' < 0xdc00 \|\| n ' >= 0xe000 then raise Malformed_code else validate_aux a ( i + 2 ) 2 else raise Malformed_code
let validate ( a : t ) t = validate_aux a 0

let string_of_connected_component ( ? len = 1024 ) x = let ob = Bi_outbuf . create len in let ( ) = write_connected_component ob x in Bi_outbuf . contents ob

let connected_component_of_string s = read_connected_component ( Yojson . Safe . init_lexer ( ) ) ( Lexing . from_string s )

type t = { loc : Loc0 . t option ; paragraphs : Style . t Pp . t list ; hints : Style . t Pp . t list }

let make ? loc ? prefix ( ? hints = [ ] ) paragraphs = let paragraphs = match ( prefix , paragraphs ) with | None , l -> l | Some p , [ ] -> [ p ] | Some p , x :: l -> Pp . concat ~ sep : Pp . space [ p ; x ] :: l in { loc ; hints ; paragraphs }

let pp { loc ; paragraphs ; hints } = let open Pp . O in let paragraphs = match hints with | [ ] -> paragraphs | _ -> List . append paragraphs ( List . map hints ~ f ( : fun hint -> Pp . verbatim " Hint " : ++ Pp . space ++ hint ) ) in let paragraphs = List . map paragraphs ~ f : Pp . box in let paragraphs = match loc with | None -> paragraphs | Some { Loc0 . start ; stop } -> let start_c = start . pos_cnum - start . pos_bol in let stop_c = stop . pos_cnum - start . pos_bol in Pp . tag Style . Loc ( Pp . textf " File % S , line % d , characters % d -% d " : start . pos_fname start . pos_lnum start_c stop_c ) :: paragraphs in Pp . vbox ( Pp . concat_map paragraphs ~ sep : Pp . nop ~ f ( : fun pp -> Pp . seq pp Pp . cut ) )

let print ( ? config = Print_config . default ) t = Ansi_color . print ( Pp . map_tags ( pp t ) ~ f : config )

let prerr ( ? config = Print_config . default ) t = Ansi_color . prerr ( Pp . map_tags ( pp t ) ~ f : config )

let levenshtein_distance s t = let m = String . length s and n = String . length t in let d = Array . make_matrix ~ dimx ( : m + 1 ) ~ dimy ( : n + 1 ) 0 in for i = 0 to m do d . ( i ) . ( 0 ) <- i done ; for j = 0 to n do d . ( 0 ) . ( j ) <- j done ; for j = 1 to n do for i = 1 to m do if s . [ i - 1 ] = t . [ j - 1 ] then d . ( i ) . ( j ) <- d . ( i - 1 ) . ( j - 1 ) else d . ( i ) . ( j ) <- min ( d . ( i - 1 ) . ( j ) + 1 ) ( min ( d . ( i ) . ( j - 1 ) + 1 ) ( d . ( i - 1 ) . ( j - 1 ) + 1 ) ) done done ; d . ( m ) . ( n )

let did_you_mean s ~ candidates = let candidates = List . filter candidates ~ f ( : fun candidate -> levenshtein_distance s candidate < 3 ) in match candidates with | [ ] -> [ ] | l -> [ Pp . textf " did you mean % s " ? ( String . enumerate_or l ) ]

let to_string t = Format . asprintf " % a " Pp . render_ignore_tags ( pp { t with loc = None } ) |> String . drop_prefix ~ prefix " : Error : " |> Option . value_exn |> String . trim

let json = ` O [ ( " name " , ` String " OCaml ) " ; ( " qualities " , ` A [ ` O [ ( " name " , ` String " awesome ) " ] ; ` O [ ( " name " , ` String " simple ) " ] ; ` O [ ( " name " , ` String " fun ) " ] ] ) ]

let section heading = print_newline ( ) ; print_string " # " ; print_endline heading

let subsection heading = print_newline ( ) ; print_string " ## " ; print_endline heading

let test tmpl = subsection " parsed " ; print_endline " " ; --- print_endline ( Mustache . to_string tmpl ) tmpl ; print_endline " " ; --- subsection " rendered " ; print_endline " " ; --- print_endline ( Mustache . render tmpl json ) json ; print_endline " " ; --- ( )

let ( ) = section " Parsed template "

let parsed_template = Mustache . of_string " Hello { { name } name } name \ nMustache is :\ n { n { n # qualities } qualities } qualities \ n * { { name } name } name \ n { n { n / qualities } qualities } qualities \ n "

let ( ) = test parsed_template

let ( ) = section " Programmed template "

let programmed_template = let open Mustache in concat [ raw " Hello " ; escaped " name " ; raw " \ n " ; raw " Mustache is " : ; raw " \ n " ; section " qualities " @@ concat [ raw " * " ; escaped " name " ; raw " \ n " ] ]

let ( ) = test programmed_template

let ( ) = section " Output comparison "

let ( ) = let parsed_output = Mustache . render parsed_template json in let programmed_output = Mustache . render programmed_template json in if String . equal parsed_output programmed_output then print_endline " Outputs match as expected . " else print_endline " Outputs DO NOT match , this is suspcious . "

module type Sig = sig val register_migration : unit -> unit val register_cleaner : unit -> unit val lifecycles : Sihl . Container . lifecycle list val search : ? ctx ( : string * string ) list -> [ ` Desc | ` Asc ] -> string option -> limit : int -> offset : int -> ( Model . t list * int ) Lwt . t val get : ? ctx ( : string * string ) list -> string -> Model . t option Lwt . t val get_by_email : ? ctx ( : string * string ) list -> string -> Model . t option Lwt . t val insert : ? ctx ( : string * string ) list -> Model . t -> unit Lwt . t val update : ? ctx ( : string * string ) list -> Model . t -> unit Lwt . t end

let status = let encode m = m |> Model . status_to_string |> Result . ok in let decode = Model . status_of_string in Caqti_type . ( custom ~ encode ~ decode string ) ; ;

let user = let open Sihl . Contract . User in let encode m = Ok ( m . id , ( m . email , ( m . username , ( m . name , ( m . given_name , ( m . password , ( m . status , ( m . admin , ( m . confirmed , ( m . created_at , m . updated_at ) ) ) ) ) ) ) ) ) ) in let decode ( id , ( email , ( username , ( name , ( given_name , ( password , ( status , ( admin , ( confirmed , ( created_at , updated_at ) ) ) ) ) ) ) ) ) ) = Ok { id ; email ; username ; name ; given_name ; password ; status ; admin ; confirmed ; created_at ; updated_at } in Caqti_type . ( custom ~ encode ~ decode ( tup2 string ( tup2 string ( tup2 ( option string ) ( tup2 ( option string ) ( tup2 ( option string ) ( tup2 string ( tup2 status ( tup2 bool ( tup2 bool ( tup2 ptime ptime ) ) ) ) ) ) ) ) ) ) ) ; ;

module MakeMariaDb ( MigrationService : Sihl . Contract . Migration . Sig ) : Sig = struct let lifecycles = [ Database . lifecycle ; MigrationService . lifecycle ] module Migration = struct let fix_collation = Migration . create_step ~ label " : fix collation " { sql | SET collation_server = ' utf8mb4_unicode_ci ' | sql } ; ; let create_users_table = Migration . create_step ~ label " : create users table " { sql | CREATE TABLE IF NOT EXISTS user_users ( id BIGINT UNSIGNED AUTO_INCREMENT , uuid BINARY ( 16 ) NOT NULL , email VARCHAR ( 128 ) NOT NULL , password VARCHAR ( 128 ) NOT NULL , username VARCHAR ( 128 ) , status VARCHAR ( 128 ) NOT NULL , admin BOOLEAN NOT NULL DEFAULT false , confirmed BOOLEAN NOT NULL DEFAULT false , created_at TIMESTAMP DEFAULT CURRENT_TIMESTAMP , PRIMARY KEY ( id ) , CONSTRAINT unique_uuid UNIQUE KEY ( uuid ) , CONSTRAINT unique_email UNIQUE KEY ( email ) ) ENGINE = InnoDB DEFAULT CHARSET = utf8mb4 COLLATE = utf8mb4_unicode_ci | sql } ; ; let add_updated_at_column = Sihl . Database . Migration . create_step ~ label " : add updated_at column " { sql | ALTER TABLE user_users ADD COLUMN updated_at TIMESTAMP NOT NULL DEFAULT CURRENT_TIMESTAMP | sql } ; ; let add_name_columns = Sihl . Database . Migration . create_step ~ label " : add name columns " { sql | ALTER TABLE user_users ADD COLUMN name VARCHAR ( 128 ) NULL , ADD COLUMN given_name VARCHAR ( 128 ) NULL | sql } ; ; let migration ( ) = Migration . ( empty " user " |> add_step fix_collation |> add_step create_users_table |> add_step add_updated_at_column |> add_step add_name_columns ) ; ; end let filter_fragment = { sql | WHERE user_users . email LIKE $ 1 OR user_users . username LIKE $ 1 OR user_users . name LIKE $ 1 OR user_users . given_name LIKE $ 1 OR user_users . status LIKE $ 1 | sql } ; ; let search_query = { sql | SELECT COUNT OVER ( ) as total , LOWER ( CONCAT ( SUBSTR ( HEX ( uuid ) , 1 , 8 ) , ' ' , - SUBSTR ( HEX ( uuid ) , 9 , 4 ) , ' ' , - SUBSTR ( HEX ( uuid ) , 13 , 4 ) , ' ' , - SUBSTR ( HEX ( uuid ) , 17 , 4 ) , ' ' , - SUBSTR ( HEX ( uuid ) , 21 ) ) ) , email , username , name , given_name , password , status , admin , confirmed , created_at , updated_at FROM user_users | sql } ; ; let request = Sihl . Database . prepare_search_request ~ search_query ~ filter_fragment ~ sort_by_field " : id " user ; ; let search ? ctx sort filter ~ limit ~ offset = Sihl . Database . run_search_request ? ctx request sort filter ~ limit ~ offset ; ; let get_request = let open Caqti_request . Infix in { sql | SELECT LOWER ( CONCAT ( SUBSTR ( HEX ( uuid ) , 1 , 8 ) , ' ' , - SUBSTR ( HEX ( uuid ) , 9 , 4 ) , ' ' , - SUBSTR ( HEX ( uuid ) , 13 , 4 ) , ' ' , - SUBSTR ( HEX ( uuid ) , 17 , 4 ) , ' ' , - SUBSTR ( HEX ( uuid ) , 21 ) ) ) , email , username , name , given_name , password , status , admin , confirmed , created_at , updated_at FROM user_users WHERE user_users . uuid = UNHEX ( REPLACE ( , ? ' ' , - ' ' ) ) | sql } |> Caqti_type . string ->? user ; ; let get ? ctx id = Database . find_opt ? ctx get_request id let get_by_email_request = let open Caqti_request . Infix in { sql | SELECT LOWER ( CONCAT ( SUBSTR ( HEX ( uuid ) , 1 , 8 ) , ' ' , - SUBSTR ( HEX ( uuid ) , 9 , 4 ) , ' ' , - SUBSTR ( HEX ( uuid ) , 13 , 4 ) , ' ' , - SUBSTR ( HEX ( uuid ) , 17 , 4 ) , ' ' , - SUBSTR ( HEX ( uuid ) , 21 ) ) ) , email , username , name , given_name , password , status , admin , confirmed , created_at , updated_at FROM user_users WHERE user_users . email LIKE ? | sql } |> Caqti_type . string ->? user ; ; let get_by_email ? ctx email = Database . find_opt ? ctx get_by_email_request email ; ; let insert_request = let open Caqti_request . Infix in { sql | INSERT INTO user_users ( uuid , email , username , name , given_name , password , status , admin , confirmed , created_at , updated_at ) VALUES ( UNHEX ( REPLACE ( $ 1 , ' ' , - ' ' ) ) , LOWER ( $ 2 ) , $ 3 , $ 4 , $ 5 , $ 6 , $ 7 , $ 8 , $ 9 , $ 10 , $ 11 ) | sql } |> user . -> Caqti_type . unit ; ; let insert ? ctx user = Database . exec ? ctx insert_request user let update_request = let open Caqti_request . Infix in { sql | UPDATE user_users SET email = LOWER ( $ 2 ) , username = $ 3 , name = $ 4 , given_name = $ 5 , password = $ 6 , status = $ 7 , admin = $ 8 , confirmed = $ 9 , created_at = $ 10 , updated_at = $ 11 WHERE user_users . uuid = UNHEX ( REPLACE ( $ 1 , ' ' , - ' ' ) ) | sql } |> user . -> Caqti_type . unit ; ; let update ? ctx user = Database . exec ? ctx update_request user let clean_request = let open Caqti_request . Infix in " TRUNCATE user_users " |> Caqti_type . ( unit . -> unit ) ; ; let clean ? ctx ( ) = Database . exec ? ctx clean_request ( ) let register_migration ( ) = MigrationService . register_migration ( Migration . migration ( ) ) ; ; let register_cleaner ( ) = Cleaner . register_cleaner clean end

module MakePostgreSql ( MigrationService : Sihl . Contract . Migration . Sig ) : Sig = struct let lifecycles = [ Database . lifecycle ; MigrationService . lifecycle ] module Migration = struct let create_users_table = Migration . create_step ~ label " : create users table " { sql | CREATE TABLE IF NOT EXISTS user_users ( id serial , uuid uuid NOT NULL , email VARCHAR ( 128 ) NOT NULL , password VARCHAR ( 128 ) NOT NULL , username VARCHAR ( 128 ) , status VARCHAR ( 128 ) NOT NULL , admin BOOLEAN NOT NULL DEFAULT false , confirmed BOOLEAN NOT NULL DEFAULT false , created_at TIMESTAMP WITH TIME ZONE DEFAULT CURRENT_TIMESTAMP , PRIMARY KEY ( id ) , UNIQUE ( uuid ) , UNIQUE ( email ) ) | sql } ; ; let add_updated_at_column = Sihl . Database . Migration . create_step ~ label " : add updated_at column " { sql | ALTER TABLE user_users ADD COLUMN updated_at TIMESTAMPTZ NOT NULL DEFAULT NOW ( ) | sql } ; ; let remove_timezone = Sihl . Database . Migration . create_step ~ label " : remove timezone info from timestamps " { sql | ALTER TABLE user_users ALTER COLUMN created_at TYPE TIMESTAMP , ALTER COLUMN updated_at TYPE TIMESTAMP | sql } ; ; let add_name_columns = Sihl . Database . Migration . create_step ~ label " : add name columns " { sql | ALTER TABLE user_users ADD COLUMN name VARCHAR ( 128 ) NULL , ADD COLUMN given_name VARCHAR ( 128 ) NULL | sql } ; ; let migration ( ) = Migration . ( empty " user " |> add_step create_users_table |> add_step add_updated_at_column |> add_step remove_timezone |> add_step add_name_columns ) ; ; end let filter_fragment = { sql | WHERE user_users . email LIKE $ 1 OR user_users . username LIKE $ 1 OR user_users . name LIKE $ 1 OR user_users . given_name LIKE $ 1 OR user_users . status LIKE $ 1 | sql } ; ; let search_query = { sql | SELECT COUNT OVER ( ) as total , uuid , email , username , name , given_name , password , status , admin , confirmed , created_at , updated_at FROM user_users | sql } ; ; let request = Sihl . Database . prepare_search_request ~ search_query ~ filter_fragment ~ sort_by_field " : id " user ; ; let search ? ctx sort filter ~ limit ~ offset = Sihl . Database . run_search_request ? ctx request sort filter ~ limit ~ offset ; ; let get_request = let open Caqti_request . Infix in { sql | SELECT uuid as id , email , username , name , given_name , password , status , admin , confirmed , created_at , updated_at FROM user_users WHERE user_users . uuid = $ 1 :: uuid | sql } |> Caqti_type . string ->? user ; ; let get ? ctx id = Database . find_opt ? ctx get_request id let get_by_email_request = let open Caqti_request . Infix in { sql | SELECT uuid as id , email , username , name , given_name , password , status , admin , confirmed , created_at , updated_at FROM user_users WHERE LOWER ( user_users . email ) = LOWER ( ) ? | sql } |> Caqti_type . string ->? user ; ; let get_by_email ? ctx email = Database . find_opt ? ctx get_by_email_request email ; ; let insert_request = let open Caqti_request . Infix in { sql | INSERT INTO user_users ( uuid , email , username , name , given_name , password , status , admin , confirmed , created_at , updated_at ) VALUES ( $ 1 :: uuid , LOWER ( $ 2 ) , $ 3 , $ 4 , $ 5 , $ 6 , $ 7 , $ 8 , $ 9 , $ 10 AT TIME ZONE ' UTC ' , $ 11 AT TIME ZONE ' UTC ' ) | sql } |> user . -> Caqti_type . unit ; ; let insert ? ctx user = Database . exec ? ctx insert_request user let update_request = let open Caqti_request . Infix in { sql | UPDATE user_users SET email = LOWER ( $ 2 ) , username = $ 3 , name = $ 4 , given_name = $ 5 , password = $ 6 , status = $ 7 , admin = $ 8 , confirmed = $ 9 , created_at = $ 10 , updated_at = $ 11 WHERE user_users . uuid = $ 1 :: uuid | sql } |> user . -> Caqti_type . unit ; ; let update ? ctx user = Database . exec ? ctx update_request user let clean_request = let open Caqti_request . Infix in " TRUNCATE TABLE user_users CASCADE " |> Caqti_type . ( unit . -> unit ) ; ; let clean ? ctx ( ) = Database . exec ? ctx clean_request ( ) let register_migration ( ) = MigrationService . register_migration ( Migration . migration ( ) ) ; ; let register_cleaner ( ) = Cleaner . register_cleaner clean end

let test_current_user = let current_user = Lwt_main . run begin Github . ( Monad . ( run ( User . current_info ~ token ( ) >|= Response . value ) ) ) end in assert ( current_user . Github_t . user_info_ty = ` User ) ; Format . printf " Check current user : OK . . " @

let test_current_user_first_org = let org = Lwt_main . run begin Github . ( Monad . ( run begin let orgs = Organization . current_user_orgs ~ token ( ) in Stream . next orgs >>= function | None -> Printf . eprintf " No organizations for the current user . \ n " ; exit 1 | Some ( first_org , _ ) -> return first_org end ) ) end in assert ( org . Github_t . org_ty = ` Org ) ; Format . printf " Check current user first org : OK . . " @

let test_ocaml_organization = let ocaml_user = Lwt_main . run begin Github . ( Monad . ( run begin User . info ~ token ~ user " : ocaml " ( ) >|= Response . value end ) ) end in assert ( ocaml_user . Github_t . user_info_ty = ` Org ) ; Format . printf " Check OCaml org : OK . . " @

let test_ocaml_repository = let opam_repository = Lwt_main . run begin Github . ( Monad . ( run begin Repo . info ~ token ~ user " : ocaml " ~ repo " : opam " ( ) >|= Response . value end ) ) end in assert Github_t . ( opam_repository . repository_owner . user_ty = ` Org ) ; Format . printf " Check OCaml repo : OK . . " @

let mem u s = ISet . mem ( UChar . uint_code u ) u s

let add u s = ISet . add ( UChar . uint_code u ) u s

let add_range u1 u2 s = ISet . add_range ( UChar . uint_code u1 ) u1 ( UChar . uint_code u2 ) u2 s

let singleton u = ISet . singleton ( UChar . uint_code u ) u

let remove u s = ISet . remove ( UChar . uint_code u ) u s

let remove_range u1 u2 s = ISet . remove_range ( UChar . uint_code u1 ) u1 ( UChar . uint_code u2 ) u2 s

let from u s = ISet . from ( UChar . uint_code u ) u s

let after u s = ISet . after ( UChar . uint_code u ) u s

let until u s = ISet . until ( UChar . uint_code u ) u s

let before u s = ISet . before ( UChar . uint_code u ) u s

let iter f s = ISet . iter ( fun n -> f ( UChar . chr_of_uint n ) n ) n s

let iter_range f s = let f ' n1 n2 = f ( UChar . chr_of_uint n1 ) n1 ( UChar . chr_of_uint n2 ) n2 in ISet . iter_range f ' s

let fold f s a = let f ' n a = f ( UChar . chr_of_uint n ) n a in ISet . fold f ' s a

let fold_range f s a = let f ' n1 n2 a = f ( UChar . chr_of_uint n1 ) n1 ( UChar . chr_of_uint n2 ) n2 a in ISet . fold_range f ' s a

let for_all p s = let p ' n = p ( UChar . chr_of_uint n ) n in ISet . for_all p ' s

let exists p s = let p ' n = p ( UChar . chr_of_uint n ) n in ISet . exists p ' s

let filter p s = let p ' n = p ( UChar . chr_of_uint n ) n in ISet . filter p ' s

let partition p s = let p ' n = p ( UChar . chr_of_uint n ) n in ISet . partition p ' s

let elements s = List . map UChar . chr_of_uint ( ISet . elements s ) s

let ranges s = let f ( n1 , n2 ) n2 = ( UChar . chr_of_uint n1 , UChar . chr_of_uint n2 ) n2 in List . map f ( ISet . ranges s ) s

let min_elt s = UChar . chr_of_uint ( ISet . min_elt s ) s

let max_elt s = UChar . chr_of_uint ( ISet . max_elt s ) s

let choose s = UChar . chr_of_uint ( ISet . choose s ) s

let uset_of_iset s = s

let iset_of_uset s = s

let get_files_in_directory dir = let len = String . length dir in let dir = if len > 0 && Sys . os_type = " Win32 " && ( dir . [ len - 1 ] = ' ' / || dir . [ len - 1 ] = ' ' ) \\ then String . sub dir ~ pos : 0 ~ len ( : len - 1 ) else dir in match try Some ( opendir dir ) with Unix_error _ -> None with None -> [ ] | Some dirh -> let rec get_them l = match try Some ( readdir dirh ) with _ -> None with | Some x -> get_them ( x :: l ) | None -> closedir dirh ; l in List . sort ~ cmp : compare ( get_them [ ] )

let is_directory name = try ( stat name ) . st_kind = S_DIR with _ -> false

let concat dir name = let len = String . length dir in if len = 0 then name else if dir . [ len - 1 ] = ' ' / then dir ^ name else dir ^ " " / ^ name

let get_directories_in_files ~ path = List . filter ~ f ( : fun x -> is_directory ( concat path x ) )

let subshell ~ cmd = let rc = open_process_in cmd in let rec it l = match try Some ( input_line rc ) with _ -> None with Some x -> it ( x :: l ) | None -> List . rev l in let answer = it [ ] in ignore ( close_process_in rc ) ; answer

module Make ( Text : UnicodeString . Type ) Type = struct let test ( ? char_gen = ( fun _ -> uchar_of_int ( Random . int 0x8000000 ) 0x8000000 ) 0x8000000 ) 0x8000000 ~ desc ~ log ( ) = random_test ~ desc ~ log ~ data ( : fun size -> Array . init size char_gen ) char_gen ~ body ( : fun a -> expect_pass ~ body ( : fun ( ) -> let s = Text . init ( Array . length a ) a ( Array . get a ) a in let len = Text . length s in expect_equal ~ msg ( : lazy " init ) " len ( Array . length a ) a ; for _ = 0 to 50 do let i = Random . int len in expect_equal ~ msg ( : lazy ( sprintf " set / get : location % d " i ) i ) i ( Text . get s i ) i a ( . i ) i done ; let r = ref 0 in Text . iter ( fun u -> expect_equal ~ msg ( : lazy ( sprintf " iter : location % d " ! r ) r ) r u a ( . ! r ) r ; incr r ) r s ; expect_equal ~ msg ( : lazy ( sprintf " iter : count % d " ! r ) r ) r ! r len ; let cur = ref ( Text . nth s 0 ) 0 in let r = ref 0 in while not ( Text . out_of_range s ! cur ) cur do expect_equal ~ msg ( : lazy ( sprintf " index look : location % d " ! r ) r ) r ( Text . look s ! cur ) cur a ( . ! r ) r ; cur := Text . next s ! cur ; incr r done ; expect_equal ~ msg ( : lazy ( sprintf " index : count % d " ! r ) r ) r ! r len ; for _ = 0 to 100 do let pos = Random . int len in let cur = Text . nth s pos in expect_equal ~ msg ( : lazy ( sprintf " nth : location % d " pos ) pos ) pos ( Text . look s cur ) cur a ( . pos ) pos ; if pos = 0 then ( ) else let cur ' = Text . prev s cur in expect_equal_app ~ msg ( : lazy ( sprintf " cursor prev : location % d " pos ) pos ) pos ( fun ( ) -> Text . look s cur ' ) cur ' ( ) ( fun i -> a ( . i ) i ) i ( pos - 1 ) 1 ; if pos = len - 1 then ( ) else let cur ' = Text . next s cur in expect_equal_app ~ msg ( : lazy ( sprintf " cursor next : location % d " pos ) pos ) pos ( fun ( ) -> Text . look s cur ' ) cur ' ( ) ( fun i -> a ( . i ) i ) i ( pos + 1 ) 1 ; done ; let b = Text . Buf . create 0 in let p = Random . int len in let s1 = Text . init p ( Array . get a ) a in let s2 = Text . init ( len - p ) p ( fun x -> Array . get a ( p + x ) x ) x in Text . Buf . add_string b s1 ; Text . Buf . add_string b s2 ; let s ' = Text . Buf . contents b in expect_true ~ msg ( : lazy " step 1 ) " ( Text . compare s s ' = 0 ) 0 ; Text . Buf . clear b ; Text . iter ( Text . Buf . add_char b ) b s ; let s ' = Text . Buf . contents b in expect_true ~ msg ( : lazy " step 2 ) " ( Text . compare s s ' = 0 ) 0 ; Text . Buf . clear b ; let b ' = Text . Buf . create 16 in let pos = Random . int len in for i = 0 to len - 1 do if i < pos then Text . Buf . add_char b a ( . i ) i else Text . Buf . add_char b ' a ( . i ) i done ; Text . Buf . add_buffer b b ' ; let s ' = Text . Buf . contents b in expect_true ~ msg ( : lazy " step 3 ) " ( Text . compare s s ' = 0 ) 0 ; Text . Buf . reset b ; Text . Buf . add_string b s ; let s ' = Text . Buf . contents b in expect_true ~ msg ( : lazy " step 4 ) " ( Text . compare s s ' = 0 ) 0 ) ) ; end

let location Location . { loc_start = b ; loc_end = e ; _ } = Loc . extract ( b , e )

let mk_id ( ? id_ats = [ ] ) ( ? id_loc = dummy_loc ) id_str = { id_str ; id_ats ; id_loc }

let mk_term ( ? term_loc = dummy_loc ) term_desc = { term_desc ; term_loc }

let mk_pattern ( ? pat_loc = dummy_loc ) pat_desc = { pat_desc ; pat_loc }

let ident_of_tvsymbol Ty . { tv_name = name } = mk_id name . id_str ~ id_loc ( : location name . id_loc )

let ident_of_lsymbol Symbols . { ls_name = name ; _ } = mk_id name . id_str ~ id_loc ( : location name . id_loc )

let constant = function | P . Pconst_integer ( s , _ ) -> if s . [ 0 ] = ' ' - then let s = String . sub s 1 ( String . length s - 1 ) in let n = Number . int_literal ILitDec ~ neg : false s in Constant . ( ConstInt ( Number . neg_int n ) ) else let n = Number . int_literal ILitDec ~ neg : false s in Constant . ConstInt n | P . Pconst_string ( s , _ , _ ) -> Constant . ConstStr s | Pconst_float _ -> assert false | _ -> assert false

let preid Preid . { pid_str ; pid_loc ; _ } = let pid_str = match query_syntax pid_str with Some s -> s | _ -> pid_str in mk_id ~ id_loc ( : location pid_loc ) pid_str

let rec qualid = function | Uast . Qpreid id -> Qident ( preid id ) | Uast . Qdot ( q , id ) -> Qdot ( qualid q , preid id )

let rec pty = function | Uast . PTtyvar id -> PTtyvar ( preid id ) | Uast . PTtuple pty_list -> PTtuple ( List . map pty pty_list ) | Uast . PTarrow ( _ , pty1 , pty2 ) -> PTarrow ( pty pty1 , pty pty2 ) | Uast . PTtyapp ( q , pty_list ) -> PTtyapp ( qualid q , List . map pty pty_list )

let rec ty Ty . { ty_node } = match ty_node with | Ty . Tyvar { tv_name } -> PTtyvar ( mk_id tv_name . id_str ~ id_loc ( : location tv_name . id_loc ) ) | Ty . Tyapp ( ts , tyl ) when Ty . is_ts_tuple ts -> PTtuple ( List . map ty tyl ) | Ty . Tyapp ( ts , tyl ) when Ty . is_ts_arrow ts -> let rec arrow_of_pty_list = function | [ ] -> assert false | [ pty ] -> pty | arg :: ptyl -> PTarrow ( arg , arrow_of_pty_list ptyl ) in arrow_of_pty_list ( List . map ty tyl ) | Ty . Tyapp ( { ts_ident ; _ } , tyl ) -> let id_loc = location ts_ident . id_loc in let id_str = match query_syntax ts_ident . id_str with | None -> ts_ident . id_str | Some s -> s in let qualid = mk_id id_str ~ id_loc in PTtyapp ( Qident qualid , List . map ty tyl )

let quant = function | Uast . Tforall -> D . DTforall | Uast . Texists -> D . DTexists | Uast . Tlambda -> D . DTlambda

let rec pattern Uast . { pat_desc = p_desc ; pat_loc } = let pat_loc = location pat_loc in let mk_pat p = mk_pattern ~ pat_loc p in let qualid_pattern ( q , pat ) = ( qualid q , pattern pat ) in let pat_desc = function | Uast . Pwild -> Pwild | Uast . Pvar id -> Pvar ( preid id ) | Uast . Papp ( q , pat_list ) -> Papp ( qualid q , List . map pattern pat_list ) | Uast . Prec q_pat_list -> Prec ( List . map qualid_pattern q_pat_list ) | Uast . Ptuple pat_list -> Ptuple ( List . map pattern pat_list ) | Uast . Pas ( pat , id ) -> Pas ( pattern pat , preid id , false ) | Uast . Por ( pat1 , pat2 ) -> Por ( pattern pat1 , pattern pat2 ) | Uast . Pcast ( pat , ty ) -> Pcast ( pattern pat , pty ty ) in mk_pat ( pat_desc p_desc )

let binder ( id , ty ) = ( location id . Preid . pid_loc , Some ( preid id ) , false , Opt . map pty ty )

let rec term in_post Uast . { term_desc = t_desc ; term_loc } = let term_loc = location term_loc in let mk_term t = mk_term ~ term_loc t in let binop = function | Uast . Tand -> D . DTand | Uast . Tand_asym -> D . DTand_asym | Uast . Tor -> D . DTor | Uast . Tor_asym -> D . DTor_asym | Uast . Timplies -> D . DTimplies | Uast . Tiff -> D . DTiff in let attr a = ATstr ( Why3 . Ident . create_attribute a ) in let pat_term ( pat , t ) = ( pattern pat , term in_post t ) in let qualid_term ( q , t ) = ( qualid q , term in_post t ) in let term_desc = function | Uast . Ttrue -> Ttrue | Uast . Tfalse -> Tfalse | Uast . Tconst c -> Tconst ( constant c ) | Uast . Tpreid id -> Tident ( qualid id ) | Uast . Tidapp ( q , tl ) -> Tidapp ( qualid q , List . map ( term in_post ) tl ) | Uast . Tfield ( t , q ) -> Tidapp ( qualid q , [ term in_post t ] ) | Uast . Tapply ( t1 , t2 ) -> Tapply ( term in_post t1 , term in_post t2 ) | Uast . Tnot t -> Tnot ( term in_post t ) | Uast . Tattr ( a , t ) -> Tattr ( attr a , term in_post t ) | Uast . Tcast ( t , ty ) -> Tcast ( term in_post t , pty ty ) | Uast . Ttuple t_list -> Ttuple ( List . map ( term in_post ) t_list ) | Uast . Trecord q_t_list -> Trecord ( List . map qualid_term q_t_list ) | Uast . Tscope ( q , t ) -> Tscope ( qualid q , term in_post t ) | Uast . Tcase ( t , pt_list ) -> Tcase ( term in_post t , List . map pat_term pt_list ) | Uast . Tlet ( id , t1 , t2 ) -> Tlet ( preid id , term in_post t1 , term in_post t2 ) | Uast . Tinfix ( t1 , id , t2 ) -> Tinfix ( term in_post t1 , preid id , term in_post t2 ) | Uast . Tbinop ( t1 , op , t2 ) -> Tbinop ( term in_post t1 , binop op , term in_post t2 ) | Uast . Told t -> let lbl = if in_post then Dexpr . old_label else " ' Old " in Tat ( term in_post t , mk_id ~ id_loc : term_loc lbl ) | Uast . Tif ( t1 , t2 , t3 ) -> Tif ( term in_post t1 , term in_post t2 , term in_post t3 ) | Uast . Tupdate ( t , q_t_list ) -> Tupdate ( term in_post t , List . map qualid_term q_t_list ) | Uast . Tquant ( q , bl , t ) -> Tquant ( quant q , List . map binder bl , [ ] , term in_post t ) in mk_term ( term_desc t_desc )

type mutability = [ ` Mutable | ` Immutable ]

type ' a text = UChar . t array

type utext = [ ` Imutable ] Imutable text

type ustring = [ ` Mutable ] Mutable text

let look s i = get s i

let nth _ i = i

let first _ = 0

let last s = Array . length s - 1

let out_of_range s i = i < 0 || i >= Array . length s

let next _ i = i + 1

let prev _ i = i - 1

let move _ i n = i + n

let compare_index _ ( i : int ) int ( j : int ) int = i - j

let make len init = Array . make len init

let of_string s = init ( String . length s ) s ( fun i -> UChar . of_char s [ . i ] i ) i

let rec compare_aux i t1 t2 = if i >= length t1 then if i >= length t2 then 0 else ~- 1 else if i >= length t2 then 1 else match UChar . compare ( get t1 i ) i ( get t2 i ) i with 0 -> compare_aux ( i + 1 ) 1 t1 t2 | sgn -> sgn

let compare t1 t2 = compare_aux 0 t1 t2

module Buf = struct include XArray type buf = UChar . t xarray let create bufsize = XArray . make ~ bufsize 0 ( UChar . chr_of_uint 0 ) 0 let contents = array_of let contents_string = array_of let add_char = add_element let add_string = add_array let add_buffer = add_xarray end

type t = ( int , int16_unsigned_elt , c_layout ) c_layout Array1 . t

let rec validate_aux ( a : t ) t i = if i >= Array1 . dim a then ( ) else let n = a { . i } i in if n < 0xd800 || n >= 0xe000 && n < 0xfffe then validate_aux a ( i + 1 ) 1 else if n >= 0xd800 && n < 0xdc00 then if i + 1 >= Array1 . dim a then raise Malformed_code else let n ' = a { . i + 1 } 1 in if n ' < 0xdc00 || n ' >= 0xe000 then raise Malformed_code else validate_aux a ( i + 2 ) 2 else raise Malformed_code

let validate ( a : t ) t = validate_aux a 0