AllenGeng/ocamlgithub · Datasets at Hugging Face

text stringlengths 12 786k
let check x = assert ( Z . sign x . Q . den >= 0 ) ; assert ( Z . compare ( gcd2 x . Q . num x . Q . den ) Z . one <= 0 )
let test1 msg op = List . iter ( fun x -> let r = op x in check r ; Printf . printf " % s % s = % s \ n " msg ( Q . to_string x ) ( Q . to_string r ) ) t_list
let test2 msg op = List . iter ( fun x -> List . iter ( fun y -> let r = op x y in check r ; Printf . printf " % s % s % s = % s \ n " ( Q . to_string x ) msg ( Q . to_string y ) ( Q . to_string r ) ) t_list ) t_list
let test_Q ( ) = let _ = List . iter check t_list in let _ = test1 " " - Q . neg in let _ = test1 " 1 " / Q . inv in let _ = test1 " abs " Q . abs in let _ = test2 " " + Q . add in let _ = test2 " " - Q . sub in let _ = test2 " " * Q . mul in let _ = test2 " " / Q . div in let _ = test2 " * 1 " / ( fun a b -> Q . mul a ( Q . inv b ) ) in let _ = test1 " mul_2exp ( 1 ) " ( fun a -> Q . mul_2exp a 1 ) in let _ = test1 " mul_2exp ( 2 ) " ( fun a -> Q . mul_2exp a 2 ) in let _ = test1 " div_2exp ( 1 ) " ( fun a -> Q . div_2exp a 1 ) in let _ = test1 " div_2exp ( 2 ) " ( fun a -> Q . div_2exp a 2 ) in List . iter ( fun x -> assert ( 0 = Q . compare x ( Q . div_2exp ( Q . mul_2exp x 2 ) 2 ) ) ; assert ( 0 = Q . compare x ( Q . mul_2exp ( Q . div_2exp x 2 ) 2 ) ) ; List . iter ( fun y -> Printf . printf " identity checking % s % s \ n " ( Q . to_string x ) ( Q . to_string y ) ; assert ( 0 = Q . compare ( Q . add x y ) ( Q . add y x ) ) ; assert ( 0 = Q . compare ( Q . sub x y ) ( Q . neg ( Q . sub y x ) ) ) ; assert ( 0 = Q . compare ( Q . sub x y ) ( Q . add x ( Q . neg y ) ) ) ; assert ( 0 = Q . compare ( Q . mul x y ) ( Q . mul y x ) ) ; assert ( 0 = Q . compare ( Q . div x y ) ( Q . mul x ( Q . inv y ) ) ) ; ) t_list ) t_list ; assert ( Q . compare Q . undef Q . undef = 0 ) ; assert ( not ( Q . equal Q . undef Q . undef ) ) ; assert ( not ( Q . lt Q . undef Q . undef ) ) ; assert ( not ( Q . leq Q . undef Q . undef ) ) ; assert ( not ( Q . gt Q . undef Q . undef ) ) ; assert ( not ( Q . geq Q . undef Q . undef ) )
let version ( ) = let n = versionNumber ( ) in ( n / 10_000 , ( n / 100 ) mod 100 , n mod 100 )
let bracket res destroy k = let r = try k res with exn -> let ( ) = destroy res in raise exn in let ( ) = destroy res in r
let check r = if isError r then raise ( Error ( getErrorName r ) )
let free_cctx x = check ( free_cctx x )
let free_dctx x = check ( free_dctx x )
let compress ~ level ? dict s = let open Ctypes in let len = Size_t . of_int ( String . length s ) in let dst_size = compressBound len in let dst = allocate_n char ~ count ( : Size_t . to_int dst_size ) in let r = match dict with \| None -> do_compress ( to_voidp dst ) dst_size s len level \| Some dict -> let dlen = Size_t . of_int ( String . length dict ) in bracket ( create_cctx ( ) ) free_cctx begin fun cctx -> do_compress_dict cctx ( to_voidp dst ) dst_size s len dict dlen level end in check r ; string_from_ptr dst ~ length ( : Size_t . to_int r )
let decompress orig ? dict s = let open Ctypes in let dst = allocate_n char ~ count : orig in let r = match dict with \| None -> do_decompress ( to_voidp dst ) ( Size_t . of_int orig ) s ( Size_t . of_int ( String . length s ) ) \| Some dict -> let dlen = Size_t . of_int ( String . length dict ) in bracket ( create_dctx ( ) ) free_dctx begin fun dctx -> do_decompress_dict dctx ( to_voidp dst ) ( Size_t . of_int orig ) s ( Size_t . of_int ( String . length s ) ) dict dlen end in check r ; string_from_ptr dst ~ length ( : Size_t . to_int r )
type ' a continuous = { mutable pos : ' a ; mutable der : ' a }
type ( ' a , ' b ) zerocrossing = { mutable zin : ' a ; mutable zout : ' b }
type ' a signal = ' a * bool
type ( ' a , ' b ) node = Node : { alloc : unit -> ' s ; step : ' s -> ' a -> ' b ; reset : ' s -> unit ; } -> ( ' a , ' b ) node
type ( ' a , ' b ) cnode = Cnode : { alloc : unit -> ' s ; copy : ' s -> ' s -> unit ; step : ' s -> ' a -> ' b ; reset : ' s -> unit ; } -> ( ' a , ' b ) cnode
type cvec = ( float , float64_elt , c_layout ) Array1 . t
type dvec = ( float , float64_elt , c_layout ) Array1 . t
type zinvec = ( int32 , int32_elt , c_layout ) Array1 . t
type zoutvec = ( float , float64_elt , c_layout ) Array1 . t
type cstate = { mutable dvec : dvec ; mutable cvec : cvec ; mutable zinvec : zinvec ; mutable zoutvec : zoutvec ; mutable cindex : int ; mutable zindex : int ; mutable cend : int ; mutable zend : int ; mutable cmax : int ; mutable zmax : int ; mutable horizon : float ; mutable major : bool ; }
type ( ' a , ' b ) hnode = cstate -> ( time * ' a , ' b ) node
type ' b hsimu = Hsim : { alloc : unit -> ' s ; maxsize : ' s -> int * int ; csize : ' s -> int ; zsize : ' s -> int ; step : ' s -> cvec -> dvec -> zinvec -> time -> ' b ; derivative : ' s -> cvec -> dvec -> zinvec -> zoutvec -> time -> unit ; crossings : ' s -> cvec -> zinvec -> zoutvec -> time -> unit ; reset : ' s -> unit ; horizon : ' s -> time ; } -> ' b hsimu
type ( ' a , ' b ) hsnode = Hnode : { state : ' s ; zsize : int ; csize : int ; derivative : ' s -> ' a -> time -> cvec -> dvec -> unit ; crossing : ' s -> ' a -> time -> cvec -> zoutvec -> unit ; output : ' s -> ' a -> cvec -> ' b ; setroots : ' s -> ' a -> cvec -> zinvec -> unit ; majorstep : ' s -> time -> cvec -> ' a -> ' b ; reset : ' s -> unit ; horizon : ' s -> time ; } -> ( ' a , ' b ) hsnode
let bit_bound z = Z . size z * 64
let of_cstruct_be ? bits cs = let open Cstruct in let open BE in let rec loop acc i = function \| b when b >= 64 -> let x = get_uint64 cs i in let x = Z . of_int64 Int64 . ( shift_right_logical x 8 ) in loop Z . ( x + acc lsl 56 ) ( i + 7 ) ( b - 56 ) \| b when b >= 32 -> let x = get_uint32 cs i in let x = Z . of_int32 Int32 . ( shift_right_logical x 8 ) in loop Z . ( x + acc lsl 24 ) ( i + 3 ) ( b - 24 ) \| b when b >= 16 -> let x = Z . of_int ( get_uint16 cs i ) in loop Z . ( x + acc lsl 16 ) ( i + 2 ) ( b - 16 ) \| b when b >= 8 -> let x = Z . of_int ( get_uint8 cs i ) in loop Z . ( x + acc lsl 8 ) ( i + 1 ) ( b - 8 ) \| b when b > 0 -> let x = get_uint8 cs i and b ' = 8 - b in Z . ( of_int x asr b ' + acc lsl b ) \| _ -> acc in loop Z . zero 0 @@ match bits with \| None -> Cstruct . length cs * 8 \| Some b -> imin b ( Cstruct . length cs * 8 )
let byte1 = Z . of_int64 0xffL

let check x = assert ( Z . sign x . Q . den >= 0 ) ; assert ( Z . compare ( gcd2 x . Q . num x . Q . den ) Z . one <= 0 )

let test1 msg op = List . iter ( fun x -> let r = op x in check r ; Printf . printf " % s % s = % s \ n " msg ( Q . to_string x ) ( Q . to_string r ) ) t_list

let test2 msg op = List . iter ( fun x -> List . iter ( fun y -> let r = op x y in check r ; Printf . printf " % s % s % s = % s \ n " ( Q . to_string x ) msg ( Q . to_string y ) ( Q . to_string r ) ) t_list ) t_list

let test_Q ( ) = let _ = List . iter check t_list in let _ = test1 " " - Q . neg in let _ = test1 " 1 " / Q . inv in let _ = test1 " abs " Q . abs in let _ = test2 " " + Q . add in let _ = test2 " " - Q . sub in let _ = test2 " " * Q . mul in let _ = test2 " " / Q . div in let _ = test2 " * 1 " / ( fun a b -> Q . mul a ( Q . inv b ) ) in let _ = test1 " mul_2exp ( 1 ) " ( fun a -> Q . mul_2exp a 1 ) in let _ = test1 " mul_2exp ( 2 ) " ( fun a -> Q . mul_2exp a 2 ) in let _ = test1 " div_2exp ( 1 ) " ( fun a -> Q . div_2exp a 1 ) in let _ = test1 " div_2exp ( 2 ) " ( fun a -> Q . div_2exp a 2 ) in List . iter ( fun x -> assert ( 0 = Q . compare x ( Q . div_2exp ( Q . mul_2exp x 2 ) 2 ) ) ; assert ( 0 = Q . compare x ( Q . mul_2exp ( Q . div_2exp x 2 ) 2 ) ) ; List . iter ( fun y -> Printf . printf " identity checking % s % s \ n " ( Q . to_string x ) ( Q . to_string y ) ; assert ( 0 = Q . compare ( Q . add x y ) ( Q . add y x ) ) ; assert ( 0 = Q . compare ( Q . sub x y ) ( Q . neg ( Q . sub y x ) ) ) ; assert ( 0 = Q . compare ( Q . sub x y ) ( Q . add x ( Q . neg y ) ) ) ; assert ( 0 = Q . compare ( Q . mul x y ) ( Q . mul y x ) ) ; assert ( 0 = Q . compare ( Q . div x y ) ( Q . mul x ( Q . inv y ) ) ) ; ) t_list ) t_list ; assert ( Q . compare Q . undef Q . undef = 0 ) ; assert ( not ( Q . equal Q . undef Q . undef ) ) ; assert ( not ( Q . lt Q . undef Q . undef ) ) ; assert ( not ( Q . leq Q . undef Q . undef ) ) ; assert ( not ( Q . gt Q . undef Q . undef ) ) ; assert ( not ( Q . geq Q . undef Q . undef ) )

let version ( ) = let n = versionNumber ( ) in ( n / 10_000 , ( n / 100 ) mod 100 , n mod 100 )

let bracket res destroy k = let r = try k res with exn -> let ( ) = destroy res in raise exn in let ( ) = destroy res in r

let check r = if isError r then raise ( Error ( getErrorName r ) )

let free_cctx x = check ( free_cctx x )

let free_dctx x = check ( free_dctx x )

let compress ~ level ? dict s = let open Ctypes in let len = Size_t . of_int ( String . length s ) in let dst_size = compressBound len in let dst = allocate_n char ~ count ( : Size_t . to_int dst_size ) in let r = match dict with | None -> do_compress ( to_voidp dst ) dst_size s len level | Some dict -> let dlen = Size_t . of_int ( String . length dict ) in bracket ( create_cctx ( ) ) free_cctx begin fun cctx -> do_compress_dict cctx ( to_voidp dst ) dst_size s len dict dlen level end in check r ; string_from_ptr dst ~ length ( : Size_t . to_int r )

let decompress orig ? dict s = let open Ctypes in let dst = allocate_n char ~ count : orig in let r = match dict with | None -> do_decompress ( to_voidp dst ) ( Size_t . of_int orig ) s ( Size_t . of_int ( String . length s ) ) | Some dict -> let dlen = Size_t . of_int ( String . length dict ) in bracket ( create_dctx ( ) ) free_dctx begin fun dctx -> do_decompress_dict dctx ( to_voidp dst ) ( Size_t . of_int orig ) s ( Size_t . of_int ( String . length s ) ) dict dlen end in check r ; string_from_ptr dst ~ length ( : Size_t . to_int r )

type ' a continuous = { mutable pos : ' a ; mutable der : ' a }

type ( ' a , ' b ) zerocrossing = { mutable zin : ' a ; mutable zout : ' b }

type ' a signal = ' a * bool

type ( ' a , ' b ) node = Node : { alloc : unit -> ' s ; step : ' s -> ' a -> ' b ; reset : ' s -> unit ; } -> ( ' a , ' b ) node

type ( ' a , ' b ) cnode = Cnode : { alloc : unit -> ' s ; copy : ' s -> ' s -> unit ; step : ' s -> ' a -> ' b ; reset : ' s -> unit ; } -> ( ' a , ' b ) cnode

type cvec = ( float , float64_elt , c_layout ) Array1 . t

type dvec = ( float , float64_elt , c_layout ) Array1 . t

type zinvec = ( int32 , int32_elt , c_layout ) Array1 . t

type zoutvec = ( float , float64_elt , c_layout ) Array1 . t

type cstate = { mutable dvec : dvec ; mutable cvec : cvec ; mutable zinvec : zinvec ; mutable zoutvec : zoutvec ; mutable cindex : int ; mutable zindex : int ; mutable cend : int ; mutable zend : int ; mutable cmax : int ; mutable zmax : int ; mutable horizon : float ; mutable major : bool ; }

type ( ' a , ' b ) hnode = cstate -> ( time * ' a , ' b ) node

type ' b hsimu = Hsim : { alloc : unit -> ' s ; maxsize : ' s -> int * int ; csize : ' s -> int ; zsize : ' s -> int ; step : ' s -> cvec -> dvec -> zinvec -> time -> ' b ; derivative : ' s -> cvec -> dvec -> zinvec -> zoutvec -> time -> unit ; crossings : ' s -> cvec -> zinvec -> zoutvec -> time -> unit ; reset : ' s -> unit ; horizon : ' s -> time ; } -> ' b hsimu

type ( ' a , ' b ) hsnode = Hnode : { state : ' s ; zsize : int ; csize : int ; derivative : ' s -> ' a -> time -> cvec -> dvec -> unit ; crossing : ' s -> ' a -> time -> cvec -> zoutvec -> unit ; output : ' s -> ' a -> cvec -> ' b ; setroots : ' s -> ' a -> cvec -> zinvec -> unit ; majorstep : ' s -> time -> cvec -> ' a -> ' b ; reset : ' s -> unit ; horizon : ' s -> time ; } -> ( ' a , ' b ) hsnode

let bit_bound z = Z . size z * 64

let of_cstruct_be ? bits cs = let open Cstruct in let open BE in let rec loop acc i = function | b when b >= 64 -> let x = get_uint64 cs i in let x = Z . of_int64 Int64 . ( shift_right_logical x 8 ) in loop Z . ( x + acc lsl 56 ) ( i + 7 ) ( b - 56 ) | b when b >= 32 -> let x = get_uint32 cs i in let x = Z . of_int32 Int32 . ( shift_right_logical x 8 ) in loop Z . ( x + acc lsl 24 ) ( i + 3 ) ( b - 24 ) | b when b >= 16 -> let x = Z . of_int ( get_uint16 cs i ) in loop Z . ( x + acc lsl 16 ) ( i + 2 ) ( b - 16 ) | b when b >= 8 -> let x = Z . of_int ( get_uint8 cs i ) in loop Z . ( x + acc lsl 8 ) ( i + 1 ) ( b - 8 ) | b when b > 0 -> let x = get_uint8 cs i and b ' = 8 - b in Z . ( of_int x asr b ' + acc lsl b ) | _ -> acc in loop Z . zero 0 @@ match bits with | None -> Cstruct . length cs * 8 | Some b -> imin b ( Cstruct . length cs * 8 )

let byte1 = Z . of_int64 0xffL