text stringlengths 12 786k |
|---|
let error_occurred = ref false |
let function_tested = ref " " |
let testing_function s = function_tested := s ; print_newline ( ) ; print_string s ; print_newline ( ) |
let test test_number answer correct_answer = flush stdout ; flush stderr ; if answer <> correct_answer then begin eprintf " *** Bad result ( % s , test % d ) \ n " ! function_tested test_number ; flush stderr ; error_occurred := true end else begin printf " % d . . . " test_number e... |
let _ = testing_function " ------ Array1 " ; -------- testing_function " create / set / get " ; let test_setget kind vals = let rec set a i = function [ ] -> ( ) | ( v1 , v2 ) :: tl -> a . { i } <- v1 ; set a ( i + 1 ) tl in let rec test a i = function [ ] -> t... |
let _ = print_newline ( ) ; if ! error_occurred then begin prerr_endline " ************* TEST FAILED " ; **************** exit 2 end else exit 0 |
let error_occurred = ref false |
let function_tested = ref " " |
let testing_function s = function_tested := s ; print_newline ( ) ; print_string s ; print_newline ( ) |
let test test_number answer correct_answer = flush stdout ; flush stderr ; if answer <> correct_answer then begin eprintf " *** Bad result ( % s , test % d ) \ n " ! function_tested test_number ; flush stderr ; error_occurred := true end else begin printf " % d . . . " test_number e... |
let _ = let make_array2 kind layout ind0 dim1 dim2 fromint = let a = Array2 . create kind layout dim1 dim2 in for i = ind0 to dim1 - 1 + ind0 do for j = ind0 to dim2 - 1 + ind0 do a . { i , j } <- ( fromint ( i * 1000 + j ) ) done done ; a in print_newline ( ) ; testing_functio... |
type big_int = { sign : int ; abs_value : nat } |
let create_big_int sign nat = if sign = 1 || sign = - 1 || ( sign = 0 && is_zero_nat nat 0 ( num_digits_nat nat 0 ( length_nat nat ) ) ) then { sign = sign ; abs_value = nat } else invalid_arg " create_big_int " |
let sign_big_int bi = bi . sign |
let zero_big_int = { sign = 0 ; abs_value = make_nat 1 } |
let unit_big_int = { sign = 1 ; abs_value = nat_of_int 1 } |
let num_digits_big_int bi = num_digits_nat ( bi . abs_value ) 0 ( length_nat bi . abs_value ) |
let minus_big_int bi = { sign = - bi . sign ; abs_value = copy_nat ( bi . abs_value ) 0 ( num_digits_big_int bi ) } |
let abs_big_int bi = { sign = if bi . sign = 0 then 0 else 1 ; abs_value = copy_nat ( bi . abs_value ) 0 ( num_digits_big_int bi ) } |
let compare_big_int bi1 bi2 = if bi1 . sign = 0 && bi2 . sign = 0 then 0 else if bi1 . sign < bi2 . sign then - 1 else if bi1 . sign > bi2 . sign then 1 else if bi1 . sign = 1 then compare_nat ( bi1 . abs_value ) 0 ( num_digits_big_int bi1 ) ( bi2 . abs_value ) 0 ( num_di... |
let eq_big_int bi1 bi2 = compare_big_int bi1 bi2 = 0 |
let max_big_int bi1 bi2 = if lt_big_int bi1 bi2 then bi2 else bi1 |
let pred_big_int bi = match bi . sign with 0 -> { sign = - 1 ; abs_value = nat_of_int 1 } | 1 -> let size_bi = num_digits_big_int bi in let copy_bi = copy_nat ( bi . abs_value ) 0 size_bi in ignore ( decr_nat copy_bi 0 size_bi 0 ) ; { sign = if is_zero_nat copy_bi 0 size_bi then ... |
let succ_big_int bi = match bi . sign with 0 -> { sign = 1 ; abs_value = nat_of_int 1 } | - 1 -> let size_bi = num_digits_big_int bi in let copy_bi = copy_nat ( bi . abs_value ) 0 size_bi in ignore ( decr_nat copy_bi 0 size_bi 0 ) ; { sign = if is_zero_nat copy_bi 0 size_bi then ... |
let add_big_int bi1 bi2 = let size_bi1 = num_digits_big_int bi1 and size_bi2 = num_digits_big_int bi2 in if bi1 . sign = bi2 . sign then { sign = bi1 . sign ; abs_value = match compare_nat ( bi1 . abs_value ) 0 size_bi1 ( bi2 . abs_value ) 0 size_bi2 with - 1 -> let res = create_nat ( ... |
let big_int_of_int i = { sign = sign_int i ; abs_value = let res = ( create_nat 1 ) in ( if i = monster_int then ( set_digit_nat res 0 biggest_int ; ignore ( incr_nat res 0 1 1 ) ) else set_digit_nat res 0 ( abs i ) ) ; res } |
let add_int_big_int i bi = add_big_int ( big_int_of_int i ) bi |
let sub_big_int bi1 bi2 = add_big_int bi1 ( minus_big_int bi2 ) |
let mult_int_big_int i bi = let size_bi = num_digits_big_int bi in let size_res = succ size_bi in if i = monster_int then let res = create_nat size_res in blit_nat res 0 ( bi . abs_value ) 0 size_bi ; set_digit_nat res size_bi 0 ; ignore ( mult_digit_nat res 0 size_res ( bi . abs_value ) 0 s... |
let mult_big_int bi1 bi2 = let size_bi1 = num_digits_big_int bi1 and size_bi2 = num_digits_big_int bi2 in let size_res = size_bi1 + size_bi2 in let res = make_nat ( size_res ) in { sign = bi1 . sign * bi2 . sign ; abs_value = if size_bi2 > size_bi1 then ( ignore ( mult_nat res 0 size_res ( ... |
let quomod_big_int bi1 bi2 = if bi2 . sign = 0 then raise Division_by_zero else let size_bi1 = num_digits_big_int bi1 and size_bi2 = num_digits_big_int bi2 in match compare_nat ( bi1 . abs_value ) 0 size_bi1 ( bi2 . abs_value ) 0 size_bi2 with - 1 -> if bi1 . sign >= 0 then ( big_int_of_in... |
let div_big_int bi1 bi2 = fst ( quomod_big_int bi1 bi2 ) |
let gcd_big_int bi1 bi2 = let size_bi1 = num_digits_big_int bi1 and size_bi2 = num_digits_big_int bi2 in if is_zero_nat ( bi1 . abs_value ) 0 size_bi1 then abs_big_int bi2 else if is_zero_nat ( bi2 . abs_value ) 0 size_bi2 then { sign = 1 ; abs_value = bi1 . abs_value } else { sign = 1 ;... |
let monster_big_int = big_int_of_int monster_int ; ; |
let is_int_big_int bi = num_digits_big_int bi == 1 && match compare_nat bi . abs_value 0 1 monster_nat 0 1 with | 0 -> bi . sign == - 1 | - 1 -> true | _ -> false ; ; |
let int_of_big_int bi = try let n = int_of_nat bi . abs_value in if bi . sign = - 1 then - n else n with Failure _ -> if eq_big_int bi monster_big_int then monster_int else failwith " int_of_big_int " ; ; |
let big_int_of_nativeint i = if i = 0n then zero_big_int else if i > 0n then begin let res = create_nat 1 in set_digit_nat_native res 0 i ; { sign = 1 ; abs_value = res } end else begin let res = create_nat 1 in set_digit_nat_native res 0 ( Nativeint . neg i ) ; { sign = - 1 ; abs_v... |
let nativeint_of_big_int bi = if num_digits_big_int bi > 1 then failwith " nativeint_of_big_int " ; let i = nth_digit_nat_native bi . abs_value 0 in if bi . sign >= 0 then if i >= 0n then i else failwith " nativeint_of_big_int " else if i >= 0n || i = Nativeint . min_int then Nativeint . ... |
let big_int_of_int32 i = big_int_of_nativeint ( Nativeint . of_int32 i ) |
let int32_of_big_int bi = let i = nativeint_of_big_int bi in if i <= 0x7FFF_FFFFn && i >= - 0x8000_0000n then Nativeint . to_int32 i else failwith " int32_of_big_int " |
let big_int_of_int64 i = if Sys . word_size = 64 then big_int_of_nativeint ( Int64 . to_nativeint i ) else begin let ( sg , absi ) = if i = 0L then ( 0 , 0L ) else if i > 0L then ( 1 , i ) else ( - 1 , Int64 . neg i ) in let res = create_nat 2 in set_digit_nat_native res... |
let int64_of_big_int bi = if Sys . word_size = 64 then Int64 . of_nativeint ( nativeint_of_big_int bi ) else begin let i = match num_digits_big_int bi with | 1 -> Int64 . logand ( Int64 . of_nativeint ( nth_digit_nat_native bi . abs_value 0 ) ) 0xFFFFFFFFL | 2 -> Int64 . logor ( In... |
let nat_of_big_int bi = if bi . sign = - 1 then failwith " nat_of_big_int " else copy_nat ( bi . abs_value ) 0 ( num_digits_big_int bi ) |
let sys_big_int_of_nat nat off len = let length = num_digits_nat nat off len in { sign = if is_zero_nat nat off length then 0 else 1 ; abs_value = copy_nat nat off length } |
let big_int_of_nat nat = sys_big_int_of_nat nat 0 ( length_nat nat ) |
let string_of_big_int bi = if bi . sign = - 1 then " " - ^ string_of_nat bi . abs_value else string_of_nat bi . abs_value |
let sys_big_int_of_string_aux s ofs len sgn = if len < 1 then failwith " sys_big_int_of_string " ; let n = sys_nat_of_string 10 s ofs len in if is_zero_nat n 0 ( length_nat n ) then zero_big_int else { sign = sgn ; abs_value = n } ; ; |
let sys_big_int_of_string s ofs len = if len < 1 then failwith " sys_big_int_of_string " ; match s . [ ofs ] with | ' ' - -> sys_big_int_of_string_aux s ( ofs + 1 ) ( len - 1 ) ( - 1 ) | ' ' + -> sys_big_int_of_string_aux s ( ofs + 1 ) ( len - 1 ) 1 | _ -> ... |
let big_int_of_string s = sys_big_int_of_string s 0 ( String . length s ) |
let power_base_nat base nat off len = if base = 0 then nat_of_int 0 else if is_zero_nat nat off len || base = 1 then nat_of_int 1 else let power_base = make_nat ( succ length_of_digit ) in let ( pmax , pint ) = make_power_base base power_base in let ( n , rem ) = let ( x , y ) = quomod... |
let power_int_positive_int i n = match sign_int n with 0 -> unit_big_int | - 1 -> invalid_arg " power_int_positive_int " | _ -> let nat = power_base_int ( abs i ) n in { sign = if i >= 0 then sign_int i else if n land 1 = 0 then 1 else - 1 ; abs_value = nat } |
let power_big_int_positive_int bi n = match sign_int n with 0 -> unit_big_int | - 1 -> invalid_arg " power_big_int_positive_int " | _ -> let bi_len = num_digits_big_int bi in let res_len = bi_len * n in let res = make_nat res_len and res2 = make_nat res_len and l = num_bits_int n - 2 in let p = r... |
let power_int_positive_big_int i bi = match sign_big_int bi with 0 -> unit_big_int | - 1 -> invalid_arg " power_int_positive_big_int " | _ -> let nat = power_base_nat ( abs i ) ( bi . abs_value ) 0 ( num_digits_big_int bi ) in { sign = if i >= 0 then sign_int i else if is_digit_odd ( ... |
let power_big_int_positive_big_int bi1 bi2 = match sign_big_int bi2 with 0 -> unit_big_int | - 1 -> invalid_arg " power_big_int_positive_big_int " | _ -> try power_big_int_positive_int bi1 ( int_of_big_int bi2 ) with Failure _ -> try power_int_positive_big_int ( int_of_big_int bi1 ) bi2 with Fai... |
let base_power_big_int base n bi = match sign_int n with 0 -> bi | - 1 -> let nat = power_base_int base ( - n ) in let len_nat = num_digits_nat nat 0 ( length_nat nat ) and len_bi = num_digits_big_int bi in if len_bi < len_nat then invalid_arg " base_power_big_int " else if len_bi = len_nat &... |
let float_of_big_int bi = float_of_string ( string_of_big_int bi ) |
let sqrt_big_int bi = match bi . sign with | 0 -> zero_big_int | - 1 -> invalid_arg " sqrt_big_int " | _ -> { sign = 1 ; abs_value = sqrt_nat ( bi . abs_value ) 0 ( num_digits_big_int bi ) } |
let square_big_int bi = if bi . sign == 0 then zero_big_int else let len_bi = num_digits_big_int bi in let len_res = 2 * len_bi in let res = make_nat len_res in ignore ( square_nat res 0 len_res ( bi . abs_value ) 0 len_bi ) ; { sign = 1 ; abs_value = res } |
let round_futur_last_digit s off_set length = let l = pred ( length + off_set ) in if Char . code ( String . get s l ) >= Char . code ' 5 ' then let rec round_rec l = if l < off_set then true else begin let current_char = String . get s l in if current_char = ' 9 ' then ( String . ... |
let approx_big_int prec bi = let len_bi = num_digits_big_int bi in let n = max 0 ( int_of_big_int ( add_int_big_int ( - prec ) ( div_big_int ( mult_big_int ( big_int_of_int ( pred len_bi ) ) ( big_int_of_string " 963295986 " ) ) ( big_int_of_string " 100000000 " ) ) ) ) ... |
let shift_left_big_int bi n = if n < 0 then invalid_arg " shift_left_big_int " else if n = 0 then bi else if bi . sign = 0 then bi else begin let size_bi = num_digits_big_int bi in let size_res = size_bi + ( ( n + length_of_digit - 1 ) / length_of_digit ) in let res = create_nat size_res in... |
let shift_right_towards_zero_big_int bi n = if n < 0 then invalid_arg " shift_right_towards_zero_big_int " else if n = 0 then bi else if bi . sign = 0 then bi else begin let size_bi = num_digits_big_int bi in let ndigits = n / length_of_digit in let nbits = n mod length_of_digit in if ndigits >= size_... |
let two_power_m1_big_int n = if n < 0 then invalid_arg " two_power_m1_big_int " else if n = 0 then zero_big_int else begin let size_res = ( n + length_of_digit - 1 ) / length_of_digit in let res = make_nat size_res in set_digit_nat_native res ( n / length_of_digit ) ( Nativeint . shift_left ... |
let shift_right_big_int bi n = if n < 0 then invalid_arg " shift_right_big_int " else if bi . sign >= 0 then shift_right_towards_zero_big_int bi n else shift_right_towards_zero_big_int ( sub_big_int bi ( two_power_m1_big_int n ) ) n |
let extract_big_int bi ofs n = if ofs < 0 || n < 0 then invalid_arg " extract_big_int " else if bi . sign = 0 then bi else begin let size_bi = num_digits_big_int bi in let size_res = ( n + length_of_digit - 1 ) / length_of_digit in let ndigits = ofs / length_of_digit in let nbits = ofs mod le... |
let and_big_int a b = if a . sign < 0 || b . sign < 0 then invalid_arg " and_big_int " else if a . sign = 0 || b . sign = 0 then zero_big_int else begin let size_a = num_digits_big_int a and size_b = num_digits_big_int b in let size_res = min size_a size_b in let res = create_nat size_res in ... |
let or_big_int a b = if a . sign < 0 || b . sign < 0 then invalid_arg " or_big_int " else if a . sign = 0 then b else if b . sign = 0 then a else begin let size_a = num_digits_big_int a and size_b = num_digits_big_int b in let size_res = max size_a size_b in let res = create_nat size_res in le... |
let xor_big_int a b = if a . sign < 0 || b . sign < 0 then invalid_arg " xor_big_int " else if a . sign = 0 then b else if b . sign = 0 then a else begin let size_a = num_digits_big_int a and size_b = num_digits_big_int b in let size_res = max size_a size_b in let res = create_nat size_res in ... |
module T = struct include Int let print = Numeric_types . Int . print let hash = Hashtbl . hash end |
module Tree = Patricia_tree . Make ( T ) |
let strictly_earlier ( t : t ) ~ than = t < than |
let succ ( t : t ) = if t < earliest_var then Misc . fatal_error " Cannot increment binding time for symbols " else t + 1 |
module With_name_mode = struct type t = int let [ @ inline always ] create binding_time ( name_mode : Name_mode . t ) = let name_mode = match name_mode with Normal -> 0 | In_types -> 1 | Phantom -> 2 in ( binding_time lsl 2 ) lor name_mode let symbols = create symbols Name_mode . normal ... |
let gpu_bitonic = kern v j k -> let open Std in let i = thread_idx_x + block_dim_x * block_idx_x in let ixj = Math . xor i j in let mutable temp = 0 . in if ixj >= i then begin if ( Math . logical_and i k ) = 0 then ( if v . [ < i ] > . > v . [ < ixj ] > then ( temp := v . ... |
let exchange ( v : ( float , Bigarray . float32_elt ) Spoc . Vector . vector ) i j : unit = let t : float = v . [ < i ] > in v . [ < i ] > <- v . [ < j ] ; > v . [ < j ] > <- t ; ; |
let rec sortup v m n : unit = if n <> 1 then begin sortup v m ( n / 2 ) ; sortdown v ( m + n / 2 ) ( n / 2 ) ; mergeup v m ( n / 2 ) ; end m n : unit = if n <> 1 then begin sortup v m ( n / 2 ) ; sortdown v ( m + n / 2 ) ( n / 2 ) ; mergedown v m ( n / 2 ... |
let cpt = ref 0 |
let tot_time = ref 0 . |
let measure_time s f = let t0 = Unix . gettimeofday ( ) in let a = f ( ) in let t1 = Unix . gettimeofday ( ) in Printf . printf " time % s : % Fs \ n " %! s ( t1 . - t0 ) ; tot_time := ! tot_time . + ( t1 . - t0 ) ; incr cpt ; a ; ; |
let nearest_pow2 i = let rec aux acc = let res = acc * 2 in if res < i then aux res else acc in let r = aux 1 in if r <> i then Printf . printf " Changed size value to a power of two ( % d -> % d ) \ n " i r ; r |
let ( ) = let devid = ref 0 and size = ref 1024 and check = ref true and compare = ref true in let arg1 = ( " - device " , Arg . Int ( fun i -> devid := i ) , and arg2 = ( " - size " , Arg . Int ( fun i -> size := nearest_pow2 i ) , and arg3 = ( " - bench " , ... |
let gpu_bitonic = kern v j k -> let open Std in let i = thread_idx_x + block_dim_x * block_idx_x in let ixj = Math . xor i j in let mutable temp = 0 . in if ixj >= i then begin if ( Math . logical_and i k ) = 0 then ( if v . [ < i ] > . > v . [ < ixj ] > then ( temp := v . ... |
let append_text e s = Dom . appendChild e ( document ## createTextNode ( Js . string s ) ) |
let button action = let b = createInput ~ _type ( : Js . string " button " ) document in b ## value <- ( Js . string " Go " ) ; b ## onclick <- handler action ; b |
let text name default cols = let b = createInput ~ _type ( : Js . string " text " ) document in b ## value <- ( Js . string default ) ; b ## size <- 4 ; b |
let cpt = ref 0 |
let tot_time = ref 0 . |
let measure_time s f = let t0 = Unix . gettimeofday ( ) in let a = f ( ) in let t1 = Unix . gettimeofday ( ) in Printf . printf " time % s : % Fs \ n " %! s ( t1 . - t0 ) ; tot_time := ! tot_time . + ( t1 . - t0 ) ; incr cpt ; a ; ; |
let compute size devid devs = let dev = devs . ( devid ) in Printf . printf " Will use device : % s to sort % d floats \ n " %! ( dev ) . Spoc . Devices . general_info . Spoc . Devices . name size ; let gpu_vect = Spoc . Vector . create Vector . float32 size and base_vect = ... |
let pow2 n = let rec aux acc n = if n = 1 then acc else aux ( acc * 2 ) ( n - 1 ) in aux 2 n |
let f size_text select_devices devs = ( fun _ -> let size = pow2 ( int_of_string ( Js . to_string size_text ## value ) ) in let select = select_devices ## selectedIndex + 0 in compute size select devs ; Js . _true ) ; ; |
let newLine _ = Dom_html . createBr document |
let nodeJsText t = let sp = Dom_html . createSpan document in Dom . appendChild sp ( document ## createTextNode ( t ) ) ; sp |
let nodeText t = nodeJsText ( Js . string t ) |
let go _ = let devs = Devices . init ~ only : Devices . OpenCL ( ) in let body = Js . Opt . get ( document ## getElementById ( Js . string " section1 " ) ) ( fun ( ) -> assert false ) in Dom . appendChild body ( nodeText " This sample computes a bitonic sort over a vector... |
let _ = window ## onload <- handler go |
let number_of_data_bytes ( t : t ) = Bits0 . number_of_data_bytes t |
module Expert = struct let unsafe_underlying_repr ( t : t ) = ( t :> Bytes . t ) let offset_for_data = 8 end |
module Mutable = struct include Bits0 let is_empty a = width a = 0 let of_constant t = t let to_constant t = t let to_string t = Constant . to_binary_string t let to_int t = Constant . to_int t let copy ~ src ~ dst = let words = words src in for i = 0 to words - 1 do unsafe_set_int64 dst i ( unsaf... |
let to_int x = Constant . to_int x |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.