text stringlengths 12 786k |
|---|
let jv_global = jv_pure_js_expr " globalThis " |
let length s = jv_to_int ( jv_get s " length " ) |
let jstr_of_int ( ? base = 10 ) i = jv_call ( jv_of_int i ) " toString " [ | jv_of_int base ] | |
let err_bounds i len = let ( + ) s0 s1 = jv_call s0 " concat " [ | s1 ] | in jstr_to_string @@ v " index " + jstr_of_int i + v " not in bounds [ 0 ; " + jstr_of_int ( len - 1 ) + v " ] " |
let get s i = if i >= length s then invalid_arg ( err_bounds i ( length s ) ) else let u = jv_to_int ( jv_call s " codePointAt " [ | jv_of_int i ] ) | in let u = if u < 0xD800 || u > 0xDFFF then u else 0xFFFD in Uchar . unsafe_of_int u |
let jstr_of_uchar_int i = jv_call ( jv_get jv_global " String " ) " fromCodePoint " [ | jv_of_int i ] | |
let get_jstr s i = jstr_of_uchar_int ( Uchar . to_int ( get s i ) ) |
let empty = v " " |
let sp = v " " |
let nl = v " \ n " |
let append s0 s1 = jv_call s0 " concat " [ | s1 ] | |
let ( + ) = append |
let concat ( ? sep = empty ) ss = jv_call ( jv_of_jstr_list ss ) " join " [ | sep ] | |
let pad_start ( ? pad = sp ) len s = jv_call s " padStart " [ | jv_of_int len ; sp ] | |
let pad_end ( ? pad = sp ) len s = jv_call s " padEnd " [ | jv_of_int len ; sp ] | |
let repeat n s = jv_call s " repeat " [ | jv_of_int n ] | |
let find_sub ( ? start = 0 ) ~ sub s = let i = jv_to_int ( jv_call s " indexOf " [ | sub ; jv_of_int start ] ) | in if i = - 1 then None else Some i |
let find_last_sub ? before ~ sub s = let before = match before with None -> length s | Some b -> b in let pos = before - length sub in if pos < 0 then None else let i = jv_to_int ( jv_call s " lastIndexOf " [ | sub ; jv_of_int pos ] ) | in if i = - 1 then None else Some i |
let slice ( ? start = 0 ) ? stop s = let args = match stop with | None -> [ | jv_of_int start ] | | Some stop -> [ | jv_of_int start ; jv_of_int stop ] | in jv_call s " slice " args |
let sub ( ? start = 0 ) ? len s = let args = match len with | None -> [ | jv_of_int start ] | | Some len -> [ | jv_of_int start ; jv_of_int len ] | in jv_call s " substr " args |
let cuts ~ sep s = jv_to_jstr_list ( jv_call s " split " [ | sep ] ) | |
let iterator : jv = jv_pure_js_expr " Symbol . iterator " |
let fold_uchars f s acc = let rec loop it acc = let r = jv_call it " next " [ ] || in if jv_to_bool ( jv_get r " done " ) then acc else let u = jv_call ( jv_get r " value " ) " codePointAt " [ | jv_of_int 0 ] | in let u = if u < 0xD800 || u > 0xDFFF then u else 0xFFFD in l... |
let fold_jstr_uchars f s acc = let f ' u acc = f ( jstr_of_uchar_int ( Uchar . to_int u ) ) acc in fold_uchars f ' s acc |
let trim s = jv_call s " trim " [ ] || |
type normalization = [ ` NFD | ` NFC | ` NFKD | ` NFKC ] |
let normalized nf s = let nf = match nf with | ` NFD -> v " NFD " | ` NFC -> v " NFC " | ` NFKD -> v " NFKD " | ` NFKC -> v " NFKC " in jv_call s " normalize " [ | nf ] | |
let lowercased s = jv_call s " toLowerCase " [ ] || |
let uppercased s = jv_call s " toUpperCase " [ ] || |
let is_empty s = length s = 0 |
let starts_with ~ prefix s = jv_to_bool @@ jv_call s " startsWith " [ | prefix ] | |
let includes ~ affix s = jv_to_bool @@ jv_call s " includes " [ | affix ] | |
let ends_with ~ suffix s = jv_to_bool @@ jv_call s " endsWith " [ | suffix ] | |
let equal = ( = ) |
let of_uchar u = jstr_of_uchar_int ( Uchar . to_int u ) |
let of_char c = jstr_of_uchar_int ( Char . code c ) |
let number = jv_get jv_global " Number " |
let to_int ? base s = let args = match base with None -> [ | s ] | | Some b -> [ | s ; jv_of_int b ] | in let n = jv_call number " parseInt " args in if not ( n = n ) then None else Some ( jv_to_int n ) |
let to_float s = jv_to_float @@ jv_call number " parseFloat " [ | s ] | |
let of_float ? frac n = match frac with |
module Rect = struct type ' a t = { top : ' a ; left : ' a ; bottom : ' a ; right : ' a } [ @@ deriving sexp , bin_io , compare , fields ] let map t ~ f = { top = f t . top ; left = f t . left ; bottom = f t . bottom ; right = f t . right } ; ; let int_he... |
let round_float_rect ( ? round = Float . iround_nearest_exn ) = Rect . map ~ f : round |
type rows_or_columns = | Rows | Columns |
let innerHeight ( ) = Js . Optdef . case Dom_html . window . ## innerHeight ( fun ( ) -> Dom_html . document . ## documentElement . ## clientHeight ) Fn . id ; ; |
let innerWidth ( ) = Js . Optdef . case Dom_html . window . ## innerWidth ( fun ( ) -> Dom_html . document . ## documentElement . ## clientWidth ) Fn . id ; ; |
let element_is_in_viewport ( elt : Dom_html . element Js . t ) = let rect = elt ## getBoundingClientRect in Float . ( >= ) rect . ## top 0 . && Float . ( >= ) rect . ## left 0 . && Float . ( <= ) rect . ## bottom ( Float . of_int ( innerHeight ( ) ) ) && ... |
let scroll ( ? id = " keep - in - view " ) ( ) = match Dom_html . getElementById_opt id with | None -> ( ) | Some elt -> if not ( element_is_in_viewport elt ) then elt ## scrollIntoView Js . _true ; ; |
let viewport_rect_of_element ( elt : Dom_html . element Js . t ) : float Rect . t = let rect = elt ## getBoundingClientRect in { Rect . top = rect . ## top ; left = rect . ## left ; bottom = rect . ## bottom ; right = rect . ## right } ; ; |
let viewport_rect ( ) = { Rect . top = 0 ; left = 0 ; bottom = innerHeight ( ) ; right = innerWidth ( ) } ; ; |
let client_rect_of_element ( elt : Dom_html . element Js . t ) : float Rect . t = let bounding_rect = viewport_rect_of_element elt in { bounding_rect with bottom = bounding_rect . top . + Float . of_int elt . ## clientHeight ; right = bounding_rect . left . + Float . of_int elt . ... |
let client_rect ( ) = { Rect . top = 0 ; left = 0 ; bottom = Dom_html . document . ## documentElement . ## clientHeight ; right = Dom_html . document . ## documentElement . ## clientWidth } ; ; |
let binary_search ( type elt ) ~ length ~ get ~ compare mode x = let module Bs = Binary_searchable . Make ( struct type nonrec elt = elt type nonrec t = unit let get ( ) n = get n let length ( ) = length end ) in Bs . binary_search ( ) ~ compare mode x ; ; |
let element_search ~ length ~ nth_element_id ~ search_by mode layout x = let get = let nth_element n = let id = nth_element_id n in match Dom_html . getElementById_opt id with | None -> failwithf " Element % s not found " id ( ) | Some elt -> elt in let first = viewport_rect_of_element ( nth_el... |
let find_visible_range ~ length ~ nth_element_id layout = if length = 0 then None else ( let element_search = element_search ~ length ~ nth_element_id in let viewport_rect = viewport_rect ( ) in let first = let search_by , target = match layout with | Rows -> Rect . bottom , viewport_rect . t... |
let get_scroll_container_js_expr = Js . Unsafe . pure_js_expr { js | ( function ( element ) { var doc = element . ownerDocument || document ; var win = doc . defaultView || window ; var re = ( / auto | scroll ) ; / if ( element === doc ) { return doc ; } var cur = eleme... |
let get_scroll_container ( el : # Dom . node Js . t ) : Dom . node Js . t = Js . Unsafe . fun_call get_scroll_container_js_expr [ | Js . Unsafe . inject el ] | ; ; |
let strict_equal = ( == ) |
let null = pure_js_expr " null " |
let undefined = pure_js_expr " undefined " |
let is_null v = v == null |
let is_undefined v = v == undefined |
let is_none v = is_null v || is_undefined v |
let is_some v = not ( is_none v ) |
let to_option conv v = if is_none v then None else Some ( conv v ) |
let of_option ~ none conv = function None -> none | Some v -> conv v |
let global = pure_js_expr " globalThis " |
let set_if_some o p = function None -> ( ) | Some v -> set o p v |
let find o p = let v = get o p in if is_none v then None else Some v |
let find_map f o p = let v = get o p in if is_none v then None else Some ( f v ) |
let rec find_path o = function |
let true ' = pure_js_expr " true " |
let false ' = pure_js_expr " false " |
module Bool = struct let find o p = let b = get o p in if is_none b then None else Some ( to_bool b ) let get o p = to_bool ( get o p ) let set o p b = set o p ( of_bool b ) let set_if_some o p = function None -> ( ) | Some b -> set o p b end |
module Int = struct let find o p = let i = get o p in if is_none i then None else Some ( to_int i ) let get o p = to_int ( get o p ) let set o p i = set o p ( of_int i ) let set_if_some o p = function None -> ( ) | Some i -> set o p i end |
module Float = struct let find o p = let f = get o p in if is_none f then None else Some ( to_float f ) let get o p = to_float ( get o p ) let set o p b = set o p ( of_float b ) let set_if_some o p = function None -> ( ) | Some f -> set o p f end |
module Jstr = struct let find o p = let s = get o p in if is_none s then None else Some ( to_jstr s ) let get o p = to_jstr ( get o p ) let set o p b = set o p ( of_jstr b ) let set_if_some o p = function None -> ( ) | Some f -> set o p f type t = Jstr . t let to_string = Jstr . to_string... |
module Jarray = struct type t = jv let create n = new ' ( get global " Array " ) [ | of_int n ] | let length a = to_int ( get a " length " ) external get : t -> int -> t = " caml_js_get " external set : t -> int -> t -> unit = " caml_js_set " end |
let to_array conv v = let len = Jarray . length v in Array . init len ( fun i -> conv ( Jarray . get v i ) ) |
let of_array conv a = let len = Array . length a in let ja = Jarray . create len in for i = 0 to len - 1 do Jarray . set ja i ( conv ( Array . get a i ) ) done ; ja |
let to_list conv v = let len = Jarray . length v in List . init len ( fun i -> conv ( Jarray . get v i ) ) |
let of_list conv l = let rec loop i ja = function | [ ] -> ja | v :: vs -> Jarray . set ja i ( conv v ) ; loop ( i + 1 ) ja vs in loop 0 ( Jarray . create 0 ) l |
module Error = struct type enum = [ ` Abort_error | ` Constraint_error | ` Data_clone_error | ` Data_error | ` Encoding_error | ` Hierarchy_request_error | ` Index_size_error | ` Invalid_access_error | ` Invalid_character_error | ` Invalid_modification_error | ` Invalid_node_type_err... |
let throw ? name msg = let e = Error . v ? name msg in ( js_expr " ( function ( exn ) { throw exn } ) " : Error . t -> ' a ) e |
module It = struct type t = jv type result = jv let symbol : jv = pure_js_expr " Symbol . iterator " external get_symbol : jv -> jv -> jv = " caml_js_get " let iterable o = match to_option Fun . id ( get_symbol o symbol ) with | None -> None | Some func -> apply func [ ] || let iterat... |
module Promise = struct type t = jv let promise = get global " Promise " let create f = new ' promise [ | repr f ] | let resolve v = call promise " resolve " [ | repr v ] | let reject v = call promise " reject " [ | repr v ] | let await p k = ignore ( call p " then " [ | ... |
let find ' o p = let v = get ' o p in if is_none v then None else Some v |
let find_map ' f o p = let v = get ' o p in if is_none v then None else Some ( f v ) |
let obj ' props = obj ( Array . map ( fun ( p , v ) -> Jstr . to_string p , v ) props ) |
let call ' o m args = call o ( Jstr . to_string m ) args |
let has p v = is_some ( get ( repr v ) p ) |
let defined v = is_some ( repr v ) |
module type CONV = sig type t external to_jv : t -> jv = " % identity " external of_jv : jv -> t = " % identity " end |
module Id = struct external to_jv : ' a -> t = " % identity " external of_jv : t -> ' a = " % identity " end |
type algorithm = | RS256 of Nocrypto . Rsa . priv option | HS256 of Cstruct . t | HS512 of Cstruct . t | Unknown |
let fn_of_algorithm = function | RS256 ( Some key ) -> ( fun input_str -> Nocrypto . Rsa . PKCS1 . sign ~ hash ` : SHA256 ~ key ( ` Message ( Cstruct . of_string input_str ) ) |> Cstruct . to_string ) | RS256 None -> failwith " Not supported " | HS256 key -> ( fun input_s... |
let string_of_algorithm = function | RS256 _ -> " RS256 " | HS256 _ -> " HS256 " | HS512 _ -> " HS512 " | Unknown -> " " |
let algorithm_of_string = function | " HS256 " -> HS256 ( Cstruct . of_string " " ) | " HS512 " -> HS512 ( Cstruct . of_string " " ) | " RS256 " -> RS256 None | _ -> Unknown |
type header = { alg : algorithm ; typ : string option ; kid : string option } |
let make_header ~ alg ? typ ? kid ( ) = { alg ; typ ; kid } |
let header_of_algorithm_and_typ alg typ = { alg ; typ ; kid = None } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.