text stringlengths 12 786k |
|---|
let extension_exists = kind_name_exists RK_extension |
let exception_exists = kind_name_exists RK_exception |
let attribute_exists = kind_name_exists RK_attribute |
let method_exists = kind_name_exists RK_method |
let recfield_exists = kind_name_exists RK_recfield |
let const_exists = kind_name_exists RK_const |
let lookup_module name = match List . find ( fun k -> match k with Odoc_search . Res_module _ -> true | _ -> false ) ( get_known_elements name ) with | Odoc_search . Res_module m -> m | _ -> assert false |
let lookup_module_type name = match List . find ( fun k -> match k with Odoc_search . Res_module_type _ -> true | _ -> false ) ( get_known_elements name ) with | Odoc_search . Res_module_type m -> m | _ -> assert false |
let lookup_class name = match List . find ( fun k -> match k with Odoc_search . Res_class _ -> true | _ -> false ) ( get_known_elements name ) with | Odoc_search . Res_class c -> c | _ -> assert false |
let lookup_class_type name = match List . find ( fun k -> match k with Odoc_search . Res_class_type _ -> true | _ -> false ) ( get_known_elements name ) with | Odoc_search . Res_class_type c -> c | _ -> assert false |
let lookup_extension name = match List . find ( fun k -> match k with Odoc_search . Res_extension _ -> true | _ -> false ) ( get_known_elements name ) with | Odoc_search . Res_extension x -> x | _ -> assert false |
let lookup_exception name = match List . find ( fun k -> match k with Odoc_search . Res_exception _ -> true | _ -> false ) ( get_known_elements name ) with | Odoc_search . Res_exception e -> e | _ -> assert false object inherit Odoc_scan . scanner method ! scan_value v = add_known_element ... |
let init_known_elements_map module_list = let c = new scan in c # scan_module_list module_list |
type not_found_name = | NF_mt of Name . t | NF_mmt of Name . t | NF_c of Name . t | NF_cct of Name . t | NF_xt of Name . t | NF_ex of Name . t |
let rec associate_in_module module_list ( acc_b_modif , acc_incomplete_top_module_names , acc_names_not_found ) m = let rec iter_kind ( acc_b , acc_inc , acc_names ) k = match k with Module_struct elements -> List . fold_left ( associate_in_module_element module_list m . m_name ) ( acc_b , ... |
let not_found_of_kind kind name = ( match kind with RK_module -> Odoc_messages . cross_module_not_found | RK_module_type -> Odoc_messages . cross_module_type_not_found | RK_class -> Odoc_messages . cross_class_not_found | RK_class_type -> Odoc_messages . cross_class_type_not_found | RK_value -> Odoc... |
let query module_list name = match get_known_elements name with | [ ] -> ( try let re = Str . regexp ( " " ( ^^ Str . quote name ) " " ) ^$ in let t = Odoc_search . find_section module_list re in let v2 = ( name , Some ( RK_section t ) ) in add_verified v2 ; ( name , ... |
let rec search_within_ancestry ( finalize , initial_name , query as param ) ? parent_name name = let name = Odoc_name . normalize_name name in let res = query name in match res with | ( name , Some k ) -> finalize ( Some ( name , k ) ) | ( _ , None ) -> match parent_name with |... |
let search_within_ancestry finalize query ? parent_name name = search_within_ancestry ( finalize , name , query ) ? parent_name name |
let rec assoc_comments_text_elements parent_name module_list t_ele = match t_ele with | Raw _ | CodePre _ | Latex _ | Verbatim _ -> t_ele | Bold t -> Bold ( assoc_comments_text parent_name module_list t ) | Italic t -> Italic ( assoc_comments_text parent_name module_list t ) | Center t -> Center... |
let rec assoc_comments_module_element parent_name module_list m_ele = match m_ele with Element_module m -> Element_module ( assoc_comments_module module_list m ) | Element_module_type mt -> Element_module_type ( assoc_comments_module_type module_list mt ) | Element_included_module _ -> m_ele | Element_c... |
let associate_type_of_elements_in_comments module_list = List . map ( assoc_comments_module module_list ) module_list |
let associate module_list = get_alias_names module_list ; init_known_elements_map module_list ; let rec remove_doubles acc = function [ ] -> acc | h :: q -> if List . mem h acc then remove_doubles acc q else remove_doubles ( h :: acc ) q in let rec iter incomplete_modules = let ( b_modif , rem... |
type ' a dag = { mutable dag : ' a node array } { mutable pare : idag list ; valu : ' a ; mutable chil : idag list } ; ; |
type ' a table = { mutable table : ' a data array array } ; ; |
let new_span_id = let i = ref 0 in fun ( ) -> incr i ; span_id_of_int ! i ; ; |
let new_ghost_id = let i = ref 0 in fun ( ) -> incr i ; ghost_id_of_int ! i ; ; |
type align = LeftA | CenterA | RightA ; ; |
type table_data = TDstring of string | TDhr of align ; ; |
let html_table_struct indi_txt phony d t = let phony = function Elem e -> phony d . dag . ( int_of_idag e ) | Ghost _ -> false | Nothing -> true in let elem_txt = function Elem e -> indi_txt d . dag . ( int_of_idag e ) | Ghost _ -> " " | | Nothing -> " & nbsp ; " in let bar_tx... |
let ancestors d = let rec loop i = if i = Array . length d . dag then [ ] else let n = d . dag . ( i ) in if n . pare = [ ] then idag_of_int i :: loop ( i + 1 ) else loop ( i + 1 ) in loop 0 ; ; |
let get_children d parents = let merge_children children el = List . fold_right ( fun ( x , _ ) children -> match x with Elem e -> let e = d . dag . ( int_of_idag e ) in List . fold_right ( fun c children -> if List . mem c children then children else c :: children ) e . chil childre... |
let rec get_block t i j = if j = Array . length t . table . ( i ) then None else if j = Array . length t . table . ( i ) - 1 then let x = t . table . ( i ) . ( j ) in Some ( [ x . elem , 1 ] , 1 , x . span ) else let x = t . table . ( i ) . ( j ) ... |
let group_by_common_children d list = let module O = struct type t = idag ; ; let compare ( x : t ) y = compare x y ; ; end in let module S = Set . Make ( O ) in let nlcsl = List . map ( fun id -> let n = d . dag . ( int_of_idag id ) in let cs = List . fold_right S . add n . ... |
let copy_data d = { elem = d . elem ; span = d . span } ; ; |
let insert_columns t nb j = let t1 = Array . make ( Array . length t . table ) [ | ] | in for i = 0 to Array . length t . table - 1 do let line = t . table . ( i ) in let line1 = Array . make ( Array . length line + nb ) line . ( 0 ) in t1 . ( i ) <- line1 ; ... |
let rec gcd a b = if a < b then gcd b a else if b = 0 then a else gcd b ( a mod b ) ; ; |
let treat_new_row d t = let i = Array . length t . table - 1 in let rec loop t i j = match get_block t i j with Some ( parents , max_parent_colspan , _span ) -> let children = get_children d parents in let children = if children = [ ] then [ { elem = Nothing ; span = new_span_id ( ) ... |
let down_it t i k = t . table . ( Array . length t . table - 1 ) . ( k ) <- t . table . ( i ) . ( k ) ; for r = i to Array . length t . table - 2 do t . table . ( r ) . ( k ) <- { elem = Ghost ( new_ghost_id ( ) ) ; span = new_span_id ( ) } ... |
let equilibrate t = let ilast = Array . length t . table - 1 in let last = t . table . ( ilast ) in let len = Array . length last in let rec loop j = if j = len then ( ) else match last . ( j ) . elem with Elem x -> let rec loop1 i = if i = ilast then loop ( j + 1 ) else let r... |
let group_elem t = for i = 0 to Array . length t . table - 2 do for j = 1 to Array . length t . table . ( 0 ) - 1 do match t . table . ( i + 1 ) . ( j - 1 ) . elem , t . table . ( i + 1 ) . ( j ) . elem with Elem x , Elem y when x = y -> t . table . ... |
let group_ghost t = for i = 0 to Array . length t . table - 2 do for j = 1 to Array . length t . table . ( 0 ) - 1 do begin match t . table . ( i + 1 ) . ( j - 1 ) . elem , t . table . ( i + 1 ) . ( j ) . elem with Ghost x , Ghost _ -> if t . table .... |
let group_children t = for i = 0 to Array . length t . table - 1 do let line = t . table . ( i ) in let len = Array . length line in for j = 1 to len - 1 do if line . ( j ) . elem = line . ( j - 1 ) . elem && line . ( j ) . elem <> Nothing then line . ( j ) . ... |
let group_span_by_common_children d t = let module O = struct type t = idag ; ; let compare ( x : t ) y = compare x y ; ; end in let module S = Set . Make ( O ) in let i = Array . length t . table - 1 in let line = t . table . ( i ) in let rec loop j cs = if j = Array . lengt... |
let find_same_parents t i j1 j2 j3 j4 = let rec loop i j1 j2 j3 j4 = if i = 0 then i , j1 , j2 , j3 , j4 else let x1 = t . ( i - 1 ) . ( j1 ) in let x2 = t . ( i - 1 ) . ( j2 ) in let x3 = t . ( i - 1 ) . ( j3 ) in let x4 = t . ( i - 1 ) . ( j4 ) i... |
let find_linked_children t i j1 j2 j3 j4 = let rec loop i j1 j2 j3 j4 = if i = Array . length t - 1 then j1 , j2 , j3 , j4 else let x1 = t . ( i ) . ( j1 ) in let x2 = t . ( i ) . ( j2 ) in let x3 = t . ( i ) . ( j3 ) in let x4 = t . ( i ) . ( j4 ) in let... |
let mirror_block t i1 i2 j1 j2 = for i = i1 to i2 do let line = t . ( i ) in let rec loop j1 j2 = if j1 >= j2 then ( ) else let v = line . ( j1 ) in line . ( j1 ) <- line . ( j2 ) ; line . ( j2 ) <- v ; loop ( j1 + 1 ) ( j2 - 1 ) in loop j1 j2 done ; ; |
let exch_blocks t i1 i2 j1 j2 j3 j4 = for i = i1 to i2 do let line = t . ( i ) in let saved = Array . copy line in for j = j1 to j2 do line . ( j4 - j2 + j ) <- saved . ( j ) done ; for j = j3 to j4 do line . ( j1 - j3 + j ) <- saved . ( j ) done done ; ; |
let find_block_with_parents t i jj1 jj2 jj3 jj4 = let rec loop ii jj1 jj2 jj3 jj4 = let ( nii , njj1 , njj2 , njj3 , njj4 ) = find_same_parents t i jj1 jj2 jj3 jj4 in if nii <> ii || njj1 <> jj1 || njj2 <> jj2 || njj3 <> jj3 || njj4 <> jj4 then let nii = min ii nii in let ( jj1 , jj2 , jj... |
let push_to_right t i j1 j2 = let line = t . ( i ) in let rec loop j = if j = j2 then j - 1 else let ini_jj1 = match line . ( j - 1 ) . elem with Nothing -> j - 1 | x -> let rec same_value j = if j < 0 then 0 else if line . ( j ) . elem = x then same_value ( j - 1 ) else j... |
let push_to_left t i j1 j2 = let line = t . ( i ) in let rec loop j = if j = j1 then j + 1 else let jj1 = match line . ( j ) . elem with Nothing -> j | x -> let rec same_value j = if j < 0 then 0 else if line . ( j ) . elem = x then same_value ( j - 1 ) else j + 1 in same_va... |
let fill_gap t i j1 j2 = let t1 = let t1 = Array . copy t . table in for i = 0 to Array . length t . table - 1 do t1 . ( i ) <- Array . copy t . table . ( i ) ; for j = 0 to Array . length t1 . ( i ) - 1 do t1 . ( i ) . ( j ) <- copy_data t . table . ( i ... |
let treat_gaps t = let i = Array . length t . table - 1 in let rec loop t j = let line = t . table . ( i ) in if j = Array . length line then t else match line . ( j ) . elem with Elem _ as y -> if y = line . ( j - 1 ) . elem then loop t ( j + 1 ) else let rec loop1 t j1 ... |
let group_span_last_row t = let row = t . table . ( Array . length t . table - 1 ) in let rec loop i = if i >= Array . length row then ( ) else begin begin match row . ( i ) . elem with Elem _ | Ghost _ as x -> if x = row . ( i - 1 ) . elem then row . ( i ) . span ... |
let has_phony_children phony d t = let line = t . table . ( Array . length t . table - 1 ) in let rec loop j = if j = Array . length line then false else match line . ( j ) . elem with Elem x -> if phony d . dag . ( int_of_idag x ) then true else loop ( j + 1 ) | _ -> loop ... |
let tablify phony no_optim no_group d = let a = ancestors d in let r = group_by_common_children d a in let t = { table = [ | Array . of_list r ] } | in let rec loop t = let ( t , new_row ) = treat_new_row d t in if List . for_all ( fun x -> x . elem = Nothing ) new_row then t else let... |
let fall t = for i = 1 to Array . length t . table - 1 do let line = t . table . ( i ) in let rec loop j = if j = Array . length line then ( ) else match line . ( j ) . elem with Ghost x -> let j2 = let rec loop j = if j = Array . length line then j - 1 else match line . ( ... |
let fall2_cool_right t i1 i2 _i3 j1 j2 = let span = t . table . ( i2 - 1 ) . ( j1 ) . span in for i = i2 - 1 downto 0 do for j = j1 to j2 - 1 do t . table . ( i ) . ( j ) <- if i - i2 + i1 >= 0 then t . table . ( i - i2 + i1 ) . ( j ) else { elem = Nothi... |
let fall2_cool_left t i1 i2 _i3 j1 j2 = let span = t . table . ( i2 - 1 ) . ( j2 ) . span in for i = i2 - 1 downto 0 do for j = j1 + 1 to j2 do t . table . ( i ) . ( j ) <- if i - i2 + i1 >= 0 then t . table . ( i - i2 + i1 ) . ( j ) else { elem = Nothin... |
let do_fall2_right t i1 i2 j1 j2 = let i3 = let rec loop_i i = if i < 0 then 0 else let rec loop_j j = if j = Array . length t . table . ( i ) then loop_i ( i - 1 ) else match t . table . ( i ) . ( j ) . elem with Nothing -> loop_j ( j + 1 ) | _ -> i + 1 in loop_j j2 ... |
let do_fall2_left t i1 i2 j1 j2 = let i3 = let rec loop_i i = if i < 0 then 0 else let rec loop_j j = if j < 0 then loop_i ( i - 1 ) else match t . table . ( i ) . ( j ) . elem with Nothing -> loop_j ( j - 1 ) | _ -> i + 1 in loop_j j1 in loop_i ( Array . length t . tabl... |
let do_shorten_too_long t i1 j1 j2 = for i = i1 to Array . length t . table - 2 do for j = j1 to j2 - 1 do t . table . ( i ) . ( j ) <- t . table . ( i + 1 ) . ( j ) done done ; let i = Array . length t . table - 1 in for j = j1 to j2 - 1 do t . table . ( i ) ... |
let try_fall2_right t i j = match t . table . ( i ) . ( j ) . elem with Ghost _ -> let i1 = let rec loop i = if i < 0 then 0 else match t . table . ( i ) . ( j ) . elem with Ghost _ -> loop ( i - 1 ) | _ -> i + 1 in loop ( i - 1 ) in let separated1 = let rec l... |
let try_fall2_left t i j = match t . table . ( i ) . ( j ) . elem with Ghost _ -> let i1 = let rec loop i = if i < 0 then 0 else match t . table . ( i ) . ( j ) . elem with Ghost _ -> loop ( i - 1 ) | _ -> i + 1 in loop ( i - 1 ) in let separated1 = let rec lo... |
let try_shorten_too_long t i j = match t . table . ( i ) . ( j ) . elem with Ghost _ -> let j2 = let x = t . table . ( i ) . ( j ) . span in let rec loop j2 = if j2 = Array . length t . table . ( i ) then j2 else match t . table . ( i ) . ( j2 ) with { el... |
let fall2_right t = let rec loop_i i t = if i <= 0 then t else let rec loop_j j t = if j < 0 then loop_i ( i - 1 ) t else match try_fall2_right t i j with Some t -> loop_i ( Array . length t . table - 1 ) t | None -> loop_j ( j - 1 ) t in loop_j ( Array . length t . table . ( i... |
let fall2_left t = let rec loop_i i t = if i <= 0 then t else let rec loop_j j t = if j >= Array . length t . table . ( i ) then loop_i ( i - 1 ) t else match try_fall2_left t i j with Some t -> loop_i ( Array . length t . table - 1 ) t | None -> loop_j ( j + 1 ) t in loop_j 1 ... |
let shorten_too_long t = let rec loop_i i t = if i <= 0 then t else let rec loop_j j t = if j >= Array . length t . table . ( i ) then loop_i ( i - 1 ) t else match try_shorten_too_long t i j with Some t -> loop_i ( Array . length t . table - 1 ) t | None -> loop_j ( j + 1 ) t i... |
let top_adjust t = let di = let rec loop i = if i = Array . length t . table then i else let rec loop_j j = if j = Array . length t . table . ( i ) then loop ( i + 1 ) else if t . table . ( i ) . ( j ) . elem <> Nothing then i else loop_j ( j + 1 ) in loop_j 0 in loop 0... |
let bottom_adjust t = let last_i = let rec loop i = if i < 0 then i else let rec loop_j j = if j = Array . length t . table . ( i ) then loop ( i - 1 ) else if t . table . ( i ) . ( j ) . elem <> Nothing then i else loop_j ( j + 1 ) in loop_j 0 in loop ( Array . length... |
let invert_dag d = let d = { dag = Array . copy d . dag } in for i = 0 to Array . length d . dag - 1 do let n = d . dag . ( i ) in d . dag . ( i ) <- { pare = List . map ( fun x -> x ) n . chil ; valu = n . valu ; chil = List . map ( fun x -> x ) n . par... |
let invert_table t = let t ' = { table = Array . copy t . table } in let len = Array . length t . table in for i = 0 to len - 1 do t ' . table . ( i ) <- Array . init ( Array . length t . table . ( 0 ) ) ( fun j -> let d = t . table . ( len - 1 - i ) . ... |
let table_of_dag phony no_optim invert no_group d = let d = if invert then invert_dag d else d in let t = tablify phony no_optim no_group d in let t = if invert then invert_table t else t in fall t ; let t = fall2_right t in let t = fall2_left t in let t = shorten_too_long t in let t = top_adjust t in let t ... |
let phony _ = false ; ; |
let indi_txt n = n . valu ; ; |
let string_table border hts = let buf = Buffer . create 30 in Printf . bprintf buf " < center >< table border =% d " border ; Printf . bprintf buf " cellspacing = 0 cellpadding = 0 >\ n " ; for i = 0 to Array . length hts - 1 do Printf . bprintf buf " < tr >\ n " ; for j = ... |
let invert = ref false ; ; |
let border = ref 0 ; ; |
let no_optim = ref false ; ; |
let no_group = ref false ; ; |
let html_of_dag d = let t = table_of_dag phony ! no_optim ! invert ! no_group d in let hts = html_table_struct indi_txt phony d t in string_table ! border hts ; ; |
let create_class_dag cl_list clt_list = let module M = Odoc_info . Class in let cl_list2 = List . map ( fun c -> ( c . M . cl_name , Some ( M . Cl c ) ) ) cl_list in let clt_list2 = List . map ( fun ct -> ( ct . M . clt_name , Some ( M . Cltype ( ct , [ ] ) ) ) ... |
let set_to_list s = let l = ref [ ] in String . Set . iter ( fun e -> l := e :: ! l ) s ; ! l |
let impl_dependencies ast = Depend . free_structure_names := String . Set . empty ; Depend . add_use_file String . Map . empty [ Parsetree . Ptop_def ast ] ; set_to_list ! Depend . free_structure_names |
let intf_dependencies ast = Depend . free_structure_names := String . Set . empty ; Depend . add_signature String . Map . empty ast ; set_to_list ! Depend . free_structure_names |
module Dep = struct type id = string let set_to_list s = let l = ref [ ] in String . Set . iter ( fun e -> l := e :: ! l ) s ; ! l type node = { id : id ; mutable near : String . Set . t ; mutable far : ( id * String . Set . t ) list ; reflex : bool ; } type graph =... |
let type_deps t = let module T = Odoc_type in let l = ref [ ] in let re = Str . regexp " ( [ \\ A - Z ] ( [ \\ a - zA - Z_ ' 0 - 9 ] ) . ) ( [ \\*\\\\+\\ a - z ] [ a - zA - Z_ ' 0 - 9 ] ) " *\\ in let f s = let s2 = Str . matched_string s in l := s2 ... |
let kernel_deps_of_modules modules = let graph = List . map ( fun m -> Dep . make_node m . Module . m_name m . Module . m_top_deps ) modules in let k = Dep . kernel graph in List . iter ( fun m -> let node = Dep . get_node k m . Module . m_name in m . Module . m_top_deps <- List .... |
let deps_of_types ( ? kernel = false ) types = let deps_pre = List . map ( fun t -> ( t , type_deps t ) ) types in if kernel then ( let graph = List . map ( fun ( t , names ) -> Dep . make_node t . Type . ty_name names ) deps_pre in let k = Dep . kernel graph in List . ma... |
let dot_include_all = ref false |
let dot_types = ref false |
let dot_reduce = ref false |
let dot_colors = ref ( List . flatten Odoc_messages . default_dot_colors ) |
module Generator = struct object ( self ) val mutable loc_colors = [ ] val mutable modules = [ ] val mutable colors = ! dot_colors method header = " digraph G { \ n " ^ " size " =\ 10 , 7 . 5 " ; \\ n " ^ " ratio " =\ fill " ; \\ n " ^ " rotate = 90 ; \ ... |
module type Dot_generator = module type of Generator |
type env_element = Name . t * Name . t |
type env = { env_values : env_element list ; env_types : env_element list ; env_class_types : env_element list ; env_classes : env_element list ; env_modules : env_element list ; env_module_types : env_element list ; env_extensions : env_element list ; } |
let empty = { env_values = [ ] ; env_types = [ ] ; env_class_types = [ ] ; env_classes = [ ] ; env_modules = [ ] ; env_module_types = [ ] ; env_extensions = [ ] ; } |
let rec add_signature env root ? rel signat = let qualify id = Name . concat root ( Name . from_ident id ) in let rel_name id = let n = Name . from_ident id in match rel with None -> n | Some r -> Name . concat r n in let f env item = match item with Types . Sig_value ( ident , _ , _ ) ... |
let add_extension env full_name = let simple_name = Name . simple full_name in { env with env_extensions = ( simple_name , full_name ) :: env . env_extensions } |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.