From d241ea0bd380b55bc615cea3544436d393413263 Mon Sep 17 00:00:00 2001 From: c-cube Date: Mon, 5 May 2025 14:16:16 +0000 Subject: [PATCH] deploy: d9307e4c2cdc1dbcd40c82897076c635582fcf42 --- .nojekyll | 0 _config.yml | 2 - _odoc-theme/fonts/DejaVuSansMono-Bold.woff2 | Bin 0 -> 143796 bytes .../fonts/DejaVuSansMono-BoldOblique.woff2 | Bin 0 -> 108228 bytes .../fonts/DejaVuSansMono-Oblique.woff2 | Bin 0 -> 107524 bytes _odoc-theme/fonts/DejaVuSansMono.woff2 | Bin 0 -> 145192 bytes _odoc-theme/fonts/PTC55F.woff2 | Bin 0 -> 100356 bytes _odoc-theme/fonts/PTC75F.woff2 | Bin 0 -> 98748 bytes _odoc-theme/fonts/PTS55F.woff2 | Bin 0 -> 125592 bytes _odoc-theme/fonts/PTS56F.woff2 | Bin 0 -> 118632 bytes _odoc-theme/fonts/PTS75F.woff2 | Bin 0 -> 131372 bytes _odoc-theme/fonts/PTS76F.woff2 | Bin 0 -> 92600 bytes _odoc-theme/fonts/fonts.css | 59 + _odoc-theme/manual.css | 376 + _odoc-theme/odoc.css | 334 + _odoc-theme/theme.css | 34 + fonts/KaTeX_AMS-Regular.woff2 | Bin 0 -> 28076 bytes fonts/KaTeX_Caligraphic-Bold.woff2 | Bin 0 -> 6912 bytes fonts/KaTeX_Caligraphic-Regular.woff2 | Bin 0 -> 6908 bytes fonts/KaTeX_Fraktur-Bold.woff2 | Bin 0 -> 11348 bytes fonts/KaTeX_Fraktur-Regular.woff2 | Bin 0 -> 11316 bytes fonts/KaTeX_Main-Bold.woff2 | Bin 0 -> 25324 bytes fonts/KaTeX_Main-BoldItalic.woff2 | Bin 0 -> 16780 bytes fonts/KaTeX_Main-Italic.woff2 | Bin 0 -> 16988 bytes fonts/KaTeX_Main-Regular.woff2 | Bin 0 -> 26272 bytes fonts/KaTeX_Math-BoldItalic.woff2 | Bin 0 -> 16400 bytes fonts/KaTeX_Math-Italic.woff2 | Bin 0 -> 16440 bytes fonts/KaTeX_SansSerif-Bold.woff2 | Bin 0 -> 12216 bytes fonts/KaTeX_SansSerif-Italic.woff2 | Bin 0 -> 12028 bytes fonts/KaTeX_SansSerif-Regular.woff2 | Bin 0 -> 10344 bytes fonts/KaTeX_Script-Regular.woff2 | Bin 0 -> 9644 bytes fonts/KaTeX_Size1-Regular.woff2 | Bin 0 -> 5468 bytes fonts/KaTeX_Size2-Regular.woff2 | Bin 0 -> 5208 bytes fonts/KaTeX_Size3-Regular.woff2 | Bin 0 -> 3624 bytes fonts/KaTeX_Size4-Regular.woff2 | Bin 0 -> 4928 bytes fonts/KaTeX_Typewriter-Regular.woff2 | Bin 0 -> 13568 bytes fonts/fira-mono-v14-latin-500.woff2 | Bin 0 -> 16148 bytes fonts/fira-mono-v14-latin-regular.woff2 | Bin 0 -> 16284 bytes fonts/fira-sans-v17-latin-500.woff2 | Bin 0 -> 24020 bytes fonts/fira-sans-v17-latin-500italic.woff2 | Bin 0 -> 24896 bytes fonts/fira-sans-v17-latin-700.woff2 | Bin 0 -> 24964 bytes fonts/fira-sans-v17-latin-700italic.woff2 | Bin 0 -> 26072 bytes fonts/fira-sans-v17-latin-italic.woff2 | Bin 0 -> 24936 bytes fonts/fira-sans-v17-latin-regular.woff2 | Bin 0 -> 23880 bytes fonts/noticia-text-v15-latin-700.woff2 | Bin 0 -> 21972 bytes fonts/noticia-text-v15-latin-italic.woff2 | Bin 0 -> 17356 bytes fonts/noticia-text-v15-latin-regular.woff2 | Bin 0 -> 22308 bytes highlight.pack.js | 634 + hmap/Hmap/Key/index.html | 2 + hmap/Hmap/Make/Key/index.html | 2 + hmap/Hmap/Make/argument-1-Key_info/index.html | 2 + hmap/Hmap/Make/index.html | 2 + hmap/Hmap/index.html | 2 + hmap/Hmap/module-type-KEY_INFO/index.html | 2 + hmap/Hmap/module-type-S/Key/index.html | 2 + hmap/Hmap/module-type-S/index.html | 2 + hmap/_doc-dir/CHANGES.md | 9 + hmap/_doc-dir/LICENSE.md | 13 + hmap/_doc-dir/README.md | 43 + hmap/index.html | 2 + index.html | 2 + iostream/Iostream/In/class-empty/index.html | 2 + .../Iostream/In/class-of_bytes/index.html | 2 + .../In/class-of_in_channel/index.html | 2 + .../Iostream/In/class-of_string/index.html | 2 + .../Iostream/In/class-open_file/index.html | 2 + iostream/Iostream/In/class-type-t/index.html | 2 + .../In/class-type-t_seekable/index.html | 2 + iostream/Iostream/In/index.html | 18 + .../In_buf/class-bufferized/index.html | 2 + .../Iostream/In_buf/class-of_bytes/index.html | 2 + .../In_buf/class-of_in_channel/index.html | 2 + .../In_buf/class-of_string/index.html | 2 + .../In_buf/class-open_file/index.html | 2 + .../In_buf/class-t_from_refill/index.html | 2 + .../Iostream/In_buf/class-type-t/index.html | 2 + iostream/Iostream/In_buf/index.html | 18 + iostream/Iostream/Out/class-dummy/index.html | 2 + .../Iostream/Out/class-map_char/index.html | 2 + .../Iostream/Out/class-of_buffer/index.html | 2 + .../Out/class-of_out_channel/index.html | 2 + iostream/Iostream/Out/class-type-t/index.html | 2 + .../Out/class-type-t_seekable/index.html | 2 + iostream/Iostream/Out/index.html | 13 + .../Out_buf/class-bufferized/index.html | 2 + .../Iostream/Out_buf/class-dummy/index.html | 2 + .../Out_buf/class-of_buffer/index.html | 2 + .../Out_buf/class-of_out_channel/index.html | 2 + .../Out_buf/class-open_file/index.html | 2 + .../Out_buf/class-t_from_output/index.html | 2 + .../Iostream/Out_buf/class-type-t/index.html | 2 + .../Out_buf/class-type-t_seekable/index.html | 2 + iostream/Iostream/Out_buf/index.html | 20 + .../Iostream/Seekable/class-type-t/index.html | 2 + iostream/Iostream/Seekable/index.html | 2 + iostream/Iostream/Slice/index.html | 2 + iostream/Iostream/index.html | 2 + iostream/Iostream__/index.html | 2 + iostream/Iostream__In/index.html | 2 + iostream/Iostream__In_buf/index.html | 2 + iostream/Iostream__Out/index.html | 2 + iostream/Iostream__Out_buf/index.html | 2 + iostream/Iostream__Seekable/index.html | 2 + iostream/Iostream__Slice/index.html | 2 + .../Iostream_types/In/class-type-t/index.html | 2 + .../In/class-type-t_seekable/index.html | 2 + iostream/Iostream_types/In/index.html | 2 + .../In_buf/class-type-t/index.html | 2 + iostream/Iostream_types/In_buf/index.html | 2 + .../Out/class-type-t/index.html | 2 + .../Out/class-type-t_seekable/index.html | 2 + iostream/Iostream_types/Out/index.html | 2 + .../Out_buf/class-type-t/index.html | 2 + .../Out_buf/class-type-t_seekable/index.html | 2 + iostream/Iostream_types/Out_buf/index.html | 2 + .../Seekable/class-type-t/index.html | 2 + iostream/Iostream_types/Seekable/index.html | 2 + iostream/Iostream_types/Slice/index.html | 2 + iostream/Iostream_types/index.html | 2 + iostream/Iostream_unix/In/index.html | 2 + iostream/Iostream_unix/Out/index.html | 2 + iostream/Iostream_unix/index.html | 2 + iostream/_doc-dir/CHANGES.md | 28 + iostream/_doc-dir/README.md | 20 + iostream/index.html | 2 + katex.min.css | 1 + katex.min.js | 1 + .../Nanoev_picos/Background_thread/index.html | 2 + nanoev-picos/Nanoev_picos/Base/Raw/index.html | 2 + nanoev-picos/Nanoev_picos/Base/index.html | 2 + .../Nanoev_picos/Global_ev/index.html | 2 + .../IO_in/class-type-t/index.html | 2 + nanoev-picos/Nanoev_picos/IO_in/index.html | 6 + .../IO_out/class-type-t/index.html | 2 + nanoev-picos/Nanoev_picos/IO_out/index.html | 8 + .../Nanoev_picos/Net_client/index.html | 2 + .../Nanoev_picos/Net_server/index.html | 17 + nanoev-picos/Nanoev_picos/index.html | 2 + nanoev-picos/Nanoev_picos__/index.html | 2 + .../index.html | 2 + nanoev-picos/Nanoev_picos__Base/index.html | 2 + nanoev-picos/Nanoev_picos__Common_/index.html | 2 + .../Nanoev_picos__Global_ev/index.html | 2 + nanoev-picos/Nanoev_picos__IO_in/index.html | 2 + nanoev-picos/Nanoev_picos__IO_out/index.html | 2 + .../Nanoev_picos__Net_client/index.html | 2 + .../Nanoev_picos__Net_server/index.html | 2 + nanoev-picos/_doc-dir/README.md | 34 + nanoev-picos/index.html | 2 + nanoev-posix/Nanoev_posix/index.html | 14 + nanoev-posix/Nanoev_posix__/index.html | 2 + nanoev-posix/_doc-dir/README.md | 34 + nanoev-posix/index.html | 2 + nanoev/Nanoev/Impl/index.html | 12 + nanoev/Nanoev/index.html | 14 + nanoev/Nanoev__/index.html | 2 + nanoev/Nanoev__Trace_/index.html | 2 + nanoev/Nanoev_unix/index.html | 14 + nanoev/Nanoev_unix__/index.html | 2 + nanoev/_doc-dir/README.md | 34 + nanoev/index.html | 2 + .../Nanoev_tiny_httpd/index.html | 15 + nanoev_tiny_httpd/_doc-dir/README.md | 34 + nanoev_tiny_httpd/index.html | 2 + ocaml/Afl_instrument/index.html | 5 + ocaml/Alias_analysis/index.html | 10 + ocaml/Allocated_const/index.html | 2 + ocaml/Annot/index.html | 2 + ocaml/Arch/index.html | 14 + .../Make/argument-1-S/Key/Map/index.html | 8 + .../Make/argument-1-S/Key/index.html | 2 + .../Make/argument-1-S/Value/index.html | 2 + ocaml/Arg_helper/Make/argument-1-S/index.html | 2 + ocaml/Arg_helper/Make/index.html | 2 + ocaml/Arg_helper/index.html | 2 + ocaml/Asmgen/index.html | 20 + ocaml/Asmlibrarian/index.html | 2 + ocaml/Asmlink/index.html | 10 + ocaml/Asmpackager/index.html | 8 + ocaml/Ast_helper/Attr/index.html | 2 + ocaml/Ast_helper/Cf/index.html | 44 + ocaml/Ast_helper/Ci/index.html | 12 + ocaml/Ast_helper/Cl/index.html | 47 + ocaml/Ast_helper/Const/index.html | 6 + ocaml/Ast_helper/Csig/index.html | 5 + ocaml/Ast_helper/Cstr/index.html | 5 + ocaml/Ast_helper/Ctf/index.html | 37 + ocaml/Ast_helper/Cty/index.html | 30 + ocaml/Ast_helper/Exp/index.html | 181 + ocaml/Ast_helper/Incl/index.html | 7 + ocaml/Ast_helper/Mb/index.html | 9 + ocaml/Ast_helper/Md/index.html | 9 + ocaml/Ast_helper/Mod/index.html | 40 + ocaml/Ast_helper/Ms/index.html | 9 + ocaml/Ast_helper/Mtd/index.html | 9 + ocaml/Ast_helper/Mty/index.html | 31 + ocaml/Ast_helper/Of/index.html | 11 + ocaml/Ast_helper/Opn/index.html | 8 + ocaml/Ast_helper/Pat/index.html | 66 + ocaml/Ast_helper/Rf/index.html | 12 + ocaml/Ast_helper/Sig/index.html | 43 + ocaml/Ast_helper/Str/index.html | 42 + ocaml/Ast_helper/Te/index.html | 39 + ocaml/Ast_helper/Typ/index.html | 64 + ocaml/Ast_helper/Type/index.html | 29 + ocaml/Ast_helper/Val/index.html | 9 + ocaml/Ast_helper/Vb/index.html | 10 + ocaml/Ast_helper/index.html | 2 + ocaml/Ast_invariants/index.html | 2 + ocaml/Ast_iterator/index.html | 6 + ocaml/Ast_mapper/index.html | 81 + ocaml/Asttypes/index.html | 2 + ocaml/Attr_helper/index.html | 5 + .../Definition/index.html | 2 + .../Make/argument-1-_/index.html | 5 + .../Augment_specialised_args/Make/index.html | 11 + .../What_to_specialise/index.html | 7 + ocaml/Augment_specialised_args/index.html | 2 + .../module-type-S/index.html | 5 + ocaml/Backend_intf/index.html | 2 + ocaml/Backend_intf/module-type-S/index.html | 2 + ocaml/Backend_var/Provenance/index.html | 6 + ocaml/Backend_var/With_provenance/index.html | 2 + ocaml/Backend_var/index.html | 2 + ocaml/Binutils/index.html | 2 + .../Make/argument-1-T/Cond_branch/index.html | 2 + .../Make/argument-1-T/index.html | 5 + ocaml/Branch_relaxation/Make/index.html | 2 + ocaml/Branch_relaxation/index.html | 2 + ocaml/Branch_relaxation_intf/index.html | 2 + .../module-type-S/Cond_branch/index.html | 2 + .../module-type-S/index.html | 5 + ocaml/Btype/For_copy/index.html | 2 + ocaml/Btype/TransientTypeMap/index.html | 8 + ocaml/Btype/TypeHash/index.html | 2 + ocaml/Btype/TypeMap/index.html | 10 + ocaml/Btype/TypePairs/index.html | 2 + ocaml/Btype/TypeSet/index.html | 2 + ocaml/Btype/index.html | 52 + ocaml/Build_export_info/index.html | 5 + ocaml/Build_path_prefix_map/index.html | 2 + ocaml/Builtin_attributes/index.html | 27 + ocaml/Bytegen/index.html | 8 + ocaml/Bytelibrarian/index.html | 2 + ocaml/Bytelink/Dep/index.html | 2 + ocaml/Bytelink/DepSet/index.html | 2 + ocaml/Bytelink/index.html | 3 + ocaml/Bytepackager/index.html | 7 + ocaml/Bytesections/Name/index.html | 2 + ocaml/Bytesections/index.html | 2 + ocaml/CSE/index.html | 2 + ocaml/CSEgen/class-cse_generic/index.html | 2 + ocaml/CSEgen/index.html | 2 + ocaml/CamlinternalFormat/index.html | 53 + ocaml/CamlinternalFormatBasics/index.html | 308 + ocaml/CamlinternalLazy/index.html | 2 + .../Convert/Simplified/index.html | 8 + .../CamlinternalMenhirLib/Convert/index.html | 13 + .../Engine/Make/argument-1-T/Log/index.html | 6 + .../Engine/Make/argument-1-T/index.html | 17 + .../Engine/Make/index.html | 40 + ocaml/CamlinternalMenhirLib/Engine/index.html | 9 + .../EngineTypes/index.html | 2 + .../EngineTypes/module-type-ENGINE/index.html | 35 + .../index.html | 2 + .../module-type-MONOLITHIC_ENGINE/index.html | 7 + .../module-type-TABLE/Log/index.html | 6 + .../EngineTypes/module-type-TABLE/index.html | 17 + .../ErrorReports/index.html | 13 + .../CamlinternalMenhirLib/General/index.html | 2 + .../IncrementalEngine/index.html | 2 + .../module-type-EVERYTHING/index.html | 18 + .../module-type-INCREMENTAL_ENGINE/index.html | 15 + .../module-type-INSPECTION/index.html | 2 + .../module-type-SYMBOLS/index.html | 2 + .../InfiniteArray/index.html | 2 + .../InspectionTableFormat/index.html | 2 + .../module-type-TABLES/index.html | 2 + .../Make/argument-1-TT/index.html | 5 + .../Make/argument-2-IT/index.html | 2 + .../Make/argument-3-ET/Log/index.html | 6 + .../Make/argument-3-ET/index.html | 17 + .../Make/argument-4-E/index.html | 2 + .../Make/index.html | 14 + .../Symbols/argument-1-T/index.html | 2 + .../Symbols/index.html | 2 + .../InspectionTableInterpreter/index.html | 20 + .../LexerUtil/index.html | 2 + .../LinearizedArray/index.html | 2 + .../PackedIntArray/index.html | 2 + .../Printers/Make/argument-1-I/index.html | 34 + .../Printers/Make/argument-2-User/index.html | 2 + .../Printers/Make/index.html | 2 + .../CamlinternalMenhirLib/Printers/index.html | 5 + .../RowDisplacement/index.html | 15 + .../StaticVersion/index.html | 2 + .../TableFormat/index.html | 2 + .../TableFormat/module-type-TABLES/index.html | 5 + .../MakeEngineTable/Log/index.html | 6 + .../MakeEngineTable/argument-1-T/index.html | 5 + .../MakeEngineTable/index.html | 17 + .../TableInterpreter/index.html | 10 + ocaml/CamlinternalMenhirLib/index.html | 2 + ocaml/CamlinternalMod/index.html | 2 + ocaml/CamlinternalOO/index.html | 18 + ocaml/Ccomp/index.html | 7 + ocaml/Clambda/index.html | 19 + ocaml/Clambda_primitives/index.html | 2 + ocaml/Clflags/Compiler_pass/index.html | 2 + ocaml/Clflags/Float_arg_helper/index.html | 2 + ocaml/Clflags/Int_arg_helper/index.html | 2 + ocaml/Clflags/index.html | 2 + ocaml/Closure/index.html | 6 + ocaml/Closure_conversion/index.html | 7 + ocaml/Closure_conversion_aux/Env/index.html | 2 + .../Function_decls/Function_decl/index.html | 10 + .../Function_decls/index.html | 2 + ocaml/Closure_conversion_aux/index.html | 2 + ocaml/Closure_element/Map/index.html | 17 + ocaml/Closure_element/Set/index.html | 2 + ocaml/Closure_element/T/index.html | 2 + ocaml/Closure_element/Tbl/index.html | 2 + ocaml/Closure_element/index.html | 2 + ocaml/Closure_id/Map/index.html | 17 + ocaml/Closure_id/Set/index.html | 2 + ocaml/Closure_id/T/index.html | 2 + ocaml/Closure_id/Tbl/index.html | 2 + ocaml/Closure_id/index.html | 2 + ocaml/Closure_middle_end/index.html | 7 + ocaml/Closure_offsets/index.html | 2 + ocaml/Closure_origin/Map/index.html | 17 + ocaml/Closure_origin/Set/index.html | 2 + ocaml/Closure_origin/T/index.html | 2 + ocaml/Closure_origin/Tbl/index.html | 2 + ocaml/Closure_origin/index.html | 2 + ocaml/Cmi_format/index.html | 2 + ocaml/Cmm/index.html | 30 + ocaml/Cmm_helpers/index.html | 324 + ocaml/Cmm_invariants/index.html | 2 + ocaml/Cmmgen/index.html | 6 + ocaml/Cmmgen_state/index.html | 2 + ocaml/Cmo_format/index.html | 2 + ocaml/Cmt2annot/index.html | 7 + ocaml/Cmt_format/index.html | 13 + ocaml/Cmx_format/index.html | 2 + ocaml/Cmxs_format/index.html | 2 + ocaml/Coloring/index.html | 2 + ocaml/Comballoc/index.html | 2 + ocaml/Compenv/index.html | 18 + ocaml/Compilation_unit/Map/index.html | 17 + ocaml/Compilation_unit/Set/index.html | 2 + ocaml/Compilation_unit/T/index.html | 2 + ocaml/Compilation_unit/Tbl/index.html | 2 + ocaml/Compilation_unit/index.html | 2 + ocaml/Compile/index.html | 12 + ocaml/Compile_common/index.html | 12 + ocaml/Compilenv/index.html | 8 + ocaml/Compmisc/index.html | 6 + ocaml/Compression/index.html | 2 + ocaml/Config/index.html | 2 + ocaml/Config_boot/index.html | 2 + ocaml/Config_main/index.html | 2 + .../argument-1-Module_name/Map/index.html | 8 + .../argument-1-Module_name/Set/index.html | 2 + .../argument-1-Module_name/Tbl/index.html | 2 + .../Make/argument-1-Module_name/index.html | 2 + ocaml/Consistbl/Make/index.html | 13 + ocaml/Consistbl/index.html | 2 + ocaml/Convert_primitives/index.html | 2 + ocaml/Ctype/Pattern_env/index.html | 2 + ocaml/Ctype/index.html | 185 + .../Dataflow/Backward/argument-1-D/index.html | 2 + ocaml/Dataflow/Backward/index.html | 7 + ocaml/Dataflow/index.html | 2 + ocaml/Dataflow/module-type-DOMAIN/index.html | 2 + ocaml/Datarepr/index.html | 19 + ocaml/Deadcode/index.html | 2 + ocaml/Debuginfo/Scoped_location/index.html | 2 + ocaml/Debuginfo/index.html | 2 + ocaml/Depend/index.html | 2 + .../Left_variadic/argument-1-_/index.html | 2 + ocaml/Diffing/Define/Left_variadic/index.html | 2 + .../Right_variadic/argument-1-_/index.html | 2 + .../Diffing/Define/Right_variadic/index.html | 2 + .../Define/Simple/argument-1-_/index.html | 2 + ocaml/Diffing/Define/Simple/index.html | 2 + ocaml/Diffing/Define/argument-1-D/index.html | 2 + ocaml/Diffing/Define/index.html | 6 + .../Define/module-type-Parameters/index.html | 2 + ocaml/Diffing/Define/module-type-S/index.html | 2 + ocaml/Diffing/index.html | 2 + ocaml/Diffing/module-type-Defs/index.html | 2 + .../Define/Simple/argument-1-_/index.html | 2 + .../Define/Simple/index.html | 2 + .../Define/argument-1-D/index.html | 2 + ocaml/Diffing_with_keys/Define/index.html | 2 + .../Define/module-type-Parameters/index.html | 2 + ocaml/Diffing_with_keys/index.html | 2 + ocaml/Dll/index.html | 2 + ocaml/Docstrings/WithMenhir/index.html | 9 + ocaml/Docstrings/index.html | 5 + ocaml/Domainstate/index.html | 2 + ocaml/Dynlink/index.html | 2 + ocaml/Effect_analysis/index.html | 2 + ocaml/Emit/index.html | 2 + ocaml/Emitaux/index.html | 11 + ocaml/Emitcode/index.html | 23 + ocaml/Emitenv/index.html | 2 + ocaml/Env/index.html | 313 + ocaml/Envaux/index.html | 2 + ocaml/Errors/index.html | 2 + ocaml/Errortrace/Subtype/index.html | 5 + ocaml/Errortrace/index.html | 11 + ocaml/Event/index.html | 2 + ocaml/Export_id/Map/index.html | 17 + ocaml/Export_id/Set/index.html | 2 + ocaml/Export_id/T/index.html | 2 + ocaml/Export_id/Tbl/index.html | 2 + ocaml/Export_id/index.html | 2 + ocaml/Export_info/index.html | 34 + ocaml/Export_info_for_pack/index.html | 6 + ocaml/Expunge/index.html | 2 + ocaml/Extract_projections/index.html | 6 + ocaml/Find_recursive_functions/index.html | 5 + .../Constant_defining_value/Map/index.html | 17 + .../Constant_defining_value/Set/index.html | 2 + .../Constant_defining_value/T/index.html | 2 + .../Constant_defining_value/Tbl/index.html | 2 + .../Constant_defining_value/index.html | 2 + ocaml/Flambda/With_free_variables/index.html | 2 + ocaml/Flambda/index.html | 106 + ocaml/Flambda_invariants/index.html | 2 + ocaml/Flambda_iterators/index.html | 95 + ocaml/Flambda_middle_end/index.html | 7 + ocaml/Flambda_to_clambda/index.html | 5 + ocaml/Flambda_utils/Switch_storer/index.html | 2 + ocaml/Flambda_utils/index.html | 53 + ocaml/Freshening/Project_var/index.html | 5 + ocaml/Freshening/index.html | 25 + .../Genprintval/Make/argument-1-O/index.html | 2 + .../Genprintval/Make/argument-2-_/index.html | 2 + ocaml/Genprintval/Make/index.html | 23 + ocaml/Genprintval/index.html | 2 + .../module-type-EVALPATH/index.html | 2 + ocaml/Genprintval/module-type-OBJ/index.html | 2 + ocaml/Genprintval/module-type-S/index.html | 23 + ocaml/Id_types/Id/index.html | 2 + ocaml/Id_types/UnitId/argument-1-_/index.html | 2 + .../argument-2-Compilation_unit/index.html | 2 + ocaml/Id_types/UnitId/index.html | 2 + ocaml/Id_types/index.html | 5 + ocaml/Id_types/module-type-BaseId/index.html | 2 + ocaml/Id_types/module-type-Id/index.html | 2 + .../Compilation_unit/index.html | 2 + ocaml/Id_types/module-type-UnitId/index.html | 2 + ocaml/Ident/Map/index.html | 17 + ocaml/Ident/Set/index.html | 2 + ocaml/Ident/T/index.html | 2 + ocaml/Ident/Tbl/index.html | 2 + ocaml/Ident/index.html | 2 + ocaml/Identifiable/Make/Map/index.html | 17 + ocaml/Identifiable/Make/Set/index.html | 2 + ocaml/Identifiable/Make/T/index.html | 2 + ocaml/Identifiable/Make/Tbl/index.html | 2 + .../Identifiable/Make/argument-1-T/index.html | 2 + ocaml/Identifiable/Make/index.html | 2 + .../Identifiable/Pair/argument-1-A/index.html | 2 + .../Identifiable/Pair/argument-2-B/index.html | 2 + ocaml/Identifiable/Pair/index.html | 2 + ocaml/Identifiable/index.html | 2 + .../Identifiable/module-type-Map/T/index.html | 2 + ocaml/Identifiable/module-type-Map/index.html | 17 + .../Identifiable/module-type-S/Map/index.html | 17 + .../Identifiable/module-type-S/Set/index.html | 2 + ocaml/Identifiable/module-type-S/T/index.html | 2 + .../Identifiable/module-type-S/Tbl/index.html | 2 + ocaml/Identifiable/module-type-S/index.html | 2 + .../Identifiable/module-type-Set/T/index.html | 2 + ocaml/Identifiable/module-type-Set/index.html | 2 + .../Identifiable/module-type-Tbl/T/index.html | 2 + ocaml/Identifiable/module-type-Tbl/index.html | 2 + .../Identifiable/module-type-Thing/index.html | 2 + ocaml/Import_approx/index.html | 2 + ocaml/Includeclass/index.html | 19 + ocaml/Includecore/index.html | 51 + ocaml/Includemod/Error/index.html | 13 + ocaml/Includemod/FieldMap/index.html | 8 + .../Functor_app_diff/Defs/index.html | 2 + ocaml/Includemod/Functor_app_diff/index.html | 6 + .../Functor_inclusion_diff/Defs/index.html | 2 + .../Functor_inclusion_diff/index.html | 6 + ocaml/Includemod/index.html | 79 + ocaml/Includemod_errorprinter/index.html | 2 + ocaml/Inconstant_idents/index.html | 6 + .../index.html | 4 + ocaml/Inline_and_simplify/index.html | 14 + ocaml/Inline_and_simplify_aux/Env/index.html | 17 + .../Inline_and_simplify_aux/Result/index.html | 5 + ocaml/Inline_and_simplify_aux/index.html | 26 + ocaml/Inlining_cost/Benefit/index.html | 2 + ocaml/Inlining_cost/Threshold/index.html | 2 + .../Whether_sufficient_benefit/index.html | 22 + ocaml/Inlining_cost/index.html | 7 + ocaml/Inlining_decision/index.html | 16 + ocaml/Inlining_decision_intf/index.html | 25 + ocaml/Inlining_stats/Closure_stack/index.html | 6 + ocaml/Inlining_stats/index.html | 5 + .../Inlining_stats_types/Decision/index.html | 2 + ocaml/Inlining_stats_types/Inlined/index.html | 3 + .../Not_inlined/index.html | 3 + .../Not_specialised/index.html | 3 + .../Inlining_stats_types/Prevented/index.html | 2 + .../Specialised/index.html | 3 + ocaml/Inlining_stats_types/index.html | 2 + ocaml/Inlining_transforms/index.html | 31 + ocaml/Instruct/index.html | 2 + .../index.html | 2 + ocaml/Interf/index.html | 2 + ocaml/Internal_variable_names/index.html | 2 + ocaml/Interval/index.html | 2 + ocaml/Invariant_params/index.html | 11 + ocaml/Lambda/index.html | 43 + ocaml/Lazy_backtrack/index.html | 6 + ocaml/Lexer/index.html | 7 + ocaml/Lift_code/index.html | 7 + ocaml/Lift_constants/index.html | 5 + .../Lift_let_to_initialize_symbol/index.html | 5 + ocaml/Linear/index.html | 7 + ocaml/Linear_format/index.html | 2 + ocaml/Linearize/index.html | 2 + ocaml/Linkage_name/Map/index.html | 17 + ocaml/Linkage_name/Set/index.html | 2 + ocaml/Linkage_name/T/index.html | 2 + ocaml/Linkage_name/Tbl/index.html | 2 + ocaml/Linkage_name/index.html | 2 + ocaml/Linscan/index.html | 2 + ocaml/Liveness/index.html | 2 + ocaml/Load_path/Dir/index.html | 2 + ocaml/Load_path/index.html | 9 + ocaml/Local_store/index.html | 2 + ocaml/Location/index.html | 42 + ocaml/Longident/index.html | 3 + ocaml/Mach/index.html | 13 + ocaml/Main/index.html | 2 + ocaml/Main_args/Default/Main/index.html | 2 + ocaml/Main_args/Default/Odoc_args/index.html | 2 + ocaml/Main_args/Default/Optmain/index.html | 2 + ocaml/Main_args/Default/Opttopmain/index.html | 2 + ocaml/Main_args/Default/Topmain/index.html | 2 + ocaml/Main_args/Default/index.html | 2 + .../argument-1-_/index.html | 2 + .../Make_bytecomp_options/index.html | 2 + .../argument-1-_/index.html | 2 + .../Main_args/Make_bytetop_options/index.html | 2 + .../argument-1-_/index.html | 2 + .../Make_ocamldoc_options/index.html | 2 + .../argument-1-_/index.html | 2 + .../Main_args/Make_optcomp_options/index.html | 2 + .../argument-1-_/index.html | 2 + .../Main_args/Make_opttop_options/index.html | 2 + ocaml/Main_args/index.html | 5 + .../Main_args/module-type-Arg_list/index.html | 2 + .../module-type-Bytecomp_options/index.html | 2 + .../module-type-Bytetop_options/index.html | 2 + .../module-type-Common_options/index.html | 2 + .../module-type-Compiler_options/index.html | 2 + .../module-type-Core_options/index.html | 2 + .../module-type-Ocamldoc_options/index.html | 2 + .../module-type-Optcommon_options/index.html | 2 + .../module-type-Optcomp_options/index.html | 2 + .../module-type-Opttop_options/index.html | 2 + .../module-type-Toplevel_options/index.html | 2 + ocaml/Maindriver/index.html | 2 + ocaml/Makedepend/index.html | 2 + ocaml/Matching/index.html | 52 + ocaml/Meta/index.html | 11 + ocaml/Misc/Color/index.html | 2 + ocaml/Misc/Error_style/index.html | 2 + ocaml/Misc/Int_literal_converter/index.html | 2 + ocaml/Misc/Magic_number/index.html | 17 + ocaml/Misc/Stdlib/Array/index.html | 2 + ocaml/Misc/Stdlib/List/index.html | 6 + ocaml/Misc/Stdlib/Option/index.html | 6 + ocaml/Misc/Stdlib/String/Map/index.html | 8 + ocaml/Misc/Stdlib/String/Set/index.html | 2 + ocaml/Misc/Stdlib/String/Tbl/index.html | 2 + ocaml/Misc/Stdlib/String/index.html | 2 + ocaml/Misc/Stdlib/index.html | 2 + ocaml/Misc/Style/index.html | 4 + ocaml/Misc/index.html | 36 + ocaml/Mtype/index.html | 29 + ocaml/Mutable_variable/Map/index.html | 17 + ocaml/Mutable_variable/Set/index.html | 2 + ocaml/Mutable_variable/T/index.html | 2 + ocaml/Mutable_variable/Tbl/index.html | 2 + ocaml/Mutable_variable/index.html | 8 + ocaml/Numbers/Float/Map/index.html | 17 + ocaml/Numbers/Float/Set/index.html | 2 + ocaml/Numbers/Float/T/index.html | 2 + ocaml/Numbers/Float/Tbl/index.html | 2 + ocaml/Numbers/Float/index.html | 2 + ocaml/Numbers/Int/Map/index.html | 17 + ocaml/Numbers/Int/Set/index.html | 2 + ocaml/Numbers/Int/T/index.html | 2 + ocaml/Numbers/Int/Tbl/index.html | 2 + ocaml/Numbers/Int/index.html | 2 + ocaml/Numbers/Int16/index.html | 2 + ocaml/Numbers/Int8/index.html | 2 + ocaml/Numbers/index.html | 2 + ocaml/Odoc/index.html | 2 + ocaml/Odoc_analyse/index.html | 5 + ocaml/Odoc_args/index.html | 2 + .../Odoc_ast/Analyser/argument-1-_/index.html | 6 + ocaml/Odoc_ast/Analyser/index.html | 7 + ocaml/Odoc_ast/Typedtree_search/index.html | 21 + ocaml/Odoc_ast/index.html | 2 + ocaml/Odoc_class/index.html | 11 + .../Basic_info_retriever/index.html | 6 + ocaml/Odoc_comments/index.html | 5 + .../module-type-Texter/index.html | 2 + ocaml/Odoc_comments_global/index.html | 2 + ocaml/Odoc_config/index.html | 2 + ocaml/Odoc_cross/index.html | 6 + ocaml/Odoc_dag2html/index.html | 5 + ocaml/Odoc_dep/index.html | 5 + ocaml/Odoc_dot/Generator/class-dot/index.html | 11 + ocaml/Odoc_dot/Generator/index.html | 2 + ocaml/Odoc_dot/index.html | 2 + .../class-dot/index.html | 11 + .../module-type-Dot_generator/index.html | 2 + ocaml/Odoc_env/index.html | 2 + ocaml/Odoc_exception/index.html | 2 + ocaml/Odoc_extension/index.html | 2 + .../Base_generator/class-generator/index.html | 2 + ocaml/Odoc_gen/Base_generator/index.html | 2 + .../class-type-doc_generator/index.html | 2 + ocaml/Odoc_gen/index.html | 12 + .../class-generator/index.html | 2 + ocaml/Odoc_gen/module-type-Base/index.html | 2 + .../argument-1-_/class-generator/index.html | 2 + .../argument-1-_/index.html | 2 + .../class-generator/index.html | 2 + .../module-type-Base_functor/index.html | 2 + .../argument-1-_/class-dot/index.html | 11 + .../argument-1-_/index.html | 2 + .../class-dot/index.html | 11 + .../module-type-Dot_functor/index.html | 2 + .../argument-1-_/class-html/index.html | 166 + .../argument-1-_/index.html | 2 + .../class-html/index.html | 166 + .../module-type-Html_functor/index.html | 2 + .../argument-1-_/class-latex/index.html | 140 + .../argument-1-_/index.html | 2 + .../class-latex/index.html | 140 + .../module-type-Latex_functor/index.html | 2 + .../argument-1-_/class-man/index.html | 46 + .../argument-1-_/index.html | 2 + .../class-man/index.html | 46 + .../module-type-Man_functor/index.html | 2 + .../argument-1-_/class-texi/index.html | 97 + .../argument-1-_/index.html | 2 + .../class-texi/index.html | 97 + .../module-type-Texi_functor/index.html | 2 + ocaml/Odoc_global/index.html | 2 + .../Odoc_html/Generator/class-html/index.html | 166 + ocaml/Odoc_html/Generator/index.html | 2 + ocaml/Odoc_html/Naming/index.html | 17 + ocaml/Odoc_html/index.html | 2 + .../class-html/index.html | 166 + .../module-type-Html_generator/index.html | 2 + ocaml/Odoc_info/Class/index.html | 5 + ocaml/Odoc_info/Dep/index.html | 5 + ocaml/Odoc_info/Exception/index.html | 2 + ocaml/Odoc_info/Extension/index.html | 2 + ocaml/Odoc_info/Global/index.html | 2 + ocaml/Odoc_info/Module/index.html | 29 + ocaml/Odoc_info/Name/index.html | 2 + ocaml/Odoc_info/Parameter/index.html | 2 + ocaml/Odoc_info/Scan/class-scanner/index.html | 2 + ocaml/Odoc_info/Scan/index.html | 2 + ocaml/Odoc_info/Search/index.html | 2 + ocaml/Odoc_info/Type/index.html | 2 + ocaml/Odoc_info/Value/index.html | 2 + ocaml/Odoc_info/index.html | 15 + .../Generator/class-latex/index.html | 140 + ocaml/Odoc_latex/Generator/index.html | 2 + ocaml/Odoc_latex/index.html | 2 + .../class-latex/index.html | 140 + .../module-type-Latex_generator/index.html | 2 + ocaml/Odoc_latex_style/index.html | 2 + ocaml/Odoc_lexer/index.html | 2 + ocaml/Odoc_man/Generator/class-man/index.html | 46 + ocaml/Odoc_man/Generator/index.html | 2 + ocaml/Odoc_man/index.html | 2 + .../class-man/index.html | 46 + .../module-type-Man_generator/index.html | 2 + ocaml/Odoc_merge/index.html | 11 + ocaml/Odoc_messages/index.html | 2 + ocaml/Odoc_misc/index.html | 6 + ocaml/Odoc_module/index.html | 49 + ocaml/Odoc_name/Map/index.html | 6 + ocaml/Odoc_name/index.html | 2 + ocaml/Odoc_ocamlhtml/index.html | 2 + ocaml/Odoc_parameter/index.html | 8 + ocaml/Odoc_parser/index.html | 11 + ocaml/Odoc_print/index.html | 6 + ocaml/Odoc_scan/class-scanner/index.html | 6 + ocaml/Odoc_scan/index.html | 2 + ocaml/Odoc_search/P_name/index.html | 10 + .../Search/argument-1-P/index.html | 2 + ocaml/Odoc_search/Search/index.html | 19 + ocaml/Odoc_search/Search_by_name/index.html | 32 + ocaml/Odoc_search/index.html | 4 + .../module-type-Predicates/index.html | 2 + ocaml/Odoc_see_lexer/index.html | 2 + .../Odoc_sig/Analyser/argument-1-_/index.html | 6 + ocaml/Odoc_sig/Analyser/index.html | 51 + ocaml/Odoc_sig/Signature_search/index.html | 5 + ocaml/Odoc_sig/index.html | 5 + .../module-type-Info_retriever/index.html | 6 + ocaml/Odoc_str/index.html | 4 + ocaml/Odoc_test/index.html | 2 + .../Odoc_texi/Generator/class-texi/index.html | 97 + ocaml/Odoc_texi/Generator/index.html | 2 + ocaml/Odoc_texi/index.html | 2 + .../class-texi/index.html | 97 + .../module-type-Texi_generator/index.html | 2 + ocaml/Odoc_text/Texter/index.html | 2 + ocaml/Odoc_text/index.html | 2 + ocaml/Odoc_text_lexer/index.html | 2 + ocaml/Odoc_text_parser/index.html | 8 + ocaml/Odoc_to_text/class-to_text/index.html | 48 + ocaml/Odoc_to_text/index.html | 2 + ocaml/Odoc_type/index.html | 2 + ocaml/Odoc_types/index.html | 2 + ocaml/Odoc_value/index.html | 2 + ocaml/Opcodes/index.html | 2 + ocaml/Oprint/index.html | 18 + ocaml/Optcompile/index.html | 15 + ocaml/Opterrors/index.html | 2 + ocaml/Optmain/index.html | 2 + ocaml/Optmaindriver/index.html | 2 + ocaml/Outcometree/index.html | 10 + ocaml/Parameter/List/index.html | 2 + ocaml/Parameter/Map/index.html | 17 + ocaml/Parameter/Set/index.html | 2 + ocaml/Parameter/T/index.html | 2 + ocaml/Parameter/Tbl/index.html | 2 + ocaml/Parameter/index.html | 2 + ocaml/Parmatch/Compat/argument-1-_/index.html | 5 + ocaml/Parmatch/Compat/index.html | 2 + ocaml/Parmatch/index.html | 27 + ocaml/Parse/index.html | 2 + ocaml/Parser/Incremental/index.html | 32 + ocaml/Parser/MenhirInterpreter/index.html | 35 + ocaml/Parser/index.html | 47 + ocaml/Parsetree/index.html | 25 + ocaml/Pass_wrapper/index.html | 9 + ocaml/Path/Map/index.html | 8 + ocaml/Path/Set/index.html | 2 + ocaml/Path/index.html | 2 + ocaml/Patterns/General/index.html | 2 + ocaml/Patterns/Half_simple/index.html | 2 + ocaml/Patterns/Head/index.html | 2 + ocaml/Patterns/Non_empty_row/index.html | 2 + ocaml/Patterns/Simple/index.html | 7 + ocaml/Patterns/index.html | 2 + ocaml/Persistent_env/Consistbl/index.html | 18 + .../Persistent_signature/index.html | 2 + ocaml/Persistent_env/index.html | 23 + ocaml/Polling/index.html | 9 + ocaml/Pparse/index.html | 20 + ocaml/Pprintast/index.html | 14 + ocaml/Predef/index.html | 6 + ocaml/Primitive/index.html | 12 + ocaml/Printast/index.html | 8 + ocaml/Printclambda/index.html | 8 + ocaml/Printclambda_primitives/index.html | 2 + ocaml/Printcmm/index.html | 8 + ocaml/Printinstr/index.html | 2 + ocaml/Printlambda/index.html | 20 + ocaml/Printlinear/index.html | 2 + ocaml/Printmach/index.html | 7 + ocaml/Printpat/index.html | 14 + ocaml/Printtyp/Conflicts/index.html | 5 + ocaml/Printtyp/Naming_context/index.html | 2 + ocaml/Printtyp/Out_name/index.html | 2 + ocaml/Printtyp/Subtype/index.html | 7 + ocaml/Printtyp/index.html | 132 + ocaml/Printtyped/index.html | 5 + ocaml/Proc/index.html | 2 + ocaml/Profile/index.html | 2 + ocaml/Profiling/index.html | 2 + ocaml/Projection/Map/index.html | 17 + ocaml/Projection/Set/index.html | 2 + ocaml/Projection/T/index.html | 2 + ocaml/Projection/Tbl/index.html | 2 + ocaml/Projection/index.html | 8 + ocaml/Ref_to_variables/index.html | 2 + ocaml/Reg/Map/index.html | 8 + ocaml/Reg/Raw_name/index.html | 2 + ocaml/Reg/Set/index.html | 2 + ocaml/Reg/index.html | 2 + ocaml/Reload/index.html | 2 + .../Reloadgen/class-reload_generic/index.html | 5 + ocaml/Reloadgen/index.html | 2 + .../Remove_free_vars_equal_to_args/index.html | 5 + ocaml/Remove_unused_arguments/index.html | 8 + ocaml/Remove_unused_closure_vars/index.html | 5 + .../index.html | 2 + ocaml/Runtime_events/Callbacks/index.html | 14 + ocaml/Runtime_events/Timestamp/index.html | 2 + ocaml/Runtime_events/Type/index.html | 5 + ocaml/Runtime_events/User/index.html | 2 + ocaml/Runtime_events/index.html | 2 + ocaml/Runtimedef/index.html | 2 + .../class-scheduler_generic/index.html | 2 + ocaml/Schedgen/index.html | 2 + ocaml/Scheduling/index.html | 2 + ocaml/Selectgen/Coeffect/index.html | 2 + ocaml/Selectgen/Effect/index.html | 2 + .../Selectgen/Effect_and_coeffect/index.html | 2 + .../class-selector_generic/index.html | 45 + ocaml/Selectgen/index.html | 7 + ocaml/Selection/index.html | 5 + ocaml/Semantics_of_primitives/index.html | 2 + ocaml/Set_of_closures_id/Map/index.html | 17 + ocaml/Set_of_closures_id/Set/index.html | 2 + ocaml/Set_of_closures_id/T/index.html | 2 + ocaml/Set_of_closures_id/Tbl/index.html | 2 + ocaml/Set_of_closures_id/index.html | 2 + ocaml/Set_of_closures_origin/Map/index.html | 17 + ocaml/Set_of_closures_origin/Set/index.html | 2 + ocaml/Set_of_closures_origin/T/index.html | 2 + ocaml/Set_of_closures_origin/Tbl/index.html | 2 + ocaml/Set_of_closures_origin/index.html | 2 + ocaml/Shape/Item/Map/index.html | 8 + ocaml/Shape/Item/index.html | 2 + ocaml/Shape/Map/index.html | 2 + ocaml/Shape/Sig_component_kind/index.html | 2 + ocaml/Shape/Uid/Map/index.html | 17 + ocaml/Shape/Uid/Set/index.html | 2 + ocaml/Shape/Uid/T/index.html | 2 + ocaml/Shape/Uid/Tbl/index.html | 2 + ocaml/Shape/Uid/index.html | 2 + ocaml/Shape/index.html | 6 + .../Shape_reduce/Make/argument-1-_/index.html | 2 + ocaml/Shape_reduce/Make/index.html | 2 + ocaml/Shape_reduce/index.html | 2 + ocaml/Share_constants/index.html | 2 + ocaml/Signature_group/index.html | 7 + ocaml/Simple_value_approx/index.html | 68 + ocaml/Simplif/index.html | 10 + .../Simplify_boxed_int32/index.html | 20 + .../Simplify_boxed_int64/index.html | 20 + .../Simplify_boxed_nativeint/index.html | 20 + ocaml/Simplify_boxed_integer_ops/index.html | 5 + .../index.html | 2 + .../module-type-S/index.html | 20 + ocaml/Simplify_common/index.html | 28 + ocaml/Simplify_primitives/index.html | 8 + ocaml/Spill/index.html | 2 + ocaml/Split/index.html | 2 + ocaml/Stackframe/index.html | 2 + .../class-stackframe_generic/index.html | 2 + ocaml/Stackframegen/index.html | 2 + ocaml/Static_exception/Map/index.html | 17 + ocaml/Static_exception/Set/index.html | 2 + ocaml/Static_exception/T/index.html | 2 + ocaml/Static_exception/Tbl/index.html | 2 + ocaml/Static_exception/index.html | 2 + ocaml/Std_exit/index.html | 2 + ocaml/Stdlib/Arg/index.html | 38 + ocaml/Stdlib/Array/index.html | 19 + ocaml/Stdlib/ArrayLabels/index.html | 29 + ocaml/Stdlib/Atomic/index.html | 64 + ocaml/Stdlib/Bigarray/Array0/index.html | 2 + ocaml/Stdlib/Bigarray/Array1/index.html | 2 + ocaml/Stdlib/Bigarray/Array2/index.html | 15 + ocaml/Stdlib/Bigarray/Array3/index.html | 28 + ocaml/Stdlib/Bigarray/Genarray/index.html | 14 + ocaml/Stdlib/Bigarray/index.html | 25 + ocaml/Stdlib/Bool/index.html | 2 + ocaml/Stdlib/Buffer/index.html | 6 + ocaml/Stdlib/Bytes/index.html | 14 + ocaml/Stdlib/BytesLabels/index.html | 26 + ocaml/Stdlib/Callback/index.html | 2 + ocaml/Stdlib/Char/index.html | 2 + ocaml/Stdlib/Complex/index.html | 2 + ocaml/Stdlib/Condition/index.html | 31 + ocaml/Stdlib/Digest/BLAKE128/index.html | 2 + ocaml/Stdlib/Digest/BLAKE256/index.html | 2 + ocaml/Stdlib/Digest/BLAKE512/index.html | 2 + ocaml/Stdlib/Digest/MD5/index.html | 2 + ocaml/Stdlib/Digest/index.html | 2 + ocaml/Stdlib/Digest/module-type-S/index.html | 2 + ocaml/Stdlib/Domain/DLS/index.html | 12 + ocaml/Stdlib/Domain/index.html | 5 + ocaml/Stdlib/Dynarray/index.html | 102 + ocaml/Stdlib/Effect/Deep/index.html | 6 + ocaml/Stdlib/Effect/Shallow/index.html | 7 + ocaml/Stdlib/Effect/index.html | 2 + ocaml/Stdlib/Either/index.html | 17 + ocaml/Stdlib/Ephemeron/K1/Bucket/index.html | 2 + .../Ephemeron/K1/Make/argument-1-H/index.html | 2 + ocaml/Stdlib/Ephemeron/K1/Make/index.html | 2 + .../K1/MakeSeeded/argument-1-H/index.html | 2 + .../Stdlib/Ephemeron/K1/MakeSeeded/index.html | 2 + ocaml/Stdlib/Ephemeron/K1/index.html | 2 + ocaml/Stdlib/Ephemeron/K2/Bucket/index.html | 2 + .../K2/Make/argument-1-H1/index.html | 2 + .../K2/Make/argument-2-H2/index.html | 2 + ocaml/Stdlib/Ephemeron/K2/Make/index.html | 2 + .../K2/MakeSeeded/argument-1-H1/index.html | 2 + .../K2/MakeSeeded/argument-2-H2/index.html | 2 + .../Stdlib/Ephemeron/K2/MakeSeeded/index.html | 2 + ocaml/Stdlib/Ephemeron/K2/index.html | 8 + ocaml/Stdlib/Ephemeron/Kn/Bucket/index.html | 2 + .../Ephemeron/Kn/Make/argument-1-H/index.html | 2 + ocaml/Stdlib/Ephemeron/Kn/Make/index.html | 2 + .../Kn/MakeSeeded/argument-1-H/index.html | 2 + .../Stdlib/Ephemeron/Kn/MakeSeeded/index.html | 2 + ocaml/Stdlib/Ephemeron/Kn/index.html | 4 + ocaml/Stdlib/Ephemeron/index.html | 2 + .../Stdlib/Ephemeron/module-type-S/index.html | 2 + .../Ephemeron/module-type-SeededS/index.html | 2 + ocaml/Stdlib/Filename/index.html | 14 + ocaml/Stdlib/Float/Array/index.html | 13 + ocaml/Stdlib/Float/ArrayLabels/index.html | 13 + ocaml/Stdlib/Float/index.html | 2 + ocaml/Stdlib/Format/index.html | 141 + ocaml/Stdlib/Fun/index.html | 2 + ocaml/Stdlib/Gc/Memprof/index.html | 6 + ocaml/Stdlib/Gc/index.html | 9 + .../Hashtbl/Make/argument-1-H/index.html | 2 + ocaml/Stdlib/Hashtbl/Make/index.html | 2 + .../MakeSeeded/argument-1-H/index.html | 2 + ocaml/Stdlib/Hashtbl/MakeSeeded/index.html | 2 + ocaml/Stdlib/Hashtbl/index.html | 80 + .../Hashtbl/module-type-HashedType/index.html | 2 + ocaml/Stdlib/Hashtbl/module-type-S/index.html | 2 + .../module-type-SeededHashedType/index.html | 2 + .../Hashtbl/module-type-SeededS/index.html | 2 + ocaml/Stdlib/In_channel/index.html | 12 + ocaml/Stdlib/Int/index.html | 2 + ocaml/Stdlib/Int32/index.html | 4 + ocaml/Stdlib/Int64/index.html | 4 + ocaml/Stdlib/LargeFile/index.html | 2 + ocaml/Stdlib/Lazy/index.html | 5 + ocaml/Stdlib/Lexing/index.html | 2 + ocaml/Stdlib/List/index.html | 16 + ocaml/Stdlib/ListLabels/index.html | 16 + .../Stdlib/Map/Make/argument-1-Ord/index.html | 2 + ocaml/Stdlib/Map/Make/index.html | 8 + ocaml/Stdlib/Map/index.html | 13 + .../Map/module-type-OrderedType/index.html | 2 + ocaml/Stdlib/Map/module-type-S/index.html | 8 + ocaml/Stdlib/Marshal/index.html | 2 + .../Hashtbl/Make/argument-1-H/index.html | 2 + .../Stdlib/MoreLabels/Hashtbl/Make/index.html | 2 + .../MakeSeeded/argument-1-H/index.html | 2 + .../MoreLabels/Hashtbl/MakeSeeded/index.html | 2 + ocaml/Stdlib/MoreLabels/Hashtbl/index.html | 91 + .../Hashtbl/module-type-HashedType/index.html | 2 + .../Hashtbl/module-type-S/index.html | 2 + .../module-type-SeededHashedType/index.html | 2 + .../Hashtbl/module-type-SeededS/index.html | 2 + .../Map/Make/argument-1-Ord/index.html | 2 + ocaml/Stdlib/MoreLabels/Map/Make/index.html | 8 + ocaml/Stdlib/MoreLabels/Map/index.html | 15 + .../Map/module-type-OrderedType/index.html | 2 + .../MoreLabels/Map/module-type-S/index.html | 8 + .../Set/Make/argument-1-Ord/index.html | 2 + ocaml/Stdlib/MoreLabels/Set/Make/index.html | 2 + ocaml/Stdlib/MoreLabels/Set/index.html | 15 + .../Set/module-type-OrderedType/index.html | 2 + .../MoreLabels/Set/module-type-S/index.html | 2 + ocaml/Stdlib/MoreLabels/index.html | 4 + ocaml/Stdlib/Mutex/index.html | 4 + ocaml/Stdlib/Nativeint/index.html | 4 + ocaml/Stdlib/Obj/Ephemeron/index.html | 2 + .../Obj/Extension_constructor/index.html | 2 + ocaml/Stdlib/Obj/index.html | 2 + ocaml/Stdlib/Oo/index.html | 2 + ocaml/Stdlib/Option/index.html | 2 + ocaml/Stdlib/Out_channel/index.html | 9 + ocaml/Stdlib/Parsing/index.html | 2 + ocaml/Stdlib/Printexc/Slot/index.html | 2 + ocaml/Stdlib/Printexc/index.html | 17 + ocaml/Stdlib/Printf/index.html | 14 + ocaml/Stdlib/Queue/index.html | 78 + ocaml/Stdlib/Random/State/index.html | 2 + ocaml/Stdlib/Random/index.html | 2 + ocaml/Stdlib/Result/index.html | 12 + ocaml/Stdlib/Scanf/Scanning/index.html | 2 + ocaml/Stdlib/Scanf/index.html | 23 + ocaml/Stdlib/Semaphore/Binary/index.html | 2 + ocaml/Stdlib/Semaphore/Counting/index.html | 2 + ocaml/Stdlib/Semaphore/index.html | 2 + ocaml/Stdlib/Seq/index.html | 2 + .../Stdlib/Set/Make/argument-1-Ord/index.html | 2 + ocaml/Stdlib/Set/Make/index.html | 2 + ocaml/Stdlib/Set/index.html | 13 + .../Set/module-type-OrderedType/index.html | 2 + ocaml/Stdlib/Set/module-type-S/index.html | 2 + ocaml/Stdlib/Stack/index.html | 2 + ocaml/Stdlib/StdLabels/index.html | 6 + ocaml/Stdlib/String/index.html | 5 + ocaml/Stdlib/StringLabels/index.html | 11 + .../Make/argument-1-Immediate/index.html | 2 + .../Make/argument-2-Non_immediate/index.html | 2 + ocaml/Stdlib/Sys/Immediate64/Make/index.html | 2 + ocaml/Stdlib/Sys/Immediate64/index.html | 5 + .../module-type-Immediate/index.html | 2 + .../module-type-Non_immediate/index.html | 2 + ocaml/Stdlib/Sys/index.html | 4 + ocaml/Stdlib/Type/Id/index.html | 40 + ocaml/Stdlib/Type/index.html | 2 + ocaml/Stdlib/Uchar/index.html | 2 + ocaml/Stdlib/Unit/index.html | 2 + .../Stdlib/Weak/Make/argument-1-H/index.html | 2 + ocaml/Stdlib/Weak/Make/index.html | 2 + ocaml/Stdlib/Weak/index.html | 2 + ocaml/Stdlib/Weak/module-type-S/index.html | 2 + ocaml/Stdlib/index.html | 8 + ocaml/Stdlib__Arg/index.html | 2 + ocaml/Stdlib__Array/index.html | 2 + ocaml/Stdlib__ArrayLabels/index.html | 2 + ocaml/Stdlib__Atomic/index.html | 2 + ocaml/Stdlib__Bigarray/index.html | 2 + ocaml/Stdlib__Bool/index.html | 2 + ocaml/Stdlib__Buffer/index.html | 2 + ocaml/Stdlib__Bytes/index.html | 2 + ocaml/Stdlib__BytesLabels/index.html | 2 + ocaml/Stdlib__Callback/index.html | 2 + ocaml/Stdlib__Char/index.html | 2 + ocaml/Stdlib__Complex/index.html | 2 + ocaml/Stdlib__Condition/index.html | 2 + ocaml/Stdlib__Digest/index.html | 2 + ocaml/Stdlib__Domain/index.html | 2 + ocaml/Stdlib__Dynarray/index.html | 2 + ocaml/Stdlib__Effect/index.html | 2 + ocaml/Stdlib__Either/index.html | 2 + ocaml/Stdlib__Ephemeron/index.html | 2 + ocaml/Stdlib__Filename/index.html | 2 + ocaml/Stdlib__Float/index.html | 2 + ocaml/Stdlib__Format/index.html | 2 + ocaml/Stdlib__Fun/index.html | 2 + ocaml/Stdlib__Gc/index.html | 2 + ocaml/Stdlib__Hashtbl/index.html | 2 + ocaml/Stdlib__In_channel/index.html | 2 + ocaml/Stdlib__Int/index.html | 2 + ocaml/Stdlib__Int32/index.html | 2 + ocaml/Stdlib__Int64/index.html | 2 + ocaml/Stdlib__Lazy/index.html | 2 + ocaml/Stdlib__Lexing/index.html | 2 + ocaml/Stdlib__List/index.html | 2 + ocaml/Stdlib__ListLabels/index.html | 2 + ocaml/Stdlib__Map/index.html | 2 + ocaml/Stdlib__Marshal/index.html | 2 + ocaml/Stdlib__MoreLabels/index.html | 2 + ocaml/Stdlib__Mutex/index.html | 2 + ocaml/Stdlib__Nativeint/index.html | 2 + ocaml/Stdlib__Obj/index.html | 2 + ocaml/Stdlib__Oo/index.html | 2 + ocaml/Stdlib__Option/index.html | 2 + ocaml/Stdlib__Out_channel/index.html | 2 + ocaml/Stdlib__Parsing/index.html | 2 + ocaml/Stdlib__Printexc/index.html | 2 + ocaml/Stdlib__Printf/index.html | 2 + ocaml/Stdlib__Queue/index.html | 2 + ocaml/Stdlib__Random/index.html | 2 + ocaml/Stdlib__Result/index.html | 2 + ocaml/Stdlib__Scanf/index.html | 2 + ocaml/Stdlib__Semaphore/index.html | 2 + ocaml/Stdlib__Seq/index.html | 2 + ocaml/Stdlib__Set/index.html | 2 + ocaml/Stdlib__Stack/index.html | 2 + ocaml/Stdlib__StdLabels/index.html | 2 + ocaml/Stdlib__String/index.html | 2 + ocaml/Stdlib__StringLabels/index.html | 2 + ocaml/Stdlib__Sys/index.html | 2 + ocaml/Stdlib__Type/index.html | 2 + ocaml/Stdlib__Uchar/index.html | 2 + ocaml/Stdlib__Unit/index.html | 2 + ocaml/Stdlib__Weak/index.html | 2 + ocaml/Str/index.html | 4 + ocaml/Strmatch/Make/argument-1-_/index.html | 9 + ocaml/Strmatch/Make/index.html | 7 + ocaml/Strmatch/index.html | 2 + ocaml/Strmatch/module-type-I/index.html | 9 + .../Make/argument-1-Id/Map/index.html | 17 + .../Make/argument-1-Id/Set/index.html | 2 + .../Make/argument-1-Id/T/index.html | 2 + .../Make/argument-1-Id/Tbl/index.html | 2 + .../Make/argument-1-Id/index.html | 2 + .../Make/index.html | 4 + .../Strongly_connected_components/index.html | 2 + .../module-type-S/Id/Map/index.html | 17 + .../module-type-S/Id/Set/index.html | 2 + .../module-type-S/Id/T/index.html | 2 + .../module-type-S/Id/Tbl/index.html | 2 + .../module-type-S/Id/index.html | 2 + .../module-type-S/index.html | 4 + ocaml/Stypes/index.html | 3 + ocaml/Subst/Lazy/index.html | 18 + ocaml/Subst/index.html | 25 + ocaml/Switch/CtxStore/argument-1-A/index.html | 2 + ocaml/Switch/CtxStore/index.html | 2 + ocaml/Switch/Make/argument-1-Arg/index.html | 2 + ocaml/Switch/Make/index.html | 12 + ocaml/Switch/Store/argument-1-A/index.html | 2 + ocaml/Switch/Store/index.html | 2 + ocaml/Switch/index.html | 2 + ocaml/Switch/module-type-CtxStored/index.html | 2 + ocaml/Switch/module-type-S/index.html | 2 + ocaml/Switch/module-type-Stored/index.html | 2 + ocaml/Symbol/Map/index.html | 17 + ocaml/Symbol/Set/index.html | 2 + ocaml/Symbol/T/index.html | 2 + ocaml/Symbol/Tbl/index.html | 2 + ocaml/Symbol/index.html | 2 + ocaml/Symtable/Compunit/Map/index.html | 8 + ocaml/Symtable/Compunit/Set/index.html | 2 + ocaml/Symtable/Compunit/index.html | 2 + ocaml/Symtable/Global/Map/index.html | 8 + ocaml/Symtable/Global/Set/index.html | 2 + ocaml/Symtable/Global/index.html | 2 + ocaml/Symtable/Predef/Map/index.html | 8 + ocaml/Symtable/Predef/Set/index.html | 2 + ocaml/Symtable/Predef/index.html | 2 + ocaml/Symtable/index.html | 10 + ocaml/Syntaxerr/index.html | 2 + ocaml/Tag/Map/index.html | 17 + ocaml/Tag/Set/index.html | 2 + ocaml/Tag/T/index.html | 2 + ocaml/Tag/Tbl/index.html | 2 + ocaml/Tag/index.html | 2 + ocaml/Targetint/index.html | 2 + ocaml/Tast_iterator/index.html | 8 + ocaml/Tast_mapper/index.html | 50 + ocaml/Terminfo/index.html | 2 + ocaml/Thread/index.html | 7 + ocaml/Thread_sanitizer/index.html | 2 + ocaml/Tmc/index.html | 23 + ocaml/Topcommon/index.html | 5 + ocaml/Topdirs/index.html | 2 + ocaml/Topeval/index.html | 2 + ocaml/Tophooks/index.html | 6 + ocaml/Toploop/index.html | 48 + ocaml/Topmain/index.html | 2 + ocaml/Topprinters/index.html | 2 + ocaml/Topstart/index.html | 2 + ocaml/Trace/index.html | 10 + ocaml/Translattribute/index.html | 24 + ocaml/Translclass/index.html | 9 + ocaml/Translcore/index.html | 39 + ocaml/Translmod/index.html | 22 + ocaml/Translobj/index.html | 12 + ocaml/Translprim/index.html | 25 + .../Traverse_for_exported_symbols/index.html | 10 + ocaml/Type_immediacy/Violation/index.html | 2 + ocaml/Type_immediacy/index.html | 2 + ocaml/Typeclass/index.html | 25 + ocaml/Typecore/Datatype_kind/index.html | 2 + ocaml/Typecore/index.html | 84 + ocaml/Typedecl/index.html | 47 + ocaml/Typedecl_immediacy/index.html | 5 + ocaml/Typedecl_properties/index.html | 11 + ocaml/Typedecl_separability/index.html | 6 + ocaml/Typedecl_unboxed/index.html | 5 + ocaml/Typedecl_variance/index.html | 29 + ocaml/Typedtree/index.html | 81 + ocaml/Typemod/Sig_component_kind/index.html | 2 + ocaml/Typemod/Signature_names/index.html | 2 + ocaml/Typemod/index.html | 35 + ocaml/Typeopt/index.html | 19 + ocaml/Types/MethSet/index.html | 2 + ocaml/Types/Meths/index.html | 8 + ocaml/Types/Separability/index.html | 2 + ocaml/Types/TransientTypeOps/index.html | 2 + ocaml/Types/Transient_expr/index.html | 2 + ocaml/Types/VarSet/index.html | 2 + ocaml/Types/Variance/index.html | 2 + ocaml/Types/Vars/index.html | 8 + ocaml/Types/index.html | 36 + ocaml/Typetexp/TyVarEnv/index.html | 10 + ocaml/Typetexp/index.html | 28 + ocaml/Un_anf/index.html | 6 + ocaml/Unbox_closures/index.html | 11 + ocaml/Unbox_free_vars_of_closures/index.html | 5 + ocaml/Unbox_specialised_args/index.html | 11 + ocaml/Unit_info/Artifact/index.html | 2 + ocaml/Unit_info/index.html | 2 + ocaml/Unix/LargeFile/index.html | 2 + ocaml/Unix/index.html | 86 + ocaml/UnixLabels/LargeFile/index.html | 2 + ocaml/UnixLabels/index.html | 120 + ocaml/Untypeast/index.html | 65 + ocaml/Value_rec_check/index.html | 5 + ocaml/Value_rec_compiler/index.html | 5 + ocaml/Value_rec_types/index.html | 2 + ocaml/Var_within_closure/Map/index.html | 17 + ocaml/Var_within_closure/Set/index.html | 2 + ocaml/Var_within_closure/T/index.html | 2 + ocaml/Var_within_closure/Tbl/index.html | 2 + ocaml/Var_within_closure/index.html | 2 + ocaml/Variable/Map/index.html | 17 + ocaml/Variable/Pair/Map/index.html | 17 + ocaml/Variable/Pair/Set/index.html | 2 + ocaml/Variable/Pair/T/index.html | 2 + ocaml/Variable/Pair/Tbl/index.html | 2 + ocaml/Variable/Pair/index.html | 2 + ocaml/Variable/Set/index.html | 2 + ocaml/Variable/T/index.html | 2 + ocaml/Variable/Tbl/index.html | 2 + ocaml/Variable/index.html | 5 + ocaml/Warnings/index.html | 2 + ocaml/X86_ast/index.html | 2 + ocaml/X86_dsl/D/index.html | 2 + ocaml/X86_dsl/I/index.html | 2 + ocaml/X86_dsl/index.html | 16 + ocaml/X86_gas/index.html | 2 + ocaml/X86_masm/index.html | 2 + ocaml/X86_proc/index.html | 7 + ocaml/_doc-dir/Changes | 14679 ++++++++++++++++ ocaml/_doc-dir/LICENSE | 203 + ocaml/_doc-dir/README.adoc | 162 + ocaml/_doc-dir/README.win32.adoc | 386 + ocaml/index.html | 2 + odoc.css | 1610 ++ odoc_search.js | 150 + picos/Picos/Computation/Tx/index.html | 7 + picos/Picos/Computation/index.html | 47 + picos/Picos/Fiber/FLS/index.html | 2 + picos/Picos/Fiber/Maybe/index.html | 2 + picos/Picos/Fiber/index.html | 42 + picos/Picos/Handler/index.html | 7 + picos/Picos/Trigger/index.html | 18 + picos/Picos/index.html | 16 + picos/Picos__/index.html | 2 + picos/Picos__Intf/index.html | 2 + picos/Picos_domain/DLS/index.html | 2 + picos/Picos_domain/index.html | 2 + picos/Picos_thread/TLS/index.html | 2 + picos/Picos_thread/index.html | 2 + picos/_doc-dir/CHANGES.md | 191 + picos/_doc-dir/LICENSE.md | 13 + picos/_doc-dir/README.md | 791 + picos/_doc-dir/odoc-pages/index.mld | 153 + picos/index.html | 2 + tiny_httpd/Tiny_httpd/index.html | 134 + tiny_httpd/Tiny_httpd_core/Atomic_/index.html | 64 + tiny_httpd/Tiny_httpd_core/Buf/index.html | 2 + tiny_httpd/Tiny_httpd_core/Headers/index.html | 2 + .../IO/Input/class-bufferized/index.html | 2 + .../IO/Input/class-of_bytes/index.html | 2 + .../IO/Input/class-of_in_channel/index.html | 2 + .../IO/Input/class-of_string/index.html | 2 + .../IO/Input/class-open_file/index.html | 2 + .../IO/Input/class-t_from_refill/index.html | 2 + .../IO/Input/class-type-t/index.html | 2 + .../Tiny_httpd_core/IO/Input/index.html | 29 + .../IO/Output/class-bufferized/index.html | 2 + .../IO/Output/class-dummy/index.html | 2 + .../IO/Output/class-of_buffer/index.html | 2 + .../IO/Output/class-of_out_channel/index.html | 2 + .../IO/Output/class-of_unix_fd/index.html | 2 + .../IO/Output/class-open_file/index.html | 2 + .../IO/Output/class-t_from_output/index.html | 2 + .../IO/Output/class-type-t/index.html | 2 + .../Output/class-type-t_seekable/index.html | 2 + .../Tiny_httpd_core/IO/Output/index.html | 21 + .../Tiny_httpd_core/IO/TCP_server/index.html | 2 + .../Tiny_httpd_core/IO/Writer/index.html | 2 + tiny_httpd/Tiny_httpd_core/IO/index.html | 2 + tiny_httpd/Tiny_httpd_core/Log/index.html | 8 + tiny_httpd/Tiny_httpd_core/Meth/index.html | 2 + .../Tiny_httpd_core/Pool/Raw/index.html | 2 + tiny_httpd/Tiny_httpd_core/Pool/index.html | 7 + tiny_httpd/Tiny_httpd_core/Request/index.html | 14 + .../Tiny_httpd_core/Response/index.html | 33 + .../Tiny_httpd_core/Response_code/index.html | 2 + .../Tiny_httpd_core/Route/Private_/index.html | 2 + tiny_httpd/Tiny_httpd_core/Route/index.html | 2 + .../Server/Head_middleware/index.html | 2 + .../Server/Middleware/index.html | 2 + tiny_httpd/Tiny_httpd_core/Server/index.html | 45 + .../Server/module-type-IO_BACKEND/index.html | 2 + .../index.html | 8 + .../module-type-UPGRADE_HANDLER/index.html | 5 + tiny_httpd/Tiny_httpd_core/Util/index.html | 2 + tiny_httpd/Tiny_httpd_core/index.html | 2 + .../Tiny_httpd_core__Atomic_/index.html | 2 + tiny_httpd/Tiny_httpd_core__Buf/index.html | 2 + .../Tiny_httpd_core__Headers/index.html | 2 + tiny_httpd/Tiny_httpd_core__IO/index.html | 2 + tiny_httpd/Tiny_httpd_core__Log/index.html | 2 + tiny_httpd/Tiny_httpd_core__Meth/index.html | 2 + tiny_httpd/Tiny_httpd_core__Pool/index.html | 2 + .../Tiny_httpd_core__Request/index.html | 2 + .../Tiny_httpd_core__Response/index.html | 2 + .../Tiny_httpd_core__Response_code/index.html | 2 + tiny_httpd/Tiny_httpd_core__Route/index.html | 2 + tiny_httpd/Tiny_httpd_core__Server/index.html | 2 + tiny_httpd/Tiny_httpd_core__Util/index.html | 2 + tiny_httpd/Tiny_httpd_html/A/index.html | 2 + tiny_httpd/Tiny_httpd_html/Out/index.html | 2 + tiny_httpd/Tiny_httpd_html/index.html | 2 + tiny_httpd/Tiny_httpd_html__/index.html | 2 + tiny_httpd/Tiny_httpd_html__Html_/index.html | 2 + .../Content_disposition/index.html | 2 + .../Private_/index.html | 2 + .../Tiny_httpd_multipart_form_data/index.html | 7 + .../index.html | 2 + .../index.html | 2 + .../index.html | 2 + .../Tiny_httpd_prometheus/Counter/index.html | 2 + .../GC_metrics/index.html | 2 + .../Tiny_httpd_prometheus/Gauge/index.html | 2 + .../Histogram/index.html | 8 + .../Tiny_httpd_prometheus/Registry/index.html | 2 + tiny_httpd/Tiny_httpd_prometheus/index.html | 2 + tiny_httpd/Tiny_httpd_prometheus__/index.html | 2 + .../Dir/Embedded_fs/index.html | 2 + tiny_httpd/Tiny_httpd_unix/Dir/index.html | 19 + .../Dir/module-type-VFS/index.html | 2 + tiny_httpd/Tiny_httpd_unix/Sem/index.html | 2 + .../Unix_tcp_server_/index.html | 2 + tiny_httpd/Tiny_httpd_unix/index.html | 2 + tiny_httpd/Tiny_httpd_unix__/index.html | 2 + tiny_httpd/Tiny_httpd_unix__Dir/index.html | 2 + tiny_httpd/Tiny_httpd_unix__Sem/index.html | 2 + tiny_httpd/Tiny_httpd_ws/index.html | 18 + tiny_httpd/Tiny_httpd_ws__/index.html | 2 + tiny_httpd/_doc-dir/CHANGES.md | 204 + tiny_httpd/_doc-dir/README.md | 194 + tiny_httpd/index.html | 2 + trace/Trace/index.html | 57 + trace/Trace_core/Collector/index.html | 2 + .../Collector/module-type-S/index.html | 95 + trace/Trace_core/Level/index.html | 2 + trace/Trace_core/Meta_map/index.html | 2 + trace/Trace_core/index.html | 57 + trace/Trace_core__/index.html | 2 + trace/Trace_core__Atomic_/index.html | 2 + trace/Trace_core__Collector/index.html | 2 + trace/Trace_core__Level/index.html | 2 + trace/Trace_core__Meta_map/index.html | 2 + trace/Trace_core__Types/index.html | 2 + trace/Trace_private_util/B_queue/index.html | 2 + .../Trace_private_util/Domain_util/index.html | 2 + trace/Trace_private_util/Mpsc_bag/index.html | 2 + trace/Trace_private_util/index.html | 2 + trace/Trace_private_util__B_queue/index.html | 2 + .../index.html | 2 + trace/Trace_private_util__Mpsc_bag/index.html | 2 + .../Callbacks/Dummy/index.html | 34 + trace/Trace_subscriber/Callbacks/index.html | 10 + .../Callbacks/module-type-S/index.html | 57 + trace/Trace_subscriber/Subscriber/index.html | 2 + trace/Trace_subscriber/index.html | 2 + trace/Trace_subscriber__/index.html | 2 + trace/Trace_subscriber__Callbacks/index.html | 2 + trace/Trace_subscriber__Subscriber/index.html | 2 + trace/Trace_subscriber__Thread_/index.html | 2 + trace/Trace_subscriber__Time_/index.html | 2 + trace/Trace_subscriber__Types/index.html | 2 + trace/_doc-dir/CHANGES.md | 72 + trace/_doc-dir/README.md | 167 + trace/index.html | 2 + 1371 files changed, 33566 insertions(+), 2 deletions(-) create mode 100644 .nojekyll delete mode 100644 _config.yml create mode 100644 _odoc-theme/fonts/DejaVuSansMono-Bold.woff2 create mode 100644 _odoc-theme/fonts/DejaVuSansMono-BoldOblique.woff2 create mode 100644 _odoc-theme/fonts/DejaVuSansMono-Oblique.woff2 create mode 100644 _odoc-theme/fonts/DejaVuSansMono.woff2 create mode 100644 _odoc-theme/fonts/PTC55F.woff2 create mode 100644 _odoc-theme/fonts/PTC75F.woff2 create mode 100644 _odoc-theme/fonts/PTS55F.woff2 create mode 100644 _odoc-theme/fonts/PTS56F.woff2 create mode 100644 _odoc-theme/fonts/PTS75F.woff2 create mode 100644 _odoc-theme/fonts/PTS76F.woff2 create mode 100644 _odoc-theme/fonts/fonts.css create mode 100644 _odoc-theme/manual.css create mode 100644 _odoc-theme/odoc.css create mode 100644 _odoc-theme/theme.css create mode 100644 fonts/KaTeX_AMS-Regular.woff2 create mode 100644 fonts/KaTeX_Caligraphic-Bold.woff2 create mode 100644 fonts/KaTeX_Caligraphic-Regular.woff2 create mode 100644 fonts/KaTeX_Fraktur-Bold.woff2 create mode 100644 fonts/KaTeX_Fraktur-Regular.woff2 create mode 100644 fonts/KaTeX_Main-Bold.woff2 create mode 100644 fonts/KaTeX_Main-BoldItalic.woff2 create mode 100644 fonts/KaTeX_Main-Italic.woff2 create mode 100644 fonts/KaTeX_Main-Regular.woff2 create mode 100644 fonts/KaTeX_Math-BoldItalic.woff2 create mode 100644 fonts/KaTeX_Math-Italic.woff2 create mode 100644 fonts/KaTeX_SansSerif-Bold.woff2 create mode 100644 fonts/KaTeX_SansSerif-Italic.woff2 create mode 100644 fonts/KaTeX_SansSerif-Regular.woff2 create mode 100644 fonts/KaTeX_Script-Regular.woff2 create mode 100644 fonts/KaTeX_Size1-Regular.woff2 create mode 100644 fonts/KaTeX_Size2-Regular.woff2 create mode 100644 fonts/KaTeX_Size3-Regular.woff2 create mode 100644 fonts/KaTeX_Size4-Regular.woff2 create mode 100644 fonts/KaTeX_Typewriter-Regular.woff2 create mode 100644 fonts/fira-mono-v14-latin-500.woff2 create mode 100644 fonts/fira-mono-v14-latin-regular.woff2 create mode 100644 fonts/fira-sans-v17-latin-500.woff2 create mode 100644 fonts/fira-sans-v17-latin-500italic.woff2 create mode 100644 fonts/fira-sans-v17-latin-700.woff2 create mode 100644 fonts/fira-sans-v17-latin-700italic.woff2 create mode 100644 fonts/fira-sans-v17-latin-italic.woff2 create mode 100644 fonts/fira-sans-v17-latin-regular.woff2 create mode 100644 fonts/noticia-text-v15-latin-700.woff2 create mode 100644 fonts/noticia-text-v15-latin-italic.woff2 create mode 100644 fonts/noticia-text-v15-latin-regular.woff2 create mode 100644 highlight.pack.js create mode 100644 hmap/Hmap/Key/index.html create mode 100644 hmap/Hmap/Make/Key/index.html create mode 100644 hmap/Hmap/Make/argument-1-Key_info/index.html create mode 100644 hmap/Hmap/Make/index.html create mode 100644 hmap/Hmap/index.html create mode 100644 hmap/Hmap/module-type-KEY_INFO/index.html create mode 100644 hmap/Hmap/module-type-S/Key/index.html create mode 100644 hmap/Hmap/module-type-S/index.html create mode 100644 hmap/_doc-dir/CHANGES.md create mode 100644 hmap/_doc-dir/LICENSE.md create mode 100644 hmap/_doc-dir/README.md create mode 100644 hmap/index.html create mode 100644 index.html create mode 100644 iostream/Iostream/In/class-empty/index.html create mode 100644 iostream/Iostream/In/class-of_bytes/index.html create mode 100644 iostream/Iostream/In/class-of_in_channel/index.html create mode 100644 iostream/Iostream/In/class-of_string/index.html create mode 100644 iostream/Iostream/In/class-open_file/index.html create mode 100644 iostream/Iostream/In/class-type-t/index.html create mode 100644 iostream/Iostream/In/class-type-t_seekable/index.html create mode 100644 iostream/Iostream/In/index.html create mode 100644 iostream/Iostream/In_buf/class-bufferized/index.html create mode 100644 iostream/Iostream/In_buf/class-of_bytes/index.html create mode 100644 iostream/Iostream/In_buf/class-of_in_channel/index.html create mode 100644 iostream/Iostream/In_buf/class-of_string/index.html create mode 100644 iostream/Iostream/In_buf/class-open_file/index.html create mode 100644 iostream/Iostream/In_buf/class-t_from_refill/index.html create mode 100644 iostream/Iostream/In_buf/class-type-t/index.html create mode 100644 iostream/Iostream/In_buf/index.html create mode 100644 iostream/Iostream/Out/class-dummy/index.html create mode 100644 iostream/Iostream/Out/class-map_char/index.html create mode 100644 iostream/Iostream/Out/class-of_buffer/index.html create mode 100644 iostream/Iostream/Out/class-of_out_channel/index.html create mode 100644 iostream/Iostream/Out/class-type-t/index.html create mode 100644 iostream/Iostream/Out/class-type-t_seekable/index.html create mode 100644 iostream/Iostream/Out/index.html create mode 100644 iostream/Iostream/Out_buf/class-bufferized/index.html create mode 100644 iostream/Iostream/Out_buf/class-dummy/index.html create mode 100644 iostream/Iostream/Out_buf/class-of_buffer/index.html create mode 100644 iostream/Iostream/Out_buf/class-of_out_channel/index.html create mode 100644 iostream/Iostream/Out_buf/class-open_file/index.html create mode 100644 iostream/Iostream/Out_buf/class-t_from_output/index.html create mode 100644 iostream/Iostream/Out_buf/class-type-t/index.html create mode 100644 iostream/Iostream/Out_buf/class-type-t_seekable/index.html create mode 100644 iostream/Iostream/Out_buf/index.html create mode 100644 iostream/Iostream/Seekable/class-type-t/index.html create mode 100644 iostream/Iostream/Seekable/index.html create mode 100644 iostream/Iostream/Slice/index.html create mode 100644 iostream/Iostream/index.html create mode 100644 iostream/Iostream__/index.html create mode 100644 iostream/Iostream__In/index.html create mode 100644 iostream/Iostream__In_buf/index.html create mode 100644 iostream/Iostream__Out/index.html create mode 100644 iostream/Iostream__Out_buf/index.html create mode 100644 iostream/Iostream__Seekable/index.html create mode 100644 iostream/Iostream__Slice/index.html create mode 100644 iostream/Iostream_types/In/class-type-t/index.html create mode 100644 iostream/Iostream_types/In/class-type-t_seekable/index.html create mode 100644 iostream/Iostream_types/In/index.html create mode 100644 iostream/Iostream_types/In_buf/class-type-t/index.html create mode 100644 iostream/Iostream_types/In_buf/index.html create mode 100644 iostream/Iostream_types/Out/class-type-t/index.html create mode 100644 iostream/Iostream_types/Out/class-type-t_seekable/index.html create mode 100644 iostream/Iostream_types/Out/index.html create mode 100644 iostream/Iostream_types/Out_buf/class-type-t/index.html create mode 100644 iostream/Iostream_types/Out_buf/class-type-t_seekable/index.html create mode 100644 iostream/Iostream_types/Out_buf/index.html create mode 100644 iostream/Iostream_types/Seekable/class-type-t/index.html create mode 100644 iostream/Iostream_types/Seekable/index.html create mode 100644 iostream/Iostream_types/Slice/index.html create mode 100644 iostream/Iostream_types/index.html create mode 100644 iostream/Iostream_unix/In/index.html create mode 100644 iostream/Iostream_unix/Out/index.html create mode 100644 iostream/Iostream_unix/index.html create mode 100644 iostream/_doc-dir/CHANGES.md create mode 100644 iostream/_doc-dir/README.md create mode 100644 iostream/index.html create mode 100644 katex.min.css create mode 100644 katex.min.js create mode 100644 nanoev-picos/Nanoev_picos/Background_thread/index.html create mode 100644 nanoev-picos/Nanoev_picos/Base/Raw/index.html create mode 100644 nanoev-picos/Nanoev_picos/Base/index.html create mode 100644 nanoev-picos/Nanoev_picos/Global_ev/index.html create mode 100644 nanoev-picos/Nanoev_picos/IO_in/class-type-t/index.html create mode 100644 nanoev-picos/Nanoev_picos/IO_in/index.html create mode 100644 nanoev-picos/Nanoev_picos/IO_out/class-type-t/index.html create mode 100644 nanoev-picos/Nanoev_picos/IO_out/index.html create mode 100644 nanoev-picos/Nanoev_picos/Net_client/index.html create mode 100644 nanoev-picos/Nanoev_picos/Net_server/index.html create mode 100644 nanoev-picos/Nanoev_picos/index.html create mode 100644 nanoev-picos/Nanoev_picos__/index.html create mode 100644 nanoev-picos/Nanoev_picos__Background_thread/index.html create mode 100644 nanoev-picos/Nanoev_picos__Base/index.html create mode 100644 nanoev-picos/Nanoev_picos__Common_/index.html create mode 100644 nanoev-picos/Nanoev_picos__Global_ev/index.html create mode 100644 nanoev-picos/Nanoev_picos__IO_in/index.html create mode 100644 nanoev-picos/Nanoev_picos__IO_out/index.html create mode 100644 nanoev-picos/Nanoev_picos__Net_client/index.html create mode 100644 nanoev-picos/Nanoev_picos__Net_server/index.html create mode 100644 nanoev-picos/_doc-dir/README.md create mode 100644 nanoev-picos/index.html create mode 100644 nanoev-posix/Nanoev_posix/index.html create mode 100644 nanoev-posix/Nanoev_posix__/index.html create mode 100644 nanoev-posix/_doc-dir/README.md create mode 100644 nanoev-posix/index.html create mode 100644 nanoev/Nanoev/Impl/index.html create mode 100644 nanoev/Nanoev/index.html create mode 100644 nanoev/Nanoev__/index.html create mode 100644 nanoev/Nanoev__Trace_/index.html create mode 100644 nanoev/Nanoev_unix/index.html create mode 100644 nanoev/Nanoev_unix__/index.html create mode 100644 nanoev/_doc-dir/README.md create mode 100644 nanoev/index.html create mode 100644 nanoev_tiny_httpd/Nanoev_tiny_httpd/index.html create mode 100644 nanoev_tiny_httpd/_doc-dir/README.md create mode 100644 nanoev_tiny_httpd/index.html create mode 100644 ocaml/Afl_instrument/index.html create mode 100644 ocaml/Alias_analysis/index.html create mode 100644 ocaml/Allocated_const/index.html create mode 100644 ocaml/Annot/index.html create mode 100644 ocaml/Arch/index.html create mode 100644 ocaml/Arg_helper/Make/argument-1-S/Key/Map/index.html create mode 100644 ocaml/Arg_helper/Make/argument-1-S/Key/index.html create mode 100644 ocaml/Arg_helper/Make/argument-1-S/Value/index.html create mode 100644 ocaml/Arg_helper/Make/argument-1-S/index.html create mode 100644 ocaml/Arg_helper/Make/index.html create mode 100644 ocaml/Arg_helper/index.html create mode 100644 ocaml/Asmgen/index.html create mode 100644 ocaml/Asmlibrarian/index.html create mode 100644 ocaml/Asmlink/index.html create mode 100644 ocaml/Asmpackager/index.html create mode 100644 ocaml/Ast_helper/Attr/index.html create mode 100644 ocaml/Ast_helper/Cf/index.html create mode 100644 ocaml/Ast_helper/Ci/index.html create mode 100644 ocaml/Ast_helper/Cl/index.html create mode 100644 ocaml/Ast_helper/Const/index.html create mode 100644 ocaml/Ast_helper/Csig/index.html create mode 100644 ocaml/Ast_helper/Cstr/index.html create mode 100644 ocaml/Ast_helper/Ctf/index.html create mode 100644 ocaml/Ast_helper/Cty/index.html create mode 100644 ocaml/Ast_helper/Exp/index.html create mode 100644 ocaml/Ast_helper/Incl/index.html create mode 100644 ocaml/Ast_helper/Mb/index.html create mode 100644 ocaml/Ast_helper/Md/index.html create mode 100644 ocaml/Ast_helper/Mod/index.html create mode 100644 ocaml/Ast_helper/Ms/index.html create mode 100644 ocaml/Ast_helper/Mtd/index.html create mode 100644 ocaml/Ast_helper/Mty/index.html create mode 100644 ocaml/Ast_helper/Of/index.html create mode 100644 ocaml/Ast_helper/Opn/index.html create mode 100644 ocaml/Ast_helper/Pat/index.html create mode 100644 ocaml/Ast_helper/Rf/index.html create mode 100644 ocaml/Ast_helper/Sig/index.html create mode 100644 ocaml/Ast_helper/Str/index.html create mode 100644 ocaml/Ast_helper/Te/index.html create mode 100644 ocaml/Ast_helper/Typ/index.html create mode 100644 ocaml/Ast_helper/Type/index.html create mode 100644 ocaml/Ast_helper/Val/index.html create mode 100644 ocaml/Ast_helper/Vb/index.html create mode 100644 ocaml/Ast_helper/index.html create mode 100644 ocaml/Ast_invariants/index.html create mode 100644 ocaml/Ast_iterator/index.html create mode 100644 ocaml/Ast_mapper/index.html create mode 100644 ocaml/Asttypes/index.html create mode 100644 ocaml/Attr_helper/index.html create mode 100644 ocaml/Augment_specialised_args/Definition/index.html create mode 100644 ocaml/Augment_specialised_args/Make/argument-1-_/index.html create mode 100644 ocaml/Augment_specialised_args/Make/index.html create mode 100644 ocaml/Augment_specialised_args/What_to_specialise/index.html create mode 100644 ocaml/Augment_specialised_args/index.html create mode 100644 ocaml/Augment_specialised_args/module-type-S/index.html create mode 100644 ocaml/Backend_intf/index.html create mode 100644 ocaml/Backend_intf/module-type-S/index.html create mode 100644 ocaml/Backend_var/Provenance/index.html create mode 100644 ocaml/Backend_var/With_provenance/index.html create mode 100644 ocaml/Backend_var/index.html create mode 100644 ocaml/Binutils/index.html create mode 100644 ocaml/Branch_relaxation/Make/argument-1-T/Cond_branch/index.html create mode 100644 ocaml/Branch_relaxation/Make/argument-1-T/index.html create mode 100644 ocaml/Branch_relaxation/Make/index.html create mode 100644 ocaml/Branch_relaxation/index.html create mode 100644 ocaml/Branch_relaxation_intf/index.html create mode 100644 ocaml/Branch_relaxation_intf/module-type-S/Cond_branch/index.html create mode 100644 ocaml/Branch_relaxation_intf/module-type-S/index.html create mode 100644 ocaml/Btype/For_copy/index.html create mode 100644 ocaml/Btype/TransientTypeMap/index.html create mode 100644 ocaml/Btype/TypeHash/index.html create mode 100644 ocaml/Btype/TypeMap/index.html create mode 100644 ocaml/Btype/TypePairs/index.html create mode 100644 ocaml/Btype/TypeSet/index.html create mode 100644 ocaml/Btype/index.html create mode 100644 ocaml/Build_export_info/index.html create mode 100644 ocaml/Build_path_prefix_map/index.html create mode 100644 ocaml/Builtin_attributes/index.html create mode 100644 ocaml/Bytegen/index.html create mode 100644 ocaml/Bytelibrarian/index.html create mode 100644 ocaml/Bytelink/Dep/index.html create mode 100644 ocaml/Bytelink/DepSet/index.html create mode 100644 ocaml/Bytelink/index.html create mode 100644 ocaml/Bytepackager/index.html create mode 100644 ocaml/Bytesections/Name/index.html create mode 100644 ocaml/Bytesections/index.html create mode 100644 ocaml/CSE/index.html create mode 100644 ocaml/CSEgen/class-cse_generic/index.html create mode 100644 ocaml/CSEgen/index.html create mode 100644 ocaml/CamlinternalFormat/index.html create mode 100644 ocaml/CamlinternalFormatBasics/index.html create mode 100644 ocaml/CamlinternalLazy/index.html create mode 100644 ocaml/CamlinternalMenhirLib/Convert/Simplified/index.html create mode 100644 ocaml/CamlinternalMenhirLib/Convert/index.html create mode 100644 ocaml/CamlinternalMenhirLib/Engine/Make/argument-1-T/Log/index.html create mode 100644 ocaml/CamlinternalMenhirLib/Engine/Make/argument-1-T/index.html create mode 100644 ocaml/CamlinternalMenhirLib/Engine/Make/index.html create mode 100644 ocaml/CamlinternalMenhirLib/Engine/index.html create mode 100644 ocaml/CamlinternalMenhirLib/EngineTypes/index.html create mode 100644 ocaml/CamlinternalMenhirLib/EngineTypes/module-type-ENGINE/index.html create mode 100644 ocaml/CamlinternalMenhirLib/EngineTypes/module-type-INCREMENTAL_ENGINE_START/index.html create mode 100644 ocaml/CamlinternalMenhirLib/EngineTypes/module-type-MONOLITHIC_ENGINE/index.html create mode 100644 ocaml/CamlinternalMenhirLib/EngineTypes/module-type-TABLE/Log/index.html create mode 100644 ocaml/CamlinternalMenhirLib/EngineTypes/module-type-TABLE/index.html create mode 100644 ocaml/CamlinternalMenhirLib/ErrorReports/index.html create mode 100644 ocaml/CamlinternalMenhirLib/General/index.html create mode 100644 ocaml/CamlinternalMenhirLib/IncrementalEngine/index.html create mode 100644 ocaml/CamlinternalMenhirLib/IncrementalEngine/module-type-EVERYTHING/index.html create mode 100644 ocaml/CamlinternalMenhirLib/IncrementalEngine/module-type-INCREMENTAL_ENGINE/index.html create mode 100644 ocaml/CamlinternalMenhirLib/IncrementalEngine/module-type-INSPECTION/index.html create mode 100644 ocaml/CamlinternalMenhirLib/IncrementalEngine/module-type-SYMBOLS/index.html create mode 100644 ocaml/CamlinternalMenhirLib/InfiniteArray/index.html create mode 100644 ocaml/CamlinternalMenhirLib/InspectionTableFormat/index.html create mode 100644 ocaml/CamlinternalMenhirLib/InspectionTableFormat/module-type-TABLES/index.html create mode 100644 ocaml/CamlinternalMenhirLib/InspectionTableInterpreter/Make/argument-1-TT/index.html create mode 100644 ocaml/CamlinternalMenhirLib/InspectionTableInterpreter/Make/argument-2-IT/index.html create mode 100644 ocaml/CamlinternalMenhirLib/InspectionTableInterpreter/Make/argument-3-ET/Log/index.html create mode 100644 ocaml/CamlinternalMenhirLib/InspectionTableInterpreter/Make/argument-3-ET/index.html create mode 100644 ocaml/CamlinternalMenhirLib/InspectionTableInterpreter/Make/argument-4-E/index.html create mode 100644 ocaml/CamlinternalMenhirLib/InspectionTableInterpreter/Make/index.html create mode 100644 ocaml/CamlinternalMenhirLib/InspectionTableInterpreter/Symbols/argument-1-T/index.html create mode 100644 ocaml/CamlinternalMenhirLib/InspectionTableInterpreter/Symbols/index.html create mode 100644 ocaml/CamlinternalMenhirLib/InspectionTableInterpreter/index.html create mode 100644 ocaml/CamlinternalMenhirLib/LexerUtil/index.html create mode 100644 ocaml/CamlinternalMenhirLib/LinearizedArray/index.html create mode 100644 ocaml/CamlinternalMenhirLib/PackedIntArray/index.html create mode 100644 ocaml/CamlinternalMenhirLib/Printers/Make/argument-1-I/index.html create mode 100644 ocaml/CamlinternalMenhirLib/Printers/Make/argument-2-User/index.html create mode 100644 ocaml/CamlinternalMenhirLib/Printers/Make/index.html create mode 100644 ocaml/CamlinternalMenhirLib/Printers/index.html create mode 100644 ocaml/CamlinternalMenhirLib/RowDisplacement/index.html create mode 100644 ocaml/CamlinternalMenhirLib/StaticVersion/index.html create mode 100644 ocaml/CamlinternalMenhirLib/TableFormat/index.html create mode 100644 ocaml/CamlinternalMenhirLib/TableFormat/module-type-TABLES/index.html create mode 100644 ocaml/CamlinternalMenhirLib/TableInterpreter/MakeEngineTable/Log/index.html create mode 100644 ocaml/CamlinternalMenhirLib/TableInterpreter/MakeEngineTable/argument-1-T/index.html create mode 100644 ocaml/CamlinternalMenhirLib/TableInterpreter/MakeEngineTable/index.html create mode 100644 ocaml/CamlinternalMenhirLib/TableInterpreter/index.html create mode 100644 ocaml/CamlinternalMenhirLib/index.html create mode 100644 ocaml/CamlinternalMod/index.html create mode 100644 ocaml/CamlinternalOO/index.html create mode 100644 ocaml/Ccomp/index.html create mode 100644 ocaml/Clambda/index.html create mode 100644 ocaml/Clambda_primitives/index.html create mode 100644 ocaml/Clflags/Compiler_pass/index.html create mode 100644 ocaml/Clflags/Float_arg_helper/index.html create mode 100644 ocaml/Clflags/Int_arg_helper/index.html create mode 100644 ocaml/Clflags/index.html create mode 100644 ocaml/Closure/index.html create mode 100644 ocaml/Closure_conversion/index.html create mode 100644 ocaml/Closure_conversion_aux/Env/index.html create mode 100644 ocaml/Closure_conversion_aux/Function_decls/Function_decl/index.html create mode 100644 ocaml/Closure_conversion_aux/Function_decls/index.html create mode 100644 ocaml/Closure_conversion_aux/index.html create mode 100644 ocaml/Closure_element/Map/index.html create mode 100644 ocaml/Closure_element/Set/index.html create mode 100644 ocaml/Closure_element/T/index.html create mode 100644 ocaml/Closure_element/Tbl/index.html create mode 100644 ocaml/Closure_element/index.html create mode 100644 ocaml/Closure_id/Map/index.html create mode 100644 ocaml/Closure_id/Set/index.html create mode 100644 ocaml/Closure_id/T/index.html create mode 100644 ocaml/Closure_id/Tbl/index.html create mode 100644 ocaml/Closure_id/index.html create mode 100644 ocaml/Closure_middle_end/index.html create mode 100644 ocaml/Closure_offsets/index.html create mode 100644 ocaml/Closure_origin/Map/index.html create mode 100644 ocaml/Closure_origin/Set/index.html create mode 100644 ocaml/Closure_origin/T/index.html create mode 100644 ocaml/Closure_origin/Tbl/index.html create mode 100644 ocaml/Closure_origin/index.html create mode 100644 ocaml/Cmi_format/index.html create mode 100644 ocaml/Cmm/index.html create mode 100644 ocaml/Cmm_helpers/index.html create mode 100644 ocaml/Cmm_invariants/index.html create mode 100644 ocaml/Cmmgen/index.html create mode 100644 ocaml/Cmmgen_state/index.html create mode 100644 ocaml/Cmo_format/index.html create mode 100644 ocaml/Cmt2annot/index.html create mode 100644 ocaml/Cmt_format/index.html create mode 100644 ocaml/Cmx_format/index.html create mode 100644 ocaml/Cmxs_format/index.html create mode 100644 ocaml/Coloring/index.html create mode 100644 ocaml/Comballoc/index.html create mode 100644 ocaml/Compenv/index.html create mode 100644 ocaml/Compilation_unit/Map/index.html create mode 100644 ocaml/Compilation_unit/Set/index.html create mode 100644 ocaml/Compilation_unit/T/index.html create mode 100644 ocaml/Compilation_unit/Tbl/index.html create mode 100644 ocaml/Compilation_unit/index.html create mode 100644 ocaml/Compile/index.html create mode 100644 ocaml/Compile_common/index.html create mode 100644 ocaml/Compilenv/index.html create mode 100644 ocaml/Compmisc/index.html create mode 100644 ocaml/Compression/index.html create mode 100644 ocaml/Config/index.html create mode 100644 ocaml/Config_boot/index.html create mode 100644 ocaml/Config_main/index.html create mode 100644 ocaml/Consistbl/Make/argument-1-Module_name/Map/index.html create mode 100644 ocaml/Consistbl/Make/argument-1-Module_name/Set/index.html create mode 100644 ocaml/Consistbl/Make/argument-1-Module_name/Tbl/index.html create mode 100644 ocaml/Consistbl/Make/argument-1-Module_name/index.html create mode 100644 ocaml/Consistbl/Make/index.html create mode 100644 ocaml/Consistbl/index.html create mode 100644 ocaml/Convert_primitives/index.html create mode 100644 ocaml/Ctype/Pattern_env/index.html create mode 100644 ocaml/Ctype/index.html create mode 100644 ocaml/Dataflow/Backward/argument-1-D/index.html create mode 100644 ocaml/Dataflow/Backward/index.html create mode 100644 ocaml/Dataflow/index.html create mode 100644 ocaml/Dataflow/module-type-DOMAIN/index.html create mode 100644 ocaml/Datarepr/index.html create mode 100644 ocaml/Deadcode/index.html create mode 100644 ocaml/Debuginfo/Scoped_location/index.html create mode 100644 ocaml/Debuginfo/index.html create mode 100644 ocaml/Depend/index.html create mode 100644 ocaml/Diffing/Define/Left_variadic/argument-1-_/index.html create mode 100644 ocaml/Diffing/Define/Left_variadic/index.html create mode 100644 ocaml/Diffing/Define/Right_variadic/argument-1-_/index.html create mode 100644 ocaml/Diffing/Define/Right_variadic/index.html create mode 100644 ocaml/Diffing/Define/Simple/argument-1-_/index.html create mode 100644 ocaml/Diffing/Define/Simple/index.html create mode 100644 ocaml/Diffing/Define/argument-1-D/index.html create mode 100644 ocaml/Diffing/Define/index.html create mode 100644 ocaml/Diffing/Define/module-type-Parameters/index.html create mode 100644 ocaml/Diffing/Define/module-type-S/index.html create mode 100644 ocaml/Diffing/index.html create mode 100644 ocaml/Diffing/module-type-Defs/index.html create mode 100644 ocaml/Diffing_with_keys/Define/Simple/argument-1-_/index.html create mode 100644 ocaml/Diffing_with_keys/Define/Simple/index.html create mode 100644 ocaml/Diffing_with_keys/Define/argument-1-D/index.html create mode 100644 ocaml/Diffing_with_keys/Define/index.html create mode 100644 ocaml/Diffing_with_keys/Define/module-type-Parameters/index.html create mode 100644 ocaml/Diffing_with_keys/index.html create mode 100644 ocaml/Dll/index.html create mode 100644 ocaml/Docstrings/WithMenhir/index.html create mode 100644 ocaml/Docstrings/index.html create mode 100644 ocaml/Domainstate/index.html create mode 100644 ocaml/Dynlink/index.html create mode 100644 ocaml/Effect_analysis/index.html create mode 100644 ocaml/Emit/index.html create mode 100644 ocaml/Emitaux/index.html create mode 100644 ocaml/Emitcode/index.html create mode 100644 ocaml/Emitenv/index.html create mode 100644 ocaml/Env/index.html create mode 100644 ocaml/Envaux/index.html create mode 100644 ocaml/Errors/index.html create mode 100644 ocaml/Errortrace/Subtype/index.html create mode 100644 ocaml/Errortrace/index.html create mode 100644 ocaml/Event/index.html create mode 100644 ocaml/Export_id/Map/index.html create mode 100644 ocaml/Export_id/Set/index.html create mode 100644 ocaml/Export_id/T/index.html create mode 100644 ocaml/Export_id/Tbl/index.html create mode 100644 ocaml/Export_id/index.html create mode 100644 ocaml/Export_info/index.html create mode 100644 ocaml/Export_info_for_pack/index.html create mode 100644 ocaml/Expunge/index.html create mode 100644 ocaml/Extract_projections/index.html create mode 100644 ocaml/Find_recursive_functions/index.html create mode 100644 ocaml/Flambda/Constant_defining_value/Map/index.html create mode 100644 ocaml/Flambda/Constant_defining_value/Set/index.html create mode 100644 ocaml/Flambda/Constant_defining_value/T/index.html create mode 100644 ocaml/Flambda/Constant_defining_value/Tbl/index.html create mode 100644 ocaml/Flambda/Constant_defining_value/index.html create mode 100644 ocaml/Flambda/With_free_variables/index.html create mode 100644 ocaml/Flambda/index.html create mode 100644 ocaml/Flambda_invariants/index.html create mode 100644 ocaml/Flambda_iterators/index.html create mode 100644 ocaml/Flambda_middle_end/index.html create mode 100644 ocaml/Flambda_to_clambda/index.html create mode 100644 ocaml/Flambda_utils/Switch_storer/index.html create mode 100644 ocaml/Flambda_utils/index.html create mode 100644 ocaml/Freshening/Project_var/index.html create mode 100644 ocaml/Freshening/index.html create mode 100644 ocaml/Genprintval/Make/argument-1-O/index.html create mode 100644 ocaml/Genprintval/Make/argument-2-_/index.html create mode 100644 ocaml/Genprintval/Make/index.html create mode 100644 ocaml/Genprintval/index.html create mode 100644 ocaml/Genprintval/module-type-EVALPATH/index.html create mode 100644 ocaml/Genprintval/module-type-OBJ/index.html create mode 100644 ocaml/Genprintval/module-type-S/index.html create mode 100644 ocaml/Id_types/Id/index.html create mode 100644 ocaml/Id_types/UnitId/argument-1-_/index.html create mode 100644 ocaml/Id_types/UnitId/argument-2-Compilation_unit/index.html create mode 100644 ocaml/Id_types/UnitId/index.html create mode 100644 ocaml/Id_types/index.html create mode 100644 ocaml/Id_types/module-type-BaseId/index.html create mode 100644 ocaml/Id_types/module-type-Id/index.html create mode 100644 ocaml/Id_types/module-type-UnitId/Compilation_unit/index.html create mode 100644 ocaml/Id_types/module-type-UnitId/index.html create mode 100644 ocaml/Ident/Map/index.html create mode 100644 ocaml/Ident/Set/index.html create mode 100644 ocaml/Ident/T/index.html create mode 100644 ocaml/Ident/Tbl/index.html create mode 100644 ocaml/Ident/index.html create mode 100644 ocaml/Identifiable/Make/Map/index.html create mode 100644 ocaml/Identifiable/Make/Set/index.html create mode 100644 ocaml/Identifiable/Make/T/index.html create mode 100644 ocaml/Identifiable/Make/Tbl/index.html create mode 100644 ocaml/Identifiable/Make/argument-1-T/index.html create mode 100644 ocaml/Identifiable/Make/index.html create mode 100644 ocaml/Identifiable/Pair/argument-1-A/index.html create mode 100644 ocaml/Identifiable/Pair/argument-2-B/index.html create mode 100644 ocaml/Identifiable/Pair/index.html create mode 100644 ocaml/Identifiable/index.html create mode 100644 ocaml/Identifiable/module-type-Map/T/index.html create mode 100644 ocaml/Identifiable/module-type-Map/index.html create mode 100644 ocaml/Identifiable/module-type-S/Map/index.html create mode 100644 ocaml/Identifiable/module-type-S/Set/index.html create mode 100644 ocaml/Identifiable/module-type-S/T/index.html create mode 100644 ocaml/Identifiable/module-type-S/Tbl/index.html create mode 100644 ocaml/Identifiable/module-type-S/index.html create mode 100644 ocaml/Identifiable/module-type-Set/T/index.html create mode 100644 ocaml/Identifiable/module-type-Set/index.html create mode 100644 ocaml/Identifiable/module-type-Tbl/T/index.html create mode 100644 ocaml/Identifiable/module-type-Tbl/index.html create mode 100644 ocaml/Identifiable/module-type-Thing/index.html create mode 100644 ocaml/Import_approx/index.html create mode 100644 ocaml/Includeclass/index.html create mode 100644 ocaml/Includecore/index.html create mode 100644 ocaml/Includemod/Error/index.html create mode 100644 ocaml/Includemod/FieldMap/index.html create mode 100644 ocaml/Includemod/Functor_app_diff/Defs/index.html create mode 100644 ocaml/Includemod/Functor_app_diff/index.html create mode 100644 ocaml/Includemod/Functor_inclusion_diff/Defs/index.html create mode 100644 ocaml/Includemod/Functor_inclusion_diff/index.html create mode 100644 ocaml/Includemod/index.html create mode 100644 ocaml/Includemod_errorprinter/index.html create mode 100644 ocaml/Inconstant_idents/index.html create mode 100644 ocaml/Initialize_symbol_to_let_symbol/index.html create mode 100644 ocaml/Inline_and_simplify/index.html create mode 100644 ocaml/Inline_and_simplify_aux/Env/index.html create mode 100644 ocaml/Inline_and_simplify_aux/Result/index.html create mode 100644 ocaml/Inline_and_simplify_aux/index.html create mode 100644 ocaml/Inlining_cost/Benefit/index.html create mode 100644 ocaml/Inlining_cost/Threshold/index.html create mode 100644 ocaml/Inlining_cost/Whether_sufficient_benefit/index.html create mode 100644 ocaml/Inlining_cost/index.html create mode 100644 ocaml/Inlining_decision/index.html create mode 100644 ocaml/Inlining_decision_intf/index.html create mode 100644 ocaml/Inlining_stats/Closure_stack/index.html create mode 100644 ocaml/Inlining_stats/index.html create mode 100644 ocaml/Inlining_stats_types/Decision/index.html create mode 100644 ocaml/Inlining_stats_types/Inlined/index.html create mode 100644 ocaml/Inlining_stats_types/Not_inlined/index.html create mode 100644 ocaml/Inlining_stats_types/Not_specialised/index.html create mode 100644 ocaml/Inlining_stats_types/Prevented/index.html create mode 100644 ocaml/Inlining_stats_types/Specialised/index.html create mode 100644 ocaml/Inlining_stats_types/index.html create mode 100644 ocaml/Inlining_transforms/index.html create mode 100644 ocaml/Instruct/index.html create mode 100644 ocaml/Int_replace_polymorphic_compare/index.html create mode 100644 ocaml/Interf/index.html create mode 100644 ocaml/Internal_variable_names/index.html create mode 100644 ocaml/Interval/index.html create mode 100644 ocaml/Invariant_params/index.html create mode 100644 ocaml/Lambda/index.html create mode 100644 ocaml/Lazy_backtrack/index.html create mode 100644 ocaml/Lexer/index.html create mode 100644 ocaml/Lift_code/index.html create mode 100644 ocaml/Lift_constants/index.html create mode 100644 ocaml/Lift_let_to_initialize_symbol/index.html create mode 100644 ocaml/Linear/index.html create mode 100644 ocaml/Linear_format/index.html create mode 100644 ocaml/Linearize/index.html create mode 100644 ocaml/Linkage_name/Map/index.html create mode 100644 ocaml/Linkage_name/Set/index.html create mode 100644 ocaml/Linkage_name/T/index.html create mode 100644 ocaml/Linkage_name/Tbl/index.html create mode 100644 ocaml/Linkage_name/index.html create mode 100644 ocaml/Linscan/index.html create mode 100644 ocaml/Liveness/index.html create mode 100644 ocaml/Load_path/Dir/index.html create mode 100644 ocaml/Load_path/index.html create mode 100644 ocaml/Local_store/index.html create mode 100644 ocaml/Location/index.html create mode 100644 ocaml/Longident/index.html create mode 100644 ocaml/Mach/index.html create mode 100644 ocaml/Main/index.html create mode 100644 ocaml/Main_args/Default/Main/index.html create mode 100644 ocaml/Main_args/Default/Odoc_args/index.html create mode 100644 ocaml/Main_args/Default/Optmain/index.html create mode 100644 ocaml/Main_args/Default/Opttopmain/index.html create mode 100644 ocaml/Main_args/Default/Topmain/index.html create mode 100644 ocaml/Main_args/Default/index.html create mode 100644 ocaml/Main_args/Make_bytecomp_options/argument-1-_/index.html create mode 100644 ocaml/Main_args/Make_bytecomp_options/index.html create mode 100644 ocaml/Main_args/Make_bytetop_options/argument-1-_/index.html create mode 100644 ocaml/Main_args/Make_bytetop_options/index.html create mode 100644 ocaml/Main_args/Make_ocamldoc_options/argument-1-_/index.html create mode 100644 ocaml/Main_args/Make_ocamldoc_options/index.html create mode 100644 ocaml/Main_args/Make_optcomp_options/argument-1-_/index.html create mode 100644 ocaml/Main_args/Make_optcomp_options/index.html create mode 100644 ocaml/Main_args/Make_opttop_options/argument-1-_/index.html create mode 100644 ocaml/Main_args/Make_opttop_options/index.html create mode 100644 ocaml/Main_args/index.html create mode 100644 ocaml/Main_args/module-type-Arg_list/index.html create mode 100644 ocaml/Main_args/module-type-Bytecomp_options/index.html create mode 100644 ocaml/Main_args/module-type-Bytetop_options/index.html create mode 100644 ocaml/Main_args/module-type-Common_options/index.html create mode 100644 ocaml/Main_args/module-type-Compiler_options/index.html create mode 100644 ocaml/Main_args/module-type-Core_options/index.html create mode 100644 ocaml/Main_args/module-type-Ocamldoc_options/index.html create mode 100644 ocaml/Main_args/module-type-Optcommon_options/index.html create mode 100644 ocaml/Main_args/module-type-Optcomp_options/index.html create mode 100644 ocaml/Main_args/module-type-Opttop_options/index.html create mode 100644 ocaml/Main_args/module-type-Toplevel_options/index.html create mode 100644 ocaml/Maindriver/index.html create mode 100644 ocaml/Makedepend/index.html create mode 100644 ocaml/Matching/index.html create mode 100644 ocaml/Meta/index.html create mode 100644 ocaml/Misc/Color/index.html create mode 100644 ocaml/Misc/Error_style/index.html create mode 100644 ocaml/Misc/Int_literal_converter/index.html create mode 100644 ocaml/Misc/Magic_number/index.html create mode 100644 ocaml/Misc/Stdlib/Array/index.html create mode 100644 ocaml/Misc/Stdlib/List/index.html create mode 100644 ocaml/Misc/Stdlib/Option/index.html create mode 100644 ocaml/Misc/Stdlib/String/Map/index.html create mode 100644 ocaml/Misc/Stdlib/String/Set/index.html create mode 100644 ocaml/Misc/Stdlib/String/Tbl/index.html create mode 100644 ocaml/Misc/Stdlib/String/index.html create mode 100644 ocaml/Misc/Stdlib/index.html create mode 100644 ocaml/Misc/Style/index.html create mode 100644 ocaml/Misc/index.html create mode 100644 ocaml/Mtype/index.html create mode 100644 ocaml/Mutable_variable/Map/index.html create mode 100644 ocaml/Mutable_variable/Set/index.html create mode 100644 ocaml/Mutable_variable/T/index.html create mode 100644 ocaml/Mutable_variable/Tbl/index.html create mode 100644 ocaml/Mutable_variable/index.html create mode 100644 ocaml/Numbers/Float/Map/index.html create mode 100644 ocaml/Numbers/Float/Set/index.html create mode 100644 ocaml/Numbers/Float/T/index.html create mode 100644 ocaml/Numbers/Float/Tbl/index.html create mode 100644 ocaml/Numbers/Float/index.html create mode 100644 ocaml/Numbers/Int/Map/index.html create mode 100644 ocaml/Numbers/Int/Set/index.html create mode 100644 ocaml/Numbers/Int/T/index.html create mode 100644 ocaml/Numbers/Int/Tbl/index.html create mode 100644 ocaml/Numbers/Int/index.html create mode 100644 ocaml/Numbers/Int16/index.html create mode 100644 ocaml/Numbers/Int8/index.html create mode 100644 ocaml/Numbers/index.html create mode 100644 ocaml/Odoc/index.html create mode 100644 ocaml/Odoc_analyse/index.html create mode 100644 ocaml/Odoc_args/index.html create mode 100644 ocaml/Odoc_ast/Analyser/argument-1-_/index.html create mode 100644 ocaml/Odoc_ast/Analyser/index.html create mode 100644 ocaml/Odoc_ast/Typedtree_search/index.html create mode 100644 ocaml/Odoc_ast/index.html create mode 100644 ocaml/Odoc_class/index.html create mode 100644 ocaml/Odoc_comments/Basic_info_retriever/index.html create mode 100644 ocaml/Odoc_comments/index.html create mode 100644 ocaml/Odoc_comments/module-type-Texter/index.html create mode 100644 ocaml/Odoc_comments_global/index.html create mode 100644 ocaml/Odoc_config/index.html create mode 100644 ocaml/Odoc_cross/index.html create mode 100644 ocaml/Odoc_dag2html/index.html create mode 100644 ocaml/Odoc_dep/index.html create mode 100644 ocaml/Odoc_dot/Generator/class-dot/index.html create mode 100644 ocaml/Odoc_dot/Generator/index.html create mode 100644 ocaml/Odoc_dot/index.html create mode 100644 ocaml/Odoc_dot/module-type-Dot_generator/class-dot/index.html create mode 100644 ocaml/Odoc_dot/module-type-Dot_generator/index.html create mode 100644 ocaml/Odoc_env/index.html create mode 100644 ocaml/Odoc_exception/index.html create mode 100644 ocaml/Odoc_extension/index.html create mode 100644 ocaml/Odoc_gen/Base_generator/class-generator/index.html create mode 100644 ocaml/Odoc_gen/Base_generator/index.html create mode 100644 ocaml/Odoc_gen/class-type-doc_generator/index.html create mode 100644 ocaml/Odoc_gen/index.html create mode 100644 ocaml/Odoc_gen/module-type-Base/class-generator/index.html create mode 100644 ocaml/Odoc_gen/module-type-Base/index.html create mode 100644 ocaml/Odoc_gen/module-type-Base_functor/argument-1-_/class-generator/index.html create mode 100644 ocaml/Odoc_gen/module-type-Base_functor/argument-1-_/index.html create mode 100644 ocaml/Odoc_gen/module-type-Base_functor/class-generator/index.html create mode 100644 ocaml/Odoc_gen/module-type-Base_functor/index.html create mode 100644 ocaml/Odoc_gen/module-type-Dot_functor/argument-1-_/class-dot/index.html create mode 100644 ocaml/Odoc_gen/module-type-Dot_functor/argument-1-_/index.html create mode 100644 ocaml/Odoc_gen/module-type-Dot_functor/class-dot/index.html create mode 100644 ocaml/Odoc_gen/module-type-Dot_functor/index.html create mode 100644 ocaml/Odoc_gen/module-type-Html_functor/argument-1-_/class-html/index.html create mode 100644 ocaml/Odoc_gen/module-type-Html_functor/argument-1-_/index.html create mode 100644 ocaml/Odoc_gen/module-type-Html_functor/class-html/index.html create mode 100644 ocaml/Odoc_gen/module-type-Html_functor/index.html create mode 100644 ocaml/Odoc_gen/module-type-Latex_functor/argument-1-_/class-latex/index.html create mode 100644 ocaml/Odoc_gen/module-type-Latex_functor/argument-1-_/index.html create mode 100644 ocaml/Odoc_gen/module-type-Latex_functor/class-latex/index.html create mode 100644 ocaml/Odoc_gen/module-type-Latex_functor/index.html create mode 100644 ocaml/Odoc_gen/module-type-Man_functor/argument-1-_/class-man/index.html create mode 100644 ocaml/Odoc_gen/module-type-Man_functor/argument-1-_/index.html create mode 100644 ocaml/Odoc_gen/module-type-Man_functor/class-man/index.html create mode 100644 ocaml/Odoc_gen/module-type-Man_functor/index.html create mode 100644 ocaml/Odoc_gen/module-type-Texi_functor/argument-1-_/class-texi/index.html create mode 100644 ocaml/Odoc_gen/module-type-Texi_functor/argument-1-_/index.html create mode 100644 ocaml/Odoc_gen/module-type-Texi_functor/class-texi/index.html create mode 100644 ocaml/Odoc_gen/module-type-Texi_functor/index.html create mode 100644 ocaml/Odoc_global/index.html create mode 100644 ocaml/Odoc_html/Generator/class-html/index.html create mode 100644 ocaml/Odoc_html/Generator/index.html create mode 100644 ocaml/Odoc_html/Naming/index.html create mode 100644 ocaml/Odoc_html/index.html create mode 100644 ocaml/Odoc_html/module-type-Html_generator/class-html/index.html create mode 100644 ocaml/Odoc_html/module-type-Html_generator/index.html create mode 100644 ocaml/Odoc_info/Class/index.html create mode 100644 ocaml/Odoc_info/Dep/index.html create mode 100644 ocaml/Odoc_info/Exception/index.html create mode 100644 ocaml/Odoc_info/Extension/index.html create mode 100644 ocaml/Odoc_info/Global/index.html create mode 100644 ocaml/Odoc_info/Module/index.html create mode 100644 ocaml/Odoc_info/Name/index.html create mode 100644 ocaml/Odoc_info/Parameter/index.html create mode 100644 ocaml/Odoc_info/Scan/class-scanner/index.html create mode 100644 ocaml/Odoc_info/Scan/index.html create mode 100644 ocaml/Odoc_info/Search/index.html create mode 100644 ocaml/Odoc_info/Type/index.html create mode 100644 ocaml/Odoc_info/Value/index.html create mode 100644 ocaml/Odoc_info/index.html create mode 100644 ocaml/Odoc_latex/Generator/class-latex/index.html create mode 100644 ocaml/Odoc_latex/Generator/index.html create mode 100644 ocaml/Odoc_latex/index.html create mode 100644 ocaml/Odoc_latex/module-type-Latex_generator/class-latex/index.html create mode 100644 ocaml/Odoc_latex/module-type-Latex_generator/index.html create mode 100644 ocaml/Odoc_latex_style/index.html create mode 100644 ocaml/Odoc_lexer/index.html create mode 100644 ocaml/Odoc_man/Generator/class-man/index.html create mode 100644 ocaml/Odoc_man/Generator/index.html create mode 100644 ocaml/Odoc_man/index.html create mode 100644 ocaml/Odoc_man/module-type-Man_generator/class-man/index.html create mode 100644 ocaml/Odoc_man/module-type-Man_generator/index.html create mode 100644 ocaml/Odoc_merge/index.html create mode 100644 ocaml/Odoc_messages/index.html create mode 100644 ocaml/Odoc_misc/index.html create mode 100644 ocaml/Odoc_module/index.html create mode 100644 ocaml/Odoc_name/Map/index.html create mode 100644 ocaml/Odoc_name/index.html create mode 100644 ocaml/Odoc_ocamlhtml/index.html create mode 100644 ocaml/Odoc_parameter/index.html create mode 100644 ocaml/Odoc_parser/index.html create mode 100644 ocaml/Odoc_print/index.html create mode 100644 ocaml/Odoc_scan/class-scanner/index.html create mode 100644 ocaml/Odoc_scan/index.html create mode 100644 ocaml/Odoc_search/P_name/index.html create mode 100644 ocaml/Odoc_search/Search/argument-1-P/index.html create mode 100644 ocaml/Odoc_search/Search/index.html create mode 100644 ocaml/Odoc_search/Search_by_name/index.html create mode 100644 ocaml/Odoc_search/index.html create mode 100644 ocaml/Odoc_search/module-type-Predicates/index.html create mode 100644 ocaml/Odoc_see_lexer/index.html create mode 100644 ocaml/Odoc_sig/Analyser/argument-1-_/index.html create mode 100644 ocaml/Odoc_sig/Analyser/index.html create mode 100644 ocaml/Odoc_sig/Signature_search/index.html create mode 100644 ocaml/Odoc_sig/index.html create mode 100644 ocaml/Odoc_sig/module-type-Info_retriever/index.html create mode 100644 ocaml/Odoc_str/index.html create mode 100644 ocaml/Odoc_test/index.html create mode 100644 ocaml/Odoc_texi/Generator/class-texi/index.html create mode 100644 ocaml/Odoc_texi/Generator/index.html create mode 100644 ocaml/Odoc_texi/index.html create mode 100644 ocaml/Odoc_texi/module-type-Texi_generator/class-texi/index.html create mode 100644 ocaml/Odoc_texi/module-type-Texi_generator/index.html create mode 100644 ocaml/Odoc_text/Texter/index.html create mode 100644 ocaml/Odoc_text/index.html create mode 100644 ocaml/Odoc_text_lexer/index.html create mode 100644 ocaml/Odoc_text_parser/index.html create mode 100644 ocaml/Odoc_to_text/class-to_text/index.html create mode 100644 ocaml/Odoc_to_text/index.html create mode 100644 ocaml/Odoc_type/index.html create mode 100644 ocaml/Odoc_types/index.html create mode 100644 ocaml/Odoc_value/index.html create mode 100644 ocaml/Opcodes/index.html create mode 100644 ocaml/Oprint/index.html create mode 100644 ocaml/Optcompile/index.html create mode 100644 ocaml/Opterrors/index.html create mode 100644 ocaml/Optmain/index.html create mode 100644 ocaml/Optmaindriver/index.html create mode 100644 ocaml/Outcometree/index.html create mode 100644 ocaml/Parameter/List/index.html create mode 100644 ocaml/Parameter/Map/index.html create mode 100644 ocaml/Parameter/Set/index.html create mode 100644 ocaml/Parameter/T/index.html create mode 100644 ocaml/Parameter/Tbl/index.html create mode 100644 ocaml/Parameter/index.html create mode 100644 ocaml/Parmatch/Compat/argument-1-_/index.html create mode 100644 ocaml/Parmatch/Compat/index.html create mode 100644 ocaml/Parmatch/index.html create mode 100644 ocaml/Parse/index.html create mode 100644 ocaml/Parser/Incremental/index.html create mode 100644 ocaml/Parser/MenhirInterpreter/index.html create mode 100644 ocaml/Parser/index.html create mode 100644 ocaml/Parsetree/index.html create mode 100644 ocaml/Pass_wrapper/index.html create mode 100644 ocaml/Path/Map/index.html create mode 100644 ocaml/Path/Set/index.html create mode 100644 ocaml/Path/index.html create mode 100644 ocaml/Patterns/General/index.html create mode 100644 ocaml/Patterns/Half_simple/index.html create mode 100644 ocaml/Patterns/Head/index.html create mode 100644 ocaml/Patterns/Non_empty_row/index.html create mode 100644 ocaml/Patterns/Simple/index.html create mode 100644 ocaml/Patterns/index.html create mode 100644 ocaml/Persistent_env/Consistbl/index.html create mode 100644 ocaml/Persistent_env/Persistent_signature/index.html create mode 100644 ocaml/Persistent_env/index.html create mode 100644 ocaml/Polling/index.html create mode 100644 ocaml/Pparse/index.html create mode 100644 ocaml/Pprintast/index.html create mode 100644 ocaml/Predef/index.html create mode 100644 ocaml/Primitive/index.html create mode 100644 ocaml/Printast/index.html create mode 100644 ocaml/Printclambda/index.html create mode 100644 ocaml/Printclambda_primitives/index.html create mode 100644 ocaml/Printcmm/index.html create mode 100644 ocaml/Printinstr/index.html create mode 100644 ocaml/Printlambda/index.html create mode 100644 ocaml/Printlinear/index.html create mode 100644 ocaml/Printmach/index.html create mode 100644 ocaml/Printpat/index.html create mode 100644 ocaml/Printtyp/Conflicts/index.html create mode 100644 ocaml/Printtyp/Naming_context/index.html create mode 100644 ocaml/Printtyp/Out_name/index.html create mode 100644 ocaml/Printtyp/Subtype/index.html create mode 100644 ocaml/Printtyp/index.html create mode 100644 ocaml/Printtyped/index.html create mode 100644 ocaml/Proc/index.html create mode 100644 ocaml/Profile/index.html create mode 100644 ocaml/Profiling/index.html create mode 100644 ocaml/Projection/Map/index.html create mode 100644 ocaml/Projection/Set/index.html create mode 100644 ocaml/Projection/T/index.html create mode 100644 ocaml/Projection/Tbl/index.html create mode 100644 ocaml/Projection/index.html create mode 100644 ocaml/Ref_to_variables/index.html create mode 100644 ocaml/Reg/Map/index.html create mode 100644 ocaml/Reg/Raw_name/index.html create mode 100644 ocaml/Reg/Set/index.html create mode 100644 ocaml/Reg/index.html create mode 100644 ocaml/Reload/index.html create mode 100644 ocaml/Reloadgen/class-reload_generic/index.html create mode 100644 ocaml/Reloadgen/index.html create mode 100644 ocaml/Remove_free_vars_equal_to_args/index.html create mode 100644 ocaml/Remove_unused_arguments/index.html create mode 100644 ocaml/Remove_unused_closure_vars/index.html create mode 100644 ocaml/Remove_unused_program_constructs/index.html create mode 100644 ocaml/Runtime_events/Callbacks/index.html create mode 100644 ocaml/Runtime_events/Timestamp/index.html create mode 100644 ocaml/Runtime_events/Type/index.html create mode 100644 ocaml/Runtime_events/User/index.html create mode 100644 ocaml/Runtime_events/index.html create mode 100644 ocaml/Runtimedef/index.html create mode 100644 ocaml/Schedgen/class-scheduler_generic/index.html create mode 100644 ocaml/Schedgen/index.html create mode 100644 ocaml/Scheduling/index.html create mode 100644 ocaml/Selectgen/Coeffect/index.html create mode 100644 ocaml/Selectgen/Effect/index.html create mode 100644 ocaml/Selectgen/Effect_and_coeffect/index.html create mode 100644 ocaml/Selectgen/class-selector_generic/index.html create mode 100644 ocaml/Selectgen/index.html create mode 100644 ocaml/Selection/index.html create mode 100644 ocaml/Semantics_of_primitives/index.html create mode 100644 ocaml/Set_of_closures_id/Map/index.html create mode 100644 ocaml/Set_of_closures_id/Set/index.html create mode 100644 ocaml/Set_of_closures_id/T/index.html create mode 100644 ocaml/Set_of_closures_id/Tbl/index.html create mode 100644 ocaml/Set_of_closures_id/index.html create mode 100644 ocaml/Set_of_closures_origin/Map/index.html create mode 100644 ocaml/Set_of_closures_origin/Set/index.html create mode 100644 ocaml/Set_of_closures_origin/T/index.html create mode 100644 ocaml/Set_of_closures_origin/Tbl/index.html create mode 100644 ocaml/Set_of_closures_origin/index.html create mode 100644 ocaml/Shape/Item/Map/index.html create mode 100644 ocaml/Shape/Item/index.html create mode 100644 ocaml/Shape/Map/index.html create mode 100644 ocaml/Shape/Sig_component_kind/index.html create mode 100644 ocaml/Shape/Uid/Map/index.html create mode 100644 ocaml/Shape/Uid/Set/index.html create mode 100644 ocaml/Shape/Uid/T/index.html create mode 100644 ocaml/Shape/Uid/Tbl/index.html create mode 100644 ocaml/Shape/Uid/index.html create mode 100644 ocaml/Shape/index.html create mode 100644 ocaml/Shape_reduce/Make/argument-1-_/index.html create mode 100644 ocaml/Shape_reduce/Make/index.html create mode 100644 ocaml/Shape_reduce/index.html create mode 100644 ocaml/Share_constants/index.html create mode 100644 ocaml/Signature_group/index.html create mode 100644 ocaml/Simple_value_approx/index.html create mode 100644 ocaml/Simplif/index.html create mode 100644 ocaml/Simplify_boxed_integer_ops/Simplify_boxed_int32/index.html create mode 100644 ocaml/Simplify_boxed_integer_ops/Simplify_boxed_int64/index.html create mode 100644 ocaml/Simplify_boxed_integer_ops/Simplify_boxed_nativeint/index.html create mode 100644 ocaml/Simplify_boxed_integer_ops/index.html create mode 100644 ocaml/Simplify_boxed_integer_ops_intf/index.html create mode 100644 ocaml/Simplify_boxed_integer_ops_intf/module-type-S/index.html create mode 100644 ocaml/Simplify_common/index.html create mode 100644 ocaml/Simplify_primitives/index.html create mode 100644 ocaml/Spill/index.html create mode 100644 ocaml/Split/index.html create mode 100644 ocaml/Stackframe/index.html create mode 100644 ocaml/Stackframegen/class-stackframe_generic/index.html create mode 100644 ocaml/Stackframegen/index.html create mode 100644 ocaml/Static_exception/Map/index.html create mode 100644 ocaml/Static_exception/Set/index.html create mode 100644 ocaml/Static_exception/T/index.html create mode 100644 ocaml/Static_exception/Tbl/index.html create mode 100644 ocaml/Static_exception/index.html create mode 100644 ocaml/Std_exit/index.html create mode 100644 ocaml/Stdlib/Arg/index.html create mode 100644 ocaml/Stdlib/Array/index.html create mode 100644 ocaml/Stdlib/ArrayLabels/index.html create mode 100644 ocaml/Stdlib/Atomic/index.html create mode 100644 ocaml/Stdlib/Bigarray/Array0/index.html create mode 100644 ocaml/Stdlib/Bigarray/Array1/index.html create mode 100644 ocaml/Stdlib/Bigarray/Array2/index.html create mode 100644 ocaml/Stdlib/Bigarray/Array3/index.html create mode 100644 ocaml/Stdlib/Bigarray/Genarray/index.html create mode 100644 ocaml/Stdlib/Bigarray/index.html create mode 100644 ocaml/Stdlib/Bool/index.html create mode 100644 ocaml/Stdlib/Buffer/index.html create mode 100644 ocaml/Stdlib/Bytes/index.html create mode 100644 ocaml/Stdlib/BytesLabels/index.html create mode 100644 ocaml/Stdlib/Callback/index.html create mode 100644 ocaml/Stdlib/Char/index.html create mode 100644 ocaml/Stdlib/Complex/index.html create mode 100644 ocaml/Stdlib/Condition/index.html create mode 100644 ocaml/Stdlib/Digest/BLAKE128/index.html create mode 100644 ocaml/Stdlib/Digest/BLAKE256/index.html create mode 100644 ocaml/Stdlib/Digest/BLAKE512/index.html create mode 100644 ocaml/Stdlib/Digest/MD5/index.html create mode 100644 ocaml/Stdlib/Digest/index.html create mode 100644 ocaml/Stdlib/Digest/module-type-S/index.html create mode 100644 ocaml/Stdlib/Domain/DLS/index.html create mode 100644 ocaml/Stdlib/Domain/index.html create mode 100644 ocaml/Stdlib/Dynarray/index.html create mode 100644 ocaml/Stdlib/Effect/Deep/index.html create mode 100644 ocaml/Stdlib/Effect/Shallow/index.html create mode 100644 ocaml/Stdlib/Effect/index.html create mode 100644 ocaml/Stdlib/Either/index.html create mode 100644 ocaml/Stdlib/Ephemeron/K1/Bucket/index.html create mode 100644 ocaml/Stdlib/Ephemeron/K1/Make/argument-1-H/index.html create mode 100644 ocaml/Stdlib/Ephemeron/K1/Make/index.html create mode 100644 ocaml/Stdlib/Ephemeron/K1/MakeSeeded/argument-1-H/index.html create mode 100644 ocaml/Stdlib/Ephemeron/K1/MakeSeeded/index.html create mode 100644 ocaml/Stdlib/Ephemeron/K1/index.html create mode 100644 ocaml/Stdlib/Ephemeron/K2/Bucket/index.html create mode 100644 ocaml/Stdlib/Ephemeron/K2/Make/argument-1-H1/index.html create mode 100644 ocaml/Stdlib/Ephemeron/K2/Make/argument-2-H2/index.html create mode 100644 ocaml/Stdlib/Ephemeron/K2/Make/index.html create mode 100644 ocaml/Stdlib/Ephemeron/K2/MakeSeeded/argument-1-H1/index.html create mode 100644 ocaml/Stdlib/Ephemeron/K2/MakeSeeded/argument-2-H2/index.html create mode 100644 ocaml/Stdlib/Ephemeron/K2/MakeSeeded/index.html create mode 100644 ocaml/Stdlib/Ephemeron/K2/index.html create mode 100644 ocaml/Stdlib/Ephemeron/Kn/Bucket/index.html create mode 100644 ocaml/Stdlib/Ephemeron/Kn/Make/argument-1-H/index.html create mode 100644 ocaml/Stdlib/Ephemeron/Kn/Make/index.html create mode 100644 ocaml/Stdlib/Ephemeron/Kn/MakeSeeded/argument-1-H/index.html create mode 100644 ocaml/Stdlib/Ephemeron/Kn/MakeSeeded/index.html create mode 100644 ocaml/Stdlib/Ephemeron/Kn/index.html create mode 100644 ocaml/Stdlib/Ephemeron/index.html create mode 100644 ocaml/Stdlib/Ephemeron/module-type-S/index.html create mode 100644 ocaml/Stdlib/Ephemeron/module-type-SeededS/index.html create mode 100644 ocaml/Stdlib/Filename/index.html create mode 100644 ocaml/Stdlib/Float/Array/index.html create mode 100644 ocaml/Stdlib/Float/ArrayLabels/index.html create mode 100644 ocaml/Stdlib/Float/index.html create mode 100644 ocaml/Stdlib/Format/index.html create mode 100644 ocaml/Stdlib/Fun/index.html create mode 100644 ocaml/Stdlib/Gc/Memprof/index.html create mode 100644 ocaml/Stdlib/Gc/index.html create mode 100644 ocaml/Stdlib/Hashtbl/Make/argument-1-H/index.html create mode 100644 ocaml/Stdlib/Hashtbl/Make/index.html create mode 100644 ocaml/Stdlib/Hashtbl/MakeSeeded/argument-1-H/index.html create mode 100644 ocaml/Stdlib/Hashtbl/MakeSeeded/index.html create mode 100644 ocaml/Stdlib/Hashtbl/index.html create mode 100644 ocaml/Stdlib/Hashtbl/module-type-HashedType/index.html create mode 100644 ocaml/Stdlib/Hashtbl/module-type-S/index.html create mode 100644 ocaml/Stdlib/Hashtbl/module-type-SeededHashedType/index.html create mode 100644 ocaml/Stdlib/Hashtbl/module-type-SeededS/index.html create mode 100644 ocaml/Stdlib/In_channel/index.html create mode 100644 ocaml/Stdlib/Int/index.html create mode 100644 ocaml/Stdlib/Int32/index.html create mode 100644 ocaml/Stdlib/Int64/index.html create mode 100644 ocaml/Stdlib/LargeFile/index.html create mode 100644 ocaml/Stdlib/Lazy/index.html create mode 100644 ocaml/Stdlib/Lexing/index.html create mode 100644 ocaml/Stdlib/List/index.html create mode 100644 ocaml/Stdlib/ListLabels/index.html create mode 100644 ocaml/Stdlib/Map/Make/argument-1-Ord/index.html create mode 100644 ocaml/Stdlib/Map/Make/index.html create mode 100644 ocaml/Stdlib/Map/index.html create mode 100644 ocaml/Stdlib/Map/module-type-OrderedType/index.html create mode 100644 ocaml/Stdlib/Map/module-type-S/index.html create mode 100644 ocaml/Stdlib/Marshal/index.html create mode 100644 ocaml/Stdlib/MoreLabels/Hashtbl/Make/argument-1-H/index.html create mode 100644 ocaml/Stdlib/MoreLabels/Hashtbl/Make/index.html create mode 100644 ocaml/Stdlib/MoreLabels/Hashtbl/MakeSeeded/argument-1-H/index.html create mode 100644 ocaml/Stdlib/MoreLabels/Hashtbl/MakeSeeded/index.html create mode 100644 ocaml/Stdlib/MoreLabels/Hashtbl/index.html create mode 100644 ocaml/Stdlib/MoreLabels/Hashtbl/module-type-HashedType/index.html create mode 100644 ocaml/Stdlib/MoreLabels/Hashtbl/module-type-S/index.html create mode 100644 ocaml/Stdlib/MoreLabels/Hashtbl/module-type-SeededHashedType/index.html create mode 100644 ocaml/Stdlib/MoreLabels/Hashtbl/module-type-SeededS/index.html create mode 100644 ocaml/Stdlib/MoreLabels/Map/Make/argument-1-Ord/index.html create mode 100644 ocaml/Stdlib/MoreLabels/Map/Make/index.html create mode 100644 ocaml/Stdlib/MoreLabels/Map/index.html create mode 100644 ocaml/Stdlib/MoreLabels/Map/module-type-OrderedType/index.html create mode 100644 ocaml/Stdlib/MoreLabels/Map/module-type-S/index.html create mode 100644 ocaml/Stdlib/MoreLabels/Set/Make/argument-1-Ord/index.html create mode 100644 ocaml/Stdlib/MoreLabels/Set/Make/index.html create mode 100644 ocaml/Stdlib/MoreLabels/Set/index.html create mode 100644 ocaml/Stdlib/MoreLabels/Set/module-type-OrderedType/index.html create mode 100644 ocaml/Stdlib/MoreLabels/Set/module-type-S/index.html create mode 100644 ocaml/Stdlib/MoreLabels/index.html create mode 100644 ocaml/Stdlib/Mutex/index.html create mode 100644 ocaml/Stdlib/Nativeint/index.html create mode 100644 ocaml/Stdlib/Obj/Ephemeron/index.html create mode 100644 ocaml/Stdlib/Obj/Extension_constructor/index.html create mode 100644 ocaml/Stdlib/Obj/index.html create mode 100644 ocaml/Stdlib/Oo/index.html create mode 100644 ocaml/Stdlib/Option/index.html create mode 100644 ocaml/Stdlib/Out_channel/index.html create mode 100644 ocaml/Stdlib/Parsing/index.html create mode 100644 ocaml/Stdlib/Printexc/Slot/index.html create mode 100644 ocaml/Stdlib/Printexc/index.html create mode 100644 ocaml/Stdlib/Printf/index.html create mode 100644 ocaml/Stdlib/Queue/index.html create mode 100644 ocaml/Stdlib/Random/State/index.html create mode 100644 ocaml/Stdlib/Random/index.html create mode 100644 ocaml/Stdlib/Result/index.html create mode 100644 ocaml/Stdlib/Scanf/Scanning/index.html create mode 100644 ocaml/Stdlib/Scanf/index.html create mode 100644 ocaml/Stdlib/Semaphore/Binary/index.html create mode 100644 ocaml/Stdlib/Semaphore/Counting/index.html create mode 100644 ocaml/Stdlib/Semaphore/index.html create mode 100644 ocaml/Stdlib/Seq/index.html create mode 100644 ocaml/Stdlib/Set/Make/argument-1-Ord/index.html create mode 100644 ocaml/Stdlib/Set/Make/index.html create mode 100644 ocaml/Stdlib/Set/index.html create mode 100644 ocaml/Stdlib/Set/module-type-OrderedType/index.html create mode 100644 ocaml/Stdlib/Set/module-type-S/index.html create mode 100644 ocaml/Stdlib/Stack/index.html create mode 100644 ocaml/Stdlib/StdLabels/index.html create mode 100644 ocaml/Stdlib/String/index.html create mode 100644 ocaml/Stdlib/StringLabels/index.html create mode 100644 ocaml/Stdlib/Sys/Immediate64/Make/argument-1-Immediate/index.html create mode 100644 ocaml/Stdlib/Sys/Immediate64/Make/argument-2-Non_immediate/index.html create mode 100644 ocaml/Stdlib/Sys/Immediate64/Make/index.html create mode 100644 ocaml/Stdlib/Sys/Immediate64/index.html create mode 100644 ocaml/Stdlib/Sys/Immediate64/module-type-Immediate/index.html create mode 100644 ocaml/Stdlib/Sys/Immediate64/module-type-Non_immediate/index.html create mode 100644 ocaml/Stdlib/Sys/index.html create mode 100644 ocaml/Stdlib/Type/Id/index.html create mode 100644 ocaml/Stdlib/Type/index.html create mode 100644 ocaml/Stdlib/Uchar/index.html create mode 100644 ocaml/Stdlib/Unit/index.html create mode 100644 ocaml/Stdlib/Weak/Make/argument-1-H/index.html create mode 100644 ocaml/Stdlib/Weak/Make/index.html create mode 100644 ocaml/Stdlib/Weak/index.html create mode 100644 ocaml/Stdlib/Weak/module-type-S/index.html create mode 100644 ocaml/Stdlib/index.html create mode 100644 ocaml/Stdlib__Arg/index.html create mode 100644 ocaml/Stdlib__Array/index.html create mode 100644 ocaml/Stdlib__ArrayLabels/index.html create mode 100644 ocaml/Stdlib__Atomic/index.html create mode 100644 ocaml/Stdlib__Bigarray/index.html create mode 100644 ocaml/Stdlib__Bool/index.html create mode 100644 ocaml/Stdlib__Buffer/index.html create mode 100644 ocaml/Stdlib__Bytes/index.html create mode 100644 ocaml/Stdlib__BytesLabels/index.html create mode 100644 ocaml/Stdlib__Callback/index.html create mode 100644 ocaml/Stdlib__Char/index.html create mode 100644 ocaml/Stdlib__Complex/index.html create mode 100644 ocaml/Stdlib__Condition/index.html create mode 100644 ocaml/Stdlib__Digest/index.html create mode 100644 ocaml/Stdlib__Domain/index.html create mode 100644 ocaml/Stdlib__Dynarray/index.html create mode 100644 ocaml/Stdlib__Effect/index.html create mode 100644 ocaml/Stdlib__Either/index.html create mode 100644 ocaml/Stdlib__Ephemeron/index.html create mode 100644 ocaml/Stdlib__Filename/index.html create mode 100644 ocaml/Stdlib__Float/index.html create mode 100644 ocaml/Stdlib__Format/index.html create mode 100644 ocaml/Stdlib__Fun/index.html create mode 100644 ocaml/Stdlib__Gc/index.html create mode 100644 ocaml/Stdlib__Hashtbl/index.html create mode 100644 ocaml/Stdlib__In_channel/index.html create mode 100644 ocaml/Stdlib__Int/index.html create mode 100644 ocaml/Stdlib__Int32/index.html create mode 100644 ocaml/Stdlib__Int64/index.html create mode 100644 ocaml/Stdlib__Lazy/index.html create mode 100644 ocaml/Stdlib__Lexing/index.html create mode 100644 ocaml/Stdlib__List/index.html create mode 100644 ocaml/Stdlib__ListLabels/index.html create mode 100644 ocaml/Stdlib__Map/index.html create mode 100644 ocaml/Stdlib__Marshal/index.html create mode 100644 ocaml/Stdlib__MoreLabels/index.html create mode 100644 ocaml/Stdlib__Mutex/index.html create mode 100644 ocaml/Stdlib__Nativeint/index.html create mode 100644 ocaml/Stdlib__Obj/index.html create mode 100644 ocaml/Stdlib__Oo/index.html create mode 100644 ocaml/Stdlib__Option/index.html create mode 100644 ocaml/Stdlib__Out_channel/index.html create mode 100644 ocaml/Stdlib__Parsing/index.html create mode 100644 ocaml/Stdlib__Printexc/index.html create mode 100644 ocaml/Stdlib__Printf/index.html create mode 100644 ocaml/Stdlib__Queue/index.html create mode 100644 ocaml/Stdlib__Random/index.html create mode 100644 ocaml/Stdlib__Result/index.html create mode 100644 ocaml/Stdlib__Scanf/index.html create mode 100644 ocaml/Stdlib__Semaphore/index.html create mode 100644 ocaml/Stdlib__Seq/index.html create mode 100644 ocaml/Stdlib__Set/index.html create mode 100644 ocaml/Stdlib__Stack/index.html create mode 100644 ocaml/Stdlib__StdLabels/index.html create mode 100644 ocaml/Stdlib__String/index.html create mode 100644 ocaml/Stdlib__StringLabels/index.html create mode 100644 ocaml/Stdlib__Sys/index.html create mode 100644 ocaml/Stdlib__Type/index.html create mode 100644 ocaml/Stdlib__Uchar/index.html create mode 100644 ocaml/Stdlib__Unit/index.html create mode 100644 ocaml/Stdlib__Weak/index.html create mode 100644 ocaml/Str/index.html create mode 100644 ocaml/Strmatch/Make/argument-1-_/index.html create mode 100644 ocaml/Strmatch/Make/index.html create mode 100644 ocaml/Strmatch/index.html create mode 100644 ocaml/Strmatch/module-type-I/index.html create mode 100644 ocaml/Strongly_connected_components/Make/argument-1-Id/Map/index.html create mode 100644 ocaml/Strongly_connected_components/Make/argument-1-Id/Set/index.html create mode 100644 ocaml/Strongly_connected_components/Make/argument-1-Id/T/index.html create mode 100644 ocaml/Strongly_connected_components/Make/argument-1-Id/Tbl/index.html create mode 100644 ocaml/Strongly_connected_components/Make/argument-1-Id/index.html create mode 100644 ocaml/Strongly_connected_components/Make/index.html create mode 100644 ocaml/Strongly_connected_components/index.html create mode 100644 ocaml/Strongly_connected_components/module-type-S/Id/Map/index.html create mode 100644 ocaml/Strongly_connected_components/module-type-S/Id/Set/index.html create mode 100644 ocaml/Strongly_connected_components/module-type-S/Id/T/index.html create mode 100644 ocaml/Strongly_connected_components/module-type-S/Id/Tbl/index.html create mode 100644 ocaml/Strongly_connected_components/module-type-S/Id/index.html create mode 100644 ocaml/Strongly_connected_components/module-type-S/index.html create mode 100644 ocaml/Stypes/index.html create mode 100644 ocaml/Subst/Lazy/index.html create mode 100644 ocaml/Subst/index.html create mode 100644 ocaml/Switch/CtxStore/argument-1-A/index.html create mode 100644 ocaml/Switch/CtxStore/index.html create mode 100644 ocaml/Switch/Make/argument-1-Arg/index.html create mode 100644 ocaml/Switch/Make/index.html create mode 100644 ocaml/Switch/Store/argument-1-A/index.html create mode 100644 ocaml/Switch/Store/index.html create mode 100644 ocaml/Switch/index.html create mode 100644 ocaml/Switch/module-type-CtxStored/index.html create mode 100644 ocaml/Switch/module-type-S/index.html create mode 100644 ocaml/Switch/module-type-Stored/index.html create mode 100644 ocaml/Symbol/Map/index.html create mode 100644 ocaml/Symbol/Set/index.html create mode 100644 ocaml/Symbol/T/index.html create mode 100644 ocaml/Symbol/Tbl/index.html create mode 100644 ocaml/Symbol/index.html create mode 100644 ocaml/Symtable/Compunit/Map/index.html create mode 100644 ocaml/Symtable/Compunit/Set/index.html create mode 100644 ocaml/Symtable/Compunit/index.html create mode 100644 ocaml/Symtable/Global/Map/index.html create mode 100644 ocaml/Symtable/Global/Set/index.html create mode 100644 ocaml/Symtable/Global/index.html create mode 100644 ocaml/Symtable/Predef/Map/index.html create mode 100644 ocaml/Symtable/Predef/Set/index.html create mode 100644 ocaml/Symtable/Predef/index.html create mode 100644 ocaml/Symtable/index.html create mode 100644 ocaml/Syntaxerr/index.html create mode 100644 ocaml/Tag/Map/index.html create mode 100644 ocaml/Tag/Set/index.html create mode 100644 ocaml/Tag/T/index.html create mode 100644 ocaml/Tag/Tbl/index.html create mode 100644 ocaml/Tag/index.html create mode 100644 ocaml/Targetint/index.html create mode 100644 ocaml/Tast_iterator/index.html create mode 100644 ocaml/Tast_mapper/index.html create mode 100644 ocaml/Terminfo/index.html create mode 100644 ocaml/Thread/index.html create mode 100644 ocaml/Thread_sanitizer/index.html create mode 100644 ocaml/Tmc/index.html create mode 100644 ocaml/Topcommon/index.html create mode 100644 ocaml/Topdirs/index.html create mode 100644 ocaml/Topeval/index.html create mode 100644 ocaml/Tophooks/index.html create mode 100644 ocaml/Toploop/index.html create mode 100644 ocaml/Topmain/index.html create mode 100644 ocaml/Topprinters/index.html create mode 100644 ocaml/Topstart/index.html create mode 100644 ocaml/Trace/index.html create mode 100644 ocaml/Translattribute/index.html create mode 100644 ocaml/Translclass/index.html create mode 100644 ocaml/Translcore/index.html create mode 100644 ocaml/Translmod/index.html create mode 100644 ocaml/Translobj/index.html create mode 100644 ocaml/Translprim/index.html create mode 100644 ocaml/Traverse_for_exported_symbols/index.html create mode 100644 ocaml/Type_immediacy/Violation/index.html create mode 100644 ocaml/Type_immediacy/index.html create mode 100644 ocaml/Typeclass/index.html create mode 100644 ocaml/Typecore/Datatype_kind/index.html create mode 100644 ocaml/Typecore/index.html create mode 100644 ocaml/Typedecl/index.html create mode 100644 ocaml/Typedecl_immediacy/index.html create mode 100644 ocaml/Typedecl_properties/index.html create mode 100644 ocaml/Typedecl_separability/index.html create mode 100644 ocaml/Typedecl_unboxed/index.html create mode 100644 ocaml/Typedecl_variance/index.html create mode 100644 ocaml/Typedtree/index.html create mode 100644 ocaml/Typemod/Sig_component_kind/index.html create mode 100644 ocaml/Typemod/Signature_names/index.html create mode 100644 ocaml/Typemod/index.html create mode 100644 ocaml/Typeopt/index.html create mode 100644 ocaml/Types/MethSet/index.html create mode 100644 ocaml/Types/Meths/index.html create mode 100644 ocaml/Types/Separability/index.html create mode 100644 ocaml/Types/TransientTypeOps/index.html create mode 100644 ocaml/Types/Transient_expr/index.html create mode 100644 ocaml/Types/VarSet/index.html create mode 100644 ocaml/Types/Variance/index.html create mode 100644 ocaml/Types/Vars/index.html create mode 100644 ocaml/Types/index.html create mode 100644 ocaml/Typetexp/TyVarEnv/index.html create mode 100644 ocaml/Typetexp/index.html create mode 100644 ocaml/Un_anf/index.html create mode 100644 ocaml/Unbox_closures/index.html create mode 100644 ocaml/Unbox_free_vars_of_closures/index.html create mode 100644 ocaml/Unbox_specialised_args/index.html create mode 100644 ocaml/Unit_info/Artifact/index.html create mode 100644 ocaml/Unit_info/index.html create mode 100644 ocaml/Unix/LargeFile/index.html create mode 100644 ocaml/Unix/index.html create mode 100644 ocaml/UnixLabels/LargeFile/index.html create mode 100644 ocaml/UnixLabels/index.html create mode 100644 ocaml/Untypeast/index.html create mode 100644 ocaml/Value_rec_check/index.html create mode 100644 ocaml/Value_rec_compiler/index.html create mode 100644 ocaml/Value_rec_types/index.html create mode 100644 ocaml/Var_within_closure/Map/index.html create mode 100644 ocaml/Var_within_closure/Set/index.html create mode 100644 ocaml/Var_within_closure/T/index.html create mode 100644 ocaml/Var_within_closure/Tbl/index.html create mode 100644 ocaml/Var_within_closure/index.html create mode 100644 ocaml/Variable/Map/index.html create mode 100644 ocaml/Variable/Pair/Map/index.html create mode 100644 ocaml/Variable/Pair/Set/index.html create mode 100644 ocaml/Variable/Pair/T/index.html create mode 100644 ocaml/Variable/Pair/Tbl/index.html create mode 100644 ocaml/Variable/Pair/index.html create mode 100644 ocaml/Variable/Set/index.html create mode 100644 ocaml/Variable/T/index.html create mode 100644 ocaml/Variable/Tbl/index.html create mode 100644 ocaml/Variable/index.html create mode 100644 ocaml/Warnings/index.html create mode 100644 ocaml/X86_ast/index.html create mode 100644 ocaml/X86_dsl/D/index.html create mode 100644 ocaml/X86_dsl/I/index.html create mode 100644 ocaml/X86_dsl/index.html create mode 100644 ocaml/X86_gas/index.html create mode 100644 ocaml/X86_masm/index.html create mode 100644 ocaml/X86_proc/index.html create mode 100644 ocaml/_doc-dir/Changes create mode 100644 ocaml/_doc-dir/LICENSE create mode 100644 ocaml/_doc-dir/README.adoc create mode 100644 ocaml/_doc-dir/README.win32.adoc create mode 100644 ocaml/index.html create mode 100644 odoc.css create mode 100644 odoc_search.js create mode 100644 picos/Picos/Computation/Tx/index.html create mode 100644 picos/Picos/Computation/index.html create mode 100644 picos/Picos/Fiber/FLS/index.html create mode 100644 picos/Picos/Fiber/Maybe/index.html create mode 100644 picos/Picos/Fiber/index.html create mode 100644 picos/Picos/Handler/index.html create mode 100644 picos/Picos/Trigger/index.html create mode 100644 picos/Picos/index.html create mode 100644 picos/Picos__/index.html create mode 100644 picos/Picos__Intf/index.html create mode 100644 picos/Picos_domain/DLS/index.html create mode 100644 picos/Picos_domain/index.html create mode 100644 picos/Picos_thread/TLS/index.html create mode 100644 picos/Picos_thread/index.html create mode 100644 picos/_doc-dir/CHANGES.md create mode 100644 picos/_doc-dir/LICENSE.md create mode 100644 picos/_doc-dir/README.md create mode 100644 picos/_doc-dir/odoc-pages/index.mld create mode 100644 picos/index.html create mode 100644 tiny_httpd/Tiny_httpd/index.html create mode 100644 tiny_httpd/Tiny_httpd_core/Atomic_/index.html create mode 100644 tiny_httpd/Tiny_httpd_core/Buf/index.html create mode 100644 tiny_httpd/Tiny_httpd_core/Headers/index.html create mode 100644 tiny_httpd/Tiny_httpd_core/IO/Input/class-bufferized/index.html create mode 100644 tiny_httpd/Tiny_httpd_core/IO/Input/class-of_bytes/index.html create mode 100644 tiny_httpd/Tiny_httpd_core/IO/Input/class-of_in_channel/index.html create mode 100644 tiny_httpd/Tiny_httpd_core/IO/Input/class-of_string/index.html create mode 100644 tiny_httpd/Tiny_httpd_core/IO/Input/class-open_file/index.html create mode 100644 tiny_httpd/Tiny_httpd_core/IO/Input/class-t_from_refill/index.html create mode 100644 tiny_httpd/Tiny_httpd_core/IO/Input/class-type-t/index.html create mode 100644 tiny_httpd/Tiny_httpd_core/IO/Input/index.html create mode 100644 tiny_httpd/Tiny_httpd_core/IO/Output/class-bufferized/index.html create mode 100644 tiny_httpd/Tiny_httpd_core/IO/Output/class-dummy/index.html create mode 100644 tiny_httpd/Tiny_httpd_core/IO/Output/class-of_buffer/index.html create mode 100644 tiny_httpd/Tiny_httpd_core/IO/Output/class-of_out_channel/index.html create mode 100644 tiny_httpd/Tiny_httpd_core/IO/Output/class-of_unix_fd/index.html create mode 100644 tiny_httpd/Tiny_httpd_core/IO/Output/class-open_file/index.html create mode 100644 tiny_httpd/Tiny_httpd_core/IO/Output/class-t_from_output/index.html create mode 100644 tiny_httpd/Tiny_httpd_core/IO/Output/class-type-t/index.html create mode 100644 tiny_httpd/Tiny_httpd_core/IO/Output/class-type-t_seekable/index.html create mode 100644 tiny_httpd/Tiny_httpd_core/IO/Output/index.html create mode 100644 tiny_httpd/Tiny_httpd_core/IO/TCP_server/index.html create mode 100644 tiny_httpd/Tiny_httpd_core/IO/Writer/index.html create mode 100644 tiny_httpd/Tiny_httpd_core/IO/index.html create mode 100644 tiny_httpd/Tiny_httpd_core/Log/index.html create mode 100644 tiny_httpd/Tiny_httpd_core/Meth/index.html create mode 100644 tiny_httpd/Tiny_httpd_core/Pool/Raw/index.html create mode 100644 tiny_httpd/Tiny_httpd_core/Pool/index.html create mode 100644 tiny_httpd/Tiny_httpd_core/Request/index.html create mode 100644 tiny_httpd/Tiny_httpd_core/Response/index.html create mode 100644 tiny_httpd/Tiny_httpd_core/Response_code/index.html create mode 100644 tiny_httpd/Tiny_httpd_core/Route/Private_/index.html create mode 100644 tiny_httpd/Tiny_httpd_core/Route/index.html create mode 100644 tiny_httpd/Tiny_httpd_core/Server/Head_middleware/index.html create mode 100644 tiny_httpd/Tiny_httpd_core/Server/Middleware/index.html create mode 100644 tiny_httpd/Tiny_httpd_core/Server/index.html create mode 100644 tiny_httpd/Tiny_httpd_core/Server/module-type-IO_BACKEND/index.html create mode 100644 tiny_httpd/Tiny_httpd_core/Server/module-type-SERVER_SENT_GENERATOR/index.html create mode 100644 tiny_httpd/Tiny_httpd_core/Server/module-type-UPGRADE_HANDLER/index.html create mode 100644 tiny_httpd/Tiny_httpd_core/Util/index.html create mode 100644 tiny_httpd/Tiny_httpd_core/index.html create mode 100644 tiny_httpd/Tiny_httpd_core__Atomic_/index.html create mode 100644 tiny_httpd/Tiny_httpd_core__Buf/index.html create mode 100644 tiny_httpd/Tiny_httpd_core__Headers/index.html create mode 100644 tiny_httpd/Tiny_httpd_core__IO/index.html create mode 100644 tiny_httpd/Tiny_httpd_core__Log/index.html create mode 100644 tiny_httpd/Tiny_httpd_core__Meth/index.html create mode 100644 tiny_httpd/Tiny_httpd_core__Pool/index.html create mode 100644 tiny_httpd/Tiny_httpd_core__Request/index.html create mode 100644 tiny_httpd/Tiny_httpd_core__Response/index.html create mode 100644 tiny_httpd/Tiny_httpd_core__Response_code/index.html create mode 100644 tiny_httpd/Tiny_httpd_core__Route/index.html create mode 100644 tiny_httpd/Tiny_httpd_core__Server/index.html create mode 100644 tiny_httpd/Tiny_httpd_core__Util/index.html create mode 100644 tiny_httpd/Tiny_httpd_html/A/index.html create mode 100644 tiny_httpd/Tiny_httpd_html/Out/index.html create mode 100644 tiny_httpd/Tiny_httpd_html/index.html create mode 100644 tiny_httpd/Tiny_httpd_html__/index.html create mode 100644 tiny_httpd/Tiny_httpd_html__Html_/index.html create mode 100644 tiny_httpd/Tiny_httpd_multipart_form_data/Content_disposition/index.html create mode 100644 tiny_httpd/Tiny_httpd_multipart_form_data/Private_/index.html create mode 100644 tiny_httpd/Tiny_httpd_multipart_form_data/index.html create mode 100644 tiny_httpd/Tiny_httpd_multipart_form_data__/index.html create mode 100644 tiny_httpd/Tiny_httpd_multipart_form_data__Content_disposition/index.html create mode 100644 tiny_httpd/Tiny_httpd_multipart_form_data__Utils_/index.html create mode 100644 tiny_httpd/Tiny_httpd_prometheus/Counter/index.html create mode 100644 tiny_httpd/Tiny_httpd_prometheus/GC_metrics/index.html create mode 100644 tiny_httpd/Tiny_httpd_prometheus/Gauge/index.html create mode 100644 tiny_httpd/Tiny_httpd_prometheus/Histogram/index.html create mode 100644 tiny_httpd/Tiny_httpd_prometheus/Registry/index.html create mode 100644 tiny_httpd/Tiny_httpd_prometheus/index.html create mode 100644 tiny_httpd/Tiny_httpd_prometheus__/index.html create mode 100644 tiny_httpd/Tiny_httpd_unix/Dir/Embedded_fs/index.html create mode 100644 tiny_httpd/Tiny_httpd_unix/Dir/index.html create mode 100644 tiny_httpd/Tiny_httpd_unix/Dir/module-type-VFS/index.html create mode 100644 tiny_httpd/Tiny_httpd_unix/Sem/index.html create mode 100644 tiny_httpd/Tiny_httpd_unix/Unix_tcp_server_/index.html create mode 100644 tiny_httpd/Tiny_httpd_unix/index.html create mode 100644 tiny_httpd/Tiny_httpd_unix__/index.html create mode 100644 tiny_httpd/Tiny_httpd_unix__Dir/index.html create mode 100644 tiny_httpd/Tiny_httpd_unix__Sem/index.html create mode 100644 tiny_httpd/Tiny_httpd_ws/index.html create mode 100644 tiny_httpd/Tiny_httpd_ws__/index.html create mode 100644 tiny_httpd/_doc-dir/CHANGES.md create mode 100644 tiny_httpd/_doc-dir/README.md create mode 100644 tiny_httpd/index.html create mode 100644 trace/Trace/index.html create mode 100644 trace/Trace_core/Collector/index.html create mode 100644 trace/Trace_core/Collector/module-type-S/index.html create mode 100644 trace/Trace_core/Level/index.html create mode 100644 trace/Trace_core/Meta_map/index.html create mode 100644 trace/Trace_core/index.html create mode 100644 trace/Trace_core__/index.html create mode 100644 trace/Trace_core__Atomic_/index.html create mode 100644 trace/Trace_core__Collector/index.html create mode 100644 trace/Trace_core__Level/index.html create mode 100644 trace/Trace_core__Meta_map/index.html create mode 100644 trace/Trace_core__Types/index.html create mode 100644 trace/Trace_private_util/B_queue/index.html create mode 100644 trace/Trace_private_util/Domain_util/index.html create mode 100644 trace/Trace_private_util/Mpsc_bag/index.html create mode 100644 trace/Trace_private_util/index.html create mode 100644 trace/Trace_private_util__B_queue/index.html create mode 100644 trace/Trace_private_util__Domain_util/index.html create mode 100644 trace/Trace_private_util__Mpsc_bag/index.html create mode 100644 trace/Trace_subscriber/Callbacks/Dummy/index.html create mode 100644 trace/Trace_subscriber/Callbacks/index.html create mode 100644 trace/Trace_subscriber/Callbacks/module-type-S/index.html create mode 100644 trace/Trace_subscriber/Subscriber/index.html create mode 100644 trace/Trace_subscriber/index.html create mode 100644 trace/Trace_subscriber__/index.html create mode 100644 trace/Trace_subscriber__Callbacks/index.html create mode 100644 trace/Trace_subscriber__Subscriber/index.html create mode 100644 trace/Trace_subscriber__Thread_/index.html create mode 100644 trace/Trace_subscriber__Time_/index.html create mode 100644 trace/Trace_subscriber__Types/index.html create mode 100644 trace/_doc-dir/CHANGES.md create mode 100644 trace/_doc-dir/README.md create mode 100644 trace/index.html diff --git a/.nojekyll b/.nojekyll new file mode 100644 index 0000000..e69de29 diff --git a/_config.yml b/_config.yml deleted file mode 100644 index 88d17fb..0000000 --- a/_config.yml +++ /dev/null @@ -1,2 +0,0 @@ -theme: jekyll-theme-minimal -include: ["_odoc-theme", "_odoc_support"] diff --git a/_odoc-theme/fonts/DejaVuSansMono-Bold.woff2 b/_odoc-theme/fonts/DejaVuSansMono-Bold.woff2 new file mode 100644 index 0000000000000000000000000000000000000000..f2b469a6c224ab9614577089d40917cfb8b34ac3 GIT binary patch literal 143796 zcmV)ZK&!uZPew8T0RR910x`4z5&!@I1rW#p0x?Pe0RR9100000000000000000000 z0000#Mn+Uk92#^RxN01T1_o9DtTqUP1POsF5ey2C%TSEaAq(eJ00A}vBm=W>1Rw>% zLI;8O01SzETMHhv1tQ1T-DAMi+KLpzS_Lu3XzMY9q{u`354;eK!}}&;b`1|aR#jFT zbAx90Eo}$%W_1eOVc(bR|NsC0|NsC0|C>pEMDOOCx!jxC*}dIM2q73E2?+6nQqfAa zf`q;&QjyBAet>gJD3V^ps*tFUhe&f}Ph` zBL%U{Vky?jvjMrw$lddJVPcmOu3kQeCt{Q|;_#IiQW`ZQW}w*MTHW&L(Rh+)$o>0C zJ$qeit+it4-%a2R#nfv}wN~W*y$x+zYfZIQ{H)jhyi*%%t+iI<9^R_Ia9#3yd_b&L zBSlLxi(d^1E;cSre6+iGbU(3A9X_k1N{aiNRf{8evX3-$e(1%!y83O5@m{mZpXgt7 zQ@)gqhssX7WA&q#Y!8vvOfcWd^|n zI)j2t27}Gbs0>s$E)9X@8pTIBoetx^ei&bz?aySzZ1&?2UL%Rw`Z!NR_rhvTrN7CUdihq zA5px8o8P(O?jj*M65()Oo7gieTfsX}{@L|dP;esot4ekz)n_lRa3PoF+XuxF8eds| zZnu{o*J6G&k5oiVd}Q~(0qY_e3G|f z`fqEkwJGYvN(XlTPpzk|wf1kr(Bn7}H}e0}NiQdu^sVYlJ$Vd7L+WqvX37I2nB?%cTqmZ33vy#!U zMk-{@yCGPc2Z9)MKRl8D&p-9>QNceS1$^-2^TZP+QC6a2V4;mQd*O6Wm)dN)>2&rs zb#6lc-+qx*{ohQ_Zr?CV;NyWUqDIzH~?Qg_Ihv3?Df{1Z?4R@R_v@~tWe3S zq(P*Rd`6k6&{+SMGyQ{_kw=nIwoKCQ2H2aFz*E40H^|dQB}H#Sc2F&=WbfgWcQ3&? zhuaeWwYOiNJG(mz?+FiCCHEaN28YYZC{$7g7Zq7kl*c0RX@>uwuKt{6=I5N2c@ptj zOloPwsuJjt$U-BOGE<;C+udo)`DtP1CxIu*h@&#&;3JORB*^YQY~iUxm0oI6655-G zkGS}~z1x|>1QIwbvBZmutr+^Z5Bh2^|LfW5Gy5ck47q&B#_*L!h9oS;;ZaDG#Ud>K z?he5=I~8XYI_)7PHi8P)lvEJ}qcBi0F=L8i)^q~)=Gs`sZ!YRLR&FhecCuce)Qc5Ys4bCl!rf8a?X_^M`-Qd7AilQi*rfHgXgA=eBq9}@{D5?qc z#r<~xzyrh(nE!iWA4QS|7EX{nuuM80@m=eUxto6?z~PvR$Iu!s zpo+Vz)RJ0&v%A{;0HDa`>;uU-$7jqkjR8OtnUZKtm{XXq2i&|;N-3qd!GT*8MNu?O z(=_b?H@`|LrIhkln)bd%H$npqbfbYhh?6l4n4w59C=9+sl2g*UXlH4h=f|M6GY_+t zLkK7CFUjj;lC#PumQO67SpURzlrw98{{w$hCD7q8o*Jw`=9^+I7l=5&i%WPh{VE`*0h8nh;oVQ_rJ#P&dl3g@ZIH5#glpBkTerX z-)MLwa;WB&&JNN80WZF3#jtK^Z;zW{P7X{B4Xx3ns6DHQ-+(yY{S z+Hy3^Wgz78@JjELCcED^HSM%IQi@VgE$fe>_Xa39fRWN@8yihlWNox}Nbk_xqCKOD zP#8=>Q{UU707MVWP*a}*+4RFY#tK5nD%mNTTL0aW9cQOCcCu^PfrH(>z`_v(4gk7) zBr70UhJ=@GXR4|+$$K9(xsPIF5{Zp5%0#g_&|o--ou!YsF@WaL5q*y#v9UnC`Bwm0 zG}efOBDOOt|F>^~h&CEcJTw|KvC@cy`q}?qHPL6|6Zil=3PF$r>ygK6lupGu$))$% zo1M(@n)GE!Iv8wBwWW(|MD=->JY9bJ3K7y7ULiGunnFd%40|!7_4{ASG zz(tj+$w|==z&5&8a7L?C%q3IHhVbVyzi5)h!N3H|6Z9ysv`fRmZ)E~32XJj zO~j%Yc@TzU$Nzf%f*^<>mIOs-QDZaue@(y7+RcjNYKmi~{Jt~x6v+st?NE@A*ghBH zGeHjh!>MrpQP!kbf};g$DZpJ;9$Tac-K>cP_^;nj@9ez)1856m>#H0PI1ZgW*$7o2 zBWeV}W+q3u^uOwEVON)6v;c726A*|zGalI<(AbJI@pBxhRTsmf?<5O!IPQsn0v`yD z`Tytk7fGvjIz(8dvJepujr-6xZA8&NNytU>7j5E=h4!r~&wpLL-E+@`Rt<$T7P1Ka z4O1RVc`!gb$Zio_Y5LVKa3C-N*>)4{P+$Oq8*T-|nNG_Nb{eY(91oY>kYY&om;Sy~ zt?O@4(ljV}+*Gh3O`D0xDbJvnQ#!-go&rg+}d?&Y?J z^PU_g<=cjIy3P5xDV_FmT_|!{($%fgvh9y6Cxi`X0?dS5>9XeT{$J}P=|iRt5vGWY z5+eyg6Uc1;zoos=dTy0n?WlIjeSF#>%aP_tkPS$6^_N;#HT_4@k2O8xkjruyeL3|{ zahwAIJ_f|U9i^Y;5CaSeWw?kh_F1-&Eg%cf0>t+3E7j_n35qr-yE;hO6{X(oUgcR` zvtBKiX4#hG#GK~%^S%7|TPBeB36MYnkiY~fk$@zFNzw*E%L9N^1whMcQe}5jvU|dE zc{)_HTJCKlLCKaVyIZDgk1cm~_o%9SKh3t=v+T=tJDh56Rp-MT4woT5f70xmOPcHo zoWQ%bZjXlW(@KH2Nbj*|StZm|Mdg|?GS&l__3zn2A=q2h)w$DVX2-qTH{Nv1X0KfD zy@d}SKuOdhPcRl2U;+@x?^CTzr+1ELw6V#luGQ8scuMs*V$ z5ZsYBp`MZ?S!KrmpQ^gz@b5nY6kzjI93!1+dfq&YZOi1BEt&khOdoeR0wi#xNPudf zi{#RpOsCMLrzjpXt;)jE&i;c1z(SN==?ad9}YR)*c16kw<~v{r;`#UY_WCMl11 zm@gC4v3swx|8ae(EQ!EnRjl zlZONF&;vQ9dF$t=!`Q6%R(IdE(m5576qt#W{)kS$GZ-?OaXl_Sza<2W#|8`@k}Y}6 zC&?m)*ws;Z6wPJ;=@K+2g$%2PV#;HLeQ%$)em?rzM{>?N$z&!;CiDCMO*`|*QeQDD zM8F@Olr&3~RP=xD%yuFG07`(K1DXBDRR%xWnJ_6c2xpTC02oG)77Wxv+N+PGyy6VV z>-MHjEBB^6D%(~__4Bp9GEm%=~1`jyd2lpVHZ+ELBaav(bP8215QOEye!A zo_#J;2%r}oHCm8+*{#+BO0PQ_%z%4GQymW!cQo}jP?2*NP^tKK3=^b03|({~J{~Lz zXR^P-Jqsgk!37tw;$6pY%i zn5w{ni~Af1e2rNeNTMalOwNc##3VGIG0`|SvE#XMC3K?E{`xz78ap##0Q+=e;(;$2 z_rQ+~kI<3w^RCo~n$`dDDO5oq-ys07lsor5VX^5s-Xd!RG`oTo>(_0-a z#+8$7kvg-A9&>637611!q?xA=SNeYg4lCd=qv@GG{Vo)!?mAwTT0u8(>C|%t*z0}W zA2%ld^1oJLNtz|?ytMt?Mn$(=zX&C0PE>Tu^&1jTWeeq6v(t-eFR6y@p*lUG*!Y}yYHVqxwu&wQf9%0Ee}!qTOiahBQVnsqisK^|#fwJH*JxdfVEOkV+ftyqJuVhMtL)gPV_# zN*l{|T+bI$X=9z&O&L&J4+vJICLq|N zPop6%giDgH8mNg&nU_toJmX`f5zgcor*aKVk`{EyQIW?hx?{*k$@T(#B0st8qQyeH z)Z?gN>^1&v0#7&L%TCe_Y!B&o*3DjM;2Q6j4UOt!K zo#?eWI|=`vUE#dw=&4G$!f4Y0+ayV5M<=;ZNEw_HV3-7S^B7ur2E+OzUreR~IuHukN7h`i{8ZbP>DP(YY~phma0?n!>@Z+7g%Xn zQIF+3l`WIha-)~;@zSWQHO@A_SwVooKA1XO%}L)`_W^vJS7w98vRm3ZhPw@SXzOm- z0MM&e(ErhtRJrg^FLDCJ%nXO>Ss($_%}NQwF>9s|*Lg2XEX*tU&&rw4mYM_a8%|wY zJQx1`PVg&>>Q{edCjHm1OnuGv>tJ#@-i{hgc~s)+#{FzT1yo=KLqq5h?oN>;>k3uZ z>3*@&U*|mM%=+^3f6bHQUiy}tM!&YGzNT;X;*AY0|8h6;*HyQ@Sal!v-14X>tGa2s zzF3(`HR?5K)uCITqO9ts)$VkA{i3YurtSKAlg+{90T5wA83&L+B!y{)tRg>4nlfiOOK}P~Fqg)jye6 zQq|Db)8DX|q>Q|hs)n|n(CEbU+~P{x`t|lZw}Pyhjvv0sMqVEwl{VISAq{0(+ICz| zNTrQsJFe#oskCpbvsuZDP9M&S6grE`F9b!PaYPE8#pO37p2`mPKS9C%*8hUdbhMV| z&RoMqNLE$@C(gn`zeEQ~X#ALptgdD4Z{#`S;#KFkxBmL2C=1JWnxlt{11o`6A&Bl2 zvfIbrh^h9jm8_N*Yr_!WaEh0QLw&wu|G*WixN~ctLgNa+f#W{{dLtc@zq4+de8vP$ zd0Ul_8N6z@aC=NUVXZ72eQL&R?E=QJ)IFgyx!Nb0%%OP_`k~?RNJ9v8$Tm2c-e9+x zBFc+b%>oTG;#D1K&4&1rl246Owkk4(c5%4R^m-3c^zR_3%dz<>%mxY`Scul2xWfKP zho1%-w6{t>BU)E&&_Z1R$@{c39~0&Kf&o@{vRT+qx8k{amfqrNJQGI6=^&l%dabSB zihAQ&;Z*GYY+!DTm0wtf21;n?06eTZ@S6xYe8o4Uz?B?1C#$%%50yXM%RH|=iv+`Y z9ZIRMM|)4dK&fA96fD$&4+LUhg@A&Ug~Ch9%kE=;x$I2Zm~%l8ZPnmp9Py7{kQl^~ ziaevB@Au-7g+BLS;b|t-(S7wU>X3BA5Su`!LBEW_>?~#KvPx&R3ayz$)-lZ)IX=n_ zpH+tJa8ehjGxyPgQ|vm*T~~T)VKn3t7gweK2QnU919TjP{P$9Y=)6hl; zf)3KDaT=c3IjcrT^Q@IVyjCdZ@4wypg0W?NE#TJF{}RlLr9$rZ01 z?R1xWzakG?v`=N!cpN76s8!HtCopnAs-g;E!aeNjs=x0piHo8;GC!bQdU$;5&nB^2 zgxg=Vi&v3Tp)n;SoG;tt11A5CI>s@+y#GeBrG@;8&hQbl{im`hB257peo0Cu$*&k9 zu_+~5(vY+hDUXr%rZi^f;||dSnc(%JAiBpzQ7kTsbKS+Iyfo! zx<(-m)9q&~ah&=_8BWvCsK9wz9V56*@5VH4+<`x=1i&YiD2tG}DE6&l$e0B?&%EFx zNVr(Z(qt)6s#2Y1olU!aYX9H4Ulcs(zbDpdX8g}JH#=_ zr%pvXE`S3Wq@b->M!lQW=e=*jfd_nStYAj@{$4eU&pJaG54Z;f+#wF*nCjCbNI?ox z(1H}SAO)%VfEbI3f(Zz$G%cEs!B>HTD>juTQ2Gbm^#JiF(Yt{DL-TCzooby0i1$?S z`@k&%?W3f$f-%J#zyS;>U;zRE$g)WQj(U;V|%QGmVhNN5Ln_9!uS!cP{N9T7`TI$L4^X) zJ1U-tHF>JQ{Pz7Xf;4yZq|BBW$1=8YjB7j-n#jZ?At?z+NWv4H_#`Ja>B&l7M6-Py zj?J++md5T_4S|3sFa;lgaA;`ZBmj5tWmt{?^xAU9t;pqxds$W}UgcOZ_|=PwCv>r( z(&1RFu3Y#f{BylIMzM%Z9O4p>gd`%E#3woF3C_zzB`!&Mows?H+=yh`I2aq__xLw< z#{bX}a0EsIar`9oLJd2DA5u4tH4CI~k7zyt=Q^+Ygzm_%lR6t*!mk9)0}lhFdCxJb zW)Kw9zjg)X-g2lMc#c6_UE6yHS`z*R1~GJ|o#EH)8YkCk6F{<-^tDRHY`rko)w@Wiq9*0Z1Bs4wgP~I0sybfIQy>jf6G%t z`22a3|NBk&)q4G0gkSzB?tK442mi0))@Q!nzY>$npE&KG^}@Wz ze>A1R?g7IHbg@F`;lKRu5ZN~{9EqXvL=u_G;pTtzzrZ3T%7jolvL=^ekS1x7Uil=S zK|~wp(7}l{c#RCaM;WS7j}91=7_s9w_Q*=%K3SAd#xg3|#=~r-&zv`Zk)pJ^XwgMo z(M>&8hN`qiM>SO|v_|UHf>^V6)V=XjvX1#R5sv5A9MBawy*o64|%p%c$K%i z>#N`KGRl|=i&`|}CEB7pUPeL`M}Os2>6XuuS~5ymqABy3r^!lwinBZ$a(R~I=WI@z zMK-zTU-giBa{XWZzXoXBHJ+P3&9-&ZvbP+q=2m+ryu(hl)A=9IWp3vFX_}!FG}vg3?ms z@=tOI>*KF2+imavDXh30#Y&iM;eV-*&5y_=m@D zcH>#;i@-=R8&#V3IwGX_I{Nykj+7V6Ur8^e2_;X;^&yTYO^uhFWe(Zxl)vl2^(5zC z|EcNO412V;8d}a)>%If{=h5t3&wbC0w)=OE)@chaE(0G@9Qgcs#s4m@W^K0GPnP@9 zGD|Er&m6PO@U3r5HQ9JW4D_j$N)*YHD@V30F_xHPkUr9gj7qsF2b4X^tWllXwP|&Y z8dRr(i!P8M;WSbFj^V+D6BF7a>e2tv&4V{PsaL&Lqmqb4LIICsp@G=#{@2W(?>R;* zA!9=+7joGwIu;Fw0{w8{mW9@iiIIU?sgTR`Bw~?(PjU&C9i%Fxihg_c=-#cPOG9_t z>D|&Cr2D_2F4DeTZhc*CsWKOfW_V)?s=JFX53lZSt}c!qZcdgaqP{ZLC=7;l}Nb8M5dobobg0tWm8gINq zZ`&TCPmXXpb%ECpKO;TuwrAz&TytN@1tjyR9SbR-e;eWXbqqbk?2E$&M-zyX0bw=$AjNL zLWKM$Ezatdh(%?PBHaZ!^2jS!PC>0+ik^EBy=RC*QT-ah8jF&`a^H zY0f+^n>P8_w$0bRBYrM?Pe?V{-Q;+wQk4itjzsz8ccSkZU`H%bqT=`qNPKM(_7<5$ z)R^=3-uA?fJV8R`i-Pf9tT?3-BSSR~yQj>HmiY#;jX>%?nFHGgfKd;#1%~0gL_+p{P>CipQF# zoOVVfNmRM0n%ACFM>RE(MS#A!5_JIKQ?QK|{0>0(s{+^`33Kp@!kcw4@*6oXlfgp+ zEp!l|hXF>I1PBx)Scp(z!bOM_C0dMFapEON1d${eREkt-(q+h$C0mYMFmMQYkWlg! zC{&~vT8UB^SU7kDL?mPsR5Wx9Oe}01Ts(XNLLy=kQZjO76qL%TsA)c8CI<`kQd~J8 z%{!SNtL4a+D_@}kMcyk>tW=qgDwL~K<&!$K>NWI})Y3Dk>>@PT%z?R=^IX+BkR?*q zved0ZH({7K*6bVMMzEmpideMPck1^RBmy8_syANSDDxIeO+~fn zhM~FQT1@j*Ql?vtpc4G7yAo{_TH3}@=5~%4cLjzEQs=qqO#rGL3#R4pTPSCMG3Ea* zML1*01dA}q$`M4St#+@h*1PzV@zsiIy?rx)1t1fQzhX6VB&$1x^dVd_#+AgI1Qqt7I}ol=)R{bw zJs;?Yn(j6EQ>KgKQl|!=t;||YYbo+m9}fU4W!U0(p6PzHi^&y}F`sKabIkyq?VYRBOXReG1T4H3 zsrA#B8dE7Obb;x9>`iHWryc$DsVJ1*M&W3$0o_+VZbw#8sb@YsSXL>odGfr52yM2P z&@t0J^5mItLsvSpkz|kviha-2?u(Jl-^m)2$MF{O&_>nw8I zF}ABHw;HYCM9G775$9MYgU;P69i##mJ)=-{8!3y^GBEt!tJ>Ts^E#%2%3chUsP<7G zj1gUB%1bH8eKYuW6`1xk`%7cI+T5yNBcTDA(j0KgaXJZ^!k;B{21CooD zChoYLjOBwWv}V!T8bJ0?O{2y$pwP9*Dz89Z$<{g9t_<%3P8-3Ck)LxdyNKWwf?ZX4 zQmhMWe)%}2+;ogrsno?YCB4SHchwD3$>=t&F!Q!2otFNr>)^8^O6kbyV>(sj-ch9F zRo-oYZtG^`%bukg+()LC9|E>?j|ucn7PdvX7y9-yt=fOT#tX{pGp!`p z$z(!u(kD}PkvXc(aX4M(NU|?(2#-7>6)uGL zZaoOGC4%H@3)Tj@iibGqab*;zMoZHV5XI!l&-~UQX`R+8pSh99jKHi48o99 z2xzj_9p!CKrHC{{1s2FIktqL(m8TeApCv>!6C_*AP_;b z!fZhUkr1#gh*oM2tvHEB82HpJXM})w;eN#g)C?(7__wdRifP zx|XfKTb9SuqO4LXRcS&@%^__==)F!a)!TYd&sJ3}k9%Q)EJeMgWf+E?byiAOr!zsN ziI3`dR6ToALapq+J>sL(k8j4dL0qotjf19HbTYZmhd~Gc#ux!n+<1%bjs}j194sWb z&cc9{fXJgkB(N5sPX`gO6T+Ge0CmXfceKp`6tD$_DV~w#h||}x?t6=S z=fcp)DQ=Wks_QE$b9+y@^7FDJ+}7uaQqullOoiRefC-BeNyE91sz4uvph#XCsX^+> z*V4`;rQ_Viqbdv`c9EZigo>w9od#@Dp^lb4EC;rB98>aO3yEZ&Kc{ZzO;gkEnI(3$;@mD!Ah3REJcTK~?A6rN|%K zqPPpyby522@%DU^j^#P>bLV$lmjGg~uQh2aBW>)Fy6rX^}tnodu9Dv#tlF%v4O+XAa!&#K}j2EY2qzZP!V0xL^I84 zrjaI|wuC|)DIp!^n1?c8iRfe<3xwi{5a+y>`||DS9ST)(I6b`JCtbd9d-e9%F5U~4 zFMhBi@BH*+U3@7%l3(BcYD&vXh{+tUc9>QGKu>scQ81&nwg4z5h8|Eli9}6^2=D=! zz})C=gAvQ&>ggOyQOnCk4GL(Qlp3wgF&4!lXo!7*N$y;`#yC)fU_T8?Z4-Z7*6qi< zM|>r18nxdGRf>8LFTzq*^s)oMP-3gNpAeWLdeP)ORFaO17gKA=Dqwo2M_~p#57-$j zllE7F--O+B&;!;F^7V-U1F-fXq{hEc>MI&VCiXG`dtsJE1}4`PQvJ)J-$WL zrL4*v^_)pzwU4oFf9bw^csiwvck!y$$VgPG=Gu*Jnk%l98n>VgA+_zq1QUuehSTgR zGT1s->Y5h$m~Q;Aizp<})GCQ{S&`?d8X!=+uJ0HRClJ-~zVDxo0CES4l;biAf+{fQ z0dLWBo!rERI73V}!fNlvwhTzjG+AeCMR5~8JysmTQcCeVhEP#tL9utbD_ zAM9eq@h#gXfFfnN>~ybUmT?{izAko!Y$pKH`pFE#3AEChJB@9Jka3o=&BD__NO(Yw zb({c+%+`}q5D_r|#(*$BLT=V7Dk>z$O$OC_1;YjPW+j5u(faobpUuyP>!BnA)0Lqw%~ z7Iu1|H3J(Gj@#tKm1=vq9|3aUghbtiK;Y^awb(fa3D<(Jco-zdmEkLg$T9dRW1+~j z04u=a;q^tDe#O$VA4h4-kp+Q3QA!M1W74= zPhJs~F&woiB-jr#;Sf>a^5$*1AFj`9n3H?LLEm2z-BZz?WpC(hhqrrvp3y~;{*fO; zL8O9Gs!I)c4zVn&R%NiWYaC!8Y^HOc*Dn?McNSi#iJD)KB6rW>sCNqS(Lz?}oJ(=~ zQFzE*XFA(Xi@kcS(6c;5E(;m;!wV9or+C779()e>{v!>l7|Uw4**bfXtl5xUtiR}t z3CQ!0Rx0?JuA7(qZr8LjdvR%bl9yZIoa@85X}}1}S9pJS`C29_okpWNS86A9Srh}C zt7H*#Osj^301K~{D-)cG!6+M~&+BsDD*EX$m~wLIdRq7H z-|v)*q5NswKO)4~&#bHpJS5Lvizn~X{r{2r%>S1-#=rhxpV0X2?cZA9qq*$3nY{d; z)Xu%V4-DS^cNRpg@k&G(Fi}GKohn$1@xXzoUWhLtjR*1All>JxmDeHE$53U@j~q6+hxZFIFKcY3p+mpuDVf>I$<~Won&CKV9XJ z!h>gdLmQTR020wPwzn$M%B;UTIYRG0kj;8HnBSik>>?kF0)fDXYlW`zwEAw!zjp}L zd)^44$9?Gb*NA- zSrQnjl@X*`lC_?7v5YWzHV(Q2XEeLz^&bs&Bktd9LHB@(%#r8VYyt-2-l0!D><=GK68>aS%>BY6l~8Wkx{WhDQ&H9kl_>cV7n z_m~wr`K;+Y2i$N=KiX0^AJKj>PGK+{bxR%@m8ys7L1WeIQm|8vlBu5Tk8I=PO?j=} z?YJOnnn@bTHgeKOZL`6`D7eXB;wq2D(HLaQmu5NFR{xJcjLY1H!Jblm9|c(1)8cQG zVy(WtefYk-{y-a1kpJkziM`q;)aEpjHB(cYP6AIZUineBiyL^%a4(>f`3xKd#AVpC zYgKRP@dr~Zm@L6v#t({LJjYyKG%GF05pf5TvzZ)n$@Z^-I!t`~vkm51&^GX{n!SGsrek!I^2eaO?(k9Q^((T+L& zl{ljvF5JkAd>q)wf5?ktGySzga!bZ}0HY)yh>#r_)Uza#vXPkbOD@&soZUi}ydjAwi!$T>X(-7`A=`t>!#tWA1Q2#Qg5H?Vifng8f=iAFB*LL3>1cVauZ0ld7j4S! z4hdQk0Z?i;J|yY*hs#||@#}7<)ZJmT!tqsT4gXcO=DU7lgwY>nBHcmlzo4X(WeUP5 ztep86S_?NCPt06$l##^^>@L~8DwacJ1~xC|hPTINTC@D#>{Ot&SS0;Tqc?5EDcp}C z5q)HZg5JnWiY3c3hz?L6W2@N`N61;lMO%Bzwjp8$D2G{6DF_G{1VJ-T0NSQbZ$70q z%Qq?m1us@7EiXyLf~tND@q}ARK3`rcERTVU0-*#!q=+Jgg2X{lZO&9pYoWc~M zJXUsWxBLq65(~VJ;T1^h!eAjn^R#oQAjQsbP?gIn^*3N#6pN)1IKF@~%%3P3l8 zqDw&7?&w%HGFo@j5NSJ5kb|-|R|Q|Z$v=WSNGfbx5$@HtYf1BhvWtxHj}JLt>4EdvBbVS%rDOiQ0T%`F(z0Dyin=TD za<_YL9;)HJmn-gP%vzGv6_}EPwOWXcb;E)zjtU#d$pY0v{;M0v+8s#ZVe=QBz;AVQe+G^An*mb z$Rv5p$ilQ^a&5He8fP(Fl7Z}sxu~nO2;^5*u28MJlZu%4p>^KInqVp*SCRoVL4A4Df=`5?i2OA z8Mg$OFxT~mRVhD*a#b=y6Ewd-!SD7bQ=9**xv)VwHVDCq)iaj~R#AKItM}(2le0aT zs}w!fa>*rh)GfB#9EqrtN5?3Uswl;;AgKr#Vro&bbtMRHH*+2ZP_;5S%Jr)%>dP+$VPF;gsX`N{~5hj?e`#ek!@f>tm zINKFlU~~4?+i3y!7TPDWC(DFj@>Fdj)w*hogIwk|21Ye2Xr}eb?KkOESQSa0yekFt z)^o~Miqy)K3Tx4;e}ay3J+ zSOcnIj3+0!U>JE359NL8b`q%d*152xX6IFlZt4~{LZah4gKOK0OE&*JER^c@xR$%i zm7FWfj@T$_HGGgk+8hv8YYfBP%6QWFkKE)^I2`S+n?3RAu%y4RxAo16`V$yDou2N@ zpM;ZQKR~B4as7lVneO@*(;+QFhcoh2!N`!SnAlaW6b+3KYyh#487f~@(UH$b#FG?} z$XbbkDiT{?BPM0>GTh>zDJ%*wm?VdS=xJ^&Qw@r_q6TL%`Eh9*0t_!k+5pKe4GKRS zo1Yn>CB!{nZj(Duz$IUGz}BBa+rtKDP%;|--Gi;Y7doP^X2}R0 z$kgNuLbAAaWR>oW~7I`>r&x>Zh^cK^-%^lliddyy3wEhHo5 z{`&zv>o=VR3HEF%KsI3-E@AZ@*aW{8;e}t-^e71_>h*3K&BMO@S4`%MI7$(Ap7#4_ z7To4|r`c|jN+gQc?oOC5cp`Kms4!OKj^EvyCd0Wx<4iL~z+FRnZz;M2T21c$wZbK@ z6{C&sTZl>FhhC4nW$iKTw49UNm&WjH;{a9;1Mq zpf9*R^PJrYDC<%T1hax%4H5M) z!cjIsY%Ho9O-hK^xSW(U=k`Qwx#V-)4t%*I({$WK)mhhjrawbhB2KV*qHOuuue}4hS)aCGI~I zM(|-QFXP^zOg#LGQaC!kxIsfHFOTe`Wy9P46HPXup3hc!=o>UEEiCLThz z2dO^`=~Ug^VZ{_ire=6;1!~F}<=?)_Q6))MY`Di{G@1svqNjj8b3z4O0O>sdOmIja z2uAZZxH59p&HL`62F7Q6i22oUMsIYPyoq5-lUc&T>|Uj}YpyZ%oKbN*d9%*K>kuOc z;P>3bT3);6$m8-a7cjOfEA@uqgkcrfA~=ds{lD5dQ`150N!TyoY6n7RGNHS!4&~|$ z#@j|PyL*_cg@c?>%M1nRjBef5KWL?jFnlt_vrpO9EYX%V-@&nBo&_sX={51)RlK%B z?#}O?Dg-j(c0tY(1=^uYVAD|v*mld`G71(AysTQ=$~KPz7gmV|6Krje9D@Q3&IZFR zPJ%wM>k&|-f`FE6=cX2i8Y?sW#b)zF)?B3V4wmb30GX(&pmR}chQPq$X}YrG99gK< z5?sZb_#$KgOV#i=jtvbatjMe7Yau1a9JPG;wrrv($5x6HYn$)R&<%y0To=jvY8q(6 z7Ya|OI*bPVPO0F`g8&J#P%a9)l8&pSamn2GvgLYnz#WjIc~ro?lm5>6{fhw{55#3d=C=I z3G1vFHrmE@R0U#}=?=5@DSYzOU_D|pl^hdrH{ zv6AfVB9rk*hX&?H)?K8z6*f(lWa(le?v*=(cE*#BDIx=o4}wqv(SQin_s#~DZ z!EEbcB#bNFvm!$v82G~vjX!A0qecA(?W^{n!s)f~LPjn6*EzBTdRMlm2r*}$LvZbaoy>Nfh`!9)pUZCoQ$X|3s}tJfIv_9sC+|=FeD8Q%@|+SeXt>1h#DORvAA%2) zxnjzHe6NsJIM}(l!IZ+|I5UkNXPwZ+6M-S}Wg8l`VNq%YPg|7-A7;|1Sy~2OiYtp)cbe14zZ#_$=7zBh7{Y?kh>CwYr(PRjYv&z;IsBas_9Va*T{~F0X@S z&#_a}8Pyo0F!>$Csvhw zV2}H&Wn#scJ!0)63b6o090-dabSQ9gNK5R8L6abB09q(}c1=_Sr{n!BQpP>ZLNN8a zJUz{g?Hj;u13s=RyC$oBVswla^wv`C*&J*QWoE?F{PxEkM%0Dx8ML z`2RWE%6i7+|DURp>^{Ejyj7O(j4btT&^$fAIFtQ?6fD%pANOiUe+d@AxLI*@vQr{> zsd}X#w|C$mNr?1eM=<~oCcbs;T|A$$%-wYuuJ&>pj*eTN2@Q`z{P0QjEI1nsU%19P zjo`4%aUW=QUO1dfOha@^ay$Vh&NinPrbXL*@-E*%kGn<5o`G(8rot(P5u(k!wFirU z?7lNs(ScuL19WA!7JFKBst~urY1B^NUt}6P39kR77m>CvDXqSoi3x&H^au}BqrzsV z9Iv4!=wBjJ&4Q}9j3$~48zk=!kEnS2-zsh~^<@9TH88o2+)zF-LDhgS6=Dzhw$1@9 z8Mq?v?7j`b{iDm+%>6z+Ktr6zT9`#s-Q3etdQM7@X~_>}lY7K(x0J(`i$Hil zIry8zhu_K-NVMG z^^fIL(EGyZtFk%a=1RZN2l2=qxvfQbh9vUR0TFb0y%XViK%k3P{A^hhVvYLP_61GcUtV zpSKc_AelM7yDSjeV?Kh7cFE%AMny0`3CKU!MbtWu;?W2VJI;@5qQ7U*Jbk{0P==J> z?bOCZpb~j&at9UqGrB`ut^6MmHg8mrbn^`BU9D#}i*CW+BN($uAUh77Lb+HV<&!~Z z(^=wDpLa4CMcqbaGFq=`V&uAffpz>{eg)I;R%amu1e# z)52y=k?LJuFQF$k?j6;rz5|!hd=tejf8^M!*m&ezwsm zo!B(@$~HY%7gL<@nogFbuWu3}3#*J|0@T{GW+1hisYAmWIe`wY98@GI*iwp4fpqN1 z5J2hQy-cdW8C1?&0%P{UxtqCB=4Nr_wQa7R`wW{3Daf2QA?@h0@r^0UYlTQ{7ApCm>c*$O0g#?=uNyvcx)WA^+1#geTwe=xB9ofdqNXG-|)7jRkEhD*w> zP{JCJYk}8p$Dt^tI;fU!oD96zx~w8bRKiDF&04hDY1{$@H?$wwr)Oq?jmuu>{#Kf3 z?ug<VduSHXPlv*)EOHO}|;7tgNO+Mq?Ie-dBS^}bS}R=+m4@L_xLTdtmXxixAw zGy0}iHVM9{u=RtaMWEALD0e!=HyYW$azK{SqLs9uE6EzbE66pI+%VoUBV@p8=m-H3 z_G5yy!KbyfbnV=nS92H9Du#f=AdA3D6ogx!Z+d@Zo`HXg720>HR zWq)Tu;p)GXC?{oxP8X1ofI&>ZACjftuNwf#XFPEtjGEn~ zS_wTH=Zj(htTW~NFfvI>z<1w(w8ii6TnOr(98|(KF``@J`9qs_QHHGqJ5Bs)kEdO& z7p-#J9ci8K2XyX}E%_z4J0o;kr>yPnA-vmxD|$NFH~r-6aXAB~8HGf?yQ{;e*LeyX z&D%L}=iD`ZlrRmkjGn$wPlx#cU?(#?!(fkrTJKnHb3gAL<|oc@xhHHQ2n8_Dd?vGVxS`VA=1#+>V-dG zzjChmg!b8*a7LmSFavBVuX+oKG${G&aTA#HC&{C#k&YW8;o@Et2)hi7UTqFKv{4X; z19T+!`thmgl6+pIvPr-I!!N7S=BV}QT5uJsW@y9^|5@_9Et5lPd*sX1Q#jQQk3bBSVS`t)q*2ROddtNheBJ%z z$DZW&1ggb(nOI)ANf5h!`OjNFt*6pTBf{qFnJ@*GmsoZ04>dRSP|}Ah`ibR?>U}+( zQ|o3*dsc%FsaM%<_x(69?$(6lbgX9*+?Nw74JzNodnC}K;Za{LFgTEXuknrNvQu%e zR?oN_JVoWxTAm@7Y=xdKPax-!&xk2BSpaJnE6OGrdgyOfrO6+tnR{;4;^jBw*GxZ3 zvvGTzUC3Q6v>^q%q}XX-=Nz)Itl0zsV=Ool4|+I+C|OAi$UP*#T&d+y`)7s(I5R7r zprhVsf=ee4#Pi$TCDQcxO?@{ZOUG?+lZI=`qEp z?)&CjrK%rR_Glo1gK#MYRvT0q%2gwBU#TQii9|kCig)FnASd{jbAe%u6UPJ|5Pwjr z&~;CzS`0CK0kuU}DwZC3lW$N>hB25Rl|pPNG(?7u0uCMZre%B{ z=x^byZ>-LDi##fKQ z?K?+L>Z(MCvX1BX(1MQ)8NMJ9J0L69Qo)wFa)yd-v3h)1%0)QXeM%{+!$C4V^1vIo z%228eCcpaXqrQrz7Wq7ug{}Pq145J)d(h}kMfVhhfYlEXxvu7K1SmdOP#RYi7L7#$ z2SH0{XFYFEX;+nqQ`c{HGJG7+v!D3!%+37C@8B!eFm`Dcl}B)Q;j zGLS9o64Jc-QM4^LDpdu=;&QM@{)-<@%I%L`fEBC(wULB0k+bgr-W|JZ{KA>@-WwN; zCZ`5iDQ_GybXVoHnQD*u5=w?%1mo*$eci~gA8Ebi4y;T9OkEgQ8PyRGNMB!9)rTrw zEJR)^Ep|m;o-YiyNky#BB(hn-K}prk&ka9FM|{ytKU{MYOnFInUu6ER;1JxbN4aXE zTCea4MzusieHl9TEw;~dtq|vpm5}jctONnfoHJ$6{>N#~g3S5ur^^EPj&!sukm!Dp zn1Q`+Gp$l+y#IqvHd;@p4pVhDnZV6Vm9oe+l6e}LL4m*U>;wJ#`zV$J-${(Y1ZXUh zYc%ClfdsOkr>@3Lz5r<3?jO#~-yOq}lKQps&DoRs2PV0zS4jHUOv9N|7C46YS5A^! z2L7hA$vuXW2pWvwqT?v!+5w|Dx7i+bAYcQ0QgnCYDd_}G*d+Q+N{dXy9e z+oQ+OE_IK1KQXN=s0`kVlTqp7NdOF)_{1J7q2eX;&|C&^YU(ywIjtAETQfKLvMHRJAr+Q}vBdaz)hKe`0>Ewn?O(bVq!d zPUAWX%4X*o%Asd&IMe@(kF99Un5m{Z3bx6thfEX1)XZoyHf#=V%P~$8SJ+&iTr&gx zFFW2rmj)PUky64mvgRNT&*f#PG9!!j+ZuqZEMC^0ZY^IxDv zA7Z~>fQW&iG?|h;=(82efx5=Sxk{&qJ!YyMb*%_Eu%B#J+YEKnLJFFF-gcErsXi~w z3uL65(Y7dKAf{d2gDE7d-82 z7!$*}ja)+k!Bcop%f%G=GBX%**=1BM$zRtin+@&sK)C|CMHS_EN8CnEjL|bK;418A z&6kG&kw8_fn}+aR+c5eFpibZ=a}+?9JiEc(++@g-mdP=P zKgb;LH7=hOHBC{XLw84fL_BWfibg&tA&iI<*22haXjpX2B#M9_%my};g!VS=$0jLp z@Y?LCi>VDY$&&iX)F^E@1<{GvPG@AM?jNL+q6X_3Dch+H!ehS4$Y?p5 z>7NriMa&DZS{J#s-W1UdB$&>cv~A|v3v(%p_%_ctgtyo4k5L7$AeGa6QiIh|zA}Bn z(+RxyF!yb_^cuk3d=OD@R~AEFKE7CZfcrW^TBg!R>76-hH6awFy=1)_0r(R0ERpa< zk?gD`#V^5V8{x zhtK`FT+^6~$Bdya1U7oBR)?&s?}{`U`)hubKTGkf9mDc214!Xhuv=R}xawJ?2e5FP z?M_i&XX93uJz%0&z;cEHY+nn?_@Cm6=_xD>fK@EvaDU;4T;2!iVp+LbelwpHC-{HLkG&)BXCOu^aX z#FBCJJz8^va)U7w{xQUvOCkpd;PP^<$tc^@S(9tz0KPbRKZ%$aMU`yt4q=a$@%C4p zQS*@M)}`OhZ)I>1u}Pd3y1?7OVz2dKNjn-eU>@c^c^Qwk{4pk^3~ z-Lo}kZ_Z+{>iy5Max2hso9Y5+hB=qTTQY{LWm~qi=NT0Kb4CiX=42*~IFg>1`%lS@ zZM$VQoA?av|0R|sAq185R$ZjL@?#sQG6%3xKg3dQ)#ln^cbUOC-RwLQ z(xCw`>~6$1bev0SBG!ZwHYVlNIoOw&;f|ngm%lCkWr`8OWV6h6G{zlR1$^1h(8n1C zGuf~j(6zUl5T>{$Dx8?I7UO!!xM=`+#wADJ6P!Nsr?|v_B^i;<977dZspZ!HT7B^` z#zfEbz&!Ec6ZOOdEIuo9OCWzN!4a8cO;!GMirpz5}`#cr#9WzJ`BuBm0;=2PRaJdQ8vPx2R^ z90fx*d%UFumUS`dlg4(0QMvpX;^9GHdAWQE+tn*oxbw(~u8HGjCgeIhVWVp}1ar1t zyTwm89q{8cC>H0};;;J6S-rkdTgy=8g)BlD-0N1IE9eq@GY%tY z;2KOBDe__Z-B06|(}9ex>*iJ?jq_B(fHEe)>OE>~uhGwdphjWtSA1s1BPYd$CS1@^wjO2L$)B+dJ*JY-Og&MDsO z?Bq|5`^amdWbtTw8$h?w`pkBLloCNV2vy~KYwBmGS#5GhMuu-(eh>2F$o3CMZ|G2d z(ag)U|4zBFXhQ2fCYN| z_D%FQUwwA|HCOc9SRUEu6Uz)xGo#npdU3dn`VWd*aB8gICQ-NtH&M$r4n-E_`ri$Y9ACZopmFB$MAn|8ZJOKf70sTES?GCivoO*#WZ3BG7_n zYcZ)8r$Z*U2D<&~_fY~HJ_pWXYM!OFFFHM|o(QtE3oiRB1)j?e;sj=N?+L*0XjDce5 zZCP12MwypCUN#_rM=fU_qiSnYN(jJ0_Wz z3n4=x)vQ`Z2C64y{i0l$(ScMWX#Q<5%+@KZbw}^ZgYt$0lsGFD7PfAHXEC^ow zi?@%u92-2$VFD7JdC2u~0o1Uc6TscMWs#_G8En+ze_RCaeDkp;87v;>;xa1Rb}qkO zx&oJM)M^MY36ZYn#`vWUA5)SNupB2l4-q*raIo9>GP_lHrtH?ZIA*EfUWaF&0>{RU zw^}-1)3{I_NIWbu%o`YA-R5VYWTf^dx(eZ%ipnCw?ACL?ygJhWpTq?a^q_TRYqXvC zjzT)-Yc-9Q^E)*~l8Ufq{?}!9M>#r4x^#z_>&ym@T{iMzOPk4?#4mH^ck{3?1nPss zcoA%Z1;Sr2|CSQ)O^YM->geI{*r39?zj?Bdw4Gg&Eci7xYA(^=VgPnA6$i1S+{Dq$ zKls_M&{V`Cms#O%0g_WagdnBUIL|r;W~b)fqv)D1(%DIzrOaf~elXn#gqka-M$zf_ z8lxIMM1`JKT51+CXlGHSY$tTFRk_=_v_zE_ zS8HDmuk(#h5XZ3B({2r3Z0Te7AWjHffSfi&f$tR>W|TQKMaZ?$F`6BpXx2q+JQqe)n*(vvfJ)iUk7AzVNYWH zaew=ds!MQnb&bYCo_JV#;U;u6bX`~c`>QcPfKQZ};-j5anV79}27Kb{KS6Y~Zzuql z2Oq!+=d%OzF)nUi))C|klq6guu~8^vjay}x6p~t!`ME%A<(!9LtSB!@3vvu3rA3=i z2vAe`av~Rr5cEvLl!uO)T|e-Kzr`y8L&a0W;tbAEJ6#O8S-0s{b)DBU04>2#Nd+l| z*BXZ2x;|%z6??35e-4l;6CUCD_BtVVrgr)uQ$m*GdOt=_+k%>u2do(!x4HVISRoB0 zCcPILpcn3X2oTAyR;wF&Piu)W;U5CTV8p1K*U($uDhOuT#jUiP>8V37~AAp&DFfUwAWvfs^e@yvxKm_RB zts)K2789jh7{`w#FGJz%OcvO(Q5b!%sV%lgI}$%ElYt%gxQ1Qr4fns!Go4cKO8b=V z&0Tdl##EKcC0M)OnrZ3=+vG}jCS$qTIkVc672uVDd6hB6qrV2DW1Y2j(sk5fG87)djMylLzz?+hwov<|=os@w%Yr;l4Bs)KvklfNa&gU1Bu& z0M{wBUXSgJK^5?EIwjgcubd3vC6}(A(Cruv6F?zjEze`L5$HE}o-W2t!T~JJNoTtH zS1PZWX0{XLIjw88BsawiG;SyCY{a>N8oGBf)+tYGt9}`BSou4kg^&)=5|UKCSxXfJ z5j8ydDl_ zS%v$kifq~BfZEGHsEtFctW;TB5hj_V1HT$B#k+{z+B06KuC(5_0`Bb{$_c_{mKawI z>sZPP_3)Z*d}Ok3=vYavX22t9biG8n9A_hkqoM?MV^5ofsF(3ctA3?G z&Pc11P)PXNDGPF!+Gpws_XYE%(<7_XqZbB-=HT)EIc&N#I<$b*nHTWtWSsNH5x}%q zq3+E;>VqA29=QT>{F}#arpo8T z1qXRt4H7lNq?eR{i`QNkSu{K5vUdiXeXKS4B0NFWk!^FaHejH=?Ka`fmKy8zfIO{^G|=LV z^GP2D8&4QaPUcXaC0TWW@{18U%MzZbPw7{u3Msd@`@33c6HBrB=^Tn+B*@Uyt`P2V zrlQ1XG{K*WxkNa#AmQh9OM7RU+`O6-fLH2?EnsJvX<$ORp#vIdG!^EpMjKe%Qa(lu z3`h$3dKSghQtZ)5;hbi&y$}24)Qx1irgLsSFKE_WOn|PdHrr=l$@m_{#+oRisC$&% zC3xuFuk!OYF{#_(4~4uTJ@Lyw4}d2<+c!uGAgxrv@A&imF^k+2Eup*dTqHd%8WS&A zp3iKJYxFW~@m{K0EE8~S&gZDn$W*T0rWxj6n&XC|lRRMYQuS~0>4W6@nKLc68tOqrI;60=$3bWqPW*x z?d{?Y6TR^DUb$1xb0JFVl?Jd%IJ>_gCPda5Xou^ zVg#QEpFG+f<;LIRzx2+Vpn40$C5j(H1yA!9I36fZDq`JHZR!DeCfXuTA^Ggf>%8=| zf4`PjWtE8Ze(QKs6+U`mC6F6qB8~{irCYa1V7YJ-{q?5eia=lF4?xrF!Tqu)**>1! z2z*do2s|tmLSNiRU<8wwm2qmEs$wP*)k+<;GGPN+IrXEl*)?f0!2~wdgsMx|8_rFR z@CU(s^by4|Z7h^TYUQTYCR><3$(u3jWe#Vms*TCAZ?Pp3o8B6uFG#KY(^5Ri>nNB*(3cO@<BTKRIw)+t6z17iWoDAiG-+*dCd4!l7UW|^})|%z1mp za3I^La!%cli};;dxf-_v5k_2T(;+*EImSf5f-6$CZGBf9hjURU4rljsn5=OeKB0*X z)*iMZ=UCS?sCmhfYwJpjyfu(J`)bJU2sLLyU-fz`IZukE;kA$GtL6(&ODr22=$q{r zlJrd=P0-s|E{rXeczj@fhHX^e4)Ql|n=<(YH8BPC=?6k5At*rS=}cvQ2#hC!Pm+O; z7`&URgrgsMtfd>!+7lfc9yq0z2O(!1G#xn{&vU}wqD47tESh26-b+_yW7@DP=9*$F ziWYSH$R>L#Y#1Lh96YIs;xnKLpF;fL#~M|%ppM5I5X-35_$1Znq^#*|Q?BU$k8K23 zXpdT+L@vNAwNQdx?qC8_xjImea><6{vNP9(gye$|!F$ zJvFwdsN6E|G$as5B^8Gety7>}Uof(DCEBgv67bP6*jIFaL?MKz5}cKAnTXgs2oTw2 z*VH8|sx(!iLzly2?<=8e>=NVx!;+MOx{d6Ak{U5GBa_&JewBxjYH_l&S6}3XuJ!;@ z{lzwP8V?|K?#OgiB21yT%NYAJ?^KgWMY6wXf#(U1RttWmo%Gb>^$Y9*Mw# z^#I+YM^%JEpO*!Uv-1wzk);ie;8gl*s`sy^5!yi!Lsh~(Fg^i^^-3@#o(}iW#KVG# zNc|y~%}5UIL{aID8d+_ydH%ClW?esdl!IlSa6uvuX~9`5H5Byhy+alY@&cNjSOM20 z5C~c${$<5n2{gYVq0*X?QanHiHf@?KcG(OT7-LpCH_2+c@ENamSZrEZa&DB>N<|`8 z>!am3%|!8+GTWWY>bx<-NP9G+p@DNSABRRSS7`-T6=1V4(O9oCmdANn5HFcRuEs`d zDPHE=BE2?Yy(OQ9`h^0Y;pCLhOZ+2zt;uYkj;zUii!ln~0?0M+us_izMsaALZpGPL zGIN(Ea1=k&_F5;aCAv5sk)%0k8$fH+UYoU$svFI`R6u~I+s4F=0h?@>UYsTCQ}vfA z*)sN^O?YSL-Rd8Bu95vf$7iSjlCTz_IrdC_;VLxYtNiW!#7bf8TyJBvTiz6u! zKEZ{EV>_x>7`}Ip$2U7$zVdwZ3>&-7V|`8O}X6Xa`O5`|BQ23n>ZS~ z%~V0R?;7mI{h5IKdR+TC>PAw&4gA;%9X zOt?oa9ZD*+7vCB~b>In9jmJOqw!!5GY#E1tZsno=(PTNu1WSqA%21@jMOn{}BjD!( z379U$s>?4JJmLzImpizhDRV@wJ>Tswfaj0JmZW0gI1T6pm z-cb8VmlIC_d~uTbx#2sXE}D&i71C$b1M_BcH=13YzS(+moQy~W$iUVzoK}Zdr<&1T zx0tjj&{>okMV#)$N|L{q95hx>+2_#{Nk!&ztu5cl4}YQn{(`XiUVc*L;TdWcz<*;7 z>@a^8u00>0;JwW%z-wHTqnxf%z52DSJer@L4UCfR1{ zgg<`)JkPI7xP0#%No?H9;ET0;Gl?pdeJIm@=uOz4AO>~`wVLr58=L~$tpJ{yZoes< zpkjbV#L)I}b~G?48NHE$drsQfkyttmfXKeGi5YD9Q#fdb_V|l?kR*y*zCj>(Rr{8h zSHK<@U0k^|5Ae!!ZR_2APOgD3IWEHxDQyBX)I z#%^eKGR=x8&iv{1+zIIFq%;O!#dp=nD?>*?QBdL_C4N~tl-i~VvgMa7&Ng6*WeUXd zX6&#Twh8#kJ^`lOLq|Ny)tj~gX~I{kBbHkLQY17}XN4>6xa4kUeNc11&cid@6(*ik zPjHn3JA`7X$7?lTMQ+iXOAP-uzKvNM@;qFUM6nf%>4MmohSPDxHtePi>nupcxPbk5 zKO+XechJ^|jd_vOE;}7yE%l2AFsW z&cO$*5GUg}N>$jp(C5UsU=n5P1RgT(2_uyUHlFb%n`TB5!kk?+avyp#(nu`EbG$SD zV|Hi8aw;zv9P?)xU7gHv%IKyXUMgw*OJO$y|Mk4(@A^CV^ET^$=JbDVw*F)OhWgu9 z%Re`+mm4i@R+ed^%^jcENn8@wj+XOhqFEP%iyRlmO^F(cXjacn`ydHic3HmlhqG<9)Vbr?D1#-+B2pbOt_jX(}7Od zjDBqk%_02_TZeFnSYxm)K(!u8T%dC@l&?T+?aI@8-HZ5&b2GBf*$*X>1@1mU#1!1P znv!Rjf1$M}W+;F)-NtVs6H_y2QTCzXWkwpa#s^}P_bFniVPUjzP+9l5+{8Fce%S4P zjaLQW+i~4YIbmSPhkY4dh`J$>_F=d8;g2FJq?0}t%EfC;Q%So_hi>-8nBy@U=(JQk zU}A~1nz*k4v}*XU;t@^wAZZhs3ahC1{$4lX;@O0C^_lRFQ<1BlCau?f_S#RpF$?Gf z_iWqE*C(+Lmpgg7j5;YKj^_9&(~0~|U;-T)fwfrGfPfv;IlI1d+V1X_2o$rk1dR~# zgTqu@YnDf~(so`9M)Kr=3gh4Yo&EpwJm?4>iJJ^PyWAp7ZpkMBI!?FRhR^Z z8B!hg%0&7XhJR}DiGxceDkyY9fpcfMJCqvUKNaJaJK`968#J zS;XH3DMT(h6q_(whgYDWi7I}u_9d}S>gX8;7kst1Nr%zhQ>$MbH8g+2^HOjvL>0`a zchT^6R*9eP9qGEjlcF-(!Kx^8p7`0^4On=eEml)~ykYtf$V(-;h3bkdBPe}n9laFL zhJHbDh43NSK2Yny`k!jbr}GWBA4osVu+px4rV!;IHo*h#E$cR_E1!x?Mw>SElIc1@ zY)`sa)&;s-EKeU)>$ZTX#ER)PeIpKu&A_oOQkBf-6(L38lT08^_`y!KhW(_FD>2Y@ zo8C^?Ld9uc!1p8JQY9|{XaNpdfMXE;7;)*=?-j6@X zBeUH^dgm`S4Zy=bdQ-;JzBxd*556dIh-kHTQKxQQz2q|>vuzm~>(h=;d>!$dYoS@; zjVBA7jtQJd#@$X`0``fh68l`-bY4TzmlQelQIu#6&xXE%J11N)SQb@8J=#nCLGw7Q zqE|n%<+lMRDCnrhe|Doi0Sa|^f(ROb;N<_s)gQM2SldMfgvE%XU8y>`g3L}drY-Tn zzBab}>soRF$dI8yzk(jgHhS*rA{FCs@utxF2}|W@n?s18m$GaggMp_Y7lg#4e8QVa zUW6b_cFt*c7snBs&CvwWk$r=WeX#!KqkVS^k|mgvk7@@TPmjqTJitiYbjEfrAZG-w zkDhzs%yQc1Oql2BH}XE5v?P^FolYIZO$=)1#BDHT-EQ6qQmIXY5YqiVVUAOg$*vbw zTiS<#Rs(Z;l;>P(UXAnz6-8*zQ!uMq3hm&___;Av`PDyk|xJ6Yz8aZP-e;!^H3k)Z}0tI>yGOv6Q04>GVy2%<3 zY&U<}HRLR1b=s{ZG|NHN=j828&%+Y1OPz+EFDGwea{($LRDrg7f&1Fdt1%8eUkUJf zX!`FogMNs>gFe1CsL%-REkK}w2ILP(UkA)B9Enpah{r>r z^P3!s5DUa(!C*Q9&}g1U2rd3Qn?wqJh{8oOEgsfU^`w1SaSZzD?71 z`umLDsCc8tTFHl3nYmoE{LQ|&5U*AIZAx!azR3eotRzVqo%{>LOYj!|f+49g#xG|{ zCVat0rPj!}O%x@OkD!)j@M*38*YAER!Q&@I`2&i(Oxd}{lVWH~0u#_X-Kq%am*RcWwS zP)ISQ&Qi%g$HSC5)W+J3^(3ayP)y9m(67ja?4-n9Ha(=kr4EEO+hu^_ut}WsD{7%G zMJ5Ft2BN^a78`z5o<(e{OcJVH!6vM)i&TawbJPmq*rd7)LDVcZlNv-Z*ic=DU?&rC z|Gex2U0U)1fP&z38$uadi9&Va1fmm*t+b+9&_5(2HHI~*&dgzoQg8xSf@tlcZ6gS< z`@JGL@!3ajkWM7=N0GtcuNf^yk3A;<$9oiXsC$n`!OSoQP$LNNvn7O4#_lC27iI zgAA#~{GO5;!$PWQI($tKt~4c$FA8^}P*kY6p8IFsup}i8Q^{>-jIADpT>8w__Q&Tm zq?3N^m5>j=6Re4z=0J&mZpM*n#=+_lJNy?Kacf<;5Ha*220i9k{X(6}E+ocPEY~=T zk>O&39EjmC86fm~WgXNileL>UwV!!)n5|3w5S-Z;PbucqMEf6WN|M>ZEuY;|wsb@_ z!Hpf@wj5)eZ|ne;QRrnMQ0`_MjM_l4VG*E$$9(w)t5ECLN2{f z?4#onedC&ym#|pn($_}susQE5>I=l--+&!d_in^yElMJ#dmavlRYf7?FfADG3=`k% z5l~XEvT;1+jh%emOpWs$WChnwJaxH)Kkjwgoz6QL66W*@|7)m&-ki;9KL5&`-w4Fx z%j~1(ne+dy&QRm`d4rR?Z*Ex01r6rbP4_cpxH@-shF-SI4DBQK$@c08O~r5&Q-!@6a`slG_gh)*6%%6O@7oM`7K5V1pkV&47Yd*sH-eDI=% zR7I{yn%FaI?BJ;%XDFScWKVcaBt!9?HHBKj^|G!7H-4tC8U|u@exm}3#@#2vGfAeD z7a?TpkI{nYfns%0aRTEY_K_(*xCzD$B)crdGUfRJz(2f3zORTF^q7?R$h0=|{$-Z8 zsCFo|l?nZGGmJO|->0w=eMg>!UfX|>zKu-!QV#b3wmG0SG*Xy6hviVgj~^{F__s{E z6vz(f|DC1lJZ_7mWfe^H#riAdoMJp0Uh6V{4dydwi%nxSlD4gc(20 zvktDjqG1Tlgk~pfCrL+E^jHn0k9-_<#cP^2lCNneA?M;A#RY;2Oe!?NDF6%BVc@hY~Q35~zo0*mQWkIs9|orlNBXpk)Og26uq zcy`|mAJuXm5!W9gH{j7%;ya#;KZ^iksN}W}#d{1^TpOebbbVcLuD|G-%ud~9&saZ1`o_BExXi@)QTqc zBvB-n+{{p#%c8oW^!YNqwyJ*rjhchszAFDnRX6Z~LfzFd@M*uC#+!=D#rmwb`O4z(W?=)s^v%VvvIpo zmBZe=1Qu=>SC-E0K~0JI=`p}X)Uum|BJohpc3MPi=?*9k{xS>ajq@n?yNU$>w_j|< z=BDLE{Bo0OCOIlcr}krS0pLY@2Tjd&u&6b#)QOA~$zmGlDmG({!V&s1GF9!-K?o@35S#V;knQz?0ey&wf;1L}a@Cnq8rn3kjKjVOe53!%MhUFRXT|(yN^*_-d#eQR_r)0|{OhJ?) zmQQW;Q3Un({45sxMFe2rqpLs!X$H^1=^FgZrxQTqf~u5 zg)owWAK?YWrM3B(q5EJ$>!*gdhc|L|@a-f7Uj>-H3myDXqj!0lJVcC3-Y(}+is0QG zFq<`hiyPRX2984vjzR=J{+S;$*-fNqUl1^V9Cg!DunO*p)*E-mV0ZpS4v3okM56Qm*FU+MoY(G`GyW&tG)B0k6!PTm22rzi}ZicL6^f<%V?yJ<$wx?WB@Th&cEq* zj?=Az%+1dUL@Ww<4)UR;%IKmz7BlQ*8yJg1o*6g;^P@!idpbido;7I(FgA1xZcP@F zF_~K!sWzpoTpEg{m!v>aE6d~Qtgk#AQHu&syx8x1La@?Fi6MZK>(sBt;wKrV%iCR= zppOItdk6-g3YDc8(6%f~@PZZ5TA?p3G@cMdNFp*Cqjx(P)1qRN>ozjao^56= zir_aEJ;`MdLD~dGbL(ioZ$aI3pD6bkpm3Mn<9W*Tr=@5!`KB~Bre6?WtETCnXd9st zo+aY30C1ls2PAxq`CU&MF8PDC*hbhugH;%rr|gW4FZd4a!#CUgdk^M#^h<*A?$aL! z%_l!&{X{a>^$WS}3ln?@ot#mSETBITj-Ls?nr3#t13;l5ekKb&G>9prOddxmh$yx_ zY6{4a4<+OF9m-H&^vn)9mE@9Oq`hI2TLe)oK5CQDDS}uz4gf(qv1n`Z09ye8)S*;R z*oL|YDzE`rRaghcL7R|(hC;VlAY-Vw#S|zIE44MKJVIQdQ~?zmzGqoj*07a{as!pg zp%PDCv8X$iaROnp7=`2GWVHbhDw+q?3Vn2BQia}5GEjMjLCb135rQga;-7c~EC738CJ?fA;?>Z$2}rhOA#nw=xFqH#6e67JX}vZ^lj+1(FA}| zQq__-GjKQHZ!)S{D8>}cL3Ncv1+L2UkW3yWawKGAvY>74G_7U`?$U1t4n-() zvpHN+O;dcBuW>NR%@8F)%eFgBu>yJNai4iJ73|S^PF+sPYpNy0V`iyi>^bom>7&^^ z=5oFt_PysJE?n;17UO*JEZ|(}0)35+iMjtb7zV}C7#Yn@_ae#ZkMW0n;rck>^iKxf z7fp33j1c3G`+}7TDA@0fKb5^HE4}RXB+OdAs?oWRT+e9oZ^X1W7G96oh~)0LY06h7 zExPwS3`~g$E?NWwOwN~@5k%Q8?4%UI6L*$nKTpciUniWSjqGk3@!9`euApq@o@IW@ z7+Xk5ZhpZk`9Dv;<5q~-2>cSt0Z|lxp24^fGe77Vm$EW1nEnA6)}c>;bHJoGwMn3G z`$HBrTYPEo6l%lBRe_KE5cd4gr{Rebn*+M(vN-g5o<)ELFd1-62aJ{{!o#uICV-JL z#qD#EQKHB(k`e+b@O$?bcoF9202PY@wL|4Q5B8A43lS!O&NvD!!e}|tf%8VstE6JM z;$sOg^@7?;O|@Wam0Zr%j3snwtf)0)Y2j{AAg3-E zJLbTPQ9^)aXxYIm$_q;DP+DBZ#G;zKk%O8p+VGFRMS6=WrLoy@eY2sp{_jY&OcZ&i zJ^1Tqc9ez`rh^5&uQ9+=DRoB!h&eE@+?ko2rhzKr&S+2y+ZM*njx4LjZWP$t*Gl2k( zV#S<)ht~NMy7?Qc4@f6UDOV}T%)rf=g^fE5nxboTbvaIxChgA@mNlF|nT%E^#|DHsGN-wEBNQu%ywe&{7d# z<*~yFvx?M|b$Pa2TMoH`iYib7->@bf@(5bMhriw#YefoX0uJ(F;uH|mQ#hffv9!r@ z!*}RYE`|hwZ&~$|qe8Iq2oMerJ#{$G`FDP*yTIA=OGabpv&P|X=j4oQ_{PvoOR@DT z#5M{5D1mSNq9UvcgG85+?meiRUfqWc&m!kEY}MJLmRD)#gWs+Li>M-~xPZ=?HtAA< zMd7UGGSuOh)QMm?#k4KxhrtA_YRIb4lmGJxPy^ftx(16uSb#wZq|jRKTWUKYykXT+ z+cbl+cV;qWO=`0cSFU3F@e;rmF(u5a-BT2>uI@lk(E)G;`VCx5sekj$p`EAwLm;3l4oDzoZ?o(Coob*ub%f!AOevkSL*Z;Q3gq*6ZW0%zbVTHxGT76Xf!nIt8$THXm zf84^5XF6rgYVR*<^ppr1--q8`S~;KsBx$ZCZCgyP^h_`8iOxsr3{^IPp}wo20wI)A zUCwsZmaBi_s*a70#C_!$hs-1D@a;eGd0>N@5>gJ^zg#e54}gN9%sEGFoEHelm1Owy zFrbUU#$+>Vi6sYOIjyw`!ZNEn`RcXsdWG|H2lAo+miOI-c*xk8(eRDm-TIRUqO{k9 zi0c+dReh@maN=;5?5szBff1m<3zZl0Iq& zWU>FEZ?;XkvAqnL@Rfg4L4M@+LX8IvKGFct6`HTi@vg#GbNWGYGId)3$Pt-iNi^t_ zT(;jWtE==e(~-UDBVSkitnFspr06;Dq36s3<+V3YJMGxBNq>c#qzHbrvVa17IBc{cj^z*O_eBW}U_ex< zLO}!>mKMb@@gm8jy_*c}kukRhuL9B)ANSM@$3_DL)hjq3od};pr1v;P=%l$^%&H0|u@Bbd6n!Xpa^XgE=|j-2Re z`n3a`3R{g%$D0KxEMY~ckyMqfokRiTp$V$++jU06NO!N9QTv_61s46VP4zWinM zsyV@gUs1M`{tDvOXj-`$P|9sksw%Q*s!0hJ7O9(fk%K-T31o)49KXU9G#@!|P^mc7 zSl3yB=uMQ=wJ*8OB7NkaL8UW!X=@fFPmcn+A_3_DKw+-@T4+OPA>S+|uRH{556Emg zH`rJGOTS@yAN>L{oErKK_23{yusp@gfJz*3ncD?e(<80%k(--2lb z@+-h>3jCdL98=8JAJl~e(m9d?eS#QbdJU0M<+loxgAgk-_;0TwK&BPoBT6YKv=Z6j zY{J$#P6_%mv03kiXBgpwsLp~JXYtAcE#4rUMiPD|=VZ#Y;7C!^y)%MLTB;B=n9@jq z#L_nZ24guESrp~Hanjx38(K}EHachM8bRB_geD5;Gz4lZXk(j)hCP#_eO}IilK)Je_2Y?7Pj7+{)2U;52<^D)rBQ`0-e~mDKa)ndf_S<=Cf(#Xqxy_XxtYUO-CXI=_X> z@;#vzd+W#h!N6nh=zw^9qTF6a=~1$DrAM&WwpJO5uJMm+7y6kk6r-Jo=7)Z6zHNW{S#%` zmt|86vryeatvxi7Kqo;k-_WK#7d~rh&C`k+eHX8$^>b%PRa$V+Zo7~9PtTdl5 zK6^)!iXt}NbY4lm`5O73)LG;phhwF0kdgO!u?BQ|dFE2W!sj~_*C(aQ1u1}dmHY0M zKy9k`Af2dj1m{P@j^l;ghAce&bSHDe+Ui<7)=H5D(G@kpwsCiaJRGA7eYmgKNyQPo zwoV&wqu_$rs!na_jngNSWO;BnVHexMcgvlOuW|7c#O)zejkVt17;7;iySB%AZ@(A2 zZ;rRI%eC5U==f!0&$Awk1{KoV9ioS#%*b`end=j3;kf}}DZXl{D`i0k4XY*=&3#$9 zXCMTyeU2U=YZHtx0484)=Fu4Sb}_+LSO%>d36Hbk&=?;I?9&7=2fVcGJ8C~16OQpJJXP1dWDa(gv;?m@G?XxB z%y;u`4Jl{Jy2Ro+S35N~vpy-wP$VCWLC`ym%cDt0k}d}CHK$GK1?|li6^lMP7#58X zyfYFQ6;S#bmj%`uPFIwdfb|7P@A+dsnHDbATBJw(MU^fGWt5=*Q^j{UynQFh*!c=> zxAo8fdfT%y6k8e?T$-31^D7IytOw4a<)j)5Oga!>Att?Eff~T`Wy&YvPOu;Te`}zJ zG~Km6(v7_X``?y8ufiKX{1+IjKLr1e0Qy_`vaUMoZ8vo83TJHRTKpsfZwxVCpvV#+ zStsNXTL5)>j*wLlsp7-vNe;Yb$8q@C6=k zAg-sPe(Ll$YD+{EPA^XeAJ$Wr5KevyNc!v!*_aPRpzGN87nZ z!xG$YhbwjJ+d7%eq6Pumgi{JDQMfquEoIVkOjuM9!BX!CS&~Ile3a_xd|}icG}nHl zX+m6mJw?1;ZvKQI=8c;eV$q%QG%*CKC2LBR>z3Ebm|L=trVHLm;Ryx+9&ycUFKB~o zjyc`CQapPCk=X4yhkD$ASqKFW>*c_>h2&4CBT$6$ATuT4EZIK4Jg^EermXJ{q*cRs z$~ofg(&ckyd6T-`gvzAoH>dTHfstNkI8M4-JUiVMQfd)^q1m4C1r@GrXR_GQXLAi= z^EpXC-Q86gRt-9H^{o(S3DT!*r&8@mHZw=&?EneH?jw(385yLq) z>xqv90F5?TPBv;2I>}lVTaY%SxZX9JzJ4sk4hhzoUEq=2su>93G=@oZ-Di!nQ=w26 z{p6y-ya5h64J}P-;OowqkC0M;J_=&G&t+qgF3%;E)6+XuL}{~z1i_?Ajr!K6ms=s4 zTIyY4W7UC<=$IipQd~Drkbs`McMWBMx)O=dzv^!$+xaYFzXxM21W~U^r{oji6t<|= zb%tdyNiwsqL$zGZkZsHHMwRO|T(bQr`P3M|mYVllDE1`=M?=XMf=#9jKy3~V0@MP!tH8wuq`FKHUa*rmOD_S%;BRL^CD zntylU!^73B+MZU4guUVKQKacuQUgV6`UD?v+D67!B0(@?W5aq#F(6bc@wkg8sY(I1 zsQ5pvp0WY+pRM_SUCREb>c1#j4G1nVp>&iN%5etFaH7z$YZ1BWFDW5}VoK|-pV>ui zAm1m>OJvo;-HKZ5a3+4U>mG)9?LA}P)b=Xn1rMkU;Vx%I;iX&G_-mCHxOa(M!7}G{ z7cH23&}Vo)>ZyFn-ZqhNr5z2jS7PN{Q*B_n?KZDj`v9)@H^wJOUt^OaM+^!5q_ypT zrau+ZSvM*dXXw6$=-Vk%5!7^vV|E}{M0A#~#04W>=Man~+aYQkhR}t*nG*4URf;!H zYP#dRobYOy#*`uvEksJL;LN4srhvK|sUsjyKSoIeT{6a$E>^P;-Vh#jowU{o-bQTE zu&&Fssc=)#twxRp8ES7y(iqC1u39qt)!1uYc#c9>+Fnc0z0~VsP=vn7SV-fTQt9&W zjTE`k(f~Q=l3-y#OIg7xszk}|7$%#|tr4`NT_9+s;hh$#PP#$9L3t~SCv1v^x0y?b zCc!_H!}?fclOFAb;$hKtObgT;560zUCx~y3PI7shp>2}3PC7d6n9znMjv`B87$=tI zFg!%k82h4-T*8k}$mij7xtw0d9%Q+UPPm$$0!kJMYSkLK~cQLtQ%4) z0Xe0y2kCdHX1>Q{msX(E1%sJLn4j+DnW7(6ehT?Xd1#8uK`bPKHVdm()J~zxBB0xr ztBRH-ET&5y( z-8dcSL)tmu2x&vg?0k7t7&`1hMM9A=G=l|E+YCFho)(DuR%h56RuySb)XfdZBl5I_ z7SIVf+U0b3DyRu6GP4vp->x8+SFKLrUFRS@JEaUM0b-+hT1%?tpETe~LK;R5(FB_eOjnhJ_q&H}ej%U)wHQ z9F`*(2x`w^Pq-OdJxxyM{#53=B&H20F_4_*FHmUnUXB5l8eaFfO%<8vDY06+RjT(%}heNO~sf{S{O=)hcIA zm8(Ye!TYEr2!dno_QgVbWJpM4CN!Q*c>G?M%m2Ruf-s?2qsSE!=2ogs$2~u>B3h|x z*hcV7tiOAk*9$8>T6G2W+OX9@3axOxY@AXzwVsOvyh=y0;V>$IF~J%y`AI8Nb(kQn z4DN2Fha4WStNwk>qO1N0YM!t8Q+3t%f9)TtRKU*KDv!Im#!*pKTj{N-)-hHouBOzY z(JD=|5v_(0D<*|buR{`dR>s|~T!lyXbyf9R*Ve4tw3k|zHHR15GO2V@JB3|tjgEn* zf`nYU&SEC^61NI;GlO92#1%u%L0#KS%}u>FsDh-Yx&)4!V^7%2C7(B_UUbJ!z_9Wp z^|vOag^jeADz%9#il8&xJ{13!k1VwbR+cuEB1FJ##ZpG34b@AYWGwGVu#&@vaWBgY z`b?Q{IT#U5I{B{ARQIi2Y~|FRvxfgCPi9q@Q==i@e}t(q^$J-1ISlPTM4)}$LA@;) zES?$`lvr*Oy)$yiGJf#nfan_HvPAekhCruBQcYx-cTbTvgI?f72gAT3jl64;%%-eL z=oIkrl;cdPb-W-$NGG<_USve{O!IptHx28uw+q5CUW}x>rm2)YkIfn`ewrGa0j^0B z2;Z}qm?(2-kPVf-1h-{a^mH2a#(G?l(BX0!HkHYi*VYmZyfgfk5OZ!mZa;^i@@27H zMfyqyKp$J6$sh>0XYndXMvN7^Ak!ZdB@*$S+f3)B#G)2-p!zy|Em|?S3UR5F18H$6DjLa9lwo<%I3unHUGX?!o7*d_A}- zkK#btug?g8)2Q&@N-9Bx)*5Zwc_6#nmcFckgjHvgmZezMgB|2M>>0x;Dw;}rSDbP* zn3-){uketaRAZhe(stYEP@HSwKk0d(lQ)s$F?SDOE~fo!rIVY_F^!W(6_r#!utn4n zXL~qdPE@VeBXaVkK4lH-8dtUV;@OX?CLGmh+1tng$WPs1D%^UW!|=639QL)_F51Un)mUSZSwAdrRGR#2J?p@wT+tgqBp|%mcw)s)x=c6j~!W!zh=J zMp9Nv>Ofx%0_}RHH{R@qNINGu3uz>}@S?TU6a$rAKw_h)2&X5Kp%q>SbyPat9*5WI z@>F;$U2ffqyFN5Opb7J}16=`IOgWHob3L}ciw>>?*kaC%cBW@KF9U~)?P@dGGP^pY|%hO z7|~IXP~;oAQN3t5Y=t;_9B`u=!Ds;S1x?|w#~g~N2}~-7t>K_JP#-b@Ed~v^|I=zR zeX-_G)o<~=-l{*=UZ`l}+H8Ky@7YSp9c?V)=h!02F->NBRNY?m#B`(1MmB0n_o0jE zyk&SboEoI5=g!#^xe04-dDNU=3B;ErNAjtE(-$;?>-gTc2&V7$``gN=nruVGP}bN| z&iPu6l!6(<|J#@Uy>b)jSaGF0`YKIdtIkz#&i~1xS@+q}h%2F&x2;^NI}61F+!ggr zL|BJ^RmqV%O+`ooi z{-x5d$puOo+H^Bm&vew`YE(^#(wz|rnB3mfuJbGPnpI1sCxM%%EVWN8q^)p9@w6TV zp>sJR^3f)Q8DZ1vb;lJS#>F{oW=~~OIbQQuy*wP$I18eK&XMU!$wqPPSMl-6+MF7* zj1x5aw$pl1;(fUeGr(Z7{b?8`A&M;EKNWHcm0RQ$0<4H=*?eHG04$k+X^co4B^tGf zN#?rJZDFyCffCA8K-d@&Yli_LIHP>bl1`NGqXcR|#mb(l5k+3K^bzSA9Vu89W)-?W zTGj;&2AB)3ayb{4|K~>Y(Q3=UD6_V1B3x%m4&HXKOrqA&^qYBf>(nLtBiBXV#-j-= z+vzJvM8c$iC0UredxYl+?C%$wGP)^Rwf1DO;Q~N#m3DW@7DW`pWJFQ#5skodqKqAt z&4R7TmVDx;08<*NCnhO^{*93?MfWYYK}fl08RoRJ>uO{G!*4P-8(1OBlTT)Dmxtq_ ztf`kg?|H`KQ5Yb(9Ym6^4~8tsfq4jgY|c^lYD`~$6i9ZJnm02PUt|WyRw4qMXXFrW zTUsLy56{Np3O-nPE`0?b=JJy_UT+p=UZ*2`rGlm~@+;nKS$)#s_OLs_S|Ug|1WlB~wMr&f}znpV1vM7%+MY<*_?clnMu zovv4++IDcXn>TU!uETd8RM87!L|%nq(}X*a!;_Xo$RVFS6f(6VgD5U*3e0l(annMf z`d4)xS8~N)iHr7Frxn(l=`*89M5XB9YkxLJD&DN8yT!&1eZDhaubXnVQRIij zdRY+>ScB74BSEUjz8Mgmk89o;M(SMn$B|xa3GD_9?7r67EUs`5?rHIb(JpVNd6YMT zz94%|sC5~&Q4tr_(XKS5l|r$auA~%6w%JMx<5pA{Nr3{F@zEw-im0se*o+r7YcUp; zxny+U88D&sPIU%_f<5kW<|3dDBTd;HgH$EzC3|6P^CGGcC8BF>06Hg!m(u9>YO0kQ zFRTU;e6!H4Vw*-)qSHBSoB`g@N)s6LXstq6*F?gfOcDZE{-;f*oq_A2B90yyVzgkfr(hArU-W_?&V%k!K ztTF*MGU<+bKDU;-{5zs0En?jqHX%795qZ2$Y&87OUC49HJ6r!Fi6?@t>qlu#`xZeB zr@Pb3-d+`DANUr7F#!YsD@&7LQg{s)hi;EQWxX5|vZ%InqEd8j)A2c!`*X3sBFO2C zglh)-2b&h}#x2u8+)@>e$*1J<6R+~(L$!X++q_yyU2_t<{I-?DW1gE_a|m__ar$VZ z((3JPFNP(IL^eb5tLkSoHQTUF9@eR01qip3uaBTw*JBvM%cX^)3l(9Gt5 z%#H5O0(N&GW|_7B&+c}j(gT{I9ilJ;y)oye#wl@3!(@11OAES|vwmlHMbdJ=a7lM= zv#z*52KHk>ju5`Rlr@gu23@{?x%hsQyq-Dh(euVwBdBoo5`MA_l@HhHtU2Hac{K!3!p)Uy0YkvLMPgmp1Y(m?hFCjQmDfHxhtyFflN*vTG^YSq$P=6t9To?@s z%N4JHc8s9*h&e?tZj^GI;;e!Hcj9xf3$L|C2bSg^81y$T^tR5e#OjqJ<%#pPwK|D8QZVbsR|3Z5C|k5Z<&q!`I(8Q_uh0e z#h~~uiZ}5kalcu-vfuJ?^Yx#P*m6Cq+K%@>*A4f4mE`-?VRxoj>>%>4HkK%Tl>(K5ap%bBVj2OA!(6?7pkATuwowCpK$XUeFc9F19H85I3=Ubf@B=-0^_>pte{cv1<9t015bS^lNe>G4bU zC|KH4JGZ|So(Z5YjEx^oSSir6Jzh$WX<`SE!EO2SWLQ~LGBrx?bZ5+*ClJ^*6Ts*2 z58}6T2JFZ4?cf!^Q8gMvvH^a6KBwxf>sAEm9Rz2p`)K<4>k(La3g%gDGWO$7ByuI* z&xdknG%PV_8i>0o7qP9n`oEyvNj)8WE2*^`lkYc z*Hoi)m=`H5#nOQV*H^Ghj@iR~5rUJhZ#+q}281JR8nXEd^LCZgQH4Az=f4&SF!?ek z=I_Wm&Xga*Hd!+}Nul}6+o0OX{(c+1zT4^yUg_e)ti*5U z<9=&%PDwFB;WjtRk*RWqn{oPR2G=a^r?m|c0RC1iP56?JO3%b++-Pu5kv130%Zs)o znBMJ`q{hT)lC(=8CoketHA>>ugIUs%?!=d`FzCZS?y7I@h3;1vo(FM zZ+!Ky-^0rE?Q(VEi_B&V{W7&JsG9K^n5kLb+T~s)CU-UW_p7$v?vKl6-+9JhRz}Zt z^Nam^vDXDML=szy4-s^lFU`sYV=|X~-J#6SjJg~B*(O`) zFWwA`HX`t!)nnOKP%H7!AT`%=w5j@rTLK`1n@GhfeY5s<>0G}aoTN)oOTwF%yP-Ca zrO&{!-*|z*cI@4XclW;Y-g6BW)#|$UvzWy!^F()C0#f0f_30u-2GB=3_n;zOb%-t@ zyHVA0=MBAZMZn(!o}{>oi5~R_V?9-=Xgm`#Ig~^1n7O2 zdQwG0Gxd8N(_|s_MDiKgl``cZBl)mlAKWj>5IzfRQr>z5TVVeZAs3Kc@76p&NYqsn zX=jC4KQN*Rv?}i!#fYm9t!YQ4#oRL!O8yuUkby$}T#m54stHFsX4u3JY07YLUH*!4 zozouD*3v}s7+>r${Y!SN35j2xPGEEFQ^ApVuC=Hr#6S!|%p`*S+*ATj0Y6r-`9Rf@ zZg~cxcSFM+e$zsYg%{2AX^}43Uu|4>r&kWSxiU{`G%edvDy9W}q)mttZNg_)ZcW)u zTG!xrtaW-l)V+oyTfD~lYXx zk_aoeZKHb0Mdjw~<2(+!TOU@mW?7@pXr*S6gNS82W+PX^$h#?Gswa)oo?~)d7kB3C zlum&te3Vx=zXQ&b|H+Z{Ws|hxA}A^bj>lVh;;mmC276w;@X)Rn9VXy%>?*%#jsBc1 z-_Ngf$^mq(GCR5-Pb~d9q4WW-^xWcCJ;aqoWvBYPB5*ZOt}Q}B<^G~!DH0rVr5V1# z`}CY&Q&}Z`l&C9?7K?tQ5TYN$eQ$mj2(Shpb29p`N)J035CI}*Q74Yq-+FrHpw@B( z_)|?~*n;B&ZYR0OVYt)Q=l|ci>5XiUIvWg49yoM2Gjn{L#aVxMOvRVzj4JX1rO=B7 za9MHUX98eTb}DV>)IwkL*xjs*i8fJ_4AhJ%`4OU=$T4?iwzH7Pi58=H7CLOJo8+;v zsw}4Sq&*tT6gT>8xjXZJP=_%A5B~NO#6|P+JrF)MdPBius&R6#HG%LJ*GIk+7`ge& z<-7L+>`9HZ=JlJyEq5NFzoj&Ik z_nywqpUlsn&d;K*j;H&L$qez!Cd7c$gy>x0`W-|?OqVTWhyJt+KR<@c<&NiK{x!nNl*3xy=(9*S) zhd+G(Dr2TK6~){0(ADgY(`}1?4*tIG48FH_&5VS{=#3KYqEw>SOT`8Q@v@N)OW5l` zSiX4$@=C3f|CMY1f_ZMd&4z{%COs?LCUs(Txw#^4y>yY#@(GQ)9|U(Du%n%6K!a_;8g%Nl?kcVVIXS< ztL>?MvT73EgERx3G$cq=y{^^8?~6qdfmeb{6TSP3D@(ha?~Lp2u$AhA%)70l2UJSS2tlAPzJ)|>0vUuQvjzcN33 zqvrAp&RH!Iy1=@^Wc|pnZfMg@-Xv=KC8BvE!dO-gF@>c~@pg6h6}q3Yr}VtZKN|1s z`PYeyn({S=_=ZCOW=h^1vFO7&jV}u`Uh0q%Us%LzlNGJ`BUEouf$+jw9-_j6N3Val zzp}3++36(riSh3V=Y8+*d}p1{6Qdn_Om5g}C{-L>%W><|mq43?UEk8FFlC+#ODi)uELUIC@5O z!FTj`)yh`jYEl+w7X8kl&}A^xxa{xH`&?fUy|vbf=^3B&>mOlE+;53_=rOqfYzihS z53F1GQr@bHws>f^4I620)L;0CDPZ4z@#tlXW$eB$`4d>ZdrbGRTOMr!{i}YkXhyW! z@u|pJenoWC8ZU!zTAcrzydKq$KOHspg;=u3cq= zG%|iPKJJU#E|#V@a3|9Slbv{L5de;7d61$DgZ#JIYa#GJs4Dfhi-} zIa(N6`F`7Dfohk30ln3!)n2EG+3If=O2xH}c7vmNQGq=he<~$rE=HIv#K`qo7q>`v zKj7v`D|k0I()_}`3Gwzr8>)!LC$Ntm5MqyyE6nk`%oV;mVZt2_Wz!n!Tb=2lBh2)( zat9^N=?lksgR%CUF(gg*dht7adnLuh=E{a^>fr#6XU0?F$J4SmO)fj@+$2-lEpvZy zwqrH{pJ1Luw!Qlrhu`HR*L~z~QaIM02#lO{2^q!q)O3mue57`knz^;BcSSXH`IXO3x3O?mcBsuy@G}iteh;!9 z@b8yjFyMzqbrAsWCb-^7J-!&)B)TN4!Och^6Kd8cJM-2{y5v&Q|91G-=Oim*&_AIe zP*CZC%x2Hpt9E3Tql?Ji7~jvALA2y7UYe^bAh4&fQ{hJA$mLtHw?FKBmUhE7hXJx> z&Jz=hDvODP;LuJO7rOZ7OZGa{`F5;`Z|RDiM1bg zy!kD1XC>Lh;Yf#S8<1-DW^2W~w5-XgSFVA09)Xfw$^W&Rru)fCPsOT4{Z`!~wJC48 z46k0C`c`|0XVPNP%GjqBdd9rmwJB_kS$sQYJ;r*2PHUL>fYAw~Rr4_l8`fZ>U%z*; z7ogKC(;}y|d7nnkUrS??nP=R_R|mtnxseUs|(z z?OjL7&x-r;6(qsfQkz?EVqhCyGuZkJt0k-`&symRuD~fLn%!IN(C9jYmwi)bQb%W}ZwNmihY(%2yE84V zvs>1Lkjst3U+TP-5}#-n%I7;8Hqh3cZ62DChQ?FkLh%Bp*HBYY!E?p2+J z8Yj1--c(-hY?Dg^lQ9!5FIksMYzHo8FSHN=}a5v9cvUQVX?D2(pwu`<3JyStZ z!(OuTc0)Evif!dBd)Yp2x0}_H{K%4RGeytAD?pm2!rST3aP^R^2d*9rgQjx((e zOulRPo=jeLJ1J3q(;fgUcCk+rlTwfd1!a@O4v%SVDwRy8?Do=9PMKm9U7enSBub-9 zyBl2byaP~oY7=2eL`q?W4pAUICu3b}@?N85;^yInG+cK5Z!yp^2njIy&8Mol7$s zN>K##43 z4!M{w+5}qG;R=}|0r;ZN;B+}UJPvDLVcc9FxR3vvixt=Du(AS!<_bS>YzUS=;GZ7& zP@E&cov^*DkNVb;*{$~WnRoZ^O>f?6pWXDor6+8&T7|7Nny__lr!Ci;mU%NLedWfI z4bPp-@YO9u#Q)Yhz7~d^%t@DpO#`kZIIOMS_rflZ!)!dljR1;ocJabsXtGZQjC3PU zh{d(;ZUNWuhPAh%8kt?1mf5gg#>kG$x7$$$03pxcyYA<@hkXK;@>K#XMp!-YrImF2H|X}8& z#Ccu>IzQyK+Mt2KHEnMStMl^0xU$auJQ}++Leu1|*G)8R@tp=s`>y}^%=|_o*q)NB zS%XS|b=>D+>!e>?C?QR7JT;uhk|Se?41Yc)xOdX}j<-)|@7hvKSN$JscC3kbKjCp-rlcz(_ON!_F_y zU_Dm4pdBI8|FBHs3yM})q;YtH9uw{4?Xj-APev9EC6x{(v#?L4r~F$FI>b@SZ7oUE zTuxJ094I*v9Y#p*{P(JnZ*ED;c;d$B1HRVU!?#69-RcKCmRNnPq@|Gkc+4seJ;rCa z%YW3|swY{NKH+hwOLb|RgX?Edl8}&Z_DV}D-*N8^uQqsYz>WCW;;{Zuoe5gp zbfSe#Z_lh(dwaiEGSo$aql&_|b4vGsz6vsx9B0)~AAa?ty|_dne}w2^-TynF4Td4`R5etNQi z`=8cDS_=1AFY1sidhW{8hWK_(RUZV7siM-phPZZ^kA(U}NL3mo4nvSXaig7b+M_Ab z>pMQ2!5;5R?}h?~s6KP6_6bgLX?P8-E!Y>isH~#Q{B7(Gk7tav_i3t=t;$+N4`=l( z+I-obad+;_PdYutC87JcR`kcdN@l(hi{q26t0%cRC@IRBMGhbXM4tfq6d8@NV?78g zhLiacQ_y;o4O?-@2ZNy%J38|so8(ZpQ*QuXg+p7=os2MEr6P~aS?vTzj3(-Xgadi@Ar)171W!DWy;RqjzkSiW2CnL^a;sh%l`1&m`E!=0> zo%1%@LM*et43DXRP4!Uu&hPmetZv zolZJ7+Vh`LM_zhp%zGPD&1+|KqAHyZyJ}=sVCaov3JAcaa6I@A-(0-{-lEPGdv1PN zLIIz4s0BXj0B@gEG#;>SVKCr$+V7>~?%-{vomV^(V!s7pl~{GU!SufedaK6@3G?}PH&30 zH}?$Rva(4b;53PC8wt{U@)GLGhk~1$Zi+dH0`r)+c)}1N&)zoQnpe?|zs{=hj9_Oc zQOIk}+(Tx*VU6?6QXfbJFrglh?z*ZkuIJAd?q%ldO1MLh=>Bv|xvm`yz{HVLF##0q zE zBr{3vou2@Xf9=SqXflY}u@%_L>);03c4LmSfcIEiw4%ww491t18YVcO`^LMMd* z902H>=K)bx2cVy7zI<=oq2DMI*42Fn;#uzaMMM)`ZG-Vo)1J*tmQ-SX_3OMlhG+s> z0k}O^|7CBH%G2S#HX{q~krsVmv#{fAY-;T4BiH${{M&iwREI{|oG}VW2v5Bm_L?~f zy2buk+_w-2-F1cyeZ9KhbhN&Lh4A*wigqq8>Fc zg=d+YB0#K^;FJ{ot>i%fw)qnKQNfH#~}Tbg(1Ua`x=l z5l~GH@tWzOnw2+}5fYXQuND*QY{W0YcknyQ9W}KG2Uh|7!(+?q<7;@7jJD%LIoBg= z9NVJ+Z0ayHY?A=y6!R-0m-vb)O;fhRExWmBgy$QDIe_J$_=LT!O>XJ(i~?}fo988A zxkJnPPRL(%^$0byI34`62*9O%FhZlDLh`)5yHQ*$YN%F6BFY7n$g%qun{=bx|AcN5 z@LED#LBOK3O-2d?raPQ}HlRD%@G{0U4amZN9i#X!>P*n()7>2EHuz4{Q~4I!2X`W2 zmW%?nB>KN;zt+y7_v~R8Do%Egmkm6Gjgu5VJxvGQTA9RG^&ehHcvOCp%}b zWgQJX0^HOsEITMQC?$Cxo+}5^o%>k-g)M5&xd_)LAG-c@}uS>EJdfp^5F-y7JL_Y&Qo>Mfi z{c9tkx_jbJt#zVmK8x+_&7kD`41(K!<$DD_=dQQy19_Sml5+%!KLQ_;BMehqq|J?4 z7G`bAT+(vS3ou8{onivbzGr0VEB-iP3JN;2gTL+1U#*dvMzNmUdL8o7$J_q<>vof8 zW`^E3L1unRx2aP8X!p+Z_Ga}X|N73TTlWJFpMd*v06%sY34f=!3xrsLuMQigFiGFt zxK5LleWOG*uis&(;nym!Kd2)>2woMl2ewM|loIKF_+f4G>(}zP?ApALFmp1?zpWXiG172;j)`NBa#BAhc@HEpAsSIEb zn`Sx-G?x|Y=4laQ$@f(PvI~ej?H~NbZE=SlG0<>-{)z}id3@cB#$rjd2vrnn9@h%G z4hr;G9(48nqU5d!{^cO5IA`9Nwt;Q8#j^RbQCuIAkk83clxPOo>A z>Lch1W8Q?{ppz;}MN%u%3Rosj6V}98UAH>?UXiweX}2Hxlo!;#m%JeZ(lkaeh9#~5 zL_oX0GcV6|z)P_YnMX<%zvAafxZe4dRUuV)y+3&B#cp)BdsKZ+rnk{n7TDuih5pQa z`Q95Oc!kesf2_=No8O<`0N>SpKd^4gl%)dp{w%oW7j^c#wAl>wnS~}>2;6h#*Uwbd z_v6-)4P#qX;cFt2g=F0&s(_}b9xnFN8R>a+`LaS#Hj{(NsSp&+AR9;1-7^&hm^=-v zv`obXS%;fvp7nN(ao7Jm1^&A-;u|RT8AI5QYtb1KOK)3r1E?4RBi-mv!c)AcD{X5K zxNHiX;i$P_iM%!anxI{I`@uBKNas}q;BKLlHX9?UOt5RWW;Mq()VlYy(P%0RhLd6| z*&Pc&k)Gn9q_0K}i;ikGYfftBugy>Lre_C0cKqoSc4Z0h3QYvKL7qv(gSu}OS;LZvhgP?%k@q;psbMBa4H z>Il>0dzNUwF2Q*J0kxMNFUq1fi5PixC(zHA4fP`{wZv;;3;~aHImjMKGj1flSj_nD zGbP}oBgvx6BsH^#!DO)yV96W+TM5zo4MMlyNKg4@3Q8?Q-2FYF2Hrz4pQ6&zo5$E) z31oc~y4lYxziZg<2w4~o`?nBI$<6px3r#o{Lp+8iPECNPAcTN}3!l*`_4w#HC;?`2 zx!e48Oyx`nHa+`oJ}y#UlkOyG&9fWn)t69QOOl)aO-!3JcJ9fVgK*b7(qggwNP*Q^ zkV@kd&v@`2G|xH-#5Xr|P^-856(w2B|DO9Zd-`H1CI+{D1l(fF$CvAt?MIiFkR5>1 z^$w3%Tt8CqrW35A<1R5i@rXa!YEC;dB{bLX?|-5z{cMwZ1i+-TgdaXf>mSQBJcedY z$C~*4!`{*fw`0BnGc+#B>N8iKWvObSOgnzT55a z!|^d)z@_#C=7)?ByiykGw*qdq%inms;X_l{Ph#?`o`w!L#SxH?l(DZ2ADTWF=h7wAMZ>3-}4ij_Ncd= zB@4M+z@`GPx4-$noi}dMH$pdZ{h9((#=Mg&!@kU7iU;pGqrNg+)vuRF{)NCXu2BeR z`PbtNuG6LzO_mpL++a-IeCJbbdN@b#kvp~glz%}c){N`kXen2-s#Llq$*o6>-7=s% z9MjH1DA=+4y^<`gCzD2aM)J;keDZn> z831#x`Kg{}wBMODuE$6s#7k+B)t!lLN?J^cfU7^c`eb-E*{Myj=!&?G0+C;=jnI-R zgFmro}T)HGx%NF>rva8j}CJQxDHdEQ+x=dh-X%T=N05?ZF zn{v4L_YPL;gUI}jmcKg7=jZF~obgxLrk>02z?yFH6#-}A?oKuWyw?O8p+?C(&f0U3 z0VdOAv}SfKE!~{OC3R9A65x+gsTso{r_36tc#gI@R%LSxEt%eRKg(M%0BmM}aF8I?E-6V<8E`yJyw5SLT(^E+?2r|-P+(h8>NUj>Sn zFM?b3;d@^8b-9p6=lF6J^j2d+kS+QID9bo&y^_fJen1PHE2%!sO|L?N#mt-r9N0CF840?Q9Vzp;r-Q`T8=23=AD;D?zYqv z*}UazVV-R4^72aBEYG42egChTZU3l%CcmG2k;_SnjSV{?4Xs9uN7m7yC0i1`d*qB<=QP-(@sfmb?N{IGi@ZiQH|G z7u)>gYY&F-HUO`5?iElPm`-jZVyMfl=sg>mYAbR2vRk@UMv^lx!8JQ8t9ZG4AtR77 zz?4Q*v;>ojmIsL}qU&%5Br9cJFw7q%wk(ffnt@p0iSeg}=>?#AG|7lQmm}rOmx!{( zq3QA;=Hp(+y)@=5nlNFFU^08+=L|o+3C1_^xkI{d7K$5M=iWBi-(7Bbp!Aax5}93q z9}(rpM6+mW!Ad%jP6`_F55X~~fNcA?k7hPEX*y>zcjD)a?L^M_w(BV?e{&=A3a&;u z{n%(WO)W$jL<}MY&u*%2B{hO`3$_l`h_NN1S>3bdpaRf`8Wb=-G1W)#u`@Bh98WcB zu&C@8IVLC?$Kt+YyM}tRz1idJ7>;CW$}ol{9YcpewkvJOHdwQ=lN*NfPQn7X$@|_a8Gi-rA8ge&{{81pn6H ze7p(PW|5_1jNm>Gw~rsJ0J`SIH~Yeknq#TOrmflTcu6R~es##};1+h{R`U8Zfar}+ zXQe;rvG|7WF#jqeyD^(p`e}M%c7U{#%sz)MqZTGU|NAVk)&mgFB;VXc`qTwrP8T}R zQ>6G(NNm-0%8bU9jKJEK?E=co|3+P4GoBF=h0L3uM&c8AZmCa0fHi%V9m&^FP4ozn>CPJK%NUY|8Na|f1 z1ws}VYm2|ad$r8#s1Pee6SAAMPwir)4ZGr=vYKnl`Zq)QrgR#57F|@fqU{9sE{X7% zcTV$Jg^CsQHGF*88QaVd$yb^+@*TfaWSzdVqJJ9IY1>fVei2;y$lbKLGxUaLAcrG% z#?t(oC#QKg^Xu6M_|Vf6m&wqAv|_}< z)J=Ey$Xf=B8W`?xf)v-8mWbAg5bS$8L^bdSpHUR#?~&VtQ=}kUmT@};XG|N}^6(r8 zqvEovOM$KyZ@!Nm$-y>oZ9F6Je9g$kYVWlp5I%V?_O8$nF@%g>!**61_yBI6jBYQp z=>d*|vT|v7%^r>?0yqI4CQnXqA@l|#?>g@4;_7OX57^4+dj0_&xjkw6mWKmUzf*+_ zGl}s;s?Lw4X%H zh{#QRjJy1Emm@=(4SB|aW0aM*^7Yomf0{#{W{%%2XdkwD#)hO&)_^dbqV`(FLqkmdK{Wy$$Cq zFa=SnCWGi!+OyBD-XMGy&Z=UPglPATidOaGXhOTbFp*vSP*n}?6?>wK#Cg~L16Eixyj9AQ8NL5#X78)r(xGLMUFY1 zZc3!5XGiOd72J6=1zI58F3#&%4vicjO}{QJGhdfLh#>HZU>e1s-x2m;wd^Xjz(@Gf zmJ(nic>5SM7_PU70kCj&M?*{0lW{=XGL@7kDU${qtninxaE~L&>&;e=I9kcu?&mn} zRWaG}>ZPdpN%K#?sSN}d#v8X=4OzrfZ<`pF#NdwwPmAnHbLS{RlazpqXB-8 zQUnnc@>g@u4HSrdvH{Ef71tHlfBJ}$|I#cS67Gt^elxcO;j|F7kfJ_u>O3Z4eZq$M zV8mAVezVN+Kp}P|u8GG!WV$Vg08;DKXvt_mb}dbyr??#{BmmKib_C%1mJI!2e3$+^ z^Y;ZknvK_;ffwk(!2oUOu0nkbl}}lsb3GgDw+*0%Y|i(#uWZfMWWS+%1JL~Jjy3x`XDd}Cm9H}0L^$Okh&@CSj{))cL%`i5 z7X+^;k{soL?D=96&2g-1QnzDLH^2zlbGcfucr_$EVK8<5?j*T4WkdY4BGGXV_+$TK967hcdjWyZ0tV^6M5R#aY?_|PO7DIc9V=9e)jr)vZR4%u z2fLqsbM0UJ%<|^p<<{Z0p$UTX9D+2gkdmd++q5Ccz|ogaZ#gUB2ziFIeC_SII$c%{ zTw;^apKY)F!G+hF^J`gAI+Ask|CXbhUkOi{4*||a!utx8FdcFmRj?Y4>jb-2o_Ht0 zW-8ev25=mg*7lo8gtUtQJle&{E38&%PaRyddZ7(rb3#0cYykVv>(}SzH+hvWtGW({ zA>C>$=(7OMnEGvt+G{^xqfo%AfE?&I0H)L~ZoaH(de4Xh(NElfI_-)EIOToJ->|!0 zzpBrxTyrUhBmZ_hoVOwQQIj*P+TSp?mBtaILIGQl-v#amLnb@k2Cc z8C5f|mja*-y~9Ay18d8VD8BfS{l8k(r;K}U4e6xLe)7Ow;#g1+SYr;27_|imWDsGN zuVryP-lrT9u|{3(!y2(bV`$#rH-PRNl!~;ra zxHbNH3#3ex+h=-gy5WrG710)?PT;8F{FUx^i(+PUV|?P(`;{%q!2N>=+?; zx|rP~YJ)5;0#LM;sq7msh#SdRLs;Am{s(}@ea=$I z$jyCDCuueJi=QNHm(@L_v0KLZ3IHF7mrmSrO8DJuW zXk@=HumWil#U}Jj_o(pS9AN-RvMaC}!y^Rt*lQ2yKl=!XE7R^TdON5cQw$ijxI$8O zt>=$Ssj};D>Kud8Kx0pGGlG~IMJACuI(w6^CHEz7#kCk;mN1gChKg~y{0{)rxiawg z^};F}**Pkpf0Vbss3oQyZMXjP+w~yMUA-qOx_HF05>r^He*0HGC}Xy1jGIS2Db0C< zPv?z}!J}_X4J)FHIrHB-G5@#xuujWQ;Tp#_0?&6G<(x0!wOj(8rm12f4d`5B~$2{%`Y&!JD?>j z_jqrNV%;adexkj77is_{5R+m|BlA~O*zt;MEae~DlMy+iW@cDvg<`x2eBM?W{gV+G9m9Z|c zh{V9RHAto%y@;!V7MW+?e){Ovz`_F}`-uErlYO%wziW5bnd!hb*>-K+!ZcJv0sYxqs2y+M^vtoMj9wRuz@c zw4qM7BPe`=@v}x0+AI<=<+uc|9o4?XzI;(yZCjZbi7KZ;C*$=Ay_;FM9ia>IL%f$c zCs9Zv_l!;alPW`E|CS!-eVrz~uIAJ{qPx^aT=~Zk$C$&0lY_~y10YO)SGx*#KsO;o z1!se!ou?b(&lBz@9)E7o6T26TV2G?Hl>v&ys@?lZ&02a1W`4)zth#Pcdj5}93h^t5 z_<5W$o#U3O3-bSArl#gn#7nh=g#=e3ZtP()2U@33h^JQnYC%z0j{iuenM#M#rArKy zSqL4*d=Z9g-_L)Q_iBSg`)}d<(c_pCb-$j_i+q61tb6%oa*FDveUb7x-%-Atlv)SJ zZf`SR*1?IV)&l06My{&n(FFo6Z4qgVFsi7kzK(V>R<_ULxX(01#afI*QLXT^@cZv9 zua|bVOfWKwjFigv^8+IA26A|fCx9c1p4PE)bNA5veEFau*T%}qeed*U(ZI` z_@%D>>O+2ATC*5wQG%&0M_2o7l1tIUL&fG`*+6256wFOO*pC4re=0$=Bs6v(V#h+a z4d~8<&cBE!Lcm)7|NORrjCS|uN);CH@O%AC-*@}m=wvA^Nzu`+WTX&W3gx_RhonTd z-WoQ;@A6!6ccGaA89%YARo00t3MR-R*9+>P6rddD0Aw z50`GaV(I~@`F8gdLdosTC%Rhr?RwMBnc-=oY1lixH2ogU_ECGdlp6z!Rhq&yR_r!~ z!+(gjKpzhkhmBL@gzV4 zEh-b!QJ0xX9={}YW&;F!iyrF_vhwG0TC3EFZ!NTHI_@1?I(X6I#)aAQ{=>rPqf`*! zRBEZ98C@4{bky-_*nGrBvJZ*dEw0 zE6&70!S*61boZwQUGzJ5VXU(ZY}H--D(+JTP)Bs5g^ z@sNM|v5xW6yws@$QkKu0_>XGU@J62n%%qe4=EIg#l(4zw};?8F+bD;##XI!RU?N=X{gf$en)GcWAypBsnc~^XXg_ zW-Hpe3b?k*lTR6U>e7e?AL{DdwLG0Q36EFIBaM$<$DeIV!zB{(=PQ$2D8W1`o+%3GOw>;3F^s!xl zhf7lE&ZwkKIsSH3NymH z%e3xbys6V>eGCS~gU0TH_cimkudnX`nP=(hq^g?b4*$kW?LzDtRDD4zs_m*vA$V?N zAI6Vtf6<=W`Xp8(@bTxVw zLEN*9&Y-yh>@Sbnvljox4sz$z8`O&XPjp?35yHGIGdyo`ZGoIhNf=b4EFS>tftiP1 z3seyky4V)|R5(Pe0kUFf(VJ;mKR?rHAT6iFOza`L3TNLIUQkbR6$#I@-c)S7x!HY; zFaif4uXMADn3>H$hr0OAJbs_aVm zHh=``w3R*}`R2n^a2y-~Bx4eoi&c@7%jsjRBixtJer()v)A$wWpi-Ml$J!N~EphrM zRkcLf%BrDQd=Wtc9j3+S2R!EZ)L_2y#VxbE?sNvM58V>0e_~arm={((JsB$?4zC_2 z$Aho+Zcv%_L%QIkM4)V-Vdl%aDeHR9#59A?95&jitXp|txPg09JD0L#Xq5f4hg+^4 zK4G5;0*{uG)0Aqk0p>Vx1%eUqL`^V)N|i#qzkiwfe0by8)*T6*klI&3@5gHg-w%QR zj8N(y!j$jaWXMGaR(Nc1BTWB$Qoj@=?Tk;gPu8neju|pBlo|qh z?jvu*E|~7UaAv}<)+g)D_E2*)2ME=20uFjGDW%K%hfcfJ%)eXFz*3T|NawPnSGsKL z97p$a(dg(y>ld zj&!|I5(HLD(|~WAlNbL0rHK)>r$d`Bsm%k@zP;&#AgFZ^m%IkgVqJJk!g7i#&|g$E zmdox=HYu;p_Fa14uGg$T3dp~f+PD16@%R-V%VDnt=NLG+a(GF;^k|=*;P0mG*b5ZR z+Nuh?jx$nOE3RzO8L*+tD{5=#c2ekO^dWwu+LuHsKZX#B&w%tvi|c4U))x(i96Z;w zW|7&m7;)blMH6HedTAM;zkG)0L%McJ%n0;YWr^X zo#_4=Y(%sX!GU^)_+UkLX!)Ht1I)o&)B4`43%bSj?S*R15OH&|fo%i@7PIgV>;%Qu)`H zx~x>RD^4m`OwBM6dB|sMSsU#iUPSt5wK2Y>xVA-02tC5U%l;eTVD9EC_#uZ!7(e(h z5m-DLW$ZnFe<4(vgz)tqgPP-@t(Vn6`|%o@k8{=TdF~;Qo#_THz^V`4I$>%~tZqB| zil@q=&O=N?cz)euGY5d>tm*WS;frH7^sQ1~S zC^YtZk1*nH`Rae}(AT<}tnQVqUKcI1zO0RgB$>&L!S9xD_FqBK`oM`(v)67Iz^`;v zM^aWLi&|Q_y6^yYYjyd9j1$)tIYZ5hA@cIWRY2F6%Cwi|__r8IF|VlSA6#12?St69m+(Yl^^2r)q zjg$0c={D16olCkDmq(pmy{X+wWc zieXJE{wq;KOREdGmT@Wd^x;QQr_=93e1WRy>v^Z=4||>#{HG7gpFxa980OZM+fHw| z7hJ3i{p?Nc4z@jdan}pAr^E;SS37H!Jxg0;!l?Kz;S(&Z1QE76&q^vx`|PvmuXTEO zg#KFH{$OjP^>Av+ku5eAm9uw@siz(ziqyoi)AV4NdXyh?}wFuL?qFBmadtG0JBfHH-8 z0I-B#AaH+g;}}KKR`w#J!qMEcqGrJ>+hoSX@!2moS8xt65nlaQ(}&E5nIV7XA{dDN zJ9{qFdl0?KN_1zISDxjT@aD&E^2eE>Dd8{qF`$i)W|7TzGq2lB=P?L8)lD8RnFnlA ze0(LPnFOEL%Jm0J`v`_h1;ihoOTCdgjU{4br+>#s@8Dm)-qH}JEe$`Y3Rl_L5`bi; z%Tc-bl*(kvghN62#y!(qi7R0yPcdf=yB!c`U9%a{s`OPT3H3*)Yg^zzWJ$m$vn4mn zR3xne&EBFq!_F->NsUQ;Ilb#fW5da?;Z7cWrV_H#Uy0l~w_`8r@IKr=^jtrdd7IkQ zyKo(*^(ZC-E1x!L1D!46q?c8e4b&kaLSU7PwN>{U3YW+x_0oIA{%?!;xXB+wsPHfw zOh!}wa*mbOo3+MCv+CR5AmfG};)PrlWJQfb&0m+B1CZW9*HW@_cyJ5Rv>vvX#BDbZ z-sIN{SI5Ubu#Nz9%ZB2Q$$mD9Op;~f8;4s`^MUa$?a=;PIY@-p%#rsmGWK9Vi_c4Q z^Y9?c(i14ENM>yQV8bxq>Xx%$ttm)#^%{d;KSW($d?tCnJ3&psFu)d0|V;tuo}n!elr#~@2?{`R!IFr}}ou`NNLY;Rft zS5sxb!J{20zSd5xeotWt`6Ws7r3|1XwK!UiSO0!J{Kx%cXjwiq=$9b*G$e@`cQj?; zn|54GLMJ|Os&vk09m?hco{QdLuw)^41_X9RJ4;q`~zM{;zVf6uMLaz_3z^vUD zu}DNUg@J;WYCRGq33z8RpauNe{BfmltTPO^JF;)W_%3yD=63%efjZo8DN4+{>&348 z`t^6aJh_>XLRwVcQc2Fh1UKRbadz^4xu^3+3k)d^?;qqwif`~i(_GwQQ=^ogyN)lE zyu@+>DAb`pdr#8`wV=Iu2JkC^O>S#jL1NPY38(C;;H8*vpx+XA5$C`OUsHA=y;!rQ zSi@F;e^z@fvw1#1BT*mcLjM)&1VExDy$zU_`x%4+mobd=1;?Q8>Y=#PWo4oFU1VRJ z(R#+Qtjk+h`5V(sv!$Dwr%2VqUbld8XO@iaDkoQ*#xDL1vY#d+;uypsSFHVVX02bR z(Ec&LjW0!qwabSI*Pvcks#{M|Ue6J0qY`diue!i8u9KaJTLfU-9ef%5{jZDPWjb9W zXkh$+zWiOy@-_So`Q|+|Wdh$E5jgT!fwWP|V;Y>t;F*;NK?r-rcwR;Vn^Ca!F$_<@r_nvOc@|P7` zmn_o^QeG6S^+^K6UQ_6?eu94Or$Vr8rMY2efl?-D^fcm$WL!bAiIUHaSPVZJ-KxYwhq ztlxuO7qffauKLiw05(O50$}CT@|Wx7?fPM=7|HWbLPq0hL~Y-ZU|cji0q^J<3rals{^+T-J5 zdZW@Oy*pJgae^zrK=p4k~ciXzJgY2WV&83QNV4eyNQG zy}>K8MfGs-pP%$!PVj6%8mAMZh=Er`bKvXJMV*eE$Y z9}Q{EG)J4yMZD|poArBin$$OF`H?Hp_NIsSLr==QHEvQ$>C5j97269Ds3csbdR;BO zeERu4bTqyoNmjQWMvP zGutx_(T1}eMQ_|(z>71~z9DnP4v&DVX+!1lWz>yr7j#arX;U05&^^dg``fn*_BE?t z(;@;0+(^7DX&W$k>_evIciQ5?QfjVKo5&k0k=4uM#`9q>n{X8uK@^aqXR!(bedo$v4rWQQ13<8~){{+H6bG z1;;c~N^@CZh8$j)hB98*HyRt|!lu)(O*ms(>G~88uQ2bF0M*K_8>n!3G_7*FMi8AA z%V#RvvrLO6-K1(4c{v4i^Q&0y?+A@w6A7W z){55h1efrVV9naqTe5!0A=!|cxi@)67yyg!8z8yIS$g&yDms=%3o^zq-|?{Jf@(#n zUark=PINFx;>R0BM(iL`-g8*BsiLr#K$5(f0}Hgv(o@Ea#D<@UA4^ZYPNCA5T&w?ytkF zkFyFRO-iIMW1+>NVK5#(L&UeQ9($|c1(9nA@zDKZ1}Q%=Vx%H(##blj%n(o_o2c#_ zf4f-ME`Hj=emhMJj1K;%s~jdn^IZGW_zSwwve6}$F zr0QpLGh{w8a~**ze3H3w-tm25+duH)O@k+4YgyGS1sv3_Y$@8B$}iehS$%?9=U^ac zJb42dmGG_YCvb?1si((G>oY_yh9S2Z)R1OoMBVC2t)hoHo z*rY)4zaf(2eZ|Ihg=zE^aNC>mX2^U<<}l{6C|XzI&=s256?6pEDH`YP2x3)ah;$^; zzoIqj>_jmcbg((=Zht%1K<^s_psp@1Df)B@LNCqo9i`^wfUI0>qCaHTz@SU*e!~Wm z+C-J3l1TN z&&M;I{7_Rxb#@exQL_+i_0{F8ej47Qfo>p*gspMh-sW;9DdCGW9?(z8<&E1>0PZHR z-dZ`%&z_ukdBYg~%BrFn7ES=mS@tO)cRPYwc4CjGI3#n0$F1%T>022?gT}neiKn(A z+7C@Mv$V@&t=X&Tu86VaxVQ$3aIt`?Q7*6BZl@VNEcBIQ=_?qxc~818 zRgz5`W7>tEkl!LVC(zvIzs-}&vM%IdU^%-m-Bjs46)=D^qC17O*X*mROn#Y`aH5ndrO zMJ`denk7c<;y6ccQ53?3i?6joII*m-KDW-$94lwkK{jy2wQRG;cP~6Hm5YzqHC@?@ zIGigFeDFcJxC0!x9EB?oNC83E3-W-s$pDNGgmx}xUYD04qfze?EludQ`N&K{7s!Kf z9teebewgLm#or1B2?%=tx#sBQ-Mc-!)>jgaoa;yn+Md`zUTly|Mb@@4%;J8Q#=*vD zjk$bg8~{g?gsQms+>!*OM*^ufvJ{%cV;ss7rsvk~1Cv<=JZjc1-hc#fH=*dm@1X#F z_yTpIwQun>3nI?fJ-Ls*+- zHKk&Zw6*jw)gbYRn~I?unmj0+KqiLis5+#-i)|4@26V$X0F!gGv?`#4h4W+2X*mdM zbZ`lFCFC!2s|=IB!BU7@4HY^h61)uAo`Tz$2<@dIU|Y6WX1v=f2pf{!^y4`38m+pf zyV;6UF5_Bbb(k1Kd7~?bzRiZg_i!zUskPM4hOru53>zdX#NHwhNA+_+QhknInz|-_ zl@wiHQf~v)XI<0&_Cb^?T7(j3Ss`tpw1kRcDz7U$@Mwng#E`XaqBcy`$sOuzVa_xP z_B|0EPO?ndM)j=e%5IDj`8a54EPIhT2&UTpZ`zsYp;L~YbWQXO32--{8h(pM7|k7? zX!1?zBhjAK=|`aq<&9Vleb|P^MVN8|BE!PvfUM2I+66tN`}wkXX=VX)LKHCLrzxKC zaFvkPK8v=d`W~;b#q{ux^IG7kuB@2yT39S9BmlXZ_L2?*EL4}%2T=+xN!f(WUjQ%Q zXqLPLvS)lhHM%}+D2yH3gLfItRqk@+&YYs2or|qB6&R%RnZ_(&h6~ekYz8iZ1n>u- z6P=~ZO#e|e=q@iC)q;+^>vyl7=2z=Ypt-!_+pCu^&5c#k0|Q#MIe82(Sy-^nK;EUx z);M3Tw@uD2bx%6cew=4W4jNJLhWY2n&A zTOD08w=xICM*Kq#AC;z`w?)2r76ION?`Cz!wPs$)*s$HccK#Mct`bCqYEow;=#HN_ zSD@;$={}{M$}y}q1zx)d*H$cBhpoJRxMtOMW@f+Rx!J-Ha#n>om2totW0)okbYxCf zw=%t)<8WnwRZK27mWD=ZVQxD>=3dkJUy?w;mU9=q3%YH9FsFe;W1R zIM*uyu(h@En1L^ie3uYpEJ_%eeW}J#Gcj#25z$pGqNMU!y`@lM{rd##Je}0FH;mG( z4F**+2qO-fhMNaZ@PiT@*SO=712T~);fI@CYNjAO*0X5Hh~lHdpo#Q6SUK(>5zpKM zojX%QpB=d7G5{k-4G##tQ z+phSE$-W)Ewi)?W-5o zo=rpCm@(U}>0aO5)C<1(m^LVmgoH&Nvw~;ShYkKA54c%wmox;PlLs2kj1oKn+@abg z&bC7_F=AI%c&bK|!U;qDX=O2X z`J>F~DsaHw*t|%cNB&rQ3Xu=68?j*8R!Wz1LWv%Q~5m z`F6=p@nk`&T3(HqAly^dnYVslzLy<%TnFBk8oe9i1w>AX`^@(#+?tl~d5q#0?(z+4 zyDzQ>VGP=65K6}hX4oc*=(BQlaL!k{GW4$;h%>0fm1HWednW0wtZ48-KhU7;Sa^@! zU|RS&Ub7jOZZ3c$OxhT-yDMbc`PmIZ`hYk>I)`QQ*_aei@HblVLe?nr?+@mDcueAo zY`4^M7g^D;({*jWlzJ~L(B6n=R0!eQi{5_+VkZ&hID(Y0B4A%QUDOw0vZymH-%_`S z;>@zRFv%;>nxI^I^~F;EPv~7v0U|1iC}9TyZf54IK_w$&El`0#N_t( z$>WzmH&d43pLZLU&<2*J)Ye?n0M|i!P1DN;slK~p0uj$Y5=K)6k%Y)2Qel%1_W$j< z^Y>2s>Al;30R<~R7J4V1XT3@ioi1u*`?BGNu(}rtlYuc{3N>er+~ zg|7}Twamv}@EN?wItCSC%x}KLd|JO!iz`t4XR`2CK8LB3#VX~^Qs<+LRf$zJCI^_g zTYU8d!>y16UG=3P;~J8QoxSafRN%Jv(G8Y>lQC?%CgLURl`;*L|D%|yK9+^&k=2fm?!SoM?h6`M*_Vm~L~YFx$tj`c_L)i{uNV41 z*$X^bIKH3S{;&J5V!i#rW6JxIalqA=*?9L*UvX)gjApO^k>YHt&>jIWkQRd^i{z4u zhS&0zC{j|;j&))>Y6J%l3MaJuTm}?~gH=Ru5>MN+REX1`ji&(~eme=iX|;MtjSt7E z4pzNnFsk}qKdO4B(%C|MD+kc_X}g~Y&c5`q3GG5t;&&mINjJEbgDrvYFv24)>g6E2 zq(T0F5+u8>JIq2Q*U>ltQRhE>S5J#KljpUZ+TdJtdLWV$?Zw zY{?i&{NKb)m{ke)e1gOZ8{8!R5NeL2@&Supg^;)jK zbWLqUO^xL?ek@2tyW_%C2_!+184mmHEw{ag=bx|9ZHF}ji91TtByoICkLjK%_&t90 ziLr?{l{8wAb2W=0yRhbdg1}7u^~&`TVJ-mk9d;ekGhLuasi+zWWi0$rXKuN9XI>Ua zqgTG~cRd{?aM=HN>IuviGPQAck7^VqlN;uHqojbh=9-k06ja1BSReL&mI%)wh(#Y)po|lJz6Vzt9A_D(X#R2{D1w#Lx4gAoB#B*q+wD z2TvPzbaZ#HgInK=yBmA>X^HTSp05(w7nd3*JVY zX;qBlya8n{21$_aa5QBYFp_m$DQcy0$n>u`MEF>)Y9$y-1~k|;G@gAzi|$qFxROo+)g5$J_GYN|IdTD zCEvy;PY~wD{L%+5!fsyIAsHT)K`UJRws~!5qM`{H-+5M0Ie)+4KN{w^A2bQS=f?=v zjo{q?)MEf>FEosUmjL(!OmDs3B@AudIe*wER|`;RV8KawKy0DuP(ynqBd_w?KDa7i z;l4pI0?b-qbb0Tb1P0l4R#PA=g9#p z^qTy`0R@Lg?*0Q_I^CoNJM(N4bI^H{ZLk55ue}A^0Q1xJ;1inTy(AE574&-`tb&NP zZ@2xece22iT|PJ1Z?4gHk5&b^sg-l_uVTnDx*y8<>pLFq{RH2E9}M5(kAc3*eMNkn zQ_Q8n5j<7n==T9>GykSubRRwBsrpf%pnAb6qx~M9HnibmR~?81o%<-h4P@-xR{zGN z>cAa!^sAE#vQ&7x-SL#45uF2j-*;~Wj^TlP>F;gU*jdf1t`00Naxa<}5CJ-K55Egc z8|S?6P}2}dw&h<5R97+~%m)mpM;pEo>$wK}ALpf^0#h~pnZSaYlo}e(w+x7HtJApQ!t^C^m zTEQK39s#Q=@4V~*vqv|K| zflAG}=x+dkMZF%qiQqdRk>Kc^5sZ~pZU4Fpv3S9RL^E!< z%;23eqQNTUhfTf5A^^uKu2jH@C~@h(c`6ts(fp1wTQ#CG?`7- z2BB0T)e5DU>#70LL^wk1&FM;lX^DSGxBvK_0Eq}l*Z81>bc`_TI zz1d|P+$oKTX)UJSmR1iokTg(Bq#)jlEem;^QM`k4%F@k6kX#h<6eS9w`{82Yk~ZKFZXXIu$o60~VCzkB+9+TXCK)O1E}U(cqP~tfUFn zgDH&%->^)Gl+Wn)9+ihs1(y$I4@mL1Hn~}1`1C(i?zN3P4wi|oYp<_?vAk?#iae*% z(kSiS%(P+<7+GjTP4+f#zsE}@km=lFOSJOstDzIvJ65krXNr({dGtS9#c1P`jFTuS z5B*~6aI1uAIIFs?GHu_Ve@?In#9wO)g0g_-T`{>~Nb9@bV3L(V;;z%B9m!P_89FsK zF%Br2fh6|2U{YLko-)?2$Uw0=!OE2KFpYf$kAHdT-uC8`>TRK6eVP*~(dVR7P1dv( zkDOx^)k2UZiOQ8}mtEdGBOsid2Su}IbKPW6W#bx++9^L!4vlp@9UxA31o-Pg4D6d7 znZLHh&R?gU`|6D%BisO++xH3-k=%M+eR@!e#sV?9X~h57!R0~>+KTK}IsHSK|tTrd#?2ZlHaoZ2sv+wNuZExHn3X-?E&lF%}NGwkV#tYwU0j%+x+)0ETRv zZ@WHbO{l46W4#ehqgWX>?{ik;woQd*~D*8JXhJ>{%92H0X zu;U4`qkPefs_i1ld6W&I?kS;k?RN9|Frp|1_k{rOYrA{40Jt98_>q*MoVLYgX-1VT zKy077^=#`oItapzBlfkoZ!F8OWQloU1h@RVB5Fhe1DMXd-yQLfF<+cYsOi2{3lGpr z>)NXuVLW=FiB=UE?(jJjjLAmR^sM|v%(lVRmaF=bXLWK$IV#ZJW%b>fKn54$k9)=Mj&g8i1U&^axXjpMI4^tg9^^rp zqv}7F#vn7jN`u5wdR#H>uIc(m_iTGuHCPyus1aAi=FqVYIX6tYoSVlu2A8GM8`zlNUzI z0&VL;18B5V3e~FcG*tz!^|9}^Oky**t$e=4O#}pRuam@GQ@@s~GYbWG5((;!^RucC zUBb#V3O{>ve^(hzsWZW@p~({q^NRZ81kg=;*Tz=gy=&=^7B3i8bW9=Drwsw-fg9SK zCQ7a}LcYM(Rdl*L>4r)bnJG6%!4BOfz2iI~@AfiA02|oJNJj^#tbh;9F-4G~D6f`e zurA{9bDSFtTn#7hlSSZ=8veX7#{^RYP&EB;it7qBOGrjtGM2b3Yeg$IQ>)o@01o?z zhg?`7Zj(EXJgg}S0Dx{XZEC%eZGmQ}GiW6yKYKJU+7?8Lj?GiWdw)jtXS=L0dlJJ5 zrSds=GH-nlPjr{LJbXJ|24N)0*fgv-9}m;M^ZM$xJ48gyxW=l%N#1r;KO%bg-3w6~WGf8@G-=aWw37c+ zbWrc7t5=wS(uz1mHHH$iteiAVSi%8yZ(OHB+l8%Q_`@tQ!1CoB*y z0Y$TCbMvIHrG8UOBW7Kosc|j$Ex;W>f_s|{Qj65S%>vvwOY&QA9tGkCn8EWI$!n5- zpUg1ZHNtPRizyxDb=CC-P?1p^?KFPIW;YA>u=|WxH7TF@GHvoRcME?&PlECo zWo1MS-S$qNi7%X=waZ9sLeb)q{K&s6%V%tz(r`sL_Gyi|0W&xe_-hjT`K*-0UXQEb zHmr*^M6~n_i=+*pf}kKeHH_ISaB{dPEo%sB%Cy{04o*-?DOn?~$;^{iC%LYx{d%ya z*oj*c+G^h}w$T9i{X3mxyD>cNXgI6^lcGi&jiVIj00xNEsaCe4-D;q~Fx6ZK7^KRq z+~yCdVz|~pFRV(~6lAR1^nas9Wzb&PF10E>O*^zWzIh%CW)5HvD+Rkc0q zNmQXAm;nRJ$)TS+#7p>WqE?_JN@uEUsjG@}&JF2+tuwvhwiB??Gx!p3x!RR>KMC#B zwW3=NBmgtu+mYxc9%zqlHRTC?4pNPkND_CV2v)A730XG8-&3{2K-di;xNHh}-T)ZNXk3_SR);ghU zFdhr<9=(1gr0azy>wE!@kLC?>pT(|e&fd{_vymWVuFhf7Ow!hr#!CZ>!J-BQ_Zc?n ziAjEg`_Jv2-oor5o0#?gz2&jJ%}K7aX|7{-YHVl}F>aYbq4Wp5{r3+(atZe3VSg&i zsRFnH&j|<2VZ;V~LzAl@vRrK{)H8CTbD~Qs+e=-fPW^2FjowY}0?{Q>mZ1I3QyX}6v{cl5 znmhHmI}6CU-d<*cXR>M5|4T@>2TUJC6E+)sm$#?IMA(>TUZKxOS|`(J8v5(?-OkAi>1^Rq3I^$97k z6TRd4$Ajz64PqH$&8eU_CGn^rPx7_%Rm1m`^z|l6KrYE1wewv4%4|V!P`cmwW|AhZ-Ea+<|ZbLbYEr|_2 zkZ8&$JBGNDlRE|U_s(s! zwhDU&p6S;q#^qFvrVbr4rtl!TFsZt$qp})M#>dT?2F`Gu)3Bu18lo0-uisIRqdnjs zamvRmyU4#*N{iM=y^mh;-lrXI3c$4VhZ<~~e0Qd>@N0M&-Lx1yb@)soEoF0VJYclE z_Q}eY7d+o7u3ytGU3^rb;y@9}#)zhY3T_@-?(@)Z!oySbk$ZkC6P4|?n~j)tx^#4? z7TeQZ-=HbP3ta^_?{1BcXd0V{#-nIs6YxL3E)oT{`lq&VQ?sP$2RzjNF?p-)6V*WG zs)b=tD@`^1hjD10HY0n_aoGgMv z-)g8H?60lwX|2$_2a&E6HMTj9z*u(?p=QQWFbsnY;L6_LR5=M00{?bd^F(}K;SiT_ zo*(m@$0^_5-6gxQBJQ@$X0?Jk3=d~`^xO#`>OI{Ze_FCaB^5e)bA8;<4q*w6hr~?9 zEyTIj_G$Uy;5e7kgE?@$3}Y$f0}<-F1XjyqOC5bZSuYfkcTg8=vkxk(GI|ukP#crv z1H6l(BC%w`Zrco8^XM&XdEsqLiBh^Z`ZxrZEDQQ;&nrFYH_Y%*@7UBBczQ#QcWth0 zUp-*TxjeH}`8O0`{>G2^oGQmrx7B-66Wh(7g)T7n`|CI~{y z+ed2SdktL?m;h@bk*S2i&yDDqW+P^uA>~2%g0u{PlQE&exK$dM@C2k?;*h(4dwB(k z(61Hc5H$e{uA>R`2+pjisX5D9!+=~M%ZLo5{xt6`moh^Le)G}*5?31)+@;Aosw5FZfSW* z-clwvPl75L2yH`8hVSS{n2GXF6`x?Bq_yc<@S{a(;w@`J*oJd8yfkQ?7bB zNO#2uye^$x(-L8>NOF4k#|%KmBR_^x^7pO^>&qHG}ql=iiYc3E~s;1 zcPP16&&sPE)JY?5Q3oQ_0~gY&SSsdouW^-h)KzqkV>h*~SsVfn$oGq@Z>8hqu~2e6 zods@k6JdL7K0Sns3%A*5U~&ua-_w@8ne_Hz?4l=Wk8oJAc)TiUTyPy|!|0ja(4tWH z22CkJ*BRQwr`BQu+RUO%5Lv(tsR(qLUQUt?Cz0d?srj>Uslsgy9WsnO#@zp%VzSfY zL<;8tdDXOd@v{vjg^1Mn{VR`9IhGU@mn3SMU1yj>%Ao^_He{{^muG4XXs>8@Y@=|VJ}8@e;c&3SG!SjB}$ zWJb|j$wx;yIQN}LmzI~JzZ~V{*tfSySo|*wL$nmd>N~US}HP_(e~%K52-BNOGk+U0E)3_UE96;0tH)c0Ol;_Ik@bGgE*k2+9E(7cMDCqF^l8nnOuB zu0vrQW(d4NUWLPVU57R0Wr4qr?NC2Ab1wQpDfJyI9Ndv#`u_iM;efB3RUiEPy{Q{H zmm(hHr8%G*BN#jEJ^6VBMbEbX%WDA)C-sAEU|KQW`>$ph6-JZxg^sR=d#~|b&Fj)1 zCzYubEZ6G~W6;N|k|qQR-+o+`TQN zFOZFn-YF@DpWV3*F;Ek<(=Hh(W;ar}^?tK0G?ua@tt3!{D9{JtJ7&-Zm*M#I9T&1f zGpW=b%|%}`z6AvV?toCc+so|bh0g1$b=0*GIwG13084jVxXw|pr;qklM@-wJd1g3+ z9*Acc7=5T*>5Zu_NpbfE$d#TdI7{2XYoPL1v@EzzfXW_4H6Wz)iHqM)n)5n7{k!ks zZNe&>xvghY?y7gusNuIiz_1r5r4{D~XND+Bf!K0{*jl?(6Ho5M)*bUrniXgg7}m^` z^1d(6`}@wyD}cV}yS51=<);wp%|~eJ_uf$l#vTw-{9 zHC>-OC{Hn)xaOW1mcYS>pk|ZS+>*jBaU-6+7EkVW2Nfd+el%rhrot`J%Xge+)g=*{ z3#Sc6&9Ikw`9KKziBpOf`=WAa^k)fZrWhBVA)rJ}L9gL`Lpcy+@W_BW8ecWsHcbD< z3?3M)hO&|Wv=@o$qMLW-Q6sygsr1TDi*H$u>Q(7kI%On1l|7jMS88Md`+-2JD(*UM zU1eYn8K=dpX~Q^nv}2lfbYL2`Uv{E8WV%*(p4o~(L|XIUk(N^agP8XAn8t0l%9*xx zL_2oeV!ert?)dxHO=#l1Q<{LH%~;srw4Mx@G@ry262ael zD2;smQ1%Bd>%lj-F%S^0uHk>YKd`yJ$Y^}H6>;0g0DKXkOVPsW`nb8~^|G_|)ls|C zY=$|sXrx7zoH|Byrc|Qhr|R`vYh9fdW}*4kTLPrhUH*rA;FXEC`?Twok@Op8Xs~zu z!8mX)1itEhp!(SZ6-7aZ$A@k-YXvtv5-J|7iFU-V%wm_b+IqYh2F3yPUMel@a+bRL z?#uoSdJ4{DRG{RgdLTGg?IZA5BcY*vM%L1l&GL&R@9fGNhkL_69uVTNKAA!3&9`I< zm}|!^4FbcXjc02w#Q1mscJ6&vlHk+3Z5NHLx zA`fC%OZ-APfcXNLU7ewln(HvvRSvBmh{&35S91D z8e1CEuqSbHjG9iXovfzU(E)IDS<9u~+e8AU4;iG5fa%J5wdmRr(TUZ82VZ!3AAH$9 z&2Wu6awd(*=fB1i%zh&RO?(z*XaH)a*4m9t716~Oq)2rt&>QRje;z>sn+^?O%+rc+kZ@HwnTb&+F9#Yh~l=-qpt|-P7Imv_rwk`k)P;>F=u03IapO6fWW0 zcinFlbjef^=>48C+QwR2{@(vMrgfd{bnWY2No!2h!?7&E5+<`g-VKm(HNS8(d?>a( zJ*}~)L53r}*x{y;;G^p2)%PCYeh^YT+&mI^G+_IlyWvA{+uhLQ2+J!!FBKs5a|*d_ zygsg0czxgeI$U^HUhLiREuR>{$~F{&1C@EwQs-*1&EElFQ*`mVHkcB*`jpBNb>l@1 zA*Ek6#?Mil9fE0 z^9qltR`Zl-9$tSy)H93ZIXGw;DU5eqdImRs3}edi;Z69%kcAG**1{fT_79d zN1^)vbjd*m=PEOnrlzi8_%81rESXGI)UXBsrhiQyWn3!G_WXrFJLo0aMb9#dml*sS z;+Oh*%}e}BERbl`+`ro5r4p`l6z(CNAkL9x&q9O5k;47N3=K?@9FnEV1^|#&@2sy# zE2kW@J8rr$=_;^ZBMi4AN&p`v)xotjJn+DM6#9yS99a}!^2*sik~O5mG7qJ(ryR66 zl@vFR8$|(xSsZ-9kTjYV#2(h6v8Xu6Ql{k}C_{oB+@IGu zP%_C%JIXWtWK@&emGNf*YKtgT8X5Qgg^w=}!wSnT6=?WxQ^S0R2)=xYSfZr%2Tjp; zK5Fw&dFT6c3tOttNlC%-aoMV5IvuBj`s+(Q56N8%Mi4^!v@03K1DG0Og(uyk)yK3i0^CXK23&4#%RW6-fQAUp* z$TNw9LoTq1Mv;t znhb}LoQX=31~!;kw9S^kspo~4-@fO0t?!Z8RW}^xNeE_NmFk^aDaY5yHUTn^;d(4Fd*bJ2It0twFKGGbla2XHdXh90Azw%mT+Tw? z&!fRo6zvul&Buu3YJE?p>-gHf&aXG%Zv``K8}onu2`V$zdK^XXagtdFg4e zit#g1CSTWl`ex4;Vv}xBn+I&~*Ec zS8mGtE-cwh$3Cf3i2H7`25ZT2r`Ljtd`BHeU49UGFFC*IQ~25k`V#+3#2dcigEocD z|AeiXv@LA@9Nus3{^UL22v_Ct$=}~3U%{td>%GVDjPKdP-a`Ar_XXjCQ8t(QhAoi| zDgbmjqgwOVt6B)U`yLr&kf^V7swFO`PaKncmS&&U7W_C^w8G)oo6~QW*L$R|2FPv8 zX-#HvC`2?oRE-KrSS3~WzH7*kGJWErxB4Q7&(Iq*oHTODD3^nfX@czP`nv2IL7KRx zu0F@k`#r7rvZweWExq)jr}Pp+%QGHT?yd3@`8P(>b~n)tz^2@`-)*~r;lrE!HJ*$O zdc>%rC4m-oqfA-N^~r&sX_<9tIc4j-4IMXflVcYc0J1?mrY5V4KHREBp)&RFT~vt7 zp#aLw{w(eJGCBP=ft$dI>}CrXm6WY)*!)%O=3ddnS_Cd?BRo9Z1+$`m!Q%uJ z6m@mO(RJJUlNuVx=C(3|$t{jRObY_dq;>3Ex&z*YJAyZc8|^%^|_kdTH<+UsZU$Dg#ZhpM5R5SF;Dg@+prGwjW+< zR1f=qvekduldK`^Ex1>AuOL%B&ybOs_hM5R{X&hiskujJgK|O$N?ygNi0SnB#!A#yH!Y zToxif3cy-scasXd7GY@m!O$dJH0W@@p~?+4JQ|{8PYopxF&nf8gS5 zu7H5Rh%dHANFrFi{LKbu6=0wMC4^I_h+av}S+H{W!Vw@y9#R67z@gXx@s7sXdHuwM zqGD|=fw@i4M=XqzIJKzK91vApPAhm7K_m#&g*#IF_G*EeKm~`Zc|BwG_UfueT}OA5PI4AnCr3 z5EZ89d0vxz5T-xGO6-LA00uu-=6QoEd^73%N_Cf^p)Z4x=5)^fFvXM_;oaL@leoCV zqN%@An?R9Z(@IJjV~<5rMN}<6JI11<*xDrEN<0;(D25kuIt`6{84NXdRj=%UDl+gT z8kJlnZ_VdQ>JM<+yCODqS69&}5%44)3XjNE_i`o_RmgPJ7jM~>ma#g&>h&-XTB+4M zDB3a>Q*$0-8@H{a{?>>htE;RD6dukSsp_nzaQo)s8ePNZO6Ww+-YTRv9(~3zg)m{9 zX&2+`?`@&D?<1~xTrjjwIPS||a^IYR!imp62RtlP@-{8cpo?6N@kWpJ#lPR;5>;Y3 z#~{${+>9)Fm$2B!c3xl{+12cy6(GoLVS<(Wpvg%d!-???cmEYZk$3N0{g}PUZU5|5 z3;5x8F3CKk#`nf{CrDs^Q0Mjy?`sYf16L<;Nsr?v?%v`uOJK`?6eal%t(1rY?Yb)g|Jw?K zoK-{2Yf7sytn8Q1Yt-5CATIfg_>OnEWshVh^6qt;bJ63Ja#kEC{;HZ@Ohq>|6A+LltDre!k8 zWMh^rrOsBKqE2Np*euS4fRGe*l8h(ZRkms4S6bpL`o?GCLQ{!kyz*2ytVC|jq3k|p zp#{>LFNi2sc}ebx`}Lx?7LM>&t4$(^n;Gs`4din`j&xnOL>WT;ciQ*3pz z6k`^d%w(o%Q_5}D6digMXs1SZ^>9sZG-~b_P&16ikcmX-G&R~g6gL5vc&x7(d5iyb zQNqkSBdD&JZt2h7q%HJ~@I%n`_1*nWeB4H(s5XH16GvO{$%iuU3jS2?>hhN*R~G`O zwAo%GBnLUUYK_u-N>NuQABEa4Ej5Kpm~Ht|SAL^*6V&AG6RXhIXWtiCxD{`;!Bqk2 z{=rO^GnV5$VO8rQk90e!skveX@AF%aj;dl1j5`=V`*$pxR~q^LzB?!DCsXIVeXlD1 zvGHpN$WznBYgvqYw!-+gJMV8Zz`%DT7?43^8Q>hL@HD|6VyRCsq)@>2Gr$pzga@M5 zE=;@b-Gl`mPpl2FKIel2)(z^qH_7p)I|oi}Alm9LH8Nvuty0oxA)%q0K`xj!#H#}e ziCHHXLoO$nFdRx3N?K}S5RCmsn+#4A^g!wehJj!8_34S95Hds;{4#zXHO3mLG~9U5 z#utCkn-PRccqWj5)LkD)ZS2uEIrnVpnSqJz0XnMf?AwQLx1P?O&#xHhzL}?%NLftT z9PvT$3-XG*+*IEL+^)a5ee>7!FKh0d+#9M%0vtfy-mKn z-=5fx=kwuj(IQ6o+e#pK`jCNV zRC3~Rv&)prkEQJ(Ly9@O`=pPyv=J@DKi$fmdLQ?Ok1khqj0?BT2D8XIxKgk_`)wt0 z?~_k|=e@c|)h&BE>tEQtzixiNz(~yq$Zfe^_`ST7HhV3xQpTEf4AIc*$MP}(J10dw z63R*KhDw}4#+7uuWwgbSdzPCq<_X;v2cI@Rv81rf9+^ykwLc7%t!SMt zIraacAK7ad9G^2;2LYOLwVt5jPmZE9%jbphJU=19f2{j3)<~<@Bq{3=Fb*qHL;gZ$ z9=GT>Dy7v~ZEx3=Wo0XAxj6d)NYSj(M*5uIh~Nu@r&p_EcB8F`7fK7hS&%<`_-pzX zhc>}+Szs{*bEnL=&9`386oa$#CiMHbMbJxd%bEG>*)LFhXo7t5RI(Me-1|12zeNHg zJ&iUUj-kZ*C27Mo6P{1~^4}NY-WZDMVqz@dO0W;HGM~3V@mlr!M+LVmhzCvdT1RvgAV*@REvJWgA% z>Q|_T{rAwU&@br#8*T)?cHUVg=Y_jk&*XeYZXWU9IG^}`f2;WPwtrcxItvR7AKv$g zk8K6o*`DaPM$iN;w_6D$VdIx&oi=&r%(sdsn$|T(%B=R}JhrW!vR_mZ)R?hRL{VNl zi$2p$vb{Av(Or6R;VS(4g3Y0`W;!9T?;Vw-G!;tv3hhq3xvFLCAE3Dz~alomy(O8Mb0-h>~e`F77>U-2C|3b`At*IlRN{jAc`MN@?;%? z|CM<+LGR*g6T$j~-(qVU>GlI^8yc_Od!*7L)}adyUYj_*H-22QQm0p-r69|foLh`^ zwN7rsU$?%NT;>!V(`(pYD3pBN{+j3PvQ|TGUXU%bH}=xq>tYcVtR(0kM5sRTx0t$d zH4WGs#AXu39mm1M4YwUjNW{{F^_0rl%Y3bs>1b-n7GOWZV?5y}1Lr4;Kt-NgEL;hS;N zEi`^ETED(rg|Epka4=0@H|Td$twI?`yle)C_xmS$-W59*`G{9!RtL2;9jnc*fg?~@n1;JQwd2JQ}OfO zfOkeB1xSJ<=~h21LBHK*KhU-|Qw$k#_a<3@J$6#x(Cq9!qmi=zH!ITBwTCJ7Q@^2^ zPL$e9m+0Fm-&Wfn{XWid`Fk67kw7hy_>*)AKgB zL*?-35X_}whx!VaMQ2TMLdHVfDT8OfEI2}IoEHcu2OQUG|y5y~Bu zM-}BnFLk_+E*+U??Da+xY9LpSm8Hynus0wE3PMP3H(_7tS+mDJU@kk*m)MUyM(*f5 zeAqj7ndv&#DgW^9B-VB5ok-=~Cy|2VIG2|`{4d{rLgX;xemrftWXiQsk-y!zYCpW6 zwnk@0x;5Eq^$jW|iWtEFVP$T|4;??SpCp-m_130-!>zL3t)n|_oC-`k9a>z1?>1so&k11HDB9AZ7+9@)^^A}B}6g0%X(M!^!u8KwoKEqH zNc&q4P96JJa76%#4nml*Xg)$I8X1qPE)%j83Uhia4J(HkX5l~8i=iB}40a6JM~g#g zgS;^5W>rX_Nj%{i;yU8u@$h%IlSVmf>Z{o^>_lW_3V0p~DRbZ;D>>%ykWWI|oaI|0 zbjR%9%`ah+p3jWhQtgdH3U5X1h#mCnVdC=sCr**4 zyoBlH=ey_!xo;BWe2yS_Z42Af2wCL%fz%pcw5%cJbFlvVamk6jZN;I}_{8OnIeFMq zdz*@bCvizDoK@u87(}cvU276&cB!_3xH-%~nlx|L{s@1dX5J(L*^shKYj4$~mfPgg zD8tp{B+HH&!e0s|q8d|{Ywx}CtmlHO7|gO`w^M)4weqrMXU_Zg+$$q5H2x(2KSq6x z{O_!Dn_3N!(Bx7KV{R$xgX);1|H=DG=UgWICqX`M%5&8wE>HC}FANz7I2NqfTmM~p z<0$r#2lB81%pT|v&EaLozZ$o)D4O!yWaAE*^mT3I`Fy>f^kD-}NJrF>%82%ptkbs| zwRZwA7n3(t$I<((<_@Pkt0;&6UXN!kv^DU);yITI?~g$5H|4qdZ}}sT>H~sL)ERX9 zYJWXsAU~yzP~;*-3uJ{YHQeaCaTN2&6Pej?#P{2(W0LUSfh8X?&fmzIct+F~i!XCW zBHfE>GLOtv31Lxl+yNizLLh%#H*v1YU+l$=?}#~49Jc+|efWO?Vp;-@#bkk^eLS z>NP6juFB!wQ+y ziMGsdxd7&fPx>-p0zW&}So?=_WqrTq5$dvsI~pArOxOZ zciq~j-8=sh41W|zzR`S7yB~eXbylPp=?gFHV<2^%r(i=DF*|IfdX=)d@)q zI+JO2%;ne83JR)Uye%loF91Gw%#|G``u0T#F}fySM}jI~qOR6z63igSA@1Q6f%kDN zX1T*ow9d(WoXVOIJx-n_)gAHSDns2D*Cl@g1Y`(YQFp$r&Di-<3{FANi+IqRi#~8WB1LLSMa$h^QPmi1WAa*#yhj~{8!rK6fk zW~W$M9FJ73FoZ}g4*)}tnNpYz=i`9-zs!{L!EY~ZtVJSmMn$@*r73-)Vljie6o7>Z zByDN|$jPFfz0R*in~fN=x=Sw4!jx!N)dha#RxLJCkZ)=M_!;9fx-KG27Y6A<&@S@tO)6OkRTbFQRfmPGtiTtpYies7ZQt2H6&5)b7S?Feff#^=T5LYN$Zi_! z@nFtvS5qx*#qkF8$*G0^5R&~p*MynRh%O5+dCBbmw^)7Sbu^DZlX~H~%?R*UjUS6| zj4z0vA+I@QUwPNlCEsl(jZ-)lMwY8BZ6Qk@phj}5c4cE5VOsoR9FO+*_AnTl-rd2( zJk;bOIEI%`L06zv@GEo8o)@U5^NKU+@|NDUVk`fBNy{q1X)pZ=ecvhQ)`!idH|6Gh z-FR#)@`cDe8187>jH^f>wHm~bVU^Gn|4<0$o#7K8;AolfcYO*ceVfj6~YDw zkH=1O25G?Oy*Bs!N+rlB`0p!#_v$50=#0B}NxH_2pv@qGCFVH-b6sFq%+eAC5Nzl2 zG!<0_@ag_*0>}|(O|4Cmqx8-kW~+XjWiFN{70zcQjG&foN`K zt=eslqXo`8T6`yGbhoIkvSN+{WIY*}01L=4f6peA8_D%RG#0{< zZz4zZ5+Acu9kxaFWMkPe0~#gs4{~Mx{7COxF@L%G!-0th(m=k?yJn|k%W$1A#^u41ZW1YQ*L#+p=3fC{$i0&}2s55ZJQw({R z_o8`!Bt^#yn9J!amMYIAu36>sxs*H^b9IZukn->|y2aH)Rw&;yc2W6>Qs_5;&a7mi z@(7FLv|G$wua5%evZh;ePO(J3+2>aHf2ry2aAJ8F+=9;6|M!&F$7S2OO|crH;K#O~ zA8!FFyM8kL;_Q;dP9%<~7?rR9C-cYZ*hAXt@nH|4h-~=o-_)4K$E@zD##VnDTGKB5 zpQ$9>CAcZ=1RLQ-7dwGi8=w&<(RJUzd8CT~-}VRa2i5%jKrii$NId0kl%kd_uvuLA;R zs;ngLs@PR&R$6vuN=llv0RzQDNL1Q0&1THZ2%jHM8`4*gj*@_EDx9k!fw|cKa*|&c zgj#uXgkqm|0CtWPoA(r}2zy2jIqARWp8uCd^n&t_<+%U*P4{RG7tNrSWWVpxq{?D( zjC6WN3IMDXL^gf!gys9S51{DB6y|hOf$s;HOU*8$mLI-)2=;-yy;yoA{bmt4)dykc z|I|^)D_qMyyl%XXJ~Z8aU`D3WAZd!Q2$xJ{baR`~$cgJWZn_QNI>$Ba=y*(Ha6hH8 zV;mgA>>OLM4|4=;VyC3wKvQ-Kjts{m1TD}vZj3D7#Hi6E3P}fQftk8TBS>WIoe>78 zqfJt*O_eyu{Fo4ZhAbv}wF3i~j)Rm>4r5PT(E*YaUgHjfuLh3boose3gwe z3P(vq*rkRFA`pdVGc`@erLX}_R&wE|7mJ|?c4tb%4rlbv!X}P#^Te2C^7&J#)9*vy zPopLNfn^<`W%wr$be8LBr(X@b-f3;Z=`lzpNDuNJihMmyvs`~)_wW>8-QZ%|MqRj? z`?!5D#=rtLrbmV8-iId40ET=;laZWXY6{ou)D=ZMp` zQ>vKk^tfrTKRObo<83>&1YJ;&g6Ze;ZQBOZSAo6nP|FNrrvKwJYjZ4!^pEfqw=vT^kGth{(^sS=Zq3>9FMk%aPNO!4osf z0po)@NeJl>!+cx=fVJiU_>iE?(2AW%M0k&X4gr*dw;eVh?zb!+x5JroCh7;$mSe)8 z;{p?N7tmxk_s1NB>S1JrS?Zk8k|OzRZTSZ1b)1N-d^x0^DtVGZtkk>IV3bNugpf+p4uX?8j8*?JuR-$;s+T;Y*K9FHdKAYV*cC zbmMNCaSyHcRSTIbM&eE1{z(5q^XM6k)c4;&kag}NYi7#8mHKEz7-U;E0}fKvM2Pb& z8sMNC11^ikhOSxj+dkVkrdM%+(fgwJJqF_v)1ajNx7Gxw6u{js0!^yn=)yz~u1A== z|7qcTw znp;|4=Qhjt+wM2khrN9qykMXb0GT?W`0m}4cokFYw@fA>YgrBkyAV>Vd{^ArAK%Hy zqn?^YD0#sqjMO{}=f3~w(7l$LDg1k|F}sz*LyRk>^>>scWWo47+khX--S=4TT{?Mp z@B2L@_Mwwrc9B0LKx@%Ry{E2tPip_{BwSeDY&Y1(d{;$8r7jFss`R^-?`03hE>36( z@W9)`YviTV(TpiFP4G_iwBn^dU7J^kEXojDszB%DS%X zl%i_IphkNlq_Y+WjFk7Ro|Ke4vD$iKRZ?;`3e1&KuRicQ>-RjKAaz_`!Vf`RIS>G;0Lb)tNe@%&pcd*0Jc5VO zq;4w}YXlHA0P~$-Cb&8upa57{3!FwSE(%i|Tb(Tk*@!vJwL^VkB>^rCpW=pNhu+ap z5(~ExWPpIFq8`r)s&P{9k)W1B>o{M)Y&RJyvjO&)^@#^1~PG24MA6U%Yx+N*ksQ@tm9!eM7IHR^bOmzy=_mcZ#Eh|6lb3;KDr(g3pw`bR72J%-? zlukfA&JUJG9Vc+Bz#fYZax3&Hble051s@y| zCh7uGrj!IC+{ZpR%7fV0I}Wm*-4ZYi=}c}%M2rWei?S3k5)_&5I43BIe@!A=DL5!T?OGMV1#xg-Gg-=-%?MJ&Uh1+G2nImL*+?KsIj!nhpstvI z=8FZXwTYN3MCyhO4wMSI(#2|#aLG~?!xLK5RqmCppars%n6W?)G`Z}%645ZTs!-Sp z$_rNC-@-V$1p>IfWgDDoj8+Ilr8Oh)xb~wP+?Rn* zmFTF_wzCCWAtX21=!s@*4WJ;n^_c=Jn&XmNh;{9vj=pv_P;-5v(o}uJvXs+V@i10T zzv@{Var^HJYl2E&n!B3#{A+n9&)FMya=>#KQSySJEQB=K+P~|`sMPz=n z-3wRpgf|m zne@+c4YGX=?s(733H+sopPC@?=xAYud2d(1)stv(>dTp}>b30CKMzrbJx%51I+YFkQ{k4&oDO%QC&D65t7~ixk|{6~Cg#Ry z(nGIqaP>3D zdmw#SM^6rdSwLr&BrLnZrc{}$s4P=dgkEJUs*4XSwNNZ( z3suP!rP3`n%cCR4v#kgL{z*29&1|EhOxY>j_KTMKKQ4;L-hOs-?ZCm?kDVtzPFfDc z7LS98#q)zh3d!>(zpf=ch}&}LZk}lNR98WvN)T&K|Fz;$INToZ_*@?kqH?8Q;1}SS zc~fXJ%H<{tq~1)KtNQ|R!S+P&r)UF)&5zlAbkmZE0lGS>230W~dGx3YfpFS8Ax@`% z?eFgaQ$fPW{*f~1yzIA^A$b8Z9bCtJ=yEmDlU)Bv3J7)_*{5F$6r7W1L_76&XA=F< z^I(O3|FOg}wP#y{7+1m!YH)ra2?-1a4PrP1RB)^ZNFndq5(#0KUc8_O0;4=+;dto3 zdv&GU3o>6^!2ZLdv~b2QH-~!l#(m&?^6@zCc!J&Wk zNl|746;;Zi)EQm+r0}*IFb4;*fWj|;?Wk(shCCE}$-^olrr(+CB|!g=*6Guo?ijB0 zx*=g&(By#nP^F?c1PR9mDX_^dp@^TBucd`~5dypO%$VvXaUAdI4}7Jlzeri^3@9pZ z;1e#1#jqlfw8)3iEf(_1W{P|Vms2?=Ec zvsEE;B+$8vE!}7ykYbJJeSJ?=Q6sCy$NREV`-&LV8WizX|H**DnZ00!k|6x1V|g73 zjqpk%HPlRkM0e6$&MbyjoiyeP{f^=!?%*l&v3<>-BqyB^uE(iraASmICoVVHB~e=f za2e}{#E#7wvE2~(8JN4s5K-?zjqLV-;5geFO;|BxE0bL372d@>SW7c+eLIfIq@}e0%wZQ^+@pYz+zT^j0KkvF zv;fRMebO_U*JL;ly)y-E!$K9IMEi^l<(cVTUTOTTEkYIM!fyjz6cnKpQ>(mtU_2W| zJZou*>Q47F+Dq42fjYKyz;@ZvO?gs^|LQLxn>f(%q$seJ1iI7qBLtPkD*=R?LGs<@{7 zuuWlm==52+a-CFg-rmj@^qfZU+yP@=QX8XwUbm~;#NFbyIy#)fG0zEA-IYh-b$3;K z3ZzQ+rI#Q6t2{Zb{1AC?MuFeT^}!k7eJEJ)qnkdH*0oRy3&W5op>G}aXRv9j;4vk~ z)&%G3)G>v#QSxc1MyumNK7d2(h{45z31?&9X%IpCUmY+uf+$Lo7Q3S=J^58&u)n`H zf{Zi7+u+q#sSDN6cYNeS7Y}NZ5oE}6xM2>x?Y1&Pv|zfV^X9u)z{YQ6K@ORDP&z$o z;OfdgZ3pf8G#pl?*f~N~>g_V8iZBjqmpM>mvJ`53VYE7JS>I)U$?W(3n1T2-y>QTG z?wLQm!q}=;DhBxJ6*$T{&mODbJ7)QFR`xl~GZ~k)r91ERTjPA8nj2 z4Cm4tB3Nuj^kW9C#>EzRTe^owjcJlWQ5Zz-t~t2~lsgtdyPx(nw~mv3)gy}Jv^ksj3^YMZqAxII0g-U7NiM4yn8w<+7pa$ zgG!gQXi=^ZAo?;Kfq)A&00i&iA{|;Hg}NaC^)GQK+!X;26=OphxHdUe3NuB(bP?ah z)fFtFgNwkVsmWTnHORlaa@afphwE>9P{VfRb9ny$frOJUFm{2~XNS8W5H3Ou7JQ3E zTQoxoL%2c!4YvnO6+{CNu7Sq34Qt`h9$50^sJlS-km+2{zuEhAFQL zD>m-;@LHSf4)qSNck}H+K)glc(|#vRTHIj-VZ+VU?FuE(!WZR23lc^UMM*0W5Ul;< z28T4xN0Mf_LVSedpb)RU%7f~-fqlaJXPzJ^0qP@+`_6WQc%zHm<24zC6O^8`!WBx0 zm^XG1up@z_xpLMCuXR!}h!?GJKK0oy!lW1h<6WVN@k>j+_84QREn$J~SJFtdN&LaQ*i5vW&7W+n%Fo@MX?gi?gvA`Kf_iAZ+h;y>U{9C~jHH>IL%LdDP?gsB@grvo<+Br?0S3KlAP@m8Ed*H2iO*Tg=gVwoP)rjz(1WE} zHcU;#4Bd8goN>y$-P(4s6M%A^Xy1Zq$yiUC4LKs})8-xbD^;jqXT5|Xhv z|H4^X3!`cO+JyCLnN`(HEi|ukQRChN+OaN z(`UmAr(Q+S{`msz$J^o?9$uqFylyXWOC^)9DiL^oxjVOHblbnbcHAJp$01X=z}Kc1 zB?b4?fh<%bJzSEy0rQ(l&-rt`-H*@rD6{U~`E$p-att>N_lf7;T_g+h&aivD@MxXu zuVO&N1|w^yg2_WJ#bPTfc2%Yy3}Ikj;90!G^N&nGZP+B(Gui;Pk(_pSrO;L?YQnKG zsEgPH_GQ@Sc4P|x$Md|ZqDOOWS92as&z9AqTcJLwldOHdI_D#YYzaw6)P7dNVUi!C zy`)xD;rOFp*#D-I*_Q2FV=s+8))s#vI;MG#=fs_ii5ZFpHZv(^7&gXY6RT!cso;p= zVr>Gqr;&wp(Xrz-OS$l~0knDZKT;x%%CqN5CAj_hh@E230$ZL`9Jva1wl|e?czQq_ z#t9i0Ok!c|$$gCyFb{|z8fM$Ke-H|>oO9Eh!ioKDZm?VeesKL7sdQU(kGM|it9fDC z+8x~L%7%3kY2c?x!kd@WnNu?53oIqpX#uAlTnPo=;U#N1*_au3I3~K~L{moGk=A^7 zifN_BPEzV)GYurdlwls+n$B93;Hujj*Gjo<6%Df!wT@ERD-E-DRn-T5lh{8!^BvNQY zTyB>{=RPb+GlTQ;oL+kcc4n0eicL35BI<8`VY25Wv=kjUWat;oVnlt>L{WopS~b~V z)>z=KbCPSG!2}Kj5Xk{q?R+2$!B9ure>{nggXq4`)j`jJ2s`B4GyfWmD_Q*@GPOqT zDTGU1o!Q*KpQPp6fs4WAwe%0EC%7NiX=b?@!23+y$XE)9f@Ma!Y_4*f2lL!>4~Hj2 ztuUGfZBH+yN1;4h#)a9|1#k>)mM);z#{;hK?jDg}QXElSvgq}4{bZ868`AAQ(jDmm zI^^L7c5{UsM0z0I0Z%VIEEKoj|37FIG$kd%H^Li|maHa#HF!u`n%-NFcLA{H5-@(2 z20B0laaa8d;l{MkdLo$9y37m08a94&w`)uT?Q?Nk??dvmt}Brs&tzB~3CxLDE#tM& zzo-G?tt{iqqdOG>ZX@Bt`C08Q{YCHE43~ zo?UKwS107Y>R{=ZT{7u7%wk8Q$P(|ac*9m>>#Xw*M6LC zP6EYZyt&bC9vpr^tJwU!E19W>@h30a$jSH;v?*E>|8)ziFmwVjR#|!ANx1uTdu9pT z3Mz2cx<5bsg%yhH(2PtHE%ull1hcD0kQ@42P%;gHT3fpZ4X1-?Q4(J$-(%f;&zWz@ zLXJ-kfm4t%J8Y~W3eVDsVY_zt2W9_!(fa*n)P+MX@la4JZI(t3K9DWL|#i_TBL%yZ4x3vsDQI{6Mi zy*5dg6kz73&88L^G8R1ka?`|1r*0UJS7D>CifyhPO|cT^ZFwg z>^@Qlw|d$P=snj$N6&^sPeJl!Nd@v)__-g1UqN)5n424mTOOH!Ff8NtK1DBtK&I2E zPLtY(7E@LF73&4|LZVy4{&2AO9Khs@a;M+rk)i~5Zix98Nx9Sb#LN=h5aP7_U%pRe zz#9H#9$b`LX;`d{P#P|C(<00fB!HsPy6g zD?g1G!lz^s{oAU3ZlWhEY%8!K9LBXK z<CX^?nU$KA;eQGK24WZfka_71N8I zg#WL9Aw9uXhA@HVrq-B#S48Tu0W5+t@i={GiC*?!p=QyqaCgWjJ-UFlzG_Q#pz+f} zRNrEXeIX<&?PF6hBr)^L41^#~4^#*x+v^^004R5D0O0Ek+=ebH*?{$u43u;XK?wu5 zFOF(lca2GkdX_2BGQ2+tXmmF|ccsdWj$uiotv^d`8;IN$j0WNKahd6bpa_7nKRXuS z7A}Sig@EUfFjqktqwrTN{KH3pYkBnd%Ef{tLvXr17HWeD*w7Z4)Xx_#$xkKY6cRn` zaMEM+j_62>2a7s8TL$GSvc{~z&fWo~bGZ}GHZhR?Y2$3B9x<^w8vU|47N$r?5)#0v z6e3HQnlFQSnp~~XsoRJL&qp~3= zr<@s%TR`kU&(7wNd4!pArOwLSv>_&kp5O;|o_f!*e)EK&+YAXMwVSgSxj?kOt&uWW zJIJtm7Idn_(*bF4wNc{GW^U}^RLsYt?kR5VUR(?0$KGtD-HxBoDFbe}&Fe0{AWFz! zSyMSLExngyjFqd`AZd$CKKWbmGZ!ZdW?@||FdJRtl?}JQ^{j;1a``eFQtWAR^TN5Y zeq}v?@B%qckvt}MG1ur7FU5)yAwnM^T8I-)lk%CoL^mEzIFIMU8_r9F=rQ43yBk^& z*PveTz-J^X&U$Wh9Lqf#;~Mu=?PG>qp5*2W1w0lnfyia^7vuN}{!Si~|BA2V0b;FR z>(gfP?atx+9Pg}=lqll)Yl`q}NJ_%tGrdV$;)8sKtIPhC`EQsI?W7_$UlO@GDH*FY;eFxgGSJh#v#R%a9U+=q z20VOldt_++6k({wyq;eyg7eLr`L(9s$Lt{vXo|<1*JXFV=JR##b@qDDXez3I9cu%( zK$HJjB~ug52`NRe;aZ{2g9;7Z@)>NPzN<=26LVc-GUgvR2pw>1f*!4Urj>4on+Q>7 z0wW3tq;-+Bge5MTUpKC{hcwbz^*)+rV5^=)OEV;=DhkB=wR}TJT|lqLhpzj=7G0?z zdPxYf9$hQePB5y?^&}mcQkhF93FCM4*6bpQ)OwI}tICOGxUmZZ;kb*K$ zwWZ5q^~iXDi?5|Lke@hRmJk@G*+EcUSgHHPNbGi~wYgi5>~JzbDUu?b$uk>v0d;vy z9}YOK4EbgGj5EFQZ{~mIg(gD^eYI|S__!aR{kswDP%roVEoG8y_T5Bk)4S>KHRxUH zvOR%fy4pjKlY%_2IK18?k$RwqyNC_TfW=s=&HG!X7$;dFL@-RT46z zCs{s(D^BHCCPvk9Ee&YR@t}f6lVkueJZIKrB!fl?+7?htNQSWeSz$oQUPRA~l8{(5 zFQ<}UoSMeLwjW1pEDiPuRQmwPAQ{j{hjh0Pw4hN|c6MpuGhsVC^Y(_Ldf3h|b3Nm8 z%qmBm78Vmj0zhmS3}27O>EpQiI2>M2q|rbi5I&j|qlG!*VitUMNC1SM4?x>XKqVkx zJ9Z?mx*}z3O;J8#AL!$D&~^~`BjiM5>e#XcxrlMqa$sz;B5{j2VauL>;+6s9GKdAa z%K++}Htb^99$DeW!j4rP$!>FjZD~GZ!%GJHK-le|L;d}W`@3uAZJ(dqxXMj0H63y{ zyXTqm+|BL)XLZ_{P1!{acZ(XbaZJNS*@i89ckJA zp|bF{ivn1CX1Ui_0fBjlP_+I^qx|}y<7+$^CfPm->8p^hLC+}fF9$>9+XpKk>jA&n z21+E>NIX81#0(U|GsK@b0Zo{C?ZB>t+m8 zLmTjdW|Bfnuz}7%XM?bk0F~w%=@65=AnkJW=&b8253Yx1F5d6+?ktQN@dOW%uhL=m zKt*)3$W zUi0Fv>RRx;d3{;ihHCAQYxBTsTG>Xgd_FwY+PSDXb<38-eAxVgl0#3P(!uhF_b)61 zDWfW=4=)&0hGzRYv&GY=0VLB;2C{!((x*)W@ebMacX?)}a~PB}0rvD9L=DfF4*@;5 zzFYz8@8Tq<`6efwI8F4N1ZM%o7G5qjOBdBQu9%$m*lvFQMm7lj)pKZcthsL4qUsJh zipuywXZ&>9&w7?cT5l;6kMd{LWh?^DO_RxT?#CN0f9ibK80PW!Kf<@W% zVMDn#Z2WtTZrsqz1;lFj>+|&KgG0wpgbWGYu~S&|iQ~b8f$bag)rhc5Dij*&0l}i& zl#UCWtqBlt5+pSh8ViRcK=O4+JOq*iZPge!Gyx7@@mIJuebV(siMt2b6NQjRUvO|b zIg$UV#_B@6^cbw=!}WjK-F6^gQ?SxpmkJoH3R+wUFNGhk069+|0Ih-)7i}@XT2+J_ zJPqLr&qFQ8z$ea5-QR!u%o?(Iu|H(b$a?eJwplN9)N)3mdQMno&W(;IPazCy145w= zJpKSHa)s(1xEMJ;tb-1I2swUc3R#^l^1~(ajr_oDDP5VILrgE07v@NsYpDQk_)I^t zwrIntp8oG8Sz9FHC=WQ=(Yj^fS=V99{r;#_G{kMT$27=^6LaCVXA7Y4_{A~L$D`l- zrluo;;(-+=i-F)qmtkyk(dM($X8=2lcS=M~lnXAZefz{kuZxUt3Y69!;))8o!b#_OGriS-v( z$%;CF5CqxfmN-RflzqevS2rA4ztwkf`5JwAqBV2snq}SA$YJ$54ReH#C8Om^3mGW7 z8@8eIOMM6KX2+Mh&ah_Pya^>FZEpNXfo*yFr#$KZtXxn?%bp(Gm!?J<@}8bh=PNni zAMVnw|4QjdVS!Ak2DusV+-1tf=JI2R)Y4FD>nLxQr|kfBAv=LUD~+Hv4+>>t;$2UX zCh^*y4#LuU>jGO2${?H7$F0Bn5B%$FaT|Uye$1X$reB|X>tSr%&WALX*~OF#+6Om` ztO6KXD~dHwOabK2spRS$Y$NhMHJEq9QdLYnuLFA3Zkb$*o0Sh9*0%i{yNPGh;EqXjYz(Q;O4=&5Gr!xqqsOq3_U`O(WNJr3oY>(>RexgbWW4!W*E0G$zMCy zFfNPsMYPqkT0CR}wAMP$ZIOsIrml=_LRDu2rZ4GYx~7tDlfJ9+!!Pxp@Z_T-`q64# zMPC|j58tQ6D?1US5794$c=?omZeIFu)*sQ7x-BCgGBQR#G)Lsf@O^8u5MS;q>6MzB zmfwz99#Dm*ZCwB*_NhHuKdIyj?hnr{pmq)G4{*Cr;NsB%0f1{eBhdW8^G`zB#Og`R zG1B50kEpd?>s;8_uu;^Fmetn*}B%sQ9l&buCqY83ipS)4;rzzrE z?}PXnQ4!$5Y3?58#PPJUbm;WF=742QG;r+?tO!40r4_oL4&kh{zq4Osy3K_TU{z#qMRxi?ANzrDx6 zNVzu(49rJ}Xrycw=x-kq7myu*K`Zh*o2$Y#HEOlGYQzoZQV#cW8wsyct0QWv!^1+y z@@Ij-Nk?BBUiYxrUyoa2#$)5+=Fg9g4qpKF-9BynBtK3Sr;FB24F1mXY1@6l>%yXQ zkf(96b(fMs*S-podaLnbCKiVi<2~tE9F|T8+~V9VAXhUXv5!FLOC->a?d|0fBRouA ziGALL`a&;H{#YojmIEae)_DIpOqZV5}mS$GmC>X&=G-?pGoTfXuBcP=&ttG6@TQTxt)y=ie7 z8g=vy3iJEz>>W>woz#xT8U$+F@6iK&TZ+Og{o@km93Ks!tonVNK7ab3qXiw#9>D3_ zUNH6{s-Qi(5A+=r-P=(x`g-~}%aAXbB@y8&%r)^R6?wC)w3EtRyMCHSlbXpxZB ze1|1_S_!py1kQTywM5)w`eZ`QxX!BU^r+!gvx%C>-;o&7Z2Ag29t2fcpWgD05c*sa_2@yvzqcNu}N5kVh9l?hxTnP0EVC_snbLv;9 z(0}MGK&hRr0D&N1F{OX7l7w%7b8CA3HXENWFvNCV65H)uKF`KAUvS@LMY>yexg+GpUkoA8Fu7Lur5;}PMyoJ!f|8u9k@8C7YArdq9j zRP6ckz#91>h)`?|Gh z`UdkgG`J`vIHaUFC`e`3w}V0IWw%MU<|q9VN3V^}o^$T> zr*)zPu~?iGFA@gqJ#N8*H-oX3<7)#%aUw~QSS(7|x9{{>;5w+a0|-s;mOb9ydrG|J z*G|0Vhv-pO@8Uf~@5y3soNXeDv8V{{-Li(@y}QNRHg69-EN&&DOWip3F?1S&-%Y0}B8( z!yaQAj^tQP_|9}F2z-+VuA|1Rkj&d>7AffnOvn{)_24FCr1~nmg{LvQRgT|;RibXiNi=a=S-Y&!q8&SyZbf$`Tlvtz}p`2Qh+n;v`^pu^yI8I z)u^Kn^+oMabUOAh+2m616+zyZLn?@a7l(trU*HqQv z1=ECViru$lENS)~fK%?gl><9$TD*U@N3hB5CUqr!4QrB>bQs{YIk(3iSR~BO?FGQ? zM$DH-4`;FLR;`UDw}x3b5tq$1O5 z0M2US+JyBMaYe?UXP=C5*|zV4 zr^FpIWsd&1T;n6BZq6ObgA9GCObt%)sFc8X?8#>X~1+%HF88Cl*lY+O9f zgzdY^*$K-@a)Fdo5mTdB^B0<~&=>00c=XnJ6QX1gLbNB~y=z9w8`=S<)tVgGY9wKx zFQWu$f#eU>K#w7#8jpcmSFBwC{TE5N)H|yKSq+{T+TtCF)HW^y^8F{LL9e(G*7r3O zxTk^JhsKzLgWN@<&ZzNGjFXFTj*mt;Cq@UkkW$(?qk8&a+dry4pA3C%(~aueB{V>4 zwb77xaM6DMll1e%X<=<=3C}X(L!qMp(`#dF1G{Hc$Wv|aP;Dyo$f#3yOP9zgemCn^ zzVgMgY3J~SwAj#DfM5CKjH9>9Zl!5`V z*R}uywJM0-N`u9bH|YScdZ067@lYu0o1;+CKRcuPdly?V6Yt73i#+F%X zr8|A(37l|gg1>x}ATc?Y17ohTePsftKsL~T`>cq&pg%A+gf|B8%z^{^2Lr7UaSN04 zLSlIUPL3BGo0l?_2U~D{PlZcbX?kg@OX{A=^V2H!q#@EuQdfeoWLi32>6%)ahSW8! zK|Oz{Vs8SHP=F%XPw8dl&nV;-MvJ2hcm*>6Iyy=ikPuR6^@l@Yz0VPH=x>kEkuME2 z2s9DlnZVDn)m3XnYq~)flBGgMmcO1R= zo5R%zbjV2$a@FAU56E!iuLXSHD2PB|Y2BO?5{-6AUR~xUhuQ?w-)s%q|8=g-*T zUYfjjU|RrGo=t|{1%u&9`Pk@mV=!0eh87qGZ-#C_uU}j zgYgL2vt(957=o+IIPYrdv2;V>1o(CgGtxO-5sii)_7X*gx@h&ZykC9=_ift+gP!I& zUKtJT`rMBGFLKJgVI>zfIoZo71wn8%W5wE{+~u;RPeLmM3j%+t1?x+UzG`?CvdlU{9N0ujm|b&jwbv#U`7 z^KoQ@Kf{7~6BQHX!AL7N1^cd`F3h!)UcHo+uL&(Wu-1mzyTR0YYwoUiD6J-0Irvcl zFv=ITxirb=mCh@XjSLdpM5eK?l8Z1-dp%4cmbrM=8zjT)mdbrkx6o*2T#~eaRULiUIM^oEqiI%&3e|vG>f& z{4A%~6Iy&>gB`Q~fT``(+|vm#R$aPk5Et>-7*^cw(yUlezMxb-y1?64Y?}SQQNdQ> zHW8P3Dy{`EScDee#qM8k-(YH8ar%sqea?5I{LP}H12~}T`PNh0P=djLbW3_ga|JWf zn@$P~JRec{$IfW%sr%P^{;Rl^3RAY!1g~f5XIV8>eJ)*r%W9WZD;Mkw7Rjs=$imS5 z>Ju_P``7+XAkq$$Z!D)6xd%_c6Mt`u#4K_v3fUKNV!Z;mFlsTrj0GvM1r6~QOLJ@` z%Z4Du73$o%VLB1dUndMBug8`KehF4iF6IL+n%i&BbK}-$2M*#ivxL%4m$3^g7COBJ z+|L6`mP@!STsmj@*`5bCIQAC`Ip+N^rjn!cc?^*Li~E24M-l%&o zgO<#T%Zf4T^J3#O^XkhAn_G)~i*lKZ`+9HB`MxS{gEuMWl}#`YE!@9l+b;e{(=*VH z&)u9$yDN{*h37p(gsRS|E8c8(Vvpau*7f_ETgfm&yMsLS7Y9^V>$A+qbl&23@lLU=*QuHb76nSdi05vDq) zE|=*zc3qQGoP~ossz>feA;NYkpKBUxt1d&%vE9diZ%i;l)EF^u44V{7QrMXb5qY7%>1}DxX#;%IPut* zlN1GXJ|u}7niY<)`hz#oA)q84F%Il94#oIPBtqKnnR?|Q`Q0RD7L%pU2H3mPyoCD+ zk$p>HR_V^R;2Ds}ZTyIib{_JteY5h4s=$7nn6xEe$vNs0s40uU=3w4E%}Ca|Gxu0MKRQ}{4*9mLRh8v6$i=Wn?Rj#(Id89cw@Xh2YiAs=0P z0=zNnQu1=0%U5vWdLkB`6Jx7Co1wc}z84E#4W4#20zbX}GTBR0vO4?<%<_qm0`0yB z?^Hy<@^|OYCCE`&#yFT1De+j-sOw?jw!n?k=8JF}o7E${4KBuJz-Nv%Fbx>B2k=im(0O#q zKDZ_IPqwDjGx)8l_l}$0jVqCn$Lf9Oy~tISm!BywKV4ZKn73;o<48O)($d#wncZt) zX+!6<0Y4Dbo1g7VXf#LG=Rq3n<_miVjq0fUJamE~H7Pax__XZYY=EFs;IMOLejcI< zFYThZr~?kKZ7^$^lsCKabIv#NicasFeT@@&2R6coMx#;_bx5No=GC?GgSD@!(C(AH z;x}^bxUx_NF-g-*y|D3%qsekKP5$uON6ibWMN!$$wbI_~>yBkHd?{!|2OVBLKKBlm z;n1G_QW15q;fhe-(6!^`>?tri?#rT9{=59FGvQ>^&qB|c!1|ASpyzWn?27+FY@jO& z?(2L1-rofQH>a<6`p5s>U7a6%2R>FUmMy(Q^trQCw)LD3@m%e7swGZbC%wJwHu^ki zh3u%_G2wG=>z#ZbBGz|QOKC!*%`={K-eB2n={X=KK{zIys&|d;Y8l0+34p~s;NN-h z7UQq2v?B$hUDxR!ob+(F`+{(<%d~B6mnsh_3SNdTJwIE0H3~qQ{-x~mr%31h8{=@_ z{ich-VA1Wv3T~F_fk?!6<-YqTr_01gN7T;&*{E%>Z z6Q}O~`|sKD^tfN|v1gqf78t;%jvgNe)R~|0UzbzqV+b0JG)AK=cSH91g5cL_U>XPp zf)D+tMKWF4Y*G;1|IH`K0mDU8DL0v#3A0N}quKg`{vSn|MNYUgH<0nL<8@cV)Q#b4rt_mR!s%dS3i4>Niu z8CCUzPtXzP|GJf4-|pb+VJB=z{NB5J?&59869$-rU*8UUMQQL4{!rg}}Vc zB|P=6e1Ut3^QqkU9cn#{4!PuU(Zl~J@}0ZZpJfDI$K>@%($ai2yx);qK$qU{7(|x! zN}BUt|0SR^N&q5ykKQje1ihwQcbLqGknEv@G_aVZKH@Kg2%{R*i1O8(+3U@MRf6)+ zBEtr@TqH;aWkaH|BK#pnEbau|?(l>@19dvk4MU!gA&;?Np+-ocrOGeE$A-<}keACo zh+y@wp%QdBmP+2qt#H600jcdi#P$UQp9SqipY{;I0!}}-8D|6?3JUFQ{Wsm8=1HN> z{-xA2T->cNo4OR{Ox&en_~l}p0Edj+|LfB!1YaqgXd@t*f|cAlcHNQe59C+%oI1eI zGhisZk#C&u7udETTyTk6k}1d#tP2hA?+=bD6}3v|-AR#cl7-TrnNDS?b8hDr0XZWP zIoak@0QsDsByczd{sN~!;7AfW9ee@b$zQ#2I;;;kb89~B;^F~%uc#52;^8g^jY4X7 zw%ZX~fZMM&_~7 zKZAQ@rXoBfEK}(o>1U{N-`OfHm)}f_OPWFKV3}FOj>YD*I7U?&77||Xg|ThYGQD{b zvGeZFlxx?u<7$ydX_XFp1rGiy8Nj4NP~L3AELe;_x~ni-6`UOaP`F0$GIsT0a`~NR{xBVAU6w5ORj66dO*a>bEA}xb>Kg|v0U`>a|`icC;dmLPg1n=rOy zFJy)UL>d)GiK7(?Nwg@+cXU{~4?1&pd09s?*DL(UR|+G#gXTkwrxLll#s}17DhwjAo4h&QDDf68T}8n!8;z# zUj7hGr3<&1@*&EIU9q`01U;&#_tsY2bOt zdS3eW!}K|?B1|#!e60>pG6+-#Dq0Sj3$qjzY^6sDn#OJdpvap|0(w+Pqb{;&4r~Po zD1yq8K@O0w6&K|!^^m3K{0WYmm>_Mu_B%|2|m4=r@em=OtZ z&UrBA8Y;Xq0nUtfL09!`;6wqZe z+!=7@U3GMf#l1qlDsd-ViA1W4)tZMH0BP@z^PxuM>6`}S?i@fi__;$ln^b=MOW?6D zUQwgxltp-0d6uOcFp~jb1{cHT&x&r9PZ6P5_o@NRkLiIF;=~a4?bjAxQttp7?Qf3H z#11`4L+bw6d69&tQD?S)x8Jd15k@xeu2*^hF|@=%84DBNd*0ipFM9A0KB(iQ-8Mv6 z-C!c`zCCaDnfNIbcGt~;{en<;L|56uOQ$jJs9&E4O}7EVZLCZ`^|GA_U)S*m`P&US zS~ju%W#to%z@{YTfddy)(@?0i)QkHMG7s+W?Gy(hu-A{EV#C&G zJS(DT)uID#@M;^5w02yFzTXl$G^AA@m`@_jpVa-lTl&d0b|2NQkumqt(VePDAHCdf z=>AXqzEtHvgr@S%654Vfr5|5Q!r40E$b;3wD4J*a8f{oCI$V;aPq}d5Ae(mJf+f2m z5Ky{v?wpY;y9~Ys%hA&fdhc)~3{vnQw(mvlB5Q6WPKdGAwoobGktIFoe&kxNu#l@my<4kNc+ZY#z zj*Bw_EecF%Hr^|{_P4jVXjWN%GAog3GDlh%35>+NB1R%T)@nBxli5kEf}B(`O0-*) z%Sh7vZ_je_b9nhRb-Y4OR(xWVvrtgzUsF@$A2EoFjgIy&;N>+|0m^hm$K>-b&T8xO z{ePn_V=}HTQ28R~JGS&O+d_?7`2Mp;;kkgMOSSoD_@X+>Tx^ADR-BpiSl^x2&*cz8I0#J>JCWiaAp^q!D~ zlpj&PsQn6hBHur;py|K7GdR>TkBT3A){8;m=_a@Z${6$5qtRe^v z)PA&US_?u2@yGJh*~zTPNUN2($CFF*S*aYnRI_D|y|6Hi2%JO$^t7;)a>|IeMVZWL zoD_DEwZ24<&re8*ixm|47q-;;mvD2El4IhE{fh${>PiFhz!Cr1{KAGtK8=oL(7wX} zF_$Q-#H(!;^UD#p;M}X7sPu&DsxXZ;yDrRBGw-ZYHjO?_raW6S&lFZ?&DMlfB~+(( zx^QpZ!j-#LjN8PkfQKGY&u3^eQ$qaVMG=co;6!GZ>9-G^8ySUmk9Izv5i=U&4~2^y ziZ`;mjGwN(dfN|;nzfu6#{~5D!q@n_{x*--U@*i;FZ8i~FQpJTDHM-iTW*G?hEGr& zN4CG!$%n!a6>1p5ReLRoF6>-`a%}}!;Gf`FY=DIV1{e5X%0=}ukK^O$kg}ItGYX{j zw!HNW5z)wjkW`m8@^Tgaa8N5F`XMVdye0YDPb8{19zkrMeC@ba73&DH+xRZ%j}oZo zdj&fs)37X-SA%ggD|tDch-Jlz!#qF8ZUmUOixYON9S`*=Ea0<~>`ALY8NSKMyYlJC zlgzt~t`N^Qn1)wl-Rgn>x*r4M=jLyQ!l{DDQajWY;X#~CzIJl6R8)-N>5PdzO6@MsBW($!yqk;z2&zW6_~>A&LSM$r&3%v51QJ;g zYKn0y|+u+THP8O-G(_RmEA(Yp!0lv$Dt69+r^lT8#E$U z;`Qr#n-2N9J65krOOqCFx_f0TI=}DKDpzDfBGNU)Ue|Zy>5_AU2f{zBbsFnT zq1*KvKCU7tppm$UKm{RNlN4;)TPKs-;snMGo>4k!2%K7 ziG_W;T;bWr#5h9e;X@%l4DoR|)YTsRBE8Ygt+B0jxQ&CGS1k9q4Tbv7n@57dP{)u( z*KcsTiZp(ehkV^{7Rr{xJ>C1zwAL_xgomL4>9X_GzI~exw3pdKT#<=B@4D(~^*rkS z`VBCVYxni*AgA+-kmV70W#X;t3VZR&O=stN&t22h5EkhZnGxT#dY<>ZGn~7VwCTky{#!2!FF7i)n95G>0B;k9H=_jYzT=mMIA zlKHM4Cu7E`ry|r5dw%0K2lO*oCyW3*qQOD$wNDn`E=<R_utO_ zgVs@oKt6v?@6M@M|C=|dNif~qT03uYk_l)q{-hGm+~~domkxO{AKdtS1=GE=Yvdil ze?H{{<%o_aO4sJj)@KQ+&U945y`SUl%%IMQVrzJ4qS*jyba1L3fLlYam9jdtiZQs>D5~bd3h_o{00Dzj&dbh+ z%ZCbp1&Ud^^t3cIk(Meb3+d^WC&neE_r4{1NTe(nH5m~%fy86Oj^fUR^o4*T3e{e< zi%*Ci0cds~<#}CvoY5Whaah~|5x$cqF`5u%N{H7zX~kOw6`o|*A|c5!xJZst$&4b# zkVFZT_}dn|W~kt{4rc-;e~F=!l7ovR#~`(0NhdAk4ADtW-2^fzniw5FGUdPmPR8l5 zV&D<^VTC_Z-~#mW0Xf{hPgw_KQtaz|vaY<7Z)&ru)yhj&_bHjq1a#+<6%|pqTkQj# zefWsHgU3D1?ox-+bVEB2xwH{RE;z_zNx?-63qZh@6%wWfhyA!RhqA9Gb%bf4fc2v; zr1_fnf2$jBP+Xs4F?XM9Kik5@JmEsU&8hBjW!e%l`Sg2p|NcL(ka`rVK0Eu}rq1TO z9Y^{or(=RXwfXzg$&h9y*FDuaZ&6$aF_?SLw4cAj#6IRiy}4oaIr&;{ZBrWkcxU#_ zEIbHgAtfuP9xv8!W_$hn-QV;bv~Gww#=A9RBHqu~4AV1r2^TTLqQXKZU0sWWyTaFT zM2p_af){^RcEu#gheE3JmNAVTL2tF8 z;Wf2?^7C>gf%mR6;lYRbuG8>TN#IY2Ttp>sg5Ld5YSz7(rsuMJUPKqZAMXOfLc?l% z-vL2};Fash*SU+17ICs@#~+GIR=uEQGIZ6x=zN631$92PcVNs((A&=u;US^5buZrO z5{KcazzuwdajqQ!(w%I{@p*d% z^4|T8=rDRtYvys=37x0>1Ju+Hdh4D}Pt%|GzfHWiH~BZIAz`(3z9m@(z@NXaI77!1 z#`AgUCceJ8VbgFli4qPkp_&Bs^#lekQ?V4P_OGaSq#68;v3#Mh6%rP~`%{L7D6DT| zLNtMdce0|0%d4d|G2+W|Ogb`hVi}8;os*1{@d=Gsb(`eS`jR8Q2`!E3AT_3d#zs>{ zLFL9sWOqo>MrR3rG)~Y4tx(VdURj;uver|r&Fw8Ou|0p(W7IJ6tE}cRclZ7b4|n|o zEOQocG9XTRF%(ckZ?XKiR+~PpoXd;muv0Z$O|2zG&sM|=SR8Gtj$d6t9#d8A zVzPAUS%3wjE*;^qK`vLsA_TD~wYKZX#|82t@j^ICZE|0>YLLY`&@sxIlvi}0>27ZS z2oSr9#=OTAvUScAJ|{?!h}>p~YrCS8u8JfGeez&V`=qzWl57f?oDNO_PP&`w^^Lw1 zjc@x?Ishgcn!fr%2J)P@{G#b=(*U+@1Fvs2vx{^ix$y*8gwv2qkRYH=NKEXR(_!^) zjM%)hR)CC-)NZ5K@JoWpYYMzTdmI3Yutn!?-^shy)FOQ?xUgVK**C+$Ff{Keub<)6 z-z1-H<+6nS786mE^hX!l3jk}i_)$(wy*F+YjFcsL?A90WS>xM){nw|;1Vj|o|d;a7IGj+e^@VXo6<6?Xc{iIxtP zCZ>baj3&_{4)3nfW_S?p9m98~W)e=gDcn%&T8j^7E?Shidru0v>XNy*xQ9)*Fl(2> zVCWU+qzw>4Q}e*d{`UBm!@7f9e#V1!ySw)H?BB}DCfx0A-rcf$YbRT%zIB+eyYw3- zv1!n0(^ArQrD+;eiGXn#3dETJWCEOwpXHC&nq$aKq|N30htr`emgFRhQC+RbN%`iv zPV9#W5#~y(IAJqRggpi^s~nZm_JXFleIflW@&;>IVN(7kr$`(Dn8O?P*-ePd@a<&NZv+>hA`8! zEujAHRuY~Qq>0^oC-2VQSWQrPUXk1BVOf28pd#;^{bGS9bnfssK~MQcGcQ05gSjHg zV#M>r7|)3DSVW!CU)QLyxaR? zH9_j!Vvn5M68hd0xvEgAbLczTzzKzFM7d@>0*4XLGXR_`3g9;G^KCf2Y-y6XFRnNj zXsKkLJzAVpfyGv|a5ma4bGTb^SXPiGX7BBs+k0a)LE$-t1uB}RQsn+o`8^-jBghUI zp{=V3*Rp8QxEh0%^u>xx5w33GLL>KpOex<3OZ{H?R8^2HD-Q2oR1zqX1cJ86y*8#5 zv$p`nMl!Fk!Ne7^V?_NCo*4Cbw5ZG#(S4%;6K}&aT2OJKxKH043t+tx8t1#Gxac`H z!97AM$v=fS%jR$5Gopig?-dG#iPPj(XVL+kW>}{=kQ663CDtp2g@u|yZoH0d^LQGmpJ#tM zhw+l6U}5+GJ66xN`Oiur`U}02-&p-k{6xeY^Z|fV>Q0Dy^GYeOx5v~oH&FZPO}Ojp z0|~xQA2Zly+4;ZEp^9`NY2JT(irWorZj7S*+AAi#Iae9!NH}j$o2(l3rC5g|(wwWu zyxJOA$&1yqDn&SG8j+_HQG5Qok-EZ$dVGUB;lRH;$qD2qookzw=axwr$4~Qt;zSij z4kubs@jwP%VNoyW)gvl?A;F=vjL2YeOjXH`)v?;ep8uqUg>(m^%>CWYUyeSUZPo`A zEL9O}t6hb@Zkck7?@ITG9ygL~d6b`iG~}S4K5CncqrDbJ_B+k{BjVBg`25cbyPjglYO~kIl%xC|WGJFbnbD00KQK zdx7M}hx>HcWvYbIh@D56&%T@yf3kw2j)09P6R+%wmWr#h=qM6gB6fWtUlbeXEp?u{ zBK_P|B!iPsap6z6qVCJY6zgXR(bwmSE2nhw`We2Sk$$$yh?h@@3sz=HYs+OKS1^!z z$Hgv^zi<^x;BiXNsuoM5cU?(5xiM^{?(bWC4_iKlJTVwA8*UA59hSupPLMJA9=6z6 z1#b7S+0dwqu`>=X^dm1^U`V&Lh`~6p!$!k}XkB2L%3SRMBDv)W+%;>dp{4j*ownMEcIWD@#+8`m*$A_=DtS<26n*B#7}DI_&+0%soT(x{^431ge$~Axb$Wck66RDPE$dE?_VYJ0D-fkY1bsb`&K^=l!q{nR7!!AoapIqG*yDw&V5gMpQ#lub?#e&f6a`UX@ zWN8q*-)3grUD4_Oj%Ea>W$^MxZp6=Bl#V&ryr?>OGJfYV)cnlG{JO&q`?;DCc8{_8 zCrsOGPrp?z!bcRWHG0H}rQA3(J4F%Qn>;1QyE!;E9kkY8ILH^D;1AgRTt?VHUy`=E z<6QYcMU8b!X-euEO$Dh4Vt4#j;2-g&ZGNG>x!{K^Ps|JY0lDe)6!A8V|675HX})2O z!a$x7*(sp_-|db?a)XK*YnRcK);2n!X$T^BfbRh<%hve3-r6}O{Cv4aZl}#%7ZVg-iTj-<%LH5KO4xYB|Bk z3{)|qeyohkW7NUw>G3Ts@d*tpZHcp_o?|>O4#f{Rz$wk{)Q6s=23PL?}%y`k1KS`eIg% zxiW1kRu~Ai^^G;k69(Sv3)e;Ze!I+UvH0Lqo_W+SFUj?4X&HWM14s!IMe6H8E!61K zl9OeQT_34Ly14O*(`1RFryWO*TNvXi~YNfPZWw5;aOVW8k5_NLQrKgJl-; z#mPUUaYZ$tDfeIG=SWXcP}R9buzO@|k=>*+9*?X=tOC}^5L+eeR7&mtWG7ui^TLsx z_ob&=*r*jT|NlMZ>RPM13jlkbC*JZxl-H4V`XE&6eMfz-K2Q4RspM~cUjE?#hx}J2 z&yt|TB=M=jbHJg&$3x2Lu%Y1p=U!5(7t8@OW0%|eqhQL_1Tn$wgyZZ}eH|wzR2r(M zIX~Rq{bi~k5r!~9TwY7VL@38PH#i!GOg0^wd_XEwmV*Z|9?Kb=B_Z8rekYSEqTbY~ zx(>{;V{XD49Cvs+^ygd856u}mX}NKc>GrvJ$XfiH#1vRH3`37a zysKLyb{TTsughBI%pDf9SyEf zLz&2xg1W=0>t(=r7^7&@wTs-_8PV=JpjK_7rWKt1Wuh6|Np=1gNnbV_+^R{`wt{l> zzJS!cV>G{D3_&sT$G)9-`cz5t>?zzYsiNlMRhhEVOambxE5=MPy@@x!{t_jK?tL9f zoSFn-f^at2F+e55SthcV5*^F8JWY7IWw|3U1BDw2H)bogqfki(>Ly@|4WpS7D6VRb zUCnm&D==9xRB8;d9h_Hlg!WVdouZ8Y)|PPQn<|M$ljAZIX`KQJs8^vT7(8-k-cY=P zN>~0WEu_+nh)MIC`!J#~p6bF5cjzzULP=QfmZj6JR-c7F6;Y790|A^25?#Db0aJun zr_j$Z`5b9Oyoi(C;LAEuq+}q1=ZnL|>w{psa+SPOPEbBW6yG4F?`}MPoe*MGz~t-2 zTJd^0LJ?xZ@bSi+sxk-Utc2>=E?CfdwU+t82u6{Tb;7ryquD~hJey(!rUIc@Ck8TE zFZhz@>7p09x?jEa{0zGl*JT*b#}VOAN9Mp`GY35}80@f!&4!LWy((Bh6DPBlEcYA1 zV51QP2DFMHOO`GPuXZ;i${15o+hfmXtZZ9pB6@xB5ZbxTi%bFUvZa@%CM@V5pweci<@`lcYU=2ZrU zX&>E7UPl8zt+N8ueee73u*50k+OID-v#q4c;kMRI|6nT_*wb7^ndnOHbV{K=XxOn)ERi9v7}f$532B$Dr3DeHn7d>m<*5FA_x<8j0POqtvWts^ zW4|L=DXYLYgv$SOb}UUqic6793fZdJUK7m{Xhbx0#VBXHV;QW6#`k~#-v;nN@mEsM3OB}?bpp)Z2*YwklRqG*9IMdXdkI!no{*cI-a zL1&;<32j$3Nzx+JHT~Myvt-)gk#-^i#flZdQqD;ExC!OeFhv50 zj7q)5sK!L1Y?Akj@Z+Y%a$w=3BlO~0C4S_QaiJWjDGL_dkWW*FR9VdVeSw(^t7UWK z$<=jcOP}10;7YDt9FisNyUCeIb&X>=l4xzZN{k@}#Zf7N_ol#gaw2&uOo6U4HGft) zRGJux3sf?IQ#mA`6%(bbKh(>aYqIdO=-V!&)SCUnw(bG#Noc$$S%zY&FK<{ z#8nKweL}gzpKk;6a<0AnS3<%M1z!j;&p?XEeeJlc%xT?SvP)@cB|!GIW1Xu@tD?|E z6<2}EBO?wu$W!0r6HE+1cuJf6f#madmlZa!!-5vDq|Nh&bWaKi9r7mP^H|&p2?+|W zs=1Pz*GNOw`BVi})l8EUR}AMahPeg>Rb}5@BbYX{)?`ve}4pv$8`-^;Xiaf{!8w9@g9_4i41PYrwTbqN6PZ&>JB2*P?PzQ zp*w8Gn4VV1^q>Ca`Jr>bzMa@K*NKFHe2rbz^^v~lt99k+qKB1sr_SoYF(UQS(L?;< zcDIfv$XGhdvGvdw$gYdOvmftqk0pLYQ9X5ne+G}g>pH*P?9dNwzhKU~LiCvaiqi#* zxz*ak6jM_ju!h-mF&g-uYWa+O)6HOF-+9Iuy{b=i=d9u^)c_cD;3jto`J9OnRMR9n zu9crm3sAEdyDu$Ixbd3hfW@ITA9(DgnaQ@ey1EY_OW+(I{bhYR(1}FJzG*232;91_ zR#d7qS;jWyDwBl_rj1HTlCfpQy5ust(8eU491%9=k*gCHe@u;dGdjQpU$aptbYt>H z1P3`~pMv7ng*|6eP)9!>mznD@=m>C%C*{un^vZl8R;M5fp5dVhgd*pT6xyPC84+~} zy@D}X`26|1909we-+pGn*)MHvA3@Oacz;lDsx}9v>xZDO;I5GZbUi94>{1~}@)#(Y z(wPra66*V8bVqzaAUhdYFgw_Oto9pNI8RK2jE4-rHAH4<5etU?k)p{TV`^((C@1?v zmuG(SeD?~kzsugU@Q72n{YcdIE3sD=Ft2kMzjaa^1+4C-A;X3-qbTB$+q!YP4p|XS zk8?cbnfg$L!TiU={$I6e0yo9;lwUL^b`xy6SH&+b z!m4^XIJO=3mPk)5@A08tE=^7f2eVSt!b8at(VZi;qlxIhE+zidWna^P>H{Pa&{2*1 zN}WmabD96h<+x&Q|BpY;a0JUhq5kHik`*@duWi}W_&?T& zfoz+COTGW$o2UKf!-Vnlq9Xz-TOZE-;qvzfU>&$ie#3Bnn#&``ho>VD8D8^zyrOv? zglsQ^oS!@Y5s_IO0g-H(Er*on>gK=3X1&t)3r^q9P032%PfMY1AmI6txN=TjLQq9D zkEA}1C(q;_iy(R>!w7g@(LVEtZ7`HPA6{PK`Drv*2L{Ml*#-jy5gY5n*Aa+xulWSi z4jy7cHbF1f#?EKJd2t8=TYXZNOCO8(ig3~Pm6Gazr=`TVe;pm^q7>iYK>!hWel8(E zZDO`*2R#ung*_jBEP}`+vO(lm7i0c2KTlLstQ|erTz}cx>g(;i5O&}+%%S>9#C8z*g7@h$TlS=gpOG)(%`*T;65coAM8qUMCuRSwmJEdLi zw&KkGi2Ep}`gEI*VwQn$Br4Ep2+9gbMmu92hq1g1W50fXsWx{Apg*$^UlV~y-KWLQ zi*vs;db(V~V(_}u#T%E}82Dqa_oR2|bg1v7kC-DPrz48O+{Dbcy+!DYnm#w}d)rrJ zV*VUBnGQK3D>W?(0kS`(m9?mT2h*1$PR2jJfX|@ykW?*>nE1-J6WL`paCf4wRW<)Z zhd=+AmS}34y$ekIdl;j!>G&8(%o2k`I)E0CoCQ-Nym17n>SWj1Fq#7HPK&EA)E zb##cF_Q${-S^_KMQbhZ*Kp z5jKgT*YLsOLFYMjuxZ(20_;9v_XiwiUeiby&sQZb+~zX-3JlwTlg?>7FhPzOKy*S6 zfkHjks-_-s%@G5?QfTS-;LMP}TqDOi`D82wQZzJ(iTTe%%J6fCRuaYPbsG$JmTHmU z?*=@`0tdvrxeoJWaJRRF(p%E~Il=lSz&#IO`9*X9FaCnn4H$HZAMgKJr-f}M&4H{R zHTEh$?rT$%Q#5osFhZuFidwRUHo14*JhqmG#iVA%KF87NXP%W;#vE902G%U8l z>0yHc;MqfB_0BNQ%x*#%5Yux@*_jBXet~f?yK%A}7DmnYcHL;OxJithlCw==GK4#JL#M zXIaP?)>7rT12_Km}iT88Y~t!XNxsraIE!!(|mpkm0+lgh{-lq?HFLJH}c?5wOj z)+TqSqWjKbc~6{GfP-=_0Edt4xaJEeO@k{)!TPxEXyqRt{a+HCKq(daSGaOXKpm7l zFWUH-6%@kohzsruq7 zDwP?060@N`pAKwjytINRwbjbED$J6r3mKOXGxGxq2s{5cgZB&vm7* zR;US`8@aO87Hg?ohA0+{?`f9Cir1#{Li7{U#+WUNW`N=0h?0WZ7_gtp`ozLOPV#y; z!uJS~wZO04Hyi>@@f3Ab+8sTmxropZ$vvT)?vWJu2kte@SOWg~Qcnde%cml(8^MPJ zrz#~dW4a!NgAA}YhM4iUw*Z%_75urOdX*bhI8{KN6I7FtOsunKb@oAYydVY{_BMbd zEqR)>yI&o{6JyUd&T%3m@31Lqj)g^*SP{Ej#OEL+k9{LN)cay7_Kfq1q@+F2>!wM0 z=3(gAmZtG#_pB6+d&~%**X-<&8>4$6W3u9vlC5uH{np?;?yRthUb|(WMO+RN>O>-<>_-vZ@D=e%l>x>QW2V~wqc}(#eAe8_tu)%P++VbUIqkTTDt?E*xp_)05E3@56T5;O zSfBe?n)GM)LvEUamUNfItGTVFM4z!1z)1lPEJdHVWnq1BX|9&InKlu z7>I($ZO|c#*b^VaMjs6Yuc-Y{v9*#?xF^%wkukfGYI_UO`nlS6 zSm^U)>ftrd0`CJ>Wp3^<%^;oYg^ZvNXpy6V7$3+sYQ;5kpMpJr&1*n+J)<2eOL}+d zM@=9BT;>K}ExUdboAnCEFO~Q9&$nN@t8KVqK~2iml|HNHWW9*}?wm|9bjv9esfl(n zyYxpphkE0XrjV&Re9NVpQI?{THo_dxIRe5aX(LxX-d9xHcw4F+@qLZk{&hfd^j`Pt!c9-$C9MQXjQQT(KNl~;IwC*I z0*POA3qw-;y2zwBRF9zBzmqj}dx@H~`Ub^5I2F^lBM*5IWPx&n4I;X zA~58nM83f5_!=-u;zQamDL6+n_qJU4)8pQ_#EEJtoVcVoa@a0ow((>y5>zQWdLPgd zOtG*`?RrEB>!_Sd?FLSEX<;Eoi}vBl*WeX}WC3vyJ9m7|9q_p6n*K>7=0{AH{SkYW zw8^=;>cgS>W#&=|^?wdx%kSJJ1kPNt`nk->@lI0Bbh@utIof3N^N;zLciJY=eI$F0 zZ2n1Q!NV{j+`qKLHks^o9ToL?9yiBEEJvQYlzvD&(B3%LIN%=r{plw0KwHy%)4&$7 zZ`>R11|7_cyHOXgGH*oDEsW_<6{E*cK1Eq&r9D}Itt=Z;oyEfTB|ueR6h&ow6S_lO zuM}n6SGK7@X}AQ0d)i~J@nf!2bM94>DSDC~^{J(Psb`1$M=cubi|;KLTcr^~_u+?- zYZj~A6>h$O=bAC*6vm(U`0y$AX+U-ewtrVuH@?BgB7l?rIfgB0Ox1U z?kNjqGVFA^oyD*LUyecW&a z+2||{pTjBU9FQ9g$_c}Lz+C^5-zl8gnNCrglA;7Y#>(nnIR2!M$gnWmR%(PQrzIx+ zGPZL7K~q<)TyEZCcP_51ca+0S<4*Zi5k0fS0+b0^Of@`m1tfZUTZ}AL%1c{Tt>3Ns zUs--eB5+Y$;t*b7Lp~422q4W)QWiUG28VkUin>OgM2r~>k9xr)@bZZ^BaQ$9)kvQw zasQ+oemY(HyVw6Y?9OiSU4>P3S!BQNgtdyFG%SUc;_9OGv__O()VRPLX3@o`80V$f zITm_3pVnlXriwM%M20>road8L_J;*^x>mvhw*J5Ki$`Tu3`6E$K5yHf*ykIcQ4sxl zM1*kU6a>!?$v-Un$EhIO;I5voukxmzb*L&WW$g3+%*LtD$NmBQ%qj)jJR}_kfKB}U zm;T8ACuT3J#iMH!8e10&nO)7uaAAmq^rlv_FXX~9+<=d)uv3jWDPz;DgnH^e3ZN?C z71$schjRZf_+;S=4+!vu|GMB;o%ggtyr$Qew9Ngq9LE3ZfSDj!x5|`KE)acv_(f!) z2ml~J~E(C_S9B7b?>B){v8NIl>CQOev^3H$OEODT;sQW$M3D-8}*`?ZSX$q5} z7)0e!zy?2sMcIF^8#>wTbfhc;M7xwEPGPO5!Si1u>Ct2YxCEfDHBeRc4_vthEu?_d zgOkv4US{E84+`qh6_>P6G$`h;4@nm=NN5ExXX7{fZGMYudI?KT0}}wsHcGXk*WF`@U0+iVSH33E~fcvd}Gi&?tIn;!Lek=TDuT9WL3tkhUh#?e?8ov$(VDnMW z+=ifv8o2~z?LLreDxX?wsWGBWp-R6gPj3VP0#qrUlrJ)*!Ymcv+!pGP`@A_I;>X=E z`2|#AQAsb0gHoeXvOzhFcKJBn$~%I+@4^qpO*0Gmxa=^ak1(go3^wwQ7$|CTlq+<$bV=V|OcOLz!SumwwN zvP)g6T??v9wM!jUt)=*vQBeX#h%wjIc>W9@^@vcJX6fS~6r=a`0*1iv~b-;|vEE;pJ% z)zQ1PO#8O)g3|&}6fvqU*ur#-g-V$D6dH-EdCYcq4RdBsPK6*g7GhyL=3v$3c$RPJ zcf&?Gqb9+FsrcY<;{*Aj=OJ>)iKd;XH&rc1DRIvPQW_Ny zr=UT4u#yl&9RQrTonZ3k&8p&VB;~?#5cQ$G_*N40-bO2jL}&5>E~NsYLLi2u(Zqqf z&84{oa%t&HQo-k7*B`4V&g;!skpqu`ism@_a?+u#l?sGFPNtUHyrfb>mkc&3Bh}S( zU-=ObT`c|5J4>~IE&S(IN%We3FR@vR;`OxPYmy%nNL3NJ^Y~%j&wL~9tjeRTpG3q! z`kDNV59fTpfTYJYD03ZtMh{`D7xwm{2EgPiKGOwB@oYbJu64!G_=>!x_A44stt{m8 zBM|k}SUpKeXPF4H+wb)kq-&I?Bvfl$W8$5k`{2J5uwNq~N~XV}#` zGtLrm5o7lapo{`DDAR%|zjg_; zC&Kz7O9SsQNd?6_@k*zrI;vU=-icQ_6Yh-ysI$e*;hJvRf`zUXIcnxQBELQ%nvOEwerCw9CKZ)P#8u5pJrVC?LT2&lme}qc(mEYy!YTFpZ}{6p<$V zXGU}`a@X1}F0>!5xTgx7$X3AOoqb1^9{8uGM(_h#p8fxDF>`vfG}@Xnn9nlu}^fk3~ucEEsc31DcxJa|eb^yrsaZ~1IP166yb!#xcUt$LiHHctF7W5B{EJXM zh#z^?tR8nlrPJf~ntmt8%*r5d`w5GVB|3L<>OMK_CPfDj0UFn9@35Y1w0<=5pr(tAJaADMm* z)L%~hKMN=AhkpTdx}!MtgPfSc_huL+tNN}U%(1m`2ET7PoxIjL(sF{D!G*~PsJg(S zcYxjZ)|YIYde>T~6td48#ol%)LPZFuIw8Dwm`KB>WJ`JOrYXr(5nKGRm6;K>t0NcG>a*OBFnMWW{Ov%TIa+SCvRIBdPGN=tyHRxXj4=X(Uqxl zuczQHa@8D-;3A50gXLTeQ(yB^IgEHMidXY$s_2NkMe>GRtCrZyeVphKm2W#v*Cujp(+_6y|1b2xK2}!w+3pgO&}m zY2A7BZydi4!t?W(elz)j#!ZK)+CTfTD%6w9bCkHqyy zNzOY#;B$=%lg%!6bs*4!X&sI}#TE=5`Q&xrGgg<{YC@Vzd4XJl$8FA^^sL~8rZ5b6 zB{7qlRLmzSshK+=0xZW=XthG8*2Q56rhE-|#1AY)2jB>&z_B~V)8m6NaZaD>Zfm?o z`mLPcwaj3*Sk7EXk5Qov3l)l_-FaFV&yC~Aq4c!h>Jz+{Yr$>@aN!34rm!`8QnEC$Jh8gU*`+^8;_;$)Obtto|=)uw*9E)67R1a zolp0p>qq9j1-=hxLu#2Jh`0a&ttAL(JxZSBH8&?)#IVZ4UpqQq9Y3*tXi>=G7>?l> zjv-9T@det*<$|3S#6|$61wjO4XrY6n3(3Paq!y0jIF92uj^j9vBOI>Lq96i#vZ`9$2nSA2t#CXA}4YpClayc_yTQ2 zfs@0J*m&pK!Gb-ye$e}gjl=vx5@+Y^oSn0CcFs=h(Iy>{M?1>c3j7_~!8O_u#P*|( zcABS%voyMjx~u(Qf*||=7=8#GKdR`Vxd0;P2D|0?5c_Wru_BI(axp9ZA)Q1-2Ayif z&FKR6%!f4sewLr(5|D%xMo78^eI7>Uq1eyPyRYJ_`d2Hpe4}0&2E#PkN&Rck*URb~ zj%#u)Xlot$=j+zOZ<<@9MZ?{>2lupITY2jrK|Zax_J#Jd+@A;NKp;p5Lnz{5Z@$Zrz+i(G5yq{IeQkP+cDJd$ zDDMLZMg}e9{8(~}9WOsQQpH^JGlVb}^e;*ELhKNdxl8PKF8OE8VCP-0GxF*b;qrM! zw3L&Npb*iM@+zETKQGNi<=kSLYSki|QBhX$E*vAJ(f=p|=(<3~ZW$4mP2@xnLBV&; zIIlIMTuub>vNvc0EZAtqr!&sitI@jwFvsS~Cp1kM0F~sfiLftuq;#nr4p$OSvC@o% zaK}zF(O`LOKx3}uW)GmkR-)%xJcAj&{uqflrr{&T5k-hih=B@zuDIR_TD!666Iq4V4Ih>ddCnq*6`z$m?KVATt_!&03Ia-J$n>(WGwAXFC$C#U5igiw5uMiECGhR4$&_g zX~(nlU@9OCN2LA z9$1b=v-2Q!V9ePu;p=*j#e$LakPt|ZKl0rKSY$TyiPfnk%VG`)gKJ@##9PX4aXZD; zI)o;YEi6I!RN`qiL>OnVp(aV2kap--xca8SE~|r*PM2mBpfq|p>+Qbv!=0r(u~1UY zGLw@yatZ!DF%f|MGC){hAOtP~*5KBT zk-ch|`-rd0Ib4Me;x3EQN>F{Kw11|lW@O{X)l>7heWVmvpD^peY5XqkupLFjbIyS1 zV9auIG{Au0g@#{HgatM5_JqYTQbLH>fZqj$08&7$zs)F;8fYV0c=aE#PvW+pknC;$ zK_yqeFL9-&%(0X%wdr0eW7BLKS{|&^6t8cQdJsH53i-*GGJ=w=;9;*}jhvtUl0gfa=+utjVl!0DtoPhuNHvw6kRS$#!Zp7$|9Th5JH0 zSQg+erw~OO9;B(6YB+N=$3ZT|u=NhZ zBj6fE9$xUGMb6dAOvDTHcMe?C0njYpCJ(tUGslH?$F56ypFL-QQC{oc9Bp17#zIUV zLtRZy9|{!8LB2}wVSJiy+IJ;Jc|sAlP?V|Z=DkNuP0A#aPGoT`V|v5_@i4eh)N6=O{LU?nCADhEV$~o;y*Pt79Ynk z#5pV$e~LfjwfZG4Auwltb&hx%!{so(odfod@X$1+Q*uktXFE8X=b~%-e0z+rjQpk3 zPt)z!kE1ii*arozb!AO$HdC}FX8TZ-rqgMq(zlf{c_D)FvOjHr1~Ac1;kjt7V#AH{ z3xTIpVibb6gU*-L72)dQ#RO%G7nZ2mux_%%vY&~us1wX zOe(*@MT5)l`4-7>IE()yjn%8EZfqhmhaK^v>O32Q^0?l7qN|jvZ|uV$>Eqw+_pJ(S zDyMQ~^?yIlb;0rA{qY41zU^x?A59^}4A4uT-&C5cCsxXF!ATL#+>xj7R+Upl93a-vFrpZk>HP;w(~DjN(_+ z9mS^MGt()Vh-UgnjfF!X00uxO04oB#|Cy}a4#PP+6o9zDqXu0Z)YssIgJ=4=^*42( zj`pF0|Ghdy`LmM#SG{ble5U@trBZjs;!nlgbPw#ecQqJ=x z$}+b7=-N{BtH%@o_#n80KN`sXR7VPcPqvP_jC=mE35O0~=@yja^2ryjnp{@NTPxG` zg#v9pqC(V^HQ2VKJIk2`W9}N2-dr>It^nADOdgKjn1Ra`B%WY%vwqct^!x*!%|cL3 zVq>WrF&Bn3wkLab>ADa_TPyZUuE?NIN=jPg19u%f=XhCS`cEiMAvOiMaJ) zsc8vmi#IYH=D|F5uSt@IKmFWEY0QTomKu`~3)nzzNO#@4(o(#P6LY)6t1IoIY; zZp~yZr5%Yb8^ zG`2Hhz|m4MH`dhI58XMes>;2}#07^Xq0MlPdxkAxPi#V&EP+bV2I0_vJvMzGQ;Je& z^$rn)-)R(nwQ>!I4Y{gT@caUpsE1tWOARvOaAUl(-BKPuL=V<$He#*JZwB0$nYM2{ zef0B68S`Ws1)Yg6OgM2b7&26r9@j!ae&<_<2=G%k3)Dko4b<}G5zy9J@oYGMD$de` z8MfD*ue-G)jr(rYIUSvqqcRyYOWwr#ESaBW5{nkNV7KXazs_lUv_xOpJsDEYf5zUh zYIfbY+3ce#64Im6&vz7uNxP=uR?Wh#=ksxh6+3F9!_lGEAmIX7kfcUi4;H9d*^ol6 zOo#ex=qk}Odz0(BMLzv0whoVbxT{1>Tg+%%&g1P+q&|}#V%s9C@ouU$Q%dZ52*_=% zLi3@id`&ZTa#l~u9q~jra;IUhy#+vcsl`e&#bgWR$4lWUnMR{=;}?v|=B%s*@Z=EJ zojCqFn>mSR z?65l-g!6c@r#cD%b^0moeTCrKUsf6pk|}9q z&c{*ij3vTZ+O$}j0r5VY+4aV8iZtj56KdW&S`S73)CE7PE{I}KUyQTXdAWtB{NOB7 zIo@EG3bQ#*LWR;$M2NF4`rL0oqbFsp*{nW|R}s68f`0z)F_HLxGiSv@1q>nD^Yt*)r4Q4%}lS1Rvo@xgvJo8egeui4#vZ*F)NcIa5HKnO$TOv9ue=-E^DaRa@&JFCn~<9gAbO;y?*kaMCIFAM z>+SsQg4Xnn*{m{$+I*rco*i9pdMk90OOL-C+%ekRcp(w)(U7{_@Hb6+BB}S2!0_o72wv3_9=DD3&bt= zr}iHw-6^-!lHs(t#1nsP;WU5ws9HXSEvXTwX`Rk<)t!3G#GHfbqCCYUZxjZly8m(&aE{Oc zGl+Fl>{BAT{kYqaG62mif4wUAHLcL1dv@%Un>g$HZ+`$WS-Sus^7vz`tk+NDeWSa^ z(GRh`?e))$3;WdFS^V9*Z|cy#!`lFPH}Z3rmx1%$xbJMjU|+Lb7U5~jX+?K7-inhW zayUgUz*gA;8F@YoR9z-)U`O%q0xa1-+>vmG80qi+NWQu!@U) zqK5bK;!5qIEYo!Q`x-P{LVv9K0mkdJjDfhlwtVn(~lYFb;Zuc5&KfHJk|`YG(*=)?oB`{#Y|u5{^2U;V^ga_LgX4b&>Z3rHR8~ zSQ;yd?-jWH-K39m+^vjRLhHLooU{^-I$ZWxpza_dxLA@|jcusMl)yxdK6#;vJe)Oc z+H(TyM8Z-+eG)?@B96mAk~P{>5|vEC!^7~Xlbr7@xqJxKlW`?DJ?PH+w#;%)$xuz* z+{4$S`Y?%S`^_J`%xR^ObWtiw_6`_s>;g-Vj@mFD##o`@ho(~Duvjij+_d3URds{GjUXjVHp>@I{incbFbODU* z4wiA$yw0)L+KyaX4hZp7LQ6z?ILwR^!SN3Vz zLXH(yaClLkA4OrfN2zB8lb1VrRKp6xamqbJ$Go;1Y%xktE_9dte8r=DI&kT#gmfvy z4}C&*9Km9kj0Kypl4*uDvnT)2t$<&9c(b48{JcI*SAfMZNfvA_m5eJeeBIe@Fz3Xn z-gbmv6ZlI%Pa5QjElQUL=@T}qh5XwC7z3Et0ua3b)Yt@~kyMYCPy>FQ=N*1NrG#Je$yz;kD~^cM2S3 z2FaFG>24#p_)?o(W3vscKg=h$+I9QWjSRug2$I(xE&KZHw@)Yc}a-0O`; zx4P3+*PGVkf++8%Z+N}vY&Wu4%rH!$Ch8iC=Smykr|hjafG}xc6q%$3($Gh--L=$o zM9BekQ>zpUC<4b{ti|Osbm&=9MZSp+*%p&pdhV zUzlpRmLawoO2zJK@|LJ9se){&_u-{PD30enJaoSGV4XAa0jD1Id>zs0Y9vJH>0QC zjL3uu1@a<4@=BO|Et0~7Z2pztzm9IGcdk}04UMfKEhLf>%cVubbip3*N(xsAD;s|% zU|e##&afvT#6=Omth5u6x#X=;wfluwKj%vg+_}-V6#u!H!A?A*OopLlxR?6}U#!S- zU6L-J0M5>~q7=9GK}V3>cxR|l89Bqav8)l^DeijK79B*I%pqobspEeRbDGVPe5E~IO%e!;$ zgI+|niQ|t+o0mU!0eA~}KY0_Yo9@qhRYQW)V{&^-(+v)ldPxqJa38C>5>&SOe3k&u z&W$RsxDff9;ZjVn>H3>|`A8RTQ6#Rz?G`D?ztF5`qs96!DU~XLqp5Wn{%=Q# zPK1DOl0*c!pgGoq1{kzCym(6SIRfxf(Z@Xx9?+p(c3}?`H5Ly{JYpvY{lHMo{zX^2 zS3E`)vWF_-P84v|KO%z2f0f6a1&n6qI>NJ9=z>Uk!x9n0%vGQuE?eY_)a3dZ1oc2? z2EkwaE?eNwFVTf4sp!EZk}Z26KX7ZUL4IMhS%-l^kDm_))5`@wXo`F&K+umt?;uZM z6Xx!*%7Y#aKfduQonY(F3!EkMm7GsI3Amt_G6@GDv^p@9?n-r`VeUQsA8BNL6FqR* zBk|kkCEj0|3Xy5%t!I%1j=u67tU%B@uW~Pnx^^*{z)+_Mpa+IVTIbc}`hthGn+@BD zzK~MBm50m~LIo6k{X#sroa)TxBLB1IfKjWQpwZa}wsQs-^qoeNrFa^iDO_Fi=z+5y z$dpAGZfJr8Y#`7e4FexUg!Zs-LEpoZ_^GcfFHbpFYc(WwjA~dYnC7a zK^rWG035AVfc0gAV~u~awA`#E79{Fzhg>P&Tyq$J(Gu-=*g$XC#F-fSPAzaT3MTb# z!gJktRe&_+zHu*XB3k5yQU!@b_=eMrcT@l7E`6;s2M&)Fu7wXB`sR)!pOYqb0t-1# zP7kcqHdqqf)KpgmG#oC+exy8-76&xI&={jg#07O13(f(UVG)agpkg^j2O#uzctns- zvJ9$AJ}89je-*Yta@i-_@pfK~tqA-r$86XxD6#~etMVnF$BWdR7Upz@=^w@V)OH*0 zp?EE6`;%LX2yEY}3S^{st%xM4=(=Pi9?38tl7D=%8JTn527vdS^1)&`e_t-kaqrDU z>Z){KA?-hjK8DYEr5?it7@Y+H2wL09xGv|dhwY>yvyshL@-{?hfYGu<>tWfWGbBy{Qu}KOztaqWl%v2p0%l+xyM)8u1xJLDDhN7f;s2+{Wlca)x%q zCIJ2(JHU#9&NsQykLg~hlqkM#_BoHb-iuSz_HNd%RxQZ>&rqqyua{R%!wjg%4ZdSY zl#du?BcQV{-{HPBZ@w`4A8CH^+_A-CT3H5nY6mdFwH|wR=4FO z8OJ5ZAQdT1h&T=Sk;Yzo_?3Qij0HDk8&#uldp^W>wJV)qAnMZM)5*`_H0*>D zNP`I-p}=;%v(tCG_eFNSTB+AoK(8f_~-u^&Dk%46WPR*!%vOaWZ3)i^K|G_OA zlb$c}J2r;mI4Y9FHRY;LPs~keNtZCkx^uSS%XzYjyIb>eo3vcwW+CG8N%dqB6k?X? zh=Ts=`puHJy%RR<>Ggb-j&D!*L^PvSo*fsuwPn7+^m4O)5K&ZP*)IS|==2>`@a%}u zkQUCg#nFxIOHX;bXk-#asT2pQyKBE;zDld16p9g`_3CiYk&nZcBm$_jAN^3;qbN)| zDMe^)@-9MQ>SX$Oaf)gEi0 zwNTuz+`D5@^kvC3;x*XpQ{-hXH_4)tdx;5A7WP8tneN4@Z&!4NTCqGx#=2H{tRpqu zo0^gD(VFh9Kx#rtveReXkJ?g=UylD@GkhaFiCGx;9x!MROGIFM4ZDB&X1h z|DOB2mfYUQu1(l{`ky9h@6hYDl;8I5kVr%j|7+=1d;9h`fHmvDUWWVLj3V(sFX#G$ zMOr`l!FREe_1dr3eY53m?b>zrESb|_E;WO#V(0TAx~SVu(SL*dH__%pOfhE$uW4N!i28oSGE35X3E_Q<{N$*`WG-@-fe+CZHPY_PL0)O=z9@b zoeiB<49PZz%CLv0m4h*iICc+-i;iD*xDh3fBB}n14GMM}+H94kJMMG1(~GBN!cs}6 z-&@wdm#UA;$D2LhJBrdpzZY}ZNwNj$2Sh7CVZS#N%SPp}H0|+mhxLp6bKIZ&!~*UK zbKbp%A{K0)&ZfLG?`$i(TUnm%-P%96eW)#t@;nF3(~Ow zN|(lw%nIqF&7Fy3*=q614ueT>#}cIot^x7xrEfHR2UH1jK^Nplfy{=ZVCuBjVW1d> zf>wU)3%OJ#|dWT`H-rM@(lbZIWFufT-%^M2W{`~Ci~KTgsyJ|@R>&8*oq zcg!CP$D&~)MlYF5_L4K+1QQ=4pnwAjH1I(PVvu6Q6mcYxMm`ErjMaQA)c^{qNE_FB z1KAG%3aLmN*LqPbN};{fblV;ktjDM5{9Yv=Qv4-j9880-tpKHZA>x8+DQaw(+k&b; zJioqIqg+*Wr`oEF>POs}Jso8*WhSVa3dJ(91!ik;BW}NbHSMwM2CwUgDLYc;sW1)5 z!)4usu;%0=Lbl8BVy)HZTuye z#=0R!Koi%rQJqn_P#M{K8kwbqEiD@G(Vl;F>3t;6>b-uJ*^#1y#P(b)N;V>zc*}Ev znSTeje!`@JSvrDdh7Z9A6H;oRTrCVV=?B20p;LXEd)v;a!{FX6{?YaBkIJmDlhrt& zOm295<}Iq%voWRCY%XrZa4Myew5EW?NBCsxoaCb>`U+-xuXoFjiY&Av$IXOi!?J5b zMKZ!l1m7sbU;N)!Ek;ox@`Gq3*Pud#u+I{g<~WKrdq`nRUJz7@Ssf!xU}8;z(IWoz zWEiOwK+4Ramlj__7#b638b++eTaV;)TondWa+Yg{zRWP)Q3d6=&JCbp{q4)qu%Md8 zl}DiQ$gi%V4Dc$oDPfq_wn^~%)FX%tHUkW$SnT7EP2|UN?cS_PLO*r-y3n?|a`QW}fv;@v2-Vlvi61Vb?!Ev30Y8N1%3PltI#6MisE?x) z`tMS0N~l*VF{qn4g)8EoN~UggVzLeS;)LVNwz6MWJZ zK-ZtHCaLa8ROGrIsDuF0aFM0y!> zkK+s(Za5NaOOI?~ZVOP?F~n3Yv}6#*cv4PK_$Bv;+#4<|cKs((QE^KXE4#V{H6XJv z&{2A8qyEITg51fxU1Qknk|M6HyikwHl4_cn(*Xmyw-XsFCEl;f@NryLu*OQ;mR(7oJ?Rx$61Sqn~qTIJKIg$Y`x`0fJd0;>Y-?%gg)JMA`g*l3ww&O{>f0tax0wFMoiC40Et9OMW z?1cA;#1uHS8`B^xX7A|ljR+m~qmn3Lp_EFa+*3;PANxPXF2^p8iA$n*6IH0eEj~nZ zbcC1qN64jz;>o?>2A=|X=|6<;6vT#YVkwDbi-aLU>+1H&?lfJxG_>@)aAfD{z7-V0<*^&Daow9K3f)JB_ZMN2q$rMba%Og|MGPlUQmSte^=9)B# zV&%2Rz2iCw=s_hio4IQ0e2w?RK#BYbOdMWasoFz;$;dl>l1N-X$*nq1-6z3na+}TV zbgSpXP|)cxj7kyaxIZmxa*CqJSZY}MfEehwCFi3WFa$zA4qH$3ocd7W3}j8&Ms#j0 zd`RIKNW*JXWZ`(>2r0tgAX5>6#^t{=J5cFdxC(*sLXGw4`v79i6?}$WL9~sxPz5DY z#M>rAQ;Ogw#GuK(Pl`;OQnbz^J>!8h-f)H@sGX^@c(E`^iUpAl zO4$pZqhrSS;pmKUNgnYBaUO|@lF-m<&{%uSssA{9n6BkJbeC_Ksr{Dj^Fz6-cg=%c zdjqiU#c~!WYfV=dPN)#T3Nc0Re0s2`gE3}2*mFr){d*!z-bVB^GG(TV;rfNcUn=de z%Ow%Lw+j>qX#hzFL0bLxuO9Ib+SqwFde`%!Y@+-40U zxe)@SYtUi=2w(+?1;!4=L$;Unb-T@9!1mlQi4dI18~u8t!v(3N4qS+VB!xWid6por z)3!ON${t8pZhH%9-XyB3j*xLN##89$&jBhp@PpP909h3RUuv!ZSmb;dFKEZ#bbx_+ z8HQGBh|0)eHsRWYKOV%Z>icYEP`aDZ*9@#=5yn%S_SSBRL%$h|8`GaEz>R1FZ?6Q~ z2;1an=jmcz&a3_U{fZsi@H@Cq_v7w(Hw+=9Fof~v=w}d);P*-t#^z~PptwvEiZ6=1 z7+YR0>;yu&7c;F-=ef}l2@6-!lhPR^NKtqOPM;q1r`f3~Em8Q@KBpa6%OQ2t5l&Z5 zb7k1JBwN}9Qj|S6w3-!;mLJ6jDzJUmp0Tl&70kr@#WZby*$RO@;Do(UYckM3MhsB8 zJ}OOt2mZiW8*H>kXAH*sXHWOJU{xKTNZvShKvza_I4eTKv?HsSQZcjOMg=^?Tb*_j zmecVB(~DK(Ogdr8$;I_@;`3*#nsK5zlT@{^Y8ogHrAG&VB7sB|;3zwZeV1Y&dod`P z9TE3%*rD#h*aE}Oxz>Whr5y&!^e6ZhJ;g00iFy@W*Om|x5D=gek0N=Qj2h+!)s3*H z?8~#dB{@#oBIL9K-lQB=))pyIHouar^@L-IEN@(q=HXAyybMN$cH18yo^|-o{Z!Xr88hqk=&?Wl=i|kds@B5fWeC)zY z;Dr#f#U{28Z%y;6{MQ3m{-IeawE*e*a+fhrnUlYdQXVT7uyGzAk|Z4VA`dXk#{3!y3DBw!PMGgYB@%n!G8R zvZ)G{;Uu87Wi!VYIYB{h$Ppfl`wQuKjXJC$LsvBFI$}-eDz7RJl@M+{m>$Qz+ua>; zKwxT!0KijJj0KTnRKj2{Zmr}Mgbxz>&HqL+)gTda2{ucM$UH>4z!5eyO-@4cS zT`nv->cKW{P~FsHMu|z7DFML^kqB;z&b#2f+nKtOdMpg8#2wj(bNsNOJ;=ljhA918 zuK+`pL?Z_=#;+C9)9AJiB+S!nB_goSiwOYU7LGN!fep4znC7H9+u2sAV40IVYq_gR zgr~CtQM5d4wL&XnJuT$-Pqd~%GG&e#|@u5nPSR1EVzDcE`$H2ls#^x^8mK z=FRml;!!VT+%K#k;lyk)M6dV2>(`~}29@`X`bla899@?Lx@CX_Sb8o2!Xb@f=x__` zOxM;Q7b;jlczKFsg)0b<4?5!ZKR_p$cnou9@g*{(f)P{WXKb*$dEo`aTc5f zTQy4O@FnfA?*u==`OjYK1y00>$L=zeZNCSDx59a;^%Q!&t`=_aYH1c#PKczr@toS5 zN@tl+9~ud#38=Vs$OAVUAEl)F1(H-9$$#{Yk|GXCkItqJ)B7iNz=?!S)WeOvGcTJ- zO@>;)?Fo^yB4)%Qbfh+|hI2AN>Icw#jB;=N%Px8Lyt@m0M|ud2@D}N&qyY_7PscD# z=t)GX;skF*twx*6NPsh8gMoB#q|>P}nog|9{G=KQjiqTRRlR~UTWBhJkI3_niO+3X zoh>X4bdt|+6Z_Vq@s39W?@_Kkx| zXd!fg_k7tnNj=W7y5J2u4}eCi57N;B#AkoZlj%rMC~}kaUVWmInPr4K*Rc-<^_g!C zje(D*zdc6$l}tZqV)onl*W{b?eY-Z>lDUen!nR3ZL3@y?kvkI?rpbUml~+_skc>zC zD`^+0UR3ElsWex2@IyB21jmi*Ue3PJoCdz7XmvoPwqx{?flHt<_?o!s8z8XGp_Ct+ z;nwci)?}W>_0Ju=g515WpL^FU@bA56>oy+FcX~0Yi$(JJw{{kvKYZg0d&s9g_s;8D zT@2OvqzIuOkTXha<||9A5Gjsw=XkDw^K8sJKf~0Yfwgt7(^{S!iVzBAlNWt`rpqNH z<;&Ld5s6H0)eJW4mGBeYOiJNz7Jpw3`5^6gnFKhV$-i&xq392zY4#iW& zpDqsv-?x*`KHVHH59of)G$sZ@_I<-G-<&A4X>Jl?K?aPnw27YDA1hXqH))ugz@bJZ z3w2z(ScdO`^@v=Z6)Opqh(MN!TXQC0MA4Y=iNN$FdTYo9t5aHQ;TQ?XfvTcRmr=FJ z%D2dP766l?;Ti)6{tnph6`fw_z+@6_-xtckYT!@+&hW#2sU^?L+NageX2RMEz(F_4+4bRt95v`jOBJQFRnZ0x8dr4(yJyH~kjME~r#Zh%$XCs^XwwlA+%9%GP@^))>>RKungDP6XxP0&s z7Y#EI+|H)8yptwS-#*x9z^_I@77Up*$h6gop^*juDq@H9dl$1gEI&ApWBj95M_!x0 zfC!DoXJ79hE_4~<6+zw@lTVS)G?tMA^2{v=1Y^4&weN7jtPXfa|F1AaXCpi#Wj?g^ z@OABjLYOgp2FdtbnOm?ub0|Jnw)EMahjo81%`GuG=-dsjSQrsTQplKcU!y{vVU7;7 zqLX{G`?0>?%VWElxx%Di&8=Y}ZG6`-i}Ct~x1MH0JKH7$QDn7ALF}zS^t8Ngw7M=t z9ZY6ULg6j_=?f|cVxELEM}jt{!B>jACORC;O2y>oT6&E3j35q8Jy9yLvjnX=SS5Kr z5=zH_o$=B$8RS^lmZ+5cSnO>dDYS)S%q~!1-u==yQZP# zR!wN_Znd`pATKObYNWV?;?UJx#$VD@)$zC;cf}u54;mXber(&yf;$IdkQ?vHXnB_N zkH?XLO_5&@_OI6a|5b0{YcKLmXPI4h#dBib7lf3?P$wDPZw@FCh@ihSQk~ z(AQxP(=TUU@WfQ3N?D_!LhzSFxtG@WP@Y@OmCGdxiBhgI%gqY2(yU7HO(CcFrBIUO zNh%5<8&^huyfxk)KQzvF#5ilSl5hOwMM*j3(=1nd1)uLf7>*cN%#{3KjpFuTXL z)c#FSZP?j+7<}&{$J`?GXS=ALuH6Yxyj6c0RWRfgGcI;zFh|}tK0kr?2W9GPZCfUR z>Na&6pUlQZN>(@h)w~>UZtvWl`H@={gUz11d*3qGOFbOyx?$987rmpz_PQxSwgqn| zo>^uprFZp^-eLA4CG!pFk`-QeMQLB!1F-kM{{DH!)yUHC?dm^d7S!$IQ7fw`A3!Af_An~#Mjf57mXT6na(xtZ5&#_@n!+Pm9YG15{Eo)Z5ADp-CD651 z*k1`7ma3ibh7qCXW<8RGUNf={a^f8`mT+>*5d}*enMsdzijAxPGSs?`;{I$7kHdr8 z%?OTI*inz+VF;wEPsNpv`mVhmhYTB9*X0S}!Fje%UMH*(YgVBM{v=<94^?(m$W4;c zJ(J(tYRDr;yI7R2ZE;Ke+`x=v$nC*Fd8qKx6w!SY){{2~HXP=dgSH896?Dw!Xs8%y zxCba%&51!`AYSXlc_hS43_N4xtK4AV#{SxBeP=S*wy_zqLOx5wI1kFoap4)sSE-#O zt`O>@1OaI^w`RyT`fMwenbq4c^$kCJBl6!HGFDC3u7li@ah6u<4GC&xM^0`Z#iN&& zU?hB#s5Yp~N)^}mWU+{UVOLmQS25Lj+l4foFjn-#d+_GSX>Tu_$l8_IOVtr4}+^SQcAClH-@Rs;$o{7k`KZJm}v0CE(5L=NqtLti}i9!}0m};{53!jS$q`yMQIC^+?5Z9Jr?cy0jnQtjQg{ zA=#8v)U%~x3Jo#Zw&mNeq;DI&8j*C9BfU3luL{CZtXG6lFG%v@1}22sXhl2_il(3K z^gci*duH0?GvBDl?C?RjwBT3d19XN7I$kJI$I&_L%b;b1J>5t$PPhvGk4yf@%IkIO zQoU%c)rqC+*qV#hszhlC;ha9K1J2~6{3+PFAU?#>6Cos6cjHRZ43ti@MRJOj5HW)e z;;Jcs2Dxsdv_mAjBvh13xy|DqN#z?b&T!Dj%cT zOFa5oOKT5SB8EPwvz3N zphq2aZH2MDYAVSp2jOBG2%DIdY>NA0QJ41vBkP8I^-6ZzX40D?v|l0A4rySFhRJ%$ zTiO)Eq1gQuLTF-rLpVjprcFslH|XhXHHp>1>eVD1NuE;vr;YdRALZR;XZ@np*fwp} z_d+cT;h>370Ev%q*!9I{m6N4|QUlFRP-C72r%5d}M&Ve5IH*i;E}e6T;_k$Ve)&=V zU&8V{^u08Fg&ODp&_MIqSG#}o5dNK1=p*HHpB2F-7SmO?K&x9n4An3L+RIv88gj#4 zhY#;MbS5>7FCEU-kGhm&z~awdfw~g}XI#C0s&;tvuww}*eb-@z_Bc_jlQ3Wt zO9{WP%4wZr>2}DLr{!+~)xgdBkI$@U#a#)KhvmW0{>fnaJEsW?trJ zK^c}&8J9_!CdK%ahT71kw-W{59XvXGS!0^qF`HgIn-O+$9auQYujYhys$!`?rpJovFt|rlu(dQU)0j(K!%SlqLG)*I2x~$xLN-%(CdKay=U*!2u zz?v;ttgRYh?WeJvt80q^ZJrFtQSOO#i{JfNt%DgOy&VBLv)t0Q&woB=-za%G2Duob z8{oXq&b+zl6xP`cePWM;mgjM;t9d zfo5WH_~oOc$bEb{Ai)Iz96mfS(29j3kN|erb3nOI$!Lm8cK)>ry8Jqlo*G~<#p(y| zqIVlMi{t;S4XePJ|Dfl8bVv_95G|YnUO^oI=>Svx;*)omgts!&_^Nt}xO;O?ml5j! z=~B@hHXIDopk8jG(ip2t@B-8|!N*)l#lQ`_Ry)kf>!Xc2=TvMvY#5ox#lFEgTF6^t zYwg{J{&>T(3$ZNSQk0w=_7Xe7SgeIMD#x-BaEEN9+m`oFY*CsgdT>Her&pLRe_=%O z;<($lv0R&uKSva=1%lC~JtALyY6$2&_Pqo<6U@PJ66?+Ryy*lbP<6^(2~@CZ7FL}( zo7+qE!h{>q4tvejIvk`}j0i;TlQuMBBY)+tE|UUcqb z0+d|U1fsU$49Is25bNFoDOEz<--84yUOAOru~QO&*~Nd?8pxvw$TdSCXQE`YF$b=0 zx`g$$F#Z7}-&(PG?Gw)p)OiS!nAAB@sLrSBo1UJ-@=o3Kqg!b-mY4VyKaRc)S z090_BX6s7C8&a||%euK^q|AI812(F{TzsZvgqBijl)&&@-zNG4o{TnJb7km@&{lg3 zmM24lXsnx=m2)UmOiO|Ota|DFCIs(qL6CZ=c@Cuiv|HSSW)u!F=r328lSg-x!CB$- z(i*VdR<+VCaJuDS;n2e&F?wx(kvR^jKAqoe;NY&9SYVOqkIlfPr_(G*5MXGK|D*-+ zJJB4EKNy=%mFwUQVAW~;+w<+ch^~hmLfzJ5v9!R$y!HL6!!usjm^5CTlYQwKF?%pd zOUy4isuzPWYnq=2SxMEV0KsZa;w(f@h!+C*pE3Zdrp=qS5 zsm(KNUU5a>(!`NVb$f1a=y=a$Mpz@6T8;1dio^7!x8+W}Z|jT||FJe!Gv9;tt$bY# zd>|{ixxI%icM9Z{Vm;8_Jk;nV7=Ep0bSHx=H!7Md&uFh5^3dKFNDqbb3+=eBDxqZBoSK9lVJ98-*4No-n8Re@4;$RYO8b0;tdzBGV@G?Pef7j6IP20 zN0zCSs$>=|Gr+>og)lZQ_e;j$?z0zj>Voz!Q891}$p}AEPtewR2=XB5u0LO>H z23*P|rh(GNZzcjhW7;rHI5G_ zev&d5ekCRRZ8yOPy^8(pL)|%1a**=*EaQ6ps*_&W7*O8aBe}&TXp7X!!E@Syk`k{t zM?Xh*wsQsfNW?H!iJ=#1#4Zx`UQ`PMyDsy!kNB#@=yJ+O+4#u8fo8ZiPiR`4Er3Z* zT&1sd0sfFwJ^Z;OV+I|u;)yiSZ1U7DNCaT|P(-3Di0>mB7ZrA8@}CG1R<=zL$*@D* z1EmBE9B?6qdu)RUwlTJ_w~$4xA^}ic`t1+cwx+Oebx# z9ftx352nVjo!DO(2o^r$i^9_Vf6wck^7Hp&U z48IWN1yP^Ga;cHDu9~ECY=#*Noe32dpM`@w_a*5jIo34;-&cv3W%A3ynO^UqpV7WOOR$O~7bT$m~ z4h3)w0!}6x@gS7_*7HEc#jG4Te|#6hXHcj59$bCq?)T)zH9L(=aFl z!{t)(nKHIaFp*H$^bDUo!Mujf17(D?&nj~yfrgRtp5mD@MrLjny=7UA3R(!ny=CFE z4wfq{HY8{&8b4RGi@5=UUWLhqWvTD7a~S7pFdxYPp~}fi=TfvfcnfamY2KuP8^FHGRkBFZf7wgFgjP7@Se2QDL$A3awWDVEw7uIpboTP;q4E`g99d_ex8K~>EM2}XBMeOJ&~ zb`issJG#CGzRzOsdE!IsQ?u zP#`=Nn7q_4|9L9<@}K6s>wCV58A@@x<4(M+!k3Pny$bta#vGddajYkND7_Vbx-6Vs z{5yW>k#n4qva*`UwAZgG|1#h5W#HZkolJ`m%dq5}r%itn)6k^1(1Vxu(|5IaD|$*{ zZqNs>LB@@7jSeHD#wh*_aA%oE4=&aq)cVV4CFkxiJJH%c+CL46?(lr6=^TnH_q$E?PFO+MUXwE3qHd>SluNbyVN&S3C{ui#vtSm z{V9de)L!fN@Aeg2b>{n&Im>bh+AxF%w+Apz1kpZ%fKb$G1ThXF$$}zw@Xaac1ww#e z7PtDR1Jh}TeR16l9Imgg6wK|Z7@U_(Um|0fxL{1p+SjBjxX}_ZxsQ{k_#{p#mdBU~ zzR9$1a<@PWR-5-~+om+tc5P{Uwr>aa)0*=h&vj!i2A6C>S%PF@ah``>JXzkms-D8?UQGq!}t|4JwH} z54D8ai--~^T1O@bB1%VLMvhJhXBaAmD|V<`CMZD~CPrfF^eMX|iCU={ystIM16KdZIItF>WzF$SY|^)5z6- zkFz&>RF~B&aKETjJ`x*rm36Emfyb6JMa&aIG)Ud?5&qH5x$(I!1=sDX_~d3T^7qtE z-+ij#b;Tk9xB&os?R%{AL6a)9((m}=8{p4)*r;>!c+6qN<7a+u^#1G**{=rN&0Ago z&@Y1cb|Gm0;^;BN0*KnLA2aA@euK%vCpoY5RvIUK{1x#8PqjG3NgJav{(||k&qJM% z-dOAtSonhMYN7H}a(1tXZFY`62Zb$)-izmQUzI`ta9e;=+OdzQZ#z7)@(%YiW*_5< zsD|Rzk+HiBbHG?4w--HP;v`kaSOK0MVbhh00$R+7n8>7HetknI(E@+ zq1fu+n{tdnitN=d&7ieRD*k*=enZ{}(mQluHY?&N;I_Fy(?|HE;l>wlJ zZtsGDUs1BUz|)2_QSFENZli+k zOX^1zH}O^|Koa7ab1ErAB#c_YG|<%?mRWY!4Sst0u^=7TsMn0T>^?7r@>zRg&qEZ$ zOgaYdSXYHn6!cENq@)L$4HKZNOBe7m=3aZN%3*UJ_Z_lPy8OARM5b?l-}j!td^`?1 zC7t?V=QK*IIrBHObO%|is`ouC&h2lnRx|{}z1~1>4%xHeAz&+Dgy_|Tma=KNyTd4Q zE}DwB8;f;Wa`(Bk3h~!A915fu$(CV+MnGnQ*)4OYyeRze7)TiLVR*OKtbB-2vP*&y zpfoZPb3>3=)jv-$<&bHrH+u5Sgsd`=-youqa93vjJd0NXzbiG?nq2jhUw=2)X!Qb( zN1`RFNtZpWQvUg8g{R3L)6a8Tsz)t|=>D7?M~!sC>Fm36B_~wu!fqYSHR5!c zL^3AQy9FX1+{bG+s>6@ryrGu0yP%&EvVfMjvpA*Uil9wc3y`KG<^D+<-@GVqH!oM!65M~p5tD|L-Ks;wBl24 zNVyKHO~N1I>jn=;ikK@TX=qlTY zXR3Lnbtejcb!ehMRKcp9*k6?reU@BKiT&Qx9N-kBrXXzW9Ur=+WMZGoVjX}f3z&Nb z7Y_eOen$K9eK>hE5}C-ad?oF5}^r?gPJME=0kCq| z7^T6uLgeo;#W`1|NAdazjTP{qs}pp&f+*z^+@INDgJs1#Size>+CX|ugp`p35W7|T z`~ys>cmiJfhX4yxDpe7QQP=evz=&ADCRWJ$j@-eGzC{HRFs0lee8gg@L2szmA(z}s zzOzR1Y-peRZm%alcH-Y}G+WQI0-(gzq9amiF27Z!K1hn%QqLC73$Jhw#DyfzPP6hn z`@$BPq>4#fJoth4ooG0xfHG2Hn9%Wne{Ct_Sq6XF*A|s+0`>S;SJy^wQr7Mm(+~Jp z?Z6e=U|g!*&Rw-cjzc5%ii)MNYIZkh@i+3~#6t6QNb%8?i#ig^)+t7sgrkFz#yG9v zyuTuc;%g}Bu67U-Qj({>BgJH$VGEQZ;fzPkOM{2p?fZ@sj)WXz(LbTA5L2f=qgP<7 zFpHt6`@&THz+!r8(vU(i>Rlj!!DyjOTPDSwU2PpqmjoxrH`rdGckjJZS!L1{gvxH> zx^8YDb+;B^&Jfv8TIM@I-jwnSOwYt?o9*XE=XOA2ROen)jXCnorT^?7G3}K%JQ}LTKhk-EA^&x$*lxYe<#U>gc&gGvodu z2ykP>cqdJkw#R72_{}Vl>vliZXM$m`CIp)*#Rl5mH(S&A_x6rhT)9-9lE)MF=pD!4 zerQe}^Ll>i=9RD)^N>WXnB;jIZAmJ*HPIgyew8sq9o73KACn2c2UEMb9ECpRXv~&U zvlkB=j0AYd>+j#ay`3;TY7F)r)^TmB#PD+Xo0H50{V`;0j4J6?(yXpLb#rTB1+B73 z(#cAE(2?j}u7>3HBKtB`QM+isF#~?17;a;#I%E`Fn@};@QEiVvpSN8_f}B5xX@uJi z6kSd6oyid&BNA~RaKi-$R)f18$*mw5=yKnK^hyS zZbIOmmj(tylI^tcIWRTprs(yw9j>UnQ%0qa6bE;7|MYbz_odDWN?=vSfXJdW_$`Mt zqfwR(!fdTR33L|!q5yM)1n{NNoC$s4#->bSajgxlc}8Ckij@|X6x#T`{0ZAtH#ntU z4b;rk&a~^QH8ziSLCV(PraX_7xIY!x1Bvpe?0N)(F?Sk-J>iBg%uI(tpeO5oa&7*M zG}M$b4~gWEI$0>Jet;+2=DxAprNpxLq?SrbCa_8s2HIH0x;YIOy-s}uTMOK{W*MQx zY$TvxB&h&XJY_~~_GJG--}1i8@4e0v5Ju%;2ErVK%<}05;eAPjF(CT=)?bUt|-J9W|-%;V{H} zMSCPH#ZSS^%2Dbh)07G2v<|sF&eF5v%XH{0!tnPxV z(SCnD%h(O=u6*7gb$0U%9{5p9(=x*aFF+$hmh;Be_rzX7{9_T74{@RLZDyBSHxQ%Z z%pCe-dGY;>r*8_+D8(@VSty=P6ck!*reD?cmi9dSWEp_IT$W&;t7D*^1=GT@C?0@+ z-bA}oz+&GOkvu?GvE0|7QhQDHIlg3*P3UX?BQo%`jS$izs(qr~GXUWDN@LYF%z*%B zEx>0FD=$;L^KGkTd3k=+CQ--5Tv*SNG;H*eWB~wG(z~HBy-2l{tqsES=T0wD4N00^~7U_@JGu-{fH#lh}l zTJC{F5R-Z(MqqT$@T~x-B5zn7 zIwY-@FE1!ELZD)ec5Mny?hG$q^5qcinXXb292K_qjn`;qMe;UstmXR}3PeF{YZA!^ zP6!A_^-_xFF}r&AK~Kh~dttWPZaaXdlTb2pZ?5SpcFf+l_uL&R``vUtFcmoO_S8680CvI!GypEmz zH8y-({a0psB9Tg`y0jISJ^RL+q_L$B1}}E|&mA+-$Gygl9sU+%OXmQHRf=c~E) zQ9xI9BqMAR4?8}>ju|dO-3wV(inQy}TGE(T+~+;!`{p}UYrWPmgJartxH;tU*jKVp zO&kJO!JQ1Wurp=lTzc4{{7c2^$~1?spdPC~fG z1!IgqiwAN<^E5BW6~q-;Ojpp%&n=a9XYUzdpEm3;c~(hhAh6kOplKFNcRX`ac9B-I ztiwo&4hW#Kt;b)4OdVgJ{^Z3u=SfwGN-q_lrxkJ2f7luyEmkUfyUe&b0u9EspkcX!d+xM!QvtKaxsfq0=dkIo z#r|)EXAyhQ3LF)bl-3WO5vOewT=>_0azx>jj<-!KgP|JszYs4|PgsV}levDav#zV2 zY!R3sXPzvq`9}CWZEuL{Z7?JzoFH}EV%564Tb@Yy^cOdxa?$LPXB5en*t>K?moM|T zsp-_w@UH0R77)H4pYDgfO4ZP1?&yRyEX$YG%%-yxN7Ja?mPmyL;#f%wQU@WqP)ZlM z2U3vs>`ynpBU^u0yud!8uP5IhO?}Y6&k-|v{1AnvD1mM!N3GCGRiOP+t`w`)$MQ`m zP)R)zLjii3Plk=V$>u{%Zb0E-ni#9xDLPpZ+?PEhUwbc1Dm6(aHAgewsYbEb zJBGXP6tr*iKn>9@sA;Y+ypSl=sK*tGvxdPVs{=+Lc#8JSVW{rZcsC-}52gkxjzR6H z&7ptAL3ainco5eF9?An7FN0w<3E(W88AzqYD&sokhxxP|9We{jFmEp0qx%!;OfDi! zGa#2O8L>C>bN9piYvqGhUn9zSt&)my?Rc;8XW(JFivr`af) zv59};ynt#sdze^MSgS(cfS4a2NyjkV5>dm#i z#S)A?%h|3P6LOwc+PbW%(K3uR_%h6eQ$rZ$mg93|G)|L>n_3jMpd?o9DXvi11lUoD zKjmBcVJD7|97cUj4-%STn{vr?HeY*Kl#!b)QF+UPH8xuA4D~Io^$XV16PKdV-qO*& z3C057^EaN(Db%pkHHB6KKJaj3TNiC>t^<`0)9R5p8zv6NnzC=^RfTYI4JYO~Um_vE zjmP-v%h|>p34Dzt8B6KW9M7dFn`Gl8(q)X#4>1=VVl7VWBq)ojfS=i`)0KNU!iDsC z;Z}^{1f{U^Gpm{xDWZ~!&B>lC+v~#3z4PfPPnq*Clg>W9vmQMhx6AN!=gNiOy6WSt z&^Krf(;;elljD`~1UE}cgCd>xcy^etW0DMc;YQ;$W5yoN#+D8{Nd|Zh2@g3$;gsHIDt6$SU zou+Q)&u+<4HSYntJS)+MZ%8j!{zBn4F#bh{vN0?&&`Kz{QfK(GHuB|^+shVY-4_gr zT8)GT^#EjE!}I(;x|lohTl(rYi(OUr!^Agw=Y4Vv8?tv>jq?SlFJDd%^wZ^1_%e{v zm8L969{aZrL&fMKH;`^2#OM-vV$d31_+zV>1o@Lv@3dBA1*5sZ;{36>TsQRG)`r?Io9_Ek( zfM$!OaXfFN#}lyvtbeoOh8G5LdKEVQsu2v3#kkQKcxQfS|9a^D+zBY5Z#%kQS8*j& zS%C_*9@JfHZ)ybwODM9%$Qh!!ye~rBfEZk9NTm+Nun*`s>4`J8-@Opj4$!y~;X%OE zA4jZB+ASU4_ueUo+0*Pu+x1*ku7j5()+i`QRBg=zObWU}tS!IKR#@Pil{O>sK95MT zG?$W*%>H#Q~4R zeKZu)2^sCI8Wc-6=_Zgvi{crJve5wvQDsTipmO-&2RjZu4I|li7`pj-_BUD$H*tva z=IK;^-%v-sE;y~fIB;gA6KyZRBb$0#d3LTS16FIMK7$ojnG+mNSL+jI?b@M?E;vjs zg9+Ts6xWZtdgW?O@#10jmIFm}Q~k&USZVJ_wpA|wJ*Fh3u1qdaTuKk7hrhXkO)(vV zUm%^i3QvXvuhCICpNGYPSxrs$;{D+Y#37oAD$_&s_fJ;YAE+6pWDZ{N5+1$Qg61|L z)DsTZMoZ+Lh6*Ev%#BfA8}2gh(pg+E3M8lCRRFzTXqe`1MRSL&sUZuKuS_Brt6C{2 zM?>J*Wv`x~xyMUbRaBOmv3T^3Q)cTfEY=2-VY8Ar?bN@d(g9FR9qQU@w!0cCESaY3 zu#SIvv|}AzvJGe+ZzGCu#+}Q=W`lTbGt0dtq%q3i;i>aWES7I*9(PSUr-f(%kH5YqI-m0v4wz31*Lo z4lK-SH=3L!?g2W425iOvQg1ADFBobd8fGtC!ti|}%Ii&c?*J7F-@0qV@u3ZPGun&i zl@s63px+MJ*3Rw4`1atZ&aaqRC)B3+h|tKk6j)AxjvCOi zs+%ETie*NP_<(NJ=$k~J#OQL9|HabPGibuJNypADbZYY=3EZEA1rk1pJdTC~IpkAXA`O7o)SQIK3l@ zTB8^}$*=fcw0{G9vt_n;vEFvDeJ=v*+b(SQYmQBK(IivJX_wvx+kx}{_5_%5<4oP$ z)K|aG!vT*)6aXx^crFVMc(|BJ4Ua$oF1no$rFsbmU(k@Ta|@|94X2u`&wp4L8dZ`b zX);&JeoHoSuc6TAGh$`34jEW zoaQygMjN-)uNeMyO8pWiuA+J5wD~KZ7xuAVVZ@Gh@2|-~cT-5RGYlZ)Q_z=Xe!5;8j|7^WEuB#-b8*$> zo!~zwx&qIWVTd2zfG?E$2Lh3cNA{0z{7Gt3n`4>(Z_(2X19-gwXZ;w;^b!(1q~FNV z9Xwv5NX5zpI`Mx*($>N14wOG?R4%Sk9Oh`vA8eN@RH>AGepadEz>@J1yL|NE<@*I9 z!0#Z65WpuxyCeiCU}yGj9)n4wsq}|v%;{|ZYqyQx2B6+~`gQ#89gPAIV+l0o5mn>p zb!sD#`vY)aR4K;^S9GGNK%Qj z#*MRtN~xKxp~X0V9RSL(|7n8XzGr8ZMg$EJ_$w1|0HnC0tZztYGl0BAh9sEblxpev zc^ajh&$E_{IR2n=so&EF7P66RrlNWDoO}C)(G*aq{KUiW7B-+~1=ci{$~*RdkEII$ zi1rE|*YTmHNmMNnu|ug*WliCer7T!6gVQT$;shFjv~@OM#$S)bNH_{6yGKE8jc^C!>$=7<6>y<+Ce z>>uoWp+IcfaMBODU)~!QlJe%m$ov2f_~->EL4ZUas}4c72t_=t#4pi*5cNf;1c=a+=C*Do^Q2k*@!L%C8F41$vF8LXMP*JHK~}T~ERS_@%-5 zcq!}0Adm9IH2=$7X%j*XG&~%~`3+kGR7zb{&P5i+c}GEE*ta~g^=&le@2y&Waf>~4 zo9}t5Z^8azCI&}BR!c+iM_!Mk^w20xGB6L9+0RuG_gfi!u@fHKb@LN2{H>1+|9(gc zY|hwTSa%WT>Wb<9Y0osT_zpK}R8dUgKb{iD)& zS|yZf0+!|!(o`Mc*MI#4@jt=(?=<+gYTI89ocWgXUB7s4cGq9jX7#wBDpSOk{*;OsYmUg;r4ASz6tmi7T&- z8Iuj3-7=$|`fJ`X7{8>n4p$<-U z+F^|>{Rc|<%S~6h>5h<%b*C9qu9^FA$s$MkgPha|fg@X)lB}$cdZNRdjo-P3vu?6< zAJR)}XXh+p5v;Y}K1|_wq-9D_?OZ7B)wa{eeS0uaxutmT%r?jmvxpJdew_DBNKe(& zHAve%h@RyQM_~ZO``MeeX*Hr&(oj96T;_u^vq`mqR-m>flRw>!&Z!&0_zJO|d4Uf6RIU|fSU*?*0+yY0CB|NQ;5H%k>anG(D>!K%>Xw~ znu;&w10*y4YMx*-+J5`L5Bt4mnzM)1jCT@1U~@%hPq}#&~>fB005(? zAc$YZtD`K6Nbr!|{Za_8aG?27xpf74#sek@Tkt+^MsP(llNl9~bX8cWWnw^6HDa*-=7lH)A{@r*0W-1iD zW?3FR{fmVjvQPn)*5NfHtUZc|VGOUG&BpFMRM5wlI4Oml0egcUR)VNR*dJ-7bQAS` z8&uKQgo(7v+prHDEsZ@Z%%ct8N+dd9G?z}}ur78Nh#ECD)q!uMzEW$su!D@!bk84| zf22O5#W%j_cCwwasyf%{nngO>XM0_duE3u0g~jaxs_^+Mye8F)legJ|#TNr@@D^Hr zTRxhO7M-b}yew29oOP&H~f3csEvMz}yqA-~ZBd|8LR4`ew_?u&z@P&VM?WullLT$N0uK!_X z{ZHE(Y99}F?^Zr97kfO8U&|^C+%*ct()v|yC+6rHR1rOGTy2}(e}>CdzBk|9Ob4Xt znAM4hBoW*o!}|1|b^~;D{uGPp4!5rRP@Spw{3}g+`j;i%LjTRmU^pDL9rNE-&dnSU zwPgLEieHVOKSHSs`wx&{47*JI_2Mr}3noYJ{=#kTZ+EhWfH^Foq6B2*kHEzJau^b5 z_eeqibXUw;=iB@=Ah>-(7y@o)~v!V0RLT<0UVwpe^c zj|P#BMk_bTRy+r*I?NS%)#_&f?BNqyU>Z($9l+aEZP2Hx={ zq0UE#urZaX+g|{F?y#FOe+PnV|F`AVtbQA})EQbqRXqAO_jiW^L7jZrUWQoC@|{%A zA^R%rKdfJO-CysE%3=)X)tY(4*sy?B*b+B2>mT}IrUf!jVK7ai=tRPY#Wg3L^MWci zrt6Y;Bw%x2`^(m$lS*ozCc$uvr6!~BTYi>>MZe|R!9}6lI#QOeP0?P#m-WUOP15 zS%fV6usbLEkL}xhG>EEy?&Rhb|14x)@$c2qUso?DMu@?}TH>a~lDL}m{sb`8t@UdQ zMiYu}qV{daKsw3@1akF9Ipn7#cr14~v36p2TMlt6L8LRK5Oj_I6z-}!DC@d71F=mh z1PEP|bbw`)2Z-@V&L!3sx&(hp;(HCEc*Rn3*gRI0zvfg!Ox0Yb$8gUx2JVVk{#yBd$CJ%%{C)zs1hom|cXPjUZd#uji_3+=_<6KuTtB&KpnFl|YBRET*5G$%RAl$8d$rrz-8!?S<-rG>XGb zqH=^yq7(=MPM`n~CliYzq!A|1TEBieV|4WRL#|m%uRH#*Wk03B?`+~?I{rhFj(b{J0c%l0!X5azHisB8GO*wn7|hx%RcJx%kn z&gh4djr>`>8~q>nR>l`>pIxZ-hg7(Up?IN;0sa0~&Xb!LSDuz5hd&RxC|2(QvZ2+zJN?~h^HpBy zW>47fWMTZvTYA1f#qvovPo8qq{v0$!?IM6Ag1V58QUST00;B~X2Rw~F{CBa_e^&wV z>wpbBj72u|A0>)w_!uImb;7bBS^79x5Mil9Tl%#g%z(;?u+o1ma z;5squ9{Spx;WXlRA9x4fQ;yTNrZ;A$L*yk|t#AOf)||e4zetJaX1FXkt-tsAdL3z* z9A>xm?9!55stoIt_nOAwp;v;Db566}L4#k7wWJPvQ|euTc(}I_F-svwe8O4*o(-Qh z3X7Y%%cfV_i`y>5+4Nf#B1!4D8e?KH`0s>L5*G^+-dfhD(?(#+>gm`i5hsCF6qQX( zclq&ai_9#@c(L2P<>cF?wZ5E2ESkpDWYB`s9RlJ>%7#XueG!{TtYK9qBcGI-jS3Fc z1!sK5R{ku3Lq-HzObEVk5N-+9CHP9`rAn3>oK}NsF*ixqnUnFCxC4nh8nv8YSGn&; zO5a%uM*`_tvy0pp`WGw8B-NbJIS1YlWGL-Xsq53^(~@NgM13J`RGzn{)rk`{vA_I~ z9W;8uKCcQnYisISdk!?wEvD*~ny9F(Ez{G)m+x~lB#qTfGk%byn%`>8WULRrBg=Do5-P7}4ZW}-~CO9~p#3NC6?lo|siu)|^qMJ_Lf zI?ki(jW(u!iKXvGAc3+9?OxC57MA5+V3~$52@R0JC{QCwY%VUP_&aO`(@QH_cOi6I z$f@m!5m3Du;1IW0&y^{rB~rkgSaIK>CcBU4xs0t15z!2TTyi-^fK_(f?ictF;2CTF zEcc3t<<+J7)dh?@{y;O)3S+NMAqf#LsK8!=R5P1h35dN-ufDi^`C`BP+(*B!>r0>6 zxb_Gp4xd(=GoSKXf_~8Nm=_lSHX|U8M(@$C$n}=;IfPAzDE#c=kZR zg)pZLY||6)|1(P$Gfqj0++7b|W>=(ZqDI1um~DpY!1qN6N3T@9& z9|wWQ4-AJ6TiPzO0>X>k&A#^Wp;Ac@**V&p8lg8Q?cE)a4H!-f?Ef4NP;%vI><#4H zFNVr(1AsENY4iJ{|NsC0|NsC0e|0hmb2if2BWc(6Iyesr(4>KsrwLC>IgW!KXl^0` z;b4xEGdlK&7-FaerR3U=1sRSmN0-qdW*(v1*)*SL7#1;1%e)dfxiWbqa^kA5l3}W! zb8XH|2%oV=2$yEU`U@9EmjqKTb?+uz;oH_?$i2wDN~)wvChr#7;`@FV!{!=WeQ3{( zS~(2EFo>KFKVlO3RwY#?FmxCrN7^H#NQ~6goI`oNUC!a(Axb83v zSRs0>Ty$_#$8Me)jm%Sr1SJm3-Cz={dZ*GsifY zTW%i`F7e$)@LlloUUgkAX;zoo7td5D{~g*y5|aMF(SJYc{sQh-#@8^HoH^0?|fA z)VJe(^l}f9prW^1c>Qe}}TMz&z25mpTruCk^oOtf;uZ;Pn-z+UfvVv)+kAj2* z%L>GCe)@DuyHe_o6sI831X3)E)=VpIh}LH2Ev#)MgpK2-ZBO_qX%z%n@xP;-QchGS&!@5}}ha%MJC**{g%oW942aD)h+9 zG$UZ%0tSkL1zwG|7TIs)1gSwgLdr*~smSy8$CHR+l{z^`zA_Vz^&2}>=vk?qpWDqi zDgY-W$`XH^&L28OL9gZ~eO1Cm=FFy9Y*xnygRm{55NOvFvBpE_(}2SFb+H`hpb(PtgYy*%2jNd@05zxeX~VvqUyri zot}EV3I<355+DlXr&njeURNPoOz@paxmNp=W)k@#h&RXHv8_0nANaL*yNzYbwhRsi zS6XoFPOV|2(XO@;u6*_1Esu}CQnmhdH_%88bR$F}kRZV<5frJhXwhR1y>w8R$@KVZ zRO_mdyh$5kxE%Jh*AP!XXVpJ#{gaRWdzz!G{{4Oy^>!(tC`v#?L=3GR(uCBr7ee~^ zyby>1NONSdR(_K7BfRv6AMWHfDCCI&Gfal+-G}b2eE`ru1G$=i7(A=|Skt~F71?@H zf!#2>dqcSK44)UJQYGbf*)b)l;CH7B-o;KnP23q|Gzq|THH$hKP;g|H12(9XI+&=AkC z2>oiWOYFX1RERVn+$Z-bwH|FJ?(J>jX^ufigh9v@oxwjk&?|dd`j|=j*SL1VmD(-`{n`Lfp!aoqajlh2vAa`|HhI# zpS}tUK%f8&=HE=M(*L{AVl^qwbdw?moZY(vWI<{69k@0X*Xpc|e6-PJzy9y)|9@3C zSk(ZC>TZIpZje$pC~B%3G}Qnpq0vnZ08+OkWFASGu};)FSKT0`1}JhGfD8yo8VWK; zk>f;-lh#ohuUl_8I^&$)Mf)zhY%ja;!V52yS!=Tk;tS#p;)|jSav$0JqI|RTc)qnz z`=2ybfV-Ljxmyh^ZDYAUsN=rD0cnfWaowTqAdynvp+iTZL)rgYmeOsh_9W<# z*_Dw1GB-s%?{&|gKYw~x7wdLM>xdMhGwYtY^M*S)1>`aTE^cT*nGNmtnwl+vk5M2+ z=g|3@Zg7>I*}Cee#eyRd3+bLnD$yYa=+0qQ)zZ~n=UDW1=gwVWzjXGtENEv0A33Jp zZYs|&T~^CmiEsxO!6Buh;?6M=J^9N_wfbGh&#cJ4DBm>15zp~RhLwRK$OtlrCX$^N z1i=d)h)-nTfoU4&Z~i~*o+Hg38*~}N#6)a8Kim1?mn*v@ZJRk>2x02_gb_vvRj97d z7}tc^-Mjnv>0?X>c(St=t`hyV4BgYeKtias>KQ9gpb)q{|Coc!Wermtx2y+dNCHXN z%9i@Ia73eRb*#N&i5V{M$8yb-YAGh2Ne|XhHI3j)LY( zjQG^BsMRc0wgRQ9)N9tJ%S!{sO!{QbvJDjb{yGg;Ciy&QM08wYN)b%RnE0er3<{O0 zQm++`B{TU_br7S2djbfAv8sWEB|;4T>XE;mYuP+f3APmmHK1+RfkKyVWbRB3u& zJilPr$3rStkD%@gDsI7gXVxi|(CwOHa&jA7&S3C8XWnLCoY$BTFrt{&6Y7=5}!t!YV zD0h%q2p%=JsHO!WLC6$}V1d7{f7`u$7sLgX85qUw;}F*#fDZ-z*?o)N1qR*Q3qxUb zX91VKyW*JMy9-#eu=f=1rQe&A&+@pB=K-Ag9uH&))CVGjiwqo<^v8KVz>oO=Pl;lH z_rSj(4+vib>HlH!R;B7xKM;Hcp9p|tH3GaikA$e_TqfWl?t_~U4Wvt}3_}>xnKU#W zSfGj@&<W@R8rJcG*C2Ew4ySoYHB%kfZ9qOrA|?2X`Co-lrTyXC4-Vjp;1_r z5=s@NfwH9WXlhzF9f1}{E21%Ib+j=$lHN=2q>s`k=*#H4=r`yO7#@r`MjC^{C}UJH zhZqfvHpUS~BV&+p2a8bxY$GKmJC9w;xr|@NKf$x{d-(4v<-B9OJ(b@Cz}F;13!GGC zToM++9&Yf2AODA#B4&xjV`vl{^JSj#e~{b%PdWp(uzC}Dn*Z}7e;TpHv@*G8Ouxj9 zazmZN`TXO~Vx!NKe@`9?Ri0|qtmo>}sNQQTS&}!=>5%T3@xVkO?UcKx%1+fR+X7p~e^b8t=k^;4rj<3Uan-QV?sqU3 z&EkIUx6!CKFJD`Rzb?IRihwHeoK;g%U(ra>{Nt8UEz}|E8S2CtFqAk-S|E72G=Ya! z3nh!;(PT80UPAAuUwrE3(YMeW3j+opMhYW`!9j|znNjX-VcZ6|1@)9nm00WoVQIl# z{8yDSUbFD4E=sUQ6@JzdVWrS2tcU1@gZ9dvqo12|u6C}V)cE^?oE`m_iFwrn?sd02 z-0n6%@ng5R(ez#>zZz>Y1O)-77lc5!xeu-Cp`7V4UaBJkakA{~qAXnh*!4E@VlO35XV zt&C+Ted$VDs`9h^cslHN+d5BU-!*lW#F|;N*9COs}-Q3ia|*6VOy7} zFS9t(6dJv2Ey&L`Xw_mNpH0GsbuoT{ePu_sX94r+OLR~Frb;TIY&?Vs{3PaK7J84) z=rKfvH(&%k=t2kF0s_DTw5PeAsK@IbHMohnUqZ&-#vCyvumRu8;kmHr6I-}RmwP&| zgS6jljYh<<8xhaCmRUNH8HqrWx6?&AFq-ygHM9 z_^`;pmx9s3_76bR+doLKlaeGmtyYURXLTCTYuE)-rcJwS(X6YknRmlYi|+WDp#9|qDuZ=cMQjel6b9@RC}gi#F-K*}IjK;=MU^V98Z>ir+-Y9g zv}5ViDcCvZgy_{L)PPChrp-uk&8?&rY_(y3l6^>=Fwlb!zg}X*^phZIfIOu0)M&U! zi;+<#e9Q|HiY;A+9a*yMDpBH<7UN!<%%uw8E;48`f*>jC6lt-e!&NX>5i*6yc3hek zEgGEGrcu8E#|*jPgfWv^&6st@va8NoaZ86sp6bT-(xBJ&jCk*>2|xVI<)VP5h?^%x z-Xn_4ZLy492Xb-bL4X%8a6Wt>`0*nqKn`*FMv#qJ6lvLg8P;to_0$KIKKbIbZ~o=% zrUEPh=pzDSj1na)H0ioQpMeLAm|ADf$_5)Yo(T|uEkUB^QdHYktJObeGTM`%CQLz@ zH5=@qal!x&H*QK`gyD&kL?BIuI(hOmp`mHP!qTQh2@!!R5)B$CELqaw$cZi&0rVYq zm_=%vjtH~q;>6t`NzqLh80+xVJw#?~3st1oVsoT}L{;ge<)TqmCQPt1Z<)PY?sBo= z4No6@NJKF}Gk8SeBQAjyX}RQ}8Z_dt$M~=$z>zGZ0BCq24yzWW)=>$1^-A)?&m_O!EkT8( z_U9-gVd4$oD!q;XPR=r2!{)P7v%qvChc@}B=AH|&fSzuJfn3?x{UGQUFwvqzj{&1| zm@s1jhY$t{1q}lW2akY=gp7iUhK_-Wg^h!YhfhFAL`*_TMovLVMNK1|RsNRTcK$AzB zwRr4_R&Ac@@Jy#JJ-WU0!Yi-u5upr>3hpscb_!PXmes8AlSaDo_l&SlhWT2Xt>|;(CW65p@JF?49|yw;pA|1c%%2*OZ|xe zjO!2AhKZ?p!VjaO@4n&Z;k*>tlI6&hD^I>ViWCEGRq37z2Q9SWm7lN{-XheVs216L zA_~afVc3hB*ocM`MsNwz!}(&&)_x14%)iO`5;r}(YP}2X1%Ue`YxP{CQZKbR49;4E zVMS&oXm)QpdmXK0H~{2k ztya`Ica?$XsKC9x+@74!ul=Nrv_Z3FHG&G*qeNacLfhn($QMHfzxsgfyh-&-Fs$4aV5L?&meOnnu7iml!l=zDG$XC}JTIOP=oBI@SilEk5DomV$~4FHiY&iC0jG4}7ugT6NP1{fI>*`pg-Zc9E5KXPO9P_Qu^ z+3zb-p2fP}?f5mz*P+3{`4qp`_~!SD|7N3#8DSRf2F%N*^5^%|o1kgS4mrAC(VDQ{ z>XWp^4)LOgA0`vuhnJAaRU3q!JOgLBC)qoDt)?=(oJnLMf+)fhzq=;PaBp_>>gbv{ zl_VYnuCa5l-^;1`(-%W$#kS>;M0mzQ+E}cUQhR1lnHK_U1Cz>d2&UYGS$I;MH-%|+ z1r`+!@~YR? zyUz6EHY{NsLk{7v?SFYXZ0Eob=U+Y44pUM^-PF<`F807%A@sVU_2M(0bgGk9gP!d! zV#FDD`m~IF%DUHd|N8o4A0_*`5%+vjJ7WLPeAxzHrONzqNbmkU0$dHg<`HR9pk z?;H%n!Q{G;(l_(06o3$dfjQ3JqPy}e5mADN3?Hc$w1z@fw1^DWa*ZX3T}P#SJHrIp zum~{nz5yT*z^wQwi*dnq9j&wNnf^3+i0DIink=523(KI_xFb(APD$&=zH>uWPB-eMEFfE}XKeT)e0 zHzU5pgL@kO^L5e$OLu?&?Vn<|9e($_&%eLg{eSx7-@f`Ce24R2f}Q`+ue|s8-~Z*$ ze?D)V;y3wnu;JnCZc7%L^^$ zSHH450zMx@IE2u08v2{!HBKEb=H4uCF|Ia42ppkzVUoYNJ>4iWtwevxt&v}!6%BgW zwDwv9IJ>Onm<7zN8Qt~F!Laiwr6vuPG1$6q34}S@gR-kXInJG9wE6rb^?NwJ!vuQy zx&G}cKwP-Lyo5Z)U-kCWEmc)rOa}3@O#@z*grk{(0{|~TOpsDf2nMxBMBO1mjX;wl z0DAbmr@9b+_Osw~&L-pSb{cg1-?GKPyk3EdZQtJt2m}LE3#F>cRjQokB@sL2V=Uzh zpkL^Dz`(V#X$%T48PiDPxPg%*iD;Qb2_cuV3MCW?A#mM1M*(~1V!o=NT=GGIDvj(| z%*_a6xG-lam1>%tJ^+~GIE^I273oxbpQi640zQJF_3}FbbP58U3Y`UU0AT@7or#`Q1OYnkTSH0f~&C9X7e$c1ychcna8lPD zj%EVi?W&T}__9!XiPw_r5xT-~1w+OZ)a_+NsHCXGN%60MKa>abbeUvORK>ka1Q8Ka z5CRawV-^C0xvi6iDlyFpq+YG$P*od&dnCwm8U&&htC7p0xkZqXusFY#-6%KwY+3f; zE$-knS~g=$$puF+8RCCd$V0u;T6j%bs7XOfGO}U`QdZIq7LK$HvhKylGm<$Xktyum zjy%PnoS|b#)Hu=5@lP?J1j$I;!x0!X8)HDs_ZVaG`0Iy{+EPSB*UVKKMxVXYAuZ5uco%UKBn31M78SY3Yo zAuDTJ%OR<~LSUsFu1{9z-euD}%CMgl2UNDlPx`ZQV?Elk9_;-$tvL=wS3f@#nf2GJ z3d?SQT3LC6QqY1Bfe(|beYRLZgg6yMT4f50dr(p++q<%}oxs=Q5PQ8fNqrCddaCx@ z_9D2!jp#Iy)-)m9?b+Chwp$-TO@8bhLrO47Qm1NlDKu{7x`~XS9sL3#Vhh_<9bq_; zi9p#&c#5`ggfv8+049*aEX8N>be4fp7s-ax`I|0fsgl|2K`CA9v9i*1K;;w%0Cmvt zm##prC9_G)bhJp)ROwRh3(PR>_(j9TxxR|&vfmZcxW{)3<;P zkVzsKw*-~eL?%O?=0W1a@tRQbTrz|AP2dp#8Mb0II2{gR1vMu;Trp!W9mrB9;UthX zGx##h_K%g#SS!8d1y9{>Uy}r2%4STLD6;MXTP0DJ&>taEKgB5VlXnx>&&dQE#oiur z8I!;CUBG*L3cAzpjeVg?f&N9WwAh|mC2+uHTp4DcH7H*+p6P2Yh+*YUmKoU!GbbVu z1|@vDB9;}YDQ0cba!iPHbxJ)Ud4Gi2a054?2=O)R_m7EEE_o&M5uB-?&ouZHq+}M7 zOA*TM{%+I~Z=Y{Jk?hJ^R$^NuB2Uz-b>AG=k;ZD(hE||q^)Q2ZBCiEhv;(Z1{Kc`n znxX>$G7*JSqk~6-uVF`2aKvZ$d!u!1sjAm~nyhdmQFde|OOc78JdG0JJFQfrbtTl( zG$=WN`Lz2>Ddg=+bX6h%Wf>$WZ{=Zy<1X*IP*#4j6t$1|1gE*dO`fwE=cS{1lUGr9 zg9N_q@Qye{d${*2q=*`K1pcV$Wn%kTaTcwQjB2YHo7}(ZW(?krFe4W2?Y(r4K#{iH z<_u*yi;8oght^X4pD>HKUqf;r#v|>B%+D8sq-B;HO2tc1 z0xMph3ImAxp?iEh(TA5!E+a9b_IG{F$g4CbI%Yc?s+BE zW$WxoSoZ@F+X-UE6e|xc`psx%uLiv;JC%$Pg$;_^oi`b^{6Lj5QJuVVSIE*)C*^vc z1NPoFySu}4G-Ajy+D zT?XAPLxHr5!DWp4%U~^CRI7x5N8X~5iAiY;Exn;~KJWA~%pjlLuJOYG7 zXTN$qGHg}LnWHx5!fxVVVI?Mx&uc4Fy&%#MU5h5X_GCHIcnp*Q0)(BR9W;j%6x?RXuyZ5)t zkRUjwc1uCldu}p2ME*%~z@pP4Xta~bNVuf#ZBO;~@{!K`>+Pt5`z6x&^OAio>Vwij zE2b)LJ`dUQ7W$Et!(Ib?7I?tAT*k+4sF#*?Y)~-**|l(HXi-kT$T$h4Kj_4g;BpEv z!$k^*KL{>M9ny2)esa}^T{u)FUo~{}Qjo&ix!p%)X!)bFJWFw+B#V}t(2G#U$YECx39I&Np{uQOA!f*4r7uV$l9T?b zUlXfK#8b#i(VZdLKg5EP*u4Mf9Y>&U6g6&k=GsaY1q?gT1f}!VCl;(P9~3tj>(~X@ zsfEi^Fa14aj^_`!1@XLM=6JucIJ8M|}z^<^8Y%AXhhKdnOXm12m|O`g&Yj zS_xV)Zfn6w)BjKA64X?Sk*KI6dTrPRUK{}y{u@O5$}wHZ9|UZq6jt8wP5A|y@}Th7A}5H&b!wEmkkn zDZ$grfW%WxVVj?k?jQx^U-^SA_D;z$I$s@$z6;@5IycE$j7_TjvMN8~N7?>g>wGq* zpeg1gUW(KL#U{>T7gfoM_Y)IiW0^_rL2_5YM#zxrb(2{nQg|gZiseYQsGL;9%tYBy zAb?alx0U=}J-{n$6y<>#VCx3kHPh=m%w{BVCwklzztmO8aoiE8pgPJ$m7F^Y!NlU= zdkAtyux4iQdB}scriAyin(2!7=`IVtlVFr)U-i&&Tf@`%3XPShkQzY-;F+ppHrQnG z%n;g>ksk@-CXCI+ushOhsX3cLdsivbewRI z*d|0luP#C`%#3u?I|9ariHXWVCo}e`rp7)fY$HeN2p1kg`5c(^>NM%BOU)|ZJAlAa zaeSQ<|GD|D8eqK_H%nI>6dC1pb)2f{mpL)oZi7V!QDxsD{iqu$4IC0KVZMxWD|`T( zR7OzYO+RY||6oTl>om`Gf~|c^qcZNx5EdmpVTDD2Q`EK3BbZJV=Fjwl{L?5*O{5l( zh?6LRoWHJnV~PnL>z~UQ`MKJ$WQF;M!e9Nc4s*Ys{8;69f!zh#uvTMM4`?9DskrxQ z7z@xTHN8U*l@hhm>wiIZk%1o1Xju|T9n&^4@`?0U)zNv1sfln5yS>q$wTHVV3YM6X zO$N^hzJ@XLaf_m64qeP98Rq;^_(!I=VhagMs#iQvh1&O?V*p;$o}h`7yO`%f_9Sr+4HdsY&8fU*Um1a3rh3`}JbMv*O^Gl1CC6W4a& z7sRbHWs8cFlUSL##(v;Z3Js^A^&j#O=?A6tAfZYhhH25Ec7eCV*n?>6&qom)t9AE{ zKl$mA7}<8XD9Cd~F~oKlWd-hQ*rK$YN>W44;--phf-3&EU@%|E5G&{|zX;l!dmrEF zv{}msFe=R(b4L?#_cBdxvBFIvDKrwt>RgC54^|x!h-DAdOVg4Q0JFw0y}Pp^_!;#5 z{Zvj~KdBWm1IvrA6gw>oszwJrM)`+v(E_>)2eHGTHa@ zDGeJ(E5JGmf0O2n$s6|pJqZV{N$dgewS24P8)ByPgF@T(0_mm%wE2HNJ@c6B(d39YgW<^ z^$H8Ndx{|NmU5;S4~w_?F8O(AeJ1K_`t716I0<;q*m8_q&boNPEL>FPI;APgq8>Io z@CB~4Mju;~wlqXU%sry92q|NkfioM-+X)T&bPRG`OPyx(FicEL#wSI{hs!uK1+qmM z9(B>i*)mc!OVir1B{aVE0U=FCZoXZuISt2*=CKt?6aeJSv7e*w*&X(@Y@4lY-^uDv za?0B2=DnWX4>p}(^L;a=w-tv`?t&tRigAq?HlV7RDDfCElcUxjiFSDd!#1$w@aoW_ zc)r9i4--tT^;@PmCP=pev7+m==w`BHJc2*U)bl1deV4RfuJ%g5tV>hspj|u1+icvF z!0DKp+?fja=m#)h`zAI|IUb^PAGG9)_aCfdqf>KFi~))a4CPdyhc!iJS~Z)7gv4g_ zqIf{2)7HD-0xelln%g3A+Ko$JM%;xgXWok=g>b)DqbAa2WHnQ%HOr_<8`0FM{sB^5 zY@EOrby3Ue$OtfR?iausv25U@qp0Zmw|GZA{2gxG3H+v2r4ohjv>0pIN6gJ~xOn+i zw24WH83m`d_y~_s8E^H@EP);U1J<+1@oui)wYK8yii_cnwMj}!J9 z$KOxvH*fojRNEB$U-xu7h29srC~Yk>j^0|JtG5uDa~6jM%X&+YIW! zU$s8`9k>P5zv7rZJP|GnbD4X(^RikfKNKc(lyEd%UcFkfyNpj9tZ|A*91Ps7 zU~dC=L}{gou*6*LXdg~(#)d5yWL8|7v1R;ik_uPC?RsTB`%WWm#9E^x(hg{$T?ba` zNp#PKZBSTE)qmBQEIEX}OYA_RO)ExxZvFWzs=3wqd>{ z{3%B~!(Ie)V_L391P5n}@`w16r0%`PoxdrL8Lfu?z8iHAwh7)a~3RMKmBhH)$0CWOvX$@{S+j0Uu$}^KN=fMeZhJJ>p!;}qNIMZ zi*bh2n>VcoeFyz*legJQDeV)nlWZuj9$KlZ4Ikf2S-2M#}&UGzcPn>K6rHbLt1IT`hH)1 z!}I2fa3r;HW;0KCa38x7gMeE%CQiD4Y)lQtQ#Z%!cjTYsdWML(w^zC;?#1969oX1w zgN@yA!?hWDUEW}5IKbc_1O6KlBZFu#fY_G2J?$>f3wV087S_!wtkE7yF;*Z(=IV$; zfsKoZTG?{bjvzxah8{F%l6ryUcp7#I->&lD(LTd1a4~v?eNheQ95F*hJvwHj$67$yxZodMftuweEF*OcX z7rlah49N@_PRw{ZbY%s3a8VaP3dDb1OuZi}{M3cPeWiO50tK}jJ5kqwqJ?c_!(2=IR{fsjboSdioQJ?QS3nE3^%b#BI7PdPlZQhx-p{MHk;j60tmN!sujE%zDtcL)|%q<3NMl?{z!< zcKQAOH@XDjBlXbkw@BihN+xMX% z=`=zEiFLS|VrB%U516^ce6yhBs-NBq3Y6WHX{mI$Z-)Cy`kduh)WJBmVXnee4<`F7 z0u#X|G9YQbVg=(C?>V+kt`SG`G=$upNGWGAORb*6_?=VK3OZbCh&u2|&&UH95r$UT9&qpIz6MRU_)ne+TtKaIsF#b4OkB)nyQrsFR z165CTKv~>WMx3wun4hK&xi#Ftbhv@QAD&62}2ub5W--#xX|>867zeJ z^3J>@{Yn6T>3Wns3}WIe!S^=&@-9r+u$syn24@A@wtR|M)Zj`V&bLy0N*Bee%}7GW z5?~l?^fXr#*ON%>q*NsWql^;D3z+4=gAi2NKc4T>UV=&Y%}Xi}r|?op^j1WYt#rmo z$+2&MNp8MZmuv#xiJx~cM}cEJPSBg&c40+@V8M8GvViZx7oc4W!6D^UwfrjyJ=8{> zNH|~*Ha7kBtmKP1PY2JPY}!m>>!Fn|5G>Vby)w+B5wnYvBYf*c(vAE++DLN_u=(!R zSEh$ei~0136`&}~ybqh&aIbCZ(6^WG8kTJ*&KsPr2r$~E>MXAlwVZO0URDoAc@!mh zWOJdKuG#Qi9c`&anlYdtGW8337{tVPQH$)N$lmM$L11c+CViOP;iP<)pN5VP07+8? zp24l^|2ZuZJ3RUs5>t#N+(vwZ@PA@~=^o=@06Sz|X4uk1@S$J|P-wwcK0e{4UV$fQ zoMxkQ!L@<+l3{A92|ub849H=dF)L-4L!$7@BMgq=eZCrd$+GW!0f#V67>eySU14NZ zk?duN024pstfY}a!ipms-1K7;E#0o(T4VvI(45dkwG+e!gF5*_D-#qwjV#AYYu)4? zWFtsH_tFK5KRObBv2axa<;`qqg}N>yM=$$r?oU;9pxs1sg3RQK3sO@L-d>ubf)tIxRl@sb9AvaUMmB9e^hcw zPejrCsgYehJBoPxu?t)6f{Hu}3`nd_sBnqW4AGkLZKh#}#VSE$8v!#~GlzBB{a{kv z?#4;*xt9cG9^+fB3Qm)_9d==OR$rr{!w;3WOAt++Dg(oS^yZn`DH)fwxJpF#CK7A$JHeI-4sD-KOS zzTvIohVAe)Fm8@_U~P)WnYwoN7d6t7F@SBtr7r%aw)kU|SHcQDzC3|(V3>K2=!z2u zJUaHaRG1r&k6(gLY61ufU)5$1l)_T1`Lmo_j;GWkx@(9*t=43I`su1lM9mIYKdww4 zEthF2Vg7-X{S`XpoK>uMyRG%zrI@;=T76z86On^ zY9_pJ@!Fb&XZLKWd^e&KEHs1^;tONbz3~G@&;CbwdFh;Su(U;|QEEx5w%{awlh}8wZAqt z=yII06KFp<@_-c$55QGO|MH|3k7nn24>H7t5Wd*Pfd<3S{FW}eK%25vV6vVXbd$gD zMrq@%{FKKyyG1~fnaklKCqQt7T|V>3&ekV)W(hdzPnp7)yGUGjU{A0qX5reUM%W16 zfM><3yZdIK3BghM)rcr&AFQj|eP$oqFYcVU&2XIOYUGhgK6ceeOE&VF#t~Jo?WOH# z7;?Rag-le>5|X~fs-)ccWo&_+C^%g_5ROwdz^4yG!zJlZT;|an0_S40C{)$O{Qddy z#-gTTjNtUAn@i&NUvDGdn+sG5)IkP(iAqYl|P4Y0iwk`*Myr ze|RbF;Xj5^<(QYxT$h^i%hITY2{A9`!fvR`v%snJGQ;sQC0-7<9MX)pYb77MU1+n4 zmtru|%J}uhU+Cw;X+MJSu6<0#R8e>ufR;dgRxWe;L=>?LC<&jFhi0_rT7gQALg2|C z%!(uR9PRz6!)q?-R07U025H*6#=bE9(}(})`HBV=N-XF$Cy4oY*p;HGLu}bTu;vy; zSED{&nREM$#B?|M(j+usU6vhEg8VJ2qaLZ^wD(xHJ&^XNO(7FOo`Sgm%!e)^Udf~q z)RL}4jzcmYCC1yGU`i>WseUso)b20!4x#IzI{18EL?tOM)4nyFa^HzFJrKC=j-TM| zuE#j3KBLLrlD6$s8bEiEBdIF{4$iV_3cl2o7f)pBaiak&TWM$CPe4tuZKRE(HroI6 zesI3(AOIU#hXsz=p8GZQ7oem4s>P7bc1cL(w0X@b?APaO4g~ZD>3GP1P6GobXo4%P zwh^Gc2pAwT(Qr8oH{yg4Lqg;|);$VKRtGOX11ssE!0xExUhz>q4y1|6aJ0M$Pq=VTA8<_Rye+qUw zac?a=z}E7^}IB{7d#4Q;L9z@tBjT!XMk{2bAe9I4-kD zUx2K-U5>dgqu;!1!`(E>lq2fS-@to5CG{rO9S@#s)ZjBt!$e!^Jss?zPg+)kKOVf% zBq(Lh#-PF}No1K!HIou!%6%9Neg7WO>!6-pZ_z$!ld)&FDa<)uR_cb*iIG%q7$tW= z8cGDNY5q>K{`Ps#owwO3xBt(|;iTEf>?L2)%G**I$1p~RAu%>LC8(Cf z5HKjraYlUrTF-N`y%v4t4tU<&@wR9V56*+A_HlYY4d3EEgT7l`>>c&Unk`;4Z#PKA z4GKmIzMw|{EkM%0w%&|z$>Y(Ty39JZ(3sdpNwwYcG<$A87h9CgXP$&3CLgk)JeGHl z6@;s3=?KYe2*w-puE%I`Zb?wHPl-A?Z}LAdU4B?J0iuAECRuu&ywe?%v}W=3`}U$G z_gcu%tNkRNeq7@74HT=or_GV68q=A^Ym82sk{9rEqpJ7nA5;SppT6#)ZCDKTAgSi-GSldf`67(G0m5MZr$S93!Pq%gr?rgu>_4Le#r-CYn&{OyKzbt99Ts5@*#KnBX=KDAGNMd zXHjOO`7niw277b664`ljW3s>qvC(QR#|Zk_mep5v%0qjJZAwOUG7ge%sStN-I8Z8~ zlvb%*e=L+Pj-}5zX7^j}xN3ifwQWxQ5_^~~6?jaWMl1hj!puwVJVXbVnxJjD17wV3 z($KFX+;|u4KrihBS_v@JtzPHL(r701bnI}SJu^|>Us*7AM0Fe~wH(LY$j*@wPH$*W z_hQXZ%s4zG^_gvwDl1PSB6eZ)KtslpKZx$cGO0P#Iay%cBHU+~j%UqS?tDcjB?OEz zI3G`zLdUhZ8+z97^0}{#@FN!--5I_yyx0b819H2T9FGL?jrt6)!}3L5V+}8wHaq!u zrquG#b}jA>VgHEaL65=Xr?}Gq?-GpR2-ny*q(-K_`MHw;ZWt|OyF#50iXicwtIz)GF9@I42k-7C2kE^CLge6U-|7Jba<>k#rJ%L6F~0 z=Ls-jT}wYScT~m~&QGU$am3s5zHQU#ZBgUJ5S$|1uL7RP`1EI-foNs*Itf*mgbqJa zmus^|wEz6HS@cy;vmPYyR`Kt1D*C}>soL8Z$)xMX3e#>#!TdCBy^7-pGl{XD3OLSc zkZ_(jaP>lc?ZL${&peqt_H3*hI#JzpK~e0Z!Xod+Ynx)QoA#_(P=ViRQ&>$iqA|u| z122;nRLA-dP*?8EWH?@*u1K)qMs7d@PM?i6EU`lC6H4?<(PFmyPsg-&1Y&#T$U<*cOvoLzT`pP&}-V`#}@t2qj*jci?id&AnZmG1}N$n zTy&KKJ2NFs+LtG%dwbXyX*9{@8Q;CwYJH?kt>!8;8fXC=Z)@n-vtJ(dlbNES_=QdH zolgny=)mG#sxW8b{X7sPSTH6b6YrHYXw8yv4sQu0UVOxXTAy_U7(&zUR-ihsC;e|sKCVD)v zGbb<8<9hKv2S&2VqzSo44$cmbE(2P$t~S2O$xkr+tjK@Do?3+_nja`Ms^tX zVqfZF#0&Q*1;O^A=yP*|@7(>M(G88A?lyhzB6QwQZy$SRQ!79}AimdY&x4Z(bj`8S zSrz1E44gW%KKVpFc1$R#ALX(kB{tEv&O?wdAYeyk%%K;++<8|EP*-9BLi3_r5Q8Q;GT1zCJ?Me=OOhTtT|jl%nN+x?(~?t1vb46arSI zLOcubA>wUU5Tp%J1(YJS1%w84ZMGYVXSo*10vIl7LoXHW-JoF2x9K)!@$0bxPZGDSGo}*l+FS&J~x?}SNX&+A1zZMQN*@U z07J2evBEi&LtLR0;>MC3YQLK%P#h$EBhBxQJ0roJNx8KcUJW0Xu}}OoouYy}D|9rx zVB^QcbR(81(EdQ})(BTvXC+X|EmI)UYlOGvY0`?P=1^KNvP7U2Oe6AnvcXN%dqzJ0N^{6aZ%vlMNV8BK+)ZN=JOZ0 z{!Tm!_?%gZm5QF{xo_iS!4qw(@Mhy^ts z%w*1y$R-1%x6SRwS(T2R@3UdJc~5W|dM=BmmL`i)9iYTQI))K6!yDX}VZjW^zwaKR{ZfEVecDVkwE&4FR9tA*MXlm$ zDPB^*z0zNVLFP*WjlJsLW*|D|M|au7e~NNtb+?K5bS)EN%{veRZg z7|hoULvtbpH{$S~muwWH?V5F8)9y7Tt;XHq;uXVc+LIdWV92$HZ+v;0Bn+{mWLMor zK88e-d#OZN)mclFqJdP^J_r|;Ko3Y9hI3J!A&E->dVtu%yx2t5PzjQEL3_{LgE92) zDy{@Rkz@CP{zkcFg6p#N&a_d_{jgoe^%SVlXySZuBC(%N?3J3@=W^>T)Ff*_ONAGB zf4t^Q7})t+wZ$j95mZ z_Hf?P4?ZO>wcz8Ae!xK>)${fjW#*y59Si}3(Cda#c>A(|1{DA=vQ2DPQts(w*Y zB7)B&wHWcI-7q4Y61q|%dYCp+se0V#c&MO$2-|4|bWZ3@6b9*$HEK;~Bf$gCG+Vfb zpr^o@Js8Y{tY~wiYnZ^skpL@Tw~3TVaS&+K*(|Fgi)FQ>yCvR%UBraD>(Cbr!&QjI z>(SG$owZ1-pj;wA_5c8C?3#d}muv7HR+(1f6)ACZ`>L?Yl_ zlE8{bJ?+J;g)2*{v8ablz)FgJC=9l!$9NczW2D(Vh-0WiaZ!8V7pJthcU8fyT{uIQ zGvkekPhVf7=oR!IVCl(|w+hTQg$#-S z`OCim_|ih>YpoRE?#leVGZj!!K*cVi0I0u@_D<@P;aXN&mu z)ZHGFQE-H!j_*XpXVa(bta4;fVeLL<*jsPY&M&97oiI_h#V<{L>=_0)RtEPY0k$~W zex&L7{hZXSAZ0QDlB1e`XAZU;z)To2lOh_d2*{#VF z$_t7HAh@`Cbu4k%yk`qbR%%JFR1)Q?s##Nskx`UAMKmPB0GN3LJB4L1GwB^S?%3Sw za%xq!e6c8-S`V;U(M*$tPKQ#fY8#O@t)|4xu0hAMVWGj^%$Jv7fbA`q?kq(eM@_)5 zp!I-tFd+hTuyeSR?ha?;S_Vx_#)LBkoDJGYPlfri?#F4WQM$-+9ELu2R5VpKGY z?LG$ExgLYBb?4+nI$f8_W1PmFpFkN0fR#Isal~)`_!dl$U@{1nSfFeI6eCO8a#o~U zj7Cr7;ysMim`f|dT}b}P0Erh9=9PX}c@PJqN-39SElL7zXC75!_R^Oow6=%EW>4@L zZU-gXOp|YKXXojH#VOgQ6;pxMj$0%Ji&_M2H<%cG&f;Zcsm-rvWXN#Af$gN_<|=BU zj(r@6YWwx#k`f1XI|)Tirf50x&6Lptv0|O88M zY8MphB)HbtZrOO!_VP^g2PDvy8wmW&R8vqEDRxZq0?2`ZkiC89BgiZcS?XsIbM4`B zLr}bes&UF=1QcRMMv()vmiykz0LyeX#(ZNV5`7we9G$+EAf6s?#E(pF6xj$Fn2x)+ zvIK*sm+@s_{BpH}oh?AsLZ4h}yl*B=b`QS$>L74QT769*Og?>VUDAJ5tuA!rvjxO< zt4IQ^iZEP%B~(z=a{Gu?`z5s&4yJ(^v8+R5306Tf#@=k?W&$P=Jvd;rrw(#G09ii@ zDR+rl2)^*b`0?UPz{i9!7yd9DxJ=|_4Oyecn}x3x`~;eztdFHF9a+t#lHj~;9>~>7 z1+m#wowU}Qy_^j}y)zghxNco>T(o_Y9kQ2`0N&rVm>(J`GEcMAW$#$3F7J)nvz;aJ zOh0s53rBZ%6XmKAn#tt0$W3<9JKiPnzWw>CnGAY| zb&BnoHSWxdS@YFzhFNgEHVU7v19-6cniRU3oM4~4KAml$CkHgr3EOM>25uxkC_1<% z3<~*{8~fn{xk!G;t0ZlIKAml%XV-rMP1FW#ZYdr!?r_2xw>ZTTux^twAT5f%v9+Zj z^K+JWVLFdY+v}eSk?>NWGZZXD%aB&UqH`2^J~+y$1Wf5ftB8dE`Z!Xt%e@8@9L6T3 zQG-!1HrfN14^_(8FAu7mwDpP8$zg=sr%rrq&`841)SZ8QWSriPi-r=Fpm4{WHR#6{ zkV4~!LK2}>%rgXlO_CNv^T)}Vq+xMUl>tDgIs8pp7~_+?H#BX|Sb)mG ze5t%R_`Mk^*qr*8>jUiF0mP>{QaAa8JAkieYKPN+97loWTd@e*5Dor zmp3uAHjy4Q&{ms1pW6g?>IfRRS7gH^u)q$3m|S}F$5q3y?X~~>0-t9kD|4mgC6Dqe zsx2gc4p(~%q-|2t5M)pjcnXX=P+0;1zCs%O_o6ha zskp+dj3gh(nHFZbGZoFc8jg3DfR4Py^4@z@tXg;Hl}DG zDhIFxs7Y`hszr_!P)}F|95UaEElBggpw>CR0Y0Rp2$GRnzJ!)&VorKwzZVF)5Ci23 z!+^k2LPRN(vAk<6a-}0edv^u|UC!iNIK~*#^%feL;~Lg;;A;LlCbu31Cic~Y@wwj} z+BmVwIUy3?A{QUIt*`lRM3LhLjQ4h6K;YFE0$AnWsgOx@cLXHFIHW<602PrsZ@=4O zfN&M_!~nCzybKNC94i{bMhHqeMUBQca5&7u-y9T#K6M|nRBCzDUad4YTLkI_!X4g# z9@M9RR!j_J8}{bR@$@Kj{O3g@8r~XDNWgpq7d(hZ+!hX>APGrC%#iw4Ku5?u?s7c_ zN7^u)S`aH>i~!w{Ojs75j5s@XJWtr11k7UO7SuyC#p)mFP+eA%IB1 z*?BcOBX%0sGX8Or5SNZ4NdVsjG255_XEMrdpaC&4IU&N6MAFfaA_-mI+~O5?X|!nM zl@)EwFvE-5@Uhz&jv+H+^%~>~d0mM`%hoQrQ&ghJUiGrJ7eBkO*;b_q5>9KmJ_}bOa#$xg zc>mvfgK%-4XPIzt7>QYJc?l0erfR^PFA_HWQ57O6S^0w(n-o%*l&QF;PCzBnLajcU zE4HO-Ha=;_vH4iuSCR7tdEBHLYJ_&qk-5>-f!8HT!&kb@(OLo$zF~}QC{b1|^sA(9 zm$@|C21$g;!xs_02k)!+3xfQ8#;kZxluJ0>1W%&mnLoK(C$!lEkw6qAZ>)%i6nyTa zc#PF4M{q&qLJOS-)jepCbUvp8c%LyD=;`G7Ra{V4m}mXu)fy%DQ4nbphBSIpWjv(d zt4r^AC>-el+i&;*5-kDa(o7Pxy!BnOye~tg2cN7%gpuWL)o0*kz_nyK zmyC&1K1?0{;)w<q=%_aH0h~<=tI!XNMkxMJ@}d6PdrmA z4BzU}sknh@g<0S9YD8F)N!j>w-#bP8?Kg&Bk$eR|TW|dR8upu2#$Wq4Sif9n_)YKb zLa`Ydc7a4gthz*Pz+mt7#IWvJ8fQ`wF35lKih1K+B&G4N6V}wY@^h{Z}>(Y}+r2L;ZJq17U&!46jw=Eg`c4b+jv}8>o%8bqvlLbLby|)62VTOzXh;xlv zkqF`zQt(iQ=EeW2ZisoJr0*f9R&!u{N4-giwtn5FyWwt+@_?9O}Fk?1*~|}Zw&A1gGSJV>K-MIg?cU8Fo>;9$<@$FBP8lnZ+~;|CFXRz z&!fM|djsM}3p~~&VYJMB{*~Q`Rl57`D*xekJ|+TYks#g?cGo6 zYT+H*@0dqhkH<*8mk6_5q@HOxBu5H5^}CB$$6rUwgSU(Gxlk{=*8hj^=jSbZB@uY- z*N?o=t=kRtAUNGG<2CZU0OhsAr=lH^(B@c1i5~?O64BsIL7^k8+mHlp{<%ImIGh|G z#at9wS`*Kls9v9vSF^!RVqMDb=~R^p>A^gBa~11xNCWiFQnk<<(NIZr?nT6W6#@no z?NC6cuY1L0d{Ug<&Kk-R?~K}tRVsabsrZwR#6v61KkSTv^z)D9gDXrw>I!1kG@BZL zczydM8Q%SU%dGkM_{_%N7IC3%Y{JcqkGu(m$<=S0XH2W(vzvZTw~mi;GgwcXs;~zR z>WbV)4>@hcZR7uck4M`Cf4|1?i?u`SSL=MP=&KKqp{n&gOeUs3wG+#NlDihkOYN|G*v9*x8fH^63#pMdB6g=_JVI2lTjJ zyXe9DsDY1*9r6dIBN%VKhJxKk`_?G|C*QN{z#0!1_+Edy52Fbb`>%l!37-|QFj9nB z>C3p;T4*1a2PX!Kp916C${`h{Q#h^^-!%ytchVnw!^&h&Xw}5>fAYUw_Rs9g3m@M` zrUt)QTUV9uu~%zbwf}XP(zC?eV};WrU8CeR*8wU-d(x-^uZ(H}LB{&!EP*X4=OX3A zA)wIX6y-6U30DQo4(fJ)q?P<*_Iy2TIlv>n2Q`RR+q z*it6NrK(Wj{F7E9p?WVrPlzTYuDqLz*s0MaqUOiA_;!Y&7j5nEM8m!|g4d=a+6{ilUJILQAs=XZHS{7*}N z$FMW({C^?N93B;3(Bpz`rCGZ*GH@}QL~gh}B8sn0ay>{iIJ*!Z-Z7(zMk3t1)6eP& z+LtIw3@RO2VduXmp=oVY3zr&Jy_9)RdZE_CxtDv!Mb*LzI`-rqTrKJ?G}sx8tmPsY zP5SXB2c4rc#t=K32rSH|Hhb<6NwxWIi_glLcV|DZ{`eD(KKIit)AGegaaR(t%k$>k z%pTu=7xrOK5}k4{hE*9=tx%TgWK~5vvTE>_mJXd0j!JfRy%REbdSBM2Jn4bEEL`r1 z2p%Nir=h0_nNh4Za=QLC7J}Ri0JQ%%Y>(uq7-i>+MRl$%mm`bb>!u9no=$E|xc{B; z!bhr&c=0$K>cSeWusgt@k_dE}%x=1Rd23zO4kymo8%OQ^KT~qb@*)aqv>AGFt z1mj=?wo>U2d4&Z@_P;L9+rw0twLSC#N#nT99q7x+v0b%1S1O4m=2lcq;GmKpKrWdm zdCF_KV8lj;>xkAR0+*rkLLAq143gxD(vjWzRU*hLNE&YuHa!aCAPRbxi3){2e2{cN zq*)?*k^qa#M-oLP7iv+-HmKIcxP`K+%Xv}JmMB+BQlbWi9;6qMZ7r7rrRz9`CA6ff z9T9op$Np(cwLg{f157|xH!A;&gaJYW8+N95)9kVjm#wPPue%PqeaRBufp-=;JkKk- z&xms0!j~JCw>zKjGHt!mwMq)!TL7<0%2>AwFCZD=UG7zL%>PUskX{mqwvMOcL5T>e z&csA4rC$4bS8?6gK8>SHTHBG2`?lG}n%(-9@J^Q^lbZTQPmo1-iT#&-S1a z63%>!Q&}vpzP?BeJvGtNpL65Swm8bdE(oJNgK&6?Fo6XMx%FmlmYe z;0gq`_!&_L_;P+{JG)*bTf}^*bfi?GQZ6y7K3Ed&8hy7h>OWtc$HDhU42}h7cEiYG zAGe1bd!SFy|K04M8#uFmP;`#+=K2@3q*ea@))$SXWwS^gUX`6JR zgPkH&Ayy-m#NV8TmSp~Erw-WlX(LD4bucU0)Cp$2mehVQAXKV#Zce2dL)qoU*FU^* z06Tev5fOkbaN6`~Pyy@YQB%+eSW0mXq7pbO%TYEYiLx%e9BJxWP(x)?x~zUfPn!_n z>DW<|S3&Fmni&N7n2FL2Hf6OQpYez%MGko5pF`oW0SbYUBBdMF)HW5-49qP( zaA@1WqwRl-hFfxw`3{X3rfq{=sK-Hri6CAQJ&gI_Y2<*xM35B=>HQ;CG`KuD002?N zBOG}eS%XgEwL${D62X?cnrP`e%y%TWReLRULL<(UP{;^`csHYxz}_z`$y)p9fm?cW z(qq4-ZBp)!5Gr8bDM9Bxdfw#y*ZAer&438^)I&>q@S`q`s^GW3QQw~lPoxhTQv{cx z$=z`Sb}N4-F8&ARPC&M+JFgo-@NQC1yyiq8k3$Y>qCMdl)G_n=i`2+vr54&Tudis+ zb!n*D$Rmk-x(%%-#A{^`4){bOpSZcK=*;QDZ>Oxm6Ty3_Z=OefSg#ANmwz~}2pkRz zE_&e3R0&H}|L0;Fk_kdt@ftSXL6J!@yGsL7G@(%do?5%sA8RG-8fJWq!1|ImCzx`Id|9Qwyd}b6QOb|?+F@80!cGyB#2B+-ER0bSozJGs?`iM z-OQy-*Dh7|207rNL1|DA|99y^bU;Z7&I*jxZ93kLQix-f#XmyTJYO+!iUuG{;A_5fj+8!r1^Kw z{>H@rInm~CxzZ-?JkrE}U1;+tByco3@aU0`K>cXiD|qFp{yX|8Z0eElckyw*@VESL zrj>)N&hjF65IBA(EQ~FujaJC2h5OB*F_4}p7sfD;F!htebd8mX>eAK2Y9P0Fb=^!+ zK{AUZF=wt^ZB!~!n!K!dqEcc+i6waSWzv3 z&sFX%TKE34dX=qZpMuzPEucSE5DoyIv(-l8@e97Kwh>v#d4p z!DdsoYC^;0Mr|1zp*NGo_9l3l)HZ1w@w084Cu8p=t&l&4-ijW*#47j!e&?xPB(gHM*pO4+eTQ(ZWDf|WY5GoVXM|s=3UBjf%T*LM&-s72 zJZE}KPbR|Ub=_vW!7mP%CJpWInlH+q!g;{cMrhO#0krisn|w{JA%c{xffv#CDb!@x zdelr2fE-$!pHsL~$^nC1%n0TVZ))zK}_f`j|a{ zg}iMPdG0X`@gl!ao@gbSUiu*fzv(1}i@itEC{pezE#XFGUoM*~}Wp?mbi6X^t& zd*^*BBg=OLdE!8}>E0@xOVAH|5XqCLx`{al2Z`|suNkdn9|r3nW@zNvdA`|#KMT$h zf2WJ70TDS?UX2^%5nQksP28ZkEv8^agvZ2m2Oc@oLI*Ll=d+5YCgRM>meuoMG1>rC*0v3ZUv3g8 z+_4&5XQGcTkcbh@+MQMSLMg6kD}xTx_v&Q1P~&~23q^XLpPu^suZ@j-`@FcRZ2xmo zqz!mpF>jCbyei4!1$1&WFcr9OBJaxY7`-_wbS!<_H`OVvL8lxvqI$NQ6!LvU1N05g zyDqfq`{m@5zUiG-+)JwV4~Qym;XNyg)KAk#I*{Jh8^>kyo8q6Y-v;cl_c|;XqI91# z?=x)QEvr@D5rqy7n1coPBRn?IsxIV_j4CEpy7WS~yjDY0#9NKkfXZxi<)(=BDs2U& zNlaEaz|e**SO!Trt5Dx6<67Myk~^F9?HI|FHJs6F#D$mo9Fcjde-?RAaVwx#!;ck*lVY(;;|d*jYmA(63XXUU)fvKV=vaJ8aOKhh z6;*5?AG85f7kqe}+M5ofiSs^1$SM$&SK0h>A4$Rvu9Iv24b)67U>A(gs}kO10#WN; z*OFzyRk{&xaQwJ)vss89YhV}7Lg@iyzNV$7a{oF3rA-c}9#G{O9D_}c# zSXzUF{>{zFgKf1}6_h$MD8boWb8GjBgwh^F&!Y;mKA*sENF-SG-pjsO3A@i)Eqn%% zO?fqJ&&HnAWzkhv9wruI;xWVy0MokJuKB!}WGSn{lLc`DmtyzoVM8;F=vqX$-cT|> zb2g2eL-K;4CPn0}P^Hq}emTQo+B-wksgtNqlseSIAtk4%@$u1Vuw(^a;D!Neh&qiN z-(H5Km}(NFbz>JcXhni+tyr-i8#gpS)#>1RYc*hXLh}SKJ@>Z?_JjZ<$`%5bUEwmdSP;uW%bCjzn0yJ zR&CPib4Z7==_t2mXn?dcCbZ@qe z%TKfcxl?kJ$dh4vr6%63)@{?87f>wj{$n{Ol0o+C|`gL~UG z3=CydJ!rTE?IGM0kZ(Ve$!Y6jHRjp7Fln7qZXvz<9A`9z$MEL{Z~b9jxrr@u zusAM-ztB^-ZR$jD|9Ek?Y;f;C@U^a^qZB1eIAr8|l2&ntXMd{TvC$cH=)|((CIPs8 zo*Ga|cNNT4#AN=HakJ7KDP9=kUjPT0N<80!i7)W))&w^_C<}T}T>#_ToXxvDY{0l? zcyGuQ3^n_#X)O%G>*hfh$Q!rN?v0 z#Fh&l$|2`U!_E4?+BNlGfu0|umHhgd4;jCxCyaA|)+P&smsiE9G)CP_+o&k+WqP1~ z=pq2iPqnf_citRj61W@AQON{OK|#TbSV*SaoTj2W#fnfV?|fIJW%!+7`R7=*s-r)~xKGqJRye`)_Nh>;uczm% z1Cu2sQ&U32_Q?qoA$^C~j0|X^GVFoKFU5;LVh-EI4KTN?T{&7hF9+-|^6v`=1{Fv#Md|d8veEY#r`=Z=r*(5etvKYFuV^NASLni%q&V%98 zlw^E3ESV#|{p`5raX-Z?f!6eYDl^Q#>z!_Sk(7(F^o?yfaXI*Jnl)1F+f|g_?EX^s zjW=#kL)7bh;MC`(?WA*>16270F!>b6-Z;gROHOIH2ShunSc#k7NI^u-88?4b3y z7JfdQvEYjTt$T3r{ov64(9rv#LCl4kj8q|5iEXAPTVVkf4WPduZ9 zExaT1`ZdMUfk?G-BH&ieRD@+z!TUOE5d~XV0MV%?O!6i(u8=|~$b%SEV&kp?7O;O{BZuHvy`jne{PVfO%aIUe4!G0;^S=7&!yr-z0LF~669p|RE>yiW)uoO zR*B`LLc=K+k)G$jUO8PkbGb{dgi$nFylWxs7xoyJ$w-9-h;D1fjI1dyaBePOB@w4S zq^7PHEKxx*P3yG&bQn|dXleo~C>}+cP$fc)$YO%b(CDStua}^~;fR2v6n{zzzd2`~ z7qI2@$+C$4)>`%~$DUOvPf_>G$Ym9boT>Me6)=j2&q(aZ5~0&a)Gb$BeWbB!Xf|Zd z*?VH^3WVhTVtf17@0%INt2XC%qDl|Ydq{dBp%V+rtD5Hi81*lAGf7EpcRZtV_I3+L4=vLS1u?4{EU7j864#SpCjr2<8L9lJPXF z65M4?n$*C`A3am&DJx_Y5B^FT8@TPYOjxbMD3~SIJf~Wpt(X1rl2b zKWXqCuW8sBibq)3K5B%vhmz+mI`yl zK+z&e={GHtDTs}s>M!&o)}QJq4baXtYV$=^4fz4RKipG`=-YePjw_+$4eTs*;V5>j zUlMUzU5Cgzvg-Wtt$)OEXI|3nLOvW>-ceXk|0vg^QdX;uoc?=H;+jL7#8HACs7ODr z3?Q+)h_k7gg4qqHyf~kSqhv zm;^Dknbjd;dM;-f<18t5wC)}boU(S-G5ejrJ>!aL^1s0--iNjA=^gndJM(aSNTwC% zNWsss^C-;`deycDUnWIM`zUs3%GO5cYMx&BZLRM&Gej3A@Nwbg)#=>yJ3UUkDa^H;PSdI*lsXZpHNdSdbN5>NEA(Ix zTm6SdHN>*@%L|dt2~Ai^q!Zbg3(mcU6B2V)%-f+u|I+HM=4I-mAjFiIX0#8{O#0X+ z2P!|hE(%JljB5>Zey1WP-oF-nJZaL?`?0C@;fvqzR{~oTH^=mSYHoe}{Es7j?2gN5 ze_d^9nNJ?G!Sv_4ci+a&CsDuGr^d)$I8LsMNr;R_2g+{j{5&`t%s2{mE#z`YXw1@Z8VFCTSD?ld?BAU5*~PV2E!Xt(6KF6Lb|R!={eCCA(Bn z_qfNTEM;aQ<>NPs;{FBq69Ok$5ZfYxHJX^K|7*^4mGqF{Wz5ut@Y__Q)l`13HQdzf6XmqX z(K$&BnAxpy8=v^7^;u`(=?oDfsqvZ8ey2zmYk_=^oBda`al=z5#?`wi#3(pFs zEffcX|6yKmpovr0M$|qTs~P>#{d6p42ZzmFo)eDx7IrCpSt(s|4Bo#!yadCI$5gF4 zAlIjkX>Wx1W?PsCJ*J86gN+Y$Uf`}IaBpx#h3d2kxAjsr2|p9qpDOv>eAZl#hedve zq+W_Yg^SCPK2%ba!qRKVCPBQ zWt=T_7uDqmBiu9q7$&b8qqpx4WE?KfTfzMP-gP*2{j@K#7TqkZu^xX-1T_dI*Z zr+&tnFbbV!_3VP1a|Omg6Lmj3np!r}ebOMJ>(9HT68FL9-AVm0Y{(GvrQ1Hy6wyFolz7cy%vttC^inTe0{-(&vmelqw!i=<-RZoE@c{pLBVM9@2 zJKo*#x(^5CcBxI{yuUY$1)T}unW$!Zpq&cim;!bx#SpuqL3>E<#8f_O;jGZ3tFO_! z4&SbF9!b({+rN78h>IV!l9c;ta#VgtwP!AUfpw4Z;!)*8T=BRSF(9K=q#~_Gf_TPVr-sMkr%wq<`0Bx9&y8yyqK8Pe*|`H;R>WI-4{knhK=4PD0bd zP|*F=ib_%49Q0Nct43g*gZ-q?JVT)mJ|0}B+YZ`OpdGq!Cb~QBrjUEzOaClu(w>SO(`Afyq;8~ zmW8;K<=A(}kD~R7|D^=5Be3yP0Ewa6~SjvZ-a+|}MO{}HBevo*mlGf!BDMv1LwWu^cb+hV7R;x+SlC-APu!8i)xisM!~2uX*E(@P0_% z6(_?<-e2%o7S`SFFFVPjo|AdsDvRr=_7o=QJs+GnoZ{>CP@@f{jLFx|Ml`+?Zl!wY zGc)7aH1HTnCHGMG8Pzz#HLoe|>HKN4n3ZGp|9Hgbs^8UM=N2uVi)rx58{@CnWP37m zv#JfyxyYI+B|+2Nb;7f$8m@87Y)8IS$YkD`%h(<_k5sBXO~xyZgTZ6fvLhz`jkKBbU(uf}TpQ9Ar3U;PJ>cPkf# z^+h79)W|F1civrViSaO&bNF9+9>CKV0|$}=ATH7 zLPvIQB2-h)$HlBVo3I`bA@4|#JyW|gYV51nMI!Y7&JXJvN`d0ybSu4%PBZ9ebc2yb z*BjTCZ642U9`A|p;tLZc92*Xd7Z&#P={lg3@Gi(}J?HXU^S!+JJXh0w)!A3(?45vj zMCm8}K4CnNI+2=P3H=^BWj1df!ptmpTVT2DS&p3<)^9RHPv0wl)ckGxn-Cf7_cLkb zdIE=oTDC0GgB_{j6_cu3Jg3yyg9{13&@QO$&{3^aQ@3maCfbNuMa;+RutF zUnhhZxBNA`;5t>28BJAt|sTPpvM<)upP5+cvTa+){deooZ>lKG~xi0Xxaa zyXo~&O2{eBaOw?SCsDky zzrYwvrME%qz9=HLz0c#qMYzYrAu^}3(V9Pg_w;I+v+dfoQIf*`7jtic#A)ee&kXS?us(slv=I@xIBE*V#VG z4@(xxxQmKV((lzs($l?bBBCTV9*+@$+f1`2R3}$8gJYW6;~~SbgyfCN(lYkk7L(%f z>H_3JN8*QpxH6hfn|J8-2OO1tG^KJy;77=G=9!k{h>|z-wv?aVYo*)p$<{mnWO-uW zk=g31OP4F#EcJRSRjc)T)$1r!ojy4JD_79S>k~mgnm>m0n?!^^)W*2uv{h6 z+cZe>5mBTB;~2x19^B^k9>!P=j701EmMYN2OwMocc;axiREdNuJBY~AZj1vuu-WO_ z2dDL|2+fhzm`XSDgLDP-j$3s%Z0eAVu;Amjj>K|0>BC49H;AP%*3(>L;!>~=OegCTj#+HWLq zuknbLj?BT=c`w1oCY=``#LmOVH&;JqC}~K)=EYKqS&1IQqIZ!BPYH4jkCm57FKo-z z4!U^2f3V+6UTNt+*Ytc};&SW2Ijoh3Ajp=qT$pb|6lQV7>7NWK_G~AMFc@94r3i<3--PZ{z0^so&{SW8^QLCWr&c3xjplCFMT3%=#|J7^8C1bg%%W z&J{5j^V)3NS>Vn$S^@UE*3VN>Aqn24Y$D!d5)sK~d11QFy;I#-5wmnMUs-PSFn~`6 z!JJ0IqVDlLc>rTToWHO zFlFhLg#=d*Zjzdu-W6`9NZ2nc!#m|{N(y1?`3vH5n#Na@T>13&W=xM*UC5Yj#3_5^ zZnA`Zd!-?^c|rwgKw&o5Ds1fREz}k+5%Ku0qYMra#(TsSj6dlO)mIA}cYRty+31KZ z3r*}DN~t;?l2$GF%Ba$5#0P^E3gtb8La7+F zd253`7ToY!IdkYA;U}v%jm07(DXu}VVnjxjU7Sp*xqVGbEJjCm4?uKFWb;ciDOG83 z_uiNI%q6ejPgA_^43pj)Mto{pVZM@ctdz`wmGh`7xZf;Dg3d@Jl3C0a1TWbFVZ?U7 zd$3yxJ$2hf(as4x;aMU9C8siE`wuWnd_?n5B6EDgIx?17JiE~&b$Ek-#rZ+yI;Lp+ z2tsBsZ0%@f2&cSTJ!Gzy$YdZx1>2#Fjr)%~Pc;GqU+?vyb=pXDkDC8EfA2{iIRMj!BGfB$( zn(S^XUZH{W}|f#1r}0B>l3QWitc2pKE{QVl=!s+j-Us{eOkZcD@;XqGgVjdA?gU} zqK?M10=3B*_MFOoY)(gWzw#**5^_%JJ6>G4Ll8#72iyCqmTi1}71I^GHyJ859!+=Qgj3!fM7AH4%w+jwex$U2G%+624)$5XDEQq8Xxb^x zG;%@o1LZ3?Ysl5hCay_8IQ@rt7-t%UCETN~zpu|=r^B%~F4AT3Wi_1eMK9m9-7Y*O zs+ty%@Ka!97vPk;MVUu-GU2;oNafYv)>8*2hp*eUxW?7e6iHzc7&Dp=Qj>rWD})^^$?C1EHo$S#JP_@^q% z8ftZKpN884M$O!7=r2{#rH=i^B&rL-4Wn~Sdn8No`A=AcRbjskB$>*w^p3@%ZvP+O zJF;@3VE(=CV@Ytw4!6sYU0pJQA{G>GCwo-8?%|em4`)F0Xd}D0g-c7-c1fhSo z0y<#A1{m@fNxUdC?SqhqI38)9Q{0QF$G?mFo8{^C^v(1)y+OIo489u-&TbHSh+L63 zf$Cn@VtGZRPYt>%N8SIkOv+2cd>?n*+H>5~E6NY0rLY4j+$vG>z6HXzSLxoAO zW)ekGN4j`%Ma#;t#VJ?IXXRBSd{+#M?3^~=vu8qgE*`BNzd-b%04ks=GRQUIO6S@2 zdA<*J+K4sXOOlUXZ(s0KAg4I<%CKRLt-WEPqknB0MUq7NxBL30kcEgm{hhY-z{&FI z{iarlOXY?3?FBH}kSuqHkq9w0p>`zOorUApfQn>Ex*`!stm(M|WVW=J|CutYMp}cY z)88(6x@d4y1=_g`iaHRh>&*1(WDaK#Sk#i=p6zXhE1OL39%+S%5u#Cy$GF7cm)k0j z6xuE9v2!Oj&9B0O%8HhaoWt8-r8KF+ z5Pgzs!!9CZ$Np@oW#{8`kG+fo0DaGo11Yzn`Tb^b-?jQZ^t(EyIX_6VzK?c5-*WUu zZ1mkA)tvK#CzQufEI)1-dCJ?DGkwy&4M_ew>o>TCId?yhO_yCM$)R`4g^0Bwa4Blm zg{|`f;wk8c*}YN)#0DVxp1%5@l9PFpt07XKF3#8taXoj1C?F_$0Wmd`k)~7K%763NVbadj%8?%o8JsqB)iiPoM1!`nxv2 zJxMVb@{K1IvZc86TK?f}e=ML|0i=VP^mlw!CFm9u1@$lSC1kfTGjt~c9bN=m4koad z_6xZA;o9`E1+P`vMt6@q)cTdOjd^opJT7{!2m7yd*nlRMGfMlDer1LOe#i)tSpQ>7Sl#BL z0QYsFw?bbobSD-k&aWKWm!WT}r2C0wW$A6AeE|{nsq1K1b9*V~i00@+)1+)~2JGu? zQut!TkwAf}X)^Y2_<6+QbR7liPPxnBrC$@A*We8?>!4zdPeA#!`I`;UPbr-@e$7aa z2GWA7$4uq?*JByYv*PYb6+s>8j$6a4?-waX7Skx5T0uH#^1x^tKYK}UX06JzxG=8n z1UP*MjOaKK^+k?&n6yY&QvAlLBrzi?QSpi#4|%wy`W)GL_3>qDxujAW6n757$rBZ6 z?wH5m(?ViJ4>ZCbt-VrOQ8;;G3ZQn3{mGXV0w*vD%aqy(lC%atN6J0(Xp|H&GdHCyYPq}iF7eM23;f?8$S9{uH<5t8vs)iA z%+1+ak4=7r8Ev;oS_==&I6&A}P|5*p$Q2%{gT{^dIvCQm-x*}r2?W?q1W2Zc`yJ*X zPwC7`6$OmC{HF&T+8kL>`+IoV2Ox>D_$%=-2JNw+B#A0_u4mYkn85t~2kU|}Dvv`T z!LtsGLvp{v25Ik|Q9Ha450&PchMItw#pmyXVvx?*IlZo5^$+{^Vs9iXUMs_UG5#$IF;ISWz}@A$!F42m;dEisvC%W zaZKj3Xs3AZlj>Hww>k?GN7z_Qg&D68`wwCLB2*FgaC{**+|g+JUjV#w;*-YbJ3QOC zOXYu|=CvUbi5IZ^GVhIjI}8xm1wltK&KBGi^EVrIgq3D^s(iK@kG&*=6x0FE3*!_i zo|s|7hI4d9Ra4AE6S1h|^iPBK%#WV)M<4$~5`zCvxH*-8Oo4ooeBP?9=A)qv~es@UQEM3OgWlgnM-K<#2PB_A$ssyw3H-1Bt8i}1 zRP?AP13HdH!sG6GSGZ8=5sJ`t7W8Br0}S{g6-qgVS%fHp=doKFTI*xJ|WbZu;Q+pEOb`{`p;{O%MmEl-rGH{l45& zl)Q_1DVdCwi)8H}EJ9yUT*_HCN!20XN$mT|{(o*i!Op=v(k3&MKV477UU;wL>HzYR z`2qs(E;%I2s&T03F`AQ5$#NrMfd6zb=}1FF+D-)SZ%zL#e(r`ycU_p#gup6BOTg5H z^4LU;V0fiGm(XvTd4+EJ_48q-E4wO}G(O;MWTV%Hduhn1)jytRfh0veG^${kT{D#EC^$^vr|*#AK(O z|IBR6NQ59x_BA66G{qC{<~RQaDIE*YBF+kPTv1=0EV_o=xVki4i^}Ufbml0rw5jqx zqoK@vPkfMxHl)f8Z*=Fd(={@8}91!FkqG_ZrM_Zc0re%?k2^NpWN`bNoa4d|%#7a~gYm6{G8U8k3Y#G>8ja3o?&y<_O;%KMG%~K@-x4TP9b#@E zP#0VB7rzs&07-8Tpgfrj86P-O~53dctSKXu60<7r7nf0d)SMT{t>vJ)5DkqY|P)U?YcS8 zvLE5JT(Iplm9gCPf`(VYS-yt3;xCY%(G(g?ZF7nCP<-q|o5S#hp&+N7laz;pe(~TBBpcRvhr)DU*SAT5>CH?;%IZkoA(c8rT1O3a z?mV(n!D`o1I?~`sNgdg{nn#RISssdd{w=V5|LGTZM44_Ak;30{Dpb_h&iX(3k4Glt z3YFFF>*1VMRGbH3|1jc{fJ}98PxFw}PKXUdlX>I(r?+{zxNUotX|)&Z{|o^F>9X zdy>pq!E>vOo<0pXmz&R?x$Rc+*eR);a>MwY)GfWdQQXiuBtT7RsQT}JRsnr<!*?o@=|Kk^|A*y!5onYoFijxygmnN7bTb#A@26HHakT;LD(cWU=7 zsuBVRHe36@IcZkuSzt=v3+0^GuJd|qVI^-Q)X@6<4(>>@vSx)2D+g6J4ok7NOnV(2 zYfk>)rgKi~Us{>DZ|rvo$`(GuIf`dGr8*6`<{0W>zGxeMIv8 zeC|N)iid4R5Gx`sP@nGk?zH})Vg-n%$JVvPva%;kLC+}3m9?--xvmQ=Vuiu^!Tv9B zs9$e>Imjv|{s2N9);XhTJdaQ?!xP7D#Z9& zJXF?v)%*R^v-V36AbNWc)5`uVVG`e0K2-ke+uC;~Vy;;Fa^pE-*%`a$V*t&<#SSpC z*|L{dQnI6u>&PO>6NW<%C51359Ovxrk>gT%txwbCQtcGQ6VCv+FN7QoOEhbk zRw2k@7nWUU<&?#Ga*;Fv9O@nwL?ZJ0kBlPEk&Xk?Zky0$i^Exq7f_b@t)G+taWkKX zD?-PrJs0P|Zh5q#Q2O3aqp>9&HN4%nN!(0iK{Tfv|9=Gvr-2+E0t%b)1ej=w4(aS( zH8-F4(YzYPxZ(twZUeWQ|wt6I`Bu9hK- z`b7TuvuZ)rr~)dH_8wc*Q*b==wtkx7Sea+V*}a5NN;X9wngC?T7XL5shEQWqA5e@n z#yTO?N;k6p#x zD5zgSeJ@9{D6}wC`Ok+HsD7Ax5>AK#Hlq@BqLqxsIeT_yN5(_zMuNR_ykaH7fQy{l z6M|e_RIMdsmVG$xX(J(Gc3*Y}R_#z9|`UGWP+EC-iMb z1~Y}qD085boO(b6spqFukc(o-e~iq*D8@C`Gk6;%X3rTYXR9T0QQ5KlxNG2&iEiCe z;I2p#c{+K+|HX7J4P zBs{M;Q*pWjWJJh7y*{*n6I5<+a3Uk87aqyC51-;V0`Du~eSLW5GNDLiH>JPwDa z^?8|GX2@v)M9~?c7Z1+9EBcC}MHAv&R2JgRogGhF0SaJa_A6xWq&63IEG7chFe`9~cFIJL= zAdJk3-?Px7W0)B3;(Vz_60)1prt{QG`#CtV6@_yj2v2r_k`}wSi`pu9bsTb;OZ|YF zEZ_GUP4989VOY0*{iPDmLDlWqDw##z36RS~BJKxC%m~^>C|`W;r8v{xFDr)srF296 zw`F|NdzJfOd+Gg-qLLX6ZL!=8vX+Fc|5yjUD~3tQT##Q&UjSG*AF!QsdPBZiZfjhb zx8!Q&>>l(JSD_j)zlC5?#%ZM`zHRtp(nshDICrYnwKu~8-G>D9b+NE;NZ7}IhVsT6 z$`4{1?4M&Xfo8Uz+9ilQ3V{4Mk8F3($Qvb8{q`gT8~}ptg|LlczXyu@c?B!H1RUc6 zj?V(M*KUR^0u#?x4@;zrPJf%VO5S5clZ$L|@swR8`z2a8L+p;1QI8eR$KZ_XTY3)Rl?+3 z0EL9`S0aIs8t}QVZ^U=YfZ)7p5lt!rriHA_T`tFpCO0gWY)wR(u3GRYzfrm*hb8ikdz;#0t|T|Xt^kN@Ufbe|+@9!h z*-;J%k&&eREBa3DzmGXpvrSHXens!8_xrJ@Xb5Ozj3SdvEgNPDBv8ma1>(yRRS;JS z6E81hDV_rXqSReEHje70_HkW#q9(>VyADH@$I{BHJkvv#M;ovRkC{B>fvaN}k`Nh& zN3ppt3j%qanx1zVoYD^t-r?IThLp0yx_KiDPKiY$)I?inY#E-zt(S70)UZL!@oNUX4E;_1 zrBXDiB(!2H8@?`}gc{HV6v4I18oi3`8&~FvbkX(oaHUvw#yv(ftu*lu7*==B2vsMA zV858hVU7iyf8Ry+7p`ZH!RRG!%?7)%+!-Z_i>vPJOX`zb=J3+}eNRE)fJpk1FF!ln z#}=^6{_-M-7~RBlcRQelb+C%v@;v#Bu!E@NBmy6=S0(;#;_>Qg*<{F;a;g$!6)f)sOZMk zlpxXG$Fp$vRf)M+X*FPM9qszrMS)%D{``48Ntz?Ji;!3mw(!PsFjtf=^|3l|F7HV9 ztxZVj7M#hHmK7}%IaK)#r1cP_GSGebCM!03`1%sM#4pvd+?lcN8VjKMe{=}~ZN`s* zb4O}B8aLW8YiPcn+Dqs2+4<1jGeY#g*{&}t4dwDuxG`Ttledxyxk)0CX z@#6fMwtM(H)y}X>&i*fyo~pquvpgP@czs*R3`t%r7e)F6u!HSvMm*PK_AJErb38cW z95q!;lcZ>UfFsRdfsCRKxQ<)A{fkgck0x!C{XO40bn^A9U46}O$TnB0xKWP1ja$46 zEQ=6tYCArfyiNMIrM2bcavaAjC%zS59s9kJzC^|v0lN)HOV2_nc4z7ZZkl8b`y3A$ ztQjg$QK$=>xBv;W!-`xt%Zj#lsqouf0gAr*Ah<+_{qKqVmihe^-;w8OgWwcx_w@wq zkegm7bEz6i)i3<5bnpManrb#W8O#Xt^@4RW2o+;_hts^J@jjiI55#?L0PrF!-=H1B zKI|B-==5%gQp{XBAE$+UlVa%JU9zFuc%?^hi~mkhe&z|E-ah?UJ=G#>oR7J#g)pG~ zN3B`40yaDpb@rrt7M@(zA#CW5acjAnkBTm&A`{$>)Qz}nca;pELr~t`LQtL^j6D!E z%I)epIv0RoIv?|je?8i(d$wG|N12zFARBjo%X~lpYlPlT<7^T$QqzN{?5>glhe}(A z()-MHAvh7oa3aIhES#l$r<37DL$dfN6)QRu#(?j>0T$l#E#|JP?VhWRRURP+{7nNI zIJ^28Es3=&FnyR%+2Q5AhhWs)jR?C-Cu|59FN2|Z83QzgbX42CB2lp1%+syu3>b4Q z-nu|hV01%%7b;l=@vC1U4BlM@*eHG_RwZ6(t+_odU4ku~c_l3~Pg9_YXp{cAK6P#C z%}&8o{*=}qBInY`(&)W{(ZZ4UTn$~N+D6~1D?6PSy16}|Y0|kkcC?0n9ep`#(P=m* z9fb%@OjeC?Rsv#k4nf}(V!peZO%O9g;K)`nfxN4|6A_}EW~k+u(s7A)?bAtu_10tVMC=rn_a>P=mi**Vt4Yqe z?FJnd!0r~C!G25JOaAG`-_1|4N$gDKn+lh~VIYJOq8vxxYj;yZ2}e!8ltUR8{kRK( ze8B1hB2m3e{`>fzPD8X*xHSnTKsDqMH$aTX!_mJ%@yQ5pTM|x8Ju;x_LD&};X)GZW zAXxZL-^8E(RaUd34iC3`2;xft6i-Um+K!WBZ>P1quVOwN>{JofV99~;9r|>>kDN~v?7D$VZQBkr!Twnb*xGzpc#4ZiAm;) zqlTk9T~Sfo1RIT@N+jG66XIEX=&=bMB8R|KHdzkn9B)fXJQA^B%t?=y7q^GX!3TqH zAO_em@0>2eq)KFI^O8)3haqh+?DVQku;Hr45Ck!DoC+uF%K8rFoTxrDZr7r*_W$6G zpA!t!?C&t zxU$2_0U#_wD_9i>PO44#njXj~YCK2RtDY|PQWRvD(@w|WRYeU*$g9wL+cw!5H`+~_cF=jhkB0g(q zR&rpr4G!+V-^f^oJa*#%;yDba$EF+-Ks>oTL??R*w+v{D^YFlngNo;vzSTyIhLBGv z{CyFMz5^8bN8PqRvKd>%v9;(PS<;G@sfk@Fee!z@bFDfZg76FVzkU20_Kp zfa`&=)_<2@FDQnpMyQ8;A+U-HBG0eOINwDusMzt#RDxhcvv1q=Wy2~kr(B~~q^bM1Ds!FBAv^%`q$PPT7Q1{)^oZ_4Rz54zNN_ z>`c!yU}a>Px$W=-hNVaq31Z_yoEg}zjGpc+eJ_THq8Ygpm?&*--5vR@k`#!crV^0Uk!z>-<-_CB<`1eI+67`)iz706+ zSFjb7an;v`XyjG`>3qCQUvGNnS*e^Q#=rl-R$1T9N#?YBl^=MX zAyxDdjp9sO#aTq4{moNbwHH$FLD;Zs8_2MF4$Cf3#3Nw#mT|t#=!^{7U{g=|sb7rIqdV^ z^rJ)U59~P|a>!qwM$-=uzu12^$48A{df78<9lyK8|YT4A)xqe&YJW=y`hlPH-^btFaTo_7N{tssQA48HA zPS4ZO82~d4Nm8E)s0Nr;nr@i^fA!*t&@*7yq86O(;b8JCOkZL@vFg-`V-0nMC5p;A z+9DcX;V6nb%+0&o>?$~dN;JDD*LB?r@Y;!$*03Q5HCOrR?m=offsrT7Kd0s3ob*3T zEwi3PWN-4Bqi$z_@b$2a>fKw@NBYtapH2tZP*PaU*<-CInT$eRFt6Xw9$P=VA(8G& z1cdj?WcIY@0ZrlxT=OfDR}>JcTYao;K(2Eot;s}N+cY>RBY7Y|up34NElc2a&^U8u zAA0O)bj&&6*1tK-m|=TQ^fg6F7ix?mARkQZg0oEDpc%{`zmlKEs@|&M@oV)qH`Iz# zwJPu>5!aS2F=49n`3$sDc4L`qVUEDZc)osdVW2vYpulPYLo$258>R_{LA*X-2LjEX z2`k`=q(J>ju-Oc7Msi1pqPEB1f~L~W#A3jBh|v6sK>d06u2=4gzVrU-UerAQReBJg zfl)w&gef)sd~zQ$0^$@6BWhueq<|$HOr%Y-(vLN+h{Rg$qIFk;nUayKEe|oF&x)k0_+Ae|GYj?v*wL?a33aUOTOpAfr4|S_nIIVI~sZj*-m^M}0KuttkC%?9AsR@nQ7g7R2yg0Gw z4mRSAvbmNpDA;{<4S-#*QDkMlR5{)gy~$roc=M`~i01uC0l~|MU9MJ{3vV>O3zHdy zGAGgTtenH7{IZ^tu7o#DCY?a1o0+zN>k+!f{v|OgHvK?9^E_h#>vaWt6C-WWA9S$X z?iwBt8I3dlJiYZ1NLMX)?vsL^U7nDSh)qAs9}5dtcmhg|z-=N@(0-Y-enAGY0Ip|h zL;lGi{PMcZZ%Be9sNO+hJ$a!d!CkZeT6K#${l?!$!9F|y2VSo=JcN7|?7L(Vm!MB> z{i%^g7(cVK!M|^{ceObs!iDCEFAsL-wIK%+TsoKaEicKl5Z7WuuaKcI%0jelbZJr4 zUFEySqYLO;Q84q?6gzQkNV-WbMA^AaHMVToF*udB4Gm-N8$a(lR-r`u79gWc!tKCv zNCanG+Z+OOM#UBD9K0-&izNMxJv^?Aou8 zMO**BUNk<*%y$dtEQ24r8g|+wxT`YbcYTFpn1eMKKdnL->6Nt{S~|=598#kR)^bb~ z0kf@)E(_gD8{j#ynNh&X5l#hc49!~%d>P_-=3)(Zqu=kx3hr9!1bCjQ6`c->J8vD& z+jv(>{VicrMv$;I!JW>BpV>TvS&-J{o+L}2`)HHM2#wh&D2xh1#)9)dHzZexLUy7v za_CC>R%9XK(osZk;-~j|Rz3XchKId^k%y@K=lO@M2^;h?qbyYIGU_ijOxVaCr(T(feOT1*iYte5MSd6qLJJR8lW z$(K~wk`t&@!uTz>Mr&o_Qq!T^OM^A+=)pfywO(g-LN)0_$ImS9)%jh<#CS9Nc z?uo1mD~GUHS9%7YZr3Io)>!gVK&uC5GD0)Ylp0MEQfPhU^gTb{G}X0!VP{SW5VrpD zsqZWHN?=EL@NO)aKn#~AI`FgMp1%39WIs0!?DXwWXqrPsSW|zn2qr18n%y^S=gA8@ z+t&f)*ev|G0#jF3RMUKj*@|#w9R<2^`(Cnh^bf-WKCjEmM|cQsh9oFKU=D@W(i!=8 zo2REKM7>w?`u5u``XZc1!|a#Rt#g->0e#VwEmI;tCkv5}sP(6OLlxkvvcq`Eh!=J~ z!84SO&)CX~mzga?y^nUFbn>(TnUJ|0&pk7hQqI`pb$I}3lTP-K~fIF z*Qucr8YwgW0;^toW1Y(zz5qCmGc8<1BWHt$%LT!3r%(_yEG!Q@EoVVEp5i+&Bq>p-4KjL zMTMiks7C{hs6-yMfm}Tc*a!?q>{CEEed$V>O!{o1{bv4<4s^OHa7z^Ct5>k2w3Q&5 zgf+CA=MJaeb&u=Lxq{XWOBWs-Y^FSjoOK920q>Pzq=1!c1-2;T450looYomV=bB|- z4;PONN5$<5mnlGLv;svvE``?-GmPiegyaur{;7__{9hi_`KOjktq&g#5TqxOk&ATa zO-$!aOOXy$Roj$88lNU7Bk~s+jw_jtD@Q(H^^=z7*B-`smsAzJ6P3Ul?2$UzWUU;? z5X(bm(J8#%0TA?giaU0-QI%~C*{Lqzc;y4&0?@L~@;4v=MfdasJl9y~lu+!9-R6;1 zCEm8z4vve?%AuTdAS!XqfC4*gFm``t-18rG5h16run)YAZFQQLjGggI86FpT&8>y3 z+NpH9*5fg^#{#7>s?CsxDdoKYlL;v`Q#$IEs#FC5=gMG z5}V$T1xZl-gT(srH#d?ty#tu*KXI#=Ty}wq*{qx^Ryp)WVW*${*)n{DsCDzFl1l** zsYD!OMw^)~aB_2;R9F&_jL?;dRNm;3CR2rFuN7CIA*# zNUUbX2Tx1;1U>I@Ai0c|F-kx&RI}j|!#{IRn`;3si!RT9xGthgmAFebnWVVpYg{@0o54B$|N1wMBRNa5` z{1#60r$ADsiMZmoFxdxhk+_vCO_kafXn<_eBf?810z2(3i`J!ttr;Z;bQft$`8^N&C9p__H!dmNv#z zJ?Y#C2p`-P<_aO5O$-b}LZSC>aaKQ*t&E$iB^i7(TnE5HH`n>M%ZFq0gRyxUR|3qC z*-kr>v!*7*81k+-gc!1>dUen@|D%+O-)+;sgIf}P(%%=vHcr5CYg{mdG2S&Y^Ao{& zfL(kUZ_d8Nbpq-pjjt(&nQUu$NguZGwHn|@Cob(PiJAKwAL!BWS$eD?^;2z#W5lA% zD=RW#2(dk(y%3#LlnhWlZWpfT9j*Qz91;2*QG5>GAg}Yd@WnsT6PDr9Mc;X*pNH2g z{=dS@&ouZ9zkYx>^R_ltdAD9tS<66fuk!(P-1&guB!VO<3ZhM_GKb5X3 z-wP9gc%GN3s1Q*m+FS9Zal3(k$hh(PfiTzIi^BHH+m5>jprG^`n?heMUBuAEmFv>+ zMoS>Q11|5VoS4P(uIw%0a;JE`>xIX;{^72o60E_g3)8hmFmvH^{Y?ruxg+i`f+}2Z z+5d0GhV|vuJl0Dh^|Dl^mn1I$jC+|uXSU4)e1B7XbS#4>wg=-_R=g(hV?Kq<@YViDg@nwdkT6#ZG<^y7D%2gxnuD7W z4gK5N_1njatCggZx_bb_d=WjoVN-e1UcpPv8;B?AA00_CyH?n_K-O!o%-U~061OSa zt2hoYDm?zZ!OnX`FTK)gkXd#u?DuFldVs?<$m7209>^;E_O6AWKe1JA8T%6kqn52@BUuWJUu#o&PAX;Ac!4pPI@@<{j??5aoHviC-@8+-M$REl@ zdm!gBpn!NX=eV_3v}vxURqm7S@pvl zVHdHJak<1|l)rJ-?J7}v1cU>FOCQfJ>#B67(2+st z1Ht-O@^sOP7^da!l|`vcp%Vk&C*r?}vRc006jPOf!zS2Tk$Jkcw9(Q|wWJPIZ7&(F zPTethyrvX(R8XEp`Hkk@9q=&B_j>>?dlj1Bq>3CMp9&D(ojB2}?L?PzUs47*q2ybo+i)Uzg@ zky%jHjm^`90xQru@ujF7q|VR0Oj691Jm^SoOO9-U?z$Y}ZIIk;_y&?WfouX(3uMoq zX+uPDzWw0(v@*Sj+H+HQbD=xXJLsz4VUvD$LwI9Zc~=gM=+0Oe;9ZC?;1&?@fh%wY zgeHBZc7S~WFdZszRzWaUn}mnz*~JQF5U0yTN}2G>o*?DRHQ1IsjcsLCdG(jVX%2g> zQFl7uRiNx_YJB`*=5Hzv0eO>C?yvUI)t-m0orR8${U)$~TXjN^jRYTLozIur5UUzX zR=|;*3{xe$;VDCHu2>bIyYQm1G_crNsJmfe;EqK8P?`FNvLt2=?P#Qqi$C;$*Ka+q zW7t|q*eG;6O>s4U2+tx)0ABEZRc<;$1d$5X_kXSR`|0`vCCC#$yE;ztx_F>Yw`2ib z#ebgeEu+ul-o=bc|HPJ?ita4**CYlZBTC@QFP`UIVs#u%3cz6D8KlD6XCz_Va33U==0|p3ObDTM5WUL=7z* z83wHNlo4;vL?>e6AFfd7)L-?bc0R=)|EM1bwU7yQ)LMCiRc zxY(7?v6)Kc)gu%mmmL9HE@+2EF1cQ|PR5H-(>_H*c@QkVX40QJk&2GIfB4b?5yB!b z9`E!&7T9*=7sAFh)OkAM)yi35*G9*9L1*`~_O&hF;udolxLoLtNj1_6 zsY!96Abs3hS?^;~RwY5PGIB%tOWWRp*zE==SfCi5nwbJAmg@X4+MAoMJ`LMcv=#^l z_6!I9jlFRv#$Z^net~Wtg!QFi9Ot_KYt8TRHKwAnGbhvmc?{T`m9->5Ylt1Y3Rerg zBKTtix&u|sABokq#dpbYkk;bswgOlaV#5o|ILIJ5&#zzx&?Ne6KdQZ34MB6KgvwmK zJ56!B2ai8o+g?^)KOi5vjK5uv3_^{oX1bv1v^*qGcS&>{CriK``iO*ZKz!l{V6pynEI~ znx+rB0-T7$AUwyv5*44?c=K?sSE*U_oCw)=!Z>^pV&T zZ5di7D+W~q6>R2E474na9;N%;b9bTkwW8RISj_9Cfj+iKNE{em~AK>)ONHclPX;Hs=sj_s5SR#oGJtQ zK=`111*rhKWipgwPs#`3LHZA0LzA(#V&zoj{Yjsq<@cdCB6^S!k{n&|h*-*M9s7E; zDJK_%H%{OkR-mYr1Wo+g^*BS@g}6mQurAhDUbQHE#t(tJ(Fw+Q?=eKcRkQ*dJXw&& z*$F{(F?6*06n1T5=XOoIes(MtQ;OEDz$8P(PlZ4hlGk(g90&dDe^UA#DeJMhEB^}5 zNM=PI&#M?xM^)A%)06#=OJ*e=ohoo5;Xj1<+COF^2sNMB*ZiVEH4GO`*=JZzd_|}L ziNn1yHc~fJa9BCWI4y6~iAJyeh5D`dHJLJOLFv=Z-Z#M~mR<5y&xJgbDM!Y|-_-Y; zg+7k(hx8!5Q)B0=5=q%nJ#Zg*j?WM+cTATbfO1K^1zbB456;27I4rue{IRN}$gK84 z{^xRiXNymf(iNE5?~HUln){0s7YMfVLAb%qhl9&_j@wSy*Aj%gMma&0!dTQubg#RX zV#G%8@Fa$kzk$T(+J2OQdO>6Y`bTiXU+S|9g_w$QTVGP^3lC%KD&O&d1ZkOuew7-^ zu|_lE18N`~2-{U(BI*%3q)kUKl!rt~WYoEPc3@SOk6 zOR=9vu79tpn-^M~7tT#Y_k@MZBDGNiJqH8zcd5G*<`tV62a3IztnyohO%=X%>8A2$ zP(QhSr<7R$2}DMGd;6ZD4m@Z2O&tb2Ju+I}NZJoL>$gHHaxA5J#auVd{d1CM;Oc-WX?$W?5Rr?%&MTdM(9PyDSMo!fsK>@ z1TfSh*UI&zR!sUgWH`31;@hs1yB*l+9&|B=8vsKnqLsn6@mu~kT(aRhsmW3XpEj4 z?I6{So~_|7GYQI-c~+_}umkSb4pr+F$s#j$nB_BVt7%Ym&=8a>99gbN4-Qc@gH(*n zt5;*DAj?Hns*)&XZtzf82tu7VyC~xtJ-u$hR$31`92WIMPK9~lpMT~f!G0iF;{Trs z)MY>1Bx^AV2~UFpvwz&+_*c7DA3Qm98txBQmW-xG<{0@T4NzJ|Ctkch($?loe;-Rt z_q7jiOq$2D)lHeRb$;BL$U5ie?F5Q^0fW&(vz75tUd(<(aF_u;f(mpbQ+z)dbIRoz zEapg92ttqOM|(MAsJ?-u{SxkNzLZ_Qk0|1Xg^^C3(QiHy>-CyJ=7{yt778uUD{;*<%}+-Oa-BM>W=<$_Xu zKVTuP$_~-~#b64AWhgJFZ)L>2WTv(I@3dw0`COMOfVm5&Y^_E4gV9%%I4>$CN2BuL zt&k}Z_fIf)NVAliGnV4(cvS}b^WKJ&K6gJ8FqR(blZ9Z7zxU??gHG7~7PP(v$Z*FK zT({z~=sa287nqH!F<;$gum+1D1E?rIK77w-sF|W6rKo`egrz0R=_V2B09fqfyqIUw z*2cE^VOt%uET_^*bwDnp1wtQ-4A1AaNgZWM3^_c~&!4oO`bR;o_7E35u;0jpM7yj| z7w76)f#5Iygrh5|-RC7Ufpb9`lsY_Pm=Vk{=rayY{Tk{L5BKOLqVruT$0IM=EO%P- zkZ5*c@iC39`-+9@V3NWXem)BGMpg9obYe5d{W&omk8^nm0q#{<6t z&J<1TYPIKei41Yx%7z|nuJ{++k&8HFr_^t(sBmZNUFB6Fauv&U7hnH#R5L`g{LUSg#o~Td2@Hk>7 z%a*A-3i?fe;2)y;T&cOqWw^ouU%m$IMQz2{io9_wj! zjSzY<565$6Duz8RMaA`;3Bkpgs(xNnF|NgLM2LYh=iX>Ie#@)mH`igN>#pk9RbZ=| zFiP`*vm2G-ozp9IQjQlD&a~VCGWPXeg=!u>T|`_3boKn*9^Zc8|6|_qND2I&J3{5x z4-eL5&ju13yi4^IiNk%m7KMALcaBy7E;gg}IMSchb@qf)?5d9f88Z*}!?jjFXghJ& zEw|xFvSAAMP^u8-W!j$CJ~f0NqVsj;08?->SCS<+m6i=}1XGXrs&S0ZI0t^oqOD+h zsSvd4-Ye=|BO#XS!{m0hvf#@CxFqlT!2;Ieke!uyG9RuXqz1MSQI!E(QRm~AIu_Sl z2;?1&fgK2Dwp4~vS6J9#w4{PEQr(0A8o79;ee7Q@X<|ffOG2m5w5ZqIq+WmSod#cO zBGQ_nmkI4M&B!hxX_99U5ft=QC4sNdKz|DzU&A7sYN>cXpG+YqclnzvSwsH-a9 zHY=1@&!tdKiPh9a;HvCmEi2k9QJdEBsIq)>TO&DL8#~yoHKi3CXmg}a|Eh|!#u9|R zh>J^)B}keh%P2rYfJc`Zfk3`4?7C*zAgZqpKieeQn$@LcDXG}=fI8HO4an{aaMek!pcA60l{n>ZtOlsjD6e3<6P{?bQ1Dh{oktLFspP{oL{7)2BZB z6|E;nVZ#8IR3&2a)0k}aqRw_iABt!kS%Aa+AoeS6v*v}RrA#L<%zgd4 z%$sbs-Bo#1rEj&8rq?7bX1uzHeVOnWIN%S&A>|}HVBpIp%27a1(Py&x+RAwX7ym3LKGSXrUB3%9^f(SLM!6VmBn@;MYn+5D#$W-7f^Hxe5yX_1o`u-r>1iw|2lt@lPG)-txeV-ML zTOPOy%|3NWw@R94yqg?&8{Y6cp~=3MU1X3XpSW|0kxX4_@ilffDm!G3>HdwRNl$|{ zXHFJ**=@4ZVcL$>Iq4E5(Zh*9aOj7PH~2hIjHKG)Hg(kQOUuA!#8d&+GY?eR;#3G* zsHpOPVF#mS;`9cNT~sj(Lyw`DSirl5s4D2!pk126D*?)my+L9I*KYi=p4R$vIH4yN zsx*I12uSStypY|PoK1Zd0y~A;`{a)^XZu{N)Mxzq>Q!2`3g|Q03jcO1{4Y5Pv_}k?q zQkIlZq<{$N$d}6NiAa73DCbZKl&c8v2x96i+mP3I(O}+S2Ez2(c5@z%syjRD+~h*U zkzNSjr`O`9y5I7`Oht|%?-tLoeM6uFd?n@U%a=Ptl%WC4uSg-+Pl_?>=eXiaU3 zLr9C-oNfOOa^j}sOI3cJI~fDgPr37C|93dVhn|8$Cr7R=2xrAas_qHFZBj8eoGb zLqh@@hk@u*#eBkF6Drqa3cuz~!8`+xAx3omqZ36FhRdb`)DS}F=tvY7T!AW_5`Qvx zt>wCO;R`UDVOsKC>*x6+BL))@@DP;g9H`>ZW@{j4fw&9)?t!@W57Dc3p$4myVX?Aw zm2XIU;1Rg@S@D6OeX?s4w$Yv^`H$RB895vlOb_pmWiA0FZ*RzP-BdXIO0nlx&a0fr z_UQUOXvKcc)t7rpS97b_%PJW+ITkrY(>XT;ASiHmF9(OG_h&Zwt~yetD)Go>+yde8 zn^($r^BZa6?1RB?WW?iMA2S4Iw+#drZ2f1cbQuGee;%Bqrg!{Xe=1PuVn5ipulgd< zavx)Y+OvmmfEyawTiB~kxh56^TZ6+1FToLk`2+>Y;PWUMzWKYk#uNMgZ4?|2qi~hs$NHXP__sC9V(PCe+msck>zW=nqcBKZbvFnhCJ{ILbrzK3`LB2BI50aZgsY|0>y|ISNjBr-r9Y=Vtd627;Eg7 z<8MU*D8676XkD&A{9x%XmFb)>^Dk`+faQ|OKX!*|`uS;_W?Y^b6Oeqg9~c;s*=IKv zYA76IjGO{T0OJC&#*$rDhBOlv295#xNYUCM-mpGe_la~xU7}V5p21AbL-eV?1lJ?v z8jJ?`luQg0fH>d$#PHX_!UMWHl0Zi^q(}lBh|tJvNcu;d<26{uw5EskaMzyh>Axdd z6o7FKuVlsAYi<&IE|Z}D+J7o|&I$xG1sz+pKypkw0Q*yYp`4yYjlQ`De$8KY%GgClB z!#m45OrICBPxbc=*E0z5T}OGe^Lo4wQwpxU=szWvq=5l%-MhN4*s4D?K1|uaN;V6! z*w;S;NT7ncjFC41bXQ9^BhhiDXvoJVwc5ceB5%)e9?2}DDQDSHC0nl|&#$DkTN%*Jd|4RK;Oz5jHWA&LE zTmYsDb1lVoMxVPPKfe?J;dk@-k^a$l3+U_n`CEWB&Aqw`I;;g!ZQvL_5AtK8+~M$!tSIqz$2zye&Ra7%=N zOwyAUZ!yEDj!PD?7=(5esqU*mWH?lR$(`F`@x%|vf;2~b1x<#&IYLD7cU#~oU@tJ- z8*I*kxLSKX892ed&gR3fc8NnxVaoX59_pC@sm>M4tRJnj015kR7k}pzcK<2|@+`UO z5ZDiB=dp#(oC4cTCfEG57XFE10aEyGGcYi*;Eij9(U#+CYZ2$6FUhX)eQ5_J-$R}o z4E&7oh1UNzEKE!tHajC2VvVU7Oa*qH_D3!+WXh6Q-MEygK7)W8#$-DL$u1Jh(HD68Ho8nJvj#L z&<|MB|K8=vN7k_wG zh=>T>dU-joeq0;BUZ^chH9M*3h-gh{Fv>h`F1w##0u)*feeAJw08k24;wg;X) zjhUppFTUbu>|~L7TR|w|oV_ez(9wG17gqknI}RP8x%@|hzGOytSZV7!W;&Q|uXwu{ z@>mBLf~xhwZs|jKXdo0XO;_#)$*E3c4jiiOJlb`E&Uwu$SnqrY39lZ8G)f}{3K0>a z*ZT*T{fvld#L2>5xqa1!53{c)w7S5w>gF8s zjvU4*>|`d>51%Ef$g5SksXH4DA(`}4gVe%x6_2606{?F%~mkRBuQ3}89% zx9bbGIWt!MMxOxI$xAR<)tNuhlN=6!)gEV^Dh|0zOGgA+E;)B%%U)L*CS7P7{qT( z^9nN&Ok~t1kxX?v;f`$*Vu@RvH3ju_>H`{;WsKM2iosMfzw{INfY9{``YMt+*0XsH zZ3d5DGVkZPdK6@7eqLQlC5nk;iaV;(gXogMjnt=7UnoL|!TGf??P z4dR*GPZJ!Ev_rfE7&2^J2#_TKAajKy7fC>h4Mb2pNK_lV1j4>ZwD(q*Yx@@)L?Mgv z4lO?PDK+Op3(ZxGYb!cEly;L+5M_*hrn;pkZsZwPDg@=EIYgk`J&?Q&b?Ob*_1*%t zT0nLWF33>R%#9@lV@r`|Ktv7I*j#RFYg4pnnfbnAKSz$EcaPGXIa7w{6p26F&)^HQX2%OIBZ;?(2MOjN$luDOgV~Gb=5l@%(kPp3`rNmx#ASv5E&5)(X zF_mzK#UX@ftV1jG`CUa0>Sb;z3Jp$WZdB`ra?@*f#Q&hu1_<{e;0lfRsKOXMYB@R& zIF4SMMy7^aQY#4Q5N5c%Dm9;I7|=+d#hxXIVv!TAtigv44GMfqn4md4=|c)S`EN5+ zNb=`*l$Dlwe5FwqTFUd|_F4dQm;Abo*+L4|aD8(E1uIQ1#TeLc?!_rGcTGN9M{|_| zHky+W1P&!qT!kRJRlFc%^)}JQSzDGjv{Iop#y<*c4)ABEut* z{=2C>jC&^kd~brDdcHMUtmWCssFtd5f4_C{ zfuu}z*(uT6%6oe9!aGvvTaUzCHVArFO7yJfC!;q~o}w_MzD6IYlm|9D*2mKS-YU#B zFYp3}Vn}OtXtdxCR2`_oIkN#yJKd7=E)IZkKT3B>b+qZf{eq6>p9lH~4Bcz=xdfn%IQvb2U<7?JaJs@e-L%-M91cDL?~uCK~lEZVdy zuXvN%$Jd5pXS-{9xobbSZZpCltAUJ;4M9gri7x!b;s7Hrnjm|jqG&b^23G`TR<8EX zSC6bnX9@<7nwaf8X$FS|^%MjV(^OT-5*j5cwGd2I`ADP%mV{x+g-Ka7t2AvsI(BVn zVSspQuXJ7shO&)ff&5qFT0rCOCRSFu2q+~DRc^{2t#Z3_1kL}^?+crxjP>^o^~!m@My`Wf%KS% zvwD7M7p9OWllR{cF2(~tu22=ByT|=Q!Xv`zI$#x9YdiPt4M$x^GffZU+-y3)6*B!?^>Z3Th5)Ez)$%_ zqZ5#k&w0FEGHTy*X{kaNKL4AiDI-x1@d@dFP}=qhZ;8*E=~+R@)ooOV^D^bM#Bfyb z)E^`>8~72~Czm5-h4 zJvWm3(Bv4gk2p~4-wpSHurzatM;cChw4Z0_VB=c!MZ97Vo;Zfh&vU!s6bGTj#@E3l zO+m)=m-t)H1Eo5IP`O}gtMC{nho;5{+U1JEh(&2$K-Tt6$X>Sr!VvIcV8|P0c1|SK z;&NSID$Ri?Rnlb+ihB*?z{V+~g$$E)02!#`0J z^jJ%&;_+jsSlW8U3|7E6Hop}WPbk#TfT^SU;caeBEDB7d*uZ#?&RFMB^nqJY)=(iZ z`W=mJgF&TbHxpFw#mVlX=f%IIdgZx zZyZsXXg@i9RB5)8arp`+HHnP1`zPKaL6dd=|}MoD;sf{7lCjd&18)A>B($ zkI7a?0@(|=AWg+^H02kMu2MJ)!YLS0b;WsOBj$URf@COX+lY;E5ZaBkhs#3Srm!*c zGpz{9k3OZ*z#`&~zp1^>H%ddEhjMfG#0wXG&_??%C=SKCGBict%fP6mc-&?>rANax%yF#=F9c@aBXD zKPe%SCq7t+Sa0R0z{T;!5jt=dtRlC2NJl%AQ)uegEtc3G!T=5_-b*xkz-HyEbj%t`3YzL-jCPxz#tw3-V^z_08lwOq!5Itd4az6*IcABzI(0;VH`!kJPBt?4_9W zvuYTT7XZ6c>8?`3@Xp;jk2M-ZngBE%XW-a2SXlA_q&7C)h7qM-dZ$Y2t)IK2l|`ZTo0);vqdy3Ia;_(N*m0^l1{0%AMB!V0W#|HTO=mOySlVf->~b&bM{chA2rlHJA@PN36^$ zv@%4KH~*y22B}a|kTq-1B0J?G3FD`bE{T4dY`T>`5qws3?b8(@o3rhJqE=@&zBw+U zTt(@ujQ%QGh*6pN8;HF3*ip(`5aY-=kak@Mf&3S8u207!el9yJSyOF=>*~7lJyko@ zSstx&{S$n^8IGU<0Ub=%#s?Ae^P;~BfcTMS1lx`+nKMQYaEpo)4!}%=YysO4TXj?a zi3IQ5Tm`w$Sy^rk5+c-bemqOiO=~YX^*cr2P@I3-y?8mhxh#2J_%yDVNENY+e_v5wLM( z&t-n~m#f+l=39{KKYjwjY3OV7u4U)^@}K*}NU>HUuq{F1zxAx_cNG3+IBNcvukQaQ zpGIBEV~oY@;RqhzhmhzIidG?atv z7l|DOm(oqgv;0ab!l!jHv^rl_aMo@2c|ML_6gMuDe&UYd!$5nh>^zv@_NgE8EuGrz zQw3r`>{FYL5M9doe*G0G9N=Zv2mGB6uctoY?|g!`&wW+C`xWpTLUKt`J2!OaG_03i z>T`E-TCGv5yax_m(wvT@v98?Zlt{za;HQw$fb{HdvvB@v2gsAS#>1~%FT%Af`@eGF z*GJ1CUI1LULK2!VtKf9Z!xaVkL92n7ixTpgMagA+AM4@z+bo3OZS9iAHpy77vaXaM z>f*3)@{a%7K|exmZ$N$T$6?RZY!VlSnTEkyy%)JQwVmxWnm=nPOrn zm_{7B9cNT6`sq%N56nF{CbI6L`nx+>ev#7ahBZ8Se_$!!Pr0TWi|;Hh1-vDz6Uj%* z-|TQNFs9(Qe+68a0v7RA*`xbW1M6gK*Qv4>Wsep`T)*ghy;X{C6AZ5o8nEdA@r#t! z_v|!&sv}MArW}-%MPgmfwjjohiUg657!s}0);1-@n*!lh=P1?|1ktmy{QS^0`>U3u zfY#~G^Gk_qs0|na;bj?Qzna?(%dgAMq@kT{_}_h4e7y`5_gbwtKp3uo;Q{n;MZi!+ z%t|fzw`D;Ac2JfLNF3l$0wM@W;dHlu58bN!tHUbRd#9YL&vs&R?|#~v(~BU?Gsa%| zsAomZ=##D4q-mx#=LLQSu%q{ z0gJdx+vDMA>o}|iD%kgiuC{ilF` zTLd7CgEKEw%N_;LqxZLzkCycxNQZGX!o4G-wlAry-`TJXI$TO}74yFM^%JrZ zGN9w!#J|~Q2#`*6xvO$q#_NiIi@8yf5Iv#i_@PCHQTh}hz~VdpC&deITHcd#peSt_ z7^{OJ5C-U@R2?@+2NN|I9U-dQ?zSw%Ihio_w>?nba1m))wmbaj!S!zRbk=xV4dXuwd4kLY0Q6?6&r$;@Z83|H-vx^WAA~F-bt0<~U zPOU||PX?3Ha}&DbQ_hfE*Y{;&1xPPZ-~Az@;Y)yIXUvTGg$g@1`e&N z@M)`0588T%M^L1T>?a<(exc>0InQ6gt^?uk5=FG$*0ZoJ6f1hgSxsR=#Brvn)Rq7+ zTpuEx79)^rqn>5K+i=cbMWW{=@$!ZLBoPJj)DACAcAI z0k$mAn2)`E$Y3PR&#|IskE^@ly0|}GRQ>iH&VJe>_jM>fy zV#Hm5N2wIU4v>i_I5p-NTm<=nvC58(a>M8``KF!4{RVLm6KV5{Fv$%26s#i&gcoQ9 zxK>$jLUc2+Vf#ROwm=pn7FDfa`m z?wgzCH_Nb=%7hP-Kf|YP66f-2DJE4Un3s z=a1=lHyV8E@JO>{83H5nUaoO=bYc3eORUmG)RCrc4z!yX$^sZ>Egn5{Gj`q|9Gsx$ zVomU>0s7D9ZrSAnQ;Yo}qd`juzovX7wvE#ppFCe$&tf|zT|gyx{91tHL?q@XP#6A{ z%K2BToLPt*z~n4jWlzV3)@VXUvuqEJ6$o2Mx1ZQ=)u{9dtoafW#dadu@|IfZc>-4> z^zg;C?U5KT+;RiizSWKb8x0Dx5OEeq?1bA(nKqKhbR&s)F3AL;8`tC+Et_kGJN#WB z5)9W4xBI!C0fO$~Z>$ER=#MABmM*aHhYj9{Q>3^RwFaoJj*knfFB&2RUW7^ECw^cosR-VtR=IS z!VuIM7G9`ZD!YA2F;7s+`q2#o9{ zowzmFp%;pNDc30Wq9VK-jc&?pzcjNX8B#|906Uo+gogNeZSA18$|m1v*P^2BzD7s_ za^y6X%k@$hSXlb#B!`hiFkK7K^2gA`Hr|??T>ql0waLfHR}9U1zHx@k(3`4 zujXJTDGY8Jr?=&{rY*uqkF6%1I6rW_A!9f*!isG>(Rx@q?5S<$9jZ9?h~Bn#Noe*9 zQkKMfAxOJ*KR>lpQV6Btc?kC0~{v^bU^T=S5{Q@pE$4to-?ZSlRZjaauE z(255~By(ygWd^^Hb+c68rbScz%Nbz?K-@6M^dDH60J>=KUE2_$&Kn^gI`)k9&;wex zsr#{W`vvrgh2E7w6(IP;5;NPIfzKI81&U0W`l+9TH+onyrxCN|_%V8|oxQIb7dIX- z{QVD#-Bp`2%As*XMTXKh?7+A|7C%#Dr6orL(!yE4$J1v^sx+>RSZ&I{X*YR9Cmg!z znQ(Ei(u7dxP47G6$g>ZCXpwI=Nc3&l#4{C(viMnBw$`AB?MV3CRv0b1t`EB5!zrP> zQi60o+P%%+MJ1dX!u#zFWR4SrEf!S9#ykbIjd4p@f-jXNK#N6EI~KofNJY&L{E<*Z z3c)^(YJs+(jtEWH*qB(t6JTh-TXmg1qWV(UNtEE9;N@#jdrVkJJB&Gm_e!+miTEOx zZySPqe2x$uQ=9u{O4LV9)1pE-xY?#CAjE1}z5n5aHG5GIvqz*u@34bZ6Bo}?&jqZ#pa`EQ?!FA0tNrBYHETr-L+boyl zOYJC`(jX<*^2YL?gA6b*Sp2_XQQj|vcZD>(^ z>1btuOU;M$!K!Qb_%vYAuT&eh5=SixK!5*NS_N!!V#ry%*&(-ItZ=QNkypMmJ2NmmY2~EgQ&jQTsXcPm zm(@_I`2H$MiDYE3;Fw>i9xl5>wrFfY#j=3r%ci2Z)qD>25WYW8s+QD~KwvN*chDA5 zM>`BA6#Fz3pJH7>4MMnZNb+jE`x}UZ(+}Es6b}!rumv|ODicQ>MVKs=cc`Vpr`8Jd zopHF;2+(eX(uZ3t?)p66kTbCuU&)m1SYskZ^BC$Gfat!YRF^Rs@Rf`CQQ`Y0b`z-6 zJgVe^a&J2IHp*gcTx1N0j;V&1ofmxz@XP8{;9@L;2FxM8|$R+nGv>rs1TP)z&JU;X5 zFWlAodRJP_`MZS0DEDSE>?N-H^gYp)15!dv7bcQ>BPo}b1IhyXlDk6h%MEE?`qb~j zz$IkSOxB=Mgl0CewA~jnP`1;+9E63bY5H)#Kpf^#BjnlmD zXOiFBTeSkrTmgnr*3r83`w>muN^_oqpxQK*C|%X!%pW8QOp)5k*`g-FDTT2ACUtVR z2|$L5k08}#V&XW&nrJ~yCZz^dxtN-Wx9Jt@F0?{qun8E86E30s`v1b0M7m1 zB&Gv?{nEe9<{fN5vv#&Ne8L&u-K1`MkDJ3YvZu46oiR&=9*t+ zoSg8_I8(K+m-Kjr)@Gc4>tmuLQm9VA7GwS2h|X^W7KUcm?M{Q#r=+vvs4bL9u+ zhouVfNG?q2Y^hfPd53=cL?(M6bb~%oq75&$!#Bog3Wx;+`2ROQ1Z$41?ZcQ5+3w97jFer<`WOsUzuU(7XnxAN(sf( zsD2R+Gcu|m+quZP(ST{_PD!xQb+BF08no7lZmfnU`g$fMei|L%%*UjlDRqA*uAs}kSM~j)xSNJ$(e!AdFqsQ5DSnSrYC6NfRwGZor$gXZp;VTTsuj+cxqls}Sy<6}+Z-I50J3WL6m9&{AbfVwfw zsHVn|1q_`l$~}B)QwoqJ-_REPt+pvGiRC8$5(&6wIw{{tH)tY!2RyfR8Yb)v@s$QF5Z#-EN>#;;b8}bDE6{Kfv&vuLzJWW$apOzH<%e<{BBSb0nWC50Ecr zhP4gi$$n%?PO zb5(FBC-pE;EL13cftnQUi+sfsBF~Cha!PUl)t`GU+Q=e*26ltow|YgJLVl<|%Xfm6 zrJPnXxy-qVI200Uvx)9_{YG6Pc*Io=RWYh!ko3l+FSG-pt0((} zuO3Vi8Pj(_HxT}D&VG_6P1ydCC<(-zkwV-r2KwPNPGhS{)#4Nab{=7 zUx_R6Huz+DMpq=Z?#+~BrXljZDa_p*^%fM*R(|;bB`!X3dXY>`-;ZdqL_FdvW<5f* zs{*#JqSF5S9~QK_zL;_76EZXJN0}EcJr9^n6ct?gbVu7%-Q_mQ3D#zTeF>!V8EQ`h z6`qo`=5bf3YENlmmmEB_|6>mOaU4X=&zC7 z0tw?Zes02t2u_Yu>vB3|3K@I#!KNpkzHF}kA1y=#i_I0*GDVf~YcB8^CzN9Jg=(Gu z9%)(QE`o7)Fflqcmz*Fe{xLuit7V}GUTEJ8R_6>%U8vm1rD)Yu{~jAwXOEnwqRIxq z1RJr&oRHjLqex;BMK4PjZuQD-3r!XlaUgk#?+IbbM7k+WYaE0Lo zI|v+p&6yhQI;`Z{+2r2&Xt48?Yv&W0kM(!RXgY%{GoX8o(+T%=HWeuxGonu^Ron6x z2%JkiH=Xxw#~3N~0xzUJ;zh=i2oJzA;3W)2V3bHVdVpaKKc;rVQ2~2Cd7dCk~d$2QA0D> zjL;fo5XyWL4X2~kHm?*4QEmJICHU4Z8tXyf(U>?R*;q1}jbZ2`q8M7x0h0A3Ca8?q zODK@!;E6_a&h9ba=&+1AGkfkV7FCm76B*&yt4xFkzrTde!#Se7KSzb?wZ3t10$xnp zj3@UC&Di;PIG! z%^7(j4nHx0PObE5P0SDmh2y0zh2j%J3V<-mTF09l@4B4*NiGye)>fx8#RDyUI<+S* zD55IGnUd_5lkP-GpKvs}<;)u5wUUiT+B}R=uaXhQ{#_u#IjJ=KbF=i5t)$v;1zs88 zb9lLA^+ox}%_)7CLc}T}^UvOH>)1d^)hv@NPqpKqH3Yso=DU-DOi-}2Kf!T^1SGQT6@YGnwYD9rc48>WO_HdixnNt-w75Y#7! zUe2YDao;-#h=%gZPQu-wel#xmSstAEqzYJ91_N&fg&sCu6IVg?wcqPJ7#b$oO@~p6 zYrg8OiQk&xX-Zssn|nW8F`qD1Q@1kueB=rU|p6=8Q;}-y`{cKlAUm^vgN(nO0dn z?f>2f7r5$PD|Qd_)fWvkXf>+i<)ODd6>CDxq{&O3$Qp1(-Y*>U(ix=doeFc7ni`Hz4gKDqZm!F81taFr)ERx8XsmQ^#Bt(~MUuI}l$8_H5 zyI{ukwiNHurS`M~M#%vgXg7zCvEABfPVoYMP@RH-_iv5zfkri)+Y%Y|iIRgrS}UT3 z;V}+f{8P#nswuxKN$Qw^KC567DZylLzEv;*_97(ZdS5VPiDtu9)F_CCick9kA*X4! z9C?ir=o+)1HNRYwTlPCWzu~)_KoGDN$bQNW1oB~IdfoG*jnN6Kb3&(+@^^pP4RZIXO{Y99U!W0`J#uVwZ({CWW6_G1{Hv|>`8M5OO!o4Y}PO$i8C>r>*U0|E3B zV1a~|jgbZEn&1nwy2yeIb@0)Z3X*x_QLe#Kc^e(RmxHk93IeaKsc?RNRB}PSWn04o zl?{(uy+Zaac+UH{0l~{qHII%O=q~h$t}a7gjp5MO{N@=~L+6Fu*F2HAg-5b+WP~va ziR%QRIKL++Uvj0p{tEi@a!((^4|jNCs~WzeyuAOC^7K6V_~~Q*IVX1d=WGEqmvJ8) zu$P6Ulq`m-ib&IBG;L_|znh|m5P^yx0*QwJIR}!%PLQ-n+rBvvOnrhFM9v9s-!d(r zJw}j4+0f+L+31>_IIxRa+v?@1 zog(wBBbf4>WH7P_o{Q_6FHgJ#qQ;5f7oIOxX~*|OeXvRSFj`6zZt9zDovkXNB8=H_ zh?h^)7*EU;Yg*d{4<6smIP?9s)&pMe>e#wd>Jr;Jtpaf-CZO0fo|rP4j)NUvYj$LN zCnMs}iWdC9sQu9iVT50p%cdy8SIdb>sgJidSh*~Cnmqt_&1(ZeUaL!{f1^y%hT(+o zPanH;t*@b_{G>Po^P6fkI=!W3Dw$2zD0n3x;IgA(b_odw&W|ryP_zS}V*m(i&baI% z3+pe7#K3zg3qS-K0U!)AoI!9qe`V9wL(_(aEz3N*Ul3T6*Tbw;55kgouE!uy`R3sp ziEYc-qIG{?kGF5~609GtFJ5(Ur|;)g@9@)yS{Z%?tNW}3&&7sq{^Tewo>IN~O3cjX zlG~>9LxgQ#>gjhbf{qbXS%Re7~8lf`Z1PZMd z4Bo9F-DIE_=$WTi9bkY7J6;<_kwbtUr1D zhYUe>rhDn!8zotTy)QhvTi#>Ka&~5V=9fNr3DhZwcUh}t6rej0X8yf)mYYeXUXT5p&7}S&Nxdz@ z?)I3i^Vg5{92ef)HD94jrxV(6diKjTka6bKhjeK#>GZbft63+HY+DyS>-#OVrV-i02AaSV3%WwRN?NbFh9e7M zi|pPLAlxZw;Q zd&@zQMUiFGL-_OqchOEXcE*>QeBXUO)M)~$2Fr?n{y>t|juFmv1{;zOb~TSRnuJgw zsr#GbdywY3H;PT?-R*M@r&E*}tPl?MmYG>7hc3VXKg>#HOrHsRDHC74^ae)eUdn>nmnQ>2Qg^DxQe-1r<$MU5&_!)3bJEY6ka z_(%;iCtf(e=!r)pIy)lycKGyLx|x)F^M+btq^vrTl0ue2F}^tr6^&|H_W4`(+|4j^ z9O3sv;kVr)veA*L-}W{*386V0&Ez7^6?;1-LldRqm>O~-b4BDRCNo;cQPq@0>h%+V z`SN(WM``Psn4EtBr8s7Z_5%|g`m$z-(1`|yZ}n*nedxmmgth(Nh1p3x1HG70cE-4p zREB=Ngq@{$tetOAl0nR`2kk6n<^0DH5;2|r) zIir7%cPx)O#6bJ}4c_5+!56jip_kG2s#^}9oGBn^yP=)z)$q#*C<>;_2+K3H9TmBM zXlwmZ0?;A8L;!KqOd!nH30I&d@^ihB3A% zm4S>iEhd(iCi*5!ElsO>5e*k-`)AL7Ej7?@s|i}e65D8m_pw1-4Sa=OqSr-DEWwR? zRm)Y!1IKpK|7DA)z9iyKG}P+e|3zyWdZF(6J{wTaERV=a!vHxz#=k5rzgQ;73xoIT zMub|yDbNWHl38C=Y`%ztU|Y3MZ6r=bUMMcTV&KN&fl5?Hwy2C|e7Z8=SJV`~IH14R zq?^h&?L9|>8(=>u;4J9M-uy%S4)`D$&Xu&B$+`!~@0hvKPyn>^Z<$zjH=~)0{U(0f zENldFl&s6LK-PF&19C(B{=hi76!VUC|H?YY_y+C|qU3DjGYl4TvWsu_^H4J z$kFi!>bmQk#d^fJqh8PsvGslaJ0Fp6BS14q%}H>q0w-VfxzH(nL4`|mxEW)RjX~<8 zFM>Jpy%|;VUgeGMo+ExkC*ZA#y?wTsQjY|1j(FYt_ax8jiDOq}x)^$WBl-V-7kd2U ze!j-bN+6_X$kr}7|532ig>NKAn%8$k_zk)N`m0gKtrB_rMGK6YwrT}tQ+WNI3Q>l` zjt;G<*RhhZUB|8h86#$(q28$@j4(O4a!snSF72tXJ4S-f7bvb=IUYC`3Xls`vaT(I zg?%>5HgSL9i$J*da`Y-5z$f4j)b!(tW1#S&4I&B43Cyw5f0l;LA_8AhwS6!BC_Yzd zwD*_}9`_yNjxR|6e5zDF4UXml^g@*Lb=YI~MkSR0u>a&=7Mf9!5L4dU!BC&FTd?Lk z4CAuvJ|UXXfKpgi5Epb|B99^o?@-(86daj20Q8&W`)}`$Nr?M$R^E~M_|i#*kPp6V z+z6~@e?#L!DL#uTs2UcRpnEWc0rX<%w|r5YBo(gSurGu!N#EdXWkGaZ^G(OPlBMy$ z`+k+50&fxv(yW8DjZ6P_X?}2xX2#OEzTZ$ybVti7$IB@0U}lnBmM|7rdyINQXW5H{ z(%PR_gMhU&fM=n+DD5AdnkS|GkC_9ryTp2^M2=#pJ1hF6}8!x>at4$dqVp(AL)xt{#XJr8POC&KeCzc zkGBKUef3|zc5mLObs#R*k#V3Ix+^2_DL14TO|aWNdFgG`D9j_? zwQS?7pDizi(>5|IsyQ~IEACe_%vuyhc4*ocl?`tE?cthTY}m@RB9L^zb61L^;)Z+Q z{^EYYxAYncC!_2ALf!uIewM%M6bOe@M`!sT>&eqjGNf{k-2G z$v&c)N5Jp!LWOg-pX)sMBp~2Vr6{mAQo*EJ03c^-goAWv@+BRF@64b|PjFQwyN{IC zx5O{cTRtDb-t7H{MMZ?`H z_*>vNEx@;Y{>b>4_4_!et_kRT-kDLWF-v!tt6~%h(fp*VCXFgJzC2CEsdWDp(;wWm zaB81EZ~LBS8&6-fEaW@q-bCLL;(EOuKR)kX9p)nm^U5N?r*J!#qHgS0OIK+O`mdX? z@Mc+W??JDT$4kBK9qXC)yh|t>4jhY6sYH3;&}4_Uh|(aD2=D~j=}}LoOU#dJeSx{7 zmif~yr82$(u*X4R60y27!LH!=xjx0M@gNzN*?-W_5Y`+O+S=Oo*i8i6x*+iUVq3FP zT}Rm6K>L0_LpEhU?pYv) zJy10iE@F^CGm4XfO^e+Th3&I}BDT&vfMw(Qde0_#^l$HM14q5=wzb-ez*eT7uXHW1 zMG0~zT+!9hsSXgyTE?bZGt5o31&*@jme@ukY<&<7YZi)E=;en{=MbFY=p9fpi2$n@ zbs@!~B!Q{fW4h@@)rt$6{SuRIS$KM3@g)R~I>%R$B@qz+43nOC9 z|1J}akTH>66wtzsjOpsT-eB9(^vo|CyhQc!*8r|P?#39)PE!#w%faWP=^dMt_118N z5lmmuiPN*Z)an;|G5HzUbz3vVuxMprH`;CF zNw~(NUC2j?aeef`*Rl<}NT(GK%7E>()%hxQ9z({I`9f#0<`=pi=?Y}*x2T2$J)9|^ zZ*ZsdJFf`t=30L?YoEo<>-6-?WAq@@&Fhr)SK&xFd3!rL$Jngs{e8v3`86%=bFc`ZVru};eV+Yprp`x~>~T?q9Kuj&zo5$={S4P|;3g#LXRhR3Of9?>W^6_2;?*qsG&|&qN5yoa&A@q2 za%0XF+f^y>zHSFg;5FQE7qIJpnW|3CuC$naYk#YAYiCRUDMg1uN5N2l;w)-6YkVKs z(FW${Juq~3M!}8&%nzno8Z!Al0~qKIZbFiE!}G5wG(&epcEHl>SHSC=AHOVQlD;(= zt#8RC;k9I9a$6GOnzfK;8w-ha5K9HkiH{m$V~>5f+bzf1?~VhJ7sGg4^IYM>u@sfqK%-CX;p+oA>ZPks_Lk}RzY3M3Il}!aSnmCp zL|~y2tTSiif=FNcKp9roZN4MEvd(f>@^h; zy)b#}7@E_C^!ywiS0fj)6pEr4L3Vy2Ya`t^n;NGOip#;B^Y5+y3T`ErVyzaqjyS)I z?mWMPzTgRirYk79SS^ASO0`;m=4#@_D-(-5Dk$edF1-4+jyC zd2z@{&Rv7`8LxZi!4w`pN^z&+gv(Wx@9w!AI}i%|2hSWa-Hy_kRQ=cS#r_2bJe~ag z8A#NNu9)`7;|{&PdMM*fcolH-*Uk#<7r&_{x>q_)FXDr!j&^^v9o~r^^%Ute1%vGm zWzxk3VIha8<1)m5mIv3}NH;3N57+PcDt4NBL5LAMnq3BOQ>n9<@s|N`9A&DTwlRL1 zQWulI9W+9prQ6NZb@;zlKa}ytzxMa}wX?!xRx(WG)&fv|`+0QB;6|sZYP|tOn^&L6 z)d^EzHs6-96E*53Qhj(~_m{PLBUlwy^GueRU+k{c2I<`u#}O0m;*3OXl(o z4f2QINR}VSPQRvQ%anCz?)VOR>79J!g9e2I?{Dc@BlKkL;0EBL&oNTRF@J&M|NatgKK-?Cz_4itjgkABKBzGSG84FZSCV&fTfCbJ|eum7bm zC#P&`HYYbb2k@{_=P$Hsvr{>g*S@IsvVbnMYK`>|SRh>h60h{Z_1iI?>H&7@8J^i7 zYkpDXBOS2{+DU4SO>d`720Klq@!fCduii5|e^qDWZN#(~U=N?MDv=E? zdE1UBYw8`_vCk=*31k2_-w0O*k!2WyjWL*8!f*T9@};{_Q5PR%1^$m(Ls?4Ebtn|CpG4_w)S!$@;(ZonBL$wRo$_^~ARwh*WJianw1Yw$E^4tmH?-};()bRI;}U|tB+A$^ zgo2Y$TE#_ej7jz&0RE1L$g>@`0fx8X$zSdte6Y6@iNvwD_%}OhVy;?>m{5sWNT3xN zt+ftNohNV3)4p{E0(zv!{|6ZYN@xU2aor*?ye~OM_t|Bgy3-)n8ji>9{=(?{4xv>5i;i0EZbGq zARdPiFJI!R?9Mevif|1NTviqmvbh-FzfM+ERAUz$-%CkT)T9C}(+rsg!}LkN2syReaP_ zizLEUXf~Cci?&J`Cv-)89B0|U z0)J^?S;66!v)L9lyI%wU7yhb%#Z^N+D5uhyw z2Y-~1!kF@Zq;1xGV72wwN60FiTy_DWw+SQ&C@GanCx=s4U+u|P*R8XJ>T%cqQ zu(GBA8`xeJfS7!oaobeA!QS9Lf#Z!G97k3Ai-WHBj8tAUFswZ!4Q~IL)71$`Rvl_x zj{3`kwI9+%O##a?Mu`JKQIj?m_u3rAJ4bIkdSdf(bvsS+HB;pk1ZGZGqASjLRVMRx zh4y2iofY9H`Vub&jTTwyi7-mEG6KT@h?F*)C4tMC;pdk%36?R520Ho&EH89rmTo#9 zNW7Ae+bm0TT9z?RA54pC#}tgb$yECPD7o#E%?Hw7Cl+fU6DW3-zS!wsYT7xezErhy zaCM{XPO&>P4kbyo;*`VYMyq}wjU< zJc`DkjITEw=@S4oy+=Hsq&Lauy@>15G>2SJ^iS%?>haU6h`WGE}kI1(r8Or zUKz%-u2I2lN5e`({>L2IXMY+(4>0r)+=S9{g|KwYI^SMv!1^j^w?XH_cnl z1HgOlYXG=jI6LZ-cjcw1(%@)UZ1N!{1&9GH=q#cr(g*ER7VZ`4<%uc^ zcLUFbwqZBfCnfgiQhW3h?Y4evbZ*i0V9av7mU09nEVop-y>Ya`HUu#P%(!bbhPyg- zm+}zEB#$@YBMydzABu|DKOtCkD-fTWVo~~qbPtcsnz-fVb$de9zHuAr3&1D4TK$TP zzi`Iql48H4BuM>iA%KZWiAz;+RS7JSIGspLQZ#iV#gnR}Bc^e45ffs_nr`MwG#Aof z#ZO5Ht5SjCQQV(DaFc+#8;Dz%_x>S(FA3&#zt2+#&%T5F_&<|-e8%C(J1qYr7jR48 zJR-H+EK_Ipm8E`NR%t$Ge00Da3_uJ4vBxa%fbAen0)O}`B5$(Q#ZMP`3$1_W-s_*~ z2cC<)t$CaxoZo7g&ZZsg{F`?`VfAF*6o;^*aL1We3OG=b>>}*Bc@R8<>Z2LoK(j(| zQ}Ywe27=bkKXZ0oWMVbA>a)Ty*dTQ4OeO%c+_1|Ab95Qd2{b~J zlnX8s#8%DakVgrmSFQ@33y5?p#5&mprvg?t87e%rDQ{Pc5WylG%XF-5PA@?)8z5xp za8o4BM+g@2o={VxhC?0j*#QLf4CdxOZ!Ht3ch(NLHDh7uokE6oeI7X2K`9-s=~VDw z^+2b;uhlNuN;L(;fqsXlATZ+s9gQ?V({$HmfyE9Di4D0dF<*jXq1*i5@T6gL7!edFWjk9V0ce)E-@8?}F5Egd@60V}-J)f}XbNS`7(u22@@7cR#(^yd%(0`WRg( zjDB1Bh5}hZ*3l`$VL5SNDR^l>PwuaN45rLS5KbXIwVg|%?wh?`Sgo;C3Xl;Q1GWV9 z_Nhs>b4%IVR1okUObQsLG3Y0a5JxCdnk+gBJ7+2|8yY8ChH1pdK%h1|wLu`@_^zv~ zW<7a5j22JLR+SD@%a~KM^*Vk-0_%`tdpkiOaEFW{OLQ=s7Y(NHZ*aH7d|~A;d-v<) zvh1??ZgWNO3gG{C<}E>N1=C?Q)UaAXw0W?rS)CqfSiZ5B6~HsJ z9nex5>94r9iq%2NjO9+SVIG$HBL|DOCD{d963%hlv1_vCwi#{}oZU>v;&2c(D@-8`nuDNh+jQB2I7YE#fdNW;JQ!rR!8}*5#j+23Z1LT(OWN?`W zvi4_B9nYxGY?p1js9hb8gvNl+rEKZAY>4CH){20D7*7zGfmO;#up05>PRbu9@E1p# z9yZlGY8ywm3LT-P`GT=dK^Gyu<>4iQ7OzMD-I*xx82x1btYLixeQaIyB&1K1f$G7> zZQCY(!72A>pS>Zb$?_~|$m4|itKz+>hQa;}^yx4cu{cCE~nQ z+NhOZMGT|ED4aGXEZ%QBq^oyPyT+HtjiSEo8&){h7RgNnff>Ouiw89Xd)VcLJlq9j zxV&LrhkhPKQX~w1m+9Kz^Gyz9h<5SRB%(yJ@g%2Q@n1dSfup`` z%S7FfV3@Sc#CM^#u5Q76s+GQtzPW9Ak12ugOf^|y_-HcIlUH&x85O>TO0l`4z8nNE zGuZv-WBUI7p<zH3-S<)1ip^U5y= zB7vq291pZ}Q613L&g^*D(Of%%n>=F|%L1YFKO}BwWp-Abn6dZ2a=vmOc|^Obj?LKT zs@|;Ucw&7s{-U{01}X~`7=lg(XZLzpInp<34gx|ZK_UDoN=)da5|d>q^e|;V8>pjYbK46Fer|(Rmxsl3 zE5ow@$w=O>E)!Om@yPy9x>v&bj_dk!z-{R8zekdiTi3kmU7eMxbVBdCOuu48FCL9u zw3RF#1y4&kKe1%5G$P!24$+@|XA;YV{N`<17o``s<-79DWj1G{-v_$$JQ~lkEjd2{ zHul>awKuft?9oy*2bt$L+;X%PAzrtvt`#Cn^yDM?0>_uO3Tz^Gz%9Fv@IWui3Wut( z?wp}Cav&9tj{r)<7fdw%qM6JVVuy|YDC~5cz?}vfwfT&5gri_^@-$LEp=EG*2J#$& z(Ud<+Xr2zt1~RQ|<5qnq6*CIhI6SGqEvoG7x&5cJ-)Eoh-v9$!epU$?1hg8}sg*j; znuM*7`pQoY71LT~G!2$bGz3H)(;CH*KCcWd^TaOetaG#HY{%1;cPHx0>M;U0za$dP zz6>nYQtB8yQ($DeR%;O96}TL|yCxCM_hdPGF8o!cbfj+vU&`^kr6t_lhl)ym(Ngv_ zxFQ=4c#iT%-O3AT0ffNLO)bOWq?+TUOd^?a{DKl=dQ(~1P&eQ1m{aON#9Pa;5+<3% zJf&W(WQtJPi8HI`^UHbHL|k>dw+Ju4Y=Jz9y>1Cu1WW{$Zi8G#cy6Q89!pa=B(EL^ z>>>}{uGiIFciXz|R<|I`vC112T)Y%{G4ghnWQcWD@tCoT(S@iKCOKi>^a(3*BAo(v z5v<5gxZ1m8S;iG<2Ai_YZLbQcRZL+7l@&V|#x zoKeqI61f1DTw|%|47=m|_;GU5*N=`KHUI9Zx$t}y2jT@&1~(u(bLpEbjex{+t=d{K-hyp+t3Vw!3Xo0D=Hk5G#9#R{7e4Bb}!2_CzUoqLySqtneJU-jtH9&Z|ro}6t z^*L|rs{jH@`w6U%Ph;6suiA38g|~;ntAqd~;cZ}&YYqHK7!M2kTy|DW`VpY9M}Rh_ zyDbCeH~>wYtGJLUX8&@I0Hb|v1g{B(9+{S*^^j{Tu+_mjfc)F{te77Ru8+2iYp8) z{T&A3@1^YyQ&XCL@u;XEEON_H3kXACKVkvqKahCFhQXOLm)Y7HG;WJ%%WEJVSEH~D z>``!008@vn#?iwRObwhVc(n^XDOexqBDcJ3iBdn|s}`U`U=L%XN}j_4T1jwibuB#& zC-A`g_50UR2gJHpyB38N1QO_4n+1Y+NR)Omb?ZgZ>Ll~JcrJ+#CB*EID4TQpG!a;HZY$BwB>>T$@p~%}+$N7^P??xGc(Hy9uF(XR<27|F zB3x6QW5*&=-6>#f-tFAv`)0AG3{HX%3Xy`*r1f-htSC_NA=i%v)c_Q{ujo*ejK-FS zTn>)O0wW619u*zY>45_&@u2F6i!%(;Vdc>@GL)nyXg=bi`~ZV;^z1N0N%-u@41MgV zF^U^?pU@s9AY?*jj+LtEA`jQ+=;{2vxC3*A6 z45PImQ+q9$#N<}6jvf03>+ny2R^)$u<~lvR-?iEn5Dzb6MV=Gwulne6wj8xM1zt$o;R3x9o+w}Zg4 z>EQ~~X87ae&EaKx?#4yHC?f}vKhq6-zLSG%Pe>9!l%|j$k@%?Pe_{3|A49nI^au%^ z}K00}rAW(^NiI&fVU^+mobDZ4_JGsXK_k0qPgfE`GO#^~dcS%1Az(@|dGTYzx3#>aXqxr4q&^ z{`Xb)Rn=q%NCRgoP#ZM!D6PYDF#8;6WEg(2oDtIx^jTxFeje z=%^^%cSMeZpd1N469*Rp48(~+fPp9xfgjB9o-s8;c1HG$r!!1kryR9w-U}5Au!Zu4 zGR1{#cP^_Ei+cuIIi;|8Vi6`1G%dEAQKn&liGE~nVz2zekI5esi!b)WMt+o2S=qyf z-V-9?w=29-=49hT!UQN2Cdi%u(BS>BSK%H1@g9zQKm4eG<5D^Fp3o+q783;iDT`TB zNoB1Bu!}{@7s}tX5$fE>?!GiZ&#R6xCW$gM2)KaE61%e$6nzYG<)25(Q zwosN^wrHfl@_da2J^i(#(-IzTqA8wwt5F*Q0%1hORd#d&NMypbzvG?QSkMiA2 zOgf?N(ajk~v^jHs z^4Y@*W4z~ds3e_!!^~_#WP;?ey|c!ktCr`lY_p?yBV? z*nK#1qCnJR_QMwkA4 zF&vW7O%y^_M++olmgif`YIP*ga_KFP`5e%HBERbdIvjf^Up;;NF*+?oZD`L*!t$=h zbHNdfSyf(#N9fX!k>ACBldF`IAbdGKt~7G1%X2e3Fdh%5oLG(*wpjVu>aorC?DQ)I z0)}Omx4GA@^oGwZXLF8dU2}rgYQXPiyzIp9wad!XU8|Fky{vewCilT3!lQ>_BXdJ? z>xx0l9CI{NmIx0N8bW7J!QSoAD8vwe&$M4QHl9CZ?qBP;)K`@eC?sUtgHokya1|mT zb{oCeN7ejm?=9N`t%Pg=tk~|08U%;=;YJ`yh+OuksN)ut^)%n#ehsZTR=@y;13`yqK*3+S(*pTAlwm zdUNyZfaf9-tl?ZOOu&|c+IY?F0hsJi@DO3c88* zXEI9wC`!Aw2pm84gz(nM(pZ#XgrIv^HA06Xgpar6$7C3U^7j3p8sR|wbGvH;rI>f@ z1En??pP#_HY?W=UwW1O2bk=Ij`2BHo{rz1gWIXWIV|mh#Mw)%h{UU5VNls1f(o)P4 zN}J@q&c}!(%0k+i0Ow>J zg7AIYV@PF~*di;|5PaPVT4d?&9gd*5UP$WS z;^{e%pvIy%SjBAoFV{PP_BeOLqY4(4^3XxRk#0fra=Zr9RHk#6r!nc~$n>s#80F9p z-W@98(MfM@cpWK!Ir@1H&3$ufoNqZ!grSQmejhh~#4f7@>Y%E!-(GBB4L5jWBCRHP zg>(jnpYZ*ZtAZji5qQG6EdL!dO&vgLW#Ni5{10L!nYy_Al(*GQc9|s@Kz%bZ___IK zJoVdB6W0E&*?Bhp)iOj zB!m+4t9a{m7}Nvi=xA?)gtVw;bz;jd8=KxW{%JqfHfvu@!RJ zC2Pd00<0{A!rBd~d{46p?nj<8cVR2)f`K1yOG2>n1e6Hl@cw(t0MEL z94fbBXFn)i(Kz_8F8S~KUs$64|G>qMTy@ve>*0HEkA{XE>BDe!@}CjEyQc7)8s3)) zo_%4zDva;gKU6W;pm3sdY9M>4z5^aoR9g$Sn^#&uecFOJSy5#n*_yJT!&QXE3S1b? z6`(G?u^xsoS69&aE+6bX>TGOi&HW%9RHBFf4{m6{e;}(?ukS=84RiwV*R2Ke{y)nz zGv2>;&r2c5#Lacp57I$E^6d6Yq%5oTC9n0eVO>o-fIaGEc5Qz#zip2sS;D$!*dJ5o z#VpVT-p~&n3m|p8hAZMM?ZpL?hQ7*(%}cvDvaEi9gRnKb;oL_OROFiDzW<%*4?gra zP2h{snZ&CS+@DGdhL;SqhvJ}TB(Ra*sgfsGtwc+k^F{GhBFj+;KW|m!5kpfZXvDTHV>MmbkZB22^Aj&W`TE_eyp;<0#6~ zTxeRmB_q}w4GW4rzJzCzUL$fTS9aC<`5j%~GqcC*a-4iNlosGf0K!JSdvh+LZLqd- z#V(0dT6(Z_5l7eG?w!2IzvdR@@W$bR_D~`eup7PGuzHNpFIkPhc|+xOfW7A4mAucH zSd!g|D3+sd+6?`sHL%6$)ShLR7o5C-v~>G}bW(wb9VhR}jgzi>oQaoLXpu3Y#Ns%) z_Yn2mcDKW)MDpi$9fwFJX(xTEJ(yxGWd>t^%>Lz+7>|6Q)kG_9oohb57{fh&N9kgK zHg&CC!DK&KEOhg*#Vyn^>nyk}*~i;nZYSZ005Z2tHu33^3Bo+;nsm0l?zF_VpKGRl zHDH8pN~najt~Gc;Et-=gvp-kufd7)_9+Cf7?R^!>%Tw8(h)MV)WDWtO#`Q<$5ZCKQ z@TBW4T-6)GXz@(sGS{g$1y$r-=^J&t6{{$PNpy5S;9he;I}NRgTox)#ybzjWO0rX& zSLf+nmV-Pv8h%O8*#Wn;9PgRW2gt^)s^lYnGtbJ`IYmFp)C!#8AfOOJc;lU$9kTIk zGjAC{2;IhU-51de_f|$Q&KfuQQe}i{8^?|)TObMDCS*`b!^2A0@fuA%yxFhZ;7b?6 zIfdJpgh+zK8r~6T4LAB$E8E(#U1%Kq2WW1Di$#%3YXFcX#;(6 zf52_v9(xfiiq+FYI8~1DQRbMHx9nVT9&EFH(0)0)v}y7=DkMoe{QYH#`uhA2cL8H` zIl@A|OVVu9H>1;Wk>)3%I{^0ODNg{aeu#-nvdAijXOT`MB@xt8bN^+G`NsSs{1 zOkY*ime0;#O|`Q`r`I@26%04}S0jHK3gn_fzTW@C^wsoLFG0JVr*axc;K$zNcT{u&qEikd3-6G=J9gs2zm?!v@s_sH#LfbS4V^UgCp-phW3YeB{KGY zEZ4xoV%y`v8s(!pzI7bBIaE`|`7L0V#K_?B-kI@m4l%kC)&|QC+{Zm>slAT?JM8*} z_^C(dmIfrrOaGPMm@X^_Hy5{7_1XW$#jaiR8>F`^9RLi-EaH&Xa%w-2I;D7eB?yUI zi?0I2nrAFnJ!1rWzLVhQ;#3c|>*)3zRPdZ&`@!?XK#e0}Iv!d1$OOSYEVtJ(ciWa) zEqA=q3dHs64TyBQSRM3jWUS0H)P3_-lDEuEIoxo#o^_((#D5=>0>`QPll4D&d5g`T z-b`$G>krpu*Prn4be|@>%a(T`2atq|VHwaUE7jd7-5&>KBVcR2iV?+hN>_NIdp+BZ zUMJ&zw13lp_TDIpf-~l}9s(f^thB*p4yVYcn6uM|RqXCt>bJSB6iy8vR>&OA@SmzU z3{LnUQPdAM22i3RK7x0Qrt@V(k$YDq`JVZa+w19{GnFo9J`RbZp&ddI?Q^P zx{%*0Le%v|0IO5QIn9~3G~lI#kAU()CV>nqk-ov$@GWx4vHWH{u%n+4Hds`m8v!k& zVoOx5h}~Jiay#$Nm^!C^swbZ-ZYQww+lb$$&l_SPt~Iv7NViNm4JwYe*~o5Cu{(L>+w2=f*1BZTO2iKA6kpF+^{Rby zC3RuPO&*fMFnsKuFs6Zz&6gdGXp!_3yPIoM?YqF4az9QRHL;CI#!}M54GvGPe)IP( z!9X$*C*3`M;OLoYethDh8(CPL9v;1AX8Om&^MlnQ8uDr+fxPE0h`)_pkpU~2NAB?h zUT2CKP|Q);1a>e;@(XnH%8sT(GRJuUNTgzFNojmD;x1}jl!zgZX@xK-vms|zLTAI> zHE^hteSeftkxy{Mw+C{B)HEzBtQQePngkdrmo8(ck8`Zi<4a-zC=0EZF@SIht#Arq>2)#wA0Snz+}L*Dvp<%Pikzc`tf>)8eu`yJb7+ zRw2nW9lHd+M02>MN|t@tJixe*^CAL2+a?J436*E_^K)_LzTEM;u^HutHQKoR(Kh4)0CSJ39Y|{?MTWil~Hi z*9K&Xw9BaBrR9L*_MZ({0omGGGy%Y?a64@&icMVU5s2p39bn&4-MhnSOPG7fE-eQz zahdmap{I8vWBG>4l-@f73-POsb3*>8sgx3cc4J2u*{Pe}$=xM=bHjSsHfJf;Gi)$bss@-H(V`pvv3ymZr^fygl= zP7i}IRTB-$h^WPN1+P~;CuGmTSnN-iT6Y`?t907XMkU5c(V&BJGc$*%Q05 zS6W}+`4Si2Nt^QCNmgH=aTN->V;qL&NaanN!-8QkF_y3GL?VrP=1AvFo#PMty<4aJ zZBVW8T{Z9V9bPzg>6`D8N&DN+ygV}^t^4J@Z~3J8hPIuyQE8X|n5mZJHP{qfU|3;f z^Xbz11}psE)ex7#Y*FTxYURHG$z2&X%hJo|7^z8)dIS?9jTyi2NsUnusgOf3%QIXJXf`T+B6)R8A zL|ALcL=pi%J={;1BR>GbG3i|XOTWY*HCch%4p7r$t08AvJd2XbWvTB?U^w# zqIVgwf_xoS6}7K^SzAp_+@q#yTkZy$G0N!lG8V%GELlTr#42*Y=vz)yt z)958nWC(M78UlH*F`b0m)Po#vNc%^CjVn&h#mL$&vKZO#qR2^hU z>J0cPl+Z@&f?PWpd?HJ^e58b|!U9!NITQR8N@!nIZS>wJuwH?bH9s8ct??9Ife0A% zAKwi|9V(Hzj#cOx|iC?hIhy@}`0lcXe4a|8jx7qSjJ0ny2^9GjgfF$iwO zHt2K2lawiibjuuYwz0iC92uU4I@=dMLYIc-pdSVs%@0|Qr(jD0HecWSAt_4c`HUw4 ze3)}j;qq>8Kz+t*2nl2S;qmx^cdI0aSXxlqNLsR2I3wI(uW(#@L*vv?;*?XH1AFFX zKxL;yt-=IMj=9ertfJTPEpR=begJTu%`+%xhC}da3zIM$n!PB+F+vZBBxbE3>{vQ+ zA527MDrC&?-=+U_u&ZY8e!#*popugDBcGm`RTlYD&hSc-tX5=~zCS?L^h=K&VF0?lNrJJabMLb2wo)oG8>jn3E$8XQZMZxo;5?J^YmJaK zs@|MZ&pjtQf^w&tzVkpbDMHy@Z#~2^SLc+5!NRFSuqhQ%O+rHjl4d0l$T+)D(8?rh zzb*M$sB4U6JU&JrA7Su!C{$gz1!-L6;#dk7`YRl9!Uh+3KH}d9mnr;m{P#j5zw%~B zei0e2+-MlFE@Jbdjhs<{n$z2pCTp^ekWe_zBX#zG^T>b)r0{k9#?^#b%(DZzFLA@Oja#_HgniBvxLO>oGOs@_P={!#JGZnLJd~#^;TPgF&@`greyJ3C-f!@R z8w&^xL5S6Up)(^=Z$Ls$uA~Y~-WWkvOd8JFdNfoCQ!x0ZwS4{|caz0=S$faJfsc-*77XB$r$Ql@$Cu zoTpK^z<^t{I^`)wVdwN zC3%eHn5@fPBTnBc$5Kvpa<1NZtILsE@J%Zo|9xjSHM{BpsJkDv89bu)xd503nC_h& zk%MXQXe-9f6q_*HpC3u&S6mVUL$bhyy=so45U^&#vej_J@Kwvh)Bf8pqXkA$e~+bN zvB+0|yjt%@|GE6KYCCYcBG~m<$!IkU|X>Tz#Yu-Se*v?f6`Y}f2Kua<)?s=Dt&#DCb`X5)^F&n>6(dl6hT^XCD?Z2cH@c z-bh3gvZk4E6LfD#p()3uNSFr40Z36EO8l(WF~k7RLibkUqGU>J#3sajES6^=wg->D zlDcsF5$9rG?BdnkI(E~1PTMYv$c;k;q}&FSa*!f>7hgfJocIam7w`f5s-IImPB|Mba1;Q z@uj?6K&Hdln`%kzriF<01FGC@kN9C#;Q|3d1y+rhnRNG_Q%W#zZn4=*Q+l@;n|j_X z36yUnA)=Sj+gW)Z>Twfr?-Acms}0vVaYcSf{Y>-!KJ(Z~+~yKb35PN~8*u;a^xq@G ze_8E>TmfuFvIVst!oS(2?RM(5rXQ_;dQ|KMj%A-@?e&$UvM`)fj>`H+jUAZEYeIQBisk?JP=VNLLE>Xz%AvCM3gHHHG_br0u`VFy)OUe{1Z1-c8T zuF18J>A>6^T>exD83i-;l;-(pqvyEPh2~%glY*iJsdgLI0+_nze?aO1+I0@r^aG#* z8i>()jUV^Zsu1)iKI)9A;ON>Df=tGIWk&~SEV2!!iJnHR%^vK^nsqoJ4P6vo z0Cfn+WzP?5n_N;PJU}%kj%Ri#?0>akw3F1P&!ARel6Pa*Lie}VMN%N*F!F9;^*pCo zGFMFZ0C(i2xQGbkP)3bQdX~<0DbvPz>Wg~zWLJ<1u16L$mML86Sll@EJ}bH1bN^em zK;-m>ptBpOBU8a;-dXz#K!t1hm>oa4c2VM-4^N;p9YAzq7X~b9W}Mpi7NJLoq`ir;`XT@SELa)ByCWPhl#RE6@+_!R!irEA?D zpx2zYZ|uniGE`FD%oBJvC-NMgsP24z{~8(EM#pG#bB-o#w0`y|aU+c8Y&YA9obJw{ zKMG0fGur6n>G+j8wjNh zVF>_Z&cGQs183k2jA6kP-MH&hhyqKZNEUh?vP7}sU18P6Svf0b<*dY7q?A~Ajh|OH z?>mms?8A-GoWqHm?(Cbo!l8?Ea1PGFIXDOB;2imvmv~6O8jm0#AV9xhOuqy|58x&J z$|18$u0s!@f2V>VIN~rIa|He|h5?M5vx0|nSl)gZIE7BUC*^~Dhz$q0frt@-G|I!r z_*?t#CS(ZuJ@9ch5#rTEOoE;2h7XZX*O#r!i5@%JOPRmS$$8FeiCBTON^Gyywbz3H zJ3z$0-jLRtDgS={mL0y09Zq4pbK~?b1kS~|8BfEYc_HzE=BI0cparG05O85Gf)IWl zqFOAn3-QuFpLDi-ig!)ChxAEGe+8c*!|3EImvsZ^;@;wgldR!oRbMJIQdF8lZOiY@ znE_YvMi{nXyH@N{V^;*0g&{jz5@qcuTC<{Iu<7ATUc(?xUnjbHGw*kVc_`&GUny=h zJ*U@ExP=2S(o5L{hJ> zbbyt!a#sAuIfR~nZk15jWi{g`|4Bc=mgcccozPja!GUlmAVSrr-+|RJxgqEZM@qaA zmo}?fSTN;*5X{jp5b%wD$&a>1oFcpK4O}6Mt<9h^#-zYfv&#vaw4N~KCG`ZLd1tHx zpC6ny=Fl{+wOlu*89nI);HO`E2>c-m5_ZYJ^ja3S*} z1Ap^o0kQu&NKJKG-S}OjLH(XmiZ1dUL*CzqO2Z=Ivu*7YArwyi9YmOaTU&+x>%0`? zxaiv1HuJ#%5l}G0Ic+1Ck9wt&u@H?LF#<&IrN98_VuSUJoF4?6jsd zH~V0|ck-)dzLcS27Ua0zml*CWE5OBq8I$SMut>42(-*=@TBNH9G|jR zAV7Yw?16cCMQ^;5h~O*jnxBNFRa(1P!r2d>Y5ig8H-`s?KI!)@rzIHwpEK$E#-BdD z$Gkc2o z{IfTHg8ug>yi~CQfS>(h5^uY9br*muwh{n-c?aO_9kj6kuJFF_ML1!VDwB85b}m3d z%MaXmcj(;06~F>fgyaq~n0t^SBo`DQ-zT%n<4ybK3P2;PDntR$vs}58zUp7t&j+N1 z%Ak)ZADDibMy%3G6*@Hh?c$@jgWMJYGiY)TVcK&e`AIZP0FW{X)2uz^3Qqm*tx^Ts z*JvP4d-kFQUPOa)Ie=-;UXF*o>bbG8wq#Jz&r;{#mar`PS5b0t*|^MrdL2Y4Nm7y# zB9JUS5jQAqPbQ=fSAi2%Ia`CV+l7W(0c`62YyJ{|Nvp_0d5^Z7B&|1OF_#cZ3VzjT zWgzDPT6B<@Bq=*4D-Nq?$_JnIt!6V;qnzib;|Za}yyS+8?j3 zp?rLepS`VpcKQ(QxxXJF3tg!wiFM(J%V2iub{v)uv}>$c{*-si8x;iY>5XgUB8j~h zAwQ>i`C%P|fwR;zN8$d6oSU=!6ob5Y`dl&hq{IwFfV&pvgOYlsMUbdRu9sDG0wj37 z+d?a8e?tMf52;GGg&XDea~o6zh)Y-=&y6#r?Rtwz5<94<+_(skjw=+$v`JTxO$0;t zipq$em%N&u#vk+={3Q7OcIpd_@NjOMQQ2wepRpVIomW#wMr(=e2=nQbJ%UJB&WCAv0VQ6G5uuM8)r)+_zHUho?yMAA z7A9YvDwK`xNh#Qv1&DO+6ZUg!?RqEoNXzwT#c{qY`a;c9tn=!sY?@E%9$9C?M%Au( z^O{@T>f^A{@{><(cf;JDW^=#QSt*3RHzLnAY0qc)ob2+!w!!?J@&J;7Jx=|S4+ONk zX^wk8K-&iEo8}aDw1S@=vA^rIO}eAqU860}(PKy-eov_Se3fQB_I1Bx3Twx zMi_l_y@Y2(mSgQi=cCOf3)|a#Rus(+mt#C0th*xuRa#Dd)OCOGhEXWm1Vsdgxa*N%x|NOb;$Bs@d6eM@WB?8xuhz*GJ4ReW zsTPMRn`}%!bEi-U!nbba0$N4TJ)ehvo^{gMRs%l^jDl}Li-Et-;mZ~6zx^<_a>JwT zP*BRw^RRNosNIW%2l2t_`o251wTS__zzhHpVMn#EH7Ry~)aD6kO#4Kj%jV0e5{iw0 z9UNx_-RYe&YM=2ovZOkxtZOeOWxE9F7XBcD8`{7}cm~8ZJftfKX8O-C+LSxm0HvtZ zJALtu;^w;7l`1!w&9w~)tX^sU2O#K#vCvnx{Q!&n(6b_U2cPM(2eJw~m+IgxS>#hC zdjYQk!~yH-wu=^Q=f~#TJ-;Ec-v|$k@FDMWon5i>fj2OkhU`ay+H-SP>t2Bui`4~IE7TMIP=0z$R$?$TyW!62@{ zFQsPY<~S|3XiTiXL{qd=MUjem<95s9LE3sUVA=R04?E{KV{JOgZNQ=8(;=Q1gM!i5 zDd0y-4x3b;g@uj?QT@z8?AGa=wP|O^K-$#!kMP7Lebas&_wq~ST9aD zeW<>H9zCoA4Pw#Bcb5zg(p=NU0I5!O85KGTT->qV#gxdRrQwUJADGV;Rc{3FDda`6Salj~g%*rJ7R3yliK(y=ip3iP>ooMtU$a zs=G;QbCbt@gL;|jc~a>9nJd}281ypyowf@TaC!rvtt4?dH`FG#Ahg|vx!&f;z11p$ zOg1-pnthQwgC)KN)`!=$A|==9S&-(!rGsrs&jcd?S?`5_S&w;Om(pwh(hkBsX#vMU zlpdDOIYb?}XQ&@vo?qxvG3H=rl?r_>ft{^E--&0HnE3|rjmRCX(Vu;a^QWOXyBcnx zGiN+;=#$;&=>Mtl96|kY0MUd)TrG7EmmT|$v$O5segAmHY>JY4d3#RiPyL=TQTjRK zva$t5yZ_#vR3fNkRk6WukGD}c>GPipik7!N7C6 zpg5mQRrRJOBU{x#YFA^O%IV#D*Qi?}oCocWT7|_GQ`((#5Bh~YWaT7Sm-mkpXv?#M zyd}F5!v!}$ao=lMN$M*x1hQRz{=1{7P_}zE0`3O#^yOuaNZk@tYfY`-V;KJWzO)7k#8nxnb3&?u(#fyo={~Dp4nDl~xiI zhe6y6KFghhzIrylP_YB)5)b)wzj==0PU3kXca4=cRyMZhkSP69@ID>Tr>7ThpGbcU z;Q3v)pA;oIT?4LTe#eRZ5c{CWnsdv&Z$kfjNB2bNUFe*T;gQg{Dq`idP%gRMcj))L z_$gMLZA_Jc4u#%ueuHyIA4fdlPUpQ1$+{=x4tU+EDMEbZhQOX^jypM4-2I-2z$P)t zpiZn4+moL4BVwrI2Hg15E=eLBAW!cu6uw4wb+&}L9qXV5$|&>waTgq38WA7z*sT#J zDwo@V>m97z(b6r#cHG!iyXEJaJAT!`)W+U@&R?*bks;OLEiP0@_RBfEpTP;3xR{Jm z50pOoPP#QomlWZ?5W436lSyjCr3&4bkJby(NhoAn55yhHeHGVHU@_MKCCB{s=kf7- zo#rdrGp4u8tcGz7+(f2p;qy6-`8^#P;}TVbBgpha@2soC*QZK$N6osOC_Hu$_L*sT zQ}4>gY^~yAmRplV5I+H1`qrX*id0GNqY13yJb2R%zkH#}^cG8kRss7$`3{Zr%Op$1hN|T~lS2nu8nBRY^jd7d0MGPKI zsSEl-f@pXYl4++%+jML0eT&huUN?#WfK7V*nlDJ+dvZ6i2LycLZeWJ@Ds^dd`7R*m z0=hzL{wz=!TB-)IX(Q@?TE=MrpFG~=#y7tr*aTBpvB>z`8K?(&p)g0ksm}8?c1e;a zaj7b=>xrP!NzsayIvzBW2zV_vYA=`E&H>N8Ap&BQ;IX6~YAxJYC@y7P4V-DJA^V(; z)vE+9lBzG1yA0n4>QgM@ zR(98cR4)@!)<>S?o7F^+aad+=QB{0Bh$8=%`d6t2*tP< zr|00n#PS=;^ma&c#PqlM`vz(-kx3|iMuMvst!M-c9Gq;v8UUmS5Sb)!UWJ6G(X~e# zWcP)dG}I3jv)kmx$2XoXi`eX|sCR?*N3*0pcgwTQy{A}LgtzFf)2iFD-WF*$cW?=D+f&eNh;r)@c#B-?WDcxSv1jGN0{<7W%qTkcFt z0PjoX_C8YBBKutSWuY~fr7 zJ4xgq4{5E?p#uDzIa;sU{G<$u%WMcF#HNXyXAWq&IbWf-D*!%+{fiG4Xb@s>mLoX| zCAl`>{ZXJ0-bZpkq$+RzT_OQ0eHfg7Z{*AGf67O4K%^>f{v9GwY=39jmJ^B@$q6CP z0Uh`K{N16+rT9#ZF0L7bIARuxe51HV@!%J|W%^CY`$y3xaj~g(DITeJZ7H+&fiE;iLJ#WCMWs~rQL-6n6GF3?dSu6TdA z6gO(h0n0wyBa42&k9-r#I;iM09udErO|?sLqlUVG&W{Ets%?ea>1Yhecc0`%ai@ZO_`Q&Du1e>jnV< z@#dfo!fqEpB&0KRU102K@>ZZ~9 z8WRKP3s7wNZR@H-wQ_gfUVUw`YqMk1l@NAWKg1<93P*GOAckEs%@*dSGmyS zHpcNbB{t7>EiBdh4{>?<1_?R}DU;iH|2ozDHPv3TwNZQ?QJtbRK_?fpGnVg%+4{WK z_RFEq%UL~^0&;p;CQIP0;1EA%+H@}zixGt_5)E=o$t1BIuquv+qQpG04OakK%nBVr z^Ny*C#omp3?;8DVQSd+|<<-41-bu>;OkE58fzd-NXITn{jDL!E+J*>VPEFl_13>V} zQ9ERTOn}tHZW+*(89)iUg$WZ%DwhMJG9u){t%yg#Ps8jQ7bC&G(`Ndlg_+Lw=F5>3 z?642=fSw`@0p{Nk9<1iCCp=6g&s$8B>Yq2m6Br0*Iq8kl!^=p`nRO13E$E*!cO-`y z@u7KvluY6L>}_LIpMv+Fr(w#_?`>I#J=C5_0qRZw^h}Nq18;<0-WE+O;P*#ZhcaUo zmI+WbTe|CDT}TG-QqH#l=!llN>D-`Bs1Ah>N!P#brvNZ#WS$mQuK=ab1dL%ZrA z)%;U@mSYcfDw#|f;{{ERSAe$!+{?ZG8iy^=2)+ek_j>x$u=Q-F9zx`ddg^D1=xqw-m92}NEr65a#7NI=g-~idHzfqe9Q4`(} zm-EZ6s&F>Rnu92$u?U3lfM*5th;gPEG-ZUWzz^cXb!kX$Tp(C{FjJU3J>Y-7@wOs= z5;gb!_-^s2Tp2Pcjw-Ne8m>iU9>jZ5*so>{1NNG{ad~XwsB8QGA}{dkNDBN$N|)sH zf09(&D@E?c=Z5xikE$AzUv zg6T#yjMg~HC;fqJ=!1?lHX5~BYo+AIaA6dRpzY^`$ZiT+EAMLw|8yAZ)lMVo7com5 zt$(|4ZfoodYnvJr83CZ$uU^d;K#F3iO>>@cbim9-?8ZRC&JwV+U|+FQqZ z^$J3a`&Fk~iDMrPdTEwU&~BYAhiP8-I?YUWq0&-!XGz>c=T5NXYqF`TRyRvY>^iNw z1LU^WiwV2k8WLu2#EL4>5Nyrx-alQ@YrP7FL28hxiwNr${l)L*;&9s^~N=&J;w{CbP}n1+OIAPpY4W&%O9P{K3#3_(8=^G<0Cc38xXC1)QOIE)}2jFVXfv&#iM$nB1T)U_OylnvZ(6jm%nO<37X&u znMf0PLMO^ZooEw%;&}xCMoZ+g?>Tw@#}SHZDgLB;|K%08pR7%S1{D0bx-__xF{J95`>grhj%GGvRSD?gaMQzfbFAtMBs=aRBdjuiVu9D7G5 z{sd8 zeABC0heku_7#!u+(C}##yc0sWRjUp?HaPv=ZT0VpzbS^rh@jIdRffm9*5|R5#@gx&2~TvCkm>CuRB!sFIQ)z52$$$IzeNTtamqMITyA&5m{^xDPYxpBtA=@C_& zuPD9(HBhhU(kY8X3w}vKWnl!RXnbrvuy#%)+MF*8wEWU8x|tQCF9?&Yo)(m;BAg?k;k5q zc<|>t_270AQmewg8^SBhesw%}r4Ck|K#q*!K2lv zMsp64#w1~S;fyhib`D#%K-<{B1nth5x)2PujjuZ1`F9eMy(}%2Q)v3ULd~4$Hb!|Y zB2p9%VyI#lQpAIOUY=7`$rJvAz7Wc1Rg?rD~` z7_QX?euFMJuRZ339DT&XHs5fwHt9mQ*}_Fh0OxtxhJv)WRRQlvy{gkLg$%ncPaWEe zMFn9&L2f$LJ*gdOCXcDoDe}rF+k6Bgj|LbCyfi|IS>56{Bsl66 zDy&;pf*}BAYbm-lmQR`Tta{b;qQ80-5uH}Xs}%;5vnh0CTQ^)s!|<8FHCkx$wW5K< zr{>HOxRm5Of>MDWh&PiTskXsNFxEISR%WIo`Z3&*wvM{h7tY4lA(O(I8Cch7{-P_F zs!MSJI)~L-)l#q!O%z${#N-DFHOQrv;1(x3+z_?Vr6Vc;yFS>UKpQwgC4o+Z9!L9k zL_%yp;1MCrWQ!Ic3yTsIb}gDhd+UGlfo?e2VwowiaI`3Uc%?3vQ?!*VYgsXBUJ!BD_C$;Wht-W(U`PP=g{70KP(!04o=pHqQC09)HoYL4D? z;Z1Gf`<}=z;Y&?km>QzAI1mSy0Wr6cVQ z!f*Bkm?nxEBw^Q=5=cwl)YAMMBc$*eQ0X5G41_v=ADtVi{@ z-f5!q)oc8v!eXKlROKwhabR2KF2fB!Ama64l+lEHZ>AC^B291V{+rfh| z#D(-viN^*a0!#J>T3^3Ue4#D$h4Dappg%AkX^-?r#s{?z>K`<|sC`lYqT%%QZh*oC zEPiTS_(q`kT3Uc&kibexT$qwXU4oIT=B}yiKw>o8Gja{C(X~*QOfIO^38`YOkPG_r z@WkM!)h)~Bf-@@JC;}1YTZhcsMro1(kY5KI3msEH=aw0S!^lud9OG168>QrTAUIRm z>>6-kPxQjEyS5P)hCv3$v8iS!m6Yj7s0tx)FcKr9aI^_EIRlQsK+IzOLrlm zO0zs1=xoIZgpR7p-OaPJUjUiB0f+ zLobh`kZB0r)M%A1Y4ASb%Mp(!9yelek&%=|6=M9HV{+v&6^OWi)z!g1S8!0Sp^kb| z{R~D;d$UDvT4(Lg`JW5E>pvL01b#}@xqAJQ;3c6iupmPE0{$6(Mvb{~{i@(qAs2+~ z$aG@l*82V<$2&=06gXoG;?&Z?o?Xxf{<`C{?NQdjE*MaA(lpPL3-!fXU#FGVXTr3|C?Xr@{=59$UoWizVLZZHo|z`a~QArt8<1qre3zB>e_^ z7bX>Ju^t;Si>(``d0Or3ywuXQT1#pwm#f{V{vq~3^#U#_{*@#Z>D&!oq#n8GxnT{V zN#VDai-J6Vxd3mrsbZ?Ns_xMr_S-J^Y|r7g?U{T4q3K0x1N@vpmzE#0)eCC=%Kjj~ zq)&X;;Z|2OEDx%$*s<_@QU_CyxhIncy+PPJh)UiFe)SssTwGHOL!VTWSBc*Yo^aZ1 z{(VL_Y*kHYGg{;Z?oqImz}yqn`!DyivLQWiRh2!v&%+CdR=v;*9$8Y=&%3^c4JR{tQ(4dVNBi4vB;*A6&(MU2yu8t$D#u6o203vKVE}@Kj zLMmwiRZLbcp-1SN#KB86D*B z;8HS*SytI1jNH4PLc0)s>v?*+DE~&LDW{dKEq$`&XZ|JvzM#CG`7NAJiyV6yCwvPf z=^GKJw9~@HHgI=Sgi|Oedf+i=2G5og;w|lDsh-&z^n_eCQ8SZd$c7s-VTJ2zi>IaR zuPn@^-0x*bbAjs(Y{?)$UxgKt?&)XhhCD%+>jELd0UK$h3K6vF^QLXKRFwJEA;*1% zr<^pfSPOMs<-RZ%MD=IGCNyHCrFEuVDuzcx$fM>LUw&Q0!HiwPg{tV}UKvrQI%lt5 zfTJ$EvmJ6(T{Tl=) zx#}zSapc^~MXvfL^s663KhfV&CqG@9PM^nccPuyICc24_;0PVzNAL(e!loGze9?<< zw;I|i_9QM40YEgix$GG}xquK|8W(05Byr?>sUbZ1ZiJpkI}vW>CTCF?EdqLBI!bsw zNe(82o$_mQ`5A7YS5$J!Dtti8ReTqESM}YzNs#n zhig#ro4d&w3<6LJ=+mW+swWns&E7+) z0U1a)$xZ2)oJdL$O2Pstg6hj5~1D~m&hy2jlal$eBFRsq4Y z6J!*RDP}j!4d{xJCfvw4LUWB*nA3-nx4?d@in>L;8xa5NT7h+5)yd8V68bE@k00H_ zL>gH6mvqC?EG7vVaD9__S39uYcV|j%B5p_`alMRwv7`QZuYf(!B zG{0re05RS7Rfi^st1*C3PN5*x0>kK&_^VF8fJ<`WFY*_(OF^%8IL2im1?gPSs~uj! zld^@|P3{MNn&qTX@F3}0Pj+|4BMMLDMz{M_x7U~3gXLmc3%_A&Q{D_3ZCf1-35*Xp ze2f|od3Pv+)Q;$qa4J6Ti~hnFgF+6uEAl45@F2^oY+#(_WT`1^3mSl~=wbKPT|u zVGkZo{D-~p-gGjCB8$SnceqtjP#UMbZq@HL>c&+3%`^mri-vy1mG)y(i}9~~9y=B) ziiLC)J6A>uR^RQ!^Xx~ZyQgV3K(q$JqPQga4>(w(6ld-@!;_C~$PdYDmRb?Ic!BQRz^jcDf`rO<|&M=RdWSA_6_M4rW!z?cn;9sPVIa{k7wDv#tVSA?lx=dh>7VoPh zM%O7Qp_M<_nlFFWRS1q|;CnX68`pArN({;ci?)GVo6z(uFJ?HaiXYO0mea(dyB#~^(;si)xmAapB(P)9gh4%FFM?;NB3_WxcfqDP`_WA zIgn2kRbMRDI_dp-Xi%?gWb6H`FS3$m>*f7KrhzCSwbA)S+&yZmqwJ~~IfRpXN@GPb zje$WDyy(jgm4s6QGH^&*;+3qtVipge^hZ#{!@x*Py24-* zs7GhRb8dmhW%E8c^oY!MhNE7cM6HkSe+-hn(Z^r<7_e^-dt=h6cN&q@%BOKT8|7uE zd9R?e=3zk{9A%zQ6;#<^43K}kw}^Ulqm9eu?G8`ij82fM6}n#@eUv#Lg>~M@sh{)Q z{v(0o(u*f6as?XIE6dE9<&|6mXHr=D1vW-E`iTv1e!~53mjr)era!eiC7W{=i?+WbqAMXS0#gHZAiljrjpS>Q|26Ha{A*;L#tEahq7>Lb9RVrp z1_py&rR?DEhL)JgE)l&2h)Y+aP;6ImVjZ&V$X!)(buoVQ6UZxtlZTXTik zz9D0^bKsW(@+Mmf_et}zY!+Dql)#iP;y`FQYH_ViB~;i9Ll|=WqyU%vAw|)0#Le1w zVjh|WV}2(|j;B1VB?YfMu36p^)R|U=aCK8#9>adg#35fya@5LV$xI`y7^i704-g4{p4$KbIG? z-N3J>c(Mlw9^msC^T~1wt?KoQLRqnycsKaTUJ1aL#YNb9Z$% zsy5U2pPoDjnXx7TpY36Ua3;6PkS}lTHu}>S?#S|45c1sz^6u`bK#W1b^i-emzYt0y zYCl5ki6bkj+R$H@D9rn%E<@q8`rB}No5!=m*>ZO4r>L5%rQy{}>X%GkviIfNru;6y z&%bV-TxNY(FY8;>@Xxr{DqDhQh8t3oN4Bcl>vr0mo;T-%elIaf+Nw=5C(DMm^f!&_ z-mpL54lCPHuj;gWOVaCDzrr*NPP~si_A?5f0qXEyoN>q=_%*aT0b_o2Sr#8if}?KSfWKdWgradCD4k!Q7uOrG(8%7VT^Xru@mCGSPy&{Y|JC(gY`c!mNWAzQm2;CeND=f8R0+8;HRAgRd!bR$3J2G5uUVaqqcr zZ~>QoVX^t@nn8O*!v+~XYPu3L!%M(MS;nlXvDX`gaxE{wEH3IW_byQsqJVYXlfW8v z;3Ah3rz8)us$lnc2%*azcdrrL7CEuVL_ber5uXW4v(-fqk}MG`s%%3R_?~o*s=LU0 zhAK-*n1&{+!o^|PKP+k2GW*M}F`)`+^$t?ofom7JW9KiugXwVy=j;XdJUmX=yKCiqGB|4{o0o4R6UFVD`)n^0V{#mX((c~zZu@1H^;?7z zQg=yDzDdO;fd)ws&nQ33NuUJFM)IO~GA;u$9BWb!3fm`J=@7Q56t~BTb>I z?ZvemBGP2voBy7^^a6sA&D%p3NKAkk*)6Y1u6jB+IlGjSz42YR^re--unos>4UhXg z;31Fn)IGP}_h#XS@V?SwP&LBf(;+CoY-$#Gc%`{Vuxq4UI<0iCOAmibz|-JSJUw05{MJ_ysbPrt+M=pq#)7I>JX}Ev@Acou6&fT|ArO#<_XF9Z3Mn znYb1qnTOvl!7BRuP4bJaQSaUx@TDeP5PQU1R#l9(?|;reh0$n1B)=(We%=$$XA~j? z@Q3`w!S&(_22B=ZSF1b8Yh{^BYxG{_CM>M+K}Nwbh=kaYt8G8A_$x7tgGt7eTDx*)Kg>xJz3`$t-T+I?u5;0zQJ zL|)q~O8B(5S(QG}F^-gFudxJDlZcYiJy=~x)TN_0UGr#1L}{?;nZZilvsVM#bHU}k z=)ijy-1AMTom=z+RY->phMF8l&vI;2S}|UhraU?8M=df4W~>%F3#6goni8M$oIN*k zk?~u{jTrCm+K$WEx06cb%>hC!iomn0xv zo@Wfip6)zK(Pe>dpT!ZI00Usae8a=1sddxm+Bx9zq&d4Af( ziYI^JLn5Xxe5Rr5RTp8>pa?k z|7*pGAqvlssKM_kU)ztyNl0pHX(!Tr^66gdGhF-KPUBNGgZq&~JGs*t)*#6X6}jjd zzYrN$VmhryWPf*<_5M3(g-Bd-O1GV~ceT5J)s(JcHG0nuS(O?38N~m9BTQMP(8;oYf|BqL*LM?nvz!h5}f9s^lt^|h2-%o6~%>R zQcHcv&68)}7kihCn^zi53y%Z~qMo&!;TIB)>SsPu6|070zAxvQ8|k&Lg~V%2a>keD`51%dXX_56EJdxQ)=WaPAgjVY2^x?&v1 zlBJ6*CJ2AY^Q9``bFg+@qGV&-m8_-Jf$2@4Yzd>71X6@(%yV19UH+9ETwo9Garwqj z`mM>U6IHRP7lddX;OfbAt8rj#>+oe_J!ZU|R&o`4l;rpPV%U1>a6WKb5anj!pT6{b z;d10c?I{j!OoW7LRTY> zB?ZmE+Iy5~OVDm|-noi0 z)Sbdi)n6qp6CtPg1`H!1owtLOK%B?aM+#(8f3j*S{rNG96aR~P!$E1L@7w`WAg>9f zSPYwN1dfjJo<3NrC>B!5&nblOZqTqIw6vHA&5lrxQ+ED)z&d<>y?#q~Gd->rAEotW zoxE3E+@Yx-V4LP5^!s*)qCx;4Ks)ofvz0G%JeRBg(IV#nz$Y&Y{+uKHzw5vGHqTl3 zp#`nLFWY$Gk^rFps1z^rl^A&Vh4qE*mOvj&;@uZTfx}8CJbDzb(&OO={d)wZ$ha zNFh}R{!sX&4W4zHw%+ntsgjAf!$t@SiHzCfc^Xa|fht0{Jqr|0Ybi{8Y!HiK3T9-* zB7@smu>lIF;%kLNOK*Nx=aTt-OjoS;x6k(Q`xnIX+vIYWx?CM+a3FxhFg(xUS%nm( z{-|u=aJ>S&?|StK>bVPTQvZb4I`b6S(iRMff>yaI0z1MvLfwRVouB?^@=2@U(Y@Gk zjjeA)2i-F~IO$+~s1t+ALTrx+of<;kGG*0X1s+L73_aeGaoS!ly7FR#ZoRWwMMZp{ zG0;)pw1E&M*rcCZMtz++G^RAUZ>Lh;uUjUg8$enVmGh;#ezmfagiM- zZpsc}Hi9Wx4r0Q&h1FU?TPC+9P$hfXSS~?eb(i|)+xc7y1}+T#D*7UB7H@7yRsC&H zENtHY9(UMnsl3Q*Yp?qL$mXKP##&?KAdFxviG3ptsCWE3YMh5jM($|COtl%)b&5~* z=n^i4@dsBUU>Oe#*eI@x1tp?mM6CZKiLC-ZLGYtGskus**m!H*tzKI@P_1Ls=L3H6 zkU}U!2(58fbt4IJxIdt^>84K+#oMNcylp0|ICL1XphNW9yAb@LIhuFwc(ex#QcR6& zyRW?WRp!1>x$f8=@VTPJ`Mu_I7rH9{&VvdCr+cJY79fz$qagNv6S{nH*!q*Wy~Rri_(?&l)DMG!5DC^C`2&;_VZ)Z z9v3z=S;$&;%_t2(p6p*P{hNi%uML;ifod}&^HGjAt1EX(3(?=jQ|~o4G4IUvc9o~M zG`vm%W|oJ7#MB%tO*4|uX|QbZjNM9qEyEsZOh1acI3&DY!4Kb!w6n z>7K)=Az`pp91FX)QYyaBmE9zKB^-$)=^W7{X2(OaqE=dBWpn+U>|nsPdC3j;u1A<9 zW1g_xm+KPC9^bmyyL-thqqad3rd%xcV3ZLXIYlZFM#wjh>0U`_dy9&C)i=FVNjsR2 zZGa4>5LM?cX4O#mbIu25?rU4Lq`@?=*hV$ds1wV$MV>?X){b8kPzMv-%2PfL8H(4D zL#1_*WEOiRWet=p&}1w6&uXOipxZvyg!yRHE=ie(~@ zG4WyaSIeZr4SK$iagWLgUIAV_V{mWaNX9=Vr-NVHg@LFVV?~qHlU`E0tBSg+ZThC% zo1*+0yuME4J5}ChvpO zDT2DM?8G+^Dhf~F0ak^kHa#uZ6*DNa36-T)uP;g93-%J-7DRd!N&_s;RVhQV`SnIiO{TD<(N!2H>;rr&7S%2mJhS zX32?VGpTugevYERYP7Z-aOr`Rk76~M3Jj;yk0^d)wdxlz=(Y|oug!5f7nkoF+n(lR z`o_4v47VT{19WJ~Z-DXQFvfnwxCen@;dY0=aU;|p?s0&XM?frwb|a%*BxNP-kXXn4@&9VXt?(cLmJ zi#rzmu&TD~?LGl4|3=tiRJi)DG8kM3!vm3Q#qcK0Q%2=*wuD1EAq#?G0Bk?}F!sZ2 zGOg?J<>u@Msm2X-{;Tlh7SV@|`5q0)3dh?<=MI>3J4E8B`3*CE&S9pQr99^`7cBkJ zT|ntgo&?SOUC!CTojlrG-&9>S!{O6H?__#4tEn#df$vQU@_KWF|Ygerx&!0n#( zRJTZSY1NYYV1ngZ<&&SY;Cw5L_p=X_@tZ>8IW4D``9(`5VCFJrPePK1s_hSKS>!!pzrQ} z{>gWVMnc-FIjH8@O8VKM=&He^q@cJUXcdZws|5khWAT*&b82&@Okn3*n-)hm0bc{O zFOlf1UBGXE)=N?qbr6#T*zjO!=HMYkA8b4slxVhdt*1156?~u4_mnthsSsQ&JnY!# zq_;m+%L9>g^%=U{iV{2q|9XpeC!Vpl$X>yJLiWCV^1aFK*O*=sm~lL1L5fO8WGs4T z#7gA>Lsh|hcGxyWS3w&p>b0da2!My6B~<_TVZ*nUPpTlYAJJP{JL0=PNm`=e-AfW= z1Z$IG8iX$<-qG4mdm;~il@EFBJ+p3J-bgC(tFK3JgGq%a+NNRg)|Xr-Rjo z`hg~Q8l|l%AR|aF9rc=8IfufaH1RVPv2oy!jDxk->RFjmLo(ANw9&8qG;yM;*H8(R z%hB(MhRa;4?)qjkP+>YqH<+U!w!x_$IsAMPguTl9)r0xa5_Vu}5tY48d&3f$;X$yy zZ*|has}+th15eQt(4gpR&SsWDCo5@IwyO*cpPQyD;!m17&ZX@$(o;;p(-tgwc0qZO77|Q;lkcA=Diz{ zFA@Pd+6_uqQMp(5e7&HfeQyk!472*~c#wWf#`2f)c6=$Xk*&EKFWc;f0kh2fCfrk@ zhunHMdhdtr*>A~gkr2>V5V@t-giTqwsy5j&+HC)W#&vQR z-SMBaa=BaVBcwVo;5b7UJ|Nne?lyDGDC|gAEBiKLfEu62v8SIWpfexO-8QX$pq{vP zUOQ*usA1ArY7SY3OyaA;H>#U=?^yb-UQhd&J@x80&BJw6bhkHepOuV-e&G8&%wg|M zzP~cSSjsy4dGV7Sh;1bv6fbu+e~VI(v8A|dHy|c&Ox|gQkuPfW9?Fl@shAcIw*c+K zPHgs5?$^dbhbM>lEjQn7GA$Nawk5ENPHw&~*9sZ9$i>+4dyPY{^#%`WI}HlqHRelB zQ?2Sv{i(Hs+5qEzWYz}AD3vx|JY3XMiEfE`F8YiwmS@##J?d%Kg3fw?)FlH-?587a zF4vxexZy&=L~L$pzPk3kBHl})*wt&ga_SJiB{O+1o+p7^XhqpW&3Sq+8G*CF5Sf98 zEVay>f~9wCqYCNgX~>}tt0;K+m>R4mS>Ksutw=F5^;#u`x;tOH}ThA?l&kAJ&>y9kzUpq4(x-VI=C&U6GOw=#pkI zJv^%G;?9^5%QXwe6Crdlmyih1#e>X{k}v+ro)M}@Z%TR{*1D`lh7j={6rUwkZ(&Li zJ5jO_TXqh+%2LrS<-(}4>s9KOO5Tw$S>T+8kGD|UV%|cD%dDKxkjuV){UurXJ+;iZ z)<7smeY#yh2-Sze^s?0RVG8C#6Fy5ZCY zSIKS`lWiQze(7{8sq7dGk z#PqG7KYxm(Iy6UqMhWs_TXiMJP3g6ObziKCKEn-%vw>z5Vp@JgMM9-bCUA!xh}vb~Sw8 zOLS)Tk!rtCSS)N--Apf0S$RnqBv2$)bdInRoR5VO1#KTXwi%flV_s;+xk$*hc1Y?? z(w4_N{7WBi6gEqpn@SK@Ki!6%`Zc0<1MHq36JpBC0dHv$Y#rYzeBbqa|Fz6t#5>zc zHp(5VdURLL_91pB!Z8>+W@OkL6RWOxpeZ7(btZR;##4p~Qw@*X9#tAcP1rz1#{%>& zNZOXah!4_?A9l5Nu(sw-Yf*F3K=_t(wOx>S>pMpV^tHV*HKOSYOzo7zxW>~@} zw`zjnE%zY#lo8lEr57wLYEl~$qlt>q_1l}Nx;f{AKKf;Y>cpgnU5bqQ8ev0N4bhcj zGyh>v1X{_rZejS=j&?(0=NMnTMN~3Y(7#FJE>HI`EbNsF&kcBfm9nHBmOvy7&}0Pr z=uu!~MkgL=XV*za9|F8zRNGJ>kuXF~GLEDnFLP1K^?)w%wjw%OU;Va4ou3x-@?+5+ zxw%z&ds40j*oo&O59<5xzE1gCUeoyxgAEs*ya@!Bu-j4OxwC;=Q%)&3@^%!;sTqlR zmVP;BBGXl!XIggNwi|CCV#)6wrdPC{yvbFjdRzIw(42tJ{LMlT%MTKvWHP- zLMF8K2@wxgADw?BmfQ#!d@UTc!#yI)1)p=Ol^d8T3CKF}JIhU14q(se$(rYitIOD) z?B+>Mw@Wgsfv#&AO>-bAn^;0lkHQwHn#~7G3ZSAYpM1r|HhPDdIY0b}nG|xD>Cp`&AUj1C`vnf#6`0z-7Yc}JutNDwS`a<#m7hRdJnCsanZnvr7Tte@LPlQ@ zxv(Fbkr$iCDxp^PoR=sHAJ>RAovG}UlrvI;o?P4dalAK#k|>g@yvnS7cuHu?mMcA;vsEx0uOoIsgS536#3Qx|?1#0~|x-fJJS<1tD~im_^UNiLp*HxTczh z#VJEK0R@)>l~2+skMldy#|(tY7;+|VM_5$NQ)lD=6ydx=QpJre3#}qYCkz1xxx;i>tK z{|)^t#YS!@(m@9Y;Ugsa`m$l)j86@pLMloF_hO5y)HS&}qClQFwU}tLETK@s0rx_C za57yT1R4#`d>>sS6(@;2{3x>Jt`sTDmcKK)*@L9NFP5m) zLHMbBP~9k6fBuQRcjVRT+p8}LcBm9qXI)N&QXb4%F6Um?Fhlfw3yC1?F|jCp*0T{r z+tH>oVPXtzuq2ftU0~lzWCGkJ&B;t>=#U|1FS@2ol86mej*p3pRgjgJn}#k#N4AvmYF!rYbHnGu``+ zjkP@-U-@aTtwOvy&UyJ#s+f6ultxvtM7}&oshsNyhsAtK(*QsO4e!^z22BPV*|l*B zP7*4WJ@p-)B7AK9{1!A@oGx~F3pQV(d~*L1GIz+bdg<^GA1^aQOLK)v5ht_Du$oho zK!*q|lw3YlGh4BkRUIF&PmCq-I)mtyX#Apn{UW{$0GT4ejyRERZbb)_h@ULbe-bN2 zb%CSF6+j|Iwb^|ER$N!Dhem0ZglVM2UU77>-m>9*y}XQAokAWyI^Sq_xQKGY#auK2O- z#X%*0HC~a^UI*@a9UgvGbg={eu4u3Qvy4ve2f=n}$xh2hhy&Ai_U+Uq z1-J!9+!eb}f6=vq(v4=yj)3Egm~Jau_RjF_&Dn{at-bk9f<+duKWT{|!(dII{q`ke z>vw*NOACL1#+`Tm$s|*&raouI_vOHQ6%p_&%hYLloZ3j_YI3YAO!UikynN8P9Pet| zs7hO&6Y~qK$_F<-o&V?4b$;kMbL`Nx2`kwPGFyx~xD&wYdzZE?qBbkN46;B9q>LcK zCJW<110f|*b&;Fl)nV$SZ_k+R&8efi+r#bfID{`!#3wA7(_2s=Z|ETfP!hA_Bnuh-Iij>awKLE2polJ2vxb z6Y2nvz=QbpY{5}J^y}KWg2oCL$eKAq#`o>mx_SD^k|l{7*?*AFpEGrG512G;P_=Tt zMu?L6!cbw2Mico(w`Kv4A({~>tQVzNszSD82B#bWaP_j|nBNLRp!9`C9d3$|z&+3| zLPE=tmme~JB~5RIuf_X6X6B;C`oT{7=E55Q-31-C4*qTue&o!bYUsbAc-6x(Hqvr5 z;I=aUa0f~RPD&MoN+$A#ZU8QajP}2fW*+ec@82>hRkXMgt(`q~^!V9j%aSE!a?xjB zziJs-@C`D1cIT*laU&D@yY#|GMW1VHVA|X`TACgoJeyaKqkrcM%NUoUw$HrhR~E(* z|07+gqe}mw8MD6t22XEayL$P?nF#1Yqd|%h$(h1q1XCitGlWePHDOY-L`WXMgci{c zRisd%QZkQJE@a1&HV&UPcHz*nj-DUDe93eQNEfm=8csmpI*c$%s$l*kwiHHs&-NL_ zzmU1Jd%taKk(+~yv$d&3u84&zU`XF#%4={l`9b)FO>PA?%v=dH^`aUZ8UU$Fux9{G z9x_?}!~_vek;Qm|2HF}65`B*z7k%>4_37pL^_~5|9mtSmD&QqU(Tqeu@q8eu7N&`( z1+Eq}{bI3ne^UeU|C|}ZT_?ViUASLBJ{u1nV@O`9)CxQFgoN6|fswL~K<|aIT(xj?WX7(8wTjF0W;wn>bS!UQ5Vek6 zD*0ZpT45hi{$;94BMn(|DmD((2E;De*JX(;m$iczwRHU!Yab7_^T=5Z_^7zW7LF|` z8=lE7k;ah=y&FW8=1DOpA20lHs`v}48w|y|z&u)}HY=6zT^4wSj_-|2VAXbiS+3k;F zlZM8SQv$-^i&-n2lgw)>f_Q!158(L#9Dl(1AXM_9=^JKqvoN*Cf6fGNASO>YaqZSpQ>~$(RQ7}C(S_t09}E|*S~}0 zKoNCsS^d<{XW+W)LH>DQ?#D8Sc>O%sec{~A zaCjczhy#%Xfkz?7sl)oY*-}8zDV`dFEBnhv+-WGZzZrgKF25wR<+J?GR+PVB zG?`&(#Ys$1w@;=oU)B&38^_0ix5ZUsiCca0o}$92sf^~kL7?dt0*e=q|y#;PzxDd^-qGq7Et*Ko?4J@th-tG{24(e=y8iA0I2ubun zfaVNYQ^Z|vO!TT<%E^PSc(&6qZ0+3LGa0X$LdK<8seH=UDlUXo*Hw*0HpZBmSlg* zC*MuOuYkQEE^lT~c<^He@H>4kIee`R*!+d+GfRFE z@0k-Xob2BTBm7g}(`nuQQ3_3H<*Q{c*spe3Au)t0RsuJ@)Ez*QTH*~L8Eu+sPW!ip z`M)(RcJN+;>p=4W2W(eU7R-T$*?M5T!H&rPTX|!%zgk9M zlh3Ad^PAubCu2fcRJy|vW9SV-7{59f;>3pLjejR0LGTNRVtHW>d1IbgUQb~^;0mF- zzQF$NrH*}+{qXWamZiu32io=ZpJjlvP65KtsvkrD6Z;F=f4uwS_b#{;{-7>F=o|84 z0X4riP***^vU~U87OHgn^zsKtq#5UO#z#KxWx59Gmi6IZNelZmRj~r4%Tg2F-_Ad8 zp~+lk0v=a|6j-}A&5_}e(15?KqwY^&_-Iph54kURY8-#rzQ?xsEnI91@`+ z|2BLuO3yETHFK1Tq*z2$e_#yI^<8^z3I`}>NPvI--SAP)fcS5`^omFKi6{g(V9#_7 zH|+8N@Z}h|S{){Zt6(-&K6R9v(eDJQ^uNVVn419qIx)ae82n-8EAT#LPL7NUmdOcE zZqjVNMw>I1&iS9wUgvvYY$|jKcCq_$)(c?1zub8&k?$9?6WJDj!n`k%%v`vR{ErHnidK!>VbQyUw0A!Whtr%bEf1#E%8`MT!?aK1brlEF z3ff4}7&dkI;(m^&7t*E*(ajdKql0_i-_O;^KzqB0Q9vt%nW0Mg!edm94tdguQJl!y zXSn8|;(aZqKKQrwJy(MVo{l}9_>rU3z@5$d6X^4S7Op`y;iS|_KH)Q1!m6l*isg?RGVL$(-X=9*~@UG|W zSj6Jo`blli>v1xSFTH+mc2K|Bi~}pi%g@LkRQ@SvX(491F_s8{`nckQ!@l2hCJQc%joH65{9DUF z&!F|8WP%&tq=RVH5F6NcuWoO_mUv}aJ-)31*S$Jc9TdQ^q9$(iT)9IapQ!k4$gv}w zZ~32YmXc}YpIluiUjp3$ggb|x6ya+*@jm!6g*Lvz$XNfTTD+qVVewqReSg*N7Ym*~ zn)J9?7mCLon}uP@el`WKlgF_$Gla%w#cv?K&+22lHn}17ZN-$&L~z$x;ujcpEfN3i zg17%XI_^KL>7T#Sdi?U}hWK?vpyv!KexL%j9p`@z8`9q2LrDGh*bUNoQ9odCu1mo6 za>3(CMTg@Pd?arNw8IQM++r;HC~0;p+qmHITpO;3yXGxGQ$?UGW?~KwsT*bwHo}UP zA6lBl1Zc<;!VdmOX=iEAA0u9Rlv$pX@AmX-!C0S3&XCr~iD)%@upvG1DY8jQkw3duEe zm}+ZzjR~x<4o-h-4R3b)u<#rc*^{d0!IQ;3Y54pNGar7kw-YzP=!rrkW&MSD5MM%Q z=sR(pT14LRWi>+QYsY)BJBnE2AH-GhUrVUS?~OM_eiXta?5k0F)xFog8@m5AZ7#9* zft5LQHKoD}c(F>sDg=ugF4z^Z(R9xPK67Em!x5~Kwr0RLtOwyhn8?In#U(>p?N25xb_lI!hHLbce#-oB zEKg^;qOVEE3mtk2#%&@b_HPZmypR^qcw?sDntszk=c_^Vm2RB8VOI;0Pe@cnJToz5 zZWvM75ojwJwOb&~a^Fd8C7LY{?N`!==9sM%?=-&5rh`VhH$UqBfTPM==vj8Qq~%0= z>l4$*OfKp3En;)qV(b(a!nk^H$%)?|$reP!lo$WWM;NJIhwl-i(>B=xHX14(tT}xP zgbTNcw6IdOVex=`TJ6nLa_S}&ODzT4g`Bgfyd*jVQNaHI%A$&pl z5yLVXGiBunYVNAjBJ8L_r?IX&<1;NT!2N*eVEuPb7f1nL^^(Hjk>*0zC|-S zgbYea?^6ptNyl0|h(7?zKNeI%)QL<$kzu;P8g z#X{$z)YGmqUAPM?HiB3pEaUG2rvk*aM)Md-`_wXXIQ4%ciDQ~!s zzWs_Wa^UGX(CRH=5lA6qSA98pzF49csK?46PvptTfH4tWO_dQn#vXx`-uvE+xCn+_ zvt}H3%-C~9x;VVpD$ETO&s#lT{`fhCh6ut{MIJQOQ8Ivrq4`>{=qu0(`zY_hs-HwF z3tq?|39mppUv&erh$lV|$J~AXB&jQf!&lXh2z~)~MG6&|Hlst_b?zJUzRN0b(OV#X y3e>dqhbc373*prGjSgtQp0{Dy?yk@!*xEOO2V(6v-!zi>9=C14`4Uh8fd2(+l=o!- literal 0 HcmV?d00001 diff --git a/_odoc-theme/fonts/DejaVuSansMono-Oblique.woff2 b/_odoc-theme/fonts/DejaVuSansMono-Oblique.woff2 new file mode 100644 index 0000000000000000000000000000000000000000..2631692e5e034ff975dbf9b30c6eee4486191e80 GIT binary patch literal 107524 zcmV(^K-Ir@Pew8T0RR910i*-~5&!@I1K0!r0i&1z0RR9100000000000000000000 z0000#Mn+Uk92!I$g;*SdU% zW(R@C2MmdBTWK$|1Ej@m*B`tH0jetKHUzMf=AKRM{3r*+1GW5xMy@v)r4qyI1H^f(Syy7_lZlza<1xBN(Z1 zcz7-zwJoLVvh_Jz38wDaJD?8I0i>bwcrqsC)0xc#8=Is^sH2`!%f{1%Nt1rDtQ9xa z14ElFG(f9qjhyq0#zD3~$JQu>6}StVE&sCH-TI#D-Tt-}>~N%eZkf7Z2e017fd#>I zxTmoIUgYUiBiOFN+lUBu;%ANqeNBD1Xsvb6eMTlIgMh`{GIyqFkKdTHr|-+b%Y0MI z^RbjM8$tp>%n%hK#LJU}xe{1zRRr0F!%fMQR8MBobX1l1I5xv+@{SL_dpCUYFcA=pUid8%!{BL=XarKg znR1X4_y?8*Id5;6Cc)3$@er${tEL3OI%V4HGo)ix;R!Us+$H@gd=?rekqK-79&@2j z4`*v-S}nti=et$@0V@6E$9&_{Oha7^?JVan2inqk^ApU-)a;&|xj(QVCj?Ukw#p_J z$tSte;&kE({UB$f5LXbD_ml(Adg1o```*b~H z(Y(LKZm3K4tEW8rA|t62d-Q#hi~m4G0@DArRb)1aaqCff%FVkEss7itb9!wl+UMQqXl2DUTAw{Rl9EF!7HFplJ&6h~Ioes^EA0PcjlBId8<; zwC4a54kH8ji;87SM+Z95g>E*7)Jq6PgQ%!`qcG}2 z!OG!boBh*;+blqome588MZ^R_KtTiyKtZGh160JQm^x!FTW9BH(O*PnL}Y4Wq#zE&i37x$G<4^RY?;x}%&c5# z=2)4cS-B!dWk$MD`-HnXDT(VZgc<|sT++H2@(Xukl>8OnISc@=p0AhkZA8-4l4i7+?1ae zD!;UTx$b3qCsj?IAdnVB`BVDDFwMTx>uZzb(keiJAS@7|QB=M! z(+^9QDVKSU^8?uJ-%-Rl#-15xt<21fvEuBVF*_t{B?_UUM05SpP(O`H#eUEB z9+naXtF?W)L9?JU&;Fh_=S$(?V_@G|sgf4AU$AL6;BKRgLkbk@2WV~`Ws{>~For~r zRFEYL#>UpfHeeeSF`@+p9W`2sHUJB3oV<}3Z@lrSZ~g!3R79iUX@L7C-_2JM+oUcP zn?ejOp;>R6ZP%dc`vWdONOMQ93g(HvO+62GlXO5s`f@lJYa5*`~%1FP347s*DC7eVCRgCW8RB_HXKn7lE>v~j7> zZCq&ONJoxRz<#}ZzBzvFmuL_YF=;HkPAe1fyPfFfn85${+hPtES@Z?8g!D^aDN!`3 zPtBD)ewRZ4otLh{T;f5ASGq!WV!y}j7V54e*GGsJ36;=j9>+a%{i2vk92Z9mIG`p? z0?aHBInDrPzu4|%sr%u1; z3|>Gt04x9+DA(m~{X++xAl1nKBgODOjJ1;Pd~f@wj(8GnG#a&#BPo)=Dj54~{_`z} zKtcpWR4nzD`daC<9ChQ%cJ^Zj_PVs~X9vsl5q@;5_h0 zRNN!e3M4iu%a@`NaRQfd&Q-Gst6Ne3v6NlG524K(E_Z=kg)Yhv1v z^5wL9o8umib4=;9A>S@@+~Xdvn{TP^d%f-Dvi^Tld+DE51XKFqL8MZkeRoE8$8VpN z(!7oj|BVLw%}BelyiVyXCoqQxaK2%s6G%h!x@XxPLGso}gmLA&f@*rwoJFc;yQA>B z`zSg^p(DFz)4HrK0K^SI_z8tKK`KE`!Y7+@A{|rh+*PDQ2%Z0bGxaO2>INu~-;v)^ zW5quQGvut(pLHokjq}m&WE*d^*{gfstLLh!t6xQ)CU?M1p?xqs%}s! zH2L|Pl=dvBanfHm#u%_c{iUd{e<<=>em~=-bv_#7!!<73Y~zh>IJ-f#S-$B8=>~be zM^j6x)$X{<-wF$00Z_h2!C_=H#cP#ymCoM_N^Sn;OSLZ*!GwT7geU4_0E@w59DjBx z{j8W;W|{rmewJCW!UMtq+x%YDvK8<#m$-U&+H;CkNJag5l}dG`jvzIw1))unLyRrx zIP7HS(p_zye||qd?N8obqjJho?I<5B@ebw|a|e?GgKz|{vbHU#9cA-Va3LWP5+c%T zAGh=U%9RbyU7J}Zgdq$e1QU!ALKVVzUDcTM@#MddE(5!fid3n-P!Y^yjM(FT-~SoL zYsa{mk7b+wqA;j1nH}sGBv!D9^Z1&B%b7Y8utiw10+O(Qw`v0~urC zbjqb~`H^kCLqx9Ze~ zVNY^BSgl!dvdAe60IHWFey6tXj(|~qe384g-TjXr8;Mku9Y@4!Z3v*46nC5ow~;%* zD+OZXmpZGctIX2*chxv|f!#U~Op~3+#ydjf+q!wHCGe_|PU5A47MftrT@i_9^y&T%llW)>tx9O|`-CX*;#j%)JWSFBW(IxRZ9 z(QnA8@BGfc;t&Et)JC#Qd5V>*Qlr)&BaAcI4D&3p%K5gs#CF%Z$sO)-5TvjHIJ7A{ z_U2S${p|KiYW&nO)>t+Mjeq0Z>{nMn&=fo#do9n!%Yx)!ZWyBO{ zaz38pGQ1yDDYkoY1x=08s>ayejVqhe&gQZ$-Bs(lvo`Ku zkv$n=Y0pUaV)=WaPILh>i`&$k(S(8}<`9C5PX3EKADcaACoTaJk`^UfMm*uhNKQ67 zXNil@0@yg0u%lLNhq$fSg{+|qJZ@zx$0-Kj_(E{%vYIrL$`B`Fe@Dg9_&mO}~K5t)*?7`ZD z!y{wT@`_5zs@iqz?VE@Sp`u!{Hu_egU6;PlMi*|e=97qnpRfpM7}#;*RT3bAjUOEK zRLhTMtl6+-#}EJFmt1-B!u`LBo#J^qY;1N_?fc2xA|ol%*XDVbUPwN$T4>4ywg=qlagOvuXY|8eJ+8$t#E z3+&jGkA3M!C;fxWi|q%E_qSKXTDVB&q5w=1PVhty)p=g!OR5!WfiEgo`Ff&C)v8gg zCT2+tb3CUK_aP*vn0qEKyR_`el=;imid#c}^`TIW=_=p-+JW7{9$?J-O(3KY z>ghf7x%(mmjmR3I^t$F%&;87WJ>c`+&lXs zcqzPjk(ew((5e3`6HApUkCiA^sK7mUDcpA5Rk?Cx$#6-E1W_V*;;?6j=AZ-qXKS~e zwjd&i7wU<6tRAU{>Ob{$t*OQ`G>A2r*)~o5b-D+0Kflt)cev$u8Pr~Ps>{c_Y zdM93pWMj3M^h%jnM5Cag?idqt84A0wZ`ZbUb2@&#|Iw+juk64cvnxzaX>^r7p(nbf z6a0(gFd5JB82zIYT7v@rU*7#+U6Ld_u3o1eC-oUIWYUBMi%<4BtXXo& zW#?_UYSj%ta$$%{iKYiE7ljH97Lt65U%az1)@Sle3d9cR<44dDpjaz z)uL(EhOR?5wiCp7`t%7kU;y8cVFIJ(g;}&D*=5&~I^t%?NU2-7rmB zMi?+M#+t2D>;;+eQ^;2`xs9YB%AOqh`$OvSeA0i!M27-8H@b@W`O2UK;bKccy&s)tv8sSbO-63~)@NyRh-hDoNJi){BRDwj$q!8IwugiaWGF^4Q zISY&}TaM}N$+7^YK!F)W$_~Gl4G2_UR6&PE#oZ;ZO@I&E> zhR0o{O5Uk&4GOlk1`QjufL#Rvao0gMwm9+h7(%2!#iqKNs#<;Qoi+_`&KzGWE+V<+ z7MlCsVEgD}BBl?tze}V&G$hcbBac2~1)$88v0|l)vnb5>1n%{yf$K z7?!|6fW!(EGz=^pYc}u*Y!Q)=QBcv)F)*>%VdLQ9;S&(DCn6@{K+2JfoPv@QXD(D+ zxpAlFL4%DW1s4xrsx$&Z=|nP!Nl0bNk}ZdfoI6Y8_Dco_-UH27u;GrVLN<32PsWRm^7Z5NqDZ05tphLWs+&WOD_znt7WZd4w z_s(+0EXY=KJKSDsFAOZT-{PV1d}P5B5^T2HYeu#2+A;W=ZYFTiE=t;PS~tVZNOPt+ z+l)6Sd3=9@XHx;%>CLUi&{cKS%|(K4PBrJ6D@2l!I_InlE=q7-id4W$vSiEjBV413 zic=QlQ9=Ewj>^cCB@4j28kNXbqD0JT;_8+}bxk(uO7EpZk0SBXu`JUQHCGINDfn6rN4{oxq+ z`&#Zj!F-aQ@*)jBBd5EH$rnJPD6%g~1!7tIYFQjz>YX)o8@Xu#esQm7`&>->7(;_gh`n#9FLYkC3p`-*(>_QmVglteny^)KM9et zr-e4UiO=Z?gu59yf2sRF);`>h$+hMa>UHW^m=^!m`VsS7PY z6`#1e9Ivj!mDz2R>j}>D8lN*{l+(4<5Dm=A;O?eM1(mC0Aw=`Sv+HTZ@jXiHVpeZI z7gY9am_)S?a^AagHoUJRxkR(7zlM(c}3B0iTr(_jt_r>sRWcp8GswA>rc*iz&= z$|z>QD@!~n4B1%#<4i8LcWDV6Q{cY}p+EeG@L<&Mw>qN~H|}nf$-4m~foZN&?UQie zb4GN7-DJ-wXu|i3Y=eUWok5wn$vZA9$FAx2@a^Ndkk=S(vt+o_a*UocRfw+5iq$iM zHKkGG1w!Fogta(6cqQZRcsm+SdzgxGtIQpSiG_(NtE#d%1qiicc{?QCT+XXR_4x8p zzxXUvA0HmE7xE;EE?0T7=kCyG9fDR;iY*uCxkOk_LQ*>PCFwWBW-6*Uswkj>G!*eF zL>?P7n;NwW`dLs@Q1#@0!}w7wU-iXDY8<+N)7eAENmoBH6Ea#^`<=H5DL`J8ZM1s6 ziIw&HQDj`#09SSAn~!h5^o~^9#H%`sc?zxt6QUDvY^X=QvPRi=xmB%XIS$6acO6

nsB@n{3GtsxA04|Am+g-3x^>jl-Bc;UCpow!Np~WII|lGO z&n{BNPYuk^QbtGqyjq})jsb7lu5VCgK&dYUyGP|0J$(G8hW9xrMlxC}KgzKSONsbc zUAh1KYSF~pS}@l|it+UeI3#WF;d#X_fGPIBKd$iF7o%Mb_$1r5(Y4z0kt=Ntc{&I* zq_`>}S1VtdNjHEu0A>&~tl7WnJ43zWk%gNJ2a*$y@rQI}R%DrIDz6`0+YR~Aay@afSRl5UNG?t@|a@CV)7vYY#EqfV3tfUXLyibc( z^hJ`3;$OCqlJW=j&WipBTyboG+^^SfvZdtE$Lv0FMj#M2zDs9|MjnN3`*fo21z4Zw zf)~$IH2108KWEU~*EDUPp}F#4>BHcsacC4bj{D~DvcoDMnOYrkXe%z}dXg0CjyQI4 zwu1U=T|xm<(O06xJD21XWK&jb?2+bgU zUHrthLrJ-Pk6+y>I2)g!=*O47pSZKg3PA%~>5Qx@_Y~!yEg0^;c-tj3Hy&_L{rDKi z|M0~VC1<7lvwyz=rRQRE!!6V zEU`x_~)?l9uTB69aF=(!>KXPp>-8b0cxSoaDxsk z4R#N9bTamMF0pTy1w1BAnl3_+1dMAeS7u zU#T)bUW?@ualUkBR?i!5HJFr;hx=_4#)W5kyRj<5ui4vJ0FHM~a{4-Y${i4rt(f9f z5Hlo=TBo-U4`n9HC~3%9dk5>Fg^GGq+6A(s4QHXO4hZOo3L1$6rIVOg6FsP#7s2vT zgRY(0!C|%&lJ9}t7etOdy_LiIoWeQ)zaPhwXCZ7*itx7&T*-$h8Y!=Qs%}U)7pkQ! zBt;rg5#OviFb2#NM({WJJJ!z8H%}(;*{AIWfzMPJQ8%6m6}n?tSe6?4&yR%*JJ<#Y`H7e0!<26 zSnPuHcBG9|KuE)8idT4rqgWbsVy`Tsg+u=X-#`i=6SyA%?ez{93Nl)Z82W&ejmSkH z26v~`x0)2 zrXunY?tOl8Oi*Yyz2(7ZeZH2TNfMFGJ z{7sSMy(2a1`V+yNL?mCx3hBIDZkU=b4mNJ>rL`#WJ^sTBpPfWGatrei;T~{}H4>w% zs4?IuAm307I*I8tD~=oD3s>?*HcaPwxs$Q3W8EnPldD>Gtz_?Kf{} zv?Y@wVa(4OAX2}vh#KtR0#Ae)?hCqaQ(Tl$c*YfhFuhKtpbnBrc0@%ck0Bn!I^;4;NvjUZzBsx56WmLm?!_3(}vsl-CLX_?kSI8UT=^x7S8 z&atW(Txk+N!4lw4T@32GR&CBpP36CNBrqG=YAQ2m?f=OmhS~YmEp>Jgt@W(}e2@c( zU*3vEAYi?9W2(@4#?ePZ-AaKzgErCGGQy$Q(I#Z_jNcJ_p*1m#APcalr-I!l`>U&b zdb6X}>(7V69Jsl8jyhC2aM_gqNOB@a;@Df0q-594GzXMyEungal~oo=sXb$Ih?bNL z7CWMW3!_J#eJWU>NloS_)0vUCW(4z-xjZ2dNKcENf~t~T2$59l18hZ2E0i)=tV=?A z2tk;AdB&IZKmnFNklj(0)4}C=SdT0GY-TuDq^k;#5%f+J9hs%cO!c9GB`p&?VHY%} zgvU}9dqzs>h)?)+-teMgqK}^@8yn68KQ!?{ixk=l5vn-^EC>6FOB0+r>L>qqe~VKBDslGp z555Xa5rJH*B{HAZf0vJD-xa?T+f!H2{kF{e_>!oNk5uURm#L0w^M+s_H_@u}hU}EN z?%rZmdTazjOH0_Ai*v@5L?V*RQsXHysXQ^BEF) z4-7d*Z!c4nD~`qNf$hTa*1ox~lptdHFtwAqN$@{dj(A<;5evjYGxAMkz`?mVSi?V_ zBaW!MEC(Ov$UG&htU)H94RLhf z%B8kC>0#fRV-;0$LJuVyVQm4@l3S#Nhip~$ttgH{H!6n2lv!fl+L;VGfaUk)bUJc6 z?O3xsepYEAoR^_$8Q4-LKfwa9pD{@x7gjus4)N4^f(!gmWaK3mIT=d+ zTx4Vp8~B6p$}w;}y(K$1RTFPq?#r4+kwcgxR;1B4mlQydTEWre&jR0k#YtW&!3Fdc z8~Ei-rx*zPdOcqH3P2DzzOqfnYw}i~mxq^j(qdh&-C+jV4rA61x4&R(E0dCpaGVzp zz@RI@`gS$5<)t0y^IlRYt>Anu;tV0NeEe8j*W^w$kF<=|n!PmDbeq5@O>9XD@z z7WkO?Y3{(oUV&4-HK`spaLu^qVIx7Z#lxUf{%qKi95*|ZNqQM6HaA|P>B)QHQQNfh zp>lwxvgfj%T3MD+>E}Y7RB=GH_6rwsp+m_MXioXWkpsu7LJa*c55mBhr%k(nBN<1RI)Dm@y#~$k#3E0_}J;^7CrvRM4(JRoJq?2N}@Ee>O-%P4vepldlmiIO+ z>M6+Q#zEbt53-$;$yPd7LkigRF@QCl#0DaCvqXW>wVs3olrv6sp)1UbZN=I;@bu^` zFZIBQd2&dwVKBDn@2;}a)PZb5GL({EtB3=*=v$jprzKM_dIuV1e9m$4}BUKz3X%-ti zC>>$S6$Xxi(yKJbX(A&xkHuj4;B!TV#*>A|gnF^W%lU!S6S?VdZurfKd%wbkyuRH4 z3gJx!U=Gb6!FH{rjLiWKQK|Y7&~_nfX1sx`F{z(sY)ZGY7E5nG?;1?0 z)-+2goXpfMuAzQ>W%E}JTvsptVqZt)7M1BgUj5CvZuRIME9oYTnH7<@X~s`etAOT~ z?5PW7+_4`m<6~d2s9>-Cq-(3*fB-5zXm_N{x4qcCIq4+$a@-{6C)PiXtawh^_;5#Y zk?%dkPA&Ro-?%>JkNJBS(;JtUQX5y6U53R)^pS$uoz(zBUzMo*ETN~#n=Jk~DAl?c z(_l9HU?4A{=r6MZEsv|y^HTKs6kdV0mRoo9Xj1L5V@Y+#=M(FW96Pdl(?qM~arACN z3s;`w$qI<)*gQp!%db2#qxZwtXj4;kdM-M~9k+l&OAD{lE+k#;$LakhYP*Yn*DgJJ z#W-trsHA206dE5zgC)&;|1lcZKkskiWlMmv2F))w4p2zH_n3cus#qKE?x*LaWa?uN zi7M<(e>HDCZzk0`B-&J2_${T5D;yHQ6KH>~m<)CRj~9ByyKxUdd52|rJK5zQ*sAe` z9h?-bM-4k5Vo>M?DjdCvOy2jKkVlG3@n6h|z2X#cQKeC8e0z{SB6v8WOl6T}vgx$T zv_lU6PAdG1Qt*mg$rr@Gvn)Wd3%`S53uU%>$=tkJl~c7aZ|^u&-MnN0R0stYj~vY2 zwqYPb5#Sv9L|(BY%H2ncP+x)LSHtbwuZ5Rcvo;U!a_;jE8S>giJBwkj#g%OWjwzhb zzuRKZak5d%T2W}=+WF9o-<*iCBtZZnK+wTNGf|_Z0a*c=aU|)^;r;m?EHn#syea0v z2(zuPZ?bQaQNCTl&w25|m+hxLrC1WE0nnzcY80sPlA&W$&^QaaH4l`S`+j$F>#;@L{s|&$pUt*8pTHo!YJ$-Q$komwd40MKxBLrKSA6?Ho~?afP8bi!L4x{ z?cF`+1b?2$@Y*FNB^}NcmmoBx>QhH+_n4#-c5*T+%7^NCcAsU{gZj2&n^;n;K+R+G z*^zXaHIL8mWnr>f%lT1xO@KikPtHh5)28q_yb@klRhlkY$QF9_9xpbO3ZwLn-+BMQ zs;Dut)9iGV>iv7USUvp1AG zulWp2!(Ef6T@AT`AM{a|WCGIm_GA+CN+B($PI{{_xpS8HbcUi}$S~q^suXOhv(v zaniYNF!VA%lTW-8sy(H)487B3rTC@GR|PNYR6dVpDqm3)P}s))1e^dhG735@gWj-F3soNrS<&sG(=gHt3>Q8t9u zdK|IYoW%($*uwxS$bpI+>O1(_Pc}SZl&df^PNA#H+q9o*m|z5_WICsuXH0>DQ-Brp zb|=HdP6;On+BVE$gno>8vw%_A5Hgf8e5YE%8G^D6Ga2NM5pNbARo)#k0+8EBJBw2G`)3KA^P4dI3T>$Du^Od6*ijL z(9PF2RBzWzrqD0qw-k~76W!r62pdRr|Faw~xQ0INI00n(bmHp`w?HE^JZ)*2O7NxW zP9%)m=kNUa!CObVCXJPENMWmrMw$ZRNPO2ZInl)zmQ1d-EfE*kVv&zuL8@-zKKzIYfnV~;05_&>Ts+=t7$Ce zYr1vRPTupz#gg_35eDh}(!AL6&+#YfGy+kAP9s?<#9uq!WH3|1@t8WvXu6J_Gq8`sUTH0_OxBq^c!py!1Oi?h|Uwa$J5*IL?8-1Vy`@G=-DP}i< zlDAN(Tt7T7;I3~$F2#==yhX9%w5iiMZ)m@E)Q0PW#y4BC93cY#=&jsC?xq8c_<)k; zX}YaOo^c?A9UTpzs}bH=a2e=zKNk&+tnYBw_wi(PrMjGT-+lEXwCd09JnO9G!pG-* zAD`yCel_JH)>*teVkt-<@N#$MdaAXghY`ZU+&k1gCvVwjr|z9TbUu4@77&8B;<>0y<3s zEjald&avue*b3+gMXdT=&rdcC zWLrBI^{b-L>r8k#*C$_eLlpJGEkLf;YE|mWwKk z2uY0lvxbtM(euH;h`!V(#dJ6!wY45FQm2sf{#=5oIX0xMU3xH~n4{zRlL-Wd)-r-+ zYn#@3wkuEXxrhI1O)@`(jJX$ZAeu?d_xe3o5w#pr{OR{~3xYuD_&5Ame9qt5}Ze=^s6ZS2Q+>~~ds#MYQi&4h` z*6l`QQO(NxLbK7hA?ec!a7tci3tu|%Dp-Oi)e~aq@{3d zKeAk?=8bEktYs5rW8;#k00xa9;?#c8cM-HGW0{EV^vYL<_jYyJ)-l=r(1>_={aUEmthl012^A}|mh!MK-%mOQq;=iL#VyF3+tsF~SPsVju0%K${` z`FwZx&bFVf*S)ukTf?}Kp;2HHZc0m+F$p=b*X#j^;vj%10+R5l*WpiNKJD~6*ZZ## z9pu>m*DUSYXaBsEW6>GNLiYCN04Mby?@u^3gAiS5#Q!zvd46-OHE3>sNMJl4XkO0m!n0O%l zCrgb#2ICX=%i3=qLv84G!8U8expGZUW-8OfKkwkdsH5d?@Q(oaroO~T#&wB)CV<~( z^WZN)G66I~h*;-p{A3N@$t%TC1co0VVmm(#`8kAWf@LwcV@u{I;nvDZyU|ZFfoFA) zeffRhvA*PS4Y=)YYQapLUWQj2jsG%gZIY@88|?n2&Yd`l^a)`8admOiLzE-F}MP;*ZY< zC;t0w6}N%JckbSAlc*lU8|OMJz&vv~_2&_K{mw2I1$*{bUG&}8Z~$*Cn!^dJK~7F! zFDEI>|M4wVB3yR@ISW`r@r;rf011y)46<`fCTRSyD5LT=AnI~k`gzXixGZ!YekFm- z9{-iAPcQh{v!VOvl{LXyd__vvRf5j&BFAJfL7}+ca3qNVzqMGhj{Hn2`LjR=zIIR| zJA6BGh(K4pfL=)#*Z&zss9tqQ$ohK6>_j(o0|d&D+F_pTy~V@okN0VVI*{9BG=dO74`2X1F$TShvS#(r1$L!hZ-R&Sp z6?Im5r8sV(cAGv`82wce+Ja9D9U&Ec;XY#bg_f5{CfZr+?aZEhBS zXY2MMv{2Bop8VGGS(fC6gE)ULUk|pZyQOO)_Dl;sdKYA?7oV(khjz{gzYti{`YdeU zO}ILco!=G+;L445Ni`2{EOz@h10ow3wszir-^%o@Z9673huub6JgeoML+KfQEz2jPg*w16Z)Ios*neetQ*2#< z4G>Ad;BhmibOH*?%Hd=2xQY=1){hE;yRX^1n0}>FfaD*k^zQCP5D)3y&@E5Xy>%4w z&I!2C>K~d5{Qdm{%ocxEU|?!$3a22H>K|iKoRxuCzCh^Do_Lel?z%ryAgZ=U<_z(< zky+3U4K8DJ;U2q;G>gk0!eQ?qw|k~)>}uUs_yl>eL=!5Ulb9RLX3#&BfKq0q5HGa|mM_opT{iNi0tUYv zgZz#oVl00YnZVVgn0U7G%uF!y0I*m@oXU?{xz-3F-V6ngR^fD@VeWf7W|Ita%?W;^9d%Ms3mm?_V}rpgi}2nm<)$ z?DODrFnpEyC(t2&p+Ps6E-iV53ik7m;^Ip-Ht;X`dvNZNoFhe2U7I0xQbm*;ErB7t zNSQTpVdU`thE+*_)dsD=BS&D?%m<<(X0Odp&z!U1N<4ubE2eks$_-+9)HFFC-5DMGFy?+|JuhPom+3Kr(DfO&oqU{>Irb|# z13mU#5%Wsr^jlwm?2)&B4L~OM<68_jLOWe!7rx;QLq){T=CaQV&l~6obrW2;hVR-s;o~Q~S%UK0?ZRA&A1{RLIK`!kOQ(wi)IIn>3m7kEDcsc3rOj>g8l`bOZ<0HY0T__tfQEtO|V#-oV z{=j4nizh1|=o2*{yy1n>u!y+631Iz6w6v4;&-`6qW%nIvzRGtae*%d7LzD&U#{hbA zC)!+K7`--q)SmC$8bF}r=cW5SNVF-_52Yi4>ul@6&8=^ujN8gppFf_@rG1IzJMb^u_y8{I;G5Uv48e-a{Cxp z7Y680VU#B56LEQ+#Q;k{w7=HORxY=wYR1{G$&k^`Zs;h^X+HL}XQ=gBu2+wpQ6Neg zZ&nV*hC9Nu8RZFvc;Hw}Y1Bu->!4d*g`mD_Ozh>ni(; z9eVabwF~1gcYJ}^=yrCz#3iaI2g}8m_X~s} zLx3d;n3+VW4awZm?WK^~lA>}IC&M}2w9)v$^22GSz%yDtG&cDzSggf)vB+jlK!@Kf zuyLPF6#8G-fiZ(2L2)0LnK2Defb+#zM*~Q$KUO8d$r>N&SB9NAAsAFbrCQ|nE*hFF?goq zz11lnFkXW??@VjM2p$`RVV+ET1P{MU;(6s!0g~YuLOg&cZ~7f=BfOu#3f6er=PsoJ&}8DzPV z!|h81{yysq2ga9t6uG5T9LEb`Y(F{?%|62}4#J@*0fD&K)1kvl>i?9c=gxdJV7L2o zEC0ByI1>ytFlcVjJ)H}qd1IU?#)a~=Yb!1w_BLgNaZcz*+v~>Nbt7cNt%WWAF<9Au z4F*%q!{wQmZ3StC7Y`ln#^QS*dl51c%)K@?xNY&|v>n};E%EsF=x>|U{621HQ>_xO z;MBQu@bRs0Py9zxdDmuD0bTXY{F;fUl*2Opj~f1-dB(&0yx;lL0sl0_dwV&b%Csa% zH`brQ^q`nZUNC1kQr|QSkA#htMh9~H5(%uh6vo1+kEtm`uU~+!W?as1Cp<%Hi6aa^ zSGi97M@#+)DFJpsSM_da#0wfTw_~-a&$f&hfi@yjySK`G_Ke%?8q<9A;WM|*N7Ir# zR}?eokn@P4c@GvV*usffc$r;@h07E0QB<)gib6N??&)~i@3MvCkHTJXm+RJyyUzqk zyoDV*WWXEaldoc7qi7;Y6fwfow`}R}+YM)D&O9{s_ylm8Sw>m|jPVcy@Yi{ddfy9u z?9xsMYP5jODCb7Rg-Z3b(Wt-i%OGioYw|Z;5RhON-T}Xjw2Xef0m0 z|L;Vwm-F^dma3&=2=JG^ zbfg?UOi7F|yem0{Ert5KKH?}n_~zzD8NUrY#>JdX0+RQAFtDI9tt1eF-kePc^{}wf z?TB^r4^=s)BX4igt=GO`8d>};DP=zL=K7$;Oa_lW&{b62L#JJQHK@b7wrB9A%eADT z<&JBE`Y~zW(AC-3b`L&ryB0sP)c*XS9uPZ_-Jv9uN*8_Mf+3W+U{yZrQ7W$;RlgO| z4e?m#qwL>0+P@xh?7|r<&-0lxd-`)(A$0*PUWsA&comTYVQMcS+VI3+lv4A69zHXd z;+VZp4^?XJ42De~NUCBy|Ch}?lP%@&*Nk@=$nKxuGAcjpe&QMP`NkPhn^PvQ!|%+q zz(b^v8w*^9h&cB%!B(eiZkzv^7eNO}z)W>PQ?J6K($Z-P;d^oV1#6#y`^L}|V!hlk zP1$}R8uz6WkjNDi?5Ef_|M0JLE~dH-c^CMeXzkaXEYr+I6aSB8ud56h-}l#Fc)ynV zjnq(@SMKY(KqUT z(@kjsx~N~qq9yVFDbEq<6fD{sV_K{Z*YdF5ICBjg28T8;T?!73^GpP}+G)OZW=#F{ zMsS~Y@|`KlEj--r#ZKV+qE7E<%k|n2T89um#$`Ze&tk~sLy7Q~a`(q3>L5vIvx=?7z_-Z_T z{fmZJ-CQ&fQ^%I{0u<1p+Of1hyo~+lQh2C=aOPkByCMopE}YKi_uVY-_rD%yJVf#N z?d!q6X#SGz#l`FA3iwD5EBb@3hno*Y`uzU!z)&R1Q!KS&{h`I45&d1ZR*Zf)l5G4$F%&l0lcG(O9!w2p19B4`7kGv zak-Fg1*?5Gxq)l>FHM`+9~1knh1B}jm5+kPO^M@Tpo>}^O;=LBCnC-T#-t0+l&r+u zjnFi_`Lo3`%=}@6aM|AK(&<-i!{gyO@IR}r?|dBj%J15aJR$94oDKO>u3yXkr7QfoB5ToBut3cVT)=lgpr zY~cxePgYX0dZnnS(K>K04)%osU1G(~)8*>YNHi^~Da!)B}&Alj;@zPHQZzAAgwSp zKpsHk2jZ{0FD^@fWE4m1-S%+7=7XiB1ad!uqP$EQt>1rIyeaX0C$RiL!;$)a6Xgc- z-r*zb8f*0$oLUVARD)&zC-A(W=12)!)$-s;{mo0u%R6v>X$b%v@cS?(ixq+Y;x&0g z2B=M_-_qZxGwh83oZ=3(kYMkeKwfOz>`ZjUz{IrAFym z2=bbx0M}$YIA!dfGC6y9sg;?wm zi-FJce*l>r1V~xeM?TrXkm(j549y@#T(+k&0%1%2Lj3)O{x<^DCjH;i-x!r9=L3*i}YGV0t9RMmU7RirE2S{LC-OykNrnD>oxvDo#Kq=%2n z{`acZ!@oBC17zsT-_?GXE0=+@ z)}NkOEDt!PUk%e;iWkdwLpDk}+@*L4ezRGuwl~JiJUEFbgMzgs3+eUf3vU;0kSLnP zrH!wHtBbnkL6f-`{(kNZD2lf;!%!4iBoNdU`;~|8_K#x#_+Ml~IB`=C((npmU3I~7 z9c%Dkcv+ZLu&xR+d)u-Kb$`RY`}l|Bq+JK06AmH-05Yzpj<0u#Y?m4$E-0G|Svwg~ z$Nw27*Q|hIs%?EVRuJO7x()Gm-#NnkzA(_q^?x!rpzdETELfw_)`|-*z2`cfW8=_E zLZ+YXwr1vYA8gu6A8s0`8uvfF4dBOKE)66m$Z`K|GF2!v#{fI`7iZeYzB~ z(x>V{esYuOC@~?;(5aWScEz$3{174cY9N z|D3E&H+|-{1B;4)M7dbY0ze{weR>~&?59Z^4a`a|d!Rrj>Sx+#qtEqM<}S2D(CEgw z3SMJP`3`%7gO{k6P?~is8j(_^hNpYvy-d;LKy7@~J;o>TQRy?vR#AoTiJ?i+O7j=Y z>BRgsLtEt%1K03I(^R8OhSRj@gT5-tG-cFHFcE2FD=<>_EDh|a`*1q%_N-dMrbAezaDu|Muh=k{vRa9%T+5a(&nq0i?0C<$VXckh1=ZYX z#q>@Uaw?#Eu+4Wz=Qt z3dq)m+c6NL<(kZQ+*uJxrFmQh_>S}PqT>S42Ao<97Xtq28~B#^&mvWXE?$Dky%e7W z;Vr!l@C8`nGClR1y{Kqa_%l@yF=jYD2s-~zBAMB20GO3RJ;}g~Q&kmlWvW)3!qbxa zQdd3OL^F2sBc8CNBkZ8qH_rxdo`UCD{)CoI8KK*WEj_h64Le3tGyR{p>8x=WsOhdb zbE79arn2*Hp)mqnJ+oza@lWUTu24@$hD2C*Zb+0fO3ruza#u(L_GY*EFJizWDC zIhHjuNa=e-M459aZ-)SXp6d%`T%zZZ(V)%!a+apSa$Z(j`>zmuOwDqpl` zyy7Yjo|%2t(DbCa@mXD6)1XsMl`Ok1GqX;Xo$fj?t9;URP!KOR-TArw_r=pHHTK({ z$&JnY^^MOgB=q4~VhU!{t5$E2zINOQdXp~&_SYne7pKDhBKdg=BlLd;m{n{5vvST6 z0{(Krj4Lu>Dh25Dh<8p->+cw-@ojwq;gil0^$T4qh<4+-=E9U3JNSOtp#Rz0hmCuW5<5|Y`vVZSKka&eZrF3Q@fMUc;DW6T*6XL#mUbR_OA_d zL;K5}m4G}x7RMa(k42-;*YrHQ*xhZ6v>6c;xOD zKU8+Gv~)Ba5l|k*xkVTPrUmG#>;I{kuRJve|HlTNw~Mr<)P;n--hkq8NG}5bwVC@{ z@*7_F^P2YtE2%D&x))Aeu-}oJFCinE3EQ?c72nkUb|)R#`0ts)qZgA>=Jq$+2alag zGwuJBr3PKydor;iGBYptg)A%5zujsTpXTaPE~{hDI7M81f3d@g)2>!2WL$OtEy->T zvGIEnVjInpJg?Lv*P>@dJ6m<7gMXgvM24f&4JY?i8*%#n|9-%?#v?Ur)u71}!8;N| zfY`=~=<$j@-&S*Yi2UYGM#zfb)$dQP`2D|s1ln61dTq(C(LF0S>#^bY@?{?+3fQBy zPb&#tF?svS&Sh$(I&f3#b_ej#4PQWcYvn#4)z`}PtZ6x!%9y{P9oyC3LPU{9+V1Aj z3h(XSD!fn215J&#-31}d60To#YAb~Mcwt+Lb1w?lBeU4;E@v8GM!*w-dHr0pk#QW7 zQny%#q!8m|PM>-86yOOd7Y1mmPg)7|sHioQzCZ;X++ESbHJGe2>DOAVP_=H_NLVWD?=iSq?YN7)Scb!_u1`*#N+72M)Py=xE5EuvysSL)kLO@c#6 zy?^f&ub}(Q;&pWPK3hR{b{~Wl9;3>=Uk2w9iR-Fn;TE~w!*%Tpz|4(%YeSLmE#8k@ zxqEMvKhR%%W(DRmz1+~uBTRjj1rZS%R-|?j%5l2N5|w4Bw11G(Cp{&H9)t4;pD6Nn zBv-kDOr5R@ zWE&5F5Jcm3b{+^|A87W511FGST9@)9Em2xmkeR~j+RI@{VQ5EsZ$YioLgt7`Cjm+p4nZGY-AY8=YjlRDwY} zjb%^^KcUO(+M9~-PdB+cmITjh%Wv9bOYaQ#M(dFmqhWp$QLDK)I@<5Mp#4VX3+}f4^q$n_cbm>if_+YAK(=<=nPz@qjnP-d6DJ<+@{w!hKTzGXb}ZJRLc zE%?Oo37ZG?uiJ89$8LssN%xcbx8T~gl$eABKo|ayf2-67z0i;6Zo$o%j0F|A$9S@4 z;*OgS8Eb<1>4%rv!6FrWWIRk`kwhS2)hAJ&W8(^oaQ#2evjCu}k0VBF_g}5;0oaFk18B^qSVoG;gqpz4 z)$O+pzXYfNoJTGIi}n$KX#mjNjj_xi%R-H1^rLG(72LddKGit2&c6VkEYyp*TRay} z9gz#rSPRzN76{83WBY(U+cpbO!IOyL`u*$jBs2B`@I9>Z0)k-W-1iBzm^1j+CFZy0 z*gW;5c;l?6zX8#xyyle9I+N!$lP?$77D~%I@y6cZJl_|dO6B;#OaNgS={++j(vgWqC66xP zuquW?sGAv?SR&?GFgT=&A<$M67@7D59ADq7%APnQD2y3q$I0RDP6z8?=|( z19{c5I7$+WS)+XkimCcg0(01c#44F0U%+>ORyDh2Rvt8|3;Bw3Tse7%RIzz)z_jF? z861_%ibpm@T@mCSD^H2zn+ux`4y*dhWz>MemyN6C6?{bzH#PSd&Lu-B=|UMQ_-IEP zlfWK_=6Q@MQ?O>mHminQM(P4w7ECM^o12e0QgOcMXa+FAkUAGVqZU-rbB;T!DHra{ z>w#6F5t@nrUfDWZoL86CSMH zUXs%Z?H-CH{IW%jQl=<#i#xT`O8HSXE2nTZ=;##OR)s|d9H_Y0fCH5z24Yxatvy*= zx)!q5v$kg`XRd~l^)Rys+mq3A$#n9Y&o*!lai5ox8By0w9@ROS7P$M+ZKcKzFZY42)_@HOF#g@W{Z!v?R2Q)Ycsdr>}&!?8)nt5-4{+>dfJ!sCuZT65$EAX`RsmbCXIAnIk6j+t9y|}KVy%^6 z>*3kIY}E|9dBI@MZ^YV@=Sc-?{o-vs-{KyN{7U~KtlW2 zA})DSD2hW(9Qr($mY_VmF;gsOdvaxInJ$PlHntSx68p#H>W^b7KqVmv<$P3spk+_^9v++2zYRoUB(8jAfzlfqt?C zDuU?ApK3$8s?T4q@hi&;$-b6Iph+ZGlp~6P5;D%8x5x$RdHFO!y2>xmorIsgv=D?J zJ?0co<@Eyd^oRD)9Z4+!t~ek@9)K6v$t94t8Dp*0P?|J=(f z;T{e9u>(QhmA=IJUAFVzpFe&Zd@J?Fm;O9zl9|q%dh7TtI3^_c*#AciwbyY;_`b5mbDOJ-2@IiJ68p1whEkRu0f;SjCD&a-WIm}E9A7X)V3{;oT zoDjXU{3HGbKHFyJ9L7J!r{A%6eAKT5oYEG4kb}u{zoRmP;ZscTRvd2WsqvIyGT*6TCsT=+oL; zhVGO9CRKBOh=2M@EOI9h*cS^@A{!tKjY`y+Enub*+C z-%sD)=V$Ee)eQXs%#9&i=+n#rXE>$y$3ahiI%A^GJOUbWlXeKr&P)k5&CJe&xF@G# zeMPa)f-5P*t%WF}D)yh%*+O$prhjceJJU3qR1yE}Y)ETuX-RXWhZo<{8tWmpd5_&^ zx4O?AJmb!sePn>}2j@t|7%3k;K0Wp1Q!^!LG1AAZU6_gqF^@P7JQ9h_i%**w7IPZz zxIrcR(Rnf{VL98leh@v2za_zg6!#mvKMoE=`}}n`y|q3%N%SB$NGQH2unw)2W*aqx ze+AXxJCjf6xQ$1lUu;5PXl&H&-xrm@Hal2__Z#kB{Jv0>6le?$l4x_UkO3re!zoaG zO^F}lQbJ9@ILX^!OoYOeE-Ky48mucy5^iLKe(bwhT}Tn=*|RPeoK#^RDCm666NdBW58{Szu0Cbx+AJw|bVZl(>Q2I%acixAWnkN> z<3qzXbiKRgXm>P1u00T?hsDE5b0v2PW4N5@D)N9%v}= z=D89*I)WPwb3*fIPR{hlG0V%Ya8ZONnYqtD*!AC(&?z6*gH4wqNR<3Tn_UM2yqJ^% z@47gFlMI1!5E`BHoux}Yg5TPz;q}YjoS8ays|ezgU|I5|sC_Rr zG1hZea>3T)3pEK)fh6=G{wcFkn%ZXz{Y%qLHkFuoBxX4g-MvVU?8cKv?Z3-%rw~C* zur7%CuB?ul5Q_llZ$1osgn>^Vl>IFI|2dw1RbfSpwCiH4z*oYWR;uQ{K;@Wg%n*2*W7%*~Q=$5!^6RSv_` zRC{1;Nc)ZBgX6Y2Sg8eCjo#^W#P!@C`5+N?xo;ey<$dmfA^XVW-1#Sr;zX9CU;lOn zBRJC7nXN+wS!iK8YK9#T$iKL;p==)#{GdQ2Jbf~Hc1m=HaqAVj1)#cX_+`iLm_DE;UmQ6L4! z2a8h3wLsO*%Xe~cJQ*274Ldr-M3)uBL^?8^m=`P0imPklV&YA9R&LN$BzeNgX}Ck&eE6zz+#4lL4q5TrTy#OiwG}99!tW- z;zzp05fKt`0lq+s;nSPDK=yY>h_R0>^V3%G&EBgfz$>Cmd8l;8pKf=QNF4T?tJLl+ z+W-HjJBO0$>*`M)46J;oyc{4U9YN=Y0d1OU95F7A(EH2#!!3oQ^HFu>wWnnr&tjbG z8aQR_GOlCy!BgfmNt(3s&A;OoxhkPd!_H zZjHxqh?NViPeaqiG#HBGl@`q~hw}qlH})bt@I6ofD-AxYdC7}_ zD{M^s=k%c8$}7WN(qr?{w|EuaXQ%C+9O?>S`!7lqj}FY{Jz(5&r*}5uMVn3>r`*$) zHG3;)RKpQ#`^sH*zYCm}(06>dEoo=hD^c#=yYA3VFnaC!>{yopr!VwW*2Z3$V0{NL zzUT{C4LKIzIJnp8kDiP6FB$d_k-6K3eRvj_ta13WjaG+a47+oejq*bGXg`}^d{pVw z0FGPV0jHCI(-LN0k5A`SlsS*A(OcrFrAyC{_P_LQKE2Jm{*|B&m8Vg_ioJ&EPP(!^ zedj)i`X&gEc;nc`HkbAqvZje*TF9A6rVj5~nP;NBq6DSWu>0)%J~Qo<@<~fPkn{RLiZ!x(5`p&dmg#F z29^SjH0HQ$A&nBN?tzs!np_P$^+A;nc9W5LTSvTkMP72o;V(8@9gn9` zRwfLKLcxwDVJe?``oKY_leakwmi0C=vY;W*%hIu!x-yY3d`11^dG1}5kQAGsw7uVC zc8`$4@oS=|AtA9Ya=FE*0I`4T2Gd8BcJHI^#pMW1Qk0yH9}JK(7P<0^d#5E=7?*8x z60`5{ZYSj=$hQNQa51YYplFxobI*>x80FUGb{oz+hVsCO?<#gAoL_EByUVQ^n3Yfu zC@s5-FJP{8j*G#rY(A2{#|xP$in(Qa{7rVL@+;eoPUht8_@XEwvlayI+K?0v8aU4( z%Sx}g`fI3i^cB&rfeU!KTdRX^uu*k1S-<|)u*abKnOHBRLIFsT z32HWUnHs-;*LvmzKoYJ7(bwYJ&;ikA=uMqgW1JLabvn?N=L|@Mt6^w-e5`RPC!P^( zrxlnasgRJd0AmW9rU`fcY#I zg)qv3e6^%ol9J=Gy-n1hXSd)Xa5tzu^x~s}BIN@FHW-cup3p$Wh!|)P&2548eSi~L z6dxt_a5o;pEim6&Ew5Uk;zCJYe!Gf4F-N^K@7niUK%o75-xN^8DXTo6?2{49A^f*# z-lj6kf739h4`MFH-$M+N-wNY@f9Jo)uqaSNCoXwz1m|+b=AelY3)-^rldI_9nTpjK zAV1k^cc=e+t_kzq^Xmsh+V5~zKAv@?&R_llA5av(8)$cHcdK%%@QChn4Wbsa4nG}! zH68C211NVf0mo>bLC43))k}I$!;B(tC7-n)^8lQ%w8KU)C z;3IkAGREDhb&g%EbPP$%B6!{ZTlyRN6DrHp3=Vml1_uN_|0|&VZVnJ81AZj`-LD*D z07>%9kCYd7g&N@QqlHp=@}sr-OHPUJ}*1>@yhim)+(D*82LmRGs zQCzu8vr5UE4BUM*dzRF?xJpJe>OH>N*(cFDoy9zv^O5>zYS7bFjc`(7vyyjl}Ir}R&rQCk+YIN0V zKUtx+pA}{5@5RcM%IOQ1l~WgRF5^}j1YH8A^uvzN1*6YHg;b~D_x561qxy-Q2ALDb zxtvP|rH3-|t_`=PIx~Cbj?qa>(-0ae9TGXW=HZIVV}+C;!ybhU8S%U(WTto~-Ud8S z$9}hFPkGfH@Y)sAg@HPt5D>5`92FQ}QN3~)pnwBcKTA{o+izdVY} z1^ML1f`=}l(E+Yq%RD*^gHX9+JJ+45Uz&t5on~(|=#W+Gg7ne@m(BU2ju7;A|7HG` zvmh?aH2F6{q$$TaI;+&4ys{68zLw0FrOCo8kUrGo zrss!(&NHa7ri+oBqdZCJv=zc`#dAJAo(p~REyN0N9e||4UPP4-aH`)#^~Lof4DfV+ z$sI78TfEL6*%?XZsrTm`J7ZjlEj*R)lbhyhdx5ipdDTKGPlP@>`o5YpxdjzD6wUfC z1hL$tMgANm0oQR~X~wxFkofUjV8HS-PanR$f@>knKxwe6ks z5R*KZql*NxHr3TIzdny1M}t@v5NinrAJtaAE$UJh@)8iej6kZ-q?7aIfjPeWFOczT ztB5B;~uk*-BJkT_td;@>Roc_Dx^z5Zvk$kHPp^0>hPG{kL43X44-Wc zklyltjnMMi9{!gFN+7{J4GkTGQ`8J0YGYTjZlB~39D+z#gaa4?^=M!Q#|I=$h4EP38-A zwVIE(m8ds zIb?vJTAtIaM>7E*1^xXJB4)pY6S9!rch>qv_w7d02-DhTzU&XH&-?<6iQ6!SiE_tf zMFU=6$D5MX{7XXnG4FybxWFrPkNcE<0I=-+p5p7*@uG_ZfsKyHmEk@nYCRg79lkFP zxmq|^)8SU=KMK$CV7Lmic@|k)36)IoD`?h8wV5-f`)V<<0BbRattW-}kqu>;!q|f@ z^weTyxjFzI2!{n=I+%@)|4zyO3r{7^yk$E(e+91&8y<;6D7*fZ`T!f??{MncGp(v=9o~4xulo|tBfS&Sr~YL z%u`pI@G(u+e7xX^WZ&mbX!RJgKTrDA(8^M}Y-D?+!87X4+f`o0XsY+){bm!*iIgQq zqYO2(N$Kb72*|{eB&cdSgAqf^vc(DkLo2ps8{3(hT@uq)O-j2^KRTM1jIr4Ydn9&s zN)Yud^de&SCaued4A|i%yCHap`3E|z0CD{pLI);||M za+JEhAIFHE-Bqqm$GicY;x{qrl4jZX8RBPHPfxARxj_5OYJmNQy53q7FsV;xc$#zF z*K#+0m0t~h&~p4?<01F`iC7=%a=!f9K=k$B2*n>JjvK!G8CJB8;V}vTXIDks35HX! zSvA<>06_sEs-iHhiwc(6RA+Q2uHm>6c9f@!7Z@Q#y?iQriT zQh>j`ATf_|Ev0$j5cc6B$%>iVCDpi zh$snsQ@2(E_uvXarg7Lf;ushIagQIemoq33k%BqH$>1cyXX3od6TYPIY`ljr9aolk z64w8RgxLRQuqXT9Mj~6fcA6y~7y5regbYj@y0+plC7s9w5gfuky>}$98=^*E;+VPk zIUMU`&2R{I-lhN{N9|h|ZgiEmr^%xtF8Dnl-urtyqXXilB(V`59=#2%`4aw*(;!n> zo3;be`#@2lVMt_2cgW2;g7IYQwE0csLJINjI>h*STqFw{Z*7isfu5vv@~#(%if-I? z`?mvijPv2lJ{`~c+8>uS7tm)KyoYEwjm%?V(3`f;!Vrl)m!HJCez2-dZ-v%uqqCj~ zO!LOQh@;wlu8-f)8|)6Z(hg&?=nOe$@Rj4Ju>olOofbvOR8T=2&vE06QF!|a2(Hr( zMIYMR?4sMW!}bSGD2`a8vXe`5LRoNjR?Eb7u6PAHXrP>(4lZsb;s3GMhnzwG&Eq%DOG48E zxk_S2HBXA1C3U?c%dmMWHP}v_YiUGj80qE4zll9~iJha@=YrAU!VH};K! zSB$Wp%$NR7mafMkwfhtSn@hVuV=U1(2AxCjc!el3^23{lIttVq35GbZH3?^5;SWbY z_N8+M{G=1Gzy2C5z{c*_Ue^YrZdktu6Afvtxo%CD*Db+FvjoV|{Ki)V*peTzm_-5S zK29IHi6hZvX8FEf<) zBwznO(3K8zNKl0_9f^BS5yj=T5CQxx5PgMg;!Zv`0vQK5cVZQbJ^L82$r48+)q1rd zYUY5Wk!odxHv^F9!kST_B_z6_VEYzVbQ)ximQ;)FnK34I<=oaw^^V&+K&9;7Wod7b z%QMycJEjeQhRU%dyNOX4DR&E8o*z6@xov{%=Lm);2ercJCpm4q=e z@$`6@#o0OOi95djM5mY#1{5(U&e7H4E8LCoi$zqKS@%@EH>~&l^z#4#Hde_ph!^2= zbz+aG@l*OadTPICfJ%^#k} z0%I)Bb0Y5Ezk*dqUkzNP)IggpAu%zNg7UmAcA3K~=yX%WStZ|&Fj6?gt%Dbtr`S8N z&hqJBB-_ZFKLNr*L(<{mF;1+)FAEyvHgq^y)Jbr;9k1*<~Hjf$kPdoYW-F)%zOq`{C?3F4g zxukwLum3C^K*}%e{gYpxgf1k!Ie*8e_6y8n2}jNqk2v`HvT)M7hEU_SvN8b4bvWK^MTv<~NS(#`a^O$gC8+Cxh1dV(txn6*?8%{oYO7!m5vYI27z;!_^!o z7a?T!SSs?F6tgDIZb=SaCRjTP7@t%p_UIbs)V&~HcbSpP;9BAsa$wiui>8y&ejDbZ zl0Gn7t@(TGJ3k8kz1>dXcs7_80uWu78ULQuM;)yL3}cFW=lgCKP02%Gipek7N;h=~ zoft_|OkS51QoO>ZZ#Khs#@`j^y^ZyrPQE2XBKIDs6rqsf4r?RcoHK>y`zr4#M%7Xn z*+cMp-4Hc%B!1{0wofB{>(RsT#V7b8hgkU%BeLQn)CTG~K`Ko#c`NjNcTKvNYH#tY z0uB_R>bv1{Ty6`iu#yJ_L&if+X7$w#pifhU+O6sj*i=~G zhz=tF+zI(hMG;TM8S(k%op&&P>x>TQH9%CeOj0yZwi8;Z4XzkB(TPnD{TP$jPQCHF z)3c-yfe_u7T<0;*{AgL`*|5{o7c8A#10_i`hQ9m+;F-&tsJ%>o;{eETd9r$S6-!>hjD$8OaswdTJOwCra=AQi?AC89_J#QTt3a$rFsVs0M&I^x z37s^_)6*h(>S-sR&Zu^RiT2Y~u1C~KO)|!`T*2hULIk%F7xG6=kiMs?yS}cU!k>fL zNc}dd6{K|kXa40EUwrV*=jG?)_3ZDS`~}m+-}PR6HLZRv9{o|j$EO`X-6+#fuONQ$ z#fRL{bJe=A9OlJWTI$#0k$$?>7sD`&P!ON;w0^;nwNeBKvQ|Xc5Y+F*vzGMeC@dC> z#bU8UsFSTC!j7SKY5cNPL{ftYB?Tv(aKZ^EIq{79^_}c&OR8UsNB!wmUup8@Q31 zeDgK8EIC423$ica+CF~BruoG$_1=14y*~}uy7y^6HtCXTs2YEO9qem|n1^}9f86({ zQEvU2N8OjneXQGsi5Kx=ueYrw@khwgg6uNn<(EpbX@Z<@lvE4%P0zDXIXM5pjzT?B87tX#lzN2urAJm#1D;i_fEvcf6o@d3)=oBAfYpb$?|z|JOZn zQO*&!Us-40zN3U=67J_>mmuU%1oEb=DT4ebm3jq5GVEz!E@GWP`#22)?fmK53)rj0>0`il{5+~o{T zv*Wf96Z_7{sTajdJwiN{O*?9;BQ3rbEql0X#}B+`HgMlxzrsDax9}<-3>q?Q#7Cce zHkvPmtJR#&feA^yrF2BQ;B*vztiJ&fY5exVkAwCpopS#d-9B$(@ew5~o&4bFs)l|< zw1WNssTa)1fzDcF{}AatU0LWv@5O((vhaQUTsACKgSzG6psxM!#)IuJJCR&-6~~5< z0ud8OgU;Xw#s#bD$4de8O0>aUaSEXS{n)II`X@0`PCnPdmDgi`>3UnjhZ99^rM?4H z-E=6~lARU&Mi=Ls6k6XYsc|8`!EM-ctzsXiHZvqe^tc3fChx3z)W1Jr zm&Gy+=i+v&`?8K`KM=^G3oX5VWASR8O6{@OgI)X(8w2>ZV3aV?UV!2FJk>nXV`|g~ zF!!WqZpZt{TUf#}@y))NnPtv%UKzU}wSunZPs6Zi*O^WyUG~5|JJ@c_8?Cn%{+{xw z1;e6YL%szg8;d0+-W@A(v6|pIwk(S2aWZ{0Eg>$zF>T?J%sJ|%R)kM8FdyTknGjse zrQwNL90f!TE7%_R5`v-nG9-(?EY zg`;1gl-J|o-#->m@@2ypO7R470v>K^jNVt;`mR7zFN7V34{h@Bvdgra8BT9p|9flq zjQgvh@GS?u9dqB4v9h9qKE&uktqd_PBBH!$JLSIAW(t;cg3NzS+@6gU+_n2F!f8CRGR6lAs1D%Ym6|rcBCvtRAkDP;5&M8((okT(%6#tE3XzSg{)F;S^ ztKW6M1|x4}oZlQd`0KVyZF_#UMQPnoEW%e;DhH1&7(BnZYw%ZnZY>@3Wn!T!N!~;! z1H?rF?(s;GcB0&E-(V#>8BZ(xb4y*N3sK>xthD(w$Dy^1GH6Z`*LOh`#Mg=oYH5`& z#KBR`IjeKpNbGKD&n2p~a>t$QnJ<|y8{E1%<4b(EGR;YpiRYtzEA`SMIvDhWueq~_ zLCh7L=E{awQXl=ZZ9{xYMSynI=6Z;XiVtlIgi8ha?%HbQ&2~|aJ8Bj6UHHJ}N;HrQ zMjtvY-|FaBR@&@QEh;VZo3Q1ym#?ZW5*uJh@po6ZIG6Di{sS!)wSG1Sk0G7Ym$FjfyU@j@Z8J^^|s*49Znic21J?P~FvL-Ce*;F9~i^*s-}9 zJrf3seJ_hGG*@y;IuiH>;3b1B)HPw{l`g#r>wTIPZ3M!047<=K~L4*JCRqwTgk z^>`Y2y8bjPKYQ%*{mB5{k8@6ntUTr&$MGG6MHUC)h9%rvpjuj+_e1iQ0=$hooKQ75 z-eVXOIbvxDVdDw<-;V1c+LDNY;ig=?RiMwh`6TM7PX0%(5qI?Cmsk=Ds|+m7hRpSN zST>9$wGy3pFTiS=)5*bJe!InzNWj(wiCSKHv~i`#hRC_$d5!PNMce3Lv3Yu9ws8dp zFu{yy4xYr(#Y-%rL=Pn^fH>1vILuZR`=pylSa&*9sRNOpOEbr~xeQJaoG zM!{c*r7CsHk$srv@Q*e{(+qmJo!PwS@Wq-HjNpP^ua!;RX=E0Wl4dHHnv$}MBD#XIJ`bGo@zhIV+$ z_gHTv2IQmrhRcDn`>jF=gJJ%$r3ua@)~-RLFT72y_wM!Tq5+r0OtU>YfvxIU$82q1 z@8uNVt%D0C*iPv?hjIC3f+YW~w>Xe^Pc{*J&+x;NQhMn&*eNlJXDX z_R+RSklop(xU#3P8`sZ%VKB}LajkmnTUfbSz5{dB?_7W|`3#o5efvkMtgI`fEDeh$ zvD5mV%=)2spW6(J8I|--48Cl9jEb{HprpGybA6T9%nCmG?vIlaCLwRG$BEGFk}LDJ!b2L`=RZM$Sr_ zj62?ImgsLQqm)0jk(ulZS9N zUx($}4W$y9Y52579VPJMg@~`R)=nn@3Tci#t;L_NS9{FFL&o0WRbN!sobxPnVFGUu zA>k>fEK=0-ezE5_^2jWE*iBfvB`fAiqwx&eF6y1$^d=)Khi8A7NZ)&dJj5#ete*EH zXO3%X1yy-n@z{TGvh1y0{pE{n%_j*vBSrf9po67v=3R@D60-2oZD2MQ?SfOv7_)!! zl%Foc&XXdYT<^)MZq;mDD+W(~ym;3X!A6Ra6NE@gQwd?Xasz>FFcS>YsFgG~g41Z6 zOwtG;=6z0$Wj5K5GTk-A26k>$N4Kq*o``2US3~#~_H3k9V>M6p zvWN)mZUCHP<&`;{I5W$(*0{1ro|vc1Yi7X9Vt37R{ZK|bd#XPQ58fRt^?;M=Z7L-m z7KIzhDRgcci78w2vg@`hqX?rxKi{-xV&vM8oZHqiy`hqtl*b;ic%NTv0-a5G>5{tL z{4M$_DaY9~iT2C{lmE5|lj!9@eD@a-teC?!~Nj3In zw9=a`g&*P78o?^;;yoAe#c`rw!h6eJly%vm-YT}Hhl(ogM7r_nU$rwYb*a~Vf)X-~ zxv>W?_>oVm0?B+dQC-ADO*9QZiNq{vf;3(N+!I?JA@FbSn^ZWXFHppmvs8ZIwI18z zYOfm8fkWuc*XQ8C-tqbbbu0GKq(*vUt68-83I>*SYf-vxmKn+7OxQbnFTX7xRu`_5 za9UAbdDGL@ZHnA{B&wcXZm~g>$4hj>=xqL`V?MaFW{D#Jtx}N`N_L3&+g81uN~|(i zY2$J3X#PfUG-TsyeQ!?LWpFf$ITh_t4fvZvxuf}#<5~Wq;&3w{Wd}V0ik)A@7rNbr zpLJB6V#ylm{zhjKWhB<@Zqw!O)B}-^Zq7z&>E7vOJ+iXDWbRgA17{{vWNI#C%%oI( z2Y!=U4WnR+v(AB6ps|-xjwEiVGD5qp9EidORI5wR4#!(=Q{?P(UFL#{NKQAt2mlJn zcUXNvR46=`)3|TNZ1}PPj}A~Y>96FAZ$UW-3;EXF$^jBdXe) zCTvM;oy>*$dXy@HVU;M1J#YR3< zl4PJcs>4K;Bw6rBV?|}ofIE7M6oG&Js0O9nxQJU!^}TX+1!<66{z_HmyDb#XivGQNDnnVSXVHq-7WM3MHZ5Mkc ztA~3;Kh%MJU*XE!8Xf=d*T{FBM|A}$Y{4rmj&v_e_LzxmxY4}-*XB?OurC5(*PY@a zjivHISJocmc6U_kKj(|;dswVxK09Wj1A9I<)CE{|zw*W^oVw2R{jpiRsLumI(lt(x z72xhCF)ZR&*!iL4pQ%#O-w?4m7%hW20Yl9)onxW^Oyn7zsCuRxUv2KE*-wc+z`JqS zKo#qq1~jrb?EXlc3>$Z4>mEUV=}Y7G-V*rq(kmd-Rr@8)4s3Mhz)p~9GwBrY3xu+N zX~guN2K%t{YJ}U&JO@JF{~{&uvr8u`6Bd|KHjh>=J+(NkUaq#F^0R&vgFV%~LDvjL zJsho_%^U_z#v>%4m-Nw0w}~=TDFN*&vlIwLw`Mfx)y8^s6VYj-Oea~RK;RX;*7C|g z2-$?pI1}l^o~#Oi>6H65;DlsNMOc-V@}=h05XAFb(&qL1t&HLT=n=6qwT_mu1KYnk zbasl|Gg@5>izZ}3rdi6p2zu)5RDL%lZN?z*n1REA9*7Yj&@)z=8($%3?xHaU*P!e1 z=uMfGOG1`@%5;gqwrnO8fg!Jtn7)u}CUWU(B-W@Uamoami9p1-PRI4NaTzJN@@`!# zC8{A%X8bT}&h+KG0p5JADE6}Rn(Gc)CrT9JUnMQUtH7Bgsc`hp5^LC}8bc7zikEmv zM7g6iuDILsnR-uENa*QFK4YfNvzMe8h960?O5 zuCQ6Yw{uggn_EH!K1l19ou}!0uT1NBle1*%4PmB}e9T#U6L$!-8jaq8ZP=BNu$7m~ z;PTL~Lf{yY@kL%VDpf<5*H_GzSIXe>{z!2+I7Vc&yj~E7>}E^wD$5*Mj&B4lfny-w z=)a;M4@a9uA5#I6ch~hNJ$Xb_!(TXwheW-4N;NF|Y{{a2=66GKFtnIUcb{w#PK>9ZQ$7wEG$k+kyk0?9`{}y zUK*YJd_g*>VVd;?(TFVwAX0%y6Io3m>7uxRSH~DfSRO3NO_5gRkO;bCPMiNF@sZF= zq9IS$tzby#4PrRjI-SZIQzY-M>rZ;}h^U6YaH^4@iC4#HgJ`9dkij4j6i{S_7+PbN zGIR#x$UA-2d_V&cgLjP(7z~9$83cmD6fg)Lj@o#9#f~#jke5Or^C>xE82|G#j)Z;Y z)xImrG;$RK$C0z=8vS#meCz6nUv1ZCv*=sJ4`6+T8x5A@(ge}1* zk<_7!UI5K;-QC#!+;;Vmb)>QUE$=}se`U5Z&80n1O_)EEp*;AakZPXnG}{B zo#R?0z4)0sA=XefS<$=7CvUy=jKvsqt0q68i*}_%Isn~kn4-h}Rl$fidJyIRQ>o&A zEA2~uS%u%o@C#^V#CX(eDtw8WZ2fE!%K$#q!Q{gyQVXQu5udyzIZaSzCGzB}y=V!{ z88d~&QnRHcpH^@Wn^@>g`l=cg{kTl_%AdU{?Z>=93p6obk=3b^X+NA`MlEj>mp-ej zkVvAZL>3Pz*PV!5@1OH_^4D{lsG;U3rznks0m+Ju)sZ%Ed_+9&B|XS`IPbeINh?g zMUNuB2kkh5;DxGA?_h$dEuwV;%$gljGcM=c<&h*!@SmgQ334VQ?{`=!Tc6m;HYa)L zXjW=)h|~Q6STYN0uT7%;=mVYb&`s4?(j7u^sum#4;0*-uXn`9Q0E;X?+?@OU)p}#( z4o-$bu-G9H{4w;05;a_!ye_uBg=q!{zjC|UT1OZb^U^4Ke#ibUHI#Wed{SQAg4qF8 zTf#huE`7+crRHw$vOUcDrc4d~z8E#G6C5Dvn2*su*=A-$u)~Ux8?(?sYLwI0qod#= zyN?Z%RJ_Xr2MfD3y4ncHFX~_b88DWN132uCFs4$8Bh^Tq1ZPQ1$RaUSwZ7N-dIn%6 zx?yy!RzevvrFn(#C_b|mXrM$CKhGg9M5L&NXH#`+^{cwD!;(}7nP+TG)*UAQ1NJ|R zdJ_>ieg-NJ$kG6+ojVOF=D-=p`El9*M=kyy3-#M#D8Fx2b2don4ZIaF4zm4vWoZq=Rre!j0E0MCiii zeBhP(&5g8k*Mk#vaUpoRs7hN42yrxcl1ZtQO@z2#_^T{!sj9kxc7p>>HCaki=6kSq^=iz*TA;Kv* zZZSX@7p;a-VOkjM+}18Q&*yt0@okw3bil`QMg(Ji0?xg5fWsVPJ%dB%Q0!U77(`Iv zf~Zm`?&9D|tWM}klVn?ve4}fXd+?#bbwWcd_xn4=1><>j4+41e#d6l@h|RHmrRoJvzpIseMr`AS3!w z*f6LhVC|lBobvdlS|6zZAwX8_N4p?-^VMiQw%n43(lH*Q(0-NS#-44goeg+^+C=*19%TfQk z=1)PW&?t4ow7SLg&N>A}LQ^6fSqR!w9)Mt2Bp}!WMk4h57JQo_@>S8Hp`J-q1+MBc zxp@u;o7SDx%#k+nQPzwr`e412O~(wK6HqsA%cA!&*drEE<(f<6osvxph?*`(ae{-C zP}9(U_YkIkmcP4o1Mb#0&(l^Vtnj?r%0%C%a;Ww_SI4J=vI01@E{feD8}oFWLx{TM zGS@hPb;waSyAPs@D_{cVDr+6K_2&~5K~zXpWdtaPJ%zlREJuw3w{ev`rhojEvE9VmNyblz`13N~ijiN+X(|O(fk{l=dYVLm5(Q=N zawIqxQ$oBBsk{#(*#c+Ez=kHF-E&g!`fiAPuyvM+_RbjFjk2xu3pv?cWSQWk%fTd_ zxjyw#ZxPj;E2J-|P~DRr?BEzbl~bB_-q>#XBQL?|5FKfJg4|{r*Mtyi;R2P*Hu zXCWh0Ap2rL&0`>Jp`I+H84dFAUAjejMXx0GZ`wLfh$1%QU_)$q+}^}5hO447PbeXT zl-gcgFd6Vd>G4`zN`|SRm#emh@URIKcC!3Q1JmoJTQ(d{l1-XP?E?1RW$<$)c{cgE z!_3~#9roP6xt?p8EcNPajtdrfMR?t7qw81i7yr0%Bf=p9h(7$M*?7TEh;bSTo^Qim z;+Up96)E1b^FTl*pcI@|Fk*ksCuNVQqdJ2Fg6Y~3ps^P9H z>WO`}CD%0S?xi5C*fnKa#N1U{cngGU0wvwz;Y64|%dJ8I_$=mhD~KZWxa0AR$Qz9S z#H>qUz+iM;cDKD|+rmK%R-`lF!3=54Ll{J&IJJC5FgNG%W6eS*8FEl-i^WaIBW)V$ zz~izi>U#Ec%6E7K1k6R|Z`Yi5IA*5gTCF+INrDvA+5#;1B*JS^pO)-PB;VxtCAm^T z#$enZD0M>soL)CWP@~~?RI){>w`3Ry?z22o)eajBHr=r-V>$`0Z^a&0A%syA+~r+D zskc0!QPa>2NxAQ5Rpo}UlTBs3Puo&d8qVZwhmvAoLIdOMi3l9Wj>O(mlj)j%;tNQs zYY0i6SbdI09ry;>Gh2@H;24Syx~4dwF;8i~;3Suf#G+;pw3IxWYDD;eh(_OY-pJl$ zF`)LQ0lnC#mXfwD-_VF23hSDm761Z_lbG^ilxcPtA!hgxk?_(0GGC_fg!+}sWL44aEmdW<7n2o`$k%N?mG98SdwSXS4JZ+B*%_v(Q0RYSk0l>uh(3V= z2`q@9t}4_(OPKRfFuile5YZOo5RB(jq)3j{6=R{6R8>V+BjrZ)Ue(N}eu!(@YBd(iL zAmjQl4F=HkAJQ6bTd+;MPjMYhK~QfQnOO`c-hjh(#@x`yf53-&P8#D*pnPljAmsU- z@5-`R>&8Zj;c&~_ii87i!Ip^Qz9UBkdTFF8gt@fUz8>jl?FReq2mmpgY#_re~`{UpQoWK)BcW`u?ff&Zh2#nxJY23zZ{3bXBr|^}@m^bE+1*sh|EeH{E zmPI4wx*b3eWikw=tQc2Gl(Xm{a?W_tq0*KAd|EO_gc~DL;Cb@1P+CL)ffNx&S0Eth zdo$_4=Qly-2&CY_eN=Upm13_D^=zuB3c~yanC~|1!) zP|_eY+o|nb^7nhf$W;*eoay}5YUrYp=4!{JgcxAIXk1UiRG^>?C>A*o*($n#-j9%j zDw#NYF9?t}S+&oakbSD=8Xw{2rhbk5v_HApmw#U=bJ9F#k?t8|)M!KF6dmIeaz#5f z9+8uJES|_7kLgGp&8xhiA}+biQQnvR7^J;?JGT5NkK)3|Io8y_w#OLt>`_C^*#&z} z2*F*D6KNP*#uCfXJj5cdA#Ok4d;za$FEe;;gqTFr3NEV}hdt{0>&i@<8AiRaakHZ1Blel}3!ra=EhiSu}TW`GL z=0AY+|Nb?zZgb}u$tS0;ZaDvO-d8R0dorVkCo$}IIvsc0?cCsOg8K(v;y4`nnN ztTlGxFmQLG+D+r<&0#H$v4@hx2Y9y0Qel}8x@3sxrg}itw->>$iI&L2t*WerL7L)KVYR!Y$$eLwHHiZ27v5W+s{bx#6zFo0cw{JR5Ehx-lX zi@qFCV`Y%{hY|%XYE-Mm@rz`eD@~i_`(bB^=dI_0^Gz>{Axo@sEZ?(=b^Bq58y5++@J_@Ghxl6ZH$4kZHzebsIi_3ygGw|D`ky%$nH_o%Tx zY#5c>0Oeu_<~hr}9PMTwbPYb2sn1Wi{g~zbA{Cdgg-+%J##`A?M`2do(rx4Sc(01; zTn>ltCRt)j>*z;8p(4d9shLVtsxpk10c5i ze%Du1Q_mB@#8zv9W(tg{LGKJWra=tqc>@Zq^6DPf%jJhF*Ktza=5wg&hN6DHER-te z`;t_NGXiq9Y8g+aXmqg8&)quXRer$0a2{lXUFF(I)$TN|%wL{$x*W~&1CF;%W4qrq zq2DEO=58OtLSdKbP{;XY9>n=CjJ97a){a6~&T za5r~ix9;^OTUu+Kuk5j?Fz-9VWiGT;b-{{nmszsbd!uG?VG_}JYmOTC12Lc9d{o9I zi@4r?lb~Lbh z^bNTiOWr)zsqOlpj>0Bjv}A`9y*h3Dfa`FSmU`pWpwxo{`=H2NKk>9^Cr|K97g#AP z&fZ>yLW53cBMk5IY;S~59+r)l{sUykuQ!|p2b0WVxj*oHL+ z(|m`lvgy6)AB)b=k_ZPRyf1SnF{lJ7`%BZ==Qw2D3iY*N?*CEX0Gy*I z>F0qL$E0+35=%5GGJ0mFLReFI2*)Po8kfPPWfynn&JIQn2>$;6gqP;|Uf_jOFomt( z1}m_FkHZ-}J{%8R;G#?J>1D8t%d~tt009QHJM0F*_&r#{B`r?}Gq3c^APrkkffiP< z^SfXPmhe$Hh5O5i0%Gk3(v>&@WVTTwEU}`ay~5-Fjn^JA2J|^_z%S)i(rIVR|zTaeKGT7G#&n0n+~SP zg7-JN_B<>LlhRxV`P5cXm~Qv&UW<0f&xl5jo&XI=62v+0P4}DXBm3jh%LyLjbXf ziwTA=H(4kO<^_P@3#Q}SIztaJq=i=INvfLg5C_t4)Kx)=a6f_l3`+X+Sik_{;N49W zk^c;{ROsBa}+JMf-FnA++Hr{QY!ChE96=z14M?PQca)GnWBAy9*E8G~-z z=eIoHo!-F7b_>vu25Q-#rGOvGdB7gBKgqVaw;-NbbS4Fd1~_48-&zcjEZMkjq=FX+ zr$?>?rXbd~kw`!VqM8M{19%|GlQdTUes-=DXk-(Em!K=gOQNf>B0ZRSqBptr)m3>} zq)BXBrQhs^6*McLt_|6sTbLl4sYs+UqmAX+Jfdk`3xtvc&5OMEcfL~}e20Dv0hIdZ zrb-iE0$UQBRYlykPRd;A1h%#%=rFk6nBs1D^x$*BiT8w%+J%CNlXri-^i@V0+M}5j z6)BsTv$p4R%;~qAU3%xxZ%?0@Ez0qrvO;P1+5zQ*oD`9X4X#*9kdM$4r-}yN-#V#T zY*$*7nHtS)IEL)M*nCt_CvZ5ao29okE!V18YsHt6a%5DrmtVFe;s=_>BR7)3VJMfz z#Z)D%=P4`nT*(1p>NHwucAeQ~3ZmR;8qc&~bmQ|t8%ckakIzN)4`RF-%Tj-f{zc#~ zUlcGS5AIR=56HuV^74VR-sRAweRE)7T)UaRDd&-J6W-wYld93NLHW`!dtCcx&F}zs z4_qrzAvEE5S2zA?!@C>J_`!e@^qqU4R{*o{jQu5R6ZXRUvs|WpRX{X01n5s4IVv%W zTzzAR*X=sCVzX^_h){$h776+-cmKI`6}RTxG_to}`q9*FiRnwf%B{Z&O!}`}@|n}%mzU?`vwZpV zavC=UtYr!E#Y`qM9i4r2R4T{UM*T_Gz1?=9E&bxq7tw=4Yffa@_)p+ic{u0#SR6hj zLx0SdrMKgxe~V3<2~_7aI=Eebw|hXN(xjr zFr?^|BX4T#Fahp=T|D_;>95uIdPmFuy8ZY1@1qxwehU0yvGwEwp7g?W;oct;^H++k zlg8&A>yPNK6xFnv*%JhUpE*L%UWYWf@lFxa+s4~ClH6L| zm+Ir7oI`|@0>QCS@e2_AO1m(Z@8@BPapAnUFd1d5JyKupTo^@o)D(eTLv_eTD$zjK z88ur9;V|rBU2_Eap-ZX>7HzrnOdEic=M*B^bR!XQ^p4NeJh-fMZRy$%Lj@NGUyyW> zF6ix8b!yZJVx~} zfJLHdK)1#V{?7^Ut0jLpl*R6dZ{%TFb0gdkutAzd$IehcA75Zz@on-Yg-8YvSfP-@86m?CS3LSwy$9@Rr0xZd2x5HEk(jfGti5KD zjk3_m=5{|$R@1~L^R?^L`dn7+wOl9bRvfNO>fV+n^s9z26D5t^5+;>H+6x1TF}@hG zC7R3(BXSr#Zyq!6@B$_ypsOMPfOh~iAN=N8^=fc>e8sj3NY@S~se?|gjL`O2^7e{9 zkgKbeqsc5hNsCpOP9E1eW~VGJ!g#hq50D!RQcvO`89MT7akT+tO#)jR{W&o}&%%V# zf_c8pFwFZRT<<~ro|0Wm$M4>wSPubN;XY;vX{knPa+TchTymEl?JB!5M4oCy(r3qOY$dK5vs} z?aF62pfdckcQVaV)1nL~vn;)~UY(whv*R|3qh%Y%(RykOdXH@U4j!Q!HaPa|)r8Ms z?0j(86GtoOHxAEiyF~cnHJ81)oqYYdXP=5vxGk&kjn(l|fe_-A^Rgz1i|N%3*5`5Z zlva88oCOhF!6I;-4&f;T3HiZ^W0baGVe?X9b4F1RR`1Pb)2=UF?bXS*e6M;v;7J~I zom@wP%%s#-Cl|`gwlcZ`R-_fAOl2usr9-XU8-h>@;R8q`omgzJ277SIt=wbYGvJJL z2CkSivZjZue@v4Yf{Et`A&F$8TE8%-GLmL)Zr!WOOxzyLgC+)fvy+(}Lw)`i4qauw z?gd5_3c!5Sn;YnqVbc7W`A6;VC1#zzz0H77qiQ!hy6B&Q{Kn!wm_<(G<&j*NA)BE= zhFa{XAMCpFsEz{na0G$O^l5{Kb?D;Vk<8A;H9BgfL*0r$fbBTU)Mjo4YNQ%#bHjQP zXX1(_6*-e&n1<%dd;e+7_EIT{oHouR5IWlKxiP_kON<|Q@BDewzh&L7t!Mr~;*Y3% z73!DG>A_649hG(UoEJG^p8Lm1G?8RBS%@B%f|p}mN(N^BMQZuqwb)d(JA$TnLz3Gw zHx5ajCQ;#g99tiiIZbjHQR6sm2MuX#Q98JB=b_ri^)~}Sc?);;C1!m{Y^h~zSpahq z-;r>M7GHL*?qsJ?r!Jb;R#2JBTpAE`fJ(bDoQ!x)gIyERs@+oDI+B(W08<@==07o5 zX)(B0qP+#H@T7xg>6E7=N%?m&B5{QEka!rblV2a{2%t7L{aoO)A!$9-)RDRu__Y?C z2@cqKL+FHOW|3>O@~A^V9rwB|O(ng$CyBMWWfQj3+S&3nYn%BN@B*emHK`{=Q0GuC z>$xO->jaaL7-YB^8s-iknN@CXbet&5Q%4x2(U8sz>sEVXd)a$VyBS!b)L(fHo9Pcf z70*7W+s?g1M~u{8e5yE+yt(0g{rLw@8|O3MP;Yd@pq`^=rY$Xf=4A2nT!$s)K4H+5 z*@H9E|8TK+A42l&N4M?mx8y2KCFLrwOjbNKTkh1UQR$YFzaI&Hlot)!RFhHXlXerS z3{hBNRB7P3XZB;bA=t&ki?ZSk0fGy)Z3V7l(dvy&;Nt|Q_Qj08B0*<12#{$*LJ2=1 z_rJCZ{EgxN#G@G08Rp|wA|nu3+GC!;btYc1>3k0D%-yyX5McqbNtQa*zg&2-%kyuz zReN}}2AILcJ8v3+@v9`+8xM~=^*}6bLof#R7Qco58?p2ogC_I29T03u%f?;h3e57{ z7zov1mvSn5-?#>{m;Sl|+&z2os+n+)`#j)b0uq=g2}*FPr$%a~R%)j_6{(ZT)Xlxz z&x1US(*k}JQ-ugqekItr#Zo?Paxkoreq_nk-t^p7P%4>-oF6TG@f zx!x{DcjK_|0}t!ytMGSVIa%)}Ynz1907CPtA-C+9j6N>lW13ZmU$ghN<3e1Ll9uW; zpu0E%NAL(Akq6)?9+jgy2E#ZiqnZX;yyvTXQZAFn5k*?_;|_#CT@{1RmLLslf8lBD zEI&HajScG6qXwWwdYTBtrqxJh5uNQ9+Twt=vAu`&z;A71dw>2F{kZnJ$G2lWR(sSlEqThOg)2+g z{+=M!eM$-y{&WYU&~|R7JJ5R(pvTIpo&lizUo1dxq9-+(s+gFY7ZbpO6O_SQ8meuR3i!V$>C zx_;!*t0fz~BzP2;h`OFXD)Qo!qsB{Rt3Et)wFa{#NCcgn?9rc`cBPHvSFjflEp=JI zr?1)vu75rJimyd4gZ}r$>EOA_03NTkAIfWu$=6;r5@BVv+sy!lE<~}5Fh>UXRR>Kf z#KwkcA|$4UedD6=N=W;TediyD2g94cy@Y9n9&!(mWlEVZpR;7fA(MOiiiw5Iu)FT6&zwJk@Rw z>ogWy_6s~ZHe+mh6DfY)m9RS`aXm%ttV6>&biqP7#0%QJ*K|>)QbrvdMATi+u~Hic zxO~ZkJWxY7BfFF_>7@WcE;WJ?uftG(j=u!PV-qyiz`+K6Og@Mrbog#?TZPZN&?*v0os@4!0pga!qeEG~a20HFCE`2r35Vb|hR?eol?z(A4F*Dj zLR8U8Ig~66m9&VFaG=|;D_Y^gEeLVjz+R$*fQmYG2)P=+ zv#mS>U>LL{2ZwI?!c*X$Uy@AN!bS9Apet@g-08>Rkt|~&LZL!iWf0;7se-R0K!}Jr zP)KR?77tZ7xEPqaDc??ym;uAQ%~_-Y)`Ox1rAmKoN`;FM2NG`XMS=_=07A)0?g|Ym zKm$w8W&J&EEc#Dmh;lu#>p|yW%9pt$nR~~PMM{EyM*3&?2mPyLj|z&$m`3JGExi2e ze+in5PE=|By}2R6n$={GoZ?>ER*+ z6Z@3efV4#=e-}X7oq;yywY;?|-gG8`eT%Dozh^@8q@4rcUJ;WvFg=0Y;fF9g1dSf& z1y{>HFMd~ELo>1D-K1qjPVj{q06aG`Qqbf|Ed zg&5zYcnI5UWMSw97W9>0u(ivKJC{^TEMkKJXekvmiw^aU>>GWMs5-kKw zaCKNG>P)AoyMN*(Gu=Q=p_VZxed3rY|e%KT@C1&Xvk=duIp3%J))f2q~F zi4-1k;((LNlf}W#_}Uq`NFE%Nh)cOXOz=+-MZO)P8)K4MC}MNr44tL)=#!WfGMRK@ zi^;$eJz+m5me##(YA@}z=3<`jPSOJ)j_OMlYy->TsGgW%!*$@q4=LE&!N|<{;Zr@& z`yN6-PZ97{3QescWIAs<$Nx2ACvkKZW^q<#6%-%=Xo$CU&vSgC^SYoM0FN|!1?-Ic z1sDL)ux2f|o1hwu;Y67r+(3hypoAUhAiV{rA&pM1QzurgUkN)dXzr6G+P$G5aDZCV z@*A-NZVl2sECTa8-R6Dx1rrpkDA(S2t2?^XqhGzA=xMCSMr_7bY-Z^)9CEG>uP(C{WGQ3pCyNu4WWQeOCclN z0$j3O18g>NVjU5#tUh24e^mtLm)JbL(IJooy8*W^z!TBCn;J;2!_^U94GD4u|2)L> zmt)|o3L*jh9s2r35p3n6yU?z05^YWKIn$jhfFVHG#C z!Sz?d8;!_mc#K95%1S2P!1Q1e(|}0RV0(_G$CN}TZRD}UV9w7mZK|ZUNO_a!LyD~t z*Ki|ad5vjVXe!+v|4*|6-CcG`s&0BS5Ld=g0l$JO!4?7ZGY3~ul9&=dr~EEQRT_HF z`MN381r9yY9nJc|TuZQfc3( zG^yt6Mwj+A#1fo}%)#e`ap9gOVQ=%snC3A4LX(tQi0AaDr7C9Aa{lzbHfWHgO8P|& zH||2q{MCBO;dOJW|NJj2MAvj=mV7tse&aMTEA>B1aQ1u@*@^@2CZ#c|*2`Fhw4$;W zL|6V?aH=PJ*J^KV?3y_0Y9;~=YV8Ei-+aS^!y{f!koUqs2jx1{Pz2%{@bj1)3%BdP zu(57sEbw2s_Mj6=?a19PFVVP{Hmw7tHh_a?eP27coS1{8psZNDAS{Ea8QewZDyFMN z6!PH-(H3X348DSnWg40Qi)t(mFS`qz@9tOlRYKX$3#{BkH=uBfGW!`YC)&C=hova* zw+5VEb-xKhLxPleOOv%i>~Il|Xm)KLud|eb$d)I9rL0U~JL{}7dUP`200DwBA(bsX z`@1nswsgu^Z(UWGQW$Q(_>IeNVkIb`QxA$xE<~5rYW$l&cthE#OC71hxVr6#WPT!y z8XZhUE!0o3KmWWd#ee%vZrXE(d}>UIe{zeU4;}K(w4BdcPZ!|#)CAktJ#dTrDT`?y zgQs%SL(kTXa^@icQ?kT#=VOG_Oc4){;SaFNW7QDlH6Y4kY^R5qf6k#d3R0v zG|>B*@P^b*m6B1-R+H6Mf~*iY^Xw2x69%Cy^ECx4okF%4IMUgFG#e*f z9(~fcaItmQPsUH00B?wVnI#H2v6)c@>!;<7tQE`rF)~IeRA{p2?}_l7L)0QwIcj!x z^*|OJ6%HelrBPXpk6wkN+*WIC9)_nJic6<}$4Ek}1&+i(_);TDBYcD~V+=$R;p+@^ zlL+fL;IP!&%?31dvHKY_1?1DHQW;IupGz(6B`4QXfwmZ`$kW(2X?ADRlQw&Z7z)?) zTP|G#?XvDjr3uxGvhQ@JnXMyRE#wc41q#_X8bP#DxoH-r#aMfr)S_f1I1tgoW91Wa zRsm&7OQPRzIpPutSQ2EKrL;J=7HIXvp?q~Q!Cs&)z(eZ;HM&0L$eMV+L?FMU!3ah+ras<&6ug zH9I?lVV{r4KU^9dWQr;YSsFD4YWdB{KTegGtvR%KY_ULlv@rPOYWd>eRA;tutmvRE zz537nw=28~6JhpKln~d&a+kz`pQ&JPc6Cr7I&&PsvZBRA$eftuaQk58+p`VwPSj$* z^tvr_(KN9Cu%emUeoMXqkpf|&<;a$cWUXUbsN^9Dm)>^;O(`W7B9Kfz7i1Es1xk@d zWGnu%k%+isi7?04-IarpI~e-1U;GSN46?nh88YNIf4PD;!)ncGKiTxz=aB*IQaMj4 z(&WpL#{E$>LDp)gK!F%Ngu$Gf6)Oh;f>^p3Zuy~p%qBE73x8jcuk*2tGDQl&SapXH z;kZ`Qsod_E8?1OB1ry-mj|!s3@LMr2oYoG}k`2=WJ_g>7{bmBeb>(9SLTV{*lksHx zX?3k0&!71S!q9*LD6 ze6P#lSe5tPFvtI`C=GX{^yBzV_fKjaMle(vrq3PA#R>|*8yxTeD!_yzCZ3nPE+>|@ zGR~hik4*j4adeH0ulA^ujcwyDQaTahiHJw@Mr#9 zQSm&Nx_u}GM&I%AhzveMmwaED&4-Nw@RwVl@sRk;2dTG_vv$qn6K8p9JsvUmWV7OG zIJ--Q?szO1kfk$+H4PPrg$sD89^#anW~!d5$=>dg#!e;PdNyP6=Rqk{|$y@ z@l6b(g{;;Nj&FX(F!6*(zO7*p$sMQ`H7P;zgXCCVheHMuVYfV zH)5lPPd^xXt|dXCFsgK~*C8e$#in7aVkgyO2_MMQ@|F66BGMl6b7xA~L4!=Y;8>D9 z()L*zJKg8LH=0LHc8sn{X6?h7QUZ2k%j76-kk3WmVS{j}p|hR(4Y|Qu?u3%vvM_@A zEK#FD)R2Bd0?RFS+~9WG%Z(HRF7gM=rZ3ThC`YFS;0QuFan>?`7!ke)G)l(pr+mxV z&>or}%{T&oxp}*bhqm!qoOht((>ff`Rw~r7M98&9V9N|uqwTOm@DjUo8zGno!4>#T z9T9l!e-Lmv5UQ@mL`|b^Q+o&ZszcB>7htP$&IH6@rt5h@dUE+BFgNXi1KXb{{9@mC z5Ne6FePvW!QL;5oPVHq2)M5XL~U6z`it639Q zO~Eo=wQ=d1n$_g26U~;_ONBBxR1){YxOj;fHQlR`0$(_ur1DXZ%=cmzcGEW`<>t3H z9(`M3GmK}h_$Yh5EpU;kGd(kCEho!InnZXMgPL?I$4&bL}Hl2eT+z344h-1q!9MN7NLt=$)*G2f9C@W!_YLpjCoUcAo=zORJ7Hz>LX z|FncneAQ9GM%HTK{4Um8&6`zvlHqfFlJSeG_zuJ}t8mO(;8U6PNp1x@G!rR}9T90c z97pfyidCX#8_%~xi!*9sj1TB&=#o4nr9*48YO}A%6Rxk&Pj>q2+!Gc0aB;pj(h~0% z#AZx)*Ii2Lf2ld^rk!B=*m?8h?z2#djHIi5PPL|-K|(W@iTBm41)_%Kx)HoU>&q!C zbM9&H^bhmj&2MuXFH2MN8a0~cU+J~rDR2if1lTmzt8Qtm(O&jlfzUF}Kf{OcIOw2m zu5veomcE?9C*RJdSI0^S(o7mPD3ge#(mMY}tC(}qwK~rYY6_K#sGIrH&SM+lsu1j_ zxjJ#T+z#a6DyA=tOg+@g%l^c%j{mJrI{71Ygfc}u`Ox6uxbxzQH|K_j!=eNrw@QSd z>$J?!$~&*|HmlM8yyq}C5?;a*M(%BlReIz5z9<wT^rT38#e!e_UUSk-AL~zkg zpIjoKGw4JW@5H5C`i@;@l=$>HoORtq4LzTd&{?HSz7=s{fQlDecSdRi)zkr+AQGhl zr(x=q4iBggR7-`-9PZf{r@>ZS3q?wU4ZeK1AtOx9?v3Mp<#1!) zH`<@j8Zh&jiea)tiF`Wv!+*09uma$d>i zhAw^_(=m)`?;^V@k(9j?nFLZN_DV*VD67v9REpdbooO%XZc?T1KKnX6M+?4-f!QhJ zLYm2zyO%)b3~a2+*(sBtx@0_mTVW;xCI;K&xH6fCKS%xUj z+VZF>msWdyXaIB0VOA!u$`)1A3z-v=_Dq6$*aYL`X1*^-JAF^uSal?Ah(I94NR>p3 z-GzGPbcBLBftS1HHps}iOhjv`724KYbO}V8GssWBGE!$<8F(;j!^=H|c*XsWbeGw* zR>@A~F7FmnrYPH@)a`Sr6vFyRm|q6334@TYJIW@`RH+^O8+U(@X!{d;N-IUi{e&Ko% zXp!4&Wg}j!@g&w%9|J)yQX@99)X^mx9`orlsQv)zMbWZmw5XgfxtY{= zZj3rJL4jz6o6>$4r^L4~xH*s^|r;$IUA8ZmUYs48g}9kRr5Mq?e@R_A2sKW;nn66n z<6b7i^6Gj>L(6eO($j`My8&fPf&Q=C?<)1<%d2XnWx-Zc|j6pHpL4R_#A2# ziivD>M_ISChOX`|7=KhZC-HEYua=lPo?eu2KlUd{*=ekz!xm7BEi+L0jq#rkcPx$+ z!gpKazG6Te9fY1-|B8Wqwv*@HHrOL&HhO~MWfWQ$kin`#AryN$adJ~xOcjNnKvH=%fa(&zbH?di*S4x=lqDZBE!Sr7!> zk@Qku0O}6Z9t4A%U$+`CgLcXkl7{gFFF5v+{0lEm{c!`c17u7&pS8z|l{6ld3vwUE z-i%hrD3h(FPk^#UbRrbY8s?wl>ii`sE|lRSN6Gb+xk+d&yaTLng?JO5qr()OE#8HGv(U8_zqN*0t1mM4S$SWD zN1|ao0_Z^QD|gwQ6HWkpt=FkF)>HUuxsBjxLSAc{j)m0i{dO|T$OXOe$8ro&44Z?} z8sF<3GJKK+FVr{g;U@`|qaK%#5wDm%-!})qBm^d6ASDYC2>Obkf9fv9H2Vv@Brt{~T-`uMK07=mc z%-raBaQzKh674$@A~yEv-t12s;_l%f;j9pz2zHtBv^Jea8`}zz@ikvSV6o7@ed#z_ zjuiRYZG7p8)d{8!APKcx4VCSO&H8aj{}`Kb2fuMKftqE>#%@-q>vNBg#4So0xFn}{ z0JEf6{l$hcXPT1`@da3Rvf=1u!{+aEWX1Fx?bY22*v&@!N@W1*pk^hF)AX@zRmm?f z{i&!?2dbNFuAy^Tw=VV}d4l=MR}lk02BTiRDmT@Xj8LJO3A5Pg8FC$}Bj{qcm!|$U zs)#IuRia&CPaM-W^o{mF6ZK<`e%VJ|{7A=(cFQYHi<#V)Z=-ob#98W^+-O&7bP7;q z?OIPIiS4MlOJ%>U6SLqraWp%YOKOO3So@#+XqmAb&z)#y?BuehX0sZ$tfi&S&(9P7 z6b1ekz9NO`4pkGPD1GrXp-jot&bk3-DzgSK{ZrSdgMyvDk7$9vHHoZ1Qlh4s z>)vACpjYw7W|xX1<-jOPSUj{>#hd{&k=|h>23>tS@a)ll$-hl1AZbG@5kkR#6%SJoqon-p=%X9$oI37?|&w;ZQFY z(%cBvcG=^ymP4|89ZH**yJQ_1hoOH3Df*8$t_`c_08# z;+d?xP~l?6m5t#sU&BSHV(HZg(>qLFAp2E9@_*pdee#M7JDgf2RX0nmh)X+t`7u32 zIs#ts&uPu^G~wcVwqJXA`zui;Nt-$btK@yQaPbVBfblZ}NGT!HN=MXd*}8^KZNZ@% ziV@(cSQ;;Jk-GZ_fNex~n4H$|=|ThFNf9oe#ho^}i%j!&WbN!4DodIve5+o* zTnP+|G6j3q_rtg)Bd8Do?dWvK??kf4@tIH+$>RF48KOoFs^^HGMzf$tbYm9%w*^P9 zn-`yC=r2Q%0g(MWR{>OrQ61|ikH-GNRP5j;VxDZ-#NIhv&VWtT!ra2V053n^$42%P zChpLo4WuB7DhY;o#sr2ssgfz8NE!%Ean=AMUQw0W9;=6F^7sL;1{-5!iT3U6MU?zQ zsK6nt0tZhRLhNClzchtvAt!&}fRR(9V5;m1`~Ta?kYP}Xpna=l|!_*!iz@G}IWDx6)8Eo8FQ+5d9pjf4Kx z#y3xBG8js_5G*Q54yHb&Y%0d$e4>0)f$|-ALu^{hBs^1f9@|;84NjJQvyULscLiU! ztWuH=8#73Ql+$uw>L;i#)q)+u^5f_XVt<-DIn;dE=dtA1oxL49LrG_()svsUwC3C- zr2j$qF=zkQBLT9iLNvB56`+tKd01R&;d{G(Vrr_T6y%dOd*|M|3<2l>M6AKcOdt=P z2G9*e6n_b^oPW3fO%%UJ=KYrB%b6FTi!R=gq2~Fc%g~K4-c8)^%UlaU`)DCKrzZSB zmZXx4$3sa?u>_7=ZRFL=uWtc%Vdsw3+OA|DHyC~D+qQfZy|a%Z&1CiDrH~g5LJF7~ zC?C7NIC`}_`v<&vZudNb@SlMINTLM(ja!I_;cFPo;9dg5hwVMg`A* zhS?gjznLWbCm4lUjeL~%^J+UVwt2u{@-VqLxIplK1oZ=yp0NCf0>S-%Pa{ItF^+#; z=^!jZz#{!RAlKsUjF}s+o}Gx1^4I>o`D9~a%^O<@84ZOgJ?FE=8v}{-HROVrn>JSV zVA&jwf1#Z8 zCU4zs`QY|EPCH^aBS8p$F2)?PMskD;y%)A1 z&h?=7F6k}O(lrvGcIz81G9Pk!q=*|DDo4m*%Hr%fzt=r&8sXZ^3W3PN>PM1l5$`k* zTQyn|0S#_bes+h@eF5L?S+bXGW{G7G`#zJFPN;s={xk!*KU+t6Aib{zQXp({PWRl{ za55c*IOEOK5!_@)P2aF_YZ$Qo(A)guB)EH-OF*3@?DV691TjInMIV2R_nc(|IgX(x zVQlm;Ip6%~(0kqV(*x`VKd85=2h~BcZg8(Ux7^x_HtkF-#qt)q*gJFU4sBDoRi2Zi ze5>6-We2{#VOqt3y4O6@BYLVReXMsv3n7uB)Elg}FsIuC{j0X!T-?m{*C{Kl9Db8F z`S~~C4bs)R&S?$=*-y3Y-7Y5e>z~sdf&NwR<4fK^Wb9%Qk<%{AH*w~v6VeYbAqF1`XYAFg9$fvrrMCx1`027SC*q4klu z$2TF1TltS=bTR7}kByNNQhxBYSXLy0DY#4W_@RB=WtnFij~D{Ou4XAQ0q_RwyZ2|K zx+<(%l*=OwT=PC-+tGREk5BhqVkX1aPYlNfQF6ocO zb$?)puUY4+n*>4lng^};auHf{caj*cWYU}#TXWXiWl0lF694Ai%nQhRClogrmSQuv zDl}CUc%X;cs8&_eQB;!3+Df(aOb)>OzBGPF zJ+sq7?`g>EHb-vcjZj*XW6;c=g(u#Q-TVFsRTM670>-(RKc?~$cJImW9!o%Prw8h9 zI=TL4xfA{m4kP|d2QvEng~aCH$tuV$sx=sBKQkn+PSGjxfSEnWFq7i%;8`28J63=9 z0K@nXtOgt(jeFy|L*!1T(un^C(Ib-n4y7{Ec~K*YP=AP|!!P;|Q)9To=}C2(9sN=q zQi}}4Qo-#bummOy5I;DlJM)u340?xR3_>4Zb1PlxJdV1DL*S{*>n;g& z6ifi@Top%hgAa7eKjgapBJxg}4huLx;0D~hz7qQ9Il)phOV#k3>N|_?!4_VVCypjO z#sR_fa3ms1ZSxb-)t>R@;1e+tY4PE5frMvcsXcLl#PwJE>+ z8&H0Ul!q47tX1cLmlN_4nsKnlfLCX?WM4Y1u|c{ZSf8S{iH1x0;))}z`ED91o;k#qXTNP}ppo@uQLBA3%8XDJxyD)GD*^HsxA$8x%7=W0mj_zXj3vH#)0v zeq}uI{(0+4kjrvb^A1<&$lNB!^_Vt(>2Bxp>4~wyd;ZM4IQe#Vr1x*Ey}u*Bcg0 zLJ}3j+=WQHbmwg+cDA*&AGE1%zw%0q_Jq3`D}+SDHIlW1;x~5U()OSSbPfDLm#?d^ zvf=bpauy(r{b}S#;%{7n>*l>5ruOQ4g1zY%v^eL1U0uzSqe^<^TX>!UhPjAv_N2Pf z>JRu^hYW-J(JsH7WQ2G4rO>xlv+&JypVU&*qq=xQWUp+lH2Tg1BgI5gxw9qNE8?~N^5=x`jEck8N$i`HWKpTj$N!UOFmRN}$ zuPvHFll$W^pGYU~@0NQ2a6dl>iM|Ski95y+ zLc~4ZVBEb#1A+@jQ;ed|`ju|Vy#kbQfX_(f^vg>O?pY0lk$4IGKTNJ^(Wv}HMMyz?YVSUan)6XI--qL1Z86@H<;nmYLbGW)B(Q{)oyFwR>S;qa z>Yj<3^Gd49j(w(+c4pJN0e5Bj+83;@jKu3g)7jq+m2KA(j!$9rfmKO6o>1V_CXQl1 zie$cSeRWk+^>aEb6(WHp#}1$;8C0i9Yw}0MjK@M0@BpHRVvUYL!>RE^#WKFk-9N*p z7yM7&({FvuJUicToiB!&5{Kb@+;-x>Np9^;WLsg?d^|4;T$&bub6Y{yojbI~9wDw9 zXeV&%p(#T-rDC_-oPqo*@>Q+)8dH(f0IkqpT*bP{UCA)t^fT6emLj^%d!fv3E7l^h zmcnO81n`ieIiA8+8O(^tM_AGsSWTwU$q+g7*_G>U$nO*RA;+!fpOH|wq&0SOtb zOP`kQd5tZ9I@^hr<<7W~>`|=H#w}bo)V<#rkJ_Rg5=in{X>z93P`EZR+KDzCAbjQt zi$fayh2_abm)-TYmn|(G58t!v11@2ASmm*R@bqimi#ORZ?rsF1;v)>My%K&XAKa$T z2^;IrIy&LlZ??LA+^`k}=I=?-;0z|HyG~X`Fs@`%~iO?fr4&09=VV_sDI{J;% zqxV~Gyu>0zn^cIJsGpbl0-GPIm*Nvn%w=#bbh_2n#q*S9)If>P+tuML6c7F>f8AFi z^ZX2jG!2)wuUaj@6%5x*(#@kvB-G2cOVJnM4)#HMrUIZZ)lSAb^(OHsd!O5$&Fl*p zpe*hIN|}897)8UO<>DcJOa_=~u!+-rx;b$5tQ0`ww?_>%gt5PLelM*UI4f}?yOGz6 z6t%N0;FGbJI*$z_jUqS@*hd(hFXX)knTT_fh(|F-3ck5BpMB2ZtkPW@F+b?gTnGl1 z|7%Cq+fb>aAoJWi?ugKJgT7ooF=*GIsA(?3D^z9m?CQ#aZEFBxZN?XqJ3!GnQ5w*l zY6Lw^lmD4Kv{UoB>*>3G!CNEN LPxFot5D@pY6Kt! z!W9RB`y~vH8(S+!vhd-F|NsC0|NsC0|NrkS`SFySZ)TG>^RLb3*cbu{;Rppe6eS2! zkXBmJ))Q-MFVH-Q7-K|W^ps(RUNeXu9PUkjfQT67&_?t@L209-VH9ILnqW=#a(~*7 z>-~*hnazhXY=*RuA#243Dywg)+dH9c+qOoLyONTUlClg-39U%dWKwN8=nqYdvDY-C zQTRdMXV=s?z+)UvkB(2CJjE#@YK>GEoqMM86oXT4(_xw&!NcM67Lhro%n)hQGZP_L zy)vbi++z)AG_P`g^6Y$PAzs87V-)d1B~?--tM1$7^9{MeHZNZGuwSQ?QWCLNNtIN| zjGt4?)>r@L|TiRqYnM_2CF~%rjR9{@H zPSw2X&p2q6$3B^a$z+VAyaqLb8bMrYM7doZ%Anu<((lWiP!IWXC_*>pQ%R9n+Dfr| zu0@`REpO_&t_xDv-62cI)V-9li6#wGN<$HURY{dp$*Nhr1bJXB2ZXKD5Gjm-FoIN_ zdI3W)ylG+n22osL_g=pB2DxSLB)-$`&B!fjXo*unT;FWId4)Jek0yvP(tfM@^xigh z=Cusnviu#3h)h$6n+sPQR2KOa9b08*y0epghNa{E_U@>UfvuwV_`$70N)*ILlP&Ry zm^dtgRXND!Bn*zvI1};R7uTi_XJ^a(^9Lm5d4onVGnJqc44-;E)b;2~lTv@!RQ}r8 zl2Y5u)KvYCt{A;9%Q~W`vC>>==DV9gE36)=xS2X0ZF&@3BG+}jyI1K6K3^*)K8RBo z)@~FlYa5-rknN%PCQbec%1>M#3zNiJC%&aEuv&;jk!HfB!H`+Ok)?41)V=yJ#_2?sSZ(;|%o4F>0?&6S=q6US(j_m|pN+t==eE7rlQrD|B0ltV0p zRexXw;wV*l{nt9ClZk>sn zuRG$M|6k>orpY-Mlvv zq=W)0pbaV}1}b*E5%KE3`ugwt`u{ovbL&7GB(g`19E%FpEP#y|qXsRJf>bCdA|iq! z>acjDuwH%p|BVm*^7Si+V4Wu?r(VT--J@Sl$Kyrzi|ALc>SZs~n}v;GVKx>l$_)-& zqiBkzX_}&F3U!gQ{(D_0Dd41(wuB`#+bBDjAn(N0@|((_+felgVR*qoXJ~8jVJy z(P%UpjYd%vMNu@0q9}@@D2k%!sCQ?oO1ag0x-g{_>NWxogIODPjk{(qbLkslT>7V< zl=kC0)A`dVPiGRj?RU{M5DZO2S}D500Vh!uMN>32xe3-al&w&;?JuFH5&!Ou{PQp5 z5{|LL3M;G-AdG|nA=jtK!6s}KoBn;w1@_nbInL4$%fK%Xv?Mao&f6yX@8I_YDe6%caSTs zKlOUR&972QDW&}1yI$+wy0?m@Dydsit3lll`hgwiL5P%>#2IJElSQ97UIO$U_X74V z`%Hcp>_89jTcCU{0SrK;m+)oLikIdQL;l3g(+2_c)%vG>R-LS#jkt@%eT_j` z0*R1Vi6lHufl=_@bP*3fx9z{1fOlFU2aAw1$x=3f|KEGdx__laN@5u4{__rU=+^TU z49QF~5ki2V3oHKon^=9~^<690H1~h+thXzbR8k2`CCQQ{yCfN~rzJOy-DG9bLm`|A z(jWfe7g~X@D9bz<@N#f=`P0k2+{^Q_)MvkX^Oz3yU>hRH*iPgConKR4j(zs_4=0`- z%V#>5V`XT*Xwsw;1(gKBGP2AZ>Pu0^whd51NG`0D6~S%@%HZ~tD?0CNm9 zNJtJh%UjTJ%^#9>l-v~tEeknH1)~2cx6g-}RM4&VIO;fOOs6Gln^r!?io%aqLOfhaiuJ@{9 zfLxw8v~1Fz9vuZ>+v!2;&~N%hR*bf5wR8OvHHK-LmBde-)!*0q95nU>omlJO6-`=) z;Z**`yQ0J6L-@x43KQ4B@-ed zP#QPK?MYKhnxD9Nn6!`i60u_!9`ylGPgV0%WVs`mmVl*>SI8;DZcvt7{^bIR-~7I% zi~c(|nHrZE&PXQrV*!)?3j+}F8_g6WT z1)+qthpGoe1g*FjY1SI7t* z8KGu-mb%a4OsKn4^}?W#Es#t_iA1gpepX+&Z;WT7_5c5Sb=CHN*%V(k)h(MO(-TZb zxhARemZ}LMFE)MV?61Bo^uA=llWgNJ+rW1KWJ6J3GDUwG(`8p+WLL6HIJR*?t{kYE zI!_MpWlZ;%43z9jvZ1R~(7~YtP@#e9l=5mqUd>`T%U;fY7Mp@eox`eEyIw43xy*61 z8~CS|&a(HQtGGj=Y}YtfHp$N9)4S?T-K8(3Dx_*ccHu16V}!u}clp1!gv(H>&?wic z6p&12uOSSjHO=y~&q*@n-bbyj31P8l^Khm9&-3q3oV`aZ`Oh&SE0OcAs~|j5^V69H zhpUivM&kdc+G~sZ7jt&7GA%-x&M2r9Dz^%qE4y=1yK*^!B=9)IhR9hgHag9x!@{%z zq|8-x2&wXMXO*r9Wh$?;Vk-Y}4;WXF#T(`qz4wvH`np(CC z4Cb{=f8y~|lH2-Nl3U3wY$2f=Ue;r_Q&=;FEWg8 zfdW#44fO8E-}HZMP`mCGhY}z}h#X1Q_x*(}o zCYj5NfV|%|Z0lQPZ3iPr7y$wq;Hywq@_U6FbwQ@dsf;oABc)j-4+#YXK~pKGz!W-8 z5i)u_EqPTlrYEP!DWn8AdhKT!06c}~e)bN2mcII%8m#CFBv*|G7y?0Td3ZK&1@ZU5 z_TK&C9VYg&v0s2AA{>?Dlme%Xc-I{tv+*SdUvc%<7Wt{|>R03bFC0Ofq_`NgWq;cE z0sm)B!~>S^;7f;_JJh?e+4!I zTx!mNivLv#j(lB?W*tJ{9EVE%t`QAi*vUH$?Vz*&r3TJw%Zuu}!mPPL)uCU-)BjHm zfTX4;eV?F! z2osV(3PL)ydesji?#GzYiAQnJ61n)k*0X=*p_~=-O*dV468jptu8Lr}2u-B8x5h!E z_`e@e6WZfXLU%h%G{wwnKz9a{%s+u{Q~#xYr)PCsZ|btX@CW}1K_DE6FyScA07RIg z3Bz(cfE1z`mcxVx06}0V9LbHSE)3kv1)fye_|^$UVu@5HS146#A(eJq&o@>`rHyso ztU#5$eEjN$Y1xkJ38}QPY{&J4v}{MY+VhQ&N*n9ERZj$vJZgDKHEhodXJyk*>v8`G zV2osVNi}TW1Bfu?@)njZ#)m(ygRGg3k1)xrc9^&G`57WO#R{@!y4yioky$9J+v;;x zPTu?D`Fel8zvH|fnBfS>Yym(+zOR7C{f>`gJ0y5t6eN;AFMMs={PX{F#wh;21m$ad zHp%}=shKTt9rLnU40Y2@Z@a*}FwQme+H!*p{WqFLN(x290m|uHRz18;9*`Z##J8^v zuU#l4GMK(Ei0XGF*p@cmPmsCZJ&uqZ@*lFM70s(me+MR%6J ztSxZ?<-euD=j}x4%(r=;G2=jW&=NEQZ9yea6GVWisx$-~wl>*sT@+vHgEj|RqNj*5 z;C(nJtWjqS%GSwm@YXOqUS&b`Npu6lO?XEfV$Y>8SAmwGo-`|cSxNnX!qq|SfO<-m zw?YmtlWlV!p)oZ>T*X9@p5bOL&*CR(7)cGWQK;?wt#?>82bkOzI)pS2n-zD6dXSj1 zz{|9SL=O(c{CblOfZsf23y}<-@4xAlPa9LFj_t-vNpF*x@p%dFfd7wzBx~~)ihm0w zQlrQFcM{?^c^7c_cCTZ9dM;>X{L+rJc_$u9mqEM@HbL?7?NcbW6%OS4LLS1%|!8Al~FY;pA6 zl)CydbN)^^h3j56rj$YH*%b$%h zTzprY`k%0?C2`4o?{gM3$^o{HE3VzK_dOu|`!d9)II>;6edO;nlqMJEH-piejN$Cz z9&GsSK$#umwExRmcLcF5-d?F2#RW#bY_tGC6E2_1EA1fc;n`PCI-cAoFEdYpQ<%Bu zJp`om)cmSN-Kp~xL;2Z*^xqrzjh`zwL0pNrc@w^gaO;#eUt_-GFF5MXlp8v6$R2*I z2?z7YbC25u%j4frgX33z$$i*Ih;g*OTzJPd=5$8!CS2AAQsoNM%`giISKFI51kfBn zTi5v`J*B@49U6U&yU*}+w}bX};9wH}aNtV(U+5=Vtp~MRhxM|~>Y}cB%Rd7MqcFH| z1QLbDU~vEl!3YYC!QudwHe}g(0YC^wPz+bqAXiLwq|(N-z7tYu%QlYd`9fOCc3e*z zUmz5TrE;aWT~sLWG7oey<QjIj*5w!7iCp9 zZ5Lw7rK+2@3$d!3)aI@)A*Nhv>(#smx}|ui3nGQ1KmvBI~JzO9@5DPNz(<$ZsCn&f{h|j*~iH6@49|;K&m_npy zxUFHFA2{0z!z#J7W3CNfOn6Wa7A<4FfUov@5Z~>6P&WcGe!gv{DOyJR6B#N=e(3Ay z!C@~t%SLTc{2_m`s?ox;ds2_enM}giw9f)lN6Ytx+FUFiVq+*SE=Ar|)YV31DD|$E z%0Ve9O+j>1XjsCc7`kF0h4qE~)xld*NrkUVSQLY?Ff1DXsNiqNV|6-99pH zs0<%v9J1?W`syo=&fte|TPw7zRt^+I${L=$LwIi~8_H9K=%BoS-a))%TLOtG@4?s>&Lbz|8b)}*ZlsAcSd;q>jSBZ=mGF3a8eEl3Y!-L#OGL5_(B0A|* z2--3uhG(K;R?Mf@IAB*vBrbvqQY#krZvuP@8`5GF?kz$5p9;hFhJ%Q}8^P@o1(&{3 zne^{J9b}^Mi!U;9-{ofBOTtj$^#$X!f1sU?#sN{Yp2KFe9fV(Hh-3m&o||^6o*ERN z@UQ*MzHwuazk9d%hkt+F#gjhF@I3IW%?SN#CwVj2$sxjorwj-JL!dA?0*OKch%m!) zJfQ$0Oeo`Igeh!gV;3h#ie^|2K!gcJGb{%nMKg%S98Um5m{7*4c#TS2eqzd{t9=VG z<*F`C+w~zC63DAdyDfn#(NbrkvFg(KO zNGv8nO`J#lbrBA(4jkC>>zv(3A)tXC9^$2pX6vr@w__3M_|UaptuuR_6W5NHd-QU# zaz3zB>|G4|*#M<%s|Z5{x=9PWVzHazJ&+q;r?{UodUIUGu2|$Idt;#a0T6(;t^P0p zF25a-Yu=mK_KEDTaaOLdJmIg&QQ-&Ssd27bfNP2720v?d_8uwPjUm|z{61LaY~8>d zQ%7NimyU$Fh6WeSIe99XrvMaTl;hSLG;n)a_RB0jV%}AwB-`{ppY8Gpe}?}5>R{WZ zw>ysaCg1yGw!F&^pc#I*fv{Wg(*H!ky6eEGLO8tv^duQK7O|X8tYRxY*v=sau$d;@ z9N-f?ImHS=oMW93F7T949&$=5*SI2wM|g})Ji~Kr;T7Is8!8z%Po#Ks>=%O=IVl!# za$4Mi(I`Gi(=0jpaaN!C1+DzX8>seE?-w3<$ETz4$-6#XML<6A87M;X;m=4Bk?((S zb%*@r=T(scg4X|)O%<~mY8=k@-4f5-WHf3ENS`#;Bd-Ou~| zudmyDq*P}(8c*h?^RvNlG@hEClTfNQ+I<8BSiq1NJc-I+^F07UFp86I*^F9j5N9#i zTdvld{q1hyqQx&uKKEf1!-=b0wR-Wq-JsR!4UF-ewhOGiVRtysYrmO1a~LUnkhpt= z$Q4QzEd>Rt;0&&&lB_JWHv)x=l`K=95>*U}(Oe7@0i{P_NdYQi^J zpL1tenho3ph>@X0ozB&8>cEnje77%xMT(dDM!|e93tfXI?RpHsn*Ch{^0pm3zCdx( zonNyV6)XfY;4eSE<5HY2%8%;y5a27I!$_!*9y7d*1e4{d(}&~fd~^Gd!H$<><`OKl zs=S>q*V{|C@N>^IZ#VpbSk~>EoU=$2i%s5g!ncnXuJ6#%hjN8cD6msj%FN4Ax$J^n zWolAk)<15YHfPZa4gJ1+;w$I;H?mXS}gT$T#H$H;g z5i1GVBhOG2qpDP=MW-G^Cd~QhyH#u1t{*Vrc$B~U5EP&SDYRh|_QDX32Zn@4#U>=D zW#;5F5Cj|w76BOz6L)L^QYr{D0>vNb_%6zTvY=cj4iyFfK)C==KJ)~73ROlmP#si- z>QOVAgl3?5XbD<{HlVF&0(uX9fM%k3XdzmTzC~-%CiETJjSiq==nT4qenpqjzvw2q zFMt(b6W|d*1w;i73miG|hw0B89~ovCIpl~XmIfNAxonMIk|3WfXP9Yh-2MWS8dWS;IgO8aMs&2CZ7%&>8kk~ zJRs!zBKy5NbDP)zm!;egF&cO|F*wpk=9*=^o4Y!~3%JvirM0}LVRCrMJC z5y+%5veOtRO#Eij^`!X+Ys_qY@-M~U+aT=>{lrE-8}yScNkjHB^D^Wo9!_ljk;s2W z-Q;rYQo<-*lsK&?Xe3@%@}IQcqP)?NCqeiHeIdL2W$i8^(O8Sr^n`fE9(zKY4`on; zy-Kx>Uv)kzhsv42{=j_pkts++K}bbQ!2NKNLS71xX*8x$EBRlH7|V=NBl1U{hOfZ$ zajTN+1lD_;A4ZCXKUx9}I=l5EjUXPdm9c3*RxKd$ka!?W zG#DqvYr`cjpo*$kO0S9K@@kQL`}muItFROaM0S+7f0$gG!qKH=RhKdRjK5*KnNAQY zklJ3s#X4Lo^N2axXyc4Cp@dRoikwC~m}VL^)NsWWpE4ih4s_9l^?F$AO69h7pQDN3 zfjvwk>E&RfWF=%vy#^WTB5 z2l&B+6Mj^0{E~Qz0c2V8n*e6{`ZL%M>KFgU?R+=*!v*+_y4U;_!OX5*^kc1dG{LAh z8KzhGwPb#mQR1-{6+WG0i@ublRH~&}ZVhj}@_M!ZQ~n7`R0Sj^1r?dnlvQ4u(^3V) z*o-O~<`!1*q)=Gs!G_iL=!Vt)ys;&CS4*b1wDt#9clXim%`AnzlO^G|u_XBe9oOv{FL}dzKIyN_ z4}Qx(#irX5$N;&Q!rMowTE34BAs9h1oFFM$t zPpk;=MP~YikwX7A0VB4FnXm?#h<^UkAgJj4VQeu3;0QhM}|i&2C<1-0uqyql%!rdWmx8ATh4_n-wLkCim%i{RY8?i zO*K_}^?gus!#)J`U~gLn@Sf!YPW+qPP`JH3&)=!>bVWTCLsg_^b$RvU`>&$f8+BB===+- zkpo|n(jjUdr8W1>8CMmTH+DCDF?$E}1d!p~95fWx73~xC5!Bah5uuE24W}4pi6c*kEA#e2?kJE9y>-Z$`VQ>iFCt>;w{rO4~51KAf0%OJ_8S#-dB5# z{wG~RSTld*04J}5$BuEa9_P`qyjM~HLrFpiCp{l zs(FEgQ;=vG0$b_h+m^~Qx#Xp>s{zY_4DMb12w!~vYT@iA!>#nS!_dTHxpKVAkIvQP;4{l7bHU1Qk*@W)=g z7hiPS#MS4|_LHA%2EK{dZ3K=)WARivlg;Im8yJqplj&@}7yL^9N4>T8SASjy9by>t zyjY?SAz?65IqC?Y$vOiPLL^}M7>t!djmBQF#({ICO$4~r4#GJ6ahQG!jwMo=T&31% zb^7QEf}wCE8jI(7zubReuZceO>s3%84`ttTkAGA7;X^E#>SYY#+8DxSI9!?d)^esF zCAT}9z^xTdT8JKp;VHipp73DgF;Gv`AL?tjA+W2a>iwB9|L2}Q_rE;_Js|c&FVXpx zZ%o_hc3|Ye^TlrBHwkl9XVCU=wAraDs>DN4i>}VG^8O?4Z{k_BfaMaC5|9w$;}gDx zFF)YtzXnhj0EYf5%>o4YM2#&2shTICPJaW?hr0*>)VAf&8)`YZwB?d5`6`f{`$E2g(??pS#6!4u&>-|%FJjkL)8i5g-oq*F@^eT=pL^Yjs;`QBuj zN;7HN%&?g<%f>Z<`Nz^&PiwZRw%hi-(32D&{wuTnQj31O&o@$V!hHLE*7%PHf1Cjz zD4x#d^2J7rKc4?J`?5cRiAw4uBufpP-TY$j-UFqk%*t!&x8%&y%Es1yDy(a1?_+;o zN+s%~iKUgbjgSBQ`?K4x?=Lu!V?&QUC+_?~LP{~aP-vN0^GNczG^wT$(@8Jm%<>yX zq-pno1+neatN(WD+B*27!@A+kw)^eO_LeQs*1;BOi?Nm4s%(pGt8JTXCv4}b&7NRi zZLhWOv7dGb4$0wg3~~%{WIJ*lV;sefjgFI!4;`NvUl@NG7meG-^U|cKtx>nF*Iuxl z(NklTn4s7Rv9n@JW6NW!;{)Q`$4A7+A8K=`{UOJpH3xSeoIm*I?dJo3XWPf}kBuLD zKfWLTvjM*AS3~PT003}Vw&^T=r8RDH*Q9Y89*kZ1J^Tgt@dPiGz8~Pnr>!Np@fxy^ zTv+_pEn$wZR@f`ly}$I4bxE%bE_rAWO`>^p99`KLJ;4o}a38UEZaF_)Mage5^kAbR&c(T8T5mZ~$ zsngG=Sl@U5IJ*18e_TXxI5wVh5j z)Ru{-Eh*l=oPUhY`?o(fnuc1nN+A*o_&g3nLxXU)Y4+cr-!j2AHnEgJ=CD61e2Xk_ zEK_4B3;})~`?fCQ(07ftEhRW37=rh&w&Wn7dz>{|N#U!@%hR2v{7>MJtqqq&kvQU= zz%s>@<>N0u`$4=sJ>1<~T^tyz-yVNrEZ~H`9jS{vb)ey3MP8ksZ4KNtM|>VPCxwA zoj(&pfk$ui&>F8jTC{y;$jCRQCfu6p1t6^2;N^imeh$18=Gc4jw@)%}Uz1e?v>H&f zXjx~=)&^IuHie6_C03Hh(&fO(ljns3&5pEsl$NHS3mbd0^FJKcD@i)M^^}iUqqHlC1q?7nc$^xyr&PTTYAyBQAD_ z2~uRtP@rIe9z9E}SXtr3$r_Xr8|tituxBp|LI9L-;VQ(4Qz=oh8fnti%ao;2v0}}t zRB3^R)~ZVvw0`~C%$n8ifd@KV`d${@i=Elchuc#E+iUbW|H z)%vMXvtN4j`fI?T|Hd*=49~O~L{_c2W79*V4jrL%>>QnUK4A9A4R$~L4DVeZd$B4E46yAus-i6S_+k4PdSx`&EI8D9h~Livmo>lbOjv~s)5>9gPd?bs)9 z#<0t-!Mg9Qnf)VwvVI5v5okCbvE~HFg{xB@@XnFZe89kPB|wAgy%`fBhgKcr_2_rc zm@#T5ZKv)RS7P}h5it`K5Hk5LFDNa7@W z69D1tVaaCmgW%RdYc_ZIPad7eQ2?&W~6O)jVkptK*OSW94sx)ZT0_NLzO3p@3zq+m6)Eo&)u!esRC&ryc^c)% z>#z>vLW$0Fs^@E+CZ%v!aQKYJcnB4%c{ychl%X<+v4_x%Si%=nKc1?6c^jzot!@54 zCvOV%jTAm`>y#%=z8r;$6f01!0>DXi>ec!>n$=f4)vH-;rfFE+@-o{ZC#K>!J%Q|O zhhsHvzNwn`*`w^Fl?UGsck#Cwf9_V&Y@W(;>a?OzjhfQJ33~vP1AZspTVph3 zL>++XCPG{rH&t4I8-%+Kn*&tZ*aJCW+S6=%wQIU0%a|J?0~;_d$Asj0We9Ur-cwk> zr&7R`#vKU01BP#VR*Z<%5+@B;)bdjpZf?lomLKPID4$a&mIrW~B#rSHbDp=g_8IF7 zVpDT={la3_)j#T~6SdHPg$-HGUI2BNiR2|qmZCx$JAYMEhvK|26&&ucQ*L zd${h+n4k6sb?C29*0%doX1jOZ2Ltjx`}iK6JVOHlh)p5mYdBBmYlNh?TUdUEmi00y z*o;~;&Jw~CFcpyyv*~SbpT44$8Y*p~qY~?zh&KCXtUmIafq?QqbPA^eeEZi^G4gK! z9sUPs_cy?x=S|PJIvvqGhd54Xd~a+Ep6CzA+bD5`c--{}@c>Dg)4-!}BMFWMm3;^w zZufu)13z3I#Vr!Cw`h+@o67T5FEyBA(QGC{8*4lRfo8=(o?&4NTo7Ge z$m~3gb@+@D+t?-YDkMQ=W`iWCJ+KF^0F^M03obTyM{wr_q(~Rf4cBUUSX}ieMs(xO zmk${W+G`byNnbcvs1&OuLtb=u(1hHLnk2_$nuFqgCSE3o=f`enr!kt59Xe*(~0_Vi8 zLTwCjPDYsKy=W#k>F+|}<39w#9@ZT-d+XwEd3QR11W5wYxZAc#Ftkz|>aZhnqX?1P z7dIE2dKxmpKgbz2T3ueId(dv=_r@|t3zHgdT2A9052%376VvDsahp$r#v=}bX#&YBq*|HiURYH?b??7p zei6&3KC$@9fip~IkD7_U`lN_<$c?sr^M$Eg0qXKnr_-Lh*kIp~zFnefFuOM`R3CuX z%7H3mpe|&0V%uIQK#~1kk|LwLU+YR_;$E4ihDKjU?OYC`T`eYVBXUDH6Cus9>+WUT zm~-3~3$;+s#mI9_wAuOy3D(fQ$uz~g6e`HZtRnjobSx&*#IkI~y*xoO0nH;1QqLvn z#{>8BN-XA6Zh{Ue26p{P?xlWNusF8( zaEV_lSfR|Q8?n3uVux$iC%iun3?Sv29e7?0SR2@*ZD!WvDbrKS zk`r^wh9!u=E8tUxM6M%ZH8FFsQ5cwX;7CWDq+wDBsDtK-i>}~WMxLSq3v4%$xsZ9` z7~`kMOSOaD0HT)zZ(D#T2Ix}KJxD1aQcB<$xIMvQK{KlfI=HO#U<@mj$lPnX?;QYm zsObATM;KJa78J0pr==jxYd`p26QxpXYpQOuE{Uuz`O39C#ofu`A=F(;ep5zGROo1u zazjJMBehF0g;m>(WjW8wH~4XJ1aZ21Hp(@nBpZ2@qa{6=kbRcXf{V@kbEz-M^iH+8HIO;qY8O++DdVF*Q| z8~tLOYieUmYP(3|sjB3%qj4O!##$m**AEN@X)*C`hizt`Ls;bNd%8pQ%s%MM7{qoH zXNC~wMjKxg<0vISmSqggaqt%HnMZ+$0xZ;kgRnpZh$0$925SMvrXT`VQd&CzKwJl) z;>kNyw#p(YeifUD=Gl(UIzCO2h`p^2soBzd8}lR9NCirrO6CjlBG3~6HY}H3?trC6sKq6Jd0L_fw2sT z?$(Y|O8yH+GBXv$ZF5}Bb-nbU)NyS5IG$C1@s01qbWUA=r~5|tFZK8BaXj~9JG|Bw z&!AFiD$Yua`XY|0#grOU_0{`2ifdoR`>MW_wXPrUk9TQT-$ZdUs-4s|0Pgff0|-JF z0(ySgz^V&xn3*XrupWjmde8lH00##Evxk#Xr3BUPFV=;!th{g#{>KKFgZIZ67l4Kc zv4<0?Lx()^EiYK{3Shul^iV_1{Ip|UcuBnQ%p1}10i`@~hkSu0%0h%XKn-~zs!C!B z7@uX#>k>O$>;4!d_BzZ%Edy@X>0E1lzSXO1KVwu|#u@j>IA322IPDVRTF*m+Jpg#r zc>kb4>&2J|5H}fmAaX>^V_U+Oe55)+Kr~JELX~4IHn!2oola^}z?+$MGNwTIMsy?f z6o*2!xb593Cf!8{mLoW2JMpj?cFGY=M6XtBXk+T7YAPJ1)I1O9wTAQ!2lV3fTxhboMqNN6H?PWTk)CuJkNKO zAbWnT0r!1_i8{~2y za(_%#SH1H^fwj*+-;CBMjXX{Dpslafnlmk> zTr9K}PHQD_6SX2zstX}KE6$mOTg_C4-Qqa{tet}lvVJ6y`U2XE!@!!mLJ~p;yIp$G zpfU_IbZhMqV2tCVmwa&;h!_Ge5>5Lcs{-jx!WsxCTDBNsB|QRcj9Q{7ptR&V@!* zD68UrCWn;FGP4C_Mrd0L??w)Jul(ha1nHGhLpJX8PBR7?6X5o2d4^I#yjK`dfDxz> z=_Ff#Rg96CAz2?1^feDJavGSM+{Xn8u})8otz1}OY_JH>8CndjJ?q6mvoN$2=ty=A zh!4m@rPGwL!fqwFh5)-CQ3giEX`{#ia|A&d@kXjhn==BnNhG2d=F%ae#LXMerD42W zCu4t~>owY901>^4&a%;bqxr&~XikA4sab0bO`h$9b;8bAVmHGTeD)?SpTGbCZQ-kELC^rS>7;-yKUQ1{=%jciJoqy zb8ZOJss$shIKg`z=Bt^xavF{5U8NoAsw_v+Pa<>ZQ&zRgl3?KV3T1**F&Je7`Qll@ zTSZ?MQ_=UT2t~18(N|aJbgl4YlNx;o@(xxiHjwN?c*H4Fox8t0!)sNTR>b$h?KfYjIHnTaK z-jt@l(fv-ZH}iRCtFURq6m;h&uRG1l3(YJRP;Ksvlwd5DJGh7O4|VX%Qr?AYfbX6@ z_RgQ&WdgAV--NfN+q9WWU#qgINk(u_ED`W|B;Ou65Ghb@Y4E4ve_3oIQ7F zSLptScVH^<9*(%NAfprnH@Bu_g0f_z#FZG3M(7mbmlK#>G}bPo?9BG6beU~AV1Oc> zprpX+&2jBU`g%wfKpI(~b{*j$i9JNxH{vaqS*KHmQoX1?3YsKYET&_r2zt?b>*^&M zE)FL?fe_&_@<}V+kPDEd*O7V8(O-9}tx=I8GuuR)Wn0w^I4Hv|*uHQD&ze>zly?{F zpHHZ62^cE%${-M_dSQ^_ds5sS%B}#F>yG}0D_$5@KZ0Jm8OK-JWA{6@<%ar6k7l0Q z`JHOAey@$)NvD@pAgrQ}D9l2Vas-Lh+fI(;{*5Fxc##ZPrKEWonXipP@6h2Tw8CEM zb3;DURWqQ-f}o8}nO}94!8EuVCqpC`e0$(1Cu|U3ve#!en2?&EeorA6ZY zA3zkqmJ7hn>SH|$W7*)G3UIwOZ3$xLj!N96lJq3PamJgG zUe4-)&)!I6cOu18!{YJg5Bb{Z?CuW9p}}0`h$oe-V5^f$Owr|rU~KVJHvP7EU^F6J zLJAfzz0VH~i8JF4t7}%UA`~pZ%~Mr#njWg^B5r$V!l3;DZ+nvu`r= z1LZv_k7PKCh0!*vA+{6;u_^V^u)ZMj$%8ztsKqdXm`xPWe-O8zF!_2hwc&Da>GxMBG4tY<1cKYjZx~Y8yt-(|khqo4AS% zdJn2;IjP)ul26B#AQA`0X!h%~FuI_#;$n}%^a56t>wWG^MsyeJss~x|{h)*=7r*~Cn1bV7JL+8Di0pz*{wpv*610n`Sj;RSnqTW$wkA{J1 zpMqKVBR3{cPxJGl3{#=oD=KdU6_XO2K}VB4cX`EJCJ#C5bnE~bn$qsE^ zM)97-j&4mhQZlxb8mIq@N_=8*qzW7ZV(!!zc%;@o^f`+ZS88I)Pq5AfuEMaWo>p6+ zEL7f#l#=aGBy?e9p;OaJsk>lWW5_7bBOeEP<}^9spJ7xt&TJ|dmk#cd)ZfXl6zzDH zqsjb%myou3 z+(Tzwv;8e3x#JL*ksNKbQF;!2A7%`YvOtQfwt_D`{gcYVZEet-Y^X&Velq`|_w^?V zV_?Zh*%MqURN%1Hk-JZHU-w0DIZHBfV_HAI*ej|&&*4)V83HV3>x`R;Z;69jgYKJx&=@kd6IGJni`C=GRPD9(e`_P!P&Ny~F!u;E;Ka+;uW zZ0fC8MkT;?c_gxqJ>4|8mHK{AOyA0Z=&Zb1U4RUw?8~PaOLCl0iwVwYQ4(iD6}z~a zSWm4qbvagi%vJ%2>a0r{LJSg`#I2*B^GJ5#x4oflf?IM=ebydu04o0b9??Axm*F}h zAn2$|M>9mGCuI#wHtESGqg!1FcbfrV+K2ko2cZ!_9MrDY+%#}N6eO&>h@DLqt~}&M zanxMeSAlguDd0Njk>B$5!G^}A;WPOczD;Q1;aLti9S-HJ;_%=L`B%LtJj`W4Vik>3 z#W@wBoh9Kw)(-U2#K07)WFYcl2MAq8-@<$A@;@j5rT{Qr;AfbUVXT990Z#xR&7D?T z{ECtXmQu}+FF5qAWWYRV%L2}0LrmOfAtG(9Vh*Z`fai|c(krpir=@B^C=}nPo4hF> zdXR`cODdNW7g;FP(|gLzj4E=aXT`O77;9Dx02m2M&>pPlzw=m7EU~ckCqRo4MlvQj zf-$seAz8vdZa5AKfkDRgH?=+ocd<)H9bMvk>N1ecHNE5D66MF?PN!#a%y zGqL=?y>)7DZX$FmBZmwRe*2A6fS%a%-t9o2X4agEhGJvu6)u|QIM_ptx+#;!h`N?j ztWqmOk#|Vn)31|6O<+??gmo*? z^cugyd_0VJl8}esE$gpo4X{aCZt{--$KYmn?fz#R<0`f?Mkx! zjL-e#hA9c0l%o!@E`4SGT&mHX`x?D&IdRy8yo_}$m4KL zPgq;F_?(r#;^(0bM zN8#-i!(iIB?cUswFB4_hwl?X6Q-M#ctS#?bz7{0c(r&;oQd`ibD=F|IngQ&a%529^ z&f4i~=1s~J4b38fBSsa;1w<7}YrehG2tf)b8S+G_2(*KJ;?-x|s`LQ*Ny(T|5{iwP zNbn`Kt{HpH@|7v!VUgP6Wje94t=_TrlW2_%RVzGYPBr47o^j+aRZdN-S`77rYNZJ| zGHpOl^R}=weH~wC^2ZaKjaSG%90 zU5)cK#i(uHq^usm%0mvhG9VB(=iRCX|u)QHte3IEoV2re|( zQr!uN1x2P1yrlw(DU0ja81Q$_u%B(=+%Y=UHA|nrY@BmH_fHc%;VEwT+Z#?Hy~Q5@ zn8e}c_oFH3)S0-nX<>s&f0wys!Po()-q-wiAwB0b^o<7jq30VE!T(nP4e2 z*fc6H(N40zVtA7lclgw2;UEQ`2XyCB>}?yNk?KbmN8E9<}%2Q)*{C<mQG@@#Gwp) zdSzdI1o}OGYBXa{gu=9rRLF{9#usTbzAUc{@`dkwc6q?C8Eh8hNjS#A?+ni z)l#W8_FJhX2j7dtz`Ee|-WvC_6c9*Sk4)8BypP^ZZNk90)1lkTw+9tNJI92*Nl$!U zX-orK@`dUnqvz_Lily}u$dI=O?~^;U+tvQ0hFLxaAt(N_@%Wx$^dfiN8)x>%@n~g* zE-qPZ1~XsVug2~b!FKbELRRlDC4P>wzt8%(oZ3_?*JQcWR9}3BSJyFl(c?Rqc7Em; zMPGg4W2QaF9>%urm&Jcfg6phwjGma>;Izr%Y|tS4JzBjUo%8oJjYNJB7-(_Zn(r*g z)bIm(@6lgIWyuYKVVhB`0@t>3WyI^4oDs3J#>=T`4&SBF-g^V&?frP2saVQG0-!4O zP-#c+H^X7ygM@!#=k^O3c$(w>eaW}zxmRq{Jt2@zP(b+U|$8vv^p+V%J&XQbx`Bg zz}di;8Ya_-5uj(hhabKgU1p*BKDyqERY(OV4T@DOzwsp-V}ogvh4_Kj$esj=64v{VkhfYN$j!PhD$wEaM!HGr4305W{9@V(@lcuHCvR! zOc!TIsKy0u>>hR;l}$yY|9rjaut0TFD$QTDS-z=B9k+oG+qcI*Dkw0XHE_7vt?CU& zw+m}A4bKyrqNkwKVM{|8E*|TcVfTA*_8C)(!-VqpZze~PoJXUMHHZecBRnK9nsOs# zIR&-v2u?R7fxzHyOLPmGeV3IyYO{O7>D9>dFJWX@&6-n|ie-*d&-`Rj1)q2H*uJWm zo!D9Q-@fjDyGKo=oU8oBq>8R2&aBfh!2GO=B^1w-oH(FzPm({%~6#o1{;DB<%^eK2xQ!iYH}*0{we#cuw+OMOmh4NZ+;NJtu{> zL1@!zg@mJ6sdyFySz27epH)mz%YX5#@Ed5k`Dfi1^jEUZ2Z zPI5dDT)S!~F%-xKqrqKwLX;3K7wUyKbll4-Vs%J_no*Uj6L!8e>@|cBNQPVz_=A`m z+7jucB#K?Au9Zvd!O2jhCcF+qbOQ9pv_liHCf4`!C&`oB_bd4NV_wP=1l1=0pbq9b zxl=+H;{lzA1MQaut{RNFSQ4|$4))E`v+=YwZ4JVrt#h1FPS_=*E##wZ))bVTRfQm+ z-SrcSh2Ev%LnX`fXK6i?z=c zbRR`<+rj6m-~lWN<(P#6QAqWlmR9t8M>jWq^^9rG$a`f$ktkLmd*TY93Uh`E>hhR!x3JT^AHE>J*VPotdFNS3VX*rsJ=}D`DTA5S{ zJjF3h*BjaGfsH8aQNN)HfK=^JKkmWE+oGFj`Y6G3{RQ=xO5qA0MoN4_Pe?&$-refC z&xl?ka|vU5!s2J=1W6hJI$8iNFd6WJfzk`?dwcTA`sErS82D2HNNnoBaPkH){uEPW zdxMCStr{+~I$euU*{%jzCe8A7Hyle;>VhvB)9bt`FtpVnB6bQ(!)3WqXMwG6Gi07E z=8}qCjnJ#uAvxmfEF5J|%5W+uB{a~orNnE9|#eM2u>onz=f6HuH&H^q|&9dMV{VFCE}k>Ho80r##~XMNt5 zgiRhaVMLN;&Wu6dE+|FnAY&0?{oH~yw&BlHeu`%YT{U;)J__Ax?pMBO; zP&Ve<#%UI~Vq}d*8_wgV&x8UBvDhz~1`0l=CFez?X)F;s%h%$J?E=oVoR4ft)8>AO^cYKeSNGOk-xlH}&INm+8$&cCDLdL`5D- zJ;IZR4@~db@H_@z(NM@2I6maV!pmvaq^*F66~xubGXOW~tU(o9K$R}lXl z1J8c~K6IfXX@s}I2^ud;ooc9<)A}_dH3R=;WM@cokT@cvl2MtE;`j|~cizcstz136&1F-l0S-pC%gbds6GGnOGy!vz| z)ICLbFbT>>2IH*Qen~+x(jEu(ezd%1fD!Qq}yx<(QArXWj%HbT7;hy4dt8 z4nxz3Kw7bA_=6Qq5ojw$2AKWictdg)1E{vKpFC$J;fL8PZB<&?TA4svR$LN2LczTD z2oT5Qw{gf=s=Zy?4r7@xcTfG3VJ(8OerIyEw-J)R#K($eYh=_OvoHHNds}yAVL`wO1^{r3cGaWYx z9#)HH>nF>;GcQ64bKZ&vGWzhlRfD;@l?7UT#?@fyFao-5rg}~5w5g`-5PQgN{@Fj= zNp9HNI_BrjvoU`7FhWUtok+?_Y#Ct4H>rK_nF%A!y1=g?FLHUuCVAQ!GXqji;8Iiv zp(<7?l2hQn`Rs%29?WZB8b&9z&9iG2!no+-bhAX*GG^zqEoEwV^^yuhx&~J5ve5@7 z)$h_CO}zI@2l4O%&W2Q$UDzUg(+Bjx{@B($@*G6g z*=c_uRZsJDK3D>ZTcy?l6sVo&%3S9c-*SLzem&#!Lk1ott)er;b$nNgM2uVonGIOV zq%Ow~$;?h#0F6=eJ8f;)K=R8!|FEbck~Q>=AC_yP3;)S3D24aF{k-i=Rbum$u0B1H zV7#;&eZ!*)v~S1{+S)iBs}%zTjwuM*P3XkluTsY&4Gm$tw93SI2A5~jn;7ewRcH&= zmS1ErMk}F^%cUOxhat}h>0-u6?TBU|=!)UTIJl-CFNzVwZ?2@+$mk)nA+97sXcr)3 zw>E6uBqR)s#~>W*)+c3F#(s=B(tE=c`NG?}@L~1^ev|m>n3gxaX5tzFzpRYgdBPv& zD6iLt*F76KbuMPAT(tIpb;~!!%T}88>atcwFH?fy%xq&?vN||_6zs1%RRq%d*piBgW{0;%6zu&3v#k>b z@cMo@gI_2XeFYvEUc7yXJYP}ee)&cf4g~OVhW{QjAkMu&U-r!-_1<+!U43tj$zemndeOH44L&Qo*LuFDe@ZNrPa!_A+dI(KOytm@mKvR#jx1$`(k_d#Ru zwJxgKZd4_p+aO&m2Dj;kj4ISl2)8AuRcyyE1(7NU_?8rFTWv?{u&*&KXei+(y@tJ< zn_S8}`K#Q$);lN-kW^;CyY>!xqd7$_2y+_WkP>ZlCw#$D4cpr420Upz;A(LLv0S;N~C zqt~dGJ2HC~k2YKUU=HqfovDOUl&qAqSs_Co%kJl-uLKi@6nF7i|kBAghT6%-Nw39C$fTfdA`JZFpEpdt}$rA zjxjhBALBXN$nLpzen;^1lk2|+ev@XpvQc8pzr^;9%gZk9MhOb_2TLS5)7A!dqw$sh z3ip`(1qz|Ow62l7!tzo6g^<0UtU|Doani4lHnp86hqwc~|6=`T#weo+ltI9$LZ$p#J+*!^9plXY~-1#R-n8blhQqjwT=J!1_ zu!eD4!8hg#{`gt^h-+w-loF0k!bI69H~<-N56O+`<+G%<^aoxvS^!6tPmKt)syu8( z_LimF61ph|1-aO7H4Vwd3#*I4IiUm^KDVDbWDx`l&MnhQe>T|;1%>_44nR!F8=6f? zs?(RZoGJOOIl$Y7HtyB*UZcTu759wzscVjYjIqIT zrUTW1AvTNXl;qi?KrtDMtozO8DlP-sERHWWfj1zcXnafHPPqiFm2r1T3((r~GG^C{ zbtrbN>)QVUZRcg>7LCD$jI;K>m}4HeY_CH=uLwI1Ww-0EWi_<9>-0qOp>0)|OsI6l zU>m$qtMQIxb6_k`ogisA88-kS7u#p%@5-Bkgq&~iFKN>y7iC0ZiG$sw-g2f6(GRYy zjRNC{LR9}t;?#*^gsUcGxW`ZPk}RQUW|=&aNHJhSb{7?~D}iz| ziqk~?+K5pHv174{VsYovjCJvI|7{|It6==Bv8PB|&bywM=i3Z~HxaE2h93=wc`qGM}Y!*>!7y!C4*q9-rLLQo!)nD*# zM7wriVd(<(IHX+s0Qw+Zhj&~VFSt}-53q%ke#SA6z(>$1bN{VSORj>pq2xyfHkAaj zbrOWmLfjt)dg+{qgfo@x=U;TJSy%r+`bPOkeZS;_8E@ntfjsNXs5XHrG{`D1#@a%B z5v!sybcF+KCQL8#2$dPW72B^R86^iG%|jZb*-m?K!@?PIU+u<-2!MuCU@$P)>~|D> zS1@S#52pHO0W32B>We$&E-(c2EH|O97+1poYNm4U$sIr6GduY&$rpBKjHT1?&*-xDpnxlJ6(w|n0mPzJ>W#0#AGz_&mIKl5T5u~Q`Fa> zQ20FR&Lu{LK-!~RO>oO)TC7bG`WNAf*uKM-8XT`dzyTeDsMLsWI=g3fC!L4YRRCUc zUP$tdRHjDS8B!lP!}qzSJ2WbLr{v@2;G7ZM=2Usd&yg#4Zh9#H3hnOpGVSZtcQB%r zp?Zo}2oGU37`ukKA9)mf@a%rtdKU!(v(~BJ7KC;?}G+?He zmx$s19VkmNyoq~)ER6?I!OBP3>}6&~49gHc4Di6V%MybWGFys-&(5OI&p-~a|1>zX zZ~SIf-qA+{!KdP2+>IWDcAaT?D{{ryWPWu~HFg3pR{97i+&k$~#V zW_BivPgV^6aBOBDIJVS2_p^IasKPvuvi{ri0;WGi_F8mP*qYR@G=P!{7DjQg*!H!uQEb_LB1AbY_nZp7LU7<|ucWbxDq4 zGoJ~zfRLvao#0Zk2VKC#8>ktqFio}_w9$~e8A$yp;!M$gY3!5R>Y&}_h6wZAK2TUW(UiVMdQDcaAJEV}k+0#=_ zf4^Zfv2AZ8cP#BG3qkbs;D69UPg6154vUyR6(<)`4>CfgMST;*PXaxRMyqOmraV<` z6If+^Q|%_{Axz1{GMXAxZL8dAo=2ML8%VUbF)j@On0L;Wab)aD9|quBJ1RjUod(qM z@&lx^b?xwvkC8-#*YCEzcc6rf|Eel_4z$7}yAqoCe@4bYClm*d!`!Pd>SaY)Mtru< z>|AO!y-N|r))r2Wld#rkIkx2fR=CIPc#kb{ZxeYaZ~qD@B_=)CN9H#W=|yW^4MD>f zYmqolVUQB!rdXB+nI4lE{pGf=l~{yVe*g>K(;m~m=E`zlz+J9$=G5h0KfLIDZ^YhN zw@Yf`+v{tG#U>Hai8jMZ7NlA_u%^QUaZDp83UqL;(MIZ~HEe#g{u1htpt%LJ7s0Yd z;^F}I;-i5bryxrRU*j(!Q)%xmeP3gGCZ^GxEjF8tA?tufmlAj}YIoN~*_Tr#tCe)# z>eaKH2kMuJ(QLgQkq>X0DkVEghgO$A>%SkUWo;|R_1al@wy;`b7D>n|tgh>S5x_5d z*$2FO{XzQsgUzqAL|^|tGU^@-$4-50zSdG}3ZS_6UeLFI5%f%JHdP27yhjy3s<23@OL<@MdlI26{+-NeiL}AJJ2>{Gl;z z;U&&9OLnYaSl~01Z&4y-mV7Z)T5D%$-6t(l=Am>w%ulV&xP$X@_lS9nX^VXKvV8(M z^7mrS`2QV!9y$67)^mgvgxlWDg)ws;TNZp;U_c5@B~j6=Gx4+Ok{>LQ^nWtf!ch@5 zPIL?%yB1$97kP@`=WsUmwa`?8L3;l4XKIF8=DC_att9GLmZN|3gD3Me6vv>G5j6E& z(S6IlU@Xw1TaQv6*4qSlEzuum=@8}`G#~wCQcsZYQ$ph#3&){0tWUMcm>{&CkAJ?Z zN0-&ujhzKl@)lQDAd<=$3*M#i)2qcoU>obB$T-iG72`1?JMyeji&0{3hGy#9)mld| zrj;1MBtyOfWeiILkGZ)@`Xm^5vAZC+6tIQ_`X)20O&pAkrlAw1ahM1nZCDEk)N0S& zweC4r@A>q+&#>G4HsWYVZL(t_F8)FvgvyhxSMJrYMbh#Rn08x4@r zLS^16OA7|xk@c301(Axa9=z+Cnl1;_wHqUbBS7_*$=dGJIc_bk+4I^HovFQUf*$d& zxbQ*c{-BO*w3*r%D;rf^srbcIUl?LkZ_l(%Q94ecZRP0DSm-O894waC^TMjuXuE|S z_UL10K<}3y9oEZb&d$-2HEQ9#t724!#U|oXGQJ-1cTR%TaBKV5sCcE((TW@z8l-3x zS|z;`!hUnum(h0`vXIfR#ZXCJi-f74Ik_xHi(&c5e~V4=Bu6`+eXCCw3n(Y9`+dQ5_?hEsmVJ zdq_884V6nMU{2}xDlFabniv-;UCjd0jiFwq<&f!NEmP7c#ahFtxO2vkTX25PhT7Z) zBWo$C%35sk0iH<>`9xv@>d9LO>eW%J{WH{|&9EHzaZ>~>UV+tjrHLK# zH4AVIxJJ8XhlcR}VR3GYg8T9-?yHshWp(b)_n{QzJs$n6x<`adeBXzXT~4f56f*}l z&me?irCPciCHcbr>@l#RrcWwJZr)1Ci`Ta5lt8DEIh0V^^`xgt@vmw7^c){)rtyi( z10$>qPqoNt^*BQ=w@)D(nQiv^V09DNFQ$;hNi*bJjFrnX5Tz@Vya*`Nt7Kf1 z9nAD5>9lkq2mDx)tYw;vOJfLbx%ri&59f0^u9C*1H^Xo`>R>`N!{g06incl!CC0wa zDOJA}8e_XtZBBhRW+|F{QE@x>{Je)|mobQp z#qFF(jRg^fmSpr*RE|ru8q>0?#vIK3dv%yKRH#xt+MV+YXO220NltC{RNln8Ce_PU z_I+WC+k3BRq|LAHBBV$gT;t2i{&RzU51zNY%ckP;mL?^3&Cviw0ruPwMdO zkjPNbCeeKkroxXoiJs+F;0cHjFO6k~my#H15i6Nm=wvbhGu*QLxkn(~#u=N=iukGD z#!$+AN@|Ugv5tlNcRbcR5 zaZncW$nmfYF;24%lCGK6QG78&$DnGGELX@IMLQ_x?Hhf2jFTjHX<3|PQu8b+a?h1R z70cG37R(6RpL>U{9LJR0e*S{G281YgULc7lo@b-BF#6Pu`BoYGkA+ts9o3;;a~!LZq$qKw3t*muhMnzc1s>HAx6WHFCKQ;EDgglx z1jg9W8BWBb(4O6tLmTk;M01g|QlRj_Dx)=36H;?O;*dw+HV;l?m1v!z1=CV`_JU)Zs|{E7%V8bf421(nUmIJr23UckWSEh+bIZ6LWJ-q zmK2{dRk-}AUEwTugA7DXD^cZvo{V+p@V*mO-cZW!cA5`O)ADvY;QH~UTRY-ht!uA< z#YHm`dtk5?IeTS4yo@TmG+8H%Zy9-Noog|Eor5DVLEh%!y(w!t(j+59<=NeaKsQcvuv_~F}H!0op-BwM`)prCFD zTk>t{wC&bZN-`VxfL~~^je=FU` zu*?^8^ga=(WBVkO*HB(v>i8CbsFSC9e4{c>xcP3|fO8T)>&0rK-Pe1M-3|!-jT#qYNBG!sf*u|m7Mg&2zb}WR#bBOO5B}+2_Cs=KBXn`kwYU#$ zIO|mvlJ8_`bMb!c@9^kQQBDo6ud0IDm9E|V6#WQTAMwK>(s{+XilDxh2W!QKE`WB( z=))!O6G=)xa3%y}Re-|~q925r>ahvLudAOxFdxn#w(f)X?#L;1AJ@>%RG0AUdxTLy zv2vU*7=1V5y4m61pQ0}usZ1S@xF2N|`?d3AFf+MCs1=_3YJoYe;Ry^=I-Xsgr19bQ zlYE>MB#Mp+zt3{mS9XLH-|v{F0aAc|w|Z#Wvp@enqKF#NKC17HW~aeNu)e^wZ1^Xj zD~|@Vu62D=XBJ;L22TvpLt{yVi^xbYtVm^9(C$L-yRrHgfpJfV>5&C)GpS5f$c zU@=gQ@B+!_Sjk6_>@~arOT#@UyH-~z_i!}0(T*!SqhgV-(7CgiT5hL{1Rt1$5}ZOS z_5CMM3K^SFHu4T^*Y!Ox9b$hIXRj0>JxYCvB8Y+WLQpgxp-YFlJ+~-}607tJK}0DN zl63|PL+cj%v9)u=9z-%`q7MxrzDdyf3etbu=Z7XGHm-YN_f6v z6bTy=Dsz*@BZ?rBdWdl&k(}`1amn*Y5TPk=9}sv& zlEQQ}|Jd`SD_dl6^J?svTb9h_Rnu`b8BdU4hz10(R$Z6hwf`s1<6i}LXYpUx$&WA4 zzYc9p)BmW%6liQFQUax1V0x3_1XEtDJZ_da5)4I75joG zUvlj&D!EGCx%@Ijml}qXQLxHo7*5v(g#JsJy0=TBqs`zs-z^O-ox|ErU7Xf4Jv`r zQ|@5YaWz}d4du5_ zL&Zel(dQ{Tnm2e_Fs9Z*4l)adk`q#EkuHu%>e3;w)d;fNvY6O!5%{ix8rbg1aT|q1<>W&+|cuc&x_z9pU~_OiCP>s?hAbfyy?^vN1G>TR=sXp7@Jk0z4}oeUm2eBaD7wWN((B7)K# z{5h0Hwv6xhFxJxjLf9GBxzpN}#?xjik*upp?&*1im%P+5O44cFSVzMY<$+V)&f`la zi`=p3#mIOF>z{Ql#-Dlg;ThjWl6xxfRujE}N~h8)RmZq^+-K zfXh$Q_-pRSCss${(B}#aH7b{Uv|X&i#DK@EaPaxHF${dGU|PV$&+Rr_b1NpAt;P3D z)2&9)i6Eu6o7AsKk>x!`0&$sc>npc}o3JBEb8`nv4}hEP2|7xHzd6!j5kamrf?`8p zw1Ch73yuWz%HYMbnthIy#56XihRePMgta1N878)A*V#|&Dj9oA>AO31NK?o54NP_m z-t>huHE`U#xpAl9kqC9~LqpxC_Tu&67YDG;H6xYZ@y8tk=E2?{0a{ITEoG=-uVHtU zqdCA~u>KL6(ZcPOaV)LIot{Y#4G%SaMWphWAM7ZjS_^;1x?xGEwItKw`6cl^%Cs~O zUC%G#&S^@)Bh=W2qz%fa#?iyo=;t>T-HnF;@d{E9Pyk6g1gh#$<4D;xOm&^SN%4J| zlIqP1YZLE0AJJ9<;cV?U~iTpphN7QeSpO1Ed#17FfotV z9~Z5*r@H$@NVamY%Q8C-QD&D1qpBb1dmIhOokJ&%}98Me|(YARwZ9_ z%V)3sqKR+4)*fbf21KI#ZUwhV)LJ{6cWUio{GpeYyw^o*rdCWO1IpBTx8elTCete> zvB50Ue$o9v02`~B*vLXuyVxnw?CQJ&+Gu0j(!7;g{`G1XRmbGIuWaICv1F5+ZbR|= z)xE0Y5^pZHli-}9{~4ke5wpXY*NWe-@6{LBY@7lGw?YhPzjt;qYh1Kg&&kHSr(a5=6X77cudK_6f3?(`c@nt(-Cx(?%yno) zT*h_Mo`n5P1~nEf5%I!5B~F2NU(gf|Ca&z&gEZ#q#%O%NdK(!!*x%%<}Kmh z3^&fjyO=^}%+UgRbM3A^R*$NM}pn7o{^@OxTZ8u5|Nt48fnyol>UHtQOnT4I&<=}g0dzDKuzF=ej+|~Rx zGQM+s?^?FEpbi_vp0D7LY5=yYDEOIm2Cm3yFOcISXfIo+GPZn*cX)zRc36YDYIue# zyy+GQOMYW3T+nT-XpANO>g~%9GX7BegXQ;;`r5Mify$L%N4YDDogXZVuUWYAhYqQ& zu){x`zg651V@G)36ZiG_L;qs>2l?xZ`LD*m&idL%aYN@tVHS*1KiTnz%a-32-BHcM z_v17g+0fJvm(DDcLDD;(>!c~Owr=Dz$=v=SWnH|SPzk4wy$ph>~D1KFHUdYU&YORs+x?aA@_JgpUFn5DG+(tUBfHR@6M$i#p#<#Su$eEV|OrI9AT zjlDZQJsh6j8dmwHDrs1I2NbJtZeepklUw-et<|?P{M0%G+8kG18OB!)a z1<&2h>c$v%r&V;{9Z7RBMsEDWDzZ8(tf{fL+w?QRSG~idVjY&=(=jyuG`byvaf&T; z*aH6;u)oT`8uHw&r*g;ICYO2Fr}G;hQ1jCMUzJNZ>Qf$W#r|g}C~b?60R-3Cho}&j2F2%rT-frBD==|-}p5yw?EuIV<=DU_=4T;+9j@P?$6{eJv5I{i6!AVkk zFqDL;B0LfVAVy-B6=n!lyyyWO@F!gNM(VzK(o7PXYe&+?%nNEC@?T|!l zWbZ17OQ;xK;!=JS&Vc{M#psnxJdYF04M&Da!a7S-bjF0gg4aw=c`iaIP1s%+%=@&& zwn|EsCRnnFtf=3*7#<9$L`u@xp9J=)OX?@6>m%6?s;1yk(a$XN>@!LL5={~sdzWE9 z7e1kpv-k=>PjVc)B{=$T?~n}1>h_p!iR)NcZa**Oq~xDEleBE-k2_6x zlC1kZ>)>b)XXOx<9|)tIShDa@KY8BVqbZ%)7f_K@GqVbF{Le>o_rGQQ1-)dTv(0t+rV%c(^j; zp!X(A90HD4Q>SL><5In6142#)&t!&C$et!vf1K&RW6u~?c^p&;=1<^R7pqNVG;9yL8@@NhcO}QSYIm_u8>>r?Bn)C-08v1$zY}v$StMr&hJS)tM|(Q&?oG^Y z8Kad{rb=$`TTZ+EE8ZN_`}dPM09`}Mc`PpGTw*6FUX42%8pi^M61S2LA9^rYD&K-@Vi0pEkv$uvv^KMM=t5q>H*@pg8~HSs zeybqgz@nO2$4#q+MZnI{LaLqrB@b9uaE_~+f7Xa63`Aqq#IGt-@2frP_9L9St;}0^ zw1F(K;SYmXGw!cH1UWpU0cDA4Z8{ypQfF^3h-#fk(*z1f(ahpB^Xsc_;@rBGCAoTH)o(-aY{#yDbP&xng`dqGCIxn2~ zM3PaETXytv{z(Lssh_z^HQLX@dX$Uno_{>L#HP{kFX1%G4t za3)FG*>xOK9i9{of#v`|ED+!R9h8HuEcs01LIF|K2EiiihphggEb90fIt9NZ0VYUt z_;P&J4sax7R{Uk$;(@0`H=RtwUhJ~th*ZP(j3?{D>())ZyCZAoB{sTjy|PzJ`HcG= zajQ#S6ytzxO4U9E9AK$fV%CFG{oz_6(|VqIyL`fB$mVUG(fo$;Hu`e+u9YNArU7Gv zzXZs~9q89M{~xij9(F$A&KioB#p!85D=*%PH2uD>wG9b`04AK#meUjPJv+>mI$m7Kck>CRy57d6rtjQ%EfXb8L z^cck|evv!teR26chVv1#6~vj~s@TL9Ac?!vFjSF5xJ{+3d9_tA%W26!mg2AC zZJ>T$F#M)qTTSP7au%KJf-}*t{j5$jW@qpDBuixFTbVWyiTwDVlM?uH6&RSf z%%q}jQ3s#uwFN&9evtuqkV(aA) zn%)zCGa7)GU&KMnjKcSjppZ*?gIZxtFf{pC1zklXZ$!Z^ zDNbvapWsYBtTL~et(q6;yHVM1$%%-AZAy)d+=DyQ&dD0@SR7C0w|J7oKwW4d(bSxo zTBEHI(;BQzCpI-Lkgu1CN}OpB3BixF^5w~nw{uk1%FeX?6v zq%?2wqMO0DKgxUF1vjBHPFWM4JVDDuO>S$G{jBD3p5A2m_Uxb{zYi!tozbKsurXIycc`#6a@B|qR7QUlYWN+ zC0r7`Y9F>k9v7&`M4#l2y5JQu0HQWyZrgqEc`9f@nyQguR%4tAqgNsLEe|XmIs=C< z$4_2YP%^h$ssTkt3-Yl&LfRmaplP#ZTp}ffz9dYxgswKXc#7mv9JXgN|-7k#uyY? zh$4sz$dfzGM)8dT1p?H0&!J!;z`nO9b{)PhzQ}eJaIC8u{ASMH`|SK@lbKW>Vc{bR zpYfr(jD!-Uq@9$3vp`ou4l|~<;b>kBR7PRg5(rW^tz))>w>asH)0w(pZBayE(xeUY zB+804(+`DMmM$!f5m$YK`nHhM z;$bh^?4}~<%&jkT3B_$0&R6R)E4+(qOMs-T#=_Nkwz*iATP%cwpnN|VD<5&Q47$>c z3v}0v2B}M#JI^EgbFx(xgj*3-$xmb!T+O80(Sz{kxZ;aB$%*Y*Gyj+CE4fs@B9X8$ z<+u0W=PGAPTu7M@J0NMqn5)z$VZ4WW9+H4rukMs9!j)5tVZrK4z|duL9~B5De2Nf> z&|8>pAj;Qw$m0X>%i1e%Va>cG~Md@tXTs_)D#cT0~0_w`y{rM63PG3Gt^U< zmvPOCGt%qJjWA~(yf9=cXdoCc;jAfeUz@vjFog=gNkK`ysNk%wc$hbrFXk{{seq4* zE(4UfECKBZ6Y%e-^JoUbY+B#csKhQe86RzxdEF3ipYFG>d;Yan$AYQpelPXVlVbg? zCbOxsrX_HlbW*1X({zjj0i3Pq#2))Ga_WLHy))R|JvWw&m63c%&QS>((7#1%~3Z8uGnJhQu%9x{+=HqCekrA z>SewbD~}8&fIgEdZ2l9*TMFk(PTcE};j3>a!t;K{eFRs32P7*wq*Pt#T7i0Trganv zsw{~VxiOWo>)|6+L}W;0%<47fAb8|uRD4}4^`B-qfA-KiQ#|od31oQq?g+NBESSs5 z$;f58LHm^*E@dRNxoS092TY+Xu5H$KmJm}3G4<-M+sc!>1gI-zTLJd7S*o|Ob4uL~ z;%->~aX?|d?HO$+R9fTiw+uJw$}AmhDjG+n#WPY#$7ohbwy@~5Q5VfD#Q!&U7OKpfurU7yXckAA85 zrbjauvbBMGruZKaAuTj^$HZn&g7+d}J`Di;_?<7N*0{y*5q!6q>d#w&?=+#wEoz2_ zDciMj>4=_Ly+wYtsSog}U&0K>A(bR-f=Bg`sSY0mhXg|$vw6&rgbr49^inPMcN(}M zN5IfY0=O6ke$TMG6ljBEja9qph z^&Czn^+Lb|LiL#&tc9jqJUDZCm&0))sJ#=u_0np(3``LV)n>`A zC*m;7$3XyMPL^73oWZ`b>QoxB#r>v|Ba0vTfg}EKS6idjrvFa<_Wqw;1U}ShB+Yex zwPvdnvDPxJQ|38%MpISFecAArW0OjNAG+vGODZ`Q&jl^W5QbjgO^T9LCczE$Xo`Q9 zkG!FZ*A$;}I=l0OH{W;RsygIwbg1gN#`<;-`E3`oYV(iIMi$K3{V-VH*t%o^(5DD@O zM}ZbI;acA)6aZ+}y4ft=B|gnrgH4YFK~C7qn`mok3G0-BXs^pc#*j|oYppI4Y&UY> zVH=@QPq&2Y9k}in5w)2Km>2-G*n68f9bVPfH6c@hS|5qpWVLMiupc%70}u%vSo&1N ze5=nrLR1D*ad3J2Dw{7KxnD#o-$4-O)Wg6)WWtB2t%hzU9K^#H5Bd@o&}To*^UaF; z3A@Ej?g&~Jx$xFd+DEhTmu{TTY~T~fuB|k|S&U7H;kFFK#WwB+0|81o$E`C-M%Z&; zER|hP^>YG;cFkGzaJmO`y!5o92cQa8kWm{qLm08hOQqflBP_SjLt!a(0cJrB@Jv$g zp@o#cWEhG~85C!tpbA2*FfBYlE99F>G&|d4=xhrrAh`%?Pe)i;9rO830Lv&FZI4YJiRoYx|P0X1GnJjd9}FU>A!iRBuY8 zdm16-G+=r9RZhB~>UaHm7pw6EnEpn=5k)@i%$!qJx5m#sa%UNmqmZ6>qVd~R-8JT? z{3=Oy5I};P;VOpk3~Je}Qvb4yzGB5z!Tf2LlNNyewmLbP%~YJsAau+oJhUvH4kn&K zQh;7Ybo3yYy?Na44d9Eq`Xakl(IW-SMT@IBP$+c3H&+c*s-DutSP`hc#I%>R?)p_= zTBxVhTSPE8o%D=9K=3|U>IGvw_&iFS@$%sK5VSGc$5%6zj-8KrpL&OWdsr`dxNskS zKHA?QZEBohD%IfC^^x4U3vft%RFE2Q%qgvGb_}#Ry5@n6rS$4RZscU{y=XscPNKbF zP3bU9G@U(Mg>8(vzgAwmaD6e%u&Cv)u2_E!kv*DM_5!OEACd0VcF{VhGPhVBnqClW zZLHw$g&8iVea*mlpXrthywvRE~ zBkk}Jr*S~o=?J70yG#K-i%t#rGVl^gzV3RTq)yHIyFz?fHvRy5ow#7_5~_*xYm}!z zL?v1DwTlRR>7m$Znh3NwivdVXcymr5LVqbf>tAw)179Xp1bA?Adxrt<8Y$-%2uUuN zq?f|82ko#3Dms`*Ri!$pt5r}J^4TY>VZgjP7CDxgV~PE2o(3f?q$gO>) z=dIt8jVA{;A&HU+k<}OVXLOZZkE}J% zsZWcb=19vmVZ?pId}vh()mJ!Pep@Lm1N}ogk(Qw#ma0e^ld3W+wJQd&)w9jTLwilw zGtt37W8o@t@>+kXIhQWRoFGE=W9jhSuQ*~OD;SYCJfW&-B45On!p+VBsYz`L+0O59?kG*UX9e3hzQk#+*{fU$wB_jn3me1@1Qcx zWu%E1<>EL4FPDCchszD^g3N^U+lj=c?VHMfoHl>&zeSO{LHn!ne=R>nARi?y0CalTEWsz;&@(+uQFK(+aBsk=Oir^(80;E_q~klvS6R5Pk$z?<@DN;jeCOvN&{ zD?m=BT%2bzh1g|?X&{Sj<-HhGJHOdUnP^Amyov8P+IxbGQe$9#!MP*`9gO{$waWzwFM(tsEVrl_GD35d`U_IDx6M# zN45_qoX%wVnPovHR$d8X{Ovt4~736Z&Hn<9HeW0ibFJ4V*Ad~obY1{k=cF9WT5xx z>sQrO56!^4fCwHb#$P^~?YvmHtU|q)lf`~3!jun_7Hozg1>lQqYcsKyeH=E6#_vC;tPfVUU1867j)o2x=M`weF~D8{W;@HHHzYhDXoIEcmw_GM^{h?*c$SN1gU0M zR5#d#6jQ1!x~AVS%W%BLKz4E^&=9)1g!KM3XFyUik=rZkJI-R`cCCP*#6X&s)x*Oa z?$wL#RWrB2TTd1sVR39x#2ZdWZL|0}P1$l0^aNB8K3B)%hLMXrgtc?*R#!J|R$e&B{esO^pQZ+*WNHB#7?zYbh z^LGe7hCc<_b2O}0;lCN|qw9sOtFZAD$ zhC_Xhs&Uw^0zA}Qki@>h+e6J-QF|7cUZ-MvgS<+8j^Ud*e6!#?A;VWIh0povk-|9^SF*{&{FeVJ!H2b=zgXberW;9dZ*liC5DrhkGV!LZfnAvbPQg+#^fNxdZ;9JQh$l3?F z3No6LRkh&5gTBJ+Y~k#lDzT9Aq#X{jPsE5hT&-`1e%a?W?-xM%pQh6je{73$izQO2>G)|33RvACE9V!cu7YFQ^1?Y+;Tk-0&K$q^|2D-vk+>bAdjY5g# zfKiHfPl&^DZl~Xyv04qNT^GV7S8(S_Dn-H~r#1rSOFc;3%Zh?LtYQ`op&WIby4G2Z zI&YCE4?L@gyL#<4YSOHx4;5A!O=~vNTX*|hE5dXV&U`L1wk21 z4CJso7U{&+4{!-+S*xd9fsY6CVtx?ByBuaNRSMg-hp)QVH-o-)xwB2>%>$)qxVhBZxc2H&bgeRJtaj2$+=yQ}=lehIQQOGm5Q&?3?bY zaHSeskOYM7)wz!JEFNmmB27jjGIVWR=ZsU=c0@zORT@-v3lWfj`6DO6Ams4Cak;{a zJhZInfAID396VZY@W=Lz`fLRWh-wkmYM*f*i-vK`D+G?kd1-@Dybs&~Xj6Q!PfziE zAkVV_C=+VO8{jemE);ghFYyFsD3!J6rWA;ljWLs9glVZJ zf?EG#Z8x-CyYL4)%qBdki)hLR?{UL8ZG&ulM3`5Zw}JDTTJb5RonlKUMYlPRQq<}s zZ!s~P+2Q}P36UVi^^Ca56l+FvKzHDx%x4%8Z$Sm54BpE~7tc?;>$&Z!TxqWt+pRwO z^!H2I4aW8oLv6;Do^q>yU?->|W0j)1r8aT`&TKZEgiVRy3oibBRq9stwr$g1PAaL% zFeN4{rUD;SCObpd`l4wlHIB52ReONOY&)xPC`U1+rr5>T@;<@>%)3B z7Pl5rQs5uq2QgF8=cb9r{&bRWP#nxK`aj>Jnk1X*7~Zd8M$xz))QS_ds$k?TQ(}{^Xi0C6A&;f#=(G0p`DW8ec4}+U8r=bopb^fAe6EL=XYzfz$m)$ zng?g$l@5#paMY^ig4+oA-<&cJVY}%Z$AhN%_f3F^AJz3?jOz@~ACqs8JFlp6*C1hW zG-#RW2CxA3ZQ_N_X1k_8Rb2?hQyL81XrZ|fWY@8nM~6^@GM(0bZY9&&gayy6kLISmI| zxh74sn?PTa;=0;vJ1w{nsd&x~CRSx~y?~fT582IcL;$d0N~r)t5ql9&H zQK#4^@feUCK&~w&W;#hVO-%3jTpI<)EC7p5X);_T@f@46ll-it=z?AqF{>b5zm$OU zhzW#Yff$QcYXGbL{+@Q1_w8g>1>pL&+_FiiBgS%^@53h_(;yTy)zanirviq-cIrT0 z^xbX+)0=4402G}_9qW`p!kCw>e2?Q9sj5OL)2v)E_tFb$M$V46B}X zrAvz!uF&+3MnGNF>cW>dw|qBukX>_XA%hf|d*pP60ND!L0DK`uBNk9t8US>paZ2|X zgDP(`5?)PEuXnr3C`WWgm01jcC9?9)(ytfR2x2uDNt-K|VCxD<da_u2e9LVpaRIiRT;k@lNnRcyy zvGN^ypj7@s?Mr1CO89ZhZ<(O1$<_G6>!!3Q5UseLJOENyjUbfj6$8F5u<%+@~!H|+ue^Fw;zJAh%o-|IK4q7Bn7e5|yZIo~C(^epn< zQ}MUfO}mFkV2Ud~Z~>msBAVJezmB|^YxOJ2QLYS4 zZo%tjnw`tlal|orPKao}WH{xFbZb`iVnO5aQ-&B43(|a6#&|u3g`As{fR96%6D$~| zyehbhOFO)2g`$qaj=#CDOykAuyds9ZmD7^7iIH}7zOvGcImYo&WrZkrbqgdk z{G)so%YLrgTGerBxQM|!$ri_^39%Icn2l(u9udei&Wfqow1DKNOC)~mO9pCkT304M z_}-_V&6n1=s$9$7;+0+9rK~f!Y8I66TWsBJI!;I9S2I5?4?`c*QSyB0ok(PoL2+2S z)3bg-*C+3D@Q*WOM;Qw}Yf+b(@D`T@B%@G$5eu$$bDHHx23=tm>kudA>2k8Bm?`gH%rAwiv<>NPR>@U-!86WObKP?$ksPR&Sj z@5l5lqb(){4sbr57~T7HpCmfnYGI#o)23eJbF;a#J`E2wzezC4V}fAypQIWoR7Kq2 z0nz=WsllMCt2Vk7 z{rBn2xuhSbu&~ZvvhO%IBQD5+4^PV9WuPmxS1*2eI-%(ZCvb)LihDLUWnrBZACyL% zk;mpgG_D}qr;5eFOS|YM-SJf0i`O?lq?S}W%RHRj?g+~&t?Bi!4?`}k)aRsAw-}m( zMfL8n%Pr>18&WaEkXpR%J>KH=&8n{>nS{@^eyUrl?(F!{R>=Aul-d`?J4>#!L|TrY`Mh--gdfaR20D)quNZ?>8JZrvxz~ zFdcD%Y3(;$9C~>4b~lj7AhIa845CtaZr0-q!rQr6gdk@vBCa`Et7ct1Dto2@xn(lB z6SvXjCtmjB?Tz2@hF65(DCmC7^wfqr##g+qI*9_;r|HeAmAVPy=TLj%YDR*;tM}LT zvwv)Fer`YH-kvV4C6tW+U20oH(vwG;EILr?|7q<~f*DlghUqkEbxPM`4wm=67;!;bpH< znc2eKc1BBi7Uv-v{!yiQF@AfQ>CR5vjfPg$%+%<%ZX|I|nQS=;f48fxke!(e3_h#} zfFEi{5l@8^4JA$$X#_WPJd|Xk2Hh<;)t`oU@D*`d6O0R^9EpFuP*-uCE6=LN+G=%N z564TfqSx&a(5Rd_`s?1T{^S0OWECGa7d*1I^~@vRj@R`IeWUj6W}mr_;6Pls$G@}m zz&rkb-n+QFy?<$;;){+hZ_p8fnYM~s@k}+fWtl_Le##^a- z2@tZ%sSrXANSEv^-v5h}?(aM4XMzGma67p4{x)vw^8V_N`2C-uX67)(! zYL}kn!rasBw?fBuOqtB$cO!>+q?>aVTc)*mSVl_JacT{Sw^vk30WXsSS4!qCR=AB^}yvaTkHDQA6SUa3I zcq{dAXH2V}gSUgFaEZ2$&zsq*BxX>VYiRb)wNtd>Ja-lZl^s{-INS3VdGDk#x#L00tT_0)(ZbqC(W_ z8FPxaRf|x}F>PY=kRb)h*wu*7$m2^sL;O8C$s>C{4S7Q@vy8yFHigi5EN-N|e(#~_ zxN8L5lbgS2v7z%F>6zqD5;rZpfyP$E@Nem!tKC-xK6LH#+IVW-gzD6oPxM)@j#`z| z<;$^a-ogr$UewJSE^URuHI6my3;2jT?ai{s*RAl4 zY`TP_Vk~N``-0=NZ?)OU+}Z$!5pM8mB>;?cc!#YAyA4Cnu!rAfM+|%w80-GWs&712gGH-%Bw!S+liD>`@eLGw`hH z4?1;&r?T>T>Qq^lEi)WvS~hj-*WzCNPJFnd$fgY+IA>(!L&ERjSxgKN4ZoI6frgPp zM*Ze445ml9!q=LAS?RoZoeBT7!7o0~1V90(`-#`z$3h25h%1FOLp5Y_$3lARQ{TYb zRi#tF$3T;`QVDEY3gk-Ya+tgQg`Qa#*f%6P!JKjrCEz?PZ%IFJ5KC1Y%5XFZ2-L{F`XGTXk z;`6&n>M1xMebYGutkc)yd|xWER-roXETr>Z-IrVYs{6a4Ws7eX9#+??uqMI9$+c6N z%VP#Qs63?FB_dQ{)fHnQW4&fiN2IFx~Mn}{phUAoCc&Pdbm+Z->1N=NFwE~C0?Sz2^+KKtpiJj z^%)hkx}pWKs8EAEcOAo>%B`RX;uC;Q^3Q+f{3+O86__9^CztlEtwKo7TIE-9^WT<) z{0;7SpYS~(cnht}dhNOK&T9hUTMaWy`&SlJvogSww?K_Q9=}>J<+s;}AMcBSBr7$I5tz= z5PS4eGAt@%Vj>GQIyTN6;3D*I5s*d}ott=TX_R~}`;PKJ81m9K8vn0ie;#)x*0|NWxwn&|Non3m{E_@aEnkkCl?*AJ zV|x8j-cXmUV4{O67;94%4Af1v`8ncHxt{4RV3Or^yBn{*WhK?>TwQ(5O04_f^8dJ1 zrc@e3GMfNBUcuCI>srMtLwK6_uNj$+LVu%CQwLW^wl!--0KXB>(mQ>5#7dc_c1q0`JE#^n`V$bCmJ_BmQS? zSMm>QzB<8=YgaL^?#O~HRNc6#jBDDrw5tt4c}Qpv6p6<`J&Dp5#t7VaR)BUF&0e}` zGf)-`0sonp4cD$cKu?lh>N(6WZKW&x46a(Qq8tcqO(h)Iw2 zmAllqrrj{Xgn@7q9;U`PszU;@0B)`b1P7Hx^Kw0EHDU64NtT zfGJ>K!(ZJ@%GxNaEfb+00*AghX9vPFg#@YvMwke>9)vV@fU ztk6|0q)&43)AkzWt>w5aq#*Jlpl&^Df@@oR6y-P-jADc0e6I_^{^6JQrWZ`Tdx8hH z;0g1(?^t%y0g?IN52|Uw{xa37%U1>%}ZAt!c+sH4xkI#?5rQa8%P2mETEyX0i8f*!adoPi% z&9g)I+DwJJ1;K{U&@#Wzo6rT6Fb-^1J{^oEPsL^{FGMB2pEunS&F_{qO^Wj|N5%Om znJE>hBHt|Sbq^hsu=gZGZRsIOoo0YL*Lg=`Zf6vCXYr5EsE9A~NvPf}E$`7TR9um< zw3jpA<+0e*Ow&5W??uZQz9#&eaevGnpu(9F85~=Q^2pY=0CvZBzoJ#GuTpw?x7>=@TjaoY)a>PB=l``^wIy=MuGvm{M)ST33oLbJS_!hV)ekHzrPuai9 zH*7W7S@GgFY9uZfbI;$@h#ME5XtUiyIt#A>BmAA-$>CsiOOmg2Rx-JiDUJ^UIJY;E zBZ?lkCNdP*5zsN@{^Vpbaws*uXG+C>;K>v<0WS}pk;-gt2`*Aq7V1WNcR{nD`F`DM zyOMI3bA9*Le9P3Yg@51Mf~6VJ{myH$LLSy5WRj2HzigUNqInCiwk$aDBkL(!6vJ%7M!o)4j)wl7(iXDHI@){y3m60|fz+q!`_>6Dp*->s2#-9WS+yXA zv7o2krzqYw@oM|=F59}JMUV3TYje4E&dqm9^fd3~Ha)7X->=EKw~U9kD3n0OM7lqu^A#KKMU$e3{^RQ70;+yPv97 z8(HR5z2k03*C-nbQ+BXB!iB=r{hhtTGD$6pcQX%CvhoieKQ1^#CAB;q=l*$jQq7#VK=c18E5_iH& z{VjAE`-&sR(T$?4W)q!75)n>v6YNmTU9}0bA0~G#M!9ndv!01lGVF$CH$nY3i4e(- z29Dh&Nz+gJHtpNEN+}+zRQDCOAgaak(z~T6kGtBo5Wk! zs`F~6glv<0@j}P32r(S724QW5D7VfreTn$!fjCJao!zK0*{os7W7IimM~6I)c^v&e zxfMbY<0;*Ty7M~oIKZ|axg}7>H_#wz`Apbhu$BRmi$yN z#CEZ{yZ)%R@7B8&cnG>DeiT}Ay3~V#aa(a2Era&EFI7AwG;|DCZ@xmC6If;FqD6G|$xIF(ftT5~z zGv*=Ya%Zh@?bE+!Td%ZGY%n>^4*M#TNLXzWW>;4WMO8JfVbg7P*%HP!o1>o;yZ!GS zZBF6??Jw=wr6gQDez&$b2+Gv!QEVv=#{|iNj>DwIoIFxG%FgRc{0UOES_<18w3}j! zB0Z=FCRi$4_-EAd^QzmPTe42D_Fq<}BgwSa~b-U@AavKN_B?I9F)IwmeD z`U`e#b@b|wv2i`n)*+>Qsh(vlvij55gojZ{Bc7t{UG{NPN`=zKwT2G85jKPG3uQZw z;iAmj^cVM9;$W7q<1O{p=2q6m=BGQ^~B&JB3v?T9Z@puJ~ST-$+Ls8*eGCsGlAk4c!`J=+%IQ4c7W<b6j=i<;eCugXNK#YP=WCf* zUK9yxA$%~@O!x5C`jNFgU&ggYK-|m&u@F(y#8_t5@Nib<_(XcLNkIXfuFI#)Gdzo#){o(kzFQNT9{BnMiJ(^|sJN?{kYM6zg1Tq4`@Mqh zbiY*nnlht2dITYMax0`)pUW6jDt2s*L3;$dih5Mj(L_B-kJJ&xa+tD$OQa1m$hkcR zZ5Qq!RooGw#PPDTV|8+_!lTA`FLnb)QHL#v8Vahb?`qGVK%{?%l5R|wS)-h}RSlx8 zj73d4jRe`Xq(~EnA<5&`JYY5Xq~@H9LcZ}M>JKllvxIM99HoeVl>X2&w30n^e<=|D zk}n7MAW%?|FC$KE7|+cO9raWhCs4VL}2!sZMzE8HkNLX>WavghAs?43I}YBmXCdo^22mb#gX$g+vcf@>8w z{Cj@`!*I#8NWFq!*xM9pm}&|oWJRoJxe|rEx5R>8ISylfT6$jE+ha3lU0P19nfU-N zs*9qPP?pe(oJ2(X7G+*1I*${(l2D#dEzY?HFShUjAHe-hA z8T4K2o|t2QbLs_cYQUi%B!%@bQfM95-3j?ywpiHiFv~zGFB zgQx57CZlW56N|XSKCau|iI~}nmQ?MmEtl@0vWc`DsJNL+?Z)&m=cWne_x0PSo0_5X z&``NOiUBcIBwK?%^r#GZpzfl$f~D18hTD{&45QS^Y2?Gw7DG60MBgLpHjS~)}5<8~TUnJj{Fn&=AVWO06-I0}y;g(~|=VI0XB}R$_JqQy? zId1b<=$Ha!p|i}^*M!zK%`(xM8?DzW)kxCXZW9U8;aNv zX3x`l^LpOYJSl@Y=Z^LrXM-vY_Yf7k$>~XpOmK-eXffxMWKuCoLya}n7Xz>owrnYDdl6G zmAR{vVn{W%G}ejgI8nlP>i6db=kH0M@iR;OvNh4vymBPpWsV_FF5!Ob5w`^cD~)0- z-HBPArdvMV$DylCW|O6SMsDf9SKkxo%mnW1unOpaiaH?t$H_c^T%RU@iL1JEiy#x& zy>nQ#OC5ELbUv=J3jX^97qP4XDFlN|VulfnQB<@EzV$<_P0sm5<@C*T&nC^5(|g)Z zgEN2%)UHO9o~f-v=?zfVF#47zW)w4$G0Ib~hmDnt+dGF%mQ372k|Icv=bCe5;WVZS zSdXs4H15Y6R#i}xG3Yy5FJmr?ua1|#6zfA-gp62KF7ShncxXbZqhhxp_khy`J9?#6 z2L&1YBLb5-+~WkWqz=;7AtVF4Ju6$sG7$L91Q3sh@6i(Kn{|uJ&HfrHIe|T~*20iv z{I?=YHVBs5xazD&mE@Pl9{o{xrM*29z;KgyNY8CG%P4csn{2*Y1WsRxS~2dL?_)}%aap4=UL>OvJuVwA`!^%H(Y%67yF|K%e4h0@TxMFOGHiT{4AL!wo zE<70Hzj!CTNekXFME6$>1x!~ncIYc0ImZDQE*mq)zH7ca4EP&-=h zE?B6;gp)i*9&rDWOIS9V@E^&Z3Tv8gqkr3U+=-1Zp6Q?Ut?)gq2|X7oXz7hD(T`Vl zj{iMAH+)LK_DEG1ndl?k`#pChAu!spg zI|hLL6%lmDlLtB4;ByU^MKzkG^iR@@K}?Ky)Sguy*CY|7c}~s1u=y#*A(yYZ3gE7iaLa9V2>dM@umA8CjFoyS z5D1@`>hiWiI@O94uYHO)UR1V+Y1rrt`wzb`f@bGg1yD;DW%{m`O+T94%0RakEuR&f zbu>4k{I;WlBT_(;nGt<32{2grLe%EqYlO8mmj2yPLhfHCf%V&Z8`nTkNSHq2zs_59 z`x{#vcH049xVc||JjcCZ%enoqAHen(aQ5w!B~vXucffOkQBz$9ghMBht2tr(r2y&T z`^?*){)fYjIe}}}UnGR>lw@>un6HLUQklO*Shg%s=3TrRnX$LNO1G80gApw8*(m$`-0+noia7^SS;VI z*VkBDRCTDW+WVGPj~)+ygYZBk_n$k9xY4>csQ80Ve`j_diUwCv=UYmdAo65*{iNn$Qj%h( zVdpC%>Y=&i=DBsuafo@g?oY=Mp4haW^ZIL&thh@) zK}rXOz2rpO*;K>P$;0cQV3LMScA`4bBad@^Y1W(_@|Vo-%4Ixx+^W9=gfsc^e&0Fy zc;Q!&yArP$<(SqVAJQnPDJx~v1^hrAFbCBh5;hduBwZdvZZZh z6Ana0U1Jq)cYqwwt}sud3uXIFJM@?d6?-89c;3&79CFf@Br?LqhgO_SLQ^?Kr zy3FPgx1q>uV*rL5Lq_JD>ZDW1=#R4s!TvNp`>FL&+NM?2iF#!hkJKW43Gh34sJ*2S zl_~J!1(Oi%`T4`L3CwcFKnTI6ajobtF7-l%JXDy#FD(?OzkOoW`MISR+?SgUgGZ@S zqd2s;AwA&R0<{mO^$EtdrFR9N!j|lo7pO;oc<(KMm0tv~M(_Ob3j}T#4QhZ!{IQ7o zITho@ke|K4dc0?ff9YPc8>f_`F8txO{e{)eNX99_Iy{H5>`7<)$>eFei5tK~nL|o! z7Yd*52R`4&1wPvcTtWj8cx4*Jn#nEr0JyR$5`$xHf-fh5JLy-F)8p=SX%C)wLsn_{=VOBASEC2Sy+XEszOHADDC(s3lo%XwrG6o@leMM%ZXrVblV7Bn4 z%?Dc2ji3dqE2{G&c2$(V$&v5%@&&}wz3FhvMY+k0R zBiWulH_enG;(9Q<3%eKCafT^)x;xY4C0Ax-bKRM!LJ+ATIEk9hg!g#U;s;vUIV4lG z9lXwQH!ccWW0eHhHM*5eI{{7SQYPfrt>Z9iOakGn7p!!@h#G#@oj0HqFHkGU+0vJ1 z%uKxRg}Wx#a|ZvFO@AOpU*5t;ZWP^du@a+H5^7fn|B%aBH2!AdI=u7*W#!N1?&*5k zxfXl(x#Z36o{YZu)`9dGPiyBnI%ZSIPNpJBaW=WAxtVNKq8k$}0k{l)(4W_a}j42h_QlAy^WcEta&H4)>f#sC2SwV_n3VJvN{Tvn3M zPaX?p7iVCD`NHqN@E`+xXH6R`r6?O1sz2M54;G6j%u}V&GhCSj{*#AJP8<_e1&?ed zY$UR}vq!uzAu*I_l-h3o+q_p-N>17<@a)44ENe3PZP_j5fx1`o$h~u&@efiC( zJME7)X&kcsm9bpOQ!UIVi>#(VXvp%!@(c8fAFRpY!2icooA&c~uBF{c!Bd!Qp1r3$ zrdsg+z3}&kSY~Tt4xtdg~bTT1gJc79~SRMkQbV5^#@F2SI{?zQnn5ov_$uGfZ5*YB<9;-)xHf@=)6cP8LC-TvN)#CcVt) z#M)EcFs6ws>Dw`n-sA{if_kUFZ>0{dIn^lWcom2oE(&QQPU%wCp!~)2YvaW1HbsxHmw9N69rcTj|RXdJjPQQ^%b%XV37DuhXG5az%IQ)P6%%AIb%!F1VE3NB6 zjR)77V@2-hw<2cZB5;wdvqg;+9RUo5AW@ibL@Bfv+L8T_$UFr*ggdzZ<=D52X7&C3 zig90D(p(1m17@90{?8fplzJW^`JV{LIkMudV9e=<_7t_D3avAV1Dp=hf}6(Upw{)I zEB*f0`b_7BdgYDI3Kyt8lu#+vh%~}Ac&jJQkQ%h?Q1+xoWCA*|)&K2{Z&`1(S|pU3 zOxhH<72KL)el?)FqO8zX84W@z5xzq;*O*gQJwIpSHxaiJF3k{J-)+Xzj)MdG>7m8G zHH)&-^M>RDJ92yKQMr`u6VV2$fgL?PwcbIbsD8TTzA@oV0M*kE9Eh-+|nl<3h1BN*&C*dUy92wQ@DJvFfgoW5*4dtk+iHVb8pqxnv&VKE z8~>b7_l&RTh(N`wyId01*T}zL4Fo9li_BD$POwELuuf=x5x}}IjH!_a<!do3s#-n#Ycs{ET^EX)b zTL-spXhl*%PhX*bQteD_t`8u4(9Y=?Pj&U4U;dNzL|&EfG_WBY)7Kq{oIO{OIhxC4KSDcvr${=J?qtiLsD9{z{CqAls_fmbK>N@k= z?b)iG{Jk$Ie>MFYZ)Dhsqmojy!2&u^zzJZj8iS3`^l&x!g^8*3qDSn{%Z%i?$xglJ zmTD+90-c|w>GT0+72?8X8{BasIu}#nG z)6%i&`SL*n&~FGaU9^9@tHKObm@Q`lxL{}ayc+#9Y2fysyx6o?F<=X;~J_MDUjHQS4fq?1UwJ?PzuA=>>@#6a)$3&2h>&N{yk4i#!B3EmWS6oLG>|X;$*L+*EA!{A0C^b^Nw;X{Hn)2rKNo_p-8uAAY3ps-(QE=PqGjMD&G*8V zCeS6EKj-jm-9KYoDA7E`!u+{Yw}92zzL}gMUAbR3?JI?haEp5S3cbPE&(?W6A&@(U zlj=@SY>!mo#9y_+4Gsh*DbeW&!GI;&P`AKD0$@B+``W7bum|?zWrrk z`RDs!aKkj$qp&k~UmiW5_B7pj^>LT$%zo9PX|GGY;)za4n8)j@QQ!QuwD{{H_$r7< z&swB}&W4KGP~n(xHr(mwQm%iOjxxv$Qu}0#pi20}JJ)G1*SFwp-M^96xr5&xGD>&3 zhoTV^g^6U4T%lb-|8>Ji1QM}v&#Uf7o-5v9m#;(jxwzYZWf~yX?CwvUo7tU7$7B(> z-UZcY_{w|LN5i>UuoUrkAKItm8*~sG5+`L&d>yLWs^J!44SmkSGiV1Fpld%0?K^)j|cQ^kky<4P~AUcDvz ztVqxpLCd684{{}BHh_JdMo+%*N5iy;g4VtL3tT)IPrj#5Ly0X=!af~AUxp~5MM?U$ z?^pvD^NaF}&q}595_M%7K(=_M`Mg;tIwu%Xy7bY#@g9ryYSUu1gS*l#nEcEp;l!Wvd_1Q6lZjjol(RQK(^(LkF0 z6LP4R4bXEJ0UTNLl;@i0wWlpXJ8n_}J4@NYIj)jmchFv~PD}T!OKhuLdjxS^Uf(YO z!<|u`9_Tw4i3%R?A6>hpbl>Nv;0sI}JN7v(CX28<3y}8Qw+<=~=je7#wB@X@S32Yd zU9yO~CaFKK*vq5SoIf2<-8MnTq1)5#NC69! z2&xmsnZAc)ot1;P6+DE!rRDU)}y=Qkkgg}#3%7CV>_JMttSsZc6BuB_zexT|th9o;>**C;W2JaGZ_T}cBW z0ccP|qy5ZDqRq+{C?zi!nC@G#*jX_a9PZd${?J@0%12%;wK2HWj+c&o+_6wE8VEZK zYyPKZ>~BtXeRj^@QDfr&ju9+yq$SGWIMinAc)=>O&!RVztKWwH|X`qIoQm-Swr8#W2-Evwdd*yrDX10BLjL@Y8+yr`en zP1_k*@S;-)DddW;9wH0HoV?Q~y z^PHb-UlFx_O3Us}tfv<3?J?Zs_LT@0ot8+JKn#3dyule-7%`6@DmX3y*oQ%L0ZJO2 zXd+FMr|k@oU?Re4>1)5F5bUPt{PJ9r3_TRDi_>&`Hu||!aeDdNl4LmqVMrsU6MLHE zh){x3J8SW!5Ny(?sYFL0jnA})pFcvXR9HTNzUghZV0xX|LD`YD{V_=D3{d9ENR=Zf zJA*4pD}rn|kUv4FdQ>nEtBnB1#f<1U zv1$dJt@gmaOtqVslm?$is2AsF61udawBoU};^bt>{<7oXOY^$qR2W)hsol)7IMy1f zSx0=&DWpVgQc1MTPrS(!f7~$}`%F&>kc7^d4Yuk*8KD8(nTRm?R1`=VoFG z?~UvP-t+Crqn^>s7w3-VrN@|Pl`ED3i=jCP2G*EfmR1hJ&eRs?cGVq`8WoG3m1Lp! z`=LxY-5`_HKJF+I3il&Oc2p;nS4a+kLvpU($ySkBoN+SB25IA@7f*~wyAV7Ga&j7z zgmY*L|1Sxaq7Q)syD`U(mBP+Cv@NAWkg~1&FB5Z06N5oZWAEF-ciGRkTe#WKHjGyV zLLti|2nOC<$L9)(%3*~S`Y+ z+R9>FN@+3+-p~pyz1OtCQqo1JC{$GYFJTee@-oq=TGdpQetsjR68XRSepz{JOjHG_ z8d%>@Wnwq3hiqns&*P-nFZ=Bcw}LK6K51wDNTjmPk0fMV8wa|@w0%STrZc0#%QIeEG#n5 zPG1LDvPNrl`V~S*yHBdcU^u)Z$>9QD5qCVvr9)mwlc1?Cl>mS1S^8^K?#j2}Z@KdR z-#$6eXawMzkdIiUjYLH{cK_Xzcs&`^S1msoQdTgV4S0sXtT=uQ1o+J_7AqD((C9B= z4ST~C6{gt}W^}|F;#36Za^VO-@U6RfcICH(c)l?K$$l?CW!Ry%`NSHy;=;-xNdDQt=(dsO>C#R! zVt_0W<+x3`&M7vWm{^`eNBi<>S9c{N-k7RA#pH-`$p1HbFbCNO% z{4QA|yvPpRqo?{OL7~xp`{u!VHVy7iA=H_dlP>{F#v#)M&+X4Bi($3{RhRu)24&@Q zcdxwxw`o%dhVD$)sS*>nQQN4JO}}SJaJbcr+D?)ZcpTB+K`P(AYh__^QIxs-7^ojU zcnAqm{eD#wI&J60npZ9c%cMRsKYz}TEreqMRtEEyhn9;K8 znwlE+NAOaB&$#w`j*Y&X-f9uZupoGNk=1S&6?%q={q$xUr!;pvI}jr7EAe(CXGrKS zd;eSYl;xWVJ^yHHVlSF^)27XIUOu$M`3Md=*x>{L z*OqdjNxf0rl9O~Gm8kyDs+rjSO(gtZlH+egz8e7PAUu%VcIt(`mYm0F#(hFu>YJvi z2%5R&9QrI-pvR9tQ6OQl+U43>^Ng(tM^s%XLodiakM08ViI0mm*6 zHNaxz&PjM;1dHbk4Vy4!^sd(sUnYK*$Mo}go8o4^p&-AxO` zQoQEDmd&5X05=!2X;-!HTX(C;wqsa?J^D2=4MZETs1+py8jZW3L`H8M|I91<`@IUu zF`oL>{T!!N^=h1dWAuT@A&s3MAF(PUils;^6Q8KI;6}Rh2rM{~%&DYJuhiObqh0v| z1ks+I^35$OtnAm!i}&!G0g)xYq73V@m*+I;l+C{^x~2@btT3p=%)F%5$@iC+Js81J`Ux>Vkv8b3`4$2=gK4?g2d; zDAh<>a}>cUI7HNVw63Rfq_Ysv;8kyc!C?jMoi)0utZ#0tJH4;dyI^A95!I+Yc;pK_ z8`^QyiwgjSuA^0(hGRag*S1T3b|+82fZT3o`Ld!tr1lY@+S*8CM-00@5Y+j9wMDp& zGvuGpYESl!1$yuHFBu=QTTUyrIc??PT}PO9v;|S7aKqTEr1kV&A`rJ2gzgp=lD-!M z35%N=yB8ff8gllFBSQsN7(USvxwEz_)FW}QzH*^tym&2cq-M-1Dq*KaH|n_`?jC1A zGMs;MKZl}LEyd7&_?aKGHGIw$we93fv6>0U9xM>`?~2s&)bm#s z+}VZ+)L}|dbjvQVc)Yj(>~MZ#B$h@7C;FI_W!Ynm|ux+v%POdA+xU1r9zI5xg zxGuhBFCbQCNq4r!3DyWh50YdGHUF8g>rqQ?F=uB^)vEkh;!rt`bYm(>(^!D(OxIwaPbB%r%3#g=w3OUq1y4t(s4Iy+PS0$2*z z5s}Xf%jCle@%^z4CO)gBzd^ic*o>W=4BT@oXFy6d4@9MxJuc|6v-3aManwr+NmV&L zMBjDyi?hihG9( z#{)sq&J%UgL^mLdC-X^qRk?OwlDrzb>a!%T{dg*E4=wuP$>Lgff0$qSoJ9I7_>f7h zR^t4q;ht>l@|c^ix_GuP zu<%zI5bR#O{d1WD?ah{w3b%izatL7&q0zcsL00oaV^dEhKv249NKm-vol+?zBKx@m zMQsc0a8hup-q4-kc93eXan83MpRB7Dm_f@>c<7zW^MMVl53KhqcfP9Q$d3g~bdV1< zRo4Sz@)TC!9zJ3TgqvAsLz@NYLnwnXWyviYHt1pWH?&~XBkCu|+C9nTYtQeVmEw@OC)yvoNq>Ykt%hY@;#!oA(n)Vtp5^SI&r4sg-o;w?Z$ zZ!wAUGnD$@c@Dpokrp#d*|0wCw=Dc}k}0o7Yy8~|!H3ah1gCR?=cdc!?^c@~<;*A# zDuh+BAFVdKTN!_TwuPJl%*7aPm7;E^7dCa@jV^O`{%6Zy1TJCmUKc(FRJiAt5+ljR z$4hih#4frin|Tng$<(~40T<_qgSFhXNsV*?*@-;;$bC4nNUiwxMY|GUy%9xf@$a@C z;a>n&0_vEbCaBAK9=IIM!QprH7p955Z<_${e!7zqHZ6n=5}Sz$S+3X?RG=adT)#mgB5bX%b!#sjrTJ zQyfQo0vMk^gc?41&yp_tlrAiiPAd|phJP<^iW&c4ZJoMGW}b92mW;H<%7U=QVmoQ( zR@F~Zx-}jl&3r2S_0W_=B8b&Wm;Ht1O9B}Oxdq;wyz_ibwcORD*u4h2k|xVOsZsT84giI8GwG&2~ z`_Pra@CoL2%R0CxIaFMGKqTmj(G{UDv>XPhmTSWgxN<=j(rIjQ{!etJGb;-=3Z)3x zPEw_{z1dr{82Hm0=~a&@9ccr zdLTH6Fe4HNYAmX2w-t%n>?>I(2oPf{4n4oZvCDs?B=LokdYk%(&nj-0V>qHa8(BeCM*+LBuJp*R+znf53qu$E(Mzqyilu`NSu>EQ8gpKVH4NY%{d zd0LpwtOcn(%de6PWUtUSUbdUQX$6T*Ec@t)vf-cXIeLb`pP&;lx8}dr2_k7~#}%Au zPG~mpOp!yMj>dE|L*`S-0icG3OwNk^1X^_5^6Dlu(edVS2pXW%howJ8up?ciT~grt zz&sAH56R;sZ?t7awg4nA{(`U6@nYvdw`mqkPqXomjU|XuG z0DX(aq%K}#6}C5Fn!bTOt7}`8KzB^apAIf7D1IkJ;T5N<{L&Dk+9FR3G&sTC7&jRY zn%=y{A}X#MAA}U zJ@cV$AeWx|16iXz6<^@t!HF(3NcTvF}Aao{jh9n#N_I}gw&zs$ER59l&t2~z4mU&bYtW#j4jX~2MGZ<*R) z$k1D85)6r{C3o5NiuKR)f7Z3gg7jpJ=lA=XL{wZR^v}?CSrgEw37dDY%t1>#0zJ0p z1^R~kvi9vv)lb*A@?@)<&*SH}jijFugbNQiq(fZB!#1h@>I_HLl5*8RVPsk@PB`)) z?K(i;WN#a<7QqSIX9>WtN^d7m{=PU}p+}Rp00drqFCU!lV zxJ%GQ0-LyRn9IsSvZ;(9uO|=m2ovgNAH;8g@NF`}vx#WZ^ z&Uwdxs5O86)m3VrO4P=3xSCiCPB!W@Vhns~lOjIrL`C_L)K6!_L&=G1AYTlauSvb# zT%z<{$gFHctmhZ1-iWGONGmK@OslAa-zW^aF(U8io65>f;BYlbP*;bReY7o5nI?(5 z13-|lguQ1lQ@Tonj72XtfvEWg(kH33u}II1*gOvxMjUatV8OA;A}FV;lY}f}jj-x? z3LZQ|Gk@;>&1UKNh`3UbzJWaze6FHkIgMTY z7Vm(ls}o~gtA!CR^DdQP%)}J10h)r^u2SIhw-$hAMK)K&;c~s^E4weZm%^W?7EkL{ zl%F9s4!}PvmD#zJ#-0zE;TM_G2>8l)em>;jw~`C|;z}sK!>!6=0i(CtVDGf`_i=@B z-{V%d%cFaD1cg%pp4G$6h?@DD^F8V}qU#rx3JMo+<-1@H3-dJ|$Mh~3#QW(o4KpS~9iamqpK%{ksMW=ZS<)W@#mBe{9~~Tkd6x(LZD-i+wGU)A7%i zrbV<}evlA{C<>Z21Q222){g28#!UG3ir_o~uQuyUV6(LlBIsKXvDt5lZ-YJS52;V{ zZySiATT=e&iNY9Ua)?G)rq_f?ZIs&_TV=J9_UIv-EhIsdQDT+n08opU&F5m$1aYWGDPF)0r{{jeh)IHD40N>rz5k&({$Vg zab-1y-$xf!-FJZZmuhFAs+?J9xf|Hx?y=m4DImOG&Ou6#G#)kx+$n2qMcqoBi*ju;z z5)8~IACdn$(Zyu)4;3*ZaJut4j+GXlQfNQGk2s&&nE5!P_OVs}F-FIOYDEhU@4?|5VTOeX1YwW~ z7bZZ;81DrsMQjiui(`nRCe^9I5X8D|60_7;Uib{t*9LbTkT-k(eyovAEeS&-biovS zWG)7ekme!UqI+W7QuFwTdMP8Zw?Ka|%UE(at4I&+W!#tXv_6;ZkAP?Ut+O-ZlY|WL zP$PlcLlf&`Ch)SjmK2uX+MwM4xg11)V7J+zA2p_{b?qOCNxmO&Vr0&d?Iq{Q_ z;xGa-J1j-hoiB6dNDtibJ(z0LX7mfvy*v`=q*ShLAD<=nDN2>59j>MPuH3EOr2?YG6>G{f}W*3KGoOt;Cn`Ns#+d{x3sp=ZpnEX9#(Y z9AB_%*%*5vwq;|lNi`n&oFVju$M_NJmW}nt!KZ?9m*go!=`qA_16swUNz)Qp(sXgz zQDl`L!J6QK2-jgh>EHjhxi;4?hB`Fi8JelC4bYw%F7e9WT;JZ3g*jC6tqJWjHNYJ5nV^_W5c~ zmR4^%EX-?*d6L$(BaYlW7=le1KyLb8M{hTtq*TT*e9 zvJX|tVSWUzI`a-|g=cOYj_Ny-9^!-HNHPmh4m;g*BjIG=MEJQOEO}Yk*k#3WzN3lS z8K@y=l`<3jZIK9hFg$|pgpEx!xYFj5?c-&dKj0McQW5JEF7<~x#kcw*KrVlVU)UNqor4Vozj`|d2G#qaQ4obqg<&9Aow!&ZQ|R& zY9KbYkM>+(3NaWgfRiGADmXrJgJ!P0hEEcG>CoqF6y}rZWys}fcBe=R6 z-r06H>chnL#Of&xM`m+-5CAM@Znvvr>yeiRkCoUSQ)X~^*mYS<0aaFo+pc3lU&Qe| zBB$6z)#*%%A)F)#*`;zW@vgj?8BbzIDeW^oXPIRq=%<7k**)6rjk0-_sxl0wX9!^s zBDDx=qJc{+3d&gKh5N?q1(t5+TxM~M?h5ny#-s!M-S5$*yQE_BgU945-@S;!oU{&A zI_~6qT8zHX>fy7caFSG~>bkJ{5MVL}1IPj$oKDlhQ3YNDtb|R09=b%; z(`sWK0#)QQ1dyu`v#$QEaTdDc3>MGfE^`j}+EK^I9TY)gSq*l#=YEledFwrxK08U{ zoo?5Gke0?DP+eGZIWd-L5moC!3G=(lDrJ04f&IUdr!lI~AVIMR?Hg|X7uB5nn?_l@>+^0#-4>2M! zJg>O>>U0>wvm&#T991uuj;881$3;Nxfmeqai_L&@7nk?U0a!*we(thHWM<>#!JYPh zbr&PQ09D7M&O$_n`O4V-A)?ktBtFm&EUblHLMV^_8hGOG`6~=Hl{;%{8Wm0HE$H+R z7a~#@hzrC!po6ZMwdSA&w|yJ(jwGA3$PpzebwJWn(NbQGm(9?2;K-q-1&^KaqxSE|-ob(bWry)oRSZ!wO-J2Pz@lD8ZjYJqneCi6Z$h zq8JeB_o*qqZKz&SR+tMBq4fi>;peK-ge*J1N^G|oVP23>PAe*v-55c2#1Re4vnRQM zQHl@m*^vIiL6=_P)lMh4*JsESP~eeo53~xbM0<97FvsP`ZN@FCB-Orpc3HZ@qy!(w z3C-hpS0vU0Ld~wHDp*%~er5~!dOk;(IsZh+2e$a_N6ORG5xx~8_2YvWbIH6>I$ z(!{9n5PEeIrF9TxjHDJpHu_Bgd55n4FLUo*VRKn_`>{8=zh_E+>j;^tjj9$zi-Ttx zE-#BAx&QlpVl??o%WlQJU_viHIM9j|8>+i6&zt%d7ay*la$_O>ChlbY zS-w8e);+b(cNQJHbAUZ*?%6YLIS5)4l#sT;y*NQZkVX#+#}sxrHV_{3v0ZFtJk_38 zaLLH_A2k;Y=A9!6g{#zGnB=qsvH3V`fGb2rln^fQYoxb({nlOU>z(w|L2!H^~( z-1emPQ;~!5gb%f)Wn$jH6jqN34NpO z4tHaUKG*@@(qLN0{oORVdHG5F``5cq^q?_O#IDGBXTuS2aBbwhpD$p&K9U!woRuM$ zF*IGHUI2-AY7+1T9B6}T4D7T#`jxpG$}ukAHU54gm5p#BdY7tUiVQ`8z(P_vkwGt=gsEGWpu>@8awLP9NvP(x{GVi+~80&Wr_H9}K^m`kt*XuHQ!s z7Dgk?gRXx9KfJkv?b(N?r~~ykc0t?iX)PKfu;yix*A`8VENQHAJ@nj z&QPJld&R$G)HMP*ndL%M!8|e<|Ppd-feRso-CsIYn4|fp`@HYcZO`D& zQ9}fA17(w}?EEC6+h1*MQ?3O!2CZ|78p&>fA8nwGA8#dAk^kvh3WH}SXi0yp$%my( z!vAH%+PQxy+fJQ`0FKx{v4A>4W)e1tY2N;9J9ApwR5ttqUN|F!iZt<2+oF}TS2;qA z>ss<^{Z#;3xOZq+hU4MJybLqbdS;bk zb5Rgf=q*8#5O!^5m9S0a;xesmctm4E*k_LATxn1D425Dzyb@lg15J0yL3aqe;y~I!z>} zHRgqJNi~8jffvF#nY+>-g*i|M@MoVEv^yFWQx@}$V#T3V(ZB1G*D+>SULL|<4L*OmIU;Gotw?yFD1{PB z*)S8|LMqHMF#o=%PXHM&Tz^lH~e3ui%>v*6odS&mWDbIH4hWlTCQ_%;&( zLS!L4JP0o**UHP5C?BF{I9^ez=dR^;$(7@h2krwD)l*l+z5gbhFIUS7(qcP2Jj6Q$ zX`@M(TSdxGa+17%0v431sS@ypV*xXVHjdu)sHQgg|GY_spFk0^zcD$$<2p@PD( zeWHyyaGUOHl`7ce7_~2@&G|J!lNuvKw4b7gxf`7COORW2M2gICaa+Z@F4YqpNh1SG zv+6sq+j8Wy#{%g(+oQZ~(DoEKJBk@AAa6aX-?4gM^Z76#PU*>>qNbWqw6wF@&*=*# zUq0Q;m@|tsgiaXfgLEpzo?(Y}$cxWesz@f-KHKDmgdpc>aS^hym1g5w~m^M51`Ta$m2e?er)%m z&;EtgC(o2U(rxsE6NH-tcln2U@fty*wTUa$A(Bf&5%c>dBgCfx8|2CCkDnL^LwLYi z=y|1{JU6opySB@J77saG)EJSO`RI4@`C zjN}Y6y%>3gM*clc;zKIqOjXph*VuJCOs(V%CkaaEkMD>fqbmT6C3-Wut&#YlZcx63zZeUACz_Tz#{#`IX2A=e)i>w^=Mq zC(+LhX{MS}=U-=Acf;IZLG|^?TK)IWvZoNI%zkJj^%U z)4rd9(Dr5}Y$fLJ2mjEk@&^?kYB!#fw=@76xi`Rg2rMqFO|GByr~z%_kEXsMl5#Y7 z1iGx}N#S)TER8qaCp$a?K46wJLc@%(s69D{KLD=Thi|aEmk3O?{Zdpq!?$=Lx*7yOHhx7jE7m!RUWxM)*(XyYjW&)~6 zO4wp7+?+LSZSwEn8dUJ{@Y=Pe2Xx>qu>35J1GAHJcnN?NZgDmq3s2~=YF@<9=L$S7 z)Q#7|-!CL?$Xd$aFAXqyfR}Lg+lTdnHQI`&c*}SKQMVMMlHRKy$8Q<{@+0FS;;6ZmXpV2*n(@8aPLc%LVOlO~~k?T$9?4|sK;#bm7%YGeMnY1a1bn| zi|GUxrGYa4h{ z2RP&yLJLz|pTrEB4Nlpe57S&(9(abc@z@cUnI(v6!#5%)oCkRNbF^9i zu(ypPV2R*tY_11*3Jl(8;#nZU;|geii^H%8!rK$3e347i{GXNFPRNs5Ec5w-6Sd_&W>KLIGHWe3~ zxuuzI0e`!WyUwbfsK&O2Y!gT{EeEM({;l}m;3n|oHsKpM;X6-}4JgykP=+$NJqyb) zrQc0B9DMYRwCP#nxfQCQ2_OqrX@M{RN;#d(2U7izmj=MgC(|e$`B76t7OSE8E|LLFzSnaB2ZqE@naEFNgVmK| zcddx$Bk!Z8KC|;CbE|V99CK!VACI;)#>Qx=L!#o4mjkcPU#BXsq1@5P#KtByaBCc} z6(>#z@bmkY{wwi6GGra;{Sl~H6sD^kn@7^QtG5IObT+UrAtxtWXv+iUHXy{r5m|FB zJEq_>z!aE;*#}=24pI7J8u?a}OI;b>R46JcC?1zr>UNoVd8*Eqv!b=Lu7qf~Ft2dK zuIPQd@9Zy-d}CSdI0E*lX9gQv@d-f@)hiKS#t+|l8J~XAr7R2_jQQ!$WBsVw4W@=H5G(pX5^eTD`aRd_biWKnX{JAyan3Awt7pA|AcLf) zIkX(Cgh>!{MaSP-#e0gEl&AYBD2lnA((=mf>xzD!{t1Aqe3e3i{9_Fn zJ7*4%?}hLIE$AQM`PTYR{WX2aHAV0ST$Vf(n6R~U!bF){gCQ0+0D?d+m-S8P{tVux z1Mqu2*baa`*O3APE&J8tg3(vn5kj3(X0>z6XG59WeT{ga=f*XlAVA9^!4+?h1CBW^lBy7{hLJ zo>i?(tuy-9;%7F=aD`0~C!~nTf$UNeAF;&#QAi8^jj^$vv$4H;f;Y$6O>Am!AAQm> zu$nJB53qH%9f7(a*826Uah8*HtCM&K2VN2V2ALX-8nQ2X!x~>c6%U4HaS#v>lK}sS z{-YKWOa{_FroENLYev=eLES$u)FJ#155Nz=@Hu_Cak{Fqbx>$B6V!x3ehUAfw#lQ< zSOnM8`i{P|>@*ebV&Kdxb-ocj14ONvnWkx|pgGvRu}OF+B>{#;xTr+aC(!j6mBgQY zOV$5$#PSHNw_XkR%>~4Y7B= zC8&SX@Zt(8;uKQ%1PSFh68^srh4~rQ!^vTZf>g}!Z(3vH0L3~V&(g-_30KwQH4IGc zmG-FLJkC?SW$dg&!|BtKz!!iqD2LQN`jlVC(>8u8pbL)0F;^{-(G zh4JWT!8zJ)ys5WR@eg-qPxgRdzN&XjC=g3>LK1d? z|AIw}r%w0JUu6&e$yxM#z~En(?+Cn@k11g*V!H~8Z_E)7uu-u zh$d|a?h3F%7&I!sfirtEU!0*BcvVR%~}RWi3P*;7sl*IraLA? z#WkX&JtS6izp~4cZR@!x%Jj*UP|*T_}JrbTWYeAQEsReLct{S5rH(i-qB~0(b#4 z<;|^NFNTSpLjeXRTE;B@&pi+;0WNg~&8}wW0DTa=bjiChqqXs(oB?{Ft>7g9L~Tys z=<4VE{PMb>GVVYcm6?30vE9%F3aOq8C-I zm-PJs=jHhomop;tChD7OL9FHC@?Ss2aoQ1JDfp4m*Y4oo(>us8sBqlby5#^J7XLZl zNe&f<(7ApWYPpv#kIOon99en+munBiicR3#!!vdK9LL#@&KmP(#Non`(vs3abQ+r$6ye=z&sBxJajSvPR1#Eyw zzyS{ikl5Nz?8+ zMe>GpNGk&s;IP`$2J^b*RDaIoeGp=1XDlhX&ZxL>OsN5KxQ266-h8qc z=bk5k9~!($0)K?=se=y*ctmq6q>adu1_Dx5;_CCENB_hZV1ssBk@IG zej}m+%(tFu=fqz$J|KW3KJj5TR{)|A8_yuvI57L*oGQo9!>F>zmhnw^AtOGYcLz&O{k{^^G==)B8ZM%9{yOoeo_3D3-{5H+QV?WKsZTKyL52?xFaLu zD+|SF8dE{a8{+*_?!bg$v*=KSglznhOp%jK0LQbhUP2;H6)5U=efX(+GfFIc`>7IvR(b&Riw2AjIk=yz1y%I}JA- zl>+W*MlgF)E+fV~PL#=?T0W~iP#t?XRwJPOH%Ec{d79DyU%@1jMF7ov{Lm%j ztK@Tj0HHe~NP=dDO~#S@lI0Ej;FHRXl;jP`#QfvEzP>1Ao^S6mOb<}nFXIKXc^_r? zU$8q^z4ZaSqV9d-bqw$we$1ye-Q2mEX>^xa*=CPW3iET$0ar^xv#&rx}-N*O%|Kd z^xi6l&ElEf*_c>tKreF*=kz1SXGujQritk%yY% zf{*DMtu2mD%VR}mx~ZkvvKnP20fNfJr3YHLsw5kj_92Q!0VNPtP)dMk=K|moIK8)u znd6$?S)1nmd)|zQL)7g)Qe9ippR6X0y<=k37}ev@_L#t%ok9t&q<$lCE-x&AR`{TO z)d*LUYigUhucl&Ts4BCzIZSUM5J@;}oqQV?VCkkP-^1el_1cJ%j!Pnq@R||~*2o=V zgpF=ToK1FY1h;)GN6W~O%Gwtt&*K30GqiX`VVn}e5da;T6Pg?aqxdf1KP-4Jw$M<6~?$PKTp%_8zsd9 zuh$%RZGpv#aYwNvFB$ThKkgRDBmH~zrcP}Gzch9Em~Jl{Ny9Oh_ahX>5~Jj+`)LGS zZVjNMU$YffR+I}(d;#I|3P<|RI%IsVskx@3tQ2ILn}AdLyC-h0iRe?ka@Zxbw9I9z z{{siV^Z;Yc+lU%nro^uiU|SzH)pQ0aj;jz>3b-u>goG`ZJb0m6swkyb1bR1BtW}rB zLdRKFp{on1xP_rRrd!z9Sz;rzd#7)f*y{N_bkg`ZaVF!(VGBMfTo(uJIl$911h|4%! zy6qNZ2893?-L(ZpHZxOvL^Yjcuvtrg9qO1BP@D!8^~sbf8Cs4oHbBTJmKUqrfv^!H zcNnbWGe&GkNemnaYTsbh1lysg@YVDyEIjZm{cMybPgV>rXFHBwTQ|*cEz2IT3h1cP zPVxIwmoMsA0j~RVP}^p#S*yyfEZJwBep2spVq(b|p)}HZo~X0I*l1iS4)=KF_@eiX zDV+Xw?`Ox)n>8Q^zpl-@$XEbBK@aZ*QUy$EDR3;et(#C{wB0~(>#vUQ9?)6n-4U~y zzX@oO;=p&x7-z(HhzCjX-QGo;k9@H z>7)Q*O`4*o zxsESX~jmrmYPhLcqe|8802>-ef zAG3@ZI%PjQRa%p4nxa6Cr^K6$d9rxN`d7_T{*)m&DLMe6_~+&75zMr2hrKZcDILGxu;PiotL*A z!L}s5htWerkt@wE{WlyjQk6$E)igH}J@>K{a&M|us2SrztcOGkHTi%y!j;J7}0+`J57Vzp@%dPpM233A}ud$c21rGkO4bTY~ zLerk#fiiww41M+t%%z#~hZ-PiLplBUL(R?3yms6_G zw+!B^c0xMpi8Y?+iW(N3Xk=;S%034n{%ZKz>S3-|<9s!%H}YdHJ(0w5u>L&l$P z@6;8POq7VtGr|vy0=3f2|^+ycVRTLS%_UCa&!kE0q zEsz27=TT?ksJzzgq7OtKQDaVbT(8hhy#qp)=tS#}{ynBA=&3cqam4I+{o#%}IsixL z{{fAQ=#enOqzJED0oxPsPU%sZ4A{^3 z?)il3g~M^xM;3Gw^YgT@9sLK5Z2$%M>WirgWaWyT2JNs;m0AW9H5Q=6cF22-- z`@>3QIFww0rVdzV1+Y+CcqKa@eZB+7b#Tnw{YDvi%Zi8YCC{5;i$5-6f*?|rEyA{6UxyzdT^IC6B!Pm z%1V$2Zp(-x#&u33@Q2H|{>EF@=i6zW>w0*=PX#9W*x{Evr4O1y?43 zr>=>c9Bkl%1X!1m@Gt;v^x+f2x3ky}FAk`wCpzu{0Ivb?NI!U)Dj?XS%+Eip2^%=Y zi(p5xmllQD5o{iRK4fvpbC9Gb=^h{0gux+w9Z~=2iGgm&2hMG_pZjQd_Q5j>?n8rSu35O&Gj~53n%3D=7UcD?bi?p-JhQue05-aULgetzvSJoEF zMS>EgCgGc3!yo|n*jveSj*H5qXVCZj#cG6Z#S;jG_SXAE5}|#%{PD^D@KLwelPAL= zbdkm^($HDEdl!p}0T%a4FV1O+ZYT1KX+TL2XRkl4d3IsWx$(@H^7LX(jAnmfQCCS! zBc?Vq8l)1_l(>rvCidA5TNv$%X)s#Wu5R2JB7NA*{9+Qp%hoyxY#29)e<+NK`)Uy6fNhXO!vRd3E{^u8x zozj43rlp5uXZAk{i2zotVl^=TO-hC%KdS18l2W;_c(^@73+JD!M$B^O$xX>a`xWpF zSVHf}r}Y;u(*MEvUr4(;rtP!Xy|cKfCygCQt$gSR_0)Dp%p`f@?vFSG`Pk{!#B9j} z8{B2x0=MG-^69zLnf{sGN?*}@+5E^WZ~AsI_KMEIVAq}BX&kh|qKU9~`u%>6TcMX| zgZzF+gU`vfo9Q9)7`EhrE$*65p*L<)qs8s38k#ikphxXoJWPn$h#GFqfKZJ#&R? zg=;RG9)5YJKIB97I!Ov^4a+Pm8T&-9wI{2vun_p66@RE*u)*FMaMb5oD>2|*?f7*Y zbUt9SCt^b$aJN{Z-hMPjsZdheZ>^PRx6AuA-(|jiRr~s>iV*CuH!;|$JBmpFel8A4 z#FBTnX3CGlv42bBuieYdDypgF=KvV)bwXBAG{d^p7v=~%*E54?52mCF1D)Iww!iw%e2#eUt@;khI2b@ijUiuc9=YB`-U z{1uJy3Bg3Ec5{h-gMIjyzX+7r7xLIIaJek3uw7v9iMI(|J?M%}euT)Vc_ zyvv4tlqnnl(1V! zb2I7zcG4rU9yDC9Ec-$U;deDM_MoVJM;&`ObQYoqt2U63X-1a-JE>fWT^Lgg4%92)Pq3RYp!AJyEH?7T6YFj zmk_F+8V|MUD|b`6t7rccW2cJzkn&xO*+)>u%uE{J1f}~rhbd1{WWRGiGcOCqy%3vz zHj3HcJl~V;khsG@(V)4 z-6=tD>-K1d#uZ=*a#H(#464qe@bUuUnUuvm_J!~KO3U10LUV4> zKP{Q|1bliwzpS{eMqffuPL)7A>3w7o)7VhA?L zFg5&F7q;u6q7qSw$SAturu@`Uap0fnx8dIohJWqbY7+*o7UmVcFv*Q9X3 z``TZDazA(I_}gb5eMVg*PgH&5B)lo6O{)@^75#9GeJ87)=49(qTVu{t0m(Ns&R)xk zVn?ZLRSWEJdc;1k#fbv>{z3~oq_f$@V0?g6wAXyF8C`PBJDF)b| z_6$fwsnO<;U6Y-M+wuH-B=UrxxTJ#QACPX5;((m~p`1y;p}EusTHy<#3{`t9;&YR2 z^$YDs#X97rZ60pPvCpaQClV>WKg-1e<>FV^a)=_GAC5YXq zk1d#b#U%Fsy)#z!BTb0ral@cBSe?`wl|ZPXH`!OLwpN~t`Tvse zeSaJT<3a$8@&lsZr$6imMt60^XoU*Ea30UApL+ta)XA1nY~~mN^Ie@#MmCpMcWjmG zpsB*_@EZhMA|lEb<%-VHqExQ!PQW9~JhZst%F%Yxg{Vt|YrgN4P1&|1_;&ff#u9&F zVdp&gJLE705P>Y=!5vuHs^obHJ|gGUi4lO|Ca;5m7S;+E#nAyNCn;&j>8)Ft;)TS_ zuN0mAi95MRKE+yz(_L!{DCuu}R|tcHSJjX)JluoikzZOw#^`7dY=uW@FwV7~$-|?N z6asS#b8Fvdu)c7hu&-aJ6xi@)7kwrw`9prLW_=9Ty~>gwZ=Q|fZl3=B5|W(YY_A!d zv*qmFW5XE%0rRY1aX*;-G<1BIT6;#W0HPmyMzL|F+^{_x@;zD~+X^;~EVcZ8Bx4lW zyfVVSlEnD5)ggDW6Sjgd*E;yn-XhNscns%yw8x8hJM-Nywdi+ z`ae}|c;fCDg!@F6lE@3M(_Q5* zW;sSbr(7%|P!r~(t;I(16FPV_ryk9pou0T>qI`C8Q^g}{DJmx`Cklk_eq^7b<8a%k z{4;r0x#Zfx^lbjo)Mins2nI@~QK%hOBOp?&e2#vMrI?$pn-kt3Aw~WJaSVdISlL2Z zRqAiOe4-J05D*&HDp)m&mXf}G;mDx>j^vw z@*h5OC~g~_S-Ab+nc&pgr={ql*a)v;Ek^Jetz{-vi9yb(RkLnEF1BD2(ARrkKLl#V ziD$V$fhXys-BV`P^a`5)W4X*Ts;=Sdm6jG6DR9U+?doq50Xo$$O4VL?{TRUcOSSfl zBs?X@)TsJV|F|uB-rf?@Qv_Y9F;^2~95NX!O5miFOI^#RJM3)ZT?3|jl>MBNAJ6%udW`u!JP@$GH=d^N zMSW*V@yW!KuoD}zx7bBm*}RwC&T*dtT(zzhZj68HnSSUs&~a()cn$5B-lGHaz)0@v z&^MEES-@Lp@CC4>hdZyb7dvxk_Xzn;_xjziQe?2#IhD*7zzD|l#+^p#vtzy3Jd_v7 zPc_P^=ZyieRq|ruI)T51BI;B2w51_;KpD=w>Ib_eCHVC$Bc9AkQd;{#N-`q!H@r@4 zj67HlvFsRM{HVu$Ka>}bjrAgUw@tF^1~P%R{hB*N)l^3ZDEHl^-iEFPo-lM3TEap; zstogv3<$9>-O|?&5(Eh~+8|zt2!}%%bu<`q?05M*& z%s?Oqaf5^!72O~~d;$@N6^8JFv^r*xBm#xR;X*{gJgp{J7%ar&f$(MA1^`@Es?mC2 zCLT$t_V-+dfi^PQWK{dSNK;4gB`&NDXHfn=uLun(zA|rO8iL=KTQ^nZzt%Y|3`t@7 z`!=BX9LU~K{L})^(*PTl^>wQ}S!50=R^WVE@_ASl>KB@SV zWnZk_)U1NxGQZ%c&*fxEsP@oY6n$E(Ku&0dvY$*K5N|+=!z&f)7cqSvOZYGW-o1!m zZn=$su=)%bAdEYWdafb{100wGW+LT3Mj$)1lu9uyHTSm;EC1-40T{!<<}9$)r^A2b zW5gy+ngatL!o&6YQE8dr2H_PLpHL0>Qm;cetbu@n)2RAfYy@G!KU3MH2=R#t^Bag9 zW*yPc1AV-@%F0H~s}cO41-MW(+s6!Z0Dd=I`;!Y1)a&TE9u^Kl zxW6$VyFx_O<>8aS8`mWN1wLoDYsVMDsIQOAW`y(dVsH(7WgLTT@*d>TX!G6pV_xfp z5Xb9YX2@`2nZ)aP&Uw$Z-#@naev|2f39tz!t_}4O+T;jTCLH!#GiTYqnB@LrV}s#A z0UbZnMS*J;LI)X_6NP(d-U5r+a%MA-PU6EotDD;SOnHFwk*yymTBSZ zYioTAlp73*mI{!wk?538PI>!{7{76`Q37W98^F}Mej>^_OzHpG8=wOM=g;M!GjU?w z-AoDw+cv)op)k{k>@WN4;IjpBDKlDG1%+xsqme)3M~iTz zGRjlck(&SOMJhj329jrMEBHefZfDoZJIy(C+-Cr%*@C7aBkLS5XAKkjrUUBGaxJWN z{cC=(4*2~7?#ZiP=wG%HEr-jrFB#5+CpC|qVDGLq@c=Rc}RSL}uPft_U|mm`>w52W=2 zFq~6}!`Uz*S;S+^PQv+|oDcLEc=p93%s*k5aaNa@Lrx*?1L33W4~3T?6}ivNt+e!7 zBcF4TUVuhalu*u@969s<86ShV%V@m8qOK0q7sXJ+fO}5dinQvmqrFEk3b_`ho|rAA z{QQc+i}@=Sa7h*H*Jj6H#?(T|Z@{=bdUm)n3i%;RjD*f7Cg4oJO5X9>VuUCI37L1Y z@sh}f%5wWd%pvOSQif^43>$~?#E$wz3OT&)4(?NW%>#9>7GpaSQ;O3q5}KbzyP*$j zbg~73ksWA}&RL=I^`hbZiS}IzUdHGuXsd&J8kqA_Xtj6G#0i`I{aAHaq}I3|CdhCx0L7%V z+N}9cKD;l{q5SZ(rjC}qL<_#OdYn~FY+Y##!uQbuMnnWmuwaISN<;=j)lAH3RSccs6WU0^Oizf#)%Yf>8oRb{E$z*u`v)8E)e6cd;0K2 zV-;-KT-G3mhngEGMz<@2t6W?(4oc1YQFwUqET@M9KalN@Ml5UihT`2B!6I+{F`;f$ zYDCT)*c$G&E79D@#AN80IUOF*By@%v0b0wB?r~ zc@5IAj!AxhHAm-vs`S#${-oXm44DcLOQ+;l=blS+C#Jrk!-!5I8B_ zaVIGu`_xM*_Z|XugKZp3feR}sTa<;1XOU^~mcR3cLl=jWfwN9ift|%=(LNhGro>nr~ z6dSj{J~HxP3*%EqWB&DK#n3^;Q<6!%+4`ZK3h&**eSUA(^3JXh)794XEKp`@27S1q z!en_Kvi&`ju|LfZIO=-K|Fb)vHJr*l>=u;3sXRk;o!?_aMZldhEmROxJ@70qPe6iR zhLU9^sIkGnpQ3HW6-OXe;*cR&2Z*Ywfi0hFQK3wkS0Z9av5C3Q%O1`L1I`@kSo?Z0ztWztlA&lca)z`N+3z$UJlamE(13=0L1Z#q0p^O$1 z2w$I!6v_}3Woe0Jvu;%4Rr~k1FvjB_h^blMJsr*d-HjfDEPS;t(2|QS*- zEAKhCnNz{!T8`(b%awhHQLtSr?m4!bQ|ie!AI(z(aoxq0(gR84#baZdG~_vwCz++F z-%8QkVxSlSn-fwJ7ifQrjd62#9Jef8z`CP9mW#9&KtzjYU=OCwM%r=F%gDQXvnSYI zdJ_{+-4q)>zJc+xmtO7huWE>nfWH2~=V;T_vhRZPH3qzA(=?n}L-t)y?zAUX8>ZmZ z(?<1%o_IEMyIz=~;lOm;yMoDhjnrZNp=Vx=+~Da$R870&QHcMDxWRk*sFMNN?(loP z<9HXs!bikUU+@LKwE`T1Qi>?Wz5h=bQCW4Rz-T%9Os96L4u`r-$rygmVrzDAr@SwV z8+%c1^g$ToX7bZ>8Neo}TAtJ?GtlM5VWx~PufC|v3}Zeh4)Qph^zb5mHyDpSuM9&> z$vlqzuK(~JkO%*|DXO9Wf9jb+O~rX&JuN2kUIE4n>uoKE_r!Zx=MUwL_Rb6enOdjG zm=RH^&It6w=G0F0kx=I;8N=_GY|OT9v=608o1*b3>X8P%FkN42e;b^+re)}~4&keA zs(^OVSG^4-smhAPPN@N<@$maTat%+W>d2G46?K`w&Uz}0(=09DY&}1pp$4Enq1h)r zy(!;}Bw*iGg}F}20CN?q=?GGwQmL!9|I&p0$5Loooubx%8@7n01dk17F&V8Fb|UBf zk<;S$f8QK3CT&OCoEC%~K`|QND(du_5Ad3ny#L4AV63E#ZL6fP&7bRSr>Hyj6 zLGqua-kIEd{%7D3Iqr&EywteVk=y@jY@M~@HpW_E7NPuoJnP`tCWx$ot_?i;v-$i^ z_EBn({Ph6YNa_5mu}#+U%Xmb_thK^#DXbM^>sQ>+QpZwbAP-*Jm^PAd$~?+>#-#z3 zaHcZfz*IW1_3mPx_Q4iOFV0w`|HxHi|44wP)7!}Ty{p07qjinsYbD#DbH?w)+jTU4 zjdVl#=1PKcoLCNEc_F)4Uev0!k)87u)>m`#tg>}@1w4CZ4wd8VB$c+oL0n4(9A&`6 z9jFACeZ#HulJi#Ab8-&10UTd946Gx}^NSZ+aHG&%*2pxxmX)eDu1I-SFhC($ z3g-*bd#0yAw5~yPC~$Tu->sPBUHjuSA2XF~&yK6kjK%kvyT;3;t*6s9QBS1jFbg%; zyjmr-XCdO{y_S>f=v3*=Lh+QvL*Kk9?_#JPt`}PnxsZ(MCBFu` z!5aZ0!aDnTdyK6C&e($!-EcHxvX`fp5Xt@^)+>fmepgWSnv7jQKp0cyD(?DW7eRb& z_!)g3JtPl8n@3BRN5}t<;02+);XJ;Qb3JZumzEY6SI~H20RU3rcVR?Kqyc{OR^$V( zQtHcX{sT74UkRY370SDYVc8+ll!EcfHw6ruktSV1Y zAx}XrPfk8h-aA{K+ojA`Sd@~Tgt;lUlW8=o){2~S?Up-|2-;MdvdG@kH385>(72fS z7}2>#@3S)_(c7QHKrz$yfPpiy5QA+6M9`&nftkIMo6CWo0$}M;7_N|lw5dg(TfU?> zdMp~-@n$Q=3a;7Irndb8u}4KLHg*iSi-L`=v?v>U%XjGZFVCC5n3}~qXpH6?o0QP# z#Z;=1N(GYB{{V)204%c=H2k=p(A+{E4;4R=CxyyhQAnqi^Y5N&g9|SuQI{%E#Qre- z$8lIc;_3Pcepe#sS3NyJDlIbXQPr?e$VC}a5)crCl=gilKu z{^DxR%KkAqv(nzm{st0_zUsvOB}+BA2Nyxt&Il^yIqRP=YEgU4zJALysw=f`$Bt4& zgq*TYif_YmZ-!q8@*3lK0j7$#bwAB!BlG+D) zgfxNkP4OMN_F_K&)E8q}v67$f5mjeWRX2_1>jj?AgHx%{Qq5O0LVRK3VUi#8u74XGnAW+_ znFscvFGB&a2QiE$(wIF)Aj?agdt%h)K7f|wWYnaCNAxhYg zG@hL7XkVXV7yWUxU46<}a`Jdel70DIZ+C1`@>o)eJ#zLNa`Y@%EJ@xQA%R9iVhPD) zdYlmtiG^hEfkcv=D73t_I2-A56y5Y#ATJKP0^yAUVOG{m_d<{40EZO{zrNnkdth#q z=Hd0G74RQ`Bpkn$9Q?u5rl~s%k^G;$@KDmZGl?!*YnQi01RnrI-T*VI9l*$0{Q3d# z^bJR5M{dY$!K(B%Vy0=f3225U`idB!41_}>?EGsSYbcB>r%pCPv7(CN$+6CEcz{S~ zjf($@l1Cv=picrrR*v*j$roFnagRDWo|=uep0el^C+8>!XLB5*oPK*bsHwcE(04gW zC{70m1K4}-Z-=yQLml>cdD!njT~n`vaffjLy9S2JMnQrWwgn$_J0G1eU`X|EKqEn)TOReXXpFW*dGoi*7@EOeeS5-lQ!Z#;?#vPOB5798#{ZjSKm)d}UEX~i-P>o`{$5l^4sRhX@j2{0r&q9J_ z^8jFr&r&l+1z-XHe1OE`Zz<;cwTrn~qJK}kzmEF&!C=<>a)JuTA6j4ydI2M?WP=(0N-oY=6UdydDn8oZNJ;LKXA zOUrN)#mwIqQpv}vbheOJ4Au%j%X8*iaCI~9F>B@B$rW^`a=mz?l{OMf2otBJ(4Va) zy|!%pk!nI}=C+i~Fw2DgQZ_yRUM`XA4Qmbt6%6wBbuy0rz^Se<6VBog`Ti$H7se^cq#_#zr2y&sEmpDbT2i$ zRC@K(n;!TN@YPojFm*9t*dwT z;z|H9%7psA??fS#&^F=pn1SMG7J|==9o+A%cgW%}Ky;(6R}nW;D;{=OFFb5fUjglL zAv){HJQ@vW7Z(mO$DMjW@6&I{6<#ONSIUH1KWt%JE4y(Rm0)K94%gVNUD=jkvF2`!9L_IroOHg}j8Rw=?{OKm zYXT#Xm&T&yT{e#G`=pBgBIBO(_Ivk$dETv}Or}uNfNDc16zhK;yG*EsRz@(#Am($S ztKt(Wtq`#6lZiD83zP@|IY7q01_FtemE2X0`z;vqB_A4kh|WYhn#SFx9+I1&7Q|J1 znFt(9_s@mY8j@D%`gi?mEg{c!C|54lm1=3WUw-U%jk1ZzS#oy~kex;y1&iON%0fy* z%0HG;g%{{G^#xkxI(2?&&HJ;06hk}jH<{~pkKYlS&%C2~eP#yEgaS{8pRM%pTozZ-W$8J#iHBB4=e3xmTy+RX@yvkj4F zpc7#HJn|;*sTNx+_v--4}58vaCoBZkkjn5lS3tC6kQBrlQ{8m8cOl#qZCEMT~| zJyVA!i7OnVp|@NZKwGeSi+fogM1K5eWhI1)3hj*zZK9?iyP8QIBVDSiA-lptSw=XD zMmB(e``pmH(-eay}B zzPmf-ITOLUa=wECh(P$ux0u&OzQC~w%Tkf4PZp;TkNNNU8^9{?U$2ai`UbwYLXJd7 zWpft%_fUS0LrJq>0|(91*@%E8^Ns2ll`Y>0n;l1tUR_WTM!)`g=YEc z!s@*WJ^-@=oMvwTL}mln@B?$iHf2jcrXhqWT738i!i~1K;mD_Tf(;y1o^HlEnBI+T zSd4+w)1JoBAlU3sk^?^D2@PQ7aLJ1tR$r%&x9J%G2TZ0@4h%H@s(6{QEYfH6iC5$I zqPv%E;&)(NNqK)0PdU^1e)By%9!@NsHJ>d_6yR7E&^ z5Vso@Pi+Ci`A{4QZ)t%ef^&&mlN%Y~urN5g)2O@Q%<$k4=0k0whG5)GrNih*O{8dO zvY7<%89ptP0ybuRtj6}(^DWR09x45jgccki0t2#|76@9-1MR1tbeq;Y0!Wd*|E<`{(!xriy?C>>vP|Jjum2MT97_ zRae|ofH43>$u>yGAsrRvd${=XwR!XqrP7d%hlp8VfdDbe$h+bu77~=ZsbDxjoTZz5 zJr_<3$hP<^6Yd@d#D(QsLa1S}6a`|pRGu(weG=QZ#86u|Ln3s`f-p90eL_o0H-K7e z%Lw4A-*Q1PjZq2$Ra#p{@VF8)F9;vPK389gDlBILm4Z<%Ty&sjDh`aXsBEtTFawcL{g63#P02c=c4Mm6giyz+dnz(_+I-m3j` z!z2nL&infSJ45Adwfdq13R;im#*)49}OxveMi{3Ja3oV3+J8>YRO5Igr5c z)ZJIyHo4OS&U5XQc5rrjMEJjr($-8X;b4KYQJp|W-vcW`64D8zp)SMHhvaJMwyr#p zS166EPK`Oo2^0S{e`>D#-F_DBfBdanwQZ3mfaNWMX(9v&020{Jngjp|lR{uZ$L2FA6UDqZb zTy5zOlG|6c`U8>!giB+5S+U~bgNopFplmk-?CG$YqZ(=2nwK?RN3}0&r6C@i+EMaF z?U6+X$LX{a+%?s*kAY;T$=!W)WEaWERUcIsR=?E5@gnfYdnlfGm2Z+0rVk+9)?aNW zK(tpqdh<{>a08gpsg-3=3VU^Ya!1;HUb=I3rnF^b!LAW-k_7~l5_Si;ye|4_{~6g# za$`;K8lRkNr!%z+)O?upN{^E=PSew~Q$`jQMemdsEgl)-Q~%6o!lI(&`P{#B{t>p7 z5csrAQ+~!7S=6~6fBDf~q~K{>OntwX{r&oR{(Xo4s&Gji1vs%!RUws2Rhkg-=-SVp zmpLS?o1gFJu-6R?3`Sz3mn?ZKaLW76SNi{&DFgcQ(n!n~(6#Y(+FGqoU%Q|G=hJIP z&MJ5+4I%6W)j_Sc*R~z9wNi-#%1$B~N;9TIhZHO%4~O9^D%C}SAR_Doro9I>F--pT zuVeSMS{ZO?U$}}_A_R%6f{KGmJ2yv0O;P>qS;jE-ueA58UcFKkR8O905LtVyN2$JK zaA<+>L=Yv_Y9-0Rm{5Ti{fJ!R@8_y`!^PLH>4^|mcofZ3>i?7>XR@mBM*_>|5YYTM z=Y<@c?KE)xUT+1Y7rP-}A+_TS)>dgom-UuGJs$ZI`5zdVU!!~Q`}@+myFnn0+Zp#> zOC1{yXW*MBq2YK!cn{G*^IHhvW}f z;ol*#xIv)?$>w~Zk-T&=dm(`i4%;UT8Pm0r35eG-d7@L~O1shunEZg*A}pL4j&gw{ zqTO6yMab$9hPLQ%;xf3&2Vt-_#OxxI#fLjoU;#(?kh9!zGPlF%`aBjupp(L~w!~{~ z^l-Y$6;m!a!M7JV)3t3O=NnzX3%bGTjZMlm)l>RFesd+nEk&u6DOW=_S7)d1ADsAe z?jGh@T)rS~ljz@zY}{R(x~EwTC>beCbdpA;m;~YFgkQ;`ePu+sNg(keUM_BIao|+2 z%07jc8>=tjSd|nvBqk0XemRI(T8JpZaUijyjfzBGdN~k1z#d6-8e&56v-QOFNOoJ< zs;=7okinQmiv?iAa^>;%TKV3SSfmU&TWw7acCE~z?d!b3X}6V?rDVT^g>{~*D$w)s zq0r$I&ygIYXO#{-yHTUb=LqE{5L3pq_%;xrbOXRG26ItGWieLU!!%h`0hcj9I!e_A zxqLwz5fW&W`u21@M#j&nQO#f8HOQ6HI_-8g(k-4PMvCjS(0M4lTFmfchzB#D*%v@SC)bIry~mGj_k~Fck9T;v$dm?+z#-1 zI>?2+KfdN$o5FnGo#QW$wT%%N-5Ph%Zv6Q1ICtssN|)*`xhhb|DencSF~vQLAvtbG z=Q%nVW_GjAH9FqglnpBx{`Vk3uRbXW?~Im=Ze4wNE!QsuUaE}O+cz~f*sGp;X$ZNE zO_bU|R>sD$#TxCD8xa(;dR_!_$O{^eu6c&9;UGa(zO|q}E#EAoyJz?B5c{B(ZgW81tuU z;Ojy;o1N#fe1`{xyxeCASJ&Pf$fN}p#R*edJq_RhN-h}$wGXA;lamW51ST0m2W$`_ zH?3q5Y$0}5mBJ5^LLWkI-Cg*Aps)*E4+@YB`S0h0?KY4lz@B*ta~14|DEwSfS%yYh zS<8MkdK)Y4rp@r&fqyPhKm$pHwwcYK#bKzn?OomtSBa>v=$;6M-f_(mZGr z5$a%UWImnnl)yQgFSa~hSRwe26aNuG>&i6&+Ce#iMn)NK4}K0Q3AzO%5!_5Wln?C( z5$Zlkablub-Zd^r07~v%yqnLVI=P8sQeOp7AR>a&c9sgOc9*0~=+#iLpsybl7i6Vh zkQX6;qi0|TN4TRL9b`CVNZ|cgTd0T1Cl#AmGBH96@-dHAT({~uJ`(BCR@2pRWCzFu zoyLR{%!HDbjR|m)RF`(FT`?)6#Z4dzLeM54(h@2dsrJzf66^|bqTi^G^XM zK3H5D=aIwi;5<1~*VU@4bHv&0NKY*ScR{|89dgJV)W?`E5$?bgzrAk?tt;^4V!A`y zT3OF4*v?zq3PK%-rS8;V68-Ico#I+5%bJZMHadRYUCku0!T!_|z1}H`UQv?bpgn*zcRjj<8T7)HyE9h$ z?mWF*CM?N9Qmr>dClV<2W|G9>oIpg*lUCM31X+U6TcyfGiSWp2q6hsg$YPW|GWr$wjfjfb{c~Ynes3;GJkDvv zRie=Ct07ck7ess2S^gYKS8(Wba&`%P~B>Mk&<646DK z;d#>ic1{~CwovDYDjWA!1jLy=*7O!Pt+0jRSk*gin>7@Nb6(Yx6-XG4o$a<30rraD zDrlttETr48HN=HA1`2iBD^ih{4cH}O;iBU>p@F)vT<(i)AkL&Ew>wSS;W#06TVoBy zMU4&}0E>-ajJRO7{myK&QfER3;+7LQ$A=`^Q|-^gsF+Y)Ptb7be; zEiWA#m`iw-jT!-tJGK--$&hy}Mj$0X$jZ$fqn)FhE#K2i6TaDgODj#O^=Kq24}JfK zJKy?Gcq)c z9a)Z%pqJieGPkjqw|jcOeD5Sw@RpQjg~uAgLyaV&P$UwfoPeZ&VCT;A=y;)kn2=z1 zfiU1$La@$9Is#A$un*JUN6m&vbrt3Pt1~nER+m?ZbrCY7RZ>>h%AfO}7>U}In3)O| zY2Nr{U$v()7Oj3M)jfWg)U^7Znfv!YX70U7K-wvj=+c8iwCNJ5Hmy85?b;ZJ1oc=d z5kpFv=3jp6jZyaX2IMz0Nga=_N{pX#FzJ~h^I6L%GNgbL^9N^sT$Ct3Gee1aM(YT* z*mSGO$m|UQZh~^++5qC8nM3E!4iBC?Hzec+htHfn9Lm8gTRzM6yLU$v%(A)n(_%gB zu8&)Qs0Zr&O@A=AboKDw6dk`T&$4UOC`aP%9Gf+_2B;`s1I*D@qXSjC7BHx{$3bD* zw+g7NTn+5=30vP3D=Fl1^R&^D0!u20 zox>n)ZQU_gcdbP_JKChXInJY4^zIk(#AJ0z8Gmx(+1^sp*72;e68_|P6&!zNI5TF? z^e!$pCUkY-S}s>VJ-5c68wf4ba|w(0?nW{<=InG#@|wNV>G((j^pdLa$$(~k=lBZ# z`Pr82i7lkGlIqEc0Kil1#&@f#ETrb~PDO*FPxY{d!>jV*_lL&UAM9M%aKIARcwk{? z!@-_K8Is(khQ)4~Ph1gXgw8}ie3l))Gr=ouu9=u5l@wR+Uo#o-B?~9hpcj-@VZU-` zr}w1#`z$^+9TT+GZ_V_aK66o;8p-DB=jMiexG{6nvr)Zx{hsMHTptQ*YV9BDlhq|H zyorgbmJ;5jzKNRRm!ipqB_({;+fYRdtCmqIyH{nby7z=BJXVV$blzi;aMF>%GIgi~PgKzfIO`fcr8gTMP@s?)Uu;ErrI%N4ZBiLlP~KIIzGGl9(uV7CTx24uAQ9 z9ft+bE>{qB-9LEPAtAKN6-;SZW!hoYKW1y2c1Qs2)KVKBKw^a2%SsT&9aiZErbMmh zF+%8?+lZ}okk>tEjx75=7(|U<*tN0mel)Oy3`eSc%Rn(sPL4!|chH)%qp|)6VA-_h zV|aNS$bfdH>TT>ObY=rb{<76V6vOD#m((5>$9#L4USRxo1LsRxfS7{ROzAyl0+QX?w!8DX+IaJ|J{r}f6&SZ1?98|1E|q>XaP$GP+mQG z*8}-$FeW|#O49t1(RKkcvUVRNbM1N+KskN=4-_Fuh`|&FKqZn_EnfhmdFq>dY(kuf zx6@NBj1$E%<@ChG-no+GWlz7F<N%O*4Ki3((TZm!BGcRHB zA9~$?unSi_3pME6W?cQ&j14$SLQ}FRm-Xl%<@|?AiNKUnqk1MR+_RArV z9v^R=EK+UH@eUNP*~HM~xY|_jj{rL_0c33`Tl_tmTQuYDb-HgZm)b;kP07dhB2MxC zp}UkY-+@3ba{L>*TWXwRf$>Ta-qYu;FOX*k8L{?#>*I+px?(JFj7xQ+zro90K%jTb z5*PYEyiy@|@r^`&3G%ZPTP-NOU282`{#uRM2e25VRZiU=2%uJ93WnxFG~ zl0(IV|4T{3#JMT}hy`Mmet2lV8UT!dfu9!#*kbf3ATx?pgGi4q)B6!Hr10&)j2~C8 zBKi4b1ddTb29+}Q$9>yOgGONpkG6git5(ErS35*$D6RD(V4Dl%06?Pp#@6TQFEL?B zdAPXX#s47NBdlbm*asx2@qNVNKUD)0P{{Qbhee3}{~y!}U6S{d{_F`)@L5qBt_U>D zVtBjfd6g{(%;DQf7=oXE*{BML1&pd<2KmO~`%nX3^J)Mv*$OVAJ|4#FO zcGf%~In?1LfTt#HxuJruegsgBN8Xl9GU6m5Ng4xG4P%g@_5NH>cer0xf(MrGCx#u0 zduqQ^uT@j~lOJ6+Z5?N{$su8G&GNJfD~Qm&LFw<` z43g{_hTh7@Xd%_sYOh#(In{6|0sZ+1MZ8V36IB8E(SSf|G>+q<0Ooa@(YCzvY*R8x zl|Xr|=(y-lSi61-=`$g7$=dF?Xwt$McCc2!)OdkY8eH=pQvy?G(EZg&4n}6Z|q7mu8(gSD!M|z_w zaS>gk>&r@aP92Dkc0G4h08fL&n+~1sh}&iicIhiC{73G4AA?@!jo5mTZLRYX=#WT& z{PIN5ZD!)Yb_d|{%9^ci0XIW*1H;Z(higj<_VsnCy8oKJ${Ab*dcJqKY|iPhtGvF; z&ILQ?Z!f-u>n)dWqUW*Uboo|#h3xH+CR7WJw|nySbmxM`B6fXLI%o>5|Y&W{2IU1VDgVzKxEu;h75cay z2;e0Jr6G@=)HNwd$0;&-VYi!2T;=)LtR_e@(2@`M#a{WjzpXTL@r>C^Y!~a8fuo4! zwgzV2@Ms#+3xAbpzs0EVaF0>KD$2{rew^Fb+ay8~*{IrMMeT!S8*hYN6T5MIB zh5_=B6$c?F7@1D7j$%8r_k25bf(%QB#jbW(m1FlQzCORND)V1!vdD{JH>14Y4xW0vf~#>p}IQ$*krVIn4aMi1z;cP=h@! zy@Z~ZkVtW8K4vdaRBNJ8&0QdgUzb=P+E$Mff(A)xX$3hiSk3U1J2OYbuwCKuD#G9E z?1^WiVJS2#D+q?#7z|Nq7IWG#N7^v6B`q*C6d`1B1!bksA;Yq^+y-Akxc=^aTZjq~ zyjcBb{H*DDCqgDqkQ&jWo7htbKl1j+1Yg6jLfX`27o`7<=Euczj*tFQdJa6kNm~kb z0`imhX<_(<@HzjS%{dF!EwI>(06X$rhWb`?cY+*dK?fHuoLtyeK03S9QnSuR%#|Iq zmD^^@GHvCy0OeNG=`Crw)%S9%)38Lz1^=0Cdw1^IHaD~7zoCUa(M754yHDP_-ShJ5 zi`}`s%IrD7=k(>h#)%!KQPYmH!0hE&fepsJ#s2VoQJN+7+ooE1@c`u(6}@A+6?%w+o4od#sb z5+hU+JG=5KI$P!#}*b)zZZ zzM0tv5orqp({h3o`SR{XrrGqx^Tya)wh3nAt)fa z*!%H$OG#Lor!I}t(*(Hbzu3nA1*5)vvzU8j?VlsgDY`yT`ZySa=|=VSFNJ_!s$Q>w zEo`M&65TCv$4_A~)8JGfFVD%UeC0${&6??^ryBXocfrB--%P!OLv@v_CdwAzQQm|f zc*4&BpP%uA=%eT(0sldl_V@Goo|^LgR~n+y3m7vvOzMWqK2Pd@Q#rE)&BIv5lP?bZL&X=mZWrfO! zR6~qklWy3ei$X>2hm+h^FO1UJrt%9`o<-a&cGiS3Tg@K^muka`odKV>>Fi%I7)PQ}dOA74GT$1bmYCaA3yBACnX)ZKThxXLIrq}w=kK`*b=)Y9uAsZJz%n~bXb zd}lZel%Mg488z6x{^U& zk$Y$Bq3&EbH{94bF_MsJj3WX%h<`5P~Jq@3|U+L zSZwlkoB*D?+Wc*~**6gf$u?EH4Xqvxfd5U|)}HSuO%1zuHdbXPciEl32uisEz>%9S+}+gRU@>Ew8h2WE*)$l9`siX9sR*WzHX0jjx~z9LHDbP5NW}}% z*v1Bv-lS`+V{o{kF@`+}2)$9*otl)A+}X{FQIoE)x<#s^+)PHW4lsMGkc@!n3CZST};=Hp9 zfqSJ$Xu8+==F_z z3l;#0@s>`!IXk+uK@q!gs>VdRKcqsHmvDwX~Gzg4V`fNwdJO zUZ6^yUax=oP15PADt1(T1$c1#pEuhE>l*4Cwy(~qygf7oz|x0u_Y49Kr0T4ptj$B4 zHw|qn&dV9zSXN(Fx6{;drvg0GEGiY2N~#vG&d*io6#B}wLqP5Y_8&hNIX|<1erm<~ z`94kds(EaQfBYdKuDLnh@;H|zd!P4jLW`lL`Co6(HFfBF78wTgofQMc;uB31!%f2# zT@G1U4GqAoZgmw1A!xgfVBYTrE9lCAHB|1QGio43{tu)`uJqIm%245Z>OgqNs6~wnu9Rm-)s|#@iMawfdLnb6)L*Su6TB9aT;s#VQGjnK_%+g4K{sbWE*upX_%kW6(TNS_zZrL<}Pf1Mh zV@PMOg&_axpEFW};x$%j8=>)Cj%E>TdJy!<(3(8WSbnDP#NYHWt;ZH@vt7SGU$mrP zah4(6b)mhib?8%L@7xhIc+{s@?3A?r){Snf8!apdS8l%moE?6iAjw)2o(Aq-)IESn3-4y8KY*s%wSoXZZ`na# z_X+tP=4dWkQ@hW0`}54|iR{VLXo2$}N?pI4?Hj!&&n>lMlRrJMd)E{Uh%lf%qgO>0XA0Kn%mr)KHDUoG=@*OWw151b)mcpwrrN6h>XytRVtdYP8MrUK8OQ{i zc#C-5ex4nRpfjzYtCdR&p}M+`IiF|bDUuwo%4~2Lp{r{OJK<}gt?j60z|#HtsKKY7 zkkycNoJIwavKq49cv`eiL`2EC`odc}Cvri3<~1q}OvwDa4kb(U276BiZVj0ybf0;* zoV%X!jMRB_yTwT+6(rqhR0tvK^G4~;4_s4U2fI^0y9|SD{hjS0%OEZ&BySk}+3HTc z=|=t2c?gW;IitY9QjDuT(tjBAXMh_O@P7*it;uSsD~%A8M@B}L4%on~ir`K*0}-W> zkx}Jk5#eD&S;HW3+>tkuH|-?yw_}Q!F+*(Z(xrNR#4@n^Y}42YdTd~)#yz^2qz0kW3k%$+z~ry1vS zbZ-aMHOfxrWbSmvRpmHg=tE&X6%;5gr_u@6k%OZVJgNo)c|J}#olef3W+y9w5Gli+ z>b3E~zr+xPI1J@&e`pHDt%^5~1kM_q*tCJE%~r5opx+ z6L;b8_XD}kgHkT{>^skQ+fnx0&F-*=!4=_gSOv`wiu&cg=fB(TqPG3Z{{5^W#zCwh zHly~P{Z^@PCl%_*I~4luo#~y=^K{+|YRVC)9dENK{@rmGz4Etx%vrn-;C0LMb5BLj z?}OP3bnSqytvP$>Q=vz*z7zBx(swM#9(>a?Mv`Rt4g0aN#qx6F38TC`Br2a=&f2}JED82*!%NU%SflH2esf&mC2fWY_q z&(gDx>o*C;ycT00sUA4w48#v)r)SH3Y)+>GG@Ph=CVi$O^26tFPPi(LU&CI`nF7Ct zGdPzGfKL@R#S)rJbfMwC3#YV9pF@3s6@?}w03sISnZ&CXde?yR-v3|q8@!xaU>!ZqYXJ&Y=x^b zfrX10bqU|_a(sKw0OFI2`5+MFo1x%0QXK0Y&~?Y?t5(zL42{(5zF4E7(rId{{JiaM z71CC<+ZH*Oh_p$Z^AP`u=Lx#n$Ea(3P#kjff$_iZk&#hlt3u6@Q+83-tG&H;SVz4- z#SSc3ASjEB{MFWY@Jew=(}OxjpCkjE%rWxf_ob($?@jlQ=NQ4sK;RZIW`L(D%?%FA z4+#y)Re!trE9+09Z#_eDLqkII^MZo|HR5J4D00;uw>w6A^tl}{O}|E~?O&u)g_uBY zi;6mTQnmit2vvk2PlRw{E?+rqv`)Lw~lsM&&7ECfyVrS!Z_Ife1rb! z>uVmoI=Fbr*;D&AvP~QgC(g)bG4~!*IDof;9TdklFxjzezc>zuZQ8f*)ER(fPpAP9 zhR*eK&dziB&b+I~C+VSLl*&18&eeH3&l#&8PbEy`!kz1@FvzAD0RlKX~e2LEW)6Oo__0BeGeOv9BLuVFEMMXzxKdDCxfWRBOG}aoD*e#(o z!S*KeS#y8$gN~GHW&HzXU3E(5OlL~9ssVHtq-v;6>A2I}kDqd4MYDjJ67EECzuid$ zAbu#$}xOdAuOgN2|`aumS(!(Az8S9%6~4{#s&f^jR+{>k}UTOe^&|t26f>m()wdww|@Wf2@h>df(1j2~g&A znx5I`CtgH*OGWtJ&gh-|7VR9t=B>D4CrsM-4&y^sNQ?5vBexV%mX2=#g)6%q0PHR8 z?$l>Ep(AWO>HmeTncF^!Y;MgRDnEsTeV&}LcAe;|MVcnX9ReuRx>>{g z1S>700|2i|(I=y)$^M(Rn7*Oc49~#UZXye8i$t1-0fS>+Tv!=99mF|yUL5ahE&H1Q zED5dkOAy&k?=Wo#C}aBE{h_te@>1~Dk*Gs7Os#$w0r^_IU?)u0_>sUeNK@l59iqVi zz8iRI)AkP(ZCLhtCxx(}#A}9`gTVv+u&cr?kTX~4$p2X$&{8HD1XwuTp{sA0{9Wzc^#xQiXb3y@{t@!oCDN~Ex66_C|2-2}aC zgWJ?uoo$;4Ztfi-c6U=J26fS6gJ>NUts5JR){PH#Qy~RDXQh!n-Hm_2?Y{KwYV46l z-pTg?xTeh#^MQ%|z9;bKT${oh&){Ap8^fT305N;Bp_<&jF7&yuqqiafdU#MLx-BwO z@;(gTpa;BK)pXVomuLtZ20X{6`;TDHFWE!oou7o(ZorCSG=bNktKPN^@L#)LTw+zZ z+PmGTiW~scw{!%%*<0visIKy($asMt#ODMHzWIy?DWyhQMz51&8> zzRq$%pk@TdL{HDMUije< z1`^S2MEJk3kg~%OR8jIdYel=F4GPD>XVFBZu7|I;haYlcE5odWVxP=kZUD2EW=1zg zzQifHx>=mDVBuHAfW6`Q=QnE|4xE=ay_q^?hS93hgO))Av+{_-7I=NYc=31c!ywnCjS`eOh&*9)^?Yz8c_T+7fcI4;n;2qp6wL~B);@GHQXNAZG`%iTLQX2 zs{zum+(xTf-e|#SzW+cs&W0@;`i2PFN?*mM5Mvc}fH>z7Xn3Mcp;0K#~`hch6z}Ce4hjVa=)2WX+QQT!Xf5O*^4>}iB^4l)G!^sD#_V1$y39x|r@{mm=@vurz+G*7qw5noNS-`S=A#8uuI5H<} zf8=q0I{C)J7C>17{$JXYjPB!+c>K>>YRrU9Zs@+K$VZS5q*E2xUed_H@+`Cs@U%85-AWn zNrWD>*wh%QIMZNE$*d~OscXn}&&?p__xHZDn;&-z;hhz7Zt#7ApTVQ^*g~6M!qE=;8al2J>(8}_ar2(V+ zXr5fc?Y|wrxR5Qz^)3u4kk%g2lvF+Fm+DaArB_R0DU=njMFiA;+fvYbc z1wj>5%82z68x2_JEg=eq{$8($EIs~3vm>hUii4*{!I<_++0y#5U+@+@1QbVejRjkcLD4SbW=QjWSqBfqyB9}HC6Xf30P@QwC)R$P zvU4R&#og5y(hpJYphqoerXl}mEXvF+1$$Cr5?6rz&Vp}eXYB?5(KGkzKXlI??9Ye$ zmY?LNVv;EeT2g4r(qA`0sxBs|uz4g+?OPZYT} zJ6a+a`ZE!0tA#Bj)E2O$am3etV{JqqaU(=hbIRd28rD~F1stP5?Hk<~Yxv&q%LK0QWVbtYMKrD(4Mcs;o3N|a+y)g=!nLH_!P%P_?kDlcf; zeRvB$3YN9gCGQ#U3U7aeheiMeAUeQg>JbjS0Kyoezsj-+gq%)3?m%tXr{#aN8nqX; zmTE8<1ROU$ zlXF(be;~7JJ`gK12872Z|7i3{O60Va{+iKq;48Oeo$iXi?sA|GsysfzeU9x;z&ADN z?cS*ugh=nJ0zXc3?%xKf_;DFYf7_Gv+dmJY`1u+Y{I=hI*PbWL{3u?gkO7=-fhtfd z`E6f9^Cpl=8&@Ct%IqsCWMRv1LoUcS@@Nv zESV8?Dm;C_eci`3<57^j1O04bkh%SVunPSHuKu{Kz$qDzukY2b7pp!t21w)|+LV`K zny#O6Pp3bR+Egt6L6|wL)B0)-NK2QW($aGC($epyr@u>0%gs+o`|#=VV`_R{zEXIF zaQ#oo#MK@5{KHj3;_La;w7JuyL=O!3)Y0)gXutH|Z>y0LT1XmSZhd^*hJ3tM+aNpL zLGWunU>^_+1n>QBB$Zv>D&ym9|Cu1=0g_Nz0oCH20@HBwxpbMzJus^zC_5`KATTp9 zB)cRi3z=Z1)AQ-77;Cj#0X0m9!OM8xvYc&Y{1uNRvSw4aP7h}(zOI~4LV_ix%|A*Ib$UgL<-32?}BghZ7LSK>;cvF|z>6e)3E}*?d zZUbHX_|?{}u*0t|^UWVHk<<@xmCT7f6GH8$ibRJz2vL4>c#r@Vv(kn06&EFq1l6G2 z1*i8qlVByFOnbIuhRkC#ETA-q-hu6SkYK9k@o9#y67bAo_D0murAs}78fPLH7rpaS7|D!{VG#=#hC~;z8@Qu)E-=kc>CvMAw!+ zOQP{6k6YBRtJKz0VyjHyM}&r_1lTG)C8f5z8n{Kgn~AY;{jLj0a+2$UNqJ%{qYw}t z8qsco#71tRR6gO_a_^^c^_o##(Rq?sqSX|$_E(YtL??vTyB+9dllDh;=cEOOq(yTV zpi_-s*tE(#lCb#UFfXN0#8?0b1M$ViSWuTX7*rl;q17CvP&54jglkAzpvI1nXd^|q)sqDjPMch4A2>~#1WSl2ikvz zcv)!g<*va!Q4UCTL?~0%V5!9exzp%h{-;6zdkl>}_Aj-=|G(_r@jc(mK$9?}G)W9t z2X15`72O)B#zxV|(t%^ZLJ?C+m*f~$Ms$1Qy}duIUTg`CtLdt$%IS);^<&#wx^g6*M|oL6$kTOI#&*30`UYm;K0A@NZURWb%~}RN zIk90+@yGn)WJjJb#0cA=`QQ@suvq)|q#~1CYqbyhy?0WWep!-Rgri$W!Un$UW(R|L(un z0v5X!9s8Ow_chUd@N7V?BdjP@(FVxV0H6rCP`-3n-@v=&3U#n8?LzP?{#?p zZOPrOqs!jj?~Kd%PO+Q7t?l#r1xH68??ui31#Mh2f%YH0=X4)Mw2!&lpM*AcoO5>R z)OR0r3|??TqwdA6uawDA_oVfW3h{fsbML~G&li>F|=s2eZ4dek7;3>AuR zy*`6>tn8Qr^cxI0SUA4v^(&Oax|iKEbhVw$s-p24V9QhD{QQN4L=-A9;llm{!~^^9 z`^9{e!?nXGL->>cQylG6#-6uo#wBp~ zz>w|W;I2TWi6QF^l%VmY5?22JB_7-0hE=z~kq63H(LR`>DPg$5KEf|G zI{y6p0iG~_UXy_cFh_QcEE%}GTjHL*+P+63c8)+o9(JeJxL^*ni_utajoAmERpW%Y zR3S$9uIWnoy=lOULv=34BEIYZ&-u~k9 z@xn#6_QBZsH=Q_%vH?~+t(GgRV&TX$#LWjX z&i0&g_P)5Wo8WN)&kla|W%iL{dS#Z8gn_{@Bx6=ZhGRxWcBbRY6N}Bts)YBLaj_(Z zXtbm=#$`D&j#(u9Uc$?p^A{2m?d?Ulu>aOezSFJ!E118DT8OK7iLV|qay*+p^}KS* z#;PR*jq7MbKb(y7kBj%R9qYiMn`Xk|%8ruYWc&ZsE@QOK8#>p_ToDA0hW?wG&Dyj3 z`yoZ<9Km*tn|O$BZ^t>ekJ);~$N9e=cOBZ=ozcN%R;V?tj*+KyqhW!9W3}U>p7vx} ztij$8D<+;8YKd}bA-Zz_;SyKvB zidG+!MZY7fsLb+x=)HV%D-41{Oj?=Tqmoghve~o6o6R#cbtmx_>jqs zeC_!}chqbBTqz_cdqNJ~`x+*7!F~`pEjI+Re|ekzKFHaj1$PpWDNo zaaHYq{AX0o54Hy?ezx1O3J@xoK9rS2wvd!cm5OK~SqieQ7NC?;u9(y0O$rNi~SU^w4vfS7Qvb)5C;;-y81+i>cY7F3d{tTbGpN~;W)m5-hY@NdF5`3IaSAC-ky zs?r4ErKYl^7AxxQ+g3%^#bavDI^c0;^vixDCo>rjO+-zgz-D5r?BSft0L_l21dgFM{S8ewO42DSYIWDUI1~_n(crUvf z^*6&3BF4S6hiBi5c)j6>;z$_6T6i@M&uW=MSvP@Pj?xT4^_8`Et-IVa7&5lsJoNPKdP7}8d zluN)9PVJ{W4s1IaC9%Ukvhx6 z#-pSM4T(oJ&X~pADXiF87#A0H>@$j)e5$DaPa$`Cn^V{1aOz)dRQ}q?q_$B;{!Xpd z)i_=6sEhUefEb;}MQxnUc8-2*;~{u6x9VR$7muYfEXkWgg$PAu-(MyeHr^@u*&qDW?*#;z z$Xy9U;gQ)P8fz$=a}4hicJNRb4ttc72DjeRaVNjA!KS9h#*RRN|7{cuI_mB|28Gz& z$wP0R5wNXYuU#{4Ip}VyT|bqWs1@F{bxNK%x9{XSYh<+^QfhgB*SsngpZ4Klc6Ov{?r4> zGoQMyom}VM-u&GGjcxNXJ=OcXs(97s>%nwaDKDTdC==Y7Zkxm_FQP6gmF@$kV7XVD zBiaFoBAIhKcU!~Lj&iWLutNt!T?m|GaHzE=#Oq1H%q%vi76 zQO}_sY?^_wt=q0$18$!C%By$+UTeO6Eo!f0z?L&3&LdN`)!|APWwNn${iyTk=`8_! zodmb9t~EUYRsQ3H7Po^YP1;2$2m9b)PO#!9+X&!Pc7T57L7bpqdlW{yXwuXU27di} z3FrRrv!h8DKs4=sTJ#0*3gdIZ{iL(@;+9vp3AbNuxu`91K$qM_4iL~0oC*2%wmbjI z-udiY<3YE!I}tPHeKIOCYVIMmj=7LPIxYp^`6pEP9{b{bb-6`gEHy87v=8#{EI2_D zEoA;3%58|8tY%y^QGok#6_pj`6)#||l@@DA%K@I@w7c8yzl+rkvvcGI%Kak)KyCDh z^`(cm>QT1R%MLiqroF2k2-j2|A4Xt17SqwLw#f)5Xj)V5rvACzoXJQ}ZkNBXCp2an zy#G$dZ$1kO5y+P>?QAKHHu$R8PBH6+5^n;ND;Bg~3@I$DfDG6Mqh))G;l$wwqz#N`; z-gUm%y$}Er=(J3qmYNDDHj;qfOiT03ojY!6eNTzoiG>1_<3@KDK%)EP>Alk%*&EnB z7zusqH#DNw0HV)pxgIxFZ>paf?i2lhO^~cXd!alv{(gFAtoZUm*k?GjF-cf&ga=J5 zCVQg2F&uxK-*XGT{1Dc2T`vD9Xq%yvn1=AcdM9c7V9r?b37j)rdj4397uqX-TqHmO zl=M%d_xw*Njw*dACE8D_=od?Gd6)T~QX2-Zch;5td8RhQlUR{AGN5d_l;G2M-XM_D zUg-c3*}HWsI&8Gl>@0OCO*6FHsOZqmq%;nSaFnv))D&poqEy6uLS;X+%%SYZvF~P% z79jnY4r(E9`Dm4W2;+Vi6ZP36orf=@qQBvWJw;XbAei?BO>cc~8GQ54162=$)n{cL zz0iGew6KmXgzB7PNNM@rI~~-*j992fJ%w?vs)MV3CA=)YEb zS?$GOM(Qsu4+Aq95SN3OQlpq0@6=1RHv&FDs*Fh+#vTuFqb%2PHB)3hCH^@?dAO~zmmSY~AKbiFDa zw>b%hS*pf}*MvDzStq4h{qwCihzK&0&S?m2`@j;o3pcNOs3b}uwf5pbwcFonM z905(~jKqLk$8_`^;nlo<)@%2PaqiGkn&{mCqiCO)T^=G+jbK>T16P&5#W%dZ#uv0GmswMj z%cuzYn7H^olyFUb4PH1l_8gpriWH!YRwiALUX)tBzxZ66vj#H<{VLCQt=pdg?p~V- z&U%3-?guEHe)V;WqTbZkidBGKW{Vn{O0wuF)EK=knwCyYuPCBsk&_IuT3rS$lU`a( z9#UGW)o3$)g8-J%Qd=v$uvQ2T8)1dnFZ@rVd?6Y4ce9o62fS0@+HM( zh1L5i=-Qe)lrzM8nA5K?9IVEVZIjEXXmyUVVf!JZmcE`1hjO4j(_+oVZ5#q99X66{ z4`y3MS9iAF0c0MC^RhzJ$m2O7HYboL0KQ>$_SJ~Vxe7PEQOtGKN&Liq1SB!K655w+ zGW|0;iFTM?doT`T%4}PViK~Y`;3Y|4dd$ zR)2E$TJdBRp(yNiU1d4x-Db}#0IxLcRZm@28L3D|`1#MSkKdQwPCkF{x)}nX9SOke zhI8Rp|B$)HTOoS@LXBU@9%t}eFh~H-&G?D<6?^XRkg=OcIv+oobYXNiFk*LM$Vfhq zvq$!fcs2!`ve)TNx|m1WhvS3jA8H=yV~lR3FR>l9q#*CM+C+@mn!zUo+0CBgEG11T#6ia9g{_s&C`1moT zjSw5!J_LvfY9$y$+CToG9`*ix%WcWFz?j6?wqPdoft(*dga}t~t0B?Y3hgkW_ZcJ* zmg!atM1Hl&k4O&|81~-Hyt~&R2#(0iwK>)2UzHTZ&-^zC$-qEI`u^p?@HWe7%t#o_ z8c`U-8ReicQDX+bLPQx17Ri#+W_TFVf4!wp3whdp`JY!iFWYoG;j(K);19=DRtgoDw7KH{IBGGr@@j*OM5X8B* z6)_Fyy%nfd5P6pw8I?tjVK0orpd-ih>_Tfq_p_KX+RUyNoM+~Ait7x3L$;}AscpQK zn4)If$0fM=#=8!yePwilKBVJ*4vS@O;;D3T^CCf?NH8B4%afU_0$4dYf^Mo&L{|B( ziFb8#!zJ8TGh{R~V#xk&c23SR+XT3XqV~OyOK^{f!#$DH<-CS<-p?jP#~lzwNfkez zwdhpReM$E6h%T~0OjY|1$GiHnoGtHEzB0NQvBZ8Jpp4k!qTl^04C-i?wT}b|e|@*e z`pvw_{rOXrdRRk$yTqF<3QctW6T@kikf|~JqN~56#qx{*rPg##5-C#&A}<=We5E`? zjQ(|dPzlW-CY7+U&_q|7i0$3}{XT7t8uj$LyJ`NP@5`+`p7q)tDw<6oRxCZy1&U=C zODPmRzxYK-7`{R{FOD1-T<1;N0L4g2WR3=w&Vjd(_7w_S3LSN$!?{`Qi8`J^s$5a62__it6a>!stqjJ2uUr#b#? zYw*K$jx|j1URiVeV7uZ|%Q#&9?#t#Ao5Kex|1>w)sk6`?Pnrg3!lhcq0nj)^cvmIe|d^;8$wbFM3+GzpsbR?afIr7my zDA)@qs5;}kRmk|vMqDVsvT zj`RFdjE<%r&qJZ}vnbSuOBj^xa+1FxE9>Y|_wpz!tAYQ;CL0uX`2l5h@(9MZ()U8> z#a1<@`w@(P^ASpi<6r&x6ZA+tnC;(_kZ00Rb2qb{ ziKr?A{ES51_!RzO4x`Ve19OZUs;NA8k81qTIOpA_Z&r+SMX{Lofwr9$trHGL`qwOE z`*+A#rKXS~A{9KS?S?%WJ?4GnnZfrl!`ZP0P^R|pv z1ii-fQCNvl3SMO;eRL&Zk(!h+QY)>c5Bw!mA4kQI<_3N!2#5O zh+h0Ja{K={k?%M7udhW8GPDiV6~pU6c2rni&cV$&aZy6*^17M2oQB+7lo5g6y*b<% z8#_FYnn5!LF{r%Qs>FDG451QMh4-ni_rX`sxZc~ND#f~EyeXfk1C)`pHbPZbnEW@U zpa*|%ORVelr*_H?73*;qo)^Hexc%k8){E$53$J$fU5rv%#M2p*4~ZlaMWp0tf>Fb> zA1EP zdwSj7FxhgeolspJE`M-kQBS}zdxuIJS8}_*r?Sm9FktrU4pC%GVS+q&=N=}69=&?KSNG~xztb(C`6*-H4@J*8YF*D5PaF1V z&EQO1y+(u%5J!)u8_R|IMJLL>J#Buzu2W9;i&grTExAhXG~R74ffvdJ3g2lCm2bzo zXSW)^;yj@--SC9!cmMZExCpvXnr$`-ntt)02s)FpzR@HZ41xZ`Noq1wzWBg@ z2p!@a1ti_Tz3dc`DA|A&3zMUKh@_uL4w)wqex`qW?uwre38(MH*0o3?G?EYZ*$9n; zZuEikBcVj(T1Mre()T977#Kmf_UZ-qS%O|a9n>H+3mU*__oXMyx>fpKaJ%m`aD%`s zYyhQ8-2tv)!C+SQ5P>CT4gJgY{JBu@;yHMs#sa~{NQj)!;)M`!f|Lxb!+i7GGq#C+ z|J%O#)}&#XSd+mQYBV0_C!=uDtX;kBx#{_~)mn2hX|9{DPv*~}(D-E3K|sAE+(%~e zvW}!^BFWaC*)kQ{+k1f`t0>RqDB(#H-YdZP?~3X4zi_FK4-cDS_PI;&0(J1-CP{>> z-s>{*z3~AzxH;ZFQbhFe9C;j-WAwHnM`+D`S$UZ@*`$g@=PFLMKN*$n-HQN9ryHKL zkq_gCs&3i8Kxa|7)kZcYt=gS*JU4)V2wBRB;A{$p?am0Goz#J{2yA0D7r&?G*frZw z6(7di#1V2f@euq_8D$)+2`L1mgLIA1oVObmyh*gMGz3A&4ImwNuf7v)!=Yc?vIpY- zA>GIUQk>4adyE?0^Q~>azG?m&7A4lJ(3q!D5zhyfz+sEJF=(_yU!S)aI`sU?I{<<_ z8vX>iUkV0Gr64dM6ojr=xgw&>R)$7PNeLiq4V{{vns9ZMCP1Np@M-ui$VFZaqtlaQ zj#z*Z3PT-N5?Ciod14x>0xRq zxvc!ck7bG*-)Xb>GS?jB`F&47PHMu~#EnDSzqf`^FFKWHu1_(0iV1qGMd0;+s5x_# z-|NodM^P0?&vR~AzP*`z4ajz$Z_n^?^Z)Srt58;P%y54G#=?yQ`Nf7z->4f~${q^l3yVc39AiHNwjJP#w|ICxS+mzi&P*mS?c?O;L{+%^^-D1#FCNt@Kb>9=bY`@>xG#!D}-k^{PA!_ zw?y32_~Fs{WfIBqvyVSEbW26O6Tket-Yr~}K6AYoU}i3=Ch^OBnJ(<#a2&?r_;RF9 z9U#l*2)UYF-<=ydkuj!}>$CzUPuT)&c+$A0^B2O+SYdf&{h1i@fxfzM3EP_K#dgM~ zo zASN&>Ta>>tZg>nDWwhMbz<7YNtT&`9xUh)(C~rYf@A&ed&Y& zKz>neep%tXL*0?Ovb}S)rS(Su+$$1*h@7v=oShBb6}qc>KO%1rZ>RsxqU;PH_-gyD z%6FB&-Kzc#AhuN<=;i>40zmWWjOyvTr@yJ*{sxR}di(Az0Rc$>g5Qx5H=^7i#o{Ga z0GAKD@e~p*VHQaN$;lID^RKT@7yzs*0FKzVdtyJ|bn-s#cgWiwluIqKZ5 zyJu@Vb}eh;W`#$$JQ)zQMB}2JEx+hV%cwXD_~r+ch;*&b2c@kh7o!tVKoAT)Yr6$q z63{+4b4p|L`tF@qkrSPm2ISZK5)xj(V4vzf6Tw~pN}#^Uq><6& z$$7i*#KZ`||MRA2gw00aK$`=V00d?x=ivyBF=~E-i2$%ZIJSHuIeI5`1`EDVKmbMi z8A@r}AqL~1Gn{I7>2YZ(*0HqwQeXcXtldm`DkZgi28CVI*LSHr4T~*Jdvpm!g}WSN zFdhMCGOmAC`0O6|B>({#6|_yX?;0()4ZNZ5Vea|JNMI(6F<4C2hraACg8jhVek*w zpB_DCIQAwgDq^SLnrJCnZYJiZ>!5jOXK0Kqe0i%qJbSw)$%1aO|%n(ic$PZK&|f zh|yEPk_rgMTqsXVBW+h2xmI!nx8P-%TVCG)j}#G5838&bo_7diab;ije&UeZ*JlZ_-B zi@BeKpN&B`&y0HAQBFb5aNi&A&xG@j-~ZoOraIGq z%KT-vdO7p$8o9iq>$l3(pRF9SDs68w*jJZSF*pa@-T$SSaC&Lh3*}bSO7JMSl=$G_ zA9>m1c}Q}cskZtIR(^{lPCvRo$>$+caz-!l1j|H*-64PWWZm+V`9ZTvSM*Co|hqle`ZtTDtpJI z{UkIgX}_brN+K2+5-w3XA0OOMMCOTOWB7qG3_OVw83v^}>0KaJYS@-Bb}^ZR6DK5q zYS%856Imi5@(cz$gGekZ&f7O&9B`!h6dM0UV&x&Glzl%H`)mxBpGh|C8--EUS+-A*b({gQ>%xehz;p2;GMZ z&6h~06wyravS1rJx{fi$L&vBvlM)qAO^(4l^gZXtR5Ov;XGQd{;v~QY=Zw;obRY)j zuFw7_6PX`V{k(4;#^BVGM8y+HD)tORiL1?xb=ZbnZ8Y_D0k!GuWnN6CWCotMB`As0 zO3oYKqYwSO4|YHh_ZHwbUr|v^X0*e#E%jhRH1M_Gc6-gnr1v3M9X8#eD~9)BM!97B z%K^V7)@jSU2Et)Yg-xplW~MBQX^XwerY?n`V#bx}I)XWQLXz7m`*wAP>=<#@^QpRfFW#4*E);YT|m*KqwoNKs>0ES4IMlNpNZVO-&0 zS_#5&;lcxh?11QN(@or|aiRQcRH|!z5`6=jA|29(7%&4E4!aqxcC1C0X@Fr5|B4| zv-6e^z!%HAb9AinYsM3P!F*f0r8nUJW8@3fSn=f-Ech5ORssemo_}>M1w~$D`ps3L zx|D*gbD2)!Hj%JZn%(U7faU(JsLGAVp6Q&*Z}x%Iqi`xA3)lp{^t+e;w4hwUN&AMjiPj3H`2>GjXM38z3U&ABgDg7viicxC%%z`wSkRR?&h>-dCHlv#*v_|MIGwfu%(jgniCgBmlVhEoafMmeUWRIF zur!^8Ii0l;J2<0)CPIuK@vrK?!tXnyz8lGs>-O`(RCOOZ;Gs zp;b-b;Vf&7VV5JVoGJbK;v#Z)W4G_&{!}gk3oDg=4^;iC-OmF;T15S>WO#j{)iuu@ z*MM&ZvnT3qjdu)*|Gt%ZUoL7f*-^6f%U-urx=kCU1HhVUOUEkqDBIiJa%3B&^-g_< z;V%BBGYDPaW^o%o{9dbQN8Be|+n$?%DI1_>>Pj*m)+1F%`TuZuqd*|{SA18+*=-Xm z0r<^?ixsav;MOJDzzsO8-sO0EalT`jnK12J>}UGt^V2?cToDo6V}4yL6&y>q^sX*& z;=RpaQ_8oH*KQFYwPw8YcvQNOAg-ya;be32>voBE)%&rt*>$2?aV@ZGdzysJyVKt@ zZ7&!C-L=j6Qoj*6l^5xum0BPzrL}@2>rZ?89~rV}Hfj@P&~DtmJhP>}P|RiLE4FdL zzl%5RE%++`8qxFE$D}4P@NP);h0=!KpyF^kOTRb~$luapzrjX+TRq}VrfXFF67#+1 zJCw6gxbcsT6&j<;oR~M$<07lp4ekzpyPY+&=qDS#o9fkNXa`!!+Jg5RASs}6A~Mq> zSha(~yw5WBQfAhMgu=)O`5F@mS5CK zrMCNt%gs6KSbT0vf7TmuZlYPjdqLC#D8YU=bH#Z=LSy`XFbu>znu8BYoTqK7rilS*SG#XEz%6nd|>L?`wBvzmQq}2t+iKp->zDc;UjU~A-5%F?>mf9R?>`#t< zwv_02v&!f|(OG`OCXC;UlL*Q{fE2sAi`s?laNO2x^Arp#-%JGSy16Z+pSzBcTzLrx zBChAOVecN=%&!~ z$qA^(a|1-Cn9vNy8Ksw*)h}xhH{9l+BW=fRA=*FG6d_K}K^qR8QYhWR1K_=k*}E`$ zn}|eK~Hf| zMFtrwDwgIbOAYp)(7n0WFk}6a5M|YE^GqU1QrBOk6a&dh6ZTCbZ`X^gnXY&(QXTYo z5K@k-oo!S1wqm1l(xpB!tix9Ds#+_&q+o&D2z5)h7zP@yA5YI(KCg$4oKa!T z5#)Fbw(KKxor$~Bi3P4+o%L(?Do@HW4{ca~F7VPgs4|Z@r}XQSavKoD(0q z!VQB%OQi}_7B@%|I`9&^t^fOJRJlMqQ&UJRc> zpHfZ4TiMghKXuq~LU+G2T7s&wx;QgOG6q%*VCzc70@B{pH=|j9YP0h~|E4`}Ctic| z%}tuast7lia`9g-H9*Mc6eU{tiBEwNZ{rxFsi}_<``6IBhL3K1B9I3ni%XWdIW&9w6gyD(pH2w7e z>emAZy%Wz0JcJEheqkn7``RLy6!%D3NsW**MhcEl+MO8qXl*gR*C zkH2Hzj-N=`b5?xp$X22b1?DN{d#nFPmJCHT^n#X$^(|qywd6u0^MXbf;X*1FBo?tr zgsx!RDdW~{3!3xu8am*LXr!TVU;bO{y9E~-P7vUZhN!f@ZtE7O`SJ5EYZ5tkS(^htYH8Nol8SSg)LmpD*Y1i)V|07gT0kH+unu`R zYsSa!Kg5qf5T3}*U{RQwf))2pM{;Ff;1}{%D?|=~?aRzGBgoHlM_U&+_9g|vW`OWi zGpggM9Gi^2HQeA!^fgO;ImNBR95dMC9{ble<$_S=J}lsUR#vjd!*2{XS64RO2W4eV z(sRuX{T@G&042-K`Q4Y2~t$PEBD5Cbho%f&vy2y*WXpF69K>CCg8WwB-y9-<)8fRF$y<*6zWa zZCp5O8DJMhQME@|HMAbK#*$#3SJ1C81MY=nH`e`oYVA~t*YxjWp(k(EzY`t31o zFDrk8NM<0Jt=3TyijHb80`Ls!Eeu_Bix7aRMSDXCH z3R>$=G?2iyqQx3F2ecz1nU%`#@a91Xqv!`As>UqTQ;p0Py1#H!&1NJYE1f1g!JQEq zq7+Uv`sAw0Rpp!iwgCG?f;+&qN6~LphmKwb4hl7`M^Hc53B3m>Y2SpBXqW7UUL$&q zQ!sI5?CX2s%G3eWcChs81m7O7M#Bl33Lz_A>HcJn7u{r|`~>{DYFL~(qCHM$^p?BT zVH%RTL6_y=DX>*6Em4?b2z7&ENr~Te(NTGHX-r89uwv?*=4r=ELrlDmwS?Nz&kSB8-;TI z1qLsUajPyV0>SfS8XG^24(RCfU(FPR&h)_>c}2wv9;7#Q6RwER)+~LB-=X4I;UNf61HD~6H6Bbe%F8LeNC+ViV4VBJZ2jXj{P;Pxv*ra<#E-6jv_!b07 z@XSX9o`6$jBeukk7P+zYOEBJRK@y9qGaT^D9LL<(rcQ9#qrim!zUb454-WKA-^-8Ri2 z28_s-lQhe-7f@WyQoK+)q=+EwxxksT=H=lLQ>RUFWs~{pKYA*EzH9miNUa`Dz}UID ztKapiCX61>8#F=T>8{gMb)aInzy-X7afOMrS2_Q5Y&z=$H<9w-ZdedZ%Ur;lG;?_m z&sDX)Cj&DuH4~9?ZbP)8aDNq6HmC(5Wqzuue?;?BmS<8YOW%RZ&^v3GTeHG=JZ^Q` zqDtY)SpuPw*iOS#MB+DtGBlP2Qz?kTPYATE+2CWL2lj`A{cMBhgqKYenFGab{ZUZ@ z|DAO#=QEJM)%k+@-|T~!wAs^QxIGRtblk!9>(Zz28!ky3`D7AB>d@ka_Y@fmX*4}>M4+@QhJGw zkuyq+V+1VK+oSFgA{bn%1JbgUl+;mzq!x+STTdxbiqw;o#&%w)kQR!Dw4sA*f(FWV z)_k_O41HN%FVS#F^3qpevJ=>Z#M0s;zCpoo9#xw6gLv`?t@{ce;oz`HVu&ZAWMcAT|+tg9NA}1K=iz{@Zs~@fp?8xJV9n`+8tyO0z?CE zsuvnzEk+qx!>5nHWf{Tbf{U$&2x)^Xl?ZLrayLFvu|UCb5vqgb5N7e0J~6t#JI3pj=HVVQ>y{)&v8wF)V2TDc3jg?FK>qbnt- z#3JTST-IQ-ohj=lt#ZY0<8gjNB@wxh5-CTs#Y^4b%$DjljxS1JFyA?Os$?!d4l%py7SYR4CAW)`=f0o z4)$2`7ChpV0^(YXGF;;TaKBWZTv30l|506nH&bsf3wbaO9iuIJ;~+EjF>GeBJ7R<-QyLteChiJn8X#4OV-iSgm(_isms z4IJ=aa_mj&7V5E&bIZHn z>g7EqhJN{oqJihjHr#Bh;c2uZLx_#a9;w2W$b_=8ZVsgJ zho=)lDdmZobD?|%%ElAMmDF2-Nw`445TMqB_Ik-uu>Gisft4yGo{)!a_%SsVy+^uL ztB2Tyx>lP;ulBqm!!<}#4!bH0MEk_u0=G%}pu(o%L=b7_Vb0v+)@WZ)P*f>ry6gI4 zH=w;%$kYVjS6XyiO7LxCo0Jv;NLYPB0@|S^Cd>s>UVB4f+F9q9>SqJtbXW+*!5&qE?zCbygh9BF)q@ z?X~&JW+>>zK_t$p{1 zo6EO}N!_7T5FKp~RTW)@j=mY3OE1OCoZv$cL98A~yAD#@MHVf&fYaK}@{c3ASjY&lxkvDhZJo0&K29C%+M& z^nU@6e&;9eL`bIf#aPd%KLldEL)s)^Q@MY`Ah=$;E$j}M;!bpz)H*`{c*Fo3)TEhw zYL98Q+tiMO>{eQiGKrIN#!>&R;=7O86-AQvXkmkoB0*CM(ahcUqWEM55oy6nC9+EP z5^cujT0WKPlHwNMrh8(#mr_X&ifO%s^&2)*`DO|w;2>wdn5c)3O57|(#UU*Nm6}AG zX)~?I`psL`g4olCIu#tx9S0j9TB3K@ca^F%fg`N6ovzwLM_nrKs=}sPCvvo{XtwA_ zZakuAdXQ3VuC=7@w5FH3<3WvK0(KSdfVG-l>WOI`=&4DxnKsjUS`WukOhD5n&?Z`s z^|fiCqsYq4n54+BX7F;~3%{j}9#U_tUB|P^CHS6VT4#o_xglQR&K9tp@Y@)ilmUVd zeAx6q5;sbzKel!ZIL!R&A&CMSi0uc|Ow3FscxdGBth4$oc@&Tpr$LX}uDb@9dZ`gV z%hOV@yr!wON!!jGrSLYv{iOzunn4Y^^tHONq;EER3ohQk@PKI39{fE3RfFOi|Eyg< zEAS}$zEfAMD6z2U8lH>3i`meROr&uL?Ts( zpohKO?sy&e89G{D7Cc%sh7vV9>zTT)zj4lnJgg3Z9UI8;(JR5wQCT1p(BGwPLsg*M z-#C-@mop|0fmXNJuW_5}rSvN3Lwb!qqAl=PUHqM}U%ln;_u_j0()VUpEpqtbrE8|p ze1t}eUY9*y64HxAhDdnTLx9(6sIFS>SfRNp31eH!G5m1PWLOJD>Q%*VMl;aI3#2W%e+J~WsGJd=v zU={@i_^3h^s!)Y0sK{eukNw)bXBqE7Io^|m{hmg`JlZB^ThvU=)J)B2u0?FAjk$Vk zaP{WzM7$x`|LDJ@>T%IFv09>5YNb|crB-UC*5>mu;`3@X3j_juo)%*GQQD#>^WVbi zQ~D8pwGre1uPKE$ltU{~IwXjiA(&cqNSis%@cEBOBWV{7+C52cG8b{-G!d3PQ z(nQcCnhd|tj?gLX4BADdeKz>Kum9cbn+&JZjM&d_V*L>M7c~deGzU^TsBJnp(jgZQ z?S*E7i)PVmRgq!PN?JwcTX0=kO<@7(Lb@nj+$LQ@bm_&*tkdPNg03X1{1>C35~d}lIm*vPU~v;J+>U7C;m}d%DSA3>y1iS$r&H=jKS^@5Y03 zZUqb<1T^QHno?~~w)lUWSYtCp5-UfXL(Wn~+!6j7evbc$@0L^mCx3)L1U-0Kco=#r z|0^+{Fp95nn0JJGI=Z7;WK-x8#eQ1;M23H2mjdWA8MDwuv9`ud2BZGxJ}`

F4X6 z_b9UeKI=IOk(5iMMsgoZ;Tg}FAJyT^$7XCL?{9#C1{rLKp)$E-MRw9y$56mB&C1!T`H!(h~+;;+qddJ=JZL;b|y-FS_Ub+{_77MoB>b_*uY>N>ue=eFXw|~tw9DgMF(+^!SeJR0H1Jp9l$>4@;Jt~ z-V4`TW@2Ke*WxV+nF@NxIEGyKWPB0(F8k0T`4H?vXT4B!+HY!%6^9%Sx+u zF&@BQ!@!WhPtK!MTBEGq7s`EZ294`W$QiaN3ApE{8Kdx zQpb%(^DgHJUq-hA6FYcK?mArFrMc9{$KA+bhxj}}=Vq9mD%8VQT)|MgD~eufk6~JM zT{+{}XJVrb$-!JPwC7WjFj^kRc>0x08wNt*s2(2U(~Se@Q>%4QgH}?V{7;W?E|sF) zNPiy6nXIpHM4J89+N2Iz#3tUA!rhX!UAotPc324f5R(VczDozz=EOK3%oWj{rrzlgGnm5u`4uKA*e7VkkTHb&Av?_Wt za|y9|k69~dzL}W^f%;LIxwllx;)GSoc|R*}hFPQ6C@jWLZ`(#^qh| zQQlsqvV7HDP*j9asRHOdw(3E*$5xhLH1kLE+3^)cmIP`QtNZ@#w4gn-M~IExgXw48 z{mAzVrGdXh#fJb&K()V@VXz59AORBj9_A%TN|O(eOj96*ra~&DL0W-}ZQe1&etsQ= zzC6g-XZtd6$QuWh?=VTWh3b+Q5BlE^X8wY56MN6*y{|rT&;ENioKdsBl??_bIUq=# z_RnW&igjAv9ZYs|&U(I{MnAHzandeGN6~9q`L6XJ%GZ9@kZc_UKd_k?3yfw2?seXexLgDJPc%N=G!E5nO(iyHwtz7qYyh zL*GD;V9X~1@Gu_TqUaQT@W_If@w#_8g=>7}vLwNWz-K@wxd9z_W&vA@6AT3N5L5|% z(a-w8q#OE#_zfoFZrSv4jHJFy?S?2o00#860{AmRCDeF0u~-!dia~7$Q4WNI(Zmcm z!NO!Nid9atwynL_*AgOi%fvOYYfBgSAoqHQ2;GxcolN|28OM*nC>wg-@%BK5X+`CN zFx+m42qCgC3Yi}4^{0MRGdG}~fA6AR=2Lo?GVFvH6{}trO-}4C#nH{{&N;*0{t;5Q zliLV)-wKMvD7u%Qc+}0lZk(K?QW(_rppk-O|GpQDP)ez<8AXTR_nj&%*q7kES#1D# z@ChJLK}0Yigc4R7{xTK`Qe?UJ$Xj)gM5^@yXDlp6l(mw<-`0gRJA2sg@Z2teE8+B zU+vam(A!%C(DZIP!i3BIy$d&xjNw}#1?PNk@YBEf;>h;xn-f)&9=hjmbRYcT-P=Ob z=VkS<=ar{7HZnTuCfUj#?Emftn`?=Owy6I@cDoe-(NLh`eu~%sd~<)1thDy#{=$#{ z{vVlg-c6t+a{>TJE&>2OZ*gg)Q?WbwJG|%eMF3yi^<_y5r&>xyr2ccEMJKvHH-aC0 z+twwVk)!z!=ot}jEiQ0ZfGWRLxw`;ACJ?Of`G4l@a@}Bgaqr0^k9`@||9{7LzyIA# zynk1QEq_+NnEmizxPN0%|NKqa(nwnHf3`AoTmO)H2cSoOx|Pd*@GjZn@aBErUqAlq z@!>DAc3La`zxP)as`UM9E6|%Qxi@J6R11IS=a!VF?$s6kb$T>l#B`M;SF|>=QptET zf*6I84I=JFfK3+@axbpqG7)`}GzyHE4ke`&!3Z##lQmO@ej4JC826#lBxpoK9C46k zb1SF_3=P0_FeF%Vtm9;FNx{L~fno{V4`xZ^jq7p?DYWLZl?Le(pE#R9N4+KGY#h1D zxSC((o4eloIU1i8K$08RkG98pveF=Zs!cHE!IFHTxa3oDIks+> z@T9A+y<6~dhmr}VJm7z+*2u^jNl&`>v9{7NBT2dR6Kf6rbUwj_)1O5oX@0KgBA`#X zusJ$u@@5n}f6qggp$H_E*s*+fgp z-Q&Q>B245J%eO+0X=tTE`c#`>M%!;A2<^uu&AFQzXR!z0WQ%*jsHTd+QCfF}#Jmj9G zdJ7K@q5-Y+s?zLcS9;t+jI5*%6k{u)?%I+m28=?aeJiBi0+%HIkBuvUE7}!DGzAEx z(Yd+8f6dL=hl!=bQ-Gy2`_xWn`#}K8BYr}7syOIxBFdwz{pC=zUk*q9Ww1xF^k3F& zV}IG}OZ^{}Ls%XcSA+lZ+uKF}QJoCIA3NJ%Wo=Dt;Icck(>c{nBiRvS&&hYlmK%B_ zH^T|Y#)j6L`!pk_4OD*IXuX9}ti?C7MkN2+K_p(&{ZT7o^bGAyt+HV>`zL4HdWuBt zNM@`zZOxKx#jr7^p%n8`q3ua4L_P9f43Wj5)gr*;EVS0{RnxQBYBPcV^1HE3`s&*b za`8&i){>Nc^T0UdDc97a(1r0@?TNueGp!Y*JP<<288&YYm&`0gA)Cn}FqY0O7k1M` z=j1AWWXggB;|rrit!BtlMTwJ3qw7+12tiE|AMZ`|_J>NMx3MVdoSi?A$!0@vOJqduXN7ZYiDH z%4di3<_V_O%Qm56UaZ@$1de~K55sDhUe!PQl3slA7F;byukncB{pe83)=x5S&*D{g zdWH(Ty4Lb1hA97%5x{qWj8o9J$#a5CLJ*yA6lb%qp(77O_qub)@zh!;#fMteesP7p zTGpN$6bv{;4WJig?Xc+5m{5R2T9&W8E7z^)oUD58V&BHQfU0Y4^P`GS1o!cwj(M)5 z*+<^$Ck(Dw-U#;RN_ufSi=ZQ~Q>FLBzKDN?C)195qegIa@;QXrv$9_DeT&z55Xa1*nl-+ zIxT5hYxEW?h=4d+I;B86JNv76_dTaXr*FoNb|uiRlH7D^m5?+WKK^{OlQUFK`O<2v z-K+g_A8}M`jmw|edszg&!xRfxvOTZ*?Zx7lHO4fku%kw8NJWHY0M}5z|jutnRD3+_Th>R$=Oz$CEUlq#I<3_dUC@tXZD6rGz{0(zg ztJ-x}+k34{Dova;YdO+r=7Ne`_ue#St8Oe@Nx}Q?rAQi)HrR_k=x=J*Yc(Ow2-1Sp z*pY}czB^@NG)h|KdIB2VbgwwWS5r1rpAlPmg?9ZX-<{ZNa<=PT3l&uI(+It0iMX+n zg?6uvXhEg7+0uIMiZ@Gt$xck2X43p>3h&aYAM-~LsNP$&n0xs!3eFqIRm^7S)=JwUbBqX=fX>s+{T_c63@zTCMSFyhrE~>y6u; zfQs=`u249fl=i4)kBV$6u-E~-ULo-%W`jGELIaELM5Q*6B zvYC<33qhLvznq9I8xrzAj{~UM4kgx?CO$r#NX4D^7UJI}{A^3d8ncg$d$<_u^)WqP zsqb-64@Vv}j6Qkr@G89Zdpnepv5~9vbS0{h99&eFHhlw7^CP>K`nQZ)ZYpp=)S^FQ zPyf6F>G;@5Xx9yw*-Gp0&0QXL#~ZW^D(@S=w;{xU)gA|;;#U%z(gX0l@v3UT+g4gR z>~$hLv|xbW&|#%ibs-k_djv1G8A};aXNX=^dny)YVv=7u^LpoINQSsM?fJ zORB8MVdv=-5F94*Kv}G}P~#1}m!u`TfVxyePFo$S%lNkSLIRT~9eYHhOwwT4m9=?8Uo%QGz6*)a>~5k#v&dQDm$s%S#Rr>QAH4xQn`}M-=+U{la+SIipZ!U zoVutVv0yK1P;ixud-OZqt%g9(l4Xn6gow(7+_?;zqhho|FxZM^WURU$; z3<-6{?M>nN*)YbX_|b#e`|Dcx^9&`XWZd2qUZIVH@5Rh|mC`%EllvU%$WOhWpiNi& z%)hcO=~-@m?+GK5ZnrnfR|voB{zNS1FLHJ@Jj>Uyx?80A*`KbjfF7;#jxs+lp5ZA! zvv{^I3-_Cz_Ep~MXV0?=w74PH`Dtq5z`SWyiM=U_Tg-?{a4CUr6^UJ{7wt{S-a%{ME#*es0}A_Vm)hpqJN88~(Ka30mSWjK$mVTF&fqgzMoP z^zKRAr~l;MF~kem^hB=Xjfh8Liu|arbHn47ujgGzn&Yn6tB5OpR=guhJj>1RJz->0 z?QF#Yud!7u4h+V5!2PO+;o!jF7TgS9Me<*G)ZO1Wa@c@_2kujUG8_a(tQvZ3u$wcY zg~;Va{MLPyy)3KJBP>R-sP`nt&&Yq3pD6!Uvh-R<$$D?%6;0hFj_s!8mF3nj^q19#o)^6@y&)VBrVtG;j4gM_gwxZ^BN{L6w z^IES&vMOK^6uaHb!oM~Are5i7_u7i5sv6-8lPX66z_0d`<#lRFf+i@T^6IpJKiFYUm(&38 zqwy{UcXqtWnrLGJi+A?AT&dGacWIJS;ow$xX&I624DSht9pUE9cdmSUsHnZ;al(J^ zLRs+Ku`WNii~+gbTgn{Yo9aq>t!kb8$v^wRNJJd+MB4dPg?!D@KdFQ2z(Z<%q>>Eh z*vdk-Z4Di)cry1NAKE$K^VK;$4RWHXyf^;bPFmPjB`n>vXR*{&lj2-(FTbnliR8!k z-~g}0xUNwpPFs4DUIL>X_MScLESzkao*(Eum8w4%OtH+&PUro2^t|5jdKW)APl-AP za@QjXlBt*|!?EHZ@n%mHq8>BMwY;CYgd4Fsw{r$a=bvfbVJDM(r`nL7ut@M~v!OgL zU6>TsUSs`}>EdOGIpCH|9ORnmZCZKgG=G}Kv2uIh1>m3NuEdD?G!w%W8Akhi>ojz!!Ul+5jJ&e_!=E563ET~S&vL)@mU za-09MC%Jtt$T+38V$FVvI@xFZH2z|CB^HZ~OI@kOaf$yEuy9&iMj6@ohYOEc&Vd__u9#~wdA~A5an}QyZ7Ka^E{N~0F$EfSj=d;~EM5}&(rJU=igQTewe{J91f~s_;D)PTafar<7LPM&akJ-;n60y& zXShx-_~3)*ZvHSLqKC+XR3j2Eh=zwB@eI5l7x2nYzT?nx!i`KgW|Mb#XJFLUry|>{ zl*6UmuV4acVxV-+3w17UJncjuAw#n3hYEB`tFr0XPM8a|n1p{O+2|??Fjcz-Jw($! z#!l)+r;jnf6gDu@fT_S_asjl#SRQ9HU$sIJOd77?n?Jndr3->;J68sk3f}9$ugYG4 zjR{9qxe5#dp-fGEarp`ne&c#Y650JZ zrAiZrR%mSriK?wC{_?*Uj~;8K3@^Q)D%T|e-N}K1yeV7526U<6fZi!a26^_!__8#9 z_dJCos_GP={cZH6*dqn4Oby^rTG96-z5<$S8gPaH*zW@lqN%M& zkh@i7MC4!f=!<`SDvhH^C|HAIgI`{0c9=k@u+H1NSMm_S+*YRz{#N|jhvJ-DnlzuV z+*H4;gy*SV6-dv5@+1YF0G-sD;54aP=3c)UAu#evyW!0mEgqY?dbn(akf^%M?v^Ky zU+rbN|3zyB{Kf3dQ*JBI^KHE1^j$eAsNrqjb%R;IHFVxXj6%0c1(xSGmtiIaR~MO0 zlBC^~)$-gd_Z#!l+JqF0Rl(!se-PJWng29?(%EQ9NVHQM_uNT{B7+Z4J-(O+>)3JT zTlOYD93NsO?!=rE&JsJBP`#EzNK2fWMdt*42^ytJhcWPZ(F;OA9g*Xu9~1e83US)n znKCJ2f>e)@rO|cygK^w;aJs4Dfh{${NV^kMC0WKc8UdYFbt;L6rxp_i<}q(4TNtJt z6XQoUZFba`XsXiugpjiBi1vdW&%Tn*5^`NGVOO9d86ZL)cIPvaMM2n@q20W42=NqV z$ZHOtB)JseOcdyKi#%0Z)lr) zAp~rM%-`Pij3v*~H2`*>(K$fZfUYcUS?>2Lj=^}e0lnMq@@6@N__7II-)*abm~QW~ z?;o%@_e)VNmRmX^@?9X+m9h4b@&98*v6@qW@pK(<_`J-A0m$xrk8`5v` zYo`OD*dS$J@YAQ=AKgvkeJqDTu6rn2iparV>;WL$uhN_YH2y^vTXR1xZ~Whq%6qNz z#_v9w-FL>3>HY61xRc2{H9fNNa{QP4GA#EQmV?Q)2BRkm@Ei4R{2MlwBe0PNp9|lj zhFNUEHa~+5nz6m@1PBOiy1AUn@%>>2_}Vo1?(Pq?M7){D4k z?e?tRKJsl-0N7&(vYHmnVoTiDyxy1SNO<%`A|zhJn(IEVvEJESAGbI3>l;mL0QdF& zxw%4i9kAhFtS4%S?7t$avWzd<4&*v7qASPE9bsV&)uJq|dzhR@S_&-I1A$f*7vqtS;53!Zo}1iB1x8|H)NWa z8wg_+&Zi=Riui?wi1Y@ek(*XmxehO35xjxf=HiX}^zk1!HIAe0nN?x9>To!G+J7f9jPx~-93r0sJ zwv?A>D~$b0mS?G>H#0L3jc;9cAz%DxaDRPB2ONh0pg47v+n|)+EI1rJWoaiA!E`b& zZSw8vIZ%d^MpEF?Z&<-%F@yX`jEIu4}Spcv(#WYYVf>su~id2J+ zUS$7YQx%6n!(|S&tt>ceB$GfGV{g$qT*lYqcw_CAwfovr6vU!jn9(jMha;&!%xT~X z{hPa2^Sv*1!`0vli+sJK65cgi61+#f|TK;N^pt?tU@8OfQX=;%UO$SgSm^uylJq zano>^p0cPwY+?}@bS{239-m1ljYzTR{jKy4Cy6Wu!3=qmnc>o1;`YS=1UTK@+dq(J z4+Me$XAcCTQ0jP+g)l`OJzJL>S-N&Id|^xxAYaz`#IUi|8NiXngQ#~xhy9K__d_d9PzxWT}JQyIu! zlD;1MaVYax1C3ZIkuf5r5zZHs|$=4>DVUwy2zU`6?vc@7;Z4>K1RdrbAJ0Mz5+)Rh3B>L36b$pD_ueAEXBFclt57brr7c+nG_THy3YD&5l-By?2wotk0gimib#dKSQb7DwG;@{cwUTmB0-ZfAj-~wc)gZ{Zdei=bgHCc*v;t& zw6sanzQNQ)^2s3!e3x=6Rz0QI^lAI!@%rlJVkfjuS%mD#4wC^2=$sg{1}?DFOZ-m z%X}ucfFh5OaT^k)TvB7>d6!B#c>idxb^89ufc3tpyW_gl9qzw(oEp6g-0yLlm_pn^ zW^Ohw=oQIqMncmJT~_hgduM=QU4M|`Rk%uKThvp%jmrT>INv5b3|f7)&@Y%&IT+l) z#BYHQ`E}*tjKMT)C}4sl?z$$14fHx6I>s;)l$p}fZ|Ec(4_!&YE|`=Af~22SA88`s zKpG~~LakBg3a(%Xw-mhvQle;`u*n*Ahm=er$v=y(5GVkC1uJia8@gJ}Z?wm<$f}Jnr>l4w%s|hd+Y)KpATq)@B|vBoYg<@QvQy;+*L>(!@lCRgK;gKl zQG1tObhUkKa|`=p+RqNAy(mCdu#?+8 zo(iUfZpOeet0Zr51UKjgW4LleT9`o{>>3)35JgSUajA$7jEBbEdm0#~@&2Iw({yTFeEqLmd(>`k{ue zm4^>hG(12IKnmKGa)hBlPz=J0HxcF9sfcBubROWHB83W% zU^I0fiV1-?JN7hzFcf{xaHjn>1aeU0W=lRO3U_QUr){WJv{Sp-1!v$K>=r%J1YAzN zVuhr`1PPqNIOa9>?x3+OhTFv+WB}>M`tgy(O+C!R-QrYIPRh8|NTgQG^{5?50w@0n z-Wjk(jfe^6goelnBME<8sWQg|CJDURQ%NKkQJFCzL1rKy3!UOR^BEEH=-1wzdHB!N zfAungjx(H!vSdX8#3}|zb`(YIVwBVcbthfKZjw&VCnb}3SPJ0?L&!Kw9rxwlY$!t< z8-*lp1bH8@zq`}@C?>!#hpY&pS8ccA03L7p3Al(C<8m$suyH$HO=Ye4T=>fq=pS6wqqQOw3D(orDHf`oQG!bCpXb$BroITVtEf}?_g z{Bn!|yb4PU^fV>_1M!Y$K=EY~ObAjO$s)+v869esg*5jxuK&oM$xK>j*;#Vl2^8Kt zwbZJXOO}n%Vo73vfJ-pW92I0p!OLC-@2pWd*Ob?AbV3^D3hjfyGui}+>Awp4IyegI z-;z+miNlm?>d5RHZ0_D5Mo3NL2Vz2fp2(4z+P)uzeQ`+pd?=61q22Qb;WaQEM+gtO zIaiKUBXzcMTaO5`s#cM^L@%V{it}p<@s@t3%FkqB9^AtB$RFh=Xz>i7}#|kki z8pzLK>AjXggRt1@%oN)iDG88|03SO9>X?|;P6)xYbqV2_;10I1QJ;w#u8oKE7=nr` zzp8*-D2{#=0tkFQ+2CjL0eB3HOfVxwQ6p?BnxWJ}x#Hl;4vXRme2yH%(W{Bq(vqNe zz!yv&?G}zoPi&u{t@0<{eDBu*pnvdM!JVBr1;(inMg=w_zbe;Pi(9jcU0dQP7Dn96 zH5Hy-Fs>e-&`TT7Ah0sCNQ6Qoy| z4*F>uwg#UJ2`X<65>ji)u9NzOFov?{EKta4aI$P-Be>r-)#9-06`^rmDR68(x+Nl2{7 zf&?3)Ow2QO4&@<%ic(KQx^e$Qlw*q3g8wiu%@5GNbpNMi|0;})sYNJ5voH4Kfw?6n ziDFSAwU&%&Dd12xRir~RqM;n=BRb;ia-pxA7tsKnr}FevD&#^{sJ&Dsy~?XY;{Psy z+$P+nS~A6;{Oha^GNe-?KnE)DPK}sNSi>yFN)@UF`})M41_cUReZ3l5yxtx<9lbPq zrfYS2h!@F)=NnvA0SM=*jxRRzgjr0CU*A`^3oc}#3SF4O7OwEidKoOkWpf!V<7I2v zUh+>-&I!nWR+HP@<-VwkrWh4%F)k*>w3rp$rtoIdI0m=xg1d~cgeo|FW5D7WnX1$9 z-Hv)PE!W!C=7TY+R$>IX*qk1jW}sem*d5Ao&^&-waE6pTXmJ<2?|u_ z);b+31*S|JBHIQd!46#R_3I~~0xeQVg|sN35O!1Hl;Fg))H_$fg|2kfDc@X{w8m); z2AVEtcj4*veOTd)hc~O)scylmrB!{)z1}!c))mc$+c!rR$chx$#0I$G*M5>hQy+1d z%O=tWdcwC&?WDJYL8a322Q+Gs0~WpAi8*R@9*)Y-2?l#+qM=`yg+Hbs+VwSBb6A1G zCZ^Q6Ov*JZUx9R;hGRSAaJk?c-xn4R>tV<+OR*GUNL_qW$0VF}wD$6jC0i+3HQ1-G z>1&Q`j_LduFLf!+eS2o`hOd0Ueh!Jy77?|$DO)ynkx#+^2EtejSX9q@M`v0tHedMDz^^;2Nu8(cm?0 zv~7&$XX963WCQ1thT@805C^!yEH2OmP8!tV?Q$z9{b^XJOVF#CMy-{r+#&C|H*l^K z7cDfcxp^9TVS~5rQ8Ww~4QvWe1&5k3dn;G_V*Go{W2=l!m!q8W`leX=fz#;3cF^?z^YngK)z{27^pUY zqnc7B8Lw#1*#F@S%NMZ+|61$)`_bIoq=Cjw9y5`OOfi)k`Fg+K+P=q28zsN3%Zn`p zeq&*SckH*-&ft0(5hr)+CbTtqAUsH$Cz>sn)=1ZO@E&m%xH#Ci5o0CKEq)c@mDT&i zmHYHvpZDX2VVjBfTU(L~f_6QD_0FBMFX!vxdb!k$d|O~JTcXRBj1&Kag3hB_s7SNI zbNqphJz10t(WCzZ^386wefUwo1lIm^K%CuG+dAlgeNR-ux3NO!d}RbNr36nRTm`ipPJW>lW{LKgVM_Od)ThZ2@efP!B^Bd`$}APu;>-ev89wZnV?!l z*|z3rW{8Z!z&l41Z|6Ph|9oQA&iV#ydXD{xT1Lukbf`rS+GY)l0kNS<$ zQ!0t1@%uJoilzwrnBMA>ZHUEs1D1Df zT}COq*~->mcd|VTvZ}3C|MvXwx09asr%!Ii$)DWEx4)eK^ehe=Eg^7hq-lV$r6u`tlq*P4dc9qEJyWh5(I35D zW4#bmMwa^Z_*RbEv>_(@VBUfk*o$k2<#C{I`J@K` z1A#yV+FG>e58W&(n1i+OD+(Pm_9 z$q$+dYA9p_VX3NkK25$48b{8zPU~bb7oqgI;#(=Rj1wTZ=xDV`0FSrqunIR6%|U;R zBp-uG-b#O<%A!~=jWxM^A1LB0!0AuyuewJ%Xn>|?f!1jTi;i;x+h_ELy!=GvrYaam z_vyk!$#M8pTjT#d^>^%U`6pQkdOB~DQH987#i>+OeP%0NK^nM++4nO+kR2()l{|w% zoz44Xok^F+0-T>Zg<@Qz+nu$ zuRu&#FsE6*3z}EN+MI?mJ-UAKc^5CsxNyqFo`e>;359L)pM#sjIyrNv_r$M*z5FJe zFR-eMV{2KYR$hP=3zOcgf4vcr8Ix&j^-1Sio2couZ)bBTWc@9ugnn*B^FwuJ1V_@X zGxjUhFI32f?pYj&2Obz^XL+7?o*Oskde)CtphB^rA|$ zbk)q2#(1h~<{daY-Tf_PidPPEDCm@qCdaG57NyqA7A4A@H!(JUYq8c7-gY-np=YP% zVk;Axv}5-5z2j`zOS8NOncXw{420S}yn?2L+JBC+AK1?hrC0`#r*S^exP@3v6dGB4 zCAIotm|YrXhNQ9uNEhl=vrr8VDk=wfcSN$;A{!E6cOT=K>ZQgtOrM5~W3x8v;6-G_ z#vGf6@{1<&o{nWdoyxl>5782EwbhhcCd zYD3?1aU=2)8oUZyD}^EXu?u}aM8l!mK$(qNWW&~wp|h=$0GyPI!8*_k2jOP4r`yIf zejpd6s0tLuh0d4Y`}AYr#2-9al+47%@>rDS+cZtKaq51%GC^BbcV7^HJii*hk@xZI zL+f4fJ-~iQiMJpOR^pc%0YYQ~(oC#m0Oq4Vy|^_<+L5aXz}ewm>Y37oJswHbUR;gs z9^RFkKk)*Z^6t{rhi=QZl4!PbM$6!I>u;{}kT!WIELMREJ7MOrPsYMc9jGC?-z_xa zmeu1g2tGc#8oV*;gBM^!*0?c7j%dhZxP8R4>SIeOSCKE}q)ZV?xd;amM#tWAtZ_l6 zaYBNc!ppSbVUMao3hpFPV7sNDzqaIU81>Wbs$QxR)>f9D&Vxjtj8o6HrF*B}+>#~D zh(W*V#5!JZ_WJ`>`fWp1Em?sQuiHcDbGq-G=RPBW(Lg))yT5+1QYtHx-sBOeDHv<-k?8Sq#OS zvX?xaTlz8TpD&(THzCSVMc%5~Zpd0uD#aD&tpm!dJ%$YKCsdeBumgEo+53G#MDwENCXf|}2p*v;$ ze3KyQ9b2J}F5w|NfMaHBYiDVTaa=1xEd%)V<8e*kD%BHRtIDs{oHjd{xdCq!90Z20 z@HYZ)aOZ*6+q6#A%r_SMYRHf{E@*+X$+IA))E_zB`jnS zoHb4oykeoDj<(gV^sh5gBgQw!Jal|$BVhnK8aXL^>@IKLj?CYR%) z)h4UgTesLG?V#rApcqp>OR&kxmUT^SyjJ=U8oIGMTz#}ys&_D}UmA-nzRu=b#b)CD zJ$RmXA+fvUS&C5uGA*7H6u>L7*G|3YL}b20t`o2NjyawbT0x0XHPfzFUAY|PTgg)P z9ZmjJi_1gA)i~!gx-X)h#O4xrRE*_-nnjY93`Q?)PccT;6o0a$cYh-VugTQRYvCfZ zZ@Dh;MXZk1P)E&g+FfaTy0~uc9aPKqpW_0arutyOq;|P|Yt}2K@L`EQ@%Ku$Sj}hW zx;yp|ymhrtR&JJEC_J2J1Im!U(8lQ;O@RFdRjpzdC+R)AZei`#?7DQVdeLUJ%%(t8 zc{zK4?NLo}MGC7JD0fWnmA!rV$4_QZDpmxM`gPfXZwL~YsMB0{rMHJykaG|Ld}8r$ zga6_G5YW@+{e#8z`Tf!$@D3(VegTsnf32*HA|P~#90No=8Rft4dLw>kKS$n&w|-?f z4X=QT@+uBU8|i5LoH|21#M6665DH-p{A&E0={G|(gb zYW|Bp{?~B1v=ChIA^7N1bRvsx^r9adF|ct9O(Ax%k3*crc^u;uJ28vh#7q375e3aS z5#9{F{j1oA7E&Js4R6o=s|H;K-TfJueQ^l?5&U+~Cj!8AJ1g-W3~x7}iBW1KV-mX@ zC`q)XK58xXjWChfRiTV+s!sxx&~;aJ4qQ8V5`)U3pHVW8Gg6I7u**#=T=otWpiuS} zY#IRl80sT}0&IHm|C;B+tq5f{0Q0aAy|@w)#r0m7#r86`AyJg=_EO)RlW4x$<=|&l zmulyCWQ#H`H2sgzP9Dooh2iWULOxn1>`Muj2$NW1y3vGA{~+{o6aV!(;nQ>=YNz#n z3#kri;~U5cd`)HK>sC)mEvji;4{+MOl=r9dEza;9?jvCWa`fopu<8pza>*o?KpcBq z@>VV31nU$J#%jpeydo**tySfX%l_e%b=x91k?Ia2Oo;`n(aKd=U~{S}oW25mEPKi- zs)u_B*wgNMcY8TztFqvbecNqfyXX1I6S_uC)VO(B@&OzrS2UXhKdX8Nd z#2MH)IJ)q3uck{-`e&M0PEK86j@%nr(gxbA5lE}D9AOt3Z%QCL|Lhh#0_6ISJW`lB z-aH{e?$}CELacnPlbl~lGnUfr#^G>zcKKJf3`KEj4F?XJAwvKl{wNKxSDi|)=`BdE1Kg>!>!&SWsRoD9ZAo;$kxf7(D*bF+d zw-0q)wcaB&C1ZLorRl)r+F(0^#*Tw$zGyQ}FG836Ny3jPuGfRRUn973_1>czN@0EQ zegQBxwxABdx>mUP!=aH!%NvzUGwscdBDARze|$7DoUtSBVUF3!^^eJ*l9`|_Gqw%w zY}T1_XJP|m8kwC+Z(QdJ7femQJbLwRH`vwDW5;qAU>J>hRW_6`xU3WeFGnMfLUuEf zR3*ucgc%_v|1pUCS0^|J8JHY&1eHK8Kq>)Yx^npPitwu;$V`&1ppQNrE?Y*Te?M7c z&kQE{vIfg!3N<4K)0nsHRecwP&f%0ce`hdjv}`S5?NzSjqoN@fqdRRTITUJItp9`! zLqT#VpiNTE7L9}MXR9HIic6u?J~nSNR`!9~?$Yz%DA~@EwqO(_RHWUxQ`#Y?hCR1@ zB<)m82vr#>0&)AYd3&sFsy|!ILmm4?t_g5fD?G?`umEOLt_r3w^kUn1& z02Yu!`Cxev%>i8q|&wQqGs>J;k0umQFQD}IR(}!?>@OhIx_4&#?f^7JGgoX!NdnFPzcG!iLp5WM#8evSKN?JvsWjkp1SUdvPzHC~ zXzRW=3T%s0jq0Rdgv}S;H&ba9}%| z@(|=<=geToBu(0|?(tJ+ajR~s(+exFF4Q1MK1X?O{?%$*Yb*(Ihzw79r_v1D0cM@C z$>QPTQzVBg4;ps;q^n|My|c1Dpp~};Ui>@4aeYC-KQC#pAr6F3LOq`o!Wq;V#Qz73 zDle2Fm1&DV28K=MuwypIpx(}Ttoh~HTuEb~3`!*~yN1D}{$eH-sHSsE4MnNcpm`J1 z*dU;W^l#(ybf;7W^=!QG%w#kfx&aqzzk((S|BenrZ*p!$AgwqExB#e|~4iTvMxCicKn=0+|L;>lYv=(;l?>TaLa`ED|dN#v|p^s-juBiDfaQadax>I^U0IjUd+O^>8xry z!^P-yV%%T9?mAcQu+%x9>*T)f=U2(vi_$u*oa5)?!BoaaV9AE&C?7XM;{YqQ^P^bX z{HE50(?&-&^V4jV&x!;W*c~OCQLl2AaFKu?G86RWMOL{|41+o}BvJPUr|I2w${45{ zSVXQ-X~rjtdXqWe>-YLDSh?oEh3h4VFo8= zF7|J8e$`^pBlQ<~aoXei)cG3uzhA~z-wjG4JzSSp>ixZ-&kEC>@49;>9d`94B&MUM zLS6|WO8CMOlN2~=^S^ko@ozBR>oI=-sG8<*X*_jrGL(waKOgY$%LwkVvd2drf_NJS zFB-1ifgu1^y{-$^>yIIdiTsl78SaW=e4+-!`{6y#;IB{S2cv&kzW8V{otlHBt2|Ou zXGrhhz4wiVv+=dCL6IASd;r&)W-zdJ_FbOf;L@I_?V`+>PGl}=Dq`#Xa;XFgw`b|0 zd3g|tv$-2m7-EvWvu8z42xA$L#NT!jZd6@cvql!#+r04;TzIR<=dmi`1C8`zKdTQ> z7R*0fqkS&sXQH3*`=uaAsLv!Kg|2Ch2-H_pTb>+Jz z#~>A|FML3ZeMZ)13fal|54fp`u3WMzvS*$!Ua!Gyn9hnR+MfzK$F;p8Mak1m2;z%P`J9L zF{4bk296%I;CN9NlV(fm-eCaR^T>wId54>YpD`!VM!UL!GMz;kKZT_Z{ZGhqfyH9&sl%l3d znj{1yi>+YSM#E-KHP*09*=}j@5bMtPLi3n(qbtEZr4)xu0jw9`;Vs_fk%)<$?RWCT zLEsC!K9E!+ct89iBCy=;!`eId4phuiMlj(a++;^hmA9RLA%3 z^0HKePEt}zopsOp;jOo8cQEL|P5EXD`Lzy@b>Agc*49)rtFIQVQC3v0DnTY5?Fir5FRDQu9Z$Gf=YJjR-({wj>Peu(aPRX@;!dY>JAx9H_EA>F}lhl?54 zZ#Y)G|Roig9xh(n@Ajqee0 z(+$uO+~RzpQPOR;4DCozV9K{h!g6iEKcdaUTPL;_u;YS5c*A#m8*Qr0NMDn@9-Sfe zcfhSmH!d#DC_>mBfNPF<)Z$*-Cl&F5sl=o=bbWA2>3W(l*iAJE@@udTbn3q#qoB4$ zO?bGnlZ^69rV~M-wu=)~N)&SK92S)(xRR8pnb#dVm%V|FGS`Y#NN<5rg_)hl(`#Bm z1Ie3sjS0EYd(?lfKU^y3eQcltTX1}bokUX77db>nAu622B!>z@39SyUD~eOXOsum6 z(zSt7<(+nWxzN?V@&Q_+3LyLiq9Lp9$Nd-w>*-?Dm0IrF1kRC1Cd0Gp?fW8If?SYT zc8Q~8Z1WPAjHNm)Bmb|y#c`bs-KSqZBXr69h5ljwId?*MLxnUxqdkXqo;#h z4G5tVQu&C(uYK44oV#9ecfe+p=m`MPjnz4O5U<2~A_i9Eo;iBfANmrtI}XIzJzdbj zY`VX@zp2@!gq#>T5kVf6iKz3m@ppuUbLGiuOdRy9sqGES5{9&788BX82i>#GNLen4 z;VTm7kENAWB8$nlP``mw+oIVn2&E-5ZzS&I*IT9{K^EitpuPm1pwjBrgu(Zv*6$QB zQa9m4Zfj0IwoM#M&jvI9Xi-bGwfM%&fETq>P?O^o0%WK~^2q$QThL8OCY?DUTo!uf z7O>dIiINNzsk61H^>|AGm-7`#Afgdw%?qPpl6;*I3?Y3Fl4xZsu+Yd0Worer;q@9_ z-$Wh8LEe>1aF7XcUAcgm=qoolZ zhAuX`8Y6o-T{#lL;|FfVqd3p{nuF~tniD~VPb~F$R^?UO;3bZn3%cHZHjj+duSV(A zkVHe0W?;c^2>kLHy$gsWnO5KjEXAlWYthA1jB7B;Eh@x1g^b`4uxQa=`x=X@91V$n zo)c8KDF_gB&yS_xiMoGh;ce&TWY{u;msd1kX+ zgMOMMa$CKa8N)BQwHmsrXp4d}v_z4mYzf)uLj{%uD*i1d5JJj9d_T(kB#n&oL6Sg0 z#?{ikiN4Z{Ik0>lq(8hR$j`SMs`+p<;k+L~7#8{sW*&sFvnj?F+}){o8* z>x9}weYqzQWcu0)NQbItJtF(W{K&&>{;}IP4=#i|&7UvUKEv52cH2I>u=D zTehVHrWlN=YqV7SQPgFxST4i8aF=C-%_(=M(#5dWqmwm@o+CWUWbTfvYSuF1s#v*z zy|J9^?ly>}H3+JN5P6mK(m8j4GMjgTtUkMJf1SM9W|I~D2S-lsF0F;-1wN4Xv-G;^ zYwc0#F7o6u<6gKW&~|9Ty#&pA1Y~>T>k2p?&<04AGP!Sk+`Y3D;vKq_pb|MnBv1q1 zI(Mhmh|Oxj=TK5Gkh8F>6SFfSLu9hW|F7N)`Ir^$Q-XYkjOMouB_7A`JU*WJo-@yjB&Zd8EjA z7fj=;flkCGsYIh5Y@<`=m!c_9*ETyJhJ&Y-Y&N z+|`iv$^BUgHf)OZ&`GLjWwI9#Y<9RmB%7Hq#3ZxuX_BhJ$FS|NXtSY1nQt;vvk+1w zWwLAXI-~5cp7avwhARi(OX*OElAWB`tO--9DNykshr^b%SIf$ zxW$E#zZG0JX&PgQx*->O1M9yX?%IkBI9^>-*KqpC!IViUKb%MGzIrpVkGf?#vzc+l z%3$$0hJ$|!ZI2lQ(~Ql7<+?+*xn#B&&9Sg;Aa=aj3h&q06cE}!)CH@6HRTZ@SP=zi zn`v`5_Ddm+9gn0s^fKec@C+$Ar}{vg+SC`Ga}MoGaCvbPI+C2J0Zjt|uj|o!e&kwC z9<9m$$aZJ{Rj=skt&w$!<*L`jr7qgJiET=`R*GtsC-F9}-`QsM20aXe=cmtX>Y~&Y z3Q2F#VU5KwXI}@@TZ%*Mh0`Mea9L+Ns9pF`1F;%FC5r$Sgd`;m1~K%#yIn;ANw`iX zt56e{GmaOVQP9^qE8pwLhYh4}cua*Evo^fYr(WM!R4W(8&h)1BqpfEWF+e5`@(tSi z=~0-P7mbinNm06ur*$o7c3W}zr!eXqn~0GlZ{%xBi&vmTs>GRbrL*iDMV};?HbHjWU4#nG&qN+rN4gLJmxV*apZ7j zP<0*;CPZF7R)oqhBk-UI*uWrYz$s22O!sB5a#dJ3GN~by)^p{DP0HafOmak(VT!(U z@P3v3rr`QD)lF8GWG$X-Lo&#RRmV@EcPhw-(#x1(N@aRcO%%|eUDd7(iwnbj&2bQ{ z?qs9UHV_@t(OL7E;M|DOUsQKI-%DE+GHw#kVF}dv97Q=t1Vsc|-gh>f-;-~2*Z6jJ zR|>TT2&i`=FQwI=!1}p|7E*)-y4 zCj(l|Rnsps{FURYAsQV7lz-ibLJ^2GNU@;aP;7KDnR6&F!(7rRW>-|&MxlL$f|b~r zaxP_~1l)pw3~1A4Xr~@3LsE}ROyL*REql@ZTPgN^HU^{pR7`>~qI**gX)lASg9(D zS4CWWI=^)xxg1U|Phg2*3V|*c@7w1?9vSY^yC2aof!i{g2b-a^Nv8=>tgIV1{iU1Y z2d}FvS3lkHg*Kb_cTEN$)9mqdYR+i!k@g0(sq#rv$Z0F1!S$!0m)@Vve<}>yhTBks z*CPP0_Fp8}h!}OXyDvPiqS$4z&R34H2o43nfi25(^t^h?_qK9OAl7piPqeSGIMdCL zcin^AiMOv?EvIf0FblMJ4lgQy_yYWfpuIjqota&f{RsgX%s7(y!bjftic55PKolsm zl1;iw9{(JDbXTA4haZa^cQzxdjIK)^k~N2oR%@y`dftt91^7(^uCqUeGrnw5=U@cE znAT7g6zJ7OzQ0f66HPq{MNZS@E+bEdY_CZ4kG%S_2IABGU@QuP%ZR}VFKY1yJcmgX z%pVXpw+tSQdrplHCz~UYBI~;=LQw61I`6_FOrXPIfR1g%B3i9v{XItsgY|+Xe>LKW zL2yL8(n}CD`a2R}f~+K@)J(!m=*wt0xY|mXg4)3tHiqM@jAGk-O0%iX_pt}yKJYum zm{}W}ajf1!buLOtlf7R2bN9VRiTvt!<_d|LRB;m%IWBUrsjdw~;O%fW`1WiOlTbNw zb#ffUN;MJfr7qsD=4Y-8WOJ-`4H=!lnS2tKoNm2WP^Okt9|G}D1>^8FPXxR*FPH?1 zzX}^iy^=+a!_Am`jN9GC{ozRI)&)hoJ|o2!E99-!JBz+Eq3$ggL|loV;G zyCap0H9KGg#mFI>4~bLd7Ex_AB4C>Fk_D_z_?h-Ntoc%IwTzT#Mfy!|zsxLr8b)b^ z+OhLqO7cOh#7`6$J)u^w@~rfR5^aVX*%^9G_bzk8U+O#>0PCxD>d~a3OoDM^ zwM|g?np*c0_nd6XEln$SWO*3#T-$Ir+;^`zaKe?st>oY`3$mET3Bbm%J0$|)^#f!V?rfgu2D0v9MkD>g$xbD z(yHYxkvpd%ei|rtalAB)j1-A{T1nbN4J@geDaY0W7GnEY7iBBEJB85Vn@g58+y_}1 z^e)NnO31lHjOgZ-l5#B9o!|RW6x1aJe?U+VJ^PHg>Mo{E&dXIL8l0P3MW-l;eHZJJ;~p$J38`8 z3MJVYy3w6flKsFuGLG&b1d77L?tlp`Z^x6wo~cA(!g?)nDR2dl{-8eG38kvN}e$5hJsZ_NsDFC@)4<|gNn>N*J-g{pd z2}hosJ)`klH)c*LgiF9xO&Q@UCBGAsNRv-d5!L<)y=c?J5z}OaP+kp@3z3&zQU)$% zsl4~8DY&7$j&oEe7^+D=Q!r3m#`TS@Yg*t}kakLYR)5$gSFEk_L^6mWu9mw7CKvXg z7;{ILdeT{E-a$KmBhh(glKmi!?d3B?x)>doQ!wgIP-g{q-2NB?NfV??5Sr7K$hrn7 zF=0HDiW2g51^t3a;WM|A1SYaAA`HC9cFC>6k$F1;%*fu>araJ!zYYOOAib<_5xEBU{LAHR6e!E&!h!g17uVP3bqXb}7y}*PtNP z((-5;qvr-8{KY`fGU7!%5szTy^1fSkrOV z%Fd5+mH?A({Mlt0H-%QDGXwiBBVLkMkGA0X58H#>QTi@-63zzzf1E-qcB2|Dm9Z=Y z)~p1UB&aDJ|jv)HG7WaK6 zY`^&QTSdic_YaS8#%`cSd~%Q2#kOR|vBqEDR=DsA}LOj_jWnQh8*~-LcL>UhR zWSY%=P*j(Lid8)*oWuz06Xm?VR5>tkxp`u_>VOb;ZV>25T$fXA)79J|c^X_6hoK)a>F6P(F&D(UH!NXE4$CmDxD)Z(@T%3 z;hag=NN3IpHs9#WI`!aj2tLtP40QCWUY8*zA*Jae9ogiVSDqa_wv?z#WMI(R$e66s zR;*SfsZL|@MerD}&I^F$nn^vZ=Bdhl6*f3?$IpFmcpER8Jhzoxv%V&=R2q(Chh`g@ z7M!)g;6tizJ=n2T)L2!fku0%-d%YfI`Viz{%H-*EAN#(0yPN-#z5&9>8X0qw=#vH7 zG$GcY@F9BWK4`KfM2Fd-SFed=2T}4tSr9P?G-+md2`ahuqHf<_3B!t12;|C+?lo1> zZR3jKaHDmOg{hMegjO;F0U||&rcIN53R{{l9(ACZi5`5hqNDQDMhPiLy_QdEx%H&Z4Ej8-1@rJ|Jx zAMTnI_x&AW0}t5wt~=jEw(jhCTk_nwx>nA6dvdO{UnsJ#HfYRD?mo%wt*UvrS|JCvta0e<+`z=XP0JDi0C{U2_+npxL&+2mBPVFE zut8Om_Tm*6h_?iZauF-H?~uOz??&9l2bi0460~ff(x>jD}rQlMbw02$l&-Nx0!TY)S=!pP2FDSyt?(XE6qjH0&By!P|-E<8o( z*!nr(WthIG#WEFMaWwT}a0ke3T|p_Mn6v?l(4TuGTc`ji6mho1@$7R$Tp-v6J`gfY zJ@}y--OO{kbZS+I2h|_|Vr(I%G$LxuRAbI}1Uf|M!Q@KG@3K{j*)-EvbXk+>)KZt% z9h&(7M1wukBY5!M-D}Wfu;E=Br{E;PGTBqV2XYIVE%7>fcndaPs(f<)vZ+TliSGOJ z$JIl`!jYr3-L1ooeMo>$Co&a$gkX*m&W;H@W*{Z9q#i~^y)gJ+n$|*6?b*v*)`GECZoL8lD5!>13fV#fSdcOr zRqJazX<=kfr)y|}L_*+b!c=;GXhLL)(8wghVc^uvTT}`;!r_o~le-gWzTO&PNsMTL z{w}BzWWk0?66E0y%!6d17IuT=ksh#Ac|rP8RQX|cG(~wK=H^BD5pKAqdBMh*6T-CA zc`;(#IEFD0A^*e8nx+u4ct;Ksl33U+d)bNncR0FH!~r;ZaZLSP%w1&4GAuo>?MHL7 z4RrPOHrF;lPGO*fgS^S|47bpUq-e}>H5p&|Wq6|u_l|bM`qmQ9b8$w$qvF5tuk_dq z&}zT%&3xG4_;foW084-`g~AH7c_%P2_s)#s3;Mwry^}Cn_{LeW1Eq&fX_kOxq{?CW z6={=|;h=$V$58+P&6iQh5tfB57ll4nh0hQaQ&yB>m6UMQltJjHn3nfeJ5F`E?!7?R zbZgn-$F#4WfUN|bvFA6^06$&uJ{zAr(|~Okp*Ta)SqES&4qQDDg>8_Ho#&M87aZN` zrF}PAzUB%4qFXbMPmi<)=SRXs_2OU>#Y!LQst_mf!it70s`Z<~t9a7#LP5ze*&@p_ z_`)OLMYE^82MiUlI=x{=`j+9+x&U`CCP{Wk$M1TRs8kTu#Z_R;tn# zv(F!~3titfK341nm@PycfB-LHQvkJC1e{;rtG&Qzxr-X+_TWd(?R-G6=oo3K33=~2 zG7vfpYnrIp3ER0IP65B%`L!0_f2p0#)?+9@_Q1te01A2!OiT_=!X|`b42J47!gS56 zuNS_IA;3-0LTgG=8x8_(QxY8)BQIKz2Bv@5wf%uRQI^*Oa5-eOB?Wi|Mm+zOp;v!T zYz^oGJwWS##sh8IMEb}$Wu~px&rwZS*oy82jW*mAC53ko<_A*q?GTZYzERJu_2U!& zA46+cqyYcU^}m3b?<6pAEu8|Vw<~JCNdt7>d#<{xD=#9gI3F%rX)|1l3EY9cz)ett z6Jgc__G?6WqL@K+n%^D~$$%Wv`vQClB{R6?a@LGM)GHl324XW}gxnYU$D>IE0Jt}? z0ye(4NH&uOeuf}fG_?wD`cIhAhW@XC?*ATV-kB+i#V+XA>j44XD)K9o7xJ%o2$f~Q zr~i*J#?0Va7W^9JhY-4E={4X$%?JRD!<0z!4AzWfee!<>8aaX%M8@ndmAi8v^)HF! zF*ggpIDU(b4t5w*`guLD&xKcViHlv6LkoSg|37p6Z!rD;eyU$0ku=KKtML%o(&-xq z4#1H0gmJKx-ZrpD9Q+W%?vqT}7JWM_yLi>ZIX2RAG~l|71Q3qgIY9WCSN~^610o7x zMB&A@8<-%pm;yYdM2N9Q1eS=Tnu;uk%!t#wainf4xvAF-!zEVVDhT_{wC5~4KD6j* zHf*|e0xtys`-h+bhMleWon9Ugal)+i1>{_*1@#p#2KN{2jr^j20!{BrWPl+1{EQg= zYO{cz?K6n(HC~4QNVESu^BO>O>C(Q!=%ddmq{P}|*GeQ+lVkp?*N@0zwlT)8ifWG2 zPLGVhV79uq)xKGG;nu0(_~ZEhGs1oT6?srV@Y7EMLS_~)Trr*V2*tR^Muu-Gt~cWn zL4Rr5%pg4&wKMitc-y`k-+}t0sJ;Rm#KZwCXi@!O6$*8#|DY=`Ji`hJ0DXRXc@Fs| z>o-&3gZtF5-)+%HF+_PuL!^zF{xv2%ji--{%)|WJjiWM@n=eKvVB)w)2 z9N7fIa!&DacvnlOp0rT?VZ0se>lhtAx7}fHaXu;l+||X+ z)%U-N{Qo8zfDGpqetO#bcgp}lWNc9XE))rLT;INR7!lND;rvM)8O+odKM{`BAc-Hs zkc!vLo!vwD8Tbp!f4Cap1yh7xEFk!DgTG_YimnKdGh*~u`Yo@Mz5fT34~5k?;AlTO|U^1gQ9e|qM2FU*KdS{ zGM!5{J&|xg*fAw$$S*uK81DP=fE4(x{1!ngv5daRKws1k60)EUBNXw63L`iC*yh=c zn7d;QBfL4JLr(pqnZ?0@pM(c26H|$%6H8m+Qd1I6`n&7i&_^Ft6iI+4Q`4wfYhYhP ziB@ACZp?ij+KyQTpK0aS({p#Xvi77}$8;v-liK1)d|;O!=Ac8b2YVQqO&AT_7(pGW z5rdC^(;Y|DUojKBzeuoJ!=D?!o6VLL>D(Td>r0CS8P^BmR5803f>BmJ8_@lgJMbAMpfaR07nIX z#Wo~tgD|H4p9jvJH2W`HF9&~Q;DdfIhrBo?sh9nvq^RS63M~UMz|%UQHre4v>_~zl z3vFi$jlWd$4dv;27f;^e)b}{lij9ARZ}nv8wsG(4o$C7HC21VrdI!Z1m;1?Q6Y{*N z0w+@X^}kfxHW+ECFH>Z$W7z{$F_r39&wdm1Fn?8Usr!wnU5Gdw#t1mg#U~`UdDF18 z?`=e7Dl9l26m({&HsfqAro6-17QXTc_=Lze0}lG^=l-oX9{xw4o7-0!ahhen58t`0 zeYSK)gUSYegb2XQ8_`u-y(X{z)-gg0HDp32P$BR@_l+kDR^w9X0DkY6kf{&>Y_4bI z-i#r)6p(5+_?j+C2&JfdYBSN^o1Lq6=LSjU(u#~JT^KIWAE|E?$^0;o#F+D4i?`tS4+$MK8AtVnPUu33KHO{ZN*~)< z?2koibVW{>#?qqEv+MY; z0tecDeDwNl#b5U9=zO75iwJ~&nAKwVi|hO(S&QNS&dUBfE6e1jHOzko_^EWmdJ(^1 zm2dM_R{)V3O#uLk@w+{%3xG(HLcjmZ>HELp@yhnkE^pP>KqT^0-2?yn&QAyWdDwyg zt|C<=^23h`{wyaOQu+Rg!1gKPf=QoCR&<5uz!aA~jg^0U-A~uckDF?&K>jT%N$rIK zJCB=&`t2QKVg4!&sRDjx4PG8YIXoZ6kKK2EK0cM1--AzN{Ei)tA`S+)qFYu{VjTes z%0HL-z1m>ZghCO#T(kc1{jVmMum6dE^c&IsotObqCb@dKYApSJ0_?XQ7p)%tD#7af zmsnO1WW&s&-S#Sz%GBU*_i%M)nB4u9>_?^OHe zwy}qQ+THjkD*d(xfaG<&`pcqj69PrhFaKN{!_prxH`l%Zq&MB`o_w;JqZfeZ0l-B-}--n9#`c#`a z(a8@KeOWlLD@LUw#C4Z_7sk4TcBSI5Gug}YCMmq_dTf0BW+_CA!lzH~-pG`vAPAbF z$$+KF*{GFo-MR0OxEBEz;4cZs1K9Vj7+xkiX$> zP|sEkgTzNHP+j4B%ruHU!k7q-wV(P_Y{5Bl!jd?!@GRpCeEI7eXXIr%0^-+^Hl6iu zgKu_k3Mc*71#|7-%a_gF?b@l)dRj|jy_o3@E9LK)S<$9(0Fy9J{qpHOCl^(!Wo%lhl-raj zeI9Iu*=!7vDjLOM;Ug}9oG+_fyDZ9I0x&gq1>!$re9misvn}>p={bbw3<)Nq2baP` zGTpT(kAVWgW%nT~um+oU1VDJkOZ)|+eKtJ1ZJVbY$@nQkeME6D)u)@2#2mu=Zu=YY zctj#(y>5T@>(cuQFg~n-J9ssYya*B;ahyuAUupmI*zCM- z!mEv<{czY%z)QvtDC~*^?T&z?-$KWw_CqFSofrfnf3~-n4{~=p$REaHa?q)puv+Yr z3z5XlPV)|e>_{4|*t1^K$f4fYjM2zK1<8`Np97Z&FWe1}E|+2K+oEGwxU~BVhP=4r zVF*tZqmn+s0ixHZNlKJ4=*Rx2YnUJEp64L_$F1^4m`hblC$|%ZJb9B*v%?rRHidJVXY~;eW!@r7W>UTc6WD!!FO*)K zvHv*aS4vS}JlO%0Dq-vit`JjX!!Yyu3uL}q`D=o}#q5*6fM*Ny*9pU=UqbU2!oG_U zz*xQXc=eog_&p&QX=jk({f92x4_G%{kfF`@@&O%bKMnIjLGyuG<5yYsy8p2}akIx& zwUg-~loWFef2ZSWI7gG>eI2(^xBCN8dEX)A_r&|DAMJQ}>Z$0l)ys!}$Fckyj^EP# zW&tJI?YdWpw>3~G1z~W%A^$h}{~RXTOQM?mJE^~pmki8*c|fF*<$?H9K7HxNrbhRL zF#q$leka=B$urd{oQ$uqF%lT7^=NMM>Mre74@=*+6~{eJdQ-nEs`I@RVI5e0Qf7SD z`WoP{QHK3y`U#xrTsTDhh73Bo1b!yAu9wlovp3+8bo&`!L`kJOo%yiX??m3lz8~?& z{H>&h)W05O!SVbry{?12(1HzM6Z)S)1koA%H<#`<%|j;9?)?Rm1EGTP;dqiITzd5!#} z*xclJc`1cCQ_H3a+Q&`%>A8?nB0z>m@|ViXODdj{JH$QL*r{|RO^z>iKa3xOD`YkEN1Q3{7Xc zA59ZKS`|dz4Rc5NB=$r80kfm!{yK_KvHhv-^U212t^6n1B*DnVtCfcZZektbPpF@s zR`LaOY>}oZZRsjn?iHr*lSWnxMo(JGo-!>YW1Kt6Qk|KIw!>GRsBTKR`6?aQc^IH8 z3GL2(=WEr|TPc|s9P_YrdI(C;nh7s1;S_HCdiY#PPPXOZ79W>E&kG-yXI8|QrX%~> zPR|0r&26R&spH<|H;lL;*VdP+V$~OiQ|;6hsFtTup|<6c)0qohxSxxRn{#Utxt!l- zr^hFYE0e&m9E@G|s70?SH1!K24vN4#=`?#X7m#+`#80A$=I}7Tt1i_ql(xw=47}WX zzLtt~NVG_(_&`5-bsR^~HA^dmw>ZV(S*$#b!gr7_nj$G{a!_BOe}&V*0g6Lw4_=se zEfT$(=imlD5b0?3E>5GNa;YXMgcQlrKaMa1l`O83!{}ZMB3d%=6 zw9rD27k+M4*G5`aCJ-L>G~Q(1{w_E%({twU}!u}+2ib_qjRJ?t8}i6Nt{kEP|ygH+AUk8O26s*h@LG~`P5uDp;wS$T{F z+({z>zJWr9QBNdR_bmg#IM-e5UQ`XF;q$?L`_^)>0!AuoI#u(fAfVK(n2J1XL|D$83>oCF2{ G;Qs>-o2{w< literal 0 HcmV?d00001 diff --git a/_odoc-theme/fonts/PTC55F.woff2 b/_odoc-theme/fonts/PTC55F.woff2 new file mode 100644 index 0000000000000000000000000000000000000000..aa67b38641899f839833abfd4b35c355cc2fa23a GIT binary patch literal 100356 zcmb4qL(DKt(Bxy=wr$(CZQHi-KDKS!wr$(C_WSp+$?k0{olK@DbLhHEy1K?)UW^F< z5C8xGFaiVs`M(uZi39*JJmY`o{@eb)zz&Qhz)4p@3FQSd0EicZAcG7hMnr&$9CC>a zM21eW06+?iFacx(A^}b@L5_&>0wDmcvjeXrgb4=FjwN~F$Thd`=`#1o`2H}Yd}K1T zPt8G*PEa8VqA(%^gpAAzz$$_3w2RbOtCGWeIHZ*0nM`d5bc+b7Z zkK_*vt*xgEp(aV@>Sq{Ct}A9(GsO;$ELTNJsZc{HQ27O2Le})M@kN}{$tY*d>gkkW zK~Ch%QZi1gTIi=!W>d?=l*WRO_+;n8Op_DPo@F>s&F6reK_M&kPxO~Eoh(DRZj~A)m0;C?#5)(DT@wIiWL~O z7zG;2lafkd%meC<&8)#Qs;r9XjfrY4Sx9;1RH({gv&h;~R<|X#XzOOSs9}|w8s(xe zEB*>&SMf=%wXOu%Hya$?BpOR}@jKmIk_oaX_OX!{*;P1hRweNa5lSQ-dR7nb0NVrJ zjoj?Un%GaaN8Kk2?kXx+`dvh|a)!{A2}PCHW!6;!dJ5}FZcp~A`ffGw&aY1^;EZhn zUP+`(thcc&b4qGONnux&$dqjyyxNlVwaX(EDBfo3Q^%U!m60MV(x^(+sOSw!)Lm7_ zS{*c~t}CH8l_QsPK5|bhsJEslO%cyk0L&6aRIc)Cm?mJi(k72MmBBqE9A^#H`Is&0 z=SX3j-WN#Eydb+=Qa5VZVIgU|hM;)Wq?Od}b`eL_YxRci^??)-a(lII3S!cN^%wwr zjKDpCqV6~)$(otghJ;wG>i*Yj!CSzd1(K8fH-3_8S2c5m-BCcTS$MGiAOa2&Gl^KF z2wt%81^iL|pg)M;qW8E1d{$Z@S4>>!fU$?Xet)Dt%I~9na-e<7AruPV(Q}et%5U=l z^bDM)CX{2AUyxS-sk#&n@yW7-Ji*v?$_E<&oU$_kX0y4Wydi(U?n!tiQ>u!V4)R$2 z>HDWgP@fU{zL1|st(K(BIE`M5Wbnz?=(>IM`#JDI&3o2IK)1*@qPPV$75cu(D5+i( zX+gT++_;j6#%HX!z)3Z|vAzg@P~H}vtwpdU_W7Na>`g~DWo-0fynJ@-(zT!i+V{2v za^U?#*LU}zecfrB*tYSJ!r9ciNmEVIlG5TbZpjPYCsGJn?yZwI#%xU**hN381{~k{ zvgd*og#1B1A$;vpw<oWuQ*L?g!xuC{9)?jA`*rL=gPoy^uc=0KO7QQT(w# z8VJ6zUm}3skUuJbUbr9`qq3z_SZwjPLH}TXGj6Zb#+(i%D|4T{_z#eFPmE*seRzOBqR=%F(cNJ<#&8b_E%79NXgd2#TQc%#*gyE+zW2Wa`Tf7RzTQ~BF)O&@Bcz}vE;7n}I>j*&&`rnL z<(-Baw$*6y-*#cCV3%mvz2hf})MOPU?<|^a%x`fjfmJifK3nFPV`rlo!s8LqJ*ipF zC1e0Yu^5pu3TB`PoGkc#RaKBcl}ubrnV=SP+jGM6C`!FTc6iC&leS0lXI`ftbyx3S z9{^~@1F^@6P=bv%#_5ZL3ERKh{dorfOFt-P6(uQ@WrxFc4kaASbF${vq81!u_SO#W znfUF!yUf@Nfh_4QeJ~4KBE>&=eIFDbwwL=k_lG%PaePXoL^i|MQaiJmT@;j}whCn3 zil)+~iX}a7F4190d4R33;+@~8?=NibzJP}em`O1UcFh(Qp~!xkf$`5Qsxnch_42@; z`z;`pDz&(@=p7lwWmI(45++_|bOAaZyhnz0U}mUsLk2hu1pt}`#;Dj36*h<}seUjv zk{UI-6ksHD{4xl87HbF7wVs^Xbu!0 zVL*;RAQ1VX?!JM5al=S|53IbbEqAOt?BeV~II!b8|3*l;10|;^=Y(QsDCY!73ptbZ z>stkYJfV=Hr5nL3SJRHCqc$6II5McpKU$5aHi9^vIF4wa>pETo{5^Zk;Vt8edz->l zUXs3DUk!d&G;eNmqAxqIN_&#CtfF3p+9;DD?fYdUJi3b~0D}!*%tio+vS|}zXx~SX zgbs)=f^XtNLf(yR>f0SDU2l$T0sS{0rFm%|kXyB^@&&y|jX#IMhZViB^*g6DodnM( zd0*tdtPG>OO6(9d8ci^bHV7NR9|M@;&?q#8%s&)W8^x13h2{|dp_Bx1ftax&V*N;`6iX1)3yeJem8}>~n5Hw^3ZmBHW8(ApRd_Eh z-X_u1^#A^XgDf+Wp`y_`=5$br!mGHjKm6&d_WbqGdZ%{OTv)3E3j`=ZYzedl*(3D{ zA*ByerCF+;Oz=?b-{$n5q80>a{AvPo8pAyAX>x5v$tM;iU3X&l18HdWLwOiNUXdBt z4*qCCtrDc}*BkH8ZzrJv5(+5P=hmZ+Ic6j5Xa^&dg^Lls@(K)xFI%XYf?Ps8STm8f>dXJ_GW+ z^IZ<1TeJE5xD~2?h1;;HJwmYjbhw0oMeQR%dU{XRb@J-rPb ze0H)`8R8(JY~RyMCffX&y{e`uE$FDz8BzW|Z+ED$Y^^3?ksqEoc|`mVR7smEwTOW9 z*$WeOoQWwXiD+P#4#G`WiH5&kf7jNnNaQ_~cQ!ukK^OGn#Vnf(7qRf5+|xE=%d4o& zj&%BU#!Euwwta;p&|sbt#QoHZ-vbK`SNu<8?nv0L%??43Paq+}5JG7}Xq;MBD)0*k zK_nl(;I~@ob={`R?n7qP`HjmIL^*Mh$o*0h;U*YN*O7h_^q83UMMJrP*7Tv()ADnk z%sO|AVWc$CB*kvbL=^-IcFQmUW}!IxCqD9)9v69^lz6}u7AdRH<}Fu!7? zd{2Vm0>Keldzzb3Eg>o*Iif%3F-T@0Y{++jsWLOc`lFJnHpPT$DizqFp2^=@legkEYNQ& z!i^R?L@aTVF}Q~0|E5F4K}05KP^RXt!yMqQdJ2GfNvfhAQ$CM9jrVEJIKjm5 z)H$b+w?PI0S5O3D(f6POC3g_P1pRpW&~f>=GP9=7An*f48xK6K@&(TtH<|EIXpnRS zCJWw9`}Ud?E@zFr)*eXdQa=KUz?|6yI4W8IFaRQKc!QOuWMAzcZ)O^>1R;ov#4G|) zfJ@4bGGp2nHU{9O@hi0IJYj1OmDdki*-2C`a<&pK9r!+#Fw^(21;) zky!lQ-=Mp?sJrM}FrnyW#}&A+JXprrHg+HfJ5!?rF`xusJ_%WLVLVEnB#I?}Dwa8s zU@wTohN|eL@8yMeP3g_Wulvk+lO%hF2ix1(-@)6;8V!AGr2)^hero)U?r)aN1DbJ| z2x+ZlC=LC?-yc)lUYoh4FYFm|ox+8`+0|E5&A~ifTcVIZ135;%N4aumiXEYJKT?bs z$s`~o{DX1r;4R+o05M@`q$U~dBFiDa{p{{*cC;FI+)rzUBapc5iRx9M6W!GTZ2sGA zK(VI{4jWu77!CqT912?UEfp88%Euxn(WPxUMcO zWm|Df&9@LHI@L1i#`D*XaVI#)Jg~z6;2Nw$Sa6d@ZV`?I=cMweSQ&wGwZ!qxL>Db+ zWHL#{x6`I{iSH)LhaFF^G#6CRMHu_oJij#8nRg3i&B9`(p;WLSNr;JukF|Z1xFyoW zJ4dj}_Zu6wRuz(261R#aRJ1S=W(-J_&BC+7<%wx1bCw`4EhAV^$l29d)$$iy)XJV* zJfP7e)I^(q6B?)<e{iG&!h?!K>vL4Vs6SvAVz~pqt2{fmOt$Vg4XxuiZe49pwN} zAi|$>5j{>dO>?#WYmi~YfDz0o-M2U4?a#c>6dBcNc0|OjOshW1X^&^qv|bmavi8W#YhQ?CBU z?2lg+yVtGhc`6$Nv_^pA%CF6LO;}^IKj!PsO)ZIRrH61*d{qbB?YcoQY&x;zpZ>Jv zm0mxF-DWf6IFL5pHg2QkuAO&V6wp8sIpgEsl-bL9q}$tUMoTJHiX#OfiN>{bqm!g` z)u<=L*MKCai@DYl5}c*jaw1kS2-IqG)=sm~0(b?2sQ#J%m#MFAy6wP(wCsz`Fk3Vt zAp{;MN^Fl0-@E(gkAFjJWo58L0+4YC!zhHa$2R|TU08W|{gpvU{%GU9S_lvraX{bM zFN+vJk_9Y4%Tq0$pTJ9TQG++Y&GkL-7XUsDfYvBJ0J0`z;yEt-p%Q3vPP=wFkX|nk zP~7AbB?DCXzevFZRfUM11BtQ%dwlx1GsFyVFI&HmTLXOes%WJGxFsbID8u721+^!X z(Fbd1J%a01*#lJ+P1t0OF1+AT?>lV?9>SMJZ~dR{DeHX&n~=bTa3^DPY@XVuAc4;7t>I0An1o?L6MQ z15+9KKI`AOAOAzdaTT_kuHPrkMAn}f|82JT%lJY2FTg z_>&QwexltmagM;I_7Hj}(ltk9>GmXVPmIg+=mCt#hxDiohcIv-gb)dlBaFlNKpvHS zBC5bb)E7FZ zZ{EIr{;#{=y8V(SnB)g0RkP@<`(gbc5ejaTJe&lSi9{gEq$ed(*hQL}Md~3YO8DcB z?v%VnoOeQ!2q7B|Bqbp=m47)$;SW|evf0fHA0+|J#3N=a+syj2WsgNXS$k)DE0wFN z*x(#PsJp}PhInuTL^#oL`^p^9==;&_NbE;y*M3PI2%&qU-e-F^uPn=pe8!8-lA>TH zc{~Cskd~N33O2@$3 zoLp?A?lMW=#Q-;z9x24KJ<9j>IU_#!$jNkeG+T2KHLEKtlGVG>1#qti6kqA*cDln) zXlrDSzPj#z>ZX0&=F@+^?zY#xExc%3$`3Oho#+R*_UB)H!zSbjuMa-JKKvA!Di!?F zcd?`;=j&YV*ZeJeT0Ck{*KbqbSIEM_Ew9Ilt`~Lch z`x7qwQF^hyOW zhK5`^fzI;V9c;p~%P;WBH8?5so(i;|PN})mH=K96V0Q&eUNP8lDMxQKbbevDYt}oK zp=uHtD#!1OwS_(x3~^sLV(rq%<4NU)hm!73wx;&Fxj$Z*C2>wS4{GyduW|lCN|{ZE z%w_FDu7VamK$&O5Wzv+ArJxvsKb3Bs*S|z>e`v^**}DBx)@VVsp^ddO_*$sfw|(uh z!Y$z_v0J*8>-EAob(l_w8l#AX4>j&zHLW~U!NB&W>3KL&ROM;DR9kcKItPIx&Xz}O z9xNx*+DW%OR4v>yEaIS|ALh#9Z;_LBqbpXh3avpMXf0le@&R=tJxgQdv2)-@{#5PU zTW~cwI_`wc7I1qN@p&QnmWqq?Bs}hZQVR*m?(v&d0d}vjHIpM8fD=;fOY^3!xr-hz z|B^ioOCGDu%EltaypFax93r;~iTq*2JB!p4Z{$9{SG2sAu300SUvtq5@>~ozZF*E! z^_Lj8mNAp}y$Y@V8qdh(4v*nS9)$38IQeO*9K=~?96s?S%@(e>vZeZAr`)S9OTmj( zJ)z6BbM^>2R$eCcKJ}U=h44f-QD(Ac7*D7c$neZ`N$&KkSnV4pOlMm)>)9|ZKCKe9?aOJUm$uuuD7UM- zdg1cx)W33nSJtEQh)j{7DXnQ=OvvRke*_fU7u*EamoAW6*h0N|6)F;T_dU%l2rVgd zX#qhQYT@b`kjSJ}%gS*Q$TZ~CLm<^uoa&HiQ7E8STI8y?*?6p@2kvNdH7Hz=z-vz0 z6m^IZw0sw#d-oRyFh8&y1_Wvz!$~e0nn;h@baT?52?59>TCfRY*@aa@Z0!#k?i~}% z9!A~fd8qtKmXRbNryw*;`0)R7RP2xWH#rbM9AD0OQ_V5EJ-9fz>E>h9CFOlo~B3;PZ28KlhVmbLtsk z)AGAU)C3{dd7KpHwQyy5m+Ls=tB;!8NzKn>T5(F<6^lYR%S?xQUZ3n)fsX-7c0d?e z)6$9BXS;P&q zlv+%#DoKvq=roZuD8fiulC650b#7IDX;G~CM%!+icjuu4y?0BpCh46!n`?J|aWwi3 z$rV`bDnw+2q)?2uap|;7nGcg#kOjMs`M?gEM;Qc(XFY<}#leB7Bf$bTMXxg0#g zMyZUTh-qZX>&!5XAhNr<@MyOrvidDQOz#bwi!}-$4&X{9siT3QHml1cu23B=Hc~EH zhhXKJ<*CVqKUX_+$q_iqi8O|FJ|)3Y^hP-et%OniAHM2}uGEdYvK30_K_P+&{_pq( zk8DWW*~zHPG}~3dgB;Oi#P+V6ST^`Zy#!%85Fy!s*4(E!Crxvo*ihfq8o%x^u%v^t z`X?+Vb}GBeW1tS`RPxQrl(v(E|ICsBA}u3WaX*EOl!O*CvTaN@BstAqT)RJGG_x%$cks8&Ct#^T;@%9q{AI6M#4nUpEEi|Up8G~}95LyB0vJTnFR=i&!U7Xct@B zlP6~RVZso1$GdJ2Q?f`1oBmye5m+1SrNGKw%zDklAoyp`-tEn3&al$%3AbsJ-r8P7 zdW2MZ-^vq~?u3C{j%*F}ViOM`M;`tNCiER`Jj#ia#m&KCHy|-4F=m?K1DiX!EWhVw zQ#RKEcv}LFLEJWS$3R=*n>>yJo-2f@m=2YW24>Vgkp{G4Ngi*<1=CA=>h!Fk)m25W zatTFRfs=)>7j^uJ{?u`GJf6+k0GV`?37*LV<5eBU2ztCH0#NiGw8LM@SG?FC-PS|R zVX|9w6uDXHGu4+#U??|_my4G8ODfWDIhT3dzGh;2*7F6YqnTP00lwEiIaZE>(vU6R zFlk~En}5y2?e%@xjL08uW2^xCP{Ql#e#Qq-%D1N0PDKW)eeqDa9RK+=oEJCy!wZb3;YVDwP|d>N-3!vOJ#zZa+i3W)iTB4Ndvu&=dB#-# zL}n%`$cLS)An4;LxTTvyXc4m&)V-z-&i^kjEly|&4@D3C`tQD)taFZ{V{^!-i?$i^ z<$98?!fx()=x?p4;=Cs$HaI$5UO+-bMo3CbPLNVL)rQll;&`I0lo22RAtoO~E*@p3 z9)~_6vAVp|P^tOPjD|lh}lG76wWY}GA&%=9%7G)cFU1BPZamR z3(cx7oj*A{JwFpDL^2ddLR7ZZPlTm9m7SJdei&t*nr%NEbzh!+QZ);g&tOFpF$W-$ zfd6w=@%UGxRn*ecv<1jpKwqW6E)Fh^yp=KY!%mL;11h-yGv!EZL#I!X>ctRocrkLl zlGRAOa{_y?`i$v9&%W zd1#D4Y5Wcb2Eqe{KoArJl0xZ#g0cBHdyq%hAA&sFei#eiYeNV^sHmfxAU6;~Uf(3X z!r~0gNGoAcl10iT!X?C0ssP-LVF)3N=)|cu9RdBPQdlIZ?@@`t^v0|;}XVps4fKp0# z!vdX2PMcUK-;8DfOqK@sT)AXj?s??b`|8TqY@S_(LP>HcVV$p5eiKdF2+KVVWm_U8 zZo5y4?mxTOZM6$VC3#lN+fbVOTZOFv5wmto=qF*p@(cfbNq*AypunXBVg4~S+19Zag_$wy#W@&R&Y^Ri6jlXoyCkD^GRpQA;VsgfP+rZbx zc*7S>!>)FCY0y~u9X1~yj?<+d2{fDvo|HlqAb>i}a-HX~v+0v*`t8VbkL0%gIH}Ir z7vO6Y5iDU!zXNJru%*ZCh|JQP=p3ifr!kdUOjfNu+1b=tVj3-%&(0TYegUcZeBaXg zQYBm-a4@;1)oD-UnhzT1hREz_sCNxCgO6{5S|TiUnap zF)v8{uWgea>>|RXq}5z6w~f~950?0Il5%4e5myzMG|vkdxFm^1bOD067g<@puWSn7 zmQ8{T>@!NvXw`r=m_D`Wz)zTT%k}MC^D4|Wxuw0_Y)d{7tWZ=_(`?ao71*&m$uBP* zpbc1wX&3JS8bf?{bxj-2ywQ{7@_9V)^lR)-SPDqS1n}*(xiG9_&iFppUyBD_P)rY$ zsFnjZd#ARZ&9w|ET@H>IRFT)1bQOJlUOnt$f*t65?CQC&x@@t@wuV)zHF6dJAaQ_) z{_B8~7-as-dZxnUQ!|7W%PQdtLM?oNc~4czy{MkWh@ktFpiW)cL&xyQ^*?D zP%GG|nXAYQOPzv)`G;<$guB7Vu)|9=08#U<8Q5aGzCf{pVv;cYMWott%phL+#9A`_Nu+_>(4Llz%ixr zPpu~txtIzUMofCc>G;h9p5x=VK0*QRE9ZWCdnpb*&Ze*?R5IsXB^HI_R$SUEZrT49 zg^I6+HNAu`OWt}vJ=4b459M=q{1YR`%g;5Y*AG+OZ^tKsr_qH>(k#NWHpGC^4hOcK!tF``=Ox* zp$tXEjR%xzTkqRk^&OhOiKpt2^f$tAH*H)T4hG0$d~ps@D328eJ*g}OVoH~yhJcY{ z7WS!xuu!cu>Ck(e9>O@^a3%G@H?=KtkRwMpFdxHE%Vmz4-q%hM zWt)7k3=>C}^WWPs)xdZy*0nHxp5CH%h~~v@pI_ozpBPs%4s)z29~j@=_U`V;q&1c- zYy+@r!>G9Vf1Pv`CC{QS8B;)u{oz5_PDPG@bsPP`asB&Hk=feTkGE$R^vk}ffrAUVWb_!<~>A6jXwBOALZ(EiePhax%rRVOSy z_ez5?(RCchkm*~UBFV_ojdIPqkAd~yM-xdH8&NloQO?p03rzKzCmc%@qlrm5(@!M= zc7@%H2N=O9;^2^Z6wRv#pBJ&G&V-F^i%!!~TT6x#j!&CBKYpG(xAi)IglFm$*5TLP zE}WN|d?sdNwUG7V<$mA7M*46{1yekEd1ti;o9swV--e%0PV{KJNbh86Lr|5?qW4!$ zY6lN;u;m#*i|fiM3T{t*yUYIABh-6N;rtuSndl+C@;k7Lya?GpY{Y@Es{4>GHvH~-q*~b* z8u4}k0=wryP+Oy{hViAX_20|Bah6)H}1l1x%cUbq9 zS`oiUQdzY9<E)aMh|w$BDA-u8rDeAzR=;OevYr`TM*7pDLu4ujf&6i zfytZHHP$GrQ16M%0~~TMiNAA9zg~1b@zi9Dva&xtPM4-^D@|M>Tzn#+M(OOy8N@VCLvG9{xTiVn3rMQdDeM2v^>u_Ua(uw=hWUk&aSK|3`2m|Vb0#~G4IHT)-eftE+fp`A62;7 z<*c&Ny;2faa__=%-!x*|>aVkW#jp>EBsnbHtq+p5MuqrB)2^X z-k$1z^Q+7Q2QyTjab%FllbOH}X_9Dz@h6&LuW>R&!oiR5WL+?N(|HW#3qT zp7z#k&j#~Me0>0WYTzlt!MlA^>&QgEX<3eaB9J+4yJecT7>Z{+YVWN+2gt4d1dM{bk2x+@xZu02LaA}6`r;imY7@tNxiXUMkd-vy`!=Vxzux?hT z(8RQqr003)S7k1jj;@R2*G56B2tAtp{-$9qJH>08vSg<`ZVqkY&?+ybs?@fk#{J{2 zk4G~Zpl=6d{`1TI$PmYF&9E+~ef43ylbqO!ad9<90tqE0y>C z7TBQW9E)5>i#GO?iPIjcYA3~k`wEWkP6SPuthOa`EV%Zy-stYv{}3`Sn1S1}EBpDU zRTuCr@AnThvyWQo>!?a)de*SL3uMe1+tfwsutyt(y(<~y=l;~LXQA!mUq$M<~`$ZGTv(>sC*L23t)P6+%YLj#wX=m>%g)fCtNjOWa&m#niV zfXNzx5JBTy+5pCIf1CqI?~=~SFzr3#cW)nfXa~+nm8X{-zsHXcbZ1vlU}3qKtH54` z|1%7q6*MS(M}m^?N$!?pD!OLL1|}6r@a3g*OIe}SVHPG~#e6T;P{)7|@(-DPn-DbLh0 zV0-NH5w>V9v$!%i2!QQwI7GtLge5&Ez)+Wow63ov@-MQ2?ne#z(Xib#*1A#BMIDJ3 z8&h}s`V_%Zh%nCnay4EX$KyvmIl~i9orz6s6RkDhv}IiOWoTEO50Ro}ZiLgh&ixhv zGvNbkIp1tBIIn-qfZN6~Z$HH?VikhIh$xdx=-dKT(!luUNi9pX>QZ==C~4k;LkLL_ z$=JERC>vS$3*x|JPFf70?SW(2>4RzND z=mEM*CPdZMDLZZEcqWelI8K3*$agy!w{l;iZ*@6NERtSJJ1xN$Lcm%*mJ~2Pen?#~ z`k(+9;lSrOV;ht>xcW^7!7d@P>EkPiZauez=uIpAF6*Kgzp#K=bV!)z@z<8=+-VMP z5&^SjTW_cNeEe~6?7F0@LV$r8k%carE}Xyt*jIE~;;k<|-ezCAIX&PZb+iwzom*yV zTd}t+WO488vZYxadNrV7Im-Ku@15Ngb?pJ~(QLXxJFHw$1|b(%S}KgQy81g9!)I80 zyK9VQJ05m1oq4)r>jv!r0}zayYO%vQdc&yQfX!QZX?&Bq?>c*f9nH#mkcB2qKO9>0 zlz``FcdTQEfYjq8!XbFL-dNI|tIISW&TQE?A?u_2m8Vksal>R8golBksdjKs0<1<& zmon%k(TNa11t128F9aTU;N^#CktTMj{p5`k$8KZjCwrBuw7<>%PY=CDx(mE%h-`9aX4XK|8&t1J4mUyDT1|g7lz{fS5-PDo! z@r7T%i*=sJ8$H>M1~{KkXt*~_{AhPEyv-l<((&pN+VdTvBR~24jpoqgz_L?0+7nba zZ@(i>HcQ<_T)^DnB3-rZuCpekvR8>Y`qkW1C%idBFzA-lDYa{&M`pzI2Hwj@1IU{U^%%)?t@=lU?;=z$Obu73)8+NCpxX5s zJn~!@6B0T(hll~(`CHd*o}<-)L6sSnPl2Q8{ZQgLF2=bL=*1K#5mu?mbXdE1(pv`- z`R>0}^Tq`kGB`SUhkH(nUgq;}S@bFVUt*IzW4UCkmPp*=s5R;%2-R%aq}jA;`l}6V&kuMQ6QHN%lD`M}ir#rl*Wzlvuhps=5qOBI5j1o;wh)!6=YRJ#byooxx!r&zXp55`pFzWZ5hK;LBZWtFy`m z{94zpu5<{Vu}1{-gz+panHTm1ydoZnm0tFzq~NHk?S!cLUGMoKX=a-Eg|`)jHsow( zB^1k^+Hg;M5u9?W)zU{`YY}$i@(od6(EzCSGr@2hA9Baepb8b*=f6I= z;>Op(@?uv;>s8K*RfDzKRSDe|)(7v3%YhPL!ngT{o2b+gq4q#|{!)BLFdB9)Y$qXm zR*Ei^RMJG2^BaJd%1Lw5beuZzUqp2+e_>NADIVouPvtUIP1o{9T zrr4gW^)L?eq_vR-aC0dmqS9J;vyr(l1-V(P*7_(*)^(AZN4RdW9+r)X0SZT#6P-S< z9iUYfdEAJi zzN2jnk2DGCvJ~HX$SaM+Myc>I~2iuW@(Pm1E%}WCSI^!WMy|0L;EZR`F;35ib;w|2K+mg zBU-wR&$nbb2J47pN=GTWtw85^0`x&0;Qfvn7YW7j#`bLMf$j>TKarm#HQv`q*F24?jd3LrwZy(7FvTw#1eC}*TAk1m^5UAm?+ARlzLY? zUH6jj-jh(Va$v^>KQ6a@gbd!<_NIZiQ*bVeY?Mkw1odaL8JQlUWzm0Ef7D zq4h&TBiYwau~)!<*zEt450{ys|UTXwDiC|24c;b;!$B9PhH9JNW2S4tW zW*70q{jL`}Up1Dyy`WM{lUwTKVzC#^<}VG+ce2!Lw!7-&`y9PKwswAEo48uBtoEEoVeBl$ zX__No#Rx>&0~Dz6uEagu0)@C&X;TjbCrlDeVQ92UYV&H=@y*6edo?E2Ewguiz^gh( z8r=5#!KD{d!QBTNMlDA&HK`K-l!Z0i8-1E=)R4$lSmd+Hw_&UT%@rMH-efc_)hI-`1`dibQo<)D&t&0%CV^!cYBX(JvorBi+E8uMd| z{p*p=_jz;4ryA}hGfxF);xy-jdxnVds4%>7Ba@EUn!G&D7IifrR}qZ69_k^7ev*8r z6RC@@!_oT3mRuPJ2vv{wB(4*Hib;a(-okDT06^6pr)gpu8(z*S5_h~2IQ4nNGf_f& ze~Hm*AnX0+11a$o-K~f^BLWW))e;=@-p@bZzq=Fj>O%c6q?&5KIB+iQltA{xHmEH})6+Uu*i@qo za8q|?Vv-Iz%}O%4?+LUMmRab0usvN3-w%WWFU`&7##5K%Td6p2?U>KVk2%P*Bsll47D;pYlg=t?$4$e`GsT#X_ocV2q{^r1Qvm5 z*7qKVfW+7A{=TRS0{*&INDaw-=4QqC2@)eX@r}#`yH~tV!@-i&QVpJ75k`R59Bp1r z7LFAl7BFfGpdR&>Rj(itzQN)?@W7B&RCh(qxv9mJaYtd4MyYbnE82@D3FLqv&k;G5 zzvUoG{#vZ^Xbd04FSk)J`nAI-6-0oLb$c*@9U5$7KgEdEmjC#}Dz+{9BzIN5Re^XI z4#^^OlvDjIt^>AHsAuWQ@f$vbBj}A@xi2ON4N0)ThECXsQIM(M8SmKMJE6|d{`*am zVc$(xILsp|q1N!eBz(Y24liDAYSqP0v|Uf%@E6Be-867K% zC`(8j5;Y>EA7TZlL{&x+N}ePXQEXGlQxs$Lh;P#@;I4BgJeSYH$h6dsmv+-`k zC&h}khI_TVMd<@J>{P%)MJi4Bk7PDaavY`f{pHOF6q4wd!rh!?+%7jPRyXj61};9N zj1zV2n&r9NE68zCBUZ9}I!u6zF+%U+3k6G}Y7zS+;zhIT5i684_x*5Ueqf!8L%MW7 z$-RR29+-CvQZI2(27dJjC7&m(P^A!Q3vuZE~n9EpcrBSC_M%xX13wN#Bb zT>(dWDnM)!&wG*dBFe@wd0qIIKLpG#xzzw5FD0pZ5y1&Wb=o;cyPpp*gNzWq^mw?D zT7oE99fgnDLqAnjrj&Mde>m%VRnOkz*5(D*Ud%dNx!a>O$6TcQv`nZ75W?iC1}77s zy_mD$XL6weP4rI7nw7P;E&IcW?%)iMVh@no`bo;yqBxRI&-65&o5Buf=z>9R{zqic zfu0aKe5EB!e4&nso>!^5EWBcKnm0dCi0ARzi@V*Hg?>4{P!yhaH;0Xj{UCg#2(#-k z{)L=Q91#F6m$4@mOhRz~d)(!ln-q%&rk*Y6l-mFdo?5Y4z-sm-iZi{Gw*hv$0JPj^ zX(;Q(07G>fD7tPjf2v9vk}685xZr63kx4~6stsACe3j0re!5>mhI}fqQ|YeF^)Ybf zCn*UQuj^ zni(zcvijzhJCJ*JrH#^I-C`gfOQqUBN5|*UMQ_6NLI~<W_U`sJ=jtv0 ze$wv?EF-g5^*SR+Gg1st)B*u^b;Q3yYdd0@+~8$93vX_^nZS4F3^xAHR_>3;F-w|> z-{BzW)OG1ZlYhqN#SiRdG-5;!5s8E>me@Pwf5-{*0m_6G14#BFkdWZJ0^sbx5rVNu zl*9z%KUy;aWY(eFsf+P?akV!0_hdK!gucJ=rX*3hiW?qAC1LCtMVeXnrZ1=^Y zgtqa-p*~N|e$Jcm8FP60DttSMQcZ9w)zlY07&b^JE7vl%Rs+MCz6hI4U*k*L2a-uH zS$qHX<_4FRfsG zpAX+y*`9_wWB3p);K2BK1{1A&n?=ze$Lg4YSl6i-rlN!Zg^LN4QWwh<%mDtP3tmA~ zH#D?7AAm`A))KMJ{C<~6bf{?{lPMsD6OD@i#f|s_7SgGv3B2OHk`er(BCCN8YgUvi z&g<+zuLQ( z(3umAYj(P{h!^$j1{)qBJizcq!DJPwr8rb-z{mwlTwe^dzL7REBZZJKN3>2J2FXh3 z%wgt3Y6te6_G$=lVc}zW1{fQdFbbjv*O6K)KKBzW{TQ|suGkihR?tlFKc28Ot zXH}JqcZY}EAD9{|c6&zrvc-Pq$+?)7dZC2mL?W^sN8Wo5(QnDICHt6b=;h)s1bQVmi4Q zQvN8>eEkf!e#QSv{eAP@Q$>U_zd}?fo{(SVHEP-Mk@Wpze{{w{RHVW|1>pH2vcN9K zr12SsCZ5H=xP6j|O6sphUjF49`%cw<;jbdQ$`wYWCP*7%Jbv;gBS#I>k88-wXh{u@ zVKcs{aH&uCFBaVGTm)qv|ML#XWWv_XUVXB3cf&d^n7kXBE4VuGQ5%MjYVR zB))nqf-BjoxF1tX*{D8;di+vc&B!~kaCf5wyP|y0YTii+NNf`O{7YXd# z%KnibPx~)q*IMFC)n-yC{p|{;8lmaIZ+pa_V1C^?*N=SRXqGPdGw0YXt6fwHA4ixs zG4nPN^kWyzy<(Mg_v6GWnyAx%)b;nnE~5nrQH6wZFGYL=;d=4}>${wY95+35Rf74p z?z4=Iq$=Gn_X%PQ$;QSSp+55+IRl&YGs`Hm@3i2sUOn~`HGX&V25L9DVa{`+Vi&vT z_FJC!^hJ>^@RAHo%V|JGk#BkYdG6t$V(+)%*`~GZUYh*wXK!Y?xaNNWD?rr0P}>5< zfBN^b!7~rW0_L>EvYf%D@smJUW5LdU$k2-aIiY^tCckv|?9tfzzr~}9!bdx^N#u7P z4B-2-rR&7mWn`&?XC|srnriQUtV9PXA_6|r&kL;InC0gkqOF%mtM#=He12_Wss5O6 zzaj14xBHhLEBaM7srL^#$#V4lA&%;|8uEe7ODq4WQTV(>Fq<(lp_dqX+Ma>f+Ik?n z2Fk(JAcHX-WZRUwaM=t@!Z8CG<*e=nlYU7;!t-G(RPnN zip#<+umhk)TaoEj*8J!HA!ZF_XEt0qefXLx@nW+x#YxYyXE}v1p9h59OQ^t*Nevh?w`K_-4wOXzF%Ve$F(U`$r|Jo<`GC z$wnH@SXMOzFwUv^&)ruK$!@pvH~H_?Lr7~;`XoOJgWOeq@OGFsh_(jPCwZ%T1)F@z zXYKJU-43mdho34#AEyP!IAZ4#V$^9ZHInn zusE;A%JNOQ^7EB|;Ni&Q9OH3=SSr7_-I^-QEG3zhJjdbKTWWol?pgdcM>vmq;@&+b zNq9Q<+C|Dt*R(U(j938&`SI7%`{k7N*Da}Oys#HNF*gT2K{(OUrC7Z|)kJSjX;#XR z<5(@ZjS~aWdne{LvRaViWXhCgdb6r&!)k@4OE?idAtx6-QP^u5FAXgk9TM1gmt8^H z5m{QL34xmJ8D1#dz3}$WFLJawMg;9DL<=U4oCu#7DI6IIkBsQ{l6++52?4hucboY* z&;Z}IX13Ou98P8_RD4wH>o3^pgtrPCGaxMcV%pG@=@X9b-`hVt#ZazPms4j{`8B9I zmUAcH@0hnpllt*byT^on`vQp87X0+P;r-p-)vxMAohu9H&VGVd@|z5ef%xJ{U z+aFAh39q-215}GBmmjpMDkwQ}f68rwe~l>>D%D=^8wE!Fg2s!+Eq%8xCwgO8x@8AE zj)c!4USsj>IU;9;&1$YRg-c>8N+U6c?`Mao=Q2DB6+djttD@%0EU=%6UdTxv6{Y)5 z6tQx%BXo#SrmoD{Ts>u`+nb1Xep#LE@JK7$=U?g|Q(}xOHU|`6JzV3hTjwK}0umGH8oMWUuRj$EIUAqxt33fA2Qb&Nc-@zBoV5qG>l9sNHShw|lj+t~WfZgAPNd9dN~wl} z`TK4OYo{~+3CYhg`tO1q;)zKtmWAHJh~#)xy|w=N{6O(4O?$I`d89}+zqxvKW@Uya z1%Y$C4I&f``_+RTj_u8D{=@V8j#?V4x93i7uq-btkd6;T#$^^zcJJ+|i~VyQZX2C+ zlb6F#i+bD@b@?hDu9aj*YbgSYSZSda@>ucWv|HcK`G48z;*m7_k?QnwnHlFA49P$H z&Xby=NzD*fLL^0t{MOjFU;Z@2&z5`qiaLBIS~f7faR1D430h%Eik&Uhcl=wme@s+L z-xvRXo57Rxn&TPe*=`Ja%*?ZtY$9X(;T|e;PMXQXxg3?IV?DFdTIThg^ zZoVOixSSS>2gQXHgO1zaGO_CnrV>WB+=^NNt%(dN4E>dOU}k2dOxW+X@CJ%&=W9Sz z|9-}X>*G=~UN5P{=}x}d7w-fmYB!-eON=j5xhmurB17B4#+%$Q_mM5Udtm7-bXOD> z$-$n|%J?iQcEOia+eAT0v2u1aC}fTVn;4r?Y6^Wb?}7QpcSwA9g+mSn51RYbAg#|NxK&Q;%?auU+b7uI{4F4m2 zU77A(YV@fHH43Lkm|fL2V^Qw>OL;^&m2I=2-pHX(tK((L22@CzU1-$GBY~VIqAI>` zeZMar9BCobM-lqUetbO3oVih7&lV7kqYrF~Aymgz4v5GCFSVpl_qSKQ39znQS;ES8 zY9QynFZmUIMj6d7&2nl&lj}Q;tr&gtrC@=JPFnXv$%s%9gkBfR%KH9PB^G7W&e1A1{ZGHQGc<0-FP)984{~cX>d8yH8{Z>xXU)wPt6w4{< zeVDK_5+9lL_}5*LcqlqDbj3G5dc5z7^=O@wMP$mHOy`G3!5{0|lFo64@YRKbL{qxC zW}u{g@T}*o@Rcfi>QsEoO#icD!3?#HHtjMsC!s~piMLEK61>TKKejAlvu~VR$q;k& zKY1|R^bMyKZL~BLaA;GGAj<-+CA=;MdbMhDwgcO0Ct-n!a!n*Nyyz<2N9Q%$_l&!LnL`lVYS_ z9^*CX3oL$pyca6M!;4eoC_}@2F=zJg7{}^!X%r%_gudFddIT6LzD9_y?*+R|!PGlx zfpe7NTD1IC@CPm%_O~}(HGb^GIkV<1nQJId1%BVJF=QId29km)66?63HUDeH&)I6b{iZ!KqQ zbQOH9g9fT~j9Oi)R~z&N_Df||9vf*X+AsR-JQr!T>=$@^)#r-f1t>$(){r23eCyPC z23C{FQO(t0qmO*`XcYK;h1!_^;!Uex;4f`#3>j*YYd$)rimO}y*?%L$g4~Ni?_>LL?)Rhxo5xpmhsABm8=q?^!+*FDmSnF8} z*S_Tv=YERS{cl4HEP2kbuz1fwI9;%A^?9b+X_OZMy_`5tMFBpX{8?#^Sz=226<1`) z{_piHV{FE_$wKfQp7%Gt`N$|dbY1|Gzyw@<6)$oEuUHxwL#(7$jhXM4oyXU<@X!rO z!LaZwjWZff{A*~apCdPpAHSUI;5j;$H+}5>=Ohh85Newp<-2~) z;FL-%bJ@JFQry3$Vv~-xEdM=q+<#I}biP?>_k8Y+D=^Dkp3kAEvC4A-m*Ar4sZ5gv z`f^nT_e9TcB%XOIxSPH=J;w*id$OR7E51fTMK))Nq2}6^FeYQ&^zC6QmppcYh z1k?Vf7LF~%X|$#S1$XlEUA`HC2?Uxub6VX0X@$=VqmgNEo)aj?JKCY;WyNln!Rw)E z)&|_JBA1)>dp_;qTc*ohI?Y1&+Jss)mEk_Z9RU1&Qldz0|g<>9lUFz z1H+dcClPk&Fb<54u|t~v=T_=nKR;vLy_YOQ0DlMXSZz)d3lr0cJL8YKZ4M6M#MyOE zZy%=<)*f8+z$*l zuZpxd&91MSvnPt?DQl{-7WgA}ahuQ8%++dXdYUwq-M+`!{^2CVFDe;VUR~Mf$3FaW z=LdCD(*&fT)|Q`X$Rtfj{HSzq+ykIVj zvk)&@FnTH6HH8)W!Xh5)u{E&sHM*wTCK_vj&}2|I?zJYnIfvn2;UeVi-*)ho|*1%2*o}k<9bKa@r<*t|8R909Ie{Eobp#NUyX~Mfx)9=J~rg9vYBn} z;;f7nTW4fsEZee@!C0|nSw_a-mK6>p!|6;J!`Ekh14?{`2J*% z`t0bQL(C0d;w>x|(GqW_i?U`z)ozg*yf>DfdzbK#F0d;Mhz-{V>0KIKB8u@Yuc|FU z&b~iAE+HiEzPGeyMvk&^U|`CRdmo*xo0+R@o_^?BUba}Hmf_6Z@ZF~vVzUAB$vEv3 zx@A>4)grSK$n#iIs_~$6-z`DLlBVqA4=@TLnhhTv!}jU&z80k4y_wj7-`n7%=g)!L z8?-II8hi5{lqyRNk>qT2Cy@w#T)o@FZk#oGpkV3ap5f*TLp#Xtn+8#=)Po-M_1;ci z3l*U^ZQ{aW`ScPxuB%1JYvpYimM+3$`BihP6v+G~v{#+guQ#m!!0nWM&-{`BBVhUS z5OezH_OG2aY1Wj_=eCO<*gbpN%t>DlmR2wayr^=q`DGNxSC?ILVxW1jf*dDc?mKY{c#5trYplnhCs(g3D(`vBVY{-=UzPNWcuj2 zc9wfws8Z#_b3tml`Wo*C6$(d?@7H35>ASQpih?wlcDKw_Y>k#A8BTSRLuU*O!@x(*etx*q7Uo=5t$DDpLZ@$5k|JgbEiJ#gK zS14;Q(sq0W^$B2DHlb)3c$T=t!O0%qHf5fH-DGl9aW&ZM=Z?mW0#BE>(k8v|F5~)v z#zsM^NjvuzMNOq+Iq#jDfSinoze`Q-JbN5AOjfQJ@_yHed2qTAw%#D@Wj_4)&4{xq z%EQ~YvIj623@au8#MyubSV@z&(sERDG?OZi0#P6gM(}ylrM2jNx|*xeg2dfpq6{hV zZ>ZSbFUbptnI{DqGZ}puNjQ6_*9owxsRYhuLTbFbs0D1P;hqgyLW!WNMg=AoQM-F; zdcK)hZU79sJh>SuCj&TodvePmTrrzVkKlUc?$bihQ)HI0=ht#j86hCyORY~t+N)W2sKJ)K&Z;l z$L=m&;f$B~yOr(=_6+~tEyFA2hJ<&$zSntS-XnV$%3Tx7MOs4pgdT5MJr8LMk1U6( zvWj@CMrqJj@CxkI8ug5U#gllK|1>9&YqQOLeLCn<6D-{bta-$YS8(mPr3iihZ%Lt-Rw% zcmMCpsQOkKeUU&Spo}Lk^!xEwp&^z7dDqD`_Mg>>mAD#Ii12{ zsFw;VB{?}ev+)wdQ2C`Yd)wd8OyZoGuZ==h%*g~!-y3A$3U@XB)w9(2?`X-@hjx&f ziCHK4JiVHZ3-O0vqM`acDohEZ5aA_s2BH3g7<2#7g}5}w>hCf5zs$4gC}5;ySNU+! zFW}UL#{@K6>Ze%es$&%X9=P3ksMOaur?4*A&S%+B$B4F7LK639%C`oR4NAfj1G-9J}7~EJLNa~YGH$2%4-QoG3HYt z?o;t^p|154Nj1?_5F-2hQ@~{MY{_Y{i4<14gD{Dg?#}(M=LFB$Da_^h(B8;EMg$96ay?!bFG$atm|1vt z1Q@~Le~e!Xyw3mMQ?-y+1IpBgwUeVxq(&IT7^FPEws(5RWY+8UqEi_(o6BV54Ibac zK%3sr^gn}{sR=cqM-Sjg%&izoie+Z@gGneIIEhXNG`Zs{!Mfm-gM&wq)G+JrO$gH7q!<`$-)*qxNd;ic+c&e4_%3XJ! zXgZ$dn3=z*I&WslKOSFh@t~5Z_fPhRo!OG~hS?>wyb!91Jm^=DesG8TGS6+A~zmAgR>$UUq7BkQ9l>mM#G6&U{NT2!W@?T-MHf zir;BMQU~6s$8{hSpFUGlxxC#oQ%qFA#3lgflq|Go7K1ks~MzKa5bSoQi zYIY>PcbA#@FXB3neIP}LU|VBHUqigr8}$I+)Yv&?f|=2vHwE5S_R1S^e1 zU()DuGpszx*W!YkV&6DYd*}`Txs!u3R3GPmKEgrjq)qG+Upa&*g8N@PV-=mCPREp4 zyf8g{fzsRW7!f4n)g0G{rjTtz)v3- z9+vzuvg%IF%4_d$ZF<_e>6!j{$zRZ`Wlt<_+`M-Tl;EybWJ5O+%sSRUd4*n!IBbeZ%YkCx!o`L5JI@U}fpn0RgxSI-SV&eK9fJxo^hUT#GI+3}??apYC54FNy~ zYMgX@1n{!z!0pj-^aba+epq6oAcUy=>@nNMcP#z25>W!lhki|b1R#L#6ThG9%|Co1dIUfm zYah{f;lz=P*T@mi#ir`$o{gx6w%PLrCoSksIrVl|$?oMSMEm$jb9J=FJV%(H16%&C zw`AdRq(64%gOezSeO$dT)hyfbHV?5uIUO?|Y4cRp36Xa5R7hJjSb!WHLI5NGcL5`z zrcdDg8C5j{bfpPLZNg676}qW;39M#AvB^GD_ zw%SUm)6bl>peMTmd5z%Q<3w@%0atwC8>o(kC@5mCqm*P%d;%bVA0{O=clLH@BfMNY zsa7-4wFHjgBdlp_MNVx+9S?5%P{H?_E1~=aSIXhbPmLekHKxm);0vgwOrt?qj>+c) zlDJ7g;_-J0sZOUfQxTC{$3T9jNEHZx+YQ?{!X5_s1u_d?_^RFfrpyp=VFS*41zJD- zqG0dWaU3#Z$uFhv09+NcDdTSjr;39qw0PQBS&&C1X9BVQ2Q$Ms0I2XG|& zk~~TBdAE!N8PAAsf!4FRvk51Nq`d^(9uo2R$~3}WBIyJHcbr7rqpt-Jzz+ON zNERut1!{L0c5Q^e4e$zNX3S_>#B>|DApGKT9EXfva=YmRfGdYGvHXMZ5sBtIz4()_w-S1KyyH=KFGl8l{hShr?Qm zeB}u>loU)-vd^^)e@AMLMz#3=Nz-#e`vV-#H+dv~sToC`mLD$0zX5!=rDAdC#c#{>o6OiiDSN#@W22IbaF4AeNEVk9w1-e#tQF5zw zpL}m?{J2^fW>V6u^NT`7>xv<3B4$wyX$JcWtLIx?DkmEgMxK*zT6 zH9}K24WZ^39^fy3V+j7iel-6lp9NWy|KNq=MJ|}z=xEGa*S+n;hYPnXw|)kG4qL)6 z0`m zwAgI}Yvs@PWgIhQRcV$r72dlhOKC>NS+Zs1dJ7e?g$0c2t^kTbm?Y+h=Ph^v{(6OnX z6o3VNp1vdF-YeVQ3*{?OmZ>mJRsksb1Pazyg@Dj@!}f#(Bvcy0u7c*Fhs12~kMMO5 z);u+(=?%ayA`tgBt@2IiI$g_?^w|Au9a|aS!scXdEf@+0}^WT8^H*BgRh%W2q z@2~InydD8&cip?c2P8RAIO>!tqalZHoY_A~2t76!k+1#JwEtf;FcS4vIpSE-kJePV z$VYg>DmBgS8R)0>^tqG1B>8P+ArW4`dNY&xvitSGc!i&?GG)}6)a+V=qgap$JGBX2 z!g63jVi&jDaAi)gybK$FgIld>0H1C`-y^GXf#e z%urdc%+0K(BW+BhU2z2z+K44t{1iK`f|EXR2O;v&opWVX;t4L!_Pr@X0%r-1sp_39 zbWm#XNei-FjQ`U75)Q#KNxS#mO<3Bk>hY`8c%31QPuJtyt%WF#4&<3^Oif zx%Rq;%rjQ};7M=Fc7jrdcMTcM(ws2TTQ$6nR%VKWW0 zW&^Wl9mOqu(1y@$71@I253_1qInz{^bE>6GYqi!PL@mija?avDa}f$YkDwx_;QVIi zHV+MI(1Tx%9P%9X>}dZNX(jLScr0LtqIpk>PqCP5#Cq-I03F-MPzv`yn8bx?p}ABa z!21I|aT8o!tj!t@b#(JLWlwNHanWb-0zK+7&XT?VK!-u{FQ z59%QH<6mb?XVYBGy->wDRpP`>p*eE?*`Jk#dj41*B%dUB3PGCD*2OOL$S1@Exl&!) zU=+g1TcxnWDanN>G9~d|U&1G=x6GfrVAXt**#(5i2{1Osu-`zHR@ZgLwnK9|7DK$Z z)0eXfOteaPjHgr|Wv5K|#rcbhgq&n_P!P?1Z7o6DoxPBig?jc_9weP4creA}f!Xug zzOx-UV^#bTfkMwF|2?KOSX#%O%dnm=Br{X?YSZ>tAWLVBX^Qcb>ckUFOK$HH&5BS0RL3)e_XrsMyA}qKQ8*&9Tmcmj?qy|9X7HMxzTBf^#q`DKi>n^A%nFYh7@eX zGZH}qd#w9sI-$%AxRdD{3h#;FTDoBjf@==K?WUbgTu}jgWGY*)DkJlN?NxQF+G%Pn zB^U0&u+_6??QxZE)z@YGz0b~B_viYEIiZldW*yK+Yt^^YmBuv9F92d3W-#x1#c#{Z z6dKeID8R0~BY-&PBB(W(O0nf*H|CP@a5mO-*pM!%YUqyYEllicX>B19zVRHvdEd0s zO!f|*w}?Nda?dBnSD735W*2jui4<`|K=7WbEOKKmj_lb&R+Y+kOc8B z@o(Il64RRNWd85*(8#&vToV>|o?)*wmH24uA3To4 z-}Y=^A9_KI7rLpN>2|S77;&oWGt}}RQcJMkwxvQmDnTN#Nzm)w$(CgCQ>oe7WLC00 zGPEv|53e**4O`oa-~rEvcE33qA8=zNi7W}zqOO<;w~@*J8PK!+%I|6EUO}0&!hYEihfr(=ozoPLn?0D3D;4F@jW2~Rmc=BJU zVXi3!d(szMrc%*2q#9EBvJh?x#j(DQX48NKnso8Xwgt=FNwItdIf{77)tmSwm`vJM z;exGX_an#bEm&(%ltr4gK(Pre!(x2U?~*5eGmpcyiLIg2c+!t6+R`M ztE)8?>B`7Vf?=+W$k(0{phWNH;ap~DydMvk%iL|)1p!RU0&gduWkz#s>kKMb4^~)5 zt$jj_cm`tln@@0+Y1@br4gi$CEU%dge&i^h3#^_dZ~Lqef@{R`rceGkhMsR6*Y;nt zE|RP2JCywzFylQz5JF*6v4k7Gj1Wd9mG#6}xqHD;B_^WK7jvvKN3t%h|NC9XoiP@% z2j7=rlVvl4f0xj5VT#V8L&(tbKUH4CbxxC(p1#nSqA=*8&S{Pt;Tvhw9E0J(v^{JB znUoP?GxXOmXSPioB`$waE?iE4lQL@AO#glKfv+asPukJE3wYoF9mEfM@p#F4-av#d z+rC9IpbkPB2?QUpQ;jfJGDKSk@l)a73t%H_fwfm*3knxK`+8>T1$FAh8AGrIwRdJ6 zEloR5IQ6$kr(oi7Y9xpe7pY989;XW;EK+48)MmYI(_=Gj`WO< zC8;qcpifBBZu|GdV=QMyf93g4;D4oT?Dj_!ZuA$AHiI*5#<7Ek_flcJo&Py??DRt$ zT$hf)b`7_B$sJF+ZU?0QY^%$vsk4b&tG}U{jp(D)=;w>=dO^QE-)NRu(`oZFXkb1` zKk7>3nQb}<_Z54rnHH;3k-(x6<3?e@p(>4A-m5z3OU8j>@0{lcl_-~L?+DVID29ZS~hX*L|lI{)}c;7CnaN&{LqD$`HnF@fWkO!$uwc+6CDeR z@ScWxn-O&|bwQ=W?nqdAnaZH3#hX@BTp!@QnauL?0v(%bs4jOvBk4unvQNw7WtmlI zr&Ju!6-a|_Wi?J2vLCS=8LS-iTD*2Itdh*UpXST>kN&rayY$L8ka7jJ%tB^r=j$8D z!b1B;Q33Y>S@yHq;oVYFG+%@y5D(?${L46whKFO9({AMG6ur<7KdZ6|vtC?P*Tljq zj#Zpjd5`B-#=(HED$c9saa;3V{G{j`dR$ppM#T4JuHE~)nw1F5E$%CFfX448tvu$yn=F}-a)S+v@w@F zD-5q$GVA<@fYM|W6d{*Hr-_Th?kTj0T{@wpL%iMB(wb#xX>F=hvnM#K+cj?K9~yW~ z{kL*~ou6f;RjY`19$;DdZmpymJptL@m`M6jN*l3rXM}r;+|U zUasZnh!Dvn5L0aiD_O|VV=9NfNlq&tN+4p-?rI|oN_ehIu6@kK-=$Ry$K%CMGbN#{ z3+F-_X!}cL&~EecEh(#s_Ek@bg1dRffX(h@+fsL=Iak5R{41&tO2M`N3kHg`1O0_N z`9(Jh|2HoVnHLWf?i3W=-1fIO+p+2<$C*DRj^paO`uBqsw|KUdcep$5JupMuB;ijL zKeY;fY5HdW*lnFhX`$%!qNZ&fN7J?SCBsc#hzD2j+~%0N%|3?kY5O!G{!D|^O;={w zILSxWIB6s4)X(yFe7ghwu+BcWh6v~+3cXocLfVvojX6WZRWKN>I6@19Q9eE9j1X-5 zSnD+E&&_Pc*9XW$~;&;W4OA4?oBPt?&z^OhEH`u;b3eSHd>N8AENAqxO6Pm z1j9-Q=U!rAu;>g5hn`A+!J>zULUDC(lvx1}cKqkruYz?wpV|>{@m=s9blA^bMMq7swW5e4yPA-l?ZN(kJg19yONSuU6?>ib3XLCH42z~x zZAz^5l%@MtK$f(|ot={Qh!3lnndLJQpOE zy~^+!<;A40V$P89NmL3Ek0Vj2$v4wh1`72OcR7AKgiOQ)nvuEGrK zmPyR3O|r zn>KQ|ZL>a>#QAn?1G&S~(RB2dcuMGja$5^#{N`>0Uoc8aL1!f!ZBL2WA9PS|)eyyX z_|m7{Omwk?U3)P#xv=(3Md?t*aD}dUQGq!;1vrF^RkGl8 zCrOjOq>k&!%en34x@QuM4=z_OheSubswwCr(+D`6LZ;uqA#$^yLChUP$=-G~*tO9J zGCp5ymFgf^Z9EurHrXr0S~^jlLd{{UJhagmV!jlq^hWkepu8Z_i8WZ(5&8Y2nE(dCd}0=2{>;%K9`$2ZjR$6w*MtE)6tyXuaXDxI&w6hdFEAbR2a(n32!-bfLrNTIYCp<6am5_aWrnRdHUuU+7*>Do^HD9$`vj`?Httdq z8bQ|YLN8dq8NZK&R16R-=)nla(19r|;V4`dX>Z}14u=nX#TgM~1KU}@?0^pkY}QC} zg7t4-7O*_%mOZtD7S+f=E4z`0Nq^yDp8EuS+g{-?%qSUG?|Uw03os9c*>; zT}-QPtMsoCZ?t2>0WbO#=fCLhwp(9Q?*+?uhqf-kF0OPQJ{sCe3)*OC6PBre)H&}( z+i_69SL(_2bR2ZaD#WJ80u(fvzMKj>_!6Up+{V4%VX9|P^&+# zw`)^sdE>efWOAyjv}X;?hj(D?6HHS z*bN_l5jr~rZ`f%=0d?%{1ilkU-VGVOYR;{be`eiZu;+)Y2WeAi7ErcSoExY+Enr!vSBo)XG!yMlB1z`L*& zPA-%Oq-#qZ=sZRj0y>WPAc81a?m?ZvH{ezHD!h(eP&;P3Nhwb(+D_vqJ}7}u{j=;P zeh|r#1LVZ{(QnVMnS@D&OwM9vUs&M*r>&?>qG3|SiIm_0j8$rs^v=&}C})F;lP%~j z9pV>fjl83(mc$5?D$Wcfh+sx^m{f5hIr9D2z$CEtX>B!0wpPTt2L3}EjazlNAwJI} zu52Noxg{T_izMxUyz=x}W_9e@x*BzUy7QTlGN&Lc_;ZMm*#MH%CA_&*;*?r+v$Lf@ zYv@@$otKrV{j#018YizzU)W-QFsuyQe=u8W&7~aAFnr;)gafTK4dHDmf)dt7qA7AA zHd;nX9C>OpODQNNxd&^b2G~*xIv@TJET>StUd{EOh@2D6PAp~Eh{7zo zN~#GPVn-%n3W0{-*Sb+Z`J(60m z*pOi_^H!0WP#0;E@T&K=JLh|_IeSv3bnE)QPN_aVtjW3hX4IlCL-6u;IR`FOL}E<| z+~r4R`j4k`3XzwW%SE${-|BxQ&-^G&)kiQ_0vh#(@-^{*^>|h-o9KN2z(=zezX<1S z=?L54|7`e9(lWW|-_er1*MYoHYbF6c)(F}tSN$@6)Nj>K2jg3=QB&((9n;hMRtZDV zyxA^sqS{n-+_bjcYYI57ujDQcP#nPMpn8|pj)U*mq_H|`qN@XY=z&pSkDUiJe|pa9 zixp>O`7BziCM~ogcCNO>fg{iGP`54D8lwCnD8xdyBw;q`YSI7JU#5kf7Ik1E9uMkh zpY4LCJFi9Jf9pwqi+L`i#pTFDvg2p&bJtZQ4t>fv0NARR=;%7rv#R=&#K2_JY8GPN zx&q+}nJC9F;6m2R@F-lTlPI|G&VCquI@ny??>+6ssFByFSUt+=Q_MZp^Pk6?UDdEm z{7NmFy1M7{G~WI`7mwYm17$(aj#@E_Gqu&#r@h&kh2{QUTy1v#20BrG6DL#G8gbBt(@{}qd+a4qQ2|jR z9H*%f<;`l&bh>`i-*Y$z^iuu-iCa7v#hrW<@oene z%Wq{z4nKZVPIZ8|!zYPI;A(o*%BM~vzY1KA(6cH0&ut!QAS5mD5fjP8xeVkO0Y<&a zu|*xdiXR`+kPO6dA1m#ZmtC=cG|r61vGR&u&3rLa7vq$8cIsriz3l%duyeD9jg5_sjg2kiHd4>g z6N#nB5}er@S+HtomQGG9w!2|Gn*>aR3e<}ym;m6F(I@9j5uNOczJXoC%%ICWiIXTk zYsL$`hvnu9@VvMRysSF#{*uw;YN|Nk8s_}SrE3Z8ugovU9aaTD&klC5gB@EP-U@F+ zdLh&rrtiI&0)sE}B^r8}SC@4wCdxy{UARGp0Za@fe=5o@u(N%e`&;)8ETJ9|GZ`%S zK~=OY?OnV2Mn3MrDkZx(QDgUknWuIX5i^JPoNh0E@nS+|bXd{CyaD{fv*_U~{zI1n z|6$Cf1q+8#$*6*9t3QuAF1kXu>(<&^X-kO3XFh;MIQy*DkIds3c<4(Sb%(~0yjQ

g zy?owZ!3uF^6)>jGRFzQibRN?&z&X{imFfpET1(A`bJwpua3>{xp0Ter!0A3f1|5)` zF)Q9bEyLLGyv`g1ZsNrq*7s`z<ay1PQtl|MZDX+v4wZw{dfb)j>AI=;<$1>YaN{g?u` z+}l|Cv4@ZJzx#?U7MFhPadH1~(GNfOm>Qo9AKxD1%kEFY&Zi$2zq#AOi(hmb^X&41 z|2G${+Wiieo;1tfxWowf4fi`aQvD}x7w%uR{pG0qL%tt^fAe3h(}4d<_1=o9ABj(n zD8HipV*B?WBkQD>&DhHwZ}0Thb%C@^{1YzxqHdP|@o*by6WYM0TX@)XCy1?hMfmDrrG;5`!RPo4EEo z1L_Hh2nbs*-K}yPxkR{1C&iU6Yy(YKJEr6^e?z8Y7)eS9+<1BnH$un5Pd@!1MCVRu zG9kLB*BhSAR9OqD60S`bz@UUS>lG%~F-Vh)Wxbh2vLuKUcou{VWi7pSH-^}=7jRzN zl`dTz`#TYS$zI${(a3Ol0?D-}Czl`#V48CASp_3IJj5uR-5<7XZ+>v;T`OB5m4C8Q z`(wsM0Pn6Q5}l`$5q88O9N32~e;6SSdjHsRAt({((0DM3etW}+h^heeY6e&C}u1JmYz#}$}onm7BBqK3L zVu4)Yx)451x01HM6d@T5+zn1TJgUbn)eV1l(l#$p)5Gc;ZMwZzFBE2l+l zVpH}_pGD{_G<{@lCG_oe)#Q!T%%YWw@z;vIsgZ~?B4=xxTGu_-W1*erCbHSJuxa~4 zKMJ2S=`a*2dQ%yn$hIvURKzHbAkBFK&sFreU0ylins2;vdpCWs@@cx@0wgWr@+9ib z#5G(sf$#e`9&z#eAJ4NbAxa_pjlS(Et#4~Azav-Iqk$08wNz2#7t2G#>dG?e?d@;3 z@dm?a&&I7+o=CPDFEO2ycc}8vI^y}+uZRT>+~ciMbkMzh*e0K==l5{EsTkfloOWZD z%>>u;`Ej<*9kQ%ih0mdH|Lg)TlMs6t6VG8bu$=f~avOaSu;L5Cz|4Ul6XazUS_G?qq#yXW750!1fDoWx*@Y79#Wq=nKV%h1zh@ z$!*oZX;#_aXiH{CD-6f$A;Fm&YKLa(#H%RzY{9}a zcS&*VcuTpZQY@{uI{8vxgGPEmi=m~NL^#Q59{&uSB1RRBbZiBh?wZK}NDQ(6NkB z?_Ty--aM0{GSK2SkuCFes+HvPYGA@7@C*#fgISvbNG(t@pkQjw0H~dL#uaL?h=!m^svW=p3=9Ysrj+iOh`T^$z?eO0 z)XqL6#<7IXGd96qkI9J46f(JEl&nc(Q6fxf=1Y?^6o|l)G8fg zDRzcMSUf`TpmO+SUmkB@3eszFTh0nv@n5JmJ5@u<_u>#-P3IHz|Wrig- zQ#@)D&S4>8d;T7=GcIXHclR(ZV5Rr3+twEWaD=(#BEx{VKvEs{ScTiI5aW1CRM%MLTg2pXV4(MM45zAfk`VeF6;;kkB>)Fp6# z&&(sr;6kt#BHVt%vrc+Ia~Jlj*F?b{XaJ;*u{)ITY^j%+v=|OUMMQ_w7o4!+!q>Iq zy3Ff}OGCLi2+CNMKjIl5?b#tbd4{e~3-Zdg~FY}AuMT&Y3?t-Z%1QGli4s(SKDu<$Y^$Bij-C^i= zocK1RM6?L7t1ys&!0H^r^x3S(7h%xL^bor%tyTi?@ZVGWa$MhBdIYo+JR;C2qnnN> zx@DAMcvoVs+K_(imdM>$phZcAo;YcBL^`iI<01A|flLXAgjbB>J5FuKq^R5jY(J*! zQfAGuXokzszBch_H^o6ZEM6m@40Z4^gl%-PN0zg>H7;RWjCLNToo7mILbRr{M4o45 zY#K>US299?yx*UMS!zYznkuL1)-4w2R!g~UDyHC+nCK?RE&(GDlO8&4`-ZC5Ng$Or zv8w0{167#6g32n@nepF9gFgrFe4UODdV$<1ow#2{&Wnf-pGq208Y@|JWA~=!@1~RM zW037LxRqilr}YKq1z0OA$gPm;yw3OdP%-}8&jvpyg9EN1sR_Y2N;97|52=OuhV_aY zWrzIW$9wbN)WO8FR&6f5P7_UO8=GZ%X#D9gBH27yk%cJYgtf;J$&13tOIOan0{x^b zk(9Z(&tAwe_KkP~UsH7oZ@Rmfsq-%5J!kRr$~RRHipWj?DK8X^IV%)N+Nv(o*mZ)H zE{7akJov++oP+6;yd`#f&b$cxkw@@9Ht7GblSxeFLwGz_zR^uvBa7tB6$is>1T(JM zzRQ#BXJna+QI7QHzi!_Wh>=;1GDuMdY0|AtB4f0tK#i#EOo^;FA*lOi?{f!;zEDCf z`;FRWVD)a8h&XluyD^U4pKGD(JdpD8F|>X(4491-PMC6)b)~aVRf-Jes7qcokxl2r*o6w-&*P>p-`y+ol@4K0 zr>conl5mdWNR!-SZ4kiNvt?9pkqCp*RvL4v%`yXtsPh4(b}TgQ(mB-^*#M$`AT|ip zz5~*4s=7oe*uWWKS_b*tF9gBv(@N$va)xfn_okn#Ae5)jV)1s35LgthY@@TR?aPF< znfJj^P==FesWCp}{*kE-1{L67`*JB>vOGh?dx8$`3O%kzuEGgB! zt6mo$4Gq@oV}mCqO$?`Q5=k4xo^&8Opqc^P^vaB)oAz=I+Xrj@*ndDiu93J?&T@5hg5vgY-&)56c{~QCKmdv_CN^}PM zyhe!M_b~thLvok<9A})w)4_8>E4_@~hX&n!Vw9(mfnbmmE1%OhUBuxuCw`(8WJkof zj`3yIHvn-9!of8qCAFPr&-S#?O2<>-XED^$!NU zamCGLprpZkR^axn%7cEgY&W!ed4gwim5#W`2yzT%!$?LzvJcjp#b=j^4G?wu!0NA|A53s3NY4` zxj7)?pqr^&YG~4$&2f$w0T$)~9wuC0;V^q{n~_q2{}V~%Ghmh`5hSXQfC*TzV8QC? z22PyHlVHF!v^!A3?g%Lvz>0n&4`U-j_R4gLeF?zNx`iy7 zSbB(WWAbUkY@mS$4_@YZcD(LMePSfMV4_3@r9T&>4$AARTv=lUBMb)-fPj3gidC^N zIm+FTpg}_qpiMGr1T6*N6uDgx_L=}JKSSm|wcy#*QbK@~(12Su6x^}t(Ou-@=^m3R zj#$6-pe!bp3^)Noi6POF11^-YCCYl+LPH35NI9z_EQ&a;al0e@kVBu~Vdt5bNRUAx zb`aSv9%#Nm+DU&RVg{3&39$Ruv(e>nzO4_XAcP(6mHXQ&`)desf|V<5IP{;{W~N7y zQ4)_QhnE_0GfhWKBaOj5 zJW7GazCChe4S$&;L`3z*OHz_N^5AxOkT;|b~{(|vD-<+ zk|K3^ z0x{-3ga?}Tl3muxa8PY5D*+7RkSl!q%bJdx#V_1!EfNzd^uF{tW*4P;1R(YAZ3o|k zT(7NB95SW*5-3cS?adFpX$zn6&wGT3yM6(KKO4hb^@NUq^?<}g`!QW zoCRCoZmI+$OHc=MUXH9yTR0h%65d?f1gKYV_pvHq*dMA1zGglsKOlMmWvN@SK#{C! zr$hKWDOT?b4k|ydX~mf6^X4(c`4h~d6c5_hSKp;lgbpU|ka&G)$3GDl`L6a$QC(N2 zbZr}Kpn`33gJ2>^)zn7g*w_zVq{o>k$wE1WHAGv6w#?2s0@82j>Bwv&ls6$P+?+?g z#ps;DzXwdcj=mrKEa3D4`X(XZj*c8PJDX|rw$HOafWNN)o)=R@Yl}Vp0W(Jf8m*=< zFqh`9@Ey$6zn!P8z?L=|c3v5u`A2+y{=3k>o`S+EclL? z2UY}jt;JL+(uDGo1!>n|U2f8=!yeHTZAf3~*PT&*%%=ov7&N{&$Y31!Fb%tozbVhV^4?DZc2!86#Rfzss5;p?C2m< zQDXkbY|PVxz+1oC7~meuWRRhv|ASK7Nxlc@E2C23Js;S-pU^BDl>hOApv9&)7V#zw z;fOhh=HwQP3$IcvsWD*@PBX@iHh7$G1Erp2yUt}TaJCoO(Q6S)YA2}x{Uao@xasr7 zrCSg~l|Xxe;{i_=lvQlbS3K@b94F3IJ4!8*oexC@l(MuBY;0slAuC>hvi|Q~0np8i z_el`gQ-O8|E~F7%ggDx({sWy@l@4+aP!~gYpsbuK9`SUbzj}xvac&+3k->aC(h)$v zES4RG$$pZqIungs{*9%G#0EIv_}YubEd0zj*_cV__{j}o!q4NV98tk#+@!lg?)=yD zsj5Gi#3UwplH_m+)-5M+TvAh3uqIEeO*O(@(bIA|kxr94v}bW}a439^UuKe9X!Z)` zb~j_3##)_l!Bvx&oGN!@kHf>n=k|+)fj1N2o4|TDS^?@(L>)Al6dOAdPHMGE(D}j+ zEaE>GeW_g65ECM&$9!=@JXqpPYSpqQMh`jlFqOj)vxFia)+-(IY{W;TNG0L%Cn-xR z@4WQXkRFNMMO@oMP{iydqPh4?8ApQHo7KIGscfKm&{eo`9N84u$@ zG&={d2{FJhA{#DQ*f>EVbGb-Fc%xDRWx>R(`GYK?j27DHjv=v)=|SUXzWYh;8W&O_ zBau3KwT#)x(lTkHdXWMfu__8w`0`1SEX^JaqtTPF;48D==3VkLF~1NJST|n;Yk+De zHh6>v|7~iN-%R#0agTqMwdZLXhyJU$?19wg!DsR2)um(yBF3HLk8v7^knt$gcP6H- zAjby8YM`ClSl}eE;Zcr5siimfzX>RGUIil|8GyhXOT+}Z$uy?8s6t3F`vYg6H<;Wj z4%3vAB|g%gA(98wRpQe36dCAt`4mp(ZpdC>HO9F4vctXJ>l4?tU%vw1r3s)|iBe`i z7s1j7`#!L3K4->0dGQ6!BZ_T3p$gU?L9@x;cBG?5`z8?@QEFSjx^4hE{O@|C2^W>K zO*qX@ZhLG6%#yzlt2kQ@zO!>9h`S=3)L+7u1Oyv`@&qhT>SE(B}jRRpj)EH1p|Cd6M&P7cI zio0&8L0=F4dQ5w3V^6#1xhL~=gr|wElRx&YX#$psm*x+EWc(U}NLaXj_$G|g0T<$* zSAR@@5dA3PbdIK%_QJw5d$d7o4XP{^;JnKR;TGVFmRJ0Uy2o?jtA(hYSR6aW(Jnr4!@KoT(Q2)y9^YW%^f$bP%v(dA#qX7I(|5nRaB9bV4#W|N0n zEOC=6AnOD~^}S`&b8TL(?u{jJ<%g9?Y95^C63O9RM@%ebMGVLHA5pQ>7K@i$zGSsi zD$aAwsWj)g<}{A$TrkZc{G$}K<03SPWrD`)yNoPdwsF-wBlnuJ=W zScga-A1o?1mIOcn@(!f@of>O6s!Mv7cx5*!L(OTpzU{P=Bcc4jAq%-=;(o_%`@=6m zMQ1SS2y%lH+6$UA?Gn_9AWM$@JpyqjDwEX6hP|f>vZn(tvt@yy+YMnrc|uYU_5uR9 zC;ib#{!48+m1rp3+UP=BvgaJFHQ?$kvs`ewkyWw!gU3RWdVbw`!&@O-bL=KJxaim| zZaCrW@O@5n#6bvbPq4+usamTMx7f1shHB+pL)FKKm}M=BU&ea9JDRdemwpCPr-LbX zQ!2LOovdp?=b2OF8OZOIf<<6*Cx9bGp8V+i{N~;c=hhDv$GI>KFYa8hiy(agV*4gM z<(6{x0UhO|MmbFzs>L}SZsHw`8$7U8j29k#fx;j_340DjN#akFC=(h%|!1RWX8o;)# z82+LJ@SjU4UIMfI-JMAXQOgJpsETlb@s}QnNiOi5N@`Cgap1nW{DWohVip(C@21Jo~Qu~i*TPn&Cn15f~ zZ+{|xsTTLwI^rm1$MV+LU?J2if^}TSdw7UnCcJ>W)tMmY5*9{WSO`1f{{D@<3dfTB z5-yCrTQ_R8)8X`oY#hr+9mx9=y|y{YALLx5aGzWBKk<(#<=Lm{zRPeZxhwg^NCapI zL>|=!*#I3nbm+1x*^0!>`RD?-Fj|`2-Po-2b6M#;B9|tLSZk0CC{Un4v5M3w`}Xt{ zVu$_396rE2&Y8hgnu1*>syNtaS5)DmU&KNec!U9$87bW=pu=9Yyqi4eV;6{K)=F#r=N#GQbYlbG5*EaQpfzeydDf%>HIGW;%|x1@YNVkiqNDz zAu|MJ{ruETxXU;23IG5A0PrK61cGK!yTfBvbWrU$M0}D6Z|q&3^MTFGyvx@(a5=}* zq>hIlN^0$h!^q`HCP*L5MbGoNmONW$f?#ngFN;|H zPC3GyiE=KNzdY75>#K4MR}eFLLr z6q|mUTWquNsbA-lScQy3Lgcz{Pk{vQqhA%oEaVf%OC`%6l3(=m{{RZb-SK;C4D z2QPk$aHm!YIgKbacBG1Lz$Vh*d}HjPeSbvfm3UvF)rISgtU8-~tM^kd!r8=|=#g|- ze^f#hRybp3u~~phF{dwb5~6~*Q7dEPt=;>sat|TV4EAd^_T~M@QXh$itM9bnX#gtn} zOd=?QnA2RFXOz$3bm2L?8c$m4y+`;6S`jK4IiUrT^{U)WKj4G|1bUmKWsP;mCujlP0mN$&uBIOe2HA^23 z-qaLujmBs5_6;Ga+NDNarGiSde!gWRoR`D%QG<3C$ZN(n4tk(W$+ChJrGE{!iyX0% z9b`uWZe7a?5W3EXsGl0fkQBm+h{kANg2!Uc0;f_K-<4rHde-R5RboP*6@hinJQ#cK z;Ny16Pk?&1U{3%9MZh=pTnGQg>t@LFq40GA2LfEhTh*-%tc>qv2rI%za98`0ii zj4$m#;1e(iPHlwDxD(Lky=fT~QU}}W09@~Vj_-#HlgwBC(q)5X&au76D2>3A^M>WZ zeUJ?_#&GZ0*tdOa53kq@6_dr)3&Rr8kvd7o(J93q*{xkS)7>i!&OgwMV9Q_$?Oq7Uz>6XxVaLP3Msz%#G0KJn9zAV`8(LT!pL z)jDUj2;L5WRqA|l&_$GURnIv3NHb5Z4QJIv6G9sq*_;^zss=Zw#K=NFlmz1EsosYW zC6>8wpq;t!>L&U=@H3-z^o_!(;&=E1zTj_0LA}3m1^Zv#rj|QlN-1dAaN7fq{MJ*? zJb!_n&%&x4&_EKF<+QgO^JzJcSje_BLON4pHvP!Y#xKaAm(8KV&Uey)1-1CuNdE#?lpV2E}yE@|hd6K_T|BV_)Uy5aj@tJ(p z{3m>MVA>B!i(T>XhC&|l%+{skQ7AOb2il?*QQ zeQ}e&)!R=Q-*R@H$_-BvQsWDx_+e8am8FOXjf$AZOD$>!h-d=~M-5(f7E3Xq`cCK4 zDQ2BadmEGak|lU(lD*gmG=`|{eAvk4Or*na;%e|DWk6}cb@%y)? z%(xS0z5)oc6~@4_P8-n_bH&4X81WNMyQAnCWXQ<&><-|$WCtV}^-Kn#Flv&g$IbI~ zY!PI}w#4jKsx18~JH_ntKd!}qi&ZEBV2#+syVy>sg-8K|Ca!ZS!Cog$bgNZAk|mzf z^x~2d;Z?c0J8vxSd-5yhNYsTvU5Lz5Q;qXW2rBjwiw#VF)g1e}qg!?O4?Vk4u`04= zoQC9y9XKKp@I7QFWmE>zhxdbow1dfTW3&jMmZ=wL*h_dQ^NFS;T%AF!iAd5%;2%2> z{6WGROM*#Q-qRzdKNWS(gi*7*jZ`8TdmbR6R)sl2W~f<9Bj7^c1_0+ez99){ujF*9kJC6wNyAs^i?xHA$); z`@@u&OW72R%6p?OcFX9Dy<+y=6mD)R`sk32_=r5Ll>@~%+?S@!>emuLcA@I2P#lL5 zPBiYFd+FSC2Z7$ldm-anRsu8Ae&p8x2x+E+PDzR-5vgvCR@xf2JSK2XC>_Fv&YX6C3-pi;=p$T#+w{*zws zY<|Gk0&Wq?R3mw%`vBN&@LT)|{Es;g*^|E31q9CI?LGAFvHZ{ax-jRgd>%HPw(Er* zE?DICwp}fb|YfPp#t#8_d5 z3=a`O8bz!{Y-;n5!weTfNMbpw>lZhR;PuYzC=5rVDfLG%+E?%ePbi%SRR&rIia0Us zsE6RTJDQPUfwrb#Y10~bqU7M@?&+d06&4U*b`U16TZ8VpeOg`tHC5)worx1v4j;SQ z?x%IqP+7H&Rbdm+Ft9pRx&W8=i#xCM*$c|2kY~kUEa&ajZB)IT0>ihsg#H1{av0UH z17TwZow#U$*<_>BbYDNd6zWPQLf>0xJOkck$KRX z!%LS4Qq`{18(8>A&PO(PL#`>!heUJn(SKnRRjC`D6J)p{y2+O|h8{51h%ZbT?S(#h zBqk%DK_*=#8J;Ogi#%tsW69j?G4YJPlu--BgeT7K(_$Z8bn#!+_%H9{0J{+$FCi~X z@S)Hs3z+EK=yXx)!St~8Pj#Bqk@7B8!(5d_LwzV@2a`qBZEa)r2s>Yr4Gt8*^MK)& zu8b_?P9c&hyN7<>!-7Lb7FY2S&pn#(|@ZF`cr}Bm~A{WfA!*OviBifY1pjET_iTq*%SV?P!j<3DKGN zCH5-7%a#H+IO6=$ooEi7y~6W^JLPo`0a`ghRY2-T{=wqA9oLN^c zhWxg}>E^|0=c2=v=^*=^V%#L@7z<}~n{&KpPKTpoQxn4xZg70^yNXRpltpT|C(K2p z6Uu-UamS(mh*`6L#>){-;N04&QirF#DXll?P*uRa)Esu#E%g1PiWN$bTjvBSP z>|4?pnR8*lfI&tDf87_VCVHih!`(PBD&vGkbaX!!u428`uY0Ns12^l9E;Q#1^E8Se z<|GV`)VP5aQroBI1$VcYrKti31|>{$)2^%qaW=zYV1VT!4Mf@kM(Nj0yEkIocNHHa z_mO{^rfQ-yoBicNc3tCBvHMS4!P5FkOKz^Fr5(-NUat8u2W|+VMBd^=_bKP$B_)xH6HSQa!*_mJ z{Iv8Or7pzAS+V-*LQD(n@Pf{#d~E^SqJ%;1(cwAj%HKf=olyZVe-IpqBK;ISIpzOG z#CC2bpJ?>TDf3x=Ck*=21526aU6TiAkC_4RH`+d+Z$_PJ^!lZ;&gdq-dqKu=eoHS9 z?lLhW)Yywsr2Jr%f_kJdHSJIFE;}>KMT%uTaushc#c0;$nNZ9GQ5e7NekIsD;KsAJ zsSst7fv1FA9yX?gm8dKL&T}HWkLVhyNx5}8s_((>Jr}o&QW+A@MuiL{KEQ(q8Vw>~WVj3@#UxA|#h!tP^ z0P8pR_0I8?aTyfLP#$p`t&MU4(+&iB)drH zgBJhY-6Pf{i59Ush?$)Pf>fhZcEr1Gt1&aC_bpDqoM~by_Z{jTDFPv9;A(3`Jn)9b zgF16ddn|L+V6Q_Xe?cGQa4)gyH=}wPN8&B)_qe?1++}4QVPfG3^2k||rj^NW63fcv zmhLg~G7N&e7e$X_j^D{4wE$w(5j%-G4>b!ojQ5omm3+>>8^I1G;M_{gQRKKvxSna> zi#qL`cZ4yZq3=M-N)_ihS;o(}*^`t^FU&RcJ>aJbdLxu=OqV`H_r=ZET&2g@eJscA zsiOLh_&g>%1@IP91csLUPCBxmgg+V&OeTj~p^0LC`PoBJSoAg!_vynBl|CVT($C>q zV&~&A`{`exAkoqckBGFQHJhiTO`U+J0W+77q-FI2K6^!08$(A&M<+>iIvIL`BzVP@ z!>UNV9<$mcu|u$eC6h@ZP^anbNgXBw8HDmVl^Sc3dH2hLj*gB_k_b+zdqy)Tgv%p3L9xkfgW{kt^wf$T=qc5NdOAdrN(#NQh3=EUTxbv=UkGm`j)XI{rr?+pikrZxodmj#)oZ8TQ_ zaZC)ci+zm$-^45}ODIFYy997RGcrd{b@RNl4K)IdA&nCVz*r80cRH<+bY#9j#HSH{63F~zgA+h$M?1sK8XUN8DF@_pCst9ODHyLTgD8Ag0~sWL z3S&%QUWu#yns9}a<|wCo=MnJ?^WrzjD{0%y*5#8$H>m=A&g;9I<9jov&CcWOD4wxo z8AwdAQcZpuje+yX3X*l4l8^}D4{0$?_Q+j54GfvjQ&g!xxy2Z(Mu%^3nd``tW9 zq{05cDLTQaqB2!2djWr_zr{iB(Gqz*VPiQUP zHC8RV+f*3Lhnr;8X18!(0?Ma(ieO38%@;IZ)m%|IvYv=&zV6{s2h0cOo3X(#(~0IL zTL-<`UNrEsLq+sSqjt|6=1Jo`ErydL$}{>l*PcWaHQMdM>}^KBXSY)s&!cnC9D0T)J6SBB{ZO&kqkY84RT9}~jNpPern&?- z_V_%wnx^56;kvmokIhY0XYCw0o9f{$P%I9@C;Qm{1=x#+72OaB@jw?6|mDiTK2B4C9;Z zc4B7MjE&F|z7F%G@qB`34za4)AqdX16-c^zn-9xU9}I3yi!bieh+Yb zMEnX*@HxKT$9D395e@_(AiqT8N~uKyZg#D|5yI15JX6j!@3cC)WGqP_C(=+5NoAPL zTpW>|!IbgA9|Pj&_%r%zAt#jYdxhC5FHt_@yh`B;af|K=$x%9-kpx-OY#3Gs0b;C3 zq3{=h)-}E-P6>`;y(bUCW#0$COP=w`e1!*igx}&Rp4HDaV(RW=g;`D~Vy&U57@WU4 z3n@(*(B4i&w5B2csaD7eJw&+xpQL>-XUg|{9KL;Z+>eKe^EU8xfj;dBiPEPm9CVQK znE@=Lk)h|4vwwYkwcqz)!-mcFu^f_+B5u(0_W{qx#INytL#CYH2ar#I-{9}I5YZlH z;YS0eK&F?8R*3l|3NsDo%*&r^2rkRDhzbn$%T@^A2~KoSjYZ*G+LW>z{5!$ZI9}!T zYO>ShHz+57X`arnPtYTSSKa$}XS{`RvG?Nk@Zi(N=oXl`lYiT$7icfyRqxAy;=S#F z%7!R%0pIyNw@P)nIa6FBqLda%VIf)^Tzs}XxP5r?N2zc8s0Pcy`N~d_zIS1r7%OFF zL+2OtyhZ#NAB-_Mcv=oK`(V`+hlO8f5&gVHl8neyzGO#e6V^+fN4-a93>ht#MibCi z&y}Vb2s`{DKe3e*zv=WH_Z)1Br}dxlP?6+Fu|Dx6KMGE7l6_x173pTVh0D)*R78@7G z5z~92I~~*eC+~yu5B}U@hS|J4tuJb>d@IlfYQC(IZrflGG$D^s)3le?M6E)}-&?+)NPpQyC7i zM(XwOYwP!x7F_>*=FC@n;2t8?V<2PCtf~oLJF!%=R}AY8#o$1^4@X5l>gpq6<-WYU zx;obP_nrg)M6Z^|be}`7ZooR6zq+B<@%&8+MaY`GdM%t-52g+k-O0iOgwd(jQ&oW7 zuHNE0yZE~o>BE}?`h5y#-AcrQY zHcg_zfE}w_=B2!kIO4lM`*H#_JU6a!r{sW7PjGlAecjFI_&-(9tuiiEGHFTC!7b9m z70F~!A z;#wDw0EOy91Pp6F3=zJYtjB5>gCqhP1AwS+G+^>~DI(^4v*6SHAXY{x^0&)kZ9r-Z zMA3TWA0tF`0!XlHc|t`-rAZ zAS42ubi%$#qOFYkg9H{WS+`Sk{znP&{C;sewuf(K^A-m94ZWOV%dI=#sgV(}hl4S` zDRziG(mMEEB+maS|DWrBf38SxYI^&{`T7s*T&iwnV@8~hcNn)uxRM_1E@$lML_hTGi}9K6T1t%yR!+JJhlN|d1JC^ zEEm@yj)>pex5l-G`m-He^S#a0sYp2gF%oxE#S*bhATi;@_pbR9^Uh{CwR%2Ic`u`^ zyGzyGygM%O2b-C7=BX`%AI)@`ib7kmoN9wj{IR=p!*L2oXgbdusuEXlONf0ePLu;m z?07HvUU8KlOEaFtB;u2g!mrJvu)eRysIbLnCSk4jn2op9%+3l|TR*~wEbLuMQQq0i zEFP8DD`z9W(WiS?Z;prc{k$AUw0mAR=lMV<6J?UVWY&?(l*oX+WHqc_j3~;#7I3$! zCSvL@qqaQTQnh_vgzjb{Ld$nh@9EiK>8XFtdyuaWPZ7G`THWcdudb^xGCCz&O`aay zgz21;vFWL4Ms42s#QSfBr?uFC~E1fBy^NH60-9w&5Zw-XHm} zkgIW&x1CWmiWlX74PVGft-2HkyOx2Kzkmd2PrlI<0lytg5S$U?d;8%hMgQsA7c}>+2ZLI~0`La;i8=;}Fk` z0b-J{Yml4AOxe2HjdO!jL_9FC4)cG70+*yYNL=}qQ)rYDoG!1c!~X4DSd&zWZGJ>vJJ zN%`JC0_{oKa-S}b1ia%l*_!nYh|uh+=2u;THs> zB~DVfL!Uan5Fdp#!2=fs<}B(j(HS2AtW3>jce=t%)`nxPsUdkCe)dS>;~d>79Vm~t zsBK$J9konyR)mR@bVuHzKNI&(1qU=wD?9cPmgakSPkpOqIMRiY?a@S@t9UInz@J&E zw}n{#%qq`ocLM5N=J1Y-fN75~$}OtaOgrn&|CeLD+RZ(uNwPfC;a-1-Q zMFxbRQ`c4V2{%f_f)_M~i__h?Gxj4%y@>V1lza*c@>R+r%m7H)Y7k_r>B?6t@m~9u z_+MAC``)+j$p70PLZ*01Oj;vqzWd<(K%Y*+`SXMQbic!0cwFP16*0|Wz)B%vynnR> zvTHKablfTP7Og&suy^Sj(f?dndqN-(2p*5;1Bvyh z$)9$jN*gEdpa2m=4rj1!ofk+UKCR#~ zEWnSykbHL!H#T=dkUAxe8_5fhQ$0_zkVabPVTf#5P%$oExN2cexcCYcucRD<2$YwH zJYZPhLq%}G0eatPNBP=3T{c0RBb{&}GuYYeqfvorq6bq~$_O#%o4shL&KierZoS3v z?Ah~IdW8{EAbg05w2LaLXMfHvhbuLW#wRgdO$gR;BG)60B6GCIzzy8#5ScTGgWKY$ z$*CxEf?wn3!9Bk_w)dKJ+c@4y+Wx0y*SOww$M`~OszVp%XT3UCk&W(c%Yhkm*miHB zoGOVyi{4-_W|n!DD!KGoj}B2~l6*_1DyM z&XHjSyola}T=JGr%YzLYHf+5T*t++Y^3wSxe29Go(H40_Qy)UTA8fpsIMCvDy?tiH zMoW^Y+a5a8)c2DZ-_11t*a3;?N`M2&*Nia^oDb-ey9ISNE+HS7b`I8hGx`Id$hwG- zn&eH6Z@V>Unobb51Q(ZFb%J%F9a95x=jmxL7Tkh$*pdV61o4Rx*aBFG=ykBqBQRnA zx{Mg+X|f(e4E1HeP&bdPrhPTa+9y9jTl$wpSyL4WOk?`t7mRuUAR!1HbjiXjkxk2^ zbqWv+c^xA9IrfRvR8N`nX#Qy#&ULfe<5>_0U)#i}%$Gg1s;b_OSqvu-Ax?#2E);Ze z#5P3u*icvW^4vTMPknF^eB0ad9FuRH=EXfo6vTp`q?7Yu%EuPfZy(}iZ_4^gD)0|t zK8mqM@*ThhNK{MZ!=BN$Zsmi!##j@*&ECG*t+t17s9R)GUm~UbmM;i*d&{`D_L8VC zeHPZle&mDdS;*~VdRA|z-MPdP6EucTn>Ue_3gc6hnMSLUdJ@z4Qn~+OExZAz3@7QE zf=B1u0M6~P40TR#QilsQC2V2lY!pUsAH@cgAVq#+V=aN|U(qBs0{gWu2*<@vduf1& zpXJk5IKC$=_r&fU$LRBRYSpepom<^ChTVE;g?4=DGzkyJe^vx9*t(ErMBO-E#b?8^ z2X1hcx1H0F#8MlA3%ur7$;F{6Wsi#Uv36I5cO^~NLd(mY>Bd_YOZmPRjg(; z*O}!4v)r(vHDgQXVoERZ1Wuj#MkCB)oREvJR)L#&laJA;l9&KMf<#qzB$ExqIEx{s z8hr%0gm|W>Hj_nWwZy7BsC$f}c3>h5?a+CFmlbNCB8F^(o*eY;FUb1J+T9M~7N|U{ zJh=ilEkn7(UbN&FXmnf-oXuE2cZ)~HfLrLRrxj@f=j$tsdRP_J7($Ma$)5PgV;Fa3 zKIk*Tr;aP}-!8cim4Yx{Ol>Z(Bt0ae0{7^hrQArV)d(qmuul|$$XZA5`t=Dj%Qb<+D@V7CvxFe3_>p|`V9h6JQ(nPQ_$GMn&QcJJRvI=`-BZP57UW0M8 zd~NKq0$li+a~)))H^(|P1vUmmriOGD%SES2x#2X<34Rc-N@^TusJUV)!UE&2c!}cy_lD%?{V3&LRI?Q&2}| za-iA+`?LRYr0&>7JF8>g<==ppJQunaK2@B2^9Nm{!}@_{I;4m5SJT(a_7%T>dsH@} z-=}z5BGQ|1>y;=IdkI>u16TWvCEIG3wkn8G#4BJnu7PXj@ANWZuZ{BedIfb)^+SFu z-s_hBBqHu4X|?JsA~euI1C7V(0rnx)qdZ_4-dP?l_ntAXvfA0-gDLdm)*)|(^bo^n z9m;)+=*c}u<(fSL9qq-xrKUFrP^{zu4<10s$VdvGc4=>q)Z{cToG#|QJge)`!4vBP zqm}+1xWCub!gB6k5VjJ)46IcTL1oSU7HMMmq({Dik;+TP0|7 z77?NZCOOO@4ssw0rZTKuWn%)IYqN9i-t;&3)ogLeVv~^BRFm)9pprvs`=Sya18tF} z16j`bs4R!Z5BJk%*b%=HCB*SUF9wv**ayHG?8MTHB_xv$uqGaU0dCa{u5rWN)2XSYhR|lMf8NHFY3?-KhdO^IsWxz9m~+d5TkNA) z0l@kajGW<@lZ(?Z`b$|4$UYekSnGia&LUY8-JIz6qZt_*%3SnJFJ&9Q6cHnHUb*Il zP3@ZqYEpnwv&cY5w=!tp?N`XY4a5ThNyqAzh%Mta_4!o$s5d5G>Kyn^tiy8W=?^BT znIC>f{Wgo}z|9WM^m7M=xJ%*c4)cPAurL&ZnnsKDvy|=0vFYWo1NV4Mx5S7Hc57Eu zS=Fjv&eM|4(&!<^Uf2xR$DY-@)S6nirRrDGizqUg5H4QnfuhZ1V8m;-O`j5QX)qP7 zhtyitJCv{F#lX)qhI_AS&wCQFt08y6f6sP`bB1NG&dsXHkzkZgVD0;JtEhjD<}+lT zH7kfAkP|;LJ|I(LKH%fG7v$VMD~KkQ#4l+1iOn}&Gt^VqZ$W(8pi~WV{T_O&1=3;q zv6D6Rn)J-2{1GSH1-u(^0x%J+A=^-VZ{+{%0|!GGDWF~`gU{?4LKEbWimX9ENpuB$ zp+E3hdVXf{Fgf8D?)~zM`U5Cs=3Y`%dt7p!LGK*P7=$(Oo?@0jD%392FLWzh}7eXU-bXyr82%KU30#Qfd<8Tl_tnqF5qQc3TP})S>_(T-I(GM7^ChAC2ZKRVS9gczJVJXf~KF+z6VF%-~MsZS{yoyej>=n*bCFY;wylcdGSJeT~CeVa*Kv28Ui=K zdKmx!06?x|qBtNoN)hV%S6IH|kF7)$&zG>BnC`DQ9;PlmUh$+*@p!Q$yTsvSoV)0S zh$NO#?@*stOd&>$81Yhax7Ol#>?O+{`!~9CqjQO8@ocLr+&gV8d=a~rkZm0hsgZOhp!CF9*_#sv}Jkl;>m z0=&3&vIJ1u0cZ?I1POn{haL-O;!enklUviEBN^6l^lT|(@VVu2=<^dicHj&fm^dSH zIJt?;91r1DsTD=vae|^w5tz40e_byoC;4Dv^tyR{p8r9_Zz zR)i*(!$ww69^~X0mkkodGUU1lsh%uQwvA^kx>GxKqrOWsU}je z_ln*NH(MMfy8&Tp)?*kuMq~;!gDebrciM53hZYOAXsfeoAjC%8_)yEk?#^x=wW}v- zhk}y5u?=D6T1<5E%J)0yP;>N3>qHpJyz$p>uuZVr-W{Q(akbS}^ji;PH8x`xpB|%$_ARn#U@xRR1j$f~1c`)yYH=q*yln4+wPdjK4^X;JO{L&Fw zE?#M3T3-+r7hP-@JfPOs6n@rs5~T{XmOKSs8FwpK3A8%`1`?Tq_YJ%#iHQ8;?#Rb_ zoky_|P!Jr_kXo0@sU8D0vA~7WNRWjaKgyP^76=hc5{x`O_w(YGjLX@l1e@#!UR#B) zEij)`+)5)yR)4esfNtp-bs!+1U9?e}Fo3%;__CN{gg&q$yofgNG|w)~;ANbp6`OKpx=zzWur%M3}H43 z08C+sXXASdEoy`n;BvWKF1JOJK}}6f&850es^tfD1}Jg!RBS+l+dSsQW-wpSKyoz1 zszgax!xRm3QTpR{H^bEcda8{mXv+Y1K#0Fsq%blw8Zy3amMJ_h)*A)Uz)B1R+A%{8 z6DCZUVL$^07#J8>TeD#0kpb0l!^&I6`m+zIYUM2A1!>4U;Y$di`?u|!a!DejbN85-XJ{cAszn+s*So!rgavKiPfC7PK4Qea;(L_CQO^CXe97NaXi+;o}&m>nu@j5M{QS zug>>N3|)6-O?q2vHF`Ix(1DnV+QyKDn$iJzhc`wYTi43T%R-fvyJ1*irkd_4d2Ej( zmJJnkc=hHhj7+x$aa8#rUrdjW%S?|iQuIA%0v}O2Mwu9hx(cH`FRHR}1Ci%YUiDIw zB-gU09F4SYqKs?@pw<|f`erp|Vb7;_c4oa8U9`uoEKl|oyaR3^Oh#(C^dj3$5;Q>m zVr^8HCOS|l(I*US%lu4smRWKCH$SzJo9~BTI7(%fn8N~Aur9R(D~2$XP{M`{8@5)6 z;AoKff)ch9##SDx2sx;=X1h^zt39+<6&Y6C3o)4+l?*~qww!dK~cnP1(Knr*cj zU<;`liMmvXx~mFjyik`cDd5)AWL<`aqLgE~x0O}kF+H9F`#{DQ&A zwKIB~@BtVdasa%&bdj|ifgvAqT~s%Py_Ug)7+O)87tHekfdbm6+{Tfyq$6XxTEr{O zk=2TS5!x)cG$AKU+-y<%MlE8hB4rYfahw1>t&xme>RqBqB*mKfIh{m6R_gF%4^1X# ziMJUF&ahXE-k2AgXsAN6FX}C5{8JYl}d}7ZO1|fMN z<{)>4`Ild#s}Gc|nco;PP(F!p@g^w-0&PNIsXSXuFMNM`$zxT4As+kq$25qvxl7}T z|AbaCb|MC>VGV0o#@&UC|gB548JifX1yaYdFGQe zPNncPqWP&UcP0wQRDC^vTBc{jb9I=k$xySRtS}<1VBv1@>5SeZ`V9dCn^}=755Ng6bOBuwlba7(z+`!tik(iJYOKT~%Hl&JWyD5+G8mj{FZGE;~2o*`}B?Gdc zf@n1ruy2RCo@s3t4H8rQ4T}wOnitkn>q^2pSc4hvA6OA;M@WRS^(OQ*r1?GGQx!cD^rCogVMu+fYXO;jbK4U`2^2Ey&$EH#B!i`g^rR3;eT6q@+t4G@Sw1BW?4l3vIV6Ws0cvVSAR$90IT{&Y zL~p4r9CV&LPy`48c~sTd^S}=9BaR#@W9Z&DN*R%Ln0n=s;6xA!EbZ3dMi?m+vW8du zX}hDYrvJv4LqfCm9!u#70}j1vY2yd(WcFPuQl&UCiIGJyj{q}Ourcb}(YQ2YE6CGJ zv^7I^Dg(!%bTeWN+I$~g-aNhy?O*fQ!_sNU>i`7^2oqu{jtT^iIB}l{Z+lZ;8qRZl zvgOk@=iEUfKnTb;2%Gy?n06Keq)@|!8{IW(cUOmrR8u$s)>PYX6-(%r(j_uQHEwwD zbT4?54Geh~?Pic^OH203FsC_m?bkLW@}8>8ha2>jtfL2qoMR{hp$Cmr2NU2j?g+yI zl(J?RPVX4%VW@X$A_qDcCnD}cEHGXQF>zXzjH=B^2o*oc*NMF^drO-_DG3# zTv#akSi0tDieen2PzP!*8;qY|Grtr9aPbgSeS!8=w6GlF1fW=CJ)27HC_2*y8{zP# zL}WT{I^BKl!HXArA+58D|6JQcC_q3!jI08;Mo=Z~q5t)RXK&&;@r`EY zz92%!u@%5$^mJaL7UB|RerebdI#L2?@9>exJLO7f?6NzOa{_&_Hg^KdH`hJhYFG?+ z%}k_VQ_QFg$d9zm^>3QC8LxsWT}Y84McVV|#MzBbzB-rK#oF`2l{=n}QpFAl5+q2L znm4A|3dIgq2Pdb#to2iZ0v<AP&CqoQL3h6%759c!h)06YAMH<%$IH>lk--6!YDIQTVC4xrJaX(W9h zX1KMcp`oRyqYa>x**q?@PDlsLiB8HdM@qyTF{53?CK9B>zA;JZuxU;FwWVbCZYxzY zSNiU>EKHx}ZDA*}O~s4`;r4?5v`aF*x7i~ z12v(2WsnuB1#{;9lA4SUxzq)ZtpGP8HPe*v@rMM{M+oZITmagEdf7tK-J`r|53`c^ z*wEi?U>TeDZEKQ;Y_--h#`N8OKiJjEqbfndW%3RI$;4T8p$=YA&IvBApPe zER=J81x7QS;^oWb$gsPLldYV!HZ>oacK6X#TyvUmDH0a=BW?2;{4fgV6}EB$;&ZH> zPhE~#b%TWux7xxt$II$7bkWBSM%c>^CKmv}tfjYi4Fz|kQpS^7O_#lC-d4+i>1-%V z8BJ`kC;_=}-fEtFE4?+Jo*?!@vaeHPP<8>GykROd>HDM6Y~aqxG-qtfnXKuSaG4c! zkV8z&|BSr+BNv@6VjIhpS+3f@rkKRzA3lbi2tN@=4i#L+%?@`X5b)r^gGZ7jS0g%j z_%0?}PyK%aXmD^LabEFQ+e}KVkUm#;)35tdA#qz8(=C8pI1*b%h>+81IpJo`x?GqR z1^DYvu50JP%U*2=J8;%M{7kbc-%A+}JCrMA!|q_`BxrE3!W)qheUdC27|}lrY}@^% z-}hsOm%4=Sv)XR>IJ&@t->IzMh~@e_f9C3-A21zPCxKwW!YwRS@s`!Tmf$WQ;$PM0 zn3Pjc;s8tfa$l3utC+p4b}~xJA1JL;TUXdh0)apv45oFXNF)+TCcioqAip)wEZo9L zQ9;ATK6(CXg~?>5K)WO*B_$=B%_m0*PqknWYb=D`M@!S9OAYvbBxC&N+EALFa6vJx z`3@A&HXoYq78NNgaU&!vSwDfqzywd_@1nw}2><{9007WQ8lv8J1J+<+LqmfA0RmQ7 zrm0m6awwS|MI_nO;aLW>Tf`P~)LaNJnq)*x2RL-G&M1NgWF-~`#A!R|lieAia$4ey zY)mQEyPcW_*z)Gb;dq&PwVtb)g%!CeKaR zxD~S>0Ix5k%+}+Pr!eFB?cNc0OH;jVTL1GvF=T4_?UYEgwMxyyAssoA2VZ~;17pUA zw4@bkl+jMUsW~8SRH-g?23zISQMY=Sa7rSR4-VS;Y`m9%;bNre%J%7UI8LdXOo;75 zTuEzv!|dP*fNa;mD_Bv}a?U-!B)rXIwH~~d4|lUXg)iXA8si{WELADASM+IQ;(QE* z``-I5-T!KQXDrQ|lI*1}cMam|Drr*+Fcv5*%sZ{p2W6P9J|-D`;T+xJWd=#Alt85% zIN1SQ-ldwO@TLaWTqC>G!4aEC>&uj;N`+vIu@9T@XeWV?2#?U)e#tl&neSe%EshX2RI{9(bC;Nsr7h6ul> zd-4+L@HfPF;UxQSJJ+VlD#lO~Nr#Evg#`iMkN_Zs(gae@>KQQ|@vAKM@c`mTw*8O2 zR!9Q@q^d>LGehkmBIQmI{R}$Fr~s)9o?R8OcpWElhQlvEQv4E1%#C8 z06xOc!Xwb}rka5i$?BLTl4oL-B?xNTL&~Sr;UH}f zqY-x(ekbS*uumgVL6n<@%cI7nw2^6#G~u*{@_Sq1wsom)YM8(TCNM$P|A|SLO=CoY z?rS3yH3QvqeDcNAilw@7C2~q!lpKE|hrAF0%F#wZOm*W8eO??MwCsNSYF%S6cXnm$ zr3CLyluy=v5<04IfdmN>WQp1--0TQ&rxJYyJH3xKnD3>X8Egn$rckOVPs3cp@ZRS7 zMsC_ecB&36DFw1?p_vcxF4D3W#IjRqCzo;;K&&eqCTxi^aIh4pHyVupm`We=!IXuF zU1(dKi64#|&!9Vc-#S2Mo)>9o4+2>Hvnj*a<9X}W_0-h$2`0}a5k_C?xI4s%#9fCY zc~6P&r;dU!#w2d-+zc+r-6>&lI6)(*vAIKkT@QcQpldOODNJDs@f^3Taef|!e;_#M z!n#S92?83J;o1#>1Pcq?J7G9|APUCrbh4gB-cxcYUa9U&JUeN{NGj4+0~JLn_KN5W zBM57KaG4GYQHHGwEse$mD!b`O!%lVKe;XV;-S|>KpGE7~sEOzaF$TJ4l4lEf6!0Z3 zGzzpjDf5vX4I6~Kp=ed#sWkH`@U17?-~xW0@EBD9cT!s%v&vpBY4nhpwVE|VWP`dzzT8*erH+6}d<)DEmY4X1Fk}jK7e*dQXkTJ$W#HYS;+?_Ys zyRV|Clo<97noaY{ZUyG^y@V;>Mok(ZAQ|})Vup`w0B2{+OxA8MJy8czYl{v6(84(8 zC+us$&9v~LeB4i_UTpV|-eadzde-J-v?13?Mv~#@Ew55M^Mq2}MQT zT>WI{=tTCu{;cU8ZCx1)#r65AI8nbZR?c9YtNc8s-;bOGKhvk@x>wpuvEYTXs3GXT z2h(SNqj{xdkpG-apGfxdT`{Vghfz+m@{A?2ru@OYMQt_lg$+vv#Ad#8pXta&{Nck- z2Ok*?uO&M(rTcSiBMr~2;NS@h;Ht!gP%;LDtI>EK?SS!)4HCPx$~Ee#Gn$L``Xj}S zUBbGxb;KubdT)^K2@2?N)4Y>BaIM{b8HI>7phHg}#{GDy-Z5H?SL5j?ln%&EMDmPG zNmF^Y)-dni?lncwuR-&S7o4EA_I|N_LtV-uyvDUJU`!io21bE%^Aa&<`V z5-yKd_d2C_C#yuie9t&cXMF#@7iiGZC0DVuw|j~cIyRVhK6iHStv27M+pC9*;Rm{T zJ{?>HMP@M@9YgIW@f$KG8mL#E#^kH-xKAMdrRlm3Ig?h=Q?#e3HG&nJTi1Dz;_VOTe@xkC^H(JN3C-7Nq> zr<(Jq`H(*@o?8`esc_*6>CMxnvRg0=;~nNpW#q*smSiHgAI4>kb-@Q|U^)SroAhlv zW7e|3EF2l?LX25HbBq*n|D4G$o(iUoVNGHKYMh1GJSfolDKA=L#e8;W-h3AC@Bx9% zc=v&T59V7M*Bl;1klra`J>c2u(b7JjQQ;HVFTE?iA-i`5Q7cU?c0fXg4EdB*;p6=* z0(A5E+QaELj4h$&Bita=lah4Bf-muWG$PZr0SsSN6NoQ05ox(=(BIw3vf)%b)O68U z1{Cd~Lpf^yH-_*oDTL$Kk3ji8hA9Wk6G)`Bh z?5quQFeP@gDpk7uY;swAH(jvT{uO&@deHNb;NNW!dxQ7{=^7KAq>`dL0ro7VAxH0X z5J$N^0b!%~%tw?1001D6h9=R^_Xheg@G-y@UHxrvY7*MQCCc}Vyt00G0^b-fYzEgV z$>&Jay(UI$&QL=Q^%E{+p2}xQE8E#tB_V(UR;X1}<)EZ8YhO3ukF zi8zuGHpYo6;5M^;1!Lt26(98|-ES0+j%|F(Z#5H=V*d_)J^rJ#T#)`1PH<;dzN}-- zZGY^!(*KV=NBe015qs~!8I2x;qv`I2TlT-fk&Y+J-J_SWAB|sFV>mK#$0G42UHVys_q)S<2^6~-fWaM03|}x| znNk8D-7v?wJ?#fSGO+pTwd+)Gw@@yVw&mMC0p1v#(nQQ|VBYz@WGfxrL)?^~Y0B5a z2~M;ipDlDWReExCw`z2+|4P%{Jk$-y;1HF`6&uhyPKQk70=Dn7Xex24N;5@f`!wxr z$vjfJOx+B4*Gk|mjxqz=Mz6YRlnQWU%_|t52OZzrJcZhO{5^V|M^WpQ2M8v(wsb;Q z{qtu!g_=yK1?orKT60GW7bCIN8=P~RRShQw?@vt^^uuC&j1*~4$sLVs4NaWb{#m~T z?YFjP28sR(|9HJLt5J?9sxRI_W^YA@d&WeCD~I^R?V`(Xs`G(41kdDm?{JNaX^5Sg zkq04q%&?0&jbj9MA?WkbZdQ^y^wYQtirk@Jx0ZRd^BYAKFyUzofmb0i%vc-fYf$3B z`Slgan_k-2Ce%PHywgdCL-tPix{`x@Dhd|}SrFCGHE!m^8?38|IL)Uyvg@dZcl@9Y zdx_h@G8C;aRHJ~*>;yRQ<}^2C2Z5%26Pswoj@;_oSAcG2K=r>mPSrXHtYZ4w3z+ad zclFnA1)J}JGKOaLnjsD6nAR4zg%}gfg|7<}hF#R}tm(T!C#*Ol0)}%w&07wHx<=jy z;v3afxr!FPn;|0@J^YcHAck^Ncc$)M;=dy9jAK+kJ!lDLp z@avDmdDI-mzUkaUuSwf$7Mj)`?3m~}(QNhrr#v;HUPIj*lKx1s{fIY%_l>;XWmBUm zgl3tvLR6kAFiGd?9scH2GrEDM8zeVtbUV+WDJ1NKDssbmtW;0KdduolAxP28Ql(huuH@LAna_xo6%FU@jp(fIe# z-m&){SHA_ux`lXdQi2IcM&i=A$T_@`-s9sGz&{7@rK`WKSDlRLS z**0lxHVlWdAl-2iRa%VgxJ{w_17(FUZQU13yXe=jq0Ni6rBXns*!_4JES#P0ov^^T z)L93!VS*>h1kC@Q$Aq1;`FosZ6%3MG*hvu|BzTLa!128u3wA`79|S z%%Xg(hbVQf11*p?hD|(Ff^phRdJ7163EyXMp zbHWAo$+^-37;U{2J#*)u!A#gsm{OwiRr%^Eb&f3yqGHHOveXap| zRut7S^M$26W|uh1wrQ)U4X-ie7!VxvWb{VQve5>Qr>drT;akZ!k7L_ByFO!be?02h zBl^cU981ih^L+;Q@~k`^kRCUlU7}c^`(iR)nB49ld0J0sTrQnG zR7~EPMC<5^EhO?~K5FaZ48A{Jl5TUy)cM%+ctwS4qh4W`VVNz?v&De+VPsYwr-}PxP#&>}5$Oa(G8?lO8s@qi!O5+OiYhHS(+%;+ZZ(7~FBWy#nJ61L<=jz{$8q{)!o&1#m7>gSu>Pc# zsl`a7)$qGfL(V!9l|g65@;)isnNJk5cC06T_)SrPDqCeM@(7~vL?7vi?dM{!aGxC` zqI=jH8*Qy_8{FbRp%J@>AhU+YQv9$j)vD~+7oWWBL8gyhv$;EMU$p7)wHg=aIm!ej zVSs&%i$%wKn1*-nldT&lB_wBBVp8F`UW1pQ<=Q_$n5|5vhi+r!qxJk8)s5zO&TDG z5Fwg4CpYD_pHHNGWVT~OU$$X1_zmk@Gjg?(!NLi^y1#Eum8uil{3?t!bl zyfR$Ae3}r(tqUheCfptGZWgD|MMcNtYiKseBdDdLSNSP%L5%d8WVI2aIw;EWhKO7z_)j_wbu%gFp)BHDoaw{!)Be| zWWr^E2k>6b$Kt#5W4syD5t4<>$}zqmuCbm3wsOBuXH-Z8>TI%RL`OzQWb;Zbd{bOwR(v7s(Hai*zRqj6Boi zC|rw=PtgVZrlts+2341PE-rw?`!;k6zfB82? zYevTpvYQQal**48E|SKl-hwWY@U~K9Krl7O>1>KFi3dVeO4M>f<4#|?xohWtIS;(+ z#R0oGck`87ik!62q8#Sn;oPgqtKt7OmHxsK9CpX-AQ30s<_&85H}-Ezow%ED z_bOZ0&v8cAe00ipi3s#e)pVp|lhPd(&Nb#KHud2|*fkqyZ6LeR)e%zD14`WW+Ad{!pr7VlnynhVo^ltg)<~_olbH6X%J98- zMjz56u4eQ>-Aqyi8Kz@T5j#ou5ztq6nW%>DXEc^lv)UAuMj3ByeG)86iKS+0 z0XAUPTq8$xOI`jN;w2m^z&#}`^bfg(=70sz9WRN}q5eRZjAp zrhtL@;)1)WvaEG9$%;CT>q)D-xw)`R)wSsiO1&nPYRg%zL$x`ZB-}}(TP$qqwfZj1qXgkljc`1Byy&1cH*uFfOLm|nlxfT^# z7-)khf@6><+i$fOkPEL;xWp{h*RGbLL+4aJV2yT~wNUEo#hV|pFq~rT z7B1R4TIZOQn=tNNq@Iv*=3?B{m%E8N`bz?i(v`!E4_R(|Xh0?L83zghxLkxz5h5Wi z?ba1W6XWLhsy;)`6RBKpncFv(i4#)j6OX|U`CYOU;u%6x_8*p#G&oPeulX@v-n{*o z0zm$4=xE6!?PTL4S~teLfil_7 zhklEHw!p5fAMj8r&vwlO@E$gWC?t`%k*vNUt`D3?g zInEg8pAuZeRcERgV`Ea+0{y&xG7>rMQ4X!=JYWpsa=QKSMNGdxqhR)2<5kWX4o+Bd zM>$d9*z+2V+*Lm(EdRbwO^=wpgl!Z2_}LL$*&Ep50#rt=AeiMBjR(b=8SD>zsOBJV zW42;9?|CQ=0!8kQhP=O*Te~;(c;UCXxrCkA)m;sb#|6J@y-Hld4cx&m@aOm&{5O30 zn7DBR0>AaS3h&>dfi)^Mw3M8MuP_rUO`$~B!NHp&<`E4;!u4M+q^Q^5@Z}~ zMzkvl%M%8$l*?%#SLT(6D2L1_VBctPhci5!l~K~q+75xMD5{>l*(FaMn+X=e*5_WB zrDo1bVN-*p%M0q(GE`TB@p$x|rTq#2vdw#*pmrg6-iu9CxoT%ZKOBiyMFU*Mee`vt z@`=(&L}^XQpTfJ>y7lF_vpoPjH7UF|CjqGRgD=3d#6>|h;e$AD8PCc!TDa0!^uyE# zotF&nnw*oo0n+qp=GV?Vp1a2_{)NasS=+0)oJ0E85oXC5LP%nHx4s@^+*j;?Nmm7f z<`(RUaF0M%qTHXw{4UJ~FkQeATsSfChm_B9Xj4CO=00?}I^5QGBmTrrtd*=LS%C~N zWnJ1qzxK<@z_z`KCQ8*ySl>D|TSS${4?xSGj zXG?!m+UjHwB6VwPTRu+PVmG=|U8WUy13A&+T2z%!89}A0`Q(20U63j%%GV^koZ_xp zw_O@7<&9`{Li0X(;S+xZlUa&yvN5dM)*@v25WbTixYK+yr>KOEt0%}SJx=8hxcXU= zB4oP_Z0j*A02YGrsSuRHW^E&Ui0N5g)~`Y)UhWY{TxN9vBth*!Im*MSwaUmu_WZQo ze~7J+>H&B@FdYBhl)8yw`cf1T38+(mmv##Qkex@rq1fFVH)_hy3*;b#4+I0$vfwt` z2z=b^hpQcG#UeJ(1c=60SUiOWfx2;H2)%A@5W)06(7Tq9T}N^9geGO}^t$daU`HDvfK>L3?<8W*^Z)Sg4|}_IB=Qws2}O$ z9)?LV`UNiL8qm#5nD`2ta^`*=F%1IoVnlCKm_8=zr^PE4g+27T(~5QjSKK+)`cIE2R@G#yWr&P>M1pCZ+w~T)2 zY$>d-f8P<=aHcbsF*Ozja;d^Kie|&Ct(p-i=jd1vO=WuBb>gm5R2RBCFTx9?D-#26 zx`mzK#8!H((ZIW|d9SzI2gp{Y2ac*?y-+&2P|0w%;mS+uE|)@*p?~2-q+*@^wmb@#(ifegD{#f~gep<1vs^_)-N|;}YPlE=p?SZx zCD%wfa&u%5gX(sQYTtONs6xCONUYs}(SmBj!v9J{%XnnZ_maM! zS%veaJxKl@&2FsOU!`@3u|35XoWE-JoL2twu>IB0hCkz1qkYX$84d}B?|&dEC3|zE zE|boqMHba3gfqG}qnGyO4-}oe5$o@>+v-(Ejf#=AEg=QC6OeKpZF)}(uvuJ!Vr3Yw z06=cJYggMy4wh{OoDm#O)dOZW7OH!#DeGU)zg$rCj4A<{Qyk~1moQm9i+@tRw-k+& zSbKu+((lp)AWH}3#;jtYiNr=6eF0-7m5ni`VT>!VBti zyon%rO1{+Ehd1>ZlRf`H67Xz*(4J3=Bjcii?IHda<5&UFc({=xCPa8nFn9VhC0z%l zk4C6Btwpa0?kK?@d?E8^ln)E=uFIj+oFla$+$mstjDO=CmIH^*;O-^UtGluzC4h%1 z^8QoXcxN`e@s+v8%yVFBqw`8aGn>uuma?F1$H3-WIc7sMIo~_<4dt79rmwFu`t5}N z!Xco-NAY0NsvUt{t(x5|c=-ezrHw;d}_-av0JwP+Aq9(=3<^N}5>4kcnV}N~8eC zGFqT&iy+T;+IMie$2uRw*9=DbSaw5%LelSMfR<@L>5+g2s^VqZV_TB!zxIL4;p7sIu<-(}}C&4}GTBz}OoELqZ8V5VDKPz&2-7WFovt-i+27jiL_>3LJ(F zy1?<|cck5iPa7kRv!6n0L{x5MRBapL$6R4LQ#^6ZFi8r8r?}_-FO=BcD1dLz>#eaM zas9Cp&vj0$<+`Z^=g=yRkK9>5|U$U~t_-fvN!v~NFY^c~EmKLxb70;H&^`X{=r!x(>goe(9> z>xcolpULv0?YyD#yt&nPXMs?L|4|Uh=VzopH|1J0{~|=o{v3KYo6p3c%XL>+`_U5j zUTJ|zHwT)0kMn3rLh~SA2EKE^MOX*iB=5N70dW&~shu}#c4O9>WAJ(GQhiEl>fud( zGkfz(j>dO5wlm1ydq=`g57_gGvB4?CJh6yXT*3|9X>lN*GJFpWQWpjfM)(+w@by1M z=1veR_~6!rC+d?Mj)@a=TCDE+EtGLRm(&Z26|Cbr-W!Xw?)cIQk5ySRqe1b?gT>+M z5H$`dQlv;X1@4)g7#(z`lcIwTI_Sv5(4cd4Bzxvd`1r2Uh`ccPnWILL*R05V=FCREbQ9a?c=Cz5 z!H2NOV3oLp8@OX=55=Z4V=0tR=4FLCzm0iB$iD(glvrVf)muY~*-+0B3u||X7@DH3 z?k?@1vOaE)RFDUfGL2zz$s6U1mCf@bV^&ohjp1LDZ~Vx!vG}x^ zn{j4s5M{j1$hh@aWWCs^5}qXnnP8K%)PK}wM4raqQuUDq-UJm_<1H6!T$DPVMm$5N zCWSFu`+p@*m0}H&zV#FFu2^Of9+W|Kb0R8SK~0Pvy9rDg;&v2sqaD}4b}`GvkBx#w zoDsjz+wGreAhR_sJHpD!3MGmRsXR>nPCA=+;xS{)Z}FT_PTPiQNKg9VQ0ySxe70@W zL5DvhN|>>(a2_$7^SIRMLdhB9)xlqt4E7s4O;&{k~4OLjc5ah4p zILx*!Rw!S#z4awrpob3Z&#r|Vj>yG&wixU*&cy7x#gnEQ3tqD@xNt(V>t4V)&(pdv z=G7XuieVoc?>y32j5Ughe;>ChuF@>#bPmY&rxoFY&Xly-El6wV+vlBpv64klq+c{@ zMYWr>&UWc2wfB|l^1xN4g*COd*w^1;eUxt6Y2Um}Lp@pqGByc#MtNYuL0I{7-X4*Qoj!B(saHa(Sn%TmUnG2Etm zQ=w418VVw4i^mCWQdA#~Z6fuRQC~#LKLwwEhKB9eZ?SNc=eG^{nK73m)-jGFvSN-} zD+N50Rw0k8TIP)$#AM<(qx|kyCsv;!t7Fol#_?jMCYhBvDt%NVN?7EmLg7s&D}|pRgo@_NlD%X7}W8-i*s!r{vDG`VFg2 z?6H0_XQw7;`%r*0Yj3YJdnP2BACjtpEvYg*Z%|8o{U3 zvj2!-dk%4DSb7-vCOI?^nb?`mM;Vgl+ft|B%7Rth2DsHSJ=`=N>yTuZj0|esNwXkaH`Y}7DVt1$Z3+}1gEoT8+?igwU<34gt zjV>W(ILVZ?2-(`?q@}~kw)J)VsaOj!u!+EOD5S`VkmW1eIu)&UoJTS;vXFXucGQ(^ z0Q@-&7X5u&T135J&>sTP{rDxT{(QJh8Qxog$i+{BJJL$5zZ2Ps)_@TX z^#}jMe}%~%G*=Ai12y(d9VIC|>aKm1RaHX}oTb+L#>9c&GDvz!PSAh1X$?Qdh^txu zQg$`jY~O*l=V067^1U4$ncg50hj_5cE2ISFXV@^(pKz4>jVHV;jYxS1_vKOiq1X?E zHSx!&gI?-h_0}-TX@k8{G=^2tr`vvL^8hm^9HtRmgtR8?7c%re`pC^bkXH* zT0SpHPZp-0)ZamoV{ci*=Csqi$jfYT=ihVQEq@=4rG+2-zA%6Ibguf8a73;q+YR_s zaf)lV9dPRS18UT$+Zx~*U3AgqZd`e-^|iUiEmkfz{iHef=ihw;URsr~+MRvHDmJ<5 zdtS220q6N2e7&#c)8g0BsDb*0-zDgUcF7Ep?2SF^Q9NF-u~VIYxka|Z=+`lj>AKrl zKDY%~eGq6?4>FDZmvcSxrH({pZx8WyY2$IC?;dUdr5G7PkHoR;9?E?~WRY>loN_iD ze}(ht8U@|5?hhvm4nbF?*N! z``>Q*TL*Ne?wDw;&ozq5YraH`XD64);G1$+^8r@(6=E51VmDt~4qSENdl!0v)Kc>0 zI6As?T2pW7Bkqg2{>p5G@*G zZd#NucLWn#{C7oUFdoiaqqsg23Nse=#yQ*XAYi^IPN>y+hzxDB!^$BlDJNoTI)Uye zKtMo1Kq5(y#T8Z0AF1k&h@<9>PNb~mQyzVQ?0Hn^rEi))@;Y%!=@NLvExWUZkU9xlNy7vOBm>Wl?cQvw$FvAC0-PGIQXnbkW)%)?-~;ZIJ!F8Xnv)JG&YA_avKJ zI1159PKZ2d%TLW^e`ww{xfNct{W;d{KEWKNU%>eqZ@J0y1Qc7bBG1gJ^7al*DWl2yTgxJZ6_UD)987Vy+IL&Jn8_ z=JE)JbQ7~AE;skB4i#`ZK6~}KKF;IbIOsaJ_G1E~+L;_;YeNm^pBRZtfaL~p2ftV% z)xaL2U0$!qh)pIjpY^^s&3>Av&2rj_WENhf%<$?nzqg>JMldqzDZeR?bvJfvUB-lQ3?Ve$?e3-Fn2vcZr2>t?xa2?0^Yu2Jh8B5Z|6`yo>bXwNPS zS*YwB=6_F%>d2i$K||7>vXjuVya53MUTs^@S_sUN@XuNuI?Dnhne3rYA{wspKdAj_ z@&n4?%FKV?NOd;-Pv~zYl@B3t1;Nhe(H!=?GE5z-pi-%G?piX6U7Ak;3w zK6Bz$X@S!pS5I8EdyUyYwYl7o&l^qnjE8Ax3S9K%qmnpZKt07e7EKriplVaYsZp`^ zW6!^^=N_sll}^n^eYd`_89fTyaIr@qq7n5aw6$%#(lZ2}!Rl11#}KsMGM?96u`n`= z&Q~Kz58sEHn|`IS3ftv-Dj=oXv2lC*^oA)L6cGEl=2rR9n%v=>jJwQF`$=Cw6+Yb? zm|g3J>6AESItU#Dm7$)Z_+{P|SF1?aoDEf#L4JncD9j1Z21MfFA1F6N7#Sx`+7qap z%cGI$2Ae2>0S>AVRF4S~#ru#)kaeog1xS}ll9G1BJg~FA&QBSls*x+AZ!9{pm(rfp z1ns=va(6xiF!YuN#MYc3$xUO3@f5b-*XV*YwW{&7;nSBqB$pjK-?$XNFs&QiQEuB|n?y`>O$$SLPNK#V z7Ptc>6Ex631I?FDlWj)5?4j?VW^b4>IB?*C z)_t?_qRu_57;uwpC%{~wqapXX%(hcnWeA;eNsx%B{`LaKfeZd`^L&C1&7h5IgX0x*jlKz~Rmy zpn-YEh1yE+m`DE@8!$yv26%{oPb6&|rY$cyK;3^gif#bTkid@YT_bjGPpx_-OYs1_ znNRcWnQyTpq%R58##?i|0MB$8UW2J-J35^oakPD1k~EB^*`q8U;Wx2z^ z?5a#%V{b(~6}S-Y4a`T@sUAlvRI(d^e_p6+nI+@CRAJH+0%Jp6(eLTl9EjjlWuPyp z2lQ-#U4x=M456IYxx{0pw-~UGdMaEdX0ngP_Q;NHa?Q1tGa!90$|%wKw3t`jXP&cS z>WE0=SV{zEMlS$E*Ort!2YnISK;&6>Ln3;>%pK358s^6A%u4_{ogSz@{&EjGV+M(l zOKcN8lO0AFw*Bv!(46ObFG7+Z7p9zcDSants<-<2RMB-FQV0mP4;R{!Vu(;ApH#So zr6AYROqDF%IgD_Kj=R>^p9%SzdG4w1(Lx@+bp557JQT47+M)l4k59591ih-5ZBlQc zZRfh%GQ=BW6HTX|kuxm+k&3#P^M;yyAMwGj|O z+j)wL4BR%He|Mer;IH*{;Jxf&fXF65D6;z)wx~^}H(F0Dt!ZZ@Cu=!$?UuEz!?c7~ z>;iE!D_&!rxim8K!om5yB%T7C@K4Fw!Xu}JTlHMvHLkPPsaI@viVZspuCUSUZwNdj z^@>;>f+oJ8l9QH%Ft|IE`Iaxd1#fXh6-Wiy-FLyMf@TU!8#KzF}f zfQNdB8S7f2K)J?XM_u{w9%iKs>Pn6+H7M1DR5YZfNeYRfjLh9YtbbZg-DkU-n4%xq z0MW65DuSew=mVe6JwQM}K)_(umLFa0i8}Eyjht8$eF+vS3-|N&C-&w^~#$#p7tp7-g`-EdXeHoXkTqRi^ zG4YMt36=)eQ7`Du_v$G{qqo?Aj1B?+CmMH52_s6AgOjK=`1E*qjbv@W`(V^2j`?$= zs{&W|#2aoMCDL3z_#deu-tQ@2D0cenu?6rsTpahXD$;$dDC*f$tC2m)X(D$+|7~nR zLi@bH=||rIqR+Vj!g)HWYC1!EY9-p=jq&TXpdc)Ecxe+4hYRD}gKn!q_k5b)U>+L< z@;pUjY`=SR!x;)w!Kq8}x}H~akgN|)Ck61_v9XhVWc#|o0Daog9gmwfrrZIqjVKZ^ z0PO!7s&1XyLgHI8)Wonl>{#|py}6EG&XpC6UpOuFF-63LbH6pr9#;03%~0FmQ|9u| zU$kxF?|MWVlN8bpUDGOVl@0ziW>9C9i3!+YWM$?R;PLwkV-hoCVJ(w=+DQ-WuzJeF zGFgK3xy8wcaj-D0#Qx+j-R^LP87os{KlAD+8UY|r#5nY*1x+OnZnlSfbF!(c#s>xW z#;K@ef7|C;Bt2ljfC0?S?>JBI&TIoT8kahj0Hv-JtCOu$_K*vtZhZ zr|w^eQCPc4gl)}-GI*74o86qUjlFm>%_XCZz;A{LRB57S(7-noe4A3$OhJGEAqq|d z$PYbv@8$e7k=KcHxG;vdlntXnFd6gCv^ACxrCR;#x(bZF=;@$d`JQN$4sV$+V#UG6 zydi>NT$wVEQ{13At+?2jtIG+InUho%wU)Z3?ZMh=+O0+;IP){r?a zHF-(d#57$N<8d=NNf4dn=qKzb)Ye+tz>P|nYG|?Fn*tkUc-2s8fi#V;FkhLO!U>(; z!rf=#kA^Ik-smX|%ABV`1$?L82D2fPMxQ50HhcM?WYnjBoxAhT*wAVhuluZf)fe}( z)~Ac%Imcj^<_)brPcrZY@pq`NUm-O^nW88|9x3je3NZb3J%sO2p{mpeHlWN{85E1A z>hYF4PrnQG6kutBm}uZZzE7v>@QKpcTmFi13~YA%RL1crb^~V z-(0hcSh0Dq;>)K&k1A6}mu1CBLY)QmoDBPSRjFY@2912ehu5Xo)pzS}C_AgJYj2=O z%GCp8roP189NH|to^hSC>-Q{Im z6*xjM`%EUUIrZzHz|8OLqNT`LHM)R65I>|wn~^mVqLC$+uv|B`KQz;GOVhb zsmmj0_@#H%co|Sv0x?6{jM#hVlr&nOBo~M7wr*qMkDDi&x_gkx`b_<4Qfq{m8dVgV zOV6qi(Df>$)6f_jiA``7Ir;Bj;KN4I1mfCJyi9#%VVfJAKB}|uubg)UH(zs*M0y*! z<^KT-CZ3BwfVsp*FL$_C_KMHF(30pFGoQ~$cngTM5hB!|Uuz?nddcJlz_>|xnj(#Z z0V6Y31gK^7B;@ z#rD=;4DcE)#wBdnuwlc7U8S^u)E%WmL>D*LH>wLw?uxWa04TGk*uV{2d?X7#Bb(=wm+*}nrc8cKJA zJ0O|Qrg9-{%sdUO{B*#HdCmp)i)GwJ7gq~~6|xIQNduN30000000F6@wX+tAemIYA zZFb!O%8P-thak>RT~PjugDQFyG}9GbT;Hcw@5}*&eNU9r)_B`qnOsa(b9bM1&>kZNC$0aI81X*x| z)}5KbGXC8!sQU52?D82?y^OL+LC^-Mox@9Iney>5?#_BfA=8o%0;^cV=4y5q7f$H) z@x+AjfmcIAsPUx_w!Lz;am2ZFvJG7GooOujCNpf~ek@;v7zzVHb?GwuhqsbLc?nq( zblt@Y3?%*m{NGHZ*<;XbF8=$%_u%&n*dN9YWy`D}`ZPAZJ0Y;5w9mjBoaZ>Nk|GDu zr^pB*aXZqX6ib1)o4|+pt)W*;(-?K1SUXIa_9F3Zd>4O&@8cqV_&yQ;a;NS>8*Q}F zM!Vc+oVx2OjbUJ+U5baQPTMF@pg2Oj`_8HkjdoAku7|<`Bu)9zAP47h9i_y(cTsLp(L|pOYEoQ=GQ6%{qE%+s=Mm zh!4*HZnH|{z)&@rz}OP@AB=|TN@wLOBxQvC{km6(Vhl3omfiZq^maYgE(y8Q=CJQJ zT4v#%KuetwB_9gK zjv_X%lQ74)9Z-MFXuUC90*HMa^@Lewl287Iz6ktXHuF)Ah1;h9Okdv)IP-wcI6Y#a zy(XUr<8olH77invfwIG$!S1nafX)9O7{oKwLn!SwLGN+^A;m&g#pR{ElV>>(clz1U z^_UA`on-V|BhU$Tj~Ey{h73wsQ*N59@F0y^f1^zu(E;XNb5>(jYfDvaFA+4*KqK?_%bM1#?;g%t+0sFj zqo%*DOO{zXZ@ayAI|id-`p;z?imHP9ki>l0ebJHQjGGIETPH2h z`l~IS_)c$kChP64JI2Oa$%M+db$C&gD3un72# zw5hF$_9qcSf|LmzklM&IS;M#+D*Zxrr3Z0sSdQw?k^<{v;qMQ%$ZBK9tU?KfG`xy_9!4mm_}`cQS15W zROnd^L)e!Vl#;rWw;#%<(er7p;t$sz(8O^?AUz5v?wOZ?DNzN-d9hP;TX_Q~khZTc z0UlK#SgZn`aO5BrLQ^bQpx}@UflU*$6MX)pm)k?1!B?Z=PWv^V9KG7U&PBOH_gvb= ziU1ONe70_ig1zo5LoP2oL_^6u>qs+rbM%VJW$;K_Gd{rYYqqq2ngt#yJCmW zEzRM?N?ZG4H_E+l3NU|vv?_G3u3}kY02)d6xqo^VPkr@Yj{^&Y9(w4Zhu$+Wpgrmz zLL^O_yNJ7*OQ{$X5f{s~HNP*-yiUwvx)Jb-3ym&4xxxk)76y)?`V*?-Se(L&PA51I z)&jyM3J+^+hr>t{6GJ1MhjxGUES%)kH_R9QQ@|BCR*GT7s2C!l(%6WLWb=f?>?HCF z?{aAxJA2=#@+DF-UC*p>>gA+U`7*yW`fFko>|dl3!^L^SK2W*TyTzZrhACd0*XyFT zCoY zL|$z+?%)}797LP--q&r)RV$`8jxV`};6Fbj#8?%*sm9)9!xJZRgNvUCOLqX^bpQY| zlPX*QXe-xG52WrK&8+EUtP293IIPzNN|sdWayTYAjog85 zYL!9qxoF}rc{9}zHh7FX=tOS_Vpzk11q+sX;(~yHFmbM7ZL!VfuE8M|1Oz0Kbl0Qd z#Q)2{rThBJR)tYrk$+vF|0!X(+)AmQR_G{ZdyxbeUMRIA4&LO4#T_Wp{D(r zC00l1E_@8y_Vmqx(FWsMotNB-NT7V^i~2}MJ91Ebb-W5kQ_J&hrqI^422|a#S3P#8 zo`x0r83CiFA3O+7oY$fdUgWi;zt({SEmK{l!a}L>xE`1{!}K+=VbW7RA-%bhzBzH| zO_DcCfI|%voWG5rPJAO#;03M6mGBsF;J|@@Hg-&6aaC4o(X_#sX)^(ZPjA-r5Lj&# zJ`ElPXx`Y9v-s61C8dyXGr2UQ=M^pSdYQ3))qdR@Z$aLem68 zVt|3(h(Xx3+#%~urmiV$FPl-tS%z+xLlwwfb0S-f_xjQ^-VM2IY8nogUpRr9Ji|(b*ocK#{Z@_M ze#ugQe_OIrauGp|78jSr7=A8`B_7^<#Ss=uR-y$oLtlw(0{{R30E8qVIg-_-$|NQ8 zsp#RpcGAfc`*?KvF&k{iaPieDz|4`D#LZERJUub2KmDhEoa zpXCCUb5Z8SRZkNDzND}4B8m)3J53BWPPKmGFhM{k?}ZCc=4M`dwS*fmy;pm!IwNcA zEiBe-uyG2jN|yR!t@Z5Pb-ReCbBj(bDYY-PO?quPk!GSR+K6Ca<13i>Vi?U1ZikF= z*vAMthzt~__C(5t7>n=VK**8DNnZNU1r(e>+#l-$0 zD2HB3nlF9zMa~MU*gJ2n&?eE|kXOJ^=4-bq-}cv+F>}FP49{Mc$a{HR&dwF{YA=Rr z_#-x=F}D@l9xiY#idn29AIZAk_V9-{S|OqeuqTG!;tp!tng(6-1Sl`|A-^ zRalV)1}J1K1vV(+szuzjh`;6z;CiO#xDvgzHw#t?8&bJFy+d-(5!p*sVhf*X0|5Jn zugp5bJ(QgWBl9n~#KxN`s1Eriai<;tMgKV1D%%sdxL#5iivc0pIi(D;lGw=y2bd#Q z6I~ELg7DFDbhvYX6MZ{jGoE zbH^}#Fffd)eOx>V7xpt^wu+@{cM5lkoUcq6)(`Rvp^=jdsP9%3G4oS6no z>ECgVYiXv{wFy4~8N0p5XV_pjvG0xMq-5lhyv?CrO=^yOQwiKtZ?T01-|jiM_Y|49 z^K#2*C`rb6oZJ}%r>I*@X*CDX!_t#Rs@qWu(v7{5UOpOp8+o&6;SG$PPjsVO2j>9~ zkNS0ZE>k3$GXrw1d&|Ae{xrN;0ra$4+7H%hJJjNe$|V4uSxawgC3HB2>K*(nOT0_4 z(FF>KlS`61lqp()wD}h990pk^hj5ev5J6bsx7r)}7AQPAh4j%6BameYQCpstF;mf* zbV+%k-Ax^@T)@!VauJT+F%entOgg;_0%CI(?JhR)8i`qc77N*OB>=d!|^9 zBCs^kw-`0iQUYI&y)POUPhP3VbHG{(yvwuV@`6rU*zPBHWQVg#{_c@%qujlqv&MFg zt`n!uFk_*pIz@Yt$7Bjf7nhnz*@|L02c20;Xl@p8!I={-;=*Gt3A0m9Str2G)%NBt z%o!Cg{iGS&R<}@?Py4Ky2-jQ%bDm9Zl_NJ^ShPap>ry*QZrH*$7kJ&dx46J-$+Dd# z%#W^=+vi>^hnGvM$iRCVLr?YXqOWW4g?b@Q*f9z?L&F^Qg$x9F#0m~o+B~0x1DVtc zrwl7X_Bag5h`Ml`mar(xll?NwNBf&$C1d919?aJZ+8qk!P2ZK*TCu_icqQ*if74ME z9+{-7v+p3b(`?VH;5FT$E)X;bB9Sde#;>FV14~V zJL^k-NFZ3qbP%sbPRpp}9fiN%&i$nsC$|BUAEYcALvknEaWQ)fUfdPOxq(XB%d6*f z5NGQ*aVmGL9#@=0a#XdWD2~2SZNEsoqd)Fc7}ez9^AoUhz|5Ud!PdKfNf6s%m-rK$ z(;<`%8!NO@gkzEsPSqOWCOR>xg>4nss?)%kV6hR|c}somB+1u7&RwDE{^7r?%M3=3DeWIF)Zt}CY87&=HyBu-AgkV*(g2hTmpRB+ z`v!^dO;Z`3jNc}n;Tn+clZjLKW z+5|6zx=2%@xkoHt*77K+av8Rz0Bta5z}#q%b|Dw#L<(tri@Fqhiu)*cT_%ry+X~7@ zIyBr&T}=ff1bPestntFY%js@VHKS+CfLtBbgS&)E_pn)hdYUK^XZpuRgwr_6R@ThZ{pe}Z9}ufZ8*ui3H_a1$99O6i>w>&d+=1FP^!naX zIXz4+`)IL$^jPCUGsAO4%Vf)S>u83oCln zirnIcz9WqUp*_&3GyyO<>W#j#MisNVNN<=svaesZV}8~wHXhw86C{XCXy6LRr9&tp zQ__fylD6gS+*b_bSH@;CRy+h*j|+4zva-jA%5xMYj^`he|0!wJbC@sHKQg~EyNDJA z*B_F$OH-ooHdoD(`A0?ITdUuQ{0LrB_+SZ{U8^|6(b=o*xJAMA0JPRAfl%lq5dvOdM>| zzqMs1gOk3?-3CcouP$4I!hu$$RkWhzR;bpakz(p0;B$^hxxq!3x2{q%#(9@ZTy^=5 zYXf{>=K2x2^Y=sJvv@LJ`-EZXlB`s4f!9(+ZkVk}Co4{?XJ_=yD!j%kAQKIs7(NPV zYcH>Av=I;=YQE-8)%>6Zn&S#|D@9JW30LcSAsGLuW|`bbAv($2x68d!J(?sZZ_NS^ z5FkK+z^Kk1G-%MEGc>tHhI?CWCR_+rdVYu?f(W9Fy~>|_z|9C;Wy{1gTp=?ZkCR6Mxs0o@_Iiae`K?sBcj%mA%D*@D^ZJm80)#f8bf}S zC0nz}{`U2&@2^_a3IfP^&5a8#CyyOz?uSAfKe9TJ2*1o_U;u;*W-H4L8S7Uu@S{Yt z7|DP^VOmg^eP$FON6)LQ3PO(BfLHU3RG3+vi+6RXu{eZKeasa#JcxIu9Lv$0xOo*= zLM$X!Ct?0gLWB60B+R&M0hpmB6F*vJh5wy{_82JP$75?#__RD1<=@;=Z z#a45~E^JL^G)#juSY4vvLFD%cvL!>8q?g+9zbC<2z5^WrYwVJlYh5UR)u#q;PYPuk zRkEKy%yKrf!BD$mxX__saTA5sequve{T`>6{;PsrT~2RH*dN&i5=bC{1R6BbF6Tn#1)5X^H7WQ#;$?S^@4Ukw5NEvO_SQ({ zK9zT<+XIgdvsETCc1Et?B9eH{p^bJWBzy%ub zx;~wD$YZj%<|?H?!KjQ8=aK)aeBB7RIU;P(rk|ql@Hr4qtqrfhB!@aH+;ajKoxn`T ze?(s%GiS8N`E~s+7O18DvZ!@5=O)TQ!^D>)9@eTX@g9KqPOp3dO9*YrFrd5%y(Tt&0e#(?k(#*u=Zx3=}9RP@q780;QbIPQ%mOLXK?L3T?5AKwBe- zKH<`NS(y8Z>C-S|b-FUx5a9>C$PienCWi$$O3@y*E{YVG-_mE@$Vq zqb}Vqx$|zuPqgfN@yV-hyEmk=hpI4fWs4?%L5rD7NxF%Mg zUnJ5BkH2<@2$#q7Jz{{~UqKAfKO+bA*UFiros~M$Xi&2kHp;%plO6jk!R+T)IMc|Q zjO4k&c9`96cw5<54Ru5wGyyMaX_?o{)hOKY4Hm*;NFjw3(&vw4fmDU{f($aq8rfu^ zpv6q)slf^i3Am_`><$kyYH24!#X5Sdo<=w;5@<3p1dv zCSe7us)ib=gbd{$eK5|(VT(9SHqg(yCo8o1;=ff5^i&s}f&TRX24n!mb5J|u9O%iu z$S&L155w7T%kb1UXb26qy!`4_gE#O#YNSeb8SQbAs;_snz93#~IP-)xx=7mDg-Lcn zDY+Pw8zWnPB4mazsp(L!6Jm;WsrptG)$0U(;m$`G3Q8=Kc1 zy@ItiI+4nFLO;@&WQ#segLw~QH5M3W#>v(>L_g~eo4^b94m)Rp?FXe=+Zq%t817?V z9O$5Pj|tr2uIbvj6~aA404UU1;6!>E#|E&mq2cN^xVzkpn{0XBknsQ>02kbhdti*9 z`3QlldVQO_Zp?W{)6Pv6#iAPQ&D^xNih5b=UT}G{Ei}?aYk=qAJW0&g4eY{Nf$3^u z>3O|_#K!emxxO9nbT~|1hYhp2<8>_C=Kb!e)8KvS+2@_N z$#JQBkYP+O-sP&W@BMjlgHVHRj^#s5&6MHmLDmU^iWYX?*N`Lh9@+)BQ#+X~x3!O5 z+sRMly}WkM-QLu0Tk}p7&pp?I+8C7-lRAM<25DYU_8r25Ye%A`Ib=SIcX048H!Y^& zTi44+0V-2e$z}G`IV<^=1vFjr_$oJF+tfbGu`1jY1n+Yc1^+LlERXd^ZpTL%zlR4A zq`BD3?Hy&o zfaeL)>DI`RP!D_0zRrPd1C2FQ9}>#?)ftu*UFwZ7&47X#=;BpIW)o^+yO~3n2;8;R z(hA6_66rTJ+v45{mU>tJ^ipimemh~3S*PaPvvx@_(EU)RLH6c$2Q-7&thmga{cWZZ zTveI+hRSN$rL@+I0vx@?L*AcRV=17VV!qTeh-r1Z?XKXJ5r0l&<>zWLb)M{;B-hO+ zTLtGhh>hj+i5c@=hbY66|;@zcytAY)%XQ* z2VWgCM{UvnJ@Sk zBA{R$7?PVP%al*W-s`mFf5`cX(+fFwHNz^1^*S;1Rdk#>^S0S7bPa zJ1utH23HUSH$G@C$_5|i>>UKine(Vqqd zd}-AGSevl(aj$DBob>&>!@9=J8+bgGeip<}Tfehw5Ts-Z1 z)_NpUr47VP^Av_c%s*fA=;PRq8Z0f?+%ch#fQd_hU%X?X!$LC%*ZV07f7-4pOgkRa(mGg`ZDqvSQ_41B9}^LHTNKJf{D6Sgk^0Duf!t=QM0x)D5Jf(%^oLB1k{SYudq zfWS{!x{FoXT&^WR8j(zOb-h8{ zeg>Hj`+B~J%0o-TOr3ve`F=L?FUGYeBDn;h0+|F9d$-^oS|)ePyAXOWkC0bVq%o%M zw19ws1Y_Mo2~Jp3i=CqhkcTAbaBo|nUSXOk>Y1QdT@D;)-W~fbC{Un4RXW!&mVGld z^7`Y4pCiRU-4|91+Y6(?-?l^kp0$~jt(o7e8AYv&!WRl%Y0sg%>aUijxyIYDC}Nb! zZZcW!Inws0TLw&1Yh*xG62F9Xtt5-Wv}H=^5Je|bVe=0-3xh*WB&B>uGs4UufG_Zo z^Dw9{Q#@4>qB=+el0=yYIGQDO0aMl&-d`!nw3-TS7Bn4#e>h#{{vifqD>FXbN{$3k zf8~nH=NSK($k)1{ST4%*=#0OYIi{R-=M0Jk<}xq&4VgHFgte-n7&7q-j!cpoIsEg! zx{v{hl~RIoyXewY9iHSaMnOkM&6=xdIs34BRrTs-DP^G+3kwT-(1+m3WfRc=BkK*d zM*uh@`BDe<8`0km(x>+gT|C`Jjr1PkczbmLeExg$Y}(tL-C^9e5v#EgzYJV_75+! zxdp3U#*lJ+mk_oW7E3+KcOI5iU~F)n029$3lu6iTR6DG7Kt=0SCZj| zf$5BG&>?7ydT3U?!w74yV$^Y(($A;DHpIAl)JQeen`GIugXaxdSY`-2`?x25S!3Op zV+y60B6SQoQVX&MeQu$(L>01t|3XD33ZaLSjqO$yLu;JH>PC_9wm@y{;Ss96=MgkJ ziuFCZh$k8a0!y~^PQ_YWPa7ASEN{2xZV$%V8mZ%UbpkwPt0MC$@#RNMBSH-APz}xK z!Hf19V++5fM>LfTH^FA;8ZkT1aI3zspjoUUR!dsw!iysr*s2roMSW5H-fl`8^=x~6 zq{MG^C2T3r-dl7qFio%xkXX3TMv1R(sMdKDE>sPPhIXf?=9phjcIXls!D**a1-ZN3;V`5i3o zY#JeKFUa_*u(o~-yqUz_rRIsb_?@$Mh`8=nQk-0(Pd;sQpT?!@t3Qv$Hnv$ZSdSFh zS9it*p?OqxHuRTp$?(=MI`SBEGjGgTIqPw8)IBGKZP)Tt>m}wBJ?O5LDDVEE6Rl?c zO$h93izPF35sIbXk{aP|>+mk~WPxv4^$t4LR0-Z1KvdWgg}7Ot(dfsGnM!KY-J521 z7Hl&MtNjpIYjq6PaS^+X7(*QcNnv}xHeI5M(|3#szZWVB7;ZcIuhR9Q$@|a)tqj^u z?+vGw*3vaLS_9wxaOX{S_Bo-LY~hNytRi^53*l;+aVo_s!Gvc|O#Y;+M&-TiF!gw`4fWXM*PVYnir!=Vb(U}8(V7wsM;$}7 zsP?_$>E$9jiD?&Z*8l{=XozSDzv?}4d;Ty?rbif*mp>cN6qz>5q)|9Tj<)Bt)XBSJ z&vkvUh4jd0+REScHeD+~YN(};mlk02&a@M_q=j&%X09?k29q*r35TC0jy zy!O7H*pA5%S44Fdjk}rVKAEts%&;cUroE`R>4@i7AeBJ19l+01q2ywgjbM9>D9hnQ zyMOkjip@S^atd>#_NYzmY)000r3lF(tv?f5!d8tB<#{L#m-@Tt-F0CNPO?x-P=)R$ z$~7%-6e>~xtr#CIY-n~1Ku;cQ2koh)laZ&7l8xY(uj&ix7QkbF#A@~Eps!QYl+j!A z+$SJ))Hf}$=tqdn9T^z zYmB5Pfe=NZs?5p~!<~F{V`)%fvUNBC&VjJC?!Xq78Q8XKOWX!hld|L+VvC_PJ>4O6|s=> zjv_lOB}Ak6ZqP3>)azO&){1QHPo$6Vf%MX%4oK04gsf+~Xc22O*s+b1V4*@sh7deh z%IaWcav6gExYwchg^@qRsP=-n|naLHfwFvt1hCV_OoNatCM3%5m zG0Ur%wkjp7h}%02Ll)60Z^C8}zwGXpq`9+(CV9RnN^s z3^ulJO1B1W;8OG-o+TmhZj$+G_qPrz6 zof~#B?GLG&Dxqh%xgBCV!4?_A+BppEKw>*0Q#ILA zN8Hc!GUvi@azcCqvm&jT&~2dfMk{U^y|A+eCn^}|L^377Xn9i^&d`vFHZ#g)V&LiiBnswM5#3Dxa}HV2Tq?BWuRoK9brpf(Dd$#Ogv*g zyXwzgFS!|NVs$A(pkewgsqcyHgfwN`lPey9I!Z&m3&vz`pVyI50TzDN_N|2+28av^ zn=4?K&pCDP$t-f1?x8!iUyR8e(3gOdURo&dZkpy(0lR3K!|Rk4;djiUI?eu-7ujm9 z2#>kcHM!9Wv*(sEu%)s8K9?iwTp9A}ht(Bgat%oTStBKd@D@dI&g+7A8S{jS(lwDw$Q;k1?N^E#+J7mh^v7&r&+BU<92M?+6V2dHv z`4Kdqy-wIGwQw-w1;<+se!8yWTEuGov3ftbc1G5Qu85lNQ%uJFmB9{dckARw(N)CsiIIit zwUg*dqQ!6#j<5-&z3>y zu!$+iu9d>PMsrGw(fub!?0ZpF^U#)$onP>{_R5EP^ea+~$#r0ckq-5f426<++=_E0 zMxa{e%so7>W)B`%ej1UR z<-)yS>bA2Mwzcv~TNm%o8&jopZY(jRu0#k_iNER*-7wE}t4)s=Dvd8Grcxf~&bg+|DPrsqm2WzWIQ%3@tDUJ%sKa4kyNvz12@Q(3j*1tR(Yn%YAFX?m+T$lzq_-$3 zCNn~_P>jsP^23C0gDsJ2EtV-y2z0@1JFb=wz9Csnt%sVAH7%ukrxRM&?uC?I#!mZqCqAaQTWH+;GTHv+LV(uqs0d&_3z-OZ4=$s8@%Y#bCq6sv$$7ASulof2TXwv{8^&nw zL$OU;8Z`LHAy5{7iq-m;%5l@Lf3NIBl(Y-?!UaB>rl%hDUDMo+t@zd1lx08JF74`C z*d6sp|ELy5;Jc2ttb2GRtD=H1q0jb;YwVu$^h9>kQIu z$W{Oz!lyTVr?#VXysizpzC!bB&$&Pw1M?|K7Wd9FN7&gzdR4Ie%*fLvgvu4m+2b9G!c$^z z1vyQQu*J$PX%P4ltgq9N^lB6Q4cBYm+-0qszKjxmbMtZkt}5g~o!h9KqZQ1?my~A` zbi=N;)sVCYB)Qz9kLbuD9S{4MO0Sh#tF^2kT?lpVnSoj*7QvVqMP_SEr8shH%m};? z0ixD0&{W|Qp4;l)=rQZrphaX>XDE)3wQ;>STw_|XPgpuJgllma|NCcJ!m&2fY{QIM zAb|BDC#HnU%#}>Cn)+D<)OQS-QDqe>QbNi0Im_==Zep|6idv+x22*d*p}OGgqWofm zRhfh zY3fvYhs-h0MCGbmh7LKiojWP_R6Nk3-AtPeLwopsGkw=I2k2t4ST(D~#>3-1Oc0Ia z3m~c_uB)i!4r30<2`Xl@YFK1m^JHV-)TRLm*^ARhr{)L(>v$eNChz;Yt z;l4T?KqQtJZw+*Gukmz{g7ng#G@8=U(>EPr>#UV1J~)RBP3Q*(Mnwm#Z!89@2sb6q zIb*(-3QK|6o!jnc{;=CJce1pW3(qSC&tVx(7%K)WpQtNRcbc%`QJGio{K(SR9u!B?3H}n3Pcx8)AJ&%n#u~= z!+2$2Ef*eKfDd2TuB%FZ2RImYz0V$qH+C)R5_G^3*P^VaEB@FPrFn(hYC1i2N)CJ5 zz3Kb}r$ZYC_!`^#w6fvYe|bDecm`)5So@-8U5F50 z<8>&nt=zE#wRv8dH_)NEyY33emFZ}j-E*5T|YOz-9X;&)H)xQgP$A%W$~wNwfU)4ZtLAE z+K{nXjhlHSJcz>PvDgMGTK9|fTC3zf?TKr4DMFyC{lne=hlrd#aI#oVrr$w!>5vXL z=Wy>G{c(4nI^8zS<~7kkyPFGg#4t+~BF)jdh3wY`Q@-LXALoS%yD#t&e1N=8ay*UGB+CE0mIN9Sb&W!!#jvAi%PZ-JQTMHOMu`c zoLZ7M_pPGdE!y`SYeF+mZ-v5pLM+gLqwtGB z5#a=^f$(;IqxI2G;(#-T^H`vRJDH*(Vqq>Z6w^Pq>Lz3OlZc!Y5ZShZqsKF8HiSI1Ta!P32CpOV7sE< zqn4;He`Al9&QbK&FNU7xtJV@#V01u6kfbGtrVr}1e zS@KS_Q$#C-qa4n3cz0Z?+Pp%Zp}z+<8Q%`)%?lG%+300G3=Z+!B#@?l(>2g?VQTHj zcv#0svvQYBU>|3%1f7m>7;*v`(+XS}1H?5ciFL`8A%Sr#j2 z&|?y7SDUskV5Zk7pa2XlVzpja^x69gCF6M$tVIXK*xKlLP|^;((H$wNt){>B!YT>M z+O9JGL`F9RCFiU9A7;{0tPRtz7#U;5Q;4R9yYJlzl9uGp@Z}pbaf2j01dt~F2JMqx z-k+7;R;GDRZ13RL+F4$}CJ0t7nyTq#j#E?HC~`(; z=H+vv@tg>YD8~iEI}8q<7bqVWx;lnKp{$ViHY$5<)oY{fBysi#wi%qYdiNdYqGh+EJn6{1f zBE<;OB|fvByNLePoz}Y}x{bomH1mBwMlrDq^R;mVxm^-g5<4>g)C!YwP2{;wdJbj% z8eqQ47MGB9^yj!|3$>1{U8lCCfB+3UCJ&j zaCl>P)#>gm%u_>;(~9K~66(bPC74g(p3w7>h32H-Pau{aFy{E$1W}Ycd!hR*V7{u{ zl0iybhdE@A``9A$MXeL#-C=vGOq;f@59e}rvBkS;yzdN4bBhybct_^+cwV6Q2|txk zd8;rooj-N%EViEQ)tZPn!soALUKUu6;O{Y5_lnB+&I)-<7p--{wxqUX(m?End$d2c zLFuUqw@r^aN{0s?c?{3qsHGW zEyScfU#@BOXeAP-YJ}mcsM6xtH;P)_D^!Ju&zKJmT@AL|KL(%Din}S(%8pWy{=n+E zk6yaoDa8ZdXtsc_IAYZ5r1}y~2Ck$oYlnhKsfF{_aB0v+!$iR5LA>8#R-dOVnya&q>p<6XSR~2=}uh~gIzAvdyOww;fP=%Aco|1Q< zYip}0TDm3MIL8YfQXV*9k$Q(uvk4=$vI-w8_*=}QFXP1yvQJh}0=iA4 z4!3HTTZGBDCGtl>F)_?9;rJVrTtZ)gO~2eB>AVt-JH7oTWtPyep?>aBJ*Ad*I8kA$rR`nBJe-E75q&hXncXoHXU9^^aQkzC zCB01Nrbd|dv(P23@*WC|b|f<(-|u?yr>{x##^sEKlOgU?ZMs8_rSNkeS+ZODKZP)F zj_@o`Ua;FyN!vAJeRJZb#jKTnmttxnHQ$OG@NM>KD)#V!%JYHYg+u1oyCc!ol6L}OHe0nbS6E8ji9!LKZGAvjeBwDC zG@-S_P2mrTskRqI`!Imz#4Nhs&C9kL(_Jn2(1T3haDOSHw_y1cO-;;<@up&eArf|`2&s48)jE-7+!bPqTnmFK2(;ZI zHoB8cZuAb$ z3U9I^J&pE;w?y<3^}%yEVj^Ss{$xs8hxTN*?1*1Jz~EcmMTCXe9dq>lshYSt$eRha zjZcM3kw{3P+Up;&+O2V7g}^%McoT#G{MXJ%?@-HA{nG<9KLhXW*?$L-$1{uHLv6(~ zN;U0fuDO0J!XAdoLvw+g`;fMi=*1Cz3JaDB|1R<42{HzL?<=eJ{Hfh(R@;4M#Ru=O z?G@lP$^~{WajrOb>ycqo>i5n$HR5DEAsDD(Pw>h+h&=6SEWC=Hmc~?GVykvSa+6{Ozs8|An^pd%?HWQTSH3z_eK;DeaoO^SxEoDP zk8>>VtxtT;3;dcEZGO@s*xH-9h2A-M5~(4JAFh=}nCH8Tc$#?A!;G(&&LqS-tV)4+cDyxgE$|n9)ewYMLsUg%cSQ zzy&|IVyi@9pfzZE%hsssZOUEBA&7fXTn)j_t&%%&UuM))&p>&j!4H;L(x%s%Vg50D z#~YcbWj51AE1sj>ZHOZ!mSB|y=WGq-E$Sbrx03Y3onj_&`{w%7q7u~13gM~^C5*unCVe!98O-QVNm>XcYt)_w+0034q++(N3onJM%ptOMG2!&=)s%!;~lkCINO(m$-sBc_lCmE8UxgRgQsZf;1xiY#QDDuMBK--{T25x|?~ zwJ{mDfcl4j z^mR;Y^@J^!(O5ROCd{35c|(NTC78ATmQMwzR7}n{)#EG8FcF2)(ckb#^;umHl9bdK$5c6+S zcuqF9ZsBnO^j(Yh-wvF7Hbx!i7(F(wUA;^NAr)Q{p4&LVQ+ClTsp$4e1pw%E8T6cn!f{K=b}I}e~`>VRzY>{l5O>LUbMvp!#qZFb0GeK_+T67 z3@miKyN)kn*z7SeHqM0cSWn12vyG!l2$*Tu@KD2xk2YONr~XK;ByF`PO0J!>nW~?q zGf7F+D065_9?4oFiK$An#|H|nGK>`zl;lb{3d;(%EyzmAL`s~Cmv0dcSObaR^}w^R zvOeWDF5Kf^%|@F@NeD9yv+m4PJY0DUBF)L2VCV*hWNenCKvFk4U9eW-Z%ePAf4KoLgcVsgenuk}hv4)hg^T+9ixhliM#(2LzpJa(kuXpp-qhXZBz zS*@V0)^4aVYE@QE?PR*}R@$vuK0$1mfs%bIIw+vx=O$`lqbwo2WO6g>dRClxcw0>8 zs#m)VSZKw2w4SQApXJ=fDGjLIk1ySu3UB)EyG&8teeHg32PX0k$vMq-nt=S8)-PwV zo{+Q+fj7<2b>%Yy#88*Yx!J*)0&X%iEh&!A7AC4Y2I&K>(2Dbet0EX7G4OU$z|#vx z008jY>Q4a(fEb8EMuA2K0NN?r9zU>>5MKx0-n~QdNX8ZUNcl+Rj}3zL^)Z4OCypM4 zC7S-dK$M6gkmR8%QY{YLt@8{k6xVIC*^A{}J?;*;SUCQS-I!~X44IaO11WC|F}63# zVK4=@g8h%-F6a)oVu$Yek+SDEhzjy}#}febCqo|bUUAqu=O^bdx(t|IChz-j$hKJf zv!rFMw^Y#gw}WbpD-#rChkMrTwdf{u#3C#UIeR6gH1z zU~(|hOb7<5+8i|P?Nu51*l32+!bbQ;nvU?PmdMN~RrQ3m{H{g{nff%M19;KG8LBcc zTiHR|7HSgaclHO%?^-44H{3eke`fC|bQ>p{+r)*HYT)hgXFaGu!7(@6X!SdQUP3F! zx9OctpM7d@}`U zP57dDR%cfP%ZlGof6_>Jorb=<=L-d?sBEEaLZvmSLcVf=b&S59iBSgUM5M)J(Moy- z3T0?gHY-aJYn}9tuBk3TsMt zCy#>HUs`eMNi20L;aO^C8@}`OL%5p~c4}G4*5CX4V1k+Cam6;UuT(GxmukHBS+~L)gRBzTluX3#Jz|3>M*i5g#BdAQWmZ^8*pS z;^QgICsZ0y(SqubfmpFZ=?d8`s{X>IDQU}WUYbKDj&VUGH+Ul>0nrWe0*T?mVVcYj zMboUk^R=dr?C+S4JrRV3(sDjBX+ntUet4 z2EXq_PmUCs@DEf7->%>D!IRo^*0VJwDUNSfp9vdpsfN$iX z6*d}ObF8>}&Z>jxfC-U(EojlnktGeE8%`SnB@xCH1?+2Bun3=*lcNBTvtUl)esPw% zT&4Us#>&tC%wJy4GCM?ZfhYb7t9f3;WssN5S))NwHwl1$3e7O4#~o4~;#{CDxbvlMcx zd$1dPz3yHZygTnm9B4#9Xb!&(7#&ukFM8Ih&!WApsnyP`m4~OCeDn%9t#m)RG|jxX z!=EHir2l2YEzEIZ>1xbsxS`Ic8MvIz|10BVel=Wc{xB=LBJ|Sx{YQq#>l{1>m{T{AOxvj$Q(q;I3YZg=PdI<* zAD&uX#G6^3u5W?gnDlY8nO}r8?D?tyPcb`UJz@G2lIXNNs|hdVgX7po<~&{mYpj!k zoSy{t<$on!Z=n}QqDGV=B>(!6N}!>vu&|~ojZF8Iov~4l4fT?&bB3jMeB`Sha`}m& z!flnl@qzj25qG@O1RA5F$*>N%mibB+Z|GoBrxyx}oXdxV(5Rj_?kA|gcbabKKe>8c z8Lt_4LqU(3q%YdCJ2UFzR+mXKMK^E4u)!@9eBYl|5v=s$^mXe2p-_)}i&VBPw=PVG zBA?MI_~SZ$S3;ME&hwd}4Zk4#;tMwynnQ$^LyhA*!cX$S=R}Brd!R`gYvZz3v>u_w zJ*XrQfjg^07eJq(Dmj>^DvcJ?Xt=UyRM1eC5WH7($VFi>HD;S)SaNgTO=Af37lQf1 zR$K9jWl!5VM`h{>lW^4*&Mtxt}HhHU`c`i5gAGr^rCw4mEA5aO6ruyn=&4mX42Tw zAk(U*(VHI)hf#3!EuR-QWbuxxU?=LC0Aeq}4wGs1&;&6<)A^w=@tEMsCRA7qmxG#GwmtJ>=M^XsQ4zV^ zV%)c4`^}BP_{Wt5(VK>_ubgvYrW9iPw_#_dCF%;pGyQK%jtp>ev1_W?QfRjYDUwsC zEVUiSjncKvfEpnch=QU~tu=A8-}%6Cy3~Y#-&s33k_wcs?;F~2SN_|n6*C=8FAbYa zs-VMN)`Q&>si#VsYcueJ>f`%pWP9f|e2@9fWSVD3`=gq!A~L!P-> ztL(wEn1`8cW+TwiNGgsO}oz}~FD#$GnyEm7$)_JvNr7pgSQJ{CYvE3y`7lg#9wcR$rVAwj; zs}j?qmY$Y`1eI4(Nw#H5c|7OB^@rI0Pqac)%Xxp+xV)m|0}IPEq_&YBp)-dDP;TCl zSj4$INn&U@M{tErfK_E0oTHijX$UyoG1^mJ4#jCEaE%b3W%hPA@~d@ux&Vzq!2|7J z;|1@NR$cGNk=k8$e7URwl%6^Hy|A1deevno=p_|To41E5x0Sdm?zzZ8nj%gURE+(l zqNP(3bw%ri1#E|sBqr12LOWbQu~BUETB{I3TTvbmkY}y2P-G#XHWPbUQf!A9GiY5~ z=#q2}WEB0n11!F z1I9R~0!fd1Mmo}cGn_xoBEiros6H z$R%6U1$dH z+2#iX>io!A(ISRZH*MN|>f=ELPVYUPoEM@sNB4WjUFhUO#lxM9x-Kz`U=vc9Ch^hp zg{m18Jp`k=(1LwFX?V*Hiq=6|?jebyiI*Xf@idA_Db_rRI&Ux#hXg|{9{QZG$hPeke69{Lv%XOA zI0$YX+)8*aD=jaIjeb^)+k>SS!qD@@=RtYF0uLW*84)A1tME9OllQ>-@zPe2p(}03 z#IbgURgT^_x(RH%io}#Xc{ed0*j%wXDH>YLXNA533yI+g7B_y9pb8ikxgna8!)cwj z%FeE6I5^W*u8(Qkx)X>ZAPl9O#l-cY>h7tDwTN|NUe?LF7$or$;r zw`J?j!nV@Z&9%pz;CDYvxq)=Rcvlytn8$`i!k|{n`gY5cxy!nlP_#0$)CMkg84&?F zbxBStFP&SO>vBSq`M?P-tpRbV???VN-Sy)(hV^OG0vT@0j1`>&WUKYjK2nI38wzyL z+I{s7P4f=U(#elmh9bmgX`a2*I$JUP`HiC|1R6Y!j`)$uGF?Hs27_@`^5ed~+z<7dq9~JO?s}6t6N^P zZ~?xm^Y(uDIk1!XW8z}%U}ZeKry&w0$3Z-WKjHlflg;n=F9a_5UkJB9w@3gUt-mtI zF#k##{gwJVfzkMwuCym%nvD+<8{rJ~Sn_wa`_ClL57TE-wj({KxkaK#|Ni}RblMBG z=70Z&68x+e;Yjh%lKj~ZNd%jbox`7)zv7-aGfghFT}S`zQvmp1I{(7hl&r!ZK=>=? znNF*4uHoK~%W&AkP)~TO++V|Y_y>TVG|!(4kzNRd#3+!D005<))2~)ufdC>tE}Hzi zLcj3;28ljT_5QzsiUjoEg8zxpucYH~%KS0#|A~gG#i9IBDYLTbueAqwjszp~K@<5R z^EpZZWlQ9zc0qj4ME%Ucz29MeX3og}(a2NO^^f$4{sm(V*xySEBvCex#nf{t zfR#uN!bBzB%=t6hA~(QE|2;#1XWs|T|J2te>`VSH%hZzzZ#|9dPgvU@`IGn>FaMw~ zdTpyMz17HBBONGj#g{y(S|wO;P_GV}YL4H^AdyF#aJU?oE)b}pcbWmn(OCrk>`3*4 z6I>)8M-{f_zB18EMv;Q~TUkp*kz!-vdI?BC0xvOx>F$3&*f$XQtWu*x{HIApdIELL z_*n2NehqGn*DD8*0MOu|;DpG~JOXxv$btCXn^nvod;&^gzwt6l+&VJN&g!Eb7Hafr~E_mY`D0c z>RFpzPPxOW={!9xX?GBT4Za1y!G#BgB!2nnk3rlAK3>olA1GH;2F3W>ElJd=)qu3i z8WeyjgS0ynDAE%=ZDB4aZ0XL!TIan$u6}$Jr|~uHV?L9=9PzRH?yO)ABtv>ZALJe|ip)>bTorE129_WQ1$t(ZsXxrg%2(}VQOL`&QT4i&4 zDv!Et?lN%;8i zKQ*3mJpa|E5j1ibMoq9LozuDSDhP(o8t$V**9D@r0r4&&O}!|4bId5Yf>OfsD~{wt zo1iTqQ`&t1nqg#{06)BnlY}qI%te%He!qhaH^6-IbzGRTC%xrxs%T?Yk<*lrBn;+MIq3 z>DP)p=UmL@n|e*>dd+VvmfGee`o|ZV1n*O*Xjgn1yam;^-9#x2e6^qU*EZyKC*n00>1K}}j22FLzxl9%KrsZV|NjIzmwhUoS(PQ}D6zH}D zziyQkoW4GWXf!I}9fg=XPn%Xg=z zeb?Wx>LtEdaDmFx)zcjKL4dZk6yQ0iJbF=8W#02NblTXG2N;!w+)rdw&95Qv9_w`9>*QsMK zEa{G4A_r!#szCb~kTOzIC$seTl;XZ2u@)5S?cS!d^)q(oc&sPN@=F`fCsD?eK@suI zc{}i(E9Uzl(JlUt91{X#$)2sFhnRSuehj{+b{{?3ypA34IG_ruDt%7d5K%3e(7KeT zQ{&L6SGw!nNwcq!xbTF*bmGSA1f<@U7b%OB;s=roXtSFkhs6&gACuWS>@|>qug{-j z=zn*X=}zTOF3~1ay^tTh@Wv#Ve7#q*98r8Fd3@AZ%ycF@+`O2guvZ&K5BR)!YA((&8s zG8JJFwhP(`D7FRj`C+MLR^D}=+6Q5qsN#zJHmfsEz=n{+~l z=IrNDrwDSJa7E!rpz|38gcRCFrb|m;@bSK2lZ%@zyQLaxVs#?LI)e2uhtv9`BgakW z4vEnR^1PGUOkh*!P53rhMgRlh3VblY+mx6rSdB&ut>S!Lq=>AT2wRp`BSuE00d6y= zJS#Jbl0u=Dwu)*b=B~D&K2gJNiv8}}IR5_NxIMdSZ|$I!h9Q*t{KiD6^W}yG*QYWV zRA;Gt;EWeth+SKc;;xj(N#`~J5R`1YI{Yt3n4ZMStl0``(`zZhErVj8?r^YYQ)jJM zg!Sr#=AUDg#FJw!Nr*6yIlUjd1>ntp zMW77{hOq(p;rwJLCu_B#lxJpCrne42L4CUu& zs%bju!>yp23JHCd^F0>VgzG8$p=$Ak{mBv~?xSrI4~d9wm!C%wEfg0vE-TR^%0ch| z{`8~|S!#peK2?MDaxAc%xY@L+*5l1gDCN{dF9JwDKAcZ)V)++~C$eN$h8hE# z&hH%UM?PCk;!(+7D6pE0L7Kpl6iW*$Z#xBnK!PyTK0?+rVDxs<5vOHGt58N)!%!;H zTr{WIM3k2virGXR__WQXc4&5I&wMywx7hvYvh?Gi494{shD2tav?=%+DpEwmz>3~i z$29wE538gXweQ0yT8j(e4fy?;U79;w%CTI>RYVr&NR|N()C83zg(WeAN+#QrsD3W* zx($2fYM>HJs&6-)mHBW+s;IMMK%3k z62s1fWWpEN`c=e8h+so%0*tN6^0)`+648SbT?e{h)z_3YimE*W0~+LXes1V7ojDR3 zinIzc=H^{>-@cl-%ZKA6F1f`ls8$^=e3aQgvHw=Ov7KOHTvwF!@^Y_t>0K*%{B5fA zCsc}t>v75y?wuo@2z=vIGiyp%DHu)9R~M|^t|K=!1rV<8QlGi*bGXT0x@`7gN4{p{ zAZPW+;BOa$|KZcjv${cCkpg4WIgUq`>_T;Wo*Q&Tv`D$`0nQa*Jd_ucBssN$`of@6 z6bY#O*?Xx@B&7(gydXe(M+V+NtFM-^f?~3t@vegQelzOL+(ubPVAfM-Cr1WmiE{!s zewfO@tFXKZAY$Q@)1feD?X};pmTOz@g37^}(VWDYt>)1fn`2X`qPtL^&IUCLl%?(^ zXtFP*z~N53ZrMhNR^Lro-UlmS%K0E~-ypxG;#I;f7bRxhP-9&XRA_d?%BehTxF^%q z`$;O6$Zeu6|E_rT&gZSmW z({uG|hq8jH#NYs<-N@av@4FJ`>q-s?Rxrbx^C8(GCB{7CV%AH3vhbG6)i0h5{Ns0s zS-!?j`;Et~qGQOvt?aMV1@aFHyFZ>Po}vbtf+%hsLINl~BzsPUX>VEZA*7GG@>4Hu!~**F_x-YUuN`r-4oLpTIdD{~QYyjE22B-Nmz z1MZdv`?JawWkd!V@}m5l zpi$emeNayp+i+?sWyx|YkZ|QzKyg7F%p5eJJqRQAD^Pnu0JOu4dzpEcNi!@=n0eT6c95ee3h4}>SNMdUXHd9qzc|Lg^bmqw!bp9j#NkLhig1#&8(I1xp5 zWoKo|f%9OG-=*wyJQQqn0;G<2IyL3=2wQpSQ4&6pc*RYV@}~yTs-a69sf~C@t{Q%d zs&`=xOf&N_@t>tPBMs3tbIkB)32S~_v3A5d3ngSB#-M~YbohMkW{{NxA*5`9cAgz% z03To(h#s-ZC-X@lYP^y>9M<%+k*rvNGtyBnVOD0gCO|5RLtI>RQQ;rcc?9ftd##=1Q8|UI} z+U;c>Sh0(yt}BpxR>BTv+$xB3leF;-@8g=*O}r1=SvaAiGEoMDV;H{&&e;|4Wem_J zuiEdaXI*kEQETOl@(5ASINSFml|u&*QsPuJD^u?2k!_O&I+`B61lc`p>$gih~^ zq|5;y)&}q9f3&Kz<1Zb-chNuno_pA1R+w?Q{C==VXV>`sJOTW`e_X@E!RdFYu~H_> zvvLlx##Y!qZ+zXGc4AMUK9rR?jo=y2j?8J+)%?KX?{8``&WLw$&~YEnV?ZX#2u&2+ zUqksGCWWDt!T6iD6)Pe*YFFC{r=J_d-Mi2*1}?UgB?dfW!1)Z&))UMveB9M$LVw~6 z(VM#tKO!t%qH!AA*3ltGIPXB9d?4`p5Y>8WE0EGrNq(yg@-YyB!@Kwa>mZm|w?FZZw%{AjP>#Zt- zfEN)v$$S(Y%w#VX8nYUPpef4AgSyrOO^ANgPv}cc-YXY@Y7$~94huILOG3;@{)o7`C0-HWHop%!lo^(m z_nhgnP%B>)@fdIc-#QMQ(9rlsDH|~4F%v{S0fxJMy4b(xdC?s1|KfK77OXRHJPDj9q8@h2@KIEe~aWu(<%=S`H({jFt0QdoX7Enw_*dG3Ea zbcCXLQxjM^p=VO-GqPW``#;tHTi8=twms%aQTgtV;&m(v z6IEprYV7$mrpJ(wqg12P^2cor1$kGWX-v%r(%$Q#{k0UNB2<-Z(RY2)R~IDc3xcI% z<~8ba3#KWfN`-9gfwAG2O0@6hl6<~`i+l~-`XbU|utoh>|D^rB``32VInWhUO{?H_ za)US}GtpI=M;DM;TW;naJDo9{?7x)Ang8dikU!>9f;>f81H8I|o@p?mV~Cm`@@F_S zG!)|XG{nyjE8N*bG1+^?jua9Pie<~6vzZ|yE0yQP7AY7Ss6`6Ntzpm6D6(=2TQqCf zisT|WOyLU>MZn1L+;W;@Nppz6L~bXR$AojmJfdN=-%A@-rdEI;&>7NFrAIRiqpUA;d%Y+?Rjb!03da5_#ct` znc-_&^)#Gc053|HHwgjod>LKT!bfFZd>*{}Z;QVRJ%_8#uzw?fDe1!fos7^z3G-#6 z(^hn@vZ)`+O?XFWZ}j5M@D-#s=T7-FGaQ!H2n;Ufkgnj|yR_~wAMa;*_(RQjYkXr% zw2Q`Yio5)6j;U802DPpTOH@RQe_HInSo~Id6z*rwzt)0C;YsiOf>oiXbzUWT`5OTY zeN+B&?6dxn6*zu>^N+kgDEI%2 zw!>AdJ$K&yd^Ygk(yRXr4VaS`LYDmqVo;Xor<=?2~m9N;Qt9c;&91?Oep!{2?i0^KnJ(cgZ)f29mS}({9Fxi7iOXY+=Zpk zX^EtPVCytYw;}CxUedeZZWF!_5~8M49FTQ2Ponz|tNuUxdv*bP>al8VjaIKIJ(rz5 zG3a3uzQM?%1t61S$I&MfO1zRwfjQ@!-g1{i|Wm;bm+16iVpha0m8pZi}0TufYpPmR>=%8{J)t0#OfXVDNS(yaJ>LL%N~ox zS8{;O4{fAeC8PdRfu|O}DR;5V>?*+rq*OdFnG5))i=qK)no8oAgiu(a_alqvG8jBG zfhY!F<8{AYd9yV3e$gv$pL=>wp)W@?j#4em_tzV6i4i!qA*E7Cw~N46FH?wt=j2n& zRR!BB5jin6B`NnD>Z9sN+uX$y#}hMkr`{}1s0#9rx$h3q?CeaLbFr|O8DLHz0uH!K zM+n($=Bas6l3#w<;oZJunl}@oBbY|9{Bud zv>9GEy?O{hpDdw`ZS4O93GgKSNlp;JPYd`=S{?v2AV>EnVs&Hz85BSW#6Oh-u4ohh zgb)}5ni&Oj=_k!42>kgMiYaC@+x{!;zC^OdXk5&(>a=U6fP-+30ev-wj{P*=Az2TR36 z_X#B<&_b0plPCA}|2{i^Y8!Y)_XHdOC9>xjVD;zQ0zA8w|7ypdIXu5-nDMvB1J~de zwEt@1rUOzjL2L#Ew5(0%-qAwLdXKJHzkVKPraA z6%-_X_pUHJDb7?sKQU)@l=b>ojbDN1Pofd(e0uS01KnD4ImDm$1=?k5xI0`!>+hr- z|E}|t;vuqR!rpALFZW3~q(e+o%84-tGT(n-l@WfDYq@r*j0_rZvcxgv-?KQon|XBf zs&T$UdzD_DXwQZBrBbW7k^=|GO_uTt-(qO5QrJNn>{oZ@mT{uj$1|?DHh+zL zgSXacxpkajg;QhwU}7r&AV;y--0b(#b{ww78DvnJkWbp>kaE-XBiiV-&ew)iBb6j}^Z+~$t7RzMm zwuFp`{BDGA{iIQKAVI=P6c)?_hJXM^{zBzy%R&h%=Is|5=79JH&`#d8)cXY*z^Ez5 zm7%MLXiMj29%Z{W?d0ryVvoWtq6TUZMFBk3F~eZAu1;u3LU=Yvza?y@l#dtn_-IS$!lE20UK&p5DF^F5!B|uhr8I)Rc5SZL%$(UK z1!Ir;s1>z{`3m3n%}S)tX!!bc^&N@~?-{tqEVj1}>z;p?d6|p_Bcm|K1JhtAtwvjj zK;&D4N_Rg^5t^n^5g+@i9ChA(w?rjyE^rBNeaNihaI*f@_Po-20{TE6yy|X>iBy zUtuJHr}#v3+|-@5S}lk46}DJ-HJ8^yLZkM!4eX>M09D0|BoU)&0jupHpywL{JgvXd zVo+w4=1tt9vneY|ZEV~af{=Hx=c6s7Ow~CL1gRe4spr^H-Ybi`J`8ZgNon!*h>NN> znxxp9ZYMpon-cD}%jUHw>{?0VTj`_mW2J9)Kl!dp#=I~cdB5?Jn-k@>xux~Ex5Bdj zwAF)!T=}C`5 zWkKVMMvP1pyQ8i5QU|_IApM&0-3|_eNWF+wQF-4sz`vgIMhJr%YIzVx#23~e#ri|Z z$H(M}QQ;~!M|#nFaS}!QiOo++24!tRx9GglX;UyBrr|8jh=~xi@rxDRby!QA4*^o| z`^!xmX2*<7U){uXKz2wpuF!M%1#UAY6xg5l5y(4B-)KALCl&kn`cMZE1$U@|1{!>g zOO3ni;|w&mJ*UyNda+=iNg+7}msS2LgGzbaXpX3zjkhau+si-!RgX|>_!EwmSW0dg zMY}>F$lz^hDsKFy{6IRR#0%L|n#>&5^45LIPc-Q+wvuQ$b=x@^Z&>2v=qWFhLu4`0 z%BoyU#|a%zYdX;ebX;Do_Y#-4v$=haaunmbOn|jW0i~|xk5I{DiRwr?g}?-XMuz!l zHg{RuFeej;RWZrZIL)(+K8jOAxC_Be#W_oAn?0wv;ly9iBq)dkiLgr!wo707WfcdT zWjJ5o_#7a0Zq{N8%Y2kN4xOZoIg6BO&$&x zBF47fg!0U8YU!-10d>Yuqe$2DhWR*b`XNU%WMR%jfy9+7mLPrCOwKFbF57YbRR^j= zCwryEo1>wd&*&?mv&6i{MBpiXObt*)9m;Emp;R9!KLE-~vEdj}4x1G)5kuh5) znBTQ1pu8lGomqq7ss2o)o#IuFhR@1Cpn7e$-q2EQCQLfINwkkv!67&dF#kBy@P@)q zoY`4-pMfwhJBwe|YHl@zJfk7LYJNV>$oZ2OwKDL6nI-GvEdGNj&_13a@5)a-!`yWG zR|G44)q97*3{^L1Y^+&T#Le`u4H3ym~*vbBV*+lAIf(9C!MU<}b!GoH%sc!H6;;TTH?!?L~>b+QlbUyrg(t`*k59lfU+ zP_OQW8XaU63XlJo7YXx_f1N;LHji_DeMQ;4&QHj22Gxe?rK?d9U)Q)6M8cBC|7m8n zL-X~-o2gP(eNt5P+W~vtf@vP@}xlf}awav)&xofU?(S zQv`lIk#UR4v7IS&n0e65W=P=!zGW@moG^)1E$23phtmk$rWvbwR;L)3d9%dpyN&rc z;i2=-#s(4Y+@z6+4Q3-DEbyO-v~fzxd>Drr7jSKcCrZfSdJV|*&d;-)m#EfFh=jD5 zB8wC(DGf?%m(0~Niu#vju&qvFCc@vW=j(;JC{-PWjqnqEr}E)GFPIo%-%pm^(Ktx} zUcMuy^YtDTko3C!41P(ifDboDci1Uv)&J?zVl)G-+8gVh!pA` zKJH)L`sC;^;n0;8mzG$XS(qOm934vKBJ1#BV={t6Nh}J8!?iHm1aqP862++Ae#;KN zs_#X2cz4=^=>ZB8h0Z;YpPno=*U19QK4@o6nHj(E=+hEP{*jSWxb`YWtHnKfOHgG> z;_m8<&cakeucIWz){TkQ?LuT}-f89jWP+~k{&a?WSVsq_b*1HH6=f9UX2vGRr@z+V zUG-q72HlhnWwDlNdZ(vH-g0=d*++wnui#L7U8~I=3+;OB z)9ps;L)~8MDl0$J7fxD%5Kh)8eA~CH#`y=f^o3hOeV6hyyY}&O($|e$e1lWDj-)Td z?>A5!7{54@##{7aI`*JRj`64@bEQ0rrQBMH$`2Z`iVf zD}G_kQrAbW6fF^G$9sXOU5RAY9j0`s!)LdX8~4+hKW3o!tamLcl-MA8i5m%%GkTLA zFEa1EdTglMTq|Bp+N9pa<)h!5d~Go#(_&QJv5f}^_V~fOU(4{2zvC+=gZAa&pYsfX zLQgja0SO9$!*&$_Libj}o1Ny~S8%TwX}zgbF_6>y>Y-cZMJaPW--37g(irf05^wPJ z5Jz64*%9!fi7$IywrCI}OxUT+;}hJ-`T2xsVweG2D-e&%Iehm45flv@Q#OHCY{6-O z1zK8P{r!hVYV#dR(|@C!Pv~m+Qqr1fj>e#OACR7_NGtyuzc_Kd&#h~9CFhWbe zZt@I)Yofi2HY)+END>hv$-aa$xeM)sR3{z7CI|(~3iaC(+;z}MQ;)EF$nf7GLD%Q( z!q>f8ILqI>TSKPJX4Hrs(HQp&F|nuqXd)d8_qwrQZihnCz0lS1{Qj|7_Vm_ZWUF0A z-EHhrqBQYkp33#dJ-|N`@L&DyGZ2FS4!O^+#XU@=?BXixK+En&@4M=fM2_lFoM@sV z5R@licynR0mW+fq^5bH@2? zuge2Mjm$WWR?9*FYu=Q)SRN>_`=y~ivT}VL&RjkeQClY1!nycdbNZpj$Y0T@P7aR9+go5 literal 0 HcmV?d00001 diff --git a/_odoc-theme/fonts/PTC75F.woff2 b/_odoc-theme/fonts/PTC75F.woff2 new file mode 100644 index 0000000000000000000000000000000000000000..fa5a500ee07d986f82a41e4940e928e7b5037b73 GIT binary patch literal 98748 zcmb4pLv$_-tZi-Uw5PUh+qP}nwr$(CZQHipQ@7vy*SoVjyL*tGWRPK2vJ-cCF(x2j zARr*%z#bsf{}{Z2=RaTJ|L6V-|2MD$3m|YZRM0|sAq;>L#Gq)PgNc!mU?N^fBAO^* zQ!Ri{0^rRVw@o6)Dh@3#=n{>(No6BHFfnPjT|f zjSs%GN&kps#}a>ENudmo^f{qwMv(iv}$Y7ty;5NTiqI? zTWckByDD30D^GHsOK3dOA}JrySYn$y6BY%s;OP|FLO(FzC8hahM>1<*Bnj0^i0DU6 z(Y031srk%oS7o9Pns1Y?B`T8FyJW6Cr6|m5cU=@ORJt^<2TOTVG|}ke=nZAlldR}V zDPeVWxFx|&sc0B4sMqLEe_B+u$Pg#?@`~#Q2|t(&Il6r$Fd1=4Tib_hNNbA}t4PzQ zt37kM`@+g;NIqIu%$u6%;@EO)!(imZRh&d!A*yOx=3sx+V?vRr-_+^o7e7Uh9eIY5 zWT03k*knQ!DoQ?t=&!kWR&*VfR!fqUXe^^Q#+-bju9lVj ziR?PtcPosO-pG&J)|v(3DYIQkNgY8^Wj>XkZKIaEtoWLKXzT9eLy&E)qwWRC|CAUQ*fU&xiUh!U2~zDl}3cB?9k zZd2@_f?waEHsy+4~Ve%oqD1^o{m~_whmH5BdZC$UoaJNvT{5?tRrSP0W>A`sPR5 zqxXmXMmddXTNxV!b}=D;9_54QC$=v_a*2j=ZvIpZf<7ghEB2EC1bTPkaJkOVtd*z&xY3@hX8OJUui5yX@y7(=|6u--U+|CeV*|Sfpm%6_ zfDU2xQuPUzhZg1^+N1A*NyL=d^hAC+AO5ikuSzw{X@AHc1DtN(sKb0(KLY)T%~Czt zmFyd}WX)vs2Lrgj_m2U<04RsPqNSh|a6TMh{}N#V+L9@;r6=!blw1K0OAA_M+h zSbXFBkv}dZevtjh9|hXC1@!a&J^#SHSS3bl)>;XCqh9G0;avhON8DXp z6x`3g`6NJ`F9~O%rqf^GX#f(D!4$zmPh|x0)W3m|6mi8|&m$WF7Wkc2IFyHm@`?X3 zeuzH!EnEcrZ)+3g_AQ_Ksy`uEcd5THC-(DD`ANa`3)X9#1cxa21@QMg@nCXzAFhAi z41VWe%8 zcO51E^!7RW>sOeUe%)Wi7tDSyttC-7F+qrFTV)drHf1n_o0qSB|8sF$FF7s;kv%bK zF=_yHgocQOUA?H>(;Qj61tQXeT6_^0s#+3Q9)PA7ER>e5OJo zGKoeCMxsh30v;o#2p2Q9sa#HHa%h5l`&zr(|Jl^{-B;!R!}<*v9|WxN-OD3VB!NgB znHA-;A(Nn4d>;eGn)86@m#0>E@no7&;`slFeUqNf@S(TKP8|oE4l>f11#U0mw zhQm7}%Zv&jQ@RZB@Aw_&O}@7Oaj3a{mEsNsD-YT>$*}?~eJe>Ej?Tjv9}~gv50a^5 z(iM)P2&Fw3k<|9DnHjQ9PxL=5xSyFMZ5M66S*NE-b&1wG0n6J8UcUk6YN#ajI!Igp zK!HHHh3|QrYCCH!J2pv;Wj_)~^uN+WY_N#H>02L*r;Rhvj5}>qi84Y6e>47$R?;zv z7&`<60^Rjdzv)`G?yS*A0Y1hvRrlK#Uit-@)GpOi8>_lXOO(+te*!sFFa4-#T}qR| zEf1GG%xPUL-11rzSZFk)3&A}pd1(*}c|+C|KJAvgUy-JSDNvnF^?NZ(khdp?fLj?I z@@2oeJiRKs6@-(-nn<#ze}PiO`7~sD#5({4L%YQhI`s8}TBcQ9B|@nsLX{e!y1MYI z!_w``#`U+yxv+~j^oIxs)7S;+>>;o8{WHk*{^{yGzdrH^)F3u#!jzkbczZX{eKdtdT}AEy-~<1CoqQfHa3v*r zHa;{|w>H#wWut%QWq-1FPgkg?pf!&4)k5bwyPa=hoKc)`k7VH$vPeThj@DDl>(ii{ zI?Oo%Ka^#d`}VFf*nszS6-GPG@6j|in)~|e*3+6DqBx@Ph=_;@Sz(U5ht<{dYl2a# zWfm*qO*sOR0jK)3+$OH(tKNA+NKeWTp{ng}gzcB?u9$305HQ3ZjIzq%CP^;-0xpQ$ z&ILLjnsNZGKfzTwjd-L^#=Pp*_ExqLzg@%IyWx{m>&2&@ELuL7u zo+x~X3k_VJGUr6oUhG=Mkf-brWG_;^HadpUFq)iPNxK934Q}UqMY4h00HlUBEJ>7; z->j2TXb0JPd_DFtO_=yZbaPh5IHjD7fbcRnny8|SaBfnX9tB)C#HV_;EbAOwb@Mga8KLLbyX)ZC_bV3oSU z5P!|&Z(~RIAkvK0qCtbZ@S?)+`W($#XJvX498JU+c0R*1BXy>&PiiFuO$mymqmw( z9r)pmj9{IYfADnBp4LA?nOszGRa#k+f*)U124!SW$)pGHq-zr8BOc;*J@f1|%;-0{<7DbyA z;w3r;x_$A&1;QXmL{nx}Mc0{aWtHUY5u(`>Vt@!{fFouk31*@iW}*XSW;tdS2zQ{(6T$fWbgG3KBp-j5-X2fJiK9^G*nLqJd-Ng1h#yEd4x>3DLecYAZQ55K^BfI2Fa47_1-g~B=-6WU!yP9Brw8I?j3 zRdyLw-#?C5jAKM=3(P38kP8man=#5T#oN=pDRp=-7#v+SBB8RA0)?tfe_7Pb$=#g1 z#G*jE3dE2wBgR^wrt4Izu!w=MObN5>7_%N3v$;tlvVRG)hZA?i5qI$j_pA~3yAc=9 zNLg18P{q=!Y(&@9y}U)w*OyTXC~xf)y&qXG>vZ(JftG}qIX>K;)Fle!L863tA}P3& z-kS9(62>g_+`2Y~0zFEuv;p+X{%pOKAZ?`MW$yhnF0b^@p@h#MMl=Kd zGJw8s=}P*ybITDPez|j*53;j5Wnv9P2)zLIX@2P6ZctT2JD?AKVl2R0z!sux3V+B3 z*ZV`MQ%p_syorgPcP5}#VrxK6?v53MSddUBg72p&jN89~W?+j%Floh@^0rNqr!ihqs6&ZlRX*!KaEIxh~vfmh(E zLY?Ec?qWkVMXU+L%w9TB05Ni@O`A~ci{JvVcJm2(=v2(YBQRc5=@ zglQOpH9`=Abnh_D3Pzn-(gTTCAPB4|sN&%_UF5MZ>^?v9Z~jbBM1(|wFf;^7C;^G2 z!8{=FR1KiF9?OSpwz>U2T{0HaD!o(Hp+ZI)N=g6%aWg|U|F8?+ zF#UQ;<+vbWn@&3_-~Gz|2VrF`1#U$sOD1$Q5cRwFv#&|Ryp56R=p^l&Bl$401}yz?K5*8vZ3_eLB zgbyd6Kt#U>15trV6y&K88w2&u;J@NKn1dUiL&gXQ&4Jy!P;qGn1u*y}0VdvLazl7> z4-ncuS(%7k{Ga}Z;}L&13EUIX2Y?70pwtB6N(R*?!h;nc)(4aK4GLIRcm>syy4F7l_*dO}(MAmNL35*fKLpXgr{RCl0uuaJgg;;QcJSZg zf3`2ZxzeWH%-lm7<(hj39N1t#Qg;T3<+$#Zh6C;>XA6IVAOwdCEGUqt0$~as6^K{h zS_N?z#4M;?7>4+Z=$FWyAaV)ok%1_P&Kmj;YjKl>gTB-|=7YFQd6ybkE7@2!CO8 zgBq31oe^lm+F^HK97GNzXny|;YD|lZfSZ#g8cy8>^QI^9m1#=mc z3P0hNxr|7O>Z#xOk+xB-*3e8(SzvNYqnoMv2I+K z<=#!Loy_w-bcwHd5$$I0e3Gov-?ae%cM>~|^(T)w@+me(tC^Crr}x+v)>d9^xDDHe zZsKUvN;M)?O1o2kQy5j%dQG`RtD;spTj#=;7^wYGFY0s1cyvA7Ppys7~GW!H)qu>2on|PSbR7L%IC2_&;G!^gh_^7v^WpmCep2dVEn?Jpp zZkX;%Nc}0h>`ZN=Gqs?gH=vxud_zPx+fM~TzZ-tknX(ol5Y81nud0sJx-=}%=!gubnNFX+{fLsX}S4xXtP*Wwv?LoxkTDV z?y^3cc6Z|p=?SmF?6%kN2L4l8UtbOMJ46x-Pvi``Vx-yUxk%gWV(@NPx*O{4>+k7n zRkQO=y_m-l?&bI=J)o}yh=3cq{ctJdF3L7;87yng-I$n^tNb;(sR7KBshVF7v_YlS z_PtentsTk?aAjVb*44AGm-{`xx66DCx!9G?g--A4k7!r>Tn9$WI4#aZFLrT^kqV@b zbi&PLHf3vmvI*a4fJ>V%CN_j72J5@TZZ?m7?{gdC5DzpBJ?}%ZP9tnb_ zPM{xl*8;tQrPc#KSvwMw)|)2#=O@OYl~}AiOv?uGCVX+%Qtiq9qw~weeN;Vtw;Y+6 zz}6&jCK-9IU#8}O2O5KaF><{02pMeOyQCBp-MwA&6~O>#ttp`OMzUJOb8P9lT9clV zJ}w;c`%y16&g_&(>6|GU4(**nE`d#~?rFZI`c{by~zryQSp ze)w-L;CQ}mDNi%6Mp7x&0nF6Fy}R9Lh}Af3ZABn*&z)pexw*Wvt(y&gW}gC*ZUB@J zQ;@MzrcUALFKyv6b_`kbsFaeZJw$X{_f92{qT*us;=x@0foJuD%{=usdi&fcS%S>1 zmLr*7kcecGuA{80ErF4d(4ZV2$7XemYGytv8k_dqQgiwPdmJNIG^LB@!qmo!p`= zDz#3h5wFX6KDEPA+@@b0yedYc!>DH(pU7}!J3IC14Z5PQE6G}w`PRC*R;t@kw5#70 zkRrbEj4ksJs>3eFTn5R;YT0R#IXgbCD|ygPQGbSs7(dbsVbQjH|+=6 zRxjqMdBpGqpN~2^QXLXQHI`>^-!9zhbJUZhd)q#q@hPErG7TsoKuDZBQ7+M6ed%rcvQJ}%3R4zTeyT5OWrh!4WaU4)+oI( zG$NQjAOg=psp`Y7Eq|r!;#-o3Saat^f0;38ASAW|%2e9X`c}jE!ybZ)mYSrdyiQRo zD@JC<0TL->3@+v2%1mh@f~}oM2|2t{3sE{6vkkASH)!<|Me1FRil)Bvf@iMabAUop zsC-r)nUq1gNM2c^QduMAMZ>O{#9fX=c_(!nCv2+QU72L1kH{#l77yI&&Y5|VqBEns z?_9~Eq+I<3kjES;G3gCTOQQ1XHfx|eE|R249<_Pc;1anJaw_0hM8Y69XbUOtf(8Q# z6d*u?`X7QLNT6U*D+nR){!g5VXhD{3rukAxu}XjG&l^=jU)^F^Tk|T16VGwP&}{hY zJjly@85{dHMiglkcW&6jo>p&~7ggF;9w%nGD`_A?a-upY3B3yE%!X$WM*Kg8`DMy6 zL!2-H1k-}VbbRCT-sV?h`%X-CJ|I`ytR}DT?``k(GvPg4T z57Bi05wc~(Vfc{Fhie;Ua$y7W;8siwcC#)rn3x=1ty)uvF_*=-FCqice5#TILA0hF z)-X_Y9-SqQGoHz84EH?V9;yYcEI1%f?{xd&q0}-)d9)^gY06F3>N&ZJ;8UV8)67K#KrS~jP^r#g`gltW#(y%ir`Jep^#$<8HLWEJ*-@7 z!tZwU>7eD~oDV0@qNynbbYmQGY%^1bmhL=zGhLPc!n9e5-b=(PkT%dAdtj zh`6jo!{5ii%6l|j?v%kolDzUF9Ff$WoJFdyioZ4EJrGggHlgeJw?iSd;t$(@+_Coa zI$dut*<#Wl$V)sa@4u)ZJ}eN&^KQy<%3qtAoYM7HcX(I%;&8-hpexO!l++Yet>OPu z8JEk+<9$9d^7>N(*ie@IpmF+I^&ED3mesPjz7T_^ik(}K2ACui#>B{8$$tGt)d;s< z_W(-Pzn9cM?GYQWcEmz;qMs8lHCtAtLNMg=edI|bo9uKcd2+~=fxl?sO{90NXymK8 z!zaOmLotN==x+iVRANY1_&;Z_25s$LE0W#jhY=cGXbZMcy z@1_Yf>VJjl=9+7O#nNJE8knh2=_=MO z=CopscVmcIhW<7i(9JF*u*YdypAhrHB&#fxiHp4vQSj^4QBB4)gxFG;D`Q1i=#z_y zhy)f9JJt>^3MyLDbdHwu;55bWwf$~l!87OtY#N2>O$g2OJwA^hOv2kF8BNdbG^tzw zw?sHD!S%G9d@Zq%0E>j1I>cR4P;hNyz#K$GBYukv%6%U3Jx4fznWWfL!!8|ehM-S0 z3r~`J7EQ*9Ap9->-rpKx{;aBSnq}#UkeDTtOQQQhH?E4|%VwVrByCc}66FRaeA$}n zqnjeoV~|Oxh|wrdLJ@n(D9PPS>bMC`q#ik`a~4(374bZXbx@>~IFh0(*kyr9cbKr{ zgwTnB#Ts{im76$=9}KhIj1sc zb(;%d+!$2QNWaO_X$kh3OltatHde2Tj&iWshDo%m{)MQj-KX$|TRRx3VW(PER0$03>9X(N}pnhlmPM3^Oe!pU+A?9jUH0s zRj8E`itajF!9cAWgayUB{+&a{>uB8D^v~ECDL?9d$@*FJeVPT6T zgY0anDAbDrqhisKN-Oni|O`9yck|Aau)FNEWdE`ECT0RC`mGLPNV=^a;!mqLeUIlC4^wcKISN zz0|Bu#wU~H^I z`bADCZM6SWgDKKNY;aRlcpmO(@KOpyw>Sl!WY_6_J0qJ8*W`YH4KOu`QsFAT zYzCS$g-@A27Fr}(X_B7tgdJ2tLK}uoD#A)T23Jf%S6!B!cGH>n$B_C;)e^P}1eIl< z!Q*M$MZI^q5bg0L6-`Irplct$e%6lrBQj}_p?A8x`8<8CtqK~!P#6PS+0r-{&LP>{ zLs8vj+3kl}?y1@S!$Cjn)I%WERAkjEwM9ZPck{KLx|F;4;i}g^2TF?<3~( zKBANAFcBa?V6adyY)6AV{?7*$MvBTRhm!e>Mx)6{cA>#=I*#}27a5WO3NCQy0Ez@A zcJSx{EL8?6f)*)bP(VS1Fa#x>~j^ji|G5gUa~0SE>M0t1+bXhegl6lWDK zmiOahIDROe@trv?GK3+LQpOmfaK?zuS!2Lz$S%Q(TejdroYG|nnmkwOG$xv^Q%22E z3K#sD<-IxE&f4YUvN-S+DFWh6N+|Kb8=+nH0k0@r#>j?c+E*7M+D9-AmyBBH>NjU< zcm}&;REk5F-M*7IBKMV$LQEm3;xf!K=RI!$^~=5dwClF~`PAxpHx{!y;pLlu*tK$c zn;KuU?X@_L>)z$sj2@RkS~x&TzSFtS6dpqUFK**-yZ~8K0F3><i7?Qj=;>^N8mX3HEsW*)ngx3E*E zADiY!78SAH?g_8JuGo_e8Mwzi_>P{wNCQkO9G|N`a4I#r>RKawBvsjqDX`U>Vq$y? zZ;mV+7knDaAZT#PJ9t#87Xx7eVr^RLF$~}!?20;*(&5Lot&}=bt?Dt$63%UUF++Pp zS$|!xO_?Vow3F$_13!Ei2@Uq*N+@e+SiARgmXNanB>iWC&5Iyi%h6Qh z{)H$fU5Xm#gcOjvz!VSyd}F175r%kz%uf^^eF*=g+#=l7J_C+EdP4d9BrvTg3hgf0 z{dD3_4H}E(ahoA)^|N_w-$sCu*he$@x_s=PNf;a(Ew zcDSzU;dVya=nhTLyFEeoE1zzI4<<`?Nq^Ks0GWZKUg<91ypmnJI(vL|p8qiG^~(IL zaU^SRX~?z;lU+I}0{3AKwcTeoetOEvO1$@F?fe(9-!T|8sBa>`oa}M9IBJkINn+Mx z22lI*dw3rD^x(oNXLvy0&4ml80AaM_u{KeU$?1Tf3&ZeBr*$pXYVk zOaDdv`=6@YwWxTF2of$nPDoU4@0{G+Hp8DCD_rVD%k}R^8Ne*}m_KQph`zRIRPOuy zwZeTDBW>4lU3mV>+qgL%JzO=e-H%i6@X{fU_jYlt_mTmNtG~fH))?pZQW_iRsqQ^` zTuTqed-phA8<6Ba9Q3^k$_o*cIme^cm}ik>GTAzAXe#&jmUK{o9Y)-RP_$3${AaK# z@IC)qBcD5tuD59`lh?RpGwXwd{w>}UQ!}(DNqTkoyOm*WAa3r?Rmq&|iucsv1N?ls z*Psb0{ln=%xAHy=`jxPsE*j% z-Ro*52ge@eSjX@ZZ=fqNXA@9WaH6wQLua-{2@}Z-l%7ac&7<${pQjH!L6%T~s(~f& zBM&;r1Q&vo5C!a<09PCfTxlWFX6k)b|1PYH53E))+*i+$Ma-EH%$dS;0$C{1kmfqD zMf0AI7#J|kh(u=c2TE`tE1k-nJb5>aM~~)Tywfz_Z4uKX&;yB7@$<{%Mn1UD0SO(cr- z#V(>WFu-porjp9+o0yR}qS7ga zU6~@D=`hAIe^N1`4`nnSDKwzxCYsaBh4V@7 z5;xmEe|vx4KlRM*pnBdL<1}UFS*kY--=@ZVSjzE5Ke|%bKTGe{GBR2GN+)!Dm}934 zHyYjZ;&s*2;r9JLP5({ic`AYW!TEvYlSK}4?|*{OLNIzX_g}ki_L#LBW4%zKy3i`T ze7e0XW4NmHfvi->yFzK^>>J%?FU-z zT{>K7IV>Q*D2?iaZ_iIi2~;^2d2rD+hTPxB^6qsg5Ly}<-EP(+cmaJFHej@c^_R(BHo_n{1R5wN@b zN>)D8Y$Wmj;iWrHa3Ubcob#7<<5uJsP&AuxieL(Lwf@{HBJ};;D&|b7YZ8H~_f#oO z#c&y0DdPO`sbN*(OEv2+`=O%jC%eB6|=&zJPBlrcM^kq-rhS z=AN%}&K&m%*dLa*Rs24+!f57Mv{9kUK~KcIe~FTey*tq}>-Lj)0sH^5Pp3sibkf@NDHgu0rpV<{_Z z6=&NV#b8{ynG7k?T-`9Y`ZSk{Hrs%+KEDE3r~FQ#|FF_PtQy=O^w&%fMuxW#Ns{s^ zl6Rr;rv*>|tTfP7U02n!z0|B(YkRqBlDjI>|8-wm?P`(#$*u-x$1U@h*_myhKXb{nN+VKQa+=ywv8*x)c-M7zyB3Dd{R<#U4HeL z9rr&d0CEB130sLI19OsnNZ6MW2fPi{6`lo8FJ!XAqWn4(`nza7F}}du|Vl89)=e}` zVe453Wc2ZxWl!u9%cK6{LGM4}q4CX2)P_7R_!`utb2B_OY=skYjQGJ_O3v><3i0^5 zRf#X^kf3xR=8(F879jylQ`TD7Y?KiEK8G$Lxy#sF-(k9qQ&!D=TB4UOr#C&$GOlpW z_}fs#-lha=sZ-8QBr>=$!?GP?aZZn^Gj~(JB|kJDkB%6i`L*Dk+ep1xyh8r&O6LX> zmArVmTwGru{TcE`aK;ys_M^IV8u~XXrZB^`Dw41~=j>IXn6_VMEklC*ZpP1=+edO< z)r>oQIgAcR_Q|)9WU1SXXxp#fCU~5L&53ou9raLWb|*Yk(qa?)S5#s@v$*)Wc$sC! zcO_@<>z`8#=ReZ3=i+YbgC0Mk1EQ;`53 zWa2q{y}7>hC5*mGhm$>3UZG+K2Le$czUJ6zz=Z}KB$e%&6%y=uBP$5Qo6vmE%m@N_Jp#N>@6#Ep z*By1UyKC=ot^#|<6)2US%g=T8I>xM_h}X06WdkD-yQnull_scTs0)DWwiIy49X?WlENnAOLDc}sNHS6h zxlQ3TUlW4T8ONHJiHMQ2E8c2tK&ev zcKp{lJ+4t4bliC-RicI{LK0TH@K9&J#sTDza+m|^DDQ6=23Q?DXbj;L!67hP3`lrZ z>_%?J@d`tS|J}}Vy!RiYoWEiL%C~&9xlYxP4K$o#Bt@Ls7x8$TcIY(`mP|4Z1ISA) z$3^uGq2&B;s582;mXmR^SUu%n;u((kpENJ$IgVP117v@htBBVTQEV`m1~~?2o*EHp z`wvFi$03Y2G&pD-@5VV6WXmp#pe#p>=6Ht*N^GO=jyxiq=Zxn~LuS4pPhwoq$2Oip z1~rsYOk0}HKF72!n`(>)b=f7Cmgt;2`&tNk z{+^87o3>-SFJuW@#dGiy(%iaMu%__agX#)Sb_)s(HL(d}`mO1W!l4Ha)c{NpfnCsn zjrkdXwUq7d_THT@2PcrJyY$<&M%5bE9PLOi{eV&ICjBBCm$C}k&;8v*1Pol=K-5I{ z6LE(Z1$AJq(l1Q)9ZOM7hQmcE-AJEhNAlIGNX0lKREq&1knChgYVkkF%QxH zuxoZH{MB))6tM<{=4jbi?mEi?UoZ+-m>UnpQP_7B2 zO<-qeDohtpAJ95Y<9kOe>sDLIh*b@~T%Brfl!h7Mbrks!!NpCH_veSV|&v}dVDL4gB z&o8wmhxvf69XiTNBpuH}&6D4j5!(G8NE&bR^wA+9Ap(Y#sEZroRME*UTP0@1=)4G_ z*4k0~dk06oumCCv=+%e;+er*$Cc-{E7CBNR80;c)UR9!hrQZoJqrukfhhZpm7s7g{y=F3=AU4W$;`|ec*w@a-*o_3}q!nAe{V*@lgNPttre&S_;S7 zL&t?WLwvQHc}Nngz3>h=i_EXSAzj!94Ka==ZS2?y#a)D+bt+HZ69Q#dvU7o{`b(#N ztBhCE$vyXe{je^u&JLB*4mh^e6+lBSI0Y>@k=^etdp#Yg7z2XI+-84nrRNlzmVHhd zE1tVzV}Ej`Lp%`IYZ=ufCD4X$_hr_(RR44qtxDPDG)GLFYvwvbk3oAI{f%j+e<)Vr z!WNKME3~6jdP1HQ4(b>xe)X(IcFSLS1ixJFjn0UwaiKnp-ZWm`W-j}4N!07~x5P^X zN$Ko+yE80DL^db5lb4&I6x^#!cftS+genRqSq(8KHh!Bn^^e4pY|09}@{UqABOm)t zPP%fQ*oo`PO6ZGnQLXg}7qtUPPD#k&X8|Fn7%xp9g&EkhmW;=P4V?#~<%uk5WgNaO z=SHdRyog}WL^=>O2N9SMp)`>mS$c6?_nxAUH@@D+*=nPT)G1Yzp4JJfkOx6V|(LMcDK9&XDEpLh!x5i;nY3cKVQoG&j+1oQF~sucpR??1A; z%e5TTeQnWMPas+l(0#=6tBP*lofnI)$P3ncYMp6T%V0Oksz+bVej)*29h(Su6Q-LZ zcx;=^!WXc*C5Og9bahI%nD?kwZ&nJ~_ZqJ*Yv7-CTK zGJxriwCPN1)=8>Xt?x0bpfwR$-tfph85Cz;9&vK?_r~>e>QIcFpmLH@k; zeJD-yV3xp}*0UA`R)G|y)&)p$_L>+D>Zt#9-5`u#B22U=%0X#%QbS59K+L^TGC7$k zCgK0nkseEv335T=gzcE;@ZxZxN~qm;Q<}oWF)qj8h2g{)IgOz|T!PB_H>LK7=TkEQ zMmA66N`_m6mQuh~=XkE*3af<3Ew0UZ|25vculJa zL##zp%kk`DQtG(cq;}+pbsRQ?2 ztfyi_Vk=bMExSBAP}Q8qoJqU*8%NtBJtHGAsLiW(wqCM5Y-XDKT4jlwAxT*GYok`P z(M#cm)70iOjL@>8GGAb_t50Te*>-Omy>lBigHkj@p-o~vK0PStDf7h8!Xv^kdPlu% zZQeGjC@dXePj*(`USkt&WpNlVQ6FVq^pB@y$~iugz`PaQP}`)ZF}=%HDnm@4rApiE z&}m_U4}Uk}L6FFi&=!-U60UY^vn2QVLqyCMD{y698LiR0W#<8_N)O*%iG!p^a=g|u z6*adP7VYqF8q_u)9x<^6qFByD_$+g|j;LCVovMz+t{-PxQabL3> zybRU*Z{yIHCLIh>6bZIyL$G4_IBObsX-5f+C9^UaFnLQlBjH$>-#BZT|2q)t|#_V}~zjMp;Rrk_cvK5V$PUFTtlgpQNU@1qa_t~>jkPr*hp4x*5vA#8a5AWt#cqq#+BwO@a?ZQR?WJCc#3IIzyON@@t^0S zKI13}zOR%F2I>e&McAGOu++>M(C0E^TpieJfg5(h%iT{QnVgK4d#m*FwBvPTJCo=0KG!DFl<2(& z6*foG&}tRkkwP+;)7@5ScQYD_gY04PksRtUvcK7iS%$L&hJg4bR{jVV$ygqs$UtEd1>lLW~)uthoC^WUHCdaMnv8ZQ)1X{q69hlJqv~+PlSxn#8Gr1_6vamVt#XVif!|*~jweM#a7ZELx5Q6FY6+jL zL5RC53UUyZTUwlWZm7`MV{NmxOmlbYG~Y#@kC5pa&gmzSILgTs+7>f>wxqLGGYmgZ z--^oIQU2?OMAS1Rl(iGptr~&ZA#IqK;V9BxUI*(Y{SZ;I?A;zFOmjRag>-Q+F7qT}n#a%D?F!n6WL>Hm_dbTi=E`QMfcXrr&P+cjjrSGu#H-T2(TU`& zB=Nj$sNk?UoErMtXO?s>j|v+8Y!Q7&d>mNlNrJ0agxbPHVOfGpEH7J%Nt_cz0r6H8 zbJu`Bj{K2ljYdF4v(_EImAxCuVWheu3_r{la4>K77BjKR&*V| zN-p;lAw~&(AZ*e%3IPj!EY{l1z-oY8R^w`HhpEmoWA`RxvpY-7WYx8ZKE(c#02W6t(&E5hD<+q+;t@2HN|XkRcrw_LR0B8CxMaF z{B8F1F~!!w;Hp;A`l!bbGF>0qJ@<@3zm@f(M!ARKMdd!^(D~f;@W@`=#;xiP)W(GI zS_g0nUPdjUl?&v}NMWgxHkaRp&U^5fFRS{3$9se?Z4yNXudZp#6chRm-jWZw(PJ?S z3`$H%B`=y#q@X6pU04cXVC!F;B@@a{Wvg2;v2-ofXNdBk$ZF_mYph9F2s+U8N9om8 zlFkhNrKx6IV#>rDrC#PN$>+eS89r8C>sLFB{|8DywZHl&a`4fau+#|2t3XR6`Biqe z4L6otD(#a>4 zMe7JLY-(cDZh(o<<1eNC%2;ye+v&@%2DM_;r_u@TXKiBzECHH=5arkpiF|XZgU$#{ z9nJ_CV2w2PSB>3w!#5$T*5N}j}h0${O1ae%#mWU6r?7oW11^Wb&_81 zh$C=~UU}L6G9$>F)X7^ZheF=YWuc6dVRo}Og4m!$9^f6L^n9i-MD@v-8C`tv2D0#- zlg^Gl+dQEh-*x-ufF4-fS*UEWgTR|7#)z}~X2}t*7We3P6hX@UVO%!Ow`<|$d%yj| zz0KFQFO033FS?mB&;v$tULfl+7k~5i-PZ3K^%hgw`Ak1^R9ICR#DihCgHoc-uU&NK z(qPpk0a9t@;8s&Jgu=CHLmu9xp?Cr&{j4yoUO*p*c2AT;JZ_se6z*L$yeB>>KOPL1 z$r_Arp-`v&Zp-Qt+P#hVrIPTzIl5qCwJoF;1}-UBU&_`G-cftECkI3ab?Y8-LI|4E zKcbXYKbN3KPlOeJsQMEMQ8IQT^Lce@0HzMg=8q`dzw);4f$gy!f2G30D;wD#??k{Q3*Wj?EySrR?a6zArR^ogB0U?{EfFo1)$pWz~CEhEWg zG3~=4He=S%>KE@JdBnK4pd1jHEiKYavLeaLN`i6gkTgvSNEcP!*J+W}ZJWf+!{UoO z+5J~!$60oQWnW}{cxC4@7FzPE5Oyt{EOc)E@*Rj5?*NyE7t(^Gm=KdA=At-{RSB_k zU6f+C&To-SUpYEFYWtslCM|i9AV@qJ}+TQQ<#sD9NRJLSa24NpX4)?Vfw1 zPimA{NV0xq?tBm#p6dEByy6=Ar#Bkb7nTtwjVIh#|B3|%H|&;h-Kp8)_xi!egq{BY z#Ndf605R(uQsMl6BW|X!LjvUv3Ep}6oDs|%^;180s7-jnFgdHWr*%TH__G@_rTv7j zkWv9-iNs;jmsVR68mnpwoU(x2ogQW%r$dC@c3F2>f|} z_&t2T_&wMS5zTPCdA7zy3d_|&rZ!QWx?3z^cF_U@zB{^`p4rnjVrQ*zx}lf76Yz0SjI_gPQ4N-akC`qPe9J8AP5Kf)63!bO zVc}zDQ=ifk+G&L-6yjRcRGq0cjPkW4m4riVq>-eUnzJ2%oAZxr#(xV~O^Ev%|0g7X zNigeF{`Y?m2*r`54IG9OX`P?c-4TU%Hz-r3r`#UE4^Rs@Pm|!LB_G-VE4`m6R``mJ z3j;5rG;H2@6Y26jQ{f(@)1+?pF%52ei%TTH(w72a;O712q@&O9-#J~&S_Q7hbNiz( zMr0Fppt2_z$Mpqe-E9n3k_D$?Bq_ERA3`BVi*c2}ofZByg~cbmZFzRa5r#k!f*Fb; z)Ka71EW=>)#|XqQ91%fPdXU{_l4_|=Nmr^6!C!iduxZ@qkpcw8oaKV7ypR!~Cg9FX zGqnDZ7=88~2!*_U9(aia#4!w&I!lvbX7oLrlmES=<%Q@OwznBqCT=(v)GMnLM+(V|KXRWP~FbS(+3`qLhnpKkeNwMpx*Z39uZD_=&sIPqphR6J9m$2xJu#|GE>ZCV-#oLnznsC(#D;Ak^*oiIFG3c?tdQZoF|>J za22sUE(&A&ZR*~hX+694?3{L>M_s~|+i-)k(wc<*3Z-yjk2o~xQq}e}Yl3>8KCIE3L;^`pTw11IQ%m2E z&SQ!U{As*}D~--ENh>f3vDv`8l%}bhzfy0qNmjWmmn;$$5Hw0^vC^KfqM~KUkP?ip z&dQC^CbCWQD-`57t`)N$mpVmMIWcDEUS!C4v)5Oz;}Emo1pZh03G`MmA)@~kjqNGr zZy^b!?=RRSsqs{-YE?Q~5St2j|4Wey%)Reb76p@Jkn?jfLP0k2GC^G^h@4#WwH=X+ zrmYol5B%8yS0UFrA4uuhRL*{HJK;W$kp3%=DD51Y+S4rCSXJ+qB>Q73_vBNQVupU| z!ed;98S#l`o{}Kc3i-_TcfsHws?-}(cR|u*#ZhS2)c{_Ch$&UFv)zfYszM2)0RPuiN6$EKe z0G`sNI2~6$y^@q%+MJgnKr7GTj~|boIScy_9=Gp5H1R`_#2~mDiq71I(DRZ7)izBx zPMW0$vN zpXas6;{hM8fgE1?Yr=}SVOVVdtnQUO68Z4EOdB|E=O%ZQkeh6Yb;5)YsdAh;VE0a? z=GZ$tza%V`%29#tp`*%*k@($59cb$wi+%JkDGJzgdC3wQvQTjyj(K-^r#C=}39N#O zRqZremT+2enQVGVdK*Qm$OfK4cT87K;4$@RF*-}iM`R?V65?W&;H6jO2d$Hj%!WB; z@^cHKdXu&E$$4cX3Dw}04~s89Q^VdKIU$!9$phqRG>#%XjY$EgvJ|O|Me>8k`q&G? z`@)y;`%Z0aycVs7^}!-MvyF9FiM`_R|2TbTRDL#pT49N7dRb;SRi-G0?8CNiP=)Z= z$?*BO9C;!xt3rpMqpD)s)&jkX*LXO=Gv-0S5kuUTiB)DZzhh|F%O5k(dVW#DbsIG# zE?ysc5a&8af{p$%z*l~!(df0WO?=j6^2U4QxqE-=_j+ZdhhrW|O5sc!aCRWOW~D!C za{#L<5IVESJvMk+NihZBQx3}q#ynoq&uVE!0C0J=`$!eOSyUPbTvGShYOj`7kQqJ2 znm>_avb6Heh4cYSX3Uhd(4F)v`hNo-`+Ojn)IRxc- zsDiCHdPFAEv!yZj?oIsz$1`DaFs4{uQUafxqU72TVr5HYI;&$(%C}53w-|@xo3J@p z6NhJzNN8z#K`A03N*{Fh-y59HwKYG=(MmPN8jTjG)Y-Dl3fchG%AO)b&Nim}oe zBkdhmJbTTWM2%9WH0_em!dn6&CJxV8f;?P_KD@=N4wL{o{DD#Z-9>#pz>a{hsQm5) zmk&Fpbb_nKgR2KSoRu|mj1H|ExVF-p|G)3o z)5akm;5Pvv)8Mb=UHeeaKd4^$%mp2Npg!fWYusrsQGW23t94(i>zCYEHM>NSxd= zrz743`I}I;h(VMo^%neRgpkAt%lAqtdl|kt&Gv9Tpgf%=bvE@)Q{tU+Lm^E@VocfP z{+7X(?7f0<6IAl#LZ!g`IEamCCab1&jr2~N;qGNvpl_+xga}2h&0nRKr?8F4gq4&; zsZ#Y&;Poy6LxTvc1MlAuIohBXi0UaWSoHF!9#_u-_kz?r#PH_HHEk(2=#rBcvLbvs zRPflS!e3`mw9t4Bj9*phnmpY-G-POmB>DESR-Ss8Do#-7(o8~)cl9QMdb*IVWoRFi8m%EZ zFxIAi-K0`4j${6_+v>B%=?2t>8G)V*zJ?)(u8Pc1Bs`7^=$kguqbi9~81asHIjKyg zE2hZQ&9^z6W0r()>&z`e`wG&TGtUTOdD2u}r~@PqeP*EvE1libm4r%#sfaEkqNiVU z|E%Fi?w$iI$Ey|T1uCw|Yfn7k{u-JnC&W2x`UhsrpEC>lXT{5aFWFA8Jr7|wFv^6S zq$F|byDs-FY|OM-$(sF%K@SiqqoYxbY1%0_k~g1(kxH>}LGIo^$sw#%yEQ+)0{Ro} zTxfGNK!_XB!t>Ls3ohc*G zyyojRy$z+e_-=h@ap$> zLy-#J08$a21q_=GR#N)F%ATFzQlvUz9#RcZLGX?EYFy=B@Pf2)fO)`hyUo|j{v&j= zcayf%hn`Q%_em;UwB`F=(Ykb(PgGuXo==8rk@o`mA|fpql9o-Jwe@x`wScMUqamLM zp{pK)!seP;&i{ZLy?dit?!NJrb1|+16K}uuRj|>n1Ku5j`Mf_Fm5fs{X9WUne4k5* z*@8b9^ZI!3u}6#pxUE=$t4}16OK-{#HYYYSLfR<1I3tkg;=5e}%-GlHyVss)xHwm@ zSfY?##&l537!uAL{uT*!7jdhqKBBR)kzh3P&v@_pb0ut8GrJ|p2mya%H2zTFyvEXi5W*%x?ivbE0>4H2c8*i~suUckX3!g1P@imqCe~mv zGZV}(`80_&Qsix#qOR~w2`8x(%n-HExmb-~veF=+su*ZA}r;m{@lE{CM zNuxgkhyTZl_H)j0l3Pr-+h$5;Y9!y2KXX;yJ5heEIjgzpsl8>$_(izjb>}V;=;8uh zp`s@I98NeSlJL8`30bI04$;uVkNhO$nD9#}*ES8RkhOhc%1i#;C zphI8;)|aHuFfa@p_J71@Z?|$bX(N$1jf9;>ByRkHAqgebWYYRd-C|6(bY{6@Mx4ds zjw^TgV0O-P3rpMrOU^7oNlDzy%4}tn)2J_{B_t>}aV#tOzAFwi6-!^%>A_K%xz#p% zk<&~+dVy33e-ehFaC7wGH-fyc{#bsY6sm}-3Au$Kj#J=ZQObr3{+D9eLZvVU_qEL! z5*>6nD3U^DYCyVH52WntkUPEy6h!EO0*kyC-ubV;VMt7Gh=k65p6=L^TuV!k)m}oGj)ylD>)~_;C0Vd0 zJ`Z~vL^{`|Av^0O%xmi2J!P|NY@n>78Z)} zl=Go-IEf;UM4hM8&LQQI6p}nL_*@kYHyeXlfy1rDVCHz+S-{b4UE4-mM{B!kM;G5~ zy_W}tPQN)5)74|DJoX`2##9J-qj#BZOH_b$T?H}4pQIB=80WMBk(C28#@0?H)6w&z zhEr?FJNLm1G#W~;*AtkQ#OB5my!Rzkc;DW|L`W=Y*@JX_brAS6A;Ff_2W9)seR~DC z3F~hdW$E>ikeqsbVsBSoOPkxg?^ey?RJkdOkP%@h{KOFl_mVj#I}AAi*t5Y zG0j=*zFd_33FwVwVHj$%fRY}#I2{kT&nG?oS@RUvlr3*tE`z;2avF#cWdWtLquc{S z1J>**T~m6jS##WsK}*)u-oP;rwq9O=nmpGQ4=N=0qpX+ftP||@iKYxgC6}q|9~`2pbRcMH%S?jpDM0I$}nu{63+-0zvdmS zU)cGMqb;36im>n8u$mZbiKk-X=*qY|?ggo?RC|xrCAC7;&3L9y?@Q?Lr&l#s9!KF5 zj~K85VIJZGz4(OtR2&@t3yFAjRetwhdUSvbcvYx@GqPo0%h}EwvQ^`W;;AI;>_gD& zc78I*dX4GGX~a+L#Q?^uoP1Uulufqp?!aiITGZ0>d3XWC0{w?-O^o2=7Wyl+%4Aj& zGMSkj`gGO{g03Ov_`MvNM5%nB5B-&UKKj|3i1Ziw0Vv9LnPNEF2%8vry;djkxV%(? zDnDb|(#jN5Y+ht>Y+6*eF{2_zrY@zb)x;vPglf|&?IbBf4?6)&R5o)Jt&OF-Epe8J zJ26IWPRqX1-YkCH2A^=owBYrQwmU#^{Xn{Z}S05-X7s*Lh_ z(eX6pmE&le7_PiY$WuCwXDVTHV7aHVd+8l3U~T4qx06H)Q#x&xH<*BtGoiYJ?)#zB z6(m8WvvWvAsFE9t=rYpx&3D{CYco;Vr^8^&nv=X<`51G&*ZP?Wza0iW01x4vC`4;u zQ3;=-sg;))o^0D*F-$&+h#!Ormz-9#{XUT<===#f0b`ZMb2$x^S=rX?LCpIM1e>gz zV%$TVbCIwmdq3xi454aW@Fsk#V7?T@J`EQB{XZVM2pR579@vV|hRfw~(YS{9@{j<` z+^fM7u<{Vh5`u5GwZu~b*RO&()9mLVzzH5d>(9a>c+u~DnG&~TbK2%&#b6&A9bYc+Pj6J6>41bup9>0)-lU zId-cBt*({^ZkAls7Q%1!cDA9 zcq3WarAR(rBip8ZC_?`VApkpgPzpl;hlj80?P#hj3Yj+O*O;aEtwSyGX&b8qdY`=3 zlw}INXLrI(LRR<=?|g>hWpI45eSb?3AI@2o!m$UnAAS4wt1XtN?`$V0NgrtTX0cjS z&=9pCD(F5B4$DL>eCeh@nK(!M!&L+0hT2=h@T~v&09m1GbQ1J)czAM9@MrIzdL9O& zhE@SXgJId(nk=p|#s(BE z>8^?prK7C>G8?k%=915ZvIRy2@jz+eWY^{p48fU|8|tPMCYNRrGhGi0lB+OT(2M`& zcOI;bQcs%6)0ADL>q>eKHZ#;SyJ9ufizfe7rNvUIN=(dGomVc0Q4Hm3{aPqyhXVtUOK-Nk?@J9EXigs*4+sc!WdymBj(3n+aL7D=RDMrl zb5m|8Cg?{-0nEzRa+?aQlbM!`es*3Or&+^Cn73A)H(>HZ8(rEvzwH_SFOvvWelp?3 z_Oc>d%=s_7|G%U4+ElDU(?B7sha>W{RZyPvEI(q=B=;mBboK3wXptpR1ajr>5O&in z-`A{t|MUkK!lVpqxPnW|QZ;vVOvhYq=qWOT1tW0;LEL9Fyz<0emK+o4j0n0jk^DQ{ zRAvcFr@I)z)^bNaR}Nn4CHPH-<3U&~2#>>Iu{aMF?}L>qWO6Jp-A%~7CHyM5AYSQj z3tj+e!`YfX*UWAKBTtS8Mp$-?2eXcTf?Gg+!MlB1k9?Ik9(fQdaD z{BPIij<|LdM`E2*TXBRbb2BkP3JZke^?MxyXL`mw064(oZ!SJ^HvmBiB$>m^>|#~Z zd|>R(YkebaUtJJeOSM>BhGQb(3x)d--SH18Hf}G3E0{?UH8=zBtEW~Xl`xDT`DR|o zwS$sSiD&FD;MT&3tvAOG%MV`blTRV?kqM;{1}@#2AZ28wO6o8gNW-z+%}>kFA$lE} z*gjZ}1@7uSz4P6NZ(^#%Gj^c*PKOiN@eZJxw!Kn7#}Iog{^CNbqW z0sQF@dM&wY&9)_~AQC4RsG~)z_&jNrB0NwNoRXy%#hT5$3b>H03|x5c8D-LR8$t@qoi1ulZ*$nH|8*!S>XSdD2TIr~V#jj@;}4eLFcF_O*ag84Zlg_csT(MDD2^fpQyr0;6+$SG`yVyC_r8HV9iM97&b z+6+O;1kf>EF&ab4S;bO~Y5OmCY#e;dBMFk|-rCn4J9tx)AY~Xpa+YVz1K(BzSF(~K z3o!;>(0oM$+C^CNu^n4GBq{sl1a_R*Al}xe{3>s}`~VPFB6m3xSGOa1X9IWZKi=N) z9gQc44$4M*?tNWphZGb;joj!gW!vJmdBC@S&mFj0pO73Y!DVV`=wifMwgVLko0O(WaD`x&T!X>hg`bk)3qwGA-N^bgbVRTIkjq9KOx7y-szha?c2pPIR}-M@ELSKfOqEX%&E%#`PM*!K@Si-jl6M5E zmgCS@64KJGbSwh3RRkSg;XmqE<2|u^_U&O0ptirIr5M~Y6Vg)rK{@mcT?lpi6b=rj z-wz~BjtofyC&N_NuOO~BUtd1*#&`IP>+-_NYm)2zk77N-GSB=^($Y`9kI(u}eX+`Q zOLDvanRj{TEt`TFkHFlBjn+ad+gG&v)gfedn^Fc@ZAO*{-NnWcP94mJC&m{b?pJy6?@waa6dXaaB)6c zS%gzWYZwK|tp%&RVSTeZ#-%|0p~fcir@S>;EI~5?t!+Urm)M9O;a|H5W?!~+T03ErP!E37X`2Rcx*}! z<7f{^9A_=G@N^1*@@l(}-%XfEY|KfC%N8R}cu$A7lz>`x1Kh)hhTX&Ib9aZ9QypL| zioglE;Rd*GtQ)m`#YD+LXCk$N?Yr~<_wbV8)xv;7!lH@Ake2=LfxWg_&rE3MDM595 zRW+r;{`gU(#0*DO5ewUGvy_G7taExggT3gh%_JpAaG8p~!ezkikB>!&P4MqYL^e`; zu?VJB+Qv18xu>`RZZEefo(rnitE!{UcXRD(gv0`muDS<|*1H5|kQH1r^g??if0f9E z%4kLSVoHgg(=(~VJ#G5X^tQO_@DGHlty&P7RuB`6x#`tKhsm;Wn=omr;%jbz`?w>- z(Nxo-$frvU=+cC~_Bn5$Nt|>!s%Y+5jG1Yc3E~W1x^-ttX!Y97^()qw$bOx|7EaBX z#Vec;7wQffJ{|!Q&0|E#NeZv1IXiW_d-~3_owESLmgt1&kE`XG%C|OCaR!LUa~&0H z?UBdSGlX zSPgF$wUfD54-`C46on}McnrG6q+!2G2PU`q6<;`c!3}U9IeEnGotm99-93Fn+J@PH z5euWCJ!B{!x&PG65Jo8)w?NL_kc*+7qn>8A*}?X+39!k%*yu6d?!0X_H@fkO;U+Hg zKxymh_IXC~g*IU^YtD|w2wcvTRy<+QlYt3RSRov52q0#=d;327zP!h)VG=VuT8+M_ zRRwz1_k@UfB#_ulRaZm9`Ce(7?s=+Qph>q(u<0h4Qwj}N)oIq?T&;Fe&D7DTfPrbV zdsHQKg&tp)FnQW=k9zZSKCX0f8Mvi_sS(s=lqnN9Y$bov%})PH^x>`ZN5WeIKogA* z{m7bEt7weqN?eEdGX(zY`n?4Iw9nvG2$f(uLIq6;<4xru^hw0j<$MbA|?9GE`Bn(39TC6eZqmdB~piBHL?iak|Lja(skGanNgbZFl+Q%i^?Rd0|X0 zF&()M=m`5xFEzW-(@cX2VY4QtKphdEfc#h<*_Xs+gp@~>n z*lNy|ub)@o5ME5({eQ{-L=Vwf;uId3b7=PMx|{Z!$34f@cJ-^;8P`2y2l}W-0<~dr z%#28-m|mRR-8FL>_6UsqshOprahX5Ri2M`(UULIVJ8w-9CPCt&O|XpwyFrO`NR`Dz zJ?2Pn`!E?8FV!aMWoi++?&(JecD|eUW&WxR>qx+14SR1<7LnJOK9mDn*iNNUZvwZE zJBO@)WW`<&TU`iU1x*dFd~4uBSM|OVWoG7tgdHq|uFY6&{FJpn3vMhpF|oa?G<%o1 zs|YKPnbw{}ju!`^Cr0hshqxu=Ni*YLdg76?#j2;m@82lY3Gp z9<97IQgv7nqhWM@SQdVZ(3R?)IWR2r2urd{)*kwUvg#~ZLs3xQ8TMYM@#r4Hu$R$Q zBy-DFrmghJ=+VqP-=d5nFTX{+wNFuB%fR}d`n?aD@RekEBPT>1n{r|9z|kM7s0Hs= zW!&Q4o<7{u8GOk)YQwtPFP{I0q)|eZcnC8GnjKhvyr;s>tHbW!njbv$NMP+WRe%<# zU^ndPc27m}+gYxma}&NNOK*6`6Wqf#cbmouj1U1m3AUeXPf{RD;#I{2-5>uf*-nPU z3pEN|f=Ym?dwQ!!m*uFd7gKZoHW8>Ha~iw;_ysXVC()V>DWy>|bxE`$30Ec+qVr>P z=IQ3cneh0mX|C>D5(S&qwkl7vKvyo2G$e^9fTk;Dwm_(DoIA^B&q8H_cw%d9!nM z#K8IrmQM@`-Cr$=D4YPX7YgQI0RHLz^FS7D`lFFt)kpDqWXQhar03)cub-v+_POuF z^P!W{dR%T-&;5x4#>n%wM>%Y>1)9w#T<=rQ!=0W;vgCdrpl{JW zZ$w*s4KY>xZFpVh=FYZ=gQ#hxLkD3#iNoWqXp(}59=UaA!*w9#bb~By*zlYI*v?Si z_K1Vn$r0UH1Al_&rsy@X*-`V`>#qUN3;M4&*ZUp2{MN6i52e4|r%>~ExvN$GKI%wq zNs|oRbOYSi2eB>fsY}k?mKr4teVFumiul6@S1^qc-B>*@WJ@!Fv<+uO@;MfyfZXw| z39TC0vS_@AB+w(r;8;L=*SQ`{peokz-d`16XG*Dw)(sCY9zo~H2igeXSU+khWoh7V z-oRB82)+q)cC`jIh2#_%#~J-EUuwMbZzL-05~yNoeM4+C%UTU0rf5fy(wsHd)zzlFp$^Dl76Rjk4)6nN$Q2uaXjjqvobs;h`{R9yY zMt_PDkxglNdF_Fzg}FtNOneu*>$&eXWe~yGLQl(%nO2le9yHlnVy(vNXswypph4%R zdP&_qcoSKvDW=N}*wO?!xlE-iqQo=PBNcJ9Oj$%?Zqay!T9m@lV-nU9vDY5{obc2j z)OanJvr5RUUGJK3)l*xL!u+WG9QoQ6!QY?sT(j=p85Uqs@HHE4 z4AP`$GhRONitkiwvLpi6?;3I6PG60*Am|U*Vbh8+U&yFgkM1WVu_ZBiW?4N!6I&j! zpI7ytA@ZF}Z8i+_b}Of{xF&&Kz4Duwy3b}d_NQ&^z$9I0ZRhO>%j2UCjO5ag-H zF5j5+sC1vq_J#WI>TiR-%7x}-N{fF;4gbEzk<>ekMh2rA zy+ZL#8s*M!VQ6_AD+&5L+Icu1lbDzb+jN>3XPOywpP?YBN>#baN;IK;Wt&kO!Q}pl zK_tW|3cUfvVYx|V88W{in7;xpS?zC|umIAIwKWc^UQY!ABOe2SPp*E1Tfx1-d%ilk z9Tqwe>NPyH8sX;Tvl^fLB1Y0g3*cSv$7{nHZGTL1SDd|NrqyYdvEloShblR--nYKe zz))aXUd#_Nt0UpQhh7ICriMmoW7H~D=*am2D!Cx%W-q3%pKQ1zywI`Yn?P{oD*`= z4mnjZ?(MS&SePmxZaB4vKsxzf`bAKmFrzpCVL#{l=1ScC!JSJ$MajH*~WT?phuEQTwg*wZtiwB&T{z*+;;TkC_F8xI_aVQ4ZO%N?RT># zppI3vKsXk8TLV-kWLrgc1YeR3Izz2-eq+cA#FJpC0#G0*2=yIRaIVHCOJ>WV%g|LJ zqYOS=>Oh+%q8xzSK`0QQfe-W-732KmJZM}Cutwc*uR=hk9aPHDAXk8`yr*(5gb zk31-5el+v)VtNHEX8*3}LWe?w-}G;q&AU9bHbeWDJxCxf2Pd;xY07w3x`|f|;~6B| zY}?wVwPn~cBpLTggxI{HO1#v-6i3*1yqb$C(4t5(x1s_Soo@IQlSq4r;@plmrmoG+ za>sz+h+Pulcj6&PXr{jhdrc_kwzi*;r@7KjEs>T702f!ek5qx{L}h`%MKzyxtt9p* znlxnd!F;#(d7-xFgZpRCI`@HFpt3+}x}h=MSR0ich%BAeUNNJ1{xV;bJa?|UqJ7Vj zal3A(b*d+l8Hzf!L0TB4G>{w;DcPYi*rFtfwrGWsPy(+f4ZljyTs-V%e1iE6()$B4 zR^Bs&l7oQZFz4*>U~L;ZSIuk8Xk@QUt7zmXtX%sns!(5(ech&k&326S@8xo2bVNC2^C|m61hLuvXpcUl8e!^VhJWsDvCvu zg9}feMp6=~*efi&7WZMIPTaB<^27CSIAw@N(9xDJQgXe3U}dp6C4-k6wh&vja4n2+ zP6)K8nlrI zU`v(Q@5pFehf@F6D{J2Ct9I4+@xIkg3!KMKLTQy}H&&jysJ10a~B9bw+M&rkskZ6Wj^0Rk^K*00ZnP7@?5xZ8KwW=d%&e^^+u~y@oV^-Kifsy1lvT4hphN=KYuTdV?@f3 zatbx_sZ&3pDRSy!hJu-65|to?!W`7!q{^-DqY=`MWh7ko{QWeqjsb;24OVFSZ-`~U z=W#~&bzpO6NqhyS2}gY!MQkKyT$MgK4&}&FgCCV`!EMc~pBsI@Y+8O)<4|(`-5SO= zzhhWbQ4FI9g{)=7)ILX`iWo6l-=|_2wYzfuYuucP+q!c6RqHUQI=>WFJs-3vzs!sI zT{XM%UDi+%mDtvf{n5e&QaGW2j0O7_=nKj0G6QV2$>qtNki)2&j|WIHoV2F4J>u0$ z&BszCItY{lYH~H5^nzy8PM=X_=!+ zgufMcs0M{ePLx8FmRV;yB^t_yDNUDn26nOfC{U^4Dmbsj#{+fCDFzen^c++I;M0Y! z&ZrmJkpl}HQu@Gwk7QJQ!5-R8SxbN$c!PSubD|{!R>8VgRX|lD{I0Aa0iF%97hzh= zjtrTu0`{ovpoM2MTk;uL8S}kyf@#Klw2Wq5S`9H~YE4Mc$T*{g3cL{Qh~0+Bp1SUysp3Y>!C=^WqqjEuGJNUhpo8 zNlc#xFvkOL2j53!6Jpt9*dZw!%!%v+$zr6MVz96on1WPO6a#kaWV6ql1W0V{a7SBk z%=;G>`CN6I9UEXZ3!($+;r*Vui};OXjG~#r#@VpB{v1`C?)A-&+Ec*|1u`R0 z=0Fc93p>C9Cqx5W@IZwSQmBJo0u8282`kc|MLy*<4SkIGdB1P9-k~>y%=$8bTLTYi z;_X=4P?zNGNH3L>rr5KSnez-XE(IeHz>X0yIMh2TTC9zJ&g|2?Ij?q)|6fS)#}V3n z71PMY(TdC$bX4Zc{*1Chs_T|=eUEjUwLlmt*AdNpR@L|4@+Fo8W4sy--8Bc2=kl4V zfi^TJ`;7By%8n3lSI!3J+eaO?JCD+0nU8;0gZzHXPfv$s%;E(qKO77X>Qu8 zvUlasLfZ%QW900KHSE$cp<^6>ogQocb2fJ8ujr=oJ0zOYOQPGRJTF#A@M+0ZlJ`{= zVSn=AHBz1rzUwJC?EUjAIPErhB}Mhwy>OyNcfF!qSE7r-A>Geg_XUtMZOsx!ZSeAQ zrUyQlc~A<^`)lvB8XI0fjy*)9xA(^2s18!ZT*JDH8ZM* z&&dYCg{9EFkQMsDJAh-^2cKH=C&|Gce4 z7XK^m>_69T{2xN^U%mfb|0sVd#PcFXFFJ>*_rn-4^a0Ud@L216q5C%g-2HLsNbA4* z|KUG31HfrMEP7-30r)$QuKR51&LhKl*@SFd>}*-wPV@l1x+)i4-z}dgAYk<$`Oa?f=>%I(lbk{Wv zcn)1b^6h!SHKSrLEE{iw5S+v+SA8q!I@7s@=RbS2?oPE5m(lj`%*x=v~~~ z1KPm1bsiY-X>I1NWz){JuH*YtT{8(TS=N)DrSGUEd&{4~a;$U-DQ|T(A9m9jwl;QV zRJ>Sr%kWx~ZFkT&dE>);-|{23-XfoS{3HL~-B0qfFK4UqXYm<&$;mk(?gk0Aq)R~i z#tI5?TNbeGL?J+BAT8EgQX_MVo2BHkl-R!oI^>tsE7yRJl5R7^JVbm0ci#u3T2VV8 zY+w=MF6wb{Yc)WTnm>t)d4S*Ko0#6<06G3~s=Z}LK3Myr(`=1g?^L^~&=1ypcqG(1 z3}u~qZLOvNKa<>U=2stup_R1-_g%x*49FSk?DAr);kq(wV^CL{lFb~vsD8EoLx#5! zgBHMj_`d*Rsm5Cy>)F;SdieCzwO^N;9#z&(a@o8xcDf~fj(XrkT)FL6thxoN(J1xU zIc6ugFXv#WM#Ut5N_wVe#lO00>Cnlhd%m}> zUFrJwW)F=#uFzPj(9tOI(|GJvn`_re9w9{5rMXUWB29|E{4d!k%_EjzB(lEiP`T~} z6VckdM6%u(66F|gDvQO8MAmne+Z<_Ycz8+JKT2vbz@cSgPbw|tr1y^Z3@tSq z8LE+cHvB%T(@l;u+ZFOFzowGax;Jvz%EPkg^1xLd~j(IQT-c$uer)v>?wEYM~-a;3~oS5?($^kHHg(`6Kp z%`BAw()CxWs+=Z1`#KzX@4}MgXX{1F8|)~?7!@I&R;_E5G@8|eeZ|RWuf2bWuwSqDfB?~rG`hc zW+?5=-Hf|zK>{(>v$Z(Ia-cc1h_5Zw6+bXq>O~S5$c&W6s=wSE-B4{b{Y|{cR(~LK z{N}#HH+u#xb4K3=K{HB|m0OeNzxgZA>M;NMJhg^8gptkC-j7{`_JmG5Bidof{I>>M zSQ$>|hS_n!m!)XL47Wqy3Ui0h_DzRwG#WGhf!V3Q>PyY4hkm*Xs#6pet923wRC^m@ zF$Z#C67_GP;p7hGFJCnFQ~CQV>I`0b*ETcM>X9FF1~*XAprT*Lvp$XvKpRtOfkL>F zaQ|A=nM3hzQhXEl%Tr_iWjsT*C0V9&pEuBv_tEMYzo2rGt}FO1;&1d`Ns*^|6Z?7u z>=L8E5vd?jF^GyPL?kJhN@M8i4LDr< z@{bWGASgznB^4c})^pr}%x!&_&x-2P%K9j(EQfYSLp!PK zzuMd(?@Dh!o_Js5MY;P-Zy%QjR(kiiJhWbT;p^{b-+ke@JarEJae2Ww_JN5KVXXJ5E0b&{TY&1R|km2q=#SC}V3n{^N&jst6oXICPSNzHXuZ{a!;i z)c6fnVPrKLt*yI%XRD}LwmK**8cJ*NwS~H3iGj>WX{`F4?muNEM-<~%_YpqWEd_mm z3@Tb}Mvc^B0@dJ^nxe<%t7b>s>w3hMv2YZlBU?LX#f3JVHI%d~R=?(V1h*Q;S3o=p zlcDOCPAdG*M$rM~OdkD4uPCeU=tDr5aiLe=%U1v$l2lUmC1-ZZukuo|g}N4;VGI0}i< z+|f*?@UU{#Y0YR&idND(T0i_O6B>pmA=s*Z(N$O)O=L_|DTFL z|Bss2^lJ1BBNJaT9bf&|J=8XCTMis`4fx$Ecy%cqqm8lJ=-aw_18dqzy>w2^L_0B7 z*KSt1Y(7N_DQ;9lzDuGJHSGCP38Zv90x4scKw~+@ayAm;1U7i!ffX}A5Pnz4KHw`E z8eg8kSbs^?55!g@BY`F<6^h11KnBzp!d8t}h4a&XUh;0`6#<>i4b^{y_rQiM0uK`Z zhZMTK+82b_098P$zeOYO*+i4u?#a)rehbBlWZaYgvBHYK$__yPodE!V?!aCbK*4BW zXbfs0X^@#ZMB{dTU;6h$g#gFPzMd`!wIGd9Ez|%rdLleZC6b63&H?4%2*K|n3=KO7 zHP}7x!AOhj9hqt3z1^IHWcgJ}LmOCl9j3}sLdX`;jSrvyLvt87K+Z!)>(N;`y2c2C zBXWaC(khJylVTG8jzz$8!BsaT{id^5dKVD-;Ty z3>c!N93Vm^ag-j}!zA_oLF(j@Q0?uS*Z%7~1?^cUv zB0}?AJ*!0A=wL~Ed1K{KPycvJuv<x0u`Ij-sJu<_5!}Hy@Uw>*1K8Nh=zOxyau310U}QbaDd*W!&m-br zA>tPJZxDF{<9+xHzC=F|B+A8WK}ot%^&a@-2^Yo^2q7Dex&>zZ5C{!EO*^t(t6f?R zsJOSq`$74qZp)F-s*jcqF`dM>jdiw(v;A?lO7^S4%rRMFRveg-HB#bi@5v)ZU~y@D zY(^u~y}6gc=u8V7nCgyiQoKJlGDQ?ug;;nLfRt z(8FgT&D;AT`q`t=s#j(7;p?Hvmj_9ESZbM@4&`Pngp)SHy-{j;U_%)B!8%DcuAVrP z8+?K{e|90{na%v}j4=#<%tXizPGZj&8^n8soH0m9VvH>zQxRKV%cXw$ggC6++?b&} zbj-@xjlCfua~^sI(@@eZdFwraP*w!Iq_4eeCrM1+0i7*@E; zo#m@;LVvV~rM0W*Kh-CoN>fMvy$urjfBNXYx1-Hk8V>Lc6hn;Re}GPj59_60;zU(6^(zCQVF^lT z+KL_QeUH*EDMcD-q?yF`vPHiZMy`}Lo1-i?1ApTLba`fx zcXAU1>C97#^>~lI5f+E_o zNyQ=&d-au*3-`evSz2{~Q=QkX%}|D#UqzsJFM()r5pP(3c^9Jn(sZ{Nl2X!Yr+&!R z6bM|>g>(Nbw1{$3D@+?6p z1A2m_P~Xt{U_{ZV_L|gbaaKpj9r?0euALj3PZ9m87!UFM+OuHAMA=Cc028>WMoW%VX2EG~m<+aw1}d z>=>~)#Uz1`cG?g7`vQV#G$QhNv)m}-pn*ho$!&rVLn3thO&~8Pr>dW0_JahPp?Q(DneFgR?UjT(z=!(Q->e0BaUZk0WQ~FGCs)&ZI%{dvv0wVPoFR9O1 z=P^4?nhDsG?nfK5oy1e7d?ocrd)2r>nvjAsZQ<_}r8&K~Q@mlpG&7;tarDFs18Ym( zF4s#b&_5*&OUJ|{jL>9EZ0Gmi89OTd-{fy#i~0@!%13u&De>UQ?toF{r;HT)_Hwsx5AXkk11+p&$^RL#$FI zN`E^y1rg}TFJ%iAqp8^V9L9|ya6sgLcl3fp0ZL=c1NfhL$dIw@j6=W=~ zco_S0Art|bm2fyOCqhq`F^*>;QSbbVT+@4*B5|&VU!wme(N&63b)_hwtrpP(umSSljozQd+bz#9X%CY6S57K_vOKt z1HWPzLzzO|P>o8)qFOFp=Z=sIaEw~<^Wj@LNYIiS863nx9HhgAP7L24w0LbAAnF`C zIC7k}=)fs(Iphxt@PJsqp{GfuF_U({%}J%Z z4v5`MlW6pZPgCgvc9d{N0XBQlXjmv(Fqr}Sd8kmhSm{t&k0o-0{^(G9qiHV?I)g6m z^azY}mbC?yy%dO9O49d>-E_I%jaAzHTUGw3`Xd_c@7|=gMk*uq;pVm`0{Z9==Z+Z1 zQjAij2Zcw%5oJqdR>eTPDf1rOE%eGDI^YJwKXG4()Ln3|L^dg68n=)7jn*5n$JJr( zZ=&}A000000Lv0AQc_8kfO&KVAOu}-@?U^?z2d$2G`>jR7j~WsM;LGq_lFAJ7|`py zxQjx(ZVfD*aT@fYq~-v_vP%f+-l$%hK)l@9SRVH-Dj7%JTr*M8aP^d+QNmSCJ||O?0yq;Xgl0wI#)O{{ zzK$s^x`b|SljLw46q~ytabCg^AV7csK@^~-375 z+`GM&lR3!hMLfA$Y&r$q3+nXc9C5uh+ZfogZHJXWp5ncqO&!h$PT2okP_ z`(S_=F-_{pU2Smo8IYe@VZAo0CRJ0M=W`N3rW74S$|A+`bKE2Jkq$_}8cDTIUpMu{ zvh{ONl!-c5aI(I(VUi=EQccoeL#->+O-(Ct?*KoA%_%Ys3vTwHGULq{uj+HoI)IIu z0VI>l>{-3p2ju^C*F4hOJ!_t`novLzWIfYIuvk2^ffWpV1tBVos9ZCMpge&?=Yqvo zv?}MIm*#HUefx=nr2iUM)T)*fdI42CI5~v(yf%52cGe&TtwmtilczK+n0ZHGEgCqp z{8%$5*QKAMQg15}C7NI8$0a;vI$-$7aHS_LO_HpTV>P>CyN9<&m*E{4;E{Kp=8z{P zJBlx+*eyk>SGXm(bFoOQ3XPj#!p184>iSnq6l4DY_5x#x`2qmkY;oggWM=!@TCb>F z_+*|8s2v#OExUTH-PHf%C~u|Z{(cW4+wrk!G!dm1NJRLY9gi7O0Gd+Pn|E@ehtVPd z)D_7Rbp00N4TEkYNC3l(7ltMB z`kH`Kzml+s?u5{JoJ2p62*+ct#1qFy5^dKf%Bz2SKljsn>v)BIt7-j*RbMs@V1kBm z+F{JP3|z#mjh_PpwgzYfawN{$ub_hxkDKtBF}>GcqaT*wMUfG}rVki*AGUJ`8K&=_ z&E5b?Iw%Riiz2Pjrn{^Ss>7hz3@kOC!J1lyqFtUI(*Br$QJRSeFv$lU-rEgnd+6 z@~!2MjiV7c_(w>|OeQ&{3jQLeh@iqK^96Ukz?%WkBl= z=MtqNM#EIBCeg(B7dAjZ-U%;oI+DB|bbNHLNx>(S_Y&05+F3w$&Q57yZSo%U)Z?V) zX(K6&ty4^kI(nK}A@%kE^$h1SszcLM!b0@>1`!`26(@AbB05KizZvA3Ib*g!q&oouW5-~X zEEqR%4g84C^?;&j=sY_`@~__pJU<%hMfV>ewwt1+@5W~TQIi1}DLGVzP$150=|A56 zx7jQ8o=elK^USL$)o8qo&&q<@uY23#KhwpOYFkqq8%9f7AjVuw!C`PIYmB9;=j&i~*$9biqWnfO#ENRP3a9jfvz=sk6;|XAor*NB9#*gW) zF$OS9$uT4f3x-OjYa}SC#A+F=DIFLZ_>ZPvVKo^~lUKFHI*G|?++_w>Pn=vBI?}y1 zVbwUuX0R1-#aYQ@hJt572ZZU=a4ShI-?ugwM}RW_TxzimC`xm(NaYawHISW9gOrfS z!7C2|uBT=Nr;B8hlltSNG`N`}Q6iCroOxe~KdSNX)TV=Qdt<(+5Wxa23)7``o{4Zu zNPsN*BK;@aCe6vkV?NweyEK|?61$^$)ohzMZyy>ls?|mn0zABn$6inyT5EF=)I?ZQ zn}LY9;a=@}_TAx;BZpN#`<-afJ)a1SB=MIb+LcfK`QOwa>$njoC_C;y){589H%Lry z%VqZD+lhk`St7pf4B~JoN*+bYZ<>{!l6(}d25rtSBkD)fFNB^&j}Z1kWZ{X0PG&O} zyyW3M$uQqEJmuSH_W81@*qAUZx9ZP^Lgsr#W%Ui4?DT-rY)}7NGUHH17&ap<;JNyN zak4(7u4J{s5QrPT-cLx(LfAMRLB>lEp`r9p*Tjdfz&Sa1GKOJ_VlmcHqTI2>NFpVb z@}Jt)S}HIrYwP2*W)e1mJ6fA7+Pa_WpxD=qWiz=&ATDKH1O=3pco|f~CdS zs@X7IUlixP(u8>?{6XgF;TD&e{xj%Ug8SzEurklC;%S*9l_y!G`jG-$6byp*?Z5sL z_zIW@TCz7Xm;PCOJH~L`zE2;G@py3g#3UQ`qxgr+Elqg`6~QiyBk+jNi6ZrEGzSgu zABQcrXs|T0$#3hJv8J7;88BGgX`>?AuEK6ZQ7ii@(0F+|0)4~6qbQOEtX^b0g9+RN zkAM&*3Um8*JIv=q!pUBk0~^qNKT(w%XsyiOuw=NGIa->r8I$%WQM(Ea|Db!^g8%D?s+pN~6@Xu%l;!X1$8I>LP;vBJD z`ORCS)pk_sa2(`o%jsL0_3@pVWwsST9XIA38DZBWk6@iU@>YQPh2~3DkDHuI&qGo% z^l?@0K>ptYn;geV+lmmCizdUko&`RjZ6V`;C3V2_{i@&fhyLu4i@0OC*u*g~e3KSA zFfN~Wrz=VHSzYrDpG2MsYK*~PFgts^<($f5=0E$(DGk$T6II)jCUa!mEIAlOysuav zX3(HPgMR;rrWPB~Zdjwco4Q(BO#O{L9m*)9%w?t5iH0ozF<(etxy1w&wBj)jSvK7o zvWTb(RMpGf`?6jSqHt=0a0;7e7z)XxtR^;r#Kuyv9dq^PeO7Yx*kGQi`PQiyHPbe% zz)@mh$d{A!homxBfKaeW3iRe>(Q~s+9f^-?lc%1EY&QI1wX){y5!x1l!^Cur68<%8 z=?#tbfCGfKcU%Ff<_vs)NIcW_j-DU0KuTHGefl;Ld=!t-ie8Vkq*F?cJOb}xK%wb5 zPu`30X~h@ueanu}lXB)^BA?FE?IzU2pYUN*G7luafV3}3plB6n=jcXi&fAe|3BW#Txm}Wq`Y4EnSN-?g!9K;G!OOx~JhL=!{!Q7D;)|ZA?6sc3XII|Iww2O0on)JZpK2DK1M(IP#;=|DVFwgiCV8A|}B8G8A>2W|it6RPt0M z!qLg7qKYaqWXLF!0(KdV`wACcNdcpfAw!0YTG8yq8{tiHIIPBafdmO~b_J*pl}Y!! zTn_H%)qbE|Q72GHA#oHZSd{iFOh+xdXa%3VNf@b%?PMb~7LiJMq!1Cc=<7jJVu7Tq zi=?L?vS|!EJjB40rp{8*goSO2O>P+}X?38U8LiS?a0xsAE~`G-P#f#hg{7d1m{}Ul zJ~cr)f`CN2#;Fhu6|QK_BvOZrDh#WsVjVN%?Cxox^1W@-p@dqOe5U7I+MhTISITHA ziy{veA1{g(oVBK4fFZ`@OA_)LC4O_acgb}mzoo4@>EpYSG|49)*5=d1;H+t|3J(4t zg~H86q_~O}jq&A8aW4)xG@H-s33n)0%J6ByS z$PFl8Jsk45tp)urMAYKU;X;;nM(&nONWH`u}CX|Nh?r$4I{4<%q%i*mvWZVm_eo*Kels zF(5tUmVtS!FvxRb9czd0ad7a6I~Ny}vuY$QUmMo!q zWM#E}%k%?l`SQiS#hKZ;lv=V=M2YE7OFGASlk6jxd~)5N0DcLZJHfq};ayfOeO0+S zW&*aAL5Z;d_rh&eGu07U$pS~@%B>EAqaFyR60i^AEPAQ}SLc^ z&vjl3SvzbkNUO{T3Y~(?mQ70g>$(;PEgz_}e6|!GU}LWc*~*(j@rk1D?PkmJ>=(P< zsEkvQx|~z{vE9S$qn(6H^oj`!bi2hgsa&>UciePoI_`(dB&OgbO4eT~R4O^*cd&jZ zrNh3zL6p}}n>sz^5(0rx!sy8?lyaSII3A;1pxh)|PPk85R3dXsO$dSu&K?ZO#047E z{}tIooCy$ItdEkU%%gg}+EsvLQFvSxzx)xMu$?&B0@bA(zY+WJ6+%5XBap-7&Md{0 zy)rGN3ReJiMyCK-;@lt<@jDgSPhHgk;1s|*rHtGi#LOr_!{jX+Clo{oZ*_WG?d^I! z>+lJwDcGgly21oIh+i|>)I;h@y7ac*k(Xutf!Bz(mK#~@7(7#W`ak;{ zA>3n?T{R~agUlpA-X|!B)CCYtf{_!}V8Vn+<~!*J84>iB%9;odOS99hQ??uP7+J@h zzw5!URtQz(ZX=pLCwPS45MSM>cge>R&B`gbdQtC@PwdSaWUHHgSTJDT7BLjlbOq$*Rx3ZOgU=+t&k z@aWj7^FBjEZNPw8)#(m`yhq#{0sJLX0ZhX6y#36hfeHhT!izM)YGS`T}Bh0j2}T;JvFuo{tyisNDb z8j;r^jo5B#jach>@o-tAY|L2gf@1fy%nn(Z@H-kbn4bFX@}~W zTR$k8(}BXTqDoSIU2!K)&_GmY+zfxB#Lz}}GFu$C`+{0LhD|Lv5r#cySk}ekOzR(2 z%kI|BZD(Y@$#3Q9)rowxnaZbEe_G)zW5dmk>UW`wK%2ysV{FS9Tp?KHn==&eyTAx| zYHA9!NEVs8?aM@TwSz%7p@P=h%;IFRGM(t}7NPly3(J=mq!}NIwhA`t;9+1_v=-mX z5w7(+f&83R0uBU((o_Z|T6rb#*u$-ivsmEF3*3-!qs4WKT*wQSH(GeVi%KZQCR(as zAv%6P92g@`3d0}x3V>5(l|w&JG>cg!_Xx^ga11y5l3iU4Tc=zr6S@R~De7TaV`x?#edxREG*?{C)}OS& zx99BXTJ-hioHSvaef2rhPn^rAiA^yGxr@qq!BSTH5^r#;_L^tUzNem@e9*++_k~aK zM<*Dht2)+x{!Cx8oQ1VKi|3Y=OMIJ7lj#gGxTZlM(1)?>X6rV5LMaY2MNaD={!v;zbXK3VsQ!7AnmK>^_z0Ri-NA9sukyKgYsJjJ1^UZr& z0za8KsI;6%VGTABo5>mO_T~D0{KLYKeCzO0P?`a!S-nn=!1Q8P801T34>{;w%@W@TwdXR}90!ixP=3 zgE$;ae*Zg3NL;3|wMXhX_&bec1N%6ObI}!xSc)1oYO3wM8=S_&xEMWUw?l;r6{?(I zCf$SA?5* zi0-eF$`C$;jj`B<-c?k{Jd?x43le^x1zx<2!vWtUYA_eBm9h4V_XNmhISY(NRdo< zR@f_x8wCM;5lcltn+vDwF%bh*tz6ElMv-sM_RKQirB$jKaVYdz;VlG2OED=eb~zUk z+FXV-N!DHTc+E1bJou7%*fAGe=JCket3F;a+kMiv<{`(#3jSX>Z|~eB6~CihJ3y6( zQWzB^s+o(#ye8a2C{cR4I`V=kzXPFxS zImuT%CV_kI3c%+I=;m?3T^&U7oXW?z2LjaOtFOiXc=nIYu=Ex)E@|(P7^(e0BSUqx zr|*U2diC^rtl6@#;Tdg{b^?d6?`1?S6C=E5-xxRwK2ffj_b3!p)_{ z!I<n~!%s)Lno|GYjnBcH;VME(*>WDMe1SzJ~Y z+m+2YT1Y-+c_M@pS|^>v^OMX>-_Pp#2Q{n67BVs@s`gD>=nhy6k%e$7DF;Lz=pU(v zsF3zI)Y+&0W%WTTpCbJ{c#OGoReH(v_Yl1Zs#l82x@m(J!6N-lV}(980H-mX_a(-e z2mc&jU-W6?Db;{SFYhY3q$T4+g;C^Qyo8|g2ozmjA~Q7$4);bKQ_B&hDY>>g^8i1( zkK1w(QkukZSU^~1N|SA40099Bw%H6v?Ipe6>d4V=>MNdTvyW~maRM~yOwP`7TA_*c zN(&4Yx{IEY6j246EmL8pWX1qq>pcp%3wbT+MPsFG810c%s9{;T2s+3V>2%TQjp{yA zGqsx{HZi>LOPxNctmmjEFn-v2S$A?eOdbeTDW&iCg;J`l$F4YjxqC_4xI8#ONT04<(tK`9P-Gb= zEyT};dXqSzI;{%)y1x5zd!U;~U#>_(^XSp<8Us^z_3?tK+tYOqaeLQA&jOL6FIGH2 z1GA*5ls#5Tt@}BkXC~{^WbHxWB#(4TI&u4;v&r5_MEO8XGu}w%R+>A&AVW7l2=OO? z?kl!oE?5b`15P2l?^__&VI(^zCaCab*D5Y`k= ziN3<_wrz7=)0Jw`J;;IxfZJ@)n*0H5ajXrq^sb!OnlP2lN?t+0Se;~xUG*4w^LC=i z@vGsjD_uOdB|E zir2I&@3%Rt)(>7AKXmx_blv0G1}=V%7Sk5h^}3 z&%Qj2eG|@r@}cU1cPOs$*f=OzXCQ#(=4w0DdsJn-=H7;ys!(gJ1uGkdi4Gk)?tC7% zR;$;VylM3BPgI&Ii>hH$$G)@6S?6&rCms;38?Npr*L7AKPpzkg9#$7U<;Il8=TuTs zQd%}A<8rthvJh17M{`#?y5{Le_#ekLaNaL-PHPhnFR1>O&|~UP{k4A?uXa9GQc_Zq z=G)zm=gD7)%OI0NdfVn8gLk|UMtXVDx zc37c-_p7vO$m59^ied^$|H1%Rq&w3d7a%F`Svl1@v5Nzd7>mUgb_ouL+b=i5DQcx{ zoT65<-LKkNR8({UXBdmcuKV1^>$1<1eR|?iD;!uM?~6Djq~gpmZ7{u(gKs$Pr*bQc z>_krCZ{ExZa^uQVP0L9=VjQrnE*PpNreB(>bbhy8RUWPsl98DCQvz;h5|aVQV}5j? zHtv$9u$M{2=EehW|MjRYw!>(IZ&U)Yx9GEPbljta*gDlB5gGPCTxE}9kpWz}Y3zPM z=04Ns*imxIeFj^LRmvy}`p-gui)X{PN%gSrok#t_c+OeH$R$Bvd>h`Dk~s zQY2W9^rA6%)A{K>N&2Q*4@F!2Ehz-19VGLWDvvnISd9*EAou=0qm$d(4H^RKpMT>t zUBlC7NEu$V+I)Ro+9A6|qW(VlY z2SnuuNK)nN=B%H|WOJ+~8f*l37R~;hfp+%+Q7?bDIvhZW_!U-_Yr7(JTOs7JRX zfT@-}_DhZDqb$MHO;||ptNBwC!c^_RmmUxm^Q3s>InZY^ZoxR8Cn58ERR^qQdwlNh z>aP4i^Kvq5T|rDYklpSed09M7vas3k%}aQ)`U&iUet$Yk`xzAzrk0qGEA)$~kuAZ7t$ww}>YpYOy&{KV^&SJXB_ zuYpUW?%V_I8ih)z995rqUj21R$C@-1KwyU)9|naUx9GQ)d#nRxD| zn~0-FLT8u=J&<^8VS7vezOHmAuOMI@!wmFK9cT&wPT-;*b-g+ifFD0GO{WCT0m zh*N5`co(cDA<2cqPO8@IZHqJC+ITqo9jE03${=X9twE#F=tUZn6P98y7!2n5o1d^% zz6ZST>-8upRjSr~?>oHozZQ~l8tOdoL05~j-f7vasjH?|!zK79D_)hB~GPyV9V(HNti$nb>-%nfvu zkM)0dr{#e`9Q>A^kz>vAfR(sPX+%0rs`RxW|y)8M`v{lS?tG za$gt+;An8t!f6r991JZ`awznrde=7C;&Rl_i_lI-fZ&fJzwM61%IOUOAGV^i|GgLY zf^YZz)Ry4z9b%?MvbYjc6bC{gm14irwqSk(u$D9`>z%wF^xmuZG`={%!}G#^OwLF~ za$1fQA#~icTjQ5r)7F+?uw7il%^&^94n%L8K3799ke1e>A_b$&)YWXm01aKPZCEu_L+R4HqSZY- zK1|d&$5zkcWp)a2ynH}jx3Njy+2>mtYSk2jF1?w4UNPy`-TM4?#x9O_`mYNnc<-Ta zJwS5siF^faEn!)ed}RS_VTs}n0r0Qr7~3bzRUaB@@N$4@Wn1|9TrW=!mfG3T_$D%w z8#1>gJN@Apun!61wn%{OO(sHy(=zCHx#+&F3e@f(>nKo4)RL z2V3ok3dGm%7}}KpSZY$xK%qpC14UviF>gxgZu=T6h~yL+1v zMlx~_u~C*lt!I-rqEnJMZx=Chl?7gmQ_R_LPJuo_YLJ;Z0cA#s8Tp>#PBByq4V#@P zwX&?ThGerhR|>0B!BP|9uOMb7%yD2X5T|t?k9VrXf6T-S;`>FMekR;=69Oq_@w9eeK+yr5}jG0x|N6}PQ_O+tGq30 zae*|VXzeW&SE6&Qd|tR9#~F^5D$x{O&dEB_rvjS<7g%1^`~qoIhw9?i13@A7JP*-e zlIBvcd*q%?%~p-zy^S~X34a8uG7v@4E@c}?Xs3WlI3YlCv?3u*Z_RChQe#C&d1_Rt zNtqGm=2+WT_*_I(S!o_Rn(y{T*c$=ea-c7_D%qI!*^is$c=NPg^g6D**wV<*Jq9n` zgSh?qoe08?^0uq#-zl9OeRDXzm?PXHoyVCr+8CcY!VWzeibGT9tI*<>5nwX!|4J-E zT;y)^cFav*%p+{u>C6GEo}AUje|~EA^G~gSbd#S+dRS^Lm>&5x0YgbsS_noos|y_< zXP5CP*Vd`AW60RKi&|lX>gz4{7?q|MK;KHk;2nIS0U<7jsbY1+LGE5_qcv)Sz~buBBk!HN!)mtA|J1V!L2 zdaU5@s$f6~2%BgF_dG1Bg1(H^!H(AjcoT2qSyaKaym-|_iQP?yaO!D*nTr({!U*5>QsAUZ4gK1nvRNV1pdf*tMWJZl9i;J24okm zpDJKvZlAY_aabmnc*0GKC<#c!ssxenDic*Q)6arDu!W{=B>k6u*q9>*Ic3K>tmTD4 ztIf?gYRt!0Nz~xpaCkxD5K1Yf5uk)qI?#!M=s1q!IF8qtyp0T-ytYa;E~>z{ z46PBb^%>f)-9Q=eEfl7!w&xbJCbrN`Qi1dqX`S%jf2T4x#ac*4IprBH1P_(ij3!+b zB{dj^MMAt*SqUhKWcn!hCHyOVOjqluBu~Xpx(ZA|_2A?fOOu|dGCQ@XEds#z!HI#a zNHkcwSb3Bh-y*XCRNhI|J5Ch|k zZU28nnUQVoh5!f>oL!97zk+Gp(oiz#x40`U22*UVhxT7&4a5YBs!27J?i9+CJMerJ%SXAoX#>jLAwKz3DCG>nO=eOU~i4E3blM>hNpj zZGFoc^xB_?IvpIRv=E1Kl;?;BlTR|vgPx_WLUItV?9KqC;D1_8`)Vx2E$^uE$yU#- zHElIDFI%!LhSNtnM1FHZdtNA6m)aIlWrI&?3OEoW(1G-FUY{i8tdHZzGQ`4^)jB5g zm0fZG8j1$ukyZ&ND^!hJkOPVj;4HXsZE{S55{TZlyy0vOMmqO+_Pnp)WoKQ`N4!tiD z{K(4aQMhA-CgLEJ6a!e+sjB_`S$+P95(EFHN?%vG%J9T=KsS><;R5NIL>T)GmrHu3 zJqbT)pIt#I%(a50?eGVpdg2|?7s3*#LvlhVQeQSM)lqsfl*P`kCvH-XOJ3l2$0&@# zXxQWQ6!tg`tNln!+dQQbb?f9k{Uu)Ps(jzWZ;l*G31?y*0-C-b*}@gYjG@H>X+-#A z+dv&_pL87xca#D}*340#)gh_-6+fQ{izu8DEVWF(QXJ2~4`QVm3euyd z)+>A6giD44Escc^P2Q+)H0fM-iqeim5zu$v`s&eCLXHO%l0k@*HxIjuzio22S91A= zlKJZ_X0fa)Dy|2E?FA;4wU{GYMNeO%+$O8&I$8(ESl{F{$q*%;Ni^)SFTtpQJ|{f$ z%@@I|;f8h#!(H^AuW+G|sS2LL{Rv~N!d&K@OipbgSP93Fq#bHRW$3|HmPM-w*xkxh(;sB;S}4EVBZ0Bs$3D-2Hd1UjZNh;!oogie@t=>;*g;9sJ^ALT)sU4E|a`C+&>eM`Ow}pedy6G z`;mfhh(~yYM|gxsd0rTItqi!q1w$L&fcQY$r<Bbkywdql$>;Hqcl zD{5uWG*19Lc7U5$xIU+F>S0bg>pfRzm3-!4_Kla(YD^H)rJp4vQz@OEolu^jB&RFN zX!Z9EOiT)AjVJVDs4m@)3ZjAUmYDLtTfXt<5aH~LI34K;Hy7ztM!O|g|M15zkgk^$ z!DnT*ik#^_>_;?kygGM^%LX(2(e`+ZXKa!j@`Gj$iNvNuwb z_ID)n-XI7TM>x+-6JJ?FGGiqyG6l72A|WgtaqXU6x7a-^lW|BOHSEiN#zvQ8#WotG z5r?%hT<>FU7_6OMpuMS0GC?S}#IibOm%Nvl#+y;diD9rbSGlU-kZ~B~Qap44?G-R$ zvl^6r(~#V8$NLNU>okLZDM(b7mz!Doyw6@zsCy0PALE5fEphiAstXQ5yjivERKW&8whMBNa&{2eheRYZD&g%+>@5JH#`h7f+P zfjx{&3Bxc9!*HsM!?2PkXk55;$(=M8N5xgHipe-JUZ3}0Rwqu&ebZ;xQ*B(=s@v zhzfHo77@<8xnw{nQyPO9j>8i^HMEV9eL&1oN=`fs6!kG^rl*?FsX!eNOr{RC=S>9cB#bl^9F(Xd7W@+tY`DdcPBo?lRKQPX@rxcNt1>+ zL8GksPpv73cv1L`Y&kZEzNh4po>E6UO!A0H*fOY~qw})TbkdABaqJp{jUIg*!j7}e zRWZ!~K4cN^<`)(KbeX(Pt^_kXI&fWHCWseBcW#pnzkJ@4y`y`ty@uc)PmzG|=RzlZ z{~(663)PsDlar^MoSa;9+q_5jd4~|GCVTA6%G(#%+&u8}sjRFf^IjjzQy$d+#+Qw4Wwq^FR-DG1#~Pm~ zqhCH^*~{;riz%}hT;M6~ipnBmy@$g%oMcHp-V=dBkiQZNeS zhHg>r5fNQsj&a)C9@;$xL3eozIR5@jHYx3=FUvWWuFAuhej+7GPowt2r467NcUVg$ z=EPF9^JjxQ-(JGTF75otMjCy+6Fv32&me{TkdA<$ljb}c$h?&|V@<-0Oy|`^6X;9T zgn78Eetac51P@odVjCKVEvPVnRX|dR;0QYDTHp$_(8DGsY6zM)NM>g#FDB(;woCW! ziJA%IH=?5ROja1M6pxk zSQ%7NX_({T=F8{|tMDT;E5-M2qiho!JM-RVU7A#k|bUU5o`3#Wy{tsMikt1o{JUh z9D|y(_3ab=sWe9{lI_tw&yn(^ImDq}=C%8m$vf1MRvby5+p)#?huwKk!s-ZVa4jNJVMPuvst-Hifp zg%ghJ`Af3W|>|7NG@rO?n2Q}j*7v_y%x45AN_9{;op}6TJ`$Agw6LsW2PIDIZ$S0 zaBTZr1Oy>vHiRft1wG}eaHihQSpqObIeO>r%9z&u`}2%v2&4dl>a#j)00`tAv7m&r znYb)v5b3Zem6z3mM;orh#)1cM@(vamt0S&55raH$$>(ICsfR@rRyt|D$~9TEkUHj9 zF$|k+DZ_*blgx=M0F=*3XC;Dx=SH57i5+IGXNK0ifm5Bgh;JkGb^@iFIkMBDNu2;s zK(N1j+;JE&<*XduXH_*qK@PRl)In%HQvuIJ>(RSC^~Rpk_83twud8N;)_%$*iQ$r5 z5?f5xE-pOn>HYVb1?1A-3lvw0 zqGP_I)?$qHh9_l~_NXbsC{5Jck!YBLgwV4N9K(<7fM|K57>bX&(?3^5F?o1@2l)$H zp{!&oFZLgbP*6j2Zg{LzH<5;i8k9^Ber| zdgwY=wiO`5;9S5y4k%Cki+7`x2X|UWmp`QJC##h~>$Y}u``@PmNW^lqfSv!TqNbLz z&2E8`r$vjF50m3hqezQw-8Iv@$A{XZk7JU_)Jv`qhLw3AalcVa{}~jK_ZOj#eKVT9 z(}l(#&v;Khx=a=4wB~4;I7cO~LiRRd^scR?qMZ{!IO98OdXzHRwHIcDU|}#=V0lUJ zTKTv)O?_2|8FIKB#`w%+KJ1B& zXuOn33lmIpCBA?UQCxwHPSS$>nI4hf&)1hvZOTvQR}JL={Q|(p0y%6d_L*ygVxXD^ zLYckrLoRr`Aw-LSkx7e)wzee*2o}bTwX6%(l)=2z9HpZlHBJZiLV3t9St-(1m)EKa zh-LCK*BZ68^7>p~a=4~LzycKC@mXuN!*>1i zhN@9V0dqgahY%XaP9Bbm!=9yFW}g8RM5xfwEwAAYcodC73pg*MI`>7y*vK+NYDLu2 zB9Trvf10W&UMmgyR8l350JU5|D{w}>!bn1_XfiSPI8Yp^4qEf8Is^-BXN$(e7_OL! zhk1Ca97CvBnz>tJcJI^Np1JQcm_?Cjycan?zrN>X!O>_Dp9t}|R+Tb$S!@4wN|)$V zipSO=qx4>f)WTLTXeVnkPJK5wj|k=r3(tm9Z1PIoMb%lfo_HMpsD-U*59_VVv)kd+ zrYE_hNj7}KH3N592W6i;c6Qj~nXP24I6kmlI#9K!xtiPS{;v~;Z<-Z|{&v92+8IHQ z`sA!B6g`dsnlMbSB|WuD){npgnAd^a+=Q{|a5Xn0rjeL>!$q;77CEEJgoxgg3>_%$UjKBWB7LWR>a|@XExIvrn{w!Q24yMqIBV7IINiLjJ{)o^J(>Pn76G!ZqE;r z^PX^R%D#Xg6bhHkrLZ494W;O{^8lSapJnGd*?iwc+~b~boCJqE2iC4o z=3;Jr`*3_!J-feiE6QU5^t8^Brw(Ewxz#}!;6i>v%Fi@eRuE#Jhm7F3L32oup|Y04 zFdv#&8UI`h)+V=}%mLfM&6Q#ds2EIUao#X^r`d2I)kiGtn~KS=#I|1oU?wnjI4My~ zCQDA>s#suv?7dCS$?ewWg|584C`mWmmFl>30qzRC_=40_Kn8T#$5q+Kd|(7xvl!WZ z(b?+aq`1||!A14}A3&>`AT4)uDk(mQZ>F@-IV2W1FRN}aX632xn&?9_B;}{eu#Six zXt$Ih2{bWO#BWIgMMpe?GQ{tcfe+jY)rS{srl(BXzGAc6nuSvTTSLxxx!M4cRh?=l zl0>VW_Z?ZXn^Ivuj#;)DjNcb62SOa@2#WiD$zTme&k)h8Pb zt~cXwLeOHH*l!7qBluDMRW@Z139k2utXPS7FQ!|`tL2%TcL@5;gWGCM1+$oJT{x-e zJ#!T)24;s53oPg$!zqtQsX_^r8<2oD?_7nv=^LMXQBB0*NeLPtV$cIHWe8SWCmp65 znI{bh333i;qjd7L_FknHgt6AuWLT{Ao&I}KlFmWzZtP!!ytrD zfml>@d9`Jl(fVftgJ-$v+XLm_xh_A+(SXQ>EED}!7y93HGXG!apc z#P=z3TJKQkNX%1}-E8^9e~IqMLl0VwQ;wD}{Glco@SLm`HdCKSQTpE|T&x#D-g??Q zNWivt(B{Rcj8Z9w$ZJ(YXTg$rr$u=vrKbnEeH>&>sgRwsZ8cUy7OYk170V)WGRGQGeq4y;?GSs@k)zy-Qq|D$1V-3CK2g;3njMn5B=A-T z}t`*PO29kLnQ z=6W&K{$vZY2UWZB-#P$c%rpe43BpyJ9`%WdF){nw7$;29fMW50O-8EEAOK`(U`DfO z>lsr}#9g!(Me^s!AbgP7cB#T8I-g3~jNFnFYK$s-^}9^OdyZ$?=lMUtyE+0?+c@wz z69UPph{>K8OxYN}nLPSQW(7wzxG2i$U(n}OFr;O{)kmZ}K zeC)FwTZsxOY$-a{Pou0SiJnHeD90W%O`D}7#1Cg z(>C9RZ(x2u@WmG%;4#02$5eWt5b@5D<_m2ip8<19ODw${gL)&ri!)Fe?G)vmDHtmg z&Pb+De^=ievM5RHrF?&;j%aFE`m`D|S#u-pngndH$yoIn>JTddUgc7-QI)vI215== z8nkeC2HMZsTA6>H=g?ZghvK_(SDECt1s|n7J+^S9Z5Uf9J)7s0H{HFSR#cEJqFs_G z1%La}g@>+GuCcMAO4}WB0brf0m2o?f&U1 zyTTT{xiD%I4Rgo}J}5JZLuS&t{$W9iN@XuRtMs0gDYI||q{Co4??;YyuFMT>u%65~ zp&4Dnrj%~`pQPyIZDB3(b6?7b5T=6Y; zXFFTdmTJhiN)}<+Ytx=#u{$Vgmm#rh?*MXF4b3Iij^w-{Ze}@{^K!0WXa_D+eUdShobKkA ze{7WVUGhbSZVtbs0KjmJU$2+Jhxr!Y&!3`biy33ZB%9GoklF$rO{K$^JwvJ7nbYH{ z>?Q)$ig#a%*22d%ezG*r!TY7e%eWMXpyRSaR+b<^Fs#z*_w%LctefMLDQz7+2)k{?l#SY`@e-f$(i#Ris2cVm!?oQZ& zmkosxF{rj`w>5Zqe`_m;Xu|Wbj052c#W*DZIvb&3YV!?{t&!O5FdF;FJ2!;Cgu@AF z-UVcdj>O7fe}2Y-+hL-|aEE|rDz*nLXqsp#VUsPwETHM6-9lK$Fl>44cgOZq{10nv z)3-NX2l>a%)>1`>!G749F~GGAm;Vc{>|re3wJF864>?ZK@R{b_xhBqWdC=Cfp|5>L z-O?G8ZL4=k3eZ{J61gb`c*tITlSCOykR|dD8=trrzezgSV^5n*@>btO0tosZSUzr55$%P%llKc|F}vN^ zWIlU}6Q6i+4arMms;$rydE}9&yl?;i{Wb`cWZ@G=PjL!vN^1nGmua=#AyeycNq0hc zJtNh2ln53~SsDuooeTpYE^FLwp?_*Kv=qD65Bf{ukww;%*uqkDnS}g}Fke!M>3G>|Alq`EGb{QTNjJM)0VX2vvp5tHXVn8g> zwlFwCv6dabhi7R{b{C?OoTbo{8m+7#0~P-;hAo_h_cbhVhH>~BfC=Lnlg&9Hk*`5Z zDZN@4?v%DrZ<2Dwery`*r(a!@8r0v`LRGf)7?Rf^{^I~$;SY7~@DA3cQhvbe4K3|V zrBE(hjIBSgr;GJ_BokHSV5J~*CTp5x=rSh0nfcff#Pncn;&}0BAeMD0zcBt{*e?uC zkUAy0A|iRXDI6pgPKUgg0x}D$pje}B`2qs}2G{vGZ<>v~Y@Q{ip>)4NqH9gP<)6)0 zkSX~yt6t1isH|B$*vJQ{hn$7jn*_gS+Bbi+_(HEp4cnkUgXsOPUGwBDds>m=FI!C5 zQ;RVnv$hzl@Yt8YUasQbyvZKwgpS^uU%!q^WHsy1PL% z|FiDcbk&y1meA>-5h9^&Y2ycK@ZV(PQwyPcgIBz1vZ4Vk1_zxb57kxgr-Qtp+Q9H4 z$vee2+*eJ$$jn<)$3LbcoAm0^q>J9u_FMTADZQTz^pmFvG7DA_xD}Ggas}M_)>c>6 zN?~7LR;aZHp2O_W@89)^K*@;KQRG7F{Q2ahYi(R<2fKI*J{fdYZ~l zz1Sg^pDL ziep1LD9HjMvzX-}acI4fD;k!4-D7sKSa99y&HN{3$q5vt`%`_5I5tEe-B?X5>&M%% zWV|b}obuu5Fn!57)WhXLuh4aQeIH7V_@e^)w+uW`r<~LiJK=p)zx<6Z-%MgZTE1>A z1?89Bs!w)&zu!7fu%?|EEX^wk7t7+p?LkGQhCfWUPnI0iY2K#5} z_FS$~2~0vC@YDaIxaSld-iQePC<58tNEvoLk`cC7kojtycpqkrAJogdr&Q}BSw$5e zUK5wL09WBL>oUd|u5TU)hlZim^{-mX!0Jh{44x!)t>+jX@cni)wvy032WH^BkIp80 zPudT8bGlgBD6n5UIew%@O_0n&1@HMihgAHwDM%r+MGor=QVS}C!?yHDBC6rfKd**Z z0<}e0)f!+_^6P(!%iRD#pGRq!1lo{+S=A6~5>OKfibLJ~Wfv3eJ&<`K1gd`ZDn?H|p z`hQyzD)TcANb>Z%+N>)|w#uX&Xh=$I8oIvYNJWydJ-@o*)OIr=ePRl0BIbP_nW+>~aHh!lgDU;7Mz+A} z9cz~}6jG`O)KI__dXDZ~=e)Klq^m@#qV~A361Iyyr&g`RwvOj3tLjm0lx?uHY*_0b zx7@Qzpet;?zJE)(S+-ycfO_PO*$sZG#g~XE)sr&L*n!hiGj_-cfp;mZoN+~`7 zu-JA#o8sb*73VV8*4hhXI_gy4H-?lJYuRa&faF%pkIKUS7(m-=$eThqbU@}xn63yD zu~>%l`f==1WGi2xsF`0r zE-QQ;UOGVw?{>s+2T{YeMWN0e@nDWq_lRfN4;<>Q z&*0fSI0t)dF$!IOMj?{p3HMb6!$aVRZNVh$LotlcxXO3!p(D`&sN;Qgec#)8U=h&k z^B~4hGL(H{u0rr>cWKTCzPGHnNV8;G`d>685vmC)>_jZA0Y0+mH~fs*S5$;NzvxS8 zK_4w?La)JSHb3&RZ~JEJUM7=$*D$#+^ql42AC~>_1tRmzP){eEJ)STDa&+p+E78jw z#yRk{eP6Uw!ex^<(gz;aC(3fgjubvk6Zok3^S;${@4jwr9W3ibMIk3PNyP1#?Ralz z*S`HR8HsMywybKAyqR)lin$j{a5sm=J@KZp!Y0S+s&CZI)WcO3Y%nA#!Q2__(s*Kq zwQ`1hKbnc+ni#rP9h1JLPQ0^n)!cUU6^D_E)ww3e3`1rMBc(r>J96UBkk=~r>ucIR zC8vCc&QdFN%Bf?dR^&AK5pkKehjLm@$dAKn3F87Xmq~14P@zReM@(>ik9EH!rzMKT17cXn`6J?e2nPsbt6EOKU$;r<&tL8{jRo>8IP3MSG630knrBr(?}ge~qtn4>1BdwOIeCXF#R7>zJ6^tYf}m zGKGmsJ7r3K2j#H-OS?>+#G$n#wwD%nz`yyQZD}G3!-s{_9`Z?PzO%`EUromwAhc>;))dZAvwjZZ@SYnlj(AV#plEpbvisg>N+8q6!nbcx8JGFq} zDI@D#HlN1_@;mk*HcVPt8VNM(K`^)DaU92S9LG~?3Tx0<4F{$+eiu((h~*Pgr&%5f zSr`OG!ck%<6>wybofz?J0zxGiBzWG}4c}UCaJMW|Sc>uOQ zkrlmdd+o%rPeyhvYZVy(q7$P&1FIph8X(pm($wW)kv|or0D~W~%=IUD7q%~<8a)4<~p9DYWVkvEs zjO0nuEdkZXI0-cHARr3?`@pUVU+au^`ZnL9Iq#F5dtc*V7^FGUh752Hc93BreUM0< zp71p;=O7`qjO?&}{|YL1cs`VjK8%L;M0Pf$s9df6KT2)CXyj*&{>_ut%2ugU&~GDs z;cZdIS+BZ^!qq#p1K#3OO<~b6yS!0+HtmDFe^_3y6W|HccJ=B=*;}OK7uUt&1piDb z!r!9fN5(7fe&WsZ`;;5!I=J6HRDcb43`$6*62KeI!Z{tfuMEI~q-MF_ho~Hbkw|6i z(6}Vm!*pG&N*=lwoQCPhE=4@D_T+B7=!o$f90I;wG>8Pq!kSB>{i=+h)WMr4GouC_ z%g7iH;alI@QkjQtHUyY8SAnYSL?nh992FSt0i$_U`Fl`+m}D`fyjxFw(W=u&n2^v8 zcQ49aly;w5S?`o{Z*YLDlIfH~-JMe$`=`>E6_w{;#;rzSQncvUfWOw+{?OS$1eC=t zaAZ*xU;v3Q`b^o~`pmI8lk_&&hfHQ1bap>a9&EykKIjd$w#9MVB`d}`=(yYQDf~!F<3HHVCxBFY+q;k|o9(Lis;ap~sPKIr=4ou`jPG4=p!BKHck|JyG4P z{@I41|4gLN{&fU|Q_$7zD!EfkycK~nbPJbL+((uX!i0EihYeLCBsEOF6w-IDaM{Kg+r`T|YTxfR<{*zVPTm%!82Iy3V`1X>S(xngCpaJ z6+3<)3kH+fTIuS(v=w=`&Gw_}@_<;S#i02>v$`75=qq08TfrBNRzlgh=L`8|cWtMq zW}KbrzE<7=81qVYb(M0=+PdAtkakkts3`-m>P|H;wg5 zqLW+4L^b`Y*G&ee?V%UC<6L>k^De{Emdjw;2{D){4IoW0juGU%{acp>F2KO%+~2hG zDf8oRph|1@6#=$s8GT;dORms;x4k0yo69n;8OsV48jKNB#aFMCQJW<^(g55+Y!#JmrxG^Sl^xk$N*0PZ#U)3nqpkXUk}9f4%jKj! z4mVc%g<*G^k^AI&TLCp=E#=8)OG3ZoI-OFly|`lSr)Q&!6?e>T^r3?cxia`_o_hOF$5hf6a?mS; z59V2fS2JLIFn0d2v{I{5L1luMgy33}4aYi2d~?OMY>N1qhz zLjLWQ_QNe?OFw4``qNcSJ2%w&{~bRlji4QXTu1xiEeqlVdm8GoZ7{c#Dcu&N^GbzS&{@KM?34M@od9)n3{HHV}Q^2Rz$p@`&D#)5waHEU5xopQ+1 zw8%}iWkmQ-z}Hj++|Ldr$qC5wbWY90*z0vZbynmpJ*hi0nnfszuEJIY$~l2K^Yyk* z48V*D)dmw_ORjmNiH%2gxnj@qd=z9G5lSBgb{k+9C^QxNZDh71-XNj4g-V$VB^v>) z5fVeEDv~J$B(n`Iv;>}kfElur`)`!AF`BtU7xk}oXuC1wnA~J z{%hHZLqI@~XmjI=@2d-~+$snF&B9f7B0^kCq}qZGkU(Ctz_N1lIFtiU^1J*gbvdC0 zFtdytXHn}Ul-MYMFW#4lq4iv6y+8wwLJ*yt9x*pY-toNziF8}sC`>{ zn`p92^;tZ!PT{>Nl$F1Ejo&!Sk*T=jM^3~u{O{B~{M={62Kvl-LT3uUZuz9Qb4Ovl|Axa)Af!qSYolTt6e=V`>ntrt>KX5Ta>-c9{l~+Ot_@ zXv~(B)U4Woo>0ev?tm$30z&Z)m|lP+uD{xYiNuhwzA-L9CPN#AF0D%No#?IStingE z@2tMrtBvd(K79D_;lmH;$^jIm-5pZASpgsXZuA3hO|VsY^^;eE$=ekl#dG*3{anZ- zf!4Qx+kekW?cf+B|0&K4N93dDF@&dNyq9Pj8v9G@mB>my~x; zs9PK*M|vcEo@vUPjQ^x2NOal-say00(%mjzxzpcdwy+*c^kiR_@luxq>m@&b+;-~J zzeHF2xfAuNidnSgLaT;qzSrmqDA)m8sA`$tV{53)06L(WD3FMh3$jO zln2?IO6D}d{xD$?0fn?2l*q1U8^6c`7Fp8;+aB$GD)WfUGUBF!@HsYr35q41{4Ano z>=r$H+`&8F_)b)fBsMO)V&KHemmlPCpV9AL(ao0|!?e2V^+8u8?O#&eqcPV$Qx>z$ zIug9Z=Aj7*d1l9-_Aq8O!mQ-#R1TIv61vr7{x?zm9?^5HEneU%9omHm57 z>fda>T{3=2*$@t(#GA?ZLF7HUZo^%w zVf-65Z{@V$mo#aq_{wRddsMQ`5thk$58&}Jm0Zz->b*6Pu-bq>)DB~6c1cvUKSDcdoe zO?aHt-kv?YNMmo}?c0hl&-bR(Nx@yK0>RJDW8cIi>P_+9CYHGH(PJWbh;VLUXHUGk z_DpA%8xR)knj}wasT4le?bzk59N49~C;OYo4!mIQM)(r&5g&~-fN>BWS!Yh-oR=^h z1$yJ@J3;DT%?=@E+NEOv&Pz4%Fm1{z_Ad9F(?G37!&{K4S1yML?ay8yN?5> z9{@Yk5db2#L#l1PR!n*_UKx>%Dc%@*qb_JPKrjwIWOH&r>oNA?M^)c-I{@-mb`%IZ zdR7~x54N-PP1XM2FLN9v@&l4sz3!qCLwm_0Ii2G4k^WTROlOWv+mRez)UfdG+>~f~_iSUAHHKvjmCmbZ%4O~j`IQX~ zWCb=IU|pc=vrwZVGb_yd6Sxm3oIAC{@pMw|0}bt3Ft=Kv^W?BA)3`HhGkiPY!-o&w zTDlOgR4_ERo}Z5Gn++@*-2pgZ8%Zyg4o-}k2)m6^?tTq6{^eNr31%2q)7cSt

n{Mbc<`2?)2^yq!oC|y&TP4O%gS4E!@X~JVt}&~ZM`1d=3Aac8SGw8sM5E^|J>Zizedek z@NGGwHrU{M+9AbY?RuiyrKsjYI8Vp2bM+3okfX zt}8)%VH=NtUepK;n_%ch2|R@vgh{Xmz=Or0?1_}iM2=Nr{YrYN)P^=lP_=HJuCCh2 z-v`#kc94ehGG}lEm>~b~51H1-=Q&SOPZm>HfY1wD-WT&obI&lvDt9i|pHk&f=Bo#>ozA>P>@nXd~BqFCXpy36g zBX7~Ot#j9}&JF8G@|4px=^>B^>F^otVbJ1C2`OQUadTqC#u~ZNh(&C_>={%V`Lj%c_2NRL(rayxR@11($NIZ^$Cc>`MDGc2|I8nOi z;$;6xoFX(ON(rrgJB~KP!rT&X@q-Or!>wzMDGCzGVq>~X<#$QtR<6m`Etgb8NT#^g z^`aiC#Jpd3!?wB_*0Xp2f#&vKI*f_DFJ#e?giXL~m|1O$xG+^L=TCzJS8il}-z@kv zNSl7{jbDcQ`Zvb@9|hcMa)XZO)h3Lj9#Ft_N z1;u?JcT`zW5d)nM*e^c05$0MIBc#`B6|OoYDESs-p>uN>G}L4J*)Rwl2|d^&rTu;6 z4~T#b9jZK&N208UGM9*o$0bHUv04yO2c0Kv)e6OtA;$Se;#eo2xmHkRhdJM4*cI<9 z^3AXws?EKfG%E5;$~J>GO&%R%r8F~=*VlSEM^)f}A*)OXB=9X+I_Dgw?jv?`PYsJl zL~4ckRc!4^uB{>it1JmX#&*HC*m`W!UM!Yg`^7|hOBAs zsIs`4*i{=!+@z>YubN2Z+=TWiYGZ=j8vB$2l3-FW3lkG^$kr*^2EssC@Hto43+ZVV zuG{d>E|FqxiK7}b!m6j$h#Hxy3gFe4<5*QpOlGJ(HV^eQR+?h>793<{S9>V*47p(o zqqrk>4ig}8j97QTZ2cV3Dt~2@O zydy0(xc%@52zhU`TzL`JDzpz~fz`fGf*O)pl@Y}4_SKLkQV=1YERS#U)LFU+G7NDE zgqxz8>;_W!orFmTOT1u0099i@fa7Pc0a9ed@o>{Ew~q2a1jn zG#^i7yaCleek5Z)eDw0hy4Py-BYzVMJcB!4`L~xsZnfvprmn__O0Jq+0-6M=SgN~e zn8G;(8gjDNT%k_WgxT%mZd*Mw)Z>{@ffkBcQv>_HO5wC;GNVanfYWiJvi71W9d)q| zMc%&@FZ8dKpx8_#7)z?WmHqXaOH00bcOTEC9oHw1UDSb`34c^dVi#57xaT<{Q701 z{Y15{YJo_w?G0z!Nyvcpko`R{&l90AO`_oL+7Hhw&A-t9y%|k-a_ikcd{TgMMm05Y z^4-f5e;3_rnc>OHJG+v?1cd2HHhu}@M_nC$Gazx`lo=kAm5ReC467>@s!3SJq;O}T z+RE)rb?2q=^hz~${LVycpgtfO89$_!ZW&;B{<^fyr=DaaFKJ1)T+Y{g%*WAjCICV8 z`WdaA*O$!@t79kiNtYg(_Sv3pP#cw^PDS|oX-4&OqMb%InM@|XqM(z>WRuC1CX>lz zT0ikp>qE7YgVI<#pw0~VyRF5rN+c(KJeIp>exFJc22{m+U1~6h#?l) zlqV8@pS1ptq>_8d$PNVZ-{3hXA;k4F0r8&m*YS5PnDe?rX_}yKVETQ~AKu48w4?Oa ztqE)dYC+i~ZifyC61Vanhae|SeLr&anom8NvBt40HJkHfcgS~JjTN&A6u)%nK&r=> zz?Tz9T(Q7Lb5FKCskO_(ML?4T6Y)FSlK?rhWHK~HIV8AsqF?GIBmO1q%j?h0sS&by zmt^aHKxaEpX zD`iDcn!i-~WeP7vGNPa=)2w}6Nx;)E_W=7OX*30}^aU!XMH0FEaZ?#6ss(^5z3|Fh z79Ic1Y?q#QS??1Hl_%MLOjHfr$Y%r0=^BKp$O>w2BTS*}z3?2io75ISX<(@s0WM~M zD`sk2Gp;OIC?(tIjqP4|jlI2{^>aYbXyOHi@#vEPF)QR)Ge3SY6TLMV7Djp|)G&u?9|7p);28SfyVnOtv~AL|wGAB0VgfzzJmGLn*}>ivVni-l%lFW9oZ)5ch>dLo`<}zT z-kQ$HIp4(~5@Qj~`#4|;cpSjLUAcNrgrI|su?^SXL5lYzQgvAMr~!ss?saE1*yRdv z->X9;&?kv%_Yi#8%DoWn+8FrkCvONkNccu9I3IRF^@C!JEQmn8HZen%IdAPG%EI<$ zUxl(BdUl6J7QhT;$0uF}7Qc=jhy{B4$gc0;{pHS{%YIGAih@9g39Dl8n@sg!=waNo z2WHgYOI-I6Dqe}X&bUBjH}KgsJdqhY(-}xntOU^U-|3Ugwq|-LvbTqLqcnh}JWL{t z3flvKkm8ZkuP;=3Dp01j1ynO|-!#EqKDqwSJFd*sNFZSR+-T_Q2mOprq!K#dw) z>%(!FvEONE3ntk8z^kGVbj$-2cpD83O=za=MDH$!hK7b_3<(xxVKso&(;8}x;wF0rD z&Dc&?A?)%V#$7X~_G(Jv`_Jw>9JO7`J+|GrNA7tvOi=Hqj5@LVH&8&e?9v8D4yKU& zP94tsM)~>vvzrbK>saUL!97)@8xnWxg7br|tPgm1fAJ67cj(y#Klq)gd2(y!WVx?# zC9pvny>#oCKO5b3>b6<*Uj*sKAiL$eB~?v*7Tkkf$f`Ctd3MPr`TOZ@HCj#oIljR& z|6xJ%pll6)8Vti!z$!^m6)Q`7$9DmUpVS z)*&PU$!l%vGy9o!xrltIrDYs-)YH)34F-T9qUSvkpDDCRV`yo$Eu@&obu=b>w6rVM z%VIz64hT8=yzmGQr!uAFx$(*8GXhv6lLB`u%JFrNz4m$-=JmAsy(XgQm{>D?T+y^= z_`I+%*SQ}N3(Gw*r=SQ$Ptc5lLTrx)4Yo1CdXr38%U0 zdG)c0kt_lYEi0LLECsmYk*KK3&M7EGbZkyFYckA?N3{S2Z-PdflL_MELAWbo#flXx z7F}7@vvirX-+xsa#&o3dB1e1P@ihO4_lCb83V|k%wcz)=1GkU-(J2s!>LE7|1_D*? zZpw~&en&?9XOfw78@{!(-1cc|G9S+0(ByQeHU|XLQnwV#&Bmi!ide*zuKdo9clmlK zmQq!Qtf~n(2SM^)D`u(bXl1cc_OOq9rY6c`8+j=SY2oof*SCqsiJBR9?AWpMp5ihk z##1_CYer3OqjK7iz+f;>Af@kER~FL7=TV8MYOuUw8;>Jfv!+QF(OE_hHOcF&S0Y{+U8~HP zje1N~@Jy9S^$FlGD~WQXr{I3ETiZ!ph^eYya7|&Ap?WsCDP&ecd92m`HQhfXmnfFh zOG!VejCM2m6@Cbx;;p216#s_++A-#Kd(7U~`KDhwH=6o(?V@bO8e(#?YB zK*u$)733lnqUfkH&Z;=OHqDaf>yz!Q| zRKIWX+iY~3>vV2Wjk3+6dnpW$<0Aa7xU;lgm*{twW9uebX$oGLd+TX=%`n~O@)U!QYD&~Djf)Xip<|2H{FeV=qUm)vtNa zI4E|7{Mg=5)kJHGTOXJG*zf+1Wwymgc=F!c7fG&(k&1WN3I~9JfeCx#tjgoCDsh67 zYz}E^C(!P_WB05PP&CWxAz#HnOXEgIE`>wy^LMS5*P!U-xM;!rc+K^#FTGn(Z5D7# z4(%3&ElUXSz_cAD`8N>}BdPd4)Tw60%N}rC5yj20NJ~qfsSasa2b+lvEz&&SdSQ6k z{AV)#NY4Cb7VnJSU-Xo0O<(OUG|huy$HAD(`*_aBJWuD(=FU%o+-~IxvXxwm+eTN% zOkuIvHTBR)H!ul^LM0ND$?Y`L+vFJbiSmyL2<0XX@Lw7EO3SCvlh}A-AqG{7!0h`w zshBBv+r^@K`gRef4WCn(QH{4zh;pdM!T68nRt7WMEIn|}*V>^oy{A_42MP+xl(Mu) z5ky3^h?LR+VO9s2eX1d*t_;n-KS}8(S`O;}=T!^&)XY;l^Z%HG{olmrgB&K2`e1xr zqJ&6~aQ31eW^0*!6h<{eZHF$y65d9Klk4+Fipq#j?Pk(ud(z}1 zs}@p*`XW*plcU^(M`&XBEIOyZQ&bZ$vd+M&+A6ci5h5iq`%Lm$$=SGRJ<2Uu*3)#{ zCIXf8voU^%%YClZ0plj9^|6OGsC#S~HI9zr$EwbU)AOKCCGC&TU@}IE79W*86mTTF z8Dzx&ulq0A{U-?u9w_{l@QAxeH8#^_;t7m;F38S19}xD>Rlg$+7)c#ksS(Z?OZvP2 zwok)4)-$;o>iN(ZVmokU-R4Cz0o#m9<$;`6hlW-Sqe?346rX7=2#U+;k7YOf`683 zJukT$XdU*8tQ!f-n^77c!A~_;^eNJF^Sg%8w=BSI&Or*Q58eVlWfVqSQqw)yGugV< zplgNchht$(0*k?XCy?I8dG_(nvQa0L2M$vgTuYD9wy(11F$T)mg{scy8iIN$LLRBw znP@t)?^%T@>N}$Ggcf=EY~FZtVhhQPkn7)Eop()Uj{QHAAzfsGdh|`@_35^*VT{AE z8|3@mGf%oE9JXlL5#bQDNQ+5T25VWy+7dS4hxPAyq9$lKu_&m@)l_`g|8EujKf|pd zSD$~RAO%DOLdlYorQw0#J>OA;8}o;yUS*Yb#4iDZld1ToUg9?-=_jWO1|$pltoKCK z>m(*)$7Z?%WKD6bOzjbjIXQnmr7W* zy1Ltz)9f?nBLQDDuzZa$vPsZ}ib zP7z(RWgZpdPD&on;c1e*Y1vv$HWrEnl}wkgyCO+#T1YLM;T*R*wZonqljA5x? z+!pKhp)|$M&H==I*@WnocGGxfF3-?2ck7<5mHOEEi zDnI(s{zzrqBu@8_G$ajoY6PQk=mKm$l$z*9ZL9Wo&-~@J`ubK4)wiyqzE_9w!)Mq( z!qUmar~)E%hn&`^JklPFFq=(3Bq{DOvu0}q8NJmbr@3}IF`ZM0ow)f%hQ#9)@Ac3` zq9$4^@tA8TQ!}26sZcb#=g&K3#y-al_Bj z^6-{XU$33?&9$R9UV9S%LG5@bY7?L>VyJVBv=D?4d<6By%*2iQt|p~ zc=;3OmESyy-V!-tq5O_*I=@l7cuDiIC%u5e$u1#^S^mNh07Q5{d;Z}$HPMo6wxrMh zZJbI;C`A%t2Z@N?FshPBrb!|{G2uF6; zrW@f%fO)b#^jEr?d?d?HEF06vA|;Xz0Mb$SYQ2yIYugjZMS5YEc?l)b8)1fQGm0V- zo{G_rBxWVd>usLgg;@f#pL7E1rRHu0K+{4%P2^UpL7Q0FIFqdzzj915qCb<`> zIkIg!mAo?k>SL13KB-jw@()^tbr{*S(r!#C7#hBJcXH9x(`#1&-I_DHezpZ2Sl^bm zkz?^=>9S`$?qI@%2@_^y!VwcY!n-gvULpPB6MpBS8(<~*z4;3m@ zs8B@}HomlxRHV&gS+1&P+@g1Kblw!4S>m_T~DlB z63T7tP`{aJcJfB&4_-V#vuO~l1HL$VcEp&T&>ud_fp#H*M7pTVk{^o2jVX{lVqld@Z3AW6%M zZD@Rsx(E#$%-cIo8@0sga;3P`18)E+nD7aMQvFs@vHlWzr%ZctnSj;&+5MABm=|lR#@}ZDVQjdgh-b(L& z6>05W@9A~Lc|wo0RN73_O**=An97ZGeRQa{X^?;|t5p0gX_Y8e5mB8bSx*K#iJ@nO zDlt3^7#(uNh-6qak3Ekrmp+syJS)M9!G;pzDu7BgWA{h~;bQ|o2dO&lYY90~9=Sqs z7P)y$v1+KFy5$i#pW&`738KM(c|2pfpw{3;;3+USCQJvsH*Kpg_*>3Tv^az) zN7)vrSKLNn1J0oX5K2wwF)K8C2g*-`S$YuD(2Yg8r%lVPLPfG!rP{qds|F1{`rS%W z>2o+sZ%R}0x{C8_GkZQ%kx5F5i2~@5UZPo*@O}jn?69}`$o1Hu;1IJxX7yA}`OBsC zbU2Og>;N?IqM-8_fhn%JeU{ltiynpWVGa3wY?l_@q{|O4plG==2|m%1Ob9$q1#!n|WzKtTD7;ayRsfQqx*tAVKqGbTf9O z(5KM%BW~M!{RK5@Am>?wKw=S!ok?^P*1x2)z?mqf<)oU~XLT^$AdL(WM6*i;dsmte;P#JgCw;obnJ34lsyYAm++md` zQy?{1z_NDTxvXAxE!L{ z#B-BMj`e>M-CbY%!ras68iL*B`36?Ho+eQ+mekLRtFSxv7P9yhVW+bg`ZI)3oQ zhgIt5k|Aa9KICsdLJRVyQE=9$>8tL*GZ~P61rqnfXQy9!)QmFV+RrFm!}Ou8EhW+61a8{$&q$$il+H63L^m!nWBuHvY{_g-GT8v_Rk6Bj`Uh3w?_c=dm1>Q?6y@3|TP)RX^jx zm^9-rJZq$X$DU-3%MSM)ZS5%MxoCdo;k9f3V&iuR*^lC(ImGL~2rotx9LI4S$MFGQ zQd$*Be3_SL+mA!TQ%%Bljt81x$ zr8kB^AdtDuW6y)Xsg?}a?=2}jn0o;Nfj}S{A`-px=Ppdb4my15y%egM%X3uKpmt2R zHgMo&yij3zGY*;9&^1P3CD*3CAD4!9R?I*B?4O=`0K4gmP$50^U($m9ZwHYs{j9^o z!^6|*Kh)bD>+?So=lO6)=hoSurXL1%ha&s$2%AHBcrPwWuLR09d;I*8lwd zf4b&yO}pKA-@Vp#9#Zf0X$$cxr+AR_@rlp0&kDMfisyyCHll$9AeuSk~@E;-dQCDsfyFFzq9o#L{ zDP)kpYHBRN{!j$KKH%^0NBZy+E(91X;Sytg{&mjR%I>(2EV9#r8Q39lI;*EXcBsny zw6bwS3G+z%MdNL4v}VDIk!x-pE#}Obn*|%q&>UiUrijG_WO1CX`8*2_+3mbF>%omk zlm?3Jv7>>MPA$7PtZkr5tAJf2erza%cVfkxpweoD8D5m0^&F*!U0&!z->-D+J)9=b!$%{DOsf3k;nRSA(et#Nu8{PZj>kaQ(MmA9NaT;~ zU{&2_T`e*iE3nafejh3fge8(A*6;38bKvUFk7J&O+U47+#n@vQ*i+e(VRhh_axcuNc8 zU!k_tBLUgP`4&#?l;8z%-pxfy%H_+8vsyHBTzvd>zrjO{z?hqN zIz``Z-Wo`dxx}7hB?idRVN>*g7q8!-x4;N`HQ4U+zK-80y7 zVygu+gB*aNF!wS0(_B`;P*ZKs3@f+{QI^(q<~8SLs({Qafy=ORM(Rh%?2tfV1mu}< za!YW&zC)-F9`K7=gj^Ah2UGGD1hB{!|%IDK2K(uEE!Bw#F;m%7kM0 zM{ZvG)NFV1^ygOpiBK80Wb?>E>Z|@XE5>Bh-rLqDYN(;5 zc92ejRs*=WdVt)d#%6_8UmHZH%9dn@!YZkYHr>`%fuRnYN4-QzkH6>hkFUAsp1gbR zXas7_B2c+T(=Mw@>8^8p)JB z)X7j9wZZp&p-0wH%qoOZlKws{*Pe2J2`JAgQDeW!nz{zUz}DHIjOeH4@e2o;oUH6ugSvEu)wF(DG-UA@aItB`gz9Aoo79^`Hx zZ813Fsz4)#bn!s8AEJvDUGz22jZDYMZbWuHB6CL^YZ}3gKchOf9VP5NUvJ-~Rp)_r z0M!|Hk+c`B%tOY$!?mg6!YTJDUgK47SfcRA?FpyM0?|HSbNKu+RbzOp&^PEK82N2l zDU6-&Z)GPtt5_M;(XxVN8J=FZ)Svp@nAP!gX#Hk@cK~dT!LwHYuxx{3b zA!|Do{?@egc>PvzG6LNHP{4unUhqrC1{{=wU1>D}4x4-BdL-S|c?@}2%{n2$XQjO6 zkD%V&KQJQ0Hk64lPQ|G0kcRf2%!;#GHs>gu-m9gx6krwVA*F_dmaS)wHy{7Z+*(zE z2>F>6xCjnY_3VEmfoj$NR(<_&j>qH7tD0@~4bgGNK+EG7cL|rX{2a5L#Bq^=ad;bf zkyJjN4?Yp@z`K{W0&G^5%l&F4E%S9iBy|iG01ZLOBbi^RiqZTmnda0g%-U84qe(?b z)n0&$Ws6g!c{paO9@$p~ii4*1^h}?r@t$^O(xmK^ZPWk&0Kk8czy3{q%`O+v99c@2 zr3=>D$-=+LMV@O`KVFB+(}({Wl?kc83aqX-b%)CPpM3fHh@qhye%$0)ZZf-w5UG zUDc&^@g3!864K_&YfN$QvE#=xW2T=gsxqk{dNwIuf7b@pf6#wrN`L<6*MmoqA}`9n zfCmN3%<+&M2BfOOdCP_!ZSSo6|GL5M0WA{Q^gQj9d4a4@#9q-j5^e&xi0qK|q!im7 zx$IF`9<@AyeDAHB^H>O-^!{@~irC6|GsG@S;o{o1+}RR{^6cPB*_7$yu|%DSc`S|6&J z4Oavd6o!n*U>0lTo!hjJd;Q;Jd{A?x^yJ;)4zFdTJiP66#eGuNZCS}b_Oe~em6MF( zRD64j#32Mg<)^83#{D!8SJPoNozP>lH++<#Jb=T4SAaJ~i-?5kEEkn>V1F{+;e*?s zom`uuLTw<^Q3Mp-7qchTdyRE-Y^Y36g$%3SKvvyN{yQtq*oT%4v);2Jkvj~hsubNI zxH)-WQ}whwWUYWCALaha^9#PqNO&tA`&m7S0TANU`)Bd62msjT8I7L^?_|UyYn_Ae zG9D`H0-}KEQ1*$unxyS|Q_XWUk_k&f^f8NUR&BA>4i+*}{VokbeJH1rTFt_b+JZw? zp1BdQG(r3(l}1A2QKe>dOQv@WS?7p&wTYf7dUgYk8uiXvFzqg_(EF;(#dpn6s#4GOcX9|l9O|3yQW zXIh=Ce5*NILn0Jpuw}kx6u4i&IsJ{8w?Jf(0RQd$AHVMVUS<&!U+v$^irfABMt`Nt z>}|jA2gPt9(-!V+`?hXc(Q5Co_PWqyDHs0cGhAVfJ+7<0-YrJx&oA$V;okA*uadq! z8-s&bq;Fwhd|J0fD<7^oG5Ad8F1}$M9s$M0B7hL7cXNkxT)S6sdAL594FRv6DAuI% zPPpqRHOyj=B)v+y7BdeU;Uqf4{Dd zez0Yd#j&L!wRtbcwz~I$f*gor`i3a`EsJ_Ow~a9V6!^O7(9}?f=&N3J8ZUjSI;nM$ zco3sjK9+Y^INQtgwP_a*^xW}{Ka;<41GWk!Zu7M=F&Em0Hh3~nnjWW)j9i+&^v_|v z=?o4$aM64LE*K8Z9E3XGU{Ym>95NhpU=koeZXJBjZW|_@agsHIDrk%TQvm&gM8hcc zeyjkt6N4si42VkNnBLNIh%FKLP_+Q3Q0z+pb2pL12zOaSng}GZt(xy4qPurhqu9w@ zZ?wvaIVVp8Eehyz{aR;$VEHqhcBMz#tC#pm>&UM5W_S2%KIa<0R;js8&Qk6$~Joj?o+CVyJ zYM8aGMG;=wu6pQJ=V6I8c|qM)HF~&};qo}5fTu?B&PY^NLIBvP1OoAz7lZG6YjIK? zwC5gFlF9x}E*MfpHq`#SfJNR>Q)HgW#`aZbZKY+1YgXY%2;co>nv1JR--K=_Y{Voa zkI_?I6Rl%wvwz=lCx|x`YP&8@UJH6jYlZ%ATxKIDDO?EMBC;BoLgS|)YLNaaXP1s0 ztuml?Y^xzVDB=zusbkPl=y>O0Lb{upA_}gO;<)dHL2NmlXV)S$fqV^ZF+dfBT+v`w z@eTHN!GclPMn8t+6`B2Uz^G*V~Ml~cjCe}KR2l?3IFbY9D zxQj55oK^`I9&^`uO`hO^#j`91A#xdNOy!(cj&eQ3)f?6RGT2fm20GLWPX_Y1B$DI8 zR%G^Th=Aav5%$buJl-&F-)w#RPv^uwQ^{N=iKkF4YmkZPGhtgbKLaD$()pMJB)$tu z=_H*=AhDi9GihRCiZOCfV`0G9vDVneSS_f{)@ZG6vIv@)ydS?(3q?@c_=FhFf!scb zOC!bm;cP%`S70s8NNW+TJ+z};FoLuYX0>4(Tjh5v@B<`9KZKN4V9b-^O7~ z_~Fh(6Pa0p^X!ob93`9pS1gPjJ2IJsG$66v!Lke?+o&=W93PEP_sglcN*9%w4w0(> zw{Mkh6`H``MuYhXb>yd2)GD@WyU^}V5A`VF4~t5~*12`_V;QmL$qM>%$E}+*KbKVq zRhi6EP-(Ji`%9hV364S69ff3CIEqMt0A4kc86!a#617wu8_7IR)ri9m^-@)BAkg=Q z_X6TQjy3}JO4dPAfXf%r|nq0~0961MPyZ+vKfdJ3_erB{VDhqDd~`<4$3fzSp? zjqg(AQ@6Tk-GCFee$qxskSvOM^;&B`pV@6W_nRxSlq@@y>qb%Kt|3ZIq8wSr84Co9 z4;^c*+mP)GC4j9p``Lp2yGfV$9 zbh%ztV`d)PFKiFI4(!j6U*h!~^Si8=MPgeA7@8t@PJKpgtY$&9%sZ-jmx|R>65a1v zSjM%X+&1u7?oI*v75SysECg~>7nm*4qG|P%S(Tc*TfQR4oHlC%fxb@}`>fT2>E5V) zpsi42v^$EB$U!(Q3GRE;ne^(j8xf9Pya0|S_E53WjL7~4815##Z+s37axM0ypE3D~ zTD-*8H{kXIxutZ4wJbt{76%yeLsE~-acx`Z~H5h#9VWQ&tvx6`1U zA6tkp;=g5nPN&}{rS6r2*ow@9{yvbv)u2MV z1#q>A!&VgFv7L?WM>S?vn;+!{;?U%cnnJvzW+7g=N*Q1H^>hg?%p>2A3ql*yXmxz% z4DVyRl}an@NSC$gVuwz)nXf+V!?TOu7F6WNIDdr{p&{Ee)91w_I%pon%ulh_`gS%A z+5hOS!q%;wtrW_mW)xEC?32#phBQ+_j_cy~M!8rBe zO@a0kL}5dmS{@Ij1+pFD0-GL$X^; zpwv7Zv#~`C6Cp{?8skUwX`)h{2Ca~a+qd%c8)rrgyloxWNSNABnl=W=&)DKLTNl)x zGpMK~5#m2EM!mEt_^G|g4(-c6BJ=G2i|s3))Q!XXeMPQ-FP!izzwD<_v(=WnB{@l!KbwZfwMKDzWTvIo<6EIJvmptEUQE^9)A0lkF*8PVY%g_Y}FmB2flrAJ1SL zy3-=7>bNz!{D9x-$lRb{v?^!Ve#_8c;&t4jSY0-q5^?Q`gZ0R^=Gw!Z@Rkwppy*}u z93HBhpB{{$simjv%Dn@y9G{AD$jTBYbHnf+?eccxo+9f~9tLT;s;BuWcz~0v$sUW*8~;B~A3fcIo_k#>z}M zn)NNROZ-I5;fS5`4hj;jI&wuBlszUntVU;>ty0NL*cNY?BTMD5JT4~(KFZ5eGwDfe9mhbW3D2>Az1Ja|x0<@cB72Qu0~LJ8cX)=_Mv3j|R*TcnG!V@!NuSHBAL>*W_^$Ld)p)4a z_Ll6yZnw5y?EXwX-e0#NMj@H}F)CbF>%A>L-0GwVN21JTLbvT^rS4CtIK6M5?hk)s zq_f!FdWm`nUm7oHyl8#G7w4!aWD+}zGr!5%L&e{g zM~Yi?f2TckpV$q$Y$Ezk<$s*n-TNfQ&L_^C&g}i8MhrAqhjn6|HGZ(^I-gs9T}sc6 zF)X*YzN*g1^`a_FM;7I$>J@zA(p@xp--wn6cM$H*F?p*KGBCp!fu8C0E&`H!@C3VY z(r@@@bZ^ybJ<#6aT42Hi9WN7gx8ihS|EN8ZA!J*BcjqG)?c}|;UC~hx(3~+5*OoW40qGyD(J~wkR|6>dg+{!gQtXCgn;b9 z(m)fqd1}-v4vi==bjpw-~gp6&5BM4rlD$K<5ocHRopQ#ux}lXgOLr0MlZ9QQ2O`M~?u~y6 z*o~|_?lH~Ab4q&{wvN~pl16aKs~W3hCHE(r8*@R5hQ`?Fy>&68VT+uMHue1_v{64<&n zA4+?M%$_T@2((tCsJMz@ctvRLu%m*^F@_1qd-Y6}7Y^zEM;9(pH z4L&|Z?ijF?^!hizBcR_AqMrt6nSzYxfj#Jz#K5kA%EngCrZt9UQDK-v(i?2^0PQk z$WXwN$##Idt!#J#X)1y)d+=mdl#1FsmQrLiWjLXJ(M)#b@-ww>5+#Ibh%JwNdB7?w zk9zT_g;lBM<#v&ouh-Y(Q9$v@dpp|P9L6{B-zPyxL=gJ+%ZU|V?T0f#_HuFH)x!HQ z6Gk02F!LCCcna;h3z{DJ9B+r1aA@dX*_AIR4g$ZyY;Ovld=rnl{33d6NvYARIHaWD znH)GaccP5_UMYv_&@09+PG#$)>3TV3WJsMJY?9#aw=Uv}XD%BRJJvv%Ym7va(MP=3 zS+yAM6ne}|Ql>C$iPB`cPbpA)uW$-Y_=hwKxyQ8dq=J~U&b|1V^D+Ndi#$&XUd6)) z7psQAF-DJwEf7Q_d)%O)C3`+`Biu0$vpm_wmw=T+gegO^j9t3GDOVA3g*{*30?uJ5 z%PG-_H3D(1tOG%sK7JCS#R>I`Zqh1U5a{24k;|5Fb2}~Uq4)9%2rT-NXBHp@*Etyat3rX;a zI!&x8Wx+nR;uSw;5qG`WEK1uut@|#)8*|yIY3L9FfK^uvzPUIOEO#T1qw^FmGSbW^ zB%vFD>hN@Zh|~S|1L|yl9aH(qAeMggJ0+f zU$c|4O&JZM7ZWmCF3_QU8XPxv1KF60X;)5fQCNwZxjeesA>h&Kx4$Q<6W{OH0*)rW zU3$>QU6~BsU7-mcNr=?~uOX2RRC|?SVQ_X@2)su|6Lm77M^{^hmi-<$nyUC5SI8#`viFTeTovLH*l>@K06{%5Ek!LTA!GyDQOAqfL^A(k z;)Y`Fz@9H4$GOAOy`tx|fUFJe0x`anqU?z~MLvWgU#~ecWxg}VcGQ+)!h|QqclZrj zzVl^c8Ep>>+Ur2yuLfabDv@0Y9+*M}gI-9fF9tmM!uAumK98;W{T9e7l`iPcfh>v= z*S8&+u^%MaqYt5VVY%ugXT2qFJz-nPd2}sD))EIXWu^_|Q5hBayBt#7qO_FrrfI#* zz6eU%yt~}HBhddH(s@kD%)l6duoA`-X>u>~rf2hG%YJhJxUf&r82oHrM+We`7nR~r zGnv2MtwUc27~g2ixmzLd^VUi?GVLKybgNf>Y)uCf@h1DAs)M&-|1T~{b%a|81<$QL zC7kxOr!#2xhL?u2V{<#ah0zzS9QGHjF)q$t%{aU)Avx3Yu!>kyJPoZCeU)0hi%rBfp;I7ukIE(`(Wno~^3(FZ|wZdIe>UL-Mr zU=^!P!5f5YI2NHufQUeLc0FxB&4{t4R}+%e5VK%gGz}XwR0bRzyCX-hUAif_(5ehC z!H_F}T=M!`5n@Gg{+_z$0*%A}u69@gq>x4{SRIm4 z-!>6ng0S=f6EZ2zK?%MNLobO_kh!Xnp^Bk1n^opDVk=r9I|^Gi^O9Ipst%FCt-p$6 zQ5*It*a~9$xGYMUUbZqVqm#p)^;;oqZboO*30Cy18(FwBv z8)tQY)aJUz-!fU}(#4$igq6%7bw=wdc98`{cuGA$=OH8T?x|$?tJ}hE$8*)1yPVAJ zZ57uDaoBCIip8$#^p{lZFO6Ob=XhB0%6o;q@>9Q20LDAzgL zcro%K)5tI`i&(b2toY7maYB7Ml+J-I+TSP4T=~)4V~1jPPterxpKI=!JjozS>WbJRsKZbD`Q%rdKoNN+X6`hAJ zmO0m&q+dpl_NN|{mdWcp5n}&2evqXHVgK6jp-D24W=GE$rASFEs#{LHD7h|Kka($e z9&3JV^M9>ZtT0COEp{K9qhs(Z&xq_UjU2+I@#Bn-F&!?<$H0P-%H|TY+XV7JbuEnH%-IH&mI^wtYY9&T>{=*XcOGAd? zIsE(^9B!-BA+clp|1p)UlAzMcrKpZv@*EEEMd7t(xn)hW&gzg=xni!o z_LFAvZ6#Q0YmaH%*rkFM&heAcORpzT*{oi!G&YgyuD4?oRL{crxy+V5fLPpb!o?~T z_seljhq+j9#>uN_*-N=!#n+yi!}BCkNNsdv4iUed-E2vGiNKAeCS-YbDQxgD^pY|= zhWmVeloZ>mH~-!b7_M7=d@LeZ&Qb=qQhO)*bx41<-e$=*A&zoi*S=b5!=BS>;E*NM zmU@k?d%We@TW=`X^IOe|XTKKyKy(g%sMUau00ow#<^+TUM>fku;t*dD!Q zRSS1}w*7@4_xd;NJo{HTe1G4|E%gErfBn3THm&uvmq%IGG46An3cl+;H+z1scmC_X zdTo`g-lX@^uJX6+N%E~)y+7Km=zFc5RJ`Kfe=E7kbu{bMhQDj?iL&(eycL<{YJ0u5 z-Jbi;^Yg8x7G#UHKDMZPWc|Lq3$Qw;9Q7%C+!oE8JRhYF_Lj#*Y92R=cGs5wmR1wp zZ?l#(+VgGetF3*M`?L2Q){k@NH9_>5so!T}$f;W$kW;Xw6;< z|9G?g|EA%x&+N@LAAUY=?OjJhgg^Z8zS=fz=&gOVeP7q-e%%)1|F`WrzklB!WzM(c0GY-FwPefH<4-COzSeQ?nL;rTgRwcW0^wYRyO4dtrCzV1!AD{uYHZsY6r z$M0Wv%cem#+57#9-8P%!d3)Y)wtdRUm@)hAG?RaSwS|iIX|LnPF151g-!;4PNx0bv2+U(hr2nm_0)O`qr!d?Q zFvNrHy+M>1W)uV3NRHgNA3e|nmdGb0QXC}4YH-`!uZIllRN!)ik(t@rD+1(sm?X454Xm~C@!Y*< z4x7L*^AX^Q{Gy^v6@wo+q&b*%Y9mqgmg?@Jg!4@%v~JzX76G*d1BR(Mu{v;S&U^18 zYCTYiE>hNI zG8USDIhxgT?Rg!lf)Lm3N5HiVzODVT{<>^@1`f-6}%alzJ7xmaqnutfCE?e1}$$b-!H| z)KPws?rZTaBpCp2hjwK92GhQTLeFp#-mxZ_2Y28e?5*C)Vi1=CHV}$c9TpG{zdQB7 zsVndcm|fMii-*ARSJdGzV%+brl(2qP-S;4Tu(JOFnTV2l=kctX1MiLYliBC_`^lL2 z13#s~TlwT)_5*sysa$~oIm)aiB^)(`f+ko9ryi_=K?syor-Js zBykX(3nGcevj2c~Y0Ye%dLhYGKJWSRd`YY@>r7$UtMh?zexoQW ze2(ILmL2LCQi*+}Y!(Hc$j+O_c3StIkvs z*<`?c^3q}fzZ^q00KA=yws!qyhFZCAI072z16GoMFTM5g7MBecmDy4)Yn=^&z)Y*E z?I>BNCM0u{6(@%QH3oK`jy<|>M2LNJI#8#!|A^X+wz&Q!me_mZ@J&@SUA_AbCV`0B za;oLS$tAkvP1OPM%6PVqbj`W@9jt?)VdnKr`K}zj?}nX8axJnsngpyS+?|E^6edGtV4|ji}9P?EYZ_O~!Sy`E>k>9tsB+W@a zks_-d5y6_)QvqscxAQsd|E{Orj5SNl{RCimA1D}+qw0t9NJd7G60E}+jG#Hf$%qKl z2UHfS4W8*wu^u1|5&IT|O#4iREPN$75}v(a>6hC=%lsK(N9?IkWsOj82Umz1_+9od z!%!&YTOZ^St@y|P&5(=nQICXIesrUXp$^dscfV6?f%OfyQQcInksUybxyyNs@ar%E z$>(tzf5Q-GG7k7=fMOjY-jrYURPEv3k|p>TxN0wg=X{O;82{&|KpAaQad$&w*H%-s z8Od3VoCd%UiGan4&N6Gopo$vSRcX3;sDzx?*se^1BD+XR#9knb(lzKv4qt{>hu)bP;=Q)3$aX@N#> z`yt$z8fQ8Lvas|FVg}|YFi&j^lvnwzP*CL7T((BXG<RI7j#*Z7tiAa(?3rrB4U!Y^SJN_ z+qscxFcY&28Uf&j;J6f(YaD?x|JItZyMc(8F$=u&;9v{afO2D0Sb+I;_2q* zn}48aYO$qTxb<`RWxsX5_eXzj89wllPg?1dYE{zZx-0m0lvXy|E>(KY_P)F7UZ44* z7wqsC(~R8m$^RdY!qYiMd|>*!LbG&)01-@wqw*u>1-!VZq*+cI|Y zU3wn9&>MezTVHpharZcD_V)|@av$^3UiPJ4!B%AV1wRv*SqAm$)_QL1y%^AJP%t2z z+zS*JE;>+bEOaIe;f_F}7I&${a5OMj9GXHC9+D} z3T?}8Z~f2F(M;3)Wm6worH+~DS+hA!WS8x%P}U?@w>-<=JZB4trL!$=_Do*gq;X4U0= z=8N{r4tjC)C4JRPc;&Uf`?vq@s!ne%zR<@BihiC@M8qUl+hq4^zu(uN_f21yAT#Om z$+F~K3#Krel2q&Vp&otuH#oC*JPypj()WR;^3n`{vFzTn^W)j4Pnxp2fv?hwXp50& z&5opVs$AHR!;a8B`f&6K$Cvj@CCT>| zdEe$!>V7MGJJ^u0kpi`*A>3~0p$$gY7;_*F8>G!3u_D^qxX{Oy=%i(0t)z z5w!ny6dfoQY|Ccox-f?$kf_C_OYDjU28+WJN^URBGL)5*Cn_o_tEj4V_COct(n#bQ zV>MH?SetcF7ZfUu&d{r$HE1X!V-quTi(`3T_cpaSYut<@mYWyb%w0eM6j9tnl%u{1 zKmabfjg~qoGe&Z(rgyP$@>9iyx4N41~obSSGB1 zs}iw4Air;vw~5ZC6AVc9TMpzzE^+hZWxj)d0i}ZL3Jn+LB5=`LvDMHpha-@v#YIZI z5e*C$hbNSLsnm+nCR3Jj<&o%$O3Es#YMpKG0$naj0=fE34c0_0)J7fD1%*nZGxX|b z4I0YG*re&0nYqQWysvvsVd3|UHu^LvbIX!z3g+cED=)wSporpbVyQHxeFa!mP1oq5 zK{}+Q8v*H%kS^(#F6jp8I&^nPgVNm~4brW2N-7{B(#<`DqVMbYijM8 zRWq~p%-Q&dO06(Dn-)(@xRzQ1Mrs-L6k1K6I0f^zFSiaoN8dL19-OH}{R&TZmVK-F z$14E((;|`y&*F7!V-yh%aL~AA*}F5uS+Db!9}Vf$T`f6PrQw_W4*alJMqmlrc|9!N z&5)^TF(rNZ!|U>$cEy%KVX?6`)r}Am9TtDC8JhDS0vIe1&Awqu#>I}ljE8t0B{9eC z{5)O610#X9$4~K*9cr%dTTFFCMCRKEDhAo!no!xjY~2nFIjcGg6~WX{V33&( zrR6{b2xB;+OJr~4m3of@G+xFOo6e5aj(XtreL?i84-AZeo<*P|rA;fB6~z$3z#y!% zU)U_J{oZuO@xuLZey!B5fBKS#BlG<;&>^*8Z)6vXAU;s8PVU-8TJIc#R8C*OE!9=WN+-{_WvS)&Si zwWPWzduKjqY%2Ab$RGyw#$gn+0Y`K6bZ45@;0t*7Uh|HHX>OX@4-F=sAK6cEtwsfy z4`}O3RxAgbx^q4@?i$Kq0$V|Rr_0J##^LyWoNly)DXn=xpk}HCS`|-qI@W%-M6W-> zIm#xzB96eiHzv@xccP?G_76C3jZRab(F8GwpG7C7XfmoQsXZr4rL(u# zx@;TM4q2u(uF}6zhor8rntJ_93H@Gfh21NmRc!;z!6(uP9%|tYrpUM$EBf&lcpQ>K zP}IurD}oEuM7OY|QyfmUR7mP5RJ2umSmofWV0wGHRw0A71YKfOiErFbS7% zN`zle=SiDyKMy!S9z6iR@2}u-qNR*%+I)Yja^AUjTgL#Cn7x^4vE7qB2&QxYR61A+ z-xw}!4IOj-Apsqby~%oIwjRu&EoTjhHg5B7gS@QbCdAvnl$?q7DoWvI6jr&JUL;37 zo~Q_q>@f+=PJAgb!&xsUcGH~=BSfbA5nk=fBu|c7VU2F3hAWO83?v__Uvgl@_n+*{ z$`ciA72$nOM=%E41@>E^G8k{XU58zUkC(O9$D3a3(!;y@skd#zTTr|nV#=GW6=^wN zgt*KXgmF>XIv-%8tEl!y{phg*p!^Wag-pMu@HK#ss7JsrWUB?|b9aX^{3muD0s>T= z>JNF4p96!!LS!P{Y#ZcVbvgyNqZ+%tDA}oFzSx?Go+5$YhCSh45=;y=l>^EA8YbPx zT!nr4*_^gpsT|u5%2R$N{VJMJWOZL8{LkdWj#;GoCu&qg9i!1?Z6cJAs(1w_KfB8F zHh8fLT9D08kyR(tTGoEB8+ATrl1TK7f%2r+*5170B5#Zt>ndxe+i|vQ;$~wRbegTh zm#JmX>|RJ@t=X1EsSXq%geqV=dV)jN{Yle>#S<1*^})V1gEU<79ro- zt}T6aL*d2b!&;@wqHv>qPka_Vb!1^6pnF3id&g6w)g)sC{gq{OGQ!ysAD*(!cihVa zl{|@WD@K?CXyaq*8!jr3u97Zikj|U}F5?p9KNM4C3K zuIi-Pt@vEhgtGI{)-{}mKE2DV-N=T(imP_iP(;NOV~ z0iuo~w8yw7Rx|v^&Y}0@$gg!HSB6$%a^HHE_OmbWdS-JO9W?7sDoQ(N;?NtZra))C zBlZ2jp&PHV{&a`?#W80?sHp`Td6{3?0!J&{v#&$#{ii4%w7_|1w+Wbu(#pX2bqT%M z+BjrCXD6Z8W6M{>ZN>ynb)A0QUTm{wD8rnXU@&Cg zSM0cuncu~3kwb3`CJZNxp(RxDs;{+R0qY2m;=I-P&2*TmFw8E|vs=b?8;fGW@{NOi z?*&#?qOj6`3(Qj+m|#{;=l0r1TUzV$O|K2<(Hq|v2X4c&-Y8>W1?!&00YnM<6g$&w z)$`4u&SR(r-dGu+OV1Kt+E zG7kC95H$EWFYQB5XLzV3y$0jn6xz@RZSL*iP=}cx=QD%H7JDr-jq}M$xY!8OavG95 z^)qRVoFL>FZ${}@BaOyRJu9es%sKjqN~V;l-0<;4gx$Q z@ME=DE&10Era3M3l^DP#`BFN!3ykrL&C*fC%@+f~|Cn2YqOUf(Es9E<2ed6Ed2*(e zw6IvCLWj3sG#f24%q}1L&${OMxYZvbXP&GBHa`)eq7k0P^krs$RN7Z-U3@<&jQ5iB zwPXqB&&y}ETrYBrpv`;+&EdD*iPFc|=#f4EBIwsql1HQl$<`M5YTUhibs!Oa6yxVG z`m77aaOvKSJ_)6$?0hLNv5=e7<%*(7(%oW?tzb7J$TXD1gRCv>4_-;v{-tbR+yZ_X z2*10m4(`w+^(Js1#@YPQYZM*G&S(J&6{??#?)f~3Rld?z3`ql+G&p|QgbLt75?WY~ zBSX(W4&h#3x3ZH4O)IBY$o;Uf171PyA1Y$)>8I0|?4v1Psc#nZzU=SmBaisfaKPWY z6r9fj0GOW{elHf`QiEP0=`NVP+G&@iv}9rw7uK#%qg?c8OnW|d&NnN9_pH^d#RsWe zsIMi74z>*z7dl_EM0Qy-Ze~PQV*LO*lbV@UIa=+EvHCTpH$G6+>YAq@eLm1dva)c_ z68<}Y!_y`5o*6*MO5w{^Fnh{6do_RjnLvm#~Md~ z6N^WaiAN8<@douji>Xc^D7P;uNtFVWrie&ZeV|_u28U&%?A`)^C?gH#G$8lsrA1dF zY*x^;dgMBs*a7gnX9N~4$oOxfdMJ=qwR8C3 zp8je>xMq9!p3>Vsy9U{H8n6?eNaw5 zpB`Ck`}#nN$Vxtqp@}^SEc=K`_fCQyISMM{7~X4#J+NDn0RWbd zjok<){D~`%t7p1EeS3SJXOe$LiFqSz%<_pE?>bn2_vf|^jH@I=1(W#h77z@du>`u9 zvFyBNSbsYGnmYj^HL#)}?vVqmUugw!mXgB!iUUwT#6J2RxdDg-Cf)u@004yY-u-Ib zeGbZR>~{&bzMem85&szh!3yO6Nccx|X{e=}<`b<4A1>4T4`SfQGoshfQ%HC7++Rg? z?f^a=CCEDnc;BklyC^{C{?2fJ$G*EqhPLfrTHuACW5f*ZXKTXtAj*$ z`Ft3P76e)ntmD=^=y43HmGRA(2E(*8Wa zZZX9U36DdR&nNb-eq`Gk=-e~l^#jvDu}_uU1^+dmni}6#|9$oS4gD*Ckm?vPWcT*J zAvJA9Qv65V_Z6@Hk`CK9F6FP8E9g69Fga31ud(t#K!?k3a1h;Gz=$CEKoD#%oAv{en~b}# z(JE+7w>&om`Tbr{TGI;;69;Aei!Aa4Z*eqs<>pu_xuV5OJ%`4-T)qdgo;||Vc zd|v^)kmN3Xs<%|MnR7x(srtranh#=8RMc;miPX69=BIM?9 zIusPVlv=q^luEk#I_WgA?@7OZ`6Ue>jcktnLS-BtVCez|uq=p=WHx1T8KId+d!GBR zO}ZBzKFUw}ew!Znd*;mqE)8D`Z`xE)04A7Iu#{R*um|A-@>!XD!lp%%Nx%RDq}|x1 zo_Esi2^bJg0D$a{1sK4X3ow*nva8tava@ywW==j0@^ACSkm=h&BP5db?n*Ox$B^M* z<9P{5LElndTtq}!`u=?a+lrpQP#T%IzrfA%6aA)5U&C*mhXVi(@ifE%)o&K3Rk}S} z?!`5XNLY(sUp&1YsR)B2#^!I2q+qu7Lz^^)OZ}q5l1O(mK5xp-bVY`66b`|Zln+~a z^qo|2w5YW06!M-pJO5(RzuqH%TdCiG??03na7RVHkxOCpf5GujohK@Majk3>c|c3s zw{(JfUYoY^>Cr4h)sKElUlI4r=Q)oT@+vPQ&1u=RGVF++hW=uSaBF?03j**eO51AoO*$_v$<@@g;Iy zTmWTBi|67YVh8`j1vtdr!4z$fP=a#KnOy0?nw}%(Ol zG}AEdW0cAi5~@lY2Fj6iJr>lZd}jK^G&xT#^mC-t&0V=%XwLZ?l(++$kd-cTUhG3{ zz2(~VM)Ev&JH-#LDviWH?~qWOg}WPuub5#dn~DNdm>h`yHwL zfYLS@Z=)0Oo}d%CW$}}N8A!uzH+${1++!(^(~X2Hr8ODNh|8B};>x5lb>9>cWD-s1 zCB`bX91q2L5%8cDAehUL&L$Qqh@g$Q*{GYTCnReOYuGiy=~zFSIS7BlHXx_02Y{(3 zzpV!?iM8yJFPJ~X0^vN~tD?WSx=!RFRTzMNARZsY_OP>=w zpW#gZlQH@tLPhd&rTr>SJHcis@_usQ+`!`j_Mqxub$B$@5E|M;)tuGAmu&_8ThXj_ z;d_rNlr1$Gm3q5O)tm7z9kvOPD#O=L$c^w*8xr1_uxfT9^G?fn2l2wiQQ1W2N_l+m zIVjkVp%rVkB;5RY_8sQYLH;5_LN8PD6p!eTY=pb#+OU-`$3La2$2ol?H5ccJP1$Ai z54ugyFP}s(^CC=)M?Z>Kc_gqJcJZ$PKCUA(RKvYiV6OaRG@gtoK#WzpKc+{dr?Ag- z3VtP^!B33tb^7XnqDB~xoHi-@MQ{6~tO{jnsYIjK)RS^rZEBTBor>g7N@p}oB`mB0 z8kx%HpU$ew&Rg=%dbR&>SmipZn<1gpm)=wUM?}7r)s8>7(jm+w-|#GghuH+ z6YMm8mA~?eGGc-pHfE%^qL-T6px|(b1;7H@4eZSfWd3e}W{6hlSJ{cW6*_<#$IOZG zL?vSy-GfDi%Y7k3&86IU;-W`AoZ~QX|5)%~w(N^Y!dOOI)dc(Z4rB;@hO}%5Ac#vS z^BtTeY=lGZo`E4*E#LBRfLfD<2`Qj%G>jqat%Kw2(U$ zY56k3eybveb;=dUXL&M3lJOMhM zrnPIue1|zqq@R1iwYzM6;=0!V!#b;Zrrd zXQRuOyxCMqzP+8&RPyc;;W;J0(u-TMsfOd69Ex#IeS0L;+>G=^gEC?>X-uI)&33Xv z!AW8xf9EuiMReaNjbiY#MmG`61l*GxD@03gUY{?aHS8wt3Mq-PMiX8!bgTm5nxsL` zWmTm^p}PhI{oT#AiU%1SU~H}Y7i=iX1a_y|?UR~PcQc!oR)xXxC8T6YYSibEVCDTbr0%ZV{;E zSEO3IP#3Itki=ue@(k>TY46*%QSi32{m>i*ovYYmzN(AUP$*S`XerYtUsBrWt!id^ zt4UZ>bCw_p6xB1(Yf##9FZs@VREa-lVLX%Ro|{iM12>z`mHcC_vkXKpR?`XFaTmum z(en}^G}QXLEJ$MZSqCN4)9rE^O+nIW=K2#%{^>$NN-_$mcB4R@@#`$PSoEw$*n20aiMmz6fgVRIgcizACJ_DM7^ z3M?;ZupmnmRGbwGQ5JnDn}wxX1Qh$O!j+SNpLRA<))_bzw904mo|sm;)!eW2XJNyU zD?868@k(|iWSA=tu~`uvQz^mJc!Pr)Lhmj>hpvwZGheda@TwbTm$@6pH`RV@1ocI( zZ|tZ{QLP#=uWC;|dkal0Kawbpw<0&d?0s3HtOYjl=w{@Zb``OoS}F{8>$a6%#~A8M zZE)FJs=OkDbwhh9w@fA@`mt~*y*|g8{E{prrc_-tVp3iE645+T*sAS#wg38(y}LBo z-nnDV*D8X;lh=3N|8rPmJ|iMaafgWN<)>HX+!970vl+qfq(IRyWaG0`>GZsC$Q*XL z3+Xj6%+pS|Dw{SbJNP+K0x|v6ME_Ys|I_->`5pUoPx_Lrd1wB8AOQh^bA+G6p-@6v z-^KoW*76^_2xt?-m(iCKdgdGOXYQT{MzIH8$8zbfaHtHFvJE^CD`L%*b|;Dy7)uoE zg4fE93zgi9hTWE$tWO#i`;GAOOC4xe$;XsA_)AlgCaH}k>RJe|wl60;pNwl3fWF>W zBL8Ko-RO)=2((SXG0kf4#@x!Jm5924XwXm>pX4pGkw0Np;DuN(nVt%kDrXdfmIIxD zWC(90AzVhoB&s;HE=y~bj?*7e2|k#{Fi&_iDdJS5y>~3A@x)M8AGfb6EA0I_u`zcJ zY2>3!UOw}Wuc6Oq(HtiT=GA>FH0EAJ&`APNXWM4`jP}u2AT$T zCKye+P~MYDD0*D;=DYa^J1p122F0+XYJ#+M$ntbw$ykowQMSv%BTo;*@SP-a@*d08 zZVacFGEie5*TI$}425O2SVNl|JT!tJ_=2&ERFU%ZBnScRG zv`9h6(L2V9i6~h=O!MdyRvok>FGa+J_iyn4+aqa{Y zz5#&h(^9MPY!*yLD>E`i!Y%*#z)(J&1!3jp^t@1pppNeuV~5F_=W( z>{!VvXHxAecu8N0H0`aSdX=Ly(RD+ynXXTUg>+`FTuC(Nf}qJ)ZqowA_|B{f5}tJo zy%$6mn4_NP*^K$(a9ArCd$)96lWkvlH73DZWiE;^Iu!RJktO$jiYa%Vjjhe_iU)egU6+a1;c3onxiBgGBkRT&P)OgEot zh%Hm3!m9a~x{$FIjhBK7X7wvj={jv*feEhx{3x^>a#5!}Kd;lk(-DYZF;gISnPTmS zKa}Eduo(t)W0LCSX8jgD=?_Ls^u?r}fA@Q_E)T+Aq=5c;5_aoMDs~?8J6e^wP`UHX zR_M1G;TdUQtmUfJBcuR8p3&HeEj4bE8mTmBA=En8n>Da&4kqNlZ=1pK83mJ4$05zN zxtz!F7kXeK4q!Qt_*eAr`^Sa0D!~UXSVtP&`(*wqroVHQ$a*a{?~fZ<_qZhqhQkGu zXYSm>+qsNUL_ci*`92r@GR-q`V`~12qFCfA%h(dTbFo(DsOT}c(|Vi3GOeN)>b!^? zPlSfM&RU)vI>D#Ex0;v{qc_rDARpSqRIAjJi>G1VFJke>V$z2?b+f_9l2wbM`n+5N zNnVYSO}!b5OjFFQE?i((fT@&<>r(Xvz0pO8EM_Enmij;p1%T zh{FQ7aqAK-pUguslyk`}GW#i}a0vE1`Y(#aV!!rDNpg_w z@9jyXz+%3nLL*nh%O8n#oRKtBS24^}l-g-k3Hx4PQ$+yhMB)8R#A5; zAN;PR#sv4kb8M~mjYhP5QN&_UVTree0l+FvTqF`W$XmzIv2$eA zoWz5hjO}kd3$#Ch!>Y$X!^|w zzBnLH!>3nXkJiXtLdrH)%`v8YPxP3Q{WtEVCNz4Or9)C~5bZ-q>LlHn;bS4ylDUD( z5=I(-goO*L5+c8mV4)z)T5>%JQ|hdK&ae5e3n|j!*`a+-U!$>Lp!Q~+^=`Yw;p+JK zX8h17Qt)rnVZcU!_G$BtXM^=7`q$r90fB>L-qdBCOt^i+lpR9n<61USSiL0bt?yxU z4sLL!0wzHn!4%<&BT0=hQoS`)g#$MkdJ0%!<1XY*h=F1vWt}^v`qoe(h%}wjL|u4{ z)XX5)!@F|u$3q9-W~)p_bA}VSRs`XSztfqxH8t&}@(LpVEPgusDqz^$ICc=~n0t&d zE0TF)qjAg4>(u#!H;Ez{f7J&%)Y%ah@@$NeioN21xS1>q&BQ|aI3%}m^EJ5f{CA?8 zJZ*(SLblcYnL|@XBMhhYmqi5QxxA9z(NX*B0uEPnW!E5ge^!aC?TwG)CIGRW=s-8V zQiPq`IOvjL;Y)otA>=D1M>itv2}aWbBlhxz1SbPTk^unXH;%h&M}Xj` zM8O$(!GJvP0+6#pGkf*MJ98V_64rV?z}|F8l;*_T3^zkEZ$ zFT4DRx8?r6085^XN#E4|f*HZ|V7LD+1OTq)NW+rd3N#-8c;gbr-39|ZdIZ3zeW*hO zxRI=1GhR2WC4`dN%O-LDmlpnFAh#JLpAam7hy;ZQU@7|xeS)Js&&}@1|6Ks$N-5qu zrxm!A?z;bPHNl}q?~@~EQXks)&!WJ4+Mu+tFoT%$TH>z)kcc@fn=EE92~awit+W6j ztS!=C`Jl)*Rew$&ZL0pq?E0n)UbvL}_;RE{>iJnwgb=2B3MygaoI<>SH*?^8kpI!c zEcC|C9mW*&41Odq6mS#}QHlPE{ocnak0Q6lQwrYakst$Im4gkOassRmX1u$SjgdXR@ z>w~)dOZIQF0Km4JD<~8MXTVZD%>&Q7(GYj4=Ks0Ze2_9ZcXj@_f;Xqwi<#0HNlrWR zA*^ydh!oHVMYHg)*AgIh*Q_>FTAnwEhy2pgG63)p@X5==?|BR1p2&%o%q7r5niF~=it@ug7Lph4 zGz?ZxsTHD*k5^SJY4k2KP*(|68YIR)4X-nO(={|MC)lq^=YCSe3rBHsyPq>H91pZ& zj+Qd1NICH z8?$2JU;MsLClUu-qVGQx`WFc1j$cG)c7GVb`*J8k_YdWR44wWr_WhD^|AmYP)VFk~ zROpKFA$dsrSLm;oX7)~L+NLS4hqw(5()eKIKhVyTpk|A7Ff{5CVZwg$mow3`YZFO7 zB2g3yd1<3gQjit@p2Z+_PdA&bvZk2EtWYr^sOI;Sd2-Dd6pB zv3{Qp{6(8cHj-#@fA471=tK$qJ2VsRdsZH){}A`T8+ShxxY=A*uUDf2fbC#NzYyLQ zyc?PD%JLEUP^CbH<1KQ(urapl!xQP%{$9Q8IBw1)B9d1X)M}K{tG^AcoGT!c5+YmR ztPrnvJJtL8&mR2Ugui3JKu|DFW=~~&N^x_l;rg+XoVcp6lEo%LeZc35Y*~{x{%KxO zL8sN`1--g}6l^!E!6RBi>!%&?>Ax`nv0xFrK2iwgfJ%Ss2<$-H$a?-e^FIN|4ji}T zkh)uPhs@ax4*vW$@1Bl_BH?17_n)O7QuG~#5jiRU=V<@{H23=T4*UNK)SazSduR(h zVE=!CTAivYutb^L0L%~oY#qQI!Lb1lT>yYi_<}m}z#|BM9322NX!uLO2~A`K0I0OD zcEhN1&?TYUPd8x2jCx@X+!crc)6+xLl%aeU2ycU9J)n6#< z`y4bSruzazjwuY`)42pkJ}C~`H`7ZgaLc3O%5lvM3DPLgDIdvkJ&Or`P1&1G%QyRc z--U*P-co@!&)@7@a-TWG!R-HO6HHZ*Ety&CL8ZU8mwRmV!>esX z9rS*}(Xe%}!fj%S%I52l^SVBUV0YuwQ%f7FK!IwK{BLT>gfzi=`<)Q*@yNZ( zkK~JA)(<=}P%RN}_Ey`xIVAN{D_LSTdV3qTbc?y+>9)JZILyp2=XzN+>B7(D@tQ56 zQiV5|Z^{*$ButD=HMt`og?Z7V0~1zFSG3ME!;2#7`|2s(DI}s~mb$4^O@BB&rfMHC zYU`Kn;905cosjI?+BIh+;flhel4kMkgiCn5LycwU{zJ9r>jh8cbZMNdCE|m5yyIy? zt=aJ(17X?2`|o?6(}h1UA4vO`L43%#fkIPHDoVQ?*Z$Jkzl;3OF&%V?F^XH{2tFz1 zsUZ(*e&96CHN(z-j&;9qwfr$p0h(UE0Q)r_z`=<}`;vj|>HS85=(%Nq=+NHR-})~c zIvnAbn-58tKuB8Aj(}*#iIu8g&oURLnAqk1Uo6D0MgRaLB;wIx(LyBRt6lM%r!o2o zF^OFjsp8Dqrl{ukcJyQZUo(PVWAV*>hWv`+feVWfzwiRt^8PG#4+j&A3q1s~D51rF zYct9(BpLsPLRbBd4KNnfN=yF>6fg4&6y=rfu|0kE3;ztf+#k5c4IYNsJLP{EWbdZ8 zC%-BJ0G_`WYa*1|!<*_xC1}+W5(&krBg$FX; zRPf{|c7i8^BYxdq3R+<>fJ_o-0cvKgBj%uuWEZIj zXs-a>-An$UpEsup(iTCvw;=-|X2|99*Gz}65)~!A(W99YKFK_qJ>m%X@ zgN_igqdOMvBuOtcSs31)(E;m8x{gy0x>t;3-0s5*xciRMb|znTrMXqITOEBH{IWI9 zagc5yShF#BKyT{t;&bWwjsxNc5ewhW_-*@~VLB@NPrEUjag;qsD5xl)m8K9MB;dy6 zqX77Y0DQLqDhdE}UJnHGgQ9#WLXaq^^!w#>?V3iRsf-K5m(l~DSwT7fi@<%d*@9~JTxp5Q*!fGlz-QYAtH_^x zTyY`R2~{@Uo#gLIuZImB7Ziwp;WKRp84e8rJ)&0?Bleat!M-6(cr?{4Www4Tw7V(2 zk&<-tIBIH>rIh)6ACoWkk`N^iRf5WkR0w+}%7r7I6dol{)PW?C(-y+-ln6R(flu?= zR8h2#JDxa(uoacVSxgopH`EgjF8S&QSjtZ;7p?UT&$OcNqADiY&%%S#-epMIGN&<^ ze%al6^o((r<@jBs-6l*zN{Kn*4x8WC4Yii4&RKt06>V-xLqp7WA(l_MC#-*LZ=hxR zL2&>OhtfZ9jX1Jn1~7`U2jPb=Dr%eyg+F_d^u$J{>uic=Bu0>A&>Wzcu9WDqGA#R! zK;0|xTElxWJ@a+Mi3;Q7w`Msrz@)-s>urP;&Eom=0?L`)gO)|k*cSq=Df-vGX=E3T z?ewj9^p%H%1ZsK)&a*>_eJcn&V92k!R=|}s@?`xGmELUq*vNp^Y1;-`Raz>lpMHRG zDiD2%=^wHyt37L5{^*1b{IZQ@Sc+0*3`O*)gC397y>$6`qK(nOyRL1G+|8)I()=WR zGye$ov9U+Vg){j@%~Bal4y8=v1r~mLA4{ITe(b7{-|ZAj$Dmaos{B15WvT~#h>Eo; zG&ESgDR2r2DIeF$g=ttiuVd;Q61zYtv`?TG>&=2czeQv1TD(ArA3sp&=HJM}IHwFGMDsa@sf9-^DaCr5IuDQ9Yy` zh!9aQd`_?whDQnmr|wbbAS_t%HrYG8Rffb(O;2nwR8rkimgNUh35Ja6S9JA^^Jp6=46oq7pSzW*8!~-y*0{%l>2rxqg2n1>fyIG zP=X2_)@Kb#xP7GEWG1YqcSlXLj_eQw&9~^_3U!ykUEAoy6SjqoISUH9*v81Oxc8#_ zG;8YJ4#800|0Gs5`Mv{Ix~=@Nc@mjXgT1Z$Z7qfMR@Z|Fb*}Ir(uyVu$6S_@xBL}bHWLn4R zfLFm4bsQ6`IraP7(tKQ^7!o-2qpK3ZF`N-yu9fQY)r8Aah3$DkE2}~Cz)V8 z!*21U>2rAlQgyJ!4 z7g+_gCKPKa_(Rso-ZgU_bSQ4IQ+tT?g)$DJ^B@mCrS1EsjQA-f6YKa9gTbDdKSHEZ zb(Y&%mjHjOJxBQuQVyG=uuhNsTx5^E$zdgm8R{&-5jaLpl*2on53fPqSyR-a3RxN31|E(ag1B=>Z?jZ$~{u(+*KcDpKTz3n~N zyc-a%QW?=hG$6@AiPK^QOhT_CtMe6Wv>!m?@CmrX;9>$PgbKFxV=)^Tp*DQP@G$38 zqijiok)n=AhNog9A7gD*Vs#*1(gy6CRh%0k_506-wDu|Z=tY5MS~S{RjMAOgootOQR1j293yQMA zUa{f6OtdDh$ z93seBA-c7%m!@B@l+PV(>=7XbcpqYmVvJ_!6A++)M_;U8>}EN{JuBa$@srMq4>w@*8 zF68|@@lO$anXOw^E=*+vL5b!{(hD9NW?44olTrea>>9$*&tfOaoO#X$x4XGTyp4QGqtkk2(^{nNaNI4^9o|P9{}-r5i&iO zmxB*~&tUDV%a5PCX1V7w?|hbs=)gN>z4-RbjAp3G(YOy&d4j7F6ED6T(J1ALBtp@? zE)-^YHDJp0CEiKF<0m2QQi+ITta=}NjfsOyjDg#pY5_xhr8lo?@6#i-!K7o0tIO$c zj&*5>ZdFl(<|N)!B>5G?yh7-t%7yepLj1T)k$!j>Ki&O>mI+--SQTd`mB9YH!{dDN?ZHk zu@0GIs8pT)ewxi{An!aLra1l98|*}B+4#o%(X?{xUNb=(@h(p1QGd%fmFi@qqw_!4 zrbaFa4$4G%cEn{|C-$`tDpZ=s~ zfIospLImeTK;`od5;71Te`DAhcJbqQX$ioFJvcx|TU=yezP*KymztufF+az{-PGv5 z%X+CD8=mG>{`qyaGmV;CMjBOIsRH}jC4+c8NnE0zlG=gCXd=S3-CLAtCcMPuGG5h+ zuRU>;3tp>)m73*fNZEa{g^P;$FRO8@NyyS!;V z6U!7>xbt(XV+21wuE6_Vpm_Fz4h1OYv#Qoe92I|c5m#11C(ZNl*_ z*}i|47DAVeEY`#UN5HAAc@5#(Y4IB(*ibcvrv1tJ>yd)EV%eoJ#hbae^SRT; z&qgiVRzaU@RAA;Srgt3+J1U=z;nXyXJLl|ufv_VXbM$nFX5y`nSyQ1=K$6(PGHkyV z^l@WMxUub|gIvj?FR|Yi8T^LOyFJBIlcK9QnOPpo)CTr>nr@LcD3`uz;rLNM+ct8a z5A<)tjd!h zB+crT@kBU2Vt@44i-c!;nLeR)Xy4StpdrEd%Dk`%RKX&X_)KL3mmqOYh0y~kP^5^G z_*fQ9LxowwR|3ju0e(?&M6d!TC_n+)y%@55Ca*ror|5Z-Wsh;XLP6RHep}UBs1Duv zOEElLXv#^Wht7^?2?73g(rkArZrZ3eyg$i`z|+~!CDf(0SYW}S@cHJV4LOZpR3WLD zo@G^l3hucy-GDQa+0_%AJK&%)Ar|e2(Ux;i+ew3~jPSPwXD$pv87aQp>? z;X9IXB@1jCvR=2C- zof4{NC^SafpTD^o>B3>jPlr47AB^~ADLCseuG=SO;ZMpU|s8l(# z`QVt^reOqL)B9d)Elz9AbsHPf#|sYUwz8Bn-1PlILiRCVlnt?s%HcWYsB{F@^pB;f zE)m>!j2#ACnbP%Os5haU;q9DWZ*;bXw_*Nym{$ju|K*j2UbB=1k6ev@-{!oqH>HQM zYpyS$X$k$6M`Q73;mX?SP6yw`f+xKid^Ivx>$3?60b;`NO|R6KUHDhU?W)5s_aaYq z_w(xBTQ5tqo6tA55ktJLbrl~9CY}D6nQ>N?+m-f$REv?svu^`SiSVO7G?rw2?7#=5 tL3nL*luX1)iT&gEG{BbERF literal 0 HcmV?d00001 diff --git a/_odoc-theme/fonts/PTS55F.woff2 b/_odoc-theme/fonts/PTS55F.woff2 new file mode 100644 index 0000000000000000000000000000000000000000..0aef8b14ee786e1d1d492119329b3417a9fb7f37 GIT binary patch literal 125592 zcmb4qQ;;xBtmW9YZQHhO+qP}nwr$(CZQI|>{(EA3o|6}Lc_)9n zCbDXVMPne4L7@iZ8xf%dY)CK>NY$dFV$`-Ek)c`;L{$Y92E-Z>7y8G8+wgc5QrokC zawg&jd67^)+Pq*NMg&#r{HX$iu=mPEiDk|+wJU#xObk!--+%v~D4zDutG9jMd!OsS z@Bd^TW*9CAAZUUDf})BFq6j*x=rEw;v^&+xGV9jt)?PHSDoZU(%~Cs4YTGa>+cdi^ z34$JGAR%>~QJ%nYK4C!^jj&8ESgBc} zC`GF~TeNVLu}-D8H$n_uL5nMOl*DU_AS!*7+3qy&v%LX%BFkHqQ@P4u;oQYsbze-W zN>oGZGY`nj7Qz1XDZkWg??c7OV`13PH-++a6cqO(i8|-k1?`8>h*W z{TSlF&V|;Mjv}2lpU=c*zRo9~Der{-qLkK^4YkG08bEE_P&{oY-J%d>tRb^BWl)Zi{RA#j@ zR^6FJUQ2JOUdWX`eX0hNDcc#@TtpG2Hby?`Y-uV=s(FqZJ$_tm)Uyd+tZ-F?85XA| zP4zx2qG{U}W{$gBnK`ArqIX^-Dx`*IJ-lh1p0-~*v;wA;*b)A&AfDsGHCknTwdN#$ zIr3t4=1H!u1l5_mE}DqERZ+WIZ=QL!U`-tx-TLA6I+KjdJ~9D0WpxreRK}@L#5oqGyU3R=H2VGH+K}l|B+xRLPbeAr_-joh+igtfUkNp*)aPA zLnZYHlTBOEGvyVAM_sl$bo{~nkPi`(dm(?sANt4g%lt8aWM6*1LIItUXYj)F3;ogk z;C_5RxDVYI-y89(gaC8YAM*$GQC)M&dUG1s0PD~Hd;Njk2!DV-!f#SP)U!W^Ejx4w zU@_>=3=s!1p!m@abYT184s?L=3l#yG7Ju9y?GN-*QYlWw>;=yq|Hl{AzDNZRHna%9 z5!S1`v(6oa!>MJutEnsM?Fr*p%Omb&sSWi6_)Gb-e34CCPGif?3;bsYkTc5fu25Tc z6T{3K_lHO-*$7S{7lrbO_55J`A%EjVy*K6gBTp}&FB1I-hmALgN!#EA*_;FwBGpAB znvhN}mH#*|OB5_tK;0t!*gt?jz!&~UY8U*2TCJi6^45B|1kiy6a^46JHo*R{4qZ+$nUXkW_{xM zv}f(svs!$%t_elha&_TeJ!iFJ(0PzxfBZN27h*5YFEounR1IxM<-Snrf<3tD`hxx| z^b`GI{`fb-AOFYx%m49rbU*$F&-dCt%M!sIa6qFf5lsrdG12z;W29D11LkwrauGnU zlZ10}P@s~_X^h59rvl(F#zR`gwTufuexmRa#Y8VK*|F_|CZTAQ1L|IyI)Obm=cp&z zWvx2=NRC2yN$Y}Tn-RZ6Zuw(oCiLf{^XIp^mFvgC#aO3{q@PUkz?yx2j;kfHoSW+7JM{fdQP>Zh*}W1|!xMLIhSS zn}HE(#8(vX^;P(BpMCLd-`9sY8xDBR@7w(L?nXM%sT*;bB_Wv!~g z1P;`p01QdOL3)lsz~I_Y4hhnWX%_~9WG1biBmh)5hfpMVo`ZxWGmw}_BH(~#P7o+^ z_L2e;d`~43Img8;gp$KsE`|hRK39nwS>()q+&>qEkYt-^)bWKW@o!>$oid#og3!f? zTFHf{fk=>O&3GUqoY&YRZ-~Wv>WqTKFhbY{HIEa|$1-2vw_0B$a}%n|@%gV3`WC6aoSy!UFrokSCd452Dbb z&(>+Te>5ZQdEXYjN>L*r_Dm${_tZsgE8VMKrzNgAzGz+lNYN%hZ8~n?%0SvdRV6@Z zCnWe6|6116BBM(~jsxrtIjQZsOFBcrBKncJff(S&e|?WB*UU>UOpi|xDg`L%0mo43 z(j66m%0Q($?f#`@bN$-yzIDT!wuNIsAb?~yQoe6s>O^~WFl%TNJs36HU;D(w^jA%_ zsq93i@JwbRGYL7r>O>})8Q0_Njio<=pomdF;`VK<=4R`bR7j9E}O$jC?|VZ=;;fr2`Xh1$|&YuS3&`q!FMY2VQ?dixK3yuQ!w zH1%yRj~{22GWnb;Tqq{AN2 zGR=;XKv>GJ^{FP0&ATvD;V3*t2bJ^p;3_ey?bYWHO(uInGUx}AhZa6To zSbD^5VWi}hUFe6P7kNNF_y@Qx5vYMcDnb3eo$S}1^b&LubdWxRFaH!Rm z2JssV#Igk0s!$uClhO%#30hp=coO37tVakCSe zkIMX9e)DY`5Hyx9vt%UJAtI8U)%4XhB1>Z>5-#u-puy7v;{WXO57M)nM3RAj$Y=)O zDOh%2@b7*@(SU!z@0+^cMDHhe)2i>~rUBk!1^fWz$Zm);Y@(>Ls#suq^aoFp+DB+D zKD=jKeTS0(AQhBAOOl8xr3G#fwQ|%87)z#|tOJ_miD)}%8GO-9rEDWDOSDjs1IyV= zvfcVQ_=!xWJo7K`*(WiRc6m%P0sqc=a&L^v<>>m>OOvDzg)fJ&}8S6$Z$;^f>; zfj@IZQ6Ri-P$kR4EujGD;o)~uA|VwOZ#xl=I58XeEwiKl5%#|*|CW*vwSKfV4*ou})$OJ9+^kcdb}+`zl#K+_vV<{vsa=0@c$|Yvx_zl=Jj|e zmt6l=U|{dsSV)c#5RH}luWpeI3IP73le>~5Z{}KIQilo@Diqe=UkB#xd?b>-XZz0C z)dwrqnt0_dXuk@ELJb8v;2%af5a=M#DOx{!TO!awpod5&AlM?OOA>dLPqb7{I!Bj( zyYOt^&)J#;SO5~xx_{)A*0#zXwymLuKO71nCNpAz6C4qSL2m>Nl-{c6>Y@sS=Uh@0 z6M;5dHwNC#-0{ku#F?c8bf!MxwK?_L1Q*JN#M6Z#jo<}%_>8+WAUtL6$*<0{{B!Sj z(YCa0%3Z=L5GLZ1;z%fp(H0uBVY<4Lt$GWyVN(MNEc3q>2_}mOrtT4<*%M*_3ub^C zZh%K7ln66X5Hr;nGc_19xAX(EC`r4rY7nz&8M8eYvj;$?nWrqQ3uy6cs9jkX=7<6A zOiC5zObh1BGUlqf=HlL*mMr2uAtn(qDpAu2qRca@>KibEQRPTL)OiR=4bjZsEj^57 zj+zV{q9?HH9*FMQh#uAQiJ6#ynY)O2fq-42VvSwjfZe-#jXk7@yGVe$YKVJesQ3Qa zfKOnkL{8zLWNlm8hVFZS9?kgSSFT;6V#xxIAuVBL>UJM*hqsokJDfYl%(rv<6h(La zs}gfpEi{0Hv{(RgBB10$N-30>#aS3|07%#>WRbIreFdS2P4q;XbWK|0mORffoAX4+ z%GX8HH`B4R$r)D*Yr_2sm!F|I}G$l(at;9ew$s>Rf_)(b~x5RA?8tgxhLwq z!%reQ1!678LMW0x^a$BWzy)u`ibdetWp7RQI?-3k^4Ah=SYATtpP9MisXtMbS}kn} z@+(@bak2hf|MCC`AY@3`OoxJ){*#lf;`g~1?c+tz1iU z?1rA3$)nF}CdY5)%gVJ#b{M|?L7yA`~t4_`+imvkR}mN?9I}SB=B z=H9aa_1{eRJ-H{|^NjvrxoxwwUNKaiE{M@vD!3 zQw9oI1Ys0|IOL)5#&Yxd&WG8{MA$qYj4R~7+^%UHgDB<^iXcWUbJ=(N(<7K0WgL-* z7pi-XU|f-0DttkG@i(3~x`X~C$v;69Hj323R_$N)jVowkLO?`B#55rchKPtM@`Z2S z@}NK6((@bF;EuBeog@>omW6ZYTo(xgx?2*CY`Q18q>tZ^XKgkpyVEj+rac%32L&az z>r~r6Z^Uu!-P){PuNaLXX|SnDVANHkl*vbzlv>edkh738dEENo>rLB_rBe+1*;2`E zHX4OE;djX_o3Vo8R||g3#Uj6?VfzsE&cnh<$T#> zs%_Lrkx2xI01OjAnG)E);wNr(Wp~?Vg#6yYFbcu|0X+x+1VT2x&waRW`Sg-g4J%qI z70M`tVK~B&{j{y2@(mni=Y&?ynD+yV5Ruy%b-dil1`sij1CCT~HSa&(1?Y z+j)%#GpE7~uk;H!>a#SFT%}2As|hgAOhs{iLs7mH7XR_M4_&@ayQ2rU@P-@bK?XBj z=Z)EYe;cFMRcn0T_u=`!{>DoAybl`M0apnR6d4~RMHMc>*?rBz+s4~MTS$h@%NTXx z!*`5*!5Adow4hG(vB&z&WWe=b5M0j7gRgzUi=r$);ZTr3~6lwY8e7~8}Q)<6FD%? zkDPWQvK_$hMu$Dn=#OE0$hji4n*wM^sVBLfN~(&rD($T5x$3Mh!MbwqO2sW$sMLaq z7v;Jv{+?_OmR^s?Jlz?xHZoTJ62+rnN)^yh3yf64o+_|b3&m0j=vX4e7CgJ8)-ND? zi|}8V8Q=T${Da+i|8#$8luZkHXl=Vcf8IW$S!ECYHjJkU(GPj*##}oP+YjJ&qQM^| z@aCO88S77EdxGJg9Q&r$KO$$FS8tT8+pD|rp@&CedBf3JG>qdp{t-QuX%OSSB&ing zOsQ9jx$LqN`5`#8j?z>HZt5n=#@bl5a(BjK<%LK0)LmJjL4Bv4vZd) ztF}vb?7nRgZ|Ob4WwBU_b z7^z5}G`8iJ);c^~IrLp(ZM_8FR(AuRa&36vXH{nqq~2+pe>j|>B&h|Hc1iI36uvHa zYm@H{K!y;myZ>=0h(~N*XK_JYg0H*8Lrkt+cMS%&492cIJO}Z=#0wDw#b^P-d8B-}hi&^s#9x+h%>?mF5C2GG9H&cwKhAn!lIi^(0&%;^ALT zDh`Qrhs9_z_P=`0>6+-1jmf?cAF!mgw#T~_#dbn}=sNbOcPK+-t7;1S z=8NB17yITn<2UOlJ7&fEjdYN^9!BI|Bx>}))*5j%&Evamc=9*zudg{e+AEQHBz`vx zf%S~6A`4);*SB#u&eTcVq<)+{x>LNRw>D#EWv6bhPxPhl#c!~hmLI-BZ~(i_S3sLD zwNFHEyN%;&x7lv@Ub2xZ{tbq*pdkxDP3SzP)nV!GyHet!@w?jzT!Xy-=$9#VtX_~I z274~>>_A*!{Bd{{r{A>`!`%_VFL@mAzV(rSx zgjm$qHmxJD?}jijJ-y{#y^z(d@O8+5$o6w<-kv-d#*S`;I=Y7v>bv77w8MG=2caI{ z*1gB_!#70x{3ZP`y)_W_EHH%@BLjLH4Y%H|-~`ScE@#v2CVVH%|I!`s7vALI%lX;Q zJ%ht70H`g-Ki<%2#HuO3rWE$Qlo}Y4{31XyipZc=kIF+n_4p9fm-Wp)=Hn0lFVCEH;!5yTMiCy8&XAxh37t)lhWVXaocIYJ$8~3d$?y zp#7PJ#zwpEk6DM|JHndSh3OQ65Ml^2*2>v49GL}`ScIK=3=(Ngw;{;i58XGFxfN7u zX7RcQFu>GTTnT#c3L%8E8S$hT0xa8+iUKu0WFXUtmW(#2yVs__n8pElZs)5HX0FxEavK@kCVu21v5}2ZELQ7byllRT%dCy8 z**C5&n;>8e6u`)wGMzw~R*%f7_7Pw}f=WmKKUP?awXOErC_n&;6bi=RX{0c>B}R{7$fRgfVwhueA95zl#^~15 zdaQk>Iir=%JC$LiE;M1aHt97c&X)32 z&9paGAGHB*U3qSczZp0W=c^IiQzXw%Jod|S))HJTtG#CbfU(d6FP0Z__Xg-8_$*6+7KI>0o>hp1q=l0*Am9mV*W?=ODU6bWE9c@{(}H? zIasdB)vn>6i&u67ffZJEx2{!>Bwuz9Ll*=O#)d#*+u;}l_v{1I(IBChB`wS9a0zQDjW{F&P$>usLMZCN`x2Tm@+*OL zs8vmES%QrqvA<5W5SkG-;NMC}HH@NrJvq}Vq}OX%2CB8h@u%KaRKab36l^$T6z+>N zP#sve&w(-QIB^6^9?$sm%MtT3C>WA~?iouS=l}>^E!F_2zb!X7_NGn&9 zI0Z3WT!{cGU0p$Y65kmzOAQe%G1_2SXfPkGiPtW6#c{V&u zRiS`AU;`FW5dP8j(^EiPh>4NYGjm|Jsp-<;VpH|cK6lHg~*bs2i@=B zzXoIc40!;a8EV4GlLOP?MlkE>U}h}?!Zu;VGbzlJLRhe6XuF@uFga}m(8Uv^8ghb1 z^RvSyd)|j?46YeeHFa*XVP*>+oP)BCxD5OpE*HfeYhcd)<|WEru%(+LEt##mTwU&yq&9 z!H#D`g<{&pH=ob`a9mgNibl|Tj$*$n~&9(9~}zJ>!^-SKFcKzD_{2^R$uzSePk7WFNdMP?ejNZ z5KI9*B9TBOEC&!sp@1a9K(%7AP$V1=NK7^pf*^%~w#B>)!#vBhjpIDayblCT+q8is zP20Q!MP1vpg=JmaJ}8!L(>AIWj^j83S)SuK2b!+qI1Agp<2Vl-&+|9~UElLK2hPVd z*8ek)-p5#o4rVzafaa7C9(O^bRpSwvRDwY!8%E;^1;Z}a`bd^hAy&)vip2tDu~Z{k zExFZl&7i4JPT3{HI_t7)mQguQ(>%+#&ht#$us{?|+ql9s4IcPMLqAnzw^fJV#??D$ z!K7WoHu{vFY}M=O<+cZ;TgtvtXc=4nJk2QIIC{xP3sne%GlS*xBm=Kf{l@$h0f)!1kR7pq*aReWv7@)urjz|UpPscM9 zSpdCzF=;@?Xgin~1kQ&?+zkB=({(>RhS0hVc!D2(pKu(JC3 zOha!qUQv9jT&fkT<$BesWkhaRK4>n>Iubn(PAL}7+-d|R8IFBVXuDKYkoG+)Xw!8+ zCshqr7gdE>haaMtQ=%DrSfOCWBAI2#srN95k^#n?kfOG_-BSWM+HGQK{KpC(Y0g2@1V7Ql;^ zC}m>UY2f3#2!0g6G#9`C7y$*zSdt{zS5jqan1iLT~#-QIHVlQq){- z-lNZm-A%nVbOO$~JzdvzSH`|aRsCkhs1H*-oWa1RB!XeEpX^#`y!yDx)p}#MKjq`x zH2-hwe|%lrutXKwjsKc4(yRYiH5PtTdoSYV4Ef!q`U%dWXk^`zo(aVQ59V+HS+2r6 z^62-%`}rKzBr{Qhu!9B!ur=>6Wa)a|Ae3L+4eJe^E_t&-yix8X*}l;FP}HO!?}QT$ zs35}stjZ@1uy#mSfC;+@n1^)6Y3zBdRnKa{Y<7?sC`OT~ZtyzXVUHL;7$#hZFR9pv zVN`$g!bx+mTXmu^9oXnMuA6*qxHG)NV%#MS8JVvjUSAYL|<5MW}XpI7`eKH2Qp}xdu-Ji1Y;?-YQA&qoGSV&~u?g+H8jTezB0IS3x zFaq4wln=XiciIYotd}0E(z4AD-l@?Lf3a7_WPh+$xVwC?D0f1j`Ic{W-ul?p3c1hA zgH!PQ#FKJ{0}Obip-f--mL;Amg6sl!8vQ8+O|06;@y}J%f7dn9j^Si?{fRMpv}cyb z(9A0>U>xgb4Afp>Y5}9JkY;YL+V(WU z?BYHt2??yGy!8?BTvJF@c-^cMoPC5aP`G#1*C=iN)-FB}-OC@|9NhsW&3*nLt%vP; zPfcKmw`iWtHE6#bZV@{ zF$g!vyk=)Wfw{YFlbF2tVt%tiY76&KI14w{^@#P<6s0t&WU7!S0YL_Xu_QrSy<6tg zEW~{FZayMZLus-&dl;dBvkRSRCBs4<$MR%ZH%W|QIvckLuJjZ@Rx!S zL6m9Jr3`*}#uOBEb=jv%bx3yErq8b0rm5IF+C(|p2af9|V|lLo#@_wAqoSg0?!5H< zw|D>SdKe$*P5KL1W+pvOT11R8Fz_|7pY+LR*_2wvF3Qr(@_y(lstIV{j=Hva6At+8 zvygbTRdls)Joc+uy_{u@B@SGO@igFS`{G$_fOI;Gdd7u5G5)RhE?q&SLy(jw<|3 zs+f* z^PUAm8po3Fl~cJ8pwvMi1Q7sDq}u`E@~QDO5P_x2j)GW?EuIztb9*7jnmo34=+@l4 zaQ0kdb@73@a*#I)usw|l)ky3d=-dfA^tKYj>JY7TvXlu@*%4#vxOWlGywp$_O{xH% zZk}NIyzxFj+(e%F4olj`|E8$|ay+kf8Rj&EdCD&w7WA5rh`Adq3I>9Blx@h1kUXff z-O@SyI(rqU`F-cHK%&Q|z#($bQw@9o=-oeP_{8D1MU@iZSx$psf7as_V4(FoigPaXL#}zY&6wkMj{)};WF4yJ2C>^l62KQAT4;B|5(9Sh2R-K zKp?$P4qI09U{kRgNiEt=%=s|p?Uct?Ly8&AqG7ardoBcTW$;Fu#n=u{(V!M;o&izK z(}lsG)=q$5+?c)awESS-2z9tlySiv>sZZj`1LW_Ca}M$W4+A4W-?Q2Oe4VbNH#PzA zfe!YWoOE!O9SXJlX2cfq;7nsCgfI>f5-kugPaf<9(iU z=c{)w#oi5wbL2cCGVI*Gl=%-~R)-nF#7MQ~MzZeJi7*lg$k3U_aK|tW+7auTwNS@6 zmP+3aBv_n|6(kMHL`C3X-7?Op(s4msI1eX>Ai_PoR!pvvb&wH`Z64};=ewG>ex22| z4_3-GFJ77-ysw*eFX!CBnCGGYQ>F&9IE8tLs>Bchh%smayr7cJI~1#85Nvjn&auj- z{)gp+f;suPLtCP@)@Mai&ZFm7u=snsx^tV z#%SL-dt*SKZGX&Wn2x)xn&aM>{Q;w`_jxq!bRF|1{P+Cnr&nA#6j(6ar7Hvsm0Kdw z)ErgZnE>w`%T418FQLG`OJD%PXA>JPlnIrJVOpbQ8>GfHoazUe_$BW_!!C#RO~rr^ zuD1X$HYC&m@K-pBLlbm51Z9}pFg&_ThCV@&pj-e@=O<~V!!rQ2$gyw38wMr@o; z+wc0adP-_)$;ao<)Azs6@|9`+)AXn3_3xk8)=#SbzAqpAdWXl1{zlw6n5Uoa>98U5 z=>Mu`5pN_2QxaYY(p;J+NduCBiL@|t5Sr+NFHjMjfNZgxt5IeEntRCr-yzI<5FH;g z-J!ob=9lcpKv>sb&nS@ed9z2!7^E)Vu;kPE0O@lVa#7m+T!N+(1JRJg%I0(Y%Tlwk zM#pmb0+ID%SFkFj(TEymvgNc*bB8V61LpA;u^1{OEj*|S+7+6?vdYxTy#{_FN&UU% zW136IBAScje|Ih1V7@uc9J<_s3$6e7;yA)ERj$O(jgLyvnTume%@b0CU7ea8Gr1KX z)Uu1oXD$QnZd*Q|q43^FEM0w5g0K+NPtr)F;dYLci;C_-pOy_*fSWxmF0eJ%cEuU<8_2Jha2(uK)`MEp|+Mn7d zo0E2&XJqqa-fMR4HD7+`CBpL#EIL6VZpTIC&26K@KtK`C9*K}W8{v;mpF z49`uIg^#>UsR|g=S6WQ>{BtVUPbls?R%}N{uEEC86#DN8DOKLRdmxm`eKt|c!<@T# z?`P)HZ`5&{RK2(u(tL-Z*Wwb5h0imfr%*(EPbKli0Tvqb<3VvN4LS37sY&q|$OM^a zxqv}!rhn?p+gqMo#iXd}knT@@$_;F2zvu-iuc#AekmzU>F?rFHx8xkCuEZ@afvsX@ zeciXHe?8nD?^&+ao<%FfFuM%*_gvsuW7l%X*S_=~bRN~ta8Ei@I|;eQvk&fp#$J1^ z09x1da@s__SE7^;mFrv=fQ}h0`h(`gc{Zw~re%+H7Pr3lQCZ(hJD;}J^seDJ2TuCl z?J9KUy%yUxx@~>(dSU0Zf9}OJy|wZkDht03+^g>z{`4(yg}BUdmUD#Y92KyV@wPE~ z%%STl$^LY=ttw7+{rocj_K4QF(uy=h`eDM@c^LuHGg{eTuWw=hn&w{q{%GXqB80AW z#e^t)apkGkKDOpesf|Z@?fG75@7Z`(Qr~VPiDOT*eof)}D1>?K?RuhH&wiTZ*tM*e zzG-~(eJ$z6YaJJ_%@&n6E$Ttgi>#}+J;}xdI$N&~bND&xr!kIYobPQ-UmAPR$|bLL zQ3yTs-7ahFUWvP{%G>b9QI7H0f2X`8eDq0n%HY?J2d~{G=rR2FVbEUCa*mtjp#E*U z2V=Lo2|jn7E(`Lmf!})vgr=!@5iV?5bIgdJB%{|CC6KZff@tI0m5TWrr13BQigyIB z;k>vtJdcNz?u2O#dAdOw0Zr+_B_W}qCKmEl>x{sh0t(f1wSxydIyxd+9EYi}U3W4* zvbh|jK!E=Eyw&iH-dN+j#|q2`Mv9}Hn>B7Hb+xbk!$U#P#am8DtK{&oDGO%O)I2}q zn_Qx@J6}C*uFk}O1Hsfh&A}4o>(s$??VoOT^aIB=pB2)HXofh~p_k#Gov&zHi_g2i zN%O(R%==+-6pSohkTyE73Poy2Ypf}xu|9)Ss$b1r} z#DVrTq+~{-Uual-2&8BXQRu*R%-Xw}9ho!zT`b;#kAtq9oCVwOM=OrHRBHd z&ik-}yU#i7<@uGFu~WzWP~%3NLK3>0YM!5Rva9&Jg3?3qorF4*AYw%J4fmfC?nDgI zgSiQ3!b%%T>b7Q9VvhK?@_G|Y3w6ZpYOTwM8%orpXlLRqPoLNCG>1hWVrv~=pV4kH zn4|k_ZwENN=1Lyau&^R-a1#zpdhPv5!FgZH^Fx5crP+yJRydaXw~GpOiu@Y5_NsI9 zj%}_Kx4JS&BDa!iJwry1TG%2ge&5R5vRiw0juMKOYkIV?8SvgP>BkGb zW}+5w`s-H?$p~`Mc*L&Ctuoa~a>Ns}c`%Az?#e5LY!-gznr?w9)3PaX_~-}?-541z zjcl`+3!Lk}X+;{xY+(GHmcokr%xr6yVzuj0Ad2Zy`OhX}XK}{NVk&GXw`yr$x{3X^ z(M>Rqu+AjrO9HYY8^6`|0;)7UNu?}YS4GLl$Lk5gW=Ykm<4^y7R+ZYdKn<^f>{N>o z0dy23;;aG&I2Xn^}QE}k% zPSW&EAk)3lH^>HuGPS~nB+AfrEsr_#LCOs@_Qb0U(;o18G?yT~1eq2E>Y{gwj=bSHC1+wJNKP|WR-i|NQl!(wItTE&pYhU;pamUdxRnl zJ1XyGo-0Z&Q*nJ##y~#Cq#zVStmR=1$}X}tWkeU9ot>G@%{i()^x~uz886C zf<3!8BOB;?o;B^vY3|UkExMZ|UORdui(W(5DdBhKC!cyb{ z=Y5Jf8S-N+W?Xk)NvVH+JDbAZRfJdAC$Q%3f-iVl!rQE+qSkNxD51dq2c8(z?$U6UPrERnc||YTBOFK`nWry?L#g z%3)6;XhTGME#38;SvxhQsFg=il1J}lLT@IGcm6JG!$AvqsN6h%zjyvFhnxSx{`7p; zN9e_r342?t!#Sl6DdgYv;ld9v&vm_sRx32;cIVcyO6bk>3Mc6?>%r+u*6ed2`0+P4=a;iRl>}KOrtlQ)o(4CtAz0EV<(xG8Ew?zLc@>yogN+ z9DmNAcTD|c--za`cP3B`eGfLv9+4oKXvk1U+OU@~6-BS+LYRX&gcQG{ML zWwu^`u%1_lQ)DE1fz^B92z|(Fw3~W zwzy8`&Nf*)VlDA0BTSbGd?bfg{&IH{;zp{-5%OzSq_FDhxKw%a^EV- zVid|*5Zoq$x)G7gkfT;RW%!hWx)im_tZv0IY(TUnC|Y3+@W^h2L$}uP@=n&#!GSo| z5>(Zfymp($mkYN~9YpoVZcAKC38(%b_UT^~Z6#q%|6)QHNSf206)dxhWXUvw$m@)W zjW=Uz<>0-4k~`At&vThh zM7WALN~1DQ^ld>q;rMxSJtbN{HEt`85`#oP9VD{#6q20;rPWNbt35?MznH$P83~_tH9wb9+wTLf)`qAw;%gl`&wC3ZD}d!)no)KiLh zQt(T&yh{#}M(vB8r+<)O@>qgGx!$U;Kw+;iMlG@~#!25ua0`+?oq;k+vng}ZkV*$T zhbmsk_n7&!Q1rxajcLpP=EqAh4g(pyl}fO&wcM<3YRVyxs9hEHfmw1nj9j!uMGPVy ztQyc`+A9FenL_I_i=HOBl69JN#!G?dm>X#c+k&WJweTvEl-t`JRlJ>A4R}f}v#zFm znh`IH;pcK~>k@wcjf&IX#Z%!S4ko??_*j|aR~}j*WUpRIJb^fgGgSpk81KD?9y#8+ z;Ojqs?avjB+i*L+v;F>6ptOzOB2TVlUHQB?JSU1{M{6B(U>hf&$AhY@VKZ!K{K^Bra%eTy_lq#s^- zuF_p0@RSQ=i~X)s`n2VS)~OP4R9FUfYa}w!*LLsKh2ajoCmbi8!UNW=km};8P7O0! z<+b&e#`w6}YXur9&0qT;5aavm=SNuyXUC>fUq_Nn=l-e{p-k{Rn}1T-4iN%A_(e7X zb(Gs2|B|_Y@b3<}4&B>%xFt?Pn6Ot}=yGJL@fvLr<&f5Q^2mW( zxPmC&&#@~v+IXSI~py`c1wVJpOiO;EST$|%p`X*Tq_&Pf_`7^Y!Al(jXc za;&Y8SA67euBJY_F=_hwubTf~@jU6vMz{HYRF?BJq&H$%ftetA`}+hs+Zsk>)A>rw zR_C|TMs8wLR$xe#^ zs9k6q>JgX27=tyuC2g&Gq|l|KsMqTfPyAh*uzBh7z(Q}hF_sKfh+T2^T^~Qr@A&S^ zTLakvgl7HpK#9ij;TnP8GVcy*gjbQnlDlx2wM}O+QeT@#NB?fdTjE_69PUQe7XlX( zf`qr(Oy840H6OC09k!9Hn5g)2f<|xUyxCJ5Bs($7Qv`URBFy(}iuXWJLwlWq1Zq|0 zB5Jk5FoN2O%{r!i&T&)M(+eI}Vx}`Zy})V4ZXH?|^W)&e8{Z9=s%X6wu%{z-VT#-mKj#&ESH|E;ZShP`aKu+T~yAlG%$HQ@EOpEMd084swJm z3rtYCR)sffSDkMeF&Eecb$Fp>3D6Gqah-_sOjJ0LG&M?iihi9m@>U75Y~F!>Dh7t3 zGgk?5NDxrv#rH?t@X?hu&s9vNQPz}bcyA_Yi%L~=dFEfU zdr&51l!&IKS%G>G=ojK1xs}pXl5e0%$G;+8QC@~9c`VnI5p%fr`H5Ok%5!=fzxRb{L&24UEXN?mQ$zQPB^;V}>;U-QBEeA% zMMLocu3Gh|X7Z2cYHn316v8|&9Hz)xDgw7_f+`IWBVd@Nf+$i+d~tGh#p21~7G+DQ z;>#U{R6x+gl$HWKF)mfr6!7D`ybY&e%r#}poD~spICAv;m9QoX+0+~OAEZcTi#(eS z&OLcpC|b&mhr{=Vf1mJPP3gUPshMRLx<=7(n@ufvHk`i^zXMu5@y8BAM+b|=kg76n zVVMlP9sSODy*$3^CFQdB_P08^%}B}U*olQF7s}!1AE4cvT?~R2xfJ-|$*+onSS{67 zL5CD#J@Bb=ei03281+HQpqLj&6V(Cw0%K`$V+h+P;_qXK;JMa|MwAjol7)*Di9lbw z3INcvuAjWk;#w9-#%viR0}4JH6Qr?z!TO!&Lo78WA{rAGeb2|(;Fyw*B99;0O7i>E8;#mm;UtbwsAY_b7wCU z6sj;fQXL0yA|G3=*9KikQ&ATT8^VgNhj&nE=>-wI7NEprAqJpfWBjtqj4o4z~kuvgI5_y75g2<$IKPd?JE4aIi++B`)$zgM?_mVihMow?VCTWLkWy%7X zOG(+&iss)nR6ut>!1Gg)y(Dv-0fR)`-Fo*|kr~W#24)#D7#hSzf-$yr#eeUvhTIEx zq!*_KXB#%*h<-=io=?~MUvCO8S#Zm^8#;Tp@i3ok9zWqbm1z{~_(d$rsnVJxuG$r&h+p>J}d4*o4A9}X^hJ-_- zEkCw`9{RdRFnT$xQ>|Tuqd()aG2^hJ%p;DlW76=4x9%l2aA%-qDHW)hyjhyYhaVfF zs%f=BQ{)kdI(l7HRnpn0Gtte_HDRdc!$NB5_41!z@60*ZK`=Lc-f&M3k5Ed!-Yb2z zzFN>h-o1XKOewqdd+)^ioW^~J%!l@w_Z>7J+_x)`I37x?60)QJ&EPDI7lzIC#|~Uj z89rJ+a)X&aCywdNEBqDZD+oH0b8y`GWFfRyf;qnf$m?8HD)H; zEEy(;3+7Q;-<;W6=v7};qU5A&V%=1k_{MImzTEua)ny48%uZ&?Wy!S7VOi=T*{;ml zvuvh-keOKugEPFO@k^3Oky}}nQf|_kjFEu!4iycj!4qt3>JuCXS~lg2WnVwlx{XZh zgIe{w61CYz&eFaB7LzwD213O`J>kWAR;)bz=gp78V_4y2AjM9RMOetvP>od@)?7>- z{7vrS62C$ZX`y#Tw%3a&9__bH$Ax-<{Hch%;@0DF-*@t75oBi;$cQPepEsjk)}J|b zmd4~yTbCWFOA_SI7}gM@1!mGzT2hMAWCh|QjkFgOES!zhVQVi_|txsSm8~qnppXT9Qx^7A`y1AZ2d+-jL2b* z%ppXgBxo#qzp-GliU$U1*+T8J5c)3{hZzFzBy9l0{k34lrT0P;>cfZqYY==QqjSB7 z!YI7_7CMKeT+2d5CDsU?Zt3FO!l=dR=~X3@?7O(n56G1&K|;AQ z5?2_V?2-MKdZfiFe1fu~K1;20e|CHzyu(}Zv91wK_N%C`C&Z;BeXY=$AzqwQpyiljlHf&Fmm(VC_CbD*3OX$ z0xq+E{nV185MYEM9FQNprk5Hrrxx(XOGW+*(Q+PStQdzWK5ZUxH6*o6`75B@kCS&O zF7%k1mFpK=cHJ?OaI=JN_X$hBSfm|sjr%URd^Wlm7EpZ7aYp30EYI@`%p1M6!G%c_ zIm11NJFHc5AeS*eWq8%$PD`aV2e(s&FOxc~5_wKVcTX(7Ji`5|-KgyHZs>UG!3?)w zxFi>4mqxg>8nHVmrhpLTM`*9t1iA)hlRjKwYQZ|ZA5$0P42}>yrH?=Tbzu5cf-D!C zL3Cm{#5Bw09)vIjn?}sU%0#;t9V;JQIknOYCkrGgm^U0tbV_E40Xa5^EjT7FK*YPg zpB+qDQBdIHFlOq_F&5*5|MLAptd;L(S!Iz{RZ4wcMSKzJDA8P*fl=zTDn1XB`M)H2 z)~HB}LQFGVag&uv1^7X-wK|iiWNg~h1^rB{zuDkwxM`id?&%TmN+Lb$TpBs5xuv$@ zk!vIxYu@xo=rm@O-V3}*sPGQ0>c8vqKg|g~oi(xR&eM>o-pIyfm-)-DBBy$z8XGS= zkDrz-xr(arLsc%hA~|z9W86Q^r|7D?c**OdW zeW5H0bj@}I{0yrGXu^X0*>mT$Et;nE5NiI|B)fk3o6tiwfO)07VEw&U@3zwaa^l6R zWVXzJ&yQ=XU04yJLk!{#)vffU$G8Xsdzp~EfconE9=Uf)Qw#=x$&$qK;{29{?K9?A za=u%95j;CbesJgi)LUGm-BT_mJhWE_SpbG*8`Lzo3$-M`SW=i43<^ zgwp4ZikNyr$P#xP5I@QKzikuLi2LNANDz8bDxW@i0Hv!~fF@n|Qxt|+04x{+haCU@ zjxQ+9Dp8ve8?pNGHnGt0@ds`MOnp~YlH0PNedhe8SP=Dfbh~`zA+Lr6gFUNI7;L=s z6%sC`@;ax_V@Q+K!**~4^nz_Rvtxvpm!ZJ~$-SIU;24PPBHSkukpu#jNPIJ#{Rs@o zNz4NLFV-0-UKl9{xp@7#;kR@5B@e(6aA3)XD>>^%+X=fK6pj0S+&PQYf)BpJUHV@K zPP{Tc13c6~=2t58VUjaHXMkhM*RWxL9~*HpxD*VR3s>eLorxk)%r4ex!emX~JD?wy zQXL|PI@+MTnI3n3Z6IGMxV#JtCP*M-#OJoUg_X(_AgAZYS#?uXT!iscB4?4;Z#gGU zSoqx?pA@fPg=V(2xS(-iBE2}yn97Ob^mlfVXU8FQ*8`TmTY`0O1EBQZ&wyWG@fT#p zd94fP%%0a2osIE~ZkP8Q^3rLIw(J67FmUPXRpqW5p@>xHnAB^TXxm>zqBuyy$g26N$mD z2sWGyqNtFj(NEdqut@^r)A;o$pcr_rS%?OTA?@N?`6@2JT`T%1eG!oc$jF`aH=^Ey zleX^=zNXElMgnPKtbBRu5krEZ{$(i{UgBEyVH6pVE_y9@hL!gjL#dSa2bU8tZAFyK zlcD5e^V^ApsL#)b&m2a4#KOqWdYR|xbthR_CJ)xY57%L`6jO8Oy92XKnT%WyULPC0 zqU}RekpD);-jzL1XVzdLS!Ap3=W$_SZE-<-ChCt+pwfm?s5KgeF!An~>d>63SfjFW2%pgyC^ZqqG~kK32>x_2*|o%1D5{e^9XeB8TcC_Z7S#%>E4 zihH4^`u>G|4_$Ru+$9!o{6U*ORX0>N#guz)s;bo5_4(>qrdcV|;p&)W)EW2nOZ~$D z8uV}MyV$ABr@dUWWD8xOOfgzxtf;+c-7GDVEgmM5st@UL2g=2?8*Ba;)(U8?!&?|i z6Z$AdQ>j66g*WM>n$S9B5_ag8UEuEXzpnFGn7sS1?HT7M7;)W%J$U>c0#1+qihZ~U zh%hsxlQCS1xp|pwQnNW}(z=k#c?{qjX;xed5 zI#WwBvOI-J=o1TPKH21HLJ0LnRRUe=4SDrDx}7Ll!j(v_kC9Fc*D3yh9eW=hby-Ba zAuz!ClaEdIgZq&inS3omka-;U0=%pg_F>^T*Y7YC_6+pX9iQGumi%S^f6{iVvTkm9 z;wf0p+oWMh)+YX<{$u7D`P^8;n01VsdR!wYH0$!1F^YVqNyjhLp!1Y@2YVMqvlUuG z1>qKAN|-HL?=go8MVCklHNQjbW2;EQ1L5>JmyTMh<4t7~O;H*5;1MY%CiMfJHSW7N zZZ1E8UzVz(xl*I3R9UKv!N`hiC!Tn1y#B7#OLC1@7S z`TZSgk*K$GF*nTv490-@CWbq-(+j@kQEc8af8Ua7e0C;nS+;zLsssBAJ*x*(@P_R*Bb8jR~?hgND*PUVm-A-4IL^K){!vG3f++`naEcp_@@U|M4E% z%4@Z!vNj)SL)cq*+*gLB^dzBv3n}QAa6xiUk;LK_%*$lfUp%kS;gr5~`2D+Hi&Rk@ zJ8Spg#oH(Orbpc~nQ71T|9Y%&{nhSPSWBz%uv>asS*>ktLs?sUOY@4E9vW?q6BirC zx~Y_nGMOoa)}D-v$5^FTl*tW7IWiN+*ii9Cm|fo8wKC#`VBaXpZ}M|0y2pJhu;S|5 z>8VFtNh?MC)lEb{yTg@wcginPH?&DmqAMyCrKW8M?;|+m033vZ+_Y4I9y@6VgPU{0 z8H&GgCF;^O5xx0>o*GVIo?d?juQ?QIT#3O=xdFq6UA`{6eVfb6J?WgV2;~m>ypxyX zIn*U=8HK!?}VMC&(= z-Eu8W&*0#juIkyFNYh6cAf`m)WKC6DL8c@=O%QD&=Eg)(a+E-dKq1zXFYO4|o=xIc zi3^=M+Ax6$=S~Rp_vaE?PDz?Dyd^TE0s6ubAdd8VUSq$xfBju8ugv)!{FRH0wS=t1 zo?Su6QLTT-b)a`d2N&Qxg)#IE-<`&OYbP)A3TX{nwD2VA)s)ahUgPAeMBIFWVLJkT zfvL50X7cn3ya-L7sdv^-_u1%0)#abP)~{FmmX}oQU?|4C`xO}{nj&EB0w)XE$?jtF z5W=#E?k~LfkQjf7rd{ znjk+8{ZZzfnZwyQ0~f1FWHgO*`dgFhUG*S*ha_u~;Vvzxb-|NAw6%ln5Y?**G=PRa zbzeIdt^#>-o*IN07mf(vF2t6b8AT+Nn^^+}wn6h+^s?V6I~U=_j%q(9ord;`;ra(Q z(6NI>1;%pF{aeTsdRyrPAJK`IlveVB?nNFRK*~t%n6ny|M~8%_gzvfgqFgo zk!tRVlh)q*6^AYU-0br19u>YU(qWgxP)}@1o^PBamZv<$1nnX{Jyy+!gKYCYa}ma| z1kOUQ-*SQh`58p(_NGhKFny`Sbotu#8IkI$?LlE!`gWWl@4ASkBZhS0(FvK6YgegE z36q+yg#wI6pqmmnSI-qNs2orBSxzn}al@IN{^{}UCa+vvufV;E2?<;y&59xW7-w|a zkb^(aV_FEhDhrkyUI+cnz`mBskCydjLy!xt^@W)~dtx)lm0`ybE@(bySVn;DfS$eS zeFiZqQ>&Y~b7c58ym!87iUxacoC@1ihf@yR{7Mkl3c^0@3lQcAe3V`#P$b)b9niNz z!q^?580EmLK%B@b5QH<42ETMr9?Sp7Y=g9Lcsdp?7B|XCOaRvnFX}R=JOsU!c*r=u)u>l>_m8d_(bP z@i^F@X8b5F(vIt$i^H$S<3<&LeZae*ku&v|0?yF=>6W}BEcB{_fu@ykl;8MGVkWu+ z{)xlAGor#5m$r0!8LLYaUcqFU~%e^W~<<`4~`(uLL0?=hgvO2 zH^yX>=7~xuDYuAOlES+v|HSQx!x;R;7>{lZ2?mX;o!-E#HPb&DKTAv>q)61_U_M z%(0>rb962-QkRN2jI~y#gv8PIJv_lqbgKZ^J`EiD!0QH-3==w?*CR(<_a`}E;Vr)X z7>)bF-?x>Hj=ijh$9j?fbQlV?hGzI-vKG{&?K@2Z__-VYXE7=Ri3Sx8LCLu8|WxVgU1`Uxpa zJ42fU(f1d7$ous03dq?18AqTkU)Q!Y%j)N}WT5p@ehVkVpv;@AX6|bC7Nt4I?hyWX z|2z|YXd87Wl$c7LK!HDfAFb}B+c?=H4zfgQ4ynOu9%NyoG&MXhUEEPnDDTKfpT^b5 zY{3IKbEPGS&j*Rx`0yfM69el0uCsaax{mGbmNI!_E_Hs&@Pfk~#uAAxoiWQNY4)k~ zIbF_CVamcCfFvp>vujl>s$A$Wy1!Y->4w@KyCO?*gQUWZ|DRJFJ5JP#;`tyDk&BIH z+WgFGm5h;hhXmZ6moKmkxXYI(ShF^SBy-i-g-wl%8am3R)U4f}j+{w%J=kl6PmS7( z^f#@WO?dKPn+EZckWrvUlXt+8{0TK(>$T!{dfnjFA#jYnY*K3sqICwM zHRe>@taZdv^g8bf$&h7z`I^vxLS$j6I|M3!cYEdS?B2&z&YW{;9oM7&c07F3c_nqx zxmsS&{k)a;qaHY3jZdE1d{+yg!w&`_d3iBB4S`g15e!xCn#~gFdSL@^=42%@QYVM1rW8lQPd&eZTJpSR}mMiWJqstZO zlzEpqxI*BU56{PBgy~0VnD2MMb>Abf9|*Z2-}x*Qj)9Qv1>Y~%k7b*2g3@w=Zi7wE z5n9KRyY8L!xi$9=IOZ7lrMBLF$a}#{4=-)&|C>2@XDC=Lwq&qtu=n&E>IFJ?ihcdG zAz1}&3)`#alv3m;ZKu%tgNuq979^62u~#?Kge)FN_lAUEDPsvOai5sqlYnw!byK%tqfGcSF|@2|=Tyc= z=Fk-2mrI+BMrI;%{KI_XQT4DpKY*1R@M|Z{Q0%PN82rXS519DB4>S*o3K2o?mRmC@ zS7CrTO)oel8hM`1C$R;4i2hd^UaU%GD-GoQxI{*QTARjYg;+rWp%p9Ji*#?`$LiH3u96GDh1n*uRmmFK zYTc8q8iFV{=PR#IgGa&9K3!i+mNq$1Gg4JT&+@(%V4n@+eRub0_T=f+tto6hF_W3& zYp_mkuWki7MuLY~;A4drM*2^K!pzC3KvFE}ow0?Yf!UKlMd&+yvls%Uft;Yzp8fX; z6+R(VXf1y})`Yk7)7Sk(V$BL97*$*Z#igFO2MY|A$D7!}^KbH30v5$$zL0f@{xJ0S z2jP}^Fn<&^VWNz-zq3y-$9wk2h~~JFn9`{K`21&j0J+nVU^RJSW{<<@<|r~$OhrS- z)C!(F+UrZF<2ny?q{hdQ?Hg~|*BWoeDi4&DkQb^ixM-{SrhLl(;}4+peQQjFCrlr> ze8#8`zKPk;zaty7B!$<`wXaecw#RI@x>Xr#SWiw-EqU+!+43ESA_*JauZYo1{K=Q< zNkbMW+cpgjfn&F?cj@`=`}OP(*LBwuU5WX+{J5qmErVCr?pE)<1>W+gJ$Kmi`&}bV zR(8nu08+uX;ZCu$O&v2@>lnxCt^9VQALRty;@b86{_X|GSiqG7JARGfoA9Z$bnU$I zSxOiLu{I7z7$=N`5HDL!RX+ZKpDFU5iuNhSjg?>Zkp`EtYuxv)cd^qA zy0@se5Qgmdu528Wz&Y-Fp|5_cbqqNAQc>_y)K2gc%@cZwrbfm7g6i$NlD>i3qyWm$ z=E^mM7#p%={<5jxVm>yo8(iAi19sE-ZEPWQN2P=PIDz+X^CEM*38~=Q+tN8RGl1EX zz1>e64ITBgNecy6tyQ$;|8*G;z!$Gjh7;Vj|KtFl-y%(7DgbJgC5};{PIgJ<@U1-` zX-o$?Q{rGX#)B??WNrPb1qs9oVfwO<8n_>KiImbFpt%n4tR;^r?* z%9^2!v2EJrrMf`dE-7`gMMD@^-B)g*f=PFpI99oS(GS3 zy7_=HJX)e*bfE2GKE@O{kolB=-R#|kJjJHWL0vT==!!IUtRXBvu4T%iYA*v6E6UBZ z0EduTE_r)~KOrnf(>l?QrSw=(TZ6xgLhmtoB6V&~Yig7mGZFHeqqME`Up4;015xPy zf3yOD4(*8<#?C_ASM>rd#?RKtMx{$P5B36`KySIV7RRI=2>6seQ%{a29<4^3e)!WU zI6847gR=7B<`Jx~g!`LUCak&Vy0>QHKc(!cdp7iZ`hfidz2HtE>l}ie zz+MkU+H;TE5)Q?TM;;XBmMxzXi)jC+;imPG^#{J^kKTWjgkwL!gzElaK}YhtvZUulEMF<=fQ-2_C9LxaV{TGsnt=is=yIWVrdc`%|hS z#WpXEbL^P?*yBDT)pq6cQw66k9j%RA11==B?VelUScZB^VvgIP$hlZ%;`=`CTjL1@ z^8E9JW8x;12LHXy{Nr*hm530alV&~=Bh}N(U;+(&=@JT$+fMK6x0F~O@4D!$S4*&h$x+Uz)TM>*XbCLGbP2w1SiYc~$ zs={MGcb&nScdGjjLH{ltJaww6&hzoEeX#+XzBiG$|HA1B^7SvwdO%R~zyxvd38L9v~1F@bT4$ zP%%q$!-bKOfg9>w1l=AxiepHYswlJDFe|+;p^*S2@xE*PiOrpe=V(zic+C<6US3(6 zY?KEqh4ua}NXU%0#U_VdtRZO#yqG*5GU#A98qh)&6q5e-BR)j)8afeT^zC7>DuPxB z*F@Nkmy+A5C&>AsF2h*MPVd?<%~RTJR>k0{*9cN{XycmOaX&i&BKWk!cB!!(%wEr; zJD#0*kyo0pk^8IbZUi#zZZccrnjW!#>!~20N%>yYrJm}U)2aeK$nl4QtP4($U4k3E z^%id};MS!k#6k0?Tn}k9^jrIJ+o@-^nsFOggqs91i^Y)io!CCtvx5>b8Jh+2mJ`kr zC`=YZ+IMC9oT?sb#AJ*IB*x{J^8T4OFtiQaHZ(BLyr6UUGQ=4fVsz>5fq8$QTh=sbWVCbe?Lzt?WqJ%P#lWIcnfeq4BSp{rxof0OJd}C0 z#zWtKJ#;}tuFsYy*8JuFf6^{VYVd}?`QN6k9J8>K$^h+W*9Qt*+f{;Iz zD6PUjI1r8uv_Q?jsdY~Vl0y1I*wb~=%T;YP4xBMR2hgH_K!v-rbtc{Gjtex_yI6if zB~f?nruix@EiFEgOEqL>>YxaEvZ*8^-7j2{fig%1PEDfF1;{xfKxQR&Ys<;usg?;*0`DO?;-=b~ywl_E79okD z2UUu%%%kX_bl9q}s|t;51_W$U;;s0z*P_c|@Zxje8ByGyvLe60yixFsq=i5C<4^K& zU(&p$#cT(Au_3qRSU@R^o0{Im$mnFH!GcQqE#;2#?|$~amA^B&+y0lG}9<`slA#bSw2 z%IknY#%6c!8D!uDI`)6&xW`8*@{|0yLI-2zmU+;sS+H*JQ!D-s2 z_L*i#xr-88mZ)Nlz9Z>{;!xm$hQtGk6E5zlkVlsG4-<4=(}#B^>w9GLVS->;4DQFJ z&QL+BSb7-Q^Ust=*vO%m#E30&{BSk)>UT~9B>gMap*5LUcV_05j}o}Uan7g5%tXmE z61jtM&m6qb$LhuApP8D?8wEM1%#U^J%#6OCB?MKSlG;nsnE6xd&+_Exi<)aWQ?7CP zcg^#BU?Ag6{+T+)xvHOjE*Y-=jqLUzXa0D6irX7Xh6TfzP4&{8PVxNRd+h^l($q3< zBU>7w72Iy<4!V#>A=__dA3YO7$1`H$9+#waR@3^f+L8j)ZlY*GkKma z+Yv3#J~e0OtqDEwJ%M@$5HYbqpF>E~I{QE3Frh)8k;vCx_oza%MB-!1sCCue(%ovY z(Iy{PA|4)|0Rdd*E8%*MF3aSP)EFp8bQ*gcVM@us?nE3vw68L9r`YBljNT5-ozP6c zCMX{2iP1%cy}*QQ0v{P;HZv^syA(nOhe{VP!a8HF=V-Fb{$5}P9)*z|@+r3SQTq-% zEJ_A=&Y(ro(l`}(G^uXz>iQ$Vkqh7$dl$UlXp39QsFGu+uGIo)*{`7lWt)O`jZ|~d zK~y?2?MY$Y>%KmPEk68(8ZKvmKY>)KTpRmd_#Z@i{pt=Lkft|6wJ97d)?9|oIFM3w z#OR&|!aYD&TnX+4HnfmW!gu%e{Hm%aModDN+2O3x2HduM+7)Sj5=VH1pv! zGP5wsz$gRCPC2!~%secbedO+V`A zHN^Rregqr==Y(HL04bbX!7gwB7BX=vz#=Bv)?Xr%)EWZRAfg5Q(THofbmX6JB<0Sp zSACUOOGOx>$GJF>BGHfU2pS*%W-C5FuQ%mnu%sTM14KMXD zoXYBH`zcmliE{%vt!24c15%9JSy_7%!s5sipJXMzMjD-UJ86d{w?W#7-ms}cI zqp?XYqH1SSiQDYU;@a0^IC`Eu&1)cl&)5tCc$6|n(HDk-Mzn`BO%J4)4hRbFw)vHv zGhz(1oAb>8NHOkloeF5P?Uby|P>ol1gcq-9NovNrV;(j0os@Zc@8U42*ha~8}qWHR&NEF>h^blnfR}{8f9O1VYynNEaTlPTBT{o$ff!lwQMYBo3z1wCJ+`< znO{$0$p-d`cW_d7bMX$@&#Q}3(EaEXhBKY2m}YX?t}S8BbpjZt5s#h*8Bm?27x!~Jy}-t7 z;K_y=5mXNpWuu&H)GOMajFeI{kH%Y^p*<~z9M$a{3-Pm72~Ertkf)pdYyfE6l2@@H~GSuD(0=R@b<0Kb|L%&>-&~zX$(h|s3-J}y| zO44S|QwQ&KiMYDa-}bqKjI=d@dAGY@+(-#QnXc!H*%6vODBqa_@$D{1f{{PjiMKZ? zm^uoer6Xk$CMF3O>aU93GG&RgqUxjyI#x_wX`$7F(RW73z1;dAKg$NinA@rq@q$ss2K359g-pwsOFgoB*pQeF2wF`m$Kk ziA(lcY%Z-$;@tqMZZYS8o_;@bjJ4#(z>4zqHny4Y^F7`TqM#`W=8 zDTwa^EwiOGa4avx|3kLwn&WtuCoD`;q5V{O!lD$y(pzP;;F3x6;lk4PQk>$7$lmRO3D^^HH$~ke9R1i69iy7QXr!!cebr>mU%N(h=woEW#ICC-xm{Xmb z9(CcR4Ff`Kf@YZ`d*tOHnYxwY!Un;%- zmHG^a{*T-Fmw$yye?3m|b$Sc;xsyy=h?+Bn+_xu8g+@e>{NM7aHgUn}X_*f^_$>KS zgIep~ANBeJ0C1LHrDlY?MQgp1m(^?M<8FpKSj<=|=VD1Tq;NiWtGTfDW zuZ*^9tn$ThN5H8LRq2osQq1dBpn(61b1fZ^^Z40IZj-wP0j7m&OqNO{E?_OP=8Qhq zf*kEZPU8SSqft!}jX^Fil}E7_D|50t$%&lHsDpyzKGviU&UCo8e!GPaWD4eXnsZLu zGD#b9Mo`Pt3u>BrPfd}HBOxqr^6CFo>01SRr|4C6);N-LmKG=@<;@AKQeH5YT)T|G zonMuNOhN8PHttYgSTl0b0#J_EFGG(|o8J%M`87(M-~^X=*C4Zf!?&17&S-73g4CQ* zf=?l(##O$y;~tSHp3$&)C^>?0m=6@0$nXFenS_5dEI`8achY=yJ-eHh_H_VnBO|!P zFHp29;g=f4-f?3tN=7m2@Y0UJZho4AV45R*sAi!3h$WZ6=6FSuUG;n?jUH5cvXL82 zI4_V3@3FK{v-KLl?f<-~nHoVFDR}eBVMKk+7}BP)M0T!=A5Jjc;IlFxFDQPk<)) zUMfqQ6H`8`QAK5B@6C0;WV<#a*Hl0PxVm4vAiu;zsni)*{OsyUN8L+BGvrz0LF(>Osm;=8hsu zx2Df`(Iy&2Ww8YoPB~wd6Wq6Wwvb)VNUnhm6Rha0KBD5gF4WH6`NPujoIV`&FLv?o zU&klEq}+FZdCSuJa{lTqq=*z2t4aiQzFitA5=ecYrpB9dSLUu@5gp-pHw)sj5WV0CND~3;^cs}@@=U`_)fn%PaRwS53xXHo zw=lSQ8`b!c7$W-Kw1QC2nkK>f!T_~zBYJ>W6d?-NRYd;x4OHeTG6#b)LVnyg?N$`d zAUVdfRS4Pd+h#Q2%^2e-$=&l8ij074m~rLoG5Wp%R5;6GI-coj`~e zfX(tZ4Acwc7KU~X`m+Y?B3W7d2Q{zwaB8BWmCkHHX42dWyRNbY_Da`v=$~8-c>F3z z`%UCjqfP&*=Tt;R_lhY%fVA9Tgw#bl8=#9-7LN)|Nm5|Z!8u5=&#EjIK+w}k8rT9yl=e~v2~&ayP>nLe%nQE!|>M! zD}sXc(TjMeg4M-KiH%PTeiR4Az~0irpTyz)_>%x;?4h|xaLty!Zc{e z_N-@bIVp@PE7~uazwY~fD)!kok|Ka2ze7(Z-?G&%8zNG zVm_+KDpClcM@gw4oY@ug&`F75_0(hioVG61Udj1Fv&s*o^s(AW?rYeU3w5}Wt1>IDE5Nm zv*R78=db4A-hWZe+jlz~dGRuDZC~DI^5DV~@l&%;luUy!TCEoWG9YovBx^R_tazE>x(^DBYnU1}Zmn=VgD%gl=~72TD;J4$Ai1bsF?(&cTDo17>ufb% z$hiGOMjvJz0WYzxX*ZoGZZ9-V&+FMyhK1UbU zgdWJN^|X`{{|+Qg8qcF~#D@Vh#7l|{|9SqPN?w8UOXC3meis0L0f2u401?S7Si-yT0siDC zj2G+52PuFp0Q`|2VH}An8k_tE6r^LYv$of>-z@qXXXaE9u9qVUh4E2~U*iPL+bvSzTZ~Zq!Z=^74K+s`>CLXXy!RytTdC+&d`RCuOj*1OYuu5bsg+RJQT};Us zl8!Kuqn?0pUZJf9XrPtzKM(5EnToYv;fqkT5SsN9;0G!SK7sw0e~Cw9SY1e`bUe9b z)T7?_&oI%`K9!FDh4R7QF<|boFDU=K6Y0Q8!ZKa~vL6819|76_0W!??=hHPQ7kv$adZGZ41Q;1*?Qqy*4z3A z6f!Lx`41Av`A81z`f!45C^0tLq81kY(B|{R-f-Az~q>)Nh!#e3; znIK6bsXzhdvt^WkTNzZkv%k!_p_1D>M^z&(JXh zBF2S<ty#nC63^=vh~pkIG#uaSQtY< z{Rs2xJir7-+#&B`&n$Ub4^&FsB0*drElMV{P5OY2 z&&G&%Ht|!?x2XY{XUb!x$IM;YltD8yHEvF;YPvAxLbjjH3Wjl;1k7RqD~i*C7jX%% zZoKw=^C=x}+f7K{qTi%A5Jh2nlv~WxHJb_C$srLOGNrKK2W3yB+=UZJ0)1N%D3#I` z2+0Mx z$pCFYlD{_x*PG7n;#6e^_@rj}X^nu3{E#9=O6m8|rA7C9*@TbGq*DVZ<>9-iu__fl z2u9?DL&-kwJ4?Yj*a2XwBNRzpe*8&tJ zounB-(wMo>bvtzE&`BSQ0v%QT5Suz?&dX4cYNb^J)geE)bz7|H{PF3+O2T5SanH|c z?3}fuwg{_>xxc&GbZ#=8qLJb60-okLubGh%Pb2Ofk#)*enX;xDh)%^u;_P_-UOxL^ zXbjpaxWvN2BQatQPOdqQN|L1xkImhC=4jw;zeb+-h z>Ex#yG|jVh)c^a17W2e^hBJMfYcX(WE2h2w`RcA0$@63XZ*DlTg43uMz(??TeD}}8 z&YS*g`X5emSD>JvphGDvqEhm)4|c(MT$Nkzj1mCcTRdC}wR79We|$h09+Tpe(VtWk&gW=b0;|a5+TR$b|6=o3 z7ViwYmyUG~0|q)RLG6r9zp@S8ypbY9(yLCG=Q_$S35^=6B54>QFhhccB{Cg~qtM$Q z@y{wU7%95}{;sqrGF1(|>S64UZ30Tf7o;hmZmwwd+#hlqe`$S%h@8BEp1ii_;&1(( z=j;UAb461o-X?D4;S5L$`hBnuR0MtO6(S=^ErMC1-O?jEP!IC#oFVG7nT(VI_IjtO zyB8!-uyXAK2bLy&i}E#d^Y3S_N8aSRZ9?#JyEz01u@PouXYe;+1|37_t82}WB9muv zoI|lN2;#g8EW5Y63p{%ZQ@Z>M%$6}zInQy*OcfmARUTuvnJPKLW1I@(u3V+94sW~G zHW~nL@Y`moV}du##Kg?ZnCuViH!q#2TY7tsB{KQf-gKGob2kp#ZqcAsKp>Dv>~BFJ zf6fMfk=^P8@MG$E$R@J%b&{V)u^R(1#E}~Cd=-g_bScxhX6xB1{p0KpM0JeLCaAKE z*Fo5ivPV7|B#kXDZ{sNXXT9;+b)!kxL^2~G?Sg{sw|oz`X{$5be?}kjpdY@6X9CYD zq2LoLHaxyI9-lP3jSbh`aom*@ z_Yc#5M(Ny&Az@DN(&J%Tp!K;ya`BDN-k*$f!{fTxdL0;%xtt%d@MI+I;oFg~k2frw z`&c!ZcXbH>p)+@TT`B2XUKFtsia62C4pqBoB*~^}&TeS6-dLmH;OLaY>>WTVTx+mc zU8z7!to6SRWhJM74eO7UPC(FO4ZI=)8Dbax?jN_yKSSwX?oo2>7SHF$KkiYUlG(?) z&JL2oBOY-97ydEwK6Xoh2`)5GZ=cxuK5i5o+vUao6wO^vI{_kk2j#i91z;G6YVQr| zeBW}qpB^$Zcb$7Wz8A?Ce%-}^66*#bntewcVg9wLRdImrJP))%dXtyy(fX4LU=hRC zoY0mJ14Gaof1EteGYb^M8_w(5bH3#ZT!f|j7OwUwth_3!c(0#>sGn(9 zKY*J0U>e%i4;h0G`neOXeLUEYrZsmy>POfad51yo4)woVj64vY84*U_OKE&I!a3OL z7mrKdP7feTx|V)=lQQXc1LA3d9qyefJMrWOw-^6y+C+DPZKjok(xEmlKa>vq&_5klV^|~ zx~^8DGcE1vm^b(HI8-!M@L(sG9%FVBMJmm9k?fRnGgj>#W!w#+#?LlsUhh&r4+o1FuE*TFf| zmH_3E$>}A2i*rMc*nfW8C`d*ISX}3#E-_XFG0{PeH9?2SXU0Jd04Bku&&w+ufn)-w zB_eJ+grj{OA8NlX&;w2{SdGv$kFBY%f0Z_hgF0%nTSL&~*p^bY4%nD-ifFb6Qd&3i zq@*Lo^aV0hVCS|{Et+ZBbOOR#KC1y0C)mwv$P2{(Ij0x#4LG0|>=yO}ej;_O<}YSk z+U&fW_V9ntT%$jR?_ti*BixW9{5iLmJndZqG?4@<*nlV_0mKh59EfITY(In2T7xQ& z(Hu6QmpuM75@;ZjAB}?=?9jFucUYmtHO%<)Sw10(s1@Y7Z0puTj&|e!U>5O7EM)@M z>t52-PncVDgm2pT?Y-#m89aT#?Zi+F^~7PKj?26)sU;Hp+alzf_`SyA}5EDWP1 zRpwn4%0Aa5OYWrvzRJXoCY{s2)9$g6hyTB&3(}wnpfmfRAA;p@?t%e0gRfm-tEQ;UgeJmAm{=p#i9yvM zmviP0tD}B{du;0PeI-ESL7R=}inBCw!8$0A`mrUDR4RsEF-~2ap{W5Zs(JJv#G@)0 zg$J^*;vuX94}B#(z{Jh4ILdbe@b2-$C+xFT@9y1&XG2;TTL#v;wWSCbu6qpatv1po z4Z<4GZEulyt^p{>$WZWlzsN04=PFw z9UJ=Uv>iTr|8bClV)LLHT>}aVPMVAqUX~ohlm!cXnqS(u1lcHA{)B5Lqwps|%XiK1 z<*o5r$`YZU_)hmV(! zE@99}Wf%I@PUy6wC9mFjm!TJ3W^FVajK1U=zaJlYL^bNI_iQril(Hw=zu zC|R`l6Wi2C4Kd?Qffb7E31cF}3Rxy1^%L;bfWhx+10VV^f~oqrMz}LJQbr+2b+pZm zxW+7oToOnd&}3jleDNSQCk)|A53#!N*#|%G#qIz&jAL|Ch*I)tx|>N98Oa)t@DXUoob&|vpTPxz^Wu?TFSfHS+dJ8ZIrpr6K`=<;Lc$GGXcy`U zdw4|$K*ac_{oeUD`~U`r21H%B~y3(s;o<(!q>|%v}4{?M?SGi7ld^sC&32*3lgiB1BD8^43`&o1ZZ{v-np18Ghhy|GD~PZoDMd zUp*2C$vr}u0pz35HE|}9fs?I?m5UEGu3LbUpdbx!em`-|L3-4T6h4+@8ZN+M^q;I# zqrArL+Xv<}9)9Gc-N^__wOI%vBCwVw3??_$NtgoFrK*wg>`qoQ8rN^>*fyM+$LTN;l(z2;ZcB(a)6Ez!;Qm)_pEGmdBdO}CGi2xKx=fL}11!D1uNbUOYVw-cwGBBBK1; z)2joJ&&G-klo~kBm{khL76VG9%peD`5r!6CW**V#o||Ajt6~ZjH;p}ynPc@=*Z976 zPTVzKAppKd6}QX+Y8%8S5T7kPZxwFrXc^I(Lu$FWuWr8}sU{Bl{f*dVYNl+1^daeA z3r^I(S!hDRn>2UeIuu|1T@;N^A#9^~GJ{4ER6qu&GODU0_pK z#yE1~)ZAH*Izfvbrxaef);B+Zi`6%_vYK;Ty52yn0Ys>z3SE7}7xJb*s7#5x=l}SV zPSP{*_DwL#Wm<)9z>I0$FlQ~Na6R9$gG*j+XT|$5w6WVZ4#V{}P&==zjnQ!zI|JSf zuZ%|lukskD__`UH;OzGeK8ab8+0NuAPPMB@`O(JYK!^{L^Imra@;r#KN{6v9is81`{4Kf0g@f*@#iW*=VF6!uw zK3WSb^8Ft4-T9Pv2vso9Io?sGXU^gzWj%ex_?1)yOutr zu=^XxD|a&h;Nakf+T5=Mc5N%{y#aSmH}}m{x7KdpUrK}>Q^NeuwR-oRAItonX90k> zGPdGchu+UG_`;bkwyE~N`yJXQWoI}_hTphq#3K`4cE}t;hN6s9 zTk4y{`>D0vk~wF@qlS&zZ03rvl)Mq!LB5fbHn&^jG?goEhZy-VM)YceM2q^D=mycT zp?xcE9<2;@4EG7_!I!bGgr^~3z<>dxj6(ZOFKp0^BTTyti|N{2LsbDT2Qv)a1I6W) zF@!dWX5JFi{M|}ZF^JZYh-@XD4ZvW6hZ%{_L|z1aox-Cdh0w_zhFw$a>H{>Y%~DNG zMMBA$HPkH)psvyy@^%)|6))d4l+C)AyuSN#X7Ym{_b9zz-l9H4j?bI|9XKu!Knxj_ z=dc7!I`)jriR4VHc}WLGZnUOEG_Pwq2!|%|g9(B?QG$}HIuu$4knV44#}XPL@MMi9 zLvxnw>_vhf{1CyxXg0a?0??#DL0Tb6ECl}OJ*@K6!pU~FY;0wM@ z!YG-eecU7EM_sNKjQRv!Ze4G33(Ac;;IM_Xs)j;@3=8q|40JcP*BTGGM~gw|`&Qug zQb{hPvB9~fm@8GSV=i*iX22fjl0gnMXl=k6g@}1*$3@cVammCG5?vMgyP1MyFO*>B z>FvZp1fynQje(3Ac-rdz8q7+%3D&i&)L}74aso<(5>2O>fczT?B~X-7(D5AlE+Rvn zZ)f(fe(pL4g{YbCst)KaS9J0n2-Ji-pqO=l?y0v>E+dxfyXoemUB|kdgckTTU_<|D zxu*u~>InuaT+35r<^w2N3Ia0xz&$AIFB&Q51c32c52CK8aS$9$I-eq@kEWxpGe;8HIybN;A5|`b77>xv{M)$M4#v04>MEwO; ze5EEHthhrizR&MwLa}s1KS#w8F3)s3FC)gMg}ru}zs);$<7q$*&h+f`6-`%piJ{}P znT&k|11=&Gu4;aiOWgm20+QGvA(xsXiKm6+r*=&;i0WA@q-B88OeVf^d$DXxR`i9J zg=riLiT>>9zj+}wNUN-sAchVPil>gc{NG^Fnr|U75hp4DDzp%|Z-$JukLm>y9~&=j z*F9pa`RWqTKDTrA{XLx{DeFS=1m?<`G~n0ch=RBP0=$oea7Cg#pSEodEaADBSEuas z;`7^d4-=l!Yavfj6*M^fW1E|l`uDO4R<}KUsb3g_n~!do1I+!#A=p3E9&4ghrj8ZK zbA*~Y@6X2C;k0VziO3}R_ma;p6ubGDBsQjo8w{HPjKWFEf?-4Xw*)T3bcdP%ufE27 z*)!o~dE&>O%C&CHkawQCO8h}Vn9vpQm2g#tfeHDdL$>8o4ynS(qp&Garbiinx9HYg zdt#e}6oAM-X=%E7hM;5MlnJ>o;cA1eou>y5&6O9RK2JyMlQ>cvq=CYtCEFZX$dYE~ z`A9kmEDX)2(GqEU2lL1~93aCu-w9&F7RH=Mhz&vdJ<#n2dhoz@4@7{i5K9 z4%PS?Ld?X1?ZLldL`%79vk9wQRMw5A@Fv7klc zXN$(zv!qz3yM1WiR5B7$$DJpp!sT~kOx?}AFfpm~Xm1|!zkO{EdtC|TnrqZ!=3nM_ z3m_&YGl`T;_~>=78~p{cmviMFNc@Dk-J1g6t(!=!wEkyd{tnc}Gbn$*>Y$jUA)6+x z77~@wCU0%4k)0`0@wGU-#yiRNly|t--r)&TxIX*i81g5G<j0$WGYnW?Bc+B)*)0)=QUl_hN9I--c{2f-z zTUCl{pIIpGRG&#eL#1XWv=~Q=x0g93N1b~Rm{JKBf1@vzOewcv4)f;i!;?K6l%{7X zKHT>j-S+JD)7oI(O!Hxz4+~yzJG>7x#|r44!jqw%zljfmR8;BdWL+O(ZUdLa+^DJt1zJrDvYA@w z1Q*+@ujS7{t;O)wqbKRQUvyrtAIGu~AHB@;DEf?zpsb#=w0|Xy_)R9{v!;l-@)^)@ zjWQWEH)Yf^b8q5QH+5YorlT`UfR^;8f%|nqS&*!32r>txmkU;_1yrr+`0*1fXkzIx zU*&%n^ShRT+LFK`9pKU*iYhyQiTLaYp@4vZ3@2OFP`L2y>Z|G$Si{B~Veg;^JqUk( z6lzjoINcpkIqCN~x*W~(ZE$=i_)+}w-vd%Q3eQm8_-}o-kJlRPtwiUKe*)c&((~QC zbd#*JKaEn6*HJtQ+vKEw9Ckm8jXl;H!;w^EIYIbaQ{cQ~3c{Q!ngK#G2D7~D1=0u| z=--iN!wvpE%A>DFM^c~iMLdoNB*m}^Ym){>H%W>cJin;p^4IwgkV>E=djh+F?GD@A z3B2MvP^&_(5=W47kN~zrN)*On0)gI5;pG4c01NnpX)KvM+TZ%3lQfn=Z zDfhipjGj+%AKI=}z>oAoRnhe^ZV(xtgB9lRS9M~!Kn^4H?XAnYHj7lnc zZERe8ri3kS;GK=8$U*5c=(LM&d-!t1-HA6J98?ItBt6;aZ99ChnXwdgZ*QK4xO}VP zbzCyyqPV5P#crI*KtY;#8JX()9)~$hPL##mn>XE`{e7C&eScMoaN}(6h(;=S?sd|n zfanGfNJK&&4O*EwxcSYPe>Gk)&r+xcj~DfM5%vh3YPq3i(7|rRglTh+Bc65?GNvohc9Y&NSua9|_1OrXK1h)549NvppA`bZd&k{hFrXXF>N#YpFB^=c~>O0YEvZ zp$2)12M-hu&x>6Wv>H5jLT0_*3UHKzhto~`>bQzxAa=-f z0lQ3t{DG!{w==3pq)FqV(-*&}^zE7&v%MvRQu0`pcR8ksGvt1Y;cW`gJw2p zEwr-};2ndOYmH1HICu8YgINg>fu+%j* zYXz0k1_rY(B?kv0N2p479|vmA_zv|+tn&-xZh;4Qf|m;M8X!nPE{agGQR@)^_KkGR zbd;9~&Oore#liC^$#N!8e3IwE3?P9HJV4DEyu{5EBu54kGf!x`A7vEnunxlhvW=9N zWi3fOmi>G4rO7OJe#;{ufDj^xAwIxKj*6Q>GqlD{{Je|G?W>iOE^g zU3Hg!gmk&VhX&#)0oKrNv4eBRFM$pzEmdw5W0VV5FvW5ZA}1{U^tCZmVAZyT7bR%c zLRPT80e22kBSI-wNky-Xjmw3bL#u6!_H;BwRA-H_4rTb$cp@5lq&9lNnr=$sD+*sHQ#eRR{+FcIp9eKdkx6ix;g=O^`S4TP?OC zYzXd6=3B_2Y6ZkZC3V`2$s4t3rnyPM2g+@luyXAPn4m^T%0eYWLh8MA-G3Kg#Okpz zH;=(z`uCx1dxL|GI(Bh*>76wwab-ECo+$Wpm^65w+W_&{!N5gu!?^SO`j9mW@c|6M4~ zLt;Vv)XPqW-efs}!|xkW|8?&K_@I1bZ4@kUDl&t*4n!RS5yU7i*VX-fKP&ZfuocOF zw{e2nbSAq%7z`al=1?Daf<`7CY1SO_beLX5B+*pF_rWb;d89#@WaLl&wcRx3GM}<# zpe5FEJQ9$*I(OsqgBi>t`T%6rw3>Q&S$tx*|Ftmc>o@ogKjNPsfgtfQsCTdGkHC@k zM9PsN@|x7hP^~<%y%8#X(PbsQLTd3u^h(BOC0V*4orUSsd8I3mT#zeH1X{rCY*YRT zl`l(8VEe&gP~qmZUTI;V>fsAy6RG`23Juz8BMcQqsK6(~F&+G~T7RgFrZMFh3Mu97 zQ%5D~WOem18`c;4|0D_Q{&^kIe-%VkS0zBCdQj(y_3^W(2L|TTP||}J!%h(54oKrn zwu5Mo@g*=YFc=K>^3u%RlH5c4oYic&x6!PZ(|k5=tM=7?NPG6|m`z9FG_A9zHV&3> zV_wKsOb88WZU2aF+`_#*%{V)wC|W22q_d?gOntT7LkmETmJFAELa53jv)GA1+9Cl4 zyoeDlW`73&=Ix3Nc=t2AGu+|#J@^T~1(4m*T13u0c>R({UcN#e85tS5+@F*?!Gscf zI)}y7F`P-p4^Cw*{Lw{qo_u$F75Mp^GSr{Dn=Y&9w@d<(UZnDFvtK;iIMai>jexca z%L-n;Ll0Y?%8jSa2H+ldVrDRmE#jUUs#}{k(HrelJr}BHfS$t(<92Hs+thmc4qhB8 zEYf5+drF2~zn$NNyAPJ>g^&he5d&2K8l8~^8%h!J8yF}weUrBF?EU7rE*}wzLZ}23 zP{3d?7y<$U0?Zuexv|;mTI?sE*Pf#oDEfh7N{afmvuCnqfnbqIq;>llO+v@vwe7;Y zw1Gv4?5_uyk9NE_CHdb|EV+u9m&E_duc|3{2ZRHr0S^xkeoqXx==6h}b6s;QKHOwr zl<;(?qopuqgv@Zk8!Wh~3IG5ALuBZ9ur)?7foaUW4Ac@p;z3(xAdPdvqVXAq64rjF zFbQ>E^Q3xlg^dC0He=8(3a#Zt_1v;x(rx|0S05UBw86%% zt{ovQmw8FB4?2Du!_>fHumL_EG<@p)fdc0&q!6QWrq`WRASkC#L9b@FGzTPBDocmW){?NsH9k^F>?%3ParWv(ehaJ zvxFzSo@giNp&en6kCH?0-IX#{YQQH0ci$fZuY-E<7JdT1#&_qLzXgBlpC{+0&Zz6W zmce=HjHR(2l2p9hsfrd9FS7rN#5oZJ&+sUbif5zbf-sTE!^*SAlj?5 z7T_j98zAI6YR>7UpG9Su1zXJS4l#B|Hp(&-fZ6@+l7$Q4Ki%RU^8yF<7kS!TNc=$) z*06|kaO>Z$WCi}xEkghR00Jj)ymVeeU1o<*XFFtN#!h4#WtllMF}QP=)io+u;J|?+ zZaKwz-c3#!khu{@Zk_Oh+hhZ=VWk8+b5NHlP~1l?6yXSuHMEahrHNyUt>KY_(z#FD zI*g}82-5TbO~g!wA~RuA=+-N6Z+So@a-H;KU}WNW5>2BXL$taDLA@xl*b`A1`N~WN z@4+R=r$^mc{Y*TDD3vTRLi5wX$Q6do7PvAm1|}J(3QAfO&s$3&mf8%oNKdP!?cj49 z(4c-G=z956YZDvb$l#}8F5m`hlTy)`=(EJ5)F4ItQB6gtUOsJ8@b3LOM)9R`;40CN zU7G+P!1f~Lr*nz#9)Hov5i^^6)kn*HEPpN}ektYCO>U`Ziuo2^VQxOBmDv{7;pen5 z@A^Qe%Zsl43h=XTt#KhcSqDo0v-fz|dSPXBwFAY289Ejpto1yQ;mHt=HccLl9)Ot` zVfYjEj_#>dXutsua6ku=64I{mhw)A{o>@Sn3kf?f$;zYyWKmVH)cWdUseU3?s1>8+ z29#gDN4}08=3{mmeS-Kl=iu04&<3T4>kJU-B8bY$oi&HKW=gnO#ySf=Y}ObNB+0zU zxt9KD^dwB84e5Tpa5|)^Y=d7|c?2wxoJ;2mEM%q-DaF#zxqJ9}zyJpD0ao_I> zK}FB4F_FZx!ooA!`()0FL zrTUN2*`zYWjxrV5$?oR#t=8Ro5L}fz)#yl_b)HzNR82B-P16ny_IjpE=I%T~s!C&a z0*-PDNAC5`@*u7)-q0m|wnx35&O0s4TTJ*vq@H=3=(OJ1T%fLV&Du+foUF_3kdPoj zf+TSo%NY9MfT)+kxWss_2^@ndX3roMG8SDB-11Ze!LeJ9&}d|tlgK_J+sC&hi9oaF z_m-)}Is=|G7YMCL4g7Wto4$Hy5kVXgm22|u^`n@FGL#xO#i@ZE4V)EaVHGHeA z2paD4d0;GFXMBzs0R4wgUj7>cXuSe;O%azm-)OIo>y(76yht59=0h zR?#V(@MYMiJq_M@+9-#bA0F_nDI-snjHNk%IO64cP({rxKnHSEZ;l>8bo}f`EYBAXGx>wW@IUrL>B%Fgj?L-!AZgQ6D5w3u=@MepNvR<#?vtHCXJZ09L(d6N?x4Ig2Em}}YKKj9d)a2X>@=pqK@Quj%$jP^ z0)~qA$ZOp+R4E>|sT`C^gal{`WCza{JQR|Vvc51FjLl3~9JUv+l}yv!wjL`K zJTMdU;Sb88y7h9_{cE?tlQy1YX=%1Ya@OQ}>II7_oF7QL++>P}G1NTPRFCL&-LplV z`;iZ$T6>ig_Bg@DS{nG2;>U8zerZ#?@BRd8;%KT+kAtqR!`$_f@di-jHfByD?D>9C zFBlyIV?4_bRIAYMIl0O0C(sBI<^xezyu?AC#eMdC%8*McS5CqdGfL={ynT(Pe)oXr zoORq95D4%f8i7@;1tI9{$6kdd`Cg`ok_44trN#ou-@>IBM_@QKA}`G-I_w#*%ZatS zW$hvJfOg3;&qC}~(i^33UI3VDimLf`c<-pXS>LZ-%kC6aiKUU|@S>iFyhKtis3t|g z%G_VH6W~azA(;Y-x@jL6U>~s$p)SNb<$&qi(eLu(ia!;7vTxspi=iZ z1^5y5_!45lcWzz93>KA}Bnx+C8S-KhVwYn~^W#lxOdS|jw?}E-WFtUNK9QQub0JV& zj#B;UWWUrV-rMAElFw*8i_(y<&sycTV7e53{a^gxZrBRs#r4XH`@sVYLM;g2E{w&rX5F5mzAba=K3443q zj{UK4aW1ri@$MjHnz5^s~{JyGXCVj3yoN4$Cw-g9%p1-$eo8(U@_5xdLYCKksRbAg3~@(Sh4a?f!y9lNDV0(^*R3ANSZDFCTW z4|f3SlzC>^;jX%1La^T<)`z&Z%LX9~VFEL4f?`M8g}-;NH=~3jUx8mK(Xpk0yk2Z~ z=s@FoI>_?7VdLtr$=lg9B}V$b%l4xvI6*kX!~QO(PInI|~G!<;q2tj`rQ#O&wlBRqxCQsv!@h`5NW95J}iIp{TyEFfy$z>%`X z32VXhwy?6>Q{74Xff|y7tYPXNUy!Wu2{%ALOBSz?NcsLYrAwGAZ&D8sXlHI6yWkl? zv9u^(+2{#4s6_ga5dedt#V3$8;yFHxQk0F!CgfUiM#y|O8WuxtpkJ1ayaL8bco;jM zSq3%F!eF?aEbg5>5p2;h&rs?)-mYhex7+&-e>kPSrmQ#+`ObkmVSs}NLrlmLP`gBv zg2S~o$xYpAd{mC>t<9W(i6`G!wxy{1AfG(;U{C2z>Pcf!)~A&c-dzj(Qkup)hfyhp z{sxKT{Hrl-Lzyok@;!n8Tus9?c@1q+t%?JKtcG>z_Aq~{vistLe@2olHx?8nl*1r*CSdL(o5;;^^Lv7}{J4yp?p zt#5cOsIEgnzIV5#$0@mW{=O}oyHG+=mi<0FjcnQXFy+nf`DtXmXs1vBuCh@BTB4~5 z#Cbz1kMnnZupLe+kc(W?VmZVJv(^>w2VHdkALB?k>eV000000FIqW@sbN}sKNbUCg+~VwGCp3Gw3`{ z$ZUV_)BGlA5jDcX4kt@^jQtg zqm3pgyrmcjq2Rt?WxIINsT`4gvt+`&v`fzt>|5Xiy`}h7D?)JF_xX^=(Zf&JNAaij{}EVHYJ3$`B(bw2z*E}C|PkwK1NPowZr(U3>> z^V~1k447}DWvtW~`WSF6pqk)bQ622R{kCi{qZu&05l}pnhg+FY_q#0OY^_hcmlaIR zHa~`M2BRUIVfw9gJ#prA!7D4^_WzocM9~_M{5D3Dei3wZUEv<1?+=f=mvRxaiSV*U%4$X2* zzb^L-U+EQahJG5;?kTTcwvEwxK7DgEd4lRcl!a^GQk}HSmLyUWs|b3O&RUKQank|Q z%?NHsYproSSm;n+%aOD3K}Y>G0y4@Fs1oeSE)X{_UA9_0|?h0$E(HzCQL=*0>fYC0&l$RXwX zrfZfDOw8Fk7XBM?+uGk0VbGe)bcZ!(vtVUHV+GnMlFi_Gd~H&_H3}KiIJLH zUG*P80RLr8_74Kpa-Uu(!8)}9{f-NVM09lYmyveiS$ZR}xt|e78luw%Qm<;EAk9bd zfUPWK9ru$n13?p+TsQlUe3$Z5{PI{qCLp#5KvyA9>pBCb+yg6mW|JnIK*jWFA6uhWETi*PLK)tS#=NACI&pA4S>E?KtHB$Dv<`S z=yt1Zm%)1rrSVE0@!}%{bV~wModX6;lu!7q+DXB$QS7zGZM&u9TU%~r$XJ3NKc z#~xl!Y=4ID`!&Ok+KDa<;`HW42ul`*SPek}00`PH#g6hs@fVQ=^LN0#_(*1rsYIMe zIan9*1x!J)Lo2E~>cU&q5(SUMCVY=2Ijmw}#CC?w2Z8d^&a{ON^KP0hT5qaGNjYgG z1r*#=Ts?SkTo;!ba-AOPv$HOmBz=Y&)dsO2&z)KYV89@zT{|t2o#S)!-Ah5GU1%5AZ$VQ0i0WQcKLBc(^faSI4JNs<{ zT?a34SXT%5GR!>nbtF0+*zloF^%A;g7;^7xyPv-nm)wPnSLr&X(qY5msx4!T?9*bX z?usl^ZBW{3U4-9*dX+u)APES*s}YBi)5ysrRv~x*$gI)QDKEMAuPf3(D0OB6eK{WH zR967>OA2OcyE3_kA66olAbovOAxf|yT)b`K6ZjR-h|g}x`nr#}X`)A6ww(AY5gY|` z*GHMjMrfeS2r|t8m(oy%e9A0k?{m+!?i0PSZuxv4f&`a3O$laPs2Gqipl}>g3-p?I|iq*!B8CALL1}VZm|29nGp~Sr(g~h zUyI(n-Q++*N8aO@#B&2UA+1HH4Q`1ZlED_2*1VkSZH;N(o@(<$=-L)= z@kI8Jr);D6)W(j;zq`%9Q%DnEs$G!7t00Wp9!(<2ASv@7S)`#*#q9+VFpcC^UJ^27 z$Rx{=s!`l!$j^L$6(ra%t`}#04h}G2!2JDm(hLuBPO7Jm`oWsj$NijG`vM?JV?uN? z0+Jpx%b)8UcJIBV$2eKm3_sw>Cf2_8s96+nk_xutoiDzFy8-OcN?{wo0Qx?OL>_@E zE79-DEZik!3_*B8S4!3dMC}pCQC3lOk?O)Lxvi97B0;;sSha968~uOsK9Z3lJyk1B z<(@ZH+yIZ@4R{Lg!)<)_8KICBEBZp66#8pL)YT_~pmJQg`skY_U8z}kw0Qfo9??%u zI=OO!T2F--p?X^w@w!8zX5S&fBC5N1>e!w2`mLjJ^T>w;=}qg@Xd%=Qx8l|9gzTm*;L+P`})CS&6INxuVd-n z$zaTg+lw1GV7Ds%0d>3 z)4H`Xx-=fZR;ii(;o8tg<@G${kxZBZo}QhECzMN4x5Q`t6ld?7L^9esrjznMf}Hup zd1cRxp$|9mj&Dc*t1U@fv@ zocj|ttNSEK3%!Phn3ZQORS%4^(|y%SHdb-;#+nLUbNA6 zkMDQgL6h##8HUZhb41_joSzicYx2s)?k4tq>G2|diNEqV=?BeXNxu}Es1tl0ik@cz z)b`nW0^>~NQZsbOW|=B)qk5lgRac?2(hwZ)GlWg#vgjI;dEY|GR`Iz%L>Ju2eypul zxpc#d5C{kaa?Tt;5D0`Mce@esmduFjeFQ-ukPWdk_+gvO9w{4*49K8~ra&;Ry~%R2 zCWp&>VG>tQ%_7bk?&z_IgJIO#yLFR49v!CCF@u6BZdX>jl^9i(qUjA&LcEdU|F}a- z%Cut#!5g&}Ah)spA9+<%^sfd?4p;kUKo^V?P`t6wNTmr$Jq~SYU|?Vn&m3wmXxK|0 zcu7pCP@zJd0riqua~d`6jCrTt1nn&4yXmA4>24Y5(4j+@-6ySa_GsM&cSijv@P)E6 zRXYZ~g~h*CPNo)Tc8049Z7UGqygSPMkqb3&(i~$l{pcktP-@s{Z2gF7aYz-d#MeC_De;fvh6-wudcP2$ z?!94>1MwPVf9HWxqm^z?!DC*g4&=o~^#Wnpv_8o>sCW~nZXGCMtly_D$n`tJi|r`v z?@Ep2w>_92To>%~)6Z8U_Y-`_4y+}3=NvGsJsx;%;AE9^uKwUGL#H7-b-#)G3`psx z>}lGyaG>Yl#=M<+e}B05*ehqiNCt{3A2GWE|5*PctG{-TnMO3lp=MR+P)wReT9H!M zT(g^j!;WV2)rWkyGG7^3^ENxfNsBw}oMjg1!)hZ4 zC|b9b=B5XrWOZ{jaP{I9J*oyHWN>q-!k=xRLW7QCW7%o>18vY3^0WL%qX4fS1`HT5U<9-%iM>p*H_&B#KW0NE@nrZng50 zSKaF^ds!v1ea}L*KAoK3zjTBbK0gbeF_e4CD!QL#j4(S_HTc~OhTAXlY8~|hDh|BA zAivkj$H@^;SeUg$9H9iTyT7{uape2=AUHp24BMxQpGBkcML zxB2@$)CZu{MweFBUV8lw`ohU90$WQj=Iiyq>sV@)3Lyq!)|uqT)uC+K1WLVQJFlgK zpGJkjjI*E54)bQ{yiew^g=OPI_7BsmELIuT^~6QH&vm_@ZFd7bXxZxoQ#ItnUc#2~=U-D_ZeR zlok}I6Ttw=u-j~j*!EojlE{NoA>K(tC&-Rji90E+R7-m-%Nw}RM?NA2gFh!ykHj)N zEKx);Ofw6W;CC;jV&Pq3u-1@AqY4Eb6>Kk$af^lEq{mt>v)41^dwn&oBRJj}oDCO% zY%|Z`Zegx3`JDF5vUk;iEF^Ih|kW^C5i zWfjJYzix*QfvJ*IH&LNNh3d9xX^&V+%fW#ls3eBq&(LZ;}_w>C))4ES6ps%AN z9m*$4SX>I(0SpEso59oFv;6nx;roAj;UB0Oc{~45{~)q3QJ+9YMy5QMSYxk?VaS%P z0H5}8oml)g=wMWts7Z180rH>;AbkhsU2T47w%^GowJ-jm8}T|M;`?@J&_wUfrkyr9 zc7q+5%L~8DKf#+9sAwWWs)l3!T0QAibuskR$0-izerNE``e+hi+QPdM~ zjOof(HDZ7_S3w;3G=Dzi8-pX9;1qM5;hZjognH+HtbQR!b-8i}CAm;H9XN2{AkIxK z27hlNfRNhDZbpa@A=1dv8>)j#ghoM>FeL4$^CO0$&4_Ye;`vzd{FzB+XdDj{ zmX3Z7s1{jDrTH#QvbX7#4SUI*(N3LMuB1Ac4k&|I4FL&TD8H3bd-10>2bb>g6{x&$ z#19KNCjAJ!YfB&?pbeCwqa{L}UZGur*%}E9xTP0xF7EO#MpYL4%eD#3(LB zmB!hzsI&7P4qP4kkQ?AMF_Mck-Z(3zvfR=!j^dlO6}%}KLGXiet{@b2O9F1NICePB|KvW_^L675}Js)~imRY;e2`vGh7!fV+uS2LSv+E1q4HlLv%#b!ku z;$&7LO+DW4YSEy5lOa9^cb+iQmgNpt-abPlNamIdcK;gc`V8ZL$)8)k-`V1To)L}b zGK}1%2T9g5y%hv)Js5l!x|LG< zY1f1kZtLWcl22z?eW;Lo;YnAnJ128$l)R z(YMcz4MgEVQ`DSkz(&brTEI#wn%U7fHkpz=>=HyoM2dI3P_w~w7ZvB}EWIuA-XyU9 zKZGs?=^>;nl6-IwzeoA?gaOJxRMkG+nyx+)q5t$%UaLEQb+g)$R<(=+FISO7v%Z~^DXD38tf|=!2n2;bV{!I?@CUJy4 zj}L8B!^`r$)(!k}ga{ELq;Rg*`jA``w}#BpN^j4p-fv5vJvb}JvzE9Gi)L;anjtfz z7fCx5B1DLdc<^{AGAz^L9=lz%tLJH;hy0uu#!%hsdBrJE4TJ7Kt3q^iSXSH=9|$1z z6!2)yCoxMCRst3DXoC%|83ieD5dxAefsPGis7zBNm*P&!5s#yxlRlpCgnQL$2hsbA zV6jx9d}X>^`1%|!jIYqD1!*_nYe%IMRm6J~$@3`c0hc0@?2$T*xgb#J=t!DG?~M8s zw|5Xi6r*xO^>@qHdx^k`-8&gbUWd_Z^uxTo1Z;imn|I&&WE+B$E3)lK{S$^JSxkkE zFANKgorhd^}*Gw+AX$2|r-V1dD4@D$aT0>*I(cli6$?3{^oY{c8VV`e|`#uq%r#aol$ z&V}bAP(T5L!C(l8=bt^L_JJvcvG@?81hH?O=vGn^{*HI+ZgXqcHZOM+2+YqUn+&B% z2%!C_qQ})CSuDw^9|8dJ3X1>$0QPu)4jTHRefrFky_Tw1Ko(orxzq|CqUUrwyVsrR zGW(ZP+}0-lO}&ckxjmdb7Plp<<#Edb#A7)Sm0w(?x23f&3S3r!m|QC;EdspQ9;?Aw zsEizRxRpc1=)T^>vy-`W*F#?~HjJwiAgVSnrA?n{o=3J}P-5$5@WY7cm`#UnsWZHx zK8e~!t;e2W#wtL$afZ90DE2ohiOjSu!jrfH&L==XK!WOyOgx)R&Z|h+fzmrl{7za| zq7W`zxN!gEK@A2~V9UR6aUigNs|pvx>JR~cNEafj5$Y8j9Q*EM;RsD#QpJ<}!%_Xa zSNG<0d-t&5oMRTVG(<^Qr(jz z&u<>ByGB`lB)FB6>xg#clSg!?+FB7D=YIZ)Z(%xII?{Q*go-VLa{yR>HbrE5ZbWsM z0UJye5>k{lDYhiLvqwl#`U*ojt$e;q0TL3DOG_sxG}6@oYJm=gLIcgy2z|2-0_LAh z6#bp`DHJ*x>w=2Pv^kTzPJexI|Li0YwQorXR;z!B-M_S{1efl=msE9=FuJPJOb^E7T zawf6!Hiy}361N-M`k>=c!vODa{6pX^8F)}B>v*A8PtG<>eLUSjy{xMV2&|$860izV zPY2(2kUkAb_Kaa=JDL{Ig$sbPR4WgWP0M>sor}^5#I>SjAr~sRiYgW-pb{(2*@R0w zTGzUi7hQb$=Zh4T;xh&EkB4fvE6H! zFCyBsjY<#D);8^&wTsD91Af_pRfvVpDBbdAZ{SNXl9GlLywtr5tM1K4yNKCutj1O6 zY@)Zq=&U-Hs+U7pb@2)P6CJzI9St9V*kjY^gPU_1QtMWlNn#^&+1p$p5Q?aE7n#U2 zjX=$g`!7f!F5_iIsFT#C=l-})+uKyN)_frAul;a;p{7TUA`q8mfDt1`%$YL>+~#x6 z3+?KHAKk!H0|gM~1E3{88&2t9?hcQ!zipeYPC!M44Ci%hoCt?T+uN*0>%fGC$ta1b z?#$rJbF$t_Rf#65l{>J51ycY0|0;4D-$i3eq$Y6;kx^L(e%)Ve_e0%N-@&Hm^B4#M zXnJ1^zzsj7x6^&D_Hpw05K`DlE-?sW19jDJ4(j+-tiJbjF;yR-f96|%#5|DmD&%75 zBj9p=l;=X4$XqWq-?@HS`&U7-wQ|RQZ>k_@=Nt@vS5w}G{bt6|j0*EDS_ZC#L^@_kl`iL_9P*NysgRr-B6Xk_>J zr#;WY=rj)M$q=RMnY_X;$KLV8m3c8~?-A4shTcHiKV5}mqG8ZVCjWyk@eU_+a0Un4 z$VS6wR~~=q+Se-B7QiM?uJ{6mOPc8C`F znWLbEbyH&)I%6^k&hizL-Z{%Vd;nL3g}Q98pBEK@As2zuVN@R$;-8ztx+78r`1q+# zUS3=~k8bCX)zb| zOZ+WeYy);`E)VgM7$p@_*%_&r+Ef%GQlv;piuHt$l2S#qhA)C@Ky@_||J4hy1Kdjr zXUJTHJ)o3P^kl=ypur7#Bl}(jFc++(JoFnj@JI)Uh>{AouNmuyLm7Nnzl09xJGj56 zBHFgN1x*uY06E2*d6gVJ93A+UPvFRr8H=wbVzm=&fEk)u_dW^WFcFx(-jzEPaG^e}9ctU|dCOhz(MNowYj)*Ka0V%8=4--NQq@SULWnNk&ilncfnCm5plTg($Cmls!sdP>GqL=MzGEq9 z;EXM?2<$^`J=dAY{x!ti*6NmP|3Rd+1J1Fzg^*GR(M6c~>~T@rea%t>8`HLAPr;X) zwM{PjWukXs)vwMGREtB&aDn0_ln(5~m^3(9a6fU1%bg*TOL1Rujr8eJXq0%D#iMHl zOEtSWqC4Nog1EApzzQqTU#v)9x#D z;<&oHcneo;b=}k;9zyu3k<{dmnS_kxMl9g@*HXgRZq~5Z1bECLe|^fyYg1CMvc4R+ zp6lzOaX_0FkLeE_zOoM^y-}sQVr@0W{bq918uGz{ZM-z=Yb94I%g+@dlS^=Q`I62O z^XZCtef0=D>eJGs=L|uG1mRKALRjGNvvJb!E+=wPkt#n_BF9-3!UQI2+mj%c~L|OAP zqvR&YjAc+wB>pj!;527XIo|cH{Bg~`n8wvXB7lw3wKcUbooqMyH$Ina`i+ZOyxxml z)%D}#Fm(to_mH_eJtISg44LD&v#LhyA**T2`St{r58DM??J&Tl=6tt)mfoA+#@`OP zl(to-O*^#H7Bs08&)HVTvDqt_8h&ci+?z*%(K0-TAY6E>rMc$hF?Zf3bawQj!NLtJ z*sIMS4``F=M1{m+2!Rj(N8t&=NOB?|AOvC21@1@4iB)M^Phe8o%aPKf-gd7k7m}>X zP|sti_|V)Rm97COBLYcta8ipBluWZL{@~=TG#!fOerts|1f?EsHEj)O?Jf^Mi8NMD zcPQ0`L#comsTNAiv=ii{t%AyA9LGTIl7vEy7HZ8!>a_$ZoOF^+EOZW)7Nr_|5Q#`o z-}5Du1?N~{(J+06Ggm(MG7))jU4`-sb`!zyY=FxAzAw-?G4kR%C6n^iSh7Ci^Z`IZ zgh=9m{@GGQ6(g+&EqK4qxhSxAD+cy>qzwxnTUkWBKdkw-`<=kK2#65D-^iAGkG)~}-k2qw+J zq*5=CLN1{J1X>^ivn|6QG!_K{fh~dh$u|K%{ZNfl3K_3?#M!n3WB%G%hbU3mL(!GE zL&H^CH+!4Pv&aqrrIRQ>_f06b_iPU?k7fNOa@zl=3#fF#E z=P4;IV4=qZXdzHJ0dR%*J(^?7d+hc^qmjIL+-|w%LwK*Kk7liWXLl#P=~un}PA(bf zBp50RMk?<>nX2-jaAYDkPw>dA#HX>SERcgV=_qOFW$;5x9|o6|bGS66!7X}E)I4~D zQ_*9pWgWbO*G*a<<>YGH@Znv?>I9HD46V*8j4<@)9=4nAEfGdFuv_2@^u%)+IBK-& z1%;xWGw91xgkLh>(di`kdG>OcKci*g^#RX`X8uKU{%~J;R^b|uq_*8ZQ~y0(F@~N@ zAJ*B+k9nH^Pse*f`tj&9FEC#ugi1Ap7jRArDoLMN#yNPK;0ErB!hTXg*^b1!7y^%U zFLWM&4gKIjIhRLNTep*lKhk&KLnofh-t0W;0KJzMiU!_sI(K}s-Ckakqlc0UdJ}ju zw7Wl?brK$xfwQ$c&FHdy$Eo?i!5uU`kiD^+I+%gRZ1gJVKl8bb{pBMq%nKfwXv4yo zD4{XmV$sJiA02ctJgMg-n$pOI4*oNl-#>isbdz&A#tQH$@0cVcX^h-*QmC_0ru-}< z86+QQLn7I7PT)g9YR(vi`N^s5sg(y1^|^#@)$&&ecM6)njIHmInAoZ>jmwU@RR)5} zKs?#Vc4Y2aloFTBl)7orng$@xtTHn#i&kuHYN~yb9a^xs$4oy9 zrOIXL>zm5jX{B_#!FaxnzeeS0(Gzh?!`J=rC2j?UngP9HTFPy@wrSpGu-H-KvGcno^PST{LM?fa4AVPIv24> z5)$mPfzV|NVgsxc*&~u1B}vQunMN{8kf1&9QtG8TDU@Q#8C-00Eu~}bU9}BiyyKHD zN3aD2L8H*#mBppp?_L(9ad=)2C10 znx;?R94`GVY`j>!PhzLi3%O?cp>019^eG~IT-QOb}5z4su`1ttv%8?)O zRroR@*x14*!tmk4hfjXqg?|xy`R_-3A)65J-qXI;rtNbc6j=fLco?tmv0n9qW$-ur zZV!HaYPjgwA3+j!h=;&l&!RE^3WVCLgL^J|?07im^Yf$ZU$5n>k^zSO5b@+3OOwjn z+2Hh%PKhGs_;4Hk7U^u)oew}e1dd=Hr*LjYSSaknunurj4Sugv(54@3a;~DTZrUgyPhhX9jIv_Pj zkRU-)wskrr^qIqLE}U5`-yo(ScDBNe^&xcB0UpGa>0GG}(lXfG;36kU&4d9Q@FLGqlSObKV{j^)~8ya8qyWz0a--I9Ryvuin&YRgUn2?`V zO=YX$7iWvib?UxX=jWwW;||Lz4<}+!8 z((S{l@y8|BL#)8>mqrUHk_}Q5T&0-$C_eVtpz=L%hJea# z^*FjpjiOKT1g5D<_^MmXn) zQ3p|^E_PZ0qV^OR?eM~jwN+EIt{1gXqYZ^HSfx*uTDh%3B!$JHW(yFtH=<6Rx~-SG z)X(jp$`ONDdIf$RfHE3bYry}yz|hmqYC~h#+tU?{5o3md5sgoDFb;&>%T%d`Y8K6T zbxJPQ5>#)_JUBq4Diyf^;jf~9=YzXo<$pvF>dovI3+e_||R z0@3qZ>L7Ue7zf!*BA0xFN#xLWXx6)D_>eU>?wx*@I2tyQk&eBxHb80$DKm>Jtd8}m z8FZB$f+ac%NZP=}cqLS8jCfx-mJ4quD+T7Fe}k3Goy zQa9JAkm6O^D2}w-Eg&EuAfQ=aB)jW5$ovhx9d=In1L@92cCuN_i<9~x-3eT7Y5Irs ztqLDax5x{6{fPSm@J21^bBk+tsy|?7U1ZsqVhRb8O9_{*(U7~zu73!vy9Wca(1%u) zx&P2Yu=R(c)uB=)KcZj55%n<2lV4E`?1f}`yWqmki&ZAsYy)vb=t~B3VV2VKA@*9H*)ysF6AAqUHU*fEHL?u+b7FrqzH>lXDP@!`38|$l|=TGEJ z8y;H;e(!EzCFDLFbDwvOStx|=0KFyT0Tm36(qbb5!veNXr(}Gq`$eCj;8NQPNQgqU zU07FxFlcTfSfN%-R2^{m(Fp%Hl8yM0iAHryOmx=?7zY&){o7Ns-Fb{1S&cvp^!2p4 zl=bkx$eAo5lbm7vVU*|NWo!gHI*H9y)(q0=FRJaE7Qb?rnU1OfN}s(4f#Rb`MZDWY zk}sM!%tl&75#uKO+{9ENM$R5TrZ{3dveFYR`VhIc9h9qz9^AgZiSg48_=s? z%d-Msbn?V~JfUW^yJR4g3*39$$@X5IGpb7U&Tlt08q%6FdB0_@+d5vj5~HxV-3$CU zztt5{QfGW4>}{tWi6O8l8aD{IE%2StZsP^4$!1L)R~U`ikOBmxi{#RBsOkBS1$!`i zh$JwUz#+fORNRh3;F<-@79;^}{Ga`AtXeCMW#a`G@g1;WFXqc+Rw0rAi#n z?bv1~;^h#3)0Jj~tU)g5+_0>6tj-1n6e=g>YqWwAK1;`x?^tmlhi=aPVcAOyMPKoC-1n838{2&Nfnw4mA15Ok5+iux{0tb$mF3BCo9 z0YgW3y+wpR_ZHX;b#S7CP&N`B*TzDR+A=seMT?|$U@3)C8pB!^(<^SxLcEnm0}Fo> zt5EkG%x1)9W=g}=)oTPnw)0f_6x{0Zz`_#C>4T*zWCyFhALn#af)=VG8UAnodD3|9LGy*W%6T)>Bp1Ju7wq<%HW~^hcFiR@gmm(Pd0*(z;j8>x0C$CO(ad^aK*FpR z!OR>t?0d%S7r+SrlwA{&FpE7{@3-(51m5litmjbBl4cgR zbj^Z490|-;1mTk#yYF$tIqD(Wp#`0(%<`I)b7XfxZMf3f!EmFyg;BKD+}r*#RuQ)9 zUdO7GodSB8C5(8v+4** zTNRL1)$oH@RvM^2zlBuU!@#XHKnH_cKkZx#kR(X}0I+5y009G09w2Goyq~)0&UXJ6 zv^{?g*%4h^shm18ds$cF$^}5Pmj?Bedt8%~gk(|5vn0;ociTusXc8+fjNIN1uNU1S zd0kqkPTdx#VJoFU!$vd;D<`3e)RP=Hmm&kY1NuNFfLa7e(25#)j_=q+;P7S%VLAo# z0`M|H%gsdWfPLkwKsz#2i}DP%A+h&8c+;h-`e`%9m#c#IB$y}wJ1 zwYs&3V89KYSkY={YO4Y02+=&@lo^qH9A|y-{rzp`P|;XDV-h~~T*>G9d4k!Hx! z^t-?5q6UvthhFY6+J4PQvIE{>*dZyLoXS<=6!JSfz|&AUbsJ9Jd-n zSb00n?}eB-2&H$qgV^;Eh=2n5)lN616?Sn#V$W?U z6mf zc80@Ag^T6N*2!x1CPiAo?9Yhyxm*s%KJC%o>Gm5jPd%VpnNIgIre7GOEqiDK*2{gq zLVCkSRwx{VH-f-HY+(yqL)Dk2S%?>xzCy@f-V6Qj7;+BX|LN3{nb`#IV8$P|b< zUz%%`35}E@$RY_C4dQW=~{8Md@RJ0nMBPJmeRXsagGU3jp zQbc+($Ox0iIiYHKYL%_BWy_YW?*KZWb*vG?PX6mVmsCcmnc<)}@4_1@R|77+YBq~- z_q{rCZ$fA_b~y4k0pS%SnoJNEI6R}vloA~>nGts^h$wAywRhXkJps4@AH~%4uyvT^ z3GIa;V;(Yxq`{k~{r$7*s~)U%YYk(piI1|-)3e!bgz*J8>pbY4A%@7pS$V>1*MAzg zSZCZD@%v8kwh;bAg?3;g1`(tGg=RMFqeDunF#4R5>LGn?IwdT$RA?oXXbwtifgAQz zj1VR1&$WTb-u^e z>}C7R?KK?;liMoCxIJ_PW3RRyf?$fmzAwbfEkaI+OfHaNTd_y0QUc3C`Y53nOnVnk z>AVUF4VR34tl z9leSTQCsK8GWmJSk@>q$%G->#u6iGj`2ooB;+D)c`HA3W15Sd$ZMI@YJ)^j|!A(CU z*~C-gid$D>^4xhmxI~|=juxrepGhfNfAk7!y?kNnDjeAEgU7xJVPS)3j1q2e4{ldO zNLUNk-;##hLq{`EWDFSPIN=4aOP&KJk;*y63tryp@|@_-1ZhoWr^jT9^fw+}oo8ar zlhsp&AJUM5Te^T)vd9cIDQTFKdn$5quw%buZkh*@u*0_6d71ehcu#YibuFx-tuiz6 zpXF*(b8+rD{}v>>{{bIZ7C)VaHPWzmO=JZT(Ig#sLF;pM9(d`Z8ZRa^Ud@0F_R)xq zA$xlDsSOZu|r3V8nr65 zbx@~1zlNNA$3w@-ZprEj~eNcIH_%@-jC(32hHMqlJl2AV9a=pppxz^-J z(g-C9D!3}b!ItI0FDgrAsBsK0L+b>?k;zQp1cx^_cb=x<*!fvhU=X1^-HEqD&lJJUKqN*DL$(h4PZMo+LjX!1z`+z;wFX$O1T5k zL)o-;_KI}zu2=%}D=hI3Z~5g8;cFk5LKutlXj%7hwwm_+UVpH&c80Ep$&3&7t$G-_ z2d1o;u`q-l%sfL}DM~Fa!U-K6A5&@47ej>3s*~g@aJTvkKJaObL3&wzA@Jl@WY0;z z!j~ExKJdf0M??(bWMlcx3wi6J=xHnwk7eS$SmYjUJEDu*Q|2d^>Kf6-Mwg0TSwJnh z9wLG!jl_sMr_+F7R`7)n;*iQMV2jLp;4Am(8c_?ZlM64sSOjT9W}#{(sX#fUFfX^% z(Xt1yRG(7S>AV1XAl6I#R00hUjxT+7Bb6ksB{U!|k5F!mV$KMdcCAb7cOZ)Xx&!4Sj_vzp22(p$B+V*3_@^OzZ2p|8%6QPI z%%8};?qzfNO)=SAggfEqRV{0@MYCIl*yEds*uH4)BL>I)*oMS9RqJ_y9~ds~)ZM-d z^|rJIY{odH0fJiG8!{`~vlKX1I=gb|(1{J5o){Z>_3hmSRtGx=HgN-Ydt6G^jm3hQ z@HQg8U8vy_O5js*q00gb=2Qh+q^skZbd?ArYFJrP&}`@6>;kOo#_c?28>e>xWBE+u zVdfqj13Lun-gCL-_6*B7kIT5(Vt;K(kJOxdszX(x7U2e0#`@%hRu%9*;L|yJe3X$< zbS}>Po7?`sh)sy%T^e_x9i_c2UE~rKnu5DTLjBHrpP&V3Lx(*jGO;Izwc4G4*2Z|l zJqe-ATD)BL?2NWn!R0+$`i4x$Uu7L(x#{{%%C5Ue)pE%V3K)jzP004k0>jD0Vl2*?n zRItuyEFDa_P+JPnB#^^e>2I|-qFPPY35g_fFmg8^FS*BW^-aIz`d?Qfv#1WPb;*=W z0DR_?-$R;XVK98@kW5nwNQ8~C76JcCIApxI|HBVRafSOU@i9CI*?pwShwK)-*UMO8 zb3ld+ndO}~)K^r0aZ^_V1cx(1L-MrMkdc<(RmLkC-Dra%UJZF=IZtl5^cY<3mo!_x ze*d^}<6~~C&PAFp#oA%thSQ{|Jb9)BQi#Gvnwr6hL)soR0rc!LFSIH1Lknyf0qvHQ zMv``$Krn{bSe`vPZrO?#3%1Hrgz3;buIhP>n`40_YD`RA%36*!;FfU!EPr8&(i6i9znh=md0+npfPMq? z{4apd7pw0kL(dU!<6O6uE305AbQ@FTQ`@PzSk%@81bDyu=r3_ zV%mT&rQMkzhda?8wyW-DogSk+Rmsu@Jx?Y_q*SNl?3LXg*@X`v^u91~W+jPrPqVDm@s1!|xaxZ1=YLx>=Y<#=xo8#a7YrC> z&;Zo6#$3A!hhu3Mi7Uua4geSm+62r#4vCUtz!4pvET_AQB+i;Zk+zLJd`ri-ed|0AneFMeNMcB&G#;j7+G`F`PA7FwA$5`hU||<^lb%pfzH^QY2%!(I zbOi*F3g|NVPq|kBlvSw+bP`NRW=BxMQFBp6o(7R%E#wQ*are3MxInz!Wdp>)ry(`5 z*qNVY&?BE1b%Na+3~sahN_OwJ+<1<=31kO%(OZbRJ+~}spW+F8T!Eg?iG4MA7d|jX zw7TKXXR}FXn2wAMk8&E)FP&56KexM=JMB>_+*Mb;Vv56UmZGY8#pZ$uSq_Be5EB}? zXQ3qYTV$Vno!f-E3U(t$rx0*1$2>D9SgY7)u!(Xs(q4EfTsLKTwj6rQEr9|B3Mqjm zPuk?ii#i%x6E?lQ9aqeY_unT^S*$|m%>W~wroVNtp}KNTj)uxllp-BrPV{UQIrJUEI_ooJg>E=@98hg50RjCa z(z>Qw0C52w{jaP=Xv5oz{jKCP9YJ)HycAd>=Tk*IHcxB0{dtS-jxna_J=9#*l{5}+ z8*bNWZP~pogXd={C)+0Y-KbfXO1p-lHM&4jOolEjStNpY?7|_-_0E=+9lh;NAn>uw zd|7pv$l}1P<`Beuew#;hN}RqDUrG482d7Dc?0vx=i}K`6L-V{M=C7COl}~VIArhVIx+9Q` zha2(Zu8=m9g6d*a{Z&A1Ahld%~Nl-sCEq&jboIx$w61i|a zk~Qi!d6!6vZTe>#%i~m@6TRJLILS9^p);@)@KDLe@zue_y|Gv`F#- zkKD{+6TJ=CZnPIn;veFn>Qqy+rpcG0O*L||t_k9%Hn7=-hm!Y_ zjVDsQ3f9^yLTz|AMh*ocz&Eh(5#XjQ&tOahoy5!Pzd^c^$egCZTo%oecu9_!gdj%B88@z(0cfHkR0nh*}}p>i`gQC+YENNgne@vDA( zO5X%q-UrW#1+lS#I7FId1mR3@iwq0!wT}<&N*7P`F^b6PUQ0hD z)+EB=TnPtRyNuG-@%|JGbFBw$u)zi23~s*GgFgF*^tS7?snsuKdG?9F=WMSh*u~aA zd%RdPg|Nb>&u8pp{2XchGh(}K@Ud*qd!D_`9<(Pn=A^6g2vn03@#h|6ZWoUn=68kK zr-ZNFiM@%dtjupwgU~)Y1pi>>p%bDAU8mEEDwdo`Hg8-tTHqFZgrs%u_JnD=Zi2=# z(GaBe#aUfTT^MydLgpo-U>0IKh)2A`kApX@H=nK7{)eIe8n;RyX-e9+UoIM7 zj5`azhEGbZk#x9jTilmKdo+#b;+c3zDD&^dU>)vYe5CRFl81(J;^SGVrUaech301- zXr6-i0lPnG{xk7@zi8ItPBL7$aN)vbH)I=TVxp&C+Q^voQBww|N4mZx%QtHyB}L#m z_{-TkTOG+Q+OMi2ujQ`i&w}u~FDJf-idF>vp#_Q+b#wAO%j=zke zO{dkdf{bri4Q~ef=Z_y%rh>TCPE;*O*FzI*(3q1D!5dmq-!99YmMw5y6;P0PjfN7h z()Vh&nUYo9l(rmYLN%g0x_Z-Rx3GL1>L!)U*nK#fU!Zs#-<8~;v!P#`vm0*9a1m6q zkKFQS-q6EQ!LY+!4{@Kvv2lqG!5V2tzGR~W_Toj_n;a&7r8}B$H)?M0qG-yfpHI_*oM+>_UXq-!u~s9 z>5fKp)%dYb7H(`AX)er<&sDn9y+752z z0@iX3Bm9K9G>}R*OJOwSGWPW7UdL9P*qR4DdKRg%70;oX45<7W=Mvr#F6e4JmCB+= z2?~W`rRwlpJD}Npl#tD&0I4}xHK-<# z&xdA6Q!2cs-SKM~5bmLQxsK}SZfs&NWNyMj)vn|7{vR9>_^@gZhn%I$GSfKXIDO9D za_i#Bu_9?C$B5Dg0Ti=Cs$x7-`sZxo?_+!v+~N_yYKW)N`BCpQ^DXQvz^%`F07~fN{|}+Q%IB{lx*dJ zkj4Q&9`p1b8-j^&UeE3iVQWl9kFo;fHMtLDQcwB$5sfvfRt-J=rg@q+2tU*x$AA0y zyC>!f2M!!K!L#$=uY$K0OFxZ6l>f4jH{!>dqVG-C@BCo!d=$T_)nEuW@W|#H(BoS> z*(>pT{IY5d{&0n@2u|;TF8nZPefJDvJkl^gfw*^ob!8Mq->ubQL2CC)6G@KW2eO*7 z1sFU$JiH^<9cX+X%#@jaQPVpVzjf!6!uLRpc{REPnzURt=+<4bZ1(v($ZP~$o#x`) zO5me~jTi8vg~yP50uJWXiVKArEv!Wfy?A<4cHpZYOeTaj!ak1WFN*9cmxFhbBPhN^ zA-EJu>(+FBx$VnIPK$!Wi(^1IlTD^y6cO4kj!2tfS<4M}sS-r7;KT)%CPzeE&@g!^ zU!vo5XAVvKNir^n@L&qes<|;{i2DOyvK4PprTAl-F7(0Jz{ZAF;pE_ zTC%$13jlCH!;$&j+mEd|n5MQC+qq}wsyY*%dDd`*i`V%#*bywUv|67**D z6u)Qc*Iy zjd3O&3IuYi`h&+Dfh15_zV=OQl9OS*G6N@YU(Y-6%3Kjea54%qGDf{Pnx|<`4>jC* z!u#a(k}FA%vPK=e{!4mvmvb5-qG}C2i3O)9Wa<;=W`lx)x@G=-d5Yar7E1J5RD%c7 zX)1_SFd+89mAtTYH8OSfFCz(D;#w0ophS>l&Lqf#p-xH32xgYfN^NzKTS-NC@mzy^ zyf{=Lw8{UJZm(S8q<~~@$5^g=o;u{s`1AIdQ*YGuRGZ?Lx|OwSAUEVwxKFP8a5^jKUFZ zH^bbw5(kW<=4gR@V#b&S^r3qi2{fK_leR(cRCAkeKSu;GQ=_{*Rl{#}PG{Soq> zfWOG2I;SCZpS@?8ssq$;G_#;gL}$;W>Wl?4gLYZJ5 z-H2f($qhk1GYdFOSbn{dfywer9yGxP0hu*XRgK~Lj^^!T>=Mbl`Litlw9Hnb`- zHg8;+aI90YeDfe7p>skcVCJq1a>lW;&=xy7$1{4TO&{op?^AMi!f2lPVBMNwqPczr zllPqFtmZ?+Y$dp4XgVu3E&1YMcEjQE;`_Ez4g}je#s0zdTXn97ueg#bYPxmH*77*U zoC0QJmQ2)9p%kdmWeaoGS!8-WnpoenCMTQpDg{8(H~^-Qh~)WTg`r!~Wknk+iy6## z6>I|CGR&&PVcnIzU#_CVYAhMHeSqbpz@jZV4mF9w?%@rSZ#8b1qFXTO0}7>DW+)sN#bP_Ua3A$J?J(Q=dL<}41SJ4(K#;$wAO0#U zWZoEH^nq*M+i!=Sk64{QC-p)56PK+JsetR#16In=S#M?k65Xawn^z!T{tW+5?hNObpuGxSqql^Fr+8l=)(@ra5dNVrJhfvX$wz<@54j;=-jt%5nyvpR|^%ugwYG$#)**DZT|3%NlJ+tsk8;U7vK zJHH;OXVaNk52Ke!!uYuR_sboZeyatx*R2{It%y8F!J-IC;3iigd(|OQ3N0;Gsiqlk zEx;d!u;eYLBB|)6jKI5XfjVGTr&Z^7aXNNgLl>t4xy zas*RMN``}|5o2)&>X&AbYXlDHb(k*+1v0r0(mb0b8RE*|6Q6XwAmXZubB>Figh}6Q ze|gor72B(LW72oJU>PP}e7o2Uyx2@?vg;4@ZkSZ^N9+FLEqw!K>JejJaf7-uxis;! ztg@=H;Bhv&C+)73&yPuCMZS1c|_Jn-O*d-29uSrPW2LhilS7*PjN^;2WPp!C-7l$3DEQ_pu?jkD1-AB*n+f2zARFD7pRFAVj_e;>*m>G z-2X%gTl(~q2PjQ~^o(MGCGQtaQ0s7}9a6)eDn_fG(QL|7-fH(dPS2kB$v+kwr|9AE z#JG(<1s~JDfDhCEWSt-TT2GE^p47MLs=sngg{X?@_OxOL&fL^n_0m?A!igxOvb}}B zk>FJE6;bnI69ND0zOn0eEo+^0QI4R*N(&My^4|K)*v!%Rc(*hMdY>pnm^CHCDlN9q zQ4OPV4N`?Nkin9Zr>J66+;;34^5>Qq|?;G+qU&bqJ5pDQVa$1OyXhO`dC-XHNhH)~n#v4AN=-GDrk( z)9+-*cv}B!zH~1)Gy6L~?##I4Q4TWVf=bkITg*n7^C1Hnl+eMnX`NGZb#M6#1^0;9 zJ!28ANc9=(2rO2~4A51Jx`4X(qS9+6(+({eWK;5)h42QZIn!AwQ#{GgsgOY|cU&K4 z55Y_st|Y_*iJ4aIk+n~PGEmRVWu^-oK1=yCb!va=oc4{yeYK2unYAhISDK$i(zW#v zI73%u;9_;k^a!=0eGtAJdTe79B9cv)#H8MwJVLE$tXau@x&+%$lqJ=Snymg0ck3Y3 zGFfAe!JC`k`lsm104p)6X-qq!oy{_n;Jj-+vefi%b}V=l_e2YoZ2~VUhzzB809M#c zV})%ffE;XTP%dRp|cI&lbBvAzJzW{4B>?+F= z5m|I(f-TB@G+3H$CM%Q{9jdemH)PiB=fP^k;zM-v$=;%x0*D1AJ~d@dzt*9=GW&*+J4 ze-a{hDnmmz*H?KV@>)y(psqFfjgQh61PH8VsT118t~wUXmR2G#!c)_!?<}ecu9I=c zOg{ZeQq<_Us*xUEO$rdc>#b({8EGDgdbCSnyiP>Val;SLjT=&qC=QYx1Raf3(|}t(GRstl!I0yhgI3E9JV`O zRu1^TCIu!{qi*s>YK}T3;pjweJ9x#gA)YY8z1e{~SUI_b5_Lf?hfX7Gkd`T_Jn7^< zXy?@QPtpP3qVHu9LYb)B$&_^5uV%o|rfWl|F6ePXk7aR^Mfqk)FrtG&`0M6#v-9>z zddd{jTu`WpVl#%pOo#J}BE>Nk)#lJpw3S>Xz{90lq zAM*{kOgf7B7HBWnz-H78QQ+YnVhFY7J!vP7rkK1FFNrnz?2zP|3UCoz&#Ijbi1EpK zf@UBCfsDfnO3$G$6qTcd%fsz^ZTCypL8a#t25EH(%?CYR}x1038MD$Fmin! zFhE5@qBKs{HhPhAL?!K)E9gRAPL(P3inqekL7Z^gL?cC`vU8bX;gfRY_bHTIBA5G^P zYHMpP>k0^%6_l)>dz|M9`6{I=cmmOX6Ed`w76jtBPMLBrs1j~V;jNlb!6wFbMC3N|6)BeQl9PIhLZV?~~} z==T}D8^aV>Xhk@-P1uZo!+Y4>d=y7ZFdXGg+ohHp{Ti{2=rrIjh$H%Z{|>Ai5J%rEf?7o)ILhZI4m#R^F7Ln(K4_{f^%L#m@?m2o6zhPRoj z0!sf>tHwsmXH%ujz*Yc}riPdYh9#yfgs_IUXDM>><>%R~cXa30hoYQ^y-0#`k)jce z#rBv=mR%^m;?)3&k2RkIp5Fq&rD@BjM6X3}_Xkhx)gDCs5bk)3i%6`U*lp+`^RV^O zytuSb1?qT7HCwiQU5RiKlS3;|u6wm!D~3C3KjBiFqzEd^)W+vdODnA#&?hkz-LO@0E!__Qa*&Hp5C^2QN&;wL}sf66lGr;{4ph>%3V2T)^uS%Co|aT4{UgjInHG*O$dMadZY8`Uys)bOyw z_os>Pt||0;t=t>(lS!2Q9UZ)nmrLqzSahE%)S}$(CH2C~&QB$Idu`&chxwG;?nM{$ zn1E^xWZB@vfEV*)xDit0oOn*A28+lnMho}FWNmWiLa6}aZ}JA{JM&WKoOmm2q)DsN=LR&zBeE?(rC0% zYq()$CM%4Sp<+=?TsNRu;~7US`ZShF8lQOs)yYTQzA- zWQ&0NS`F^ATv)1MrgW97rnot&Dl&_)>Q&yOm+UGB9gtPX6|lh7nNmXMUNzZr@&UeZ?9ZU%E+pZSv>xeSRQtEUK zSKY^5cZ=+A4Lub%sr9!{o<&b@JK6`Y2Xh~6=y#Em96XEd#k`J>w=iu|FB}f}BAzHq z+&xunq+O0%w=T!Ztn1K-AaoI@wwjoH{%S~a76^k(TI2;_9k3$_UpBy+8}Cfl5~O^r z7LJ)&CJnim|A$KbF(JU)4StG4Nl4?ZOt#56Ya#QgIe! zQau38zDAtTPfH5ZU*^Ooo))vuTb{d&Rd4cbyHM-DMw@eg5_adF{eoUPcz7MRJMA{z zp}VDcmQRq~+_i{xm8qs0x*~z*Lgf$_!WOU7AzqS$;=}q~QH^v~ zY3j>bf-#DS-ASfdJ}9kAVix&HB4;hK&8PofJx;CzMaq>mi7(#Xy$Md)IbUDCOvp<{ zs-24MgD{$Ci>_~EOCb^ol?|ILD`zs^5kb`hdij1*k#^?yhsE}!W~Zs~*bKx)RK!O! z6O9Iz+k{jo9W?{{(r*?|?84C)>jFE1)+vi|i^~K~2nsMx>HI~s49$Rn=*A#RNjG4X z3DB>>d+w~WA zn?CE-QaWKLpRaYlGt?j6vHHN&qJ-)9bV57Q8C|YR7vDe2(e^@*6!#{Zg)HyWOpr+i z{1hr&EE;%@Es6)GNM7o}191O=tX zh`EVjpg9KZO!&l10DV?pDBs3usr9BnUd$1^(3w_xH7`s1b4j;4ULmTp*!%6{Io%%bv;H z#TornO50I9nQa3=5^jpWQV=T;ylriADC~3`6N!h7jq05QC7DoB#m4 z;7et4a$wuW!IqVVaEOUP^R}b3Y7n^K(}^R=N)oL^`q|9B9N4INuS}r`sH;-hz8v?x z_3Et`QOISks&L(^=CQ+>J`61@m93QK)Urv{*a9btS4p}z?x(Us6V{M5fTeJeTD%Y_ z46flcMH{&r?~*8_k`0Z#^0IdzC3d>berikXNI{xwzFXn;?Lxv$CPG?u0D0m9Ix}41 zCX1Xoambr&ga&h4$G&Hc#~hvrda|sDed_Pe?6G-qLEM1?Va|nIZI8Ms;Vka9G(B1% z5GbzVV?GOf3BB^jO*xj>`0f)&yc21mjgJRkGF~_TlezGigm`xbvL@|5)nlE3Ls(k$ zm~VA*kNo=q0RaK|d?;CNUgYfeb(n- zJL#C#R7(JVxi0>-9rd67nM^WzuI!1-P(OG9XMzO?iW|yC)8nk@1U+)&V zfnw4C4h&4#S$mU1Txv<%TMJsVy9PT)=`%Rjls%(F9-UF8S|DU5H(2S|`x+BWu; zDrb5D#sG`-qJ3>!iocE&WW*o0g5M5wcB7qci4U#L_Ck-BR?moh+;~Vq z+qMw0!Y@L4Jyo9ErTEj`1G5MTGts&G*!m0}>(?;;oCzM|hvu_DWQHMqIz9=n(+3{j z6s<^Fa4pK`4BYHW*s=it004X`#lp3Wd(lriDtM7_PQ04`kHPgxpWrg7U3s#Oz0P&c z`RH4Y2sYh$*V9$Aj~{QFO%PFoA5yE?H=HSgNJc=`D^c!Q;;vFxO@>yv#~+AQ%1vwK zo!PAuF^mu)LJIdU+Cinwlc99?ov^}NAg3!tEFd95^lnO_oS@uWEA{>$Lc>^1&m0^R z6j7n`$OjG_IB>*`r2_K-r4=qlg?(t1Rc3{As12B9o(^QO9aT5a(QugXE#75-ZVwi7 zn6bj`HF^~l}sq- zHB=R2$}-;s)M(XzWrcte7-L>=Qfr{bsk1+8 zE=Lye#VQ8CHS?P)T6(Qqq4`lB9e1xnHC3B-KK(^|%byVbL|A(4@2X#5&x^wjQ}E^| z_ob7>Y+woQ<%Oo~iJgw&szc$xA^+^C$@B*#vm_iq*Cifux{KZM=l9EZtPlGGimI z{@IhNjn~^;);rj+Z5_#j>zRp|-&DMlw>YJPI*!)TDtXMtZI8ytJ?TmYounJ9xtmSe z%(F+4d?RzR;Sm#&>#YBZ02AUe)L4B-X%*uo(MalBGxi^UQjD%(n&bU5tyzFgy zN4E)YfppX~jlZk*CjF~-*J}rXtVb-w#4h7Oj)b|i(%4RKH?@l1DEUJFGp0oBwtmvg zR3nS>6`!X8$#=Kk#SSi_O|NlWB9Rr~;SO^L+u;EW)9EIHeOk|2@6Ue&aP9KqFHjAE zfj%yV?!MIYguMd?6qYt$yaf4r7Fv)&SaD}ofCq84uHOqAJz$o1G7=iBQSXgv#K2KR7#-iTPdANud56*1RI`iD#c*8}zp1>8h$WqroH zHYKr%`Cyv942JF|366BQngWGWka;B?96Ziw|KMTD_;GO-JJPD!Up0}3xp$qm`k=4)?F@ohULD=&_FGM5!oQ6(J&f0T(tCZ_XGZ=A+%@B%qIXbH zQBiTJWp@L@0nj2 z9~_*T3DZAgLUSIk^4VDuGMazNne3D-b%W{5c7c`i1Xz92srsV-EyV+`_P6vvDsX&= zwK=xU^m9k;Z(})%iu_qf=n4~7mrs+@{BW}B`r?MZi1tI@s2%Nbt0R&+LJ&;JJySiN zZkN$ex(7kzA4NG`F0CLEYUFwDT9IlIy*Yi_ODt2)#2f2g1P~O^rx46Ya#Z{oTPu8)O+GFq;-BXb2 zFC<8iHYC<2UCHBS)%XaJ1gtWr(hZ50d~RuI1C6RC%5GY6UUJiwYbFKqG)@$3WxcBy zf@M2vV0PZlfj}VP#ky9!i^nZs)t@Q2<2&(WMo?`6Rt&&<1UW+p;pZRsA|hA<)%P!I zn#WD+{L`YTaxHX!!rFAy2}Sta=O6b(p9@xWA}94ODCyeApZAW?IYX$8Go`-8@PE(A z`gNzn*V^O^A(wu^^~Bstf~4OkA`$2Hp72v6!|YLNjj3>%R#A5;XX3xxB8FPZ>row zHPmZS1+}bq#oy*Dh+rCg6=!@ZSqx({c^$PCm+za)E+V#mNUKh588J?6argt)I)86g z?dRf={^D-RU zO1L1tshAKpivWl-h^CFbe$TNZtz`PE$*tKh8D8LDkEl1gGp}*F2s%^n@0UL_&!5y6 zf#3Svpw6;1Oa5(VFhNmwk`Vl9+5=xKIL4!YMK{gYa+G+OA-c9+z@F zQ{U5^$5e~xS*#|#Sv7lSMq*0=N%-HD_)?IXue?Vy5Dz|h0Yx&IYWH6vy!yBuf~Nnjs)$WslL*-YCG$w6EB;O+?-{P-7U{R? z$n0gG$Sj?VLl!GwB3h4^u?(-R2Z~%|IJuBshVaY#mG(f=At*DrN`3&1PAEV#8y>C} zsVa8!8pQ_Lk7$|r4>{&|>W~%H8NiEwfZqqR&2*l#)oO&O(vUAwpmZfQX*~jWA$!*N``!d{ zj=^5);os2_v&jDpL2T72qVxh>NP`k+dD0>PZi96&V2+6Y#nO#^ zkL;2|KXNV(VJSJI4l!n^ZhkjE? zxHtJd(ZxClf*|z|P!vU7``i4(W4p6MkUDE6qCsh=oOY_qLI)Dk2~Ro%mq3#m`O=N2 zIuh#=-Pc>GY3q+X!j7r^yZbkedkUYt89$&=G8)7Op^S@ofm~yk7B{4R&CdDv{6$Y@ zLpVtstApr*_|WqX;t{i+jIX8@xKPPs?c1h`l+m${kV+cK&@7cTHJe0}@e_(_+FNka z$=)qcwRpzkEgBsT;biD@41=pfp{V%)Wtc46oCh&fO$8qex|%FR zjbnAC6cL^Xb=ytO5O)vV84h_xk2w^?DOap`o?UVN&h1W4tkG}GWSp^TO z$;RH!kB%`+wIe1Mk_29b2h8|**n=aEs5p&GQqQsNMIo45Vdb?y*BBj&xkZlN=MS_t zQ&1(kfkBSVLmNt@6zTk2J-ORE`G5nN{KupY!QB+8fPOO;t$P!#oTZgUa?Nv@v9@r{ z=1j47+xT4^JnDwt4|YNM&%d(4W$-orK|c%8-^AwFfgWwJ!BzVbrVx%4TUI0{AX=>+ zcx*Urzt*tfBOc*KpcNo)1`{pJYh$;S^pA<_)O@R_V(>|6tbnjZ+GEn-@K^Vrmg5o5 zHuxiKpx4CLX*Y-(kx}5Kr6t8VJ(c&^-@q=BvZ-6_8f_ZA)n{AJ8BOWL`BHyq63aH4 zZKNcp(`%Vs-1-m7^H-2(lE$8$+#cc|!QbA;rneQtl@*Y}4R^wmu|$q%1B&egX42||Eg z2lhfL)GZPgc`Z3Slg~{eXy&pU>4k#+F17)+925pI9Un(d%oL^BhS0S^5D*9if&_a? zrKh*$TF5b!=UCP0E}-}Nw~f{<7LL_&c;qnY5k5)7%5j1j`^^~YBfI5gAsrh$sxYHo zTZ|>~bDAF9ym7r~`3sXoTgW(+2K!_&B`!J}-#Mjd8Q%y$uviI_F&2nS$0$s<4)ol+ zegXP(1rSD2Rc*#5P+=Z0I|j#wJ$ln1Tf|9Va#msV@XZPfMJ)~}B&WXQUbS`uzjW`L z%t6p=rY@DvSsG>pC^bz12H{z#!VnB;RpdYKDU2E{q;e8N((oAw$h99Fd+8$K?Up{+ z-{)l7hjN>5&zc5Cxq=GwUMkG`4bI|jgjbIY)6M>o($#FWO0O@ zDhEMQvrh{Cvn|z^hF4WN7$#XJ2f3SF@Wh2q_k$_vV2!uvbMQpZt>Ul>Yv-M?XB9@y zx-xTw?&p>Y)-|c5=42Cx*rV}TDZDPF=7<2vNumqmEuu@$HVEG~B(27s3)^3kuP>x+ zr6FM}0V$g)o3ACrS4dSNs_LbLhz6;`E7v``ea#USauds^qXil)HPb+~PFwLo@z}G+ zgVF#mWYbJ*jxhg2Kz_EBZ=_SKUNzT<={37`-@^D`n#ybT4W?c&>|^BN+0E5o$=}VC zR_B`mr#tBHGQ&2gnBW-G%~{}C(|rrnIQKUNi$eRxJ0Enl>o|3@vN$)ZsSDPzhrPg{ zjF(<+6Rog3V&=#+`Y~II)6qCFi$`ANcv#vD-uRrORB{7PO!7oE!V;US!Oz~g`lc$I z%xRRczh!R_QcuYx)c`|F9d+zoI_(O!P5q($|Ni4ISj%kowMqBuo<1E(MXs`9TkRFC zH$r9_)Y0QmFXywhJmrES2~F&6+AV`bmy8PTyjWKS&F zX(xY)p>GQ;#W_Zgi4$TzSPa5&a(>>?Wqp!Q70Hf5s%Ba^H^K#sYk;8|^qc@37?6Tp z(RZ`e{Zu_anz}y<5zVg`Ed9b%((^s(61K@yI=5$|jRp#4N!(Wo5LVOao+FSrC3ULd z(i3Y#iYQH$cl8MRUKxZp>CSON&my0QKK-K7Q~CzoXVF4ivmghE7-L!~tTs0Vt$a~j zd~g=XWGC2C?x6QxN%K<~K@}u{d)_Q6SsxQUZ-d^a{F9cxU>9l65~6}lz;FbKmJaCu zQ-apLEE&53V2Q+(%y~kD1ZbAMOwjZbA!WG)y zhX1}4QB%Qtd!!|onWntx(U3azm0pGywbq`AB;muvEvZ}B;?4cM4VR+^Uc&|X2E?IVX3D<;jp~F?$;|sNlM>dL!TpAKy!vA*D^M&9N-rJ~(CHmxW zplE)kXUBP0!vZ}kNmNJdfYDk&5W#g7f@G+NvGWgL9TK~@rUu?M8gTH4^p^UlhHRBT zo?+eh#{xF0a%if-&B5jZ8gxW)k3-jlrG$ z0&hXK74NIpqFt|H=iPA6W51rAW@PGo%6TALw%C?xQ8VaxOG@c8Crh?FrA6RP<#LVF`EsrE`}7&P?crq2q$7*8t{+WAb`)COEX$=;)cH7}g&@IQU1Wfm z)6{Fgs_`b4=6%G>q9tob0>)04OT6gzZn&(AcuVoCP+Wj;D*)NPY$^@^oGE_hNv$HPw0B7b)-^BX zUOXOWyAk|5_&Dus@%NU=MM8t>EOakO*g!3Tzf2Zt8i4v1y&3ssg)*ew5rs5eep?j_$j21KHBG}Z@*b0=BJFXsN%a-HeObnH@BJU{VdniRwnW#lNG;j zENp88?)@r)BD0?lOi~G44{sR_NBu`O!n9dx?+hd6&iX86CWM` zH4PYsX8vN8v^0`WA3*nI@qkldgf{zlyx}1X_N zHa}5a2BT^a>Cwg}Q5vYSxP*?*7-I}m=k1SLm#j7tyLh}le~;%%2EV^I0RXUw_d)L~ z0N7GBi{%g4j)b-VfXqswXxcZ})Wo(?o#*_D-GQ0dxn~O|m}u9wXqB>M(b5`~vn<~( z%PxbpU*qm6rVH>N1ioYZGv?d0zhK}G$}bx02@L0yF;tb8z!w=7Tq%eH0 z{#Fsw5@zN-w4LfoDmPx!Pj>&C-LO*&ZrI1V>6-h^211MmAbUc<`Lu5w_)&Uv%OQr? z%Zw3YET7%0*_euK>F!EN_CSA(SJAJzM6&8?)JC3ahn`h4oz6&_#IsZ!>)P9{%a5mb z@u^Tm_;@I+#-T9F9eJdZ7Plhl)l1QA)WhI>E?RdT4}j|{!M7(+8mA2PaqbUfJEreq zc;eX14bqsTJc)hB^%+_-av>oh^MD!5BZ{>F6%;2Y_Rn|sV&$U)uKTtXxp#l%bwXQ>PYWWkdG3TBcN1u8_ps_+kuhB#pTw9pYb9##<)*%s{J=ztwygF= z#dYA33j4{l;FvT*&a<6Nwe1Uk@@&j_D z&cF1Mkers~r~``wWw5{k3oMMk3Mk$!*)7fa9uWuA;^=AFuvu1WFf6Ix-PODaS2l4l z^VjN{PMb3IQ2q_*SpnGdGX5}K-VHsk>UJb@DmCsmdv4agqlQ5TyAczn&F$kUtd!>~ z8qt@vrH8>N{rYp7ac*SyJoc-9m;!20B1I$$w zA5Tp^eRE}Mi9viY!9+ug*4iU1Ss%K2<|uWF<=hE8X}NM#cKhL{=({nZWhom*G21~<}* z)%g0U__b%!4Jc5cKoJp(#_MZt*{?SL&E}WW5wmJmlrq%IAiG-8i+vMj$mRUU*5apQ z(8DsL4yj1(_2Wd^lQyBN;~eCC0>+T3jhBTsJ(@2j!a>2|EQiNng2Oav&Pg;kf>*X> zI?d9FEw(0x=2l6;|E!CdXrZ7JoBTiCQx5NHwQ2)B+|`pfd~SDgEQ|T zzR?AH2+o4lmpJrzcSy8x;*77w@p?5_INJx``94m9++oYf7nTW$qsA*uq98r+2 z1_e?(!wA&Z|p0tUa*$Tz(y9@1fag!c`q(II9aVKXk!lsRDQ! zPy{!9z${*(_d6*~|AI7N1Fe%N;2CCD!u=7!@%QuR%&1TINx>k((ivSXl7!4DjC49B8%YSf^mg54`l*v@KLA3vXd7 z-mmLH%M5Py(5>P-sE#bAEdiC*QPVDA_UWe1r7x2v590xWL@GpG=yms3nKZgyzu1lk9UbN8&JuV!;t#z+Q zncONF$B9u;I&DYIIHRmiOBoIYgoR~by5Asei3TcMlz7Dj!9lQ8P6`n}1{aJ4m3UxC z_*n9i2vPj(v8hS3Nc^-Pd!hoXwYj;aCH+;a-AZJ+>6aeiRxpOoCq#q!`#-@pBHlm| z{eHiIMk|UsN%8v35tm~tA7VnMr={6)Dyh=V@fJbi6MF2I5Ftbm+lWu$WjaeOG)r1@ z9)Y?ewX&-mQpbyHdTeMmhz?V20P>4~2f-`| zb!w&eL`aYzZAq)k3ld^+IJn2x2hG)53Qk=xgeBM+QmteaNxVD z855nRHMPif09-9QJrT(v`kvikiwP$r`+DN`quSMr_Lk0<40|v8tWtLLmWgntv>9L> z!Vm0+qrrXwX8;KV6R4F0QKTy`ph?I?N<9s57&n%Q!VumWPp!102l*tTQN5?(tq41F zswA&n3@U{RCDrrbTrIe;sc3jgd$|VNtuiT>gUPstW_VMwGXRNA9`~D65m>1$Ag0Cr z#8n_6Ue-3h>N8$6)UTe+CuAw@2a2XAUs}{XoXb@1vEz+zrv~tNG#+30j~yG+ycGX~ zlMFC@GAjj4k^B`Y5i6d-((aRt(!jfg0_OMA3%dQg9~{gqI##y?Bd6xHJoF|YJb{nA zcd}2M3Fc$h$i!#gY#gyUEQ!YCBwL1qY!~CpiNzLDa+KXWGn1bc)NrjGF9PLOH6mx3 z0RsR6W|X`U$$KEz<(M2SUKD1Ia3o=n^Yk@xGIO!kWv`47SFMA^+)I53VB(1_okM4` zrxZ@b)`tZDw(9iI+tgX)b4zXYm8;Dw;jwsqW*JiquLfU*cXsGS@%!W{Zhm!%Ui87! z3FCW{nrsxEnF@lG=>i#A>jDiDw4rpHn?ZQBKx*orcDXq&&i+YEAQpK@K=~BiG9!&e z9pzbG!bp#~aL&AQYLgW&>@YQP2ru%-Il*dcqF`=bH4a>y)q8orKIgd9g9I-~E?R$J zOo~P?*PqgP`y~fxnAo}j4*3%Ao$W-|(dITo)I3xJ12}P3%&s4B_KPh3Z%*RmY=ysQ zQW2xh+|I2p#!eLa;Bd^*CU2C_K&l`MpT5DWKi|_gJbiW7<7#(OdyHE{E#Z1*jlsOY$S`%--yE6bc+!>mIhhdS!0Q{Ddo8fc(_ zMlr2QKYFIb3$?XcJL>axjraL>|7Yeh9GDlY#mw|^Dn0<}e^WP7Kj{!=5y+*F~=%r+P8;7yXxULKr1r`MD9kY1E%}6F?>p|j`>>$C{`4z%Y}a_=BXIEXTcL<>V5^PDdJUN^ zwZS*Fr0(`aJ;TjS`lkHa9}pJLc6wfBjg-VN+8cY_WAB!$r>ls1<5+BuSNs%i=IcgZ ztp|wcW4JMvu0F|~S)506<8-g3jk5N1Hc3ujO3on6g-cDkPnVc#iwtmLZq_L>yE=jj zl;Liks^H;2faV^(AM#+AEv--Zg3o68uvWsfcfx}ge5rHGx#XFQFzYwF5AXEN2M_P{ zGo3(k;+eM%^;%ebyNvXUhfaUMVcne}-*dZyr42P2_BrEj1d4OXcWz9yjs|_wArlbA1T& z!$R3O_NJqr%X;`D_+oC;xj)| zL#JDL45#!IL=SZ2Ve8(2(N)p|zMsSmN}d=PvI_$;0Yo{BrG7&|^lQe`mh6MVGH&X> zrpK4+CfK>G?82eVoS@vV>YX_vUE zk?|{C96^+=U$(OE=w5-hg7v85_#(K^I$?eQl43((_p8CX=sS^dy9GX1a@B=m!BD%0 zDCF;&&w+U#m`D`Z=)tVewBz!~%J&5Z3>YwR!l0@FW%{qX@TPviN{uM{JiK%?0+U}(%dWshQPo}cFf$~?z^Yq*^ElH!Ww z90tTC1l=3;9sj{%`Q0dNp#&tLWcTnW^ED1=!XM&2gIo#yO{eAJ`Rj&2AS?zX$qej3 z5!f#-m6FyS+amG&7dLa2&7_#!?|n+dU>od$%fl&hU>v1zE^zniR0@S_cAr~{w+dC$ z%DJI4N^6G)`ePFc)5mZWIg%1a2Y7AcG7t&}I0Q`LGvCqqU-JKPuI>Bi@E{ zP~b^@t-hvM#0yq`wxA$+X_4sztYjxz0Ty#EI-h^suM>`HRU$7Pw0-&QX61$@8?C|k z@ktQl=n4F~Q_2-y)0L4oLEa*R{zAINUx@@xxC7C_J^%p$VI#=dB@DDC!6mrNrvZMq z3E8jizWDc;)LU_0( z;Q>iKXpPgju@gBkFYO4|a*$Idjj4~2(~V#dT&f{4wT7?`5Qu6==&NEU#|jEG;XF3( zAoYOk5u(h5yFw+y1QgK12n##KZ(Ft#mBSm_sYd?z>Z#Nm_u5VCX@hNE6aQ{dFw#wC z`Lxl#i6kAIBD{8+DJS@}$cN80YVuiF_}IT+ z*?3$fs?|e3F`KPKp`6@BZ8RpNC(O~;1L|!IkS$Xq3JH_o;S(_m zF$we(+4!MK6+0C$L=}f;65LHnJ3jQ3`_mgh1mfMmvMKodnUB=<7|Mgyr0@`$(CR4T;q{@Y4}C|ttx42w&<6|1zXdy?1+>rumDx*> zRu79#e3$BPO?8_lz`pW~NBN017|H=9wX|bL4D+r#1oA#0Sxvug#^WvdOYJy{;5@+x zRxd8c^N%|%c{P$!pn20zeJ$cTs3&&`b#9aVIM!3STKuhSrzn;Iq0~Unz(eSA-+R>CM1=n{KhHABH1Lz>TT3 z_+eN&BCk{Gxi!>H@rcwl9c<-Eo*`&r2PIKQb?sKP7TtsoK#<|}ZK}K1p~3NBXb+8( zE>P0zo}k2=bGtKca;Uwge(6OQY%S*eF@OOs4#Oiwy(YIrAa*_&9$0Bql zIF5M1KV&Qzu9g_MA+C^*H!X>&jI>Hislg@x8&Q8ifKb$wi@ouc96-v8L1Lv?Ya-C( zMbd@fu%?}txm1n8pCRO$>WVo^m)zrI^>@4y0j) zSuZ-T*Q2<++O7xH^N51UqHJ*^tP#M^TP;2fZbfW)hYKfkHu^K`9iJBb^b(oQ3qzGW zqa|NL(o`cbFfd_X42TStC+s=KMp}(uX-|0_FhK*9j1Uag*r+HeayAlq8)BPL5bH{S zWI3lk0?a(k;@)9;GSX9>m}2Xp7iuYRMFg$+QzVM+EWPEkNDbRNu|9- zgnu{5J%LY6b0xpDMcJBvNmT#1*)(p)vrvjokV~aB?_`y8Q4y$1L68)Gr)alP@uIkm z3M^Q#U<-j-+@Avi0s?wcc^xv#<;`ohb#8C}XSvn6}>zSx_5n5Iy$RcScKj zO}fCo=@Fd6+>6}*7RV8ElM~~6azv&<0C9eWgR}yn#zMXAs$fgm(%7yNqfWeLX125} zTV@yn*%Sb2K$gGpjSBu?dp7jr1yh*FD9o>vx&{7(pYk^UCK@i*nqg$^A$be}*Z%D&MjgZZ?Qm&432 zH8_u@QZ&>#Aqepn-5V>7B|2#o+nCJSFAW(f9j$DVbxq(mcLUNlYd<1eHBc;NV~ca_ z(p$GlbyA6;{+^$IoE6&MVzJ%{5NUQpaW%USd!>dr!3U{rkti$)!2HBvaxy2ePk;%| zoZ2Tcn==8gZRa&ia&>#4u}zg!ao!nvskvQHO)JOfwdHLr#RmPB$Njos7o-xXcm}!p zQPQs}1=($;C#aZ-Q=T;SZPA${V&D^UN2Z{&@MbsnMC5S61r7UmNSvOB0m?8n-p#=)Tf~Y8_g#5RfV<^`QK=Cz8qCU?5xIbxa_s>b2`%ud8WTCE2$ zAy_LCOvNhjU<6N#uHj&pN!yMxz^7KI;87i6} zUc@?q1sg!ZypsBAFQ4C?t>vwk+aQjHIcatbgrszgKmWu%{KU%+?1#p`8~fPqR9wKa zt?YM!_ITPp7}A^cc<0}WwuUoHT5fx2NC6Q71PBNegcTI8=}vAN%x6`)@Ra6P;5Fd% zlfEPJHS}^;sHV{N(ys{j0!RANT?@Lm1jEi&QV7lLLB8Bse~UtR?6>@8y8SjdpsXh< z-+aeO{vjuZaqmYpZ}x4$Cwo(Dn%w24c>^f2#ZU_> zEI72Mevzl-gfE1KhDJI7b<50xiy|Y)@-=cYT5BNmP*w6%E)}!ftR%^}B(0UiQ(5NJ zr#^g0oWfaL<8M9!CXX}ANp!ku0!J>61p$VjX zZWuRHyVf*~F{I~S8wD-pJ=S%vBv5a9DxPU7g!2WI@uD`+WqlY6qutryK|Y4*ZI^%f z%8^S@x2S-wg_spR0ZMm5XkRLIoLR|esdp&>2oNAZc=)3WrKs#GS4>Xxxy^(isf3~G zwu)K-@?}g=c~RcPh=%Pek+k+9Z||D?D#enrgKdX6`9c3B;)6fxDDnOc-;a;|(r>sY zUa;$U0W&==FQ!e;#yir_qS4d)iVtg;yfWmfyvoQ(cx?Ndg8#kXQ=?5M;UF;O{Pp46 z#7|k#9u9rYXok$m@s>F06@AeLHa-Rh0$W<*eCF2s^ z5n=|Fi_B3a6K2d|NF@;D#a$^=R;@#PldwNhrcvD3B$%cL33xaWJ@C)zUWqI}DYVaf zQ_2`qDk6MVGBtQFp@uR`X_*>4czM9nxHZGfL|@!a%f7J%@>uwSptto!c*}=}1?mDr zLaz#gdbN(-n;J8Tvl-&^%F!y-&w0O>IsdzJYtjUYruz}N+R{`&)!*I6!V+Nxj3 zKdLM|3VJ@un9-8YB$8Yq&6d7$Jk+QM_TAkTCIrkNfiy0lfbE%^naD5k=dpA0-qQXm zw2P8=u5!Lx?RZGZ^~^qG?X3;JZEV?9Rc$X4wP(EQlhj|M^we~;KhU5-gI4xbZyw~s zcktqswRInd3=6j2@z3Q+^BN-llH3!O7E>1q2#x6r^@=r~#+){)1NP8zqso)F&@o7$ z`eh|C->CM@lH%QwqXJ)MGV>LZd5)C+IAREys7l7ba&WClfI&py39{{kRRoHR5L;Qf)nBG#%8+ zvLb8h6HPI7&mHDd)k&In3ZiGzdFzXy^4LPfg>S0Ko5ipGIqmz9`;93#3V~gUYsN4L zu3?K^-4{Pm<7LLanv8O1@=rxy^%as$n=azPD@4e|rsYaxE^3&$T*%B8OvJ7e=Nl3i z_5wXe^deQ%EFja#vZ+U{ld^t)_b#M+vtZN?b%xQdBa$)%qXX8X>m@`E4DlFOjZ3m! zTDD7W)`MUnFzuONHr+}VK{$t?Xt1HIO3%x+0P*@lkgSz75bl7jN%jb-p3ba7W=oA4 z#B(M*7Ut(4gR8ZmU;dyUEM|;_%;gA41FQ6@aq^EuJ_$xRI1CIOiQ8SsMXA|qgh2}N z#e&^sx_1;08vmv3IcjIOhS4 zI3Oa7CmT2W%d3UC*!u$3VO0@*7z_q)@I;84{SzQ{mJpMJh*$N}r@E@|roX+KtqAP3 zZ)r@q^HTrJljM}Ed)HO)1iMFfWUrAoKZpDk(tTExO7Q`8DrPhn-eiPVHwn8X%BlsmiY zdopERo4D+C(CC`iMo2XilM{3{?x2AN8qun+fPB4EFv1bMVA0nbdh#B7VEVy)sGs6{ zd900w2DCxEyiP$Vh$Zg^U4e)pUZl)>D1>rr#3^)bn4CF#lVaAi?t?lKk%*3t&VAB~ zVzB9eH2Sg*MSdExvpDR~q7R|=+|yni=dI^!#G7}P&azpoE{l5*=U<~c^>(L0k6Gn5 z{>t$};M+U_6$Tr*ffv-u8)et%dq24!7|fbz5OZ*1UdnaKMho)>u*U{doL4g)XFh2bU^25P}ay)@jwUf!8f`EA5p@nVi$-#`{24&j{nNZeL28iG&=v6{5(%v8k zIcYc<%;+&?LbihP3R&dAFk?4@~YH%uTNY2d z`XH;4pIr!UBm(V6TRc`}Q-MY5Fz1{p&Bu^89i6hhfnnZ`lr52Q5)-4%^)FyySY>dh z(tboknQ4vv#9^P(rVhj8JHBr6$!v^H1W!9Q+23_zNSE@~`A>PEZ_nOxP(U@U(qN@6v!)RqGHB6vv3Z!WFCmypeFGJWdajx|jJ0_yir zkDm`qCXzBtW=izcoQ3Go4ESBjyXgruDQ{v1mDXINB**au8ZcZs?jtV5l5`YBQc*N4 zXk0l}1RH76M(9aQ58PW@M~j-PJLghCErim510H%s>Xi|TGT2>6;jQBzyJ>*#Y1XAi;A)+jg<18;)0S|s!XisfEZT_Z^Y6lmAu;@g$)4? zQpZR?_aqc3{LP0}X&TiDMw}Z21U`48Qs%v{M^&}7xoFx%oLZ?u0|9x`_7&V_i|w85 zy`$oZi)d@w6Ks%BgI%&=v}aogeFi%d8vi+~B^4B{`1tOlRl&!1AEpgHz6B*9(13t| z!15D=4{bm|KtNy|2_)#tSo6fXmFp{#k*R3G4t8#c*w}9OBX8_z331Wppkk99DpV{f zDxs2$NNJ|BP#N@TRO-~h$*6KfF&*T2ThD--YyHIykoS-YFhjnT%9Rn{$fpby1>(&v zRi$t~74Rhg%Y(B2cu%~n*GqIzh=P?1K0uD|(uwRFpv?}aQGFJcMEU5-j^SmKi1MW+O68OrGO3yzIF!%2MX*8WfT?7>+Nn!~xzJA_H2Z1p2x(bq6c(AS)Be zI9+oY1o%*MG_b!(z3|t3cx9+c@Ra6_GV^bDtB)&x7p^3KqK3NBRK;+U#=ThAZ1~~H&-TszeczgM-rOKNW$+pCNu98{MP|}xVMcIjyI; z$(-biQamehN#b07%2f zOmqsuN|h~J2q1=R!F?;hrQdY0k}a3(D)Ab{xsF2Z1~N@-3fxm2M=&3>dWfHA zwMYNxnPfVo;+wnSQOCeHbbg2pyu%Pyw%@k!O=)kZG)T-W>fw#WsAO80DIOt8lqgZ6 z#)T-+=U0G$ED-ZucfFfiA>0>sluF^hk?ujhWJV2cswC}T!FOLtm4*8(jk~=XnTKf+ zmFQ6b$U41Mzvw1VwR;m1nZPbiwEM8`dNm}}bTmW_x_v;KCRN!G%REaf?Je#@!Y|7!sGQ35QkgQP%_~@U)(p5JkI^ zd15lfC|~Ch0}4t|9-NjqT`P@Z4H=^sX6qER@PneRO|4Oo0xOl92(l&XNVTg4sMs{% zd)O8oajX&KcG6g77ue;XfeG}GWF#9-1|$-@KR-l#ZjLE$uX6D%ssVMEBke5m2K+_L z(uhe-H2?IZZWG=$Na1D3Cd?UZJ9v(kdg!?c4NpEGcnOWu8hQ2e9WeQI7*5 z-oEOKZHrP&MTK2vM;Nh{?&+mxzeil3+eEz=m8lm*kNQRua?gR+=t^YoHh?po-FuUi zohM-#S1ijWTHYN{Nf8&ecIo>(P_@%V?dY)PXO*`vabGo(Ut>2O8IEXp_{%9WCa)!qY3U zwL+!*s2A6mN6wc9k6?9t{6cFvP%h(kS$Q0eghUffM#9y)XiAhQH3H5iq6|^17ggZg z1*!J5THnWzI}!=bO|DY8e9p?SfrQI_JY~wUJixV*zBgmuyV}rG+C$D2K_6l~7s#^6 zkFG;ZOdR5LChXjx;h|KcWMpJ>AKu`!-9@n}r2|bk`(@e)Xtm&szRhkLZi>^~fUqa< z>j@M)&G-dKo0DX_^K+A4MHwB*{Cf|~aqs6^$xn%8fW>8%R!r@CzgSZ$XPU{=lfb^C zURQSX?$x>Zk1)2!7E7v=igibjhumIF{>JW!&Ymp=J1Tk;RtGN|R@laxXYQ-hq$$n5 zMy2muuOZ4jC<_#B+}L3!+0^5)Vt<4Ws`ZB#!F?@eJ36PR4Z)$wao#<#%Bo#Wo;|ww z*=@#-uI;POvGp^{4~tSc3qU*aF!7~H1k80ae%6jchplgpMadUH66#V9OUaxnxWenG z=~F2l97a~Il&AQ}Q8bx&8DsnF^)y#B+f0sV{Nf;39uQY4>fn9$Easo-r_R}r=S4Co zqMqba?Tm*=m7bZfiTE9kr6mR-A8@kBM=1E%%*J_@o3q<|MVHg?^mNwmI3PEN6O~DJ0;7`%ag}harT^J=(#Q7QgKA|{l=my{*&pe+kTq;LNI8> zV2c~1%_v0S(F@}+ed#*~QUxWp2Br5Gi%GzfQ zvR_D;F|QogX7-5NE)ic>2*gJSTrcZi5 z_L1~f(l6d}@>0BY(YNl@$y4 zA=gl*w;N^mYgVTo)xqcWt)zzT?IGc@H`{zjXT7it<(e?MlosRreb4&wQ-8}cqItH^ zHZ%C!(=4H|2$t^m4oS)r>+5jpWSFs34%}p!;q(BW=b$&h#Q9rCv4s&mBUG{^dFIR7 zqwB{i3464&O2koA;T%I>e(M>?sk2tw!Qf`|^Nml$ZAL4*{b1F-nUQv38I^yEbw1bo z=KZ>>t*l&D9a4biSMPzre}9 zS>)NF@`wP2yjGY-bvX(~=jx!eyrpM)O-?7$K@J@P1!dxa3O9Jj!)a0vp*pg{5C-<0 za-|iJ62&RdgHBj!<%23fIo)nX5p(kQV)NFwvCKF&z{9v2NB5D#oJ_r0Ep#V&V+||| zS>m+w!YR}VGZRUQ$DvPtW^3%^QK&P*k&JOTH=GGS^?v&@5g_+mDLAXXBljC7vxAfd zVB{&Mn>%KEnn!AK4`oZ)pyph&ZI{+0ln&1SRfIeIu84u^A+ zYo&!M_mz|#FU}@J?kv|NiA-2Gv$f^{bENv@ioDB7!&#^8--5h6=@GuFs86Uo>$6z4 z5}lpJ%VjcIdBvLODKdlekIKcrs#ff6)oO!YI6Jo5WZnwKCo5;_MbID;F5@rAn|+XHb48MpQccpg}=FFScAoxebe578kFvJ1@4jgr_zB z(=7^F@?8`&YW=5UI%nq_}QVtE2T8j2%+5Up~jU|<6^H(LOJlnhRJ+6E7N#1XwaxpP|*#mvf%uf64FrpHV zS33=ZxjuDZS*hEPs9 ztk*4Zq66I6sQ*5LW1T7zcsD9ikJC0TdAgpki z0(LzjsCI-2pk?^#18|~!j3l?}?xtZLO{4ak>h%%EGK@?aq_mG9G>GZawoS`bqZ#DX zBe|@$kd)-2pg8_iY#4LtPXxV=vnU$@$z>$7NK!88%35#{00000z={P4vkG5cB}D%% z5+9UM=~a?w&~wnvzyx3u{2qSV3#<7(@Qz|5^qhOVgPnT1U44^J*8Y0%Td^W2eEtR8kK>g$TK)&`IE^P zd7R+2KP7tSd&59Ob1k zFNECA{}1e+D#R_f+;WSS-~(pA1DL~v_PRQZYhBT%$8%+d)Cz}g(Rws$I43!fu{YxO zl#XH@8ctQm?0EAKZk4uIyCz;Kmf`w3e_i;se=5*qA<7l1SHq3mB|Th@8qgAhWcn@+-TSSB>*b^%hcW4)wWiz&aZJ>;e2Qh}pP2q1z;(Q4`Fhlg;4Id0 z6@T2gb7S;w@V?we#%}hfQ@8U-&hmvj^><1A2lC4frqr=1xSir8Qg;etuIgM=OWzGK0U0a$LM*dQYkXMxS4fLl@FTG$UP?wWCDZ z5ZY*6_=%Bu%5Rl^dy*&(#k8UAzdW5CKT+)j?GiB9tPr96t>pSl86=py1biKr@4Skp z8{TLPH+c=Tv6!kAx`M_lAOEE9$C~&)DQMRBr@HOu>e*ijhfqO!Om^p|pRcTrE)T1hsRpHMVN#h5SwMo$J>SfHvQe(utOHwDu;{%|hmulSCyf zpfeXLJh8(Ou*DkECA71&1Rn)cre&zEC6&L}`d07Zp5efZ81iUmew%3VdU(itu&?&P zv9GH>-|bpXJ>#_zo{uoO2&G~C)bxBTs=sLIgcO#Msk>*C2^bxuB{tjq`2r=o~b9;TR!3ah5Z+x|Q523I?iuWe;t4M&oCGckImXr69$t_cKUQZu1iY zTc(j!ap6@nD5)OLjAdw)FH|~MM3^vP!i?CibN@w_fl@6($$e3GDBs;a#ZViRmR^4s z3+}aEMg(H+*|!Fp$R)#S4W{t8cqOZ>rSrJQtG5>Ujn1Be(J_tS^=&4>K%O6wKYk#O zXT&%1K`D-;l5tYEjlF@d4vYK+BmABS;DJ|XX9i|@Il5$3TyQ{lo+Ewy1C;uL-se|+ zj)>^fWzH1vk4?ZQ_=s2K=^U?9iA%wH)E`hQUJ8>B00000o*@fPmFo_a?;C^tFFZ*5 zGP6kbHPO2^hKiRjB-x{?J!why+B4-hB@fxgJNXoVi&EaQ3~1b9>VB(M;^E%4ZQh+u zuhJKZ_Fvnm*WskyGwh!9DmXSLpA3V^)d+K>d0c_nN)lR86-KXI<2s3y>e*$)R-{O= zV=pu{JqF1zm_kvMxYt>uTV1()*SMJg1#<6i3pEVrfW5r+5j=_Z&n+vx@4o2rz;vG* zQuO%v{1fG4aT3E1B){$YMJzeWeLh#NXrGe{7>;55IY4S>e)MNgOTpMk3c&k39HM@X z2un;{Q0qCUJmW3vPu>i9qYI+>_%@M~2f3R+HmGJ97qf~FCZFY5ALZMe`CX;v&xNL? zgx-=-nU>YJ_kN{jm=il2Siy~qvP{u(-la=~cn9mB1ENXY9rwCtTe=9RYr)mytr;Kmr8AaN-W@R7zbX?}RBFK8| zNgHw$2-a zP2{8xExwtiTOGk(Ew8#w%Xw7_^xf6h(QSS-?a9cGLDUnV0gEwDS98EGuvt$3xckFW zT{wzDF#B+p$N=*9*c$FT0jVCUA^X;?`iu8e&(6&~W{Sb-ka%|{`o5ksy;fU&d^-X% zClRT?Z!oH!dQHW$r@F2ZrT#8<4F|(a9Y5+?dDE#wgg#J@nk6f=Oc2bo24D7fiI8_0|5Q5VwG(Y-Om*SoQAG$bJcY}(92%fN@HE@!^@dewj>uj*Uo3vH5nIoZ_v}lJQX2c2Z ziZ2F}d2a8K11|jx=oj z0hN3@B1y)l*i#jM{fRWQcY?{G>f`RXLAg2Cd0Emh zae06N0|NsSZaAcFaPvktpmFMso1qM`ZN&QCC=ACpDy*jH*tOEawla}Poa`YS5Yry- z1L^q?37Xgq@v-bgWh$1Q5eBsFAZ;n#1a~=T(4axnp&7n=_~OYgA0!=WNtyqR;sg-o zuMA+gr@D&${=&Fn!|f*(B<=rXDd#nRedcvEW(oEnYx& z#dfohIpMd{b;Fu8OR-EBz>}DySCv2B`0>Zytll#s|+WZ?b ztTn2|(_XLh=l*Q~m0}po0|Xd_hI{t_{Csi%k8fBvaOq%4?%bEeV2wfr0r&W;pU3LuNQ-V}j5A7#0>57S?VF z3WY+U<7MnK5~qJq-f7Mxv1E}U1!&N4L#P48QqfF0MV<=+w|Ss@8fRD>Iy}txk5k#{ z8l%(zPax7~3zApeu}k^zlzzy;OiB59k8{ic_n{@v=| zS%dw4sK|8al=7+mc(Kvs#%{;M@1lJhi9)!UhS&uj3r0?~+Sqyc+fEyUT;qF zfP=u2QpyWyabQQtPsT{&pk&6pJxu@q02ebsW!5CS!$b{4%x(_gjD=OH0R)d=0hxVr zYuo8*r0gJ1B|{T%kB8F&5kJjl;i&yLDG-VIBixXlqB8jU$0@~FH^3)_gQ)BrbhL|=HJbbF=pIx<(cc$QbpG|?sS zyg9-6=JQW*`pF8~(1Z|L4;(xjudvsMl$6n^IAej(<3mlE&o-E}FAVAq=N1dJNp4&h zJ-TnPWfH9ums;^xPVoVO7Gvp*_C&oNhQG2CZQY7`Q|2#lf=c*Rn(x2m!oS9ino(q) z6z9*wzs(CGd|67G<%L}TZaFPI(d(ISZ9j1Cd(+ z0002xx=Tdh7so(B6Z1E5vcL%UkwLQ1I)3m=ppyf>-p{r{#Km=UJK!&AG5hSYY(|zX`!f z9F%B}9W&F=Kz)dUxyECP-i((gZ_(#msQI&;7P>rHiv{zIG%Bage77|zwqD#K)ViMB z&whmM0#{@`jU2Gc$z?Yq7#mUSP08?jC1Gu2d0Uj12|rrm%cpE{fAAa)pAYn71XDPU zMV!Stt`-$MUrE5)VraDg zc(J5^FUS_S$}hu=qBb?lzH|QIu%K9-L`3Y>Z^$9}fCCH|Fkp!J>U`EdabgeMQW(^( z_8<(k0L;Nn+$_v?-(2BjBS9MGe{~Kz=v~De`a_qExu2l9dtvRWn9}?u7h`$aq;yT` zD6Wdw=Ykk=q($dA?ko*DGo6Gjdc{C^w_XN}8y^HQ z<>oxsE^xT)x{O#2PbJPu0xS22(l|88p^}Tk(Hz$aQl%|L+%m%4onSBgbGUHf!j+J# z3yw~dNl$-{P8<127GNL(>R{HcW$5bha}HV#@kjwK7CwG431<`i3#O2n3RQSQ(l8DH zKAOoyCh7g$uFJ#D&AG?;B_J!y6=ZJs;W_s>e2uvN+@qspW1XJm4D_1@Dcd@w*Cvh znip=CNAtOByVa?XS@&CyI7+B7TjRQWynjHcm!LZ~y?!92t`g!(1%@Kmgfh zc8@cN(66k%F>-mBVde+YD8|;6`${2cO=c0&z*L~!(vsGB&5f~z(BC(scgW)g$4mtbkSeuZGSYWy1qxOt~1$5 z2pY119$i78nBeCcSdLbgrN-FUlLOah)=2{Rz(H5s`v-dA`76+?!@2*ndrB#m7e>tQ zb_TvK1QdHt<{3G1A-5;4czAdw zM5!m@milvuNALLuB3KU*(oaRUGt{DPBeBEy+ea{Nm{{i`-2T6Q9nG-KsBRnOxyGWX zs{o=4co4)O<`y64-R!_39TeSl4YBYJ-SwUdeH!ZUY|x+sT8yP`ZIUw!SuIT1?bw- zq~6n_C5n%jiqo>lSpDE`+h5}RW)dhanc!@)BH_n$TGTdJ{)3AOnc#=+G(1XE^TJ+$ z@H<(2eEh{vP^*F;{M?A}qu+Ns0Dv^%?WzLl`0XQ3VxaDJ>V`@LPZEk)QX|OT?TfOL z;HX;;e3k|h69xVjbtm_PNMZwBWU<@;NMi0vSS&750Ykr`9gnr15XFo(?2UKyy4syp zuB%?zYeU}Dse_YE{{IgJ@e}Uo|FdX_Ph(hf46Aj|O?f7UYz1jExtR0jC4T5|qZMGd zQNK?iq=I-9S4O=Uci}-V<~ix;CJi>-I~fzSvx0$<$X5++$|0>CprKhwgVtECuxe;g z>)OzR8b-!^7(9tNP$2-?7N2wGR@u?eqW0kQ28Crq*13D8H_RM~?rfZ+34(OdOhkf1 zp9E_Pyr!)Cvz$)Bi|?$$dtLnMjqGhQ~+Id zTwEKN>CmwuoDLm2-tkB<)`24#oM0rtG}w?{DphwWT6251GnXBmcbiGmU`1gljI_v( za=aH==!&{|w2_nI@mW!Ma-|;~jU_;WoFkm7Zr2gN!rV3%KWr&EU~F{+k{y)GkOe!f z&^p${Y)n9l7AcjSet&(LJ%nrmTi#Sya9(|oC+qbez#LCO2=umW$jHx9M&ad@2mcR=3(eM zRx(aEHQXd72N%%-kvyHg8~-VJKDZPilPl0Dq!$)Bui+#-riGB=8QWgooq^nYr@Z?d z7%^vJGaBzKV?+SAZAWpjbm3^GA@(o{HrU86*-krUqQqXA)`jXJq7=}}@|&U1Og0fn z8h4G-l@d-gL-Qv_M_p;gfg>jmIh~`C{o1fouK(e6ja^Wu9yW0K4Qy`dO`>-;d(3SE zkoaG-C1Z9wI|`KKtV~kxm|SJ1nxROQ(U!NGM`*z~@z@IJ?(jAtv_>mp>(i`-vCTHy zCIs1j*be0D`C#4Gk9F8RAe%CNwu#G^`uwyThLzZP@oJ9G_5Wv%pl#w!d+O{MUUC?P zxmm{B%RL`w5bpDHK;F+c#7+NAuhwa^&%qsj(2Ux!uD4)y!u0V!6yigT^$EK)cAVQB z6_N~>rWWcWaDr3JbD0}h$t35TnDoj{qZX+fde?hoKVze(%Z?eM$?R>ND!3n9q(o4tV^RW}U8gwe|x_^Py>S&4WgW=$)#t z8T1odTUo8V&jK=J@Pye~JJn%|$AL)Q<&=mw*Y>m>@$t!e=F7bPwsQ!Dm5AnYPL33h zYg{Tf@18JA=4Y3elR>@91j`pYnUOlJ57Am_WBaQ7^zzJiI=|r8%N!l$_{oAMtLEUA z9bWYXe(-&L0^ZcSp3%OezotT)-%rFx+j$BR^XP6H8=N~u47uM;k@vuodm zB5QCWwgm*loZ>+WUu=xLs<<bZWHE z=PzsQTih?-{ceX{u`SC@pvTA5P6vagxoSx)0R<|UyG9b7hUk_i=*0p+Yp9x3X!lfd&YFV)?l%%Z*@FSYAdj0v!%~hU@>++_057P=Y zPemrA6>e&*Xj{Te?8z>&=tK`Aq7(^q=aNmcXpmJN%;jm-xBm4BRRGF+a?i~K^5LI- zk`6kxc;g*z03QUv@sLfe{nDO?1_rY_g~i#x669;4x`0HBQnBaenVSX22y`3F6Msh4_-%DVRH{kD2Tgv_u^lpo^@PmtO|g>qU7ilwN$z~^c+LKw|F zfCvf>eXWT^`F=$}=+TE$a&qzl4~FR717YvN{ZAP@4O zt?YPk9sa0vJ+VG@kg}-xNJvOQ9xJ2w0i0?JACE?B*`2(bW+ml$$|2ovN5*(aMKiN?Sq! zccduErfP)n@bJ`AZ}Dt{f`fw#T)xN1{hMTxa3WT=B)b2Sb^F$v|ZZ8-fp54y89=^NyBE7pt#r?n~h>MG> zuDXkB4~UkwsQ#dUQR+1snq6L!2-`jwF)++YIGSQv^;ue!LCs3%aMW^Ll@CBNb-3t~ znMDb&x<(M<#=pp+l*>yi`4dC`s~K*7t>8im2zXh^`z+GdL*}zdmx0M2G(ugV(4#6Q z!ADv+8Y0&cP8B#_Gnuw%>39K8HzgEZ2yP0c)QH_Dm`%(@Oke*hPiK0a?i+@HG3yDF zih@CpnnLeJ%Ya2?NtdCFVgss{6UH)gbp9w@xNNi`3e>3UBoIZ4^t>Np+tqLS2%meC zMJam$naJEvB<&jJFUZe33#AOP{a$><_eTz)3GvR|S_gvH46HeetYha3wuR_xLo0XS zHX+`5to0J2BFxVG-j1W-fPry_uP+#wz~qO4d|ed$Iu;N?RUusF<|j~@NMi9}1#w>B zZDcJL+of|YXBf>ne%;c9WQ9h4?{`si&TE_;W@nDL^|?vBUjI}ZtWeIXR9VcInokqD z60GV)K-Ip}BP%VPHKL2!3(wwdL*)up#V6y4k}im2!FGI0Zw6iN^kf(lGE#dH`)wg1 zxm3)4CDwN49L=-!_p8>@B?Q!HWjdWW4JpcWBl>dA5=ZD;KqpvyMz*4sKJ3>nXr2K6P@E;-p000Un4;p!vFozTjM$VtxrCF)=^Cjdz zG6T&R0L;2qZCU{fNNRiYtgg|Sl$#atmE^EdP=m_ET@h- z!T3t*jZcURdp>pL;1_CrS0g!R;S_sls?`s_&f01O_Vg=KREQ^sBb z2~gSvNZUK6gZPKr8eOp`&DttXBbM1deaEnSV~!_o+POCY$||`qLGihF*{sO&HsY*d zNa$U0ukTq}G`jU%Yeu%X5?`CjJIe;TVvAbrl}J)na7;fb?>G@J>jfH!jVBdiaN?6+ z6qAmxIVySkv)uaj$_+_1N1CZRtd?f5->i+A{Ub%&VYTn`*FRVw=F3a8rOSVu1y`-?)36HFr#y}qA3 z$t>rQv`w8Cm5w5HgOE!EIx~q ze`4MZWW;?4AejZjkWnZDvGDkzktu8ce8Mc^69r@jvTm+4$!Awcp{mQE+TcrNk!n#C zFgxoS>=X2I0sJ8T8D!Xafj$DSm^UE5r$oA*jj}E{vLke=%tYL0B_2^CzYoyr1V1_RGk zIKv35*kbF?1aiq=T*PxP6H~)*@D597pl{^|o$(&@| z7g2pqcQKz8)fu3)az7VcB?4a0{6k&`0c8n&WA`x+Jy~?VgS0DkwsDyY2T#hmpLoft zb#W!~Xs{dFiTKwRW+pGWv5@6asa?=CYFtqdN}m!aZ2rplCz(!uc#^5ox5$HY;$&o_ zoyZVs6&mmQ-b_FI;|`m&I-hWz`qe78Amk-u{(4y}Z+vlyIbFm7Wy0qAAbP2je8#rok_MtWa|OCoRr(MAAq@6OohrTTca(s`0g` zDbR>TV}q_&0!yyTc}pCHrQuyJxw^ccvs)&678fzeWC_egkK1sX`Ux>fiZKZWB(olP?$I52mWbTa1Ey#3~t{UfSCv7}g!UmQ}HBzBzjYC{! z=Pe{~kYxn}8o%*dqMD^(tW*k_Fbn4S)!-G;tBFpEp9gchpTi)9vhQzo4P{#kxLpE% z!~J|eOPeDv_D99jQWkwcNg)Ll2vu?NFvxlM5tC zSGsnxEn&M*?C0y4gazIXuHx3zHQjy41mzi^UBY*lO_{XILo{6LFt#(#o4(x zmZ~44AjEROZD!1L>}5gW)6%oqe)DBr?AA7?nWK0l4hfDQtF>0cG66#M2OU?@aYNeY z9Gz_Xbwcqa>J5547zDI32}WX_tk%p#54k#X!3iwR=c&|AE%Pp(Gn+FbHstlE`g4{&uw$iU#3Z1>v)$jA(uOw@24M`bcHyD}fJ5sq z0J7566J=50)=BTt8^1UO3nN8T%%zUi`^@@x!N*W;6Q3=rUo6PBwD>qx`SFI$>J4ns zieJr;FCI4fCF8h(>_fHVePzAX64ZNGD8)AL>w_{1iRrFk#Nz2k`_+>8q#3cwDTacb zvuJDGw`$5tTH;gp8&O?h)L0V*rw*v{1MPOt*;(;NCm1Du;M+48Nu#(x$%J6ag?Jy2 z%$0(IcASocJn35dOBUC|oyH>}hEc4zneb1HUX+8j=1=)6{K6!hjK&op#;IV!jFbPh zl8hOfA>lV>(@H4mp2&mBn1A~f8iU5c5I_^KUGo|v#KEG26x+k#a9d?k+Ot<#vn21Y+uwjS7TPZKgp27Lz=BO7c)gqO+CZxgWwRcuiArg zrWpm z6#P17Po@{S4HovAoUT?4DqnWk3c)Ynd3uAD4gO5cJ74a|@Jadw7@sk&Yspt-ypK$` z+g8qmA?M;@!LN)`El#RGZ>GXSUO~ez*-idc5_x?a2_$4!g7Fn5NZ9@t&Z2%uOe@ zZ!9dzU}t$fT?sj)Pg{$sYR+Lc$hs&(tm;2^HDEP{86zLpHFy{g>eGt6gYkOA*$Hw{ z%o6PP{o%cKi)*O+&GEuTAzZQjBQ!fISKHdBz?e}NjFB?;#n zsbP9?6EUKGu1O`Ifl|`1fbL5YnCY63LjldEDJX+M{y<_J6jQOrgMG;Zcm(3Prv*Q z`E=4nbqZs5?~|+OTHPMfCfY&VL*VC5X19jVz9Vnl!$1@ff<@bKOw)OHm0;kB9*?Qo zJVA7ziv~uKBdoiO!Oi@wbFYkF1P&>g7JP$beBVDpouUx3Itb^+LT#;HnTbVs31zcW z^;SIZtykV@OI<+@9h4doXvs=)Y`srjT(i%V)$ZQ=4OBec7UZR0pM75Zh^L?_PFs|* zxK9R&HJnhl$ba2oZkunU=<{^(6y;1-^ctf&X1mo-!)u;I2LUB0#A&-yg*xfZPVO$! zAa=aug7YFUE`g{?_!iE>&h!;Y+rg9Xx{xoy6KOZM2n&{I!Yr1 z7^bRf=*NB04}uCvuATD9d59jOG}aK&Um|oPal1-6UFS#r`o&nm4m4bKWNo~$(08cql;px#6p zM*4=&tFsthsGD{J{Zo9C4scg$CdA&E^<_gK23}<8Iqhhz%iGpf|8?$ZNGMaPgqeJIYKp z*x%9vs4JM5u_&^Ope^~bGi0&6eZ4rxYAs3pnh*@G^w5}VHFfhGj0JR?a>%yzQxHGT#j_G1YW!qjo*AuQzkQE1tK)rDtF1KuSA2#q{tNo-i> zFwvVlgB6-dkMn@41BK*HuE{t8PR5R4+k>`;_~R|Mp=fRFq)*w58AU-nGJS%c8BaQ+ zaL!|M1r>nQ&1MK#)d(+-nIIra>(pPv?-|OAZrWJY(5~zxi&MN-WtRQ;SKGUf2lZLP^C>cHyDl8an76d z7$kj-q0nj~WG~YA$yjZEo>=vk*nlG(Juo;5O%W?RHQbx$(Fe71+2lN}G#~KLf-k%R z;YG|X%5C_F{1PnGeB>k4fJ5$BwZA^IlI&^2+&7^L5hN>@7{G*H%E+a&-_qzKNo2jJ zF*mst0|v@?hU+*2a7f=_5x}A6ZcLvXFJ@C`F?NK1*4ez(eLAvf1gJK9acU-~`5Hm( zxk|XB5YyCo3G^$&L*ybPu5KrRB7T9yy|_(}%f*E;dJM~VRh=qckeMGHD$k4ZHno?S zJCH!PO`_KCLCjUTsQG-XKShE(@2W^=_Sk4O3~TC{VsVFA8kJODhqpTjji|-I;9Zx% zIbex%>|`ju?p}UI<^&h6{t<2WmG$QyDXm{qaz#^pew1-nxN-aCY&&D?S^a$dYf0%H zndhgwQF8mrQpj1yP)RP92RZLgCttZpavl`HIppjv z;pB<=uFb?dt<}2yO(x~1{nA8fVw5E6_4ZTj(T}{OxCDHM?KZJ;Y%zD7w`{vxagqh*;F1060l~M#|m9WQPp#(T1L~`*xDorAgBdoMpZ80TDT>pw*4nCpZ#{v?M z>r{V!*|CyWpBuBsZ{J5uNE(9+#Yk<~Y3_pUl}-|f6CJLPfl2E~Ru`MHWF%TI=D`VF zv%RmJcFww>qI8VnTSfXFqtQ=vj4!<@K4wC;&n3K_<*gJ1dJIWrm%!k(E$uua8^a|g zZs!SM{I4bNRZgqVGLiQ^5djMo=yEj7-$JMOgM34u&tFZMS(UXqrwKOfPI>=vwLVoCsLqx3!v&q2$It_ zGl9HfVX}W@Qc!xEm?jP#(|PFiL%B;Bh^!b-Vu;=2iQ4EA9Nc_IrPc#)5Dn|zuvh$S zY4Hg!$@MPY;6|$w?II*J?H%Hl_M*1^wIGaHJ-|rw9oOVb808W4#&BS>E0oGF>N^dM zoS*mt)Za1q{1~j;z@g3{6g93X2EH^r3)w~2uuq%?wz&&LRQ#|60@~LfE>de-Cdo@~ zRl7TiYQr=lFY!L_dh&r_ zd|2m&idLPJn6vy?CWbbmriFv;R2O`_w<}gYobaN6^R0vZX^|CktTeHmKU3MZ{?K)< zl2Xzo%Z+Rkz}j01Kw}^2dLQIJgd#uETHUK1yA$|pV2P+{BH)lRyj%UGPuk`Bt}hCm-$y^88=TV|4w zmH34Sw_q57=b5zg+5f94*LXuQ2OV?y(B&pAK#a}e1b@!{LAsxw_Z@~ZYn#h=V}jJ zR`zVj0{ky&03l8KR!74Ic~p058J%(}5RXwIxzCy@q#ZGZ5nrRH>FHThHKnzyU|VD6 z`YU=?+c{P$pyl%^QmPQvqc?E2PL=@Wm9$bxl}6e~Rro|9#RS-xBDr96?7uE;YQ?uG z&e{TS0AlT{Kj(elw4R|9A8BO5{evFVg(YELW03YrBrqN zeNcdB;E?-&?t_k#7Mzv9a_#=0Xcj)5r`mn`g%*@d~PH`abQzVSmaAUmyam< z%oYN1OBpGZbTUgmqcpS(@x8iOao1iP~1SqQI#rJU532NiY^lDMB6^^l3&W z3+#R$qwPdrn4e*$)+|JjsmIDfHCWv|=5-%QavA~b7gd>kV=Tat4nNT~q@he;#F8tE z*+8ntF_2Bt*4=Rj@BWI^JuO4o+h%(r>yYqR1Cx;pfzp3S6*#K?i32L`NI=8D8_vQV zR=-W7)z<6gL7masp(v!M0%W)aK9qGfxwl@tHLi3)Q#2h8Ld+Gr5ftfUVH)crNI_>+ zp8BG~CQB@c)Pw26j-!KEY_Z3NR+2G8xMomeDQuJuawdMW^hqZa+MBs6a;T7@&sPM) z4q^0{(g}I2;Gz)#O!PBTyz+heC-uSuTZBl5UeXzYpbfUAcy(jnZrBYNrc{3o;|__r z`K?LzPGcp*z-B%W}uf;e*+^iMNDr1WGsZ{t$_@;U9Z3 z+%(gXM^13f^hC#(tvTmsf4btiH6EG((yLS}#ebGZ?N0{}-_@>_-*O+}jcYIM{(_b- znc~}6lnAWQlbrzmzTL~T$TH0NV?C>5@>T6>$G9oM@{K<7p{vQnV#um%ZI@VSNROjTpkwKP22}C1dns;-}gnvxYt09ppJT1*%@3uvHhI zxvn|DN0wlBesBb?!ZmR>C={>+6M*6L-fVSfqBFeNMhqZeMq3im=+qKQ&B}5iZoYN* z`Ho2nzODmIO&-wm*o!%lTH*I=(5Q*70lcG{yj#sBFRguODD|*N6yIkiyAb-51Yj*_ zwR8@dR8kpFnxOH==;`zgbU~I^2I&;e9{VJ$ys+uXXUu48>?SHJ`EZBg$*xOr^M)R( zN-o9hX)>TQY~yFJXWIY?rUp=a)A)7f`KwQ}wBvVZ17p0S%s>++bfc0|{y~{seBAN* zF!k|sQ2RueX>K3lFM!>n`4kuywtw|wrNxtzznR=SIiCrp|>v(mJN z%`yv9m=`iKwe1rxF&bcY*=QA4sm>V~NRq7Wc!9k#8wx2SBuk=>au=5>gaUm*_F9!M z=~T-5g$W5Dg|V_nb)o2NNX4X7``Kq1@B;;W-qxMarRQ(eKhQI|64%`4S_|PN#lqf5IC>+Xn`Y2Y4bfT9 zom8-9dC}35J?y~XjMD_;Jv-Xo0al{1EI(Bwb5(oq5u%`h_k292ci+)xkFkNmNoBzp zcYBu5;5ZP@SXsUWcVh?7wJ1KkOxU&7S>6#p($1O{*VfHIA<{y_JL0kKX1U~PQT@b- za&;K;vEd!wX$GU-x~=~b(Rl5`VI>W=#7Mt6EkXWH+`rIxj(<7cc?It@s+v-|* zCEVzzV)pq#PsPsxso8#RLfqG8cYZ;c|W}nIe_9%akhM|hH_v0*lsN{$J>;hOuM~!v=i^1Bil|SW1IxYC1Zy?KaK#~ zC^w7H@RucQF~h!HhS#q*>biS2@}8kTUUkV__B1&ee41!@mRm7hjCI+s@b=C;BI3$Z zWF@@QEb-h_88D^8YfTtb0VJHK71eh2W*2^r{J`n(@GpN6aIvX&SnSoxD}( z-9K@F_l1_q-HlA)@%=}&T)2WmL_tXRm`e9Ir&@6hV_KRb>sC-+i8%JsBLl8EUNx1!#l;hfQfR}@Ft?K zY|w}vpBlWkw4y<{Nk6k1rtW1;@vm0ta@wq+!r1#m|4aj`x?QKhG(P0X6sPnB2_c8i z;lmH6RG;t*z_l6NNKKMRo|WfVbzLXGwJUZmX+~ zO+VGU@jc$YKbjf1dS=3_@dmLss%#bGbaYsMMi+&}vsJ;yg9CPgZd(TkT7M}(-9E3Y(LzQ8T7maCHQhAgts2#gXc=i;k_WHRyK4swStdi!)RlOBO` zZoy&3)D9?~z6{nYv8Q)M`raXspiF^{)2lV#WOCfx^8MVqC6`Pyz5WMq@Ag2UOj;VZ zRs(N-D+v-{=0Sp@$d&eXLGrPx!0Syh4GnnWGYPZ5lDvEG8abQk8LiZU!Tb3l-!GhF z=01fIC-_EPvnr)>-Zqx3-Xn`EjyJUED4JucjfW_$A4vWhxD!9d1!Zo=Oy1-ZfHV>r z)zT@7qoZd)>AD%|gt&TK*{6XJtvt^7r`|X+do9o<1@g1k4l8az+{HdA>FChZRNAOg${5pxM2U}<$%7SMfXA)y= zU0QOsaXHbjMyyx|4riDeHF_8^ftl#k;Ta;HJpN8^OHOwYCFh8F;DnmHkkA{sVT|=@quSOm$(r?OkMPER zot#+enD9yR11r&{#%Je44N|>%JuXk;7b`-(L}r2El3kcnHY?@L;u4*!0uoqoK8?Xw zr2?XGGX>ScKjy*cF_;a(;j##MpwkN->i|t5BL}d2=984*#_X_7C8$cQ^qL0mtBs2u z5~;HM^y!x87;a%;QNHJB^mgY(N}a!WWgI<I?(kJx5i%f4$T{UJ(GBv?}cX&(j%yKEx6Hnh?T^>8D3f>49Pj5V~PqkVk!~L~5?A?*X?r*~V$_y72bQ(Bc?tu5ot+GuixwaXPB(N z4tVAtgsV-R#jijHV^wqfrH@vhqHpX$0kUdBQjuolTD`{)-RP)6(BMok@ ztW-XKB|k+&&ntIIa7CyH|)VAwu%a0(d0X_3>78v@BfqI);tX4F+hUy0C1*Jpp^u88*PQgb#<t<=Y#`JKcX&2>u@xu~Mm8C+3*AvK6abacGmJ#sV`r=D&dU=aWgSW&Bv^)k zD&AVq?(Rf51IBvZ`-I?h-t!p@Pdms2+Sd(oD+7l+`2|Lb&8O70+f_Au4Ri>9144f- zB){=6J$$)k@Fk+tPJl_jiHG`}Wi!U{Sco%}1(JFTc}Ih|yNePwJOe{Btj0+dlR+_T zWlq%dVQ9KKMP)xkX!4EupYuIrx5;xlZR242Kpy}h0l|N} zoQ0Ed)z##ymG;FJfppN+uIkyc-~u9`xO98;WALK~kIV_q+8h`L>vRN#>S79;XQ8BHIN)SI|89 z2Tp9Mu`E@8|82nt!B(2OUrApd;WUB8FMpZE@&|v}oD(xS_(R}4z1UB_&QWg`8`R01 z@eGpz@@7U5w1J1KXToNJ{#E(f^V{ve5S}xgm4liGr$`K&I(O0hSR&W*toAlc4Sm3r zx32;enpWEPK(4oGFQ=xJfL)r_72WO>JW1$LcZrc!eehh2USxOzc9;p=VKA&nY&c~6 zOwN@O91lkb{7FUi*Vd!bM%@we;7odP6s1GX9JtAQlDZj8=6(r$z68c?zd&YtCOaS$ zr*}b-1vBGF6{y+KQX;$pPWHQ-67xBNhtAIRVzk?Uc$LigeEO~e675?r7veL!=`ITs zHunG*_2Krpk&S9#m&WjyUrK+(4cRA$zG)6%$&^eS1-BHG zNh0Phx7Rq2P9hY-S4=6aR8!dY;q?M@4uPU&!NYLW1bi1`6)(iigp^q?7JVnSB&CQ7 z@^4Z0fHzZxkJYncWJ4p~$sDzz3O<(QMVv#KiSF8EV@`UVh``<&Is;WGyEStm%$Ve_ zFf1(|HA17f{`ZrvwT$#BE2KQs3LuL}I6bpSNBF=`S(k)p_%vSfoffi68^#I5S0KWX z28n4eF4nf}XErAar|hVa8K8tYGkFVqsZovcB*jhPh82MUO;EpDLWP-^d9vp=8|~?t ziB+ZDE+l4mT3Hp^G1S`U?okVU>D z6q+3ppumy_wC?NJep{RRk(lM@xW)@CaqZ9a__-s>!-HEk8ERnNfr`P5A=-z5F_}p- znOLeHtOV|af@VrdcMmrZ#sp#vLc*= zGs>U+NVDADpG%AY-=o3jJeJzb*^?nI4f>`9jYhA&2Wwt}MaxyiXhl+KDb(CaWHD>6 z)0v!evwL$vP8=X2gBOQ{a)fCKX#avvt=ibY&7jJ>D*5cGx5Mx~&I3e;Ur-YGNYW{% zx)G;*dqGGL)Nc|F9QcRoYIecc53644fo#LDplVC&^^L&qg!y*)>Mi4C-rDaj zLAr!P4h3zwwIlElyrOw!t8)1{2D zs7e7kCGV+T1%`sGpab zl2EE$0FD4jN+hSMUoTSD9+b0IAUt;smfmB(Z*tx`XPq*0;Aq`Y@IVh#n5m1GXE+^U zwpH{Tx8faKoQ!RAojUGo@oHsNs?w}{d;E1ng>cupc~T%rj(|szDiTW3>{2BpNzU_y zf!%09=t2Ey!LlUb&O;~J=yzz3|2NgWm~>VOa+pZcFg6LK*i%gU`5>Z5giG7dZyWpN znFj5-bP=i#+`HSp+%0)#$~87_7-PTQ9PvlB6xS7YI=xvnLCUD;7 zEf-HT4K?7l_dM)FTnu*6lzGBF|>ajh!!(% z@VtUR$F-ro<2l`tKYh~Y52lOkZa>3IHx|cG{5`bSxYO_goJDtZ3Jo&+)+pRF=pJl+ zVct{YUSxRN#XAOXMF6Xpe8r>$T znl~P%Sr_IOmUrQ7))>`cqq+ME6Gq9OzjmaZ0ru0OH}iqC&Aqe>a|znVd)il&c_Ug< zN2w<=j5mt4$r__NCljyr-sj37RC#V~fp1nnv`;GPivTh@LkFS0b+~?|818-DNr= zN_N%Eyf!yEYx39T4ZG*}c|Xwil!85`!Sin;gaBU}CR?-+qAnUQ4vS5WUFp!w(xAMx z2@v8i4kRqamqvTUu(#3|KfQ_r>uhlFmR-7?Bt6ERE3q0~4&iyEcQj4pnf2xPgoDr^Bc-D7)A$K{ z<->E;VkOgo+Wdq`C+neq4t+$7Q7+3b_-Vw#$ z{L!5@DD=z3(7SWt+Y)$M=kD40ddvc=}n%&c$S(!Nu})oZLA zO_{zuQ0@rx|Ak)_Kg&MQt7_3J^2N#lr(xCTr#_7nt~-)+K9gDn#UTEcCsL!LTYt;x z699G_XhfjFsY_F#^=A9k*rWrkBqQtYWn#RM1n&K28=n#!ChuDWMXm$s2nqBiVRK%+ zq?WJpSUs42HbI>~KOYeq>tG{uN(;?SS&|hXL--UYH!i-AX=%09y_-o$d{4Z7zm8T* zi7@~rl6WTNK60G)-2u)kT2!qmS6pzQGcP~F_pi?73ahE9n9DfV1AAt_#xjCAV8k~W zbPk|o4o!5NB&JFjH*7l3j4AOmAs-cNBB{=(^D>3Ryz4{9*z6EAt0=u)P?dU)NfC z3eu`(hb~**KKr?#}_H7N4;mYl*m=WO(Qj)`c`@-*0|yyGmND8tXH?V~GAxPqB+1H$3=-7J&9j z+gG#s*=o*E3e$}bVY!PS8!;TaF2+#5won5{Rb(ac3>*sL`HqG?=Xvh#1O=Ii*PE6y#QH~@NPvEc~3y8QlrcH`(BgTF!RTprgmPd=2 zYm80p602RGL6=yl>xQ8NXitEaO^eH3uxGMq&r^Ke1moOpz4no38=t zEOErxXvYdgtfo%>jwGDDm)?vJU@05aL#Ji;wS+{`YbYuLzGF7LpWCSdtRb-J-Kq=4G;HL z+%3&aF^oD_$AjDRU-HzL`^!uQqhP*SY#`i zuB4_^t1PCH3QF2VhZD@l9$UHd zxc|T@`cs(_3<_QiD>VmUWFkE_D+wMSo@|TRm;Ex&-~mqV?+MM^>njJm$r3LLV92?O z%0VRscSjh`qox#=qS;Y~{r5ux_(LVwgj{Gm2_?7{UWxFXA_|wY9xtCW!ZFk`Cgen=_7d>+SsUm6Th$AOCV9JOjv?= zB|03M5R00ISCEmoHm?d_P6nZ2vbHin+fHw^FGKx|CmHxqSclQ zt<-2Oba3`M3^cwL{Ece|eqkgj;`IQCVw1{s&!^_etQ_-f0Xf5 z$e%mH+h3W8Ss<5?#p>yw7qvt$9&uX9ovN;lrIg|+mWbP<1ziy3Jy%ns*T;M=QmO=%u5}(9gV{{9CXZ0$&Dw$&|@qLzVi4x=&#LkZSNlDj%z*bHC*6Nw1k* zg0SDP@Q_9?_s283PrBV7uN78W6uki{!J&Q@`F5jE!U#E{W^*{!GN~ zg$OKEj*?1HX=ajvJ~w}|tA|`#Uisr6lScK08`>4@-OV-j_ z5Sjf;k|RIT5iQ7y7_ZeC%|DVvF@Zv;q8Z{p9HA{BiC6}@FYind`v31<{|}B-wWI|+ znqfsDrPXtrdHV!2bW5Af7}nUQlgJ)v^pyeMLj41>4fL75Lsuyc0W6b#HA@N1E0v9}wa9L|-lw^=+nEc?-ya`4hGtw2df#9!j(Cr9NZ0} zUmq5_I}p8um2*buxMb~q`oli)1VMRA)ebOBIkv>HpNC`gfu(6k81TQ&iPFh*3c0wE zjTWG>{XnRp?^z$~1|L1YP%_l`E)dO7kbg{x6Awp5Q5%~J@WlUvnpQ%RmMnEubBp~> z(HP4yc^_WF{w5RhZz(B73_=Btpp~ zu|*08X_q2L+}=2!Gf{`;m+9xch5YHXS@ay8@Ei}^7lS59f*4U^Bq%(Di0owLLRO6L zO#Jf9J$9|Sh~;hd)m9%YAhGo)Z+L0LgMCMp|8{5}sQJIt8}7_o?#)(T1{G$Vbwj|gvdX|fx}?vtGIg&ZlG zIj7>1p6Ld=voSZAkX?{iK`a?Zu-{fCqfy4HaOhNpP8KWlI#O;)H+C+9-upeRc_pynzm(Li$5beYk*bhC z^ED$Wh)A1^6Mzz#VyI`V>-O54jqRrVAfQOqYjOb%H^p7~s=3qLf{eb@@;;(QH&Xtb zjNHT9_sc8wPh4FfpjkGtSmM7vLzKK(I4^hAE%*mvi2H>UuT)R$^YoD4EY=jIgMN45 zXcJZ=C@>LuBHHh78Uq#ktF?8JXIK?it5L5J;dp10>JRmBB2!WB(=rVAVsVCpsKY!C z4gAi{j0M_HA@;}6)L@u@5B`;=I#bLNWb97^U3TrNkojs)7%Q$X8@&&(gr|W+>#v39 z;QdKWUSSP7Bp^UQ3}5dbna4DB!NGiV92SS1{3 zk^=B=d|vvyI!{neuZ$9`+0dcg&qnxF9EBhz2!4pnFy+4=Yn$qf32PCFg_$gIeyi`F z3XnfG7Uy0DcyHI|ret#S{Hdl}r3U%Gn+LQ-SNBiU3RyHT{s$KbNXQcQ)4wvR|CQqV zho~P61n7TpsXzZK`L9G#5HL;B#%+3k7PPrhf}+xIN+=QkbN=TcAy42>7*8NbPqV)& znEdGd56Xu4bK?7p>x1_v<&*MHX}I-}gp|O16e;+W5-9l)WtEV`e2B%xqZK7XY*Kgl(~{X_b% z1n}v9aX|A_|GFUf*I*Zw{DWGGhb~JCjDHn=873uXGV`cJiuzY`{;J@=jtIvkmJSj@ zNPp7$BJJ;7|Hb)#ocU~g{_$o1+a;xZ4fg*i93B1iKXQN|UysrLKwaMseq;!4RPL)Bgi+g;N;+1-a^3XV|&|(gt~q!JX^0p6VPI4jyP9 zJNgI-ff9Z!Sw;v62@$v;|G>ecZ}Eo0bN#X(!~DSm0wp9Q1R@|rfc$gs?*kCf?<}B@ z54HH6{C&eu!MS@J5@4Vgm~flt|Jm;UEe!|_iTK^-|4%|dgnaULHyNCW83(E&v9#9! z|6PO-gVK@bvQUh1*^$2XFdc>yqLAlRGmgPBAZ_3f1MK%LGx@a6|N0fKz`EsQRCV26 zfj4V96cE+serkOH9s61{EGQ9q!EYb+5BFC4wbcQe)_5{?B3BKYw@vJ$6NtDXKaMF#qG zVgqYEcAUS<{y7y`*MHamf#3HwOz&9Yp^Y7Kvm+$??a{ru9rON-VE)pQpC#hmBFb>! z!38j%LIn(LXW*jf5RQ+rF|aVx#urByIi*(sxd=dnl7}fOJDP~{YbB{ps|OZpL6n=^ zk+FdAyaJ+e(ZwM~tCckiIw+avr0;;e=6ZlLU*XT+J{-8zp2HUW3kHAB&(v=fYlOC{0yWkm1|8y%=LC5Y!2s|p8NI>eX=@{ z>kG#18;?^syk1gY%d_z;n8vb?-A%o|bVNDiEW>uka(7Q-q*w=j1dM!lN{-)e5%zK? z-s!%^{aD%}=Bwydz`1mniS;q}6$mZyANiPEmTy5>TbuJY(dJ_JK&Was22<58 zOnZzQJ&h%X^C{0q9VZ&3YzEf#JC6B0r;;Ko&E!^k3MO=7#=Np-5HU|i>uB3r3LQk? zN5vBFp67vJzrx^LCUv9pN#ceFC8N_JiZ>1wc(tPu{|n*&qgXh-Ix`V5sXgng{VR<_ zrxcNaoG$b+mmEMHR!G_bVM^(SaAqdt`N)R0H>z+qp(NB7lJ(qDPd^{nmi zkfACM@ZsoW>(J*o5SywR!gbN}bIDnjLmPcbp!#&-(|ajwM`8!%;}N{l^Q)AsVC&a| zbV^vtbso#gt!|t=8lu*Y>{VJ8Ry-H{FKzX`+-(fJ14NKKK=hE0E*J0Xw$-*DaHDJYGSFDcUJHBL~Lc+;?1kyIsud)ky3Gf zI`00`O4dR&4~jgY{4k2{XvnSJj=j5f4$dVBz^db0#Q zKk;ntyUDZf6Cdnv6X!Vh$r}Jw*>PR^Ym5Ed znsz+|=dQV?*KNKguci(5ROc#ooq--7)~7E1G%z zs%Nmt22@Jr?0gRI`5!I*pBK6qsP^wY&ru}b2K9I!P8ZoMIx4O1?QmMy`OgC(kV&*5 zu037=V!FWofzV+-h~c#)>=F!L&S1)!^JRc?Sgdn|g@uP8xAhQR7KSFC|_ok(?t2m%Dca{8v< zWj}#zK?z;QpFett{_zNZB=n(wWQ6d!uVkXO&e^Y(uJ!tM8lpuV@kWf8qaOe z9S3m@3&A?1=2LHGswXHb@#RK@jOj#GwH!?4JxqmAmo5DDG-sPuin9@k<2Z zPxzZy?T7W?15_$)0kjCm%_<5sbX*z{lx9?|rir8sWQDK#0)Cbjb9EvMM}G2iQLxYs z__x@Y4z6ec3~&lfSV>6C_3`SQXVbMVTEPoVw4O}^cbSEC+HEY7iR=$EhW`JH zPKt`d|lQRha1JBlN@bOt=^&J)`#!?>GV-2KjY5P|%Gpm_nZa98B zgw7>mE8ra|!ER~+EflE!Z4a>*d2-NpGr!9Emsrc^5?trYs-8FB&97UCgrSGjQAa5U zxIA1v1BlZtjBpdbVQH0UFMkrf(sWn~sy&{=iBZC+*<4ZM=CxNOgVgK*r7#g@BeSB* zeKKCHfT18MttmCFgr%Oa-f214XrtBthR2K}zIt3zMFs7^(R)MTLq%P20S2^2YFQ|y zCLnh0OkU7Bou>T91sDRpm!eZ#;*wK+{v`SWS5TottYE*?;a^ZE_y~YrjHEW{WWhgq z`~FBU-|1Zfjx-u?ZL+mTzK4k-W0l+c>f`Y;Vr%Q`H}FJ_(CB-Bg-G|5-3iOZ)C(&q z-m80LSh$^7M+4UD;*5V%%ST`fl9lC!2nlMf8{>NhN6l2#+j-F8^&Ny07X#nLRDN3N zx(nrbWLYdS3UtFDr{Iz^RP=U_3&1_*8gzi{zI3wwe7U!o8-|)>dsNG4WWe!%D*Fns zD4XtY5Rld-q+?l9gr$)NDQS?Fj-@1|8w7zxy1OJqK#&j+kOt|JPAQR=l92MhD+oN# z`@YxpeRFZ`eeN@JX3o?(Grt*jZCyEFo!{w2+(pSC7o@?tWC?F9^+&y9p8PvzZ==K& z%IinXDc7060u|>_vQ6gID7Gr&Sh4mGl7_}fv2yg>q*M-rdzu=GGwiZp=Imtda!U&N z(~swO z8WK?X86dSsAIn-m7hIqqY(x6R9OH?C6vA)Ly|E9U$4}eqeUVXpHbOGmKUs2rDM!YI zV*T^>Ht9JezdkiB&y;XKT2LTwvfX!U05uFJ9DD@(?tiX7W`1*U5q8!(H0Hzrv+-;0 zOtdY+jRdAHbRsR9aR*x`?B2fBUOb z!+-Dc{#kLHoqgC6TCltisdU~mDw&1!p(uMj8rQ6qPy2gQ+E@Za1f{(cQVNd*b)^c6 z5SXlL1Aa3aBnzF9O)SI@mk3P}7%kf=Y!8qSxyl$B77!XiN58ZXViUTiZ~L$dPhLbW z(IRw}vt6&*MaIvLFTe^|JOEl>c$LQm;Tdu=lPE&wGm>(ke(v|`9UXzg9XEXcJMEo%w6>m>jKMs`e3F^mK>+@&LNR$r(7YQ?=5*F(aXr(tOx?QVY9 z5<2!anrrIz8`6oqSfHr5xTFNC@dDoSF3R};m8P6*Z;FFG@B6zCB0wO@_Gyr!OGwrn zZiw-H2Q<%UC8)oZo`Mj5GX5KXY^%-TyPVrgS;VSf>@5xhy*9b^FRQGH66?!EuQQ?Z zK?Z@5d|1BXnUAp2HM=x8Uk2)$r135Av6jsHps`2U^GdvVpOqiQN0L1J5!&CPJcIh7 zj5d)58MX`aBN8Z$Rho^)eUVt@`Z?lLVnq1`#eUL|lEzn`OKHmRNwpT%XrG@>ppW6a4NnK6&$lol*MAvQ4U;q1YdEsSWDsodWqG0!t}RVz`H z!lr_4Jzq89$##kjL}YzTACawIatRvI@O7WTgL~mQjNgOm%GLNGOEC#-Uok&0!;S<) zjPrSr)BV|V3Scdm9vo-Iv_^}~nR%Q!)8FXYCf72~H2Jy!hnw;4!zKy$EL=IE^e-JKJ+?8OXCRsu6wJE}HnboR)CGB;i~Mn*&9r*T=| z*HB5+V+zDRWgyzXic*T#q)dvlvc(g?Qx=D)IvD9T(|d5hwf-5lRYxo}2G+sq}U$)wZsJMZ{an-*h#us+8%zoFf9wL430qi8}HSUkf znyq(b1^J6j3P|#@@CLMvVjHS)B9DhWZP>ydP-^j{bv;k~dPmHyV8a`6MWAZna(V!o zp=fY&{=3m72LT~1^m@mtrnZUGbu>OF)dCVBV7p9mzPE{dthDzBsDK@Uf_*TtFJq{* zslL3#g1rFChb}O~m8>Z-7Wdt2Kn&QpdG9i{yVarG#V#AhK+8mj;d~bXD8s*hy{h`l z{a;U?f$-0N;$Evjt16;49L4HX`?(P!tTBhjZEH1qry?IKAwH`_oW?I=U`9aL&(fRb ztjL=zM-iz*K(GO^F!+lEXSH6h#Oh5675s9Zyr77uw~5K1zpN&_1Y2}?-QYp6mvKAl z^d{E(hwX1W2}gK*61AEBx3SEey);{`dgZQv#QwiNL~isBS5LqgV&ga;4#7vIy$OKZ z(?`8ibEVc#soqE+_$2F(!)ObOf`b8W#O-l5TxFQGy`ySG@^`fkrhTG59;2+3*PJP0 z#e;$a0ae3hy6VU<7iYfMRN?E_N&%}i1KtOK_pq;khlc@<46Q#1)`h~-u)BD`cL9q8 zd8P9Rm(n%CxzORvOldF6@d~T?wyyZs)KqZ5=+CTmpggF!(XUBYFfE*zzX29^zzgsR z{jcrv4`U+=DW31(w@EKO8BWpPy&Wy-wH)2;P>d<~cZ~gK7MEc50OqH?D~EyL4^Icc zn|R!PsC`3^|CEM7(b159qM*(u&CtQazgYBti1>SBT-3Q0U*QGJ3GQT#hawrAqZwx) zB27pCz^^GXHn^B8H$-ixD7meCV!noLP8>(H%#r=q(KG*%8IA-^;ziX zR7rlE^%^9DERQ@|P|ji1GkxBPJQcRWZCUA&j6cTC!+r@Ju%#vqI6`X9Pu?qaCdL$3S;-|7FCSq*4!9?7eY5b zZTona=cqUS%fUfWKeiHI#P%=Hr%=I{wy447xO@4nBNUyyHUt{hl7;V52^+kH4%L?f+? ze!khHyP8*4JkY*U$7+Pb_ezs2Clrv53yGxZwr42rkTEw_qvlc%go?!|-`(`S9T}R` zTvn*aYst-n+~UuG3cd7$gP#o2uFLM=mwEMk{kKAl8&^CVba>M=dhq|{ zh^Pu5-dfR%|H7qz5JU*sPhA9q|HchS`Q@qWx!vi zc3vcJz*{)JB0vBRPLsZsZ1g39E(PmNPlmq^ z@2|=i&+;3uua1iJ0tJJe$4z-iiJ+okKedN%|w$r#h?*loM3 zwm}d%%9i#jCuA$M;*g}1M7vn$xe7h{azdBE2Dgp&MvG9mJ?*q8vX7(c%%4=Kp!#Do zu>=aOVv>@mMa9s*Ns#A-Sd{ZH`1)=mgWSgU9R+p!-%F6&kxPx+!dHpY_Q5i`5-MVA z0|PnrT!mgS>+W>wmB{4ih?fgX8KJoJZ(sTTQ*Rh2@d6~jh})L^?XA~n*DQJ3XttAX zB-s<;MfZKW&8_4_?#66M3@%b7`6KZClXfnwb^STC-j;D&hg9F`&5N-J`L!uewn6*H zA|;;w^%R`TtJIO4Yl`FRgrxJ2k|cy*(-)GxANevHrcAN_)e@NW z_|qLzf;7CAzNUOd;W2TnjG;EKrBrlp#29d5@+&rGPS{BJ&r=6kDbQ|Ru0Brbb`~Cd ztdvU2$cvkXW5j(`5ll+rEu&~c3$}1__ruB1sfNOjfF!hn6A7!#tq0`wu+Z-h)`Pa?l2XIt{t-mO#yp0;ex}98_X1WT3;ie@#n9*eM+%rLCLOV4 zk*z~By5`UId2l@X?Kxz+5K~9$ismL0BuU3lUkfZ_sI#&RqYwauwsH@08&}R*0|)t) z`wmqY;=3>kNci*hXkkB4Ckjfl*jm}xU2eV~$CYwN?4foS006%yC@p%Mk96x2a>$53Qji0{i-cubhWO;B0}Cs;qsH(2=rvYXx!ma zo(dY1`+#ZCkZc=Yok|UEPVjOa*}XA!B_Shg4m8<}^4Owj+de zXXp{^%)!y=i`&eWN0*Xu9rOtihX)KY3M}lX{9@`e=XqK`kBNXe7{CBh9>$@~%??48 zZS`Nk!;MkVX)*ObOztRt+T*2dYTnItY4NTa_uyFm<^=_v>)rQNk{g85gMZ7zB1JO) zI*0$~=aYIo($fgGo5Kk3W6;sqNG`+)7bnV&N4Ev0h@9fqjk4im@9aXthxIYQ3?h+6 zL!2@r*xBwvz#sJdYSV!rg8IhgJwNcjXbPJgk1x_0?RwMD`CQ9fm4mE@T7mWQBg}0O zz3ZJY0fB@LG@tA5&oXGb2E8QI!;P{J4Sa)*3$fm1jlhU6=Q8oLw!7z4U;pidcn;E& z6KG)2lr4PdfTyMgyVmYGTg~!c%D5`*--LmOAOY6mC3?&Xo1=;Th&~9}kd{#z=`x}u zx=tcih%5WnJpxhI3zN-5YjQnpVLfqURi(yn_7L~V8lU3A(}|4VaP6Y-(nVPRt;3B> zkZ<JYxAg{WJNv$Fmzn0p}vvemLmtA%w4& zUg3bCaRK+;4HJ+NWXZtR+~~sS6Y=?V8vVVp(a8Dyi~Wsk{z0;iAR&zRQoZBvhTT|K zZvhG547x)-)bD<8G{mi}X1?eF#0wV}!?8h@di>L&mx#N$*VvKWQ-PEcen&|zp=LS` z*33SuQ$M(7&j>E}2R^P5kui{}L>l_ePU(6`?fC=8-xYikU!ptjb*&EHU&EI`y7F-f zX*YeGD=`&4NvgRd8Swp!p_TxRlW&_~s^q7L2wgtpHR_r*92RGm6^K5}B0C%oTR_th zX_@ZBj!h8{h3mJsM-{F5ZI@kG zghEf#Q38Me>XgU+?e};?`s;z~-Iq z)6_x-onY828$pJ0j+lZazdvL=@cKD?q>eRLRaK6N9>~(8W*0K4Is3y=jdGC8*mO3N zpF>8QX(9GY{jJXSc#*W*M1o2USdqqI3+4}z%Nknl>4rrbgx~<~BF2)0E^bxbF-?{; z2tl7EU&;0tj@Tv?hmh_OChmse{=6d&@n+5Sg62dct!;$FIs;zaRuu=jTEW&P!Ne-zg}Ru{2P>k(_gUIqY(&wK94u_we0CsVrrBtUQ23?w#?H>L4b*n-1cmskZdN(OM!SVgvCDZM|lqgap50 zso1t;wBM9wEM==T3TJrEQSE+Qm?j==tDZt+?L)%+S#?kB3xPDrY+EL6i0>F!vgm&b z&?(JH@l(;`_=nae&*Xg*LUOaQ#vJ2VCy>AoSKA33W1w<&enoeyNq|S=@m6-6If0~3 z*c?>cc8NFXo;ga*6mu>0GT#;*Z7owfiM)sC<4jSTY0nTk|G9;26m+%ZAD{a5n;#8P z37+_XckVX0N^0DD*^*6Wi>YyffjyPr@N7YhQeKVzh?6XnT75PxF$kv~L=QeDXjuo} zRemaPhJ&MuQO}AMx=Ii-9)um}Ft6*obrw2DCHUUyN=#4vQcAdCko%><>U@*Zi^%Ot-T?vAhg+&oEr``ysm51Y|BHJ8QO z@S!1we(6-TKB=}A_~{3nA=VUU6~)9Qo3|Fkg8)afo>^kGU(<2gpHo5ueV%+Qlxm|e z$DL!hXJ}N0mKE33t|(#aaMj8)YpDii&M1N3(|_xxRL?0;@*^O>#eKgY(B%7p?d?`+ z)r!_aqmy$ySbt8n+`HFB*NgacXUi)z&jMuHE$phSYjC=*R!LmL(yxh`cygM{`;0yC z4lfvQ#l@T6*7Ip&h~SH^j5dY>{fQC_}}P**^1k&@Q2bdSqRJFMmWuDQ`8_eAm~^GZM2xM<1HU7DJ#1#75E{Tu^yQGGbgK^S^R zi8e%T{@pNE{XGjqUPcrCpGVw}GCAYw-m8%Zd%aUK=B_C4((dbul$SGoN)}M-OZ7df zKipxuAElFxHBs(%Nw6Rv1e~zUGyr3kH)p=^l)pdwQ^!J&2|ljH&pLp&mg; zT&Qb9^ihm4I?F#yz*lj{CAAAt&Osc`w^N_Cs7}Wj|5($`l*L>+!{qw{q&#=dxW6 z(?lzhx?+<{?vIJ1(l%4;B+d+6llmNOAFy^OYy)UFu{QY4-f!@ye7)UmHxR`;hGya* zGXgfVYs8Zs>!m>9VI@lm^D>pHOOjff@+(cR8=-mT)_ne)%*O6>6v$0!#RQ7g%G8>y#0uRat)@>?eJ1_mni#3zfE#I2bnzQchSk6o>AxOpT{G>I6~zgyid` zj;7!#@NR{E=yS`zo1km^B){I%Ai(l{RRLvj9alfXF-K$*mJymZ_M2CRSZ2uCM4jes z+g+M%9O3A4Mj)rkq-IEN^7k;8HDfAL-VO;0zD9jI@z;2#k8R5tz8JLz24RJ=aGGU2Z$?OzvseKIDVNWs#HPzbkbLFa2&Ivghezh4Z zZvHIJ$s~+6OV?=pVQnhR^iaTYirhuecId3gRKFAYzOe$L@8giR>`7QPAOUs`lFi=; zxi_MvyV?8ZuxhOPoFb$mXoCLWFrz|iUBI9&*~^Y5vaw&GY{{bEb=1N2U}@>N*rO!{ zd^F@z`@rw_gY(8fq1{qN&oz#Wlb3_%8lxVpz=(>30q!^&;7O} z0v<=moar0UHzXC|dCHr4t9O#J$Ju(dIKjM?o1H>LLu}&+E;d8^74@ulC@?ieOk<#U&*tIg>b&3$#N%@WY2dN14wY(_eAE7 zWvbZOry-Ylnl)2fK_c`LJAgE~%$!%9nLI6r50v6T? zQ2No(nQxo+a8`%4CjOdrQhSvUYC}bpM_;gaN27u<2O>kO?aK`glCy0pP)q`A0hM7P z4$wDN1UTxBgdqM#93_BAfzzEc7FP!SjlZ(!FY|UHy?#4mlU9IFv!o0FISL>7HJ~L( zQZYB@B6vz5$1K92Tnx5UAgNfPKCxq1WMjut%YJXF=z+<^=|L!OUni51uiYu>jktcky zZ4)6l6f=KgCB73Vvbll54ol6emk4uz<8!(<#f%3I_xB%nNql0!bgC-ZRh%dPGLZEMkW)%9}DwD+qeFIlrigN+vx z3~@zSjl_A7 fy>j=wRq$Q?YmHXc8y>EQEPX12$=WijKTZD+F3hWe literal 0 HcmV?d00001 diff --git a/_odoc-theme/fonts/PTS56F.woff2 b/_odoc-theme/fonts/PTS56F.woff2 new file mode 100644 index 0000000000000000000000000000000000000000..2fd9d9afff9d8dd8734356f33dd53c8ea5a771df GIT binary patch literal 118632 zcmb4}Ly#^CjD;J2+qP}HZ`-zQ_ifv@ZQHi3+qP|6^J=R!dn;w$7zpCqP zgNq@91(bsQQ;dp2z`ZS+|1tnzY(>uLd=Cee!b4ItC<|km?l=-;(J|6lMszRx|jTvXgBwlCX&k;0=|GEHJatNz<{hG};u|G)!+uYF9UhG|#Bf7*lhK%l)19 zf-Z{pIO&n63Q3mwRA4hnc*R!CjzA`mTG!E|S5fJtR&!ofAqi$3fUz^8l62Rgsr1N6 zhkTYwO7=j*c5cj{md}{vO)35-RFrN-y?X3UDxcJnv2^o(E*7gz4wNuL4)Dz@w-jl@`)-gLAGTCIBiPQL33^kPKHgUsP$~vrdH(3O=v7=yZ z`}k@miPfH&fNu)p-(WdqWs8RBvS?zF#+jzf3{3Gw7M^zD5wLxQLV>y{SnjHmwRV7b zyL6h1dPBV9_zsR|dOUOTozY3ekwIm(qOA-6k;{c#hsu4Jx!S^UhYG7J`ik|kdVZg^aZ(2i~o^CG_= z7F!KmT-sbpm7TEX)y>{_c%^4+euC}p$TmFbBmbm=w_=`eRGBHI9FUBFTs!DSJ2*fz#Zn>p#@8H z?6~-S+&(`NU~C|7co#<5^d9h|{6_L7f0#GyM~?ZhHg}LW=qGnpLT-toGWK`?^EUIg zcrSlY2D;bIYH4yb0!m{e!fqVYd=&c5baDi)cr8}Suzx#D02W(vW~zAaSau?bW1+C7 zcqpp6$XZccoVarTZS?{DVfm$g?^cj3qsQX+2Xd#M-`B<_t0Oacp! z-52K<_lGCoj{eQ-?e@^m-%DJ`5C-Z-T*n=35`O$f{kVcyA zzhsQu_=;(*QVpy3Dc9ut8le7d&PJk4kGb?FyCjTVYZRJ&TXKXnyyVuCM!lvHcVPfW@7Q^abRPWsEOi@c`Bt1 zenh4O2?zgxL_Up}d4FgUM}-lMU)Q9x4q%IDb6w(?(qyNyw|Kx{8 zP>kP(8b+?9P$iUVs#)6Gc>K`CjtzE~FW2HZ2?k`0*-K2h2(<4BtREW8!A_ZC1s7|t zG4GKiN)3dDNdUcl_m0jAjcfsJIgYB-ol$QmcZ*2ghPIZ20!>*cp=~GZK*;vJkqci} z-7K10e4c?+?fMEuX#~m-Y6>0;#OMf6>ELJn`=rd(vfWAFfv@OKOD9>?u)^VoF&_rz z2oK^vJ3p22m0f5xlBEAR^9|kai+0~jXYHS-tq&S7Fv_h7z8NmsXKNEQ;IBvpT|-Qc z=>qO4R&c_JwEV!J zrPL^y3@j0ECD-Ux^7CG)DgnTULnX=cE-q1zzP-mxbEq3y+O@S`xnjJ4W@?OR2 zK<(yNJ9i(YFEOo3rjbtS0NEgO=4<)Nkw5c3=wthyzIww8MePsO5RhydU2^5zdFr4u zT4rs$z)k=FDJjKW_sBOMl`UyL>iewv&FiifQ~N!qFzi1e&8~&*JN9RT@`?PFViu&8 zv{YY!jzELNDnUE+|6_LuB7d!#m3CR(rDmvV2pE?O;_@32(NgOOlffZP8UM$)j{7&i zcmP<0G#^@=Pc~qVUqu$dO^#;q!cgX8oB;rKf%cC{b)2CXnh=C~Pn_74ImB|&;Bhy% zOy!fy`<8-t&;geyINaGrx8Std7)o=!&g#;nLP>T@Tepf}^YLO^!H_#Aby%plxT?zp zNtPT+o|Lzk|NC>dZ&50D-|NY20?uZP1s6au<6J`X*-<2!O+3sR4R2;s&@Dceo@6l%Y@YTUXHeGtx4V|VIMmwj4%py{`j6IRSWyQ8G@Z0D7VR59ULQSac z54~KJrx5)XTV0$qm^othdh(IO^?ph4y>EY#_|+UL^cL5m#dg+YBeZD!{2Aw+<@1)L z6u|l$?(=kb8NtTO?6%)5>4aydmJa}LN@Z4_-!G?E@lTnv-F>VjQERBS%mUy1_q4$? z78icz2Nd9cp9f6%OLS)bd7NU9wD{aZH@iP~BI`EASV{SWr5G)a2#(jpNXmp??v~yB z576IlOPKn8Gu(;pl)8nJwb@L~xRK8m7Ka>k+I_1)!E(?GBhtUe)$&PApcx9mHM}rA zPwdkU@Rm`n-)2XJ!*4V-bpdvBQFUV*KzxzF-oKIZ>iiBV`;#^F8ZuwTE-rTs%lUP+ z($8!*i)#We<+3P_+|YTs^Nx;|zy)S$Er7-MQ})6qN#EERRq3YQ*BrYBgz5}&hl@W9 zq6q};l~RC&=gW^)QW-$Xf%dm!S#FoP$!4P7X6zK7sef^m@6a|ui|+b`76AJI(G2PB zUtf*Fm3F#G4jwguJY4@^*xlg$1hbAvwXyLAm*^jpa~5b|Hv&@;%``e#HbhEEkPcUo z7r|K-R3}Q(oHWSycl^I*?IuWGyqlmZuUvz!y@PIWj~XDX78>F#F2_5AVU-4+VAB*e zvIsL#2{qLLH?tTu_ZPFe3$vytybHuPstm~Sws7X&~|Dpp7u9!QmI#M^5`JN55okao6^?xB$3i4;}NbliJI# z8Br5tV%(dDnTyodm+KBdIvHNMaX3eG&@PM;Lf}j;z3BuufS3rZaA|Dlx2|R~BkC7b zU#6Hhep+~Wp}@6C_g7!lX=Dt-xzNO=3|&u?MMf<$SG;eN9BBj<*qcL1eOOtm!jZaX zJ&oIJwtl%K)pCN7oOkY*+5A_w0y@lu)G=D%gA8RdYrBL^e5>ra0K*s&*-#O82_F?g z9F=)t;Py#Albn2^Tl}+JQvP;5frWD9`PPJMXx}U*v0ik=RiV&-`^T3n&)lv1o+Pck@?;P z)tq@Hvsv)wCAL6-zqI;{Rv`NYWa0bgZ&wFDi<_|bgziYlp!N8Lsz%r?N$F(*i@)u0ENfs%lW`vS_nSRAH8o0LRKT&Y&;vAY?7o{Wjfa}V-E;^;iXwG~ zFpWZz3=2aN4gToqb41HV^zZ22B0^;(wTqmUN8Tqh73B5XGKKWT7yEge@EWH#-W~ax z?(Vg`0$r?R6Xr|yeYELodN3AscuEazh}&c`N`S_Mi{pfCC8xA|{oXKVA8&8>gxln- zSPY;b=YMHe-cp!BX*~QUV%>vA_ui3tn(VX4%A{Hou7Ym9doj}f*%JMCP;Ni3pKs3|Fh(NqM{ib#DJxcgQn z^e#QV#4Mf^J`Nwh6r18(=RT~Z z2btBtJPkGz=*_&pV+c83;`)l7S~gkZr{Cw+bxV94+T0N==&toMsE`9-P>A>wJm0h; zP0s|&0bEUo zj2Pip0oC-}jx$TsoLR`d!yDjqJ@F?3_>Tqag-0SCjuImx;C^6SJy7=uBB-UqB^8up zc-a^WkPbYCw{QX%RDL!!D@X+tvc2uO^X+B={_@{yGxy1S;N@z0oDKQE*AZ=yN>wWk zNQJI=S&S|h?Gc0w&xoSHBerCt&8X@wXG1Ql?Z1bMaqZ4bbu;f~JBiOW98kQG(_Oqh z3ZxTCg`qN8L`}KRyBdNHPt2ZTm0IH-fa8$f_3I9Fx_kr38evOUVWVXRYkuHXUr^wU zJ>az$62izq2v0A2?l+qcqmH`#_qq$vlnu(UD%Z8s@+7|J7JVH@9>^M`V+Et^R2z8H z=rZ3~`Khh+T&(QPM}yMS=dbhI4}4w|#{1OMq+nokD%E7-#ds0O29;DNNL0%#D&M zjY6qjnO!I*)uz#na@qyQ3|~mbRb<0BYC?5V}8l>3-7V|bWsU}S2}0TztHM< zzc2+_mgGGd3B-B48Zx>8Qc)EJmMmx(Ph>x3@o*11rN$QF&WLYtacA+oL;2V3^b z#F{aqo}a77)Qh$i{~GGh?Z=|eUUsr&;W)1YLb*l`UsrF6&DiBPMaRT~GNZDSb4Ym4 zuBhOJVg+viY6L?RL!Ekn22wThzdt?LozHi0;idNujEiKt$mA1;y{Sl;wgO}w*ud)j zn#HpD^a1&l7>XNFKcA%*9i1Jmz6}_eCv|%wdCZ`AvbP!Ic`*1PA>6lAZf6hNpJ!^Y;@&LH+5!X;_7DZX0KX z#7jDIo<73Lnaz*H@g3dC`70{c^2NP?!w*rhM(UGgvskmoO#L{eYodct#tuuDI{xqr zV9PI1i+Nx}D<@H70)?*Ln6_!GqFn#CIlR^2@%iUt1k%y$a=8aaJjF)w9m#S}WqSV(g50hxju(A;8s< zcS!xdjZ=1J`-M0(>Rr_k&ns3h^lrO`x4Gu*jBrwyr0DxYw84CdPJ@M+2wuDN8})rJ zocBx&!#?cw?KmFH)T(C<39A>TeEInp=IXFPiKy!sSI*50=6rm}BJ zYl`ld>!o*8S$W0-msl9^bt1kg$eLFB@7*!7f@jkq({@XT{oF{ATnRsU{1s8KuK0bK zo~-VM<^sZ3_axcQ)H$mOfv9xPj4NrmYxZwG_}>qx?m$3jaEI&NsN%yLV}5 zfg31p%t?97>r7ty+XZXO0;5R-36$A@#v+SufIhrT2L(!2k_uQSFfIcDUbiKOl_3?r z0+xg=!33@bi3p!D^Q0j|cud*TWFM>Vo>@X>{kJfGDw%_x>FU4$n$%-Zp9i`uTrFqR zTreSRwn%I3T9sV4F%2H>wa3W_A=Zb*XfgiRYncB_qi8fbi_x;Pr@xh!h)7v}n5h4P zY6n`aW_{f3c(N6*Ykkui?NCF`Db*V1a&RF=NBc&Nl5s8iW$Tbheu<~sy!*3U9~I%~ z)%i`oDqyI-Noh}Gz_TP{EQ_unn5Ck!hiyj5A~K~kTSQLP+`KxncrbszN92-|V>mbc zjXGBT72Ja{nzi)lYCU-RAi&M*Qgeql;`qbVk&uq0GHU}RovcxuOCw`7vGHAj#>TBW zyNeQ+vr<1-mTbpG!(!wwS`S+_d);|!!PQz)a*s|JE*1fd`-jBrvUR$h`(yZW(hEzT zr|6mNPTm7j9u7Y?YCfxkFQ()|sOmo}4eKapi8Oqw^ThL)Mx&9)lzS;*ng6J!zg(3b z4^7nXSW4K}2QnT?^f4qI5Sv`9%q=|VZP#CdkNV7*FjQK9IpQAY0P$SH`G#2jfXBV4 zt@eiXJOf^mr;{auus|s>S|UsgM2dtS|G>Q+8h>qqx-)Q8LsCS2=lqinI9pRksZ;o@ z$0J?@Ru7!QvQlKFu-$G%Z8hq2pIl33Lpgit*%XQ_6?#&aGjb0uVa&E%_(8tZAIt&q za{ZJboQXVoRY6>t5m#;O6A(;yELM2GnxJl#%s@Y0fU~(MSa-}o;(^y} z+_p?pz+R&jhWUkas%)AA+m~t%64p~Xw@cMnr(o{x7#aVz2&w#WCxtM#hfJr-Y+QGKRDdf?yyi9^Op%6hZr%0tXxt2v^3T20- z&5C$UsX%_n>kCAyszpq6UybazzK_?m9*6l3#zmgQxZuv{?hF}w-BvHm?tqqK8w7Yg z9W|HLokUqH-XpVbw^c4??|pzTNXYRy_8suq%LPUHB>G9D%HOCnhP6d3*P<@?`ya67 z7p>L5xSLS=JZmx7&0~cS|FUpE#ch-6Fjs|AIqSMJf1V{mNT_Pvmj{c^7J-m1w!dzfv_B}zRUf275TP6@TLxL?K@k*+xRAcQsy4wP~cB*7rOA;0jm3R*tpS1!2GwC<9)0?JN!@6 zAq!)J2Hgx`@nuZ6Xq&Wbk_2v^`+T??<#?GLoPdSC_(~6_e9?Y-GauhR2wOAPG?c+A zbF$Lww7kU$i{#RE(9IjyovhzTVEw^;@x>)XOEL8AVkc?X0<|oWT*L5A!@|`c+0qIu zr(TxPKn{z@g?~agc+T^}1fZ}?gP7Fh=|-VkthD3m z`3ea}WKtIF(ER%1(?wQ4z@aM(G27c9-QU1mLg_uH+PKo9>Ls@>|bT+f@5)g4d! zSqgpc$03GC^zW8n^W{$2O;=En5$q0*zW1oZ{sVuvuR2qgE2*iNZW(UkNFlPOj;I~2YCjI6|e9=Fz14mN70w-Ou8Y_2$8 z4JdIVMh_xPsBpYiK4nK#UbJ$`v2~e zNTfrS%PB}aIZWKuZ5{@*ujQGH@e-kJ;@+B3Jjp)DkmGMEc7>iKdB#CYV;~NV!cMSp2DD z(u_n$sQF9ha;I&pXoSOB2mZ!EvR(Tj9KCNG69Al#p5T{?u7gsy^Z6?IKHwm+ExYuL zewp(Cfn31M`7;bsdn-9(Vw^AMSG zD#VcbbNgIHGnR%qD1$3&dwQI|T7PlRxXoIvgQE6j znLs z9idmS_}{>EAF^bY@%O@R*szFip?t(roxSR0&hf)qkOJ-ipD`?s5P>Y_eA`h@gv{H8 z!5zl-wLRSqeI{56v>~BAlWy$t7mWUcd!STH--!q?Rq#yvR(f#-cGKjbY@|TuJ!)*; zZ-Q`dvQII8dU9H)r3n`Bsf_d4zvq=dCJ8br@%~PY5hF+b9 zYVycp>7`KBhI|)coJ}27jjmiZ09@scD$Jf?lxlxH*qkbk+Oi@o4nQhA2)0yXD;^7n z(y?)cPliLY&>wbQ2hV{-GhJ~(zU18b&ls`$BphVXZIl(N(Rw*FtvZeO94#EF&KVyc zM80gmVt0ddJQI1GT|CL?Y-H>oWOCsM5{$qm_mF6&lV z%8^-Rh3$u2cghB zcz?IJR<|7af0T-LHBnx-aBiF8sQBcNF`Y?QmZGhr$_|kg$CHO9@xEK=WZ~{Zh%4E! z>!j<>yPAI4-l%*FOx4y6s&ZaFJKYZWt1}MfIu5+twm1&l7!LI3W#Lrse@*5A0TK!D zQPEf)bTw>rh)`%gtg*NFtH2G9kkB;hRhpZHWi2F(p-%z8Fm!FRYF&7d6x>;(tHSi{ zC!t=xFHyf9Ex$K;8Tw(~5>QOYB|?KmMi_t)c4lnN>1=Q4WXvYbcc~*fJ)Z|liVz^| zo>)F+PnM6fXN3Rm?m>J{MHoG|ZD4Y{_kGJ%@_P02XSzjjeC+U8x-vo!{P)D+LBm7j z>J``&4mvA_{ntpIS+iiFUaEx5vdT_wA;xXWSkcG*dVYv=ZN*!N#xrR)k|jD6ZU6Y< zz0TGmKOE$H)?g`4P8MbrvY^QL9`wVpTb9ADY9N;o#(nrgq4=9 z0;jd!M5shA|F=#*+gLggfFIovxj$BIevsozl9 z?3Y#>s-#(jN-Wbf<9NkGDOUIAR>$NpG2gk2f+G)9eN2!9hO-tpcns5D7gIbU>Kv@3 zpoEfv(@atz5IKR%Zc0$Q=j8dU$Gz31=(+=CcrAf)Q71Ku>T#Tw`dtDq#Y^1kFgCAK zOWT%S?YYoe=k|P~v2=Ik9}GhUkmu{Ln29A9)LW^RriTgg?Ka(E1yPRJb8v=n-M?Q^ zW@*#NWoCN2^(=RhK4GSK-wS#tHNDZgR3g%WF|A$8@L9`tlwgJSWxZD1#N&KiDLI!I zllk&bv%ADJ`a+ykDLh-;@1+TBP7P0o?Gr1#gQ+RaFJ*vP1(*%>g6P*yfeV=3K|?|l zN6uMWsOft=nqh8Mn&@i!#tFYUj`)d>x)Onvey-rrj~|T3BYITG&eu73w|0kWcgNR{ zLl=hOd~_eQ$lw0=MI`Q%%aB!gk5l`-#69#UPk<+PSF09fG^^o7m99D9A9|Scyl5_w zRpxSbnHTIo`!MH7PA>dX2)WdzQI63gA~EJ;ew#P_dt8aNvKHfTvw1 zc5z4w;d%2%sES=vl^FG!KLY&Ofc@AQ#(lrXuL6+ZUj%epa<*rdoRdS zI4CzVpdxiz8;V6W!X=7xKCAT`KCn7AKTN$iccV%ni}KiQW> zf`u56B*dBZE#$f7>5@&n@LC#3+KC64oy)i_qS|ydOQXgc9y(suHS>{cYZ8$?WinThYhc z{$@iuSU2_FCJRNx)Jtcsqo?*HAhGb$QYp$#6+{={+<~#BDCa8NNwXzWXP%uYd;+_& z{384l0!;O=o4CNfHcZ&dc%mDy;!KKBzmb;I9!$3Ja-c3L`*^IRN4 zi;{he{2a;)s=Oy}qc|1|k}s59S$OCr^5=^$RK8mLA#uu>FyBveLRxR)n5ffi)-f1M z+_pDnArd0ALKBFsd+){w_~!5p8;9s=M`zJ(Hh1l&ACJ2Fv56v)g>_FpCGs>gHBY`B zwdbIuUT*6uloqhoI^hG+CfNpi0SKS@*MA*bfg!ob!=;dkG(nVnMRkJSp7ltl(+GeB zUK-L6@x9f=`c=*Kk$vYOaCeTF2h$}nj&wk>aSflIq?26u8y2vx@I#Gd-W`hkw&l^T z1{i7L^>$1es$KaUJ>6BWeKp!k0%@SK`~)LON=Gwu;pC&3xD!W;Kglm5qn@?=h)@6` zAriDt5~jq7mFYRrC@`RBc%^3u5QCo(NyV|nE$PMF5`9;@n%lj8=8gi-8npQSImNv{ z%9(dJLQHqx4_5xO_7}EE-03l8<%Fr!+q~kiwCn^ra2E^&cvt!Ug|>@8qgN^eFHCUV zVdsK#FYy1uH-a2UEAVR$fWQ2|>Sv^s@Nh@)dOvjP$b=Via$G(BwL)C2VC+wx!5l35DbAN82zh&JZZKe5LxN zs-vasC#E_LwV2Aq*E=WD5it~$WMsguAu-f-AUVKM`v$|RS@57i19=00RCA(vG+g=# zML@|wNu?)q$n=ey6P20{sHvFODCVM#w2QQM#a_Cll+D1)yBmTIqoyE1`o&;T&5=aW z$@Y({)r@7v%=S9?i>2_7I@KW2oTElnZNx|$qLQ;|q1agD%f{=KY``B4d{eM}#3=dp zM!SRdmzN&FOSMZ&Y*UuAS*b8GM!_qwuD)M6HSZ_f;_)8Y?4K0{uZ_G-O=SO2YdPqp zEwBgjj7XnTPvjuQDs1nO7`ru$G~70iVUIa*>QeLBD>p>jW?5ag^lLbOoKlwMM3q@$ zPnL{Y4m0D7StgD+AYXfsuvE1SD;X$h*_Y+u3@$IZXoz!9&gQg*&}8qj!ep%L5ZtK> zx-iVb=o)_QwY>D^if1d|<_zmu%Xr#ATXWqy%dk1TnpV)1G#;_|6xo@hTkF!Owucg2 zEx?`rJ2cg^z;%(dmOr_i8$W)t>Ie_6*Sh4T2wr$}?pnc)tBugg;kvMRwxH3YCBaZ- zuR*>l8l;=zggfnx8uBsaZ&S=XkBAt3_zEzkAE?cAVP{j9u5oC**~Vq?Je6yJ?pg6j z$xOM_%~{riG){fIdF03@?ErZtn@E2?4C3D$q3v#SIPqC<`&P((=IUN<+qc=~5Ixq} zUDoBy%lKwiE8vzpi7Q*Cof_0!U2VhsB<1m}VLRo_mO<;gsU*5$ZC!b&HW8ktTT!;g zi33Ad>9nkFUU@fZv6>m3fI&hjVIuq~M_~?< znm}o^h6uo>u1PWj4TmEPp&%SW5?Kp`B5o>%0uLWLbO#~=J}tD^df`mR!5EFsYK=VVG!{JTG>92VR1h)(*(vu!&TmhN=emP@_Z2y)1~c!j82 z0Yjv6{e;Cp$l!PdF%neqiF=7q%<*_!6*aQrTv{7qE<>z5@g3}OFmLBdd`lW5Z>5IK zz*+T@{Kqw(k`N>qzZthrVVz$Ad;O|;PX|(jms-{dKGgb{!RQ;;$-TtmRPx!ijX}Jg ztB^WY*&pmrU_pN)bH?e$JkB?{>G>gEh`lmhH|5I~*ZQa!vBhF!wt*Q zx&a~apjx298^1QZhy(dU2Hb0k1^n5)zM~|~%6WjUNLJ|2&p;E_6+{(Es?Zyru^wX? zc$-;OXgyx@>})tMyFQ1D@qdn&GEYBR2r+dDE$W(iLhB?LaS7!)yf&~7>x~yE!<0&S zxtC?I)1dgcYeLg$fU-(OK5r7rVzgJ3&@lJ#-NE(GSCz=*#bq;X&FrtC-_d}`(izd4 zd3iY^5mCV+RE3id$ki5giHi#+<)v9oC>@>B_rVJ3;^Zi;2HVVt&VlDbQf_(WE0I8u zI`B=uKORy-oWG=7FJTjf=fYeP62ALQ>u+Fbv+X7 zL$q~x)G@l}g*E5x@neq>ShQD&YG6@9JWB50k&rg|s5x|`ENl2|TUR!hJbQy6_$<}o z8$UFCLzQQMmkgvRM&?@(iA+QRd!j4nBy*dgdIoNat67i`(a>OYM8#*qyJj8TE1m_myZpCo)Z$t6)CXHxUd#D`_<-@{U|Y}fQM3^$Nk zW6XZ2o70Ae;d;n;Ez;MP0qH5x)cSu~X6a887RH2*6?BGk!|^oRSWJy(WUgVBk+oMA?C2Qu=q5x@r{a>eUEY4_)n{+<;uzb(4rZN0dB* zF9s`YxXU8)V7=LB5iGqnD5CTYrXd{gNGbq~)o5#GWSYL3*aPuys{PkLK~_~)(E#?a zdOky;2_VFg{4RLgKaf~ble4dhTGu{~;JNO;!JQz1Bq|$6J;rHA?Z#mSF@@qZ=wvIW z4P(FY)p^qoXi9rL-ry569Rs&boRl|TxI3f0I8|x2C~^o-voK|jsV51@zme46o+Q-> zr0IOZ7f*nIJBv-JOHaN|YA$TWV#T?17gJ z(rsv6Ov8&2o}nWf$NMEh#)o1n@H&4zhdTfrsOz=x+#;?3u?(JxM_PWuGAxfrqEFVV z(km}K`|x6QFN8Y@JU54b4%52ZVanZDd=B1Cm@qaSv1wSo4~yZ=Wbu1?;Q(IS*27L| zkAHyOmI*l^p7Yd9UwdGMkWe0`j@;bTvHZ^>pscCKD&J%^9!bc{dmnO9TJ$Ue9)RmA z$>WgPZL(j?8QDQ9cM&)^X&UELTJf$y{AG#{Ye-FyE?ZR-Dsv_a4PRspSOkVMgtTr9-*QVp^h^Sn6X8)qM zh0SI^*6eMrbffMy0?<@Bv3KHISQIlNi__9Ll)7g34{A!8XN(M7M9t z9Jy{k%%{c_07Sy$8ws6711N&XX;R3Q?7ay|`C6pD`Z;{pf1KPYd#UAq6<}tF>Go(d ztL)d5xEnjPf#S=bYb%N-P#$DVyctZgx3jz_Q^Uk>S zGScm}WPQE^!nMoy*1@+f6NdP`FuXiQCD*fbnD%XtU|3mQ*fGM{kU_K#K<}U zWc(H6QguLf`-Vgsg`zkWVh0heNd-bov*%*8PfPi?g==6JuEJWF6bSM`vzmhUC%%Coyw`agS;o(RF!x&ZJYaRoe!NP5D{wlnR5)njkfy#tjJ#nuh{x zIYtt=7%aALd(gK&!^w}2Kz$x8l?`h{Xi93HZ9(a{$;%>9U;(X*zJo@37Yje-#|X+Jlce|vV{dlI3A~Z>Rbulu(;nlac`QY(N~RJ zM2ThwZo&YoQ+W%-RG5J!+{V)NtT9;U+urp}c4}_M)U257Y+88(}zkyTO&_=d@QN5PU|}teT4hYSx~c)#DcS zdlc_o&S;|id$h8Ulu?V%(#*UQnwgY+&ljTxjLwuhCP`jH>Z56+H=I@<+!VKefyXEX zGf85uJ z#0wLHC}4h}{&6>P3W@L+piSP<3o1$oL1NZ@5czO7f2JT@=7T63`G>MRLBGuww>W~y z#dJu|m`Wn~cU+`H8v_GO8m54$S>`-bJ1~tJ(WXw#P+ISk?S_jE;1{paa4{7Dy|!6} zi4EV4Pt#v0BGQKMm;WmSWT`ZM;f6FZTao$UE zy!`x7W9?vlSg=Hq&z&z!qQ&R<^z_Akn3(?*FHDo9qp9a>bmaBiN&ce*tz1nm?=ap` zRq!RSS#HF_{SQm!+V`Yk@zEy~cSi9N&C`HnPsEEnrUfC?ky=*NUMx+la!y!dCSdhYbUneazM@Hpv!t#|+lszpZ@*8)xe1C=YTr83gI+Pxjxei*3F0`bJo*Z{L(|}H@ zYAud@m~lxv+yEIP-tF?9Eq+VxS%68NV0)VEar~H_bl_J%(v>lpg9>BFdk|^wL!PJ8(X(zO{CHjTT)|y(w4EQyT^GDCh*6gY*3)~0$TBf9vl#9u1{cPv4*+#`Hf0Is zV6xvwxR)+7I=a-X(_YYtkj9S#!UKk}%rmfdj=wyUK886mUm#BlnJqI>b_-xIaS=q1 ze*$EGW+h74?=VTPj-l_!G3i{HmJWaUl{35+IWh25?@CNeK4A# zga$>IYL0U0?QkswR)4)fHDQBeSy6e|$#8Iou|)1XNGD^DcwNp{-;hNrsjgU=?X zWfKqiF!h2Raw0Z1rY?8#`=*ZAHtPEYglI{7%j;$`3ix|2NNF|cI4zD(E>iR| z2Z1jJq`qji02D-T5>h1r#u)ma1i;Y*rFFP0=|Y1Ud%+hfJdCDuTM^G=+VE9-Tmy=> zIOSR^FpjjT(^*S82A7o|St^zP6pkt*93h4DhB%#Q@3*KYQLAS?Oa~M9<(36v$v&gh z-@?{##wSfOZtq|QZ^qZp9L;LATHb1`gTkj{-j5wWEArfo+Xqi2hm8M@aA%zDx5)*~ zpci()22)0mZ^7?8oVYvq)p67SI`b|-N5KZC(NDj-MLhD%A}iU&{V}qZFQhwCM3wo- zO)N8_qW%8*?(=rKAvh);)TnlMl%L2Vzxa}UQo zBA!sYN&?yaQy$TS2+nb=S&hQA6a=RJ4UVK`0sIq z1FL4MX*V}X=HVcLW_jWF9IYg(c1aQM%uLQ5-eqD9rZgp7MSNV?vGo9TBgq^Kzx=g> zd2d&fR4$Mz=wdF0nyEaa{~2@dt5Oij_)*fh#Tu`0tBQj~n}WvW-U`LGE_U zZ}AlF(^nx#$4R_X4DtQ2c7`?3FlH^^I5LD0$gOJO>O3xma|=`iTv!!<#?|u6^;T*{CX&hPT45%fj1n7DK&r3VYWWL^=C zg{f|f@-~6$qlV98a5~}Nq8}q645OYAA%}exh{Yw*Ix|?zDiT2EB&R6$?gOWimMQj_{u3G2^V(7A_wWLmX5zl_yv*sWwehDteKy z&jxH(6wVa`?kulw1&;*e#4ST56e&E-rl}O0>mAxfb*;9RT@lce6l77UUR-IYd)IiD zvFnj)96PGgICtG6>|1b{C^;u(v!GnCh<~y#n)tEmfgx~UNzZ#UwRz+vXjvc9U%ArS z3gw?xZ@rl}HCtIrIfO7hv{u`6x`MA9bVe-E0qOpmVg0P_b5Np|>ij*AWS;wkz<(m; zEB1|%v?PCe<7fF&N#>RL|NAe2F4XhAJBL0sXK)sP_nyuP%_g0;YWYLzFv+Re3eOs6 z)5#o*+D)anb=qMnnYB!0{7o>X_rpmq@995Ln9-Z)%wY4t-O==<$b*meU~jU;>-?^leqfdv{HKRIuc+g^ zTPpoA=;Hjvh3IHu%&y&aS>`&m$T)(a80VLALEQyv>KXco3PFx^!Uz(RYR*-kMUbm@ zrEMse9UjcRy4}>|A`x&KHjdpG&)`(KfqgVDf7?Y8^2p!bf0oyHdaC&6L*v4&Z>T=V z*6*!s!&TVtYwTD42jNv#3gw<{zKrvK05w3$zrL=(SaNZAM@}82Lvkci_pp(=1{ol|zj?~%=y>Si$We$sn72PXP(Hq{(o zu_f8c6p_t72XP2hY($2)Ty!gs@w3z)DlbYSJU+=9^wE&9C3J<;cnc#w@l5^SL2K^n zmE5jNlAjB9eu@|Sv#?Ie4Q0E$`kJbBEfO?Iz2>=yH8i;$t}Co`^VaSDPmlj*^yu0x zp6O9p)}ytn$5yt;r<>kPGQv3mGwyj=7sA7}Ff4oLXbx_hMAewoS@@5KT#=J-oVBie z#v(3yEE)IG2%)~h~Oa0vQ z<5XNIAj!?F6&?2s)y}C6LJH=XKId!#s`0a)PUBpghjUK&cm8V&QkE$;LLc{R&Fdq~ zBdy-COOdJgb81hNrRm;(*m-!r6FJ*4}mbGy0%z@yE>j5tKu|{&8+|sC3-K67D|t!f}O8rIjl%B7$D25@n2Agb@RF zbvJd;TPV%X<+-!eIpp1u_h9#5O7IGN)tB9G52riC8Ro%VPXw32)VAa$(vRa(Xev;3 z0#cG7t2lwffh5=s`38z*(uQct^)vn7qc?kRaACpBQPX4LS3fT-*GNX`{k?2{NeQQz z_SfRlm6|J;o!iTa;bBp_v-mB~`^UvV>f{P4IO<99Q#hL|m6^rCW z6j$2A+ykCeQQ2ngq;a;PvE$tPrcK^qt|(cpYOl`ytkfv%au?O8G6nJSWHbr#d*rhn zi{JWxF3ZTDY_BNStJxRbWzF$)VunR3bCb)&8UF~-yVf;ZFV3>0 z=O+tjKdxO-v8z4=W}F=%+YmSY)yg*wamkRxpUCu%TZ-5Gs1IZ;fKV7p1-TwZLr%MC z>)5fgl{TFN-pq39jW9uGz06xG?hnfF{^wSlNP4I0?-RoX6>%Ac3aUAmRb>{z>)Ey0 zWu?x^f&e_G%@)7Z(3^T=|I*5CsjO|&^n{`b4)-`lzd?+03|UAZ$Q^Eixk$2KVK7&` z>K{7XMb85@A1J4IC3H?pGG+Qf#OA})x{HifFKp-3McxnV8+6t8z6%lA0>2io=L z%kNSfA=--927HGBRsk8)P;<{yKdhZm2lK{?^U`Y^%ZL4+;v*ne8TIkd`pT<7<0alt zPv}*Uq^hbbi(ez)e2Pcf!4SPKB7HNRep!ILmtNy6mv1Yc(&q$vy65KimwW3ynUQQu z6MKPAPXKmSl67S{<|fX3Q11AlaDD<`;zO;aTV)2sSl)%G_d*JaK2w1*|ND_Tijp7PM*z=KO-lbD=%B09wjFW~#0UICwT( z=}pYwI*^TYlQdl4Rh6zBi!PcVE`yn}{G!SDzy8w1+St~#nlvf$&hRa;rQjgjG||Xu zXIm6%E?}0HV3hh&#QF@o-iK0|g9aVPd<5DqF7m1cjs2Dgb_&ng;=^lb_Z46AzXc{- z?{D|_w|@t7z38P4d#Y|d=9fMzQq*e!{0p=(gTEzm%pW-qT6qy zAW=)w&xOY?amHQ>?zY|iUs7i*xBK}GA^X;JvCZhdb0g?}NyND$&;-e7es){Lz2vo% zfTP#V2o;519L1k{Q6(E()L2yU;X&}!hpH&`4QAkrqOe>P`{+k$iFB(T>yIMR+y|m# zVqvb+F!$luUt7gpr@_Ie!=5UbttzD-TMe^S0~Ke++mJCenN|`AM*jwcgDX=yvG4z6 z*SJ5YUBYfh<@;u1tyEiN7EmahyUMys$kPk`(^RF^>o0T(01P;Zn3+}x+0R`2hBRTV zk=}1@YO#39{!{_u5dQ0`d(*XP4spbqAi$ma(t z8s%DzA1769B4qxtzfb=Bsg`cz>fG!WyK;o@7%g~lsA>XI{>thH`H*sV<=B8zy zOeRv8MzP#YsZ^TEBvcbI8-zFS>KS99Kx2~>X@!veis2Xqs?i@dF#1e&)g}{iX^m!! z@H)eF4(98s-=}NiQ?|2sZ$trHQzridc)3s}E~m=;{?cGjJi}dFE>*BC=^yZpdH#Xa zB{vlEG_BmK7CFheS>;;48|~%>;?3!Y7%8=HuJOfRAI!U3;6~MRsJxOQ4Fu2SI8%ML zUEb?1QFE<2K9!R^(7%wKD~5IXAATXy29c}_aO2iw_kxREAxy4$_)+ve$gsrmto&l9aAo zuhrr9e{>5W2lf-D;;}vd#Z?jq`yOsuD|*aX#V%!bK7cO7T?8vS9h z8!_%wmJz{{?*x+^N8RY^JS<^S|Ld7KViGF}AHd=#8?pftj9QwHa9Yg3cXvi@o)R3n zfPx=$(c5dz26A|^wmJnW%}@b(TDK5X#=4IFLuakESi!}S?~}^o1eM#Fh1w{+GU|_B zxjHIg#aF~~tClf5sZo;372_Gl4xV(fbx{wM8Cwa-sNPEd1YutTBbP(^dHA^#=at@m z-2)3*RvOmMT3HHq+}Q`INZ?d{VfO!da)~0McCMu%`j_LZThb_NS@zJVKe{T#iqC0| zgINPGE6G%pkY){l2ETs|;0xnnIr5i!Fj^87W^p46ly5i869-^68Sz@2?u!b_)&#|6 zi3IUYcL_BofR_DM1OxboLo7yXWA!GMME4q0MG7KacgHsidUK4T=5`F~WY1r=U4Hu2=; z;se3CTZ&Tdhp3)0fq@??H5~XbSedfWB+n%3G78O^#bhPVp5C%g|A|Mdo!iT$Ida#& zo}x%WGcHrwcASMgd%1Ea~0GNx%IvcLal>+|6yA z^0gy2$}C!lU5LS~!=l$=Fbls%V;1-d1(2*5)blX%wKFS&xVy*Z8$_(h?LDQ~M$V zm97FYx1ozqPxdbELYo&BlkSiG_Wk6V0k(Nj33$ME&h|5Qb~S(QIip6k(_F#SXe*fx zGq2isQ8Ke4v)3w`r`ko}3tjji)uT>=oCJaBr4Lf3lf?UOIZ<#xNS|@@q^l*{(GZ=W z3O|O*f(|C-Etd5uK5o`b!gmV7g?d_kfr>&=6y!4)6QPj5;oeuF-6s|PZ#6Hxio~7+ zCORkX-?iPjy$_9kI#XcZJ599t#wf0fG%L-)Pb&1QL#E|c3*hiiga$K|P#0ttnKg{o;b(0W}9G$Nf-QPl{$1Y(Fjez9Qja| zh+4`r7OQ8Y4bRM&`5_a5uG^#2Py!iNGFSP@noB>A#nkbG*K`Z5iw40ayWE*_vnj(J*^&Uw$e62SS%_y$4S{uuw3r77HaA8Y zABu)jGC(3ttLPQ5KK@m;+e;!JQ6*oERNm}}yT<{CiLm3abx2ep4qNyses|JOzjn{B z>+P@Z4>pO;p9siQ`F&lP8Fj203`auo z8Z?_Xr_iK~KekY>>Lr)F7Hjtu0piDcL=M z3z#xZF?IUXzGVbl}=)LxT&)Q=JrW0bp(x5K{kP;MI>Ro)WJ z7Yxc$u&l+F}mK%p*oA2{(?@p>Lp3=LLpKTQSs= zyp|Z*@`|^!abATMDZ%(3kG(0zz`?@ng;C%~G#tw1?$eTzJI*x=S~j&oxn^kc*JLi^ z1oeHnR!2KOdmpD1THU-Fgcge1gfi0U#iI1uNuJ+_Kd*)>WoP4fC3Jz?VU(%iMXbrG zt{9vJOgqg&x8i*XxClX}_o*JPHD(9$Fm8DmVnKE@2yszni(rMFJo=d&%$-bcr~J_c z9Q1rkrz6o&E?a^MdKshc%$>LH0Juy$6-4F9r%Lt%Z52v+#*P*-%f_B+sV>!L3O^r- z*-QP*FK26h!mI6eL0x*gu#dswKBWZk)!?KY6b^-wHQn2t+t)nOg$_f$b&w5*T4X8c zny#-pCgC7aw!GQOz7@E0?(Y*)Ag_`e)X1n=Fba{H@G?1136Ji$z&A(~U5pwY2C@;5 z8_}YdAZdnXG#&~?rvXj`%pXmKCu2|~EUF)p*c0MWTET8 z*%8_RHtjn`TB0o7G7=sNg)>l4e3{#YYx6rU`w>a3FDAurVG9}=m*N_pMx2&yHUu_> zOz^-gz{IPDS2NZF{Z0Z@KsM3fjmAr)7L*~rf6qd2F{p+V(g!s2K!V^@TjCj7aCfEe zTTlu`*xF*bDObtpwwW|xmUVMtZ?qur2*j&Z0~8KNK^ZEvghlnJfqH)qdqRGCUQbZ{ zNe^@B{n{}e6$nX@Lk4#>kj?H4q~~?y32#0-=h0Rb=s_|E&nHvRXm(R`uhdkNV`*Z{ z^H8By;yr!Xk^}E;aLABj60p~ zjyI-nU7{PDaWolEqu|jD3TifAFx$lw8d}FpvnVsrdT$n>$E6YaW)~eN%n@g?A4r&L zodN>;v*HKwof1AF(Hm$=yEu;5Se%}y=%V)|W33jx*O9F2o4s}1Wh5! z*p=x?F8ZnorL^WL@*K^9veEd(2R+xl!Rtwu`2$?qk>>lld;}prbiTrObT-b*)W+i% z4qu9KG-t1KFVtS{b8{&V)6mAId3Y|@l4`f?4cRJF%urX3-N|@a-a0DcoSf4*(FVGr zp?EwTIyee6zr*x|i|l0iWzn%qQS*RmI-H9$6%#T|)}sav%YN92H8l~mCi~~>ulGAy zTqCcBF#&eIPDy1p=&s)$J*QAcCY zC@#+O0Op^y2qpB(sfSlAe)B&mc;EQ3Fx(%%zFmQUPaZ!Rp7wJtXc#~2mX@^fF69QK zGuuRq(5akHo0(t}@jU&|nq|1gSW!*$tHLhM|8GIKASdVlB*`_bqvhf1v$)nCk`1bzOL?#|T%- zOvDWork+`2b=C7Nw3sTmWAk*f&_cP5v1S;~Ss>W=N&;XQ@;R9s;(m!B0CJNQ&>h*T z@Q)(6im5csD^AJzgRq1ev&xNkH~}@%`^8y1psOd!y>mzYYL3*R5RvD?u=yxRr@me z0D2wMD$nw3%}Fz6Ca-`s>g{vm}Z(u)VF!csJaUc&d>q3mz>FCV^4Kj0P~`0My^Bg{n<-h}?f)HId^T&kLatY)Gny=|$y z3vwirX+ae;%+hR+(wx*@r7-G{2dlt)lI@tof6i6&lssLVI{g-Zx`uzv?zGZtT5f+z z-U#3a+QVOVWn9s{&q9igQS`}Sz-sfxP!E7Qui3}U;UyM@#RAy#JScN5GSh|}(1oYy zWYKRgxM5Zp()@O)CXn7=sggfN6t`t7)Yq)R-zp@N@8qep(^TK}C5Bg#$Z=ER1g z`&D`IaX8XB9Y$VuP|%+jX_Z^k0!xu0FEY#yz}fF#D|j?v>1==LSZP+;vMrbzZ;~f1 za3{=JIs#MqBx)bAPV37yg?6S?-YMd2ehbs_@HK8qLk?dPy9nfHP1iuDBLf-1<%iA_nJZh`_Pre7o|D*o^_>=kr{yq>S zO#Fl2P4ckd8Z~t~s_M>Rl0R2k ziT*{Q^703>kh3GRmv2**=4%_VD!MlzX>%sa0xzISboN}6Nsm4d7Zo`*Wqm}QWixo~ z`GQ%FvWP+{`p!nu#A)Uow$H5yPF!J2>~7p1XZz2c?oL2HIW8|nyAv-H%j60wb(_RN zsmn!G5nszQ-pehNFlcTi<69?c5LXL!OeUyh0Qp85508Ys3HPhWz zc%h&8lIEfi_bKC(P3_j)k)gQ<@ucHCoz0PME&}f=OpvYpzl-o;8HLUlaw|)ozX9L^ zp6SzNS=pL*F5G{gGgw!N90ws=_RLR-Ex)FI5-igFhuQK|0tBcnE_&=bAT$8@I(-vw ztE0WrkQo4K!nw?DQ)!ttkA6hrAlGKeGt6SS#l~+$_NwDIKX^QXFbj&_*+{AV2T+y+ zsXSW&s@4-hsWs$;CB{WJJCK=LqZ65_sTTjh(EcGb@#giY0PWachV7z^fJi^LuX_+Z^Gm6%&1mq5KS*uvh$ihyz#&k?sp0z>6asp zkT26TZ^h)YSJs5_&mB2n)BSrz~lgeXvO8Tzcm=O1*VE0r1 z!P$gn@fOwif5nI`1FZ+3*j9d-YzKWFR_+)Dul(fU%OMKS+Ve#3d6);1T9(7NH;vi~ z9zTm)uP z7o;|)`TT|Ua@kyOxJn>Tj_c>0bK2-nMc(qrT55vQEi8?L)#9!zp9Af@>CfD(fKiQX zwS(DUQBc6IP4O%Q9VUU?3cWW&pH2bD>3okWBTYwyHoKvTbdpwiDhuoz7$wiCCQybr zqE%4oBiD#gkMO4O|8+^n|3{#)1P4H+d&_!aRqL^12} z%tKC@oD04S*BDC!=iie9PMA|Yh{br79I zzeNcgbI=6B`H~k|ifk+uB^sr89qk(xBqO~_9X$wdo#-&+$Y>jcG0VxEqGYTS0{H4E zGUq#2u=ju!N67-rnXbmzgjBx_G)ISv08Gu@ z6>atK8rGMPSH6h~oZ^iRx*$D*p8&I^H{~}u$K0qCw~?eBkWTrtkXRIbCLOQ+yLF{H z0caDM$| z9Id!4W;;ous^7;-u#MNHQ)n06nsNRNx7OJtgMJmzL$r5N4()2j21wLLnkyFP@`qLb z0`lh}aVYw98pVD=v|N)WfE$vF8i`!oraayzD6z0|Y)AXb#xBIv`Z2YaV77~dUZZ)& zS5T1$J(*^an#9!sQwQA!t32=pq=UNf%5OYh*Q6{rpfV**pK122h(TsY_jlS`rmwgO zF6SY%?4OHZ*+9II4X5-s6#3f~oP#Z5Qhm8O(;*sgfFZhHl=RJT`ei}#DMpR6T)Hhh zrPm4cOe&Xyz+};{XuMe5+<7SB4JQY-PXo?XGI&I;P9NSkEGU_9^gqu=w zaw^#gC8+zD-GstFik+>w62z9Rcyrb5B*exW(R6tCs2k|6woTrzv`;U9Sn4?rh9ErT zOvjYvIIX#6+Nbyk@)&1_x|y|mbW%N6kJiaorPWkgT}n__o}EefMn03A9KG{#^!UT$ zwAt1lC`Nw`x^f&Z9om-}McM`G8T4E8kc$ip%xn56E_2HpR#=HEADUoY(`h)D=`&Y5 zbU>|vm_<&4r~+&%Os=NGJG7|vZ@%pSe{&V28!Kih2g1B~I`@`9e-z694B4}y3TA0Y zvwpmKu=F6%Gx$#Fe#fSp*<+GhKU)%VYs!g#QMb8y+hWaW zI$F|IH&IDC87HY$awl!Ko4*tJ73BuMB6OX5UeR-{6@MrcT%)EypI%_LlW#JH~=YER!|8_)n_**BB*qep# z>iFVz!PzVRqxnyQUL!2x)T~eOU&}LQKK9RaikZ4H&R3DO)kG<5!ftEH9*f#y@%LzF zMo$&hdXa?yvT)__Dm}ImfQ#?m!Aa)%qD6nTuY|k)usW2{v^69N$hu)G*=JFG%QC7t zi}GH$UBbOGG9mU!D0cUSh8%3VekdyJMo$!na|}(I0Dw8Bza*-6$CkBH4b*~aoe%Eq z4qjx1PP1GqX$Qdg4S#>TVrF#rD(wu|VoO)$RfJ0HtO<^yX1RkN6M(xm-=HY$Jdp)m zBsH4kT7)%mb`WfD1k4772}T*LIrxINI1A3Q!t)Nc@j_mgGc4?Lb zc~Vg(ea*ZzG+NccC~wEK>D5|i4R4NrY;lbbI=JQYp`LV?q)xp&zp`GcpxmI)0>)hC zlN>_dO_rO0spSGIX zkwxtcg{U+uSLfq&M>)!2#@})?wOnWWq(sl#R>>HRh-F(h{Ec)DXH zEd5g5+iSvT`XH~;Mv{h08X`tsx1*#+V@SdY@Q!=Me6o??=4SnYrM%^$9N?1= zdUYeGBBa{@)g+?)PYm#>NFcx0`F z7`|uiPN*n)=mgCd{ldI4(${VQdpa}7ey`%a?(rWqQ_{%*>9-YHAoqzWRrHk}U@wLo zv|nm}`oT14SUTd0i3tS~2$ORO6W*=xS&|5u77UE=I$mycwHuFh`v@}uI=9#gVV7$S~A80D_H32am}DsTXMp}nQaWP`$8=}wKb z7~2tzHGtdgh}>g3vFL||dtRt`9y9iH@yN~9vsUC3FC#KLWZ!Cr>P>idI`Xx(AVld7 zM%Db8YoNOlP7PTQT#1{*?Keu=P}e;q5r}3(VsPp1Vrvp&2Fx~w_(pLd(UOnS4@!5F zXXzx2;?0GJnjyMp#q{eEyha3qDs!I;fK_~<;< zsQlcrye(|Rsxx=#;S39Hg@-h&{RbSl{q2B?@4H5f0x8s~4#im)epq#_ZdSLJX!Pn& zUhGukN&djEqyP5O8@++1lQj(T=ecL}nD@8vEQyZW2kd4ZY7bYf%~+{Xw4;aT^=oFESdaF zbG@j{{qV8i=o6T0e%Z@c3*)ss6YgpmGm~8b*gCjg%)6_>Cs@u|A4_I|QI3OLCt)$e zBGB8U`7-Cxk%K>+d|VK6^=%~XH;THUfnicq`7N~!rO*iLdtq1zenP^vY$G{d@#JJe zMsv|9G}?Ir#QJw-6or$RzfuwYCrPcYM)6?hWG7L)K(a3@S|&MwCZIj1wDZ3yo&Hdj zQ8zslE_iVafBI#GOrYQ{yVR0N@I1WDPD-B+w?Xya@Lz^!>GpBO6dTP&=BIAAo2v%FR`v&`Rt zxH#O6{ureIV$R)g`ROJ&|rZFGc$(p$WW$( z-VU+V^LJU-b*%IINVoUQXI&@&K30-Ip-}XPk{fOrk-*PE+q%n7<<&mi$OvsHVjF{F z<@BrfTR^Pv-?biAj-+waLnbZf`h*_%j)Qf@G(eV%+WH6;r0| zZvMNkS<2Y#W^R@o?}Iz0mJsqk%e<^Zx#C^LKi+rv&0_rTP&!F0ED6gTx|JFdC&d#c z^VUp-MPIW3KWXd(1KPLg~GH18H}KX`K2f7r~j(z@n89B zbAP|8YvDH%<1YVpx_5C`qGe&z{|V5`zg?SLGna2!H0xR3xbpW7C8)BkPW|cjZ$HJm zqdvnsuH@U;WxD_2$VQp*BZ(Tnxc@P#lFXeJ`g#jaq9rN}bHB2on8?h-s7Gw=OgoqK zL8j7lb`}3U>6_8Y$&;7H2DwH7U4Oz(P%-~Rto>olh!y5TR~XS1XKQ7|LOm|8b6O1a ze?@pX#0}!j7u^`MyE2?pK^4o)@D`CRKr&)J=^Q3B)s)(<{F`cekjO_^J4|F5{YljW z=x0X6LV+uCKok8=C*UhJhCT z%*TCZaPy7^W*_=)3weQ`yukj@CgHGY#uDR(vKelw6~2ONl;>s|qnaI*GCPTtyU^4K z73RC5qMVFh6lM2m?z}HbiWZ8}@q|Nq?SIUZ$kal}a_SwbQ85v;El?-JEy>gFQtRVV zYAdgL8ZQa2JR(;@k}E1MUktV24_;;9`}!w1`N)L1Y#)2BwS3B%j4IFtu7;h6;h%#j4dC*tHf{IbWYsE;P9r zHTX8x(mxCQ)-DA-)jtWwrzMET&#@tx2~Z=64sb#RIagAy?13@`q>$2?>LUXSc5t8S%APV5KE7z5B@#=DO$ewIbOC=iQU(N zzH=#H1@U)HeI|#4^)M~2@feP~KP3>uG&-EjbvgIOt54rk1`u-AT=|tX*O@i9$GL)E zcG~&ae9~!NHN&}?U-r$5KLVDmH*-w`|C4q#pMU?X<#}1my`1g8D=a92PhniyKi;N# zEo$Ic-M*Hyq@p-d@#jgAi()|`6chW~!}brL`evx+9}&#@FJt@D(;rP08EhCrXV4!= zt=>CxK~=V$@|V=j-Hwf~msQuPtT&d;u*(4(2sck-k#Q6Pk%Gfghy;rE!TQe`vVCf0 zSpNb0knG8c(56&`D8u-RT{K#gER|r=lEkyKaX8 zuQag9ooNH=lcbMsza)_@@Do z+D6tYHE0RFcI9ik0;Ahr_urAvCcn5SANJJ1rj0q!TlwFe>q=e`Q=uO81>7SS?43> zbZ7=6?Sfj{-?MyXGJ9hNB*l_qM@^xe!pys+CeoLGomg3Oy~gTb57ujTTq+arQ8E>& zEo1W;IIfiD$v-yzRv~k zJ~)QwB@Zw&BnZUWdg>MqAlo_qz;*_1UuM`D61Se@l>5GafSg?NlLVRHAjp1`V!JV) zQGkUXsd@Y-Lkq7{qmVzNmsuM6QpZj)hb z5Mf(%H}AzrrDq&fnsZR9?5`B1((Y4YEI9=G@$5)1ue)p~bK3!}zC76BWExo8 zw|sZWE1Mh zyht0oDJO6l98HtR$_p2dO##<+{0^;s$XvB9TY7IRBCq@Q?X^0Nm$@$;WsWNJa8meZ z$@pF0#9QqcO4?kL;qpGMz6|T-46TObZ4s>x4oL)GGr=qQ(R6s>;&lW+vxE|YcFydv zk0rmfI+^|YTD?A5;*29u$!vEW=plRxzgv{TzN%{OSS?EVnRJ8`?#L2sGVL`P);_D% z45j{kLl}^$FNIgg!#GWa1H5%l#2oBo#4VcUDUFT)>cQJKeJ*_QB7}|Am8)XF}Lb0uH4ND(8sb8CM6cO>#T3Qte7K}Sr1_3NZY6#OTCO!*(_X*Nn1)-e7AA8WXO2WR>o|*>s^bS z?SXx|nDf*GTG>{#W_iYGkjN+mYAMHxx-r=n*76bzfMkWdGR?3>9e{#D;|0#cGx1XZ zD|z69=*$}dtT~g{#6EMtUu)7m-G*XZemb+jltdcsvSCJ1o}g?8yjP^w{;px%yUrqy zAU7wcw9;Pg^R(7hNwSqp6SK4jP!F#wmoi)i&Bpoi_i5|h+zhbxRXjffP*$D%=^lew zc|1W4M&aqCpB>euw`pb@gk{29zWvrZWu;FMv_(2on`O{>@`O~vw@bA$q!>Bs8k{hi z6GI9rD8f0t5?+Zh_Lh$2C~N`bNsWkKm2BSgDyYQ~?cRTrst-P(Jrmmg91dTk!})3vJQFDlZOI(+@-?0*o+j80hM zd3e-95FgS>=K;;GwZs8h-BVrNh*wtY)Cx8VtYp&jr;UPem=V?|yZx9Jy9K>EsH@cq zQ5)5sQ9t}w3cNip9@-{SsnRc>mv@jImi9RF9a}w7pMhm8v*1K6AXUr)jL}Fks9+bt zNGr0kiw1N$j0}6Z-DP8CNA>Rk@|v!_@xxM{4#SV;EpQm%GsH9nMY6&$*(ig@hKpb& zCosvV_E=)q8cCbgva+s<{+qsu=RtFNnG$p6E2H$_K!zeN{H5)-ykDs(%C5vKygi$; z`@*}Tg2UEIubY)zX_`uZ#bk9n_1I`#_&tTEn12`hJ5BwQSu%OG=JWG&;M4D?@B23# z{`)Wc&42vlxBq!b`qvS^|4aVsCFMi-$PG&#F6-md7V?>;q4@*E8AgusCrQ5^y8~ms zcm0LNvjX+caR>5!GFi2S@qt}*B<2XODt2#`ct;uS*eYvScK?i0^PjattqkdwiR36~ z5u6x2gb(812rkf<0*$Q$h=gUe{6}mV#86HG#Xq@2C_SN^EKL zVzkgf5B>k$)&an}0+IkQ0swL=LkR$)6_6$%LxBAJGkFj%C?`kTi{=9A80^KPS6w4N zUjLI6hC2)x1cELU7M<*q?>{4{_7G}D)Ai0H3guukWleyLOF(t1hnX9--QB zM@H)1Ll%#4#2Qf!)9SAT4bv`&1)@`(&>^=c;!u%;b0w|VDj_v)h&;GZ*&)p<(=KU4 z{Um8C^Y#K(*FH8(&A-fG8RQ9tn0BV{KQBp75u8=w17CDB#zD)ZML(=63NK^(6A874k92}l&;`DymV$Xm!U3fd|qA@IdNL?w{q!CRf)sRIpa!5Y*SouHguoK?gbDM$H z%}cC=j7s7C3q1qzdMw2bbe4lUQ^n$;Z@Ov`L}w=D;^}tBS4pDAuiia?TR7C3qIKv_ z8u}c^(BXA%M#|MXmjL~;@u29GpGdH$Z=)z46@LA8zQ!9R>IBRy^TikZVx#IR)`W_> z1>z(wU=`Q!B;JEh;7j-ce)(nMI=o+1NU9uqe4^lUU29HRvdLKaw>xl+@CfSKJEqdp zD6yX(bq!Cv7_=_pK*h4i2tgv`u4uuYUFAX5oE(ftb54U%Eai_=r|L z%7&=ei3s%_&!p@7CED`Eou+(Rw_h9X>By*{?oip&00DS%|Ci_h9eZI5Z5YP@TPGRH zwq>1&e~WRb*B3Z#MzJKSmiQxehw9r!4o!?#yZYLe$`_a_cJTt7;MfTLZ*asNbmarJ?1XJNj1lAC|x zsex~QaDVM%Z~nA&-x}}=OI}C38SlVH@f^O5Kfs^iU;az*75>J{i*WWDb(H?4)7p33 z{2Yw*=?4Q$Jrn#Tz~*zPx*^Ic5zp)6S`_(-i|P#VO1!>?4?u$k4cfBdc&&Ag(z^Zj z@Eff5Jch5AwjQy#nok(pw|I!R_z<6n;kR9Jfw#}w^Y#FXKy<(9AWe4b?VlFM_}lvS zBECL6`%Zj;u85LIE8n=4$Cp9l9U~g)mWddkWBxy(ECQCH3&jA6F%;7%A|Td4phoUT zfbOTW6h#O={uh&bWtdhsz;D|ch~bJUB&2U1sXyf8G0!-_!FIr)7JmmQNpn(~6{QO> zeU<`}i>H?vd2mw@5j=3SQfhn-kT<>O1H{0H@^>(y*#!+D zOb?IIkReQ`V?BQPGEkNFnJq)Mhgh(VwYX*$ZK?H>6yBKF!JPvC8%@rOSDgX!oul>q zIB}awcV$PSQ(v@b_3*t1_jtYyJ30!zR_ z@bIp{!Jxb<7getMbZ0fdLd`qhl1SE2`Joiy$Mrb=1i^5nIG{+`)qa_bq}2rWtUdcL6V8>hT{N zm6cu1Pjn%DVlv54k*dkNdIgP92g^w+tWZduz}q`sYG`k~nCFqABx(ie!vl>sD+n$J zW1g)K^ibLcLEFREfk?PZLHtm(e{rCfBJ*R#m7aVb>R6n2rt<%2rt5|~^uX|hUiR^; zO5#N)mY^5G2r-FyEGr@iC%X{r1zw{!rL!f4l9C5nQRL{2RSUPitEgDgC=jyXxi84e-%KoXp7+g{oOCF9v)p0 z9OM?I;*sUJ6agV3d`o;;K9($wJR^rQ8^=w;LU|KK+;EdO(&vVorZL-r^k}Fd{WW?6 zkI<%ue9>JzdOGt2jz+}f{@S9v47c^F_{UK-1lCzJ#FNhZmEqR!wKU&;nx!kV6G$J- z%1fsRx2sFn_Gh}Ry9_$Z6HQvc3ubwWh3Xj1j1bBHao7$pWpSgE1OtY0kP7gs6OkDv zT^q^JBzXiu!JKZ!#7^ACy>kWGn;C@Uj>tHBi^Y8X!pT#;L`}*f)=aMRvaD?8r$LM| z5(^NqYLj**q+=Ts!Wc*kyvIVxLQ4|4LO9We35=6OA4$?aZ0TS}(02GFi;^dbR2B}r zZD5y?!@$D}0l^h?c*?}~L<344um|7yWpMvI<&WS$5Yaeh5PR}!qjmF)_3Y5E<(40R4!WCAu_z5HKB^8gXqB!CNPUdtYZt;aR(0;s(BED5^?cW(NGqaeDz~!1y zQlx||vK~Nsi0crC0bSy9q2|Om4{T{=LtF{AGZrf|rt>OgdB>k=Ax+wwPPP-IDXZAN zN=AIn-i65r`$)GZyBR{`eT%S#<~nf)4_bKI8zMw#=vPHFK1AUTe$c~Q-lr21Eg4+W~@POt*s}Q|pCg&yafN2$r zV@x?-tu3sV#ONc+#1uCp+C{`j#FcWhUDmiU-HEv;^%)2ovO+~uTGepfqqwPPi)B}2 zot7T%YYXmow7yyPMWiNLrT7=^iM+Q=Cav_da*=8OofLpPb0SwkFhm0#1xK};@qNC} zgVd%*hXx|InEa4;I2qg|Fo3c^9=Dh-1t+4S6Rja@SMAU*D7_CF=tF1@)AC~opF%!g z8WB90vVpK1MF?$_Ygh^t+q92Goo{1NLENk02{Q7OZV!n7I zxK}4b8KV2QtWp*I;f%7angw!@KMyiUF}t!8_uevqLyYt4;fcC|u> z2wZ6lI747bZ}X{Plz}#i5WQLyemg3MIpG7L0Q?R0T5x{!?^}dTB-e=BbYJqVw;KxM z+7FW{2(Z}4#HiLgW{v$FUpd8s5FtW@QM<)h8^KraXrNwApWtXP5{+m>SA}%w&xsr{ z7JCCRq3j8$ouuVMuB+2`>lXKtq$0i}m?{z zjyGG!mYU`DEh}OxzuF0E~FMGSu z+!hDyZd{tcu3bCfA9}~FM=Pf#x58KV8ItLJ1;b?k_zv-h_;dX07ts|#I^w1Mo-Vf%>8Ut{-${#IeX6ERMd~RUMDfg@DVrF}h1U#M2=*{C7e~Z<3+ZRBLe{ zHnZUSJsJ4;!#}ivH;SE66?i6E$@4O(einTQZOE*bcF1*+8x^vIEe7~jFw-us9b&`3 zC>EmN!o2Jm*V*GA|GllWD91GI3k*V=z_L0(=EZ{ie#$kA zuqr$*!m%jNWr!Se6P7hd8%&fGeo;cDB zVlI|q#0zjr&+p84e45|M3!m~GH{5W8CO4e+&1zmZwZbeM4$o;w0XscH(Q%x^>=?DR z|K;ys?s?jYHeN;NTX!4YM(W$rPHz|Wy!|kEatWb8c&K|4c4(#>%J;{YUv$uN{Jhx- z$wsMVa2H7*WH+%uJ^zl?gI0#?1^+BR_%i?KzMPRAMosaEdlu9@2`BwCO^DuWQVJ|Gk;PSf^_a-+5U&=trgN&cjL82!Ru!H zO|njp%LAW(4K~K%!olDs$*a>1>OMKyy}G_{dLPC&b)(6+AC4wptE8kh%0d5c1ufc2kT^~ zo5ixeBIi?>ew@>_mzn2gpEu4=urp?Zo5&j-@yA8b~4Zffri(2_-!N@jxvL zFAE2{kt*%!|Iqq${zN9Fx9R>#N*E~$8CY{9j@|v~h^A@~9uz56xf{?KGx?6fR4y1I zv%$z7LE7uT@)Y<(@>PA*7(gKR6$}s%p$G;XoIepF)+rA=On=EMK6ku&*2nuZ;vQ?8 zI|&0)X9hb@;hcXu2BXs5CRvKHn06CJ!0`^j8P6<`3ueUmuEzp!EVOjGG>#f_GdhCg zVnkF2(*NGAui=I^6q-6|1L-0LFjn9sxT$C?XGHpp%e3Y-hc*!wV`2E|gE>>B&vqbo zOF5|e3uVN1LR68JBF;4%1jTY>A&B1EAOCcP9E!zWf9^0iW)3vS@IFm$QRWm12%I^? z3-V7BX-@BJ5wwDI68$tPj<9j`ic#cqUwHDD)w7A7WI;~V@lwN4^t!g6zKNh+wUgTF)CRp~&^H8rL zy@>910$F4hI6X?7rvN5Qm}GXcw7ceL5tmD#<}hDV*j9{Zivzd+ie%U>g;~3^+Vl9| ziC`5hgwKj3Bma(*644w>_rsNTtJ+x<6=_@54O}S-c_)j}8NR?!iS1@x^B)x7aD$>doZLnXnM9(_CNwxUIXT4V=s0}|2>CnMWLb?AQ|u$75j{o*?k4UO^kcQBRq?+&L9H@1Ox;`XpuP6i9q%H;9TvN zxDL?bT|AGIl3{a>YdgY248)`1rHU?7uwc~(uDaz*zxK^T)czY|qf1Vxx&h`2+;q<) z&qmlnip_IZo|J<%;1ZrGvtZQ+uDaz*zb@ZwEU4Ixh2ydXVs{>0e-EguNM=k_!lr9( zyYI0VT+apmOAJ9~^JogsZ8-fYKP0PB9iW#|m?tE1%!C~s=)sVpW7RW%%>tY5IP?q5 z5uOc>NVMr($cSJrBCbb+Ae$JCPi`aJCm!R4!c}m>f?x!y1~N?GgaCwtjZ&P%Wei{( zFY$xcg{}z+oQqEli(-&IC^}m|A(xM%eh&X+Z@-0CLxN<)rs~l_VAG8(@+ANO00000 z6cuv~nbzhfdo;#|{5;0m8Tu|R?IXItE7A*7ahkFrpFk!MuI*m|0)9ioy z|4@8?D5C-raX^a$MQyG_a|XpQ?}AxCM7IV)vzG2J*JxOemPN-GM)gMj_IQ0wVo756 z=17Z0jLbMst%+Sgk`?hN6uD#DeZMqYZgttA02SWagsr;9yw4WTlrY(e(Wi8FBKUzjJTEX}T ztMg7OA1@KN4A;M*3I+@|sEWXT6o60CKbfWQISco*TJgH)jM%x=_C9IP*`Xp^8lMj-b#s4g{((_ zWS(S1c4*wY$#Y_#j5~=$-n2`ld*=fgT@R(}o(f_Yrjc2M_;C;V|4LQ#U2?JNr1e|4!deEfogEB@Y`DZf+k#;E>oDj#f&uG?Z^Tp~&PQ(p24< z=&CgQEFi(6RP-_oSTj-m4{0Zr7C5_)IK{}EtqauSYfiESa{Mc(VEN8Ma#W#3{LKD_ zDagYN_ejh5lchK(DiFj=FIq}#WQn$(i zfXp>u2EpW_u7n&UNG3^6^x<=Y7$FgWXq#VeE+gAdQEYFr!JRo841PfY3KUbMAQ;E+ zonSG7H!=WQG)M=jfiVh`4@u;R8-|Dxkq4F#hw)IveKcVE?JE!{A%w-_&;WXx23T8WL%gp za=;ed$j^MsMC_ z`#;MN(RX%6UikqgPP#5W^92q<_>-CzJ5MyPz4Z^bBZWq@>Y`6XpCgx%a*;kQn)GYn zz$r)ZO_5fJoRn#5h0&Kj1#ZLbMX$>T#{*{l_0oMTT|ZLWRf=7&e&`j_M~CL0!V#kP z&6V(r*YKhnJ?i8Z@!v7eF&5}giaNI5RxBRZ6lvwxF_U3ctO{!X5#~5gNRS}82m|)j zDr?MqUTX)~Ml0`UMznfXiMDekQl*M{I2i{`PllYyJ&1t01Dsdpng|9s?DW%u2$t8i zQ|Q8Z-U{X+p&0?Glje|t00H7`nu4gBRUMTm|E;0s~i*l9B)BSjgTF@@}~o({c{4zsdSm_;Yib9HNixD9wQ z$R1vUj0+~OQlPZ@E+tND9p-Q=*u=oPN!-nS9Eb{5+Fz_^>Ey&uM5oZ{#|IxHKd~*8 za{>1gTHD5J5mkDpXVqFBB^&P6F>rv;nsf~pt5FlRp=s>Y=}{W3m1fgFl8EYn3H%C* zJ?*@`hzr5IiO!cX{``G&ojzP<7fRViFN!7;JVWT5D9cybP}vL^TfsR+Ws=q>09-~< zq%~Kvo+ftYQWk2(L~ZIOk{zp?a+L)c`C#o7v-Aj)CU7y0w>-aUk2cdvX@!Uv$Lwc# zV_6>)okJf2B90&T9LXEzJbr)JD(PPf|PFN=6l9p->JxMAcvDHINv3H zMt>oBd6wU4TC0jK`io;OVPEE$$C|F~uaxYmON@16`edrI!?%=ELI-o*`I!SA+dUP# zq#q+;ZS2o+yahLQl6)H8!Rz}=4BD(EPlx?o7Q5amLD>yhf_@eWCbqfv86-~Sx^>>IgD%%(jqgx^9U)?GZGd3E=P8qe& zOuwMMvjk>@9UbVw(3^;skQ+S?o(29Tv!ebv-bPA?)#~9?ZX8ns>mjImBH$hbU~FZg z{aJ9yKD=Sx0OkV_aipMZurZEP%mABQ#nBesh;COFy>lR%eTom=5h(#gX9wPQDFKl; zA(9?cGBUHgT*kXG5wC>`MadwYnFCeSIp&zVTy2Q3j_C!%4BVL`793DS^m9Tp8)_70 z4RMrvOfTaAkD5Nt-z~SLRWCcbou0XKK5ls7xXga5-|5r(hPDNdv|v z6*gPpIB22Y0X5wcU}AwelAa0{kK4$xcg9K)Ej@Co=g|txvV^->SwY>3Oj0wA+_RDF zJ=0XhORS||I8Yit^-aXn+80Es;2O?2%Z7${z@QWn*RS)M*L=b!KJkg3h!wwTp0gCH zdmbz(be+a;`Lj}TfB#mH7}-?Tsel@JJ2TwY+`mfcTShk=Mdqg;bQgk~?oy+O>m?6z z%PqIs9by{8Q!c~oAUs>=%;3@tuHwNh@8t(m^RXayU6Q@gC)0AO4K(APkFBkMt&Eko zTR>acC6$vRhq)J^0xDEise-IIl?KcO+bPYoH#gNDs2SZA2f49;fi)thNXS1%#T*5A z_}^b88JA%bV!GzG`yPAIqrR#s_uoXvX4-WdG;T&zg74n5e1Pm^)w8T_-!E<5Ujzki zE4QNp>biX~2S7KhSzudj?~O^Odr;c^W3RC7sUCZ>*O<^H$8a?vs${Z1fP8a43KnFx2P((xrRO~#CE!_`1j;Q zMeQq(nxO)Bl=De(4gY=Jq<2ipw!we_CHhjfj4kItlt`H0WgGg-__&tKB1pvKqH(XY zO@IEs5CD+RDz$Xk2v%4&r8ASkz`%$t?FPFwj-f$EYuDNWCZ88XuCz+#O{^bJ4(clF z0h5@=GG8d}<|&TNY%sGilB17~ikTsSH3@#E{zDpBac|&!ULGvb>o1}Ibcw&G6sr~S zALDr_dko0)7oZaXC?F=>4WJdXp1v%1W;EYtA}|h+#sR7UaR1EDYAmD(n_{yaqI$uU zW1M3TiOM#wh2g;uC%=zwNlyT^fR+>gv)DR_`DI#scSngL`NDDpg!N5DF|da@rdlYq zV|8}QXAJ>7hMTxG`aJR7*O(X{F3A!A0Khqgyh#u8*!TqzD{Ch>r`8osq%x$pG8Q!B zr~v864N<`?HXhjNp9EDi=s^aPl`AjJ2AbaU#fb>Aoq%LoKtd-Drd}dS8U~m84u1YS z5Z({BV?X(G{6_BsTRtB0CHp4cpco%l#>%T{^ zwrVT{a)J{XuBRg5N4PnsZFOFCpWca+u1l<74FhccAY&>$?&s7?GHu*xaXBtt5B%Wt zHqN;i4JjAEy?fGC>Pn@lh}(q{x}FL0JP-6-NuaKzQ03L^a5<8n2F26t)z@dDWsh*X zXGWHfzcL+cdJbR2r|V&Ex_KOL&OgR+(sGrB*rO-J%NkDN0&*dp&)tWQdN-%ET7Z%F zbY8C#`ANqm%99&H?h+5_snDojZmZE5ENF%cy%@nH=9PF57jSv-2~)U8t7D)^SRJ~` zIM!!ef>=+XK|sACV!or#l5-_Sf&>XCScMikbm-8bLx)}f@5IOOIecd!<%<8#K1$lF zMf1}`p=5@K;STme8N>?Vi{r_vU>sOCK)QeSY`Ki7a*J-kx1PG}G4z_Sov5;nDS2bK z{D>s^-~!I^rA2W%*`Tv8(eb+iBODWa9eHVxO6Em$VH`8?@H_>Z?i&6#T|jtHatEu# z{K~p~d5k#S(iQA3`Qh#+WlXAsgoK1#_K|G&B8lPPqp=s{pFYvD%n@;Fm0?reFVxBM z-l-s@lmKBx%!cGE!cb#VpDmV!9|44UMXGjmc^Tax?&4u#3u>Lm`Q|6WyCR4Qd5;8o zo|%1{Eu*VAsaPwrf^YmRM4isNxRXy(D_#a@?gTm=(s3Z+0~P>ZXGM9CrzYmj2Pk+H zhAuL<0RgKoN{TFtOrB-KwQj#h10@lh=smA1d0{GiWMl1;9|4Zcj21n{_6h8MlapeT zZNj_1IIWf(s<`<}a>NpnNaA$BrALpKv|YCAfO!;#F1TAeflqp?Tr<$I;BEyA)1})m zYAZzQoVA7LKI(`2P~uAM>UiS{`mvu<;6ZIHjQs(dYIC?A&8{KO6YRCV7b4W;s(tig-*|HWhP)Rh~5C06uct3*fCQ!M|7Wok2a}<`a#Bd z8$82rkzaoDbC55Hf13O|O`(8xz5a~frLI-YAWVMDR`SZ{TDy509-;$L8#X zq)(Cbtz4wki^@=WQDRQiRnP$k2L}fyPR(JNRM_Zq!`JxTo&Vy47^#*~4e<&N;Bfuc zo4VKe$aoDl0vkhb26?Af^qpL4X`;jGnd>85U8{c>;pCFLeM1igAK&57uNmVoj%&{b zx8{4@WOw2>jf8Ee=z1|kZ_0`x@og|1dIgWR|NJLo zrZT+fh(;>}dbw{&^U`L)e}2xk!IxjV$$|g!f2cx0L8ir>kX{nbS_Wq!tw!Oyh2EH#dusSYBW%BM?H|_1pojb;H6eKtw?*8hN$>OphTjs zStoW377?+xHc~Gdg_|&j1|$2OfVqB(_3 zyoS`o`XszD>XlhKMh+i8f|*S{>B^RRLU}}bL^S2~OJ>&3KtvFIf|s;qXwDJx7~w%W zN>6X8HI>^4q>%>ty^cHp0001zk`#tIPVxlBYY`8ye|BJBz*d(Kpg?$Us?4phQ9A(d zxy5f(M$;vXTv6gaI%DZqb%v+K#od=^Y{-(9sXEMoEaFouz7DL{F5iKYU?axlF$yCw zI6{NseSJ=aEQ&LH<3A%9#oAdvvwNJw zsI7==YRU_t#Z9rf@vCJsuD{pte4U^3s$Ed4_e%zO^d<|0Zsg=jcPAN>#f^#=o=!v8 zf;5oLl;7BK={l@bAFQ{Jm+D=G_#-7`y*0?Z#)-wbscRHJqZ9eb6_{w2DGQFX_=Lh@ z^N%YPWET@j>qZWaXWue#M9DPzc~0XI>qR%B4}J;=nek9(q2n8&bF!aDv+)b3yB9K% zB+>pd`q6pSN8%{puhnr)J=rsr>L^Z5kn`J>WvO^ub9O_8;>?Nhwu|y|xo6>UUCJdb z%+_K$U#JSNt(5I;3zTV{FY=Dh9aMbh73^dq5+q0{QC)3M3UCDbwLW4rE<3Kx({8mH zoPQCvZsXA!Dn{S~-}~+r*lb{ieWBOpBATtzYc47saiB00Twf9tB8v;@AWItSdQlu>8#X(`ANSxM*B`|AJdH|G?(*R$&-*n-?LEr zlcei8kKrD?@=ov(kcHCk$?ZLOK-lQQv^!eXUevxLQ&wF*OE<~~t3lK)E@OX2pHR%2 z#GF;cgRX6xAYbF03BM$FN?KrSlHPP2yk)q_*P$G=Jeij_4tK71D3);>Q_8a1swiKW zok#tot-6hs^~;FsL+L2u)+^9Fy2{A#wOXrPY4pE@a+dourxEt9sVu@T3mwsxqe1m3 z6s38Q%7CK}ddqtD1x;F01(6w&ZG;lWA%obXg@h>1?L=kS)(%ZaSj!u78Yxwfl7_91 z-ItJ$tgh5-|F){APhSB7V8K@?oddM?%!yCh8Zn?v;p&d-y{?o6^jdSR#4o7S-Y3W~ zz0+SzuCL8wwE9UWUKgj`0naM4S@0L?dwEn%j2keYcP&DsvEKB<$6?G6hRhbyke`QD zE7aQET(u~Yi>L|eiD>f?cs`2O2g7)Ej)}sL`SMg}1kE@&>{>>0m-)dY+D47Cl<>?e z8RW;4AIbVl*%3}RHZ;Okk6bn~m}57`e@8J%jMe^!RfE0fS$RfhMn1-_k|h9I)K*2a zC9={RyY|pdf`B#fyng^BXkgzfq}~Ftwj>UP$P}j;ZWGZ%^T{ zQL2eKS*GFx1*rX=(s<^p2*rK5qp;0IVg!1zd3pk~gM)|5+USlVdgRx($MwXF`A~^i zwPD>MWKli@H6%y{!T%s))8Vej z)AHNd&sA~f#XgLZMrL-|y%QS9kRd~EqoE$6o#&ByN7PmrMAuw$an)_kwXRkp*UJT3 zBejiah(*mow0l6Au7%K{J||RC@^fdd!?obX{Hy8|nZd`P*El#wu?{q2k8;E*b=uUz z2+&sg2T&I%Xr>!Q32FoNKrY7nPixifp*MF(G)r*EIkmo|?-Va>qB&B;e8mO!D9o91 zbP6luD*a%56Vm(|PM=DO`6wyzV6y7@DRP#qhU6ePpx`JF(b9iTiCN>4CW&uoM^u}P zB76bzoRcSbTxt}mvyG!3LDBj&5)Ge>>WH8DbbSN7haHp|b1W@d41)*DKs5`r9~_2X z{2BohhN_|X2HXG>hB@5X9L5J^e-8mvKjEI=0+=?t$ zOEiskjwIonj=0Niv5OyQ;CYU|P52 zAu@00Z>Vs65*=^pB>;MT<6(?Xt}jF+VE3!^ciHfF_#=%;JdX7;>?XFqqZi?v9bqa! z>eK?8r_7cpMfK*b{!Q3l(fK3(1~csF81)cCn7}L+ zvAz*QaP$Ot8L8c@oJb(&Tj5*WKO2PqkyWe`G>Lo#-jbL%gKdA`Y7imd2q!%7K|~1g z58`VfsNWQU2I4~E>CTg0ahuUFDz>P*QKr_hOhlq%8MiWv{QSy7C?|CCT?dW~)84A& zCY!b^r=_4;v&&zop7jV5kUuiQJ63z!J?dF;zA0PwV(`XX(~io8vl9Ta?Y3Gd&)nA% z>=XxxQ+VKKVOCo*JQJcqz;d5NLZ<+3E1f zRN-HUM``LUnDG^c+OMb>ZR|dGg}P9kyGYHYMe$qM6%K0_36o@P8(<1wm$B)qEU-~ zQO-rVI9VQ?0%W#~gIL|%?Pw_aZVa(nDdQUSf}$daM>p4#{&4bXW-vWDS@g&xeuL|$ zsXj4|N*frKy$o!=r=J90eWOuxMx!Tmc4#z|619Qs4MeSreq~RbDl!x?YcLyYfp9$C z*COa7(oc-mQ*^{+$bg>FUv!;f5Q3C&W$NMBgVASzc@c zRKH;L6$5?>YwzTmjiOBvl|}Cfv?agBgtG0>qGg7vrVjvZ)$qhxVqaw=1$qGJYGW{i z_FIvbbGbxDdLm3$(6(ZKAP;dZEcjf;rE!+issW2s=q&DJt}6{Lx2t&1-79KXMsc|! zmdbuhF z=OuEY62GkRxZt@NVk_xaR)$$ofDc>d4+gMF;=@z^DYZ zeBn{St>K!{e`4#>lWyxBHoYn`CkcO(A1VlfAd{4Qs@Y3HbTE$flihgDgU}18do_fm zu8HAVuCMibQ!N}5Z995J#mX_q&@;L?->eSitq)m^y`{oe^tX~&WT4C_s%7#o<(asX zyn!lCaKnxNAwYv|ilyQ&ZZmg&nWA+d|eDoiDl8 z-bKDUw(~ffDD0dVw@3*j78&BFHS9*|U}0g&?ub2)zTDBN=)!;dJDP=^>Er~YR*j5Y zB6#~k=xArMNOPfx!`ExCjo5Clj-Z3-nRq1kwnjrgB>T6Vk?C?A z5(Ra`_|VNjWdZw&(W!Qc;)RGBXK-L4x=OskHw_&T`!(=lRiLbfxLmehYdXD|-kD$f zWDim>v&mm^Hqu-33!g+;z|Nsw)2qAibp2?i$NXImwu;-*1G>xXnCCZDRqKts9eyl; zxc#|bB#WZ0Qy*s5-1;&GFh>~XY3DaOF+>+vRJY-8xl$KGvksK0o)!aQ`Iw%&%FQWd zGUGX>R8JXmb)wT;NxsP&DLvnciRaIOtqF^$QU5+nXyCg23{s8xVOq%8BHhWhi%9ix zjg_G;O>82~kae$us7DvCUFu)`JD9in8@ZJf5`7!}m5xb?^kNS3E%X;++5mvOZ43Ya zfW!)KhiF0ZE+h|}XB8`KAmHpI7C!AM^yiSc9>NPWT9b#HPUZ&C|Bx)U6AEaC3%#E| z0tOq8E)zF!cc^-PG(Td9zUi|b|l?`QV0 zAJ3O(vgW_3K=(dyU|Hm+W7L2>ySIL%PY5L3C(f*ibMSIFcs4E9=(hVFd(o@3&eZEr z?!W_2yqq9FCnyGk!C<(^-d#H%4atZ0;XlL`8J~wmBlN-?sdZBx0OUTgb4b~;3+Wog zaO^M^a&yDK#)L)HmWu5ZB>O7gIPigiQqw}3N5yt?gd#v53_w32#M?k(X3S}vxYWwf zNfqB51n&sUa&X`d__uyKLE|?liig*GBghnVD4-dxElgWNul4=lk7Lov^=a>0+K7l1 z3J3@Yk;>q~!_^ElXpn-qfXjm?EB>ixSy8^$yYY$yy~ju#!4FiS9{X?*M-;86I(YcG zrbeQ(@%xoHtg1mBIz-<_35(n&#qWTTioq% zwA2hHc#58O7K-4jL{zA4&}?tJKtb8kj|6@(8=jq4#u;fu{$3KPUDN@O>q!r(`@q9& z!Ln9Eix`$HC2jP@oRbZHtK=B?{;n9YP6Eq1Ik(;9MLc+MXw7Y|Y-@{DuL6trEkYC1 zLEhdIJ?XgVJw z*tsf7E08WOp{6f!MR@Hx_u3%1Mb(ODP>}Bme-_88T$Zko7X?VZnk03l=O` z$Uai`3VnRxU!qLGBrq+Kg^plGU?W~_Fs3^y*DwmPLm3vK?7rIRGaw>VQ*m1>gCT>G z{NthQ!Jt2|M@;)@TnlV=;3jJP|MFi19$xo>PDPFSE$?hRC|DB)3YBM+F5#oi zG$#!~M3EwnkbUONnJTp-Ft2m|0Sht7cP-~Z;sah6{!{%9u=}-!`MTi4Kzxc53R^7H zhlLgA&jp{0dexx#C9v&de1A@7(wo4IEyl(+s#{~U17fxg8y6&ul^&sda9V+pGmcJf z?o8&H{WuB)ldf^}%x!1Ifc5X38? zJGW{*VD`Sx{u{0%StQoa#GM-dbs@cs9g?#UNpkEIZVexXO_Pju zijcP_tBmLVi9SGQXMSyAd0rg&plK!o3r-k}Jpz}jv1e$E)C<4Q-bP%UB^0#>pH8j> zaEBm$L0F>#2zHS}Axp@qtEUK3MdM1TZTcseosCS%rGT}sV$)wBbdbe7{;HkyTJIeS)u~gRTlq0gU9NkBn-g!hp@m;9v@$=-L!HVbCZ} zE1^Sxpi8vtmXrypl{`X-&_TW54hK8cHVq@hGs(XBWockdaD4IBq3=ON0ZCZziyzH9 z@hf!%e8l)#qL{{XI~^mFQtXW0#g+Blw(w3_fD>DuW`@F|Vx05&j_=R2#lU1Vu2~?1 z6P?vM_g;laSO5MLgx2S&Pd+_e{j`<32R5!)NA&ndQOoki(^ZR@qyqdGpJZIp>=RF7 zJ8om`Q|4RuMtUBp1qZONPp(ktfkn4J{r^Y{Jy@&G zT{F0-+wsv4$K%TSh#F1*>yk=f1nGl;x9DaG0UV7T(h3>v;gXVViS_1SALj-^5ay}} zx0sVRe2_kh(~kv%kGKBCZkoS&fNN+(Rjj;YmQS$Hpg!6GDYGDzLV6^{}mw1yTL z7zO^SVQ6AF%^iPe9LI-7Hk6GGJj=9rq|f09(o1P{moKw4Vbl`Df!`^>-U1Pddvx(A z9};B}xwqmGI0o|C$;W_lBHzELc~I4OvcTIT-*-ruDy5dOIuf50iMy(L>Rp*v%& zfW#dqIAaKHhMt=f8n3E# zKUI_ib3%{nI#nG1A`JbO@xSe9j8p%osj-7QbXRCm=)hk8JM&(r?mox&&meh0YH3pU?ZeGQ z{4cg-dGC$BphkLg|B_yaw0MFI+~5W`bhEmA%i;J%n|R_y*lsAyc4;*({%_J`Xu+d! z&)#6(Kza-DQ_a*7Ws6#?_2Z%o=j-u_t={%Tn}#CV;WowNXdNap;ZN~+QR{sD2rzd? z^XpSQb#ZgK*NpDZ;m4T%t|!;vb5gRXP;lpA1Qx>NNpu5tkXm0h>PS=Xo+Y^nPt?%$ zje-4tec(rk+@~ukG6S%8y$!4po~2pW&pDzX2MH3STL1+pP@tU83^-V@6SjZ~BE&@8 zjGYwT4wcZLK^q?#&wO}VXM`)D=zT372n%x%ohU_OU*dN;AF@7^0Kb6!op}hrvtzuH!H6fkEm}2Rdu?eS zffh}|L6gEm#r$s~Ab08DDx3lJUpS{7pOGf|Yj)eOnnSJ(>zjuma&?Sjbm z7ojhq^PzlzCL<3?+~ugn35@__AJ{b_(2a_K)F9M_iar$%LMg2(mWR}G;^EAb3b|lW z?##zz!Rs3J%Uwe_m|(r;GUC}sp-+SMz$!PJOYqF1QuvYY+sJ^Sr5m$XEu9ea4kL*< zbp(^P*OZi(;XXBMoskv?cU<9N-7|1DoJPkKiOj1WGvaknP#Tdy(+Eg|s zjG#<7IlxCn^1T9NKwVMeV2=UgFrH&QJBv<2WHyN*#@NA~C8JXIu)3ZlNP})0RFm-} zjsxu)=cAiKDcjhVoj6FCejT7}_OQ6Rr1OFDo=;T(ta{4rE@YO~Q@Rd<^t^XyXc;jB z^cFCX&>_!&@4(B1S6>iqBL?ldxs3~3wrtt5$?c=XmJPS5IGg$%6j!zEs~-EA<7ySV z*|H0{2NT;#(i(3#NZF10SDC zy8#PmXlUryR)dvgBoZOSH$Ecb-5rUp-EmeBAGaC#DCM<~9u&OEUd@9GnrNBz%#XoX0{Y=mrtp*y&)|HOYqWS$%9i+!&zg! zaT+u6o;NxU`s*xmAG-9G3YOljfI0^sgDxaAAd7c~ys!*~Hh~YR)|dg{MIV+{_Dn5r zCyMTKSEPAmg1XV50(+;eNA-pSc7R0Gs8MsB4%Xr`EJt(u=<80YD*oNgzbugdkp$h% zo}0wiMTx8|TgL{_Qc0Xe`iyns`KORW@(3k6^!e}U06HRU9UE5a5*&!hHp*dZRkh4| zPD)-h$%#cnK|w)5)e6FM!k|P?SkVGE`rtKZlzeN@`@$T{M{Vk+ zy)x#oO7vp>Cgtli_klLo{vEX*Qzmh@Sr-EI?wU!UcJe^Ei^OWk&R*}~j1Eu`B zQ8PddyO~>P2%x!G<}qx`NNtalI*CXcXuG&FFOGP^3thCelHFP0*UYIe-_>y8DqTaSa6&>io5GF7?S|rvLm*8{a z(|$^Jor z009C72n5mEh`Thb4fHyUFZ!kifGwrlu9Kw790<_uH#F@vy&HPf=V6Uk>A7Yj46I}_W(2s(=Z~mG8B5htI6VgrobX1F`XLef`}39rSgY`#P@q65+99c#_x9!M>m>y; zXrl*v*O6#A49>lKDvEh-D1|E1pzc%rIR&P*f0gb}Lah&7w)ODuDz_-&tds?$Lbw9A z%|_BokM-a{-G6Q)LYnIt(W%-!* z>l&wXv4N?nyFTVP(i|@0r!1bipu++vQW8((o@p+mq$7*;)<*IX*}-ldcB`#%g_+}- z*Cb<#soOQ(+*b8!W1_}4yo#n;%NKROoAXhI=Z&*&1A(;$z$mY|gjoKKk%hh8DCPD32F*KJ| zH0}D4dyC5X-K~ChjK&s?`yOMkJ3%|r&gd@g0yuVQXyeoBjGd>Ou5O+oBQ)p!0t){hiRp6 zRU4JzD3|FRAGSO_7SR24x}@$yU=9Tbhv4wXEWz{$dDmEYfB1=Q1yYw`T#A>Q-e798 z93LL>;Ir&9rwWV|E0;p?+-?b7Ec?SZpDt;N%|0y85>JlknJlw8u^y8N? za7JFXs82?T5@oN12@V`MaNyjrW6~aoq*%{{wcB!cVv(iz>Lf2Z!uf;!hrC#0KUpsW zH@cDoA*X=ZeB!pnw_h+SdAT2S+~{yfySzrcRDZESE)-xk9DmSxT3W%Vr-n<<4RnRp z0Y@Vbs9jbA(w^49!O1FUU4T6`6&(gnZ|-di9Qc#tKo)RQl43PXr0WTz%X+I;yw1?w zf@SRf%Ocf=`;c7CJU&<{amwxz73UAwe{ijg|1*3rBm32M7@IUO^xob{=k3%1Ll2W zZ|eR&qWi(b#HJ=X9d)Qk?9^t>x;_sxcR5|YG?agf*6h&<=jLDWh)@2(s>I`p$--Q< zP@D~+#r-{D4_mVYIDtBj0o~uBTv66qf4d9zGYMW2hKe6ctBrzFs%3DBo%<;aVrXe{ z;p?#+LlRO%u$@dkn|5uQXx~j{7TJjdJE767*sSeF&3Qk~c1!r~%5-=JD^2nPs0dTy zoaXI>gXA=qc-!2Xa+)EC(^Q^;L*I8M5Rtpjg7>6v`cZIO6&D|53-|H`0}I{vc+Yj> zHg_@KOfij+X%4xUqo&HRW#8UKZQK(M@F*|Teei~~71#OL*dOa23rrW$$~BI zk4*&JjTzUfAVA>$*b63%$yb@mphqEVa_QF`^6sfS`I3V?@@@(Vk}#OCq%2w{nxQ5! zLgwYIkD&n;+p|z=h9@FCt*8+m(ocCe`p#SA$N<$S(^~Njv85DFpg^e`_k?5Rm6MP* zlu~Pj%*t@pILk2CpgO~w=r!kA7)usSo)&Fl`O@eSy&mfb=wT#pGDt;tDGmy$kFw!y^B8Nl_RZ^l|zx8 zAA+5K6!W^e7|o9J-gvK4R~M*NPwtE8fk|vs-`|9Qq;<>edDS|e;Glr^iZ1SQ;~bw} z*Hg-W)Ye4LA6jj)(}+&%c&u|Qv`+?~@akypCslR9*$CB4eHu{4qiK@OgZZ>?tRBDa zQ+lTb0E>`_D{8i!))t9>9EBd(d?fjht0+-$OVLCV&G6Q!hL?C=s|J_#l@EC1BhhP*bz%0eA zxzAXPJ4o6MoiWn($A)HUppSEn2vY9*PR>Au>h=>{;+#vbS08ax+2&2=jn`y8=(y@# zBR1OsR#p4W_=UDtLy;5x6royVcJ?fOKiS&GBKV7+Kt`}mD26PTt5l3U3VmNY;G&$% z#ACRLTlhS_i=W{y@NZK-BDc=IbW85b=4UGr8S=yWzdZZ_F0!6)7H&i*fW?z`V{txX z5uOE&RIl|8nR)b|ucYkIp3ISY+zuO{T6L=J*8_Q9W_#@{JRWhLb^FPe-HMvUN|} z%hjRpHo!AlVObr7We}dT{wbeYdjJ+OVi#1gH-0_FsNSE|iZF+=D<+`md6|QWH~?4h z$YZE|>^|7FP`s?yBzq+{tK{%ik&UI;&qcvuKqzaW#du7>#t(NCd;ER}niI$(k0Q!a ze~S&*C5pRE^A0;rGM2`o8QqC)^m)vsZ%!}r4g-(SmOf0Mnn%-_|3CCJTjcJys6U{Z zS941)Z7W!wF4QppF1NZUX-r%+4_vr#;gb9NVrJb@hq=lz+JlO5*XOD%+py~lI@{zv z6?;P#kzPF|Q>NsGeAh`)cmin-4tFmg;C)O{d28GJeiEvcnkQ@ej zppFALcX)zEh>*jCM)Y(JP~@q2Eb0&-;DG9g`W%?v<>}<^-v!&Zi^_3<{lQ$NC!Xq8 zvI=d~t(;zWGGfe!#@AbocW}0v05JTarqXPvqNo*}l|ctQQI5BVC3JTD2R=G5$M^sjIlzu33F`z!5FvqFNCgjgk^B=W@=$ z{z(E%z{^p5ErDC$oU?*nr|h{fHL0HzIwJ_`L_7D-Xi&zCEP1!On^I zdlCv2Z?Azy(kLs%U?1*HztaS#IbBXj8xhOlVi6LLd*0siTNd~fn~c$b6Y4}PKlbai zXyjc+{ZK-$a|$+7sLz(S1Cb6Ph8o|cM&O0*MB(Tj4+;ttR)_)xq!DoA9H!k!+yrx2 zb7`C--yAWcpxOwIbO^60j5Yg@Ja-@kg>BpP6MK+uH-8~Bc&^GTd*?EXK@;NYl zKpxBEh!dg^JIdBAe6^GQ^lZEcN1Q1vPO+psu828G>RSvhrYcM+iku=<4#ejojZ^cT z`G~}UmOPHuJHAd@9!=F7@#e&QG$je`93PcI;vJ>Tk@Jz>XV84CT$zH1(P~H&5Dw^77z_ zjY--xsE$i+0U~sYQ-X#F%mK-uET1C!7V~0|OBY3@mR}xf6BIEqB>}O%*eJvz#E7{H z93n)B5TjDQ%O`+}J~6;~Y-702GZF&eAf2Q|DSU%*C+zQ+tUN=PUe2S{>et?{%vGzJ zSSKmgwN*ogklLX%-;0G;MJoge5+q1Rf&4)W9u+%1&>7oqR<-M*06dQ4qJU>Bs}HKr zd*}6*jfJTxkhSol+*sKW4Z{d9fqx!^iR7XpIL;A?Ox~J!QGSt7&m#ye22xe(AFezB z*Ld1mz``N3CWau7A#n>W{Y-S83!?f;}>*b({=S%b#LLk zM{EBqFnA(oN#;9|MEs@z6;u!*vPh~+q-&s16`L%$Fz%^PLV&=+Ic5Ea(&06%T|*9+ z)w|mm4`iE5Q9A3ItpL3K;oj8Wz0ckxVVuJQnJqO=X*80CfW%oo$oP$rh(KPz8crV@a5$`Z*HRHdjpRo41i~bwk~cc@SV`toRxomP;FQUAar!!Bc1m!#NB7 zB`$`C)#?I0vKo6cOqd;`C}@U&fPjF+E-6GE`yJtmr8L!=q}M{-ar>x-I|O>R_G-VW zbkZYhB4M_dW@-z6ML6dWAaErf!A38AV|G;nP-Dj)^QhEs~0%*K^yQNL9>zrBj`oU6QTb?Qa?3MHJJ- zpv5yw@wEm%82pfb94dg)EVhR1a}O`#oVRE!#9w}$}?m`)gn0f2HYo{$kZ6 zvgf_OOv?ty*&+JLPVgsu5~C(Vm?XL8a}|x+UK+b5xhd?w@ZcCh*DJ8se@O{=&Xwn* zJeusPBa>f3N5;qgyYG`UA6Bgn+AuF=&i&n4WD`>(PW_zwdi|77aXQ>JMD0>G)1Au# zGf4OM0A$tVkA^Yzsp`l?Yqm#Q!?Wgv>jlNls%g|__(CUP=AW_055opWR^kn(3vAdf zR0_pTQJ~SCMkw!k1a!jiPDg;gMD$#jPhYyEbAjt)@4-b^6fziHqMT8&&stW+j!DHt_dev@d)}uX zE^W{{bmlv8$FT1_@|%{lwG@jQvn-TfIE?YMV`hC8>L7^_h7Oe>MGD*2af41z;mI`7 zxP(*ym|1MkritmH3A=<}6%`J0Vt*0n>tgw5O$d8yy&0D}3o~CNJt)mc#Q|P1BQ*z% zqR+$JTTM=**RzD)@9Sh=h2-LQkV6hRd?9kJvPVae9=Qb($p(89eJ7o>tLvdAL)?&GikqX91&wb@d7(vybkI-ok) zRz9efmK>IyPOr!C)v<{jb()A83}xTfBH-D2L?7!Bn!iuRhf$bmV@5RKg$}?+?mM-Ai6phjy}I97YWVShfPfR&*>izEjZKUbpqbGvK2zFhAn(u} zByR9p1cQ|@Sco(-5@c@hbd%nCM}%~mWGJRXmyR$n-9pJ4#0k$I)pd&`%<^Hp`bVAVBG@+On_ zxMpvUoA|ybq0nff#jR#0KDU@?F-*ukj7n(k$y z&=epFJ%}1=TsvQAWhT_8p44{1!}rAL7Wa0B0?u-H3|18PiX#ughzFKfy2qdiwO*}P z!w$O=WP@`{h=7+zNiYSj*mJ-E<5T%mneX?SMsq@1-QZ;10^sz;Kz|@pLIZK@@~({ z3Kd6cdIK|D(G{68X~-m=C?y~3s}*9lVyy>S+`tGB5D?I^WG^S$&1gLk*QdWumMVbS z7@T9ps8%W0tLV#~(j;Y|(_gy!r`!HBYKsiA?=I^}Zl=lvFMok(U zdgNBv57^QcU8)4a2-U7_>~3p|CU&p8DW<>3iljH+g03~Q>WZ1H4#EQG_iZyoqWy*l z5h6s3#)d1SKL$M0G?*nyQ5&bZICI<97To@%)N@fOcL1-Xc=f``5Z$6s8?jx$d_u5?S7x&1I-KJIMrHr5h$3(G|qG`icj}kV+J$0#S9H0^F911wi#zytD#{!$CJJaZfAwh`qNH0p%pC zS)pv0D0UgtYO5g~lfZlYfliII`ch-o>`c{7o(;~YmEp-OI}^v2^GnM(iR5_u|Hk8z}qM*jf6Z(Oipl zv$^~#KQNspcu(KNt4koA2HM)yM=5^;20zmul7pb&3DHQ#50I>$P_UKAR`K`2HZ#-E zj*Gs%NEnyI?cw|;fRz0Slgw6)E`#JoBZqX0pSpavi-Ecrmu`MBkv)2isFgXd@{Z|g zf3;%V(HOYQX%?6TI73b{_m4h%zy&y$i5s|!hhszsO^TC$^`+0<6}jMpN9s@JHs*5) zP+hyS;TjjKDSOO-0Rsk%fJi}*(klGrb(=_n5_jcrA}}h$mKDu1s6P-^0S_9;HEgdw z9M`~QU|BhS=7d}aT4tYvNge~gi_*_;G>YSN;#;oJ4p4MSU9Y*koQ{Ue=fR}tFsR14 zfh_8zUVA~{5&6DAnfrm^qVdyv5*F!D`xXhjRtUi zRxRB6_ytOM<0DtkTTI)}@?(oUGPDDgRL`U=}W@ct) z=HC;!{78MtqWEB@*GOQ7?4L8CY-wFvlyXaas5@%hz`>(^$U_KlaX9rG0#S}|e=M?c z0Yl0!O1D?w}?L1e;^#yaD{yYDfDKmcQ|1Y$={zr6w z`K2%}>i;hSo2mGXD8`+&#urfyap98U_gmJpt}?tIGn$48HOQF z5py_;_wn%(ZEmo3N-qd4iXeG66Y&9S?XWVj>UC!ST3PfO`?@wx*nEZ&{r}yx*ds*t z^5i`jmx!O^i*QYMKtMo>cD=@%vhBu@#J967yKb1w|VAz!~4tPLNp)V7_=9aT-fFM<2=!wRocXqlIUgTEfa)Q(r%( zt+UOns&X;%{y;#000p(y=55jC{7>T1`$Q77j=m>Y!WgCz!J6BdC!;8)hy|>U;atDD z(GZ|f%oddXs#GgidrNjVd6N$e_*VofsONB}F5|it9og70zgcKL$zmRhrbRo)X9Ve` ztq`R=oX#mUcwqRRO#LI?SPtt4&7w}p03Lck&;q49Mc37r8L!7w0it?SG!tnq53xq-1AFFXqk9#$**tst+R zZMijv94IdqoClTif@uQL;8?IP#7y2uFOa2m)w~4IZj5&0TZm~&G@6oJ*6@o=k(Zu* z98j@xKtXV#r3=v0aJCHKg;)r#=T-^+hEU{)7YU4J&0Vq=nJD-Vvm8?2zhh`JlP4H? zWm)pV8TAoU$3~R7TB3Ocp%3_|o5YUI$|4Bq7!r?QstnTU{-CXS9$57#H;ve_8aS;Vg{R(oI!(Ck?YLs^Z zyQO$;5VIz=8@yx)#R*=DL=--JDpQ_VRo*iCI&U6-0S4RYD%)7&V=8mHWW=>Po~_fP zYO>Qv5n{HV)d4+yDm02S2Z%;#C8!^f*770EV3<=3f+!d;prD|jphV@~HKLXgLvV1C zM@A8J_rO-^l9?P6ExltUZpV`L6c2njkTprH($h&Hn~(KS4x-)E3h0e7f5$Xk~PwGJ$po$zO48(f#ws+3pHxiB2tM4=Axp1qzv6yqpJ=Qy`u0@v|W^4@)wvC-X z1@~KHHGM#XX@=?0ENm?{1a&C^Te@Clr+H>P(B*$7nMoTy40F6C$aTu4Dm39Sj5MTTvVHK7MDe z#G<(|n0-?{i^PH%x9l%n=%t`7yKZLu!N$fQRG`vO_*0eNGw$H}cw?loM=E(5dDay9qHx z+pi$6UM&;PX$fmB?jGp1B%_c)efndzk7T3C3)N^QxBW9t^8Y_3~wl3)0??-{Z4kD zF*{|tVwbh#D>vV#NpQm*r@l^0-^-AW$)%^a;it?7Jsj8}-z z7Ux>s(NTBz!U^{$LglnL#gOadfB*mhF7fimL8RSs8SGxW0AJ*V(l6=?Q_Jg!83iRo z`sa`v*@Gn!wjkd2R{1ZwJMsHcn-KBp#n6)%VM51nMLRDsfr>loQy_mdxp$VTP@!-m zO{ackPy)~mjsHS;c?IdZB&~yh^$~=g1yTh}c;RkGA(wm3AbN(z;$~hp^)Xt;hg4?Y7o6>c-VttkjN1A4G#@{#Gj_XVB-I!WJ{dzWO+>JU zi}(beeqyYPLlYlS+}MDgN)8s&taTc->cx&Z+J2}(01 zMjuV1za>7$*Z3X&>sO&nqc)n zj-b&?JVuL&QQDQz&Cg_8cfT@K;IKnpENSshP(Hj*UL>2Ka07U`$)8Xc(WW>i0>gT2j3 z)!Y6|h_l+JZY~>j)Un6j6+3;EL>kS#-DseJ0}iE{RWMTz+6Mqfsxiv8MZ6&ihY zxT^-52mXrGwJ3n4v3~f zRye9{Rz;yB)Iw1j*tHYjJR-fJ1TfR!f;F`oJ#X%17O4L4-|3q;DCpn_KgUHWj(8U< zHV8RqS_GAkFaiFPE_1CG06h#ifl2hcc*eWTFjOQ53jwX{#t@@9f);b=%&GJMsTYlv>~RLR7)kIYG>1MSvs*^K>abEUmkbA48go7jN*QmhdBC~V zO$5_7=Q!{k2+K8~t+R5FAVETiuplICBlkgaO@-Tn=+awa@*sGEE)cSmF|ha1I>dL# zfb$6YsGjI$$Jy5tf^E&SUP(Nh4=4)s^O!OPz2>FNpvJ++!4kPc8m1^}Ui#68A{1}) z)qyq0Jxj|?{6rqkis4B6B=1{-&?LHH3G4VIzDz$9A7a=_U#^ysRqkx)ExVpSykE1K z-=)3|DTDDBeIXJEZ{d!E3In;2&|sG+%(Yq4;+LNxT(^=y(meEmyy>B^{u z@-zMJ3GKdY)ttoGorl;+r2v6$E2pOg7Q`&IjsW+3u?}@JZSEC7K95(tOp+DuJ-wUl z1C&8QlZB}Zl#?iLHHfCQ=x}QM9uHpBYtW5pMTuJ6^B0B&Ypmc06xa;{f@Xs!bOLV&Ol+uf-Cz`^Ge2%;I-b}t%q0Z`% z;JkJiZyz;6SqW%(rV9QQS{ANQLUz(;Of|#$bOMh{`(5#__2help{D${QmoR}ORu)L zP19!=Z7d)Xl`%CDPTRm&kDvvq3gpsS#5512nP{v=aNAs)WyK%%r%qk@S5jT_;Bq<1 zU&Z^HL*4e~l7+tj;O`hPfqLXyP<$)uD3$f2#P_io;%|wfh#0a^tRqmdgc5P)R~NDF zNpIOD^6I3swB=`dj`|cfPUvZvM#bZCN%a}T7DwAG7tz|Du;tOIR+8M%?plQQ#-Wq; zVw?|=Z;JJ%_i5&Tw`D8>J4?Z)>8KP(u@gfwZo#{?owbKFsk(8w?a?lJTMeXf?XfMs)va6&jbnvOu~rl3!@G}Mxt_H!S4{T z%{?j=n71VRo~V(y^QCh*V-TkA+hyl(zm|8CgtGdDRY7e5f5jL}JQhxQgw>!361y9J<;lbN=8I-6wc?FW9Y6aYP zaR{xcWW~luP5Q3Gdrbg9W^JxNw78;l-zS`#86-!L+K#+;Rj)78Y+39{(3XhKf#-e? z$uUR>fK%ZR!jgyxd^;J^9KbC$farO+QJ)hcK>$*i4sk@EgAIl}8roiNbzQGpxk2?ejS;hZ4MMos<|*Kt_-2-gvm81Sp14aq3rp&4{b5(~t% z32Ma33`x28xNwab7@)7EY%{Sbq#f7aK~{c|#BFP9n)u53@$w10bM zsYot?MXq*3&!Upe11eOok0DZVfgI&>G1UIDChLh$_T8o{+b{NY8V(YkCEY^k{mB{5P~`XH{^1y@xEh^sVjJP2AJXN#jJ6hoXK*DQ#8Sy3irF&HtB_!8w!$5d@J zx6~(t@a>VGFsgl=Ib>cENc%wYGzf+KtBGtwz}ojuheTw#zFHuB|Nc4wZF(gb$5Uw> z*k(t|ENAM5nV4K!oShG_mm&G^YzH!I6cH+JGbgA?r?q=}Q-Q#pisF2%(qY$CIy-Y) z&d?G^2^9dtfl_qy5Ph)~012eFOX-Tx70XnPHEOYM^5yj3iQnY2YTW$AG0uRtLjG zdmRT|lpCH`=Eq%!y_ZBIO%7l!q=gryP%B`*Dkni>oe|fl2g#6VBq_uy{lmIp^Uu+O zJ`8J)pQs<0oJAq*U%@q(WCX~?jbx>P)Yv=KCryE5LoBTkl1HjyWfCu`x~SW$c@9iE z?R=iMe{_XFhKYKwk4>O#Kzk6ZI#;1K?s9?ZP61n@qNhT3G2wSE&q~r5hkHnITRxDe zVTC=%jEc^_gK&9|oZiA4smO^dIZ&9%nn%riQ(I+lPo5NXGOvdXZyny4dsIbej86vU zmK?d12-zeEjQScOd;_wv(il`;xM=X4r#!ztPnKp2yG#}(IhdV%)fLLoe{>Y*DAt+8 zv_utS^$gu_)#?u8#kLFNDugN<6H@-JE0g@4sVXS>+F*0Ik3kY{{W!Bohq>i0-o(P$9pW&<@XXKE5Z%e^;8GRBXdEPP+CFz7kJFuwumc%n zka5AvQvUX>MF-W3h&fH=kLK2>s!;sMjdiEot7z%B%;?_^%3>#Y!E0XATFNk{Ga@G6 zOx^aib?u@`jnkPQpgXIJmiw>WLysfjJK~FvGwBJ23IoxAR@dWCRc@U>XWpI-Uj0Cu z$S0FTo7`IFHaQw5PGJsbCuoIMZJN5l0CBkbaci|GP54Zs|U;a=1qYjxV+ z@5%>0VrR9M_M`6hEb0*9u%K#?VX- zNF>ts(_Yd6gfFK;!uyI0!ev3G!+VSMX<+7DRB9snwP^Qu{+*X%s4X-Z_~Ah6 zO1g3Rr_nH^WkNbs}(aV`w!bemP7`de=7Z*pM_h0#I8 z`%*~ZfD9sqhF}`^r^}*{59ks7Cy;iz(!eift1`_Lh}$qw4b}!}RhCSD()AzyL35K^ zX?uIXd8@JLq{t342I=i*-txhS_c}B3mmbE2PE2+7&Q4rf5xnrC(QTL*AMyXAqW4!P zzXvMr&&Ovqq}smP189GDh0Y}iOOIC@>Xy-IOaa=B6*VW3DCneYN2&@hSO<8PiXuL3 z2En=OUw1y8%hxhL{O(uh^bdFR@Q07_m(AD@zixgGqfrhIJNcW=GX1qqclw8Wuanb7 z>0R&8+3!r4I>jt<)nv|3n`P&+=sZZDA2g@arA!afSQdq& zH3sy)eSv)*!lChThSHZzH0-qq1|(W|j`9i`^Q!JGvV~i;=0z6{Ff++T?JM7qT&j_Z zcO-xTi58w&YGG@z=J0+e1;o`G9V6e_EucW~+>Fxd?SJY8<6MNDoVAeqbo9Uoubq5; z7Aqn90xNT7texo^>R#QW?EHVp2}H$XvYEDKRQ4Y=jC@YNQkOPX-`0ZHCUKsLdR%#HB3M5 zhc1@K-3zg1Kphs^S=3PTaY|-#su0_#5XbaaL79?L!`nZ4N~)-PpDl{Z8utEIsFSX8 zbIsHn-(wR&XF=1=SFmE`g>G2Y0-o2Z#T_a4B6=A(6K&>dG43`OP ztxQ6`4tMrQ=kSS0G_$%UoY7VAAwi8lT2{)TKbTWz@d-KWJo+(Jto*Oa0wSc3+pioaQN-AX27u z)v@ttiW%h!TE9lubQ}p|t3ZexQZ(5|=+6@aQ+75z!y>eQtv68iBfr0I5n+BFX?^?T zv-?rWF+(Rhb1*FuUit__+Z7GoHz%V*`Ld*KK34sFv_1f+sqoS#lQ5NznOs1OC2qh8 zCj%*k1(1-IG?UJn7`H_dtw~!?n5crW&Jz^#OhQRchgZ=3fpSvSJ>?2&25 zEZsCv$dC)dJw;XrgO6(u7=!-SqRO+;M!=OJJjlD~Rq1&h-|%~Y-M0*Ws>_DQa1*!i z`2`b?6bO4R%Bk#qUiIy&z7iK_nBo0g5N{*kE{z9bWlaE@gGfh!zPk;eIt&ij_(?iV zgX&V9hBzLl7b-0>8)vh0I*6Sa+37akXs0IUj~`Doi1_X=T-4m?gcdZs*7SYj)oLzU zqHy)$`^YEoUMMeH{f>|CdQVy(x!5z7;x@{@?{$8hp7XCp>62QRj#+sq2zQHW)5~s2 ztD&zX&cgF>7YQhP0_5k(Pf1>M7Zk4^pYMmc$uYf_SU(=^MMH4a*Ev3C_+GeoHe5un zc3_zK>u4N854W<@D;Q0I4J|apNmmRvSEKKVY(^T25gy}+BP2PMoOi+Ce%w4kVy>!x z){;}xGD~x{gZqEkS((SuVW$KX%E8QE9p3$?eZPD+->WY^Z9gb0+AW{cPVRc+^a4-o zZl?9}cI#-ok4($DmrFV$EeMmBmN8L?NqEkz8Odycr>ow7re+`uNP11eDdBWOz5eRnC9*4gw2Y}24~MVv|=CTwTN+C ztPe$|WvEw)^$3WV)q&ox=xfJjV$(!GVsde&(3f+bK88~Ffh%!RT{w|$AWf%bEjX_z zm#8s|0en?A;4Je}mXxN7Ux}4~wYa1lMwNcrNP`65)liYTi|t`r(~0KP)>KsTMpFd`8z=n5i;?MjS09}5fghk%t3 ztHKX4V24JC`mg9Yh7KD=U&p%kf%EmXa4Z;?LR85z{h9GpS|Es9{V*WU^PAfTrSwE# z!^3AFr{I>CMn;oaIEMW<3y z^b)r*e>eV{t|8lutvlv^Xq8vxw-JA^8v^ic_A*{oTDV0a6(5CfX&2v|rr%Ci=l_x? zo^8x;7gCLAin*%yl8KA@8Kd<&MCv-TJ1vXVisP%BFDK0q?KbC?J_=%UYhxqagrnT5 zR*dtj?K=XEC~p}~xP#<;GOM^TqJWGk!q#ke=J3!_LYbyU)_qGpcIuRu4=soS}eY?wK_+q*V!gps?!yCc5`;CcbaAc=R92;0iU)g3m}i9 zrRG6rryntadRo9pDSLPU9q+HrvqjQkf}V0q*B5P_fK^0-oh~B#hp*}=u+fH@72^oE z!YbQe#vZZJ3&LU#9sa=R*NeH`$DeAxNF5`@juvvbKkU5U(rdrykfZNdwWK18tFwqA zcYVFDQIj~~JUmd}(mR2fM2}!kZvxJX+n1{KgU@2o*||S!s_&vU9lT@sSR~=n(JzpT zCvSnAAl}BiIA6d$6*OqjARy7FebSGKut$>%ilyKvKM`(m-n|NB$dF;!+`d(Uc(Jn_ z1>#<2!=gviRQhOi)8(PG0(65BT@j^#41|_YtfCkWp;;(rrCbglQ7%qxrR4bbYO3>x zY%U^FgY7a4H*i zQ4Aw&4K>%y#%71Ytbz53#j2q{DU7e0^VYPfVOEW1=Fp0#Tq_z?C~5L=mSx&ocDyr5 zL|ZyScYVA!vI*Z%4t8)Ok8*&vYtKj&87vhCJGc?6MHerzB&!x=M>hl2qCUx& zA|5tkY}7SS%hnk8mt=^82Lno}!?Mpub{ zZq1GOlUf_>3|vuidqWh8pS~#zfTGC>a$i<9i@S~36-~(b_{1FVR5K2G=Z!z7P?&G7 zTHa&Sa?v)kH?LuY%oXg|K9ylIzrD9q_mB@#Kvlw;-2EsB@jBR$$l*@*Si3YLwF?W@ z84CoOUmI23fB>FAVZXfMxwB-BIO?$GZ<4%4Ug?5kK|MIf45kUhb`-U<;3}s`2f}IC z1TM}E$S7Tzmpf-GpOHR}tR`ELZx$LItv5Zxn(HkwcKQ=wDn53pevq3++iK_Ps=K(t z868IJ)op$CY;6;Japj7E^^J!SsAI31gXgryp<<&H!4wT%7J~awVAUdv(8vi_E26`w z9*u5UZj>TI+Ipponw}5P!!WT^8Q)hKt~sP@Jgp;|DrI35U=xLE2d~E_Y6UaRpw`D+ z9uC(tt7fSZ*XAqnd~&!SB-%S3EC`ctDE8^LGnoQepHlFRp(@6X#mG3RxU$y^C^LP!Cz9t~L?V zn5_4J>V=(!x1QcTD)j)|R$rBOer`7W>FM~gO1s*E+V=#`Ge01L(&cjW9ck`h*5`Pp zA*C~W&WfJAA-eMO2NCLhwXJMWh0AbH%>Rc7~_~NpYlR) z@%9c_TR#=$c#LTSsa;K3IegK#8JZqxoT5^$-gED+c_J2SGqNs?R5k4@Bb+q`W}(>{ z(F^u`yssiX*3h?nz__b%-em@v69SU&z_ckl6DqH~g*-yvf9N1h^Ge>YC7PEs-C%*E zEYhFbEG8bftWU5UwSfJYS~Og&`(O2}u6`hA(#-Tn*b{wuivzc(e^5Rbou!kJgS>?T z1qzgzhSwIYZqP0kmxlsDM^B|rKUVP6G!osn6#SaltRnpOX|p$Em%zP4#c-;S}j!G@F` zuALu#tz#LKiG>>~mky!h6Gd4+CM=yu2u!>m%mhn$!tzu}0wr+o4vhF%A+#`7|wxqbgk z9d3zyt$8k}HXnH~vs)26@D6A2xXK(R-L zRir!ufxEXIo9~sD$}Egd5f9+uchKuc*`H4Zw&}|{%7Z5k(o9X$W{Y5SApXLc$gI~| z6i+f6g|+C7EPo#U{fGkUkBqqPZ>HF~B0L;u!gSpDck%p`?_|e^Y;+(-Ur*#8PT#3* zsXm1wyn^c|r-$szV`nEq?vjVi)>kiZ(+9IY*Dkcy*?2Z8$0@-w7BN!C=@ntOm={iV zSWwu4u3L^2a@*`ZRiMxmvG)MGCQPO}R%aO6ii|DpTLXNiXN($sPY0z~)&E|ZCn(%i?D)~yE^75*8ww6dakO=uu zL<(BGUs$&K2>2MNwALBYx8wXugheCIR|nU4#3N^*r=mlpW-EuW2$wfuNhf;acpGA+ zp{1)7k~jk1tQbmLU6!oqPA>hd5VV4F3NNgAM{2~G=erbgGLV~&Ri1FyTwisEtdzNg z`%tm^4-8*Oo^g7EFv5ln8+IEbtS83qs_ur3Xx#5Pk!|*yHeWoRO_b+3QD(mq!BM;r z@tJvY5sAx<((NTANjGR+09IVNICTPwU^(4^-_$(AQ-(^S+Zm`QC{uYtli%%BQ85lY{##7baNyJ&44F% zGEJ}SNbd7chhh++e3&W>SC|*Nm)zrFOB&Eir9E3z^y5E|>`0WXiS2m|iWj^P0Bl{A z#v0VBceoTSx;oOtI@c#A`UR^TkM31b{q)yWrn=uel{MGHgQ@UTRIinOh1O>92>L!S z0aNF7rdL9Ja9;;I>P6D%3b5cRLqmoP8FEo8t6%8?4Bm@GpV8p)RV<09soJneCP@v} zM0eZKR)~!bif2)!>kAsoaVNcY2?0@a(%2XARox)NI|U}Yo??}rrugY#L*0^>%(4YX zw?bj*1Qv=`G5ax6R(Yrv3Ct{pt_sf>+H=KGNI|5ROrpzN1xS#9fPf1KS~<%`Xr-Mu zK|`ne$gy-8OKZ-CAq`!)$Jz~Y+o8=N!0hu@tjaR{MH@;J9|!nCtW5Vf;+0K}xp6n% zJGLm29Ru<~D`8H+t4)Ol4H`7ROwi89^KDfj^T;NwGNc?Dt(78ui)#Y zOSG_R)>%&u%Xta$Dtc6?K0nV@*9*v&^!MUTlQ)kkG^W)2o5Y)IpOBjT*xFEf9XFk# zKrOUG{~=u<;K1j>^z{iNdF}6-d%&&isj2>`k4}tBs&h}5P#E!XZ6gScP(XFpb~}D3 z$|Yo$=D-|NS}OmSi}SMaplN-QSB{8Hl;`Q61(=Q}6i?i^mYyupTFaVu2VbR0 zP1GS&>vKw9y%FWDl{fM2S39s4YyUT*i)oF>(4;?$HVsP(rwjobUY9qeYisoeJ#eSP z5nPwvJ4w{%SQ?{K3)7ln%3ADXKaGI>Ek(4y#N9^$Q2tH&ppUyDPvPbT8^?4$nKS0}YLBy4i_W8hSkkoplhVraEc^qgZjl_hL7; zyRmij4sB{jLTuB1VC7P(m0;^CasT|4ec|!Q&S0E1O~lt+%`3-<%1zW1BJ-V@^xdtV zebA2%{nTimEcj>hc)neYE$@%fba~SlrGcUdZAJ7?)|^+m?mitg#cXPNqKs@Xrcq<2 ze`elU=~;@CtK_;}pOs_pdP2Z{bLxUe5H22kBNP*_3eIG&Hut%AUmfpS^An!b&}mCZ z?=j`R6)8vB#wHS6j3vrv5N=aBpJ0ZjCcRS*pdPAOA+Pg-^)ZrTMefbycuqDw9h5B$ zDam2ghq*fnz%@)wuWccGkmq@&Iohz0H*D=~J0I@;=^CX>JkmR&O!sU-E!TQuEbr|6$H=-PD zB-0{xEw0eZvkTjoECnf#l>>|8|2`Mxg0ilK?19#tHO_)3d3Y`(9W*lqkFUx^cC

    7~-F_rICoQ{x8NeuR%Y`tJW{bZ>QO4+A@q>0|jra?DtZndAKni;f1&BE!1 zzEUaoL?#E1J-2X|K^5UBkYp$s{eeL2Tk0ZsUH9E8c?u0m4N>HKHwme1&x|<(fgRzt2Ra8NYZ4 z1O(;+w=arxjP;}N!fKTu^4D)z+(%>DMSAJ?g6U3+Luqxn;|Rwz6ziCn^ExQ4j~uh@ zn~*Arqc(``xaT)lM*`o(bk=5zm`XN{WE5HpBQ3`b~n7YKV)FE)RS+o5`G=y=T z7igdQ5)H5x$6ye5a~VmFuaG;8R*vx6Ljqtvo+m(*E<0w(#tJL(B%F}zdbpb^k2N`q zTAq%rM0NCgp?>|>A^+Ga*H+~U&YcVqm>_1cNbADAxJIZs_;wUdgv@vcnvf#>As0Wt zZ%Q?uCo(`~v8|+&vZ%F>{Z-vc4^+}pLFDGiW#)|@#b7WP3=aT6MdgmmKU4v zS2B-=t{PSYSI0%YeOC6T%l16B$^OO>9(4_UZG51iYlmZG@h>-PTY5eSF53quKT2{X zj}x;(bO9zTc+ITKqj7c4LIxRRf}M?Vy~y*;{h=u;)KSuf1aLY-_EcW%_0ccg!8J5#Ar3R4-Q+8AToxfgQAu&vXqtC5_h z(RDGTNRc8%+Dl==gb5R-81c?O%-$V-o?-MWE&4d~2_jx5N-Bc&<@ga-CVkC*frcuT zEg9@*Xh-+^jMP8VrU`{21gumq+=(*-yJzM&F=Rd2OMy~0S6rZN&_9TNEasP zH1&UK4NFa1%6m&h9qJ~*3I zVY^3V8(-b0Q&m=!*JnNQ(a|%+`y0lsj6D_? zf=49Ib3Wpy(Y8(&tr^$TuN2R00sWlH^}|ll#G}}w1yIUD)V4>t5?@f-wDqj1OlIW7 zTFm`k5bT1Dig5l_6sSMk>?|T z4N$YlarM*~8DG3WLyC@;N-m_e^qJFmF7IiPc<_1QIej9Js=ar3POV`fdC$GH(LSQ@Zr53Ok0yz68_?TfvWX zv=ynN<2HhiS}Tb)?zQk!x|^HGY0fhL{L)}OTCIJ%LYmd>IFx;fM3G^@jf9R=24Ziq z_n0-?i1kaIN2jY)YG#d&wS4L(Vh$_M=j_>Bn?3!wU)#F&(pN57PBYJ?aU5)H;_Y^) zaqJvOF=j7O=}z39Zvx%LW<-LOLqCObr^okkt}QMWcD}EcVHQ%^ad_}hQ|%!QrBpt$ zWK!)ee>@xM+lEJGq^TMn|5-E+hb|4XLh2OSe&u->_xZ=IZgqGKlMf$tI6~Zo28>O8 z<3szSCm%uhTjFzk?aF7I97A&wcn4?j9xg4>CPn&26iKz!W*6z3ihZyRj^>Azhb>v+ z2B?j1w%@!F!oJ6?szcl?Sr+WfQDhvc%H|8a3`3@doiRr$G*pUgVPq6NEJHSmu34u! z5No7FWKWr23I&N;=v%J$c1 zJ@m9_<*cTdZquErUMJ3X5N}yoSW&r&${A}1%Uz{{P>Orur5f>#W#qjfG{BUTr+%4q z%9XFTBHM7_ii4K33U7=R^kULfc_}3&t+nEXWHwRzZ%EMswq_X~jm1eG(W-xW=+gm_ zW(-;Rf7)`~YZ4)Gb7ap|UZK0tWh6*XIikZ`x6_(rA#8v2 zlt4!>gvG>>ykRV08hyjD7sjJ~OlVvqN$g|@(w%0D9)v}&0~(zQE!f5QMO3~r3a~{l zJa%7;VZdn*5m)g9-hGJ{&xjH`5<44)kpnNvCYJU^D71VCRuoaB;wB&?I!^a}=ey&p zwo0j`-)&O*0L}>4I^fsmyJso>AW5Z@b{UV`t4+ObR7< zhwMZ*+QU)^3}00ilIl;$^C6D-AY0GZf4c0U%`lIskI&!7j;)Fc!++Sl5nPYTul^K` z-&|bR-XLn(&XqGXOVxJU^C=y95mZn?1smQhnhez!ZEcga(ycp}{l}ehj68A)(e7*| zuJ*o7OTR&rvW}HIE^QcmktfhutDu$qptxp>Rv|`=5#xMwghlPn)Ldm8E|dT)^ru-u z6|X}5(B+EpRQ+#;r|W@^xn=!Jy&TLxtVX?htM-rUb(Pnnws0LqjaeGX4tQ~@F=`PE zD4WAGghtMQNA=BSU%1TF+=S9-0_f!Ri{v10Rj$r%A!Lz77E??elS%(P6i`3`3oNEQ z#%z4j<`&xuG7qt1`+@W0rh$FGueBJ&=1CjEy&{SEi$k{^{>trM%-nbK!xKBFEb3Gt z+gJM=FXbhkOggxcC6{) ztrR3F{tj))UTh?CvViBpBKqechpvmIzxKY}bb$*C=f|Gk?trucYVlnO9rn(Kht91+9!Z-LS;5MomJ(jCG8_#Ov zYk#H9o(f7YVo3iFSj!*tPW~=?z=bpp+P_0UEfhqE5FtX8MAwsbFZba{vdbd*2CS$Y z9sS0jbcUr@WpP>`S`+_J!Rj6~1!FVo48nZS;P zxO-ut$jE)MqTZq?p0*YAVN@3m?&#TbTw9}ePf9*vy_@!E6sMJT4n*dmO#q_53rw;PR%yM9!zw=%RKwgVC+!IS`NWmEf|}^8_YH3Pz!fcq+l2> zN%&wYFIZNUTYn)^SUGm1%Y_dpkmGY@(Fh^C9quku9rQBY(UYx8Q=RT*ea@<=%wPuk z70aT$>0bec2ZFmk=6($Z9rP4u;ke@$yvYO4iMTkJMQyk)l}Senp-20KsU>>?_{Za- zM6heP)X}LNM>89*3%~Ol`aqw;(2}(vej}T*uR{_A+)+CCI+VtD2hfXLQ0f!!#(niw z7mxp~ZPl|R>>IckTR?DA!L zDv^mz3h(=Pj9`l3E|liUZ0(w#4PSPT{<_uAMdthZ#C1yQJ1U?;g$fnw)Sc*diKm9? zMA2;lFbS=61oq2fUKNCHYJERhTd^iNP@$U|& znga{vADT@3=&(cTe06q#>QEk99y6QENWRoe_8_EkZC1Xgey|_~pTc9#5&Qf(apyvA zH{a}kIYrVSpdAjhg zM7g7kpMdm@Fq`l_buIS!D!jUAjaz!{8+!4)KASgs6r70uW~A2{zhqp0xf(&W#dFF1 zMT-wMXOxL5CBcvM!ZbhC*_(*}Th&be3|t5PiHoKSIOCJ#$t7OThWyf9MX)P~?BzcR z|H5zRx98|9pgXk(fVBo-V*D}dtQQ_qKM$`(f!RTBeAZ`X{=U2oskO&}-b2*sD7G+$ z&5%`2$s|W`N2d6Hgqz9bnEZ9yjBx98YAJCV?zrz1r^mRM>Tbm}x-0z01 z(RvAP5P!%g;gTgedOJPy#`>36wA#T@nzT5$<-mSk^{rHUTmG2tNbtWj?A65_sIx{# zB(CuX1kO>qY|(Jo4REOmi#qzgoDV38|Kbt|-LEnHJ$KH%_~Nbv7ry5UHBPRdtE}X5 z${nYs_MDsCy2|We!GZ-F)XIDKlT1p5_vImK1>VO{x%28d7hSQ{#s!I6s;k4AP<@#(VgQ-T~=zv(#!VN7GF7J<^Gb&R^@_ z65pU*ol#6ZG}R=nI~8Bde)V{$?3(>L16jM5&;yJ!Bv|C%HNUbK>!)?o>t%=alhnoJ zn7^eIIMr5|U8c1wAhxHvLaZz3PUUuh1`QfCFP|D{N7s5erS+*wET@bLTxp&rEe|PF zkzr+FP*1_#?R)=7c{hWMpCPz!BNH8H2!B#H1-GvlVQLuXs(_*K9ISYmDCcg8AV$@h*tryY2!9VJx78M`3`8=(h zeCpOE5fWM`y2?~X+__;AKCySv+LC)GAz0l`{&S- z<`!rPS->i1;t|;&H#zd;SIJO@}9wyywwQK`7vPMuP~ zJp-tOM-dny&^HijBshTzOb@>pO^v2jHZy*5Cm_MQD` zurlBxi=0yqcl7w&Z4-j_k2RoR!QFUW=k57Ckb#gYE{O6PAwHwzXP!;TPCN*eiT~l1 z#s<$ePq3|2Wn`?Wws4!CG2WWENw)`P<)DHH(UEGrwxG|Gdp6XNAVG4wDc6XW+2<6X z-`pYh7Y7I$dgnZJYpO^xtD%~}jf|nwy$S#@Ffj14>1bDmt|jRVhl$ok?P{+o>Cpu9 z7F)XBzWNJ2Y0r`t_j$^VxTrl129k4!nL^+=m1J?splhA4%HnofQ4c;+9t^QKF8!4w ze!Ls^Z(ByYgaXjbou^OWd8&2-r|Q>Ok3s z6s<)rnNGrqCOKaf`fQ5UV+!~oBNF`6Cgj5YQB{b9`48w_JXkCXB#ecMBkML>E{jvI z+^@XAJ2oE!;~$_bQyDhW8N&~mtp{jkZbSctMgnqcQWXLBf-fu5jM z5aK-hjKUgNnt7tKrD*Q>_)7USM_C<`aq4)Hbay_2s{kBV$F23X=!2C-2+0rXaBaTV z^Fe!FhdNsiJR5uh%cQ_8l7hN+xZ3i}ZK=$Md9GaieOO1Ij6u*I2v{h6XgE-BTKE8d z_jOHXSCM(%lz)^#2kwNxV5AHOpHzsgvrti!TziL;W<5>=FrJu6XwkY*e z_F<|Qs(~@@^J#uPYW9s=*qgIibL!TdyfX`5rEAZFX3AM#E>mQM_Y~9;sU%>ysc9J` zT-%X1w$NA;;5IVeeTu8=4^|1(>n1fS44dd^i<`A}2k`G*@#y zJ}mFy;iVpNizxgWI~7^1Js;IL^P!1}$0`*j#doz=jyc1^|umnT{ZT{0aJ+DRujjYr@N%(aC&NBlb~wMn~YfKm4!XN-W)Q=s1dv} z-+S^r$Ea5y5b~c_weoSguGYP~(3@yNcC(#*$8J`U>6$wyx3Pya3lbZ#EwTH2BZ+zY zkPX!rd#pKW_Ygq>`P9T+Sm%_N_3aR3Fm-8o6Ut}~FZCF3X4!+w%ViKu%lqc!>QH)F zqG7tayiq2i8c)Y%j~$oI!yCugdz?d~F0LYC#0BwMyy+Zm)t2Apj?*&$FfcIizuJt@OD|l&0AwIQfB?b7y_Z37mi)tAll|O8RXdWqF%S^)X;f4Aj3g;+g3{Ss>Pek- zVA#H+52qoTJ@U2Hp|~Bj5N`Crj{w40!G;nAGtTmwgx-Eh{?GmGPERY)Vi)$}HN2@v z#stg9u_mPF-w8Ga}xzxZ1q5t_sZ1O(JWP=Epj3KXbMzUmua!PZT5C&Z(1 zXXP&BPgR$A$FkJhaCLx9sey?M4liS6^R=H8o-97lV-{Gn#%LzDY3k~qD{UR64Od0= zCt8E>Z`mxz9(m+%eO;x2YDk@J%gYjC9xLpW*UTpBeizu#EsO9eJ4NPF*u)UpP`p|y zNfH|?QSxiwoV^*zQy_8AnLmO&GEh8Ig6EM8`%WqnA7~u#iXfIa`QGm93EgmMF-bV} zUu920Zeg?_^yH;>P*#t}EVI=HFx#H%(2i2@oS<_h?)2bj^$|~;AW6=xL&P~Kv4Jy> zu`?scj^ed9@x{8ZU(B^MJqa2b8d|I5EA>%j`Zno$nw$`!p`kCg5NM$ z*PjYgi$fpubBQ)aE*;ItDeAsQ$3|4!}M!_ez%_cjeTL%&hrCrocM?P%w ziQQ4937^iiA|4V_rV0C43%-t(qTdRAvl+_}i*(T0N$YJ9x@>QtDlR}%7 zBK1G@0aD3Z z>!&k#A)oajtj$w`p9uLsNKzmHkbuVFXg(ikL+hv^i$Gww+pPsJ( z5+tRvBKHY3M|(UI0+SSzXcPw%2{!=tp21eDG*5HjItPr|I_GMg{#FQN)x0`93Xi3d z?iNl(nH?NeKyU=2ewR8*Uq~LFFw|DXB##)2sJCh}TPx8US5urn-Xwz$T@x%JrK~lA z{=uQ6I`V2P!Fn$Q@*DHzTyw5R%Ge^z^&7nK9w8M2e3+@WB+tdkQ^~vrPG?wAnzdFP zAW$0w0b-ll@~J#tLnv3{RVIzW-tEp}>WR5Sbup>dEbCqW8SUi36~hNKDd(FxqON~1 zkDBNhLWfyT!q*m}^HS$YHg?kwwO$U1uOP<`0&1(3Qk$9rI6U4No6w$FXlqA(3iff~ z(f9;SyL&oRy{)i5>N5%v^X7yH?59#8*Y;5sYU^}0gS{v{96AP&K3EQrmJlnc!}VX; z<+-mJFlhLSx!$&FU>;7iKfoROWg)V%%gD&q>z-kg$R#puroNYWBkn%Fh;LVS2@c&t zUAtm^`XPuZ{g2~5va&V+-r(Wk*>^=BPf9KOiT_Knv5MBS1ZnuqqIcLV<;40L3HZY0 z65;5Do#$l8W{78b*JzP3-cm_ls@$s%sG(*?GnW3W^LcI+XS4kQ{caBddNjargr=4c zoGUWuBP^N?WP-|9EYda1sq*wOwzaLHMS4?K^HQ>iWRYR`8`Lx&FC9Mwnd?0~0R_q%ATjZ=#(n!Cu3PoAi#lRjtGcunvPHfykemwef`+xY|HVy-}VPDP8g(!nDe zyz^v>=W65s*$wm5aLy7ja5(y9kPNlb@u$cRZO;hJiEpJL1c&s5lg5bnV5Bv~SvX$+ zx5f@~)NCpma<0{2JCAdFtD8@JNk4MD_Pqdpg5~+H73GT3NNA^5JDk=SSY+z4^jG@x z&~$OF=e!E-Dlj9JBJL-9W92<=8EpPoZj%n%ZyUvs4h@f04nc&-vBg`6BKeJ%7I|9` zi0E|D=%vXoEzcON5@AFqQTdV0N}R^9#M~>#)DcHk*q7h=?241JshX_%S2 zm-?S5dy(J7AEza6^7xY%Lrumo5U>l3h6)ubRH*Y^DGL3iDP1vUW?EJE?H7-|TX*+@ z)Um4APSHA3WjFGpW+4a8!8@75<6~01czAe?i5Ar*t3G+#e9ZMv>dpS#@xHb%;3Va& ziKnhxKtDR1i!0@*etzq~)SxO4kUE*6gY3c@+2nDdYtMQgaL3TJFsFYl(4aws1`RRdS@hM=Y}_=#U{l-f zJ-NmERjF7$C--w^+uu6r$04vpV_*@KgjTd1$?raOjO*XcKfiwNTCL=F>ZQn5Am4I2 z_-Ne%`y#`ZeBR@pOXmFYwA;9*)GD(|+-6f>jR^U2_wbJI==TGcRV^d+@A zHDJ%1fa)ad3sa4D86rQl8=B}|&rvnJvZqyRbSGW-w0;BTmHOTCUo>^dh(%ixP3)~a zKd*SjD_72X{Z#O2TIRRqNE|{$uei-}@pxmAiJiX(l|d|NN-2ex{bWDLA>t^G<206V zuE0awoQoOC7_z$80va@E(4av;>UG|!9akfQlJcYSBT@WPZK2$sgPXUzIUJmfCcbVU^1y@7)T%PisGAX;VUMZVSzqnAVTh_=BQh&pZ1((B6q zQJ7-d&yRdXe@eege~mO(4_N|2PqsDPgrG`S(Khg2UY(Fx=Igu>m=@>>%1cj2xcIEU ziT?VTe-7ihX&xG^f}YbV62}>uQ)(Xp&WJ30#Id%s=G=S(3Ce3yq!tbLBGTlwMg{ME z7fLkuM%Ng*ztVGRaoL-&OvCp~^z=QjMW2I!-yT6CT>urxi$87 zmic8dx}z`ZV3Ba7ruKwKg|^aouYVD4bq)bCY#qCfKeoGZ)aI#QCsI=$01X;6XwaZ> zeH(oE@ZpnxoU|44-pRFv=r3wNdYZHIhey}hxxjk-bcyGMmYUDUQ-PkY)w(^#BJK)6 zu^h!Q5UNkWYyypvITItg>`%xSBF`J0TRy7$N!$4 zh_@Y1Z-(pvX+>YNf{Us2Kt|v1fF@Zy?8;9gjZwEMrQS-RsK!F1@oN3j%3OC3_N?j? zn&|8<=uFYhPP#)8iL1e1i^l&LO)G>(#Qo~DaFth?;0j%nsrF+Px@0E3t;!>`BiFh@ z;MK@5TDEv>!L8zOjgI58n`;-c=ya>9(^l$dLB3~1fdT~z6ukmAY}l}2i|`bmM_Z_` z`B5KL8@mqGAK9ZB6@Ved%OGDGnKyK4szLu?e*3>@~H@6BmFh?$T5$`v2&gwVd%Vbsj zFuD(nZr)-f{C|v{c8t#E8n+xnK>nei(_Fz5v&MEB@4qcFwdA%yeYH#IormT$QT|G8 z%j%2_r*B2Q;M=(R)^7IJuRmB=SXfxtl3%D>K!XAW3Mp=hq^`sPsPwm9JUK7tc)_1u z`Xy?Y1>a!(erKT;^P|=eKrPn#UaO^EwE{EcvlFR?ip9^@N7<6FZx(!-ibVdMw84Tf zo+>|fQxw$)mv|!%tRM=ho8Hgnuz00J=B=@m8?CSW35T{TFH=;h6O`JJ+ShC+4T=#~ zta8;oSV4`INbcxFKSnWy1zr_%MI1$3eSlUgg=^;`=k?B@Dg?c_5Ma>`sYQuM7 z`_a0I&j|wqlsNt|)QE+%(ncqBH8((TwyF1=~u*EmASgMZk@k{O9d-Tt%>bQ*R zP5OFz4C>sVLhLwfpQ`>8<=r-TuMR37t#uHA?C~&P>|(FW;jn%ST445L>^8o8g^tvW z)FpC>GplyXlSwepec6 zhp5HMZKrt)Q#W{|J`&!82fjGE3Rj%4$lhA&UvzR_izk;04?Y|Q{VXb+Gz^i>x242sbKv++Ng)-{|-ZR9|tw{lyo(k!`(cj zD*suxw%s8ORv-K*ijg9mTVL%nhh`*7m=mYz1b(yWzGYrBKTT>7CC)P7V@ zLB-uCD(+m&V5T>-Gm{xHT)6HJdu|n)xw|~!E$R_{SB=DQy6+yZZBA|ww%`Y;@JCQ| z6TppN4CUhj9mc>@PEDrHMFMD+-BhnRfu|FktzL*km)oKkmMkg89y3_5Y==>wWKBVZ0d^&|9v`Jm7WbUbrhIYObxa>ZS)*1o>mqI(4F z!2~8Skxb;rsPe^-<>}+@6L9b2ATHvNkW<6NR4#U8^8o_sSs({*F%f15r;#xfY9NTqv^Y3IHR&6+T` zENaQkp9RJ=l*77!Eh%(kn!Zq42e~N=1$WXsCAN(il7hvmv zlvXf>7dgQ_dy4|*(Cp^$<8z^PDRIcsW&{wPG@Evl+c2Z*-uW;~obK%2Y^dNYKNQq^ zb<8L8C0_*Y2$O5Fr4&ebcd8dp;%j`J;!U{b+IcHd@r1fcVwb{NZI@N1F^Q&yEeaes zZXQPIE=HkOK%rN_qLjYGdy}5c`IA5s=e`}i^u&iQ38Bw`X6 z7#Ns$pX98vV6Vof@9Y+*5KiCal|x|!v46FgEdg-v z4*&qc2-m3smpK3c0Emt9fy&!9!&gC`kgl;f7s&K_pwt$_u~D@V6IP^#AS_s4HsqJa z%)yh#`ZP*xaYRxnu=1Ry34Rb~{KYyK^wzo8Fz~+RBJ5Q^UoG$mSz8iA#J+6B69W6kU`Y zgP0@fJZ*A62;e%uv4V-dD}j&rgv=&BRm$|s%1x?=f`aNPC?Pk>wE|}C-@lDO|+aQcS9L$>!M+5(ETIaNTn9D!{mhITCFI3ZO2gxb zIMq28GK`Ouml3`t#&tK&P(f>5-!3tw&72cH~2uV z9i=Zh8at^v1NuzPjQOG-eTrf8cZ(4Dnj?G0$}vc$MQuWa3&S2naFF*Ae*86PeydYd z?6G38?Zj=8_3}JCRkDy4=|DPo{a6gPy)D$fNKevFo07q|O*tak#g+86`my#%D?LfZ zACGT%=fKR#D&P;OB_7f*Uc!Hc4I6rGEE1u5S!o9iEcF4To$$7ZT-emQIM<106E?G6 zdbTQrn&(ZTGZVcTnwXhsGK86#yupHxK}kC@8crWyFcOdov3RmCn!HhdBGHr0vSR{r zI*QNMz9B9_&Va_9y9rIup1Ik1T3xFGKY&y_>4<)9E#?;h*zMMg@nbp`GunxM^OYv< z>mOZ%Y&Mfy$8r)#rxRNvEt*3X&IN8|j*tQj81V2vP_oWFVaVTW$VSJkx%3BFW8l6m zz)dsiS!ABU*fGrLiSre84msqIV~#lt1BoP?O%vO-Lo756;>9Yxd(9UQc@gK1#S?_B zIhZ}g&fJO4SHZkk#c@7=$S|dP3Jp0Jbt}Y*)oy+oK~x;4neSM~R=Qs1$5yYAX^JLl zR%Q{+>#DFe)0|1^dF<=5lDf355?5B!n-0$~fn2|JYT&XY7jDyo z8`sN9Ske!MVU1#0c4T`Ne#J}q0EIw$zt{1VPE^jQ&^ust_Vom2qGzCo9gZ=ie8HSW zt&B&V%QBl@3x2Sd-2d2UH!3_VN^t%EY$Zk3@~_=BI?@awS%AUl8Tepx%zJC+Jr68C zjloOC+^`~Ud6*J!I_Ei~0Et7UDVa-=YR1MHjz@9dyi{sjQju!cY{WWG|R@cRyM ziz4Urb~Ir9X{YTx)fa~Tf8ca{Fba)^`G05N2Hd+9TLG%Lr{fvWRV*0F-z>#QLYcg( zV$NZK90$r731vpqEF=sc)~pqS%ojXL+CmiJ-yRV@%v+GQ=l{81eV^4 z8(S?~*f;@`Xc&?R37?Hwt0X?m`AVkil}rIYgmjOuW41z;goS}EE1XWMS|6Ce+Vj6s8FFw zDkq9nsMe*$5h4>+&wM9a5bFQ=3a$}gHSjLEplbVIuJ7O?i>kO~!W*sc!C3`NGa%_= zjeyfJ8g5~aCO92VFSDIjvz5n$XG^*8Ovi4^sc+TeiMded9Z;}h1l(6`(W`qzEK1pf zxTJf;8};{Kpgbs;BdZzfh0^r5{VL(_qw#O5PjAV#X4?;Wt~Wm-5jh{TEmPZoC8$Ki zwW$(v9~xH!^i5?uiNW1{N4Fe}#l@Yp2QNq1cwef0I92}qwal}OinnnZsn1h?Fluk<|v%Jyfc9?J9 z*m@O9yZ20V0$pqwM+P)uN=Ts16>MP6%3|1^M;&zN(1Vj56exR24ZIwXw+M{#H80nl z)0_Vqt-h75!qaQg+rE7Fv3i_k7E~W!uw9d58e0KDcD}gQ&%sMK*C(h@4<+<*81w~a z984zGS#SPOA&Su8Q%S^9^0`QqVTb8dwZ!J4BReZPA$Z4 zbEd-FfV$9=3mWf3aGf#qbdyrkQUJh)vf*KX)OcW5U< zM@k4W{p4Oa02i<`VP_iUt(+%dgDn>E!q#gPW?Udz@-Q+PZL{CpcofS7bHr63Lxv1P zrog-cvDP(Z&d`k>EFKW0*-2k0Dk(;#CEFU#mkBIbaPWaxIPAXW;KoGm5zulIsB+Ly z=I3^ko^1x;uELJWqdg-@4jza5tmkcD&X%j)Jp%v$^Z+2|>H$EY>Nx^u_I!C&wc6kM2D%(E$G)7kL_6wV??|SfFvm-MjAJZl zFY{j%+?lEpX3W`KA{g-ctnz4X$F^6>)Kw9q(Aofw-3Nb9McJ~TxdMNnS2EBtWORHN zGIf79$S+%Hwa_!};2ixXMp1k@bZ_s*aIZpT9uIR(bngm@3GRw6l4h+vx3cU}3%xv* z_lslXM+L@)VzR2rueUB|)pJqHshPl%%(Yw9cGz zxI~SCz#8{Nfww2ohm+RDGtqPVP$Cl_m|uIiD_Z~xhImCt!QDv6f;C$-?A|h%6*lkg zvzt&#*t#|R)C)E!iC9|v?oRcTM_K#cd-;ht>p36oF!VjiyDRsSUNV_Kwb!2Hk6Az{ zg`0-zWkA<0CfzHd>yGh_JL-MY>+TJ_T>iCF_3u{`#|%!l{QiSy_|~p(`6u=#ybr}_ zc>dAukAB17KJr`b;rpHa-#foBM{UPlBbERBXpQ}9#sAuPMgl}lc#9j8wBpqo0xtjn00OdOo4ABs6JlQ1 zUJyUKtZEW1`K?|s zhPc1?cUER`Agb)o8o}yZ(ZM9CU=q%Z^k%s~4)k^0Hc6NeWX(kkI9 z1#wc5UBZrmp((I%h9%lM_*anjk-7EGvZXyx4()VMotr0g4ZHJda;N*q)AIAafor;e z_yrDovU_D#SGx~ux6NfNJZ{pyZF^VND8!Ac(0+rTCz~mz{i5%gKcx19VcIDFOLj7@ zH1bEvJra8@0!azn9DZxgk2615kC36-#N40US-Tudc9~hcJzmg+s;Y;ZbZe`SYloR} zzU+a3iKmqvx6$Ql_wtS=-{?(FVf?1DP6F@w6V3#_@dU-KRlPoT@m2gSeNB%qQ&=XK zwPDXYyaPZlX86OuTEP=_jK1RwaN%x_2q_3dbth7ZCZIqw#bNxUaups2txDS5_|7WF zhij+@HMMG>6w4fGfy^p5;mE8sI;oe-_O%noAq?`!V~+XV1GoD|Fa>Vr0b|@`+h)Xy zLi9W5XylQ{9P<$N4?~u~^${nr-v*^Ryv#5{caifh5&_PV;YOG238<17{M^^Ie?A8VD1-OkldD@a}5UK8_h?@(8{w}y1Vm*9Vj^!H| zFkp~zhJhrPmW7qNk{j-?X8VaCG?5yB;YEGD!WJgd@FtLvgH!?KY9(F$_m zv}CQ~z&$}ZaMoKn2kpeY+_3rQRkcTQ;$!q#xE(!GTBLv7B6#5MG26c%LcY4~#vHeoJ$&Lh$buH3G13f; z=^wkK>5tqFRsW7DVGwPvJJ2d&WkOkWf}|Dp!b5yGpLGA`|D^? zMm;3`Wi$TK3qc(vn$T|Xx|~P`m{D*YKg6%_H~e4AO6IwIBc*c@vRarOZYoclfp0Rb`Sb|!w3;9kZL63+$2agpSF5-%KWLBN231n-TV*}Mr1 z3@me(P2ks*?MT=?GvF7p1KE8f?B>Dj3bsBWO!s3!)1abgkL6QWQFR#%G&wxfVn71w z(y(e?@i83$ZvqcGX9r$W7gXw`Rrcl?J$@?M@FsIYLqj_)=dIu>ZsAM(y8A|-y#p*7 zV`EGrJGK_*D|2|6=Wx)MCE+y^)d(1e!8Pl0Y@Ussj7Yc$#lXP8h!B0r*phm0Kcrfd zYVUxeyXNN6OSk*-h-kTIF6No}BY{HXT%qE=tUn=h7;#1#2Fwcnz&b zhU>#j#^UNMI@h12Q)=7{Yo{sJr)SMzXBr?%fwx&C>SdG))&Cjr(kQl>0<+nkA^Wg* z7?7hJoq1=0QbOA}ZzRJ;-RkWeG&C+p&T;!MfJ`9n6eYXL_2y#l8TBXWpgFa+^mIj{ z7U%d1&*#ya@i(oM-9$fnPuQ$tw>hUsRU zTw{yv&_oU*xy%0zjii!qMI&f^RtTk5tABAFhC~^XMZ8v>}B!cl}nRQT+K54)cMC!I1^vVImzUEOb+t)ycV%KI12M!#RD8Ikk zWr|TdpKE^RS2`fTbwKAy7}2_)#e+r;CkU)Vl-j>pC-Hp3^I-UY8Qo&yz7pMgqi>-a z^P_OQEr9@mfP=J_FFMkyE-l;}?pBF&iM7b%ESB3X$3xetqmF2>w^h|2F^RFam?>a~ zfi9V0r-826$w6i~1mBii^UhSL`c)X!vc~r{s9T-4ZQ?NZQ(cEyW5!Z)ir?r>6C`G3XWrS5PRVy1RFd@y zmSzuX0Va>Q&;Uj%2s9R@Vh@t~br#H6Fk{Ay*j8s~$S;wp{(2w8I7uJMWxtv z^G@QCobS~Mz3@CANgUn=-#3H7(U2q7xmS^wv8ATGXSy_MeeE=mkmn`GSKmcdmcrFg zkL4X9*oqqjNrsnNmm~EiNZ!=Jn74Mq*(~gf5KXKR-Uch94KIvwpSr-qI2pv!X9--~ z$al^MQp2k6$WsMrlFWa}y8>Rv;IcTIoO*8(@^w8&{0bl9A#82k;R6PA50qjH{Zf;Y zQJ>;p?vKOmyLN&X3=TYocJC){j9_9I1u;;ozV#Ml-}q&voJcV70|f|;wt!>l98|6I z-N!6L-*ExZdh#lS%xUln6&DD);gU!DM3Jf?9w3H)?)j^BXFZ`+}XfV(S>RxoUDaDwPad$dP;k<> zguM)~HI9TiN-ZOayK&$R#%Kv;5?i@bdVqwtI@oVAOq7*}O2&Si*6PWzMpo}+p}Qma!}&<=u&w15 zxxu9pzPDET+!{Hs8yIoSR`$0;eun5;>MO#*b_ea!_2CBlHpM(eCqUi-CUiIuB(jpv zrks-_4P%MZlk8rv2d(*GM5RGAKpO?_kKS?|r%Fa<`a|lou(hNjrU42MRd7O#!J)&U zeA}2)41byx)j^BF>pFDJ=k3r=$9Oo^RKWYZ@^+pL@F&fL*^mye@(8i*Aa($L+66HO z%mB&o3Yk6%76v%}H~9H9mP@_;#S!ESvetF5oqNzOx*Lcn@(6Smh_*qE#b7}3^0l`- zOZ~{zj4}U|x#=97Nnh;G*Yca-OHqhDGV)?&6K;)3NA45~P9?2xa4{uK(tw&oRt{dx}Fhu1i7D!cUmW$IPFqzmAc7_j??VHAgh;Q>RX znetF-2}3M$NppP*%{)Wo3Nj`~O-*;nHp{!hZDZ&8u9{9dq)3g}2t5L2Przsc$(B4H ze5sbJrupEzu(5&%+avdG_A(;<4ignASIZm9s4ppeT8{A8CQoBgK2YleqfSP9*sx)v z;9}+~YKn$P$HN%ZGw^~1i<~v^GHyQ9u27{n+&}^yfGx>j62_pLGd+N?s{x6R_cudw>Q;r-E&M8auDUsu(WdSd{m-YP!T5%(>iHOvqPtE zkf)WRRMdJVg-b^hY%r54Jsw&YUmh3`&?%c>J>DfCARr)S=^5tt6aeg%84xa-Ky^0X3L`E&=4IT#TSZj){74^R`o3_4%Pmt(>LpC!g=d99tfTK1-B67-J>~ z=VYja;m3smG@e= zQF6~r9##1!%(i)Y(IaUC@x@~vZzI2W4t*gwaNxiZx3sXlcr_)9Qd&dx#vbtFN0?Gr zZdNO3)J+W5sDA=5Fd{_m3@A`wVdbe88%J>zN4Lpl?E(;v3x1j*R%80R_*%f<5dK!v53W#q1*g<7PM=JdH*#Fx*z^`Jn?V2<_dx4NX~JU1FPFMI`H zFR>G2CM|VM)G;t_(w^Bd_+iakQZOa+f@pl|s^;m;ff^q6pD)HSV9Yvwk?qmOP*oW% zHBZyqV@72SuE~yhM@sMj*SPQ6d(2&3nOK7qwkyqto{R)z3MomF1>d>zC=i8Y4P^pX zS}pgHw#tMfH6C|_mq}S*8CSUoBx^^C!|+Q6k(zJml&F@#?x~t|vwpBUJ}v6>-q-{4 z%~f~%NDWu385sE2u#NR|PY5l83ZtfZUD~-49Py$gh1BG~$LpVY)(vzase3Sx&;03h zaS$Z5{BlPa&1gv>{(W22O(1b&hb_6c7PB;qMloZ8Q?OS`a_*LR?mc6T~J%=jE zxsf;ch>!FUjf!yRB7{vIdR`}Sf=*Q3%ihNddM)9DgYITM2k~dW?pyfwRmv4d+ZM+0 zz#{7r`^?-$$Rg|R0a;`*-TaBlRI=@Mxe+5q%rOc^j5@A-PGVx0*HrpQN5wGue{)Z1 z6ucAB+uV4^8w&_ne~i(d$%YhH!LsebJ|1$xLCeiC$qP@<1q}Tdnul1b5@HcIxWNr> z=*BLqCS*GDzXR@r-9YDVq ztLeuoZ`TJt_df4*!Y88@7E(0V!uxL(#n)}>%JoCI`0Jcz6`GZGroa#}YN(-BO5z=E z)SK(wT8Aljo!(TET)Xm4Z2Zn-{#5TBj#OU@C4iSuK?N05P(cM10000}XTz;*?syKW z)~+gap}%kE@U!(FE`Rl{&!`W#62k=3q&5Y;f~jZfnP74^f*0Oi_Zr@wx95d7ywiK4 z;{!!lULyxN)z|e&npjJ3Xf4uH+=4e)^6R*j0YThi-wT2uNH0BUZ^1HokRCli576rY z06-6Ex2ixaV;Rd>c8`_l&TYYp2jQM|bJCV7n*j>P<;8vA$M|trYWD13^Qvy-msKWV z!ZxY&C`~F$L$Y}Yp~*)kZck~mCU5YZtBHL~JgTUo+Ao4F1Er%F>MV)JorB3MlWS1! zyM?DyZamf{BX{>%KAx*a;!@rOd)yzwQNo9XaIZNLs$FqIGFZVU$)hCbzaX~iJ0Pmq zK>{({)XLs0B2>CfeHxO&g{9@h7>Xs!BZb7o%@`PF6Jl9NiwwDeP+~ijJYtA?GGYC5 z0}`GOS-zeZF>G_5N~52Hzo?hp-dquHoDLNYz-UdBVuG^Sk5rVCC}h4tx(q(Za}O`o zSSV2Mxlyb>c~K;>8vc9bRk3%^<>Xy7=ZTN-xA>gCmV-#WdQiw7y`iD)dxBYlcveRE1A)wVNl(NMM=FMQj)NVe!U5iJ1g&soy# zZCXH(()`ccX&pYNyw`oO-Mg~Q`!Tov({s{24ylOuI+=HKk4jnQt8A66xIDy{3(HnF zC27w?oo*{cixw?fx0g(mWoSFjU5KS=(>MWU0d*MMYgWl@MF^>A21=bFGhS6Dwu$^@ zSPnUz;<&@2Nfe@X-dtn;e->=%2CytUv@H^f`|ES{2xZ#9n^DUs{hDRDitOXtM4DmpzkRxiq zot=y8*d6ZBmO&O-WRb11{(b|dmJz+WZ91YWa*bJ=J#i$^!g=yq&B>(dkgeI>qG65g znb!cln2G8CHHbd+hzC2j=)F*w=D3%FLBL=vAOxu^3kWvYU{h`Kxy$!yf(`9OohnWI zH?uup3r|-1|BWeuOS#>cD<=p&3SQzr;U61IoApPN<+viuViq^J@sZm0@{{BY;znVm zcf6-BX15$Y&&B9l#}lC}o#T)@#v%8I-YJ|4(cX|CLE@UhNRYTou!zOpA{Mc@NjPq| z1p_=qg1BXbA76>XlL|N)iB42PQJE-1PLWF0e~=xw@O)Gf&y)Z3vz$SAP`jj zAcMb&4RtUJ-u5h%FU1C4Sdz=RQ@^QiF$mM z$-c_MK?cZrN18w&M6-=^$r)#yaVE@AjXJ?47F!eYVmHc>io{Noju@`g_w3gEf9}AtdXY4JBfe>(BxKAh2=I)ge<@ z<|bgn2(a-cGM9b+n^2E}acgBVJg5$;V3aWdw>+cuU_SoQU1u5qz#3#u&Hxv)6#N=K zIDmWV;BJP*JquLBb9dFN;ca>S>j8escMTAfBhQ?F8GFf3l!E4P-F?#=#{Z|~#&^hTpS4&-8F zbI}Ce+dy6hN-W!o*lR6-?^aX;?eK+EF89!nDJH|ChTQ$PAHX#g4Sx|EA>p{A4^-Wu z5R%ABU8Y4D=uBZofNl=MQNcsl)E6~fc0K;-L@wBjRRE`%CCVd||LK8V+zWJM4=#Tv z%*IC53=6&5S+hkEv)PvC<+O8jn4k^f)G5XG^9tHsX3 z0emtjLUS5zw>wj_|YcqCh zXv%D8bG(9p{x^@0sUXOSD3yAmQL=oKrfM!+$!4}h&%uhRY2|6g#2cbQ6E&jvx574; zllm-J*{pGQ2@M+J(o;gzI7*+6-m0tEyF1O()Z*puY?MyH5yo4&2F zGf*loD3357T+Z9$7xGY-4%|5`zZb%+f`v}mn9VV#6@UebTTqL@e!d9d(c`oo%lXI8&}Ptau)9oelbd1KeIHDkeikBMyCLOJhsdRqa;96S{$I zzqFp;vrv48*Kg>pdQo4b0M%OdK?`$WAMt} zj0@vC92)9=HbapYq@$G=8;nK1#$`|s$x&x00II617kJ@5*1f&J}nw&*JVw! z923zcwAGBkYJS86?om6WH1osf{k!umc|)K>2H=;?O1`^fCbRp%K5RLmr%HeVC92*j z#RlqHmm9&&&KWf<7jFo@Ptm|}%Nm5O?+Y>H+f(N-=UbtT$IA7}uwS&u*V0)Y94(Oi zTTv1A$pKDCuu@!NcbRtEs}Rgqg&({_EcgAub= z#XTM}PC-(#b>)5Te-2cBk1aMr$yY})Vxeg(PpgL^bSYMW7HE1bcwGkyP#ndcVfQr6 zP%OYJUSUNIRQ4>wZq*G1+DGerXrTe6buO4oa+3}ugSd)Nmk`Q8=CMxs%;JDe&gWBD z+of<>xJAp;*XGb!hR^6_gCUmom`E9yrGOpwTVh-($TPo^1@_9D6eEEoNid!c&7$p|?Bcad#rd%9`Mj%pA{>wTw6YB;KOJCyB$U~ z1e)_BY5*e5ao<~di)uE^?QJ~%ygW)%B)3QX}R9Ia`w6_YU+QIrU?f8CyogZlS?(l<0&fJx{@1PBlyz50ROgP*(1{LdsH;WOO6wanM2AotnR9^f$Z@@P9m? z&u3);>iFV4cxCsMOr8UFBE8K?pWDF(e(JD*6a7ZsTlbDFPc3@U>3ksck5+s#!g z64g9KZU_*WL6I)XWdg+B1TsJnwS%Ff-XLcrC!tEt?vs^rXc4%Z!D&!=l70=CxE2+>@(dswSmQ2B-@HPeS$t{;cqAhm z7YVNkihvH>;+mwQ4F_N3I0g!PN)0QeF4NgoYX_g)j*o1iAJ?k0B2pHsN^5-<&w=;B{YzK756e`}J1pLe(5 zmJA$5w?mgGrBfcu3Fjpoi68JAKmg2UQPRU@PS8r23+qu+7E4Z?Rj}kwV$5o-2#_rp!^TbwH*JLyr zKkSx_qpq4DLo&}Q!%>E*rvkW+%Vo`RE;Y~>WsM`N1d}M~QmQ1vmtLP`C-jMh%!Vv& zW>>o;^rB`ch|cTcLK>T6=ri}?*X`yO?XvAN5>YBAS+F7}@HnZ-3(L5-=|b0Ai{V3pg`DAHH|_e>ZO8Ou4JPE6>lTAT5knZb2LZxB&1A0zS3+7 z5L@Nirm~&YW?VquQFx>`IFk;`H_7O>nNFobw#eh(D^)SbEoz$%alq(J)BK!yuyiP} zipi=5;MA#Z$=Jk;1j9qKIx9+ft|l$Fhp0w+6(ODz?(4M?fW7$YLfIAIXBAOoV5}Sd zlzOBn%dE~7XOORJ&>`wj;+AqFtSN+|7+5}B?#2gN(PmVBk)c$fvq)AT1M^9cS;{u} zCbb_6lP)Gx9X(pCF+x_7#Y`rZlN-R{z4fVD`4YD-6d-~P14j*pvC;VS!$LO=^c2u_ zx~V~a4e2CP6q0EW$>;;C2&0~~;7O89BVwt>8-&)_%sfbqkHLm$i)yzxp|}+V4m+}t z8o9}MA7rva=^b6Dy%ibJ+&)%15#+8*d$`QoP9f&vi7c?Bp+E)SUhYv-PENZd`RUba z5puQ`D`YMOaqBFnf(YbObET%KUMCHXL*)tPG5M$lQue6)neywx@(=-h$ zLNW@>nUzD|NZcYppg4Sp&2>$*&W2w6eOyRHk2V}S{yY~>5_*3q+Kd@;v>10@z=nPIOt+2 zS>;76&(sug0W#m+Z0iQ9lubqW>O`B-Q+DyA?rbVMFQrv*rO>I}qf|wFTwJ&YrFx}{ zU$?H#;+7xn&t|??!mO1psF3W-sgQV+q*~XCwL6kYa2p$!0{I$c3vrf%zrg2}weI)n zBzwA463$yEWTuHt>!)-E_%B=WBs!d0k0vlHp+jjCEQ6>ByHn%rTzW+*t|~6iY;Mi$ z3C7C8_yieqy#+!B=3C%0#UGW0$dO8sHRx5;fZ9E!Jk+rv)+%;y^?RerEtIJFo&p8bi%DR`gvFw^_okXM1PWPv*@dk5z zdX!Bw?NGv-*ygmOwxOrM53;FID#M*BV0OGCc18P;Zrp5IEC%!{fiHBweSc}aDR{K@A!6 zLGSxR;avi62BJsJa6%k$a2;cF_njdvnn?UTAKHK#)Bra z+G1R~+m+bSrc#v1bRbXpi{v&;V8y33Fn0gG@OjZRZ*|+-^k_WA?Q=cStuX^mM;{{| z$Pbz+VaCL)$z=4wrA?1z?`RVU_PAt?H?&T_zB@akb9gjV(`|KrP8;+Taoadsr0kv` zcS7RvZV+lS2`0Mm@R7QDBU#;=AD~_1Z+hMx@QOJh@?>X2IW+H>KDu+~E@kp^ z294A7Cj^vzf?Fp3_rT8;-idFd5dF*eRhzGF(&_QQA-y&SixNxeD64ovP*Fp1(c3i| zr(+aH-Mbf7cN{|xtOoF2B>Y337bxLVj^z{F#_UBgsUU~SSL&$XE^kPDn?dG$c;axB zDp{6Khi^N|kNn`#jQjK$-P`@ud|%u0YeZk0v9K6}!vP)RA-UDOt($H{Qct+HBUm>was}R&)o7>ts zK6AYNi@6W5KUIRz+Aa0QnFj+)+!^0@?U1B7Qu-7 zj6Wzp|76AQ&FvFqpUcp-A~f^Q+G94X56$k~-lTWXwT-nY!%UvKo7W04T5WE5Qf@fR zkU><_M|AJYt^8}AwV54iPh_sKCsZt>3dLtU4^ccr+Hdnw+&+*kGsobeif?ww#Ez}9 zFwT4+PxqI+GPn&0Z0I}QY#;efw1=o|Ut>L({ZH#~`)wTe7oN7gIQcYM{P`Rzy6cA@6pv_2hWb#FuhjiDFAwk#%Oqt&14^$&4#y+ z$9qAZu^`er`@-+N?ZMm|40Y-Jc>#3#%kWQJ=gk&^}ETw7xY#O|24X4Xg10ocGshOQFh4*pJa!VLa{0AeC2~9r?*Xl{b(S@ zm(Z07qzVW(UiYb2)lY4D^L_K)Gk5RZn;Y-!`8IB=nlCtxcJ6g2sF^~b6G@0B?;bT{ zz4gYyX!mXa_S@LaX6^Yk<4yA01+y=-ck>fH%%{zXlkt*dGB0Uece!Ibjzjd!tby*` z+t}|tC=G7SzpE5WV)8fe`J8|d&BX!%| zcV^K25GYv0f7JP9H!g&(_Fw(>$SD77ylQ)&&}U=95W-i?^PJnfZ&P@|zjik-Qv1_C zyZbb^S;61!9xweCaJI>?u)Ef+qI&u;iBfIwwYE346j-=jER3ov)i{Jjyxy!j`xseF zjhVDF7GAApk`gvc==c>O&(!4&+dHcvG7Cbsq?snfbXc(JJE{)1+lRc>_d81wS^8AIA#lQca&w*{?!o2zamKl!PLO1(NVm%K9 zx4OofmUKir?-=IV+Iw)ce5Tgqx6aRIe}CB$!V`YcmLu+H!JNgFdc{h+TVxWlV=k;O z5Mpem5Z})E=d}W~{omn>3`N-17r}yPQuIaMDJX_J?iUhVSP8s0vkjPTlNef};=1k$72srY8fiz|z&xzvZsJwsAOU7e$LKf<0Xl%e z&rukBNT5ogu&t6_mEfJ!*-wWO(}&I$M~dyY^4FXd8M;|K9?3Yr2W-9)tn9>)hrl zJyEo#8)>$bEK9SB&9ql4%F(-{y4+xntMRndCmTypCy*6Mv!tSrZpzuC4&o>?mF5auc*&sB|t62zy$D@WZ#%&jD^mmc-_ z_}U7?f}ieIUrOgA@jorLkjVT%K?oc+i(5xs-lcA$YbaCMrvc^>{CJ}egCp5eT+}f? z=$16dZ-!1oCmXQVcN@6sUVNhT3P)f?+QHP_iiDQ1Iz@qD-uKxaozba<%)XDsfpxSFU4x}p6i2vz z%R%9B2QY`Y(yEEp{oaK{64F~B-?+D&eNl+wGqbh0jM+U|@5evxQ}x~PUc{v9$`E>A z3_(Sg@HZIk#F4{X$?=#u$Sv(G0vQVfmgwiVT3DwxmpK|7x_TljtMD-KRjLH#u)FOg zNXm~}=6tGo$P$i{R%}L2aGMbpiiRVguG}O#E^F?l=_|zeVHWkZVD$lMV-N0Wy83Ci z$cbjz0Eqo9Ocwd(0p>c6*Q0K`X?=T#nQPK04q|NsA30c=j^fx1t_H2}Un(ZRP*f(G^AU3Hs(nRu zg@3v#t{km&rKHu;uq&3C)6D_W?&bmQ`Zb}~EPmd@e!>aWW=2ahq{I>o&pMX!jOxS% z;mXBr9T7d33p2j4DM(f141R1yR;!E&=M{38^G1U_lAmTntB9^0t{bD;IOU^s{}wFn zm_pdmErHk5%Bd@&@AY|_6eWYqer&5>!`mufm>+zWlV3r^YswA-V?ECnwJ_Uy`zX!y zwlbR1$)my41;H(o5c^71SxotRf((`0;nG7KSx&PdxK%u<_AaiF$;cv+uP74*EeaA} zs}J{07QVjxlguw%7#cVHCX&rmyrWi(O?XifrSQW`6y3RE8WDhyiU&@25VFh8)xC!i z72d*}YOQuRGGLzok_SZu^vW^x){q^gn&I}FF%>-2a3x|F5<0AF9EjMW!+Z1qo~hFE zG~deJB#!fIJ6MIw{;p&*K;4w(u>-?gl&4tV*Ky1vEO@W`NfHy?mWslui4bLmcq782 zWgmNae;ycXx8b{o?M#)HFE%vIhASZHqSzvR+;8}L9Nq8uj@zm8_SO(yfj(eBkkZ!n2C-k1i8YeZ+(BwkN ztt201lPEyTA3*Qqw=cq9zw>@V5rk^=Xdfqe3c!-KgO3E== zMOG?e?PY=9OhJ=2f_uighAx7pj?2J7^9V)dFH@%QR2v8#=|gJDaw@*IvZMN{3tJvn zE8##;D7ww)pwdBF%u8bb<;#ya66iH9~XznU@H6s%X%i0zO&Hd8+89QB@LENI9Uph?Sbc98fOrUtB~Ci zly1Xgj)aL%mpom@>wj%Y(tZo~>cJPO2z0^MH(D8B{G@lA7+;PT+- zO1;r#h`Z{TZ5LQ`tLxhCM#)`C8q`;CQ`n7raA(fiZ~|sJk<-oD;R1FTo))#T+3igZ z_xkc{R4^HyVk1qphjfo+{yO%-aX+6t4L^1MCmP*%hK3l2q%alVkC zi@*OeA1RF4EhTaOpQ>DIcun!bqnW~l?&_+_5<=~i_{hpAC-wLb&H?f2^Yif( zLdW>)IBwKmUw}N9aa;Yg#=*xwX9W#msDX4u>X0p*N(aMZUXtM%XAm+Nv6L=MfU;-c ziF{TfpY+GC{#?(_WrXf+{bjv6#G;g0AE9A@E5lNkq5@oUn12^PApos&mu6J*itxM3 z+o<>2NPIdF?|qWl+p@H1b%zo0#lQ>Tb&0`H>wgPRlJ-s9z!_EQ~(%D4N%Zbgu-0%d#n-wL*gh-gDUql!q{NYI&k%SJh;Nw0ovom+YQW z8zQmO74l~&<7IVqtpCQGifF!Y@S~IkY#Tj<`3!8Rn^poWr}k_;O{v~=$f%gs0d|ekA#Q6)_m+IGvoQ) z)T;QpztC_Iu6QsCri;qfF^448Mv*ZuCRK5ddnAQn>=v_lmZB)rhd7v7d4&J^ee>5B zEDVj-F9J(t8EovjrR&5_H~lR-;IiJctsE(DgK7(nWde&;>N*@3Nw+yy%+FmHn`>JJ zl&=!bn)#cNrYix(b&FL>JAlTaiuPUmX-2+$p0_}o1d8YMhN_Z8N6|HWjp}KR`snJ^ z$yRLs+t;c>YuUZ6-S*g%rx{iazn@s#IBPbomFlLvTeuGIjTCvp_)!slF0Vs-ypc+l zCeb*jvbBr}ZqRFd?VXnFoLQpk7^i((HZLyJ+O(dcH{)yT>=S9Lg%rv%|M{+44ljw|BgL#+3eeLWd6t?~dnm7<{;OElRQ*MLDFy7_6KVHSddi-qV=v zm0BiboHoeUD7#I9SEKD?U;O*eb9ro^?yGl4Nz{LJ_dsJbA3evgvDVVAFk=kE6vB_G z&o(cDd=!Gd+6obmGQawD-|Xt*^WHX5oIT`UcP_lSmsUOej|=eaQY%>~)N)Vlo6W?R4CoLPR@ z3>}ii@oied0=5jmDasu))w+8?y9W1}GO2Zjh6{1GcU-KIt+-{*b9JlQ{_*ht`O8)F z&dWn@hOU0C_gnCW`L$k|KBJT2cRJYU?z(<8@+wyrL4C0FAuu|6|L{$)zMC`{wdyr~ zI8=DM@mjmb40VoW_s}~|5d`^>R)o;f4(P3+LHJ>xHf(w=cRAoToh*G_(W=IT(J*8V zRz0)1a=bsZ8MefY-Tvdp=8jk|!!DaMGMvNLojK!q=ehWHt#2_iqu&3!OO`s$O9y0u z?}_D__ItCd2{(bgHedbe&z6Qg?ses27nesVxFk12&a6GQ4^J^TIDeluS4w3yu z=V^L|+d_@K1z1*16EI9kcXxBsNJ@97v>+YQ-H3Ecr*uencS?7cbayEY3jYm?kI(zQ z-~W9J*EzF$X5-B6&dkovefF9~6?@!vQ+sj}>gVOwOmFYS`*D_X&(zBFwuyKom=&!$ z%SKs`(tr(j^sUHn<$1ma|FxE@`FC~;+3}iGYuwFPabfIu_cP}wE3<)6ja#q3L9FXn1F8laXo;rZh zq)D8H^@N!+_)L!drSaAJkztzB+D8h)>++HV8+mK1JSFR{`3W6nQtD`?6Y8HFV zjxLRl<~j|w-9%Vx!`4CTwiTpjDHmJdYSVHv)|D25gY>sTruX(4_j_rHOeyy~QbbV* z2Y6=V>mrlrL#P6)kYBT5&76CGR`0Yo_(TI1@C*4@+{C4dm*1#MzU0=G%qI^Dbh>^;Zefk`p&r0H zumeB3uW~}gjcJ~#W$s81O>;sljT^@!TgFy))n(7A4vg&zpM8~LSACUIDrz)38|K6b zA{a1zLqE?0D*K?9_>CzM)3YbPg3we;MT`2K3-W}ge+xU4tyrqk9Q#UxmbvnV@kjz? z-u1z&V{ZGKRh`ge9=p|zELcfcV`!7%l5Xk&65uTD^rtwPXu?fw22fBsuZeKH;Pb}M@z|o{(|Zc7J7CQ0EEYCvJ4$%KTsI!?8w6rWC09FL z%4dpbK+1GvF^^&+LzF@nzSX|Tx0-c*w-R@On6}f@Cc*rp)JkIGteXDokIQm(lefN# zQPUSTQHWU&?e+sPMDb1p)1g1FeqOk7H5N>l28z`a@p6G25_)*n5?lsAzgcr7fP%X? z7#B(8Lp&C#V7}#0=x^X_Vl0S2j`2dP#$@Q(ncBzSMMr%PJdf2$Ifd9J1}-dB%lWXc zr(}3s$K%{Eah)qxd|$SA>LadMgO_86_@3s$vR16-2#U$>z61W){ozg}zR2d#9nryi zbAnX9n~Sdw^?Iis#~zvO2C{c*xM|(Wm7T7LBJVT+h^Esj`#sBHeNE@fUjhJaIkEQj zHd4&5ke8_L=Ek>F=yUj)^C<}*?rSg7A4bJ%<-m6?$k<1=R9vWV?K}~07nZ>0^|k8K z4CZXq=9b_!z6wZEx;1Wl=w4peK=P}pOMU6sH_Mect9O0Q#_d8rTh#X&0Ho&ex zwyKt)><7JLnLQ<6yU`Tlti}Ey#eEKT$J1qwd@x>aEOKl;qoNFz@T%3?6MzTJ$O9WR zbX%h~ZsQV-v~y8hdhcV5cXU>izO9o>lU<26 z)=T8}Vt2g&utV{MM>Mv6dvQ4sHfuPuv=bLEU&67$Sw2SZi!kN#*{q{~lvWQw%lcp< zd#!qM2GBAb19(F|h<<|B;nU(2ZCF)dez*9&mz{(wi#q>+H_#D|mG7l+^SX9C*%0CO zMwugT27b&+8+R@qq)ypV!6c#iw@Oy`I4>uyDnQSnRRdR-eB9@w)CvIu#fw$|cjOOD zli|G%YAs8ac&fWB20sc{sfrSJH7@nNmoGPkLE@&amWXD*1(>$M^p7HexUAuw>S=v< z9q=@X%u?N)2s?Xu6YOU1y<)}a`QYgeR*V64^3cYA=WFbtUE*wv;$GXOgZQ&7>$=F- z%}+ush#}GUm5mrva1Jz#XbK>4EY)|Q<*tNCmB)KF3yV|)YE~9aJ*j_E)>^BTU69;B zMDK9XI={_e-IXW4k6gTnNXQ!>|GZ1cX_h5@e2a(LH>a`%>p(T0oF5~P`c_@WDF`ov zRMLX<8&dqKU<~%GRV08*2+?yMR+42Ld4>DCu50CM^{E->YEqea`rRfnma6{Rc?1Yn zSV3%NHQf-pUY&L%{v1tZ7xQ2sZiIt zxb+?I1RVmiV5%s5&ruw(M!!*d>Gv^;vAH2*q394erk~ynILOtXox?AB<3~a{wG-|Z z7}p(hYJymXBJ!*Fy?=o#5MIxUfR`8Lr{z^lg8?dAj;x2j2bW1O1sT>pfi6l|B+Kew z?Ai304jON<@(?h+KYc^>x>;^`HVJjHOV(lm=PI>VuZTYo8p$E0?%l?kHm+MINBfPq z3<}#Y3@jcu!R_8r4!s_gJ%ZHREy^N5=IG7`^B;%ZT#Atrs9)QIF7dw4aTGakFAnWI zfOXDDt+9{I6^;JPkM4|NuKwiBJ&fnsIS?r0_+WN9Cz#d=<>9xfm5quI{30!YQFX5p zfzJXbX=B#~QuIOBYw~L4SaEns?8evV%Uux>DmY&U>&vm^(~-9yJ~ED$34F`+$i5{S zwzoI~KeI46#)FRmA6^*4-%T1^bzf{7CN`2VKVvv|B*w>jVZyR^64*?IIq`mo(*0y7 z+%1VX8;p_=O1Z=RjaHF2{t(8D0B-jQ)mQjaIoF+Vp&($LB=8fiNljW{oy#>5+F?ZA zpSa_~c@U7e7s*uot}$9tR6aIKUWBG^;J5yKxtbkqrDLK1?}LdQ&7TekOP}o95@64! zhLkSmxssu>&{;?3+Djk2tf)2Tdc&Uw{auo9j``D0RTilGu@OIUhG;Q;-@7m7Edx6o zhDSQdh-oh%+Pqgf&QMoea$XvF2p&oHEqQ2stg-8JYjl>dQ!%!@e@{7Z3g0*F#qIY0gvBnkF&!D?0Y!iHRd852T7!kgCeDVz;C`RoF zxZ<1=Ak3V6hy%oBK9i7jN+$lXG@Hjnr$N|5U1BgKug}~IlG3Z+ zAE9t9mwAWDBO(8ub7fHFB=ayDE@rE@51~`-=KbfUXpV6K(*)uIWEWYc=yMuNotU0r zBQw$OGSuY^*RaI|Z(I-#8A2*mu>`0RG0fAuP@R74m8=>lbidWya1p@toi+*FsdfI2 zV@`A+=W1W<>lS~rdaThRI$3iz6Rn2%)BR1oLl6NS+wu_XuCll#NTgH5OD*SH_>_{C zE<-{FMgV=R<4i@%sgbex{bwfZS0o1|`| z!3*_)nZ%LH77`y;{4>)B`n(%V#Q1*L+K<(2*A(qPiL1X@s4iHP)e282SJDUozs)xf z-L12xbJ%qp-D19ocxNoz*Y7=y_$smT-rnR3it{0K?{ILq92dq29e2}8gW`@>*E>z= zMVlMGtIcsV7k#&Yv(o;DJQr)ex9KlEYsu-*kjL?;xz%YHwI2z z#5<$zD#}pcxvVrQj%AQ#^bQhO7qK*2MhtrD>(;#TQW@6CeT!YCF^mN_{UDEYcvq>s zu=j1Mp4D_R2Wf;c+4|6pi!-*18hP4l))g3N;nMNw3UXJ$o^QrD?5xxUX8;ypOP@ zJEz~UQfXVnJ(H$dV65V-lXW7-DT19E%NsW<%$d2xrBi9FI6|zh>u=SwYGY+$d51_r z;6%=~FVauFz}B=B$v>L~$Mfp-=RCJ<#g{G7?8|OMr{lL%JFS}cJfp(2Hj+GLbCCz- zq-fjZF)E-%JtaNOZwuapv6<6OmkK8e=P@k3KbOLZdPQUKBVBeT`gGRi(RuN|!r9O8 z-b2b@*Dz%XqmUF*Ggt(A0^WqoO8}xAgH_u5H7sOwR7@1h<{B9Coa}eR^4R#^v2ihP zW)|d>WEJIEkC9NZLWUgVn=J;*3=h%Ml_1_To#OLckD^$gMk>7!^9z}) zkqU~ficmurbuVZG7sZi}`x;zPlcZZv(sVh)b-SOIsh2{pBN+dJ5+XUcP4vXmN&2(AZeZ4xwMlq+?{%lw<@lGhi z&!3F0(t^{qOui!eJ2g!{0`63yQkh_9{%*oteUEH%UGq0<-x$t<$*=%aas8C854CjO z7_}TWz{8_`ka#l4>^VKgL<^>bTSkU0B ziW6}61)EW(GVd5MxO{R7n-1HOw#ACz=23Zh<>^5*mDhS`{(Z~blVIqKCo~tsKV9W5V9Imh=Ku;bT!I$tZy)Jh7=Dz@hjikp_ja4l078jHVK^J@I? zt^_bH+`e)_v!g^!P7p?ofrYHd+k8#2SR0(`fApDeFG1Z{b?goJ!mCTZaDZGrk8@h{ zhoDTZe0%fzlp(p)kyLL)ZyS-%OmdEAyyeB6u$FO0C7|)`wJ*$e?8B29r->7-4@Q>`wk@hlyG@cK|KH!MyKoVRTXn7RW18 z-BABSbEwkn)0NbN%Q1h0V0N>tTni`v@jWUu1Ry>cJt=fT^*ee7`Ihnz%Z=KsI<17p zU@;)qyCT0rfBDJ{X6{fl;F6$Rm_U5U#1l}Hh@c*zj#A5Z$!%xzzVt~bjCh8Dynw@C zP*gsYvW<((R^DTlL-dE3()APPa0fG9cE#$;mR65ZdSs0aG!41QR&hk4FQzr73-@zT z*vw6n|8Pn8c#bSH12iC)JRZ57;cfYT+s~t`U}@SN)`rxKz_7aU!o48T$c zBch5aELyj!=@zN^z>Q7gfN7BXiY_QAL$(b zve#g@)6bo*RDnPXm7kIHH26bPQ3b-P_mWsl7!~A}@i@9hsX+`XZJZ$XoG3L%Z*v~d z$4AfJ63h>R-*PG7P-|F-60Y;4L*<0#`d!_B3u4=?OV)ipC}eahpq+daFxjQ6|D>;> z9=Q<+Hv^x#HcuEgZlv*RKd1B+4z+VivZ>u=LV;2sWhn93dtHTG0$y3(vdTS{g&mb&t4uIt`*dq!qjDUdkK zR9tX6r|J(Sa(l@9;wHM}xs->{SL<&{G}uccYBn_7!zf{&+y8XmcXan0uBr7V7$~)R zZGGAM+46O8PN9{CIX7aRbn@G~UMiN3LKcTo01P(t6gn@D`)s610H8IHlrr!p zU#(xIpKZyZs9EQ6Zf6s+naxbZ{~xC|*VRR!v;JRmJ7%)QJol@%giAc@*Gu%+LRSA^ z{i15SsG2=Q<1ylnC=+;o2?y`VR1RRqD`IIPu#PANJ)oeQy{uHz4#ba;Wbr{lV#yR9-^vZsK&(z)w1~*6c({fC7-l4zC%P(^w@JHN{ zoj=1JaLCe)?;x!OACI5LCdS${*cyuCe!YD2qq9w%7#5R8Gdq8-t(#pZ_?xSE)8q4j zW==^0W@S{&PF_O2NmGIm)g3Kj{zitK9r|M*FE6hj3(8V9x0-R9ZtP1mlttKu%Z*7y z`xOCYY&BBz6AD@_z0T9aK}^a>9wWy6$KMSb!D6F zkcdF9wexUnZMN^#c3L`{5j;}MNGrxWQxS3kwK)Qejac6{(MGT%O?#qnYJ_P8)?JQ zd?&X(i}34kT2xULco%5wuXMvCZL$lU&($wj{U*GT_ZMKQ>CvbJP#Dw`9;9b_}T6Y$9FCSN8ut2YisAzOqtTRKskiQN3_^snFUH^_h-OpLw(_e)we9U9Iti+91Plz-swH6b8Ud9Y4o0ZFoq<%!lMmXbE9Ae{h`e=;ooR}n zH=DMO4pVr+DR+dxlG?GYEd5CB07Z6#3u<3-^-IaO237U)30smJ9a%A1#|zDf3eg-d zvPU63Z~;`ApO|#N5Ezngd?A+^W$wf;E33w)i&4dTsRMp*&bZgQYOj|*l;V>|bM#S! zZ^b1rbs*f}b+AaU!>QHy3pw$1OgDnB+8oUD8*?(Isyv0;W3NlEN7kbWYQbBei?6Tz zIw=_B4N}SUt;ybriB*ZpfzDe-;9bQZee0>;UF<1Bd0gR;1e%0`(p7ZSq;`xbP-;Gj zWK~ZcaA;VVkf38A=7p?;qSRYRF#j(o66&0;FGO=noEB1-Y8K{;e~DqP#-mJY-5?=@ zat<;BG$j^$IO!ta2Y3#Na359w+FrbkeiBboj^NiuEX>C1!!r6fAL2N) zCp2zI!5wf7tK3wlJ-P~qyG-Aw$ZL+MZrEVh6=5-b5=&e~_-QT_R zE{CpsJ1V9lKF3c+swzV<{yI7z{86sn@<^_l>S5c>B{N;f4GWi?7q!j<4*}vlCJG}X zp{7`ZN2Y=g?=uB69?^=G(R@YwL~u=t-I~RE%dl5t6XPt5B0#kurJ}&~m+_&e6&6X(q5=apNYB#-dG&@09{6sY)4DuDbbSLU(wI`OQvM>738huhKFy>bxYe?2VHT26SQQkR|V5y2_;lA$c z_eC10Fa5QW$j;5o$uj;mD0Rz`^Dn4br(zaiUs6N;|_8S5{4f*ZijojK{a zzmZQyZL0Unj;)5zruwrGinY_F6*jN-jt@`sCV>t6vK}fsOpkQWJW`QZpV#-fx+kjsx)6h=#{3lp!IfDuhxj|;5%zLYG6tR=@gKqP zv4X!sbLllOrRu+O|Aq1!Ed0L)nu7mot2~a~$vZoBlh@!`?vf4Oz@mW1LHr%aK{{7{3UdDh_&LzO0`$fZ({r>C*u(-m7SIg{M(wMRie<13 z#|98=V?I@76<~-n1JeA$nDr6K_{CG6_FpuVe|)Us|A|~O`sx3d04ld!sD1iJygVoQ zU4`OGwDd2WX!7#kX%hRdpr2dt=N`@F_6L3jh}oW@KliA@n%R#~f1-Z?;!uM>eMzKW zBmaNxo+kv@KNM5^Q_?>``!h)V(Bw37F2eXaMy@80&p4Rl+(1CPLmpnBZbcA z8jEg@JUmcj64=oYIN09<*UzM4^BQJtl7cy{p9^`q3*3IEA+=+gfA>2z8|Ilf6e_;Y z*YGZ2@ze*cvwV7El@=dFLE_1E7QGKCrWl8rhu4LV&-+yU>L|0YyeZMoGMi z`M1*YALacM_1Y6{$jvPrI6kJ6R!96N{l7=hKhHprp~?G!ev1F3{QqJT$4Q~K&V1%t zQ9uM)cvWi&QVt3N4gz@;76V-CIWvPjDS*Cuz%e?}*}sA}ju*XZ~s5e?pAS zNr{Px2vb~lk7V+i5E7Oa=YK*nL88QBM>;Wtcv?ya=Kg0+5D67;k=7g=rK9i z-QUCeB?|iHx~7H}J0|u|+d%6gBYCimeuY%;DAS_@L;|h4F`!`f#mOx!D#crSTHOC7 ztXL7)SaE?1YRG^`%P`9;wmO~oCD*jFzD$dxWp|n`hzbJ6GK@(ox+nV<&KEOF*;O9IXNmOU+s9EyA6;yi;g8+f zQ+6D8m_UE0Lg@l14zDz|a@_;W%c2&3LX3fI4GL9th zNY@_XQ@9tV+neYz3}$wIcon3_vL42^EE3asRX5ztNlBVL*s*-aUBs2dWDcofLK zkwxgcO*JFAYoR$iq?chHTf3(zbRUlK;Yp(|Y=kaQEMKRgL6C^}hEKGET)c30wR3^p zyU@>7PKIR{F?bv4jiZvNZ$vy;99}hCO28G0KGO1KaikP~`D8@I+}vtf3#Iuo(en@v z(^h8P5QK}`y$x%BMGMQMVUW&6r#kZwPTQlHyZuLef-){soFN*UtRH8Ljy*m z=~;i&gKfQ&|05x^7g3NF>LSMIkevo2hHfs`G>qBT^-z~V*0NiEwieRPh7m$V!?Sux zHwDRQCo<;-5XT$6HQ>rg2Q^AzqW-(zj>aGn47x%Kz5$Z_-ncHZ(x0-a8%oE;muU7! zv@iKk%$`}jbq6z_J$L87ta3aEcl$0NRN^oCIe!lAQ{*BUMKYcRrBnJs>j_F7rFO!n zvSGYtmOzSLlAlTMF8c}>zl$yJ!1~5?6{J`?d8Dsr#>HkyO`8?=>|k+8%a@4C z3jKI2yuk)zrfyDD%J6z59qescBy&C;IlVA7Sq!sre-gc$ ziJFU*J$I9xOB)4Dfq7VCn3ht%y1#U6DZKVw=&ZY-7G*j%D&$m=%4hA|}UMrbhI*Gl`?^8$~NOi+{da7L=mWeI~Y_HptL-cXa( zW1n;2=nQh=bilBh(i|rDC)KK2PkKFSwfDo_X23IBJ4h9ji#0l=zjmowxs~4)U%CT3 z_Z!&DqGdnlZTWDDpJuYfxtp@c(JhI^g&iRMX@)a4Y2J4g7PFk z@rjQ#^vT2Rcv~A4j1CZbK)iwjXw@|iH~L9Eb@ey}`E0f!+CuOW+~FNz!FksprH#pi zYOY1Y7AJ<2kiFSRBSu7iHoi)ss?v@b_AS?!#WRr*bj|_MturV~ua|pJHe&kWFLd2f zY+EAOJ=}bV{Y=!v^V~nfA3|Qd(6I}-qD?!w08kYWSF^=po5LDms=jiff*&~=aCtak z-yvyRGL{eW*6+QHyDHs(S!4L0690+C$=8T@?xnj)-!31<6RAtzwqMGoJ35i2$$~{8 zHjZgcY_#*>^f{pr_w|& zDw9bmtjrBv9K;MnV5!DYE#LrkL0(8vQLkz${%CQ~HybJLVk`C7Z@Qq$e`NY~GpBi3Nyc5dWtM6>t3-fG0{Pp49Q9{ai6n5w`-W4g_8 zOEMMwUktEjOfLYE$wI8Tq9@q|wYA;X^zG_FRZtE$oxzrr2gETZT|=7lrMVX^eiohdV zuR&tC#CvW6|}%Y?5AfPUI2;8lj}JG z0v7_Vn-V(P0HWKhtp#ilqnvKDhZZB_)5`!aYd^~I{=m(s&!DnjZTjtliOPvIzS`m3 z{fh$XDcQB;hZJv~qA!|5df5mCV)kc}e1eM!>KgXa>kPpq@3`jvVzp?fP!axcIje&ms4t{_7kaTv)f6fE?WKCe){Z{e1P-^kb z!%GUOhmv#*Ni|`-l7tAWdQn@ADyPGK?@Nxof;Wu>ysydLTW)}TLnY@KcE>}VlR>i` zoSlLcn#h*sr%eWz+b$HqF*3|IP(n%T{ei2))<*0vs%2L`J)Q>cTC?3}7+D1ySGZ`# z|2k4aK`blGs`}NdZ92?Xw$a{UpMw<(geHuJQrO()0zRWy5iCEjrRAA4fc>z#2@29! z&htPdk!?J$!nJGf*OZ~^Ttyg{EjY!A7%Kawat5cUHboAlL2$%5MwrEW0V~devso;Z zLsK_D3jBb&D9*61gNtQA0KHDalISx`a_61ieWU0Et-W+5T5@2cSRkNMY!EUTErSwK zKlFg>bP&BLkyQIEfmmB!cjy&vXvayzQ75HRip&3cOhSPHcXSe5NsYo{J(M=+6EVrx zw~YQ&k{CkfI4s7)gqJr|R}qUR_qHc>w4kyjJ8vM$3KD-2ILIUlVbVa;ld;fphq^WM+PWh=Eli00 zu4taeSn244LcRuETd$n6=xGvYlq16taA1AK8D^(Q8l?=v3$97jAhC)zD(W23E$jDo zdl!DlbybFD!mb!Q-j@|qy~Wgv(McvKR7sh``CfQvM%nic$753P&T;J}}2hk$Ose+!Qf*nx6Oy&)Igny^h2v ze%q{m8(!>CS+)Mm;%CHv?p~!Q^S_K*f36Bg*ZPZ<-bVApV1* z8}Ofr8U82O8#PuZWi|0x>i;1AU!V?7|L0bE)h9hXVFyXDSYeU<_d5}%EGs`3w`&pW zGv}}J9R2rwRTEvnT<+|>CWyUV%I|WF^e~^1yolvoepR{~_SW>d`sb&QcLlE8U$)D? z6G2vCpWD=~f$QZ|16m?h@gDQZtjU{4s_dA?0FhBxScLwZX~3EUhE4g<=%Y2cP_nc^~;Kx5ijy=0{lHNkN*w|^AZ2!rM#Y-g**_Bm;Z_UcT`9n z{`o=1GZ1OG#M|`l8RI!M+9KyaiWQ)nMYZ^2c^u*V^LX`Xa1f`cz&vN3eH3sYAR-0# zu+K^V+=)+@6Q5&W#0Rfu``W}F9B(!F@(7=}o4HN9|$}R-Aew zC`h#!PF-oy;5$sbM{#77XnhKT!9c!#z}h1=TB8@HhZab8>>fef9W5i8vpivO!hPTG zj@%0$Bmf2i0WFB?1r4J4R4w^p;SmVRDlfOpAvw0ol_j{UA zR)aJeVgH@|7rdeNp5STBWPo^m27!GV8O+Ko!>?vPgyg8yPlOd3foIip(^~#_*8i6j zKDDSnToed={$KVbfxip#impu<>HU-PImAe97&wA(0w=dFT>=mPJow)Lqj1%f+EX8U z5d*FK^%7fB(;}$B*hRx@4h?}$ARrJR$RJ*S<^2UigMlD3aqkPtZ;hJu3U7ZC0N`DW zPW|{)U@9z`JqoA{US^S0w?luFjV33=V+8iU)xl}|M0X;BF`$# zEMUV?Sec$=H)-kweQX>-4z4q4uF*DTyebsG9603Y71f*S$0m9)g{G(eYAZAY(8$a8 zI6kliD@gvZiKi<2LhC}jF#eu30>7H_`)cC}`jf{S6vRs?6DZSbgfbYf$+HA}A02a# ztcO1S*XG_-VfT#uEYLkI*=Y>e%w1%3T;FcTSfD>}LQ>++iY=D+yEphhKp^4M(kaXP z{J`WvGQ8$ZCO)gA3sRdJfFlZkg1`cMMjn^Q{rlHXpx#260-zZn0@-aJfbPtHJ2N}n z(L{v)8EwB>n{kuM;iz(e@F7#8gk^i?47$v-{iQL!-k&$}dOy_^ck{4i{~!^;Mzev( zKlnwDZyB)+jhXV&WWuZeusROt0eYr1AhXq53w}5^#fb3BLp;kj@myVhhEJE<|7Q>Z zo?ZJdw?Q4S`wa*xwS1eX&-#IwFBK|*&XFYY9UWw(gYmRFnfer4cgkutA~lKcr}EXM z??edpXNp$ZBOm>VpIjl?EN7ZUfgjnw=R1AH@s($KGVqodwX<7t$QaI>9`y7;W-cLz1Ze(59 zK&dA`^0|go8@pj@PG9?AxV)y#Ccrep&B0O)FU`2Y8TtE0V~Q)gvh!x!6T6cVB%r7L z?c%4wy6=v<2d?=~j>q@wLLdnc0#eajn<$4--3XRCk#s7qD#Nax7o)Qf`3M)<2E+5k zP6UNjrHuy#b;@Kpc=VIknrDLpKW6RAtt(|N`S5Z7(EkxQdJiJLd7S#ZL9HAh<}PMs3mvgMes9%K|qCM%$4e=f|Tn zLm(755(t<#FsnRnSW>kK0obD^_M}NYsbmuHJsp(5A5^6TCr*Vec6_Xzy|s^i!x*mC z5qAC<`?c6wZW9AN?tR>p zInY-D0incc>@Q!1>O1=5mhWQ}P!Bldpph?4Lk;CmiE)XPnFMW#iT#&%6LHe+WC>!# z_*d?TqWvO~qb*vd2G1kTUjOTTe??Zgf3u(ljrseG|3dgBpr4W>F;t$|d;oPrEs#pT zgV**ichNp6f|73rP0xv+N?KxadDL$?mbU*!3WqxT0f7kRY+pq2Hr>c(ZpG#V;ds_8- zRS*QYE*jv1J@b6xM#)E62@Ijr+cu4h!eq}mp6*_c!|5L_AGqQH@e1l+gZUUko}&$T zL!}}XGaE?zLISAtp`r>!BTEoVqDD{9hA|}?ZhNIa7zT8&!H_fi53nXC)*t$$7ykPV zPbI+J9^7n`Edg)qzu6Igz;y0Pv%_8~_($v4Jo5j0+frEPU#2 zN||=h%1Tn3;yij95x?7doEuaB7KWVr>j;ED>f^~Jt;)8AEV^D=u-+%Gd}v@0L;&yw zK-@j}LlHqYwY3I;CkS<*34xx9xG2hUMrb3N%t!HxvhEE6yzZf+;S1+< znh(A)_hi4P#AKB5>>)*%^sI3BhICIIZ>n7w{A#4_W)=%Wi+kuL1Atjw<{oQMVd)3I z>S@c?19q;_Pjs?`S$<}8$RTGS$kREsf&!Ff5FsGCr5v z2YXz=@&k|9LrsAPJBepDIMVzv)Yqzr6;;c1wkxXb>~8M84cca1!@zf4X4-W&o5+9w z`A>n$YdfK^49m{eA1^KlGR(?)%%X~4*E4_RCT7kR;1_?pa%;2>h}*nlU4`Wds*CJb zI$3KDdCAO>tyfYGFSsoyQv3Q9;Nig}whZY+m~UB3w;cxAnfuK&*H~N`cyH;VD5&68 zFIBEHQkNsh5ABrueKMQxuwVHs$-^{m)5>k)MBDWN(BBPUzRG}y!Hw${CZpe`z0~fN zCE@-NWXjz!AKr?(PS*z4U1j{DrfjdC*I)-*(8o;??)x1T#HCa3H1(Aa{gY<$JeYd(^5EB0p|E2hGixp4r%5(B^mq5TT`0=t1t?9zrX$E+u|Tnd5K7 zy&%Lghr13~h@5wfWphCwFH?KC?ouxqY)31Nu$J`&RI2Pn_Ux|>p;&4}b`POv0b@(h z)88ZTQaBQ&P+!DNu|cu7NU*=?$|HKQFGspHoAKf5)HpC$$nO$I0}|TkD;wO;-D$d* zlh}SC7fFHZQ$t&jQ5ep3?=W^Em&kywiBb~Mm-6vDTt{UT8?oq`8{LZ}aDK}l8iX?U zZZV2h526(OjL|*jaawP$_*_CxSvR!kJC&pB*M?3AYv4-T&mwFfG`YgFu(WisL>8=Y zp*#*kX7g=zy3JoZQE|9;mp3VO2(aQ!e*CJ#lWx@~S^aGl&f8)cvukz1YaH_~SnLC1 zm>l?q;l0*GZ8PKDZa7kOB)kgomQy>2PJN4EfDbt(Z{z~Ft|V(fN2Eox2V!$AOFU}5 zjf`!AqM2R}i%-lfXlfp<98hmsoz#{9OM^}tZM(c7Taz(w7*WdY%e?a)qJHb0Vm;uh zL9(NA%6{t@{arcbh~|eyX$<_&g3}-hmy$@f{lwbU_>Y)wM$0ic${%29?VB7o=L3eV8`8r`sX~c+mG^pvHFxO;;xS(Y z5XZ)N=;K!(*W+y}?0GPp1Z zn6$WEfTULjmg&wKTuu07`6^E6+3q+)(m0R z0lz4j1F&QB->awv;Jal>EJ+J|@iYgEzJzVPrN=H)0DZ?FI>A-60dEzIW#x?w0>jPH zIA_FzH4Uod(^$)a*I##dl+6I$oTXgX5116vBKqE*<2ab)lV|nOL5&i#+1bKmFK6bc zaL0+ie?m>)lm$=R6;=PmLu|Wu?RqxJmyg~r5hNSP#tp+UdXHVx+ZqJEveMWKldWRO zAW0W>*>r!C_V1iiKAsoU^8WeRi|Lb@c-t-+c4bIEskCYzyOG4K3jZshYr}@a-R#io zx_8oeYT<$&E7Td(!ck1eUVgIcWTnC;P0Su2S5E8RNMvAIvIy|*NgO#TQc82fENwe- z`)lFqwB`?X;iSgm2<>LK9lSANpB!kyQ=zzw42#yRl6;lykq-Q|r3&jPNwiCvd~^BN zmvrp$vPN+$(cKh0v)EVzl1jwHzDL?pw`0^=1NE5Bc0r0Ud5fmCn)_co43kd+Uk$Pl zTxe&TZoo*K4}@gEBv1mt?~c!66hyOI%GY)cx^{ ztO|-G8G)r;G$`KHL#@qutPz%5$2nhWxwD)st_HcEp6-LTMn6>@OXo+3*o)xTsl%+Y zMD079vsuVmHe@g*CCOZj*Ib$Hx0V|mhSN3%#A=JS^A2;BJFm2uTt=9!?8Tr!L%UuX z^TTGl{wSbR9}TsB5ZbUt9GGvLK&=;=%xW+%{BRfCjaEfy>g?AR z?si;Y+;L+mm?%LSL>geCzZOL1?Sd*v>TjsXIq=eALXymvju~f+JkY{!E3wXmk>uOQ z*FR7ri66eoYIbl$L&nGji2Aor;U(v z=etSq4!|{~Q$dquo7BW5;HrSr>9F{E+5P6cqhygLq>p_CE*ryZ*TQu#i+%aM@dz!E zKv1n+Znb!HCWe|>;+CqKY1}kn737R{X(@D=D2Emok4`-%M_#wIcEF|E*lct7(UrF3yJZmpUS!7zrHCkLJjBx3pT~;0m zjFIEs8vW3aKcoH$U#aX1e+?3dHz*0KgDB!P*-hdJFBV>MLXu>5=~BI8FS5((TR{|# zDswz1DPm}f(`Fk8)W_wGhiRNULF={*Fon6LUZ zUkT(sEo@xe=p@3!hlR>|Aa1h?htZEXhg!v@b+)0PE{1yM_h1!foH-}^RN1~@+D?$< zSJ`UczP3@uHNF~Ez8nY+RG4v}RYsX^!pM{Qbl#X)JklmE+Z$_)hjqT|kQ-q-ycaFI zFX!q+;{%&g(yLTOgO%6Nk=BRRBgi!PrpmHgTZJL#jY9wbK~Wbaj9ZwXy|&&~`=)n(%|1a{HH2d`+4 zVP*-`!62H5v4hqWUI>`^Ol2T<2JdElhI#(ec-^xV@8xWO?bVTw3L!{^045)_CUPzr z2SbCV49J(chV@U{-z0cUg}@QiccvcXMIiBxk{&%^xA(B&_>^-ryLQ6%Vf&hj<6|gX zfebJqCCL{=w8vjLcW}Z&hByO*=I#r1mTHa7|@r@=$&CL7bs+9S^uu=uR zNH>IN%#XVbkuy{q1$z9KMrbskDy%E?$ZN5%;3ppHI4H*0Pq?}C5Ad)IPLgkJ1XXwP z0w_^$+89o~)g09c>1R7hG$r0O(xqzc33U|w=vp76M#3i$H!m0@XtF&&%=&&geD%;` zv?uC3awafd(`6>jtrHV3*Rbb^@6)M=0@QGswc=~-x#aMEuQ38hshAlyRm2XuHDsD+ z_C#N~xy6oG#aZFO@^~%drp|%`SE8h(`g1?uucbIg^haP(d(>Y{4qZKzwW0M)#4~F- z$z2e0gSpP~?QAVH&KL10UVj%f_B{R}(9@J(w42xT*}26|>K3)H7zv~j8$v%z9npif zaGvq|gLB|V0F4CrYX2>MCJMTkEQCaMMQ}K3f8Pu3naIz9h9dwmy{!xm-#7IkD64z} zDL?Hq1^^ZMXxK5%yds>iO4tQOydDm2x!;fZ~sw=spkkKE>L)t8Tu r0Nf0JuCnm!QIwMR6e9w0ezE0c)|H;itR>jX*BhE(dK8fZB*Xs)4m9UO literal 0 HcmV?d00001 diff --git a/_odoc-theme/fonts/PTS75F.woff2 b/_odoc-theme/fonts/PTS75F.woff2 new file mode 100644 index 0000000000000000000000000000000000000000..a0fa7de31b6d1bd6d72c5a7b51eb7f5e77fce304 GIT binary patch literal 131372 zcmb4}Ly#s+kU-nkv~AnAIc?jvjcH@rwr$(C-92sF`o8^Rk9*r!hm5LIMIJIDU#6#` zBr6Cg2nYxmC_M<;e-Y|m5C|AZ-~Yb-cm2QM1*aR~XQ-iv2|yWvBuK(A!u}!qg#s7X zfgSrH4xefTf*L&H1O)6hxLKzt>LP-s8N0vJQ11A{{1s4uQNeK^!8<{yc=R(^8BV z^zJ80qhva9%W_sE82-vK0#Z?>z8#+{a{5zf5j59$!Hl%&j*?&o{Qo1Q4|wvs@VN88 z`~KSdlCzjKvuKj1vQF|?GFu{NXIJPF)!iy#XNQDiP{>vqYO2(d5XKzDzz8i;Z!Cz6 zrtScVhI5dRKvz~)8DI4!lFl@hbxwl9WL+;Tn&(MlLYE6p=aVay-NAr|R9wwct5;>r z_fS=o&wFX=lWZjQsxPWb)|+gR`H}w^_;jEOn;RrFK!(cYC9mL@_cs31)3_x|aOD`s z&NaIExf8w!a9e0>Y%3{IN#mXDbf!re?ZI}uHQGg_5E8+_&9@tWKu6w_OXrr-^}3gl zj<{S-d5*%!Dv?V~8PZ^}WG1W9S|{!-s(8s!+TqmANpk@=*^8=L;#H~4S5tXRIxXQT z#hHT5-F8*G^ITCrQRP2T_fGOmykbzMEKMG^gWjI(@?0h7VoYOM$Ex8isCDHtDFkWv zjaT_=*)eQyqvWCe@Te8-n{!N=lTq2BS~?J7`a4tA#RAe7GUqq$M)$lC5Tiwrngs() z)%zagrT|rl`sGgDI>7j=a90;8;Vs?K?Z%&MGWEgOzIoxgX5?>JOM!^ij)bO+lzjL* z>O5?14yShJ_d_-T$;SX46a!kjp1r z_qikuCRDpi*>|njKa&hJxHo@|KhUfDCX1V%a(*V&X-*;Y@dR#V=9Ux;{Ze5uw&AzD z3gTa;y4ksK8)R`*GN=qX8INJ>YVuC}2nYbxP%Fst-~@>M4+k~_Jm8@Ni% zuA+t9-YT~1Zy0kNd;ZF9Z@HmfsLe3{vn}tyrJPVUNN}HxTjKY?dGH%fc-Gr_rNhAu zYhqU=9jrXAtYoJ3-7Z-H@3xQz+|rtJ!d0cn3!K)R)}R!$k%E3(H=t9e^!6 zJ0>MWS$9Y!b}b2=ve6L{m_s1wt5!PO26b%Iwr_+3M0=JgYtaD^NU5e&o~^j*_gifnh#9>ggiym8}s8r&&d8&o}Z8LQ|F&R6N1BV{-7m^>97jD zAY8hev^hz-2uBSjr3ic^z#+W{e8Uek9=H3at7VD-2<$Ob)sDSuIL&?g_8a5#8BkV&t@gVhv7vwYj3w){O zD8ysl@X&l{el|IjuJh?8C!~;bP5`KH{k@zo&fM^?d)(`*M?5=eZLH_|g}gRauY6G; zE>Pin|6hM_ATL+|Jg^(a3j|OL;{^)1fzkQ{^e0C*R6ZB_2mBQ{>#;i(`H=k{7#-9q z%^e1`{Epf9A~k~alJ-%U0q_3<#QN?(1TvtWRzUqQ@)d6c#zO!*MEkK|;Q+|rG4E&p z%B^&CK%o#W@L|H0Qc;bm}5Y^u;>@XKB^qOtYmpC%aF? zfGucZ$H!CA{}TU83r+w%s>z1#sO!MAs83cNnS>MN-GQTYP}lCp1p`=?zh zgn<$9Mvz9DqqgQjX**`x^vNpy)~LD#?dmo4)V}>HHA9u^5}Q@GZa+j}PCLW+?M`YW z_?ZH7JF!1Lu6kDTf7*!Z@tJ2tu%cTsIz3Y=pygW9#LX46{wqM;J zZci2T1K%qk=2;I16`X#zR#!ZShdW+%pyVfgu2WWqKmj)qff~#vx@i)fMmqfCPhF{2rw0( z%K-p7B0Z&sc%`I(-QG~Kp9o?hbJYVjpZVm<6mBr0WMsI+JR#iMV*z?P!2xKXqsU9D zA$8gHK`yD_7WPv4odBZD1H+iUbG-`yuG2YQ)U&w8xlQf&ai3NjcY5k8z7LN{;7f@A z$H)a!u@`5p%YF`*?)HIH@#2JsraNsXe8D2AN3cH#Ke-!7rk2B)Q0c@iAIK0pe-=Sq zPj73d#NFt6+2+^-bCfjN^^MPu`yn)y1pvD}0_DVz{Ys#OlX-DNrU|xoZdqdGl{Rfs-J!+V+}m$~G7VqS5dC4H103 zK`f|99E{=F{rLo;&*4CTdl}Tl)wEY^2ntLRy0lZS0tGYr#=AlL-ez!Zr8Q?gs93PV z6+yijUvAti45I8ikj2Xrh#h%98WB?MF>Jz1k@JTnY*F)&II=Vq&RR8t{3aF9d~;|~ z1A7jIjr_1*f8rUbnBZS_oYMa-1Q2|l{+m0vj9h)0H#)vx@dD!) z)NoZ=OE$cX+fzzFND^wSop$F&cMR()o1Xv;>`Vz5d!aW?<2ceP7qDQf?)IdVZC9#35rq;->gQq@T`G22s^heG zK_S%W%-Z(cv$A~vF^d6!i^g2=S^#Wx?XgX<#q2_yxpTx0&J;b<)q2y_cBu<2ztQ2y zSWvfh`t*lHtPB`I^yrL0shGNcT>4}@nuxtW>m@=mm6NQm(!2EEIHrvZldq&;&=cZ2 zoM+t{)TYeKga<${d@eYeA(qhd&VjVsmZ=|0>C>!j)rf#U@>AW@>V-$C*dln5uze-F zj_b_fw>B1B!r`}2wUZr|6NDUC9Qznbh26BCl;<5Zd%q6q7#>2}sTcMgqMR$aqjJe9 z;z4mqol$33zwucoDCJU%m#-J@VcxW0r+I~8vYvyN5f6h1a%uC!Mbx!Y!v+O~KS8Ir zAMQH070ITX=&6Vh6~6iYGK^ddg;nn$OpL23s6%Rcg=u+5jq1XT8KFoTV~-h=Ym}HN zYmAv2gBb29-76{-spCfpX?e^}|HuoG^cLy1Kf%usYhJ;9@t-0w+jF&x99uVYS#1Acb-n01|af^mxRm6^ZDjYXF?x;lv})VLom3njjR z8l2y6FG%uTTIdtl(7nn551o->nIi*O)+yc1>LuorBbNEt1YW)LSC(xH3cCz`>aVg1 zH2cP~){q6K#>X?0Bk;8IiPW18KYiD`y&A5K1SceR{Pj%EY$;~~@0O)Q02ZjM1nFvC z9BQdiNYYocQ@7HDw!Q-$E6qOxK@;FWN-M!A5QXQ!WSfNrcuj56db)cj(d;t`c-$_} z*ZqO(kJSzL;Nr=UDn)Q9l3*(Wq}(ymFR?PRk4jnY)9Vu+D6QPx#|l}S9Iu2tZWdA= zJyJ+RBlm`Nfbu7xWwMBG3RNf5#U<}5N0z>7F-o+|UK8xF24NxlZ&0HB76GB`uLXv= zxk}Zy}Gzhv`BSHlyceFHo!!*N(JJ1Uq9_PYRUFIEa+9 zW6tzVdoDI}HRO`~-Srdw$;eOON7+yIt^WjQH}@TrdMdsSrV%^Y2l3aKlp{@yL%whI zY-b!)7cM(B3jSdTey_vaw-jd{Ssoe8oDTk9g#8IEJes9{zEi4;>8v!W=(Nq+j1_h& zD)VUwd*^(Vu)_3ttHJIUk%}UUPTzoPm8*6ShLFEbN-CYcGNtmhAT_c-TzDvE@xu-W z#&?QOeivhmVNIH1yqA?JehRnV8nM+;94`ad_4 z!1-^X`62p?3c@U#!$3?9_Mp=l2C~&%1yopy7zlr;1OyP~ilGnY0a$%z_NxM z=rCJ`t#=0rXkuG~6@QpUL=j|ctbK}OXdZD#*8Z(oOa$oQlRsgYH@1<|+|ZUy@LBQz zB5C9xHd*LB+4YguzKrAQ6y)Ts{*r(g3<IDHH9rH&R=rDlIS#V}{g9)K0$3 z5=3yTy0V>*O79pJ4jW#bi!qRA%wjlRf}#$$MH{{59`F_Dda2p~A&GjQPSz<4?Y48! z_HnFOtL#^5{&t4w$_wKRI=-PsCd`Uj0s4Bo&QPqKI~}m^(aWle!$uDZR^s0(SoWIR zgVo!2t*|Jw7)`B3ER4WhXxSwj07S`M6}#;V_nS{mGsC-9L6e8YZeWCTWv;(zOAZ05O zl~AwYPCKhmL5{!b_lqSn*A_}ufR#}GB?{x*>CF3g`N*4nu({sq!1%>}W;(MxE;Brz zPfbEXU3`S+At0c|OzurIUlcV50up=q*AHq&ioJs=XwBOP81`9Spcl_jkELJ9uem=i zNkq!T;4=iEHAk#LbA1+A1D81sbRYo%8Q~AF5$D{%CNa?gxR09bc98e~3y1xQo zFdeVoAjDM`*e0+SBpD1oks{GVqSTm+lo1qb4ReVEijA#Gd=>M`<@(o}ca@z4oi~MN zd!N^5-~Eyz{=YYSi;2QSBPGz8U^Tm@RKL0CMr{;ed<2|Cf-5%vo+E7)?DiDcIM#bFz3XqwguQ;$PIP3E;ugk7RyJLd01wK+c!rny}B8zBFW;F|%nA-KLJ zv($UAC(i=2At~KyX3-sdhX?{ORHLty^n?(3t@7KklQyT@C&YoXs6*X^`U z5ZUVk`0VjK{e7s%?>T?<^rTlW%35hg?YfyF;GM}&!!&VK574Q9!rY(I^~`oW%k_-7 z#aj;)d+S}-&sAQhq^+Esv$SdSGn_g)&ib2N_H|+3#Z3UZLQ)m4b0(Jeh!*fd2mSmA zZ`k0`(Whb9wv)r;<_7rS2(^*&XxTcwJs*61F(G<=QhGppJIs8)jLMf`1Ltv0=C-En zJ#IQSb17w>TuQCt9HpPGZI#P*5c}PA*_OWd)%~fO>aoOTO}wiKI%-rknS&k+YGIU2 z;X}B4|8*!|qQ4$x#9|~2p9k-DCR%`&a(yB%Rf%MUbQ}s}NtKd3Q)wZ)W#eEkj>KOG zNqd0?%@kdNW%J@9>PanCm3iVa+GV*>w;Hv2E%DpV2e$j);i4_tcwVgL5n+Nr&@2ek zNJfF$Hcc~O^~+}EegOE>hqqSOFHhW5NBQmtH?%H=v<)@)Sy|4r-%oH1UVBA0SG@Ke z%b2wSe7V#fr`~5(`aV0gZf|S8YV>L%NR9n|+*kRSJFtrce+yyT!`NAz+YEAhzqvmt z){E7Ix&YD8~UaZ!uG0L}0q2kgP%vcmwR}OLc!F`Xf z!>49g@-ffd8iYs|oVcO*G&fL^j>>_8lF5|}Ff{D7AWbN6aXMMJM zJaroui+rl#YI&Mew`^l}qgLmd(#{@tr(Pn7N9|vN3wo=4OZuo0%SeLAs0W~QqFNrE zq)`i1L%)j4D&Co~&d^y#5^rwYQIy!$!|r4K;SE<$x;{RfSVqEg*dWrakjbp4w(W={ zx}##m`p}48J_w$72CQPWaU!8MegQ}HZ+;foz5yrlFDR8Bu!}One-+Xla zda)wHJ4Fl*aQ~{5>$4d{70k{bG5d|?o2p-OyB0vuiq=g!_s|0UCVGrsl&d(77t-@)q zlbDpG4)T{P64+t%c9Vjhu=3#7dqRL*e_F{`5{}ay2c7E4#<#Dk$5<=C=C-u`+x4w- z9HN?V%1WM=dU%C$p6V@TlYtofEMeipL0-!>vAPjD4r^WXOK2%+h+4K`l_!LBj(lvH z3)?cl*E-MB5wnO=*eYy(3HKrGf*}-Bq;hf-=gp}NXq{L66H))=1;?GtjM+oY82+I= zBOY{P-J?E!htvuD9O^tM&CX7?;ZOlTFa`(L})z$DP|$f%BiA%bsmhGFTL~<(I~4ZFN*upmEsQ{ zb@T;DZceY_#(+d!gM=D|j-EcggB42CCex+Rwn|nn56i)EpNDW?B%!;H}pShq4xfKiS$wvJ?slAc70r~Li9Jczp07=kuw9;tfE zKkHZRd6A(hv7`x{MVc0du8_xQ<2ViDtrt6>O~N2S@o4zm$vTuw*-CzyDSUPG01_fB zH2YVGr?}KC+na<$NfM=mYc5`AEr#`5MVaK~uC|ya8$)UFv&AR2d6PxBMB4EOeRY5V z>6O1{wM>@G$f%u`obKJ(j+<%jI|9u%hwn+j^QIlK83H%g?=F%=d2g5gd!1To5vL2v zp&SboNBJJ~Ec>$=@pzH!=4(w&pBTvo2<)j@I{T1Pms1F7GiXOB(W+lmLt$(a?Y)~@ z5TQoon0AcuOeoQ)`K8y^v^XwdDy3^y?mmAS<(DIELP^HxYdB~?(r>ZE&sI?Gtx&ge zeerZ-VLblG6UKn>oisH1f_B0DqLi7UrLncKPM>4vVj_Zyh=76VEaAG<6qC9{AMJ%$ zrZ=U_S1|I(bDe@~jnMdJfp;QFjASp4#KudD6i*^or%E<|A>UO0EeI*M*qlmZ&X;mi zBI?0cwW*5a+4|5ahV{v)tVmYR1=cRuM`r7?>-i|0_hnt{4QpS|JA0d%59cAU;$v;a zX16$7Rc;Z)@{Hu*@!;b61oJ5AHxxSS1PjLm0gGl7Dqe=Jx76F3L@pyLp0W}$ECvy( zwN5fB&nMl zHi=wS+MQuHMZuQKeyL8Zyw0sys$TF1XQ03tjZz`A(PTC2rAyzN&y4GO(=!1@&@VM# zu83+QC@hOXuLT=>BYGIw047p;qEMBi$CNnCih17POV7>vHQIB}&Yy~1$oTZk`V7uC z=~R^FJudxIhSp1L8wgKqRBpQ2N=y#ovr9r2)PzSPrenMvP2Txe`y#MeAff(HQm2mT zFd^?jGF|%ZD=HipB#L*)M`AZylTN5lkjpmZzFVq5+EE9+`7kGv{07i}tSW(5P~plV z6cf3q9&N-zgd=`_=?K=s4LRFvkeN0>BE-LCXP##E{_g5uF&C1U9f@m0(^Jqyb>h5v!3M+Sad4~gGs)2I?dB1!Ial!8vMM4906jlxKtmgHqQ-lKSIz#2`h z5Qi~>hIp*xEyV`^lxuYnnRehX)J7;GCzN@Bvk4Ny`IqAAk{SSFwO?)a((2t#9M|yr z3cdxQE=iHRRVzc;_9-n6)zbPbUHdPqggw~hh`r=8FMP2i$BQw&=;t&Oyg*J}jLmK? zPPL_UY8^baAF484W$kpY6ln$rQB|052P7xm=ty_FtGy$e%r(7d+WOl<0kE3gl7*@; zJa>em(u55kPJ82>4RuL2yAM(E7eLcZFPQC-SRP;J1#@{4^ zzwKCdHy|TMfn2TKjzw0o=Zx&~aYcbasK9O$j&0@As@#r+uP!IP-M! z8h%a2(pZ?H4Y;%iK$A53uWQ7%63gM)u1K{u-QGj3PhRU0cFnP4gT!CwPsYRHZHt~M z!TA~&V+w@#Y8xl^cvwPwJw26=wQL$Ue;Q~cLpj%(S3$V$kZh3=SR?ZtU3rWAs&(ZI zly1d0d>zUN7??58O^tkPu22 zaBIf*XwiET#ocJZRbS)Qky#eym#KX`Mvd8bB?7G;BAV^f5s%#1 z;CrqlsU2tY^)OPOKXLz=pQ%H!YuVo!fz#Y7XB9O=c`nO6{FoNKevg)V*$rm(&{tP% zuJb2(NS(K+b{yHc*)A)^znh6DFqFP*;hApo!LjMWZ$&A+@$JwD+tg=TU`x8PL@)Gc zFQ$l~t&M%IL@H4E@gt1t0?9e-MFE7Upjxzo)u#VkXo%OOn*JrXEyB&L{u`?vs0B+f zRsWt5D|YQ&JU;4&2wVWOpXNRxr~m3gbz`7>DRqcG1o zM>m+2csS^E@6>%kN)+Z9nk71ho?GzOT0Q0zmU3<5o|OeG^fTh>@5rd};Fh&2o+);} z##Jm*9-rz$N}4<;x_9Oy{WtcO>|GV2a9HGEOLr$YPY2ee2mQ`?rqAZBx%2V+2R-bB zK6-XU?*GNW3KM+*A+v}u{SZPu8C`V|Zp~MB27RDbce~<|UHjJ$#P{;x7cK$;R=#`> z%~3N}uXRp1f)X}9MiiO`6#R(^SfbXUu=UYGsx6m89A%Umr6#qyjY6A7dNCKaf-|_wa>_Z;JbNyew@Ss5@d(n?Mt|Qv7AY zpjl&FECHF|^Wkg+lMp~yEA310WX)`F>Ke&SWTP2A?YMZ2~erdw%KYM``bQ1vMX|LZ~-dJ1Q zT-{ynxJMk0hE6saZoR34nv_BB{r0K6qOkq)CspK`O_o)jvHYgUd#`8ibK7q&{=4Tp z? zTW!*Oz@+r7(prg9TuTF&t#gSx;LT>SN}-$F1Xe(!@qOreoAswU4#BZ3AjA>$QyH=0e(XCZ?>JO(j^%q%(IQIoYJ>hM)729a9F;;M&gi?)O%h`t zVU=EYV(Z0VsFfmMeLGtD_n8X6?1JSArH_S1?Ga5qH8Yaex-ng$p-P6uLl<|Gzr+@< z`gpxTJ3HCw2c|vA3-Z%zYIyxoiH_iTW4WVS=)vjO@?+w6c`x&%{liwKhq(eaoJ~tl z9Z}DbBHd|yek5Q5-$HMd0eOP{TMl(jEDXBYrMY>jj>04m zdNoMjUCo~~{Ru~7y%hdfK}efiIuBERSe>Z-A?^Y>TRM9qBUkiGn6;1JOpTnNu+diQL^nxD)S_k9lUo| zP(b|bbGUO=7((Fb?DcAWv&7JkaZfs)b8?$PfYLSR;%0wapHo2o&tCPW)Z0Q2#j_i) ze%f|5HCsYr@s!6TNoGyTMUQ7TdFfIgso=XqW=@R*ZuamEJ!kI4_Uh(}OTuMK+-eJh z{N-d}uUA9>_O>o`Z!X_|lR4K~T=)w&SqvQ3R{*{1im2hm92Hxcm}PU>Q7=~pH^z3U z&D}p^_c9NknoIO~bVl2QBU%B9&_CI*HSru{nAV2+owEnISSN%uo~W^G(USzSJILb8 z!>HnnHOl2HJNNzvA@aDk`Qd6;}naJNO&YJ;VG;Rml-1FO6Kew zVjAQT3+?Ne%!a# zy!gFHCPt(ae;BpE`Aj*b!1nyYB1;oYiRh>O$g5h>d#?O+INw9RLz7geav3+^`51J6 zi+_hjCDS@OhWs$&dsZ->k_mTsSwEgdVvgP`ly^ZeDuqH^z_rnAVe^$E>3PGU(kO?E zR>_7QF7rjJ3xAhl>#7g)Gyn+GoQNjQ85?f|LgG3uV}N*=iK4%A(dZACF(+qsOYw|%lezMEu!l5t*2@=t@fVV5@jTO zw2(9TD>jh2Fi>Y6)zjx8Y$FC)G@gR~8LimvnVMhy5D!K2$L(xLca3n&#NRAq_P4dV zpb(+2$tb$b?5&3rBPq2Ud}$aEsI*|j#DLaVs?)O7L-x%PvjH+Y1h>_&wH0}3`A zYnt`Z#NOoVt@7sb?(SZ`u4Y{r+C+ZMUZ{->rK68!9Pu|1!lmMbUv_3(=AFotT@VB_ z4Rs$fKBPN@cS(%)DmD9yV&aPYQ))jyrJLM2iCyiYXob-$Vi>kTS?jAxPu)O z>{f^~Tn6MITd9E3u&VM@)JtP+cfz}#jP8YcCVklP{v|wr(OW2p?rr)`LUbJ;eyPJu z)WMzk#^&vg5*5!PaTDM$)77I6xWXX)a(NGB8+eFy4R~O~(LX1(OaMo3E75heJ%q!e zCfyN26wcw$+(Y~Q&)c0~CnFgX$o0`JOHTNHam>MA0IkG=wZIJ!DQ|>{brDwM-gF5F z=J}VvhL4Q1%-x;;PGTkFk0TU^5(hVjH;*M98G~O2lY0+CS~F_{OQs3+QUS^>?ivvA z?na>B-!EF}D{?4&3&N-z1FFKni}6$WqODGzer(9vj`q=uNs@(00sn!vb07Uu^d7Vgm?Zjve#Z<54pgQql*vM$l#z8vb-dZPDf5_Gq85-h z9A=lVi0)p`!uk0O_<_z>i0E$4{2R)Ua2v}|X!yL31M@2i^-{g}6)V1^?YAEG&PD9) zoH}sXwEw{KJ}ICC7;EQd`tJGhNIeT7G)V9+x3XyeT<&;5>FGVdgRh}Lics?mK5gtj zmsc+Y?41mmaNM`RIQ4fIV^YC8f4%SmPHSy#w^^g+ z+GiQ^OdXSohb7a2n3eBVOq^0>7GO``q45Iowd3E;Bc^Y~{of6Z;bC8nWNI!thKI%& z5~rEAZ5L$~AEQf&T`AU3qmdgmJ8r(q2MX1k4BPC1s#9Z*Tom@#8yii^tq0qP@m%~n zPJx>ONJHcS4Y8QFP1_Y}mLWK&8ICj!-T~kOpe?F@((12SgWBWwygnF%#F!QrIv>aS z2Ql}b>tYQ8(zUz&{~&pd-v}UHF9_J1Q)CAw)v`Jjyxdd#-Q1LeX!h6W<|a2dC}>en z^z}Tcjx^HENv?mrkD|*H4ZchyYy)#xqnKxLT=cN1GgF6!ls&<2_Y~%jB_t)~9B50~ z(wdq*COQlslGv)!C)FIGS=l6zn=O@1(;v!TiObXEvT5E8l;uLi)^REKbcyQhOW=;h zsh$*()si};=h*S~lB=E^{B0IcJ=bf$ebm-F>|tr23l<`}w+hle%a~@JQ;Ln0Uhvbq zVDiNSFx~v2a$g2vU=<-rZn{na?ySg_2|nlqI~Vpb6|a&%yHgUD?7ipHocq>K9}Rb& zMhdBp9$^ty$G*0!srY-Yw5{_G-OjxR3pK|BJ9|H<99sd_3%-H=Y0CMrmKDSI*r2vqpl#9o6WJUy9`{)eLAsAIP58YvV6bZ7 zyV{o{Zl7BZNk$$NZV&(bwLZi2a2s>G4C0A63U(hDHTsW2IjPYa-QjdbjuUPl;wju$ zekGPMrH?vFR$E;dj;1u8YI1G#p?ER*$WOhWn`h#7H?J5KE3AiNlqcQPgK?Tk3v-la z6y*peKSkAcjf{X&y|!D;G6`wRFoH6g?lSZ@xH7zdKryZ;QJe}*T(wbb$uXp?ED1lE zYLc0qdM3=Z!FUzaob7kor||x^Z^_Dl))KgPJ!Y@qLTH-~2J0V!SqVR?+VUqc@0J|C zQZ;O5%Hv@l9=b4tL)7f5Jnp5wOAQSsjp`!3IO;9@`BnAqYH|wa8Udc{XcN0-S;VO* zYBJP-x~b`iKPu~Ikrz-DO`_~c_+o(__t#ky^i)-$7|=qxhUhq>-+o;rPQl`hkZjusnbWWmzG7E zJni+Ks}kgrQWNtKT%`$ebx;o@(GJRpQ_+Tfda`d0NBBm-(`1cf6W!62>oUsbWzX({ zj}Jf4DDq^~1EA6huY<4#K|jkPvHLWrYuI%@G?(%SQ2lIqtfD$(+5RFoeO_E=IViR6 zI{q56mHF|c8Uq`mHv^Bie?GUoJ!=5@GF9-_Ipn+j&xKNglXYTs{^s-GB10zJw#jBS`X1z1k0CK+zVp+fG$lMcS;|ujV zh;$Wz#2OVf;BL07of3L;O2OLTQD*jT{F5FV!~_Y);oU(04iQ9vft@-Ms>6*Ftn5uv z#TUDN*e}|&bunfGVs&@|KotKAcsw?5+--d}vWm~EI(`0Gb0Qc52Qzr*wj+g3gae&4 ze&-EASF+)$o$QT`k_dC%T&8ekIkIzf@MrkoI(}F6ReRT%h+MCh-~j)uM8fwJD>S(6 zHj^y_4^JrYuISN1bg$9#0E!G89F)YKm5^N#>PP1yF0QRp=S~`AGC|zmI-s3VU9XUO zf_qdiDAaq76k=m3>snxGFbqm+nNjK0S`=~%+FOZ8 zG9&3TyimO>oi9dBU;fu!Ua`l1x*1>D}4>UQ?!Z4l8U+NA1*=A`zlG=-kwfmqPK#pKx!^_XNPO zRJvCH6M^KiHVZ~^0 zT&pduJR_%nsIJ$+NbU>R6BQJNY)gA~oP>qG1NV8SdV*nkPU^EOX7U)P2e`TX?Mu`?oF7bx#C4(pcB9#Qhp!C%#v3wh)$HF%FB-3EvY2V1Nv^ zbfKza;hiBIo$8+7))0jL3TR=mzNYt`IztG%(IS^qTlPe)$JABq#_H>W4DYA|RaXc;VA%*-MvAT#&Mp?_?9r@t4IO@2 znJ1onue~wlNIAVWGnmz7RN|)`9hN7?B{68|7^P`q?kUWvnX3k;6ofS{1kS2|GJ_-x z{qdO20QD+Y6SHC8{GaQ3p@yJlIL*ciffCU8K8mVXM3JlaZ*~mozD(NO{8Krt57dX# zXg8*=bA}>ao)bC@!AMB(38$?-H4{Gn3aVF*z_eO-gDXlwvDb03>|p}CU98rhlv`J& z9-h6mPm#pa#08#42qMQI|M&I}ItYMOQzH^~Qi+}(Niy3kj16Q5yzm96Dg2jRi}e=; zFLvY7NKnf7daSXCwZANgXzY$)FqPlL7%GR=nr^Zl4x9%JO&M(b*E!|h5RayUyOw6v zcB0vtY`C5nBKnO}rswaIW}HKwzzp5zPv3d54gmpJ@%k zCk-^$MB&Q}D6w!qV^u3_B&@~NU}$MSngTH1=ZcG)c3kaxV@dnNx3BfYfm~d^{*s|z zE;+%xn61{G_Pq%^PNSwFuyC_E&4MoLe2TFKJ%MmJBWW8LTb<(s6?u*x$u+#(WCGvb zE~OkYao)EbjU)|IoXjXNJvfPpp#m<)&2p={>8n_%boop6J$ou$*3R}K-S2xN5V^l- zB%O6Cu{UX<<nqrSNq(x@|vRHrcrb_;SZeV!3}yBO^<`Z(AY8xoUFj8am^ zz;2xCiZ0?t0d>)hS_PGA#a_)~H2pM^^^CF~8=j*y4HKt3;UR@))KF9Ib+!46m1^hm zEN1DXB`Hkjx=N*YxJ-ssK1c3j&hZe?I&yQ0OcjcV`x5kY=VDb9_@9!#npczD?Fpb} za^IU(sg{d_vW;;uSzaD(V>+%H(3io^45Lr9^|B-t?G`tZ?PbK+1;^~8c)pM-JLOwb zT}i2jZ=qfwVSyyjTPIu!T(WphBw^y6vhrzWF+$5nHi2S0{!$Y|!DnUnpWqDgJVovF ziJvOAlJ$AIP0L>&yVfgQJ=vvwBf&TH4gC-A=-V7n35mKRA(Uj2fgteW0Tsp(T=Q&K zL>(a=n`;#1&YtU1g}Kl4iEM6PjiU==9VhBed{{6zkoqV(vJBg9(nxqrMy8^B$FY5o zH;??9+HYn}J>(iTQ1v{|SXS)%deBuOE z5sf*cV)T!0oGVT7OeizSdZDhRu(UXswu?*Ha-S3#8vm>n!%u>|yGR~yx<|FSWt*u? z{(!YL@^q#_gq%P7x5K-4vzy{y8$7HjYM}hnY*VjwU=R~@`ztAd@b5fYv1yR!_}N>w z%U+!^;MT(BI`uPX-#)=}Mb9J|VFVhC%p5QDvtCV4m_t`)kXg`S^KCfH8_R;t8evH( z*!p!|wY-Krg$YTiOQ9hwd(^r&^(iXELI$IWZ_#6UQ3+1}p~8|enUK+?Jd zzn!v9t|IHaFNl$g28eky%tgjOJ0kMGK%JG=zakC24)xky6A%(n60?4H-mJ0zzHlW> zn$t7>dCeRslVs!8kz7oHX0CGeP&b(lzaEM#L)GR)I~+R5EDXHZT%5c3;ZF~fAgmcg zrLUpGos>fE!4mu?zQHV28J4pg{j0`NzCBu~wI!x1P68 zN>hlF@sNPcLT_Q2;Ya9ui_=Dx`xny1d_xbB?IWx`LD#F_TXHwZN-YMC4i$PV?3Z&g zV~MYD=&oECzCG;j&Q+J_*9pO!zAO$et z>-6`9&#{cqqhXbInzL}Qtm0grLedF29a$aeUxVFP1M|jM8jt9bVwdChd51|7Xi}*D zqk*u^OD{o5H~3AI42&+W;&e@aVSaS-eU_3MBi0;cS z5krEz`?rZ~VKeqe2)F_JTvtu#{u^}H`-~CwuH;{r(iLS&k@=*>(^;dSJ+-RAwWVB4 zkRxgb;X1$Z{Wxqm=7oH2ea^6W5KP;tcdFX9p!LCo_=p*v8-9yM_E1{a0n~~-U)8sqzwC_v&S_aO|%U9oGl`u+`x;S!w4g4Tz zHOv_L?>o(v5i? ziY_Zw`ERhuJH>#EV=e-X;(kfo=A*&Yl__Wm1#K?f?n>+kc|Frc)uC5th<`s1779&w z6qyJDWy-r7$7~8%59a9tTj?s9@uVi-q~k_QPdb?KFQ zgYI9G3rXDRQIOg(ThGMbA4lLgL!rVx-2{y4(^vt#T~O&mqG)T@)|SotMM8Yn4uQoN z^*=F9gSKm_LV1KYJRbENuc!6Tx*cVfmSoxcM66o|$oYTeO_M^XUc4!7v`e`R_ksi} zZ0_QB!x;yk@`BZP_q3MU>?sf!qn`zg>(QNTfP`j-qs~#;(a!m>p!6t&bmsYfMJ0iS zJ(gxH~fRyuND&oB_9v74DF?#boZgcX=SU5 zZrbIkpLK$wVVk}&T!mV$TwZi6q1mj9K6H>OsRHN}cwcnuIN@kADSm`mROK$sor?j3 zADQb#!)L`49Nl@3cE+R;a;Wm_pS4zg2Nfr7(UTMhzp~SIuLlR)%g^|Dml|oienzh6 zY%u%ENsMQDarDD4+nwCVy(xfU94uMwStI#XSX{|7NZ&c9pl15yDp3r>Q~ zyBhcS5r>tHGFFRN;@=Qdh|jIud=O4{X+4)?WF=a4lCmkc+v}t5%ci1ImQ`NawVx!C z_cPN!kk1>TtU3!VVVP%Ke)TqGH^+)8HncrfjT zy2JF&?q28G0c+u=4wf|V0#~zKH=HNkIeXiy=1Xo=z_c(wxYwM;<8;(=D& zNjwHIt5uCc^J0ttPebHfbhefVVnb0EeZ|E=6EIEIpQI)??s4bdl`%-_C`TCL$Y&b6kw@?o7e1H&txD#kWyWy_ zyR91B6hsLcTMkcOYmv@tF`Cx2g3Sr0;wC#CSv|U{ak<-fc6(mEJMROPcGp-btwAE&hFB?rmiWR3Rj7Ma?5i512AC zhT+^j3HUl+2A|RAO`nljEr$Tzx>5lZ1Zy0!)iO$Qi7G3}(#(G{lgqW6!aG5O76F5@Kh})F6b#w)GfP+UvK-;_=C9(~}1`4nJl0%grNJi^G4z~H7KN+~;H!bp> z8UB3?e@%BO+ki#N$^YgL^CfBYWncbM5d1Zmf?#eWDIdjM|rJ`k3+ zQa4Vk&1{W`f3`~!7utCVSIzuvGe6=NTo+*B^5@eZP0Hs}rc~@Nru^gN-?lI*ZGnu} z0)1BrKSc-+Bbc8m3{fX_0TCfiN53&4f;t!)csjiC4B`0Zzkg$sf|0H%T``Q{bc%q z@0*|hCn2_!wtY_N2qOf&X-FBT*a?KGXuBjISgV582*BLepplslGBi;585Zsr zzww><+_=Kk8uctO8y2J24eklZdhVh7m zNZW=tzS}PlH&*|eg;q8>tce*j$Bc!uNGHhD6C~1CRPt9Zv+y_aNE>TO8?&Q}wWu0( zbg_oG+)Y@Xmo}+U#mYjn0$D8YyRiTC`QK9VfDiA&25eEi)JC*8>io^0&H`3JNp@#p zPI!KG?qLaRlH>`^3ZDGwbwr$)Sx``Egt)3#WFAKlUnNhBvDx|11?H zzkZ+7kCRbjhzljCx#8l6z4g*8nSa(wS zPvgsu6;&rF}W&>+kfjU*ldesT7V?QPpT-Z;L$ZU5NE z?ZnFj`k#Ny#E2JtpxE{`VM+&pEvb%wTmEfKkbwW^%WB=_l0<|hzJ#fy6`trj+&-^u z;^bHJjDodhf$Lt^*`!WQ7GYNuwO|zVq=Nhd#S4i&B#>m94{&YEqzS zqJS$b$}1%(3u~M?9JF-a$IfGP@6w?7iw1CI*BfOrWZrjZG_nb$#UcJ)z;@69PBwDEh*T_Z7G#3%NH{m^rq@$ zQOv%pPm(}yY1?3NsH2}KgiKniJkOcNAx$$l$F<4mID#TdiYM$PKz_Y*WPBz#Va=w; z+)ciJ&s6+-X2lP))^Rq&>%nl3KQB@_q&)M_%<|Q?V41y=B&ijKSE4`NDk#U(9rDQ^+@!gLzDi4(XoF#AH~gT zq}uE$i^{6_i=5U5GGAnl*oSU$f5)_xxAmqW9S}8<#k^Y&ObaKavLFfC+%b9!;qO^H;Uv1hVD?izC@rRK{OaU~i#{L{8XVOtbGPD^V4b9h)!B!Z^`V z3>6(4Hnc8c2K{@S96({GeAoc&QFlW#*`vXGmIL@A)$p%LSlQe~*oG|xdOZi||3D`v zw(e4CGYQ(3>l9o22lZay+>gmApEPBS(+yb^LT^|DVr&5?dcaY>I`359$t=79gf&fM z^iKI^f(O5=OREP*)Yp5@md|SCy1^0dMu&=LDwpCqxN&N^wt=H5A}uf<+%&aJ=b`$W z2bY^tVGhIUc#WZ{p99S$N!HLchE{*8@aX#TSt;CVs3nE#)JU05t)MuD3q~}Sh=224 zH^5Uy->`loU?7ZU({dW2yCw!0ICb?uHm3-lhqS;cC|monIJ!B?hRBObK|E+%KOr0B z+_}n>GFUXb5SE?D(52fAwNf}_`ip~(n z``Z|j8&aS2W;e0>%SrDAIjIE5$MWWUyyiQZ@ZopAZ5B_V2V4X^tQ{QHv0&qh;4`J* zGuwd`zj4EQK;eB|L(Y!j@E#DP&pNdD%$b7TA*dS+t?d~sIeljBOfchR*}2@EwO5f! zgtGDK+N;Lm5{VdM|DFaK~;CS zG<(FhTZ1yc9>cg8}TX4$=cH%`TW2 zl#)&76jt>N^|vf-#I^ITd;gzLJ?ee%6pi7fX`Et44shxU{c$Bey{lnK&rsiBGgTGU zN61N!HfR`02c-#ORM@f@PMGv$s?T3N=c6pP$Y9kOrKqYZaumFF4;kh0c!s^h3IP1D zzOB-&Hb-TnE33~k<#ST;prpK#!jAso`Mz#(Iqct$2B-t0uYOEQ;bogO$y#7dZEQv~ zlThc)@=kdJ$fuyBQCHVT>eG3^Sb6EQTcq2yJL}eGO_!E;oT5|?e^~2J`+7GC2M;R? z39tB55 z_LFL3GbnTl{h*v?sEXDmizuu6qQrIlJ^bJHo`sE~T#7&*TOyp_UBmRJ%?0U%FS{x+ z9Ja=&U|M;sRFz-C|7iFDv{p&t6uR1n#MsJom6gK7bqa2JpXXC|9=r2248!N?^QDO@ zVC=E5k*dCMn*>-i$pSX#rBfa0`yr@ah( z1LVPOPxl$F4hz4GM3jB5f>9J=rRhJ#kH$3lc*0^GgvLP=$%jryl8p z=LmU#_T5iV9XMQX4PJ8RFT*!~tq1mxeRKk_cu=?{%WvEGS8+M=7Wi}#qHN@^rRsm? zI>698^WT2%USRFV&0;r3fmO)dOV|A}61-m5fz{wNx{hW37e7CR<%ERkwaDT1=V-)& z1R0sceTl4k7lGV0cIV?3KP;~P!jJU7{$io$+^>jFf3eV?-(AF6OD(5vVBAehk?}h{ zDVW9h^NcM==Zufj&*6KpY)>cGlkNxCwVAbQP&+2z!nXd42t9GVAKD$Mh3UXCrt4jH zEFKHJcLo`mFHWjVKZcI|ZTT)5RX+FL*O!MiF{9>~(N*j(`p=>_Kg5L*FBEp=QI&Lt zG%7Exv1rH%adtV6Orfwf?~yQ4Y0l$6Iyn^G&A3hRa-br`C%>FXXXDieO-Ob|8G@D2 zlCD6oSp`gD|A(curFd9eltlgoSPFUH@=Z(7%Qr9oMPck+fJk1Sqa$Z};;_q@9D7PS zgD%JL;3zik!dZ)=`{(H3%!4jZ1__8Zi(?(V6Ni0u$p~-S^XI8AD3se&@>vSy?o9CK zR-<#ueU%G8<<2*H)4j5Ghp%JMIG8@@FBd+j&8>C6S9fj`s~Gom-O}yQ1ioG65LQHe zj;nTSp(M&fSY+8jdDM6<3wL$h&4cWOtP-(F?nK`vl({9*3`$URRQZTJYOIDyjST($ z!4={07}9U{{KqrF2H_%n1s<=!$F0a{PqFw61-QFl0Odun@P>+AgDEJeoiG`a= zT;4Ftf)tmF4JT{Pq?Re=MPz}Xn0z8&nR{4lEPB=-{J%>IrJAf2j(lgSmeRisXGdLx zV53=fWz?f@{dYy9TMMIvx^{sG+_1mmCg{wsiQGpFLgHTitV1yfQoJ~V=h=*3S4-M) z00Wiyw>}4Le5~XdyB^)McPe=$_qM;&XW0Ax`k3CM&j7|5n@_&(Y?k6P&dC_nIjTyE zKq$kss>EuU9Dojzdy;iOK3y_aoH|Q}q{hn;xL7rtg;gcXkyN@O28LGJtkY}I^uvkx zfxD-~bs3pe{tm9=#axzIMa2FlBF*r&3RlVsWaUBG#TWPc{Pc9OPJFjjj zqvEX?Oe-GWj=|XdP&#;QN866^#_`&=+Odr%8&AFq4Q;$V6zA#5-gWFFOdK!fB=wyT zdQAx+^SWZ31{5SoNu_O$2E(ftc&9$qG;>w?s^H7rgvN!@>V)_h^`A04Jv-Cgf2Vu! zH5pmbo{z(UmlubDsiv@4TQI+{JCuNBZhs<afJ*&eK0} z$+9;KchWKE`1r<}@{~1mK9V9Qu7p#S+v(VUJbz5A;L+gGK222r%l?1y(HB~XW5i@d zzzitH421JVkt!{#=l$zGS-N+{?#c1)=<)x$|J#r59tXBX$F9;x9iHjy%L&_3S(K#8 zjUULv-q*z$5Z11-^)(fgl!8|{5-D)A)R8o2I<{XfF)q2y!W-d4_+tn#jllERpjGiEkbf)3am&X~Nt*%tw zR+MF0H}<<)qTz8Rj>7N+;UB+Zi!#iF=u>eNj$!z}>R#EpkQ4i6*!H*bf4s;;LqXSGL)!+DrM9 z-j5*77cA&lEBWHVF09CPWDWa`Z-VHx9Q276<_}^7i9eb^ebgTlMjo1HsdufF2nBg9 zM|QAE`{UJTl2JCp?Cl)-lNWmXIs@c*OWBr^YLoL-zs{%|0MY#ruQ9F>!stGpgl87H zeZ-^1tmQ;H;E_F@em_G4zBo-ET;^wnAJx7TFn{=yB-oV@+h=SG@KW=X5PMdDZzc;- z!Wy|PNi#Rlrmgf<2FQ0ywmBQ*qXbY`koJCgML}=qP zvccPI7gD==R-^+C>&f^*j3fzGwNIA>yrcN&oer;WK?d&T-_o&H?Z-v-WA{+0AF$Z> zRO&8&k*mr_HgBtJuDn{5EtW}^1ZBt=Cf}zrXYXXd>MP3J zOo6YXMS2eKVs*Z}xjuhU$EM~BY1yYJ8bfPeD$LPvBoV8;KA$QL!3TrXY)Z;#3$0VT ztH73Bf8*^ap%MN1_;mV9g|zr+qy~n&&PW$eX*o0Lv|?%vExX6|4I3yFlr-R{W%t?A zJT9$`&h#7)V^L*QZWv6R4=&j#3oMUW8cgn>8Ga2l-fywOET2=;Xe{#)En+@pj+udI zs*Z2M((Q9YigAN^k7>0rXMdE&Pp*M!pVOU{q*VN;075JIi+aWuw|9iQkk3N^v_B2`|VJMMnIm z4-^zmc0jd_`Um~&Wl$y2R<0(g z)o$uyWb3<=EEYzanu|0yFb>R)wT8JpjO(jwZp2EHDN(8uN&+{psG@?2kxo^QUr+Q~ zQa8s&L*@()MCI{cGx?jju}g-%!;r}FFSW_U?6lN39?O#jCB6W97FzyE7Li8Fjyg=X z%UYYd=f{pVwUq=IN;Lu^`pB{udYF7B6D>@SP4L9bXWN}q3jF=Y6r ze1K@LWNmQa?9I?#Op*B!)1-tV-@k{nnGS_Oe;IohZG{fbJ|5V$^ZMC#i4h3gin%)E7XuaPnX`byW};#dk$ZQz&MUkeaI&RAR+2!eE>AK@s`} zS`bIhcZ9}5)-*jFI|~%tlR%`tsr9QydrKg_=ODc$e`dRJTHK=OI|2Obq!s$&m2boT6*|}8r7|*aoNN6-Emz$P*9xM)1+tdQ4F`H9@;z(RXOGJL&YnEa6TZcM*@u$>Yl@oP==$N zArY=>_R_E3IN~kuH_-?S=Mg=#jzE(mHDLc%zc5EjY(lb3c#)h~t(Ftr;_N&cFWhw4 zHtZk=MX*gok&;jyAO#_fwGy?RoC1};DIGpRSphq29f%p3_$Z8$KmrWPJiK#O!1y&Q zSIp&UtS*x**MDjQuwg$<`J}%|<;8SEc%)nKXECG~z%)y?cgKewINR0vQd-@$1oCU%g0>sg2cS#OK*`M{2$0`kAlBx6iPylzu^B>p`#@f{@b0X=0~^C> zXz2?XIx)?FSQ^_xs6lZRtrV+0c~N;aZ?VhLMUn~%qNYgg?wm*tO%k1iQ>8$F`^UGr z!j>)F+^?(U$cyj`%mA!4zaHT>V5oPfjc~d_pEEgv!r>m8% z{`yc~v?_9C;P&MoPX5`r8mVMvCE9YhwTLX(p*I)dlhv5N6&eCAJ^kMX&Xdtnf8^4& z*Y#9>zT4CGS=Zu*)~=1?_NXqhh474lj4ftg!G(8D9 zI#T1m-_w6;V0c>QOK2*BG#MdHMel^&L#TY%XRd+)%{6dLP1I~7L>nbJ2CVw+TE(?h z-nUpv<+a5H*AlPyK6JS*EvmcLKiN4t|}=faLLvh%YeZb>fKl{B-oUV*l%kHy~v&U47`4dD{CkSO$t$ z9{Jup?FEWOzaB(3?BP$Xmlk(|q5UG+)cs{(WyE5lM<{2d&x@%21cBd$=Z38dYRMhA zYB^8ehE{=THrJ-)%1snoNLc0j*6GihC%*>8ifg`FINj%;KRf!j z4Q$ew?UY}R^e-J49$4Bk@+B4wmPF*23=H?z4pzo;&h?*f4a7oHOpjkiweHc}k2Al=Z=0ZqQeqTVHO%2R?U3U!2 znjlH?NW-p{NH|x8xXLHw*X8vKEWyM9Ps^`<^2xe~7$%E^XVD3}TrELxjtsF8MPMRj z1vW&Mz#L4RensP*_WCOp4P}jxB#wi~XK-!az|+m(C)6dLl(g}vEAxpi3A3@WerRy0 zXRt20C~^WS^;jC(z}8&@v$N*RF0QPu5tt~ca#V?Me(k~=p_+Ij zH;E>*=TLNJM>l?h& zUO-uTP2!T$2D~mo7)l!Mx_1@==a&9sFT`upomc7d_+{_3_vH9V?`JCr#WVKrFmakd zuUT63IEi22@U*Uh%X!YFVBxYHU(S`5D^BCLyhtTG!6Mx)$TH`S%}aVc=wsy-@0AhP zh)r<(>pj0Dw8S7k>BfuEBNm6j>g->OAvQg~(b%g7%W{`)pU zoXll*;z4H)q4@)_?*3%Jcr5x6K!>k)Y}oX5|G@C{WBB^qxvTz=Ku*7Oy`=i6#jaw( z`gLpjPc@7g$IcC(vluO}Wydc1rq*{uu78q7u;@96E96q$K-1#+n9-*8k^qC(97T3Q zwEyp8P?%$YZqhrQ*)lcn)7LDjJUSJdugpRe71?oFv13h*jR6MUA(fViypBo%FRk&M zo(2@ppkF06JCbqI>#gsKAWa$eWVQwW3~H}6Hc`D=7q>Hfha+i4@O_TRT^6tQwuA&4@7&i9;u#P#v8=7UOzQU_UCV- zUnv=IdaK(DU;{t?K5pjPr6rxGQim5{O`W&M*lA1+e6)zlfc`$A6bSP?CxuAa5+U(E zUhv80{;2`)#Zp5vf0Vv?OYCPMR3Sz^(MVPNKNIE{`|b4rvMgGG+gN0g0sQZuk?bxt z7z1hn}8N&N|NRz3V7LsD^b~WBKAlc+R;tGI@m*ugh$dpjFF7YB8o&#C=sT| zxCC-1O&rwqiAhvFo~D`8m~-)nBfsYR&qc>J$|Eh|Bka}OSzIOdKH?EFYRC2GSadXqBif!x>q3|*A&FV3P9n7 zR_crA>ABxVJ*ycKyJ$PuOneP40JePKnc^hWoa?qyd(3*}Zj6eacyEN$s*sex<(qirnP z5EEeJ_(Bh>w2%4!P$xFf)4XbYs&Zcc_iD&2h6XWu8an62o%;X%ih?hugjaM`l(TOQiAmd8&A~rPPsH5{eccMb+!XUx z%#Ng0k!|b118s551o@XY#3fSnaQIF~kTu_XC*AS5<$^kk|=v$SyQ7hVjwf7&ujNrLqh zG}$78f<49wuoGD1MXQ=pr;pI3GD8D(pvcba8iAY~c)qGg4+#pUk|UxQUnU|f+>y6KE}x^q1sMGwk>4Hqk^n$~mgfx4MsZ@{At)O4q_*!)4&Jv$C~GQXseB5@yn z_=l*>E-MMBhU~T?C)W^HAKUujZ2c9SqCQ^dp!tez_+h21j;)iIB}xpq26=3@0r-r4 zMQ}x$jibgt4r^)I(W4}@h`u5@XSX!r$GIyJDJk;cQ;H<1U%P6e6~I^AepVZoQJaeq zo)EL`oFFaYWUoS z5pinkgi#%`-?K!y=tOVOYoZtp!>X7(s$D56!(}k@qHN5{17f(pf}<d#|%A)B&gz4d!bQX_>01Sd46g{ z*hFrinv;Z9#Q%Wdm{D$W?KdNZR|ukFlstv3PtzzJ;xO=9UM`nKl}Z!rFcx+|nli}4%xF#8UrHO3DhKVL$eixi81C}}4Jykb$J=4$D<#Rk6fIfX8 zOUsrlf5RO1^f?U>Yn^tdMmHwFou!aA6nLnIe9r|j_WcEMQjQTKMK_NRA7+4QMsRV7 zv#z_l9n$idU=6xy&GGYx=cZJ0c^bAZ#RAMN&pX+2QdyVhY;iJAK(M7)$~Id3XJqSx zPrSoX@E`@ni!F;IZ{NO&$}WWPe?+kGrcPlR06PY>DnCv3u6>u>*4Pp8sv+WXLBti$ zZ&|G?PB;IT+1l8e`J2CY!>gpuIe`3V{Sng9*p~Fl1HJ5oUa9|WbEW=Q%u%NiJJwg? z@U6q0WOB!FD;`(Au7kE`BsOUKyX*{e-(Me7yL4ISqvwW8XhoKJf0Ie;&dGc^`iT3xbZ>x*41-ByoHTMR4ai>4Vulz{8~rIBkLo{DxDZ8 z*)x}+4GGEP(5Y&}p0zDSm`r;<41ABh4;*|xP!d6+NyEAkd0szdWwcITp}#GAf_8#+ z6E-W@m@LWSrS2d+&4ft!d0M_RhRrob>?2k>Hqb;iVYDz|)o2);4CzlU7%XINJ`&5~xL6vQ=T=9Q#r>IK;~u7o{| z1Q%Wt=1PVh2J&u6=FIU8MGtxNk5krHcfacXinQ{~7osbwsxhPuX~2&Z^zS~f8=KgTC5@{|hA$gG@cSG2{iT1z0qKto zyrRBGa(dFXYtdg~K!E-C{-0Oa^NfFb_q+Nf9i+YByx`Veskpk*Fy!2Vwtz9VoCSHC zF%}RIg%oC^z=3^V)Wbk?X?@=t` zfYbeO0D=AdNjmp(&Hi1kYuJ2uX05jV6^rVE^S*C{J8LrI*v+IDjVGmOI!8P9AqL47#68~cse z|E(DjDY{dBEMD3owr+Fv^q;ERTfO(d@U(2gQj@F6X_R%@y2}Th8IgYXt0=}57VR|} zQ*y_FOwZ4?sZvwTM$l*1{$V8YsAdV@9?RzF5nqtX>x>xGjc!Lcp;{;gs(Vx5@RXFi zu>Z9gD%*oQ@QWtCk@vSW2&=IrSkfsv!Sp-#eDtFea8}&qIkL*_aocmN)}vk)&U4Xf zbWB}edHiJX`8ae|JS_{2&ZNa>K8y)^(c)41(I9i4^p~2gxpCXqhqjo9p=AZGfbv(N z%L)qb1)q21=H=Sv4vy7!0Wa?zg#=*qhmX@UhSy&-eBF2yu|*|zm%^g@w%@=Pifr=tmVTq^8{5v`Vi z>}NTd_De5LZ&^~)ft$uRBDRR9=^UTXDOMwj8SsUW-~TDzaD*ASP1#*huPJRQZ<9`R zo>QPu$Xl$D1)a)oM0LTZGt5uM6su8Vq6*rE@*4p%MH*{=xi2u8FqVp*3vlC;fgG!< zIaWJqc{l@GWv2p@sj(47`du}=FS~CS#vAV9@6e|v0hmnYE!j7dbfRr+29}UdWkeQi zP)8&FY2l!i>{w$bskVX&SQHL}EWm8dF?X}(g;!Xi}O z2uzON-uk?zWWkv>o*WR6RB7UPVA4$it3b^rNUCQ|jX2*l1<+LT~A;o=qCCkM9e(E%)VJz6l%;oEZwdG?58ys@-utF|vvMre{sjTxpt7W-UC~ z4rGeJeU{XXwu0ViJ9bJg_cPc4b0p{YbwvV_kU#E;gyF_Ejm{P(*iq-F_XQl4!>Wpc zo>$C-6IvO$B}rwES_B zLHVfz0iD{w*bZgE=(PR|H{vFl$_Y0$O*XX##9DN66Fgo|@M{H=sj~5qz>Q0vXt-`H zgDaebs;QMZoaSNtm4X|>suS`DvSRI1Wn%{|lYwbcE{2Sb&cXB}D_4Zp@{qgV zEh>t@Rc4RH7)`w@$on9c`@~%rhngj{z?yntbe!-0|DHLPq+M2WSow^67~)j*s=6y4 z!wn1TRxn(*ohGieZY;d=L0xYvjs#lzzsqS+LS8G|_KDV2$>9n-hdgRQ&K4%AQ|?5; zCz(ukI-PymNyB${!^sN#i=X4bG`~oPg|)e3an~PWqNBS(>){I4_VjQGKG3Wn&%IdY z|BLq9w0{VNLb+!ePK!#nfARnB|0_SfL|qtOafNrIT^q#)p6{87_MDeyC3`l`2SV;bP1E!U423=1npG{$p97w;UH+zdHs|V7f4KBC;O4wdcBhD^H~76KWBQI>{mVn=-~G-{lMd%uUK0Y} z?5R1K0=IgKm*){Ck0`yV8#F#?i)Y}u`QTFKaY}Dm2Mu?6Be2&KR6+qveaZm6ZB%x3 zF~@pDew1aAnBw2BN&YM-1Sj^KDmhcIM=xkS#W`=%aN$j_<9;%erL<%Rd`>$iGa;5V zPk~;2=*%Y1sSeY6gu>mzmBPsH?*+T*~cAT=aXP zHvDOOz4CVhaz{w`r#&ctSI{tnDb9OEtr4x2)aLSIzSe{BW@|Poo9pSY>9gN`4Ke-Z zoYp1no3ryxy=0jhxw$+Q(hH~Zg^Dxh6MiNOQlXX&+pGDhUNeKyYWH%|Ec$(Ld+zk% zm{xjVS7~@3zZ&UtG^ZI~jfV3Jp-Qz^^J|@gTQTn-f&Y{H>S)xwjQ@yyt>st}5Ji

    M%X~-8mZ2!#L%9Q}3g#&}c4Ch1$Y!p|J3xU~cw#V%dQeb?`oH7V;+KR=D*Zr%Hj9 zhbnEXV!lKcQCAfKH+B1OU3lwHqi6?SZtLms)wW(U+F_KirC%L|BU0<;2;i&jv$#pu zlHK*98O&b|8E&*YJ*&%;)d@*e6Wvx(tvWV;_Trb5McrOY)BE%iH{~=)jC74ZggmpD z{|Lv(!ojaPbhLiH!Td)4En@4X2W$DtjMju~$qlSNsdp@M5S;vE--%#_n({Ck+A#m$ z`ab0R#qP2MNSA=pL@L()RFdoaD`z9#fFDQ|P~t zE2ePLbNc<^k7sXju{)&bF{*>kVQbB|TCIM+zs_0FGci9GD2RZ|F3kfEc-ggYhe#J; zIiq^{A*Gn_Mzmlrg%yYtHF}}4Ijmiw;C`nV&EMpQo@N@Gm*=0({2bb$9YA!?8F4#N zp1*Nq$n&2UM=lDLLZ-JDfd%(RF?3X1{O2B4-D5cl!IpQcE#g+38}=CecTwym>8dV} zk9OrTU+Te#;z(ooLi;M2^6o%NzTikt)0OqL21jpbXMu3Zf5yJlNYlpq z2O$8+kt_v-k>nB=n2IrUm73!oLO zc@IjqkN}O^hq7d}w5`D%e-hGr_V9Gm9fx2Y2zq*;1INP3s)?pPEWt0U;^28tpeFDd zHcH@mD4M|@CMam+!9LjGu7lL?C#aRqtcX{3jNX;F09FIqZQh%O2;kM>mMp`Z7F^)H2HvQ^Rc-@W|4Js z!U>C0$Zqysz_WV8BOo|4BY0)p^B`S+%suloYm4ETN`r9Sd`=ND%U1SuAH}%G`hS9} z9prxFt6hOhGLMveI$wH>a!7g0y*2$y_GJe4`E)ZL;09y%anW{)wpPPm&EjP*$TnV5 zEz#;fK6P45L;7arLlhxG)$B&w7bE+M+~4}Ku&I^$?Y>dTlr+yh2G>Q++A#kG@ivbY zuB!;TjX4EbSyCtf!>6tQvNIydE>DlqdmkB6_-nX?YMjNGaEumd8)FORl);m(e_%L8 z3v)J|3npj6T+J+&-KjFW(5u#kt2QXeB=cnW>hr(lpMU2lv(Mf0@I9O;$@V&0RSuoH ze<9--+*482GZ4!4w=703h(K`moA;w!X%DRH;>T*#vDQDYInMWDrLPNjvI}=BK)eg( z8hPZBS=f}-lU!@;_TkFo_GQ+8z?UTj(A^oLxxHY|F4+T_2j!7@T#ZnfJofOD!bg{C zQ-1IKukko_#Eq`OzK|9q#(De?d}Xn!fbXQ)4S)8Loy9uJPkJaUA1lY2e3?tvtz zs6^d4b_qz-<{eFB3w=#e)?ASn&QGVU`Fjtp#llOEDxrNG!Ohpv_5(dk@u|YIfkV~2P5)MMvGs6La+j# z+hNyOr>vN1f%t5BF~;1W%NBQ@XzCnvt*PlowOF6HC==Iywf-cNEqb!`s%{!5sNJCM zQT4B$en?#eE0`(O=hp;kiwL!NgA0mV&0`0M>Td(02sQ7bUWThAI>9$>cB8Idl@>BG z1?fD8jry?+5F9(=JWn5IAk**~!d3{6m^+YTcrq=QK2mW|Cn>VnJ6GD!?ul?i5%JlRT*ijmYy+hj${JZa$%&)3pL ze}3G0^KeU>3vI{V)Z+XcNEThzwdWA(cU|FWF4E-{Fh}}y0q^qh9NRqJzssLmahrJ| zW}*E)5Kib#RrhJ`*M}}bm0&n&ZrpsDjKyZp$c$~nq_LHSc{iekg=Kdny0o*aOP*B| z?7^nUYL{fSA!-`JKuqS@bB;-t>qB8N0_X?^WyvG(Fx&EnmF*GmQ2|&lvVCYs=ShIN z$G$bDf=>slzr(>Z83A8>psceX$#n>FpiGP7>;X%g{jJjuv;lcWfwWrbqqw)*&kp^; z`J{vDv2wb>GcKV%qt~nwNT%-5dzAHdG0k&p3GT#g16mdO#?)XXSp6_4S6L&!lkTl; zhd;dYQ0UH6*Bb7&>`~-1_%gnQ@BJ3v4lTE%?(bfbt@_V0x9H;X>OekkSi#Lo8k%Ba zQUZiSu9#gqkGaki%r}&I9O-a;Z2pN6p1KzH`K~AL;KTV;zSw*PXYUihukk1R)70CT z!C){L2pv7jFTq)cz@2;qpT?J%mlZ$Buk)w!=Vl`YgTWXX#~IzWXgg5uhGdJWApjyY zSyiPNB}mqaNj=?(R=N|0t!jxVt0>gp!zb`pCt$IVE#l=^q8l`50qjzHaB+2U z>8LE*Pb4EV-Y6G=q(k%^(T>`|(Qf*i7i)bo9`ee2In6Wyj#8pUpo&mJ2&y_^ZBOPnn#xAkxtw?Txq{xAaWn!r4#IE%SwN=0@yHZ< zm3#mGEvbS*I2A+r#2b0r_(b1 z3nAaC6or0;s-JgZYAGnBAqQ6R23;o$?f9Q-GLefr_Y}2kTzrCc)?RZ}%LE=H+cfJH z_Wqr{Q}qkb&vZ$S$w%FXdRmpDr{mR9}&&k5aW7DL(#wgGmI11I_JpV_H6W$d;*A^nIx{S^rDrS-{@1f97YTa+2v_LRTgE zXEP9gm8>iGFdHv*>truj7VklU%A*c|Nt8Wzy?)6v8#M}q0XsxU`Qz+G#b{OeIqE}w z(>bH(5ck)))gDfwv){=FAz|Gq#%DTq!BHa`1-5p#KHig3#Ppp&68okapslVECz-g# zVN*XaIT(l<1>u-``bhK)$;!f=2EhQ(14Y=@+)~IS)me?Llv#Dx-7fIwR?Yd?u!50`3OwTxcZmjMbWxAb8==YGCT- zBZK9#nT=>?mzT0j_^%K!kxax;km2($f$@0IqD55o@8ZNvwSx3zy3=~gd5=|skN7?z zh4+Y|B-&3l!+dwkFKwx2S!MupS6d{fVJ;>^GmLWG+sQR3z3rvUMtN?gvbEoWEwh44 zq{OW>$I6a_)(2Iq)F{(y+{+G46Mo~6dNrPTGXz`-$s4`cHAI@<^$ooaOMqH^c%QzT zx5!l7CQxMA6-SREhxslCI*^s@I-fAU>_QoIaY{yG zYe1>iZenu+-9eAeCe&|@#MT~u%DpL?4C8(G$|o+IiO3^7K^31g_?4LvS|5LKTjLi{ zkeSe1x)X>-_1K9cn}=(SMFz1dC7Wn8r)=Sfp{l$|(UZgtyumh?Y5yEz75k^^xh?TB z%R}OKk@hhvvo4HR*+{u7={r@`97KI=|ErzPsp=gqt-_Ry4i4e-JIM^g0#n>ZLku8V zayny~4)n$G_j(y`q)Zj#A6yKkFDcv6Amj04A@P*Q1mrj)PDmxq{B3#?W2t1VYyr)u zttAB-Q|EVcqt1F0-dIV_Dq$h*vPSdds$&v^2V&5O1PU%&oqceX8E^Wa zF|X=olVmj~l|(5(REN0Qpe@a6|7TehVGZnBoA`z#M69we)VB|`QYyza8FZPT?2`LD ze1ss0m$FrC5Y+Vh=K{^b`kGK--tJ@q**9z(AVrGXCdg3}cL1|_e~XrSq@{Wgl&r`H z{XrGp|KJrZXh_Eo8~7HI&Mb4enJU?%VsEeqKXZCWQY9Z|?h|Q(GH?rV<{b}~K>c?h zEwNE`=b5Xqw7qug%`H%(ZD%8|e=%FIoT97-v+}D<+I^^F)Wz-Q#gblP*(&4#uCC1E z7x~QE5QeaD*{3Q@AA$H6Fco*25g8D}jlxROE~qF95{+{D?^2SX>5zS{o=N1ar^=|k zwiAHG>~dI2PRQcZc$r4~0zCXc9X<@35C#ue-2O!S2%!y3K%njXLkMm|B1OY;g)zAh z@C?Bw6{Fg{C z9=C*@>u;p@DtK3$b76srF%L`0ZnEI-JEeJuML=|-};BUEOaNN2mh_$ecar2BNO))@Yr zWw`5gdPnCgvTZD6LtysdwO2;@vt;N^SLb!9Qh~nzIXwtzP_?r(xdBM5i#F{fu zyF<|^_+MMEEZ;CNwso@9UYo5FndJXlgLKh|Yt_%1)JP@K%>Bwic~+<47qYk0h}qmI zi58k7MOx9wa_mjDJtBpK(s(M|lY;uIk2xj|oiMMss)ZeP@IKd`(F=}>%u0&$yezV zzxXZn%>rb;`(AGE!zM6bZ5 zCk9?A>aNzW_0r-|oItlgfz{YCkW`$ROg2>&g{InBy>PFoM^ssn?(NQ*tXax#Q|6H( zL}zy97CGKyIm7}>%FRn0fop`wSYt-fhKkdg4;X|NP`Bmt9sYhtn^Hv zdiG~IJ_~w~S#Qo{O73!NG3g|jOy)*%jaeTxQ*zhWCMwkX5HfQ6iTq|6mWT3iUUSlS z=u_6jD=GBGz)~u`MhIB_nDj@6PQNz!i&Hsb9%Zk$WM{AU#6Ih}@cfF0Q{&n!$l{7J z4ACN5_B+Ki5hV;*$6~r&yHi+vS{DblnW-bM-Au;`FSedU!j7_1arn|Z9yyy}0Bj!* zQ*1ml&dkOic1dzLZ0?q*<>AfL6t4aoXHPWEt=R8L$wD$gr*o9Y>9MqFQ?aw|#obo< zO*pwCQw{V$aP8w8Oqq2)3)ceDo>L>^XGl$)s{%C7hZq{{^aJTNQ1M59pT4MBw+BuY z{0wsZu0#XgsT)0*_1TsmUatI8F@oI*W;Y|91UAsNx}q(EXi-O?Z0u{T$>tKQYRUQ; zVcui@_r+QvG`wpFXgo6G1ux$$dv<8ya*|wXqtNn|A(f$eFZsY9Zhq`~**1fDPcEcI@5W-y5KJTo?f_utBc^Mcr zOSQmlid>gKYv*K{xJUh)I&Z! z^yhy+t-E)(ejfh8>ZIrse^BOw2xi!bY}uF~)hktp&W9hreDmTn7+MCC?MDo7a(wdV zz1V3&3yE?qaX9IrHxj`(3 zwH0B00xZmTjjrM^FTYTgY-+0i^2=Nu%bwk??wd!qV&U6=`|FEmpWI)AXpa*o^<9nn zjei+6nk;k-z~cYcfA|L}G7}Z2d{@h=9O=bMK61N&v1}^8Ea9vF7oAlenByfv`&cQ1 z6Ke)QpZj>DUFgY6XDfdRCN{%hrLqhXDtZWV2~K9x#XZK4p1a@2&mdy9FJ`biS{}oK znD;WVSyq!+XB{j!AMTIK9c;?w7Ba?Ul<`qK(ToabAQC#wF~Lu z#*lU{6E7a6dN{hAtt$wgD$zwyk0@+wC_JP4aCVo#_R&cC3Zn6;JhqFD1S~hY!gwWu zy&3!LKFqgyrN4(c_cXW*<#TOXx73}*Vwn|X8RWq!B9eR}6jCbdqwqY&+SS|F%#+zd z`t*z9xu`{ho}JoZBq4QHgiTWC@O3SSU6;TYb1j@fq)$e|vY)XO!j`Ez%^2V=E65GN z=ssjcLcCg&Vi1>6MQsNI<}lRuj?q)YPuNol&_o5f2UqH6m3Uq5_4Eqwdm@Ao+TSO4kT^X%XLzfSk?J`PzKm`C|4d=H?vSm@PPC49W#(R#R*i zA+}t<2YFgIxrBbk{{F~3)2ep9eYw6$&Ezl9P$d|-e9?BIxoc*<^TnH=A6am&)2bg< z8D(T-edN)6yhpBQ_bdOLe0A<*@vG052&r?!nh*>$CSXHR+s?he2Vc@^yB@-oeN^aT zM&6YFrVS>XLcIQ^evvc;o3oBmwm5X4btE9l*_SS`dIR}Bd`5|l#>T*v zyrf5ZtWH)BBR;E83NPj}LvF|;R6WbW2M6*`%faX@k5k|-S@hf(}v!Pyj83LP6lYhx?{vwFkwrw#hz>AA{P2U0QWh}{3D*||o3WRxl zpX=WsIUz`j3{}*xVC2&j!qQhIF*lqVuo-Mqd2LOnPK}-u2HoEo4l8QwvBM?$v<_9XqKdVjIxD2ll)YU1mnBby9e-?J38HCG^1Wlaq0=GEM)7u>ww zoY&jctfs+AD?<0!R~M(pI5|)B(Id_~^q31(sXo+m^3P<~v}3f9lL5OWMQF$tr7ORn zcY|cwuYkIW_I$$#Pf!E3r(myA+{0w&uxBj@&dtFq_t>!{4@&y)uMr3&wv2FR3ByrS z5a#fVAgUJ&bd>OU1Od|pkllZ7>yoM+CvZXkZ9)|+sy!*K0dSN?Hf%dO8xEJUgoDWm zipP+MvJu%reXs2XMQVk5qt}8W^tIld_&Jkqw7Y=rof9)v+`9Csko6TKhfzI-1yo4O zydj=nv`o}Ddd;l3xCos8$oY?TNykm9~cU8lo5zT^h;wytB(- z@OA|Cm%*HmuG6ox&gLafmEp2OB(f$Kh#hHoBJL{}Cix z*w2O3KatLe*kqeLKmn{>qm<&sO zHUgbj8%iVr>!*D8bi0xUMii_|rjG>n?4(5E5KQ?Kf@oPgo`SrnH;#tXq5lq%Ws1VvyA@wwptx(4Dt(AaH||9dZ5ok_5X$z)VKP_1p#h^Sl25&>aLbR+pN&RYLnJutb?=dL9O9YWP%gvyAtlS zRPUYVvE7gqj^fKUBdB+(x)I(iP(a`rityr;5+3CcMhj5{;sK5eiLe9$b|KN;tMR)& zOxy}(gn}$fAg9U6QUtZCT;XP~w+9DI3M}R>?`-0V zbkm>t&Cq5JPqbO`;%P=!EdM*03wpSymJOYP0Ec6(aA)dceok**wtv~1RH_S34;f6| z@+GuUI^~fQq*f2S9WZgycBqh~hJGpZj3|8(tj9Ar(c|0vU*<|Xnn9Vk{(x^w=gL`T6o{5*bj6h6|rWEYy(in9_ z6n4&o3>UZU=k_0sUzwR*t{f!ZL~ryd}vedXARdA^`>b!s*=ruTbD>$*U^{1gg3s*o14oLrd&~kp+0SF$Ae(pp zS*)$IyVGOMndmHuf~Q>quP&`Tf?(ZEbbkx}E)mv>1gCwAcP{3R-8g`cw(Ys@@fwyi z5czxmMfcmN20M^c_-Yrzr~5VkGiH-d)x{HEhCr*1@$wKb#KooEXRjA;wR7Uh@!}V? zm)HZmfRGQ9@;BL}do=7Y%sSGC0oG_-vlPfSPDeycyEaWf-{kCbA_o{rr@@nOy`8N< z_JMw6+U^b-0!R4@zVXWYi>*$>$SyB-VuGHvpAlBO?_4seH|{K0H9pm=xft$T7@_;M zo9)UjqnwHfyEkf+WtgjmAZCLcfM4Jo~kXqP9rSb{GBp^8h;!Sr;`@9>-(98BFW}dA27OChCK< zMI9xRJZ8A^MD5ky!G_i6Q=nBvZ1;=}{UwrjS;26TSkD)G)*`fyp9}LQ2Fk~$z)cO9 zs{sN(vQSyXYW_+{q#Y~NU4eXV0V1ckUeZcnx*9cIn<0;uc_2D86%ZF}mPM{iy0Pkf z_2i5StY&&MG3^buVR>*6)n|{0mdaVXQ~$I9DJcfm1d92}_U<}2yFf6UdK&ZICetp{ zibT?+Ns}f`F|(erMcT}ev}i&nM@ZydAgKZHiW1w+IQAz|yi)5}P45B9;ma4hj&;g- z=I1Zftrz(wb4-y~_u3Y3CVoU^n$L)`%!v*0O={gwN{qvTkX@RCGVo!m0wi6e$8B6^ znKF_YZ$0cqgu-Wa2kTTBTD%Bd1W-Tfkw|sI`!EpSdT2G!!wB0Lt zk-D~`-B_Qm%uI9dV}G{Cj*2%=)b{n)BTVw_&Fk*C{paD;5MQ$NTapo9+`xP5fouI9 z#1ScIR9bQ~HT!CBmU_|Ail5O6+$MfB$BpO%T|c_XpYxRi&mMmke@%>p$KtSm{_9Ui zbJ5p>CE-?|(H_**_3(LB;o6||K@!mmNyG{|cXcW>t^^|)J!D1u1dfBbUf>p?Od_ET z@26YY)U4yh#%l*lEiARe;=Xm=3C5$=An>_|M4FyGq~z&_Lrfr&_5~<|KR>N`~79(SM&{DE%@$f|B?H;L3i9o6CC11 zb^$gN#aPIx8moS;#%C7YV;5@2qdDi@DhhXIvBxCGhq((`et9XI>JhVyorkXVye`H! z9l^KE%>UXZ>7;0W?C)==G~44u1e2iX5BaF~Cj9*b$(e%gWWNQ!c+|qSibK{(nQqA4_F{xK6ghPDV^T$^a_+bty0*avBf}U%Tqrg3tTk)4@Pa?4!S5S~-Te0H zgE|;&xBesewW5AFb?5p6IEz;2G>HB@oicrSFq77oRv&xNW7~h$RVF6bB*g3nqxk9ByVU?%+X`~2T)f@7v5j3W zSu7`FPAhKbnb&Y! zPT<;4m|TqBGF6Kz%oG310ucc(rx?HPqXa888Hmf^AWHUWMx@=thpL4-C3xrrB0uiFpq-)3b~ z6Z_F=F0rfXJ>IM%xOWla)cdI`YQ4?93W3E0ae!+TAAMWlJn7Sk8Tu!ywexp3C0;{h zVb0=|MngCOZ8hjt@VTe}Fpg(c^4q9&(U(@;OWEMu$2Vo|4q)9!xFxW(CFvkE?%no| zV9A+A=nlDt9kYeaZyi99jN*Hag0E$f^D-7XBkl&mj5hDGma9#k;x!%0$l18Ns&nbZ zZSv*dBj>V5f=YF|lo(*jEV^HB>s!d)=X%g^_JHnqt|H7-C-AhBe}T2%S+1qafH7gR zNR1t_VF{G*xEY0h7gNzd*X2kTpMJ;e@)xFMV5xn2L`L`fOdf25RqU9|jwm`xW{}WT z+)#3FYG=>w@WQGd5C74xiqK{uS}|ud*alJ~v|vGzGc_)%5;^NjG$hK}jeu1yKR=KAD3Ny+CnHi&ad&Cd=6K&*-Dw%R2g#1cD%?ed=Qf5;0Zp%i*lu8>=>_P zZ&JBt30T1pAAvbDO5V(+fymMgofWiCz{jr(nxVd-ki*O;+~j(+1NXYU1VGQCaa`_W zUW2{M782WcdiI@gs>W`I+jvWrm+`GiCNJOW@zV3bu0a_N(O)ZQ0b`rpHMesnJs%r- z2D)?SF*@m}4d>9@81@JhRc{xf;*k|DbZL6kr7?fa8yOH|j{scIgVfs1F~@WJre%m1 zJEQv&kRT<@q&sA&qMpX9tl5Vyrb|eG(a!x21~b2mjkpwc%xP?aLc3;SasO~|k(m{8 z9yL#T5XT<9E*9ExEh&1O-*4D!^ivnte-cLB?i30?1oB0gUBMFagG9Rq*rkaP`me(0 zPwo)r^Pm)t995g@A=6tTqrbao^V}t+Eanm;T}no0I)_@e(076Cn)c5G_DFnKXn7zL z^}p*)^9E$J*QU3Z!*-3@gA>TA-;CI$<}E+qI9pe=s10kiZ##UF*_k(c@cv#%YwvhY zH?-|=d0)>b#*;cx*vDY?cZKZTtavLE!fr=p4cDh}im}*OP%RBxB4!}W9UY|)OZA=8$pbvN zw`97`b-&Q2ocy9A9BsA=)KAIHQsS$8d?v6armL!GhicPSZwr2^q$6q8D-_zw6s5%4ZckYlFZHFFhfJ- zNc#hv4Lw(D;@>m7(!c6oa7?|4cb@yr{o4sbdm}=|O)z1WOchca`Yf3>Z(t=DO|+d| z&rc&gAb6vHE9cA$NVEySQan-zSbhTbHS#C?6aRH{N|c_}ix@&JcTLhUPi1)(*0ZdW zC(8#@z6A3Xb;-}GOR7yhywfrF6@^p+8z9`|XNb~q*B@{;G(oq&(x3I0RUfw>?Aa1# zSvO%Fx-Wdve$sT>+fJsNycWXLoaX1EjG^1q_0xc_b4QWbg49fODK3T`Sie@A?(csn$Y0R-cU*FD}`((_E(RBR2Zy1LID15X2k(g(WwrN%};t9|Vlj7lGzEzAwDyxny8{VR`(cveyBMXqptX4^i z$`&Um{;fkxrWI95TQo(e`JLL!8G{x6o*U)?<6EU}(%dwlH@+q9hoW@^as{(JeN!7Q1&+J8TQrxo zCEp>$nk9wlP3fmT`+{3n%zzb{lbo7{xTJiNn#8AyodJ{A7uKh&sx}YL_O* z-Gu;q`2tc6sf|JMSTlxPqm7GBiK|3pt1UJ{4h6PnkSNHY^HZ5O3OdRzF<2s$24D<9 z&S1i|g3heoNg}+n0tGW{AL5i3M0*nxI+BI7i$_Slfii&nVR`OBZzC^kzc4AcJ~LjQ zCg`vN*)E4=qx)Bj6m@#~>{b}sdq!_qWwg6% zpq>AHvc4tGn*+t9Hf7o9ti^P&YbYUeSFcau?^~XAvBxxGHkidB1+X!3p^^9EV)V!u z(Pu{%GS_N!JhNE4eV!acX;C3GED;O|6(_x%)+vwl0{b=RJ~qa79D>VjmWUZ;7u!gr z);mA;l*9%(t>s3p%r~zwzGIm?-!{4%_s_DB8_kiPYSdVAXW2p&xSIfc6$Ltz=yxdb-i@nE-B#WltUuJOUiZ3{Q5ixp@E)`% z+4-mJQRcOc6HgZgX=bwFP0A^|FJ;6Oq=r2ej&rG5J3EwV*xeNxmMaLndGL+)AF9bW zwqVDQ9D?R6x}mk9tck^BAebK65>rV;Ja=gfO^e8l#y<)DXdh+G)Ta+${Z^gi>7vlm zjzqp5N2Xm+Rd|LkdHn2z?1rPXg6|H~f@4cJGvzT<1UsQU;bh466!~sr227CRs*YYfdR-zclc&8= zez+2x;nEo#G3(8eogI|oC`SrsmzVH)Mf~2GwKk8ny?z|u#L!~vXhl*|5|XawbhvO? z4LkYy*hK5~d-#`i=UI!Dqslyzh$UZjQ9^ytyk zdsLu)s`(6KP+ME7MehvLCY!XozWzeveIz5(<}=H{|LNl-%TnqkI*EuXaGEhL4cD0D z!QzRaYkqSj2+pS9P5`J0W9s2hU#Em@)|km{h}Zk4gwz94Bs2=E#~GCP2VTxLjhJQ*L>YTgRS-T*K!@Z~cRxue%N{KC;akvV&yeDKHZ((m}l(Qd!*=A zA><7yR@cI8eU3dpex|b+6JzcbHu|;vm&{%>gN1VOtLp`}ImF*~U1jUEQs+CFi8=r} z41BqZ$Uh@SC85DyEIx>SzNrIJepYZ!St>Er z!Vi6~*r1{?5WQkF%VR9ouEqHH+uO^35sEHObA;mE=3(pq`+RDro9moM*_iZK}E%&E67tb0&D=K=8wYQ_*%FY#EF#16N^QyNCg+%bVTx&fEg1C zYZ(G+SfS_VUkd-|_++flKwwz?pf(PhyN%j^&YW3{8pChROW+gIv+)tEB!dy167on& z@1Rq$aeWS(aE)#wU){H<;Z&|0>(1R7Xhw-j)TQ0EoPRL9xBlFT+jiX#OI_tK{Zz1q zh57$IS3obT#MI3Ucd^-8FKW-di&+>xJc0cp}XaNjisRCczZkxn0q2?jFxFRlYOFh9RHt7$R~8qPq?* zO36!1(j)NW7Q*lTDh0I-Virgmgpd9LwDCOQ{tEha8FJO$4&Y7z_CL@egIbq8+@Rq4 zI7-|nbzDzp@=l-69Hgz`O*-U-xwGCdj$N9T7P-rny6lD3rXVi(d`_S)!1K+`P!0c< z!1z9qW-SR?0u-}I=sTM!nlZX`>RAS@5oQpfLK;9uk43CY~>Fzb%0-A?Vh!s>%1^_hw1(yEL_;l)+m%x zlO~+p0X}2IZ#lL0H_P>CvMZ4DV$MgHoo@`PQ8PV*5bw|KyKBkn6ryvinLO>WZ0t81 zZHR)3xlwwHqHIC_uEyOc*V-^mvy++Su2#1)%1D#GYh@m~xL|4KyAM7}*Hb?SOe|&d z!ccc9(2Ts(;x;GmA)t7s#brZiS=I_#fysFVJ&EazR)J=R27!XmaoC#4&B@Tu^iCloOSn+wbuGf80ky0eE=#(suy*mEy8vS-+ zoDn6OViF;k6r|b#fPI!OxK-auZX*zSn?$#=D-Bjm1-1mxQ7jYb*eDQoo?ScehA!id zSq%i=;W#<;Tt{e&4jnr5>q~g0M}6}$6N{sW)X!(zzdi7ytn9Fz5?@c#<9(_RJ7<_n ze*WrEY3WnQS_Z&yY_Y`_PjgGx-<Ej2W|PCUg|EC|A~B{Yej8ltR|NY!HX6Isc&xCtY9QN1$E@1B4J;F0THkC;Yi$ z=B2&XAlhSW^6SHLgb(}%6(Ka0Z94UIZrAjpmIqTg>gr-WGiJ=X+|zuJ6}00rke?l{ zJ3@DZ3<^>PC=wr38f%EKK?kc`sB+Y8KyP21yI@>%p0#?jiG1^x|GtS}Ck%?~VMP7) z@iuYnIHB|>b4#R9v?aOUf({(a#QwC8m$)?F!JMsm>`_|Lb+yD+Eg{Ew_DNI+X-3?^ za`7Z$+1SyGymV`Z?UwkPeZl{hviZfcB~0E(>>uf{b*p^FnM%(pzhp;q_ek#DlNOw^ zVN&XpS_U9Kl^y@Z9m1;SHWw}UbC8*`dpGZq%Y(HH7$Eps8qTea4^zaDA;aV@{hPb> z@x^U@G_U_r>}p=;Fd~OHEOVf)VmL&%<8|eUd-iEoJ76G{#HG-JbAT!&2qKCVTH@4q zC9vvI=GX}(87bT?5l1TcdPC0NhgOF4A|$syiRpsu&#c&b0d1aNk1lW~F293t2cPqL zz!RoHLyUtcSw9o`yg4J*O!9iO#5HvD;Um-+JL9*0`v+raJp7ypi3)@<89`cb=73WjxJ)4E;ar-rdh0*NLsCW323EpM}e zE||^?j?r~ch#RAeEJit(jquKs9k`@Cy!;LRqRoYwB0JCDOAo7mh_bA)lvIhWS@-@a zdPL<9*tG!d3&i!vGO2gE5>Ks_-DWU@Itrn+3knDKUH_)O(6<$9HJ7U?%e;G0${G}3 zzt)e*BV=M&;igr&PJ>lGTWp-Qe1z3-h)!5$E`&Emmkc;tWtY3d%vc-S@AcIfnP;^c z2==jMy=cxa`&Aw#8O@HqOF*tYpzxBXIb&Lz^1)i~fXPrl9UwA{sL~BB8oJc9b|X4< z$fmlN+=_2zq4JWch*5;bb2RDP<1a0k$tM8po(E5Z76_VNW2Hg2ag$M}PMtcyTAjmB zrq^^4_aI#3>(r@JhyHD}2DT`n7dD!E(eAsw1zarp0hOnOKztS<+PB5(nu&$ImWms~ zGrMV`Rh%AoD#88+_X64ccnzS0?8YU0BU@=6m-iX_ko=s#+2MOWmwTJA_rHfosBS6) zEWd^AyMZt8Wxo0$6oa30_L?i&Kd$~MxgC~9wQ@^u-xsg_^Sod4rT5`x`PaPx0!2*` zqJ6S=cmB`Kjpl5*#@+++As%V-^*fFE%WBNq@my+q_3n3RmeK47MEN-P@~N?oXIv?E zCO_5MuI2mSj}CFqFJ4uJ6WJZ$L4o}A*0cG_UT)cE`C1u%TtXa!W7>peGz6E-tGFnX z^JtSPExjxJa|KmbGuoA&wPqLSKsBfT!?5#ds5=**;dbngxPL)!jPnO#rom<2yR~^f z#}jjOm1QwMOl(A%ZW>TB)BIvXno8=#Q2lb#*l?g25x+8Qt{$#WL?SOKGgK`~(qvV@ z)X4jAh;l$fQ&W^bQ>>zkAq=+%)0G?DOocP?tkD=7PlyWM_4=*V&qW^}2ce895bMuD&9;ud4ulE|3b zBp34`O#x~!Lb5K$B7_@!;-oqnb9S~LBu$9)1Mq`8pJ^lE!am{OP%{s#j*v_z#zltu zuof~WcPfo;VRC^7Rbc1sD_&C*E!mq!@$K)KjEsz|k$<|2Av^3Ezhiy6wNlJhw^7}- z?YY6jt{X{1L7xS?svh@q?{WP%_9fk2{ZDJJco#>C6up1VeZTqk3=>539<0KzB zz3zH}|2}h(pUH6+J@R8OJp4U3zv;2N$|E31-0OglPq#^T09hzo-T5i@tm%{|ILZQ$ z;Sf}TSK|y*#`)zbky-?;aeosWS#)+AE2KRw+aF0Q{7dAG1E5=iZW>jz9Qh6@UMg9(Ek(Mzpr3{Wg8}JFsflAA5PJr}cFF)6oAj2OG;PnfL|( zQqB+c@mMkV0~D;ZvU7 z_8o~WWq3yW5Y6_lLV_un`lI?dS-44!n^yJEK8!}Yi3W41{jI3?#&C(y^%Wcde&nMr zRrVuqKyN&iGe0f)3#o{L=1XXkWE20tz&S(g)s#5iVsxpvVsFggqC#4byv}o0A+`M1 zEQ2OVjIwUbB>_t-I}8~R=&~^ zm(+8yg;FVW>i;?A@*J08u4(w1MEqf_MWYLxgboWo%lGtRcMMq=5BK$0=7tBA{=q!` zA=XJ?j((8!p>c_$Yn#1i_edS(IBOpH3pbnCEJ`g>zhup1bAKK_+}@YNV~p_d1OYhY@NLbgD`P6Z@##`k;P}K(DdmFY z*aU}Yj+^Hc*&eBYDO~m^yv!)`^RaeJyyQ#rPv~^GiW{ExLV>*Em5@{8Bx0=B#JlbD z(LV$=<`zbQ47n1^ymknakzUhi{r}wZZQyO+GDqixJZXG4{ipr z&AwQ4b`IG$t5eCH>~JiCa}GGG)59fQCFj-T+-@)Bu1|2~TmHsvldkK!6Bw=BCgpRr z?@=LHbhOW1ARyy%%m6Yn#=QFK8?kU?|C<5ukkm)SFVXIpl zZ&|Fp81$`;T(I5D^CzA)eC+&Ghn^kGfNL(3k!r=x1FHbtUEL@W@Ze z?TwR$x*Ps92PQ;jXR9o;AM(CoH|K}nRTt4Y1AX z4D_7-78{+=88yY`kr|Uhrn20HSSRvS;&tbh@!IKh@y#B8@pGkKm$m9pv9L>w3P#vf zWMhI{7WJfD-1oJ&OEL;3sH=dc+W(f~@G=~YbriD>j;Ul{S#=Ac>ZbUE1d(aE^DB?> z$>e$jxen9AQVkPD^`M{`8b)0R{a~6cOk*ySR|9FvGO@J{l|>&SGySOB#+1EMEy~l3 zg+`;%XhV;LjaoL1Mx)&PsF6(?jkY%ACT9&=uX9Q>5j8~+zIkvJaFytj6umS*_7=6K zvgN$M>?!7X`3TR=OLlCcEZdkQR@9b^e@BhU9g#;}xVYcHMlZYZ7S=V+TF($~8M!+ygbYFnJJd~IYZYyDqwVx~OVeBvuzU8n}{uPmd z`=S79^jh9V-uF;;F{Vx2wRWLqy;T4?|5B1hc6v6nMP>*Rl|SnkHS|csjnu!mbxM_^ zcc7DuXL=ljX)FLdjvWc`{MW(65TO-4S9vqLGl^RV&_Qi*oeL`310R z*v;e-5)xV^!GQS@Y$*9z3trPs$3w}n5K)>m&74O|&<^0DtbO3p24?8KqJMXM@~o)< zRBUS6B)|tvC2`5TyW8&nW~uS8JcT{y^15-~4cHv_;%+|7aZAEnM-T&0nI^pFDLjIK zENmGtqRqG{eY3hQ=>x5Ga9mz{g|XZo8*K;+roa zZ$G_Q*_`Kg*GcUJ%qFwc(Mv#?BxE$7q&SRpv2w5~1Kcg@yGRK^1O15ee61PKWFR!Z4y(^lHhVwG{9V2*;bo+I=UHx@e??sSso zTJanbtPL(3P%9?COpT$hPDyl!q@iXsQ~F`EG6c7o*8&wREG#G*TRj{{m&;|e8ulZs zhu*^$I{k7Sm`##1yj$VpZk6kh-)@4WGH*|6M zL%5~;ckIS)r-bLb+_BQf;@WR$TlE-f3;)1QW2&7&*d8^f2Gh%qaxQaF@?=UdS?mk4 zph3A3u1#7E5Vx~*+Dhx58wi_q8ZPqexy-~{!pr58RxOLEIVc-@~&s3 z*RsE3zsq`D=D`tGq9)rG8P7gI(8Yi!rE!7wSI5Fhs^h~Z8Bi~GhQwg%!xi4~5+N#C zDk!lJ)+n1A~e3cMVD~*qZuI%7#GGD?4h>xl3 z213Nd6{%ql&9u!?29|V$1RUpCUgVv8ET3KBSF7JmHSAiDbDROM=N)_upY<&UVTtI( z{e-`=SYkIaEUckVpZ@pW`eY+nEhAPUd^gH>I&izhCL$stY5;RUjK2~6`4F*;cYpHi zd>pD-8-h?#Q9-?rn)RTSJ~#OuE|`p8C{vw@v2)1Q_vJ!=(e)*HT_C`k?roAg8i@$^o z{!rA(_0`SXbcKMU6BAyVTa9AD%4vKJV`4bOLftdu&SuBDiLzlN#6oVBs^^dN*-EH>00st=f&y~aCVEVP0Lnla4z+1y znXdjai(2KNjj5MMKd=cIoIb!K%Hpm7M44E~z(!nQR<9Pox=Bq0Sb98uj3+K^B5fO= zxqC(ZRFinwGFQEO&oz*w9smZ5rgB-DM)SW%jPicHjrGp;Brmfn!xm(_ZtPUgtpx_^ zW+V5R2#Vhe;x7u);!cLRJl7Da`#5#|3(_>FCj?$=4_VW|NahlVl|;hXSV4{IE35Lg z_q=iHqx#yale@tY*CI&`_Ltz=KBA_386jX6;;l*d#cxrJ=&mV^Jdlrk;xk{KD0)38 zoD&6va#ktty(tj1^;RD~{IGu5-{i;ClP$|hu%o>vM)b$03It%HbmqA8O z1FCH7Mj-I_0(|(F4UI)2wdU!?aX6MBXR@(yUIijDy(VM96y5GcNj8_E8TOq|*&NMJ zMNP9CmWLCW-?h~;(=+Ew8ojaqS8r2q#i+a_`a|RCm(mo13<{AcUI!C0``ARTc(K=6 znsd`<)j`iVS_LBv3NEvz2;4>!%jTXk7fZ7EtaMO;imQt<@?}dD~)B# z7zli8TZ9xSFS#RcaPxPER%VEN&p@Zx#{n+_gvHSXUBFs`Sb>O;XJ6xZCm^mJ-D8;I z0!S8=J1qk#uF{}1E!r0wo0~nkfX7?1Nr)|`xtrGvAd3}M;Vrh*kYNbg%w-HrrHE$+ ze|aE)C>F7Lzz-&YSR4P^H6_l`6Eg5xAL^h*c~b5XhcXC=S}c`?Q&ea7u2Dx7T)5;? z)7qmc02U(Vkd%coJWYzZ!0k;}1_A;CQXRtA(O?D!DVoRa85++1A1H?f3zj=BA>T;Z zKowlLaL<5vVdrtN2IPth$dXXE{S7iB;2@W*H_g< z83ICygl@DPY&%9-Tx77los{4QSQa(nhk&h!{eF8*3UxPzR!d^qkQdUC-a@TKv0nQm zsvsby$;j72myj~b7N#jvgs{wnhFH(va3mWXFOoh~;rDS*>SQbguf7ozICp?_W3D#B zE@J~sMuI5-N$LVvfd2JDIqzeX1m}4Y4!)ALJ~OfM-H`r8BudyjLB~pbxxE2mKB>lb zUodWcK6)9@n<7G(LlPU<#ZiMAdyspNVW8n2P{)8g zMv+w-FCvVZvlB=qXfpCx9b|;83|B_x;0}~yDwNe4X7x=ESpcani^qK@WnL}j#J_3< zB6q*Yb%fi2nAs}=*qG`i_(T8KK+~oqbTGgIdkwemNRqbn-F3+{RLVSPm%znUQ1jZ@ z$P${6q$PfEf>o?%2E-YH1|_z@M1~9|r=*RQF0UIM-tx2+iKPLh@8w-k4duRbL=JKd z1}6b9<>}n~E7NoQFn#Qf1lZMBd6DNk{4su$L~tOm1g7;-o*SMgCyOakS<>o~*4+Z&MB=nXZOIIrF7UR^<`8!;$~ zKx|lS+gt8=kj;?2o^Nmi>k#CSL$k|CLAh)Sm!j~WUn`Gu4LN85R4kXJSorU+Ee~o9 z8UH?CGI1`&!nK~0%S#pup26?Gz{L;EQ!+i1GU>h^^AVZ;ntgK8J|=DfZ`tf2u8e`< zVSxU^XBW?KigIyWTs8}@OsGjD;NaBBGsW@u6WTB73aCd4~!2e3|9QaqP!>|7B@Y??5 z66~Fiwt;EsJ3Vvp{a?KoZ||?(Wv|z-cDSM&_>cTLe}DVz=RY|KD^bb)D~p5RuRd4)|pKsY=cEG4b;%%4_!cly$qM7z_EgXfq|KJK`_;J zEsi1^w%KouKFxug6{dz<01cO97eLtFoFP=u!wB{e)-R?%GU)I6GO`?l?--G}};Q~pMT2oWMg&H@i2i{`q0z3|d^lPhjuH7w;&+nd2e@P`EBPH$>tj%_R{@nmU~eimQAo}4 z4K~LC);7R9eQl$Sw{Fpwd@zT8two8L8RdCX(XNP^^^)(8mjk^W9yJS{B`)I58dW`~ znZxcBufcS{O^fR9k@JI)g?xrgfswZi&E&&p-Z9rA&WQaG$HWftIXbB3!Xr? z7X}TZaL@fj1PiAy_F<-CHvL>3Wkw#kLG(uA{rD{YdVv>Mi0A4@*OFbDZziFOJI%kXIUlUORSczgEs);( z>t0k80rW~*ZfIQt)P?)M_vLEs&}<645wCfKtaM^R1_d7II|rfD8&~(9`fiWO$u{95$P7 zTlSB9{Gok58u=IyfPsO5fq@YdUo{V$^C+>1RczCN3~b`)rv7-kA4iakxmKllev!Bn zkHxcb$>^~{6raQ2;5(!LQvW|MzRCxgUmseGlh&UrJs;i4NrC%}3&B+8mIm2tdTdhB z7Rd}COQR|jV#`xQi6EcM^nlHEa`1Z8DGYp(^^%~&;LKV0r}_a&*-A%14)ep%zYJt@ z2t`M0v;&NI_5@on9pT#8AR8rsL8vwM4x3A@ggyc>a>o6m!jBI@VSUz`(%3 z-V@YAh;932V~}r~>d!2qo_{yF$jo)DG*i~ERSJkxleAi`$|xu(Xw7MgnVi6T<1;fz zvk1(y_l9a7@G4<%*^V2WPH}(>nV$<69_n>4hQ?62`wscqF5YgXy8lv~X<;r)}GqSvz>$u|z^m(CD zy%e@(7Rlx!SxFIW_`!KDp>-J_xO#M16R8ff^9|$j5 zO53vbMZAZ^AN>z)uTMS2^E~m;ziwCW8WYFLx{-e5rGrESY2;lO|525%t#M^hc~#_n2o zzI)^0Z~zb8AP5if(B%sc<=%pF{`n>nsQ~QQh7>YFiEaC=!i;LS3*)qfsE@Q#zDv0j>{zJh`XX6Yui{?g2Sd2AihNs`Ss$fG~mD3o|(DX1zAK&A$yMkG>i8m zka&_3R5C2S$tQ!Ik!mk+`G44PU@h#x6zS`#1-n~?8?Ulx8-*f!8sD16ysDzqkF9Eh zt&a9RnAjUKmZIWlHtgSzd}V`P^$wf-TZYk1X@pyzdl+39MDOLV3(y+X14RS`1at%> zz%gvoWtqzeuVfYozJjd%r3^TRCs2SpomxA(sfa*6KdlL6z}=$&$uwh8P(MHgi2%{f zXHc;HEe#tsY_ese<|xbo8)0MPi%qh8ZU$>?-2R$kYCeeG@vvdLU1dt-3kwmV=^IA8 z>Mq9DTdxAHQNmd#0w#{EL{P#5Eo>yb0O<7sAXryofPe%;$&31w?8Myv0#-*bX0{qY z;84$`)9MvHiu)zToUqfSIwdn*qe4K3MmX^emW|ZF#PKqY%8{3+hr+3cdg@85pXsAv zu>g^F^jndU{`>>utDyrUKoY^0a=KcK&XvYOI7tIp5h!pXh(uT66 z!M@mC-j-hF`)%^gi-cw&|K9LIUl#ADOQWE!{dgoloj3L|v1KduYlfa*%-4sfRuNY2 z4VE$YDl%(?6^abr{=z#s|%wlR9mb1s@y7lMwTs=PXl%~|5cA3bc zbh=G^xUdf&V%9XykE4f2GJ7l>C0KAG$eW#AqYCZ{AWSY66OSDTx*lVnrtTRPDY@j_ zjUtV9f`ZN|yrxZM4ROVciutNCx}1J0K9`?yA*yq!qCZdjvAnn9W^^8%s+cQQuAaO6 z=p3%E71>F&yfhftfVa%ySb^U)wS`TZvY$`?IL@__yF4mKkMSS&CYQ?o?)1;o5*(i1 z6-Q4e0S>Kk`GNl(`{>{R#|XXy05)m{WBAxqY>iwn_!4yD${!~jriVG_X7_Tw{=9uCf5$~(K`GXCFl1Y!y1$z(+ z{Q8yf>)Vx?-K=Q*yqYy8$fA??D1Mb2pfESsxxzQ_AUAn> zD4;@agem}>xWDtks}wMToFUebWz7Hy92^{6Tb3A3EvY%IB|Ts`9-6g4FuZ1~724u0 zk<9(}?`C4xA&4m+iJ0QLJ&)tYzU3iwS+{Z{RSk#{Q|z-gio=vSCvrCe+!y>kCH3$g{cAL}}j_yO>&Z*@vc0t7W_kf>lLhTc1j#atir8aP0GM@$K#4(EQ$S-eW;}XcG|kh<%79zP2!`z zIYZ1x^6+#{=d-M$N~H0F;@jgNQt)p2y9CrX?>2r9ziYu^`>O^6YO9d!i_YNZKfi-= z<>eh6I3Np!;a3r_&dqE*hiH%>L1GC9(w0Oe3FM&rGtahjyaUJ{?i)nIqh=a&uh^2>)*_}shW=WSLKnaswHP=pn--p zeJWtH3R4Iy1Cq){4#7BzwG{T~Tdw8bLF}fmyx926R%ST!k~hc;3uWYdvA5{63qjdG z3kdW8tTi&mX^4?6_D3`8e(A2F$micWX&8esiz$p3c#Z2Z-R`CHfng9Wv0#&#hP#|? zZVX=&?NfjwD~JuGW_+1f2G|yJ{>CFOZyV*@ zuBvR?TtJ$X3Sy7e@!cd|g9#tQ{bRsB-fLbE(r3k!shBXx%+lYOCzzw4A^O$^>Whz32ymz zwd=v9lEPe3%x{T%tg*rN>HE~KMBT7-WtT_;euW#(4xGhl_mL&I1j^%zlpnWdJCO6C zWv~&fz3*rwbCg{!!@HpbpxB#%_IpKhCF0GByLNnjcVjLkl3z;OEL?^O53$5jt+QcALM9X0JHypy(bs zxsSQKOuwFR&3*!|>u4)*$rTImz{exaLqUfIZE8sl!)sq>K!c{#h@@-9vgr8PU)Y22 z0p>XyiK34270A~&NXD(2P0AJ|31h^pb~ldNn41ZUX^n zNcQF`XeDqL3+qRO6nX{)LWFJ`2&?4~7;=ASktRFE+C13Sh(LPV>m0;^tRw`$%KF1O zFu?$TBKJWp9ZICW86q7QOENr)5gM3yMCJH>q)v-Gq}~W!g17sBMAr6zSp`Af0PACN zIdN1TY0Rf{i$!=(0)11ZKWd&r2n}mV6LQkVy*RDKbyHSxD#@!5?#uV!LTse0yoY&N z8Gs0nh;hu)pj-ili9^`)7q7CXbRbeiW8=F)Wriv*x=Q{7-ym4L7QV)WanGcrd0O)& zvat^v;t^>kg_W}tcg)`Vj;rR;g$Rjsk^AizT5F#;AA(1Z?XFj#G zk1T7wq>jbkwyQ-tF=nejO8wTOF#1f$$jF@cnv21Hl)UVz?+>ma+8^H9ScG{h;jl!# z+m-98^hdo)_9k%ejlJD(iF-kZ4xK^V1C3f|SbX1{_3shU!TcBRkT35o6OG}hlH04C zWfvZ{pxILRJJ)rU`>-RvE`ngja>fsZF5P{y(3iU(Mt++;^lSa@uy1u2$fqPOJaINeb%1S!ChDe4sPR(oKyH`l5dEtvT{o*^8 zrkqApPD3t&#Lff+r%lc-136r)HH7@=NE;#DHrG4Xdh?+vF?dvWBrzPv$8X>}Tctc* z*Ce1hZZ=D^w%tf6wOyBmakMBQI5i1;k#ZXHn;BxE2n`NJ9Tb?>?@1j}q)5kY2P3xM ze}PNwBc0spY_ya)8hbl-r*4IjB5l)$8Kq(g0L7(tu>McTJKvDd4)`yqk$mWrhYr}( zYhF&}Pt_w#!!(RO8Ml1jaxe2*wMoB`RVikfD)4c?D*c>ptgiUf2j8FKT4wjZK*MgTB|1tU{0!5;+aR_icP&iVjtRhy6<({OeZYYO z2hPzY1V89aL4o)w1PBngo&g2^A_!BbK!9M{Whv8f*|PkKFYr%$*<%0#K641%hyalB zO2h^L02qV$?w_|aGvW$!EOFBmds4{uud3%8V2d4I8@Uo2XHAjHX^gDPHrhy}USynY ztHyIX80Hxu#KAQHXTKT3{lS5uj4yIL_G#U#px8$Ze^~>w{!m0M1*z0b9$9_dkx6;d zIT12tkJ!zKXhFP4sX&0_OuiG-F;*Q1tDYhKzlCMIWmkn^PG>vMcSb#9U8(RI;!I{Y+_4ueW^3 ztn#PGr#&-nRqSzwa+T)HXq~5BdYhzm*1M1%Q`}CLT~7i{uJ2)NM2HX}`hFryv#7wn z^@00Jke-QntzPh6d4l#aPTdwv{K?U^@JdB|3TRAPgc0N%A>l=Nl^wN;i4jVRX*s#lCw>t=knq(Zy z8EZ|x`HniFfVfF(o9x<1(_c9Z9lDkfhS%!~)_NWHAr(y!pekFC7lO+hu=?$jLZ>8a zCIHa+cI^&I(MX55+oSyf)U_2TQC}obP?sq#x%LGG1)VmL=~1^#8bYmAB&2hV*nP~p z2USZml21v>3StOmUwV!?>Ml>~Oex5+D!`!S8B9sMDbVR6keRjK4AIst2fRt;6988wSRCui9JjPS>H3Lna~7 zhWs+?+z;PYy|#xiwv6u#tq<*^ZK`4%O|N8Hqwi%5^??p4zOB%B&Tn^G^E>O4-Z)<@ z2dyr}VN&=F-Z%KEc`l1pW}(~Cx1Pz0niK;H2IvyQc6OOTif$qfLVywNB9&g7a zH!;?Y%}J5WS`iy1W0CqPl7Z*gCESHR5<|Yur+5)X$pM|&aH0~f47adPhUDlWp*lC< zD6E2=`I{juO15y~xMBEJ?hmVR#l?&OIf?|4_{rd~4*=`~Ci@NVq6o{7c2}@n zMc{>^i;Y49@*0!7+!FOfsujDd=~G7%YGC~kTvom`{4?hn7BP0S!+reXf*uSa@_|^3 zzW&yy=fAUe=r8Z2pG#louessJucaL1LAj#Cmy@$+eQJne1x@=f+Qe9%AX19FweiK@g8qnD^>5aB& zSQ!Y&vN@N7Iud#YMjja-aF=--!p#Q(0RcHJ8roqV{?%b9T47YUSgNgHcu9$C4+;tj zdK!;;y#118K-G`7CRW?H1rBvH@d|Zr1OkCTP`sxMnLh*qflz_=w$toEhYlUOwc7rp zHa(LoFL0~>ru8H`>SX@$p-nRn3Q8n&Qa-h^&32Iql@`)w`ITqa*+I6sZOR303rf(o z6uoxpkVr}|pM*rZ)w1vM14|T&%9jfYg+ifRC6DS#T>iCdUi^>~MMby~3D`yT+khY_ z(OB*OvS^xjZ6j8lJSI|#P{@pPe?@a9 z_Bz_81Tn!tGfdUY#=+MC2wGJN%H>0qG6Ja`Nu2jlD?ttHUa9tv$8JwcYI?zSv<{K= zLKMtDaKSQQux%8MkQDTZ#cJPgD+?ENwT*R@1w?$f*s)LW$B-btKH8I4#c&!KY}A`T zR-5C!%2N7$@nMp;IMl2sAwpylqOh{FAi>r|f`v7mtB@DarTcRloYSS*vLICfu%KF> zq+J4J68aK$48vd$K;_LN^Aa1G0{3_z#2{LnC>Y2eytEjb5|$`copJl?G7e9%p&OcDLQ+^>g`9j?Tz1LWBq@ z^!FMF5ix)Qqqi>z$cR>nul?o@=->*(t*lcVmyRet_H;|ufN_~`T=aiCNZU)t`gNipIRjFQv?%9FRwS z4g9C7)muQ1_FyetDtvgm(P%PcXhygK4rXz9l;f>sM> zx~sz}Nm1HMz+Pezmq)gyBM2y_DExmZg)Y$Z8f=?SCsCLm1%bWSKLj}8`=q|6J0whJ{) zl+dXl46G6|SOq}oao+U;LEIqGmL~Xz6&NwUp3I_oE$mlikz0xl*3R>`7R!@+GUbsaVmJTbJz5mSrwu*Sl?1hEBjF$pG# z5v$SRvD%#jSt119prFR8mp5z+G_N9wgJA9?AcDdl^5}U(}8KJi3s7 zmj5}u_2WB#Chl(;c+=raIjkwvQAeHY_6r75c#Na{p*}r12b{v!SaD{3y`Y!4uEYR% z08ADhoFr^-h)PZi_dYdTYB1hV;WIMN^))>*GCK$Kf zu`w}}8?Ia;Ib zA*J0VwO-K;lwiQ9whI`Xgn?`YA@Q9+KtP226-LPKg*Q89HNxelQ;_fi!s_D)60-F(>?`$?oYL3^5xp#0_pA)cOu^qwp`HWKRxwemrblD&1r29gE zzE%$Qh9wAAo0r|XKqfgFEN1hJiGv1QYaO2W`vHiQa;gi#R)$N{~2PaN^!t<;( z*|Aq&E^Patn8kKgz<@ajVkF<0OBOz43CO5r+Wl3@vpTbt)t$L5xpKEs=#XPWhYlTj??vIEHRX+d&EjV*&ri*N;@asF_7UOT_>=ip=A(~ON4xTH zRVe?Y;v1ReVS!Gp=7u61l~xHFXrPfac%x&AaOVp8{%R~>{c35MvB?Xds9`ckeP)^Q zQ1GEcrXdyNIB-aZwuGLla6@IJCTy@hX_?T8&o`g!u4LLgXDv6kL3%;S_9NX@vdY4N z4jnplWsW>~t=sXX6^^g1wFuf{N;s&EYrE|fuY`;mYN(-xn$yTYt*xETM>XGu*wRjj z+?L?CKE)G0eE9AV+N-P-!H2J`4mfb8Z!o-udYe_p+B(+?9G#LV5OB?SJK8K77bE7} z+{gs+xfrmG<~esrtfPwkM23JJo*+U83>wmd{`aT$jbe&>*y}^K!mRxKo{7RC&zS}c zY>3RLI6w20H|iO$aP4}=9``q^qMJ8KZH|%$*G|Ifzq6m*)lRSv$tuL}a3K{*Y8arg^@sQ`Op&eY2dE#MT-DHBnuecoE=11DFU`&=(aXSm7M|K&_HW?ZV(AmnjRBhw0Kc z+*6@Kg$mW%(Qa(}0z_|BM)Pz-ulV&|?`Mkj(SUO|qo)7Q;lTkhCZfUu37cY{wDSU2 zKWUU}_c?2SejXPGl^?pLj@*t-ARr(hLK)}4U@UnSs8C6bd)64I9^nzgnH=j~ebu%k zu%eK{=$&U?mMV~&GE%b{LmRFd`7{?E7`gH5slUs(QasEvkE!hpZZ=fsM%dOnQIGMt z))1O#qDjroklN^~cvk#c5yIo)CHd6kGJ6m^%HG9=d0|jyfyf`?wT59;>+`@hqXklQ z)sN!rUxXGBi2@)Hh%9AC0)arQ4cz-3zp&~7WZJnlWz~8q90dEUlNf%;1J! zgy+rhnE?H#g>c>~HTLZ8-u{OaIY9AT@T9ocRy9IaoL-vesA3LtnB%!sFxrh8PrQ{# zs2cAVX0M96D0@lDP+okX%_d}yfv&PsM~X5v1?Fh~8i-4`Cy0UMc5u9V1K?iPGZEA@ z%gE+$2`N;FokmAdv2~VO?{2UrSx91;g(s;s<}io3 z(OeeoMGkR@YFY`22`O6m-xL$&QP^P#OIYHi-a-BMtU|3b=+^2Mx_3hGe&O7%el4(y zRRG{L84SoHPO$0|Xb;FYAvr`@N5!v+tGEiqYOkie`s?pVoz#k&OMBdS=VZTOaLy2V z2KH~p)4?>(?ij%_w3;~!HPs^@ZlHBOS#L)t!FW4vIB9ertah@FrR|;B5I7eIMqY#? zRRv0C!ZxviITsarjihGp(Rpi0R|6J;Ld*JTmx3qR zDCJYQb_^Z%og3=H4HOg<6qG4dQbZKF?<_?|av+78D|B${3o|(9vXr6Zf4`}NhinNJ zEdng%ch2r0)Fm3LijPP62<3iFO&`uWy*+tci`#UU3RTbDmNY>kzo*tMnKwt=;@ zk#d9jG*gFsErb%Gqd>GIi2Pz)k&-#b@J_^0qG$d+XgEPX`A8<+Gb4y>SoYqsZr60X z0=_iqyE%Ri7#K0nu7e=qsmEXtiBJ|D<6@62@}r`=njjzsHH0MJf07b#w_^ihggGo= z2`fti0TcrU#E8|JL>=#GxG+H*M=B%Nh!M8~#d0iZm(p$fH;AH|4MdEX8SZE+D4-_ z6#a;~8*&}hm2>pidG>pmqT@E{&A^S~(F_R~$VV9vu^FKw9^rz9 zb{+d-j)kDH6})otF&!V?>gzct1-S|;z3N)QU4t6fq(M<@UkC_NXZ1F+Kzcam8Tb~t zTCWna<^VGVub5At?=N;xtm9~raRZ9 zC6)t#3Is-|%}Om>#cz6i5G>kEgy{W^Usz*fxo+|t(cx->OIz<0zv968hI|7PT<3Ac z?uf%T{B|4++nYt*2di&-#spFQKTSf(kO1c@_CGuEs0IdLrxsJ^zCs693A;|%!hAKqe zr*}g$dnjTQGA0tua!1QTIcwHA;hgM2MLluI88lOCw67C!;Fb12B=?8_Wi0obaZFN4 z)801kl*cmcDzXT(gV?Y5e&!(;I|ru!Fn;hI#2K6 zs7JsVz(lE9W3?6y&DIOHga>^&oeGWWt$B%Q)_XH-yj8fW zKzOQ7WK_btP`(&nvXg~emBvo<(f&jKvC-0O23Y73QPzed4FG_fo=q``I6EH6J&G@x z`YuKq7$49MP`u^&rj0}!+;=a`@1%f7ZaH5>2_b|Lb$KdBAaLCZAC(MOZRJhli_dJ0 zuSTIHu3G5g<=I_oK2V;0muz*1sUN;T(oL1yOBI%h(7@UaAle=arId68ZnD(MtMb!7%;J-$(HqLM5*KA z^6AlVZw7wv_rVM?yac$JZO^GuUQm z)>Z-WxD)=dbtV4nb+ZC5l+uoPk3&xA6}pJ^ia^NFgvhZNp!QR=a)!||rG$V(!4gpA zubp_-T-l?=AnbhYwtg;r>|p*exWYPIN@X`+w|Xy({nEq{;#jH=M0dg00OrkGck`B^m2U)uv28X;+xQCS4@}j4q&AN)j!u>ejk_SwCOg2YlRs;Jdm*a))4Rm6&0> z3S(EOp0Hs6=Tx?{yyo)wjwQ3Q-v&HR!^5VrPx7-f8Q_+4i-;vdP#M+yRJfcduTx2b z3xPl&E@y%YtOB{%P_%y$>`%A?UBS>|A7tp0c#7~io@Uvl^b60@x zrht8|)#14s!LOrBY&=`<-`giVK7xRNfPz+W)<0tar;i6kfQeVj!+sMRAw@IVsZ*v{ zdE`Rt@h+$~+tuOjeLF?h_Mle$3TOySu)@hx)43~nn(j{yv62tFS>l7|Duo5yjQ;eX z`stUXz3kCL6McMka{j)omzF<+h)`}P&sdnXi?_00Ya^5CwV3?|!Rd2}$ElxyUDav2w$Vq-cBVUD+KFcS)G#!dT2nZ-B$4P;JfFPl^y}SY% zELgB$!D4GaqI-S6VqLgI3)S;BQk^z^B`&A!yYaMz+aGdKllpBEEGkgF2dyXLjMC_M4h{(!4=+tCpvk<4{i?y}u40rxg9Z(nO{C`U+>O&#w1%%lBrf$n-cMRK zLNB7txqA~O(4aws#@ebaeDe|DT??1^Aj;y!kdIeIWkK6B08@NNg5oA|cIJ<$d#+4P zzJ~S<1NVum!Jl$jRT~GPav8_;jyxQd9dYO>33DLxMn5&F@9*x@e%|iEB0}nZ6M6x) zfK(ne4lmXI0~7cP#X?ZI%tzj^iFTPvfVjh3mLf;klUIOf1>DOgJ&$b1r?*2(5gfax zPn27(@doo}wu$&|r|>maRHuMpz#yZXz+~?t@je$VAipACrQYG10RjSIWa{)bojs>q zU4F41QVUv8TY|?B9O1^$=>Pz{=8HV@G(9Iso?dJM)ju3%j(}g!&D4Bb`_~;W>X1|Tv>`5tbT6@jA`2M!6Bf1rxqTbQ7@d5MAb7ns2{gS0?W8_*% z)t0>?e9nOUNXUxML$N6{Tvcs4ccC|*J;2Id=B3iM*Mq|}@oL{$&3+WoVO?Og z>~v<~&x{_kI&Jpj+GF?9mXzGmk(Um}jW%8=h*pM(ilmgK*=3@9u;5~gMCeHnsU2Md zD9K^AT9)>JwepGv!DyO)P$%SZ)HLM8X8cmLjR(p>EjMB|UeK{g9kBk62wkrSJrGL4?@JtB zxp)BV1mb%tt$j0s%bZAptxL2NdI=gPDJI@EcgHGW`u%mYZ)@bbf+KYap*vR(PFn9B z(o8uKoXEA1L)#p0=;19SQRPZ*(zatq-r4d+xAq*N1g9EZlE`FJiqKY7^(5^z;vB}D z8&e1f7WFjMzp#Xc{4JaK;nk-I8Fa}#%g4dTBCM77hI4kwv!VHv8VmrrTc;|h4GC4A zTs|Q>9IFGevZCTvJ6p?A}DTTLH@uw`bF9Dh`gKPOVm-uhM%n+T*QQ1V6@g{s8 zLfCv;D*WNS9>x{+0G=y@cHWrn)$d)iv3IWzj4^|M?`1zkeOp{b)(y(xjH#lU8h;=t=pxuI`-p{u1E@5qM~ZjO~ZcTOU=NM?jsri17d`^Q{*yT z8#@RRa5f@%oAiY;WGp&h`FeY&IT=7h3Ekk3HuvIR2_uW@-qB@Mn@1xbk>ieCCT?WB z7cVs{Xl-)1E+u>bxx3{+#JrM3BkxD-B?J#>BRs}PtB^sIOW*F>J^nrW^oHNS7hc)Rs-zFh@IEBzI{tm?>hzSGPnp9R-Axi+3Ua$5NtxYesK zYY8X~_bnbky1mv4q#8wR1wOT-SU!{UtmKw7!OXPNL4>5r*VAo9FM%mzK};s%xX-gi z*#DB-F^l3`WF-czHinob99oHg7eF5UwMWtd9KDd{AF4?ZOWja!*?X_MHbOcRoGVP9 z){wrJ{&L82X8+id+1SYjVZ?Ft?9TdRuUV_Qx3q((+(l3=DmZRXzeQdlhp(w{$f zF)U7uH?p$Yl|4^k*pS~3*KstuwIv_MmNrVzIj}&u-WNyHYG)r`dCj0a!^%CPW-ND- zC7R3Pa4ZG6r|7Lbz=JpT8r?6u?SD1j!F-Q6z|ovyP z-r)#F&O2FYq-Mpew1Pm3txPMXiOy{Hu{EREGNiJ{WXs}-x*x$7dPm)s@(_+rg*U97 z9MlQzaSpUsF!7WPwaeq9CfQQp8=$Jq_lV;~S7oby$VK-Q}CHfAJ%0W(z8HvF@UjzVsaIBTk{fO?W_b=KTA{;JrpLi~ z1U?fU*hWLkrU$_V=xp1xEuzju+>xi@kCH?~F#&D#3WMe!BxJpIw>%o2@|cL!V1ysoigCN#^LBn$ zZo!PKK-z^Z>I^R;D)F>m(D0hrxN<}cZpSKO6}JGQ98F>Ixd2dIjd-st79vb&v27IRRx^ zje>VOW$^$U%o8Q1v?arVHNClkWRZap*DR`l@?jrQ5eYLnSk2qaYp0jsYM;OmZW4SW zJ2I8CY3S3duZeRkvro%`KpJz`FV619r_ytEly_}J%6|Li=uQ4G9;Q}s=1ExlrsS-C zBc;J@H~@w~dB4XBnXzUzmp0RzlzP4-*feqm7bw@Oej)B0zpG7*Ytw8=7_T*yb+U5u z>LG_131Uw`;87&Kwzg*)8c%3_=Q-%mOo3V4!x|poAwSaOKEBQR(Byd;K(TwP4XQ_7 z#>?*)_j0%=T<#NS@shr4qHxHTK z!_#VfVD@lyZ}JDoRB5H(*cfHRr#!j~s=pwR~C^CqF4eFSy&VDneN2H-N;e%vnM3vt4af zIX20|C`m^n;rrKE@texYDg5SV({?VzgX@L4rGs!{c3xOB&TO3nA9)L8jWiP8$Dmnp z)RsV?kcz1kOsrxDCy2|kR3K~2(1K&l2&ODYh!CfmT{p&(J~Uz6CN})T!ZD~1R+#{6 zCDHlK`9${~^IzK$A=()_o%k|J%8xL1f9{?Pwf@gysQZ&-McvaT&$=01RxKKYtFA)- zfX~O9a2=!YGLO34Hbi?oO_Gjgdp(wNO)-24Rl2uMrgmGaIlr^za9$BlO5XLElpynT zvQ7-Uix?EsQ49ydOa1qb{L^+{|exU z1=5zNdC@GpStJ_$KN2KJC^@ygk++@#IS!^#9-FTY-@+uc1KHgkwN9S73~pXl&Fve; zd{;%2g15c!E}jogtL;-E_xzo0R>vsv?6+@vqG|G(N&Ra9rY4pIdmXF zQ6q>M$w)7R64v#AWpBA8!vB?f>Sb=dzL}oVe^*w7KE9Ew4(r8n znwg8hFA~Xgft*FuTFV}#{(T9_ev6Wy(F~edpPcj&%#i(^{HN6~MSwjD^KvPYWw@3B zipEU8>aKj6hmNk$oZM`Qa4Qn81mS3N#=J)s&czSaH^$7MKi?vlQc zdRxiMp6N?~ANU|?9lVrB^V z2bgEXMId%0bVYH-;zkNSTV$8?M?lt_CHN>=@# z{L%aSo8`iup7Dy$5h6s0ki*E9pn81-6DyR&B6%Q)O>EPyBtuToQu0CctmUh!_}&_3LIWbUh`Ag$-B~$>gAnyO#*j3z^)Yr%GGq_8w<1OA6rO&5s1{f%0`YAPa z%f{UnVkllf&%~WZ@gw)oi2d{&`EW{FrGjPC;^kT9ljE#zJ0zKzPa5>d-(C;&R)Uo0 z8qKMwOL^q0NB3BP5Ex%czO*yv0?I#-NXxQ=SYCBD=W=^;6}2arbDoe07SGG_j*gYbdH6jLhML0 z!4g%7!E|1(+ij9^kr9nJ-%bZQ?OYPb(%2VM0(lxy8Geoc`7_6mwV`ztKmT@zxPDRM zs6@2}Dg)8$bV>-MQFJ$kTq~<%jwuPJ7knZxac5ZO8mgzsv5BweX6sx6gbm2sosp68 z)aW=$)=vF0?YAyx(X=~|(j~rilhAqdD?xFl617vQ^~Eetx69@6WllY-IB`Caa&M$a zATMAt5@cB!IX-I*tk%$;`&3<4)2@?W6(K+xcA`qSHTTbq(M~J54-bsWz^$WVQSdx~ zWEITwj8()WULY%5!|V5G1?~x-lcs-KHJI>;7rpTD)}HPSV~~G{?TLS)v_u|^u{RN} zT&=IGx*XPE&SbDqeF}ASRQ52UBN7Z_ujR=o=6|oPZXy*H;KxOEcXCIJ)pCV}Xd|zH zjKB|muuqJw6i|W0Y<36};2EZC#D+^?^WaddTfXMY#E)-`K2r!x)cK|Pnr_WUZ(Iz(SwiSS zJm|tWq?V%ruM^c$Gleo;DygzG1Bk4u61Bong4()!^5M$~6d%K2i%WmnG~V%4)IGk$ z>f=m?0hK~~mEt8e)fjSJ0++OnDR$}O>UZ^%1fXY|GIHtPB0uO2QK&;v0On66Dl2-M zFSThiUOW}d<=K$fAnMWFt`19|D$>}7A(ZNeR=zQolRkON>PWb>CemhbczxU7aYb7m zo@R^kLlSF&T7KG3j=dW#6;g7+SU@lSQ}<>s_cpnr3%K5=X4kKl-6knFoLI1u+gFum zM#gKUJo%+b=zf*eNKRVDUi;0}n&1Hr*PFLOTz>ySpf@hi=)1Voti4rmFuFEGzsZMI zwEg?$qyvB78=OPn(R)6@3WID((#TG>dMoWWmu}k-XG6sX&GZ@?+VxIa%I?iCel=b$ z%Q+7)T%NAvbA|R_oNg=jHF+9l+ju>{_f52bizGs`$M4a+`|WW21KRABq$Vbey&nc;Y=GG!6wsvpaf;!DfQ0+qA}V-_tcjnsOH>X>X$XoSsyev=Z5dkfu?%AEA0mhBGc`~+Y) zIOUegXOW}c0k4TcMYoA!MQ|%UG-U%Axjrd8jpRxpnIgTr*h_r4F@gPyj)%4Y-j9;K zE%!sdB_Tf22mwWnXq416Z{JQU8|G7!5*fGQ^-$)AF!L-iv2XOylQ7cmUfsr zJ3W|p-TlqiQ%GS-#7XN!_BzJQ`+ z-9cu|6q)t5_T4K+)M)REpFdS_R98E{gY~m36>eLqC<1#lZJjyn+hJBPQbWFaB zRkL9=3T(JdAf6igwKED+zp1u`Gss{&WQBcIhGKr%Uh?x85A!UKa+Gf$tz2k&LOFeB z3`lPxC_R&q;SkUxtf@8sH0Zt;D8nu*?zu7zRvtmfKlkC=`xW$-&gqnpt)4_I&ujF? zDSd{nSv~l{s<+U;-QL4GGEq*Nbu63g=(~+*eBQ=EHO%AfZ_pRW-z$Um zPorl}_CG~`Q~I;y(X#D-O=_Z9U6~@20KwjGZvTtcFXH23l8vyoP1lVo{jSZL% zNCZ&!K>c;2PMsE60_YT)ChgYE^0=?$7uIKslJVM`T>g;c0^&H=6;rc}~?R&H+ zaNBRf$RxemXUz^TrFIr%p&eabWwzCCv}K1QvWRChBN{38LL{=kYt>+S;*)pBEhuZ} zw=i7s{LO|67jYRUKkGoYQq#xB$3`L4Y))l5gg_i$eB4HPJ?SRB_xa`|_*Kd$xr(i< zv#AaZ8Z>Bs>v6$FDoBfoPz!$4BFiI@I_=uM<^-oX>-~q-QV*!VFQ(-&QhCgQc*LWm zCW@RTP+(wSVBM*F*7_zov?Ld(RgLa{7Bl#c)*Dhxy00DFmgmt7z`IKH& z!q!+Mv7w_=lhKV?Qyt89DaC4i*EHLQ{n0xxkg@e7@NX=&kf+4Nq?+Gqz%+k7*ur?T zGp`QkD#@bF;jKCOT??TlvPm#E`ysqUv7ytVGjU658>)oB`s9)IY}X=X$U1w`Ze~{Q zlv7^pDRv}8Hgz0C@eq->=!x};s0Row)a)T$y=L_S;|m2&ZJ&Pu7%^^9}c!#%514z_y#!>>K<6s10z-O8!6Xj@6^t7S z9cND&IeNPeN|jY0r(Nk+kI}E#UzAitjYt6zuLCy&0;>+d^lvn@NW+({vrX*Y6()3} zDcQ?wb_-lnzxh#$hp0UZT40Vob8ZQ`E|{(P9eGj}Dlog(UJX5x5M3e`a6FBPX@I$S z;1lD2{eGQ()>}QxRDcn3d3|V}s#ZThn^S~tUMU{`suI}h(G{;0s@@+81I`iWq6uh( z!mZ5W=Q(;D2H{nL{CtqJdOg3I))rSNDaL?gn=`T+BOf@`7GI4v=jrdW596nK3)jtf z;k6kkj~G^sSz~sFfZS}TR`t8X9EnF+!JW|+9p{K>R$|Ncb_sO1(0#thm+c2*`9%;? z>L))Fzv=bbN+4vV0}zH_R&oPMw{tP0yXYYHg^)CrF|-l}x)P*ZZgs z5LcX27s{r%%}%l*K`f8VcS7}DAyws3M+bH9^7qTLJomj6-I%ZO*#1TRn7;!n`t4&R z3~qsC#XXh0v*D~zBQM?%bU7d*hHziVrkH#RyX5@Eguu7SKrD%)?#vUyL(j=l*kQpC zYf^Qv>a!s&Q%=EBOfRw~iA{Yz%mFeMAfoYZ79nIWkmVx9tO*4i79=MioElq^JHdp; zNRYT3rD{ca8oV9C|J@fg;C}6^em0Yt@|&O6@Z30o?#aNxj!KMhKX-jfyZci;pc0vI7WJaff%JvB;dD34s0bZT~a4s@1TW77=D3fTJk z`e6~O(XRVW;bp6_G;T;6+pi)Z-xo9P?%s~Wj{2JkNqb6z@bGZpY@T`dSX9D+183Eq z=UvK?gnY``3svu_r)GT?LtFzrI^=E7BTMhUS*3YsS&TU9k9|{#cYTc(x~no%ZJY;C zX!pef#!ZKo9;`PyG4fddv(SKrx>u!aQ-7Fkw*ztyzc zg@y$S7U?E_5u{LvkI|{`I&=L-ZzH<&dxRt74EDEU4r`_CRwcxs;Kw8uOP8_9Tz72Y<{XOD>&;-4BTt^ooPn zJj_PLqNrwXsEnT~mjIOIFYt~YEuhOBN~tfr;#5b4w~PN2Grpm312;J|_U~PE$QqE%%CxMf>5m#Uqt$Tv>#O`rd z9&mO2B)q3KVsu#W9O+EG6iz$>$_rzq z6wjIey98&g`F(JmaB-4hOX8^PMd zfYfVxW6WVL^espoPh?RtS-vk1;4l1ibm)b_T$Nr6#2g`T&rv%i>A!sY6m26e#rpzO zAZCQCyn;7HT?|gm3XL6dbVg)H2?!2NR$rH0r-zE0s#g`&eIk@b12RvR%ac}6;@dUx zqcInIWcX)!vBrws;X0jFJ3vh&QfRHM^wcXLt!rI@9+CyA&Da};0J^T%FCQuk>t6Spl)bZGvHP-LlryAeqPBx2cxR;yYqp2K;X}i9bv51?E+6spE8(={Wte>9`>TK+OuXY z)3AUx0Sk@X5ERjXja|8hDf!|8Ys1AlTNs_xqA*uFX@IB!000064|$*Wy)FR&05CAp zF>!XfaSV-mWr_Mx8j4@4Uk96GWmz8gEj)J@7#J9s8wnT~Sj{NzW~oi%S#ZE3dB~^N z(}r(+;~N_{F92Lbo8;dMRAobJXs>kzl;m3wswlx^2WU3f%_*C-ZFP=$BPs>Q$h@l8 zb57V`!UO|zO<}6qvGTRFzY}nip3>ONCPhztPz4t*+#^Xm9#xG@Aj;dr8CJZ@x?{ed z$vStcL|(mPh~7tTy+H4@S|S_1wH{?S9`T4tO!n3u6KCwhf^U8B7wCET!>YIZ(LsEC z6#BTF!B;mwdJDd1os~BrARr)dJ8@HB6$B$)g7Y=BJve*;LX;?klMU75YC*6XflB;ho zy8haCx9hQ6Q=t33}^u;il=Bz?|l4n=67u1W79s)z{W|E zU7$5>obN*|<`r0%vzSPj39V{Lcc(Co&KymqWfa=Yy1t;^cy>%)OI}Aili3^NR9Ll@ zM`m9S3CqC|dxl7rZ)uRFh|XwZnR>d8gyu4V%^@E`&%swKy`^Kcebk_b zU~VU_${$(cwv!FOCd*wdaY|>YDoh1b!-EH}7l{R9V!XOk)+uLER_&`+lUMTDbbokj z)Zc9x>N2f2n^5{PI=UXqM5jlF)8|%xqJY{db4ngf>ocu=d5)Bp*40hFq2B3&Eq{q% zV=9>%%%%w&K>9oerx%VQ1!0LnH?t~DAGAkRq$g$QyqV3GWyBodKFDfD&ifZrevJByd9(8O-V1t2X=nCuKYkWFi> zx(LFQ99VAZDcxqYEK@>v^vwDh*KG}>VQ2gI8A6*aJR z6L+khXV%0_;vrQ%#2SIpbo_eN8 z(vvHazL?uPMOYW6cL{jrWw@sY`PY@0P){bqjMBA`=4m;Ha(+reLvY z$mbHH{Gj1@5rbJGJ_$GuE`CyS24UZFN%+iJ9!!$AS4`uK6$r6aro)+}hA(Y5LIPEr zU||oL?6C|(sk5&*1#(7BFlmE z!~AY3Z%6Dc{VY=Q6%DRHZ}QoE@1wicCL3zJLpgGoS`lR%mz&g&Ng2@{5(g07dqj@P zGP2TiH+hh&m}W|IU*zC!Q0k=9*&y7qY1x=x5TCoKo?|cb|LgWoRlcIT3n_P2B4U>~ z(~u=Gj>(>HHT;M_==cM{a8Ru#f0+4lh^8BR>r%w|k2DkSJba}rU#goj16*B3%V+sW zGZKF21YdmZ0cRc}=AIco@VtV~h-S>eJ|}Xoy^qBHUSjg~Y;e#?%d>9r^_(yjm?M1= z9jDpCG&9E9FQ|JG0sy%kLW?UgpAXS2E6&p~cw;9k#;3Aad{CKhL|Zgu$t1JZcnlO- zwq9l?9w4&eeCn_*Qvuv80ZpBMANNSYHn>XX!c{Cy5Sl4RjhixC!_OnpJ@%99Ackjzg~a?A_^qPahC&CZZDQ7ZZASs z=^D6<$5JFyYJWMM`?ralyX#@$t5S@F8CQBYkre4snf)+w(ZzX5P~||Xta`c{%~`BI zxLQ}M716|L9@M6WTV2^3osI%Aa^wr4IuqX?N&6;!I&gq*7L+w^4pS$2u{?8I8GeiO z-WlFbuGNX;Z)I@U#zeNwx2f@~8ACXa$h$Nz3zpLLEA*fG9@ZHI5gcUaaDu*p(_p=u zX=+*&nW1{2kS>L%(nHE5T|qiEaFRCautaGm53lF?XluIY1qvyp41Hwn8(yc?T&JfE zZ84_R(;r=0$j!-$D3vR9aBErg`(UIVlB7_ZVH#R2o?!E_LEz&DXb1|{%eue$uBIsD z8o5i)yi+yZ7L4rbiUzxT-mCWW*khoPn-o|f7RWX+l*F-;_??%DGfxWcLc7qCFdu01 zVvC^XbuJ)Sm_JaBhQaSlE?07AnGU3r#+p9Vs2x zMBF3Jz^g|SB`YhwP`$dBN;ckKUZH`$5g|m?di>QPEl2 z%>|%ChfaXX@i1BK4Ajwx^oLERFmj4vn{)^xv&Fy8zpCz3U<06;lP(tezxeg4$M9nd zdZWNEtP=L$eZc-F;2dk{8ES9tA%7Tm#te>&ec2<>BI6J?*oK4mSLJ2z>i*vM43MRe z?))v-ot%%i9Sg(~Rt7P~ew;Y3zj6N4X*6T~9k+KlSb-9=z0#Y`QcnWdy2HP1;Uylp zX+?1LT#e^s6zN(o{|^diyG!-7?nAMIgM$Z5B5*4Kw*&C2LuXbR}IviJDUs}%(THg=WvHPTal30+U#S|Q=DxH@k`cdka zjjUvs}ap+btgOL#<6x7PA}oK zhtmUm?|=xmjJ#5;2uItVnULDek!$ho$@yL+CzF{ce-A#ils5Gc&sH|am7OW|g`Jn0 zjt%?L^+rS{Y_EI-AsKBV-ST{b18?!S@wGWI5!ggFS+Oi5o2>8uMZSh{r@LD`-mdli zPIV(`|D}hb<(*$M!Om&)VDz*1Fs1llVfoZ$58D^{oug~+Q``b$j;g)u{_ZFW*8k>! zYv0yzjcK^R0nsR4AFzj-^||O*%~=SHIb?&ZE#h#c9T_qBk|s-$>4XUjL6NW6U8Z~=J<>FYw zm2ix+`uZ+*yZ)SSrhc2Lj`QM{mdEmV{r0_Aw0lYw%e(Kh(xx<#)Qe{0#aGhRTkz8Z zterkBTsb@~!e-@)eEVWvzSJzgS77n6^~TZ+CNb-mFpiRE7F1o7m)=7; zMlw9Bg$MvwFI@EmtJOwK^`+u2q;dANbpnd#AatWfP2!{Sb(~jn?Q129 zUQV(NoBvxKMErnj8UO)-0Ym8ng^g~Q>{Z=eF!$~iz6H`zar@@xiT^WLi)qMB=slVbWOLpLe0~Ib$DR13Y-n%L*dmD2DGo zr5gzo^6k+tM))9(CI$c$_q|tpcq)tu-*MhVSol>0gur^0jm;{D+*Xt&&iCIln%;UQpMhjZ(H@6~E0ICu7_ zF??cEr)Yl}EGoC%HdmMUYARYYKa@;D{)_L_eROMhbhOPd!i7#KC3In~MQ0W>M!ifd zF0D!?v5k@Ld>5>4ghA)CPnpXMU^`TbM5$o0MkusxRBvG}_%vUX_H69N;^D2ydq_*7D?clg z!-541*5>hQ7iQIf)UPcOYxIcpp=Cc?D_^!BfG?$e8xQjY?){PjHXfrRAY~v)tr`}i zTxu?u60ScQxN}1`mWTT2K|;a!l56d>Dmyd*tR-P!zJsqXD4!ggd*v9zY;)M}N4?(B z3`J@w9iN3+Jn`XD;GYf&HpevD1R|O`OOT|%AotNkwBA}FglkExunE=F!5)iA5$!#8 zOb62O>1OXLcHfeWldhBg4wWrKxQvW}Q$Kfrjd#pW6-Do9>`kKmPQ76xgu5)bh`A)} zVF|k2bWz7I3r5;HV^fDJa|M1Pc-YQQhK*1vBuY(ylaPq+R;KK1 zC9BTq{knB_QPvu!+$f{nQxC33JwGk{mb^-lDeUmzuENtQi(O;MhnH4$m3Wt?@7uvT z;h=|vO2*90a$w@^J;2^C1zxYj0rq&8sDs0(52 z_wi7RC9%I|w(S;(V+kxo1PKoK21PPu85YB}<=x!W++#C0&$g0&3D-J8I`&IImA{DD zWq9;<7uq zTo!zqB19;6mEF;HIf3vL7dlLf5_2{lpocaXT)v?M+TTJz)+gyd>j>-m!NZZ1<0}SG zb8}SK!Gs8UOUN^2YvaLNY7?nb&TVpQ8ltluDL4n!Ei7v0B2(f`eX%rN+&NAUz@O;$ z-nHFr4wU>x-0T4CAnL?h&QPIR`QO%MxO_r#U@CoetWJti-n#$+0U0(B1Y`@70V@Yg z>36wv=9~W~zspl=i4{6tcto4@HTw1RH#oh0&BJ=@#e4Es?rXfO=KIacdkay$oOUir zgw=^j8vF}r;n30PR=d@%4Y$x{FMfiH+Y1F=sA4WyjVpu^wXzE$F;t(>>qASr=Hn{( zuDOHY3zS#8-CSjOL=2EP1T1u)=0{!#ffj}jH!e6TktScRlxb~Do;kO8;Cdw@qkLBx z&B1bfYHiE0NDU}_KA8x)1U==}iF|N3C%^V%nUi3OPuPaBIFS1ve(J33v@Iin9Z-F} zcR34VFXacRE2@mG`|BYjl^g0gU|yC<41WKls#t(bXSX>^typ)=-LeqLwh zwA+{vwin@HqodGC(klYqVhm%RP@O6;gvNyEO_j>6HaAX$c?EYEl<&8>AOJx`x~P`e zP0&3-xqn;a&^LC8J>s93O&qRTk${}&R0M-c8xoBup}{1y5SM|Ztx1WFx9#66TX2cU zw^@Xi;uG>$tu-R))>srQ=qBb4?gJQMN(kTs_#FR@Ti9|(-8u{QOLT&7%mC$yJF*ii zi>-BU+wfi64z1gbMN8~MZf^-T?UfaK82Kl*+$VfH#A?To0kx=QvaUYkDSIkm3-804 z{zBQ8M;_VDeBsM;j@Je5Lnr8y(TFqOuvL8>88bTys&wRMjp!4?n@kf2)ki$5m= zzYAAQKI~oBA=FUALd#F-*FSsPfGXv&($ZJh!d{MD>}CRy+lAXZ?+pb~9s?&76ciMc z&+?-q6a466v>;jBc%g8!;g_SDAyg%t`-a0OGcJ<)jz$`Pd76|&d1I_bdPT#HhCF1J zo3Yb>%uSD4Ym(m3QtM-1$)GpKv)-lD2@k@fHyiwdeBP<25jjmmvanw1qo!iD`CC`w zR8^G?SKE`lZca>i7A1s+2jO{U9Z)wuof+ z@ljRnOb)GZ)JBZ*^FwV5F8&S%M)Fw2QCv%*s%HDL8E88?72f3=)63^F=|1{+>L`ej zrkpzcWuP#vQy@aP0s-F)e~U8U@c#9Vj*vT`-(&0f+lsHXi9AXdI&#I-Su*Frlx_>t zFJ{eLP!y0;~`HtvyU&6?J_R(i&LZJ}p+{7+R2N#W=^zT{&&9ne+1KF)Zxw>2d+ zU?b`I*d7-rl~=5ls6dz&S&Q2Hu-q#B0Pp5bKOJw5QFJt0cYGl!cK*P@7=a?nt)d_O zE@%2rF-YemAk=(0-6j;}!MDJ8Cbg(zq5Ok!gmfRyyuw5$87<;LTJ-jPifNq2MLseQ zoQyM6`01ny5w%Hx%CW;Amw9rw0QjdyzFglYb<{Yiv*x`~epmFg>5TiW$dVhJzsNI2 z?ZlZ&vCYDm+n_8V>I-Kkdm5^Kx|iQCI2MOiJgpnF67fPxqJ`wxbn3x5~L4G>h(UxIwi~<)Jj2Rrf&giHe0BAf{ zL59)MLB-iiQ~_fU&cdX1tn|uJR}}E zvP)iKSbU@hXCqku0r`U4$&awq^Uvf|cX&jo7Ko?T<`rP$&t-M#qSLQiUCDM9FA{aL z#;z2v^)oDzs464f**YN-CWZ_9y6X+thlM4wvwvn_504<^N>A_nAJ}36D=UT4M zeZ#@zhZCPmAqGVfuIQ3bYQAgmEY!MkMj3o3R#_w4M84TV7)X5KB`b}j0um@s5D3@3 zh{7QTp&J}+T?9m*Dr`tmY^;TA3R>%E18oULprZ^< zMChvLX0nlg*6zuJ?Pll^3$+mmpHSFrI`Upk@vjsZDZN}%Mqw4im9pldjcID8PIdGs z9=PFi^-GkOSWj9{RbugvnpK_hT9uM7(jrNTWMTBMPkQY{gTYV|Hsa$@L$<&FKw9=^ z?|)VAT{n+mDBCLAg5g75QDv03T4~qT`Q9++$*&OQ)<-ba%y&W} zneHB^2voHU93K@SNUa8?T_3I1Umd+KCkB^($XiUvkRcmQ`Jniy>{wY_+1u%w zbz377b~7%2p=})F74KTaZ5Z#QUoH4M7pkw z!pRxW6^Lf(+0`!Ri+E@fxR8arz1~)Wx#jibr^(Ump)puBH8a@%wG7M&_NMQF-pidwRV|r#$E!FlS2OBx;0$KX{Y(ny0$WzG-c!vS)IStt*^UU?KNhiG5G(rD}yP zdeW4Bk1rq|65GTo&K{mKN;UVtf3=TlK&VfkQQsp6*K8>+1k9Oy0jOuet#8l|ajjRN zhyK?{u^UthZ#2e6l5*cM{?P4L5Y-mK0WX4xAdNgK4c^)S6ev)js9vQ}Cu>Jv<>BxB zZ*n6)4K!%bpwUSC=xk_W`wd*-+<5)UAAOG$%lowCVTqnv8B*EzuVpjKr!!KB%gOI; zpX0ycA|HEOnx&fIgHO9~xEHenoysjKks6B|5sPc}5@pv14mjW-ssM@WYPfroj>cvj z1$J{%IO}K5W$##0@HnOt`t%t!7CnbPCj~KXcw=Se)yS(Nquoy;BzM>5&npoTo1ouT z@ZUni-%&i4P{*a63B!$ah$iltT;rzku>PiBwdIpMuA(T@vsC+AVn>Kf@>2Fuwmh}# zykMU1ikTo&kdw5#Wf%pe1$wq*vdBUi$)72%iN65M6>r0TAj|`sU-Xv&{O~b0000000000006vwJt&>?7SThraSFEI>&SJ~0x&hMnnPxgl`g)RW0qZ(x%cmQ{Le4$ zwVs)K|4#Gsqh@$$hHK`RMsv0lW7mysXXJ#0FIz((uA2EopJ79J2I>p?gJou1tfF`8 zv8l6D-|}Hu%F3SWJZsCdV6WG?g!0=s2x^#BgjCE%bFA6ciK`)W&F( zsB9cZy|4Yy3tQ6GDqm7Nr(mVWXtM4i3X@0}>S1!7^q0gLG`W-0sc%GZE$Mm$z&30O zt!Mt4-6wSO^SDGLF;DUwtF7B;N$@wXe>5;R>td7MU|cgOrpkGwT|kIwY{EI;&Kp4IWQdpP44`r>V8 z&KJXE6ys(0PPyK8&QoY4Vh{I;`*~jP*ZF&noh@8&FszD8{VztdUeQdihMLdo!hLWU z%HPrfcdk{jAV^MxNq;=Rn;KSYK08n9GHT1ndC#&W;l&$;HLL9^7RWm&D!ZjmK#dl+ zlE$CSXZtCy}A#LE2SUHb2G5u2=IfZLST7EVYSGDD`>o0;~jmSNCqX7Eb$K3;W z(pHUZy3y++@R_bm&%DRkb$3u#lX;jIX{ZL)iK(jQE%A4K$aE;{Ij@s1J6BlpnIzfH z5ybhM&B0%1QB=5@8eOw9LvS~ z%wyC(gE+*_vy5n{xawV_IhiM`T?hDN<*@1>W|G0_6IA z^uxT|;(OwyePO~sNB1M>vQT**1%56Ez1P3yID4M}H;4?74s8l7;e={g@yp+#hF;SeXQ{u>&dn&Nf@Ot| zHM$_{>6Ky9{x}2_iPZQkxQx{A1!qF?>{;%&__kdk z{Dof{WC1#kxn^k3!S#gfD&oR*)@qe?Fkv?N*8eGe_QdQ{dbyW3H}6Up>C1G9^wkRE z&p99DYgH?MH5tA`8{$04R19GtnwhtFhCa8SeaE%vv!39+@;qJqyzBF;g|ZUru$XIR5l?yFvU3CnA6fHlhteWRTJGeRtjvk z>^sJCIVm14x1bO4fb73m`nO6_0lLGrb&h2FT{ljN9hwVdww(aA&Wf@{PGM!~5$nvX zYyG+sW4NT}aByUT_9p(^ zlkCH^PCNfUZW;aK!QZvDmY(`dLG83qP*6~WC;ielpP;pSdcUCB6JT-Ug)Pomhp2_@ z2i(IlPOoyMy;$?Gei_MEo?23(YkdRA56#{)Q>bGfNd6CS% zR$-Sa6bj!Co{ODQp-m79bV8G?ZS`t<2k3_jOn^He2J=uyCI!cJK69dcpg^hmXVjP$ z;eZ%h>CMm?D5Pa>LG)$(n~)$M83~M4ZO6<|d!t1%gelCLjYUYLI;aaNBF%$%cC!RF z(dI#lW;XrT`ngILAC*n@ z7GhE%&~E|vksZ(sj0=Yn>SD+_X0E!Q)(c=71<((gtTr2Mfe*A4B^z|2<73W;f10W8 zJIOKeOO3OVoH25OMB5gamG66BvuF~}qPCR!jd5ir#iG>Ft(S6ITHtv4?DSHX&e4?J zx>sb5(vP&F^apXSp@_ycU8uvKjRgx9EWaqQA+D#>I_+B1ngt7R?nE<>l|NAY8SQhPCZqrP^(uxdpf64AzM<HDAEMJ331mM- zSTeb3^+Z#bzFM>C*i1Itn?bXOE)OF@QPG$M=~Q4OLGU!&QV@;@efDLpgN}Z!XJZ&k zziomkQ!aDAX-0M0DOAp1O=<)hhkiXxZ-e_MQG(!>j6v+au_b7l^Q_#rAAYI|nq=%^0KN*rzgBpF;|M_cU$C+u)+*3TcoL<;K7KtZ5 z^Q6v28!gEM&Y@M#*1D#YCMG7z&t%*C=$@ITrk8*8=~{VaU%Ie5$;uo_T5Q=?ZB{SV z)YhW@$0|6c(H(q5#TKmBM>n1?@=QfTlhyxTRn1Bt#HyAEp@_>(@rl@%PTn9oZRN=w z*I=NhD3T#gi_^x#x9(J?AT!NwzjJ4v?Y|qnBn|UG`q{UjHcu;vViBvO?dWJ93OKyaD;$O zOl1!fV`)R`m^Y&3qy0=q#RNkC25TEY0MqvwXQF&84^vqv=sFRn7A6!YIl=TCib5Wx{B|jzIVqbl= zM)G?r-1fB6-j}mDHV|j^!;iN@U6u9!cokk=8!xw`%13y=<$kE2t zk42N3alei2$&i}W(D9NGQEGvCxjnsa97qz9)@&Pai?8qYOznCR^DLn#+;uPLuzpgA z#~2T7I&^fr7&dYNnTPtAm80ykpMhOGbYXw%{9@FIqp|hxVu~Ysi>$l)X78vk>je-5Fg-kpoTkg;Q zxtYFCAL~bQm;2@8y%H+XtH5TF`cTz$lP*3(Mc%)@g$ zz&3}710Fpp$zkvm4 zJ!7yuPtFp1jdBGQQ?N=4Y#H^@$cAmU^7S9CXW!XbJ_dT*3i|I z$!xhOVXI2z=c!6;;H5JMab_vJ*Drf-zYMD4pnGGA93z5<{?DCKCk&2djv_wwQsa05 zabDh)dt6gVa>AX5z)Hk3^N(c)&=SDrQ>yf68mf+iH#|o!J&r%(cG`xAN7g}wpHFri ze7s(9oK>%pPjjH~^18{B+k41NZ`y7Z#{P>s`L&pNF#JE0rnG`LdK-4t$kt;*oMMiO zv^tZZul2eD8mo~Q2QFN=?Ao;w6U8gxlZ%CH*cU3w^ETH%p{j97_2y509o0zVXCdptsWh-%z>;R3vH93$Ez zzL_4KE%BY%J7}p#5rj9!7w(>lD!dCYOg@UlSFFx^8D;xWZGJEDV*7Y<oWJNspr6po1v+ZDFR|KC|NL>}l{!tM(g$Uvhl) zV8Wk6h@g^zY4RR~l!S6)j}wpY7r@1hluOJrh;GE9DpT~8m>SDc#UpOf2g3#a+t zujqeI>09QU=>_bTKc8XaGOGjnb-VTj`meh@JS>fS7gC*0s@ncMwzaSsCpIvEqBlQD zUxeL77UEYl%EuPJ)W#Ofp%&O*kR5M^0dl;{T?(i#v>5s@<*oxt_4moN=M#=mB{*1Y zN5=p@zx5XIq*4u+@U?1j4kZ2sC2;i?w_8@mLf?57ae0|^EuI@2TU5F(r_CjBVLMKZlL#4KEe z$`+$Em?~A5F)!(K;O&SL^g*4$#-NczVAg038tz)R7IoXLy&#vXC1vmAi05IoEC<$; zF$<_=(Zplq?iMmgA$^Bnh+qq^U5$v@q*DTa1~bxF$irNtmqG#Z19DIgoGSPvVK)I#=Hf=s;KqU^?@WJO$07oDX9(1 z9iKq1w9>Mm9J;4T2)cN2ipyNNCYteSnPZhir%C^rr!IVeT1XHhMvU0!n5*d<)OKcb zCmM4)jX5uzRGBz@HwA6DU5F7OLL_VQY{{UaqN4tX60NAO?r)xAz<`+Iv${$Q<+Cs* z{b3MM)d(8zI<64ou!eNxO;r^YjoAz zwbz=Y%E8-PS9_H62)qF zVzX5|v}S53qYI`^vjOXu5bN(WXfXIBwuskg1fLiZNNm`g;GZvh_tuDGuzLv z+e1@BlAyZ4B9GO17`A#&bUAEnxNZEc(78J`elgSRK|X)C)j3wd$&|+8GYftiazbVK z0QtcQ`FRjGAnD+C;wl*ulL#m%nC`r;8)?bVx+GO{Mu)Vr&`G^q z0ZGcmzxI8$#G``t*4U>Cn~P{QLhw{tLUuE%jo!%EZGud5ZV8gvO8KJ9X5X&FjYqU+ zc9~kFkv?aD9e2w9imM)pVq%Bpm>m%#L8cjwe%ah#Tm`qS^nQOzqXd>D`KtMo1 zK+EH50`dE~zK%-FiL8>+?(8dLRmJKA86zlz1q&7|-PPBq_~T(LG*SlSkF(gvKK8Ni z;w}m)5vyZC6yO3>s8C5=xs$_JEWiu>TuwX$$Lqo%ot~?ip>aTmkmwpIIMf_Z6X@&#F6uXb#vl4TA7&dH4YlyMC z*2kqO9KJTa&Tg}OQ2SIzG1bYXF`67#IE$~P!LR*_@oSLZxc6%NE1bQ-S8CBNjsc7= zwu6j0kTwYexdqVK(b(>pLv-E&g&qw3aWIa$L{d2OXl+DgMTH<;7LR4*wn{HI(<`hL z8d~S&h4yI0(cM&g-s?S=d3ofQU15{;wh^-RY@iiSL78dpRfhS;2tLEDSiN|NinHMQ zn_teo9;d4lNw9EgU7Cs8>hPcJ6wGxSUEGZ_K=_5%*xS`otQ|ws>p3?`k4ry)+5V(C zWo9reIE71*%-{PYa2n@7-~Mv-;kF=om*P#{1Iq;3Q&jZ|XKHsl)DgR`5dR8j$ru(Y zns@Y~1=-~tSpL?e@AcW0=gUP^WhZCoe z0z;VO5?uO}NVf$4`F!I?KEFG(qoMvUlOEDFb3Wv49cc|f+1OvyHhzpE7|-HTl$}_* zoh6*R&0ghh^Mbh=Px@AcFL|Q6fR!~ z%@mWJuLNI|*-{0}L?lPoZ>#S)P*4yMRV4op?T_tDhe6;qH}UU+sA) zwqEo6rHhXROk|tjPLia-73F)yG$ufJ^=ORG%p9DMngf3$+s-8#F8V1q&8gwY+xfwR8JW@;Z#m?;gubmK-@^DV3E1`V%V z&Vw4_p@&WS>-GEd7X`)EOQ zC8YLn7a+@_aTBb{`A@6tu_*9tc7P)K|F_yfJw%d+3axHe;d{%2WN=kBE57ro**9Rg8l908xem)RT9A&0#lo<*`@)pnuV z@>0!mkx21@YkB3k$k%Vyy#xjZ2Il`^S?uOioE@oYRM0R&~R5RIM3nq>1N|M>IE*o)1X;p|Wl-AT|b%7Sb){xA_-?4?xF{ ztFQN7AZ}?= zm#S%&sLh)U7Xn9nbuABUEV~#m6|!tWU@!PUKtK)=mNqc}0tN=I>LL2eYWV~m^s`d@ z4#q$G)~pml)`M=L>uCao1afZkwPe7+z%^!LFjGri27p;LKCX{|V?POIQrr$tK&H<-qfz63YHT9t*n2eiAy$V*FfVRYbN* z<&7pTqMz(`ov^argGdkT6P-chfO{f#e(|Mx<6pIu%|gol(bUT_vF*d_Bnk-1n}RwU z0VK!BP+?g*${`wxE6V{srMgJ$18V%s1(lVJo}k`&?L+gqZ#W!Gh{vca!({nWl9I}b zIp`|O-A{FjEBn0pjH>J+;l@ALyY`6`VC%VCYRZ!B?Vt76g{1H(tQK7i0geW9V0+QB zX5R^I)?OjkU1zmcL&?J zZxMkzQycTSPi#*p<3H0=oIAw>jHqvXHlVR0PP8kMeUc zJqzg1whafZfut{aaBraaw)!{*yTco8HzI?ku%OS$`FThKdfUm3zmV5=^1=8MXd)k? zi5?K5J|8@2=|IbklrFjGml67#&>(D^2*M$R)g>n`@$SQC!B@IiL&j%Y!^gx9rA8}) zuiz{A3cliE6B&I4KXCtQ+X6t_-7w5G#%$_yWP^;1Vw-gThwG&tab7f}%Rgsp2ha3e zr#1~0DpYQO3KgEGqX4X0Q_;b3Dv#6b#f*8_q;d-Mpu5oW%vlbU&4d?GS)#gHW}IuS zydl;~jv=Nw{kDVr*yg#JT<3uJg;8!N^ws8SIc^%6sL_y`hv#g#;IKq1dE}(t6B@ee zTX=XlaH6T09~Ax-@9vw%E$1Ify)F5HD4Jnxk?Y7~{*xg}rl7C=P;ZkbVlDZ5wQGo; zw(7kuLd*0xJNiOC?s>>oVG$y0a$_Ne{?d5LefS~hu1}PVX|n*j7hchYFFTduy7RtP z9nhcYFW2>730jL|QTWuPHil`_fh`@Le2j5J$`At9GeMcQS7MMnQ#p!irS`kU)(2O$ zn|_kK4(P<5t(crg<>@8cZ1g(FfG-3pZ00*S4ZZWly*5r&zD;J^qAKt@3Dc2%IoTNYQk7+^^ z3JMCE(1a#*L@{#26~bY-gPcMm%wl_HoICB`+^d{YxkM=u_XXmhJveGz;rS$+b)afC9)Ia0Vge8C?+{Zl-8%HsrAq zC4wL*QKCd6;nllWfzRVG&bNB3Sv#>?vWyzcfkp5?bqp5CP*yJza0D_z@a{W69_oZxPSPUy>-Rg0Roe)pidxVfu(QL-eaGC__G zNbG0BD#hrAkMZx#_nQ-*6lJxTJ($f|&Lo46@W)!uxyXIqxjhw+9n>C*O@YdEFvBJx zz2v<^qpJiw6RQjvdKF=@QOjyXPM3JAw=8jwR7B1^AMqn7@R-iKb`h5O#wIMa!0)s7 z_AJ8DMZTBe3eD}T3EtxP)k==WgNpe$)9i{DoUYFQ=G}H~9HClqm#Z&fzA`#}ebq$5i8h2K;+)3M zGxl2DN6z{@I6Rdc0!nc}82t&Ml-u~`6fw6k;u{c236+0gVYeHgfZ!|~d-H*qqSt^T z<>MBC)2~2{`V~SAa@(JsICqesE*wn{COHZYX+nrI?pZVq4>MMMuZPcq@l-5Hk|arz z1S3X_$v7HuJ}0r{UoJk$3RshiThQw~2T#obYe+c8&kt9#%CX3Gwwc~m%O^>6q7zi8 zP$ku<8ue_0>MeoO!?2z_;7%|iweq2y4Pf+$OO4&cP25-9F=QB+1MZIOupJV{pW*5l zAPO{(%`Z=sVbU%7t{|b%W&AGXaOikiV5J3$6mc?k-+p(;#TAZILsEcpmG9Hb(u(gc$icW1gY-n?P zJMdNR-fABU(55yhh_=n_uB5q^ggSLSQt(JpLp_H$p+01XvWY{paw180rxEgsl^ko<) zq?+fqPCJC7gc3?9q4Y(nhC`Z-Qu^1r{D8IeD9fYV6`C;tA@cON;H$YA00KfpJ`{7c z@;fplpA~Tg$8{EXNI)w~46-a_eB)@*bkifBbw7p@1Ophw=OY5pA8N2QUO$PKIzcPbfZa(TZdf@r$JTr!7D zT2Z@KS$s(dqsCei+ARr(k!W7i5feOQH!IlU0_maO?EFYUf zy?#|a)_>I`-0N^+Qg}510|Oh0Obu>zgzn~R8h;%{%oQ)nJA4pT16Q0o6L4^FaPZT3 z{+EAlQAjI=5zq^JD@E3CY|FvmBI5JYnvFF@3o+E!a1oL;2Ll4bubBI6n;FJ|ejhkxu zjL66RIl;oCSE-e>IEJ-taAOSYBA_E(+is&fjCFbpxcN~`dpFgEuHtq?J-#)3rPO0i z#HoUPyMhQVVs7tapggjcA;g~5A@Wj{TMDGH-h?wi48ZLG3i=;=;9_2Nhk6+6JB*@sG@ji@tQuJjG}hM zOjz!q)yy`R2X{z3l1t)eBA%NNlL~5U*KSkrt!cuq@&>%H+a*wAd6n1HT;p<**Xt$l zF#YyDS}R++CBlg5N?FqT@PRiA!tWw;9VJ#;pmr(+d1=2mjkfNNvTeeAt{!E-xiO)E zpx+sB3P3NuLU5F!Mv8r<9Dj;8oxc>MNRc8%TXn9z5T++vYg++6ejPonHPzL7Ur{o> zv2LJ?*2kA~-BPGn-LNt8Z}Pubb+3L@0>)NuIak(A^tvA1Fq;5$Sm5(ixz8l&H^cV@ z{6a%vQaEmb0qp!lpku#e9ShQyIuDbPDE}~nx^gN>XIV{7*YVVG`CFp=gYGlVtQY_Q z06?8LX{#lL-Zn&-r|GR7Y|eS^R)Y-Tx8C}srn?>C2RpD~_liw?DSHF!;_$hxw`*w+ zNO%dOLHR~;`(Dwf2DgXekaSk|@L;r&^+tdba2%Z$KPPR%n>6;1U1;Kz(z%n`7p7tXf4NlBw-=GkGvuA@BGAGBsB>G<3r)|EmQP!s zP(N#he-vGKD;HNYJ+|_byO;9dNtWRy0nBnzm-VStx!tHH2R<}E)l&PK;wEk zmMT4em`oePtUSwY-Oy#cuizv>f?TI^Q-FK<(Bo;WsZ1U=hbI5~W~fO4=sK-u(6Bpa zVmEE>T(VV}Jgt3V(gDZca)wz<6c{Mzx{L+}m2CSW%DmOb-$oWj3^i9MQF0$w# zB{Zb<4<>JWMqu1o$#!m;^sCJ)*=)OihNLk3$ja`xYMA$;2U zzcTx$@#qjm0?T}1?cNR_RYYlDS&*Zh#TkhcR~-}4ygiPeZ<8f}pE1F9Mv*~Gfr_65 z1}*+Y2rr*0cO^>a+w#Lc^Szd%%iMGAkZoN`nGiUwXzU z(_t&k1xwu&zFdD9bV%_wDwKUz#^=q2iZ0!;*{BnrXRi7@GiPmbasA`iQ(l3PM@I{-RWv<3ZHhl zI-i)%23wQPKAu^B=bd#!^*a$6-k*7~)8!z;I2X4$nTo@b*mytRt0M-il;)qU6>>}S zTJpL&!5dwhKSYg~y2-Py!4Y)Jez3^J@fV>rF)6Lu+jmA~fr*|DBN+}hwvJezGLxqE z@2Bc;~>^cCOT^Z_7Sy|QLgp!TB%L+IC z_nc1@qlb{`9Ff*vaO(^FcEY$!61EBsK$u`8a`RA?YD7^rgS}<}0Y+3Tq%4Q6WP!Xpg#}MmU zo<@l>Sz-n<1x7&k-#!p@h?HkFP8Nz@NfLf(au8kz9HeTiz{O&_s6 zs~U7iw|*E zBkw6}tS^LX0k5Wxu+Xi?l8rdaaD>IB%*t-`uU2l9(9RW#az2-2$;Zp(pgkFJk3EiN zn)3MQU7m`?@EBv*AKiAv<-k^)b}eVsRC<`bgw&5l7#k-hG1KtBfh?Qk@7kE#tA&CI zd_T17!y&$k;k>dPimReGdD^m*)6m+modCiuGc5?xRmlqH_KC#a;y$SF{*=+Z3kL;hj?|Jlv6+KrL#Rcz%?!qvr;DBvtrbaU@ zoY>STtv%^zHFz2=x4y4&P|yQyv@)#eTirCT;GUS6Zw39AG{9fv&}s0qLlR) z0yiL!QVb0Sfkwd1(?G`VWqp9%#bV z`#2sW(!73Nv>Bwf1~kbma~EiPoxpsP*C;8<{sVZjJ%4)VN3c{!QQSCmz3M6tP=^#L zQtzCfMjz>`<#mX0&K5Ef$dj;`j}d~9drg8i$j_y0oy1b*Wigr}8a;%Jkk*t%XuTq? z(AHrK=1z2O;E4diLA?`!m!^B!!Fj@qX7a~A34eef>|i~HWmgx;rSMS zPj;|(Py-)6`R`#WAt~$N!-o%ll_G!19O`XptL#5fJla`f(JY{6Mz33Z;M#`Xv9iBB zXt%#KWE~-lUAMs@L5vu&X9Dq#_Ot3XD0wS8pFcg`M0sJg0{7pxrXfGaoaH^KIN?ig zC~6TPK;R)ci}kuV4ML=6sU-(E4qnOnhv_PZn=hkrzvR}Wq`U$B3T$IqLfWHaL8aoR zlc3B;V{wTBuF_$fJWk$@K3Swe>ucO9jJs$ZL_$Fjc`o3q4uJyL{Z$Z*p$`>F3yjzO zeZY_&?YMg2Mq2dPYf2-Lk!8bQ`DH_yUNDP-WCzD%Hlw8*nyhky=}zZ5i&-upAuWK> zK>V0po-g0Td7p1rfvlQ~@uZomGU;NRsJJ^=d)SDF(^gTz&1e?URCgljeTCig5Jst( zLrK{~GGRvRv4`QKF7c5*vCyH?)cKqL@i$2C22|$XJardnO;dE|It49RM;qZCPmBJU zY#M-`s3YIF>B4!HX$8eYZrZl6DGXr@HD+j|+Hp;Y9vcESr)tI~cJc-vcQ&j^(X8xE&%>eZ+vEX` z7z|ePM%OVVcJ0`l1rIUCLm2X2>7cr;h>seBoR|v*9iQw7pWL!{+^_76)7G)4+H@z| zU88$5Ub<^Td>;USXRX6WnbpV*$W#M$Ju-|sy~=57AmTe`c$M`trB;JGI@N)IfCzbM zB*6y)0;(9s%zANIUhiHfbn{N4&)_A_Z=Ca6hC6t-w5r$c&{kugifJA4OWb?m#8B7j zpdDfHMgGOttr?nMN8FA_(5OOJU}!&@Xm74(KwijX zKPVaMc>RIpApE#^uU9QZX{|hqzbzY72(mN!qo}&6e#$yy&&9z{ryLfZs<7kfS#*`< zknT=`AJtOnDEY|JpiGWnf57L4(if`p__{f3Q3VqR*ibrk)h*qO%skv(XOnAE@{Sh_bBP*G(EbgGtnc5^G!A! zTaGbOd5n7=RjR*i$c`ShtQJlNo^aKepV#rcXR=Kt+Ygs!p{G6&szt_8CD*oT^>3jQ z=CnsAg96)=0zGEd;?y6&0d0Ac;>X?H1dmZgfZOE@fx9H=_K1Er3W%3iE(`7yC1>@al`G^W*Zh%x(E}u@ z!{x;izg^hwll1i6pJ2a}$3m(0R}GuiDsGf*@+y`;72|IIc^b3o3=$5i?m{0Hv-#ZD zlqjo|TeK|n4SB|zv8IPHW05#I5{zK?v3;%g!}$;~Ht?moge~$fzUp>$t_=}#8C4lM z>c@m0j0D=^tN_(t^-^F=8!~wGhYKUC@fa6Zr&apl!O+@E@!?c{`T3LXA~++8*HFSO z3z6u4hcfJCTMV*`_`0!(53_K;yN5*1vi&0Rea;eO3u>p}m-|FRrkfEb+MhLHzJtN# zRWML4<=&>FkM9x~AsuqJX*RM1#b7>bp4CMC zlw*l1%~az+xg3N#D_O#Rl<#%HnEz5yn4*ngGl6f*nih!5u;(2%D@7aS#h_11Iqo#9 z(z`-GHfxE=GbkuH@t|obKTdax^=O9`*Sv8HI{}>Ys@7bPz5q zH*x*C=KCA0isZO*G$Fj}CP(YC+5$pJBK;k_i zn+2R;E`Fts9eUj^`>%=b^z`gc3-ENlR6o7pQpctk*zxT#41LqSJqF)j&f<0Rx!7e( z_~Q#Mhg0npG^!C?o^kOiMa0$GB4C(yXZ$*~n9{51>&qYY74|XFql<8zoUBvN4Z77% zy~`@M3La#08wG(RZ_JEgFNgM~Ih`hs@8<`S&$*2T6Zsxg6m>nynG`8{s4VI2biU9C zHC;1Tnb~1Hf*M=xXIxGtv##=KmQ9YQM=k6-p3;+j&-Fa34sPWivDss}Ba*IexqJt? zN{Yrx9%|}uqar2!Tzd48kL|qw@=b`4hK(voO2~XK)v{xxNyqb(b+4d1by?M&lV9P? zS*9xnmz~omo-6_$N3@MCNv~s}&D$lfuU4&6zalLmz1}ImlG#$VR4U z8^Ma7oKiaw=Co#s_l|frJ3wP6Tj&*Y{&CGvm}{I-<4%F(!V?p-8%Y}p{ckcuyy|C1a;_R?YSqcLbte%JFMg(gSth_~M6#AwaYsdF0Wt<)O8^m{ z^h4cb#-QjyR6y(cb91a@;$vxf${L6l>+xW7M|f<0KvFkan;h0-N^yukY6AuW}BFd|sL43hI$_WUykoIs^!u*)Sji zx<2_BE^#&?_hEBM_|d_+C5IKSVTL5Lc~wu3Gmrq6f_Zf%tivn*hmxa5%y181T~-#6 zwd%Q3->t>pui6B{_jCn-|MtS16aIPVR1<62N$3{}?hPAlO2)qyB;dyF^?QiZj1OFAJU7DH_{ib!J4W^vTRd-AZ0(Gs$5#A|$UPDAIaWkT`ionl>fd+>2>oP^rj zbp7;xL>*EpM2HZfx?8{yBSM5|Ra4zE2j#h2Qv-r#X+STl#yQ6q^hiaY`CeuBnVXya zPxuFdBkRgzZtD!Hh9Wgj&!%IC=f>A5{IQ$oP43c^0Yxb=dNMX+J=vnvTDX(azWVtv z_mCaC8l`=&Z0%U=F)gvfXU{u=gUL$_k) zh3~%GQCAPkmPKTTbV{*TlXwLw!5|f#d_*3e`GBzUb*=T>$o0gh`4(33{i!E2)vUK7 z^ONw%M;=G@(%Nq$yg29quu%;|GWg_0?6y9aJVCQyQwQ!KqzH|^0?ry4004s5pBMlD zeWJ2QoIja(p$vjRi}R-%y;uhFJ_|5o#=LtbJn`Rf-Yp_hpPCKHlTU5P>t&$7mh{ST ze+IB`Q4qsIyr7vs7*uU6E46ElJF=U-gJ9n<|Ua&?V z002I?GwCJwe9N{4pJ2Fa3GJ9P(nE)0 z!q45|6k}WBx9j8J%1RV{s&t4x$wuYC?sr}J#aePhFEI$dtA^Rfs%?#2lXp+aC(D+g z;nN14uK0HjdJFrXMvh@kS1xEjZNupewoSG?`g@qczIPkXf0~8%cpqA0D<# z@paF*=@l8;*w@3aDG%S^7yA@;H^~56?P&KoSU5C+rTTpYUQm8lcJsv)z&nPEBv40<7t z-}yO#t!jZ_=K1M$kSqP}z5a<{hn7|joJi-TM5K>mF!>m?^*I7j_J^d*OV~k<3B~BQ zWbze{g>0mp`|0yZkXe|{ZS#UQUi_er(=Qall@ZGdLv2VGNQ&xTAZMV9Db0nYsl+IQ zmh3I zE6T6h%&g%h*SJubApHGS;)l=^xvnMx z?LxmTQ5R@>3m7mA7-VRL@513dVYNVdfkBC1tNZ$u=0XI8d&$8J=?l%#`^Wbw^a;uYHZs?BMcF2eFyoor}`o{4*8$S`4g0#C_2 z?zlC0R)`--+T#WZl(rq%rGZvSi=lyhm(&MkPVotRj-$U2ohhJ`U?P>Ww2j-5?=J{$w@Bk?tfNaz8p$U2OB1vrm4q)Iw5@3v8uVolA>VzH8`# z0Rsk%Dr6MvhXdj=?328EBuL!yM8XM1Cmy(ktx@s=LhB~3{V!hVmA_MGBuJ1@A{#u{ zQ+wC{G2Y$I=F4RA@<)}DFpTrl=O$WSEBDn_ssaEraU?vXSd)$uskp|#C*ND#TYsSN z;j`ZX=l~0^O{*p-m3&1#FR?zoB&mE7P#uz@oLc{>P>e{F>R+a57TyPIO2APFiobIDwS=bsb}hmtDZ3LA;vWp zy!u&6F>(ryC#F@9tXS19OiVDLiI|{q#}DhfyTO%PuIV`D@a}s@@HUnm2wC zwQeUKwP_#1)82;EW!-Y2e*-RmCay*mwO3U-60k!CL>Au&*Wv&MMn68_;LJNJwgs>c zIflq|EU)8<2M^xJ3pI)oFYy+hsWXC`J@b>%PZvKdA~FD}^hVVZXR=g6BQSLu-)3EK z3P8PK6;s7iy|J=Z?(LAPACVljer4C}~nODf&vWHVf+7#?|ZDCp2=x z)&UD=c?k=^^#cH$vl9RSh&ZVg)p)>k!ch1}0nW)K?3pCd3k$0!Mtd8t9>{sH2z~U%L6Rj|k|h~3WJ!h$8E3<`6-u%s3%t&U-Kv6Yl(~5Wd-yc}wL(RNDP(u+ zp8mhi>Y?cik*MjRjR8Ui;+ovtPU`3{kgA{=@pQlkY$!&sO|~-tE9VU|N9gQ(Hb^XTz6Fe4 zH-;)WGh@gqDG3nk;U=Ny4c9yz5B9*Jc4J#gb^x?2ylsUKE{MCPn~fGfRcCa)lxw<; z2kF-mNq5l%002zi5b>qoP4&~jLYV-2w*cIm2#}|R7TA74d};WVo?j7Eub-kmGh%C0 z_SljMcaC3Ef?E5Br%7(yTk?v90OGIh(QYIHnasiveuQA5R%uMyKF$lu8C)t&hm~~NHZs^ro(<67^VwwOd3Ca=u1|1_FDN|@Mt7b_6;R61ve!r ztaq;nRKf`v+Tz0-Vrs6!-{i}0szglW`)wz3$2oD+>9{;ED(Zz}kel$E5S{1V^{h=> zXO-HlSoI;yU;HTGJxEA!=6%1M)&n@cCtp$%J}W%b@rFy%gFrhQfP1o%$}$*gm>f=h zOFFg2x9-aNX9sxTd&8U|b!>6mFMKEYp_G-UTMvEJvf-<@zPGCkGei1bp4*~l<0N|s z)RSk5p(?fE9`?r_0<+RrjKo2Zij77j3S}u5Gn##^0!LnBrS`aO;l;rM1dVH z7Tq((Zkb&@_QexQV5^uAM4Z@eCNkKEaxI4!Ft|S)k{vw5nf2ST`l7zVU|m+kZ0m`B zMu^(4VIIVUpG{W3I<;?thtcR%6CTzbPxBtG?oN)CuR1IGRoJSXpOwcMqMB;K?Hg9R z74QDh6X}9Iwm1v+ zfHDQ(EEm|g^{_{{kj8vb<+LJGHM8lkcVSh&H05dC-8@df&@b-rHQz556#c5^J^a>F z_FsPo-F>Q5eJ;LXmxkchKyHh1X zS%|lf32WyS#k{xKi~-^wThd*(R@Eo-UN*ad^g#_~7!%8fEX7WG6+p0S5{6|(W=}+v zW_ZGAYLE4!qnTJmUa@ZYD0O#H1INCohI7Eo22BrLscvAS-QO7*%|POo9b8)?;{9P` z>sVFC6YU3~^A=H#eo&po6pCF<9XJ6p0poH?4?iJ%1`V4EkSpP8`DqX{>D5B2U>8<- z!egW%r&Ll0O$iaD&a{j7FXsm6%6%En_Mq*Bag2&*PChA1Xq9xnV&`7KJh!__F8I>2 zAndkU%Q$uBc*16T;nD73fdL;e1R2SUW^xbY!y|B&VO1B%$+^0Nx3)a{M{%&>uei>! zq8a3WbU2>NY5GD|Jtb@17gZEW{`p*O+p=kM|Kxk=!P~W=Wqhz>8Pf2UvZ(BT!k+8O z^cf#~6rMd+dGThyDjU+z!dZC|Iz0$~819*JhIv|(0H4zXd%)RP-#1bMmRq{ zm72k6C_?t5E(7alb}!fKpJ2WoL*wFXw<{$`R*2Bz9qQva$_G%h6j3L%%zK z52f*>K0n7QJPRyP)_PqdQXCmb?K`ai6*8TijNv#@MQ}O9*|3AoQLHR;O#V+z=_A0A=HEuY_4R{x~JEH2Q}l;*FgnK>$KX-zPee8 zQ|M83ri91Ezy?y-7h~B53LL>e}{ubUx))Cl=fKFjS#E@yU! z9V{*A4MK26a0ldA{iG2pHUmYs8jm_ec@AERKgMc0Y+(%{$0r+>?&`d#1|w8N6xEAa z=J9rKBRisY0uF^7gnh%DAsK1rMRgo(=BbJ@GVzFcdA+TySuJw*(&wp-rs4&!_uK&6 zrH8oCUjGoQ>)Le!!ABe5g18*);W?hzzkIG`f-0eRsBO{&kW|Qy>d^j{SQe(|q(U_L zsr;Z>#_|Xln6xjZ=_tt4xF`4&hJr&#C(JB|it{7j~M42%!xVsd~J)Oz?2Xmv1rDInMY#W6eJ3tpR>PN40@?xrcGr_C>taP+O@=g(&|>oeOKdJ?+j9J;-bo?ojxwE7jD zhh4zbx4k<&bGi1Miw}J4WUh);2eoUbZgJ}*m9e=J*O!N8R>_ z!fW+X8kZvF)Lq*OyV?JDw?G$ zJ2bqf8-npaSXfcd_%X3ozb9D2@{^&{G2G!FhhQm(tbu{s4lQJ6!zhk9P)j`RLdH-w zvJ}DNE(lRBn&He&X$htrvcl3!E5-K&(MsDDk1mK^Z~%u2;H_UMlj_YZ4AqZh?gZBo z7RzFbeH3Mgo2@n$=ItmgVcNeGx&`K9kY^J#g>}@OwDAUPF(YLk?Q&W2X+0Z*xhT5X zW^vs)gFkNqHIocM6uPLM#4{*H?n~E7?p@|D-a~SgeJ(tz>1!T$uLx8YazZllwq)i5 z%l^5uPRUj_8uNLqVfxdc4idC*&c4WGNX2r)bh&QuI{j33?_Z;*4(8%zr@o|`9Ax?edU^sklI(bJZj7t^Vl19SD^`(+$*X~ zZ#X{`X1O?zNTxrx*6IG{sxJ#+f_U~D$P`jAqEdo$#wsutjBrp2AJ6qVlfq+&(Z;2B zbtTw3;7JXtp4+3~o*nS$7#H9iK^^WX*x^QO>vKfY@yLO*0#Eiq;H?c}Sr+DBwbB?j zs4oM$7N`JI=|@bK2{1=^Dbdq`3Ki~$uCq#YL#$+#G?McOCYJjk0kw314)(Y{MELr1 zpshIF{n`Rp@=%}W4SB$Vj&iY2zb?t}sDUhxb_NBM8R>JMNSR|=-PM#>yf6)0sv>61 zZwr?TI#0_3t3O9E2PAYLT^oo0d6j$O&V%Da1GFm)Gfn`eqASp8X>8_Y<8I!x+pVsg zj5Sf7%q6GKa1gE)85@_Z=r6JC5nRMog%oVSA#Z#rDn2(n+IRrBGhX2oFSqq^Q`iiy zlwajwNu7e$ene1bA-pei0n!&4=!3czpn6m`es)5+L}vsJ1U)~X(UMRYlt73M39`Hg z7D!KSd{#`rXENbY6VIy>Zt5@*q9-E<*$KWZ0QG#J z3WFPaHG;A9B?_#xj0*P;0iWnWTR@u*Eg1G>ctT_?R}7MiJ@iVqL{ToWcN@#D@-mE? zq@q^%s<0>ty&?XmXBaFBU_FD*0o#y5zfJceT^xhJJ&Uqs;5Kfj|fZiDtJV z&OL}2_O-|Z`h-ddpfM}+0vk`IKcK8Axub9>psL`&ek%#bsI>5L^>G@N|7%P((6$rIL*mF&xDx)j*t$-?0@I2zk5%Zh7A1W_PV+M9% zOHh^ml>?FdBPzg0x>G2bz^&fSFPvsb>L&WLQY8X)`V{&ZuMzpEQJv4@L(w=XoZT!< zj5%SvL_CznU%M4~l9{Rr)yN2a0-q+BO0uo2H=OT8$w{5*zyfWgOx!AmzpI8f$KtJ8 zDOMbFqbj+5!QIt~}RwMXE$kHl`Kwd$~$B&1V3CXRv zgdiVx$_wtJC?VX4M+}O4Jp!kN$BZJ4LEVM#*WLma)U+Pw%(zE~mJ3o@kR~UQ7_uPy zoL^j=7?#{fO$LwLI=#WprYl=7N|M7Igr_nR@g!`2fwq7{ubua`(~8Mu5M>mRLc?Ob zu#!Vt-O#k&1OQZFDs{1}k%$;Q{&5p(*khn2PPsN}$j>-$CPII%&(gXiFN_KJkaqp(J?63LW5cBKpOB4SOZ2fIxR2D6MaUP%Tou&COWg7${ z50Ab|9Dc!0hy)0+%{Pmcd7gr3Gaq7iMd%hjiEgWd02C$QpwX2}JOa-dd_WugtEL2{ zkX{Vawp!qbgh&(&1C+)nY_rBqUoDGYq3@;#>}eMc=g8hJbMlO3B;NDoimL-Hb9g18 zL{c}iy2j&yZv29|RE@?UQbYp82EE=&y7hLUWe7H%NVcJG`P&Oy)U%{4K9r!SIa8y0 zPCMEi=&wBobkpKjrq!xKpS;Stj*uRy3zlPtsJ&*5f$nEOM-WA3*1lb5xZd2B&=~$6 z7|$t!-$wA-`Pciii!z}>Fa-PWT#Xrjs57xXmtpnmR&GYqD9!%VDv|?G*M4y3p_o0^ zzg2T<8%iM*H!rfCi{=O-lgKq>gIKi;1DEIztWVxyX=$-4#P5xyu_Y-j&BrRFHvxd; zWR*kjdh=!Dv@@o3lNl9|$}ty~OQku%07$;WYTW2`xcb>~BXH%(%$l>cgT?u@@_s^V zeGah4x<4zHS^DtF^_p-zW|`wnJCpHDo!As)+X=GXActd{B~2*Lmh?-ETX}*E-P}EN zo61MBcK3*E8Lg#vOWWGBuLbDyXL~4-dbf_mc%F{3m^w<~re@w_)RblaVxcN7<2Nu5 zi+Q)nImnEpJjNo>1VqZjb{0=q#MbL~d*-XBZdz;ok}oHd9lbl3rDWMt5R@x~^lco@ z=XSJT0_N#aPxTcXDrH(bBl@dVH$hLZ&S;=8%M_iRy~ZJRlP+HSAlLDqs9*iKipMyh z3Y^=e^U8vEbu5hj+LdS@Apoy}Z{b+Z+;fp>`u0CF4{?qP!@g6-91T6(BQWvuWT0H@&bromI=n-|rtM z1_G}gN(+w@p^BiLTI>z?MiapW^_q2NVPUWkrz7|n% zB+(|IuT!)qAUsKwlW5+6xXzl>do(8uClj%?T(l#{A$E6jy59123YT9}b`AM#{+pHT zMY&_B4d>}Jz0DiGimJO0(A3~WYZL7F^g`w+F0!IBmHcKsPA*0)-_wgz1pm{u5+S;B zH?+k?1vrL2&Welj`Oxt*IWJnS)X9#Qs$7b1eHCft&AQtLO@nF}V+~jtWZS(9)4;bx z0-L!uh3F=^#p?)z>!(E0;i#Ekv&8rZ*p-$1NDY459AlibT%#{r&)TnYC;D+ZYi9ud z7Ii4b7C@-lS)=s{rVr=F;!|Zh4-ey0Pc80O1O|Y}81b_O+P@pu7}2c+eMSG2G?#fD zss{Fv9?hz-Chg7E-Zud%^a4Ii%>9=1z3MBugtRP$`cARV=q=P0Vl0vG370>$IT;`4 zA0K6kyw*8bRny7=8q9ba?SKR5=Fhk`oV0oEWDWWzQSI@Vlzz#^<(D*H0;Lh#wJo4? zHrS>hGQLkZy;dZW0=Lp#+XB6_hvgtc7aapzOWCzBYCGuWi)*ENbifCx##CBi9?sWb zLI2cJ?0ZdelDRjZa)z(@E_GRmwPg;gL-3U!ob*j(JC5^uzqp3q$Ns8E@RH>A`;b*OM}3_c`7*v2cY<4+Z+e1E@ z?hV8l(55+?DGCm}uuG=}ATfRX>I@cNe9{P%!eoGmRYvtM@v!XNLdaYVw&F77vj6;J zRqzD(A7nj_ynKo>B1RfMNkwYLJrcn6AWcK$iJ*<;mx~%Ax_kJRp$wJ}z)sXnvXRsyrCU2Snp!swAm?BJ(OohHo0xD`dj z`p#A8C(4j=b|bGayjrwM9;iml9x$7x^DQ})CDSt2!ETd53hb!igya=TDKQ+jwG@N{ zMM@6$zc44n0?xLZR-vLmmqMDzsDPV^ztHU_y>MZxB#h3E@L-}R6>6BPltltt;xlhI zQWi_B`u+q#W;W6zmo+b&tWh@y!~1DuYyw&=AHUh4F-2tT>#Y>24hTU!fJ?AVe3XEX z1i*OWF4l#!nAGXMkLDf5I_<-bKa#uwK7G{Kuojx;F&qu-`BPu?GB>p?@1ElF(x{9s zTwGXYLak?RN(G=&K9p@P=q5O6wLx#A@^?yVuq!g6U|NfpJtiL|34JK*QT- zYT>TI%~3`ASE2E?nBoY(d1&%t=G4UD6;8L9$Bn=^&!3JN=&z-PLCc$n} zSI@*q$`QW06;m_z5T%-npe*K)g+6uKZ9CXOI^=2ya-)t{-xT`1E5>)zopCPLl-P=0 z!+TzZ9>Pb{%F`HCa!hF~MDt|HjG}w|sj*FiM`RcQO{ky|T+!sGrK3vTBwuBW#LPhH zl$btE17}6xc0-szX%?U^T)v2e)TSf7M6{Qxa)*WAudS1!wh#R7mq1+&j@uX#PdGeK z3PETsfge?06F4&Hw@TmAbdcdBxcA8Zc$31tA!KmS6`gzsFGn9tFH~ozEefOP%#yYx zN?$VyO2%QqM#X}?@xKXgnTETEqEybs14s$U!9fk-%jDPF=}WSH65GEGuPYO^@-vi} z*&4Akcjkzgw^rpy6+^_0-KPk>FhOa)(&6juWR>9pS2`J-8YoEG4DuswWQ%$nd>ga6 zE!P%)GR5lBoE=X>@Vg|#+8xD>I{{R1STsBhmzWPzw^le{C+I26@K3vUMxgfx0dz$A zaKa)^qu4h%2FmV;VI4O5cvU)wNLTFk*H9H3WQEk+_gD zr4xcV#brd0G&;qw?K;`oH$g&iUAE1!GW!HB(6Vju?9f_)=r#3F;Igo4@h8Qj*Gl5o ztU^oTG#gx{1glk3`$2Eh|Ip|-jL4!s?JIZlygVoyyDwP znoR8sQC%wl#3l#Gf$1+-BjVE(+_}q95k2DlZOiXZ5u&CDM*S19z1rkR_-76wQ=3o- zs5$o4Gib0|ZgT522fY}eL=7~iQ>aBpv*_`%9)E7&(9%Id_f*?GmvbjbJoZtk11($R zJTy5HlXG(HoX8Vhzi2hSdiCM$Mucy4?H{5CZUW-j#x%8K^z7GT7(oR_T#5@vF;xGm zEqM8PjAqGb1-!O9KsKNomP1Tztg!ELV&OTc0UNhwQYwpy-laTRkWv)=>>m-hGsBA0 zJeYht-4KI9FN)f~JU*rnf5X%}v(5kJ&;4sYOC+?L8Z5>oqAfylzx`f%7&NR{8JBVd zx?ntW1Gytba)Gi6SmnfwC&Qhmd!Re%zA{F2J#sllmw1u9xXw-=V=zvL9zq)@34wZ; zLmrstP_XETZ?V!o#BQPrPfBTL-3uEGz@x%4D_Njy9?|y8%nl9ZizYg@)|ctRsbTdd zn1LFEejmr!TG6JTd0uwaWVBH>K`_!RW3>@Tnslp97u4ol?w+lax+K=sKwb7tj6{QL9=3Ml(Y!YF_K?nwqe5^$r3LrEM|Dkx@Y0JvMD zd34WE@c3$0QPd$XJ0s`u{Ef7=YHd8LFjE)>?PL$qZA}lAVC$B7DgW+rke_|vW<$^f z^7#@$G3$fE_GF60_)-a{s5Hzi*`#~I(%qs)F@5aZ!jC=BMEWjpR z-KKL>GXk3Q$QlFxgKcjJ@HoT!IS>YXSWnao%AjCC4mgc57yE?ILzCFKMP0OYCzUTA zU^b>^2cjAFC9wt%jf;C*GBc}tS99=*WOm&GxLJ-@owLojFJB6iaZzEh5W%l90G`FC zf>4VWcO%hyX6S_IRM0`R!z?3m5CVlMR!@%aUN4^`+X0}8H$!9j&la0emI5<4O*uEv zQ8|64$G$b?7sEdxvOmu>~Qz(Yw=uUybWm?1(CD(+L9L-w7?!M}fj5BOlxo3p~R zos>cjPzFIcVpy7zR~M z0Cdfqq%fM;{FGynsS&cN?WEE};4=pU!ym)J4-M$$(-X&mI73Z?1ykz@rt1R;l-1by z32kxm#9*_8Qc3eSdVx?&28y5ur+rFHM97C!QxuydYB@*G1s|T?1&n2W*HYDE}PVN zk}xVtYL;lAWHUt-#=6J;M zlv}sES_^h3C^CzF^nTlft@0(Tn*-I&h*OoT3RX_%I_O_PK>i36W)?QS#gUe(qFo-m zVh@mNw_#w|Nk5*4%hcQ(Hoj@02iREN*dqIJW5wZe-V-7tqF776-Sk>Z3EhnHTxSp~un~4^ zaMZo;pNU)EFG#gi0Pq0>7(*2v)od9^=@jeHV@tq&v0=||{20&_iYZZF}jEz->K@l50z&T_? zdvk00l;s_KNSmOBV_^HL<0jiJ0lq?0HCamvCCcot^SOQu|IFldeHLda>8_e4%b*}= zNbw()7Lfd6l7()Oe@*O+UxWVL?F7!l$TK7(5r%Z?&2L@_ou(t3wkPgu;J#+BJwfkr zH4?(B!I~mROe0a{W-lJ*8r_TKdwtfXp+?Lkd)AmQ9Ycg)pL_-jUToXtfAh<)s-)Eu zKmLv^A=utm4~P`8Ovk9LlT~a6i9<%LR4M4QOQkRvVIXyGy4|!joIL!< za0GaJZ@~5$KPxb6xRu@Z_o73F=iKtV!#1k6+1hF3(|+ArWw?x&|Na54vN-#5*Bnnu zg#Xb6Y^>rgWl}3^zLQny8}QOn=|&N0Z36Qinb>XD`kw1*)Dw+~48&H4MKhgYd`+NM zb3(#}FNaExfsx%@1A{|Rtf4vU-0siM1pKZ1~xtEaNmJRuL!c z%5Fy1X#^)<(mFs0$4e}*q^gK-cL!RHFm(nkYG3;W?8k?&x0p-Hb~r!K5HpI_Da&!Y4Zy#tn^r@s*kKD6T^S=0m#^J8n~hdy-ow%!*Hg`@E;9_c z*uKt-dM#`hd)WE<1vakz`R|5?*8F=E9y!`A5n@2OOy8KChB?M>euAffDJf`MtIp%< ztWOtTBBDPkHl4D4$##YuEMuB$PWt6!Q|f2n>2A5PV#dZ&-{(O%pQ}kvFsaRg<@pig zQy(oX#Cn#T=L+=wmue(O>*MLL8=rwj+$}IUMGhz*Pu*IB%VxLK>DQbD4C4UtKD~yO z-O;8S$%6VL;Z}z$3Q777$fS)rt&!uS3M6MME~)zX6iE}?crQp%gZ_b`P~8t79?{%IAB9fxPfZ4vndMen$ONhs_}$#gul31r-A}mb z%O8t&$)Pp$8y)6NoR0FF55V}l-_6pOzPki;TyqOIyF#8#eF+kbt#B~u7%KC7pfYS6yF4~^53Z3I5r*o80M4|<#!q~Rlio=>jp8=B2MD$EfW z-U)X0`tTJ)yYElFa=wITTZ?wmGb~75E!ZJJ7wOn zWg&ZP7Uv&8&T6FvR(YENzvoU@ZC8T^E||a57*(}|CC3PNOGXNVvuSi1Po;;65|#ZJ z`@5uxq}Wq`Pn=3=`NnyEzjfpu-Mw5`;dDOG^tecDOMZ&pLY7EGZQyuEpD|7`@}RGj zku$gdteB`wRJES*W7iv3(qYxlPMq|Ij%N1!e(XL~}aB-0R=GL5RWH}7r)#ZL~F^vYShhN&oR(D9i1^c2dXZ|uaDC=al4a#wLt zYwgH|eZtQ?s}{?H0l|d8h7)aar2$sO#DYvvD>l3OdgC)X!JgK zwV86OLa#?vquUy;=AyU}p>HEj);t?CfZJnm)^c?7HhIyQ#T9P6xKqfQsQ=O?I!qP9 z1>s$rnCxS-Y;4P|#P9~5j&6!tG}7Q%ym1gdo5Mq3@AYuulIh(QQ&>VN`S#Sy4uD<$ z{T*r4jsGUpF{*i|)|fPC;KFLYmyg3xdU(h-hE-_Z_~Kw<;d|qz6ukgs49Zpvy?DNT z68=;qIXNk`_gv?l?^qAoMboTLcmr_~8Lb`IT}1pm5NKg+aVF91EJ5fUwoQ>C#HB$|1?5 z>GkK2KLsEHc!Lpusfaw}Q*?4Omf(HA(o>)-+s>f#!hzbZ?X3pZL82g|Fh2lHyWY}= zmm?=t@6^?q$E#qWWhvRAIkhX*L`fZ8DJtjREDnkB zA;43B((PlY_?n-|q@bfn$#NR6Q;zy^`{1*Q04Kx6Lj(l{fQdHPK7U_1^8S8vED+i) z8_fop+x)WsM+@G`0nf-t$3OUS0azq=dShb%k3ES|T79-7wfDV%u#jebJVAg#)e2vS zv#sY;Nn6`f_WqHN`90(S>ds-m`^Y0Bd9b&eJxbM%idub^T3b~?}tMm28ay1at}4!q|J?9elkgexPs1zl`FOttb*btgJ2kCp2- zf)eBmeYvNT&I1xwE+g-$Ete?%G+{ zlkhMT&9CIm@K+A7-yVk%F-rg5U`TB$7~IqrwQEwZFO(72r1mM(IeZLhJTh}DuR^Mq z9Wif@Z)XVzXtNiLE2BR2q_#Du4f3YSBynDyy&(nt+FIS`wDVXYGSXrfeuvzU#;M4R z@~}Gtm(k~*RfdTRTUuT36`ovs!uE{a4O-->z85e~l_&&Wr{NC35GU`EB&IxlF(eMI z`qSJsXig_yTw4ciA$sCj_ZB_&g}%>V1DIpwd_m6627|R`>x^&gfbCHzrmRSzm~EPD zRtiRdsXH8f1!w$#fkkIBj4((c+sz=93cy$;7A47zoi%1CP-Y0Edt)*~yD z^ig;?McJ6uOQ3+qj3pK<#;6(1f^x+j4Fzp6LOG8O5G+sRK(bU&IjK9!DJSOx8-a-u zV$-!Gng+#Z1rjm6BNwL>;=s$T5=1=EWXl9_Ol1faY&Xym9UE%fRwFqAop#`Z#ovSu zJTK+bX+|+tSxzZwP^uA?<_}eEEBHX*pKw@>$r>vS*!Il zKxTN+Xzb6U99l0gQlYjg5+Wvs;UoA+ynP`D%tngY+VTt29fU9=AsWj!`GXUoplLXv zbY%e=f_D8!Cas&XPdSC8#*(w&=;>A~}~2I1rAcX-lM-Boc8py$#e7qXj3@PxL|V#Byr}wi)TUPU844mDsZ=9I!X`+L*ui2j zUu?@e-Qc@2GY;1~Fdx11RX%YRuCNxcwbuOhIy!D$=A3q)vw8;(RXQ!{LL)H!U6;I6 zw5;18I%blsvxrnJGTRK}&LDi8)<)i-oEpGa%U)}gQPEy?*1(PNanPS+l^6Kd!6UXw zr{09UefBsoE1yd~0&?=s=-{KAHV3b1A@E7wb6j5)W5kp=ySz>dR#uW@8}a8w&WCZo zTO&5!#%zwJ{snb83}dii?~v-}Hxjah)kd`Xr=}N#^}QZ&2I8GB<`^y~R&vULJw+oj zBkIfqAkUaCC(Hqya@qN-F?q}tXt*41%y{pggmCRFWDmoE4y|M7iXU*NsJ#aS0e#vr z^83*#^4%Sh!M%A$rrae)4%2?N`JTLsRC}B-jEA8qswwgDkgn9{{`)Kn6PuX5kzD09 z_~pG1>O>-97VfOMPPCQ-ZbzFP-+Jaf!O~*X0JdyJ*M*lT99roLFf|5s-df5U>km-E z?pmd`BrD;exto0PI>q4IM8&hvlWl}TG~xw&j@Mej8*5(KQ(`;JV*BHbr~G?VaoYe&&vH0t zIwa#zF)`sXH)1as-is;9$uVu&vPe*|2}9ym%lJtay;~CLf=~ywVgv_BzFv|mg$`Wg zQ^)c&-Uv6AWDb{YE%tI^;lnpdYR3{)kr%4n7Ectx?ZT8H_28-glZhcTZASxtK1AvZ z_C>6JH}HO^|E|iXxBB0NpNhe$r`sHhsM<4WYf35qIgeb^=bh;9LLIMC!qn~_^v4b) zO2>@WtX5i@vLQ@mL#8&&R4R zT;SO1h}AjMoYv4Q`F;G3MhMZ|C@LEK@isoL#JhY%6#;?sD$%%P)WG;l28YW*hEw)vNHzKN&M6BVlJDu zuXmA{w_}NyZ4Q0}I0}Wuup0vTYYP6e_&XPvj)BC%Zu-J~R8-L6S$~o3x{L}sU!fEL zrf~fnivXyCVi8CwAeewmM;Uf$$6V-jiD%Y^5jr$1z*VBqI!)>PTM7$(jl}Me^FUannBT4k*_qU(rOZ7nN=Vo$( z$u>i~s8LUs7j?e}VX9Bzos-CnaImB}jdArm$78a~iMxQQ0T4L}V{U5gxBK;6PRmYY z(SE>smo52EDif-!R@k3jnk}QeJHW>qSb{^twZUmHGa^$b+{dVzf#9dFaGy=_ca^JfZP?VFN$h*h8n zt#&h%)ihDsv~8WDjEBnUsz+}y4ZkmbC5KFn7gy=TnKo={&|h1&8=Y#md7%@1g;j@b z33=!#yYCyAlZP#Wn77qjt@pSd6@T1{w^cbia=bUEz0u~Zmw?p*kwOwi?-6@5I7ozRgXOW#Ir8!Qv;ftG8#c@tLdgRc1u)%4 zZ(WBK3+C{nrQ!Dq<}bAlg#`d#v^C#F4Ao-%piQDWoi1eqFFH(LU!F9lA8RolyJC~r zw0T~D?QXcqTKwqZA>u$3+H&TT#-#-Dnpx^@->T9OTvKGo1&R*HZXs=$?JuMmcB5WK zhbD@Pnv5KD?SF!OI36pV-(KFXKx@ZJx__fd%%=*KO5YC7J7-_W#>tme5!d$IPUkXs zB-BVlo9DY?VC$z&j5St0q?-*0b$)zz&Ee@jHfO~pZ>ULOsGB)dR8MrysK@2|@an@h zrF$)Jta!BoZ=YsgqZ-Tns!t7~$A)QNgOsr!zi6!aFN z902V`(kgs@J~j5X|5PjwD>tlh^DN47K*Q;Mnm)0rd6n0ll-g}P87uzVei1_Y`MH|~ zGV&c)CvN5%If{p7z7tEh?(HlP5DHEKe~tDN_ia|3o^(ZAr_1&@NFD7RE<|6%5#K|Q zvHMqT10L!rhy-o#=CNc$L$4VZwEEZMZ^5|R7uE4`-`l5aGjMI>3G7Hjm`{vGj2T=O zu3JH}&}Kymnf*y`iCESByas5kBM2elW9sLBTHj zPz{>Pn=BzhQ$`~tK#pCS%-SiD?QZ@(Hj*99=efR5 zy3iq70X$tgwb1$isg=-QqTu?+TGX@0Hcd9;EN`AV+~~Fg#;rXsYthxuluT~DHHkM{Que*VQWh;uEMeM9 z(jW`8}@?ggkhOWA?7({57&s=_zD!!S^Mk4&LcA0i~-$TxQ|$J%N+ z?Gvh%MHs`S2V^(bw+VG|5fGm*r)~x)&bguj` z@X<(!NM6$ec&-(z0$l}m%SM39Z97kYfo+01#=Sb6YyuD4YfyidA*2B1Ja{YAQlBdK z3Ho7J50x@)atI3uh#ew8KFYhYH(Q#t>(f1AF*0^qeMw3(EH~Jz)c%&tyb;vF4I=bF z`Wro}pHB8eZFo+Ao8kEd@x|3t6gZ38WQG%L_T^T~bmipsGyF-s+;M|-QdtXghiK1^ zAzg~)@#T{aijUp>i1?gc4eHfv>)YBoQN@?((p>0?cwywjdoKAE_k|a)7ML4X9@y(} zx{mc&$`ph796+HEv%eXZ7vetltv!{`HT%Khc#46C>K6J^%f6`F7h8w6;fXds$tF<$ z^|~v4@7e6)EJfNgD9@Ru3bHNL>>BWzvW5C_J`{@SbWt9WF2f9+Aa{hra^arj3~&wZ zij^c}dCpV+^es^*fE2hU3Ui2>02a8S8M}4eYZ&@)1GMSYWrVnKRl(2x zptYU82!@J$6S=FFU}CTJ=P=aC`aMK%KCm}0u64SHR<%d$GUMMdgz6!}*KKtbKw zHRyQt5Cb`|a$xrRV2dg}Xa0j9H7FK1Cz5k$ukIUtb8+h53={JM*ED)EsC_H$3e_SF zO~BqK+e8OUjWFXmgA)NR&-iUFJqNA?jCt1Z`R~p?^Imsy6{$!&coh$OZdPvL{Lk=l z!clg=2!6EE96HzCRu`(cj=Sc7kRD^C3wp!B`^s%lJ@s zm6fkPmY9s@**zk#Wyk(^BbvJ~R2#op;lOd!Rs+d`Oci>KP`4oG(bH}V>l0^0gF1k|LzA2;BH zORBhya4Tz(KE92hAbukPTqqcRaj^_5GG_-f2o_?xlKoi#N0AeOHq;&vH)g;hVd2rK z+2IoVAyhK8vO2Lwg+K-hrRoy+g$54kjAk=$E8Z0;g+kI&^}pN1%i75uD6FZjmfP-I?kPH56U#^3$aEfD&fVrK|A;}>XAj4XWp2|B{%^ZX#-69bO1Qp`ZgM z#4)YU4JEq98K}`M+gRXA9RN_Do$C9+lgwrXE1L|irGp-2kFmn=KmsVpqhK@k+UkYw zhtbN_$?XXTWH*OLq#@DDHz=hy98IW}l`#k;TbwUr6ojK}oaRY(ze8iNSXd!gTO3bo zHZ@sTZkJrubFOxgsA=-ftsCu=N0AirT7j`#o5l6p}RmrTea|s<7=8ZW7208DwK&BK5Yxy7znK{ICzVt=-~R!u$Vw z`DL2^=)+ahM)8S>jhmUBp{46$rqlw)@DBs4@+WORg-w8YeWK3wyz5|`3PH|N*u;coxvDTWU+JoRzx?SD3tD&rb+ z4fCR-117{bZ^-9Q1eJmZGpra|>}x8TOmmO1IX<>Nz6ff?=cAY?Fg$jJ-;5>f;p-O& zMg@l}R zFpM|(E8w4|We;J8rq5ypbDd>ov!l@S2tzDfAQ4(Q<%wViQOMosk7v0xZN~8On^n=? zdvtoJ#xf@h>t2qwg{}yUzQKZVuL5)Vb^?&pG!Wt1eV!{0HlE6A#JZg zLJGbP6xGz(_VhE#?VX>1`i}OK2`yKg9YUQhwPhNxXiIC0MlQL6y6hW~Zf7uEQni=P zH&@Vgte%sdm)$EY&Vj#e7yPI8VwYL}*)JXmWwV{8c> zi%6;60^5HcAKaFScv^6=BL*aLX+MdKk7vNe42 z9K=jg4iq)B6{Yr4lxGYkInl%Oyrnuc*Ty(Kwv=v|uP~fRfw6*WMoLaopA>8DZ2OQ% zR7z?_9c4(AIt4{Y#zxKm$x2l~ib^T@;tY@seCnod8Ex*$e|h?aBP8=BCJSA{lPlI6 zzq>pcv51Kaid9Y~frld3RJ>r0?&V|@xSu(HF@qd!4pHCR$q>xYL9fYNr=3qyPF6s# zLy`ML^MAfii%McYPf~8gJa_Rh1IGnV#S=&ZaY#sI^x29>==3NSmOjnPnu-el(f5HR zn$8SRSV=y!FR_o>GdoUlf!)N|I(If%z}(-PN;@T0Tz)y|y+-sg8k2viTAFBAy< z%z7=iJ^nj5CC1sfP;~_uD|_uEx!g^2y5w$rSSy2N%ue z6JmTu{}4*$utQc(l?={cS!7KK@0;Kt?)db~?}0@}MZ~243$EwW^70P|hKSS}PY;tp z64a6u(fbL}u zH?QVqcN^hQ(2;*B0GSKff2SG>dbjIWpC`w8TcV8cNrZftkobuys?&Nh(t?hN%Ea$N z=AFm>H`NxtWR^Y4O7Js;HOwrtJ3Lf+`3FU!r3<8|i`*kqa5%ZmXS>xFe<^~eP9ZL7 zi@DFP6330h0)cZ0v7scVCx;c>IvG18$S+f17Iir5e<3|j+qpV< z!$dPhM)RG5;!zXXjYj2O)aDfy>)7oF3?3OP#q|vfm-DTTr7IG949!ckfBd)`eH&o2 z1$~2BI_I%c?UbsyjkW&4kTgPul9}Zxr`FA(2cU>LV8DL_;Qqk>7Sg6KmTU#^U0^6c z&C1gh~HVa84O-ySRCh;B#wkmpr=3lA3gU!X*ALHVE1 zrjt<&N2JCTB}JuBtM&*87q?H8nJrsjSpU|T{{S*)>Hn_8_~JhcaGxFx7hgak&0f#j zVvGDwq>zP=0&i+NdY}e=k3CUoJ6>3#SE1(GD85eX0l7Kfhx zl2LRfZgy`7Gl?txpmH&u%A5`F3p%zhdO4Qn#^)WW3JN&qT-_YDF z8c~r_1(_PGjt>ziDf!&bva*U?nZF@yg<0Q9toGX6>pFfAindZ5Zhrcfsl4#AcVD@3 z(GE=vFBNMtu_|;~=?Ua%_1A-%_CS7><6*6(ZO-Q}$)W=7H5G;$Xdim}Yd=ps$B?o{ zKbB>-F5!zbrYrE}6aWJV5+X%LFBUxpN(nVj`X3Va_(555=sV^+j;dRfvGL5*(3J9j zst!maBdD(osiV0)?ZfHq^Mmw1{YbkYVUgc27}|(#sQ(Fa``XUgRd)iRD;1~y4U!#+ z@GwYtBe1=AC?~9a{HAg5wz957aFOdI*<=LPWTL8`lGFcd>?`1^YMO^HDG1UfAt@yt z(kb03T}pSCB9}%Qq`OOz?oMfGq!H=vQs6s;kMg|l`~Q7=@7*&qyJyeF?C$K$*}Da` zgSKYdN^6#p!b|zvPWiJhSdY?h^VM>IV~z>N>nmmj<`B_*Exq?%p|Q62vW*+-QN7uu zf5Y_cAW*r#hiD`0(G8z$cv~qpPuA2AcROiI)_&rdu^f+*8p_d)53-n~Go?q${%VnG zp4qn!g137c&O*tQS65s0o#&$=O20#xjGh7FCanZ)tzt=V|CgPw{hPyP0PMAX7 zW}oc=RrGtRI-!2Ku#0iM$m?vct6iKm<1%%uV`t1^Pk83~n2}anu*7)fq9IW0cth(b zYD5k9aZI`G66R3A0xsL6g_DF+MlZGg377H?(DmhlYvR=vYD2c&HfYbsZl+~r*@Oyu+x)aav6Xj+L9H;5W_m9J}rXNu9d^c<_R`vQ+I$3D61aucQCpCRxTpoy(O ze?vD@^uWBS=^byHnHPrt+oDAjTC@mqJc-yuCKw_3pgg6V=!A~?vb9wwM242dxYD9- zbKFg9`+oTTtls+Fp!s^VxkCaGKT;YdYEHvGaRBCy(#Cq|Z)eV~veX%RHNLk=`kR1enT!MLc#WwdsV*4rTw5dP=`<_IlVb#e^le$jzGV1|x|Y-$-rREfV<2H*%@a zXk35=(CDJ{KkdJkPXt^$%=1zya8$B-O#&NdtN_hJ%0;k?WnD$S^9Ltqas_V;4{;QzBQPR5rZ|GMuEfcgME| zK40>DF8jGMEdvEdD#z0aDTYNa6ElE?%op3!i;QIyQ%>-^7*@hGcLNqiKxS2D*{8bnlKh(Niq8#cd$IlKCtR0Iy*gw&YCN9S zAqhHgC|Z!T%hMT)wH35|xqXAQRjPzWGDK9>UU}TO!@-XwfmEeY#VGOh!u!hWetEW# z*px%(MMtS9y;L3_85_kj=FScUwAk(gD~W~;s*~YnyjQimmp-a4zlh}%{M1fgGWZtr z;20%`MNT(^crlZF8Li`|vU8f{*jrvT{#>~{w!0E3a?t8 ztU33+*a;O0S#$8D;`XZgHfMK1dt`Xp&M|Gy z4@9SAGXg{(QZ;kigMEaDfo)l6A57I;gbkD(f}?>XJ6?0jCW@XQ`_Ow1)ctJCA~aep z-*}rSMR@j=wjYOwZ3vJ7t{u@QU&!k#81>f_DAHt`j7knldFG$qy1F*EkRrRN zm*&YbDmLLP!utD;Cd204v*=6UpZdAWr;}j-&B+V`Qb_UFFX#>YaQqCOuf}4meM^PO zIzmw*(z9%{;^Qi^FR?7Umhr)}No&_jQ@|bP2OZJqSIFfK=(6KOz{f!ebRHybP@+Kl z>Y8|c%sGYj7RuCL#E4WHVJWjeL=1X;o>)YQK}zejqSCiJKf!I6qe5cR$LDM*gpHbQ zZFSQyw<+KGV6^FQCFTFiVW#Hi=M(cc-M<%(c>lq@gh2doRJivkAi;m(DEHFYy z!TVo$6E$B60&b^>t}O~DT4tvZ;Up@V4m7?a?7etRKnDLf)5GV&_k!i_l@8*rW*sG^y~m$LkdX z2#T23U7h6Kmf#`jT}+(oBsvr%sInse_VRW?viE9nB>w5mk*C0^r)2O%w>QJ3sUzPd zb9edwXq@{ufCQgz<$1#2Cql%0zE1%0=i>Z}4gM)A_@8RIyXSWuP@>FVDg%21gL_G7)lY2OYcSo5TPC6uzLL;2zdSYksuSVg8-K8<1QgV2$qA;#Ana(sR zU8eP8yB?4{ZtklLWHXsR9pyhD zK@yUCMfw*4mIUdZpPRXO+O&A5?4rMXC(nV#L9%Ac&P*`7xo++sHVtg%-%7RUuQw?- zwq4|oS?(_-LPxz`x|7r0Xmv$Bz4z^hw>pX8%d@k`LHtrF4a^t5aDu-$kp=fuRJ4#8 z%1y`fxPW}`12Yg*nl%}&8BY@i=9lXdmDQDS9;mvYf~4M*p8#3=RZTeJXVU+FxBK5k zV7Wt@j(R4wA|Hbs0fiDCgPxaof+Y|_PI4_(O5LhPLQ8HL#UaPUsD|+Z^s8n9I9T{) zL?-aMMg;kh)TBM>O{Zf)4VNEe%y=JoW0(lf{yYIp#)#f6;l`hiq;le(ym=CBpcb9v zOcEy%^U~Y=$}D5)Vd1Czen{!v?**SPOl7!hzYi^o^+~ zM9^kTC>W*3N)d~p_Alzp*t@*yYk=l@?T(G#M|;W zLH%2e+5~sYhx}6lI{kMnc`pI59~npt8YBh~`3ugEMaS{5e4ag#D2iAwaY!Gluws@stwBL&;gN{v z{;Eyy-n;NHO0P{QGACKgNGT32;YY!KR?@!Fg?$=d8tuQH*Ff~h;ac>vJ)W^YpxGeN zD6g%%m}n*#mf8GNY356s}7OMiwzDNBW_C=d@@ytdnMC}#+Ejw^KQ-;Zbg zg0;XfOF(#r-Kk?u{B*}#uLQ3Zre*Er@Ja61+Gl4NUvgi)_>l?2 z(=ZS=+Tsn37@?u*F3HJTyWS91KK>i>72-17i^*!!|F@Mtf5<@G<3q!m!+J}kj8T?0T73#tQDxrcE^N|UR z_M`%Di&ADu;jNcSxAQ7|L^x#8#uu#qLmC8cPsxtm|DmHM6_XlYriRLqhX-ZxmbLCN z4S*DVtvngPhbN6W+*N`7wa=)(jMc;R%;LGXn-O_;n&EdAFy$en?{h!P21Y(Nh-For zbhtqwyLMdx!N3=24|?8bMkr8wjh1f8SO#!oe)<^9+1`#NAwQK)GXzPOkiygMaerUpgYOQ! z!Oh7(pr1C#+PU7%Q-M` z4=^if!e{F@lP4>jlwvf;w=tF1`*91#*XFoiw6JG&ebTn5cN28WvTV}`tdoos4SgM~ zA|VzjP$9PMOHCP9q9m`u@`S7J=fM8thW}bg!z^rvZ(ul%pOmYVs8#a#dEZpDiP01@ z{`4MsqV?=n1n@7S0<$0Hg%qTtx!beqnm9%|`rdGs#XT{G4eKp+_G66+Cgm)An6jjk z8tIAf{@I5oD(JDAv7q>jfvn~}Jv+t~@?O$fmkbxymEkXN&sq8_QbSefp@n_o_|<4y zI9pVw8?r9lV0REcFFlV46BXP3Wy9j55x<4mAv->U7}y3Uk;6l( z-pkPmx#Jl_6eKphrE9KYqWp&MMyHYBx8jFo%^i(LEr>CA_=-$b#CbsspJqi&j6|9E zL(!0-vOcnH>7q%2=TXl$%984j#*$IC74;=alKK8KHTlOQ@8lmKy%@!x@%XVOQ#YK{ zv)N)9GYY6uIt`l z3gZdO>v%Swuc|$K?YzD|dc>3CX2BkB=^EC|WZBjy!Zv0xEe)8v@`_~%AS~ophvqed zstLY&?Q^EQY64hJkFySiObU#O7FTk3aU{K`53#vfBw9V^QqTWe68(3-1I<%s)`vic z<@+@{vwQ=_=RsDx_L79CmIiCx=WQlU91jZ;psMvRi3UI}sOdD_+CdQXK#$`>ix6AV z7knvEaNJ2UPUCJYEnw~{tT8B2k!NmH6Y#Ad*Ho6^Nj?X)EqDKW#~QmD1PAdWEoC!k zLTiGVq-?{3ZF%Hn7dcvb?b>lpm6#JHhWy*oZ*YuXP0L+zY?-yL*f*3WJOM0y!7QdU zdYbVJ)u2)N)tY(Dj_QNuz~(0l&`D4B1j860M8x#Fhj_5wc3sOnf4hMR%N+o>R?l;^ zK_y1Y|Kf=og`c|(sbm$i?gWfON-5Y?#!Kzx_3J@EG$kE%Qx*fI6up*Y8~BIXaA@RB zaPOt^>@5a&CUD~&OjY@pvRZ#;+s8fD8&o?oVve2JGeqR*_sA8P)$B-E>6Il66rh=G zzzGq08cmCk6~>{O7xpYl#f(z7e$MyXv~n4<@I7ni=d{7izL2H6aQcu@9fz+8C{BHJ-)E|IDW!33>~G?)@SegY z1ZqUn_!u}1RMcnGkk_av<>8r@Y3I1(A)1;$Pf&Sbm0~xC7A_m9rxq~XPEDy+&Z^Hs zpRrUvUYr?t2?vFXn`hGr*z4)X#>TdBw+QN9=k(JNtJE``vr={CG#hhz4?}$gaWY4$ zalanLKX~TTql<<%;9PF4-(4!M(3`R}Jww2F2>0kDw2F3+f)H*Aqwy$9K)LvjTelb~I|i zGU26mXspavHgXF^27P4WAJF2wF^ebZ--O|j$(lXH94pj&U7Q!drBN+$-Oo4j?)7u6 z**$xT*|q+Ht(KIUPYoYaZ5|V*Ywh@MjybO6FQ?8hbI%tyQhd!YbGe>Ks%yA&0vg6h zuiN$LC}rd7XtA1Or-m3aWz4m8ExWQ=_pygP1}8>hATOK46Q;rg6U1YD3d-9;hG#BD zYT!CQ0O_0~LxZoD%%B^#2|*2?kl%XnqMSam%wNlPFdEZSGu%p+c6D3^q$;CQc^Mf0 zn>pX7dSQ8rV4^Sq0t`80)zp$-26~vt#qY7f4PmZJM^oeFy;9gHmY4(sNvJnJSca0ak4D|rm<7%XN>L!wXQ~nj81{eJUYW#2x_sN ze5cq~8!`Pb{lKaZV-??GFp3KXQ#zN+?3zQk9=#7va9mcqomyf}h485;L!TH~)isil zb^C9&lBpCFQO4QU1mNN#FU0H9jyF_0Xb$mgsF6-8F7?uS_4xwZa)AfFBw}5k;e)J46xGvTm+RFFAj^3|D=4<2hr6o`1^(ah2^t<} z`86}mUa7-)@DriH{eu2S&>HIF2|ZlyI*{lyLeKa%!2ZlLgbx9gTB-^@7S*TSgVtn| zIi0@O7MV(DTPK1)T-23a>{2*Ullt#L<{oS>3>CKeW6Mn+7@#1TAOw}eqXX>()WWe_UR$$;``^5lS4A*4@om2BRa zg;uqOaW<D?5CsI6-$y8zG?MTS-zzr=yt+#X z1)5j-ObGQ}s0?-VwGHu86VhB>nkJ)+3CATsIjH1bCs*1NX!d6GF);L|Hel?rb@;)* zX?mLLOe_`)A|+$W8fxAvJoxf=!rxE%|3Yynxdk({`>hn$9{od|?@9Q#rU3|R(!#P) zT+oBq9Qjt+y36prLJnY|;Ym@=2 zl9q@};8@;FvhY8zQuCbflsiUNX%lUKz?O#;ldx=QB*~H$sEbZ!n?b? zySr;41F`|Ndf zQUT3C$);#n%y_|M(AMHJ(iQ9IF_7=)-;$(za)yJAakKWw`IkP=N4;gV*-P^l+o!!q z3SRyGv;H0Nd>V;RfDg8)Iyr5G*wgMvS{?DY{17{t2^b|U(k<5<@q$Uw71pS1nbJ$T zxQg@-hd_Q+&CxJnd=l!;URk&Kp^Gfa~?YuY^&J_P^M1lPb6-#Q1;Kbk1< zh;taZ-?K4;UP?>81C|^@wzan4+0U&)`|&L(6rR;fletLl#&j+(8jGte`-6DLR2|Q*AC1 zUPL5hR217RyPzv*o3m{@UQz2VquRGUZ?i$`JYvso@+p@+7jO7U#6YjKuB`6sS3?Nq z&Oj8kvT9Wrv-h;G#c!k;gC#BEeB;}v+Xa^`3m{nVaPH)Fj+kT{3>Py#`p~P7K5et& z41+)j>*ogt=d!l@03WfH;lF+Ty&A>qn26k(d*K@MXjzvwn7>Eqdrl5}%@;FRnCSE3vS8#)>IQ5G{&WIMUkZ;g6@f z^Ya35D2oz5FPASNNmz010wfmlN=bP;L-F z`JarcSu#^(UkOQu^jnDrE}U1?XMX;t=iViu<@;|XE@3R4TSsS1mn?%(k6im@BjT!(2kuS^&cHkYLDaGwNi6c*tUuI zuUq~akVKLC;_8>A*g8vcS@pu{BWA6?7RTV< z>XjztLnhF-S4(23*>ByJ-NJQEh5E^F2TlW>hgJW!L;Q8y{{(+OX_b}W;`hJ>C?fsT%?irL?t4hh zu5R@U|4IoA*09rmbw?aH$}3K0scHSK^8Q!c{|ilh8%6eh*Io&Y?yWi@!1cTqme++p_* zH?*~TAz9S?gWjd5)Uh=KE9{AhmAF6j-A$2F&Cq8jRCp!n3VI+{pn19YObr39m|rqn zs2CO}v)?v^44Ad_1r3&57e`$iA1M!YJHnQKq&}X0R|e&06l}`2Fy{DWR4H`mL-fdJ zJNE>umDYYje4gZ*Sr)w2h)0gCCThOOYe6(34zF`<;(6n{8<78=jfoY*Z5Rmz+XMfUjzY8O@3?k1 z$f6r?y5Ow?zmnL9$wbMxZ}#{d`uobSy!sowyS5R*fFX?!4F03N{*DKITj{AMkGHV? zrvDFkU{&$2VvMGeIuZ~3iF#a%_d1BN1LwE5-7yo3!>259!;pVX{MY>X`>S7M0SwZ> z7Z1^KpX5(kzoGm6!@T*H&hIjt_bo9X1-&+-L_Wqb=7NVW8AcUF*qE#`=3(-@^9s?_#X;6H3%2$xK*-PH~gtF(B$dNVGW`_i|uoX zAJRe|@PNqh9kj1!?d%T@i`j;{DE+HH{4DxcUk6Z&0m8dM?mBypB>!@MS_Z7)2t)vf z{%K31h%1NgzlQYN^8NOAW3l=#qlJH?AP|o6;!^AUE(!$k1K2Oy|46kccQH^vDE!yp zO@h~R8ZZ|D1Qg&EJirHjza97v0E7PYx?OIFePS|kK_X&)K{PQmFwjOotgio=xh4Xs zznDRJRCQ*CDO{}(+_n&=v@$ijgW(~oab0oqz%(*2P4(6js~SdKY8nERJy&V}-Z^ zchR@iqVKpLY*_$jpn<@58CZ?Z+3JSUoiuX?>2j{wGibd8dZ950lpO=C&mY5r#kH*B zfvB;FkNqHkC&$*Ul*YdPYJ>e}dqsESVWroxzpqb;mHqtvjZH`2 zabD#q=M5tcW_}H`$?i()TCzE~i@HBd0c7d_(-lGdJsN?gu>~+s52(7{h{MIo z?lNH4Ym#tHK+w^FuBCz|-jt12AbJ!2a++8;_Q7Byqb8W~gBy~KFG3YaH>6{Fwbh$v z9u1lv8XjHOTPXXG=X?}coH!3P%;_1fu&cZwJd^s4-+?2_`|N_W`6WL{!=Lod{yWe- zV&i)KA~1_SE}O~ZCzl@i$gV$@F3Rr1ZwHhC>6G0!rpLn)<1YM3>~ z_j=MVGKnIn-Up|UdfpmN+dU8QJ;Pej-gl@^d7GPz&z`wHsr!=bdd$@S(Yck2M6(X3 zQiv&vE=sruQ$bC6D`O((cqwNt<$PSKPcKEzuM+_S+69a|1R{F&+J&@GCA(Xsa&=w&6OL`fG<2J4h<&dws6to{c1#;@VJ8`jU#6f%4Hs*-=WK3(fvJbwXnj{+DdE zu+VXq4qR*fVh=p|;fSCiKwx{z{c!hg%d(&${@zudBY$7Ssb87HPxI%l(EVTbNC#^ z@0ENcvGNIBkH9{GXZwK4YKL~@hn_H}<6CV8a*OnPEq2NSKv_5KTqj41iR{85%kmKW;UwZMLb zy#KLZflgXrO{%q{t;tq_j{3_?koPcAX$ei~WPCw$1M?4#Ug{hOp)_oUGLFjSh}pM^ zjg|a-F9n7DD=6I6A==p{Bu0U&uC!Zg#5i_%tWWlmTt=m&E1W5ywZlR)zCu1!tG?95I9VW=k!~LAZV(q zWYunGPi;q%Q)i?DZwEW?nvU`eDSj;oi5a)}R59FN`zZlBn?aqa;sKY*T-rM*z1I(D z_**q+y)|)b!v`(5y8u&TMZ+c+GdvPRzkI5;o$HmXWhX4tjQy}QoBSTaCh=$8x-bDF zJ#pi-cHy-4Dly?5Y*ABG!1M^8a5X4=V`T-dpU{{!*g5K{pR@W| z6zUeSt(ZdplW9a{!E7hNZA!&$g<=ok9l;9Qf#12`<$?A1m5w_BdyfurorXnCeT8R| zQb{SSZ8M-YeC>F2xx(M}O;v5e8D22f4r?EQ;AX4B&HgW^@%r`cox$-ZX1j?;g2*)Q z3j#t*j%IRoRKK?W{ie~)8q!3xYvQo5Z&)YcABpup8uK0amZa-^*{Iu54nFNBDkgXN zC>@A60Zj4NZXn%Ze#>>;1p+jTpRECV`eK73e0x|_NAEca1jwtGfv0+y9`E6xRQ6%xF*IO^L zmqAT{TmXs{!LxeB;6nR*7LM7bSV#uKuifnykmDaz8+KfR@G-FhVPt=hd0+qtY^k7BP}89TV6kg;5RtO*r{)%)P{y`-h<+=$&z7ac+7;vAU(Z^rpW+kCAZ95){f8ZE|c(N>F+Xd zdtunvbANE)e}#HQdMWzL&o%N&{!;YJYDkqM^~I;s31mbZj5MLtYT+f=N?l+X1%?8T zNoDt{!Gg$Dwz+?Rbgws3!N%Tf#d{)rZ#ub6KO%4R!LTvXHKJ=)E=mbp)=9Ao-IGGq z#|1zTFGwQcGP66Oo%C-$tgH@cOrR+Ej?8j5)Z&pcKtbOk6lJ1%H0Lx~g*KLxn7jd=Yqjr9c>( z-Y9z6S1wxPg#87C-3ITI$c*ue2JS??bzk*am62*Zi`%D*NnZ0L^5CPu3Ck%Wbw&M* z?Rdw867xQhgd}zH3#;IU-WTb#_Mob-B@no8T!Q;Gc_Fk^FG26e$(x4C(R{5fco!BbP89|9Q|JIE=8 zD`g`ijU;sb&J`ZJh1u|9Lz1%*%!&!+14Wf1yet`F{!D_>rNcu=mhHoc9=FhP?WbCl z!;*aH4vQbhyS-4Lj#~LKtQE95l)e23S8D2Byw<{*Ufcg{!6Dtvrk?UR$sj*Ipv2%< zQ}P+OU&KGayk1kOI1;IrlFGfGs!G9!KQIznR)|>m`<|>O45LqrnX?HF??7NnC0>J< zzwvNeeTsGRYa-K+kB8k_Cy z6{R1Dc#kop<9Q9vM?=YayTd`!4aWYF0AeC|*k_o03K4OrDG9M` z`=@4Uk4S|v6+|1F;4I|QDSNz&c z@43=fLyg7RLj;Y&%{E@;_h+CxuYV2Elg+}%jPQ=Dpkl_#MMFn+_}p47bXoC>x8dP# zaXI(T3D9hwuBIIke{FALZxi8)nB?1ZYN1V-l!?a|uP-{%)l2_iArg!kIo z!@R5HsnJ;ZIWH?wqyI$%>W#SH0GXAhl?KHte*eRkOr`8|r@2eCnk)%=hR}hZgY}Jb z^{IuD&0C@_HU2uS3=mfzNb%CP(hCxx2}_5EpIK9MS_Xh@_Ya3qIE|^h$(M_w#!LFxzaJ<$c-tsb7CiCP3 zxmo|JNQMMCEfykuIIq&zTzB4O3)Hv!v;H;K-LG-LG1o z2$tLxp_7vGo|hPLNifFBic~z;!RmeV7%!^bEXhQQsQP8+PaOs!O8d6;iVaj$w8?kk zwL1_?`#k}2k8oOwB|%!<6vBIArHSapH6=3=xJCIP$aa1RgFjXD*hdnY*&0&pgv_yv z;9iQEhHt1UJHkBD;jKnh*dC?dtTpU&EBV1GE*(%ollt}PSf=>yk(HNT=aSLm5zS~+5ihL1S7)8Qc>=saeE$Wl0Qh~_8Gw_oq5zO6MTy~bf`0k!e;R3gBXDTI_%F!OtU zviZVV%ROpC%h&vcM?Gz~p)2edRso;sQB7M%Dj+x``S>;t*r zu*cg1qrfz`3I>dCE#kADSc%j#ZTWB>ZhgEdvK9`N2F5`oQrh7}!IlvZsnH?uMinv5 zUW`}tz15cCsYUGy=f+8TA;*(ups?l2T(u_d0e&evI_tq|fUgw+H}NEhyjk{qq`cI} z5GlwIj6>ENKU{7onlx+Mt`C!*7&(_+5nn^-m(o2}XGA3tn)10MlEt=ulwqliJ?a9y zB=bE-^FcV0n%6tc5==Z=U8>zNlFwRpGKv8q#v`bU%q)UdZEBe?#^&{UY1r(go=5es zNndYLxcmEr5KikAs~)(g)^(T&J{=6{Q*Y!@TO_mWS#_+?rL!%JX6B~#EPX4^3{5o^ zq5VdM4sWW4&SFsxQHTzvSSm(o`htXWx@xx-UoH)vCb+A47PEz0oCN-&y;!TBk;Jrq z@H^kUuEw+aJ~E^Ps2Cb%0n_rS@Y7H`kGv)3`bc$0#Lc?8dfpeG4w#L6=PIoTbB0Jo zT|zAl-~U3Hb@IX>ee`S*IT}2#Wf)g5XG-5!{0$OstDF?W*&uiK)w8$9=DsOhMQT%r7j@s2p%y7%M>La#sOWyc!URL*W}o&6$`VTvF=byF*?^#gH!S&#sdRv+yWV^)QUqm()2N5nPunW zFIE>HjW+dRIj4&crvoXsCOtdzYSzNJwrf_>G@h6X>JwEPlZ0@#i8E2;wH4vh`w!{H zDiGJVyi1mDd1R<@K+BG!Ez_&_2E)Jy$v28C!-5MOU!(O%`VGUr_6rQT80Fpsoh*(_ zu2=k0P|?H*q^QfR!cyFWpp=8BItR3K0xgSIJEiC_^5IxRBAjB_gD3=yVNZrcVSQLj zj5zUjlR07?QB~|KSN$er#;URM z;=^XyG;A$x@euWukK`3)d^irr1LT9`x8H}N%;GfDSQuFkT7nzbT3K8n_z+#XVw0Xg zW1;*Y4ugFqVpPOl_X!<=I*u6j!;*w=jWiKTKwH0z<#MnP^@pj+2`+X{j@qi4>Nk{; z)a4={hv!ng2EB#gV(=wP+$A1gocDjXVCQWbYYmFjYy|g2Qkxm&k@#wV5-<2H<43Ja+FT56NzjewDozZGA0L0?f`(o{-9e^}q-0+$oi;a?d{?*_h%=VIbu|)eho=*FiU^re?xLvLXI>(8KcdJW zO&Okeo8=ZIyJQ+H!P{J~?P|49Z?xC2bVVRzag{KC%-zeUTB6Bqp%f#LzSf|tle(9< z+=Cq`$P+WcS1}hdXUxc#%<4`F#TEUL9OQ!|6ZS#<$ito;dtW_lcM5|E#uMJtLp2)$ zlu0i3=wb0l1|@Yo(cOp5Dd;IpB@Q~)D;#i3B${^%bd~_TOd$q}a#c?A3a2w*NwUV-=oUuP-9ymFD%^<=m3DW`xd)eekFOYDDk5YEe zkYh6EE&S5nj0sNeSq*ELjUHRhGmQtuqB$SJ%Y+B7xVmwN#8cn!p1Z5zT~4l%1YT-g zI0}r(>X8TIMi)M8=#YGHuJttzWDASP|2sRFHNcvVXdpub(8-EJ0J*Fi*=Y3V zs5Rqrtr%4`^nH(Gp_!YtWe&~qeDW=tGVveUsoGD z%Vih_HJjX{UeJ|4mAo324%~k}IUl$xge&Ibf~K#{m~sPsY00&~r}%Lxh_|Jms}=eHrRvn3Km$1|sIT(RGQC)`_KMg;C^Z1Wx1k-@k1B_C5l4{LWhtbBf&)8(MHzj!=~8+p$uvQ zvxAU=rdgs!p7Dbbf;U1!R&&6G80%pDJagjvfAn@+JSOL4ks@Kd%YbZ&6H-P(!3GZ`iYnI9ip~qu!0OPzy2UqMhcAMtt?ZmtbcUQDw+`JR%Kw@~QbY-7 zx0OKNF9-8>Z$YqBgz#-#2VVpJU(leB@!YfXxI4Y;{RAlZOMOZCsji5o1A|ZJL zAv1x&MoK~>3uQwssv?OgH5C(THU*aj#T7>eCvz)E@i`x>uDns+2Q$KC&atXbc*Rqw zSnXK=!^-q1?_u`9nYjq>nwX)fOqMvG2!*AjQpeTA{!}KS^i(%?b%md44p_sAsY~Fy z)az%Vrc%{d8^+-~F#ple#%sV<2VbkDTONw3Q;JhSt(<9vyzwPA8||t!Ky!X1J&J!Y zKI2pxC2y^uUe)X|>{;jZ$wY{eR6Y#@srs@#w2GqYF@+Of0&7Zwjmp-f+0S|~FO#9fr&{g{`cQl%P; zmQ_(4FL{3e;hjdT&#j^g3x2g^-g^8V`YxYMM+$$se{7fLgi2xkWa3C3|LTvZ=L!g+nN4IZ&IF2)|3Vs@7 zPzfWdsF7E^v{xZ5)C8>8z8TdNpEIkDWgR6Y15Jr;qJ>@D1|bx=5`TMPSK61_MybIB zOoHxQe}ST-Q+#t&|xqD zE&yG-OiFq;x<5{hDj=6mEtI{4%^3FgHM9{lpn|vBeUs4r;0_`n_-0TcSRksOgXlV> znzbsmU}!J0p8x>#tM8BWg(SOsX!Kq2U~wc60-*g(Dyfe40}9~q=kRans7`yepV_>x zvq#Uk#=;=ZlaZ#OiXMe9iMZePSDq)KqACn=jZH=a<#YHI#-@4;OnD!BK-`$s^j7k; zlC9=^Xr@*GhL6fYXlN+Qd$QD3^o!M3(q_o0tV))ac1uo=*I@HQZ%#$s;#=k&^?_ly;Z{ewdK%b{$sydM zKN2RDZS`+4$lH?va&DgD{GO=XL|t2Mnt#b2a_)?PC^)qyr^AGiT{uA+-XpqFP{U9` zu!qJYHD@9EKku7r7=&>af*_CKmLRmjjUIa)~&C8 zcf{tFmQwQ6KPi>@T|Z*YO|`?T%4QcZuI~zwT%Ny|!KzM&Q)Sash;gXUswu7LlY6C( z)&gbmQ|P(a%=jL)5Q`oLw3lk14RUQnRU;fT1*UApz@iZ$%E|sk61q0=70LfX{X8qE zp+4-XoxZeI0$t7g)D`S)d6ZY+zS+C&qm%1ScGp0cf=~sPX-g7J44?!L8UVzgi8|fR zj|3w32@qR=(r1Nqmq>DAQ-xj1?%QAI<6cDPxu%-)e7JyWC^tkJELuS5Jsr>#6r7#C zp7n8Hp|eDjCBa&LFs6-5Xp#UTaWdn$tHoEKVw^*ne& zj@_9_tBbj{Tey)6VA-7lXe3-@1#DmU(KkV48wdgHv+QNpR!D*C;{96|l&35f4K6ET+B-;UgnqVV~Xl4ms zC?Zi_Qn`jwZSY5MGeYQ;{XjVt@G5+7cdahiT_BK(uJCO4B%+P0lEXBF=SO|rQfO4C zDiXRS%qhP=`@dFJJFi9_;E);ONFY(vrteA<8lXi( z34kw2N4W|HhqP6ob%GMWazDO=Fa#VZEtV>t8i?7`AxEo{U%Ms~z>{n?&Ou zRW%t8KK2ycr`BJeFAxi&AO?e84XI9^1p);HQ+jLm`e|0jNrAgmZ?iJFm6@xmSBbet z&z>MtIEh@T3G`{v0st$yX=+-O!c;6uqcR*fuJwW(Z%}2Bt1D?Et2+dm16vGenO@a8Dm8^VY> z^Io}#pT*=nvm9lbK|X=|QOQ-EOxvR`({`UEMBdWG7{>(gJWx0l84de%3hE>{d@ z5Ja_>5jE&T-gNt2X3KkLUrYwGJ63vpn2d09A1Ks35KT_5sr_v>3~KI?D7sD%y8d3- zguTz6M8a|sfE$&p8%9O;is3+n6(WQcW`q@ygtbW~g`KK|o$jQSnf-uWWmntf&8u3% zW*XDhW^H%G?*F8L$q_lsnMlHw9>SGPW!> z^a2@$gh<=kR!Nzx7t0QoY23<_cG$djd0w4yRK?9}R3qLgZADWnb5tv@Oiced%-~qU z)X4mwxt+7PMd&}v)Nq>~2-}f=w$~62@BbXpG+JC0BiuYS-aV@t#{Bj(e*N*lKnJhE z5QL$MS}}gVKQ;tdi$gM<%n^^>HZUlH&<)kX)g7IPFkOT++}w*WeTuMB4n6>LD>eqN z`9|f z;j`osw{Rf=Hri6{4Gd*YBUDJ<<57QvAV!`H+JCKgTU?23LRV`v-y2!5KWHi1 zZSl`!ZN6lkH5MjMGTUs8-w5vZ(%sX&Ab$cB5;AmTEGa1wQCgDJLjXwf<|0Y*rEK75 zI?(e}Wy9qyPPh|=5+D4M`NHd3uimop#<2NT-`%c;^#!#QjRic;NH;$102!rzz{D-q z(R~vzv+G8MSjV%k{&+vEt6{nn)l)4_Va_99MEa{Zt*f&3Hp@$?avw5u!m59!(`RiTWa0erF9gB#D-&(ZfO`+_L&*3)WVhkUDc*bs`)620bqwwFl%GaMSqPIP zC~bMzYxq{lP!ve2vP(+SZ<+l77N@(ZY#9$Ml+sWn(Ndm%xc+9MB@!yF@C&5iEF6c`muC{3~ z6AE=@V<4k0O+dpkiTjB+l$#LEH0|V>S#@42u9Z)F!1s{XHBJwsIW074q9EMZ450Y} zP~=z5m!~0)u1!j0&OvHxP|s+QX81OzqBiO@`v;n6a1i1vBi7W9CE!i=Efx$gdrxqr zTSlv{ZDkaTB#vdIpPVI7hDQ9^MDQCf{&^@2P1^k@-U5tqWD0ox6&FDZDAI+!b{gcf z47w&m7?=1FCMyZaM}+PV{w3*AY!1jw>wtVj61|MhCIm*R0|P0oP-; ztjB3KttNf=Pk`5XXFGrWgivAZG_S*nGFVWs#3(swN;7(ZMHv4gq?+n3WlDtDGI#Q2quYTu(VG3O%^P)6<-h48f zghQeKx3_@=7Uw`Z+p+Fl>|@A?Br~mmD_zH#Gj!i zs3yr!kh7u@J>D@1Uklk+qAcCXOd(JbDns6-&eWRDB;)2~?B>(S_UYx4Ztwbp&)d*L zljhEJu3-oX?$xT832gSW7{MTS#29RFs zrZv7hcl&@JOf%Quc$e#l*z`<72JOJZJpA_~2uvBvH^wQib zcq!)IVEq~{bZ7n2XHHQ4f?Sty&uF`59FiN&XLFu z@}=3|^ecXo;3oj7Gxf6_6_h(3D1RwMz|HtQzX6bMBe;IiSr$G0`0Zx(UH-}^b70O$saV8s<%TopS^r_F z566}$U<$X$yDjLp|LZs%qXgMdNuF+5qxeQ!?4jXaMAk z{3f&CaQ|2{&`{+22e4JWTt!rq*BdKReDdLl&s$(eJXfGLL*ZVE3LUjrVPbfp(qcME zxTQODUlxhng6)M);AjE;$@OUIECb$QF=&@b`t1C{nyxJ4vDRdsxe;J*deT($e53WR zW=t}z&svAuTZDCugGK_TTc&4gDbc?y;-2y7oBfGBVi(FOo2*2KLcG*OrjE)~9~`eb z#;jx`cjmgxpwD@TkqfMHVy-vCSeGy>gj53cdk?1v=7(v1h=K?>GYAuQv7qbu#Ps&q zjYM1Q%3cOS+~+Q$Q6#sh;cs}XTHn2MmJM(5xa;j)?7Ri1la^fL^JTjaGw3)>uw$Dk zRvJlG#O$2P1P^C`zz%z0h!bjguh>mhjEq!;W%&<6?+r!UC^fw&krG={fO4(Dj!kj@ z+8MyPA*Lr}$)2bs47;+Rocdm7I3e4KGLFp%x(P&6CYdrG{NHY*IaHT@WR|Sd)vgTt}zWbW#G_nNW z^H}7`D~o7IG%_UA%5f@K!dBdXx%Ix6B$Z2@qc_|KN<1Wa!5^JaFJ>icnATFb7kt}Ewvp~-fu&92+lLKaSHw&`@cFi?m& z3dyFGJw&0~)#*%#6%95!N5M|LL?4oX#pW2?Q#(>1os^ucqCH8qP+s0^WL8T__HV8Rn^IQT2FDN z!J@q01C@xo8pG)UdRUh(GE(~?&*_4C-8H~S?@14uKm(X$&+>(z@G4igAG1qcT^%#Cq%HnYct~4X2+=rregrH09keS6EnA@Z#)HFEIQ`MVf z`-=_1?{3{Y>;Nhdm?J(}MUC!P$!5d)hjjMlV4$`ooX^Aon9@Z3pNX7a`GtJum-!YQ zC7sa~)~#>G4`zp<(FUeWh&z)ym(io48^RtrYSysYBa+8o*#3mQ*9^4~H$}hV{Gg<} zO5SAr>9%g$^tq!IXeZ9 zC%Ls?6^13{4m@XyiJptNGbVc0zdvmI9fZ7PAR@DLwcDt_uP$12nW9S%!b|8q6JlpR zi;KS2e@nhVbGoaMj9A3nxt%GLM$r{grkmnz(#<6PN?&vMN^J-`u{3nWn7t^=4{G=I zZR*Zcw2=$_%XF)-xn}YlF)={uwY%Y4Fj7}76x(7y5j-_htrS0SOz6|%ZkvlKEVnw# zNZ>L_rXlE2w5#;5B>O&FH;UW&7SqGnZSaFzNp+Stshbhc8i zSugp~xyuR6Z6SW8h9RJyNwdgoIph% zmTgR0ZZzU$lo!_5)Z3{d<|GuX4t~HvkIni4q#+P0c>@}J@{V-gFG8S~KD$y$a!UkY zUY}D<(b6I8a{ry*>JIA!lrT2k%dd!de+-Pq&%&~;_Ofqm|1=o+D--UlqH3Z#5O}CE zVXS0tl^?4%;d%x2>+?JK@+6*nW7SEoY6YEXtSWyt&e{0n)Vn!60>^xyIANf5P}&4rG^sVJjZ}5C z^|k6avTd$#b95Ra48cYngG(*LPdtTEO~qDRmzw{qJ@x-r9#5-r6S4)C@+!ktZ$JBl zQqDX8i=h+>L_#(ul}u{FV~9*Pr@4a@PdU2yR?ymrzxoiu5(Z#qb(2U0vl~Pxg}3AeN@ANV<3)C9*|g+23c3oE}2Km+v@?hs+mM5oZ~e z_VlOGP<#}d9CIoS8VBLGFRufPFRj5oA-g}B1%lnSy|}GzmCm_Wa4E$8GQOeGoN3La zCE3{a4SRZd`Yh?>!)EP(stDtHiDw#(5~ugZF7h0EZ&G z=spnTG+Y#A(C8jPc!=Y*v8@x+)U8B$@V#Ue4oBK6O)?CBTOtq2g%Y;H|-9JO^(O5EG`t| zT$Zj?d2X7w@GE$RfnBEA=0IptHO*RESM7clMN3oN`^*dUUN_JD&0cx-3q{(-q0Ca5 z{T=(<{}B#9mgkU9s66UU$^1R$`KbDk`$Z9CObn0I$3eyJk_#9S9nI};kJbZwD5o5y zVp8=jO>0R)Sd_aUGESC(kwX8>s(cu3;`K*O-JRW(NwT}rVOV@3dAJ8uLNCc6V^n?AF&N~SvTQvkNbdleQOlJ@TkCWdDWt&;KDX9;Pcw(WI*pO zSm0%t;XT}v;omKiIboo=YA=bci1!&syTOu_=&*J`L>P^ z-myMq<;e5pi#NYE%v$6y2af$$N-aDQpVfdI5j+uyC6g&LnkuLd^pC;YaU~9ps69O! zA5n^ygyP327i2BM@u=E~mx9-sgU6Ro@TXOjj2%+uj`UsP5{*x|FN)~6F3T~Wf}*V# z*HrNeZ|l3$(K651@7uK$xuFG8f_YKme(_Lzl=D;};>J_-xwL>z+lM3}y$#-35gVa$ zu2c6Z8f%^A2Ag%3aG!C!+X7Yf8iS;)$1Zku%!S=a+eKHTHC{-4M)1zoAin4KAy;m@ z#Ur-9{t0p{ZbCl$h&}1!DN*iJZhxs1{l62?@;dLgaY&r}gghIcRgYvGIXxa?p8kq0 z`ehUD&?Wi9+*9lNa9XwubA#h78hnpiln+ZX==k6+^4;@`w@b#i7e$F9*No)zs@s(1`RbmIE;5cQte4<<-uEpjZIOjA!lcD8E>B;3^6pF5$k&NIwY+{+* zTBwfeghxloAdpOm8c8da@!}(u=O!F^Py@z%wk#4UHd5~%-$%0J?uenZaw;S1@~x4K zwC>VJ(+lcUHHL3N<*H70dJjF}aIS`ojN*otmLfXOmbLVT>(>w`OkEd>yL6fIbVz}h z&99feP%v0b*rfHxM{xrvY}5kLWH_Ai77f;A^@!sKN|h3+9Q)pazXh^E(AdnjY4B~I zlk#702NJ&AL`Soo$KgD`kMmEyTZ%e*IFC+p2vDRbU@-V>8}KtH@PtHJsj9549Bsj_ zw9aUh%0=;a3k%zybAOgWL&9m>XVv%Cb0R8M+0}yNJNKh?{9V>e82SNTxeyfROMxMw z(GZ}7#RS{K60-Dh(Lr%3HXiWos9tY#S7u86)d^qXd!4=6Kf)oVrDXwrPyqc2<((Jl zLI?MQ&fH)O8qN+UX9^@23|fL0ra1jas(^rs)ZX#LlFUL1WMq(+Y1oBY6@{%2>-ufX z@G)FbxT??Dcp-1w=Ke?YCkILUWx1_k_=}b+rkfDl=nJn*{R*(01Y##3x6^DX3f7}JkAd4d^?fl8X5;5b&8z?q_p*dxR5aY-S7uuV7BG zAKNZ(>RSuWUtGeX*BVP{D!oH}0Y!jMhTx($u3amr&530>aWZM?wZ<+#h;`ZZ>`!R# zMoPS^xkfy+0Q?!NT?)W5-NaFWT?wq^}<1L?Am!%N5oU5Fgy=wF7j zRFP~8PBSVBWNv)1U0qn9zi)T{;4s+tH!$gQpb!#PSUgPS@>9)9j%fv~>AwMsd*u|T zdtb|QThpXDbBK;1ECtVhGW_=fs6AgReqUD~0536lkNhxo?TTe!hA$08 z=x7=r=2Q`udyQ3LBWB8sf#PRmGlNcyzifoNc&8htOkT8vLdkF$VS zBK{Ge?3W$MexYKQh~qcfY1sJPQtyrFm5VRy@2$A2Kvpwa9Aas zrZ@%%FcN*r-uDpAptBdU9){{q2&{nYzH*M;C>37nVTkmtWf8T{EU#K%>|M;cE!4j6 z`2vm(Dtr#$3CO6IErr)A&xXmTH5>DZ*W8;$);Fc{##TUn{prd>m4kPAv7#$J9W^g7 zlq=yAUa0St3efoIVjC_n%;;50Vs^!9U20rr8rQk#-ScH$oYtLtwQ$O&-!n&0$|Dqt zwKFcxoMnooe5 zeRggUJgDPs`u~n%E3<&SBW+ls5JxWfu0fentI61%TvlfQYuC9}v;1)jc7zgRk&YnHdM@IMnh>jy3g z$^xwgj^I*yRDXOhO><&6*vOZtwM)Eteh_7Ly6&pK{I$wjdJ>4Q%hYV|`O8yL`aFkS z_#7a>@rBf767hO7x%mobx0H=8lOM_TCjJ%};LfJ=@%asY`!lxhH-W2T!DB}RPI?TU zBZ=aF7_q)~UWj7~1Y(s4B@<~#UK`Gd7xXjFRWSn`F=ryYOiJ$>^ptzz3VAKSh6C1@ zcj`CeiI{V3;wRTUG zLC(pFNToi6GM4Qu(vV9$LA`}3Rz=4Bfx+SO+`7^OszFF9@jH(CDPBxDu6A)J%Kt&x zG_=UIXMn8BKD)7aA4hY~YE<(q%6jOk`tBS0-0jZOJSD6M#1Ny;F*7oX{&8?*BnD!RgWDJ{UL-W;IY>AhC;pT$ z)tYjLZH9H1=O3MTT|_%P_j+}=Faqa+b$mV(4#HEGaev9thdq~3G;h8l(+>P?+T{vO zd6=I21HO3fY5_HOhVjblcE@4CkwaCusm?Wo*EIbrWLhbI6@g?j$@%X#&I0d8izIRQ zIROt`8$Lc?0M=CGWMlgj?(oqSsd3JIQ@I;U5&;;q*n_FDPcI)Sh3x$ z!#^LFfIqZaZRA_4aVvc~Bhm)Dp@&p=o@QaO&=jfcXxN~Io#9V2hU?(uJ-8A&Cg^O? zi3oI7RrN5kN!~kzk7aqjI^38P(Xy=NM0BU&N((&D^z(`Ci5%7r+r~QD>k<#%nGvNe zL2aV_0SbIuISv(hPYaDr)L7I&{;!SBazGZf^dz>z<(xDmYGSfcieCJz&sboHK-DP- z$}p-|p6kx+%gnio&sJFM_h-=`AwzxY!3lyY*jTcRGN{wd?`bPZLO|kLlD*PacsM8T zPRezvG8JV)CCMgt#35X=uC%`ALnm*{M1m z{w=6SaRJZs(nibLH>R2Cm&ZaMl;6JnkjXvq&ZP+x#T)ER;C3PJ5=ym*Z+WzN2XXwu z6!;#MFCI&8)YlueH13H{vHH$^>37)E?ozI7+OnCj+S6Lh$u0f+qd1b8#heKy0)tSr z!dhBHP$b7`sM#^xmJAt-U-Zfuc;=;gcyN^EEpjH>II9J5QZJYH2- zno7Jl>*Q{@=mEkau(zc9XHOiYPVH#X#MoV?1hq3`jf0CbLAx!5VT5Iz+M3uJ@*a!7 zeJ*@je)cLY+#o|tp{=)-hNqMGTj<~W!-9)}pG5{(~H4Se{ zYxm{bD4dJwd`UGTlr! ze%piyH};kgn6;ovME05NobRNcNO7O`zrE&_I~#n|c=scPD}h}oxnSyJSp#eu3lU(d zXhLJzBj~%I_9I->WXRJvfu@Qqvgzj#Tgdo8Yr8rA(;nO#wu=qjN6LJbd6+C&-FXY{ zTXUl$xh1#b(hkz-q#bi!yr&5QarDB_u&P{VCFVL>4gH0f_eThOc+^r);wVb%Z7B`w z>T)=~ZGNuf_DQ?i5hZiYK}a)k)a>|%f2>3MgM#yo9QH0iTVcJn=HN@VBu2K3Ukj}^ zGQr09ue8rFA(;0sM`NB!h5No6kr2=&bYf~*=eJ}G*nGJhIJ0HBp-Ve#@IB^pom@{Y zxWh^d3>aOI2d9`mdPX5Vr}&o%Z0F-!r5sy>=Fse0vc=`9wq%8>f4I&$ZQ5x>+fJO> z2Dcj!ATZIs1@iLJ{#e})K>qT^owh2o#Ya||ebTCmhqrv+3_Bv7uu1uwXIQ_Vbn2=` zWBVi*vLPpae!25OaN4$S6y;+?*glo>{q9hG#-KBP-avV*la5`I&FyjFhwuY+o&@5- z5}CeZR*=-Z)qBVq$S+i=Sf~CyRdeFC zfQZp{z)Z8aDwKl%dkZZ&i-gr=Ri2z0g@|up#>oVykUKxl3Sq`2!^zAEHlrBzlhsWA zW?6}t#RT_^j&SYcuu&OE)2;|viGZZ48JZBk9ABAIrYReWvgy=&Ti;qJLZ)J4uyX%A z7y(-U!*Z7RLwZj@arvQKvLD=96L}RDd?`=YqCOvger_0!Ub%ykeknpmmI{~YQjKv- z`bW|-r}+N)y~@7_f))qK9?P90sf!gMK0QlFk;7Vasv!(p%AJJi=Yq^3M|Dx^I)ml7l_b5Qb)&yu#oaAF3yT zHr=t4hOfD^v1>xkB4#*=45OkZJd;bHyClhJBlJKs#4V@({i@I|AQR+k;*BaitFD=y z3RGeHv#>r>pCMM6#R~0YuiR0f?ZxOF3r{2qRf{R_an(+9L*I(?pmG61Mwih@& z*auP@8C=YCMum(6qbJB`l-J5#_5gfr%vv#m4G#DKl5y0wr|6k_`bxny{_1KuFwLjJz19{df} z;R;^%%|dmT;OxqcJ&>zZdoFU$Zga}_zUbRpq|;d z)e}d^En;~3O5xFcV5GB;F2N!ssmE<>E8T4ui68U!TuNxBrSL2_N%m|>@``U+c7t2pip?N`Se#J@xGxuqr5@8X~3uIKPYMw9x z3LwlkMFkp5_hcr=CY}0L5KuB864LBYfoY6FZF{uIHR}u3NRq^NdGsjq!R>?o;H!3C z5C!d&u^Wl4HALm|oT_W(EyNYXJwtQoUWFjmyI--56Wa{~)bR^M2B{{v>^8&FQopl|h=~qPEBpQy$CQeKeAEDVH#U5XdhjDNfztCy_ z2DBUddtkTH5vehL)yGfHA?WY<0nu?p%_utU?`JGE)xGi2xC zVLaH?IQ%i)#m=xKSSuxm!_mOd?UFNXdF>10`;N^Df=-aKm=yo8SAcW}jry}NFphzy zwOE7n3%RL327&!_KX`J=d{~fP)3_dY{GsEozYmdxD1jGir$kXK0!2ls5q%`~RFi>_ z%+u1XkP1*~Q`6TeRqnMZFx(QTJ3GU+S zFPxh~%j_Bsd@VLkrIqua%OeQqeSa6AW-bW}^bRl4zh^c%Ix|I$rd34Z$9Pi$i7nDo zQ3*@ke#J6tq{)$A6JJhF6Hw){_F28G!TL?!0;ot1k7)<9?RWoj|oL(RCI+*dNv^g23aSLsTo^Du*43V zcpTJp(*!Oh+7FrR0ENs;n~U)v*qH^6>wJuQ(mc!~*)1(I{xZ9OCRLl)a`Hq- z?65ZqvLbXYJO##*%GHr3NVnAI_Qk%lf&KFiDjz$Qt3#>hV0&&8A-V#-yn59(n}D>R5v8juBU?QQdemh<&r{l&9H0 z;2$i)HdY;(hDdM@#jSIq*^F1%hbQMb_`w0s3V63t2*4X@vku$Msu+h$6gnW$ifQsf zEZbg;@D;4&saj0(e82>4h zNO4&acPk(`a3lLSN{=A9EHy!Uyar6fgpu2fLRmtWrIl7=%y~VNtDo#Pah$~i1|Y;? zOLL4rdkYU_<1XTHD=%R^4StDzRjjAG*~X#l$jFuQX>8?|(7P(}!JeG{ z-)*S0>C)5sH$|yqw;`Tm>FG#o^0Y?hVnOtJ&pq^-WWVbPk*8-)0Ft1wis{j7 zn4hA5Gr|?TQzsKt>%~b581B(2@?d0OPGzH-Xy7faLm27st?kkF0fHy7MD8T=a`P%6Q)8Kwur|-GELo$d_3mSrAeJuUce%O zgaNDjEEOkNh}6bM_P5lEkRc2XQeZFGv$)Y7cs9I7wfxMFwjx#?am?WW2O}zLa?|A= zsr+#zA(A~55kVnj>-i0AoDbM@zQAOESUlB?EvHi8A21IrmDjxe)Ua;kFJ(!*;K)7< z!3PpKOm-KlP!dx3VA_@wCmDZIj7BrTI-@*btlN863=fv}c-5Zx-d?A>vpT@E2_c@4 zS@UYq$NQEzCCD7;D*EctO``v%LFy;uh+)gc`aasn^+$?WOWvAf^+bBexRW~w1mmQLfJ!Pqv?qEh*i#(S*GIuNZ>cM!^_GKwuP%{SUthCA8^o!IXZsP*inI_X{p3Gw z2+KE4MMX2zfmogDp}9qS7lq1foNDvbA_pSuz4Wx@;W_%qmu`bNCWMp|E7-eoh_*&? z#?o`#z(aSsF>boTC==rCquby4BFigwkOu}VBnfT(Qv`c-hnou2&~vlQU726|wTw8{ zh)|Ky6crKHN$C!JUi&p|(PzFt=UJjpNW>NMH&Zt{*-yXkkUbmiSXM)9yR6oE12(F> zw2`sLBVJlh-QDx36ixZhsY%7we>?ggxRpB*a0w9(@YeMgN7B3PZ$)#3)HCn!iTqt8 z^4BIqPEFFDRrC_Td zM236o9ctwWHev?-rDE(~l50b#&{xghCgmIQpwLKyoHHFSJMLQn_>`wLNS}O^Tq4Cp zF3W~e4S{_H7}C}bymZbrUWGv%;MluePcnT-0^UR6V3_7hRknq?m*Oz`PF^4hNp+nR z%?n7zf?LX|{edOyqtkguNv=96{tkSnK$ zocp{TSTn1FVr!q>Fj3EljSqAMf-VQ~DJi4n3{~d6T2J!KAwxEjXo6Gg=871*hTN|8 z$#qqCU9r3{i&$V0Wy_Q0<;goSL&^OR;6KKHv@pPToCg-nv|x0@$9$M=IRimLcjxzd z|HZENC!8*JW4z)kJ*UUNh$sN!tU+vv=?OEh=O!!RBLfM+4GH|JoLN?2`g#d}>SOSJ zTQ-OL?CNtXRijl-YCCl_Jg2Nhw< zt4yw;TJKtFqfqX*j&ggE87r24j(^Hu>BRV;B#ZkUUR-7UMTC6YBZt(&@{_A}fOzS$HBk7dir7Lb5gR~54bJU1603&%yI`D#rVuR z{W&{*yVa%g?k)E0FfKwA;qWeXOKG`+%!>|hI4ez{7rUmPOwTw&Y>nrH#bs=y9QS`_qW9S!heNgz(!}nfcL6=RC9|dC@k2AcyhW4`E zpWtPgwDv4U=pryvhhg%D%ikxrg4*rqSqjJ&*PtR{83t#12Fv#z^oH&Lw~5dBXx2ISQ9UJ6yk&7FS&ilTXIS>?gU(tdWZCe_AEAZnHto{1d?_N z+G5*QuLbAUY4<$N#+M>^?(_q2pm0tyqMm*~*q^?gz<(yIPE}Pd$+zpJv>tmF7`FPi z54RrOzSc_OdxZk%ZSmv6DZn6K;Ht%9lVBaHZ{jrsUuZbBtX=@8DSZMtG=w`QJYpap zKR5^S5(YI&!;6Ke(E4>5UwMA+I&Dn)b4Zkm;Qmx+-bWNzbaGUcqX^cLWy|eYlXr*I z-?@6P|AfwbbG_xHxR+2`3^@KaBCed@jYK7v)@j9!mTmO|*_gZ*;$)0eB4oL3xa;V5 zg;tJcJ^p0g5I>n- zY}7O|4ZQrgMM+I*8=0(G4k94tsdc}h#%tN*Q`zIBSmWG1RkzCDtbM=Y>qlNu>%yDNjk( zpayBVnN{YUJ%bywo#CN_=wfzGMrKybH#P#-np@IU#qJX`m6Qk!J6z7!h?14&9T^5J zdG#}(>$~>lBl!udm>9+0m7jl`Px*!zPq(~vU`5XSJPoa;nR#@aX%kB6c4d;AkjT;? zIX`7u(f5V`EGJdNrL7mE7QBZw70`CV@&7OW8$y>-xQhcxWoOe^#X4mXEs3kg=!iMV zcJ^#dqbs*OwTgTVTv=PfwWcH)-k(vU#Q5dE5e!{g!h@AhpiCv2#??n8^L0|-s7U!v zlPAIJ`W_|~{yE=8EhIjen^ahh_}rlDf0*d{W1fpvNVq>QvA{dyaxUExUU&8vJnjXX zWW??!dgm5XwN9%pErDb}{m?wty<#DDehN8x;+{?%i$jEq8CX^e+AK52*X3#2Now2d z#Imx)*;zKB-<3Zo%p(|Metd~tKQ!a8V1kKj$ z8c`bNt6zQ*g6^X?K#7>G?--N}R-3xeC706vQIHDm97YhST7-&B`GFGq`nN4xCQ-fO-@I`TJgBroCrjOh9Q{OrIa6%hwPAs3|S-e;Vra7`jFg<{VW{1rS{|kSgo|x z_)L&c$WmJAttN-ntBN<^1}o!so}o{q)BBf=^{3(|Qt_L}K*9d8zSXm@_GQ>74S{($ z!%Yn_9{+1fd~*W{xl?ekz!kz3WpK|+UzzaqId|P>_U`>F4NC(qhiE5`@opt;M@1cP zUZ~P{DwyL1LmR;nDNDV7+1S*Y%;+qzAp2SR^krjxfriLNax*wQX=(J29Cv-)PHYGb z{kF|_@V0`$>SVB2venx?sLPS(kgFa zX9oZa-h5liPut%k{}YMx5q7i@K}Y8T?fdX-6WoHzhKrD=+V5}Q`>`~PCCo-1rs~9r zWP6^5C~GQ-SW*ntM5hw_ulf@R-QRrApk9$8sJj9d?}R)fAV434XQBv+W%rtCs`ym4 z)09vHC}@w|i}tIgj{Lvi1AqrKSpY7f^nNK#Crx2zYo%VaoG_Ad^znvD<#@NUuS+?O z=>pG&jdd5DjMaLu3MxFOypZh>NAV!PRlv;>&A&C;&0pfMsUOhbj zcu~diMVCJ&#Q4F?>8A$@@Ux=*VAk|414EYMZu($YT_~ge%z&G6d|n_gknGD_n0h`! zN7pSszb-Vpr*?tN^(ORlRYg66pE~ z=&BuUQ)0S)dUJa0Ph>;wiZiw7#y?!Qiz@ht33e4%vE;#@=*HTSGquQuzltM{>kiTe zbX`a-ptDSyJ|t*6Tz{A-PSCpijeV(OXWK)qwAgUwP)sgpGj-ix7*$5D!APHFt?Wq4 zq2)x^v6sLmcbNV0kGGzRrFSzm@H{@*7HHZs=1(VqPQZrV5abEw%wpN%+>&~6V!8+A zn`hba4vw*3#(Pq=Y(%B_bnpGS{oFYKjye}@W=r?diPTh-iUw8~Pgo7a zz1&e>AHXgZJt?Irvpq$*_V`|VVWn8g+3F zrD5WVXnch_z4q2s$R#oI_lq^VpN8v-ftL7b= zd^+D=0j~=1S6<-RPuP%RTJ8Fmvjnbz?x(YHl5bDLte|pRl0>euYplH4wu<^>Wx5M- zc&=?597?WaDNzMd@-`Gy7PrC|fF-2j))KICBz&dgu`h+>UpD5?Ab~Ece^QggS?P>} zN_pV@Nz0#?*xXCmXTSV)mZ7urmY>^q+Wg00z<$Rv&&4?W{NMttI)=hKEVEWpft4&*UzX$i+%R zABk$?^%~u!61hl8+?+8(>{0^1(A0=r9{Vc>aGRz;Is&0x6K+sG=$dQ{N|2^&&AI#` zQ$70Z;(JM?F0K~vNC{ifFzB6@#evZBv(wU$pe2`0$1s$0Kb#?2#B-dL zzLZR{3$bv%_2%_BVjW9|c8f`62zXxb7cBwWt%)ECl>bPKJWH$_hDUNVGMK{j|Em7V zXiNEvMl(erdW>sSGpUr7k5ou*iW%aec#{^8$XWn0&A3MEqdMyCE~yjN7+_{jDB<3I zInj9S~`gIFf-&j#CG~uO}2TF9Pun0VRLhv^Z1h&)}&m z3*bTJphD0!%}+|AXhSArtwt3%p?opL5<;-e4OtNX(Ng+x?$?JWNP!?=f@A9Bw8@Wd zDmoLiaRgN)_&6i(6Sx3ODIEAWaCBQBYGMJSE?Ude=G848e^nkbSJWA6P~5b^Pb(`ZiSkgSQ`_qUzfM z;;!P+2MlC6{o?}Om2K&2c`K?>jJ?>*9$$dpiWxXLkA0#UhZCV2TO~#3N4#To8Fh?^ zj?s4vM7ag(9@**6NYv+-;(q+sA4Ou^(HDLCz0q*KozCvmg&GB*$}u)~@; zCE?$(f#Y$hctS_^5UQ#e1cLiH*|T1NRk3%_^~cc-!B=Y6EueuT;pnoqMyrLM(L^LH z5=gBUOP0l2e19*2c&5a zA!;s&3wl#;Dok`>eUq>1SK^`jT8ientMQ~0fxzf|iiSYYP{`^fSbdpHKH$M+S{B8T zI9TExkXS7Jl2UIF9C4{qZ+{}kEQ!|}U!F@&2CH1FDWNAP^NMsDW_d=2tRqZ`G3V#O z-@GaaGuv5N;C7Xn8NC}wxxndI0!qwHqrz`JT0d>`k$iY^+7t%n4~X&-;1Yyfv2)Ra z>Z1_qZ#ZQXJ=(W(8j-@Z>KEqwg2IzaftbHyiD%aSa~pK*_PpvY87Og@DS>wF?1NVg z)Av@TPPe4&P_F&q?zC1FNrC~@+}g&~{2GhCijkbk%o@n6QEOskCFq6e=5)PkF+rcH zMl;zOlnAenFOcTbimSmuu{x*opXFHYZXUVs>JddldPenRr>x-5C~=OSN_c~!1#UGh zmBHMy^l3E4x{C)W)YBK%vsmlSpQcjwonKeZBs+09Cz+gw!{x0`290iO-!|$St!u9v zU3JKJs1|{^dU?8c(63E`+#uz@R$y`%LU2iiNnn1u-)|iRRnoN3bEZI86RFsvENPR1( zXYDm$=qgQGYBD8f#DrmI=rxU*U>A}i(8%L?&^`9U+t4vbe_d7GEn~>1nPsFzFE93d zUAo_yxR)R@)16VrYQ_oPdBv2S(xWamf7Knmt6M|_W|RVYF9f#pTntmUkxO2bQ1I;l zJQ7GTeeb80#ebaa_v|%&|C0Ea%s7gGAE-JG<$0&BX_bC7SARY8%VFx+tT?>QER|l< zzKXe6;Q8E#RBW7p(I7$hPi+ARwKZl!@0QBhJ9MapC?$<5%Z;3r}u zOYn?npwiB82sN=%GC%SF4s_+Fcd2|%(omYwAT+PYMcFo08XK!|m(z3>=f zmn20f@L!De#p;e@V?cGj6$niuLfNz>WkN>Sw#9fVEyv)>#Dee0`2>( z7?D(q+$+Y@O5yX+wNPj!bb#1IXHiv`bFgAg7OFR~#Bz@s_e;xDD7=O?$gd?6>O|96 zbue@qRlNMGf=B&m>j1v_6`0bZTbKi{%yvJDQYi3=fB2x`$yPcGcK{8G-J4evl|SJS zCsXcUdjZ7rv}Rs8A~_uD+lB;g(J98b|Dc|MI+#TG-=#}=WC3?n8I4PlsSBCyF^aHQ zvgXeOrV5dY%0*XUq$;~8a>gyPGPsC{gZ5Ao(sTiR3w!u8Vx|C$UFl39{`ZIo2HPhn z1&uFFfh0VF%;YjEn!#CGJoL-z683S8fw1pWEZi*c3wLF;*2q)r-Xgb--KoiUiKW_i zq`lis#J(DC41rZmvB$ZCr|PjpumEm*m&S;aP?&)pI8zsyz(ao8@J?7hwxTN14a(F9 z#}|fwq@wo=QCUD-)>|@qFAr_S1Plm(lf>FO=1-3Tt^c0;JFux-%hsaFin0EVkRq6f zu==J!e%?-?GGjZf_=JKvYbas~K=OdbJn) z7uG_u){&N@YBfLZc5D}G14(dc$iAT1bvhh`3WL;G@kHKLXyhMxiNx816aLzX$PH-# zB4ofjgI%9cKtX`7)EAJt`zTu|>rPW67=S4%3!kp%>9hM~ z@0!)vo+cIVG7ab=&yu`0@J@tCa;18wKjHsc1-7RqgZ>?)e@X)#xzgEj2x|fXK}b?e zk>jG-B8w;~m)L2*uJ|s7h2Q=wc7|Ms=Q%K{40fHpHep9;+pKguvwGHi+dCoAKvw{^ zX*V`c_v*U7T)tGKBreS$XYu>YIxy4Z8Xn`CQ6h8u^BTFAkjp`$C}4)?%Z4VS9{LsjIz)f=&uL)CtOq zGRjKq(f5)aIq)a|!9XY{EN*y_*JrI|0d;)KM+jtb9S^3NlYu zDW)%_n^CYAuU^1nqrMTM4FE{ke}Ug}Txw?T&tpDOk z%W8kbt3(XA{-BN`D=e<86yQ{cYxZ2^PnHC)HE)fLJk}TFGTh~JLdcN}Tq_AGz) ztQhF^us_Fhrp; z`1pS$sMON|IqD6bQG|%kk4EA(kCOMkxiD!XdDeC}))9yHMa11uQK%8NaA)H292zp&6J-)C$eg+CpU)Q5$nynyX#av>6Vke0O{^UGhF5G@cSH z4pg2OPbkEx%ZFYvWFi^TpBQ0R^>2zQ@)dj1*`?X)9(r!fl2(m+b?dMM?yzNMh;}E3 z#mB?NfmWjICt3(^P)b@Rw>(GNNw+{YE!WalR17ag;O(21Qe?jQPM>PIVsKf%*-<6jO30KGb#y4UGp_rtf9SO z22vmP;0r=Ci?!_)%f|X`?F4tIvP|9dVG;+XQ=TY?7{@4M`yPK#KAxxe_~D!zz*A-i zxkAa_(fFn4d*MD;reArE%}?~Xqpps&OPP8JNMzn1V8h^QBEzF{>rY9B+qvX=GO12XYjPm+qzh! zX33k+`})`K0PFGkWpuCa&Waz{a0nGh-@BuFn%DOS@JGs(K-bEC*{2f>RI#tTP{FCn z*7q=TVm6fvt;^wHIQi(6Q92fSZzT{GA8)ukC2D2}{PP*eYI)!`Q{N z#bC*>W#CJ$v=mC;a0?~BF2>m!DBF%kYsRLRlo$P=IL%)Fe)VTYgevIbdx;jcK4fZk z0U*_t@zRXAB3ZfU%QF8;Z4H+3vwL4^2UiOd^R2kuY+YAaK>K1tE@$|wl`V~J15-vX%XHZ=+&nnw9xV3 zl?R?GdFc9olUe5EQcp?;Iz8^MDVt7?{4=~4q}$vI#ks!T#1L;1#|J{cpQA5nVC4ai zsdjF!sjy6(DAM4^QF>mjU|-gp#%u*BJG44V5#5?@jn#mHpF?xB|4z9K&v|kb3A`#m z*~D=T@7Kd|u?a|Hz>z@uo@f7*LyG4gF}=e8*z0RMLI(G9`84&*TtGtKwa?E(xD1UP z30$pa>KUlC>l#pjbLW#yY$yUr&Ia86KyMN2Lji#+R-#srv7&|*D)dM#3O!5^EHTD< zK7R8r2+1xbJ^|tzR;th|8Ud`EK>a%{z@ks!{yhK&w^V3tL2%cykcF$3Gzmtn_2mh2 zcV2@#lkQXJc_n=_etiaD|I;CD66RwHLr!+Yl?SLFe|pTdQ)Uwpg^A>HL@Xmw9cP!4 zVx_%|sDg{Mv~;aG77wv-FLdxO=zd|_AZ>UO9#c3PNpe9fvnkk>#@q6!!dEovr{6Ep zBB#(1?oS=OpC(1+mth4dkchqyvA{hh<=6QL*T=PwL(q10(iGs+E~5@K?=Fc)Q%~jr zQn3wPEbyj{GDIm9R8Dfh7WLO9KKBx&JQxKx(&nF?v-HTwE!*RPz}&ha58x3lPpr`- z3gtFNJt*2oVdQZ~a8uRFLo^V5^FE;(oS56aMv%D%nj0EED0}(V zJJAtHw2iN0kGGtN{lhxe4?X^j-4kek4*q9%wAEB-EELQ(yGjKzERB7li#;B^IVQ`L zXYh*VSqh7J;)u7)*vGqeQA(ka81V*-CzYY&Mvjj*1@#3->832g=E=BLT4eB#0^m ztj~?(WR2x%*@X>QPGKf<)>C;)r-&D7KR`}WEQgV zEChkyPK7?Qm#XvT1-yRE5!U*vSWrnan9%Vz?$vLLXaUS3DSEWio|ZE zA`G{n?%WzOM{;QeLd?j~rj=0BIL(pQ;9)U}bA~^lX=UvSizBL6(S#*+ID4lHBhJk) z%q|knw&qo`lf=2G5}`Y7BdG)1wI@J^N%1Aq8=T_*OXH{(POsimER~C2mQIqRKum=D zBh_m?_EoQ79R+=e5;mZ^&%Og>1>6x>%G>v>>&s=G8~VdP3WQ9HTJ9#wF^u!3EtPlu z2?64eayx?mEtgy@eZ+L;>k#FBWcgZ1)>^^>(2uws86;6$3j1I}5URGI(i}TJfof_2 z^6u#+uiF4@8XB4vv9l#H%-MaLr70YjsU6_j zlPV9xa*rUy2j!H?v_R~}#o^bk$m}Ht>1daZxvKkOBiAn4NS+hm{gzbO)lO1DQ+qM?Z#YB< zb*?1c-M~4vihay)DF&fH^mt^^xnLxA3l*Wi6=);KzQxZ55p#HQ4k-g+aVG@%B@^nb zSTq`qP<$HhO9-JsZsHl~?qWEpD zo*8;uNB{h}Uxmd|ttq*gWdAj)`U_Z7c#z&v>gDA5S83`4`x7&=d8-Lpz{CZs`y_P( z6~X?B0eQP~!90jPESBt5k`vXiKsyVx5&K+*zb335#O?6iKNN4|%%swyF|wB1vt!W} z`lB~NmeP-N$Y3joU}Na^iOiF961wIrv%2+0I5e&OGWfc;`L)eObAEQ|`f8?>*Wq5_ zl_@O{OI>OAgvYzcM;0jBeyU~98#i@RH zjg{BU@$3xcdGFP(1m_mksN3Ev$WCP&ekOjbnla;4FuO(dDO17KUJ?X+GvFE@ldg0m zLuKiC)Gwd2CudG??Zl6nLpfip3}PR>1@qiWXY{8t+;ERemDC@=z8u+QvEI zXP?kRvhk#|rdyvD z`fDeIh^oDWh2Xc+46P=!h&#)iTf@%4440uRO8byNct6G}XZ8~bzwW;wxd&^;vt%q{ z%ZTOoHjU@{OKM0ME5bMZJ@)O7)c1oaaCOTjqu{D1GIKO3Ua}L|(#9RVr-$)$gIyD^ zp(_*tQTb0WR|*8PBrH}BS0YGvIaQJ*AFHpCOl59c6y}RI?l$_eXhG3$r4z~M)TF?Z zORMNoo%FpYswX3mBV{a}*H@7Fa}l8>=~*yWxZ44`hZ`)w^t`#nTJ<+`>zNM2f*LLx zJEI_Q_TeS&&M%=`fKCItnKJXtK=%<9<4oe?e$gc&&~CU_)<6AV-@!td$3@;KxXT)O z&C=7D3k-{9aFa5)eJ$9YK)tcW5@+?;U*5e=$l;_q+EN0+3XKDpf=VE ze~HZxBypE*Cgq~^T;h}N|6p-p$Aj=1F^}TTFy@QoR+#cPJF#fc>>dQ;j`bIlCvgu zd;dVZWipbZH5#gGtDaD|eVju%M^-6Qy2WwF(sLonr|CdjA-Z|+r=OJ)Y12WHg1Nov zG`6<@=*$Z8m~5od_?NFPZm`FM1=W&tLKE#vKhW;eiNWF>*d7C>195m3?@BpiH*!u! zy3s9$z?4Se9UMK{z<7T1nthD{yI z$EBvbm}z=Kc}6%qoTAUvCXn-9HGdYvA|x-)`Jm>E)?7<1BUNT5a{#+ofGE%P`W!U~ z)T*X()ht`@S_mrzF|52{t?nN@R$w9;uIM z%Qs{1q4$_5fafi!`)Ud(-hu}Wq<7iD7~lSlqQFqix>>XLurdntR0=ac>tbKz~ zGQ@u$tH!Ak@K(+oYn3lmA09h`ZWgOWTnoH70H$KK42Z`bO68tU4)3>xKMU4en7jVe z%--Rfs&|&z z@L*JP-$(gwJ-hbReLq3lQ#6IcU3tZZg;PY;bv@?PJnH*nw~m#k6ZHILD@)1>HjFa6!}1s{C9GUKup=-M^**<+cOs)f9whSn7?*n z8os4Qe!Vz=0(sWgES(h48uGr`(<{n-*UJtRGNN)6vZzBW6$2&}=o0AbPLlNgSRXi= zC_n!+kp=v`khnj%4OU7_mFJT)Rn$sNA$O~DMz1ALo<;Ry^JICnihUI~5XInLusdGja@+(&Z z<@(J%6!E_~lJA!9S4ef?qsXeRSnW4I91gyQdF!mAspG4i`bI{Y*n!?IFKF7;Okq-z z@;Axgnfug^kxCFqD=|a^Yru^4G~eLa_g3S#suITS!`6^r-}%> zLKS=xi5-YVQT3;q@EIHn@-SU178CT)UnfFizD`II+bm))Qh@J_E}EU(Xi~$e*k2f8 zfYI{dz8H!|)$fnInl8hjW4TNvbYVo{a6U#HuZAuq5@qS;KG0ViNu=$74$V)^0eXd= zr%n!i7Zw#kNrB~l{Tu;vIg4yKQVOQ;Dd>u_^X07POy?IZNt|J4#Ql_XOAO@I1f1C| zQFIX7BS4K0}b`+Dbsp=;dgh&DYMSb3g2NDaTQX_JN)A$eAj`Eya= z3b~7qH$IPO<@Ll6q%DK9_w0@W2-6plMNiC9 zXwLmU#}=S^3*b=dNjnw(g2K9qgAV;OErv~a`uG|nk?MeYHPiZFPqSA=)2@>^FD`~7 znFf9pv`3Rs^W3JZ$_E#57WLWl~X(CRFTPTv!~JNowM7> zi_^p0M4Kv-Jo3fgI!5RPU_FP#4(@WhV5Z$L3 zzVqd1bq+*1L7jg$%22Kl0igMn$O=xJ?u1#YO8zYpM#EyEoR~t54Mt7AUe*&8zdRJV zD~QwXwBK%TKorINUg;r&N0k8<_eH)D&Z9q1VHLK{DL@(^))I*IRE#Pdn=c0$Msh*m ztyJaWL`ffCtxR_pOFag%nbtK+mKLvvO_vn{Mg}X7V`4m;6nOq|W&9!V>_$qO_;dJ- zUF#t(WGPCV>ZB(sf4rE`yna#vcRi0Kp`*%3k1&!6Ke%+g3vIS!XQm*|1nIe2xa&)} z>qQKifI38DE?E#;f{w05P;I&t8TKGVKi33ztyR}sw1xwYaH+tIs3)ofMp>C7y$Tzz zIk*<)T8r^_V*FOP%X-LW(IF(eME7L4#ea>{#XJApLGbEuw9Fx84UXqDPVzHYcX8r7 zX{M}guKXcB1ixK3Z6)_?I6q-Y^wg z9~wGrZJz0H(1&QTEi`1JKDj4D&sjS@^?mASY8<&8R|Tdy)onIS3nM=iUAeTmrr$L( zV+x>fEbFUjnVhmMc;6jIkEWB(RW@sksl{BCkyeqCO0Q5Gi#RD6MLea6QV#fNOP@LO z)-DZPp}$97&jZ@Px~YrQ(bVvmII_YA4Ocbeomx?QzK^@nTva2^C~I!?CKH=83QOh2 z#$;2imvfNE@sf?vUJ+z>V8L@`L}YppIXIyBow1{~`)>Ck+U6Vk>HaA9ocjg{j3m$d z!S@6Fk2|(Qh*l7+t#eh+gX8KIzUJn?PJ|mP6Eo;aER0|fiV0?#9>+3PCR@)|h|(FK z-e5B*{>S;_Y`JesWgKq;|U zZNi+GE_~HaHuFd#y2Ox`4IAi4I)$vPuEEj1kOww1lAqj*_qD|Ps(h)kK!Oc*d>7VrBa%p-bxG#E;W|ODyX7J@?q!d)m%qkolDBRGs-;<+-J{ zLDxF01B}bH%qm!mbASSHxn&o5KIFrxsw`^ND#gI^}X+0*Dm1ra!h>Q8e^&<%z zJM^f!1Gc9szrxc|aPGt=6{l!UvoO*@B>hjL5J<#H8ts2eBn=c1xTJ_F8@FP_x}aVM z1OE4LKN{g6=lp_0)>*i)xL^K{P(?Zbq$!mPhc%X+iLymeyhTR1ryuUQ4)ffA7pwIx z_EGc!)K4+oQ?jnftt9L2gDgB4-Q4#mVYJY6Y4?mkM^W{A4;p4;eh7R|VKNX>gn)B$ zO@O=u!9gS;qN3Q{IX^~8@xmxX6lcuk=e+6)%;hMuowjer?!qkFVEgZWYXu})5=n)L zQHapDLh+IPO_%tcr|uh72)gSCT;DzEVF^O+@X#J?=eNkJZ|UDky?()tlmZf)6R_eD z`ayVpI;9NnV~N#sQ@d zp0Joh8CUQG1Y+tmMBxM}J@X#jw7W6e^;KgQ+y_0cTpde09Y^0k=ioou_m8Ji>m<;D zs`cKl^J@lk{&H4$J3K>2hW;<>EQz2I2|Z+T4}st(ll>R*_a2FBx?j2a^SwiQNO{f- zQL86EvSCoP#^X949n!6b73k6-4#%nQZ0516ub2m*$6d9z6|fFm0IVD?sY5D6mC_9_ zYR)TAl^{3Ad%PM54{z&vr2pSE;ZGf!bG?1@BdxdARg0SHd@x>!z>>phxTtb)NcX_1 z_cRFqDjP0wyc=DP;Cq%B;8ljSp)$-_91p~Ceqq~44!(T3;0ga77}A@d0v;3nQRYbA zNS;%>b`Nt7c?h)$tF>h%0zH~nCSc#)CJ}S?1Oa}ZT>F=EoHMc{gRL| zxgG#ZFy0PO57dYi!NltNr(d_dVjAc({?{;B(&cg>V z+yjTm@hA>Bf_wKUC|H}q5n?aSjZA%0-F@r5H#YMKvEP*M{Op5>{}JFr5&7WW;ZQnZ zwM5nhkgBn1)-|a#>iXQ6-CmF9Jp#)rz~g;41Xw5nT2?A_cm&0|Zg=B*82*u#2HE~x z4UewO?S-7{5w}@r40oO1ioRG-EhOaI%&*?FCnq@Qp?sEA&OEYo-K22yuQ(Xy?RpoU z((oW#Aca0U*R1N+BUmKZZJr$*L(hIW<*YNC>LY?71U+JJemHIpVabF$>#U1&i?Q2h z4*BOp8NKbGHTcbMgWVu|vmS;=-g3Dv%q{%^(u#D2|X9AY=@B*JwQGsX_uJy*hb zBG}q>v4n9CY#rWD!uThRYbT6FjYjG4RnDJu(Uy?frS}!$VMl@scu(*K+4-7%^632B z8Mgo0L*%ltIrm1<`9gx|+5wMpznupW49E((v-kZFasJa>bciZiPTz4T5O*LvtEf?K%-ZVD#A5@B!7117}tAGgVbrf9V-VlUOmHiHI zsMF{^t-lfKrX{hH4ip~H`~PPTzBLRw@Gu>kJN~8K3vbr_vC|5Ol{Eps2dkgNwu)QK zt+8F{4~l9Ju|Vvu5!*HoivjIcUG5LfeCOYqwzmN!T&|6OAF6p8JAR=c-<-$Udw4Z_TdWbLNH5#l}ECkK;%}tLWRDffZllPJ(+)ILEF#{Kj=K~>hyCA}?SatpX!z{z3 zlcHg+k6jiWNs$%#*CTcJV(eF(Wxj~+fxj%r!VGBV@RBTTUAi3h_1{XM*wD!vTqEso zZndX&8&Y)n9*}o+`u#02C+_4Gea*$>pmjbDoK)h%^)CFc2T%!VRFae;{0$LUd7qI|Bh@-Zm8G(TWdpZqj!m={~|?fj6?x_o%Yw*t#RUHu=_)&^=A+Q87@JW;do@hpe^Z)5$J{|4^(^@+ z|7t(CeDC&xj|)5D%*DOPc=mXq-i+*tariv?5y#GBKo&nQ7cH6?yYp|=1^00i9f_mp zS1nhEdOC@}F{_&@TeNi)#b9$QDYDJssw51Y6^Uz$v$wd|>OH81qnRT{crEJc0g2O_IJ8F&rGmlQaLlEQt-swg2&VP}=ouiKVz@Ehy zdHer=Kdk%u|KJz(&|kg3A6K6AvZGyBg6gcFkoTwnI)v^X2h>l!sH8Jjw&pzwJUBV? zs*$faEyIUM71ylN&4q-f5KxR=X*$WuKr<{JVK0Qi7e?}RK z_nm8Ne=`QvS1`JFa|N8YNS)vGw+=Y%j=+?$c=6m>`At7k34>lhzgn9-ZZ)qX(&BH< zbzoiXftRWz!lD_(gtK^m=UC;dEgJZcjB#%YD0hEHlFpvp>YJe;JenypqVC6H^4yvH zR@^GTE>Q|)onV}jOF7Jx^`e}Xj>6h_B*BTf>u$~#QrpqQ6st}tT=o7|kuw9RyIj=& zR86^1N}GPGe9?IrU|$RJUEs2NM~2g@PiyYd7v*!2mN|y%HT_SuBqNxF00E=y*EFRg z&Z1P#HDPcpgl3ik;8Q7SjZ>w{{dbhLuBAB!Z}K)+X*rWe@Hvp5kH*&*)2(OIiwSRV8=3qfCo#Nn1GLkJ^(E5|lg2u-C8Ty2gENB$Bk4 zSyUF|omX>hEpm;U5o@do3Rzl^4Zn;Zi*Dy^P)dHpLA^!Vn<+8we=2h>lsw`_Fo?4? zGlyaB*S4gS<=#+UT|O5%mQiXc;7X0`8c962EhEVaF6EOK%Zg2H6M4|1atuo01ZmQ* ziQZ7DT9wwC6#7MwWNFUB+z~k=^Yt3(!Wcep%fo z1wG872FUM~HRqA4oY5>&sNPZ?ML+9_Qc7?{+D_JavozO+d;NdbzO{nT!pX=@D0Mgj zN#(`GmZgj~Cb5dQ`u!7I@88<$Af|1x2q^t6gW1M zfIyeMBQ4QY`zaMKz8P@dTRavsg_Qf;hZ-CYnpBNhruHo?=RB7aW4WlvN##n4ZeRLD zz{w$!5SE-sZDJy!k?Wve!QkIen=jmKHNB(v?psTWZ|yukhvM_je}I)T6s?hjt79;w zhWym|eFbualHB8mb>qDXorG5zU5H8YreEaziCo!`LDNE!Q#z~5ozRG??;^}xz@F}q zu$fhxapJw|cT^pp38HtumU39;VVG1OAJNggr)^YGnNFn&*==jLnlmf&wcvA6OPv)y zmrhKlEoZXtWg;=y*~-*}3;jb%)hA90uGjFmRt#CnDc(POK>NELGYfamZ7-qg+(g>Y z`T%Ztz%wazME^pKT^$de?7|YvNzxsZXrta19Z}LBlhwVV*LFbxAZK@?;xHCFx@=g_yGji5G%(DA`f9BVZ?5@^sgbuANPXD0Pb-GNJ97^NMO`xI(tYY z0zZaKAtEN40;K=6i?do01i*g-K^F?wfqJngJXZ35q*|U(M3)uCexH#A1f+m~3=qKG z3Irfl5HCm*2y_c%00;5n|5Px6yI?Djm`IEOV>7Kit|UWLY@G<5EQkEr<6LARLs)*d z#vxO})#U__ppG}7tvf|DF+@iWHi$X9TEQ^pkeH-g;TbbSvoK$i{I3&Fq>U0bWHXRY z&7o1!NPkZkVL)TcZyZfyQeX#He0o-N{8wf3qN#?=Iy7P7p+?@FZ}*wNu|v&`=y%*i zvNpF=z%d0KmT{AkoaNy(kI| zl~7MUG-omrym^dw08vV(Zn_IK{Gymto%oW2Z?Vcv2^Feo?Thy7C(}xAgMI>Eup*m^fxIs*y@Yq_0d5rSn%_~s zLR`ys?&gRY$Gdo11AN5~ZW$x{9&+(E-vr!pPyCr}Wu|5yUjO!bTf#)0VMS+PWv|`L zSyfVS%lBRO#d-W=6Pxge&+~JF0sI#8mbZaeoXvOHd26ppL@J3!7r(|yC9b>0=Mx=y z?|-!>Lq1ei?ImJBY=>skq-ITV(Jbw^SUp6e&9*5uD1XbXjJx3~VUxYHBDR8W1=K|i zS33U{TPU{U`GR=uX|29DQsOXDtlMk4wJi!^mbAWexQHnQT(w;vd=L1f**uy}!DBpEfS zh#{KkJqo}8SE-Dde;tFFAaE=7ym9YT%I`KftY?TPs!`UG)>!8cLh$qB`Dd=bjlZ-N zHY3f4M|vU?VWN$-+s#ICLg4T-=l2G+k@N*Cz*$R9#LW~Z?Poc2dHq`P&CwL=dD?3eeotz%@35w_5*Y)A0 zD|WwQw!sP*PvmAe@bmlxzsAq;23b$J!;3dZNRe*ovqd3C;*rU3LY2~%)!+&>o|F8k zDRwbhM&!nzvxHwz!`U6lOQFTd(Gpy8n36$ibJ>3%ApdMCKjPSENU0-3kBE^}CM^#!46tac0KBLeSMpG?>=O|-tSwni;~}rfRr86&*4gwbT=D zn!+r>l74RbU_v1)H)(cRLnPX^&}Kl77&^X<~qsoLO^%nBO1*exO5*8Sw|68c$`2JO*GMw?Xs5d z29PavT5!w*D0S!W!=#rXW(;v>X)%`8(6x~kgM`N}EBgU0qE$@qAhh>eM9Pz122ibr zXL)W(=E4|jfwF-EhFQ=jP7vDSZ$L%{7-(y%@Od<vacVoxfhk2S~y`pGr;hBa#7x_^1)<@0?cFAlmOub6CENPDt4kEzyQqniI=jXd2lrXLHqFzl`%jAe}j0Q62|s@ zboI47vK69$$B5AWSI3=U_Y_1bi^Jz0X#Wu^el?m_qE%(G=j z6}sshv9w~#HT7mDZyZlM+Zrz1TPQ5fyh&a&DTw)tm40L7

    GBp(Ss<(^r6hS5(fw zDW8wzbA>ofcXxp&^6N-{b+6frxs$#bqH+EW`BEfbEF{s$!J^%h8M7kzkcz;Awxh{X z8avCw*e|fascTylQACl(n~cZdP#1?x?Ku!{}kK#@pt8w{}_>&mGa&$&6G5Yew_(Kt=(N-Wen* zRHnH?fMn~T^zbGfehIaAfUR@H_6=AK@zcgLHu3f?08q`6!A9c2PvUcB`_Ohpm(jnD zsfcVqKzE!x#I2{u+fHU3f8E{`+iP{gL-f|$5C;Chq5uuuBpvWjVS=)|oMPXINkmi} zCriJ1&F|-Ug^HDSctILS$Y>_XAn6usJPLtddq8+e5roA< zIY5l%%?_VgtzSp@FZuT3cM>8=z2^m3`t>KI$4*g4eJ2YWM5V{PB&`T{_?V37_-*9i zoSwQBEi0#9-6hLj+^Xp(cBD}*>rFS@-QYZvD{YAzhdS&m`XK%8(()t9DF5pS32V|! zSXdo#OIbY9!5)He*v`KlZpT!Aw=M;Bo+q2>1{;q)Pu36K+?ReoJAD-Y*#tjp#t$=%P)Cl9**kwm8qW ztlg5*eZ6yDW9XQ0ye&2|#}X495c`J^95>~k9d9kT&*FmMJPnlZxjzt`oU>edvJvNz zEn!FEXEdYp6zVX?l%agfc@cKRo5JZaag`7&gk>pOhH0YCkWwkd4RWjIVD`&d6aNVi ztQ9|i0~{#Ob1IR|jB+6FZHU0@~J$eK1iR}L$d$QYy-Tv zNW){%P-#)UghB=6DZXOl(!)vx-bzb5+tQkR^v$Pm^w_CYf}6TkEC>6|qEgXTychO* zy$=?T=!4DH>-F>4e!P?SzzFlP7oWIcFEDUGH$Y7V6*z!iGWQrf!c}zx4YiZ*(wC{tPyyVKJ>qqx#V+N7&Av_-90b5!3PpPtg-A#hfO9v<6 zFAzei6L0&KDI6&3xR8rR4!F*>ZjTA^5HGVQ&fQ=uu4{4M(FEyw{~MN4N8FLwf!gGJ zW{?PV1aeaEmPd}Z)Wy2ev@&o{ zjWjp8 zZ1cJT{D_nJk3&Ba>ve5y-AZtcC=10+w__}hR^yADN-hMF!e7&WC&N)N%~kj<_zz5H zfVvQ=K~vC(p`ZZpcsvlh8eVWVk8I=L?RJPLDGFUiUfWKH1KBl5DPJTOOCrK!5m3dO z*7#Zc9t%S$!?zJ@2n_>tfPw{Q0}Qa7Wa;M;8MUL$nJH?wZdAW@BsYM+$Z|QT#HEL= z7Iryo?GQOFlhk)EEZhsGz^2Mw;EaGq6wfSWoLdWQD|Uokn1-Z(Y@D<3TL(3(`~Dm& zO*-)2*GX}MvOw7liQ4Z9-Ij%JO0`FW-E7;)b0EFxs(taIr41CfH`;W^=ojoM08d70 z)6O;p{bpvb>l*WHlRBIkzm@HXHZNQRMRzUOvVsCax-bS({GXhf#x>)-*ufsn34o5~PnHoz3ZeBTFbBp$rMVgrtWGyIfA+<%CiL;lyxAEAI~@icUCEU`FEj zQtqdZ<&r0~5h~qAAv8|Kkydo1gEMXbIkK^_WvnPz6FZ}Y=)wW~5;cbkt9Jc~P`JC3*x@prZx-gU%TA z5y0;9I-RW>Z2~1nP|V3{t4?&GoY_&qF|NsoU!NB1ibK`$te~}=n+uW1kevV)XRe8Rg4nAhtf&v%M5_hl zH8k6l7>cKy&bZd2?5L)_neKcC7LDf>(crL2H6 zxszVaY0FPY$Z(g;1KOjg4)C=W_8bo7Sk89JP`*R7vc^xP+QJ_JaRw0B?r#MHc8jAq zYS{Q1cD1hV!gik(+@$+O<`OJq&WMcSKxweUxuDKMbTw87xK3P^1Z&Kl)>Ka{MUmKI z%Mt0*1E;^&EF4vrWSrROIDCc2;6}}WE4c#&%TQ(lJ{C(6lCzmdr84;)Wh+0+Ur$eO zQO4WOKwJZ-6-1NfxlBroU`~5Hb&%sA!hsXEKog%$WD5Etf@Af;Z+LYPD0K>Ye6>Dp zMa{5{$ysXs+l4YFW~ZXumk0rY_X9ld0hCW(cyDqHHfI0r=AYtkfZn^><} za{Lx8dE5BOO&be`mL)6hig8J8C3JL^1y^v1L}eM7=ry@vjg7jE zfA0?)^xj|1bRdh$omP5(mLYqCD9nw{_^5JXU9iWl)^{6B39Wlo_eto$O*3upkI4Hz zd+?Qlhv1N9_D9O4i>Ze~U#qJAF`ICi3_awD#}v?L$-JH!A0?rI&J4 zMOs7&q;MvcplNbH{ykH-h7UlzwF)E8Tpoo)*cX#r2q8`(7)k)sO}`AAA_=i?6v2hs z2`lohUwW*;j*GNT!~h^kxDegqm8yD-lNwr&xxpl#_o={npcq1g_ej5@j3(|wB?ayJDf#i&~ z07%r1YiqBR-clDe(2{ipVaQ%QXCgu-zYGFv%0RH;yFmgNotf;y;)Yrr?0wz{Noof2 zVnw;JK^n@j2qG`(y(kVM6`T#+AT08owPR2fj2oB{GBH)wcwafSD6HjGemoIM%tua| z1rhHOX~BI5v=gC076rzUIAbUW}C)xyNlqDJ94LA<@agkinSK{qNDql7i? z3SZ~o7pmU8hTm9FHZMpKCk9Wz2zN}Y1fXid#QkI_)jL%|XdrjQb8yl+4*|i*{xxu> zwi(Ze3)G0n-GJ9D&dd${eol0bD6pa#!i(vaO}uNni3uYmaxDb2Eb%NK)fd^GQ6kN9 z(j_ktrUa{5ii^}>qY4}sFRRHgO3{4Bs>L3)e?&kk8~6WC{HZt0T*s2R))OW8aelTb25 zY>*z!rx4%@X-qw~guxuo* zXQMDwOtLem3lalaG!P_UnqZUlNJYT62yGl$x8UKVj55pZchSOVQG^keb!3POXvo;` zKzBQxdS0o}{z)i8f<6`u;1?^j%mqBnn_~Sq9pVZinzKEoBu^aKyUfRvo4k3M;V=PF| z$_aWxzpR@mB+(Sa;$ABP?!ys+l5f;a8JNY{#?i2$F~Nko?ga)pH^82cgzrAk`()tF zbyhr*Q{1=f7m?g-1qaWkaCE|LGTZns!HZp?9fas)Gm32T2&sD)0IR+pgnH@_@r3}j zw0C`@0AG563SRBGInb!5Ry>dp%pm|r0fq|{m#1#2mrzOI7~5K{*HEwI%7q-Fpu+ z!d8u?L`$_V_q_Tmuqn+#H3}=D3(XS=i$!tRf5{F~4FnPfv3FxZ7YSACjRr(7fpbr_ zZ60zIj{ha(Fge)@o2MZo{Mg~;K?NwwWz;8wX^XaB)0CGwagC)5UKUhMpjT@8;v&}Nu zILu0ni4`ahF+yJBB6A&;w~%ajDbH@mhz-U!O9#PrEZtQPze>(ZXH(yOd~nJc?Bx`b z5y-WTm<{x!Ci2Ku^$i>|h8W}YT|(`Pr^zuPrZ1P6Hbd4&8d_~;y)GL--bj*NTP^ak zx=q`Az&)1}(8oeW>4_={!|MA|XaelKnTB5|;?h~QtoGu1RR!myQOOfE8aDV>GL+(# zf+N*E8oT|~>TQ+;JK^zha<_h)OF=nczu&tANKnD?6TFq8aY-U^vJ7P%l@VA3zTMT0 z%Bsa+!C@Rx%ziw~=YNIE8QM(BzhH+X$o&pELEL(A28b1F%?Od1U_@Y+Q;w9}%dVd# zlcEZO1Tj^HJmt_U3i{H~Gbz%GOHLh`b3o9`Kz-ph*>&`B&}SMtCFHpZ_rHB!TdlLN z9wH{q<2lvzV;<&-13puj>j&hyi)9kWbuudzB=^B4r5_0tCFsgs4}9fSZQIRk`!^P4 zqE~Tay{j5 zLBBn)xPxhd8}g;51nCUPl-S!>76&o-?2d~XVFtsk+#unA!H-Qi>R0O}_biphujIM) zA@)Y=sQ70XIPLuOO`RpQ3mT(5#w|L#?Eubqfjl&)b8{R`^S3WNpbqeuT-!BnM6<_! z?VyuZ@?eJ+vX6 z-5uWSme^gg6}GF}2gPRXNuH3e3mnm^x@VvF{(14OIZ$y!&c&f_diQ zmLrbfq|%Bthd30c{-_)yN+vU#y1sckD}iS>j+qdiZmEqGO`+TbOSb{Tlq_VbyltB_B-&aJjG&@f&>Q- z@E9+McFqs#GmLOPcpN9=`6YdClCMvNeSFhpxv{gz2en%s*(M0PD#jSZ7-q205LLl7 zT*EaSnIjx8>- zqj1_2NZvqC)&mKxPRd6S*oq(b2__dWaL9Px_znR+d7oDuo4*j-+PRPK1_U(aq2hj) z?hlMemhA{Xf2&#EjxfRt7Hp)-49?uMl&Z)`se2v38L-?ZnWM&N? zW1Rhbo@4ZRLs6s`h+JFb^8&6JXQ}(gYBO`Sy=)&MPn5wvd1w7>BGZTqd76fyFfUQ z;xIs zQ$Qt!O`raTNvX2ET?Lvq%cctL?h76cwc5%o8l!>Vkdiv0G)WN*Ltrz`DU~8)Nt_Sk zVH*m??%NO7T`h7XV1J|2e9QT2N#i04T((ArIt43xWHEIx`;;>-U#C*2c%dk_A_|FD zrRXd(T!hSQ9Qzw{Od%pwQ8GJ!UjzKDBa{jt@#KEO z<+#^%J1P>O_Y+Tr)}7*^V&RP{i0tBb&9})>!j4=PN2D-Pl9cFQWbf=KI5g`wLvU<4 zp1YXiZhAw%<31=0Z3|onUzqb%BZXG^FpDLq0Ie(Nl54CuXgSBZg1e>~@Qvof?$i5H zLHX3^ZK~~BeEaX@w~tMU(BBWOwFOS^U_eVk{0`k$``*KM&yOIQf7%k#*6hBB`ghw_ zHl1<)%e=L_W1(u~)`#*r^<2CImT7h(z{_a^DX-~zW@?>y~~Ty(5~AkQdZa|)fd zUH~1Ii9JXPlPs@u`HuqO6VXGG1M0HK~eL37p))h>>= z9AR>~!cZo&kQxVxV;F4qwM|g&z>FRnt~p?G+=vxfUgxqcuOkF`t1`yz`ZcM*V@E#T zY^tlV((z$BLDY8OV_PmkiM= zz`UuOKJfWVw6dB6FPE5ca?l%kPp*P_oM*?bh`kp(IHA3|!3{^ttK#6$+E4Y&G{3t3 zc2jPeCab%qFKbb=GO?aE-|RDCwsZ3~poE~*R@5(b+r)*C`yD2M)Qpl>0pvnK6YRM4mkT@iaLp*n~M9P#qVay7>7tNtBB~^`gNxOQ%3KAbQ1g z5iM9Xi7KQ<1(9p9US94$Tn2^>c8IMa2I0fmEN-xW0gbY}7I`5oOds>`0D; z!X4?m$o`#)gG~nIGNGj?_EA0e_%`&Xq6QwypG4QFn%KNRwwno3T<7~<^&iT2w z{l@?KONVKj0s2T#sn&fS(tnm5-8N|+xth`RL~lt#ieBo{h5XG1E0M1C-cwlQd6@(} zKR!YYMYT1Qf3{b}Z&8LS{SblSEC zG$g@hTy-CaDYNJhe#qX96i>u=yT%jaRM)~$u=VyfJ9JwQNF_TO_99k#e*z;Q{Mncg}`4v()W3N5yrrurf%Qj z1HS%>bhJi((z$c&%l_XFVJDxXbZOb)^o5~Qj|?Ld9#{^q1QJgx;wK(C=>UKuGHmcg zxFu4awP;F)S*TOile-$sCrKisGYtA=HJzT>Q+W!bLqg_wECrCQpk8p2MJ`a*UgJiHxQf!)JtETQ zFA8)*)fT&}fPZsW^3mnOw~ye&ieSNlCDx^E)XJ4#$!ob&Ia6WM!cy?=Q?xdxC2i%I z;oOzAhIy3S>F%AB@TJ#zqXaGYDkxj$E_Z)Z+D&&x#CzF9-Z%~GQr##O(Xo(eauPuh zoFbqWTK>XDBmvm0X(bKcF9ROOvK|h)VZuxh%M@f#5g$MfP);W2j41Z1z#;l zR4MQtE@fotM;O?e4#Oyl<@*k%M zVLJwpEcBNypn={T{&$PEZ{b$9~l*Ojd4q(Q~i)M{NY|0xsht$-xFpZaj zB3(wSba_;tOSc7KlZ>~1o|BTy<<#lbg38TZ@+G11LQFEB5<2kEV~P8xpG`!EKe8nVw%v>&oH&H{ee>jV59=qfh@mzsG_p+z=>62h0hN+B8BjDM#{dYw z2H^kUp#p)6&Zm;(j0P|}BhXE&=`)Hn66$G5B^XGv#gfD-VUEZKf)XeKdnH0C2$GcK zIRNZ&r0pzWxr7iI%h<4bxgzfD%mx!hqOHe-UAq@2tVQWDjnIMviiEwm-zIEQ6VO&5 z_QCj3!}tv-Hf&+oHDJ7A46$NX7Ar@sk$WH-7bA0v6_Qv*XJMTsqxMR%T6T`+JhnHL zts+ieV-P3inDmB%Pgxgn&!}JrdHzQ8V3?*AP^^NY8L`Fz)1Nw_;savZ4TL^qw{HX} zsB;8Hkb?$cx8&>GFcOeKM`$@{5|yDwnb*+NLl!Wo9pPSk8FYv=TUnN*d4A-arMyHn zY+662Dk;xsMPxdkJmm(%Cf{ue}^91vq4Jqf_pZ^io-~_AJxBJ{mDobTZ>o-kSz;2000yy0T*C;fL0tN z3c5*r(6_;}9-M{pd`e3U{HQKtVj{L->s-FSZe<{Zgs#+}9#T~>nNrVSX@m^~IWyRY z_ql2^ef~AV6|1d1n@HHA#-|o0pLID+&rCe{XVC_Ryr!~bCpFTY&Ur9zW=&NkbZ-ldkqq+pm%7GMXPHKZRksnoa)68eb->S47VUjQsW_YhFr4w7E^usCTm$p8w^txY`){j7z(#bz8mMa7@7=TQs3Tb&L zBNY%?i)N5+S!I#S`pUyr)JqGavhGrL8k;wm+fXvzX%S`%BNurDKASUb=p5kkt=LZ5 z3^X1vPm?1Etr;HqUrNX*ON{A=O`U4S)<%X04P!d9(?K4KrlgCNsw(|Qj@yh^fbXrq z(F9d9f!$w>aCnqR!sg6T#ywgN;HFw^(`D?@-Q~6iI-yo9(T0kjnNXrH?Npgvya%v5 zRs8O6Ew2*gpFC)U9EG7{V133NP=zWhAp6!#p}^7nAR#YdB@Z@D#YbzvqgQjlw_w?J ztTrR=QjU{0^ENj(AZ#$}C9=hU10#$BBNhRjg{{>| z{G(=iZmW8rQAGq2eV&`oW|PxHPC5Am8}%gsbuop@n0wubL+MPOtw&0g&qSTW;QW*d zE4jX(uJ!shDOgP3=ZQRpII0qYIxkxW`{0g5Z04|{@+`a{TSMYkF~o*rTY(-8zJg`! zA`d?h3YG?tfs};E$fOv|@R@)p#!~bZHy9RmV;ox{1QQ9AAfhQ47XvaQiy_mMKH?kw z^n@iiBI$7Khj4y28#%84{ zIVqzo)LkRWvvEpIFQuTLy1jiIQh~RwBccsGas%FqW{EFh+uUqh`MGE&&sTYGQaUSy zP;)!!$>BKjV@|A#tYq@bJ*%H*er3f9v^q^Wqru1^CrOVOsjB5_4lWJ6Dd-U9pl{ws zm!F4J5=fW>AqD!Or1kj9K=N?E(N1U_OEvk)m+JqqG?9VRJ^OUvg87ob3(QCpCcPrY zjEF;JiReqD6n@FbjoAt7M5@1k&1e>VGiYk-6o8W#>mVUMD7D9q+-s$=(>!q4?MBvp zY>Mrn^Qj}cgJ@UHv-HkIELW`Mvm%``R5YM`dT#{q+q{LIpjj;QWK>VMMawnR#x|Vq z9p}kuJu?l;o-PTe+hgNs?w$-ph~;bSph%}l1yEj4BCSFv;5NK2wqyG)Vk{D+vIN*O+HMG3{8sjzjJjJsNSIW~0lkCb;MM5mhZ|O-PMs($M3wX$oQMStB zJ63}#oK+o$6pv$_EN4Uts;)Q^qLqh4b;3U@Xucd}{TV62^1PmCQo9E}vTX2ebYJgk^wg$MVP;3B}AQ;`{rJK|XbCnl0WXo_ z)SYlajF=O*3AsUTkZT9~{sk?f4qiiqSiWQt#iu&*erU4MJSJ~C6UhmjcO3RjZ&4xm z>-ZDg4uwKhNAiB1Vd`a=zs2@XNpVf;zee*x54zfC2u_r~3@0{k3ojv%B@q$V3TTRR z5Q*E0D=8FTV?VMt5G@u(2%0U`%m9ID_w!zS9UoZICBwzo^P!ij&^aEy6X=9v8C?Y3UN$hX|Xg@SE7A|3coT> ziLK=BVFx>Im%UN}sohCBzV1;(*K9lVEIEN1^r!$vbobCeBN*ssbt$L*S=U}ttu4nJ zD-iqj$VQLzjIs7R0qN6MvYXcr>uoJz%=-flA2G@MRJfeT<86O>ecKym3+TRo)g8^g z8vg=W-n(BxIn-XM36!2#8hh;S;ZP3)W3m2n9@nk1?~|Eeu+j+=_uvb>b&Wa?kn50G z%5F}r@qrGpO^386(Nn5jdOXqefDb1}*eH?fpp+lGRi}NYyJCgPLzrlYuW@8`X?~BE zrF^5q&WRo3cI-#VmXf4QV{L(Zyx@LE0e9|y9!f4DY4hDB5LvtO8PoHf6)fqIrOaf^ z#DdgQv4*$9(Rj+8X_VjxJTPD`9m%PI8%;?#fZU%bsI<|PM*9;jp_S0m*p9re9OP~% zjXj>Sl`wW2uY!7CkGj0emLq)(yoZd#K~$(>XV5ptK`KPeF<(=2j1nOib#6s5W(-@b z{Gftm_hhh!wJ;2T19t@2OX~BZ?+ot7>VX1fsHJnIlD%o_qal;QJ2DqeIt59joxzmn zt}5jY2DqcOysQ$IrW-Db@n6d19LpsZG}+K@$}(I zP}-GzJi-D&3u_>$Mq2Pm=)X1z`k(%N^@wu^}iyussJs}4ggxfq@cFyJut&6 zAe<`zjq8R}mI9?dr#WQtM2BckqiH3VMBB4GoSuEjp+8T`50<^0c7r*%`$7eRNmxES zD-d1fpWs=&BTA*T>Nv08{eDZ4KCC$FKQ!EZRErLYVlM1{P6{vs&fS}-u1ViCh3{O; z&%=?4Wr$#ig;anPO$k`6pn;4=p=k%4f}sqRIAZFyZ^kEcC#-E(W|MYD7@0QH7+%Ue zg}?+~)e^in(M1wQM>=sA_K?8CwDsA;b!)MMfS?l+7jFPLnY{> zv0WXfG)C`PttWq6*z}kfXW}pU9_tVxy2C+|r2{ZHHr;UeP34;K(7t*>ZEtQ~b-4_t zy$B_D)=hLSDvEI#FHA2+`H-am>q4eD$6+rgAlKhR3?J&mSQFM?cnV z=;(jeP8kP0fh;n=i5Nf{h!`I&bg zM0p51WlPu<+rqBNwjo#&?Sg6F(>}F2a)VwB7p}EI z29G?O1JsvPUvrDD1(m9YySnj|1;wNCU%QMDEp*Vs04Eq>f+^;ae?$MmJX}>3UsfXN zA2kHeaD7_u$XB)a4(NF;FimhPe7WF+hSf=>9rw$4;S_EPhs}>Z;j43?TR0W>ALKfr~)ha^Bx} zm)p}?yNnPmbRvNRoaOLU86HN~f|-pvCW%xTXp?mHZfN6ymo!KbM`;&4Y(}iZ!N&s^ zBxJN2tQ&yG_VF|W7;)=W!zd1vBRp=svuJ>Oc37Cc>o8&&ODu!tF!#t_>emBo6m^*w zHRV*F_Nop$KuVEcrYd3V&tIzGDrJ{qVY--%qbiJ-6i-ZEm6?k73)d6ut$tIhz3Mkr zF+jA4R|j}JXIlqreb#C&AoTH~S8y{i(8Z&vRDm$B@DLzxOhfdDt)W%A=<)xraJBIA zPOrw5jVx>5aR^#C;)o4w@W%AaZcqa<=r&(rR=VX*FC$o_c*ZW-Yf&#CMl^)9tu3Tb z@kh-)>wdA&f?71AK>oM1`^`ix@r;x_MYNt4F3@kj%(kJn_7g8{nJ6(&%;|4*G-WRR}c4?sfXA z2Qv;0t_WOCO?AOt96J!PU|+lTpW>S&#GzHFbb~XAj{3I}C9sc9o$+#Zloei@qQj;(|0})g9dCnYe<^@SnKbSqPH}W!qrZ=A{0HV+xpZt@g zVbqTI%r*Q*FGoHFPY*1d5qn~+qf@$zHN<8p;d!?7l#x)w0o`pqvc9CF=}%*-zj+u# zwD3@Gv+omoK(Nk`e5{9<8;xcktk$vI@?hMlJS%CKAv@EB8|#8J6Kmky?664gRoE3A)jDv6TNs3w5(nbE^d>a zC3fer!037`Qvi5RAp1`!PgOgLe$zW?R;PLwh)T8h6(UNt2eZT7h;Mz&h!LYk+qG8* zycRC@#5@_-r`)2FIY2jd1vGH-XdmUd0|*Eho(SX80SwQ+baut~Rb9G}erJt=uTK~w zOfbb93tZp|H<5i=^`p?sHv@vvgyE9mOWEGSh3j;Ytt)JU z+Ny_RFu{en3Rgf#EY9?KE^vjLmb|Vv;?~r+O)z1?gn4Wt z&YCfk@V!ol4tf~iWH2&e5V`yWUY=Y)cw9z^7CPu*fD?=`Ib`3n+1(;SD{UK}t~p!V z)^KGGDB;9E!srh56JxYPZ+XkSUDpKgk=LTWj56!!H)vDEXsFC$Hl52A0&rAC?xXQW zr_Naih?J?mUE?&@&kQl!ik2}e;?qW9Y_fZsAni#v1|(%1zM0@ixYG=!RVu?%y27{W z#5ZWEL;`_3Ym{hP*iD!Z7Cf-Tbi!L9iKKf9eOG~yMHX3Pku`nSTQkX}@!~Tgx8j?? ziTqqqN!m?>XPd0+7Mko*cVW)m_Xnj=m~(ggYesU~2K5k(n7;cF%7f{kY)R-oN|D8O z)DDMP(gCqU5Ji#)vrg|@VP=Gm3)FK2icuQ|H1D>ex~PvCLyQmcB0x$}0&Me}D2j)z zY1TZ`jqF;=ej_W9pEDTQF-}MF=}Egglu)vbo*T@djs(kt9r|t~+f4ra$yq5E6Z?a( zor%HG%GIev#j1oTmvT*IP0|vhZH0zi z9gXq1lcZ3qcnlp`p z$&immVhl^{Y@voTO~YDH-I*{C)WkLVp}&t$V~rGyV3J~~eG1HbiE zVsGdm9@-H!-Q%!mqd_Ca<}^s`E{!iZfp^8b8#e*cf82Q9rrmx7B=WuyT#>JtywscA z$T(T*Ar)1Mk%nk>5ol2oN({EIZi7DG@Zi8%18kSV>2|~+|5eNxf2yNPoIHJ`b!mEe zYTSS*Hoq#Xhva}TK=fs^W-vEnLyqvKRDqyNRlqCARPbIsC@=5vC@$Lu>J^Z@R-|#! zP1{N)>+-a!`;u1}KI){{LMm;(a8n|FVGV2U0m2v_g5lZ%YqkTh8@JxP$37u3>~LJG zr8I0cULFF0Yz{KeY}2uf0gb&z4%rOXh%2S>4N5`@dD2nLCeyY!R%0gr4(Jj2k86J& z8iBiaY9{om+-PQx;JNZS<3fVftL;}YBU>P4s!6%k+^GFs@MhryhZOj2@` z#(B;~S(t|4R#PAs>-&-JH1mK4t>1^X4M$@lbku$Lzz*r19f&1=dPQ$;d+HOOk&(Vn zc6-;Yo|dP27lT3bP!9q4tO7#Y4Stp=^@ShS-y@3<^loe~iN5VvVbt%=@@P_yR(F}Q znuw7fn^yU~WmK>yVEhp{rXGXF;xw;39G(h8LY`hh zN`vww<(<15Hf>M2s}7yg;x1w9-vWQ?J=|5^t28cEp*Vs04Eq>f+^-$ z-~v~;QISEq$O^_lZH`?G)R?!1y}8cee$Y<{ygwQ@2_w;EE%*O4nU2qczNXx=49@W zjlAUfhMBSZBaHX}2kyWdj8UJ7#%V1!%DiMKUcnpQy;Y?{Yx#HJ9v|y|9ks`Z8jL^* z1h+DC?;73k_(l|PcFw8?H^#!4pKS{X==9s<&0WF<~66Q2ACsGksz zY*>9BP6HTcsomGRy!)Pvs z4zh>a1O;A_J)Ao^ATcXlu32_g;dypxH<3OgJyzx&zO~h)t`7Ma{$K~|vpJ9awpl_F z3HqE1_tTQ(Uj*X65HBMFLI7u;lEVt+H{=Wh4SS^3VX=k(jT`n zeeJvEEA`x7arOY6neWpV@voU4QGQ|-EKQjGZ4o{t;HnWyC< z$Sui?n^u7@952y#BE93eF$J8-kQ~)OtT`UwH0Vq(!h;3`^7Kdj6aaQN> z5?a})ne9@qrG0@k?z)si>!x|wk+0Z}^AgvR)et=rjOkcR1vnUNCldrhg*DK1o{^gt z6yRT5>t2!n_%Fl|dB6U2ItD};-b_N)h@Tbdg?)y>-13RdiM?$NHu1&G(?hz;$^x#sj zRktB0q%67Q#p9g2D-{Pt20OoIod%4WHt)P^)7-Tvx8FS;@QCmDzNh?X!B4L#&L`Gh zTIi91TTn!ggp<;ibJ=*QaDK!iC#oI{4Wv!4VW-SlamC9+z^scK>o02ZuHyIoR&DsM z0)zmC2^f1k?4RvOiW}|0*OapbL-%o#2ls5P@QFTHG<%bj#SQlNnszM)Yqc8;F#yj9 z>DGWpB>~-M+^i1ewU3O^1py)c@&p~=`>7RfxC? z$*Ijf&vpd^sV^S33bS7Lff&x^1Asv!JeP^RcFJiw(-($|NU9!gnof+RJ88q6W#h(s zw3A*k=s5p!5}b1vtqr5nlSP;@NE`!2g6QVH!5 z)8ybz3mXm9Ach0&G8M18HGk^`ytwPVQ_`$aCWW-_WIPdUL>ws`P)FmA17xIe=F2@T z;ive(ilj0%IOsaf6Ya5^(Nq=Be8jl^r_QvVN0(Ul;Q1ZTeRBa}W*2ZFlSTE^-yLP{;c!3ZB}MR7UcIrY}Eifkq#d zULmA|oCGk3#|<`It7B>5)DM?*#3h+Vd0rxFO+yMnHB@qpMD999ZTAi$5|a69$Gt9` zSVuS^>;-ru^jz&C&*SAiCgda;HnOvr2UQ^9RJyU)l)aL(KWW216*gP;3jv!OJ!qbIcP`e_keHg_LwTu9ndXO zvIo)8c-Dlseoq{_(E9NQt>|?K!T(Z89H@V%W8`1RLUXMoe zaysMusn_1#G@>fENUPeW{7v7^h~;ha#sN_?K-_BjYg_Be9E=-Vdtob4xt#A+71+!V z@EQuXk64={MkMg&99U#dHOk($0ZtjLk(#WejKe03X8B{uOT&5px}F}cU4FG}IX$Ij zhOdeQ;ycT3G>Vss!SuoRRSoX{q3pn9tkQbEZyjwTLEgw$WC2+7=#d+2esPJb07*c$ zzb*jZnK|75zf=r41wT*)a{N8}G4se=c>jy&?_4#w7UUg`tTq(068T_B9K=ut=*%e< zz;XDl#mp{;cT9?xWeI)a>L=t~9KgvXR;+fBhj9#Y%)$h+VRWoM>e0rsQ}Ha}b38AO zok3@yibY(+3+Coen-A6`J+2K^&-iNy^+E-e80b{L3nK^by$6zcW8x!0K)Ug~sS+sH zV<;HvS;%4)|1>8qnkEEQ$aEowm2D-0{<&KEt0IE_Kxg~s3pLFhA&$d50-GJq%gVK8 zG8+3cEDbT>Zvj3u0pY;xC|tz^Wx=TyvSZma5Z>j^8t#5qQf=<)HO^I|%=k@bpEuEN zQS9D}I#_05GE>l8OwfW4#^*P|mNs!wa!zViKRQ9OeQi_5jEld*G8t8O@0gYfc@!d{ zI7G6@^fuFu3!rdd3*K~c0Rk6?e+NbpXfT0pL8Re`4BZbvB|2IG)Y;sUFLGf?GN0E&ZP#44a(GTY|IL&Qc_*EeAN6+d^%N4FlD0+K9&S(jjM5Dlzk!v9@7vnFe zxCSNPc=(b&CK6|6gbMtIXB+{sF3y(62HhF**)>MZ-W9;?=%h0``N%m@W3279k)ab% zxWpU7C*i(VV|$ciO6vvaH|PFIhjr3|>n29DfmMkp;_ostgHRwrMH5)gvw9e>H&9$P zNpEW&JfGd4uOAdf24Zs^(WMeHxs%+5axROaG24@r>Xw3*K|)yS>rzK5jlN;6bW)_4 z5jZEr)i(*_BpbV%X4GDK%Y9l{L-9s5ydM<8DO-$s8eqNk`eV%IPP!XL0oyVnBN113 zMTYXmcxyv2z=xF@nzU#~pp~T^skdZKCrs)!&QRL;-+GZ%#=ento#@A@}uR6&o_y;t?Bjl{`PVP(e_{PSsbd%QLrC*65<^r^a#rO*&x?2VZ%iOi_a(c)&LbEF zinl95k-9lXSjsjY!P+tc0S`?`TZ$+2GZY*nXj>oCP_*2r;*>qEUdJ!KPk#fgjCIA+ z>g#yWws+``OOB?2(?&xQTyss+2Uxr-5a~SqFwd^RBfpUI}5{|k4{cxLKK2) z{e0kweVsRAEl{_1QzE)uw6q8@L7@LL3x@}VP4Zxj3b>~VlIY+HTC=jd;9%~IMC<>` z4e{sb=YIXgIA<-Zzzp?+0b9)z91Y0D?EwqBtfPcg3p1azf=!C9vzZ z?%G7}MdeJSy6OlP_h@aGe9GWwA*uL-I)<2W?Nx!Sk0heu>O*I*u<*A)DM{pl& zYuw1^KJ0~#0QaH4?J)x zOO{Du#P|VnbJr~w!m4zUif*oY!u9Ny<(0>vcP;Azk6b4LC$DOJLQIx+3p<02MfgT5 z2(YJa&(l%&A{mL=g45V>7w(+qbb^+UFnqZPE1Ruc^lSr#^U%l*0cqV*w46k>6o1)_ z)Wu1FS6i4o5zuJgF|h$7T~z(EoH4~*@K9nyL4KOF;{^7JTwiJPB0)UvIhL`#d!nNt zA^|GhD06wXTwnCU*+%sl{8is)pOH|oLuhlb%=|!~SzKI9?h+k1d z*2WgT#ZD>Z2T;I+gg}w(_`HB5CzVNpk!1`CJq19xq`K)(vgWiL5DK=;NC@rnPN@Yj z#e5G$B-;N-_*eI_t|5(}Fn1gFW{;n4y_5my5e zM&zf1`_7zIHR6U$!?BK`D|HuiaXJVgTPP{wO7q}2`>^%S zVvUYcU+HCl`a8Yrj2rj>pW(I=+7h2;D1(96h(d652nRS69U0{(j?74y776r6_$jU{ zr!X$S1$El+Bx4jM@eJ0)+k~%(OFy+qNoZ)6z#;T2N_v@8Y``qj#ZRd5MpjV3$y6=u z4@F7l*>sj**V-d9!A`TFP$U9w%rbL}eNQCj?)#N{r=kRyVqTJ0@@^!m>s2j_HrWA@ zS-f;XTF9Ulhhb6_E3J#1-^209R&gDSZZJN;XSlt>ZGqt-Bl6^cN~M|ME09b3+w_TI zs7K8$P&;#jYLcW3CCP)R7z;Y!ABYaEbEQ^laDk2v9b}cuRMGw`zX-@9x5>V%t@V=J z#(jiF-~EB24tBa(5ULbctF4gF2L4-A)>{5_v1sajMx>9~CI(efVx1OS2m)&v+ic^W z6?P3@LApZ(stwWFT9jN-BErqB3u30-B5p`8?mTHzD#2?9L>OXYO-e;L04tOm?ts3+YIh&wq}9IIY!75oz(^Lt-Yjc87Mz$3yrx=Zka(RX)x0)!6WFG zTZ@QId5%rY>AzOrpI+}d;kQPzEK4+3lX2Gm*hz-u44lgJGJE-4hE_-B1emXf|I!5u zQW{Yw+!%GO+NKFsLG-F>`&X4=T$CPq?t%MG~CY7w{LoO2HF4@ z`Kz(;V0Z&cYIrPoTfNJiTI5|L9PV!x{Boe%ATbsc z+$vfWxfOReZ@(w7T|EO4_e2@V1fJhYvgXQ{QGvdyNk9l#+na9{IXX1e_xG*(H{xyz zbc(G^kn}RogoZ;vj+qzk0Ie|LT4|= z65dXUSc7I(Wi|g^-JFKa2ll<*q>xNs(-um~zZ7SX!OKOIH@WyAT zSzrBHy;aE{3Zi#Qv4N=el})-|A3bJ$cHQ=f%9TfKEEwz!*?Zd=t0&NEP1`^qtms zS`Fo(c0uEmw$_Zxj=%%M)PPDHWMDd*qDpK8YmF0Y?o2ab&%w?kvp2p!_T+m$!P%1h z0m8e`f6#LxRb83;)Qc#I*Tze<&&FDQEhmbP@>6z1k!4S0Rj{k zh(k&$iMA5Zi(zc4i3RBNUNR%Z4ry9iERjU6I@h>-DPV)5K~57kk5jKFx=kJ?jPh)5 zZmBG3PMa}%YV-{*mf+un3X+qmaotW=Dd)z-*0R>}J*r>L5d<=h*iEN$Q|_TO6jD`4 zJ<3;3s!#-s?U22g*h!sZk&3OIUuo3oLi~i zaj#Tf!S9Zb=o{@9MKw=ZoR*L@mUt4wYF`LLW?bb4eX9-sfoP(&Jh|7@DSIvA?UhB% zpo{jv@3b`r^<&V=;uCTw~`66j#3g^y04!gBPQM8}(E{ zR0?}9-1A&GL9|5Va$DI*I3{1i_Fj=LM&?r98I?`uMx*AB*HAd3Gh*I^(rh8-ka=y( z&!%qUlG1nn#smqD@Yp$lHZ+9 z^5o+=_l$9J3nT(UrgFQL{8~0Pi^hJ~pS#Yr&X!dKU9G5Zaa0ds2clepKeXbHVc$Yq z`*O)8N*T5!D#>+pIYM91wYBn`Ti=n&M=Q-Aa+aLdugNai1$z|A9k|nCkl<7mTc@er zXmHNGU>C9)0fPHLx^2HX4`G{JaL2y}gpG*{V8yUxHKa0(-aK)i_Cjc`78XHbel@n^ z$4jM4Rn>7!F^GD{XyY7xE-FubE1vX-a1u{}d45TOJ<<<{$efY>W<9DFN5-egF*l2= zz8Co}|D8q>t5VAJ)bC=D1l$l6Zt5o}UiQz%|K`Set4SyV~S@lWxOmsM!fjmbs9v zuTHoy%tMEGU$4{1Jl5HPPPV&btsk?^&Zgb&XnA)lYjm~x)=;T|l&9Ab-Wfi< z8q3=hzd=H#U*d*c%LC965V_Va%v}u`@F{dDd~{DTkIo8C>;=jl0;65mpXY9zBN@+MjnsA6gp6YrcNQ&sWjvJ@y%%q&*zHz@9y^(P({m(IRcR^P@*{9He^2( zSWrf3F#$_itKN|{Yc5!G!J3L7^SpwRiRUk+Q|cnv#k3?;NoYEfljWG8(X4ABJ zqz#JUJN%lslN|_q$mD~t)A!^=`{88Bbzl0UT~*LbDZ+kK8$RpfvYj?Z{;M8Mvi5G% zejkk4?)b40`^@8>=3g5b3+?713i=lHOsRdr_QK*ISzWE>Kkzd)USvNE5TbqYv=*j{-c)MAZ--M6-%ad~uK;D~i7Xv6gKW6CkzpA(ZLN)#OlA~>4m zfy>Upd!6%-S#>>V=QzYTiqm6kT5TR@FyIp_#N|0Co{~)x4D4YOw~MPnu%zl{x9GCb zbbiQ_RK47vC!N;hYo3aG)iiY7WymWH4kGQ==+4fX$AX^-RSB)=%9$8f`MPnng5d6y zPH!3a^y;W{12(r2vEl3Vp-;O)PoB}*$rC2hJ>8@=2=ElZ3&l3ebc4mKFrTPdf;^qd zY4$9?06qgCbSOj8UX@GW3?wEpmEo8C2AXx*WK6H_ zrX-^_R*vpYd;-=1IHWUjs)(v2HY|S+S8D27nIg4jY*!ZO1;S{_PsJO@8tq@UKQ;RI z&w{##V%hmb#$EbeXdW3=>}DStxD3U5DcsXAsc0hN9$;g9Qs)kUvz(ro3K zPRL2q^f-`j68cV>(b?xsKHEhfB7tu>DH{jhRDN{%qxzInIa3X%U8_E37lW)VvN{uI z9)T5>mn+%uP^4!^hXEj^rzru2GzhlGmyb?RlH1fY?F0(Mj<132Eowj4X4GjHS1{z?);>@LLBZI9 zZ}DsS-6_OHtsK`=Jb40*nVsg>gKGb&vuf_!g`(51e3F_p2ryS}@rXyfu#nPqzR$P# zwdj>xCOIz#UM2dcw({ZZ8yZD^W|_a<>7{ywc`jhIn2NzdfJxiYW6q=i?84X@zTvln zIU%Cce(Z3jHLO58c}d`p-AZmzMl0Mny}dUd)H5%5R?ZG=*hvr%<|xI`_GXHeNyX7}_vTLF!L7@r3(4L7%d1=IVlA5WqKnby&9oiY;t*nBSsP$;uDn z^(WB1b8mGGcVhMnwbcaJDDEAWH*LGiu7p`_B(iePtPDJga%^H=>zVEyKAKcMG+YUE z%euZYUOEVb#$Jtr<5M5n7%+)&;YG|sRH%Rk?WSqIv@*k|V!Fb<6=S0wKo!X0L{9PVCj%3`@v%cnLI9@QB5h!~IL#1j(E1JYJG;8}W}SDurDgoaio;-nz< zV0+CE0u*6J41*2qFo-GZ5iUS!g?7l=Addme#m>URpF4J z=aagX1=xLne#$x{UqI2*@z`rKiXg-*NRtKZdmlPNm5dS%OLX-m6Apndcr=xDk7=$h z(B(o@;gvHxtynDEz2QJo+4wC#xBSfQf3Cw?uedNOfgwdA?a3Cf>O~D&l0A$--Ey&M z1sbHGz<$Ug+vl!6^n7aJLYwH8g*9gaxAas8?*z&$$}LdmlVOf}=NR76A#|n%40@E? zRUgC`lRIOW0lSJxR=1<97p7U%S&=#)35`3zF*zSQi7BYm&|wo*Cchl9MeIrb2ZrS= zDV7lxk~tJMM01B6^GN%)UAid=xl(5w%1Kt;2056^Od157Q#vJ%Bbwun4oky@gjulr3#%s|2 zOVn}eZMs0&XF?ieN?HgOXe=`=&s+$5}Qo(p%?UXNy%7OS%v@vrf9}qVo(%M>ZDp5*!@dLF~bjMNcZk%j`2@ zHOx5ztSp!b-ybw_@k;*=CQZCPZ01N0WxfQMr_9q?^dbXnEf&FCmmEAlARsK+K+kW^ z&v8_)spA4wLg>DdJ26iu8SkhCFbyw*A8ZC2P+bovu>`x zY~!qfx4E2q79>pR=zp5zsr6&Q8p~GRxAvh;x6ujL@dOtg$vI^zC?4mbi>f*o_sMl? z7?J7d`V_WRO4;4G{p8rQ*ub8wNgl47J3pc9H`B46Hmas>N9TfqvJi>SG(_Q(RPe2? zLtFI|Gy!2IJ}QX~jD3u;ie@|yMmbfM>DWc`$#&6hqy0Nyn&1+F6|GzBV;^O6DD(rk zxb~6KCUv2IUBL})ofYjPjoB_6>;i$7FdU_z8?=MOpTsl=CLWo9JF9P09|DpQ$R_B|=Z=o!|C%L!}2 z4o{gF8?HKK&wKV_Qk$)>Gj8Ame1_YHRGX=B7<^k$1ag9TB{F7jeSViMCKRtD8Dz4N zZE=ZvLw;tCCo7~AjZgSg^Yi+&N#CW{@Jna`mRr{mA%nU-_fX@%hWE`XJMrsagTd~v zjM@T%^JSrpC6x(La_G=T4G|UXhPjwj9|$^F?TEd>Xy|}P-Emr)5?fSHqBPpGtC-a+ zq)=|sTkCiPuGS;}*jtq|^zyK7fKvKzBr|32f-L8rx`*!r&SKrpd=ZADO+r}ZM?&f( zax^XMCB6t*OpLxs`AEag{Phvu+a?C&NCsPT7b}?fQFsPfy&Uvi+(-pMGEKCksdGWj zy27#{2lXf@SZhqWMcJln%Ni#LJtqo#T}s=AVn*qNvwgZawbsT!h0{Qn>6M{Ny+>s$ zNIIHeWU$&mE>5t(0t+lZt=n5@)U;BKoyN&%W3vX%{Pt(%K! zb#Gp+M|&j%9s@1!p#UZe1PHr?vg9m@?9P#ze^jox+95lNnZ@%qtC4D_Nd71?*`IG3 zeiMV+kC&JjWaRFkM1_f&{T@zhnZ1=r#gTO&t~NMzebn?+2)F$)k%4Su}%;3X#YTs!~;DUoo`a(cbqTBRWAL)dOq`d z7lV)+?fLm`4)b~!$&K#Z{y}n*^A}1S>h5CM2)~JYR0zT!stN3#S|QFU6RlKD0?D+? zUQn*x3RdWh-a`w2To;4{Dlz-TkqcZQ5AQwRsTVA8lyk_~j;}s9Pj$l6a`=5H;Gn)x zmDshcwm~1ox>>po-R($`R^M71@4A1h#i~G3nKhVBuos^=YI~`+XOctyeFaCY$6OwI zRJKv6-P-Cv-A1iu+$bdYxWlqr^DkFcpv8XN+;BkHsNr6#4@J&@393PzJco#EUvXW-Elfs<(dGR>?WIU>&GkPy4p_NLF z$WUrRV0)X&WO=bRH^X&bIVG?m1NIt3gK{wkl=S2yk8Cpn_?ko`% z7EP9uul1gA+J3tLY-{Tc?-P7a5D%~(iO)8Xei4-%vHKaaUM7=KT@dE)9UL#u39(vW zn-9<}Via_ph(SztA~YUwGCyI@|;N{muop&BbV@=SMYL@1rnc1)dCQMRLVym zmK#LDP^(N5@9HjME+;#Mz$HZBkgSZlo!G-bCN-R+L=xrHvhD$z#K+~H7Zk9GEtDdx zm586XK)x#azqpeNFu)T*s1vvC5U+@Uq?-xxMNbGz;eS{Kk1LIn?wiXcJha09ZD%Adys5x9f^LmlF-ksgMsT@ z_H(^BRoARtM+HspJK83Jj@o+2!M)_sknm2c6`fkb%%W~YRO`q}pbh`zFS{ytAcad^E-H3P&sF|8SvpYqc76kU3N6DBrv`6@?xlJFLE3|pP; zJzGJ8VWNH}JY>K#T#tRJ^6NV#ZF5C3`>SO6_9FGVSraW*!_7U(WGkkseh6jJhOMptbI>D zfEW;1AFN~l(mr4I>hq0f!71sSBa(OXnXP*x;ozm+gg}b)+T%}D=oy;YZB`^kBV{)a z-bi61L%%F)M_YtOYfb~=A<_^bLd3i%7W}j*(OXm)e^mGJb>oR?f~~f;$rjxziC!zq zgVER7IzjX+l>=SqY~&sAuf6IlX691zWEt9Q3nlknu(egwR80AWnAt)a+gMwLt);%a zlF}K3Xqo;7nBqqEQ}KtovVQZ#pH#F^$+JG1)t8i?j&EmYUQ}2Q`w}wF#t_@xre5mP z?E8nGROKQS=M?yZ8tLgAOou|tQ4*2&YWzSX zRJQE>+<)Ig+zF()=0f$PU)BIdHHoG#tXtYM%jwYA#8D`Z-7?@MQLHi^*v^`jS# zN2u>h<`2ZhcK%N#qSrk(!zbTK@3Qh$Y@P1vOM;C{2GngrqM$}00W8zyibsA%CR7^R zrkmj+CB^lntt{=wh2&5^mcZ2O9>{XzllFe0xK z<>h{u)QIQI3DIep_3_j>fY({fVA$Seu;$|0_?@oQvcC$@F`{S4Y;J5Rb@h?hfqke5 zW%XPIb*@Ug%4v%>i}}?UHuo=2gFo>0EwIXRkTcs3XYV+^Y51)*?9rfaT5Cx~=Iy4& zX4-+gO#`QBv@&UG111-d6vAdql9XXwzQyQflW^0KV&s5mlBAqrF9gfM>NT&gpC-pc z)CMmyN8z$<;51FEp4h$JLggA?zFo+h&^|Gt(PF!^Q}w{_NX3139);U|;N6M>y^03f zR2DRhx({2agjQ4kcIWf9bJIp316HRY{ec&*C3@p184A~yLZpgT4RBvYspx&K4rw@u zNS2gM$t?JkXJW)W37#wUsPvA*({O+;FwbL$&n{`{pa4Wuuq_LIP>I5}Oyv=X(*1QJ z83YR#rv0et1Y%^&^i8XN7Ehtg4<`fUT?oC9>O@LXHv(AtUDrvVZtplroAg~4+`p=7 zvO=4~D`%NM6ROgQ=_;L4#K5}BHwIRMvL@Qf7sAUc90?FT)T5O(n4~dlP(w8R_-GjCVk>>7p?9i z3)0RLDTJ6ta!GcS@iC9!*lJ2TR?-62W5|@u5)wbXbPC*+4n6n5pc?{vvh%t;NAkV3 zcfqH+#rFpce-U5UoB(sq4VJtH25lHPuhGiewUL{rNBv$Ml=vm)7{=ZnQU!jNXgJn_ zmM*55rQ&KSwMA*sJFvAN!!h9yxD9*%!<=;zMSz_tLxNyZ=}WRAM9f|cxL=1m@Ci&eHh-y7fR z;74r(3L_)q_pByzya;70Ly2>eSgIlLuShp%Dt{%0*rw*Nql5Db@_oq~Odt&s=7UljV&^Ci<2nPD z(U-jl()G>oQC|u zlDD{|)T7kDK#_=GcnG2q%fK;DrS zqTi*a1#%)Fh!7#d80(m^0d`50w&@u#{Md*OvXYltMD0k3K=Ley$RT%9!xO#Opy0l; zT-0|#tTVs(7jHOP?*`v8SRW42D`TVG*0{(bYjut?fKoMMajssUS($EE*dP+F*P~e{ zZ8(2jIJZYJOV!H8m`gjAEAmKQh(%A9+%`#mSo58IoM^GANir9!+vRYUok{|-=l~6E z+Un(lHkS}5@F6(RLI*uFaJ-*k1j0mB?%pj3?|k9;Yj`oLQuOYmGWZTRt``OZHPldZ zxFyM5NTcQt@qf}Cd)>3*&vcXW$Mm0w?hw51BMs_R&RlZPN89`5lD04l^||CazlA?acu|Zd zF*A%$m_^a2l!CjCG;XQKR%NxWfHO?Wb0O}3_oSOe`&CMG4c#`Rhjp*Ey-?;qTmOG`ZT0%XDoE|NtUu4iUIAygo>DJzO;g!MD9AG_6nqdd z$h>L8O|=9@8@akB3-}7xU#&+sskZ4Ko_YTYa!XcC$oJh`{G29@B6SYzE;Q{aH|{Vj|nxCF9c~-s4joPY$Nj zJykxK#@1lPM7TsP4RetPcA;UcE|z;{zKkQ8-)oHU7`p@<;qB87Jnr{~KF4Fy9v8d$ zW~pS~@*9ltF_w9n2c_W-s>YOne7`>BTygC26~CqZ5cyba=gYy{s#xOVJkRgcv+x{o z1d{_FZ&kz)*MMwjbvX#LEz%v(98>8nqE3j|X=edqK!OJICj#n-SnWXqep-48?Cd3> zjG>)>(Nt~HNF{q^0R1Yv1d2t0=mp{SPy6}?=bYz*3_;aV&47z$lK>URUdDYB5=ZzG zw-VJpDhH(phaL(R+wNGxuvv_HUXG1Wg(5%G?GW&+4)cw`;I8o3T&o7va(df#%xJ@P zf)`%oBJK6|u=?vw!)`uM01@n~DR=%QcAX?lIT;!K{`@g@>YRG5MPx==KkmQn))=G! zedVuxH1iW8q4v$$8luwve4F* z_-$X}E?YVzxMx(#cw zg)mM5;cZp}zxZdCS{nhQ?U|SnI-p^Hm$}*y;N=+=W$3O}-P9V~ygS;pmnU;|;Cnq`=*jmT@uze8?L{ z>GF^S>+MCFKrgTRRGjS~%WgPdWtjY%KYJ3rRX1yxliQYx2w4=?O zy-_TAOV)=3 zCeD_+nSsYyh2M?>GxvgW0nsT^oq~^yz1mX~Me2u?3__Ogh@qO~yz6%)MB@mOW;ZK0 zP6O(I+Hvz|0==&XIstElvb*i&fv7r)tT|GyFvLV%w4z@`4vI=@iKyZFhKT5Yh^Q}% z#VXrmo7#3bPeLxP${fXq z|9KDAv0>~Q-fK%>oJb0RSlK~^sTotkRL*7q3)%!-C0wXO2(y$B@E%>*m3D_Re$HTi zA2FBoRHLCj{n5bsXa#;h{i&oum`{gmRR7)+OgC`g)8c?%VqMKJ_7z|rCPfo*Y`=fg z?>;u(O}?vk66dqs)p&96Twd@zX$`~vqh2!|y1r|(GoR&3yCLR|T5O9Bt9kv{nu34c z_Rcl6Wx)D*7dZ0}-Qk{epry`xBBVvTGAL^uwpOJH#xJ6b?N^Ouqm%Amk@rVgQV~6t zP2KV7VzbeYo?7&bC5N-er+rtQ>`Ab=;>s98r*RnLMYCE4U6Y4Qq?^fw*J9;a&yE)o zqfL8W=hmWTv)DF})Pr*wky+%tu%W0kSDyPt5v@{D@;}G%N~@M`cM(S%am4K>iqbV8 z@K(fN3p@2+JVoZZij3fLtJSO$T*I0t*x9J3o2jqQ_E-NEm-lb^kBxVW@2kCl)&@%} z$on+NY7U}rub2l#=(P(`3|CiY|AOj8kdmw$KA=yApyxF9t8K7K*5(Ez(Ja{SF=U`QlzHkeDWbOEm zEw1r8MwTP=lo6M`J?#hfE4GwB?Wh_@ z79DH9h7WnL!YB-K-0-?kp$#F!3ap=8_BwXwn2h^-y6kAyJ<gGQ=44ds#9%w%}>k>U~42q|fc90j>_6I9ry0yVC4bi^Kd}yUO4oCot~7 zy=DO5Ekv0oF`B!&j6e~hkw)P zEPWhPfBSpHqAM?hdBgrlu}!XSm7`dH4|`&gY1PrJUXNYa+unXQE}_x2^PLZC14CW9 zwq1}(Dge=b++waxU<@xVtj1*-2Ge<;^DY8ieZdtzKnl)pu~ z5gEW;a{P4#k&?RC9gy2z%PW*5z8R4Om>}vcvxq0`SOA(u;OAhe-_S{T*xmIgSMGYR zABQU*D;m&sRDy`t@@`Ev{(ne4`BN)m&g%14Y-;Dyb4lJaaZss+<@G9T;xWCB5D8n# ziImf29iT6x#LRLc1!Or+TanU4l2dMQ6S8oy^K&J|QP&;N(3F!3;5ym1qLni;2^8~U zn6Z`%il&q|SS^0=CqS+qCNaRW9HjPeI(CoEtAyAelAz?3Sf$rdr!&g3hVQObhEpI* zk|3bo!n?WD115D>d5XcssGqG*OofW7;wX8ml4}C+W{wXp^^QpI6|JgVQO9Dd{JG{8 zmDGggC=6Bt$IEd_R%h$cswFeWa;5G2lawC%ZX#fyh_1PoXG^d=8(`Jmk&& zU3&=X)6jZ*S8?Fo287;)>W<7Z|3>d!slwl}|4(4?&C@Iah7)`z$!HW?QR~B!Ao^@k z)rO7uo4yQVz+(9tn;_#eOzny)(4!Yfee9X~;dAXrW*@Csd+v)4&CX1bl<%fY zJ{+aS0br9?<;>S{+GxI!l$e(F54;zP)A_;#6HFMpWt7kv;})SD3^1I?#Ep%um9&)4 zUa|)fP~EjWrU|_1==^4ME2|sx`y{_O|I&^Q5JDEm<%xNsEyyg{bT0?)hQ_XiaowPs z_#!88)|=Ch&@Xedab!^VC_LBa5)+M@Dq-qwx%=A73C^dD7IN0B&TM~3v3nvvV0?qw zk#K4EXY<3o`JQ%7DDMNvLy9oPOeZ8?rUFDrYOI&F0a_-w8x6MK1dmVRbdy!k2`kYA ziJO80N4ZSn?T~IGDU!tfHsbr*nXA;XOF?dsKP(AnJ_n5a`S!cy7bm2$m1ytSsQ9|w zh<#MHiYk&uMmrASXvDb;*fCA-KDPdFZdK9U1G310hlC|ugrCT1H|xkO=}F+LwjD@` zfuuD*E9sC;MVBFB$xBAfWuW}=?y2vdv!fy!?KsY!dU1No9ZIkKXSYl}FtF%{5s2Sc zlrSzWG7KW;`}7Yp_+*I&Ia%&r?dN}yZbh}_jJ6kVJpd-E4_kct>A*AZ@+l?`R>@tZ z>{vzU+wa8!S(oZmH@$ZeLsT5=8C=NaCq&7bM^1Gd)7hDzeUbU4LQZqZ>Ik5xIp-h& zqJzt^VoZ}WTiQ4_hl7`Y2E9#fyTr#5jLh^MPy=MhuweO!F;^!R8?8rzda~IIw@}al z?C3mmlrop*}5#I8PTVNj?9TGY2ncu#wNSeTktsgf=g50b2!*L z$cNybdjgLR9>t@9Fde;$!>J5A&CUlseW@16c2S`${y{1sOe&nFeRudESI@jL|mk5+-#_u*1C!y!ilF^z5_;_Nym)EnEyjGjvP*j7w~_lLs62KT`<}^poJplPITe3k@O^jQ5$?r^1`(o`uNU<}9rc$s{VnvxV8yJsL?ci^g)08iqKc(~ zJiR67DYlzy_sA?y)PrR#_m=Vc3Ab`AW7!jLua(EWp9c)Z)rMJ9d(%Dv23XUoEosC5 zS?7@=olNis5r$^m<4kD@yg`Ja8M}31K3D*<8{?vn6pnEwI`{)0{=lDg*4bihYa6ka zgym=&!h!|M{n5rhhUb2Pv#VKz8I>yBf1h|G|d-kwu&(;vF} zz1P|Ncg%0Emxg9v`K~qrt=1NcejjOCF2qTi3?GwGa%~m&#T5G{ba#VvGly9Ko{adpXLDD z{eTdHq|OoEo2V>Az$%o+i;D9kdu;T`WJc@e+onWT$x$9_zM5&)ZQ+n`$YtI;`&tXe z!bj=UkIugmbWmmDwnQnfw>lGDD5)-vI?sxB(?Iv`Y~>R41lw&3gdr;1?`^46tl`5U zenDYVU~S$IqT@skmgn(a_;Rnbdq#)Mg)5>SGj_tJgw;cx(IuL7$QZygCNr%UO`NyA z#xq9e2G_>07s@)F&1vb`;D-UbU;T`Hv*YVK z$GlZMGq*1F(l$Dq8B3#(ry`t3AH(HvvtT`Gu8mkWI&*71SLsc?kVM;+S4FVyon4Ev z^TX^#OZYJdFyk4_am`zys*F_`2`=0%9a-Mm!zvFr9y~?Koh`_k-;6OY=PvzSd6*8p z4pXIQ2&c1?92)p2FnS;ng^ZGqtKE`M@~IqM_hqx;xW4VZEW_9p$!i!1m-KD2YN%4L zUWJmBCd(|N6v~{3cF>ZEc6366WaAH1FM!}B5uhVzRt&wD2rlo6=qR_)p~ay94^)W^ z$qj#0VxR!JZAkhGDO|?X8 z%o?i}KYJXSBbfM5_`DGOd&*-fdDm{6tVIb#Sm4W;)XnHr)+^Qd+AS;wRQyUnQ8I&q zlrI_}6;<@#J-wb#B$J6jC;633l>SjEhivJhzXqIoC;kA@QvwG8bB+lbGG1=0pJ0m2 zs8Ue>HL0H-?EBz$i@j1A_LEV6`BMpLQG6t#oHc(^cZO&MG28uSPSvNk%x3}vDmk24 z<>vI(9nm3yR6_8vx#KaY)PIqG?}bEy&in@c&tFX6f%l;r*r?4!uN8*u#~24dglJ6J zYMB^hRUqpGswGb8eNzuHPLAn=-U4LUB>48cKblCIOT!UEum&GEjeOJCK5WBSoYu#C zeh#IrEaGd0$^^a9kth{t7mJvR9S>H}o1n8+IkK4YUc5 zE4?5kAUiD;sStxc)T=`OrWYN3jsUO==t(2@1k2{zTTP!O*(wG1C(xLZ`7OXpTxha% z6QYH>0~#vmBXYk0yXw^F41Zy*sgI|Va792j^3;d1%kjGFYfG;wiNnT6m+Y0+p(=e} zvf327--HhRB_Xx&lAYbd(TOL_N=|5Qs8^+2avaqbPu^zkUuKI1Bld2*jp<~p(lIMP zwm{lq|G4CqzR5mppu3iB=N1sGXaYE+5zj*yoJXR|VbuY(xn?w2en%NSw{gUzOWCLh z6`ejMRCf~;^j8S}wFXmzu{DL7C}xS?=_Z9U-x`8BYsxt*b26^2P?&5G(T>;u{mX18 z(YQTLTDPu?rBC}&qM`u3;f6)Y!h5T=o3m7Qt2hUW5;1l};pGHCzYv65;7kw?9?=(u zIG3O*S4BmLYA#U*=Qy{>6K>WY^4n;K+)Z5UC5E^cwNLj2H8$9AB`Fu6ob(ojDMIdv zEhpF0YRs5z;Q9M zczt(NuB=TCWSm&by<$#dhiIY_Nbj!n1RHIleSO@rrlu{g(r9JojcztMLi_my%xe#n zp(`ZJzRi&@2(#A``Cla%Vc)ouQuK*Q`HG&Va(b(@xri5yM4khaTMVuSZ`%9Nt6se( z`8}G>NdDw+@{|6*ct5VMeRP+gEn43aBnQoZt|qERN7cw=8RS{iF{sUl4rc9HOexmj z6^f5VC)dOhWdXM;|JPyC6Yke>&av?U3xbJJMU9qZ0pXqm2@)hoJ5W1`YVLS6vv#5i=AFNq z@mP=fX1Aoe0fVfGna4Qs(>B@;3D-NgZ>b3gS!B_c&E0)l&2BVwG z;yS953z$WY&e@%4KB{B-0A}fZOyMl8m7Ng5>}N`|4cNcU;>fdkeyQxMnFM_@Tt@{6 zUAD>6PTNp6WYPR|w4QKxSz{N`AM|LyO!h@Clb)99+F);cFIujpOxoMs6%lj|OyO%7 z2xkDR;MRZ4)I0?-nt{(JKZj*+L-gClu}Ri@Z{-ewkD6;LJK)rLb7CIB!JX^y@$m(e zx`dU0F^X(0Vy@5w!r{E6A@au}u`HK*dxzMesg9tKxe)v^t120iyw&|azCx<|6A#*D zlQnVvbm(CQ*`fycN|OWzH>*q#y2B3SU`Kkb{Az+B@m7RE8${jNWooEj-WEZ!{~#)i zx`UTD+)^wxt8cEOJd-!Az*Ng0>#?ln2PRuEd(}-c+or=-y&x1|-~QQSFV6n6a)8Np zDt^Hy_ceWO(h<0gPjNX*x--MZ8a8QcsFgYPLuV_C)yD0P z#X3x9#)Yla4{L>BFf6m-C^RQrq}Z-XOY-XNrVGqVzn{+}Oy66KJDW7Li@N~($cRga zqT*Slr&mtAE&veno-{%4G(J^ua}q3oPU=h^SNY#OI22rDAu~$iZ(d=<#?RVJ9lA}- zuAy^C97zzPZBdw}jEpB0e$W+H zE?N-a=!@X}T$_o4q2Z#b_ZGb(2-vD@^!IF$WF`U>ak`_x2{8 ziWCxSSRq>Hf;>)B|FOj&4jO*3aN2MT0o^sG{v@BDSIyokRMQBLL)U@0EepCM6&d?s zZFH7;n-J1AW`Ge+x)L;fgfodgmW$0kmcI811DkZu92fP>md)8QMXWjGKHEO*27Y~@ zIMf-FW-_QZb|zp67X)wY;cmo|0bk=6oQiq9mk7I<%31+8-nm2@0=sd%GvP7Agz}^m zZt8QhDs2=A6vPZdM95Fnx3af`B)hv|{oRrsI-x+l*aWWe^#icyx1E`lOVHyDcwHYuU}fKQ-4-`gxR^L^`WAB02il!kJR+-35)vt*5?!JKYoT z-iiQ=E!8rzQW(L7vfkz|8c{tShR8_oUq7{zT``W_yIZ1+i+(7Vn?vUiz&CGof8Ht? z6lsAk)Q&|osk1u)LUGVws*r`kE8RjUP7D{r!@=1pef={cJTPHYNIp*Ax~y(G3_+u}MT1ad`jyUI)Dy3Wg4&O6W^;Vv9|$I+D3U4a2q4lDLp8 zeB>29USbdCsI4;ViK}o)hG~2AChYb5Eswj%%T)345O92Ib&@5^1-pYQ@;SI&|}p5uUdy@(IB&Oe+uOb_MW`g)hMwE+6Aqu2*Jb=S4S z8oQF;YoGmMNcv7cj@1?$3}Q$?S)J#FwR2K#JZ_djTXY6*`RHVQnfB}-lEo>-NyZXc zs2R05RS1WFTRUbCSk*6(vma_&nw%(ka<@iCF@kf0q>P*`K=1=#6W>2KidGbL_!xe% zNQhVw8c5WRQgAlbWW<#3EK+*G|3wLghh-crSi9P&-PC8!LL-a9X3`8PJ6*^9omM&k zI_uKnSO?oad00W=QE7Qw%dc{x{l%n1ho)fO%FqX$nAsF`GbmuCwQN?0#-~f~R4Ymq z*MUgH21|J3C)-`3hrhI?LU(z73mWUy!17!8fmoKQms)Pgl|{aRioFEHDAEokvxa#` z2yw^>@I2^=G$kP;6EI5p%R!Es<*tS`iVR*=2+MR6pHyx^kawtaxQ55*WT>v4Fqe|h z3U_vBh~f+F33_%~++$7UX48(SLgjMS7}(>9oILJkepHCH+ff(6*Y=iN$z8^G$D!*>tUsmL3jQ;*b`E2OIpU;UR<7|&3755agJ9h+^Tj% zIB^Zppj%Z6x-F!R^*hQHgO+%WWpp9jf#EBr8_!&rh6rCf-uWH~OL5up@6l*3zAJlJ z1y0_~7Z-7byI##2=WOKS?c0X~-UL;tVF(jH(cHL0&8m2PZGUBCn*^cC3r5U+w#aWB zqVl_jl?X7;e_pVizfXUVskYYX7=j%ATHpd+&PlwN^a9IVHP1W&_l@zS{*QcvX!-d3ZNsrR3I${!)a!g9?nar3nD7wZjleB9CFPSo+ zd(ffn@j&ZbUGfG>4@NNSMUAkej<0_!#bWm>;jk*qjaCw|#g@XrIqh3SyPQYDX{IzK zV9n@JZ^n|3$9%(wRACbqUiF{QAf9v$n^#$TZEnvd*rtE{krLguv`<(}Bv|~Qnu6(F z+62HlCFgjcOh)IBHs2LeunZ7t-Nifq>Gkz^*v}+5HXdPY=5*}2YwE~HF=>FSoOGYS z0iX%VE6|4ZL12z1Vc2-fng;*)`SLjC{J~UieZqzFhVxuWXA!<~%ZY!$Y7QaaLN@89 z4}Q^vbz26o*3{r`H`g=nCN*p)=Pep$^|Fj%qvx#ZbhQ}G#r?#T>sUX8F%|7C9&*kn zfHhPAib{C?++WWIH0jgm_w27cTBs)96|us^ zn2J$puumpu6UT1WbN5kyT|HAu>ZT)MKtlmWzhnrnr?@qw?j^F?JK#&o7&O9|(qA?% zN-T;32$)qUg=-mi8KZlU`{A*YRGlo#&kRvU~AN$xr+*60wD z5mv%Ts5Vxm$iK`v#Q<1|&jhrNX-?GYb9#LCU*!nbm4Z1Qq=3BK4)yPs00D;tAp?cf zT`-uRBtW2ilZzN3QQ;v^5r!A9`6GzctB8Y#+EM15mgs+889Uf*-itE=j z!s}Uq?9n1B0WX>)I#Tjn-g*tyR_`>|i+@ZUNvCTVYog(fY{HGAe-`khsYXG9Khi8h z5+~e-19a3*ZG=g`@8IXRQ-FOdTPXj)a@CIW-Q z`2mLX)LK%ZMJ~%#}pe4#GiDHvpP~|xGJ4xbNwzdbzI#w&z^Ny zrHXBa%jVMQ*Q39?AolxIlgTG|0j7L)5Q}5RT$ctpG&sxO{KRnMC)^Zyn@szOFdcm9 zVUYTCuO^D%kcg+HA5fmo37-8!3Wj$ua6*tau*!T`5;*NyYLmfwXa-_QQh9_*ejFmu z98?&O^$?G2kJDUMV;+c367Os#v~YO^UN&UGL55IV3rl=BJV$we7i?NAT#3fxesWea z=Zu1_#uPQz4KVBpJs=-plD(m+m6vSGC>c$R1xH;jKUAXJGnMhpUmeN>$3{#YmjF~x zBVOGh=R9Hhkd4vAZx1@A7A__3WjPA^*NC-o>)@~O-{rboD1}$y5oMITW#jy~2vxpq1l!04nHYRtTJFHAB7X9KdY0=+md1k`2(2f?Hj5ls!_?L3_CP{2nA5S zxo~v1|LDSUlon|^CU(2pO@E&^q6au`b82*4wtDX7-%*Dp#u`f45&{H8k?SqPHz1i5$wd`G!DVxx;RWvecgS@B^npdrs$yAFfw{ODR_l@bP6U>I_D^P!&9) z4|agfaWy(XK*~G#_?REBBm!Zi{PMML`R=Ht|A&s+6twzG zl;!Kx+@UbenJMQbcYon!Ax)4Q6B}aYDSrNaFu0qa?H;~WN1!^X@#-YzufyQggY$v5 zv(U*$>F10T?5cp@wTHx(uQefUW)ZomVCKG=b`$4|feMeIYaE7hc6KMi;ToEp5oIH< z?5^+v+{iK6?M|7tE|PNw1TB||Xd}UuP-ekKslUjkBiEN1On!?Uo=0FmL9=1ud^op{ga z?zd*o0?M6QAh|M~4I$-U(tGiK1dE2%ILDid5VHf6=da?p@68u`Ov1-RxD!H)a)PkT z6Bx`%_#&#UDR&AGZ+Hg>*GIWSbcLqJw?%u`-VjRLN4$|>yH*#jH#o=RC^7<~Cl+MC zIA6^Oa%5gI{6Q^~7a%Iv!sSRx#1Eae{VzfznvNpmEqge6GM9Q=7NnN2c31a7*H1U* zFLMA~E0>*lYCY93`Mc#O@lexi*W0rizQcpWs7Kfcm{K+rrsL9NKbsOyy!SUAsJd$I zwV<~jz3(K41z$MX6$ST73_+g>n!0WGuxqlH=RLwOKd?1gdGG=*U%GFMG!4X&4;gqX zGOMJ*iGy?P#)+oon52i_9SC%FQ(A3k?cJRDN)v`i$+d)nBoGh$ru*z8Jgdlbxv;nZqQTA~19b zlU@_$q&wb-5hrz)Kl*O-*4w}4EKYOD`1A82gVTq^!(Nb5wg!J=NY-60T&K;V0?8cl?MZ=l1vbTo6vyEeb6t%SeQZkJrhEZlTu!pETo*%1YGkP}wcXm_m6Rh?jK((l#>vZ)9{a_inYWBNb=140)*$fh^KQ{qxpX1c2 znUzLK?0IsDD`YMeEFaDrq;lHGXYdtS&F+!OrIb}AWNl0;q$La>QX_9mIRGjpS}z2O zD4Oj4^azaRYX4fZZ=mCa_XXh3!KeMK33%vsKV@!{egvPSrTMWQ?2WyGwoJFjQTFNH zFMs&gMQ=zn2xJ1T?dtRUZSE_ORH_!cA0R2w5|#1d*Y?IwI!lQ@>cFlS$~zQh6E%#h zz%+~s1VLI>4j)rq`%`8k9Q~|Oz_i&o8sqXKzm-X|g@PLWRxM~*haUJfO_raL()nir zgse1gHGj$>il0Gb&n!yJ7SblP(2AIE%+C-7nnM7=IkM5|Z)fS8$;#f1K(G1(e5G&J zh)=9j@G)bwWv0<+CDv@zjeAm1<_!#Exa=sowUC${?{taI6YO33 z^`SUY+4+Cp^h$J%CsFP;A{Zj~@O5)6_$VJ1W(#_%Sfi?;x!t@NdE12#jXXE_owWi` z^ni3;x#`mtcvlemz`c{{F4Pchst|cqn)DlM?rF)RYFO)PDa8X0$r~y%ktU0{v_R~b zZ^WFjf>AYlDbmtTW8aAZhVMfLa7q=W2IFU#ql(DjF`{fOT)%;@19$vo_x&S_VuXH0H(8&|$JkXUPq>eYZ9!k6SZ*;8w>t{k^Pf@pkH6wO zD&ERPqqvacm`0rC@mko}A2{Qwxlw~jfvP+fA`Ia4lcX-?ZND3lXFS5{RDftYcViQQ zv9?O+w65pv7ZmKf@_4&bp1sA#A#$_s&(RXCgTfGS+{=N45o56s5>@_IM?{7dbOar_ z(`{)an0E4_`FxKw`DI-^SVp3~yGdDPjCPR#xfxCC`Llbmryuh(ogAFjXL8;V>$i!v zHx5w;mDp@;aEmGAVSy!f-|YQ0P!#;DAX-O?80`v5C+{A-%nZPU_WSlB{ z1N`(4yHGRJ8ZJ{wCpVNK&qd=ie$O7Q{hW4Hl|dftr#nC-GI>ynOMWtI*Zb>SOQK#m zEPIKv`|^yQuC7)}+U>HYL)-Drx563T7%TTN77oc&{f*@zY7(YV8v?Y5ajn>4f=o3&e$LVZ?lLP z!H;_=%2u53Y0SAVDTQ>5u`>oNYAc1?flKeP_o#cLx$|(OAsTT$kOt8e#vk^tNp?W-5Qn>1y@u*3gg!FR!^kZ?ssN*?m)PxI#BgCIGq3h2_b8Cp7DlNm z`ilTm9znXDZ+-(jMciF67%r!^5Of7hP9jat0r}9>Bce}5EeZneIe)Wwn1XOPI0#hI8tv|GZ=3&?}&TJ6TPzWHnkpyP;i-3y7>IsD7 z(7gac78wio;bs^|u3Y`4D67gD^F@^Ui8(czO+Ap9SL_du9FQjzT4nf}ltuVwrCP1A z((JX+(dq5q5{&d4Kn5iY5?1*3GQOgls(vo>(ekB%4m&llP;a`d6_^2Z<>V&ep#$g4 z;*ndsZX^zjJS@`bTdxc?0Yo>aUp2$c!J#^c?_kFEw?nS4i%Tsxq4bd|VrGZPdQfSo zaYfZ1EjZU5Fv;8TIR|aD+1VD}pA zr*5pqX05O)rrBG-j43J_ghckz>I#A`xMp6ovv#elppDMn6rUJr1|}jTyb(MUoJuEr z`blPHPRXrLvuV~3@i9)UffCt?Mk3dkUzp~v_qc854meqS&C;Q4xeaF0OvaXXlGaw8 zAT?EuRb}OX7PZo#R>8Lp3qtw4!Wt=3Kf3Ep!lhcEf^K2ng_|tdR?>!31Q+QaYj7`Y^Prx7D_=wtfq&>}nBC;F=eiJRQt%)~G4^jpktwo%t1kMz7YDJ2YhmXEug7g*){z>{zH zpK|SealNYMDc}Vc(#S7pTQ73}mCwhLL zYS=Azqho;c7leJrPa84=H?sA@soZE4FJ><9&IIg^o(9&Bnw_~vt`QPGAt_vQbKFPu zeUo7*WrHlIuO&lDm_+cjf736k{_u7<5Ju57VYg?N)eD20q zLM38)9G(BLNtev94NYQ-##t-~#t_AX6OPXe8mK%R;rwy1<3PZ<&q0JLc= zsKZ?_nnH>&Cp)g8j}9^1R~cpVv5cCage|t0oq1@}(h zXbDQZEv-y`DWyupr*4EL#_{tlE2a3&L_b4@9_wa(1!_~JUvgOYKFos0g1r#HNUYb2 zK>LNBJ*W`zfp3(_KBU0h54Q2!-AUSvf6hCbkrQ!7oyUOoGN_A&s@u6eoB{?Fx_EAlKDGA`S;%&_S%;=)1QA5Fm zOwe`XM9ZKxdtth_KL&!+?SP^E>r+$x*%ip+qSJI_u0#DMivu?NlQRnXo@$E%H)N!I zZ&%Yetia2#L01(HSmlEQ^W&-d=R%%IaE< zuU&SRZes8Tho?@O4tFM|A2N`4fOM=5BTxjY!iO81Z*4}yrie%lzk#aP44ve=9=jEl z7kW@|+yc{kiZUMop6H=4ri%+u@;7rGI?Rhh#g2src+w)Azr~qpy2*CfC+-W&(4Dw0 z^l#?@4v5LX@Dzh`ZFn|IJV*BzQ1CvlbW}FkHiU42JR!-MGnbM>;s&Q&8#Z}@h!P`AhBR~_FH#MM5m|1fm`ktq zyAb;hG9@V*U&Gqw^Eo<&)5~#HVN)3Do^(m9^CEM*I2rxQ0@_|(-@Y$u<3TjLqHxZE zMyReqWOh4*vu!RCXl(3ssfRbIO6K8e)jM^iV=%_2xUu+(o2`Yf`}`KExp$QAJ7CWl zP=Ama1VF(Mxs;W$In4;PDA>R}M78pe&g9_#HuLMUw>nar6G;b|pXeU39X2r?wjGBb zNDr>x0ldcWVYtHfDU0;$GvsHWdi@mi(6%3r^w?@43h~gUr~dHaSHSUrdRZzf1gR1^ z$rMT9Thua3(aAY8nzla@>6Vf%aD3{qKz(1R)fUay`fv|JU__K72 zT}eFb;OEj~ODaO+T#72bHH+H~s}mx;5C))fIarWPa4x=_1&X26J_zZ5V!DTE4(=HH z4<0Hq>@%HBu=K)duLsNUJms1SF&BCXZA3U2DrUo-OU{%N!rNr0fA{k|U0*%jIX?U#=?x>6|F}319lBW|B4Jqa_?C{ai zTo&#q&)QpkTwf4B-OSP5B+7Z{(XG#OtLSoAPSM18rKlMoCxk7+%P!eIx;R^);xR9X z@OauRfNUKhny)*LkDS;2b+Xf5Leu_`bk6qqHs)uy5>|>c{i19qtVPgpfFrpeRm!Iu3+f$?CTbYgo6FlT# zw$WgXH}{&8h_LG1ja|P+@dLHE|V+L1#p4osZv%Q5Uz&2z`d(7rUZl zGEPMZ+%__~j|eQih%xeziK|v+p1!X9_~dN;eZJHu%g{Mpt>s@`yp8YQgrs-Rw{6 zICqx^`5_1~(lQ#PbQ8efC@2D!8#=>7$|*h3hOW8Q)&7##H~vv}ZN95-u-a}aO@?_1 zOUVA};3q>srEe6-^bEd;cM;C}dZN>h_Y<5|q3p6+7{msTbFfd#8zUbN#!qYnAnHZf z@I$}9&n5^;uY^;0mHDM9h+ne`&Bo>vE_7nJsXF{X`}R;r0bZhgFws%^t40<*H9yt) z5`s!MN3e72QLr{$D(q?{DD7L1KG%)>ET~~3ZoZUd4C&1y>%`(Jz@FLb`!X@ zetxLpvx`)p`g*LaOWK*qApiia`@W){dVL1n9gJ)esIy;>iMm<6{@#yuB;!xXhX$27 zowT9S$|MwO6O3~BdY>+PZ1p`AB}Zk_E8zuH*#1mlgxQHpAQY8jIiJz7XAQb-GRFvN zPQv~UTp{JI)BFi>Ek7Pd+dTnoSbj}GEg?aI1XEsM3E9K19X$oF_z|1~K2;b4)h7@MK+!5-j}}8G zIA8ek)pidyR@)jGL zj*P7GHn(s_RKm!hrhMxsU+-JFB6O&Xmcj7WGS1bWy7%{*)-yAnRqYP=82)I&P2}2X zz~#1RfdQ-CdSd=lUfB+LIz$7|fT2iUjG@#C{pI$y#{jh6#jlT|Afb9HNlp|AZ7CkV z0gEGmfg0Y-8!>_o`xh-$&|NV^2?HFC2Q^Rp8Wgj?Vjd3F4)%rAJKnX$m;*}&LH1`G z8-`5Krve~Amx&VpK?WKXy^Rd)1Zk~jBy_`{^n{eBJwG#;mnw-(@jVo^mpIzt*P#Q4 zus3_~c0RiqUPs_nKKE}Ym^c-spjC-602(q;;^TagU}FE7Ey?cX3!$|((7EE%{3ie%a} zCz`FjbTODZ`Iu$FYU%SZ1PRP_A7DhK2p#AWt8TOK4{x2`5<49eiz%k92o7Ef7;L1; zUvC)tlgn$WXwKM83{yqse$T}uaKW6@)*|Djq)DZKFu*DUu3e#H+ZFVnkNiw(F|uLS zJRh6>oj>I@QBg)l(ny=f-_V1%01SJ|xhEbwCN!k2j!C_9#S-E}?f6O;MFuf1U?VhN zsREpB+L?AFI0f(#+TF{3U2o;~_T0jSTc>1T<4ejIk}peHv{!>=@;LRXH_GRc<=AU* z?vd`Ox(0vq;VzB^PzP*gS;DSR6VxY%c!J`Q8FH+MYFF(2(&HDr!hSSZ9Jq+S``Sq7N-{+l zgJrLo<_2k@;kQSM?SXcA-YpiGU(j?t{yY8m0y}M9^a?u+M?uFr?AL9puz;?0POqBa zbxa{yvOuR$^8%qH3q^^i;ou~~WWu_!vqIkmWWM4fn_cN^fEdqX9aEZMo2xT+I4qFC zCK{<04}$q9M_|1|7txra9M_4B`P~;OZ;gt1ynALk|^X?lL*G*lgN*twPK8upD1@htXm=lrZYC~TdzX^t@2xl zGt>=`6VOfc2YX_XeP5>+FU`p}@`hN0J{gQ#HbP>uCk@Q#1z9Hjd4b{G@H?HaQ__RHfzcPTVcGQ(%>4Z6FpUw`f-90 z(`Txw)Coe}IbaWVL`WO_qw5}h?~=6}+-Y66p)alV2Odt>t9MM=(soQ2^qMx3){suK zh+Yx_3yF1}^&-8#33Ne{QZ>Cf7j?G3D<66<9~TpqR}kJEjIfiGl~&iecWWHMWt?Ym z#`^1%LL@5U=AySA7=>jR3pk``K|Pzj$}GwPTB9+|1l@Ce%7u;Y=^M*C0WYyCbuEGL zGMt7_HFe9;rCBRKOzMSl#fOMXGH%<2ULyTtsG!qeJz~s6c#I4O>NE~#q+{`PXBkc9 zF75O0eGVI6AlI|*6KNf(+xf1NR#m3g%Ux#-x~a5@QecqYeWOnj#hXUOA-J{1TBQ~ZS5!a z?M9T@W5@nLD}H}r4f9ifk64RuTL=*s85_OFvIkL2iYPH5BPTvRIXf{`S58fdD*IdH zUBoygGnU2qPwXfr=GLZ`wMyKMYpL6UeIW+t1>0WSO^5~I650EyWu1}`?Vu95Zlq^YWJ?q4`1f9X?p0c-hR^Ly(xPamd25 zmO}ysnFa}&r1`;dm$_~5nV$4eW+$#5o-vc*X&>qLIR zBgiROOTcR{-(QT7BBIR;iwTd8?5W|owm~XV(J7}fSKiUdQxdLYFR~IY}*Y0!X z9jrC9r9sL*=l>+Jrt}Ja`JBgh2?V&{^)3^ozn3HnkY(3i_A{dRqcmvp=H~`UXDi-dU2P6 ztw-x~yXxWVeecXUU4=xYM}1f}99DV?vlZ6uX&UW;d-#~1IkbZ`6fWwD|EU7B#$tj> zQw4Lir6xD5Ts1WA@0|n%wt;*S^)3>VoTzAOmzrb81?0TPR6uxW^Wl;BOde zDVLFhtu(2ry73Jz>CU$r-PTG2oE1hwa3pXBFe4cpdr6$crm@)rzauvkHy^iDZ*XXD zKJQSYeQ+tQqvIP(#EQWkS)=$-aPM`zYQD*Wyc^F~_1|*%Q+WCYN3lHkz#_Q*Z$f(h zRF-l%wnHQ2dN!zhu`~w(Od2)^fCEsOhlCNv&;6yYNDnb1PSaM~+$fGD78jRWQ*Bg| z+EA{5!_T`+GQ1OIP~c^N!rC?g2egYSR_?pv2L*lo!oRa|bFf>A~u=l`Isck*L-Yf!JDZ?65$eX)YM zCWqNA{0}*l;9=O`K-th4LE}B~N>G=T!&imCEH+(1WtN@?YdLFRQM! zrJG;eG$@|Zxs1z?a+9wwP*y1U0T-r_uwSwRb`_W!vSOfP{W!E>ieSR=MLxIWGGT1N zUK}?yjPT+8L5MM6e#^TQj~`2d11(?j&i{#`PiRc4Y@E&Is-@8^IdhGM)y8J!tFv4Y zs}=@UpFavV7p)>Sk{N9qk7t@#G@owe6W+aFt9*g!K4Ne21{??;0%Ur*f586%@bs5- z)DWH&{H2p!vt_>U`x5nRm=a^-lfxr)lrNq6gPh-@Asa_nNu_*FPE&P9uc*AexcLt@ zJSA@O_C)C&XRZEU8ZpQTk9eLTarF*WqQN_*~Zwn>O3?%<4`dpVCvqz8LitQnby{x z7g|MT8&7P*iA;WFMTbdBSZ6Q{jSX9}&wR1m_6c8+Ih4PQm5cVnU>#4#PFnug3aPuY zvML2hL2GUA!1$75wC{h=fiWJ8j6khUU@%4V-DKlWNRWtfpC z#)NMS;CE{|q>DhlpM6hQmqi_%mfF7hfxwSI0CY&7Sng!9lka1NYH3Jrm+i%$MC#D) zu#MM^009DoNDv1eOaW*oW~Rng0O=m0@DB@gBWOZM`p&L_i?kHW+UXT0ax(4cmsQ5w z%wC`8Mfk#C^Subj)7!Jp@9pcIw~sf`eV!Ro+Mms=twI40OU5yW_5CWvl&X@2>&|dL zVGEx6(c-~Kz`L@u#d)~#|LJqL>welHT;M@B9O`d$?tCVygpW$V%ajzToN05qwv!(OAuR+e0n^d>o_4QOux2|2*bj zZ9_z|N@f_S;nU2iycF$DZj`QsZ3#&Z3-pvP2d1%8lkl({%$f!mGvV%VCy80bmD>1# zGegY*0mN#ZyG4)V=c>T4EM4NsB~r9gY08erYXSU`cdjY~&`>vEc2_hX7$AS$la9%| zFZUM(vk_mGlB;(}-XMtsLvXePv3H0G8T1pdW0TuqZtHCwZ_o3|b1d?8%0r>k6$7k$ z*4h2beNaUaUcP+wRREq~B|W`<_ojjKhCwX{LLb!)Bcj2DHd%^z@*mBk6IidNg!qiP zD+P?Uww^$E$)2RoAi(58)kU?R9w;Ko zfIBQxU$a?1#NPJK2T6p#?pjf|ATGhb40GS%@!J(l1bOkp=aSQs`Qf=SJ&k3nAY`sP z=pgCHhse|~6l-AImA{M3mb?r)LQvB zMP^o6GEV>EczqzzT)oWTNyY(aAA2fCKYnBIPXEGIXEXE)br%CR?eBf2sLayNb&=IM z0<;|Q8Xgao*h|<~Cn3t@X`_1u=VG}2@N7hYUJ8Cac1WP$zECA?5s;(4>aTY|H7iYj~!_HXT7n@haUk|KIaon*cn3@vnIss z9Il%CwrghYCCNkCg9qT<^N-TM?sy~nmgiJBErhj+Jc6Pj*-bN zF+9)B&l@8f9io%=Bpk!hC#2I$ErvJh=oz4~FT$p3qp9dRu1zzTA+fyQ-C%MkJ9o)? zrWYemNOOMvip_@^oWz5fvhbNjZZxOMnoX}_E!x2{tJ{lqDWYFs>I}we(Gu}dC$uY- zW%GyT+aZnf6Gs#`lAv?~OB}lT^nrJKNJ_N3C(;GV7u$3!NAL3ZE|_1zZ%UUjiB>s9 z7^kIG--$F1mq6tW%YemJpu+7viM1N7E0Jex=eJ+ln$XC8LUdJm>}p5sQ6Zx(V?3d3|yp$ExDh9GVPm7D{ZICOmT@@K?Lhj9F?{0GFZ zHNc;b;LlR<=j6Ko9Rl=m1vYq$tiDB8pcm~rzWH+XLj&|L28L~+{B_xa~Wlmv464wlx*-6qO$BK0W4OJ%avcmUEabCMCBY&$>wq%v% z^<;v=_cxleb67*SPe7yEfj>__)%e!-oSsZ>Ug+yH`G|91UU^^c$*9~*Hl+Pilm{$EkT8lu$qh^vIkk5SDiH5x^Pym1tWd_p z5jbbm(q!QHa#8vGc&n8gq8QM4|76>PGi!ROHS^D20RZ?&mdgJ@pZ@{e+7gvr0Ko6RK=Pxv|(yVAAipI8_>Q}*;Ew`m4nHbL<0XW zC_um3)xV$!m?9wmT|w_(Ain?N>(@9y03?tA0AgQtEh=_7DSx1imEySIF{U@58=(&nt1ZBMSAVrDWh612v#{x!s3XNfMNe-Lfx z@Jj+c_>E-0zGe=IDTP5wjb{i+5~{x6;VjoSZC z`F~soe>+7T69NP90|!VCP*R2>AmUS21^_^b0})Fgp%5|F~;EcQd0Vt1i;3=LG-%_z4##|MU}{$TgD zQenMOdyTQQuKB-ln41ejLuh>9r;_SF$e`^ z>5E-`kJaN|tkpGdi=3n@cPFzZof|Swy19da@_X3BFm(G5?#S z&3flxnwwmCzdJgB7&NNr+wh<=^hkJDcOEQHY|XUQe_QRePa0`v!E4fO#$_#qyMdLH z2GHUwhCJBaPV|7fB#0cFqxfb`nYqY`C7Vh}tQfAY{y+8!(^>dcRfcehN+Rd29>$`_vtGJHwR}zd5W~SUG}vTD^ZJ;g>>Fu{uMGFXI{_ z=be<#15};CH}1Si%Kl2U*AvLMTMl{Rqj*tyOy(=-2eb9cMyI8N%ZC+AAKd~pXM;F4YVf&+Bkj4388pkAI}+_9w5ebQD*qhT$HtVWH!}uhqsWvUdX%gY+85HA1Qf+6#g# z5135r95L1KtOQ`|oY-2=00NQrWxs9VY2@cT${5vPAf+159LhJ1SBxn;esIXgiyB9R z>6=me%u8H414#6G)!7-OQJPU{htz>=-oBgV{TDlV8VY5}MAxggS!-ruNNLpYFN|@< z+Yq*=Yn4Z)C~k21fOdf>r6J(M6BY7PtQ>q5za1$-JjRHeF&G(9(tnTqEcS;5(uc(y z4#QMDkY<9c&9HB5GHM>fvR?K2+Jvmu;n3QV+v>#s54*N5S~{njwn9Fq(#sY5~oX2OWqr4Jv9`L9EPgMMM)%A zR%vKA=kdy}2Cjrhps-5rNgx(0jKCo^gk2kD1m$mRk$d@ggve?=6c0bo>E0trP zY13TV>2Ah5`NqBF2nRibM2N0o$M0Y$$lbSRpJO?)xi?x99*lNUh*?XTz9{Z1wj$R( zsDTr`4YE;nHH2-=RH*FA-p+Y5=11T-ymIEjhO1{wb0}^T5O#MoGpW;9OT1id?4=gB z?eMzuT^2aD5%zbSq0=ozAw;r<*4c8#xM`A*B^a*+ zn+Ex_a{hBQ_R~>uLUFh_tAbbQpa#%di|5jU0_GeP8Gz2y%WKAS`OThaTv8&<^Dc=) zix5DuC9}$m>Ta=PJJwb-XIQ+3kS01i&z>;f_kryReh?894EizQUO#r&dd%MAz20ZJ zhJ}mbKrz~$D8>o%6I4u$6uD)p?Dt#Qum_HUmLJh+IBE#t5@td+Rc&;$`*6vi5=uhly3z z+FFttq!-j|k04(GLH8l{GNj=vXMvb+N$hizN2rD?;LqYs^U}woqv0x?~xY(DGmm;j-E;UQ?!hRnu_p|fNhr|=!>IA z^_U;(6YGcp8>LqqTwb9q8VJvG#*~~N+3q-V^?Q8BD5liuIa?u-ClcJrAFLattvMvo zGty&5ve$_D(s0oQ;<3;6w*a64qMx1<3y0$hMnV?LIx)q@95ANW zD9x%4aG2g0Aoh)ZEfl;A_*P-0y`iMNxuQCpFR*u zIGq~CsfSA;Z`PL&%7d*rVHgK zhD+g#ktQei!h7T09A<6LgWEZxVUa;F~iE4_Qjcm?F}HYT~mlMryoRgp){$ zkq(yu&?~Dem*$YY;Awf2${DWlxNpFK13CqwEATWO$7D1<<`|2n(?3_MxNTGqZ~Pp; zjO(R^WkkGpcv&T1enN7>u5PrZJo`*~_4JIR1L@p(Os&Z_x4^uhkH^VQG|z!I%k?pC z=zMdGlYeFQSz~3y)NYE4#{Hxy(^Ev*42+FCO#5f~;U! zyj_Gs7g%kUK8ugewXW=3P)kJVccljOr;c<4^yXDj7GPc4J>C6MDTIYQT7<&o31k%I zhg2qQ)|vH(={=E(bK9`cJ*d^0dsH8eeJ#}0-tG%8#`(*RTw@&C_5SC6w!%d5EG1$3kK zEg|xKfAulNTvp``uzU=zpjTf->|E+KOtmZ_&85y0^5yxiqXI56{Rlw!edhQ}{=46? z3x&Z4E(--g`A6Tt2G1`HJ)(jV-BH`_2h-d~?tM>B&U4%FL?N^?=+oij_J3-yYcC|- zqHn2w#s?xoc)fMiSxFl&(;)hK6(?d9BJA|FvRIavo$YC5iHuPVGX6miUUzTZ(fh;5 zuxo=}0CgTj&^UL>`(cak(*Uh29q}EJG}HmvfS?3_7BprRhMr7==c8DQg=SlJ54J3(x0phayeChu`TW~w?{IS%J;@2fN8+zpCC-!oN|kGf#v`Jh=`y7 zWJCZm0JvM@E|?4oYW)CQ%#RB56b0s}{`qPlo-2|b$pDo)yzhWr_0fb?vizX6=7Ou_ zWI%DwYDeVRgXfFy4N1O?!8}@3C_hz`D3sAa;h$E(f>p{^e3@#l;9C21t~W`cmnB;= zhPW|IRh@32)usCAITy%a=Zj(O(ai4l<*EVY^K2t3ep*jvrJkBN?`APJ3HZ2sZ1Cy> zGGD^dnhZ!%lIwC`hr#H@Yk&`QkTsgv@yGMSGz;PFDJk&kdeqbCa zkun*9BVIsef>4;Ec{a&dB#)MF_ZzR}3{h6eMk9otcb&PanYsGS5e0t0@B&OkOnOx+ z4GJdzEY13$Q@0xX1`uDpgzgU&`f8Hm=Vmi{uj~Yn6(@XPd!g03pfHavzmxxAO!s~( z>=$vb1+1cMnHQ>|vNc)>jIqs}Ql#w9nPa6w$a9~znESYhw&yqT667gcj4%s_TeudA zhZ@H&8tJu7f1+v2HZ2B$K6eFj2Jz~#LrfFMgzwk4w+Xwnnnm`57sa+s7&)){t0EY6 zzw6m(=)pjeSm_f4zbMoKuSoKNGEul0=Mt^6o#P|7dOP76PTpoDGa()9yVPDxbg6@* z=PrfUSJ`_DW98Q!fc!$75P8P3_0*LUl%BPYh0AtXxF_~H^Ajf(w6KWrjwp;WUaUP{~gCIW&UQxc|&S- zE04hYH>P1oai{GL-s=Gr{%VB1aZ7MrFHwG)`Ze%DO$haGoSw1P{f`;}p%cJX$OioH zS(&FL9w*`tNa-8F#MG(Be?SlR(!y<0$_${uunL`L>PYGfNw!O+?Bx&&`!unYZ z0H7QCt;7welvvRWdhJcPrYWl_zfAiZ@h{Q?B>J;_g`yckx zD(ideO+m2rG zu_LrASl43+=0lDDZK++4X4TLY&zbS%=U%~@1Vg3#+Ue zM-v+sQeL?Rp5T6Wx~w@7dq9VQ-GVHlN}2Rk^kL*^29B4%nLIqLnYSpuj{3x-SM~M} zGKd20SchGLwX$|yEiT`uB?ptdU!s>Dr?DJ0eOR27#~`cwA*3P|gT{01y_5Ey>d%J{ z>}!sV(tNjrlXVL~_T3*HhRC)ag+HJyf1&;#6a$uY@2}bYpX^_V z2AOmW6aWCC;X!`D5Ihm!TP(HIAPs$2Ho?4!kQqhv-Y@E(P{X4i&D%>ob5>1@`18?~Y@I>uYapLxD_CJp_2Vny4R7c_#683&4gSld{88Oa0t|Jh%?lnd zFY;4NsouLEDg5IxbfNg;EI%Qh=^dFBn^F98kzF$@n#wL<^G;Ti=d*MUZbjLgr_ zQ2WP>;2-y0XcDUZ%>MrX;0z)0Xw2{TP)oJd>ds#BMX1%YzTV~9==8Pvdg34QJ7gmv zZ{_s72}V(*tg^2iaT?doK#PHJXd>UvrDYhpQp{E~S z-e?a52fT0DLT88qM23gBKn{HDu%i5M?E>jTarMldn$8S)=I-t6riXaD**Qyl*yNi& z4u<$mm$D3xLR2-QD<{EXWp4dD@->+pp%OC(Qw=VbZ=OW?yzw-Q4uZtnP!<6R%@9ka+)dBgcEK{>TT5M{w2e$F8+;{ek|GAY%Tc_c#0v zE&#JW5mZUibDdfSxwi^ImQ+FRf30-Uq<1oH-U^dni|8hn7#jp$Y63zFC z{(mg;U$g*#CHN-QzsuAPpOrridH(wq8sPFB%(Y0|9>AmA-Xb8G{@&bd#D8qnUnTwp z61aUi#r{ZSO@H0A>nFhMNmM@6+m@dH=ix*}cU^bGEn~~;5fh;L2gl!}KkV(+YPdP{ z9BxT(YH~79424t{^yL<TQpqA)yZm1?e z|8HcscmY&9jVBb46qsfP;`PxBEE>lr&?dt0Gx$@cKAmfa46y!D^=aRkf7LqB@A1|U z?|l?sYN!i-&`d`JVIkuqV$LL(sJn=8bzFv>EPy_HTUq&35lqRu3l&B%%NoqXojOgT zHh1s>n>b~3N-*zO>+KywAHzsEtIzTKNtr?PK=u3gvS-;TAs;;s@bu(BX$RusF9G2_ zzBclT>Uyrqu8GJDOtX^|?qH;p!mAufIiLq!zGLvU2=MF3&~>=K|4MRaf~tO?4mbk; zS`OZOQn#a?T3MoHz^ByX`56E43e=9l{I^B}Xj%l`?*-g5P4a|q0@dtovl97uOoMB% z=(X!e`=*q3$nh$BpHyR63lP#YI*_MCX_ry=>IInxgqzN*+3+Pdudq+}(i?WR8>PRB z#%L8r%%8M2(6=T~&BSw4Kyavn%?Qy2_ACg6qfE9|N|2iQR}@pHa#jUU$8m`6cf0K) zfkhM_t!6CMB&mC6Xgl3yiZf9t`;aJr*KL*eu$zb1vjOSjJ8Y6DAC?q%7QAm4RUO5S z4~=c@9Z>B{W1W-<-<6`1KPE-i8cY<|5WPbfx={MYGK`H%azCBfM`u8%FAUK{jv-h$ z*q2#qWXiA0nd+^$Iz}vCumED}wAWZXK6>i69YKRaT_TEWai9^sneKks8s&@39yuTFUU-PjhV))0P*L7k zHf)FI8)v)fu6{|91Y>h>MZ^{*U9G0xQ|%o@>Um@*rKU%%wAENbwHf)E^b2g^+fnlG ziu1p91%|)jF{rq7;Mj(KDalk#v8$_2J0h;KfxT&&SL-*%&RtPM`pQERG~%FbU@B4a zGM-W7tr`2mzH)Fm5US>)ceFn{IS*aEJo3TY&`~vyvGdDk9iG9NM9hOEiIOEbju%(1%$RDO!qT3Im=x6w6&QUU`i#}&ctJbZf}S>pQv5eRrHvuZWhoP1K^Ycc(b=-mVy!cM(f$57vn0tCI8>IGQGsqC#@` zsW6Z#ntM+;wI~=63MP4m2O8!1s*#w&s!-l`8)mK)Bof*l!afLY#5U0BJxBB!ppNp! zAM(x~c$<~!+)5yZ=#_B^FQLS#0r03Oyr(u_7Mw}OL-~G%#H*VKpvZeK%U0|IO+_~S z>JwnolQ4!^UBRi>yoL$^Usz~~fu8$Zjz}7K@Q41c0y9%B_GBXl=QJD1>irvyNr~0Q z?npXBOV&0T;lgPtquLJepBSwQWLW7$fd~i8NF44(DQ^y{1U>VDhQc_lS11kCJC}Sd zxr$h=@RPBqRL7d+0J8!uN2f8x2Ns~_d3)c+O;bcjTb zV6HwU=V~AGal~h8f$|!(mA#Oqv6NO+Z%l<(3SzEBdTsVObn)_7tLUTR18-m)R75JN zH$tj!bOC>yXE<#dH>+#s28sf3xN`UjOw1Zv6~PvqUZ2HME)%g*3O#5yDn1S;&|BR+CP?@*6hQe#Yxg6eabC($E#pvZ)lX$v--8Ih&8MxRb*5OFHcH_ zsesL8ep*8|S)Rq|gB_xZ{NljV&gxuy;j|F#|KG%#z*7&p4CFM}YfMPMi9(QfQZ+ z`T157Un99}2l+01jnU2wO8C?bEg0ydnD0`OQE;JRBPQoTy|P{&EG#vN;d#t5q$t*y z%tDuS5Uj;kq09JSDEot0jGoe~zK0)p1&N+94d{i#C+H5V3roGhIfRo;BbUlb$-WaWlj{_f{$0aYY@P#%P zR*I(z?=@C?ertf=`7$&j?SLw-(m$8wx%h#A115L(CH*JGdLn&WW>SNRSeMX~F zn%_>g(6-A{Q;&RE(qxzqIU5g;fo3ni zN0eAxR90A8Y>(2z+Au5u>d~K_5gTTWzQ~t&C2@|;&Jn|83%~#M3xX8_i9yl(=$DxR zo&H14YA6uz$9C??Cb`fNlDIU-^7)6o;nGpglZ)?oSrvw(3{G@Cgm&9Ijm2HDd_{#s2 zBBy`6Cy6${G*RF8PP}e=%;R8lDdsL&VKjX4+(L5dBmKvZk=_)66AHkn}Y#o`D0} zPf)L5GR0w6-B~Mb;MxUs8RGSMCfn{np-ic09H^AR{!sGe+mV;{9Gd3H(jRNGVyoVy zkDip~NutIJeP^mtdyQ281{bc<22JO&k5PrZ%vKr^@2Puc6Qvn!wnNH8dGl3u65g`v z=sUnFkYVK1q)!h}hDFjh7+R zLh$;~uL5H-9%d_Y!)4s7U6k|^gZc`|~4x*d1{|d2PMD*Ijyl=YFdQWlSrBl!oRsxq;A)j%GLlTsSluCXrHdmm6u@s7<65{izm`7Ha$l1=~V-$hKfo- z_a`u~i86{zr^<#fVJMmCdQsS480VGNnXPk1-jmVS5VbvB;|N;%taMX_l!e4yDC6iv zZ~(%qk7tW6HpnfVGx&OiIteqE7_A7(qc9|@gQmeaE{QmlTx=V&Ne(%X? zQ%$Z*Qoy6IRAjSj|60BLKa^OR|?xa?v-G__qZUF`S^4$70=9<())?En)L_%l}lZ_`` zG?eGZaD$I+s$9=&zgy@mo0jyINu9gB(W&Kc*uK0Y^A!Yehnb0+gMzIk{$9BPlB2Q0 z2lSsI2r%z3?-cKVxO>qpA8rV`4nB-CE * { max-width: 80ch; width: 75% } +body > ul:first-of-type:not(.itemize):not(.ftoc2) /* toc */ +{ position: absolute; + top: 0px; right: 0px; + width: 20%; + margin-left: var(--size-line); + margin-top: calc(2 * var(--size-line)); + margin-right: var(--size-line); + border-top: solid thin var(--color-rule); } + +/* Rules + We remove the top one, keep the last one and add one over h1 and h2 */ + +body > hr:last-of-type { + margin-top: var(--size-line); + border-style: none; + width: 100%; + max-width: 100%; + text-align: right; + border-top: solid thin var(--color-rule); } + +body > hr:first-of-type { display: none } /* order with last-of-type imporant */ +h1, h2 { border-top: solid thin var(--color-rule) } + +/* Hacks */ + +body > a > img /* Navigation arrows, a bit problematic for dark themes */ +{ display: inline-block; margin:0; + background-color: var(--color-code-block-bg); /* bof */ } + +body > p br, h1 br { display: none; } /* brs should die */ + +/* Basic markup */ + +h1, h2, h3, h4, h5, h6 +{ font-family: var(--font-headings), sans-serif; + font-weight: 400; + text-transform: uppercase; + margin-top: var(--size-line); } + +h1, h2 { line-height: calc(1.5 * var(--size-line)); + padding-top: calc(0.75 * var(--size-line)); } + +hr + h1, hr + h2 { margin-top: calc(0.25 * var(--size-line)) } + +h1 { font-size: var(--size-font-huge); } +h2 { font-size: var(--size-font-big); } +h3 { font-size: var(--size-font-large); } + +div, nav, p, ol, ul, dl, pre, table, blockquote +{ margin-top: var(--size-half-line); } + +ul, ol { list-style-position: outside } +ul { list-style-type: square } +ul > li { margin-left: 2.25ch; } +ol > li { margin-left: 2ch; } + +em { font-style: italic } +b, strong { font-weight: 700 } +small { font-size: var(--size-font-small); } + +sup { vertical-align: super; } +sub { vertical-align: sub; } +sup, sub { font-size : calc(1em * var(--size-font-tiny-ratio)); + line-height: 0; margin-left: 0.2ex; } + +img { display: block; + margin-top: var(--size-half-line); margin-bottom: var(--size-half-line); } + +blockquote { margin-left: var(--size-half-line); } + +/* Links and anchors. Note anchors need to be refined a bit further down + in certain cases. */ + +a { text-decoration:none; color: var(--color-link); } +a:hover { box-shadow:0 1px 0 0 var(--color-link); } +a.anchor:before { content: "#" } +a.anchor:hover { box-shadow: none; text-decoration: underline; } +*:hover > a.anchor { visibility: visible } +a.anchor +{ visibility: hidden; position: absolute; + font-weight: normal; + font-style: normal; + margin-left: -2.5ch; + padding-right: 1ch; padding-left: 1ch; /* To remain selectable */ + color: var(--color-link); + text-align: right; + } + +*:target /* Linked highlight */ +{ background-color: var(--color-bg-highlight); + box-shadow: 0 0 0 3px var(--color-bg-highlight) } + +/* Code and code highlighting */ + +.c003, .c004, .c005, .c006, .c015, +code, pre +{ font-family: var(--font-mono), monospace; + font-weight: 400; + font-size: calc(1em * var(--size-font-mono-ratio)); + color: var(--color-code-fg); } + +.c004, .c002 { color: var(--color-code-type-id); } +.c005 { font-style: oblique } +.c006 { font-weight: 700 } +.c015 { text-align: left } + +pre .c003, pre .c004, pre .c005, pre .c006, +pre code { font-size: inherit } /* don't apply transform twice... */ +a code { color: inherit } +h1 code, h2 code, h3 code, h4 code, h5 code, h6 code { text-transform: none; } + +pre { background: var(--color-code-block-bg); + padding-left: 0.8ch; padding-right: 0.8ch; + margin-left: -0.8ch; margin-right: -0.8ch; + padding-top: 1ch; padding-bottom: 1ch; + white-space: pre-wrap; + word-wrap: break-word; } + +/* Table of contents, like in odoc.css except we don't have a class */ + +body > ul:first-of-type:not(.itemize):not(.ftoc2) +{ font-size: var(--size-font-small); } + +body > ul:first-of-type:not(.itemize):not(.ftoc2) a +{ color : var(--color-fg); } + +body > ul:first-of-type:not(.itemize):not(.ftoc2) a:hover +{ color : var(--color-link); } + +body > ul:first-of-type:not(.itemize):not(.ftoc2) +{ font-family: var(--font-headings); text-transform: uppercase; + list-style-type: none; padding-top: var(--size-line) } + +body > ul:first-of-type:not(.itemize):not(.ftoc2) li +{ margin-left: 0; padding-left: 3.25ch; text-indent: -3.25ch; } + +body > ul:first-of-type:not(.itemize):not(.ftoc2) ul +{ font-family: var(--font-body); + text-transform: none; + margin-top:0; } + +/* toplevel examples */ + +div.caml-example.toplevel div.caml-input::before { content: "#" } +div.caml-input, div.caml-output { margin-top: 0; } + +.caml-input {} +.caml-output { color: var(--color-code-string) /* why not */ } + +/* Other HeVeA classes */ + +.c000 { border-spacing: 2ch; border-collapse: separate; margin: 0 auto; } +.c001 { border-spacing: 1ch; border-collapse: separate } +.c008 { font-size: var(--size-font-small) } +.c009 { font-style:italic } +.c010 { font-style:italic; color:var(--color-link) } +.c011 { font-style:italic; font-weight:700 } +.c012 { font-style:italic } +.c013 { font-style:italic } +.c018 { text-align: right } +.c019 { text-align: left} +.dcenter { margin: 0 auto; } +.description { margin-left: var(--size-line) } +.dd-description br { display: none } +dd + dt { margin-top: var(--size-half-line) } + +dt .c003 { font-style:normal; font-weight:700 } /* options */ + +.indexenv { list-style-type: none } +.indexenv li { margin-left: 0 } + +/* Page specific */ + +/* Cover page */ + +div.maintitle > span > span +{ text-transform: uppercase; + font-family: var(--font-headings); + line-height: var(--size-line-ratio); + font-size: calc(2.25 * var(--size-font)) !important; + margin-left: -0.25ch; /* compensate nbsp */ } + +div.maintitle > span > span > br { display: none } +div.maintitle > span > span > span +{ display: block; + text-transform: none; + font-style: italic; + font-family: var(--font-body); + font-size: var(--size-font-big) !important; } + +div.maintitle > span > span > span > span /* ugh */ +{ font-style: normal; + line-height: var(--size-line); + font-size: var(--size-font) !important; } + +div.maintitle > span > span > span > span > span /* ugh bis */ +{ font-size: var(--size-font-small) !important; + font-style: italic; + margin-left: -1.25ch; } + +div.maintitle + blockquote hr { display : none } +div.maintitle + blockquote +{ margin: 0; +/* margin-top: calc(-1 * var(--size-line)); chrome but not FF, bah... */ + font-size: var(--size-font-small); + border-bottom: solid thin var(--color-rule); + padding-bottom: var(--size-half-line); } + +div.maintitle ~ blockquote:last-of-type { display: none } /* remove branding */ + +div.maintitle ~ ul:first-of-type:not(.itemize):not(.ftoc2) /* undo side toc */ +{ position: static; + padding: 0; + margin: 0; margin-top: var(--size-line); + width: 100%; } + +div.maintitle ~ br { display: none } +div.maintitle ~ ul:first-of-type:not(.itemize):not(.ftoc2) > li { margin: 0; } +div.maintitle ~ ul:first-of-type:not(.itemize):not(.ftoc2) a +{ color: var(--color-link) } + +div.maintitle ~ table { margin-top: 0 } +div.maintitle ~ ul:first-of-type:not(.itemize):not(.ftoc2) +{ list-style-type: none; + font-family: inherit; text-transform: inherit; + font-size: inherit; + margin-top: var(--size-half-line); + border: none; } + +div.maintitle ~ ul { list-style-type: none } +div.maintitle ~ ul li { margin-left: 0 } + +/* Contents page */ + +h1#sec1 + ul:first-of-type /* undo side toc */ +{ position: static; + list-style-type: none; + margin: 0; margin-top: var(--size-half-line); + width: 100%; border: none; padding: 0; + font-size: var(--size-font-big); } + +h1#sec1 + ul:first-of-type li +{ margin-left: 0; padding-left: 0; text-indent: 0 } + +h1#sec1 ~ ul ul +{ list-style-type: none; font-size: var(--size-font-large); font-style: italic;} + +h1#sec1 ~ ul ul ul +{ font-size: var(--size-font); font-style: normal; + margin-top: var(--size-half-line); } + +h1#sec1 ~ ul ul ul ul { margin-left: 2.5ch; margin-top: 0;} +h1#sec1 ~ ul > li { margin-top: var(--size-line); } +h1#sec1 ~ ul > li > ul > li { margin-top: var(--size-half-line); } + +/* Media adjustments */ + +@media only screen and (min-width:160ch) /* and (min-height: 60rem) */ +{ +:root { --size-font: 1.125rem; } /* consider using vmin units */ +} + +@media only screen and (max-width:80ch) +{ + body { padding: var(--size-line); } + body > * { width: 100%; } + body > ul:first-of-type:not(.itemize):not(.ftoc2) + { position: static; + margin: 0; margin-top: var(--size-line); + width: 100%; } + pre { font-size: var(--size-font-tiny); } +} + +@media print +{ + * { -webkit-print-color-adjust: exact; } + .content nav:first-child { visibility: hidden } + body > * { width: 100%; } + body > ul:first-of-type:not(.itemize):not(.ftoc2) + { position: static; width: 100%; + margin: 0; margin-top: var(--size-line); } + + /* odig.light with slight adjustements */ + :root + { --color-bg: white; + --color-bg-highlight: #CAD7EF; + --color-fg: black; + --color-rule: #DADBDB; + + --color-code-block-bg: #E8E8E8; + --color-code-fg: #16191D; + --color-code-comment: #747679; + --color-code-keyword: #874aa9; + --color-code-type-id: #a9874a; + --color-code-string: #4aa987; + + --color-link: #557dcc; + --color-broken-link: #f71414; } +} + +/* +Copyright (c) 2019 The odig programmers + +Permission to use, copy, modify, and/or distribute this software for any +purpose with or without fee is hereby granted, provided that the above +copyright notice and this permission notice appear in all copies. + +THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES +WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF +MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR +ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES +WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN +ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF +OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. +*/ diff --git a/_odoc-theme/odoc.css b/_odoc-theme/odoc.css new file mode 100644 index 0000000..1dbc9da --- /dev/null +++ b/_odoc-theme/odoc.css @@ -0,0 +1,334 @@ +@charset "UTF-8"; +@import url("fonts/fonts.css"); +@import url("theme.css"); + +/* Copyright (c) 2019 The odig programmers. All rights reserved. + Distributed under the ISC license, see terms at the end of the file. */ + +/* Reset a few things. */ + +html,body,div,span,applet,object,iframe,h1,h2,h3,h4,h5,h6,p,blockquote,pre, +a,abbr,acronym,address,big,cite,code,del,dfn,em,img,ins,kbd,q,s,samp,select, +small,strike,strong,sub,sup,tt,var,b,u,i,center,dl,dt,dd,ol,ul,li, +fieldset,form,label,legend,table,caption,tbody,tfoot,thead,tr,th,td, +article,aside,canvas,details,embed,figure,figcaption,footer,header,hgroup, +menu,nav,output,ruby,section,summary,time,mark,audio,video,button,input +{ margin: 0; padding: 0; border: 0; /* outline: 0; */ + font-size: inherit; font: inherit; font-weight: inherit; + line-height: inherit; vertical-align: baseline; + text-align: inherit; color: inherit; background: transparent; } + +table { border-collapse: collapse; border-spacing: 0; } +*, *:before, *:after { box-sizing: border-box; } + +/* Basic geometry */ + +:root { --font-headings: "PT-Sans-Caption"; + --font-body: "PT-Sans"; + --font-mono: "DejaVu-SansMono"; + --size-font: 0.96875rem; + --size-font-micro: calc(0.675 * var(--size-font)); + --size-font-tiny-ratio: 0.75; + --size-font-tiny: calc(var(--size-font-tiny-ratio) * var(--size-font)); + --size-font-small: calc(0.875 * var(--size-font)); + --size-font-large: calc(1.25 * var(--size-font)); + --size-font-big: calc(1.5 * var(--size-font)); + --size-font-huge: calc(1.75 * var(--size-font)); + --size-font-mono-ratio: 0.87097; + --size-font-mono-ratio: 0.865; + --size-line-ratio: 1.5; + --size-line: calc(var(--size-line-ratio) * var(--size-font)); + --size-half-line: calc(0.5 * var(--size-line)); + --size-fourth-line: calc(0.25 * var(--size-line)); } + +.odoc { background-color: var(--color-bg); + color: var(--color-fg); + font-size: var(--size-font); + font-family: var(--font-body), sans-serif; + font-weight: 400; + line-height: var(--size-line); + text-align: left; + display: grid; + margin: 0 auto; + max-width: 130ch; + grid-template-columns: minmax(50ch,76ch) minmax(23ch,1fr); + grid-column-gap: calc(2 * var(--size-line)); + grid-template-areas: "nav nav" + "header toc" + "content toc"; + padding: calc(1.5 * var(--size-line)); + padding-top: calc(0.5 * var(--size-line)); } + +.odoc-nav { grid-area: nav; } +.odoc-preamble { grid-area: header; } +.odoc-content { grid-area: content; margin: 0 } +.odoc-toc +{ grid-area: toc; + margin-top: var(--size-line); + border-top: solid thin var(--color-rule); } + +/* Media adjustments */ + +@media only screen and (min-width:160ch) /* and (min-height: 60rem) */ +{ + :root { --size-font: 1.125rem; } /* consider using vmin units */ +} + +@media only screen and (max-width:80ch) /* Basically mobile */ +{ + .odoc + { padding: var(--size-line); + grid-template-columns: auto; + grid-template-rows: none; + grid-template-areas: "nav" + "header" + "toc" + "content"; } + .odoc-toc { margin: 0; margin-top: var(--size-line); } + pre { font-size: var(--size-font-tiny); } +} + +@media print +{ + * { -webkit-print-color-adjust: exact; } + .odoc-nav { visibility: hidden } + .odoc-toc { margin: 0; margin-top: var(--size-line); } + + /* odig.light with slight adjustements */ + :root + { --color-bg: white; + --color-bg-highlight: #CAD7EF; + --color-fg: black; + --color-rule: #DADBDB; + + --color-code-block-bg: #E8E8E8; + --color-code-fg: #16191D; + --color-code-comment: #747679; + --color-code-keyword: #874aa9; + --color-code-type-id: #a9874a; + --color-code-string: #4aa987; + + --color-link: #557dcc; + --color-broken-link: #f71414; } +} + +/* Block level markup */ + +header > * + *, div > * + *, details > * + * +{ margin-top: var(--size-half-line); } + +ul + * , ol + * { margin-top: 0; } +ul, ol { margin-top: var(--size-fourth-line); + margin-bottom: var(--size-fourth-line); + list-style-position: outside; } + +li *:first-child, li ol, li ul { margin-top: 0; } + +ul { list-style-type: square; } +ul > li { margin-left: 2.25ch; } +ol > li { margin-left: 2ch; } +ol li::marker +{ font-family: var(--font-headings), sans-serif; + font-size: var(--size-font-small); } + +img +{ display: block; + margin-top: var(--size-half-line); + margin-bottom: var(--size-half-line); } + +/* Headings and horizontal rulers */ + +h1, h2, .odoc-content > *:first-child +{ border-top: solid thin var(--color-rule); + padding-top: calc(0.75 * var(--size-line)); + margin-top: var(--size-line); } + +h1, h2, h3, h4, h5, h6 +{ font-family: var(--font-headings), sans-serif; + font-weight: 400; + text-transform: uppercase; + margin-top: var(--size-line); } + +h1, h2 { line-height: calc(1.5 * var(--size-line)); } +h1 { font-size: var(--size-font-huge); } +h2 { font-size: var(--size-font-big); } +h3 { font-size: var(--size-font-large); } + +/* Phrasing content */ + +em { font-style: italic } +b, strong { font-weight: 700 } +small { font-size: var(--size-font-small); } + +sup { vertical-align: super; } +sub { vertical-align: sub; } +sup, sub +{ font-size : calc(1em * var(--size-font-tiny-ratio)); + line-height: 0; margin-left: 0.2ex; } + +/* Code and code highlighting */ + +code, pre +{ font-family: var(--font-mono), monospace; + font-weight: 400; + font-size: calc(1em * var(--size-font-mono-ratio)); + color: var(--color-code-fg); + overflow-wrap: anywhere; } + +code span span { white-space: nowrap } /* Do not break these units */ + +pre code { font-size: inherit } /* don't apply transform twice... */ +a code { color: inherit } +h1 code, h2 code, h3 code, h4 code, h5 code, h6 code { text-transform: none; } + +pre +{ background: var(--color-code-block-bg); + padding-left: 0.8ch; padding-right: 0.8ch; + margin-left: -0.8ch; margin-right: -0.8ch; + padding-top: 1ch; padding-bottom: 1ch; + white-space: pre-wrap; + overflow-wrap: break-word; } + +.arrow { white-space: nowrap } +.keyword , .hljs-keyword { color : var(--color-code-keyword); } +.hljs-type { color : var(--color-code-type-id); } +.hljs-string { color : var(--color-code-string); } +.hljs-comment { color : var(--color-code-comment); font-style: italic; } + +/* Links and anchors. Note anchors need to be refined a bit further down + in certain cases. */ + +a { text-decoration:none; color: var(--color-link); } +a:hover { box-shadow:0 1px 0 0 var(--color-link); } +a.anchor:before { content: "#" } +a.anchor:hover { box-shadow: none; text-decoration: underline; } +*:hover > a.anchor { visibility: visible } +a.anchor +{ visibility: hidden; position: absolute; + font-weight: normal; + font-style: normal; + margin-left: -2.5ch; + padding-right: 1ch; padding-left: 1ch; /* To remain selectable */ + color: var(--color-link); + text-align: right; } + +*:target /* Linked highlight */ +{ background-color: var(--color-bg-highlight); + box-shadow: 0 0 0 3px var(--color-bg-highlight) } + +.xref-unresolved { box-shadow:0 1px 0 0 var(--color-broken-link)} + +/* Table of contents */ + +.odoc-toc { font-size: var(--size-font-small); } +.odoc-toc a { color : var(--color-fg); } +.odoc-toc a:hover { color : var(--color-link) } +.odoc-toc ul +{ font-family: var(--font-headings); text-transform: uppercase; + margin-top: var(--size-line); + list-style-type: none; } + +.odoc-toc ul ul +{ font-family: var(--font-body); text-transform: none; margin-top:0; } + +.odoc-toc ul ul ul { margin-left:1.5ch } +.odoc-toc li { margin-left: 0; padding-left: 1ch; text-indent: -1ch; } +.odoc-toc > ul > li { margin-top: calc(0.25 * var(--size-half-line)) } +.odoc-toc > ul > li > ul > li:last-child +{ margin-bottom: var(--size-half-line) } + +.odoc-toc ul ul li { margin-left: 0; padding-left: 0; } + +/* Module structure items */ + +.odoc-spec { padding-bottom: var(--size-fourth-line); } +.spec { margin-top: 0; } +.spec-doc { margin-top:0; padding-left: 1ch; } +.spec-doc > *:first-child { margin-top: 0 } + +/* Indent on wrap */ +.spec, .spec td:first-child { padding-left: 4ch; text-indent: -4ch } +.spec td.field { padding-left: 6ch } + +.spec .def-doc .comment-delim + * { margin-top: 0 } +.spec .def-doc .comment-delim /* make them invisible yet copy-pastable */ +{ position: absolute; width: 1px; height: 1px; overflow: hidden; } + +/* But we don't do it for types for now because of variants and + records. This makes :target highlight be off. And poses + other problems (e.g. need to indent back the last ] or }. + A better markup strategy should be found here. */ +.spec.type { padding-left: 0; text-indent: 0 } +.spec.type > a.anchor +{ padding-left: 1ch; padding-right: 1ch; /* values from a.anchor */ } +.spec li > a.anchor, .spec > a.anchor +{ padding-right: 0.5ch; padding-left: 2ch; } + +.spec ol { margin:0; list-style-type: none; } +.spec li { margin-left: 0; padding-left: 4ch; text-indent: -4ch } +.spec li.record.field { margin-left: 2ch } + +.spec .def-doc { display: inline-block } +.spec .def-doc { padding-left: /* 4 + 3 */ 7ch; } +.spec .def-doc p { margin-left: -4ch; text-indent: 0 } + +.odoc-include summary { cursor: pointer } + +/* Package, module and @tag lists + + Allowing indent on wrap with the anchor makes all this quite convoluted. + Is there a better way ? */ + +.packages, .modules, .at-tags { list-style-type: none; margin-left: -2ch; } +.packages li, .modules li, .at-tags li { padding-left: 2ch; text-indent: -2ch; } +.modules li a.anchor, .packages li a.anchor +{ padding-right: 0.5ch; padding-left: 2ch; } + +.synopsis { padding-left: 1ch; } +.version { font-size: var(--size-font-micro); } +.at-tag { text-transform : capitalize } + +/* Package page */ + +h1 .version, h1 nav { font-size: var(--size-font); line-height:0 } +h1 nav +{ display: inline-block; + font-family: var(--font-body); + text-transform: capitalize; } + +.package.info td:first-child { padding-right: 2ch; min-width: 13ch} +.package.info ul { list-style-type: none; display: inline; margin:0; padding:0} +.package.info li { display: inline-block; margin:0; margin-right:1ex; } +#info-authors li, #info-maintainers li { display: block; } + +/* Package index page */ + +.by-name nav a +{ font-family: var(--font-headings); + font-size: var(--size-font-large); + text-transform: uppercase; + margin-right: 1ch; + display: inline-block; } + +.by-tag ol { list-style-type: none; } +.by-tag ol.tags li { margin-left: 1ch; display: inline-block } +.by-tag td:first-child +{ font-family: var(--font-headings); + font-size: var(--size-font-large); + text-transform: uppercase; } + +/* +Copyright (c) 2019 The odig programmers + +Permission to use, copy, modify, and/or distribute this software for any +purpose with or without fee is hereby granted, provided that the above +copyright notice and this permission notice appear in all copies. + +THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES +WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF +MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR +ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES +WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN +ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF +OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. +*/ diff --git a/_odoc-theme/theme.css b/_odoc-theme/theme.css new file mode 100644 index 0000000..a7a8e6b --- /dev/null +++ b/_odoc-theme/theme.css @@ -0,0 +1,34 @@ +:root +{ --color-bg: #F6F6F6; + --color-bg-highlight: #CAD7EF; + --color-fg: #1F2227; + --color-rule: #DADBDB; + + --color-code-block-bg: #E8E8E8; + --color-code-fg: #16191D; + --color-code-comment: #747679; + --color-code-keyword: #874aa9; + --color-code-type-id: #a9874a; + --color-code-string: #4aa987; + + --color-link: #557dcc; + --color-broken-link: #f71414; } + +@media (prefers-color-scheme: dark) +{ +:root +{ --color-bg: #181B20; + --color-bg-highlight: #303644; + --color-fg: #8C8D90; + --color-rule: #2F3236; + + --color-code-block-bg: #24272A; + --color-code-fg: #A3A4A6; + --color-code-comment: #747679; + --color-code-keyword: #7F668D; + --color-code-type-id: #8D7F66; + --color-code-string: #668d7f; + + --color-link: #7788AA; + --color-broken-link: #900505; } +} diff --git a/fonts/KaTeX_AMS-Regular.woff2 b/fonts/KaTeX_AMS-Regular.woff2 new file mode 100644 index 0000000000000000000000000000000000000000..0acaaff03d4bb7606de02a827aeee338e5a86910 GIT binary patch literal 28076 zcmV)4K+3;&Pew8T0RR910Bx)Q4gdfE0Qryr0ButM0RR9100000000000000000000 z00006U;u_x2rvnp3=s$lgQIMM!gK*P0we>6dJBXK00bZfh;RpzAq;^h8yChW*tQI) zf474tf9UWmvjer;At_qJJ4ObAjRSzte{IG8|DTss#?U6Pq$r5$-28t~$dN6wErwJo za~1SqW}?_^GLyD_B})qv!-NCu+2=w|xZXP?WH@?W-qc{t=*Dc@7G{&*Rr|f2PJS1C zhC(0s6eQ>iMjQ6NMr%a(8W(NUg-6j?jOV&o6a!>CRL6BUiA-uV3!83tjRD8w9Q zTS)(|WV)+(idwaDgvnbaZjk7gd`Q54BYKt#$^sjr>VY-r-3%|Gm46yDaW9 zA*>`MVXTA%2t!Ch7$IRKA?zg}h>8dZvc$1L!HHv{b?xdd&bo@Vt*u>ZTiaS|hyA~G z{@0vZsQ;#>ocmS+q4P+Q6bJ==`li~vx<@m2JRmS77FvoOGC`1MckSwYimL)UDdBE= zU(y{*T007`?KlPI+1(^67zzMC`>m=oco?9F7&)oE+s{ZQpTPk8{JE5yXE%chKZB_X8HRih-qey z+?Q-qv53jN4{v&CO1eskfOCJa3iT;f#6SE4=USD}rard`&95=?zssa(BF1FNtXLQ1 zZ~TM@OYAGf@a}&8C9fbbx97ge(q^cIwlr8&Knje!sSE&n4+)%A=~R~^uDx$0UY7!KfcrV?PMq?9a+|xdk4sNTo`xT10ZSpv)=wBog^+? zNVtS)ZhL_W7i(KX_NCm#VEfLsy7t$Ty`QJ}p`|<%v{So>8SwJ~C zVK#U35`M*$l6LT#61}{p@LooR$I7G?Dbu5I6a`IQ*PrM2%Vs~gE%8~3WQvFrG9l=GIBt*Od}N}61FZQE zW6Mf!kslWpsbCTqTnlB6*K#9)4p5JHZFH&`%3(OTE6|h<2UbL>qb*@ zdi((~nNq)2{fN5qp6w(l(`U|}JCzK7tnN9WM5dL+$_%{~I)_r%rEhNQi6GO2QuU|q zeCl;wSf6R{mi}5F*{a2Ew{h$Ct$E8+)>QbX{}q~VpXSif8urVbHvX((@}GE29{i8L zdCj)1>qpnEU9o)e&|rUG`^nIk^FgQGs+6Mq7+)?5!iR%5FP^Z$K>>>T{oB_sI_aRj z=9+1$iKKyw1w6$4+{2v=0HnltxENCns)G`v`tJa?H5C^c{juAGRGbNd1U~z~&9i35 zPX9k@-dqCC`5V$MzXfWS>31JT$j&<=o~|&#q+%#X&U=D9f&}Tb07^pC z8A4D}Ml(bpUi=JEpgBQj?p@Q0JR(Ld$V{b0(M=-!GzM9T2&>ePayD*}t}aHUw0`1U zqAh3k`sNdyBBCu%ryXEL5@d#BYlYf%ScoEm1_cZV79k;{9@e1&FV>h?{?_{GD7(Wh zY1_fC_`40h2NZQV*O+^9i~e{hP2`(RmzukYLXF#SsKVb3koS} zGo%7tkm9K+i*(iji%E%L;JlwSijC1)9V3dU&^wAc&}hpw0=5-5{wk5$_LeV+$da!^ z8b#IXq~ya8YnKKV#JowMzYH67;%Gnw>#XGHksliuD1 z4sf2#;qa0o2PoYrWJNAO?TE>sT z(}xekn~&2z=l3sY6JDxL>F`|BeZ8tw6Rv1#*+3OHNX< z6Jb%r3)h9~LdqRcRT&Wfvm>kue;~LdmM3h6LKGkfF^IU8yo`jrf;@Q@`SKnV$Px-= z8AY;!Vp&Crj0UxsKu8w4l2+b)3W8a}=W_;cvxDj&lQ4Yr2Pb9t{F(&UxJI&j!s=|A z<1R_0NRVOpV8}5P7)lIZ3_lEii~y|Wp%7rZ-=ff1q-#NSB&_OKTwxOwuB*af#BQ|f zM??*vkDP{**5&fvK8-pFP?$Oi3#V_p?0Qk%E>xZEhIvbsX2u8>zi?VTqAUP95iv1Z-#B z=N-iKV>YNunx63yVCj{mUVk1=D0bUi8Rgqcrq|mFgUCL9zVxEZ%afMIYo2;A`#8NO_<8}^*$kwG$g0S*nh%*GK&lT^8}ewM5-i*4~PGo@f> zQ|k56T$}Ui2}bS8DNA0<8BIMu8^0zw&=xd4=Co{hrlVawYC0<=E|wNC)NWt_+csNN zIy2>Yd&9>MT)nU{K-+%zI01}~!&aNXn8=b73hfeR-9NCa#96A=SYpGWNUbctpU67Y z7J#K8lOvdw^(gTq6h@CLI^DB(i+(9XVsJIP3jUo<&yY*F$chz@DY6b+v_FGDRQ zy(J{GB{=zc3(j-n&Ty}Y_Pdh0y#)opnLCVBN>(uHh0=;ZxGnJ@^m0Zr-cbtrHMS^? zNh(@23`?3Er0)Zf3>h_v5-VE(Y6BoSvdJz^&>)f|Z%vTDFGLE~pdncXIU=Aj2&7~U znnsprIfEI^0gwtAEr}8*R{&ZAK!m#T20JKi7ISYQ2W{gW>o46 zflKhulrmUm$h6DSOL}awKG4ZM+dIT|p`by_jEb^GApmv6KB2nvQHeZ)Bec)KjUew6 z96^GE+JOPt)+pLSTRO>XsgQHp+4~%Em#xTZYp-nt7~) zx>HM4mn5}Jn?yBpa1fmen=5abpF<0#|07r1x*O`frFy%cL+Gimn`I)c4HKN#m zIKP%|dFF3UwR1vwX))!j>Nu3_PfWXtKLY38%rwbGl%u1PA>WCOBNV-~J@vg!lslo^ zYZ`v&sQQ0TM(3S7?nAqSA7gcey?MoKbXm86K8X*vv$vTW^zOCGmqfT^j!2N>PZqZfU)eC3Hb=u8e zO(~5mfdl(i5Kvx$-1BDNYtAtCNL=20#}ueqcbJhU~P*IcLl; z_D~AMFpw4E&FV%7kVH&Sk>@9*V4hMowiiV^D{Vaf<0(?tMI z!^6Y$H6U*loW&SHRI80w+*uN#o0TldfGdFDIh(u^5M-9+S(fEm791Xq1en<(E`WZ6 zY39v5wG>wsT>%2gf>|(4v}JCy!t}XDU!K8qg~_%fowg_lAny~xe&#M$xPO-}y=1?? zl>_t&c4JmZy-T#|)&oQ%RCGob^~BW&0fsh&y1&k{YJq4JVCR?|L58Ww7K?n)UERVA z%`4e&0A?&QXtKa8#S;_8R7T)_Ea$uiq=H)v0Jx!8LPoOm1m;~rE!qOoj*j3OJJdj+ z05v90+M(b?$=H(9nX4=8K}=AQA2w0?3q(E3p48wbMsRExq6(SBe!I&9u)Lb1a43Q-6}sEG!ZVxyG*+ll5axyIqi^b^#xIg-4M!a8D~7gc)W`%hsSj`=6n#R z2nNeT2BXREw+j#eH={#a3@`KtE{I8(Jkdjpaiww8X_6=iaLKnWS3VPbG`C3}A|VmX z+Aq!x2@T`sJKJVXV_Yga8fN@u9SGcCj^nP)J}#;q#Jq%rK>)A&Wg6zXGD!u#KIjuD zB>XhDF{W@f(MJLSmc!m7-|fYj-rD)`h10aRICwFz08JX)*Or>@iG};P;bsK z(jq_Zaxq2`?3gT@0pj~5(adkYJ|UWb=E@!D5U?e_c3wX3#SVwz5qc2jBK}6b>ja5} z{(nLRYH-nvzS1}&c!f!a)lr6cfl)SvzegRtip%46O`#a^@;Aeo1xf$@nZhAKK;9|V$kRhc(i4W4rk&j=S-bD3~YSEZpd z&mnxiE6#B(4E}^+Pkq1_K1!kyP!*p=FmbV?sG#^7M)ajCIHM7gQ7C$u5C)UI%5@dmt5!KkyX@MMhBbKDvLxX`695gPgE3LGx@MYKA6bkf+6Xu$acWM7t=Ij!ylQ3qP;rEJ zx_s%uS38Y>gG!in0FosChn+Qb$GdqOFA!kPUI#H=sVFFVF6DPFHBF5SD^v+E9*(If zLTg_->iw;naC?0xk_55eZhYD5FrIHQ{7kBFn=x*w{Dh8`wktpnH)O}X;?U(3V!^b=q;!l^% z<>sZ7$q@#b_Co1k-HVn&0^PKjU_qOrxFZtqY!x&1Pst~6%H!ur@c|VasfMCHS^ZIX zQey%IW}(33o2;{wHGH%~htcTvASztNZo;%dd&x=Z6UUCB3VQ+>VF+Pwaxa0R9LfP( zjDJTatKub0J~rX<$%x|0hU&+RE%;g)E$ulF)PxHVWrgF%i5fd^{7BzN2Z3RB{jyt) z+#WoqSS@m~OQuj|oU=!epU@V`D>FG~Lc{R*%_0O?tPL9Qn=B#k_daZGk0W_hMhgI` zVtW+%+0P%LHDvrIi{4<^w9}TR;a~qzML7oUuWEo&>+D36`9&~p=tRvbsScY`y=itX^5edpPEjaOB{VPKhoX^^yT_NbSpi961y^v z75v621(PDv+Ajhy6ePLGKw8^|S#$#^5E_R zZF-Pi1Qe{>@HB-z${K|-j}jdu4GG?C%p;gUQ2Z=qm(q=@wn(ey1lUXP@Qf3$BeegO zg_3>vteALF12*~I(NIxcE>Y$3!Dh7_88cZ3!wWX-Ayouf9Dqp_^59!dG}DrfX_wul zBV5W@s1XEPoNwMfkCS0O>SQCN+kGtX@=Npz$LfJiHh;9cfz7JUZL_t{$y_p~L7Mui zG=(Yim3hR8*Gce~gJXc|WP=GSB)F)G!H}pI%kkxr2(mGu6#7K!{JMs69JL7FR|m1t zr2Q&Z!h8wC69E8|8n*PJdCbFrvf;BzZk+#2^kX6wKV|<;PxLA`{k>XT43WLeoUwHk z67mboKunnX-BRpz4ZmH{CV0>o zA~@vboi2WP90`@UIuS{(VG9hRR{}nRtNLg)dfNp5v6gl$*Bb9_?XVS`kY0tPr)S(NtH+wJ!g5QUlgDUEZKrtZjMk4+JEuJ+HGJR5r zbS#dVZHBH1Z2+h4VOHgRc`C~6TImqW>^MPP?`$ZWMrTPGzF}j_gBy{Epj_ohbrGsK z!vU3sneup*>`z%PTVmr8Dt^08m)c3oBfkDnDWG=m#vFTq3M^~AQV+m}GzxenP@FA$ z39x0}3idwGqahrl;Ee2}+1%{Jd^N=iL)?9D3WOz1ij4QNGBX0-0Kp_$m{Une52HFD zs}L0br;yY5{`zwPwF8#GCQfu^yjM_L^b_d_Hag!~x=pwUtKPSSUV>A|V#tN1E3_@d z)DjTH)>iqi%^DyB&RN~ zd>&`gIGQR}aPvopY1UbqUj&d$3QnNofF4W_6aa!#Jp?J&1rm9REVXWxp3dASFW76CuhjO} zhSI!56VvR{lb1<}RDt$Qc?&QzMg~xRhm3BS#QvkpW*}xJUX#le^0*z%+SYx`F~jIp zhixpJN8UBf*B`&Wnyz~+=a@Ry1lx&7BBB=v=cDd>?`|tgyWh?J2bW>yKlkxbV05{Y z+>Gn=7tyRV!_H$bYUc@X41pLJg^CUuK``255lAx&;D~D3e<6S{u)bN?< zT}6dXn0R_6tb{4Fuh^K7vM{*9yh?_gz$8!F;dl-cO-*;)X^UNLz!*5WdQdpV1ST7- zvIRN^qi#Eq2%T7&yG-B#Drx1U{@OehANOBAjLBLP$V9u<#_?*!3V1eF!Zd|c1E@cA zz%7gsd4SpQaBo>WQdL01Vv%3&B-4)bMvbBBt?p`%o(q6$6^soh^4Wzrt?t_-+unv1 z%&JV>Tcg9Z_N5|EZ5AAABnqNyv_CeMl&Q3ZW0b@CZ=`v(;c#&@O{^5>d)e)k)0kk@ zj>A57T%OcJmeqQ%-->Zbp#48b|6q{D+7}Dzswks6t;de`%Zf`x{u)3M7 z_nAQiL3kd;Yb#i<){4}srT>dS*cRAS8gp^PvP%M07Ru~j;L@GTc{6IhsD-WT>zVpI zc`HMcZo9K^R~<;yA&cGuOWZ=oV{ZtY_=$FVWr+b?=WGb#tsA5Qj!6;!1i`V`leUjo zSH~U2SLdBxCQfV2SGRF%!fC?`Wyl``6Y0Y3JebJ5dFruCi-Os<&|R`=TDcWZAR80< znFxee=5V@Ks(g8kjUb{Ve_`|ty88K8t~QV)D;N%E>!}Gl<|eIG-;{z z9_~T@3^MF*U#a<1!AyItjaSOp^7|YV(Edu-v&iBa;;gP{Gp225p%jvw0G+9bn#yJ< zDi|)T1+mw_D?&#Yb~i2QPZ=nu2G8xcWtSm`src%&gMzCB?eG8#BXcH}Y7a+~SlpaD zoQ%}Qj8ihBRJ){>JiLN>rKhxOn#Hj7gVBb`e>`|5<65>Bj5R`<4NLu@5>1kMQz^+< zz;mwP4iktg(%~h0o&$D|e3dZB<+0-gsK z%6{kt&mo$1K9sfk^l@qA=9TYEpi9PYLc@gF6Ji-O4Bm7hl5MqA$k~y3#}=~;tnu$w z0w`q;>47{Vg~{ZuTgiV2jpF%#MIyG>owW#0 z)VVIDrHCHIPhnIknv*@IAyKW&Z$@7sl=F}ABLjYBkF*cPt`A8U^MO5OCg)KFOx%* zcJw#xI>tLYELSjpU*^q3A67}vVwbr%p?ZemwaY)HGV-KG zF7<-UiIv6IV7kgqno~qI+RbunKTLT7%h?+|EynV^w|p*aGQ8(Dd==Vzug}(KKi~kN zZFC>9cL`=R)%uN`7*1&y%9j80>!7l!Hlr1tBUun9c7r{CgoNb87C+4noXH+edK4eX zKGgS(!KG2;Xy*To+51xU7S6PIeFpPZ08zO7?7Hpo1)?QQKxq(Uu~qZRbL*GtTkQ7M zfDWI+i@2l3SYF2tK*KJJq0+`9t@D_XmYWUd#lsx02k$9ej_n2Zb=eZ9NRxJSZ7f*6Rc+->2g3_7A?CcgP=NnL zqsT#3du#KdNUNGer&VpfJav%R=AEditkuKy2Q=X3QpuiE9N9|-|5GE6M#2an{y|z+ zGLg!&HsUyP^GE5PBQ?aY4eL3cQBXzJ4@2-uYxy>|&e#5iBXWMAJXt=cBcGuCn1P;W z^ovAfAGQ~SQfXTiaBC_+>@rGGX}r0jw>VC5Af9LBcyQ?TmTGEy1*t7GNurL$I#yCS zdDfY3;+KlEJC2I>GGVcAy)#R-Mk=s%btQB-sWMNILas6C-?FM4CmNeIp;!YPMJ}eV zH>!Qpg=3$hs=Ifn_pOJ?Ti^lAtv88@)S}s*Q^wmhS=NiunoH;RY5czhEPeLVW8A-Tr(q=sQd3qtnm605pU_t@>npbbUe7ry zHvwStEvghqUsx(>WtMlyw;=Ezp?iCRW9C2G(aV-A6w#!NwJ#r{5PI_~KKBHCeQ|Tr zlbqsENO;YdvO~xG*4GizyUF-JR|75DM}RJmtfrShDtA2l&~8E2&4#=0Hm@kMwBR{+ z|MSwZ@4ow{+9Kn8`XyM5F}AP{ljYS9^`cs=Mumni(-CtRNll)~cs;IuV)d3 zBl)=N(*0(j`PKCtGkiC~YkZ3N?cBUd4P>C4NOp}O;hBpi{3=s~$Za*6K z_FSNto>>KgDIdhV@wf~}(Ok`t09KxT8|$UeqWb4kCxOu+E?A%SA^W+u?Q%dV8BaM( zUVw^yT4X;_@eMkYOuJmAZGE+YH#tc~WiIot?Qn3)Jt-YQAEH!)?LUvyL ziyBQ!zizfU(ZPWVXjq2$C~2k(+rbF*@b1-J*rWl27 zjI=J|-2ncP<(I_YCuk$#6@pX~0H`;RuR}h1G5nuj3yOl>?lo#37fd>)l%9sYOI>qU ztJo0{OYH<``2Y&9)Usj`P6LTmks%qged!X0m@{m4w^AgHp9Tq#9`AR-bX5m2cp3Q^ zcSMgN%LYZAFtHu=T7E;!;xG&_TsdU>}4_-wPn{)QAGQ%}SF9IBGt zlxHky@I(|6#FPZWXk;c_zOx5B-~&BdKNH#K4o^U?^>(>D@bo$@MKf_%34PGRKRGEV znxXHnPy1R{HM-{40f29HSIl)@9Lyf(;5d@GAdUc1H)GK&Zf!m1>?kp6vYVO5cA(gb6rSz{o*nyoPdbyr zh23@5qDlD&>5kN|AYJv3@@fZuTg#;WIP(48@ow#bu`y~3?b;;mMB-(AICtnfzT>#B zeGzIL&7sHpTAqve)wq(X4jmC41$2QyOU&Rn>+cDw-xPM|V{7g_aEP*(l(I-FINtB5uJjH>5+fMZC zujOyP(p$jmN%f3hbaj5}CM?p2;=EOt{>BaP*xq!Ps}|l6Sh)Z<<43{-V}ZsVZ7LJJ zyyI4Wtyv9<)CDuplSa9U6;13xX68;I7yW@3OqJn*g}OpqLBrV&(#9A)3o^`v!fPNF zm8UczpVvIYtsFQdlH*G3@Oa^-4}$QqT2S`~Yz5!o*39jbdLo(2J6VTL@UxNxeU`vpX>8_9E;kOtP3Zg;w` zsfy9lzhyM)a#inf2f*yh<{%-NG{$F*kZtt7Xwb;s=0mU!^BmMx!p{M9nsbVt7%qqs5yPr?B>1^3?@!Ci1%buN;eI@> z-3q|HVmO&008!m_8E!Mw7Crww9+`Ck8=A{Str5^Y@wwp9uxz)ZunfJjkWf1m-M?s# zjBzJkK-9t#!3{3<*AE_xsE0ahl0puQIBQ(?a$}1|sw4`FS7ImNv|-f6lE$>wjNC$NY(BWR>)kgK(A9ScNj6zs-eP>6BE(VFQhYa+i&|Xo2o%I zKO^{>NmA2I#3j&7^4vPPB$dd#XTP!BF%M>dHO_y5Nw3{kBYV}VIA-gYTA6qUMiCWp zE?(Ms$!y!-LXLqMz+={EW0qZ2Bjqx%zE5WWgmXTkgJZ{Wjt+>JnMp0Ze9neplA|Y8 z!#_{9yAINCDte;t0%yUE=br1zk{6WJq2Y?38;+^%Tv2W(ht*LEwjeJU-v1ISHzy;p z&peZcAL*)Z*p8)}_7pf z3*8MaLDCtQZ8y-ccFL984f;RW`Joakxgasl_5&9R;lNF~_iX$fV~f)z6>@)1r0!GU zE9!})=fyYtblFKRXijR}8tJ3YI;#|0#>X2nrf$a@DyT4)kPZ15(V&{Ahz^T#_+saP0D0lf(*g8Ytax z3J?E<*7z~>u_|V=FwgXL0V9iJU8soR@})KkX3ToUN)1HGLG5p)Q(OU zSV?GU=Dh82Q$#J_$7kKd2w~8GVdt)gal=L7wo#z|UDw~T(sI&I0Sk7jCA^a^=9#P& zPF|imA@!XfY@_u*r)?_dN2_R_pFEW*{1(qshy9>6$^4z4UiR))#+yMyOVir=TtQgJ zei6~)8p+nZnSagKraJ!#7`G}YFnekCnba$VT3p2Db^Wn%`!Wf0YjvV3wLL)RD*N3* z=X@YwI_PR8C<3ELIx^j;Z(kvV+m1*UL5dOscR^WMxY z@7U^9{ZLkA+R%WMBgquwAm2N$27^96|L8vGTVfaX}n~e zh*#&$0Gzg%xc0|Qd{)0YogI2mi#vd+o;@`-(}s0~tv^(?S*w%rG5ci;g{r_7`foD^ z-E$`j(sj)Kuc3qe@Uz>T3h&S&6&(h(5q~;rLfG(&kZFVHG2Q^-hlCQg=f4nl67gm zvVkr80D-OD$@V@=7p*|cGm~h_T~toC4=?>fwo{rTHoUK}cO9^eFOQjv@ih16oZ{d? z8kpqH{E|%!HwVh=(g@$&Z9Ok(C)>B``(V_t$-?)k{hf&GM_o-Tf(u}@Wq1CRq|Wka zj~};*%<2vNW-ooc(?X}&luxqmrm&G*oeao;Fw$6fM!V`9gSrz?<2QySUfAU(Ct|QZ zr`OxVzD-xfeWtykzNAqN&3`0vch7gdyy#$DW4Vwg{+|Tb5r1{ujirL zftA-mV$YvnVq+;I)VWAC<%c_;kH~DunfC*wo|lg3gtJAj0}{EEOZ0fqhSu9H&=T0Z z($vS19blLK?7{4qe&d#YXE8nX4t5lXXcy(yLhA5eR{ums@urK+X!y>78sLMyQ&zia zTve{Phx{HasWft{YlZwRK3Cq+?$2G=D}23RkGcP~dNTS#p68Nkd|s;v{qA8`T3`SG0n;V{8;M6Wa8n?f+&2mvaP`*v zPby$$WY67>g+?fOvBc+MeyX#w5AzA^FH+O`$D`>9onaCW?WToO_oT1=G!5(T-ysC@ zK2ice3NlEDh6YNM0!tG+6H}NknCjn%r0l2^x-3hf0g>HS$1h;A>~@i*Kk(g#EW4{@ zUg0G47A)~{FtceGtJC?6&(YEz;SWhCAlErHBiv-aTork+$j#{{c-gWz^tOzvIspV( zcGFvTA3$Ivv>li9r?(|oXD7psKspBK#fP9|r)D7^HOS?1-0Q(BWyAl==3~YBZn$w` zzOnR2l&rORr%HThtffMg9vMGHb@R%}`~n5qHgDlq}0`}VgYrcF+G?4@CZ0W zTxKy(K>9efWzHZ0B@w{jusVPtQUc|vD`_Z|SqhJ^nZ4Hn5xYlO4o~R-gW() zJbUo^>@r8e5c@tAzNYD3ey3o2v#`A!jR~_mFq4KeB#6G5lN-@2begj9P9D|zt4}n7wl;PR)hp?oM95|8cpKL9bWCng=D#IoW*=DKW;&q`)*jvE z3_N?Uk0hzRyAzvDd(6xSM z4Z;o zqPvRdqaQ{t;u&81q+5IR@KWK1KBKNwm&vpWlqwKXQH54krd~;Xh6+Hm-`bry!Z`JT zp6-N;J2U#APj##rNj?ioX$e`@tOS}AvQ>yJhy+H84;Uk**uXyN_Fg?LAFdRHLbdJ> zPwAiMo!rdlh^p#E-m~M#MRcZb01^dEZ$PMj3{{8NCx`0)Qe9#T*R|jREQv0592G6bVF#A50kF`WYS6!>RO|bl~T|w?`HK@ zrGLyy&{to*aPSL&ii2iJ3HCN(e#JeliB9t5?OipMKP6=)J4cW2e|mpB?6dm!>iUVD zFM2)j+|CS0pll}79~MNJToGhnMVhV9B*=j40D1GR+>c9TH-1H1M?u{$0s3&%a9h_d zF_3 zx;AU-!wr7v62r{!=*#am; z1j?0QvIQdY0!huN%U0DXBJza1_rn0yhhWiSU+_nen>kKH3-mi=IpR+$d4}}*GxMqS^0^cJ_756I=NoX|0=y|HZwUu`I{U-P(E6^Rz9}_%@H?s2K%4_B4~qv!9BxsKzQLt+xaIT(ISMA5qI5A zZ;kXn4+a;yXTX1V*9U3P((wXZ$QeAmU} zue^rZVoEbc^K0l5dx5=lW-7c03ol)kyXZgMcKSXZc0GjO@XV<)xt)5L6UDRVxJf_g z9GgSK^upXpbf_nbb#L>ZLgMN+UyFFb#Oio5R4)Wo@L5&{4FlO)U7JsTMnmYZr zh|>)18@*g1=8|-iwlt-H_|90z;J(t$h;C599NYcWiOaC`%aSh?bvRZBYUPdLR$M^e zi?Oy7|Nq(e);VKU7l<4#i4kbmzm8+LF1MTh4!!DA?8Hv`% zfgKun;HTFW%K20SwLiZNnorgF6|oQ)pI+2rVq{QprmxQs;2I4`_`JITwL}FSBJvH3 z_g^Zb^7D&G7ruf-zd!{CF6kQBdFx4`&l8ejNxY~^t*hPrDfg(W|8qJm$m>Co5lj=B zWS=l(w}vEM@Qzu_ppVfJ3QRH(>&Mi?Owui$6c#Nzocp|~DI4|R7m@gSI%BG?-cjA? zd+F{s*B3X$CAS`8dVkKtHqaSs)Wajhwvi5sp#R%g+v0nD*KXWqVm(X#+5Nx5C6|4T zNeR$f3IRl+E}V8-7We;winUQ$*+W0E|M2MpggG?L*0g4=iAG;fC;t{!ZcUv#6U_00 zyr97zUb_b7wNY3z4gBWnnhwf}Ggr1vU8sAF_T<#oy|vG3_X@%wqc?8x9(?Q@%@!TY zg3T@=cNkPS=Rq5{0#wjpj6aG*=@8UE2GT)81GoOGTr$iDZe~n>LtRIqyWa!!VZu*M z>-L#jrHo1h$Mwvdlu{oTRxxJB>^y~C`i8jXfpj#=V73!nGBX+~7>UW}SB|)QKtTf9 z21%CyJ3K5stKD2}NIBuZn~-RhK+uIi1XS%kn8a3)q#H?dOK={zQj;T_9mf`Sk@UTE z=CJyv&}u*2O-A?aXzBoIQ0hkCKxb_uHmdEu$fJiybG6A&z#PZ1F~Xr~HWw2+ne43c z@>~y?S(V!~m%q39TQ=RP8Fw}kJG)AJ{CtshRG0xen?Oefq^?8q5ncA5)j}Z>!M`~< zZN9UlJ+l%5qoJzv#Y2Fx(KlTkZtzDIRMz%jn-4z(zn>FrTEGb5mbS|%VadUB>;0bTgVRDRF(~JP6c53;71>AV zAuj2Z9X^Gl$f(p1oA=rbvM0jxyu0S(cMds(fRL2p9Flc8)xz_A@J*;N#4-Xyg5i;E zTaN^!U`sz72vGOT<{ax&m43b{)k6?cI!=3x*&zw=|I$RVYaJTSgCg*rAv414! z2__vhy?2iP?2RtP$?iNKPh!!v%ZrJ_GU?%&tU~ighs^n$nVvp8_hh0{pINnlx^UZv z+b};4FB6R9tw_=wJ(S7g`1LJ!Tubwd4UiCm=5LoLRD3u87~6R8FkfQDt6XQ{Zi{u# z-6;}DF_SdBM=N4f-{F`7P`n~jk!-1kt~s(V`O-XvVYN_7aitP^K)KR_+gK1EH4ayXY0Zl{6hjKDluYkIRmm7xF{bfEPTOYyt{<*GPo9a z+Zt&I*NQ@VgS!YJyPfI5dJy1X^EtXRs-)L`ZoXa$VnfJWRzipB8+r7hmz8KVK37;ayl*S+rHP5;$-fx zC7J?t3h|4b@xKlG5loOP@i+fHq`cVu%5pZtr6Ia7EXBnlzVblP^=Y@^c+2)D3nmxR zR@-NMUB!>IOjTMCeuL%y^*+>LC}qLeoa&Vh4O0xAY3K*FiVnwjWha)5_yO}0#3FS#T3Ra6)DBcA*bHo82HTKY4%|0r75iW zzFeXHOoL>>?-AN2yn*gu&dlo&zQsu{!E1AN_IQTkbowL>~vK2zpmi0c)(BGo&S+40{w5dSaBprlCFaw!xt zFHa+de*4BebNyQA33Simx>-4Xr7h}}0&jYPUyDyoPqhaF%JnIEP6#BUsM5eC3B&7{7`73etK>!#q#P@E`Hj+RPtDXwVD0M^_fK z7B|YI;7*!&>UHE6)_CJ6f6vF@{*-uX(EByuy<<@2$sBH`;m04Qo}j_|AKU}i?q-r9 zgmBkiOU)JLmOJ;r_4An+fY9B|J{6B@D+#q57+a)S!HD2(=ZzN|)XVCz1&Ue&L~fI_ z)N|(i&7{4Vqakdy^>+(vzQ1)alNyK=vx)dQIktvI(2@q)7K-2Wv7m(<;^7%V$u6Fe zGrksaEammn(6=AoH6kj^{_H9E5GWPObtnE7{=MNF*|)0#%!e|hRf}1LcpT0uc!So( zwaEW=$|7w@TX%`*ej_Fl6~HMl+AI6!hlww+8o zWqMDooGi&`$*SenX0>FLkn-A|=_xpKr^Lfk+G-7`aD+T|ee4JUw~hi2S9`_vRxgDw z0r0IAYU_|lV7*a&&#DITTFSdtgMr2CEsMtB28fYA!xs?oi|Lg5?3d8kcMYMlK zap()yixRb8S#-rkSDadQ{{8#3t;~ZDGYOQjQv7FZ!Sk!&YS;*fe8-;Jewzs|8{VHU zrQxpk5>oxjO4RnSFa)6_j1;T<%Tp8XxiTo_cYXoNBI6y}X$4Rq&=M`q457<*)DI~GHNeSr0!^TDsD6ix9wN@PL=Se=9Nh5+fg+(oUS2(oB&y;; z7`ateT^~;pbq4P;(Zg(Iso?9UXmnV8FrZ(D!92iz6j4w*C=o&AyLzKf1=0ubvCr}y z^3;mL?94oiF(a9&0e3Bk(zF5%Y!o-b$7S;WpGvx$sBdplv(<`{9DyaZ=dG&h^$}Ox zNR4+ji(p=G*vNLtc(3_qV+%Az#Q)^9OHjfqd^Db%3)N71Wh zpnF$6&9^orN^I<^>8z<%&l;AT%e0SGFPf{G*}Hyy`;hasWO$ak+QRN~s)`CZk+<2X zERPASZ<%saqT0ZfnY7llu;BsK@F+4eDj66Kv!-cHGOj_LXnNU(MWvR&Vo-E+(a3(@ zh6Q?6QIxWpJHa32u3rKo*s(^sSx?blN-huh03ZX2_Xuu*YXO%+`FEnDmkL9y9;Ph} zEDZd24~j&}n(DYPGAU5(<+@f zx@`M{R^c_d@{>BjrX8#nv5V}}<5XNkW15a#PD?86#%K*8#pMCllGx-rVUibRAA?aB zpRF>kwq?Zyztcgxx+lQz&L7=%vd7Ky901%C202Y^I-md ze+^Q-57~IP>Z864&xV!EV$UE?PHVb-_Tyw9TiAa^9$mxC8d@}skyA35d&qhba*wwc{Zi>5J)8dha^_IHaL|y8CPH z|IYOA^SYJjS2ypPH($I7K3e z;3KDo=6CZfVhayU?w!s*cI=8)-SdY|jo=6riC*OH0_XR}aM-CmtKHmxIxwpTcO0@O z2;*+pjL`)Fc3?ny-1WHh#n^b38`lR-FN+Q{7U=w{MIz))-=_8b1H?lY)`)swaM7~K zdvd7ZFmRyiW8z~t=zh6V#F;-KB9YW_F?y#=eKREsibP1!Oy2eSMT3Ln4z|lfVxWKh zrallYJ^qBrSgRf!T=d#q&-0T*{)mVEnfJp-y_UhA8UO?D@8z{3A<{(0-kl@)k$#oD zUf;Yd&B)HZi4JK9w<7P}d!QfL#28=78XY|Fo&rUpN{OM7uMIS31boc-I3pm)Y>ug} z_Z5jC^{f5sMp;Y8S&g7?U{v+QY_OLbo~TAa#1_^|2D+0ei1IBD9q0$o*(4u!gb(F@ zJa_$Ty}|c;_A{FIGe%WU4CQu%`H5r-UH<2g+_RHngw7?U5 zGi^en^mGp`Ngh92p(4kCff@gyj_mD_|Cr_Pl909=JYbAg7KNZG|q}Rw`srEbe-(0rvI@EtA)y+1M>QL?DEd-cD@Ch^#`Z z#+S0-42ERB$A`RSS4KuMycV|20k)M3+uGo^Nm1$wuwtQC#?T}Xna`f8k)(TD$A~i+ z>XGD?4EY1$jT|YWD-vh@L?I}A8hyd}Iy;MxiFSWW^^RT!aJN%z=BJAn17l#-#6Iw7 zIgJ|~XbGN$83Q61Q^61>^QuH)h)fop{q)M*U3WXOzmAs4kT6jdRB*Wf22U|q?^4>M z)2&g1EiLMuY}O8SwUfd0Se>Ok2WsmxKtp@AySD{ z5JPaei06<1iPWuAj`H^mfC0p3OvmO|@gpLq7UayKNY{GIM`2c0OYIS_WesGyN{#gN z_*WhuiU$O$u+$8aUJSmT)Hf;*`|~<|C5=uf=U_! zvUfHlaH>=Re-I>}@KLHt7?P5h+#K+T%}YLxEE}N<0qnQ=xBY(hd&(1h;dVnj6|ezp z*od>6!UG<^fbd3fV_kBfU_CZLr%B5LH=$Y@_8Eq%C86U87u;71UDbI(hc_Sfuk_to z5~Rv_kYTJ1E7?(d*(61q)bV_FH($$s*}^#$E7s*Fwkwte}-A+VSM%0<6WxqRlVa-%fLjzC{jmUB*) zgZe@Q^y&u~*aVLB29eU|0y!oZ9Lt_)x?uClDn=TQep3V~rv(Pk!525~avY7=4L1MS z#AYl7?(T7CPQ3zQv^AxVG1eG!7#v*6U@qMZHpQ)>;}bU<8Di21V)r;PRzC01LtZ`$ zbDF^JUEtR|7Cr`c?FObA?qJc2b8#lqr>5ro`Q}DqgS*e(QWI3{EQSb_DM{v3&+lDK zCko5zhn;UqZ3u=QK4wnwVj>{ci=|>$Sy+A`&OUUPxx1;{TqSPe-#0|LbKTuYvD+JM zJP^K)!SAk}@(x7oOLsKxi`}KsbB3{BljEUL&^GR`G0Yirw zFI5sCyKh6W35==$%0e{RDf=f-it)zOTVn>zxt2VMjl$*Ad0kjktay(Pl9W>Z^sTUR zLF5PGsje5UFS1%JL2xF5$}=ds z?{E(m$4j4@b#|4|EvuXYgDin*aP3-!fK7<1dTz81Gn&DWA|RRTgxZ{Xe+TR>}*j{lW<@eoOk5+LVq^@*AB~ zRivSmvV&6OUnp2oHhm!{Aw9!L=Xf=nYb+VhS~+Wf8Long%65CeJ&0d+XrY#`7r2tZ z@s6678M?<^n)YL2u>8s7Tw-_}pPm}P3SY8fePh;q}|S3rcTi+%6umz;6{HUxxZ@ zjXmrU`ft8IeoagImwplZGR4|as?eAI40od7!q*fIRgr%#nbc5@wvkn0`3frQ&)Usg zxQRsKe)?d(&is0D^}C??=8XPgL-GAY6|gBKL)+74Xcy|e7itw$E=dapN{7fw7UOtp zAT9nH^JT)H;^&D|?8$Xu<~s)aIj}#aEu~}fAdKU7-XzIP9pZ|yVGq1Bc$-@U!zpIRU8{#lFJCn!vUL1CYqwRk_* zr}m$|x9^C=5BZileD+MM4!AD9*GUS4VAenJu_a!I+|Pw#!2a- zsFvs{u=+G@Q#gE7O;qwLWi1B)IsboT1e@fdbq|O8%KuD}(g>2}Buj&f0|T=^3oX_) zY_)8&l2sUOGaXMDL(<36H<00PDrO&S2+fc0N|p6YOOp1%JsDv30r>t}#4(#mjr!L> z$uusavm-6CAa3ZJzT9{+d-`h2ZC1V0FC_|&C>FFaNc5U(wl9Z73QzuwEHxxa!GaH) zqL*vC0ldBInaPPU*V;b$RIFDPkkxeTscY0yBs@aBlZ81o(y(c9>$b>qA?%7?5UaWS z3atDP!t$SB6dOB@QK1#{aqd5-o*ed7|V0m}h3^$jfAv{~Pg37uME+b7I4qh4*%lExMnA(vtw=2CVY{aTbtO8|__yrW1>+jR%O>k50cwFUl}Q8OWd z=CN9kLGC?sV85VhvhpKM1cUw=hC+VP>B8fX7CahF^hlEX2nsfV$s}oco+a`%@!zEA z3SF{v8PURmOe&wpF+++7b$q3%JL-QKly^1Q%IRU?5~P?!Zk1&=9lJ%GYlg^o3j%_2 zzjBEEXA@^|YNmYr^Qdo=bv~=)MthzlO@>Wi6rwL#GJSrGsaHBM|5`smT1g<+2T*uD ziEagqOi;5xJXLo#xcO`P&UlGxFxF zC*h6nfTKV>HMYI)@2Ajw2uWpY5=(u{6uC%(BS+_1u{FdeiE#9FIEjJMKyQn;6<)oD zWKws)T{%>Zro>ZSUa4LdfD{)$XEP^jt3mlsHR`sF5Lpv+taRhL69K%UZwkKzh%5&h zmDxIBL7k~ikdqPN0FJ!2@l7+CkoU|t%yq+?MVrBHfPm6WUSk6*gYGV-Z?=?9=UmgO z7J)7OwsdS$X(c||%`Hsg?q@%zhs3FD2sVMyxN@(MHZZrQ&^;tr?a9E7z_}%%O^sj@ z*lW5&^X-$9gj6`Tpn~4Kag6N2Y>BQ926>MCVyk*!()icE=cblz^5*iqH>H+N4>?XT zx*1G9BBEINy}^cJXR&3R;Nn-!U?!D9YQ67M(H}q)Ug+rfL>VzhO$);3L2m<%6OD$& zfD7W^iKiON+XLFm8!fZEvcJs&ZrY2He$7>!G=nphKPx;XoG4FBv82~?9r9pZk#ONE zqU6?Y>rR{6Cnnmf^|rSsGWFH-uIOsj2ai7$^X?B#EOHmSFFv~`Q<=Hv>|*71o}Ku# zIB=bPyJCVa4BX@pp z&I^_NLXNRrrf|4aa^~2vCvQfmN9c0`P4;p%<{~3FL&fkPqVuIWBtp7wt|Y<9btXvW zu2mo9ut4(Bm{ee{t>|8-T*KcJ2lx#hTn~!}>EUbgNza;)4`7E>lZAD9Ip`{H zU)Nr)9pafN?6L6^=U>0OOd+Fk45XrWp?2S|i>hm2-w?fVrt?hS;{L&Yz~}?O&*58U zDT{xr<+{;icTmh}9A|A=8$#ecK5xFdom+p-&l%`^wd=z9c|bFc0FM+rkdtY?*v;CkDnJ!PYzfLhH&glf2Fg`S)K{(lejl5D_cL! zV5w?#b76sM5V5nH%~<*$`2XnYDry2LlysxPQC5KMO&VUhYRNDddDUcpKPPJ(=QM%N zuBtLs4Q`ybH=HwvTWEk;Mlg1c{nx97jtp5H*T%U1ahpMSKY$~6cJs^`cK6(5hCeN$?!~|8QL3!AvEnj08QxnmwIT_no-cZjKh* zpKi8KbDQ&-KI&wtV45R&*bN|Q>9OF8TzVP;))lMtMoqw(0D&N2Vw+76k~WkHrX7!r zSbqigH~?^_H5GgsyW4Q#!;yh;ru*j>U?*cl=l z7#20Xlv`%MwQPw3)gRsZn~DGP$qUyPAmTJ*YKlbT9=&^gIE>0jB4@pA{hemuu=2sf zGY<-q7}zkIY^H26v$#mmR3-X>1X2__i9FLvUO zEUKu8{q8b`NrKrPT~-Z0csbQJT!G6Wvc^Wu{xy+jf+lc5Fk3XA{phGhT{;g%b#)DZ zauEt1ik%}lli2fpm*rOfm*oVJ8~yKK%rOw<&{_o$f!ODC%migRZq}MD*Ew&_R!swqXraaPGqa5JASn9$E@s2ax zXyFT5-X&-(y1RXW!j}EkvP5qV%af?y=gUN`S@%n;--NYv)c5{8Q~RH6){D+5U=QYr z=&FYDAu1`Gbp+JN>2yAs zK-y4NK39SM5Ia9^K^t*|%M%Njt3o4g-^URc6x4+1U!8PU(M3G&k!)5}lCy#Hn+!PK z*$&T?%Q9In{r(z53uhc9mY*jo(-ra?IPZQfjUioGue z*`uT0xe*$Ep(H|H;^t>x*D0gBlg#`g%B{)OY;og(#cb=ge*;wsx*XAg1C8Rwi6zX` z&W6rZ=8_4J?qn{93%UwbN$CTz1u@s!Ty+iv^RT;KrNb+;H2A$ZHZBhbhKFy(K1lB5ogW6gg`){=#i^+0T29*ST#KD|0;EITWiCXVs2~v&N8N!+L!QF=Dn48n-)G0Qu*|Y4b*-#?(h$ zxLn--5t$Gg&MQBLedOKBd>OhHA$7JM$8TXO<$dD_lTj%PeuVHyPQT>w+2sF~deAHH zWPpA^)s$mralQY;FwUy*e}rQb81vfOi;d1207W3(G+PN*n}$D~ySB z9>JCQ!BBO~P!}T2-a-U&@%Oz2zUTby|b zI$$coBSODG3L%ID`eE-Kl)Mk4*Q@aIAp4^pfq)WOd-(94=P^kt|2ra+eXr_%)i!>FP9@eat z-F<~r?uIaWL3AH<5@(3gPq$ltZ{o>$7Ub!j*6=$~JyEAy2AXC>=^&!_N|$E`rYSGy z=lbXQ!-9{wB&Zih8NHSmiUJ|T14Fu)WB8C73R@$VIx*a-zFM>;HEKabw@Jyu_7S1= zgR|jQD~)a8k()#^calY=KmxQye^|kufBdOLW0yO8EffE`9L_>eMgA=aUAnu>#nPzhOszZ^aS z;QZ*`X_~vQ;Klq8^ZaJ27m_9hk6>8tE;9&9hO1p!FkQR+f;hF@w#4MU-J1Uv!ga~{ zv0r}P)1T{ryw!&`Nyl5KA=h#%L*c8tvaysE37KUcX$Q#K)ad+x*~hMYTTfv@HCmmQ zC>=?x2!S4H9_dk=VCrCFLC|J%E@^mb{CVPBqej`_+n|EpIY0eGyImg!*ChjMJAM$1^daevVkgl z^ed&_9C->OxwOXti37z}&LbcBBb&>rMzH%TVb}92B_pf7D?}!9ws*QLtEW3ln&z41 zw0JtDJ>9Y_@AT|15BJYAi;g}$)!cOYR80d-MOn)DGp-lMM~23EdG))K&LtPJ2@ODT{O_-H%+ObAKO&ldS{wF+>l$E==@{0NLDjDohGW9 z;IN&v_-s?Muf|`zzu@}*`quNY=^){#^ym@wPS>64-Me=8(=paufK63QQ(jWe}O7sZgmz2feB|9TzB~00|MY! zTJjjcxHzm@fN59vJ(qS|?zx$hLZPN)_uNv1QZ+|?qiWpBj-b;buDwV=mL+v0wqvM| zrTC}^?Gv{E3q+tFIx~uR_yf3niQ+uyq@YL`*-D&h!0wW$M7Kqnvwr(f*r7cpP_MG} zmzS{~3Q;n=SH5gT7SS)2qaBG-S0~w46ky$CnDEfq?QfL6Iu7ai;|tJMcYoII#ChV} z1GGsx!W?L8|%w`tQDlq7iG`!j^o_a9auBH9-Pf1>8`@GyvnBGvft|!$eqTM19?-sFHPAyYf?@MPMNS)JpO0q zOYxV##F23nNOgJr+6?w|`}wxx{n|$3l4N$u}kH&(tirc0S0y!S4BTC46~TC z%A+184~eG|pNpR-vd{eQz&YUCqa^yieGMD0lEpp3NG@v!5Fwyy9y>-#;~vVYaP}H| z)O{81b}7Ox(k_rYKmmIyF;Ah56v*nEHjp@#yp^D06U~!laY-!hk*t!z8ir(*XWcvu z!p>v#s`;X#d4kS3VN>Do;)axFaYmbSF4b5am+Di3AavL#JTzfb-@^>6?X7?2_xffi zii7&&ta8zRm0BJP5TIm?Qoii z(>PUPkm!fMk&(g5Yr7J$Gf)1xt)fd8Nr1y-EIK#nKJ zF9h0ySDNO=v|_al#r9!z$Xl_+1{^hU*ZW3yf?emK4c|{ol78-ErQHrD8Mxe>>bzY$ zQ>4S?{{tGnd_5fNIqTV(c3`9+&?le8%;N?Jxme2J1TSfG_GAat{JPh$^@ABn zO-$@_Iz)uZ*u(E#&HpKUbyqV#X09%HAbY``gQW+mRO~*M#Xru@!5Wy|8I z%#t)V_SDtro?+EFTiWzlhU(8E zpgI&1D7GJC?zFu(#1UH}#*y}@&S)8VYoGpmE3|ygozR^7?^mRRhd|gNS=bp39BlE_ zE@@h+f0P-bC%#J*RaWv6wubm5a|`5)K`o5~Z@LU5T}sgQ?12InCy@kkSF*Qv)88}R z!R0F?VQ!9sQPb!daCVZ(n7jh6N-a_={Qmpr;^$A_dL@vFIQ<4j_cxCy1W0Tsa*uwJ zRGAeqr+)SY2on+nnU}LIkx8>^GMKc+zf=K!XI&{zt~Rb0jZo`QDAl`|?B`YGqm`hF zDt-%?skGS!cE~*h4)OU0Bb9y*qb%gZi7D~aeN12T_xkl?%1<*r^9 zFDtxwiF2eI;AY(DOYozZ$9=5|)#_MreorwDb@V7x$fJ?|Ka0eML=zv-G%N7_3B?vT zyE@8k2T!QNC#J+x*LgWt>gPEnHU!&;(@3bzfB@2Iw2a!ojqMy` zGo`M~(ld$+9QM>W6+#IM)N@uYS=c*!dS!{-><(#d!pXwyv;=P#)Ierz+c2`QV@4_@ zD`agPTe)KKqWLpJXw>rGqjDxl| zRuoTJi;qY_O+}%@YKjQ*Wc?^(O>A4cdhtL{gE!=NnE9Rcxz3DG%AsWbxb;{I)xBz>e>LR!$- zK5Is4h=_65-{!k<(Bsd0bwr)Cfa5CHtZ2}UT$$2~ob-hTw!qgMg%z&{`ijbR$} z4*_`q2xJ4mD;uSS&p|4R&L{&Yi6k5VeE1g71J{+{fgS>+nkh-?5NrMT@#Jzu1f)NiYkT;}6A<~VRe_!gu>wlsUZ zO;FmoE-P(lO484c+DbF!NJWB*BDZ_*Z|JoTS~Bz~IfBtBPtY5nFnN0ovf+Z1kiUT= z=!~EkG^HnAqJ{%q0Iykgl}=(lou1Dk&YH-HL4d)xg`*jvC1<+}ttWf%1CbrYeLvStRbah;WfPd%&S>%x+{elZ@bsa0*xsqn#81fUD18 z*}_tlaWh?8%~?5o8*m)N^?e+IH0N>bb_wds<e>Z7g+DSZCZ)`-lfj{- zasb1m%scBU(kxgxj^ETbHF*_o6UKr$SryQ&Rzp0~_0hkdOT~GqSIhsXb zaNK;^*n(p|<0(T}OevbdoL8ZlGbP561vrH4IGNY|prMAIr{k6Cl-^&2ae?*T0S1$^ zb8vET^YHTV3kVj>@2(M1F>wh=DQOv5IeCM)vesfh2I^DCuU9FQDz!$d(;JK?Gs) z*&R-o+vD~5JuQS_1QLbDU~zZ?kwm6YX>Sq-Is^$n6ap)Msb-*0qd5#mMINy` z%@|D%*bzb=+96ysvTsf%%ECVgez2m5=9h12ja#q5->$P9sZ?wxAgr{B%>qc7R5mV~ zFrkbKskE_iIjLfDp-l4xxF~;bMzF2o+TY_rqI}Z-4={Lgn+qg|*QirRAxykg{oa$H zy(ng|=~N01>848ylAnkPE5eGC(S0<1ztqA+@oc z^>Ps~@wikMeP4;%2S>EA+y)_)Ha0E?Ai{()E~K(?xd18SLMmOJ37;qUy|n*L8zF?$ z{9WM+m89h{d4*Sa7$I5HTrLDM=~mC{G%?(|00|>mg8saiNWkO9V(67xKT_YG649 zChfV0AzYq!2)?}d7tMzO-FO5*5HP89tUU)fhQXiDn&+xjRPP8XO`gq zOM*5=2<9KQRTU_BMxzlGwv~WzSli+^Rdx{muj4olHX5bgJ*Oipw;IuWU-<$htl`jl zoclDNi72q66eA>=9iF!N?~LU|NW7k|L#vPF^*=UOKS~Cu~XrK zRb*R@Hu1ju=H7nn?yCzNgTGUzuf|lKFqwC5#%?l!k5GaXfH&C#Rd_yiB^On~3Vh{< zckBQiIHaXRkb=^!Z;Seh+FkYJV+-Brk$)|>=?e@D@O{8nNN{}I# z`4+R|t9N|?9J=m<0r1UrCji@ep>Guf29FyF&z}L{2hz9S`4$zIp-$k%IEpZxt1(e0 z8DM8CVwJ#m05;bP?MX?ep@-X04oNT#Td!<%^x8EI^X2-lAL%tNn|g!0pz9s=VE<4I zIKS=+FRTKn@%Ex#QvxcUc3eI zu=Cpw^_r$$skqjpclXKFtjc`}l2wvwOx4ly7;`9x11x4_EX|hm1{@g;#n>p0hGj!` z5JMO_1F*y62oU#xk_TyJVJb_>r<|oLQbv~Nxx!>=2z3fT5dshh-yt%p3k4XYFQA@k zfyFHk%N&F`V{HJc1vu_}fmo4QV<$#bwrk3uvwEE03E0TGrcP;?|ErUc9a9dPw|(3) zX(xCMHVEE3zbHeGlhUyYSb)t=3t+y1$g<6;0FI|6;PDvfJAgG>BQ_-Kf`FqdRF;aT z6mJct-Pk*wjDwcFEP=jzZ7T@4>sOS^^LBnH6c7OQDE&s;q(_tn zsP4X?x;#*Gh@$s$!0xi}8Oe!2+bSTwzw<*VqAE=k{whAmk7- z*Ub&EwkcemH3M)%dq4y%X`z%}u9*}Q8C>=}lsV}mFbCg&s*`vr-<=fE#El8(91$S7 zWT2KMv%%KR!IMxRLk7}L0o^kQra7JPn{KHL3E*lx zrdcpu8t-U0M;S|7eg8Iqbu)0SW?@3@q{NPZBBzb-r$BZFHih0doy(bN z3-V#fhEy_y5dZ@83o6J#d8aDKy(R(TXl$Yz85Y?yDKP?Qhi2Jwvt?*(MG}8xmhVJ! zZEi|iH(%G@JOE_Smxub(Ha~Udi61UI$Bo@YswOwRME;PJemmes(Qp{m2t3azcPo=O6 z$4(3~1t&4vOKj|-8iaG>Db>D|O09YQNlAV!)X>9S+-~_dOoPphHoYU7vf6KZK5P-3 zSAM)NQ^$8rt^+SLPGoX^YMOq_>;x}WD6=DNc0w=qy?V!N?cDEUlN~>I0OUpBY!Ku} z!|c>*huGv^(*w>D$0UThK-Q*i7GPC^XAT3Z)OA%VDRnMRK8(!ixx02t*Y>Ys*vtft z*4f7^oiny=hHc0fBJ)6Aha4Fd`95s*jzF!41s1u|{`Xrj=;DT5%^tmy;$u3rzCAa z#{k?LAoL8BZ_i)>gM|zhF;pBI4@>9kXNtRMxY1!2X|b$(c*!5S^r=&;5B zYYef*2y2Y7YbTi&lX|N4V9lJNpyue?C*+G48Md%2!B~|5>)ABkabpf{&2e{^ki#B< z%silA9+AUoHrX$pP2w(3c<|xe|Pu!Iv3)o57Ex;9COxN?7=Bqq)Cu zGgood6AB9#zR;>w>V^it>H>JrCb0OB6tyx3Gx51s@t z1v@)uC1@wGW_|So1n3N`IyVlgy0U&aTCDX(5_QE+dg*YBuO_Q)v~rM(anV!m$qm@W z-vD>MGbbZ{B#Ey|BRyix@brgG3zArX{Bv_7cuVXJTdvoU`o37I##rdb#Dt=HI6KfI zl7R2Qx@$erM+gzTz@CvzmaQ{ne6!zXXL)42?`WYg4tBK=plGL0ej^0nW4tR6;KgUI zGffQe9KT#Dp+(=!su3V;q><0FW`+@60DAcY2rgjSFG=Qw-s87p3tJU$#RxHrETgK@l1%n%?KaIYc%GB+f5rr5} z`BJoV1~u^{oKoGh1GMATkf%W%&24hdpoaLYGyzs0U1ylLAUtZikxX(cxO`}&%r>e5 zKl0SpVr-7>O}GHdD_w!ZO_yVdqDk^R3Q@XN__>}G=NWym$vWyGz9YSdid4EIKwiOM zPp6vuAC)YsLtD_S-p=$b>PNJAGEF2mWoZDgqie;}2<~54@J5}D=K!_!+3JFoeV(Q2 z(zt-2Jff_)iBW^Nk*0*=Jiwniwh5|71A8kz7Ds9eKS>%skT5#8N+jhRj%OGb*Yr7| zh3!hd(?{*-vg&T%9mmqHrmjb1AWfHtQAAHaw57jDM$JA^9Mci_w)(U@Y8R)8=CAf~ zn8y@t(=3^DvDp0 zWg)MR#wS{x=}S{|f%DbcOR71eB^9|lU>!m>higMTP`oITM$XDs+Q^3r*WUzp+Nyd( z_*CWimSS5Txp|Gl!w{`A+*{NNJ8Ob-5F6A4d?bxbxoI%xyW*gH?+DfbmFcGv+KWR2=8-=iN-z&Ul`gm~fJG!4kq1+-A1%K2Z^pP)_ zHUbX71n2%LslLEe7(zv(Z=^3Yppb~BAXIp4$fW}pW8-ig%^{OKEJ6QiyDj~r<6c2( zn*b&TAuzgM9MR2g#Fqm};^q0pW-ZASz6Ubx@HX818S(#HQatXppSj_ItJY1i(C3!N z)gC#=0{OGb*2244XT~o)D+7AfbF+FMsjhaW3Uv``D&sT!dg1gI2?E1XDep=mKSQ_YsJxZ#RW(`q;cD4g+% z#`RbT)=c>SX(7hnj9{_0sux-iW{$~wOTTaoBepsD{zNy|S8b1=?cBRWYh|qcAMF*q+-!U#*aEG(GzoG#h_IHx!#~k7f`bI^FBJU0H&7NmLYoEol zA6_W1$X2XzVO26YD-An%}e)5@#EP9ywUg?C)&y#Sv7F=Mv!}PUHxdVKe5r$j?a*RCRIkWq& z$yXxDJWlSuHy?wKBD{GjX-47|gvqiy2HEJUJ7&0luvO1K985_D?w5DciK^YZK<-lW z)LnJ7jaHR3Vw`4V1A(BzuPS#E`47-kDkn^4bZPndFU_=$6Zneb}J;rmg^G2j;gOa9_{<~v7Fe}4N_o&2N!}fh`1sy~?)i<$jFhwhv zjCOB(;2Vi^cgp8ZyEyLG7G0A07^O^t&)n2273z$M!f>QkxI!!*@aBHuEkq%F;Bzi+ z*f;TqbAA1XymvTkL!1&-6=Z$xH>A=OqWGY?BDdbUk_82TQV|BQOY~N`wIaJ^BzkV> zP42D+^TsQP2m|mai~h3xgY__W&qQ&FOI~*$p}9vTBA?CJ87t)+)z}_ip3)%lDEcR= zT*oxNz4_kzpP%;z@CpLRJ<**eK0W)#WF=QFz%HYb-wqhv8>Wm&L2aolO-A84>)=D5 zz7#_iu+<3LR+H{F7rpa6euztz-+jO}ob!EuD9cOAUMiLxCUVNM)L4bXFX{&8b(r{B zQ)B#A-Gb-PdnnC$ir_A=dv=$?%-{d8huV0!c*1A_XQ7i=@qnND;;(bkhJdG@KTE?ck#klS)pZ7t(s7UkSHe z_p6mMiDpl^dm2%HaoP@Z5xiB=-3u>&)e#5nx23jRd7=2~KQ9`k>G+>ag|b2xfg!j1 zOSbrE-nyeoNL9f1;w2~twpg>9&i)-u!*hO?i%`1j6K^EBgjoecQinA!>DIRh*6K$p z9}j^L_xg}>z;e}BzPTH8&)=m{QV9K6TX0L&(TBmG^Hv_&c|K3(%XOEgJ)qzD>{d&C z6??-QZ_4l|)?itvt1holj-{k}_ZknPo==^x;0Wk``e;Re3n4I@Fu; zUxHje8~s`>kegmQTG4GcHXEAF7X&GV{VVco&E>iLSW+~hR9*l7w;43vkvts#lRr1- zpEXH2{sc`em3FE&`EO0GJaIZ?{Ygar)-#$LZxpjX8`2VyymgRgQR+yR40o6pwbj)_Z9Hq>*r=v6knII z>hYRdF)4gQN_rMSzj{AZc=nffc0M^n_~P_`sZsl&WxKaVI~TekbhBS=6km;v z=HT`%BD3&%7Soe=i|B6Fwoi|zvX<3I3dHV9jZYeDZ@BSAFd!)R!|*$Xm9RBXp0d*< z*K4&Qd7K|aiSv?s)dQaAGhe(H00cq3p>!?R6@NL)Z!TXlS^bVXojK+`pSM3OJ}%Ip zk0h&Bi|*y(H{Vyuk&AG{vp0QrKChHWpnP<;$$z9eX5Dp%ZpjYdr=Q{!a$>puBPMbl$D#uNcTCT|*ctzLx%^mh$jTgFEr znv3$5nUCH6lXESrdCB9LNGN-Y$azmmkzMbU(*gXKWa&>KUVVE>))v>wO|{dd^IRD6 z;vb@>i7IjT+O|qvk+r@#))-x#p@~SklKjeuhF%eMsCi#-Fj!LBm;KkdQH^$25o?v9 zUiIbOGini@Gh6$_vKRm7Oiz|o5PdkmZEUKwu%Wo5=lWDZu%ax0va;}d$RrVdc8Wtu zI2iOJR>jiH1O2@M@#ZMPWi4#A^WV{Asq(2^IsSIjV|@$X3}qRM|6WE|hhMYGDMZ?K z`sVF9OQf^0lf`PkshsuOmm7bQidg#fwNF%zuEsx4(WU#=P0CPMEO{{Yl%|RMS-^ll ztyZQAuK)Pvgn=)R_C)5Y@)nivosp!N{_fX>WU+$Nw3sdIdb6ZtRh_jp(?={HK{@iJ z`$IM;NrXBv`q@w>&#vIsUDGH(`}pRTAEwM}AF~uRjg%X^GiQC=k!6D!%6E0qDrFB| z@Ek3|P2yPBlH-2JEZBiSB#to(MwoCs?0TA}%Qd0>Ju<(J zl8fmXbwnH(z8#7^``M~;%(SQHtt{MVbWus`V%Aa?NfqW8lfs))BiYxzx-K>Quv1Rf zmS)`hse2@M`}y;qM+_=jL^F|LiET!=_uDeEf7N)`{bS)dAH(=_CHkPEBOb5bvu;}Q zapu7H&GrI=ebChOeJ3R$g>Kv#Q-~!G(#xb3s6A98S-cK3L&^I_;(fEP>RD+nO0G>_ zCAx=8xC7+{DeE1N|NmNdO{q=EqO$WE;`w4$S7;QMx5{JLCg;|cLh{`#yE0jz>AAml zVq4o`a{z%lAi5~i#e+@*7~b!0ev|pkE&XU>V^;S&okk8TeK)OBYoey5ypNp4d1NXl z=4daw{><%x=pBzG_UG}R%6rtX7Kh%v0e|(Aj}Ig;iC%z_#m7@S{l|2~-8hjh6UqO& z)SORnuZ}sNx(M^vqfpdbpDV0INh=?Rr(zC$@=>Ltgry4P9ISm2gGA?{hPyQEgj6jT zOQx7&&QZOtV?cjm4N*bmusL{X`gkC@7L|PBBZV2@o(?fv<(Jc?roUpI7sp?(hEUv# zMXT47=auZaDm>!~;eG3oO*f6K+uYvb8@ff96)C)w!O{##1mV+*52*=ee_>!@xEd1+iEC_~tFxMW zpaCB$T#FXd3L@i39|tGpByPkXYKx6>6v+>w3SHnQL?+^0u4?IQtzl3u2Id~;!E{2C z!Xguk@<4TL$H?Qm+Fyp%rug9XjoGO*iKR(Pcdo7!JmfKdiza8^%3Dx~xDP&O-aRrq zJeU3<&c}<^HfD7AeVg8?gK+==xV6@aaL+;U*GxH1J0 z0H6E*aQruEo3P+FLWq2s*MQaf8yC-yaqY8i#)?`=qQJk(G#t6i%>^14OGDNFU$nFS zW<{#Mxl|3>!{1XxZW-%aPIZxFHA%J6$BwM?TzLn7UbFpK2*^qgb0o}*r3^XOUna|w zG?H8}o%hkYi=s9#)HD5iJu>EQia6!gA9QiC`x^jICby4*?X%nDwl7kycwjS`Z8-!q z*%gjEx@i!NB@p_7&m zS)oM2>c{G}3Ftw;yx!JfRQ8?A{YDJV$#8$iuyMIOs=Fd;d;T9a596_Id)RU=vNo=l zlVgm8PIfNy1v!4m?pZle^oV(PGE+zFInsi6x*r!s*Yn+E887DbfWjc$;B&3w1$g8w-^4TQ*$WK=;EauvU zZC>+Q&!wIE-_lo2N6)~>#4L@4m5p6`3w_@%88T(bmLr#2o_qxg2h5td>T@`J4p8y| zo{aki2-ZkpRvv* G2<`xUL{2yW literal 0 HcmV?d00001 diff --git a/fonts/KaTeX_Caligraphic-Regular.woff2 b/fonts/KaTeX_Caligraphic-Regular.woff2 new file mode 100644 index 0000000000000000000000000000000000000000..75344a1f98e37e2c631e178065854c3a81fb842f GIT binary patch literal 6908 zcmV8Fb8N1fhQaGDMf{_aR5Q!Ty=u~ zF9)2+5IRGd_aY*eXu*h4iwC8kb*{C_QN)VA7RMQTu+u)>xr{eg*P|+Ht6ytXr+d(m zZ~p#e2L!$$0|$%oOtI@cwhS2;jT&TD-BQw*ROSFERP599O_J6$GcUwoCkE!d0F$=B3ebZj) z%u2tl(MPUHcVnr%0uq2j$ZD?mW>&vQa*^&_boaZ?MJ~Oeyzo++dtr6}Y?ubX02szi zP*4Emv9VMKu55x7Pupj&vGqTAnT&D>y#d1ekyijf!(aEQSqT*TC&1j-cL)Ens*}5? zPXgozu7BUTz|2A2s#l8S0Ji^=-i#RP8zmtu&neZRA0(Ii3yrZrSlxAws(Hqkb;`{* z>R>b_>h+hM-@KF)45>S=iBNAa{5HRC7)rg~bN2%<09URSqJ=Y{XKexK#T$p9aTxCW zfMVV)pb*Y6X;Za6?`mTJ+yNk09iWQdW&i=IJjein4Vw%ws6B*-E-71rPx9U-XsEPF zmm?rfMCvR9vKSm8 zq$9HmqSC~h)zlKsuL8;5bO!Ba-LHXeIRiMz`dc@Z)3MNyNr{1@gs@BI+wX*usD~DY zPbI0rltnBWa6U%^ibIti;Oq^dR0Nl(5D1CA$jm7K1rY25IClUJc5L*Dj!LVl}LP@DA-7)NFisBt(l7XuEUU)kCh);s~U%Lr_B4Qz@mcgX6JTs?GR zquI!~$-qH^+!ku^dIm1q5=7u|ekQMzc`M*b@!WE016~Afc1}oVh}5E{0vI?n|P+~7zu3sKt42i}YK>7#Vt>J#blPO4(ls}XZP(i&kVgM|renp|k zuM`>VpVR@eKX-~SBuLUgIrRYeMKe4Xhju*60=Zq?eJ{e>&aRqV9M2FA0O^;w21s}o zrk^+wvH>P1_M*uX718dVBO;=F7ZXsUtW_mc_Lfy0XYLTOG1DT;#>T{U+$K(n8qJs+ zU-rnl72oxW-<-Y!p>G*9hITXEAZQZb@wTX&1g52vWZZ;F&A{0J3h#omqk38k3uZt( zDz8rq0W{-PAelERFf2+PbrY9^k|7cjCUXWY6EPQ)BW+O;aJ5R~$vTnQ9j#J`stC9- z9&_n(D%j|02cht~kcj~r)ZONOgejuA)uJzvCZ7Ad#st(&+{AyUv&GoUSZ59}Y&6;o81%yY-c{dOdBeheh9b>eAvKUb2uq;Ac z1f*r^X9Ua-AiT{1F?D&Sf^wd8lg16fMcJUlf|?X09Th4*1zTb#{KHfWPChmR8h8S^Gvowg;Kj&N zTItVfHH&h zW_Ap`=D)vMNyU&NtN8i8u+ph1Skh8vN>25-WSLmb-Yig5!|r3;N1#VyI(RIHaSl&T zY9ANFc=#kzy0jQ_vQGnx_H_Z>A{Q`*c+`~DD+HpXV5k{)PzEl`d$y8APY7^BV#VMQ z6h*7EkJDIp(Z}kalQaqY0q=*kT5XnG!}6?e7;%Xd%wU%If-(((YL;F(pi2FYn^kmV zxL(1?J<4{rGQc9rxeu5R1*pg_G26GfcdBkhCgET zp9UC%7m?xl_tP5bzwmNbW%45qd)}WEv9qs3l*ydrJc`Gt7oz9kC_Ur5VS1c_TosFI zRa#C`^HAmhax4J*Cyv@yi3G6!r{qQ^DKONVhTH0R3s*)1%}1T%rpH<(feTxr#D;^qxpXBbQBfwRvHVap_k85D>8&}5 z;ytfkPFGl*3S%|*rwrT2i3s`3QZ8QO)?50ExWZgf zD-Kx7%J%~*G;oh99SgpoZJT*=mzq$~DRK#88K${>f;yfWY$A{+wldpf?clzq;M;gJ zp+s+yPOC*Ls1Ih<^ieJG}N z@t~-V_`hb}7Nbro+N!urzqw#1ZoWj)?T4lo%giLb>9Dd zg=pkByj>PpRO_J`BuCq<+>_T_dYlZ)$lmT&YE4;J-ecRcC~Bh}m3ngK>eyA*@?3hO zDAS5xPV`Kc_+cl~XGc%gx&ejoHnH}UFornXV1Squ7B6b*E=~_6Qs*5Dia(xHWOz%i zLtW6!ZZ6aVCF4@_CXCXRCI@_NSxBtjpQVh%?|^He!sZW?!?rv`UT0}2qsPKH4G!u+ zKIN;B54kRF+VO$SH{#0=Iq;_b5{ZUIzxt{==TT0C)?0ySR?e$}L_3IatmN6Ksa9U5Du$7~ErjlW#IaM76x> z9le1qqFy*M!Hd-wM_lqfX1(r=!sorLFGFuunypI9cGptzpmq; z6{iqo^uO?SQfdc=Kd0JiJ75D|%0FY_YQY>K! z9j4kSPT0~}NvP$iyfTb(O26P=%?gw6=( z#_Cs;R>aM4xzS7pSCj%pBdSJy!u8`bf1xu&`P;@mcd*4%Wai5$`rv+3b8Sghdq%P? z_0o5!_9bHl4TOb|(7ms|302$|d0NTns;EKrEY;9Z{j9p3qE8EeG;1}={LeOXOLzGX z5(tF!Fi`xGsJ;P)f%~qPQJnlG**z?X!!B3fOuO_z*AG>gmZiy;B?viQ*xSZ*AGhtF z_}OWRC`{1`3@vO~&z?VdTqeD70^68Vta4qGTXqkAlo0rLZw_Xj&QNOdA4p88VNqGZ zX&V#*E))CB=31AN7Uzk#>r(uyJ6$MI+evYmNXq|NJ{r)=-x2Tq6sTADdL5T?Irt)^ z9;kxBiDa6h^avLkJ9av3Shx}A6XAz-@%z@dx&ri>!i>>SI%DL0Hq({Nmww7Xf@8Hg z*~d*MyjB%M@#uo6%!HZ*y=a+thJCZ6N5W>}(sJLG#uRsFhkUtDGIaWH1i$m04codW z0TY8ERE`XFx)K7j2p*YmYDSasqP%y<-af@Gi(h45VFHZFLWM(8g$cQ_Z&Dhe|5$G0VP4veZ?b=0ZxD9Bl_bS#@gyi3QPI8G5 zO_^>&9R!-R=Y#kVelpB(zavI7geJM004o57IA!%~CrQwJHf4tU2UTtZE>hKW=I!C% z`N<%^-@o5`hOjU~QCz5Tuqrd*!$nK_(?@Ow@|kqIIJwSeM;QzSrUSYa%jm2RLeKk{ zk2Njw9(mUnioCT0X#B9Xt#=jz^E=Z;{MQ-QrSd%0`0oDb$6Na2ht0o#iGbmSCsDYSF!@(Bg6KbXaBEkPXcO7M4G}Bnlt^GLXgoJ;~T%V2F1@Vg1Br| z0kh7l-fx3>sv-^SNE6Uk3cxkCDSoRo;|ULu8Dih_V-@}%>)IaXN{qw$pFpXTn;S-5 zmkF&XUR7POId&`Iw|PP4?|hPj*?lIYX0oUlQ_4Wb^+cEsX@1}GVp_6dzv=>8?)3)y z9i>HJ@uBk9Um4n@@$wF?i&5TGxG=O>Tq6F!zTMlmDM8A{A=zkS-sz8GWw*9aRDSXO z%26rFVX(gs)aDB^jeGqID97&nygCfpk3`wZc!aF}7VzV8&~;}u+0O8E?~{QC?thj@ zgVIv9W2XEde?+-xgqTdf*AjqEPsobI(e4T_Ho=O$S?s*xz`ee|?W2&SbF$(i)DHqcN-t^IFaoXDbJ$m;g z$9~Cyid7_ff$Efy@>6|uB+s39zb1|HWPUDr8xuOdpU!@)}e3lsV2%0cZk z;}+A@`oKI4`VnRgvi;A@BD1Y~?1>_ui6IYy@3TOl0IHfrc<%vYlCjdK+1Rfe>;cJi zYG>GX>w<4*qWR|wiw0{_#7W*Q`wn*)T#~r3E8oVAFQzbNy(u$c!cfjew*}=fX}U@0 zv&^mAnDrPnH_su6w-@cM9w$l?xZFjFEvdq>z(`io)RAvN0giSmlMERp%{*(L`?EmG zjrxsBsE>ZL&`MWe&LGFQX^+-Lr9+}%K7{Y;oRmZBah=q9TP)XRE4-xN75r}K+PC3` zqjDQcJKsinv(aFGkW00|zbJI`22b^vlG4;vw_98~PLpvvH^%sD(|rL8J9TEVJ}6+c zGGJ_PetSs5hN?`~W0lKU;aEg5i01JJ3nLuO~JGjek7<2W!ey6w$yR45g{R{W8lyrez_-r28_YB5LT|I+*NTuf1bl@;e4xt&82kTjAbdG{)gR2NGU z9V|cRaATskab66|c#=Q7uqknJUvyToHtN)fTEt|yKU?kes}N&8L9w-y^;y?dq)62m znBeU})(ZKgc;>;hF^+he75!}FCodj@{makaAJ)_XRZz!SX{k0@7rTYUVbaEHviJ$& zu&?YNLV0s})vcF44dv7HEq8-2V;rt_+c%xDb(_9HB`zKzajG{&1_x=p;=WL4M9%(d zq1s=g6$=y02fv6OS9D396|~{Gm0_#Snee-9F!C2+HtgnvbT56w;j+_9b-|=)rYONQ z3~KT_7B#uuezSjK^E$)YOx`=m*yshuhVSPIxFZ}<NKwTQdr#D@u>5alBOER& z86Y_dk6)KGqpOBD7UUKV?JaCsSh(8JhQT^9l5tx==;DRR?)U7UK+S`Y)UHil<&j*) zr!vBp`ehc%JrbHrsw7*^fvt-td{u@(3G~nGPkBkOE_jvxBT+nwE#_nm5arx~aywC` z$k|}vpsrd`C!au|;~s0c(ww=X85_?KpfvE-qSBLm7B!VaaEBGrjWVUrZ_I@7Svm7* zAibC|5PQvs*8jbg*@ta~1W}w!cYjx-KNLXM30~$B9*0f*~*9!c`VoQa(BUyB6 z>cM#BL|OB~ubY}v(iYV9S}>7NW^owABN83kl}Ou|Ih+~$H5x~8zzqK9{jPUX~H|{Bqt*km+SQFYc4+C#AnixIm(Igk3ouVbmK0} z;W&JsPbL<(RM)Km*&mJwVQx5p&z7RJ#X#SL!A_5himYSg(A7fb%Ix>cvj{c=l8OI_ zPA?`GsY7cS^|)ENDg^}|fO&K_oCxhYk{TB+hHUrAqXX)&bXpPHmGB?IuF!-fMx(Xj1@Z7LYtX7*GKa~9YoWe#0HD$rG`)06%$wu&iQ#MvU0`5~0RX^efNUa2 zZSzD3+vSO{Y!4?QY^R+_OTUV|PKgKEAqv9YjP z7^8%(Woe3At!^D|%a~&V)^fGr0K+B?$7$kVv{ew=IR&*I;~1NG)Rd7{gHklieW*|c zm$aDmVy8z3H=aqhT7!E5_T;7GwQJM!%3a>py0xYxUTHYW>>iA}9j(dvs_lZyX-}+7 zoFf$OIk*nx-eB8}bhQCw`;`)c-JI(#jK(22GL&^dfZskZ8U{ zZpm?1v+{19?dAb+K&ka>49`*k+iqC7Pt2=95j`a(ok#2TlS`#p!{thM?>5Fc3f6J| zfn7eOSP-@vO6|dYa~gM8mbvObT)Ued#WJ}*oFe}O#yD*{RqXQ&)dcl z>#WkUD+QDFIIhLYl4U)@;goriI|7?oty?vf+>uSRrXYG+fdBZLWr&xm8$s?~a&)S) z=~n$m^kvi1(eq*8%a6YRMkeMG`n7EW1ql`+lwFu`5h6t$MDMK{E%#qrRLTpuzU~fy z;QaCn{F{BFJ^;}F?i%uYGyh5;Aifzzx)E&ofgNMaOcjRa0;hZ<7~no@b=K~7zvI17 z4mHY9J&pkzn%F31$=u~mVv~R^d}j6K1iCxXAvOZC{a$!SER?`981pokH CFgb+) literal 0 HcmV?d00001 diff --git a/fonts/KaTeX_Fraktur-Bold.woff2 b/fonts/KaTeX_Fraktur-Bold.woff2 new file mode 100644 index 0000000000000000000000000000000000000000..395f28beac23c7b0f7f3a1e714bd8dac253dd3bc GIT binary patch literal 11348 zcmV-aEUVLZPew8T0RR9104!7h4gdfE08HQj04x0f0RR9100000000000000000000 z00006U;u#x2s{a#3=s$l=RnhY0X7081A=@Dfj|HRAO(ni2ZA6BfhQYjK}92Ka2^Ov z0o}VqRBm=p{=X$q8M1cpbPUxS0!WG`C@4;IjHc?u&;+W>o%jXepM@BXgT+(Np6`yc z(p7IC8)x~5s#)!;6hBM!$6i|TH+G!ojgVxvwMV<>f6hrZ$wC)-SGcn~DA9)}RnL-z*RWekuPpCacmiMm2|#%vBmjodga!vtbS#zLV>nN#tH3xi zx24vQ-W{9R6oCZDJ)7svwFKw8dX5Ertxp852kD0_jPpq2rl)~lVfgktpU>?)kvu~$F8*Uz4iS< zmZ`8fx#t%{j6voQKRzWm;NI(ozQ zRm@Vm{LZwtM0X_?gs}l%&k&q{rMmnT*ngRw@8cYK!5!Jtxe+7lX0q?RCzcT7q#Hmo zE^0*r(`sIkAzpk%0rZDr=EenWnI~e@!ZWRw4&5YkdjWbzW}AA-v&Fz&U5v^$^*x^x z9D>=4oA;0hM2CEuwmS(iI~>@Mq%N%>10q;tU~LSNM4`9p(1S0Dl=;`tIgN5W8&hou zPvN%tJA4SbyjVH=tj?w8eUoobL6Wf2ZzU|Nb`mB zLywc}C%gcA(M%|66)j*4 zN>4qgxgPdPQyNp}{kMs#qQYEb2*2o#q5yL_>0DrUx>q|qT5aF))`^^cJ(QyK?sdw% z5#qW_n-;{pfuk=23r9`Do^BO2Xmd1xLk(tW+f+cT*Gc5gob;BZZcmO401gJ6ok>~S zr*F>a%7h)e=@U5^>@gWP)+L`j;MOKn(o>Y95bLohJz|{O74(Qp)Pk~v=`u&7Rz~5H zIz5}?SCMA>K}5qD1k9-?JM>3HY_A9J#M_dWNQlB++g$JUDn^)0fD`gdC3@zY8lw!H zYeg}GSS#YlJSonktjp~RV@BlFsl@t<%m=O8(LX z6y&&L=2R7_DC01Vw*UGr7d?L}=bU*|n1oeZ%4#CHW_$Z670 zH|hjzE@6De0$j6>L}KJGrL_Ininvg~+uMOTQ;Zpy(l=72h^OU+ixSHSHRP_aEKc0k3BsMrY=JELM3 zRP2g6(GzHr7J7vu%N1HXL>pFJOZMb#q&L_r*sC4(Ngn`HL^LmHSz7nGO9@8+^fgxb z67+4et`qyTi(?%L%ignifXMoovo zDa~GAqTo;v$#-c_OTXhqpS*Z7mM%vJxu*e59{jtNVHwmar>RU!IN<7TB|7>%97?^a zPWk!jl4)mKa){in)E>$tQnAj8*x?xiQxnP93oWKT>XmeIEMjL@w_Gj>2HItrq-7^` zI2p8ThlX|;F%u%Vm?8!wXL)++7IY}HCB(T+?FU93;}J;g zL>%SRb$ecz{m~HAL~75Iml)RFrUf)sm)>b+u64tc|j$3wC$s4>ay3Sn|4k~+;9d0-X>U=pxEkpL2fP$mdP4u7ID0UCu+Cj<=~ z66q5(6~H3VA`a#*8$nq)teS8S?Q7GE;LD$iX58Wf=pk7LZYlYjtp=j@Sz0 zfV;#2_A$UA27cUojVIN3R*e_ccufen#Q^sh_yc-_Pc`^bgKstXNeKAH0KXU}{v`am zU$;w9Ef2D*c>W;Xc{3f+)D#=*iypg8H3a3Nk)h0quG04cx||21OQ86Tlj+4iUT2R8 zo$pTh(whLV-@r*4&-Dj8j$14?y@E8_ z3u)|cq1PMWk8T6VmXP8gDDVF1q}kn3V1Yjad}-$aba;m zr!kQ#MD8v53!c31`Olgkj|rrt5*{ZhG+q)xY0~miDzUri^|hg16<-KumAQqHDgzZI z&o@UE;IJ&v!=)IqNZ;8R>njNyi9S+EdJ$n#kGVimbQ5usVQ)+dIf-8)m8b&1IiNI6 z2Q{Lw=K?#iFr`???bmT(yktyOo#J%U?x`~$TeA<&X0CZ_rP2C*+i7af+&`7Qb+*9Er%^4^6VIy^oewME%bP1f=|h20lY?Ih{0lS`T~|aAmI~ z&V9)5_)@OiQVRSE19I8nz(JqNkarcO{*R`3bk9W@C}nQyDgMRZf8O*3e&$1oVJFU7 z&a^~u8nGb!0Wz%sp6^!uU*lv^C2h5%rwi^CMud^h#YX}irAi8ZWdkbU>3b(mtOn(w zEN{Y4dTFF$s z3dn;iza^VJkQZ_D2MgqINxxJoD$$$d*)3uCP6S zCX~EjSPa*2W~pV2nzQC$Tz{w3{)SNG=a=`vu)2vT0PE#i2p6PUbrdfIw#!!4x%)`Z zU9qajna@(YNplbxj0a`{t5=l^ABncoKifv5k*JI;Y8lUAq+(Y1{EjoM$hC=LVMwb)(vzMiFM=CFeHy z`wM|=yDabV8I$TfVJy0NkcRfCl0U&(1OqJYDS~kt))t`GuY$cl%K!WGF zk;t0Nj0R-U#vkgnLTn?q3#heT{!rfJk|lbU9beJvgg7#&f05aj2k~z+vfOsOaf8if zg*yrB@^$yxr)O z85L|=+UF2qT;_|x`g?0AQ#KvNzM9uU&%u8=C2*t`dR^}wmT?(%Efjz1 zqV|ZE$5q{?)^)7Gyvf6p6P(;?eAAfV8Dv?TA0Ae{yvHzO5U-m*r)3*bCH_&$5J7Dxc7My#z6S!LA2gv4 zqP>$1zvG7+yA++Pz3bv)_)C=5* zo-F_$yDw>k$9T$pVvW4R6hIQvjejViY5b!#=_Z2z z?hjRQ;O8&x#hjavbVQEct^RLIweFBJ$UdWHuAb@;Shy7DMUo54~yHPEsJn9 zlv%M6ffvxf+w8JqF4NJjQ`+4lIZ3Ehvm8$R5#Em@93uzsa^*Ys?0eKCuBGw3yKPzx z@2IO)w~NWk@)o<1cO<$}vh$qOGblK4)(M&WmFb&pE2Y~z9T!*@wF53&AqXJWNnT=N z=mYs3MgPNueoxXV(bJ&#xk-n~zz9hGV}bVcBAQqg0F*!unDZK|6pO#r4NU1+22Te? zXh#n%itXb9jUTRbP8eMIif=bcIy30DwW`Igfr4WcAu>1$blj13hHXnXo2tXU?Ja}=wMVGv>xRYnAAlcF>Xem7r7=A1b*pnc3{jQ578{wO6BQ@ilAsRRzJ814ql6nNft9pRxGC z-HbYVX5(gxtz4Vp{0Ff8hb#AxN4}2LmKA}KyE$+QZJa=9&R$}ldVxchXdsuW%A%bb z4w;mcz3+MKko+#oN(%zd<>VL+deXgDspQlQjGQ%e^fyAkEo|{DdAFPwe@M;HVaBoW zojyoHabdHb-(_i$xu*_s;^*I0Y>d6BYc<*vyj9~ey%sUFHg}zkh3O?Nh`rIwGT8SZ z%wA$T66%{{>5Wu$@llJG47_j2m~NMVnzF+~1&2zrCR^sAj&>e(PYY`Ejar45c!n`| zy0>yTl=KA#2hr|

    8iJi9&VuLl!D?|!}g_M>mOF8Np9hD)!Z1Vi=)NUxj~3huD& zyD|QQ7aI3(({H9Q#J{MlFEJmW^?D~ilCv^kGW^DwJtrX3%3lmPoqYMX$D{1PT>tY- z7&&?qIxCZ(mgn?cQ!37X+$}o(Af39P0>$~7j7f4p+>@Bi9aIj#bOl6-yFQA)naIV7 zp$RaqtO$JzbfPI|iDvvTz%%DZQ;3nI&&ZQvm|GrhS*E--9kMD12pHQ#GI%oy(ufJBQy}WA%+Fg zb{2gTOV|l#(Lp}SWgvO9bUmv48C28iNlXJO5*Z7kk&Cq+N*F$xAJ=R_wbAzj?a!dz z-1?v->KqkvLsOb+HZ+If1+3D6_rR|Lnpd@k|!GPWpb*j{dYXDsT;!&wG%w50@ z!$X2~O&VXQJ!?yxp6*gdc{-qUj^BC*;N4J)Ap{)5$EPb_8sZZA1HK0TH zdTmQk%mOe(F9JU#xBiL!jtTtjOY^dtP;*s{(b(A-qIV`0!Jw}0_{d;lEa@IU>z=9) z^uB3N7mQcy+b?ODY%5#hF(*89hX%5&Euu@f`sUi3jG9dwZF3E(gnRk33%cgDzear= zWK`GHf`>oYT;+2ubmPA&_iFX&PMZSM_+BiZ!Y-#A)*YdckLV7A8r~8g&K+l_Hwyv=a@c>BAIeuPD-ZnjuA4f}pR1E_a3AMFiQ8NasIL{hQ`(;ge= z4?i+&@?@`uvRXQbQl{QpgQ`9m*KK&^Mj1?5Lt$8Tb^d-$Qa5ws_j*=s;2BhiVj`2k zxMy1n+lpghTh;B*nzq*572+(t(wmG7Wl|D|yJHKZNnx?)75o0Ad8(V5Ok{}KKeZyd z9F1<*mPPOxt^jp`MBXAna0f`$#YP+b#`o2U_h?M!Vq&T4&J5gHzO^~h5?NZ#8>-Om zZ~cmMsXj26*%22f#S87gEGzj64&|vZ5^Hy9w>(q%E?uCpqGF;gnP4{b;+~MrqA6&d zoN0?S2EY7pq&ewXKJM-9Nl$wuE%f6WBQfzzTb|g^m1KRg?R^}!y@zTATAup?28~xP zr>jSbAWtz|Clz(Qr%8&3I0qROxN01)nYeLhc}ty!xV80)dQYQ&pm8?KtM#e|t9G|l zZ!0JDNMUaX7IE{WMeu~yU5Tf%7mZKVNsj*_0&_&dzdsiD=4yR3z zF7cDlC-JBYm0daq!H1#XmXX-|%XOdzD?)qcW#)^sJ5CXYS|P%wsFAYMscIlE*@=qw z4>eN#=+(b;3UPS1?#5tW72J+)Bx|IAB2@mhpOGrLNa0c1jP!xXoA)mE`5t}V6+g)B zbEh1QGclhnI%a2W417rsuhJ$mvN^_Hi8-P62X~url|=r2Fz4o;XK^lWIJk93Yc`rq zyBsaeLBSRYvNWFm;)`FV@2&)87VKZMk;88Ni7{*tq7;AJY7+TgsfC~7HhwzeG$;fX z`O6_sW)s>HR~cvqb6cG)Ef@C?Uz**!Qa+e>ZV*>_P;32h$bdqB$U5hRu*zOp4P}@L zMIM;~XxTo~8?6)dFpY3#g}JJr=)1*kmBC2i@lTov$d4CMw`GoIy-z_N1+h(AOJQp$ zOl@sAQ?;U2r4hlWnC&-qjMW&#pw>ogkFuZI;IOhJ6lfAcJ|Q(mHB##476GHV*o5#Z%vGnF>1Xa@muz^z5<@=U3j7k#$?7u*F?=&_}7ehUv$4lqTF1 zdrNPsJ>_*@sTc%q?ZfNU8*X#dbvZ@h2s5b{<5(4YQwb;xO#v;Kf zg00+UVhKk!Do1#9jLotBAOB%*>3|8QKucY+D2ujP?mHgn@RFKU(1v1yQh_)s#cfBG zLTp7syF{)sYb5;I?IIZ9>Gz!J_Vs=jx-p5I7b82hc!NPVPkqBOad;nzMv?qm8lBy0 zohsY-==OIY@}u3v{(Qfgwi@O9mkuL~{IBzNMt3~idRN3h^1b5c_N$v8`>ewR75pXq z&sy^&2W%&}Ce4g;R)U0kZY!R=>g;)#gU-cw^^#G&&&}A3rVjmNYpvf=VO`kKO@3#~ z)haw@4B-`|-BApsAm4f{=VKIe3s7n!-!H7$^3w93-x2|^~2?L z&&?!?^hR~84mnDoHSQm#q;Sr*UMKBq5=y+6j;UTBXfSZthyo(fa(cYc*%fH`e!p4f zz;dKb;lpJJ(s-=|;5HyHWOj4$Crb-$cV1acqn+w1TrIH&32DP(|DfC4t&H)_+E)z% z-H0{bvkaWop(xr=RV;^=uA6yplmq>s&{9uj8N5$gPH4RZE8XL(zGkGRkzTSLB*i%M zVH6zj_o@|v;{@Nu2+it@eXLJiRcNpkceyY>!)KO>?bbFi@r_7zLp*r$14u7Cpso%R$kdP;Bd3b(%3C-a7Z;+eQ8<| z`Rp`L4Cht<-+5F(BMUcgfeR(KUbQ=vNq^3+3WyKv6I!foG>L%TA_##3IZI5}$m)QL zk&zzgt80yI5=P)&#((_kF1<^Bk%N?*#6m^d{qOUOl4wob=z@Nfx`1*g{DyRMcyjQ) zZ5_#u_}=yNJ3NbI?YM_y>UtX2K(jpFwKDF+1G10TkB`jC6|vGyAp*~02zbbxq4~wpE<5^Jz_s_ML8s)Qhx552)Dx-Rw?zbI^K^Mab%;b{;-xo>fHeO!u+B z;pok~fzC(CW@PrfPRM$V3=D?{piBLv4t?qJ4>v$dA)N*8;$No;@Q)M^dTnzSw5RFH z+ja>vgY4+ujBUezJW#*EG%)ySUwYpjgjlF*@{s}Y33p5AhyN~^WKR zZ@c{EN)N2QmF$|IaCyt6n#t;6rJ|;``qm#K{&w}uDgmd|L-$!_5)qXYzaJfMGV19>%7Mct6yNwe?$#%M!6&CG1 z$xuk^7qfk3J_#G{;8<;fLt7_ZzXo_=G869N{15jruSy_=+deVnFOrw<`mz2XSn#5g zqcE_A=lQ%kvkr!Vu^)cD2ByQjsjr79<)$SyzrXlZd8~QeFMm##BZK9>pj6Ftk#P?r zHDD_5p9hbA+MbC?oB#b)rLtAa+8g-42f5h8k?VoOp5UFH_Lfg&jUO?yz0OXZ zCeC;a)NNvt0SD~HBdYmAk~^slIxDRFo0Cd5)1wIovwp#{BQ{~R$Hd5HFEdfaKOOj% zbacdT-3R=$`Bb6Q&19Q<`-42{sryGhds0L?eE-2Na3h5GR!JUg3{Gb5Xmv%I8DdET zwD<^2Xrivi+rc)jYyaIi-w1=M{B~$2R$cC5O_za<=OxC=FclQG8wGsyU?r5g3h5ex zw7s?l*nV|22sb^_<|vv#uZ95J_omLm zKN}{CexLXj(OdCm|BDK4qjAa-$$&m{`jAZsb0qB$1RMd_d=CC=ETb+3%n#mMy28ap zF#o{v9&bA|m`)eExmk2z$l_U92diU zQAN;VfV}fp?&7MH@dZCQ&uYDk>2O7d!}H@hgc)w^aTTw>32G=XD0NO>{@-TRljCI% zH_rk0@UZSq!y`&Hs}?{<&KMgzeU1P)SXWix3O5q#^^4XI6{J1LJP)$uVF~yyBI&Tt z_*@@=;PV$ZYfB5#p53^)O^w6;pFYpNAI0Rx(Zvw3Tt>|`JpGs7F?YgmkAS)d3vLEp zxBLom*$J-PClkCMJoJF3R&`u$rsLiVgc=JE^zy=Hj{4ghnQ$VMqjg zg34RyZ}QjgxDgZNhp0~E`|E&z=@IGaeC{B6Zl^k{cZpi@MY039K!-I;Z0{#kJP0v9 z=@RxjHK3n%^@|GuAa5~P__^eP zd;h*2uDsG}WY4EFbAVr4Hx@XV?BU#5#p&LhWrfaI}BfRk5*{-7Bfq{eL zh_Q(qBwxgNNaRpNN9%*fST1S&BiSX2Y6mi?jrKr5neJl>Wwz^#4;e!4fIG8=* zA?I#{xFEqN7f5P(?M4Uu@)~$qX|;_B5a;mA4M1Al?W?rzp?8T3>ug8SMGCEJ$xokF zv1SeXM32+J@{@gdPz9t;FT$Yb%Y%iWMq2RXDklkaAaJHP={UQNsM~@iq${WBHB?vf zezJkz^!A%&3;*u&Qd1gMUvl&2T9lVE<4@U zrg+QCe)H*w<^>Qg#90rx$mpp=}9AQ)yi8iZz>%K0nPCN_|0 z-PY&G@}KB@Vy0(Rst}wq@G!&{GG**Pi>}S^qglm({`;2~%S=w+ym@DdDkI7~h0?|< zLHqB1rw-F`zxrn>WEe?Z&%*LeNuYMccZf%wZ`3W36uk%B&qxPQ_|lh4@}8cnvSD+c zm1i)md1fs$-#(|Qi}oq5?8>@2adLjykwyISo#K^yTT(%_SygB>d%)K2oXs;`*=Jw` z7YeP3=TEhcPaEtJhOhaJc;ewMcV5n4fr3qcM0R`Ty>C)2pNKT2L#;xktUjE{XHhE2 zc;C@TMDZcZvLNT*bDP!~%UHcWi?IpfY7}dU==X>`+?<=^9|&{JjFFP4e3^xtKm~>G zP;GM;mZUq1(Ni09-}ixoyylqP&z)GA^XZ1UMZb4l65hJ_34K5xIe+Hk-(8^3s$LlS zitP5t{meg-qR|oiTJ;B+m!H3f`Obqu=9C|@H+g%k6|>>xbu#4B_SXU{pSpZI`rt8k zd(SOot!YkLt%y*@!R@+jh@@G#A$+$=I(?-2U?5$LJd22Biy|-ekN)~_{)M9gY zj|&7WebrFeFrD)D)lZpRLf?*66bv=mZq_R=SgKbm6-FB-p_IJ+=5v+Z!b6A0z&J%7 z4;{tax0^oBm54k!acoUXhoXqyqY|`IhZI9YP}ib)n=%yHuQ>2{>{;LjcskGkvZZoQ z&qtbMh{@^QI#grgRy^6hSqUY?nr~B&Y)I5Inm)1?pP(e$jcDRL+MddWc%nX+Rgedm zO7kg)OvMaoftxyAEu)r62|B}-^2!XHF6NXK=RH;)WJ=j3v^`gvOYbD1u#DT}D~C-@ zMW;8VDsWOQ-qC8TR8Vu>IxmU9%gyU1}Fx zn-&9^Ci(eR%@x_QWczx#9-SI7Lw0f{O3hjz`JO3ZgdWkxje9`{^`IWRNo1&VJGPCa zPp=mPqV+h_J&tGGYZAI?*_AzgM8D29t=LXiht$xtF!rboMraR(){nk4s>7;q_;2P5 z@ryKld@cOa{W94v0{Kb(`0tYn18FVI@UV3H*a5$=%-WN`%3tU!`e_ILZb_&5{RgKv z5rpFGyl(QT?8s!SK0&Rq5i1vEY7V}@N)#dsOAwKg=Ao!a_CHa9*7{l}!sI@kdKU6j zfV$pi?~hPA#FTmuyzex%=gHv*t-3z`6f#hq17-Rcp~cL16!*K3_wb$$#b76(j6E5w zKZ2j$N9{Ri{Rv#BUIq`LePvKHaI617HGEg%0e7Rwu;Qgllf~CLIqBtUi1u6- zXVO@-7?S6`0YW-r3(qPpY+BCA0~3QNKSf4~YVP(~8O3PKWi-cPj|uJ)!@;-)HiJ~` zGHe8kCVjfS+@_E3HLM$Mn-(LM81ntqqA3{=E!SL*N5L8-Kf82 z9KvQCv6^96G+k2o#*g<0jVv*M`Q2n6_!2%go^p1c)178_^fj>R|9Bi!B#X`A z^7sOw2pj?u3K|9$4jus!2^j?q0}C4m7Z0C6IUx}-3D>?|atcZnDygVxXjRdvre|Pe zVP#|I;N;@w;Z@7WFCZu+EFvlB}U8T zMzB?gr+a~R;~(48<%7kiMqgf>1?x%Y;Y$Yd5XK)8mpUz%x?)bF$$R&@`ES|j$<79b Wg04?dcHtp;A))8;;A&?XTgw>?+~w4ijH#pv#Ou(S+JuTfhf>O^sW6;Fx#b2@rkj)P z-d}ewUs&r@x;?8bxf$`O*x4$w9`>Zp>GY6YYWOpppm0Tacj>9iMat?P7M zeq?N4er^2~ix2%ro%X&YLuBF*x1rn;Z`+whNU)8Qx?Rs|;h>c+(BThy{Z&%F@&w1yt=VV>r?H~L?6BF>5 zfJa7O#Hzbje%F80X)XY&@YP=+`+y2QQsM%pInqCr8y^i@=8oQ`C%0^%Ub%S)hpm7f zP~X1guWio2E3?dm>`7kJJ;Y@9;7<=tN!J0-=kELQvE7zHBF{AQTJXu*2qOWdrif8+I3s)9ni^D z#kH^$TnqQgMRvcEbW|EmSS4OD{6f0G(M!k6sOlQ}% z*;c`2gC|~H&<{<>%StNx;=zm+u-fT(FzM8F}SU;Atw&ec}8x^On? zguk%zd*;cMfG;)?qQg7bdxubOzFO?ABY$##DF5;Z=IOnjbPqK?S6Tx10xv3_0h&v_Si)5*QLc|Uv&m&^8kq`Vx6HZ+D9Z7L(kv*uQ>6qJ#+Jatmu{(X}0MRx#^&#bGc zv?`WG3*qv{5>wAp~q zyeu*@;mYg1NfecNl!;l@@q>)gcrr~@76o^UA>2`t_o{DomkZSVqAFeMxO7_*+TAVXR&@vmp0(C^bf-eNCzWa`UGR~+ zK|`J@b=TCTJCPppUWG?T`K=1ohPbYe!;jXBud>X;YPhbWAbVyHKOEyqmr!uV5FUQ% zli~9sP&M#E40D+q@0`Fb04*_r`_8-*{Sa>QzdC!$9cdnJ?J$)PVj9ygIf297MMbSw z#%I-d@_-%)xC|n2UXalFIg1c@Z1baqZ-x@sW?&hp7;?AiN&~!LC@{v*fWo5&RUb}H z@GsWqBt#64Xe~q{FrgGPlwpplSfCnKP#vqNfi={`I%?rc=L8&tK&a*Lqh*RfZ%am9 z)|`%MjKklToiz@_KMz|Q0j9#*ET~=|NmXJcbf67gQ0Rd|9~1_lFa(7WDCD591qx%( z%p4TQEn4^-(n2LoSjn>_71^A*xdK?k%NXq^E@^p;F+KmU7RkDHP`SEaWfW{N|hXm~Zm zF@PA!5*Pl`N7wgex`x5E-}&5#;{5RM3QlHHr1U1JW@IGcwy+dlUfD~bEp5f!+)@=& zZs$o--jjQfyyKuUX_+f|EuW^H2)c}+FwIuA7Ecv1SMJJ6S}D_vC-Y9ap^B8;`D`U5 zp|c{XU-><;wdXTRzhT5uv5;X<#Yu=L(aBSLMZiSDY;5=ykTfOOF#-4J3!_p zp=>)B&`oNgTh%Y{*+vwzR@07M1jQp3RM*zp|AA@oWkt?ML&hxf*Sx^fMz1mVom1BE zR!_T^V2Y?zS^b2zqN-vkmdFc1dd}~?+Q4HyuA^o?O=ZR zg6c{!LNSNd3B)WlGyU^Zm}VS6;?&^5xfJmRi2nv&b_S+e)sg*;*yS>@j1;rm$Go95 zYi4Odi=K7jc#RtRTvNAMnzzKJ5=X!bGfI9@V3`|3-KPD~Re70v1rMslaX_ipz|jwS zvnRv}Q$#y?uTm!7BCg|jQ^|XW0=P-=9&-`W6aXEE8G`T(o1{XP0$}6hJGdl38Nm$^ z@`eHUp|C(06Am#1M;L-*3}Fc{tZ@oY{wvoRuP2O5g^KD4xy@H z8>X-eQ*++}3LRn?hmH}TQv~QdhcKmZ2{X8c8Qj7Q?$HW8B0zlv^a+g|USSUJFo#c= z!#7%?Uj*nML1r!g@NfLyK7Od{g=q1$Wv#S`S%cny?^NpV?0_(6K;0a*avL;l?BXZ5 z7eMqTs4rmxTL}tf@rF5ClQn>KajYU;CBm&krE+9l9zYjvRa;J8Usn=eH&7w^`5lF{ z4D+bNG=tHZZm(I_Oxd1Z8ES1!ciK+cne<30gJvNIl{bUEXRpoYm6`I$+|c5F&-&u_ zZnE-yz#6kT^>%#tG;yU)sU|(m-gITGy*J%qwF0 zvF`ClrurB3;(S+ce7#FC#Mdq^zw*scomvf62>j&$E<<@L()7Z|25_iJl%Xv-68Lx0 z&bYmAYH6MDOcC!h?c$hxMs3&GK`vy(AzfX?xuli;o@#wfbv7-KIRXX~h)#XEm5mh& z80$lPtOqAOZ$BE~Q)C#-z~LrG;ww}AKFh~g|H@Rn#!g|Ao45?Ikr~5B1`k%+kCY#m z&UvctPz&wbSN6CI-i_0)+_~YvcbmTRl~Z5+PV0BSdRBFqI11Bn%2XW@zx-b7_svk< z=zwsi{3nOO@1NSS`SR+npjpdej`dRFS&vrQz}42p@HIPijo z7!d*ZP8g-vup0vHdyVha83yh8iQ}uC`=k{4fB<+2i)?e|*0522Vgb~N{vvYxzIH*$$}#0@zd`9@sYKU>UAa$WoyJekvUWOG0hGRWEUQU01{_ElaicFLJ;OvYmA=bwpdi=}e3vRvoQs z2ZBc$;gA4j@q8XurOT`{j(OTniTVZ3&21xpgtWN0;Vz?a%rY*`KSVCCBkKLF%L}_UKE6Zs ze6B2-IycOjkDdD*9SUBke0qJHTAwsWaTy|jj!0ud+9h02CQa(qeCyHSJJk3s^A?$? z)Hb40OeHS(kFo&m%hW=O01m`W>U`l(mEOI&MVGS`yFNRr$Gk?9%fcV@$?Tj*KI_}4(2 zVhaNb85A?tV7q*nH?wjwG%{dmDih>>SdGNBe_k2 z>&pU>UF}W?e~FW?TWAzX%sF2@g}SwcRH~fein4lnagS=Z(G%MhZGzFJJqC)FDz1n< zslQHgX6^%bjlfsvyq=s-Qc>vHQJ^uxp;!p!Mxi z0eKE7Qa@NsSZ40#fn=}vw@v=*B=2|%I-|309^PCB0yJw<>byqjK0Lfxx%hAk3r8I$Udb>}Z zM`Y7?{p}1daY5iwJZt|K!X>oP8{{-q9ZqNCj28_sZwAU{kt_+2=gHd%-%wHb#y98b zgyG29Z@eKT|5)`haQLBitp|tm;>~Oy)O<1Rl!0LuW;}>%KJq^1_OPpBDH=v?-q-K; z&nm%avn1tIe}asG_0dtB7L6tRu=zK1>m&nv229t)4Osv;@U%&f`n;4A;@u~p z0>idTi)zy0wm?(nRX^4TpR)D5>J})5-I4RwZ99w>wk7zJ+@*Nkk{kiHEzgG}5{w)S zRB|aidoc)oA3f2oJsFLDh%xa-MxL_bdps zWg+OApY~XRQ9dXi-?)p+%lhddlq08|R?wb-YPXS!0p#IA!STb;b15h?#~x&}*hPI^ zufliGG(w;^ftI_qcw`FQ?j=5b(f$BqgZ=pZ>9|X>G}nsX zuq8we`gm$TPtubp;aNsPL6uvf^lTJ|v^2*lg=afBPrCb&ed56nZ!TWXmlp?RhZ_5- zFD4v<+>y{h-rC>uG8mUK$T0O|*%g%ps&%67w1cd`LY%Zx9FPM_UU(YfiL%m?5iXZj z%9RuoXJE$RRrt6)$atahoxzI;)htC_?p4G$?xuZE1Js_G9QryU8%d{-89fL_r$UK5${CZ4`TM1(mLOc|%n{j3ObqnD_sYQnRJxfq}C+=~4I@TP6qv(y4P@=7uu8&Gpm2486pIb8DV5*L#=F zgdsRIgy+EKrw}$;2Kg%g@(ku>oZ_SZ9dr;0^p0VKWh&cK$k%-ifqJ(XDsQC0uCCyQAyCmZoA>&ARm>Abd|!(TeFE%I;bW z7CvNKXFJ6s!WC-61>dmz2(_e4NxW&y&ZQ(Frp#e@}HIs+rhh{dFTlS%+v5WH*v>Qih zZXn+U2Q=xu`N|3b)w&-HvIMkSxXiS8&>Gix%&;?6K$$s`xS5pU*um&80w-im_8&hn zeF8ZECFvS6lL65{7)<0#>~Sp&DP6;oYUDw2KT3F>y2B}yiEwU=G3&Vu?FB1}DaR<$ z0s`el)SdnrO_V=j%gm{HNp63u(o-DhYn_Q(Y~h4ye~ByE;g(-l*zW1V2Bu^0f<@KA z9K)=dA7%G%9REnWvU3G1x_SNbE!L@ox!GMe*X3{Ca&@;Z`zVuhJ zB2P#tVm%4w9%4EW;bp`)xpmD_YO~_qaa#6-a7#I~hPaR&Hd?^gE7{M=P8wk$%p6uk z9Q`M6g--(5A&Hg_u6Hi}YxvIASQ76m2t z(VR{wVHAvar$P0vjaYl+{nl>Vb6Xo>m_G0e*EXhQ1HZX$+uD#25H&;EO|1#9>K$e5 zndj}pVgm$4`WFfQ^`Xq)7V|c4U)1DuDjr!xx?r-+V~bU`BPtN05BJaG@s;r$e%7Oq z->J73>YBm%Us_>DV>Qs!ZXn2xk5Gv!3)SWgU)v>I(`}Q!V5OZJSVUySBG&L;U!b zs1CX?Bg_3(shRm^mzpufu$G?^+2zU-kCe|4NFG?_Pvn}1{gxu9qe%AA-M2jhG{Iri zhO&!?b5G5_@I}PVgEx*hJW_Z4wX-$^Z>B4R2@3vB!-ifMH~rSO(zdAT_M_ftW{T&v zo^Z@N-r-4ix>Yull6Y176;)xg|NZEXT->>}-*;qFrTOH^{z8+xHSKB!S?r=0Jravw zdu6_BbrsSFdc1Qo14ZiM9AcuE<(XG}Z@~fvc8jW#s};p!X=RnQrllj3V>^WpGc6oz z8@=Bzf9`mqEL30ZR9Cmg>&xbiUcM#!e&2}y8MHI)6;zAn>4oq>0HmPI4~uhqFaUDODpXLE8Sf5ZN><&1=AZ9!?FJ~->g|ie5ybHRXS@e-DYbk#Xp0#N>2_Vvv{=To%C7S*U)?ce<6=t23Ryi@j;h1 z7H8EYi;l~;MIw>#g?eQ?Wpndq?e=^w^u zH}_SyN||}r)bz@#r)}Wo{(C33?09cZ7hm6E0LpShx69jAI>%vTH&jij8pa1@IUsuf zdAF@f_1Cs97JQ1UH*UnJ`u%N|+#VyJsyaLx{J3Ygh-aO7N5TJi?5r@4yorOOIfIqT z$12PP8p3K(->FQdPt}03{c<_(fBBb}uUm#%%aBPdpmbzS$x9D4b9?%qaY zex$G{|5F2&T;LB`9*Wp%t@3+jY+`lT@yo81aj=FeL5YDQxrSSieRbk3*vEI zDZV#%_^Ja>&$+1$2FDtB5nG`J^R9w^@ufVv$^43tQX@+rUYOxm;Hx=m#Gke{hs&7` zSV~J5E)UZ=GtUd9*sb9e7Os26(OP6%cb2oF`xI*Ml}DtSyt;Y1^b^5yjyNy!9Q0Yw z+Y7F~ji+zo-<@UiY7c9(#Y*@3s_23N0?dl!S5ii}xM#@lUZ&xarl87F$l6!x*e0Pj zWw29~4OO;xz$1mXtMwWOH(c9c*Ktt?pI~N95`X>q|CL=+k(*@7Aaz4`;X>fFiRk(D z;S2azulblBeF*QA?JM6tZ`&7)tlr<>b+z&7D@Ir?u&9mBSh2YVw?<*rwwaR$tu`N<6%S>2%GjM_H#oOLeZKH2!FJBHEYm6$kVc@2Z)uR-!j~9le<~Lv#GsnB zNOq9=GBEJ@i^tGLfBjsKU9T22>=kiT#?Q#r@er5qB8c(>I%S;NWDW|tZhPtAu78(7 zRBqN?r4=W-BNnFDifFT6#Jo^H^Qgn3Dv``zS!0#yv#o6WNbp+7!Qpy_ef?1?HsNY@3hUbVmroKybpi#Tof2c% zZ_N;#Ek5F;bU+!Ts0x!sOk>L)pnEho;V@r8o*7|B*+?U4 zd8T|24y`0--Vx<-ekYCV{deYOnr$5A!}Fgakz$G>>C&mTjVzoOxFgE-$UPmN53g%WUr8L<6lZllHU2B}rWo$N$u<+$`6|c(#ge{R@)Z;+u3^aw^BMZ(3a` zp*qg`*{pMen8sX%8GLPI?!qH{&4F?m=vya#7~8O3^yBcq&?Ikwnkya(~YB ziq{u0CCSjGp#3fMhVkUXQ*3X67Wo!FfOSF`+?%uwo#5CvwXTEAP;HT(GgNk&!DC~_ zZHL@ZeuqtnhwR+BV|WkpC1h`#NfmuwN|+|SSCBBsS$h~tQRLOZD2@k~RvSCZwf2Vd zWsVBP=7*5#=rU)5kd$J6{YK*X&&CgLHr#R9Lh$yX2X|SjF|6l;mxfnj`A6a4GUAOzkO? z5;jY7*ZsV6(5&27Dt8N?g&u%a+&YpifAmd3h1CEvd9{iNxwZgO9bN9s*m+-EWurW1 z)&n6$D;iLB!4mEk&mv8;TeweHYxH)`W@}dvwI$`8yR0OrcAop&YO1BdY^5bXAeNhiI)(eY$x$yQ-+6pFE$TXTc6w zng?pKIt;v=sSS{#c;O`F^+z8gB@V?!g(g^ZP7?PTf1C7xSB&RgZfY;f{+gRT7mc#3 zYz?G^7}75nnHWEuVt8FKbh_R07o%To`^!8Y9PUX?7@v|UUtp4z&-u$s_&9^~9ih&n zmxn3UnrOAxsoM(DUmwO1hH=a;V^d}n9D1ta8O<~qyO`-uGr&h*|M8&n{ZGIBsta_b z&W-PVom)CgO`YgC!?p^C2$|Lze91^%_q?85mmB!YlwgY}UU9BmVY1+}P%GmjaUA5$ zxvUlk9*RpRJlYCLfi`c9TE8^Xm=p2r#=8#BfNNkRpC0@$P{m=wf2!uW3ZHjz|3J0Y zoE~Kt+u@$#C?V>!t1hx&e&z9L#*~)URFXEX4cRw)}S> zLV;TrOxS{XK{v}&68Beyic_!s2!XOu@7BZK?W8Tv)>X?`Nz^A>0B`bpH;Ua)t;#rJ zZJL^me4ECgr8;%>PF?>MkhoM7b~+QVN^uLJ$*Qg|IO8BX<*}a0EFem!+Bpkr`W?0r zTup04Wd60m+7t~2ZK6SG_F8jqXgR83h`5`Rta9dKu0Q_wWnLFNWfQZ}D`9fs3-GHZ zU&xc6!aRR&3!?EN!#h|F#|#K-Oh8Xhw{M%94mLZVVyB9t9U+k2_YSjJvIJ@CQ{`N1 zrKp;kD-9;EBwh~-I49TNU9%DqdwkCZ)bSi^sLuOa;#~u^2i6iD*;kwZ5u%sA>Zotr z@;hP|AHHDEmwj&>Le=%W$6b-?tgq!xJC>IH1A1WQl|D$)KK!sr>~vI)g`do2x5iQp zA5C2WpaYjbIQ(0Vvs5X#eS~SrN5RkjYboS3E>1!&U%Z+X+PJ7w??rBS>{1zaLX83;V|!etuGWVPWUE7UNr`R3XM5ygG7dJH&eF3j*mu%=OmVuhyAe z+XGo|zKYJi5(wM#f^FsPu*k0CPtU0(L&5WNHgu71BVz&BLdb^1niUA>;LYd9d-EgX z5g$Ch?MOuq>^*AxP}~zgd#<$*mL3+r-I9d<(hVNTt}MEFfIQ*PO*?%C2R@)5pw*B0 z@!;k{p@F-->?37Y)yVX3@Ql+Kci)dXD|$5 z%K5S@8}2GzI%h@aI>i8R;x}!NY2y+lBJ}H@PocJ53g@0gzT9goXtzY_R5|nL4Sl6W z<&$>pFs19;Yggu*tBN`4P%h{jT+(kc@GV|O+hDd?6W zcOntn(Nd+JCa`B3YW!`8|MVroAIUiI`r?_Bt=U-ncsDc!T>nuRzep#W8pAIDpQL_w zp8=12+=6ReiJVa22kPyGd2<_H``A~|lop;j(DJgS+a098S|=p2y~ zQ>Dyb@I~i`sDr)hT0j1;wTV%vJYgooo@%aCTKLGiu%p7Q&qA*=>+!%^iSe$-^Vf-~ z8cnGNHxK5WAqW*tG`R!;3WzBAEJ%X51#)Fp$fYj(O7`r3sOLwz6Xj5=8Mz98{p}R; zEO37Z%|QB2xV8Nc(;FIvOAbfh?_-xUHMgE?jOM#U-=g6{=o@iMp`*+SCjN)GLEIQs z1o)R|U57hoJ*KX9Gq-)i(CF@}um2|s$KXjH+KS11MWb8wbOt_8`-aE!_i>CB6gEu` zOb&-ZtuUT;xm@}dgO2udRou;rUk$nvtNs~G9cA%cdKrh) zZ7D?!Q-6Jk#+TsehP0F+v0wRgCNCmlfbP|gC=!L2LVR6u6@x9sW$DvGdR}k{JoT8w z6F@iQ=E~zAxoo#en~~Y!fcwdhawMzkMae9Qd%3m=T_^@4vP~8>5tY>Wml=S&&tthY zg^T!(f)iHXOB!`g-!diVUVm35<-a}g0#)uIS(mL~#OumWaEcnS4JRUIAiR_02)`uE zE@PX@+lO9iTSjhrik`P^by4kiL1a>s@99u;yA3E2@ctNXf;gvLs&F?o6ruQ@gjDm* zklW_E-~43u5{|sI;)6VEtJNbvBQ~wm4_*S!85gWZXj@$lS^a^jWWGuJl}<_@ys|jl zfaAhRgCuXW?FE8`V3!ZFDrRI^E2!iT!ad#$a#0Eu;G`Q$>!yL@^>;61;842=T-8t$ zLyR0PhiabyGk?S6F9R)&t(P8IXmq-Gqv&*N&jn1%pgI7P@IW7?<5ICL=@%F!SkN`yGJQ(k6cq)$jj z++{)ygb@ZOl!9laAV*ZB@6qd6w;I9gm8j@GO3caBNK3$Xyw3gr+F+AOy1_QsT5_@3M!0J4uE1v zf(M~qA%K}_T}~F@xNI6p;Zuba{j87xA)rW2Rq*LZ+nS$4kD}ut1`$XI=?WA)LI+I8 zAOHe*dR#9JO#DA3mi*I+usZ+%3l{n}jf2kK_}?SHZUTS;1<0wY+Uu4Y*`B7pN4iUE zx6vcpRWoD@J?a-^S;{q_Qr}zp1XyK-xmVwK=s5MKxrkIc{`_qOumy8Cfgwm(zzhbE zpIGx5uuY2(UcLQvQrCOpVUVs`6b}`$YlnC>!wzKD`k)__3a1qPbL~Z{-2@|Bw%g(k z#m@E;U_pBkYbeJZ>1g$Sw?7u_O2LM1H1wX$pTJ(dtAYUWtl-KYtZd?l z11}G_g$8_KAcWQTvjQ_r>6(QsB0$Mq*B_i{=B|_e5%YB4h#$KU0IC4MFn~ZV7Gv^< zStj}+nNxskz)Xew-@M50dQ%oJZf4vEO{v9705^ZpK|(QhDOfWAwV2jHmNSV1Y74F3 zV?jnVPB;WO6@u;1sZa#ZoC@Rd)~Rr+WSxp&P1%~@;HmiP%;Kj?U>xo#_3AUGUxzmB z1_>xMQwmEj@3D)huT+{@`>OG=wy~(>6)Ff%ZFS?-y*ap&_&pFs{K)&8$jg>rn4kl{k%S zyq}a%ucf15v{=%?owhpZ5L&(3_t+d7_^>D~WVfY(G6((b#|8BA0aEEO@5&H_^^5`mX+714k}%K4h!Vc` zfC?Is&`L*k=#L4+Xt&_a1i}DhV2EdsZ~->nqQY|Xp$zJiC{@3D_cc`n7@_e3A*M z`bKAadTovWQ{#074gn1V3kQ#Yh=h!SDhmxA0}~5dHV!Tx0TBr)894D;C+WT!U<21_4^m--^~Ip zJdkUT83C&E{3jCy!EA@cYG2ga2VMaJn-MyU{k{hbV0-A(7TnmIU00bZfh-L?l84Q6k8(p9$#9e#j zay#&*{AZqb!i{nEIFLFLjG|^yR#~$D|34+^7{d+y08OLnKP1aVk&cmYh+LTSpn$_E z1CBKUhXx(;t@HE&$&|WJnIW@OqKVmh88hLPv?y>}N=NO3GRf&N@`?quW?!+oJVOxQ z5M(%s#o|K1?dWmCdD*X(En&UgZ~Gt_YA^Nvx~wn%5b!1mvj0#^sPUTb)=5uBiepa{ zM@C#m?v<3t_GwDBor8v<ttQO?g=!#O_g2#tM`J3K$P-v8VFqW@nKOE#jm5&c;t zImW0Q^h9U_r9`no!bnamPVbB}?({-V&$u$`JiRtAy($LX{5}c6LP8)wpoZ3I{h3ux zT*ogqj5^JCz8()fNA1td9=LZUR>1qx6K~4{4g*f)xHy7d7KIz`4CS<(k&^?-P6~p; zlMpQ{@NfY^v-_L5{sv?#w238S;()WZ13){{^i}>{`-Erb{ic@G-7jf^E_BhPN zlt>z-oxOEA@1B=oe8=`38v+X$EK-^>3^bbq1mABhf0CI666W;1vn64x!~&3Y1$L_c zr&sw`Rns0{A1{arfc3$CudWOh6_5g7nN+vW4$y%^dVK; z58e;kU~zxK!!d83GNKVCq4k?7Q#mQ{M5H@a4(ONd3j}uH_I4S&O_<-{_3=;qyDfxb zNX<}8iS6^`a5!cZg$->0)^B^QbZQ{-W_Y1Y@R%{!e1dC_TUHRUe0RL&twDV>P$sB?z9jlTDbh2`HHuPsM zIl#>vCZ*h!k`m@NM_`M(vcg6cTxEr+GZn&Ay8fT4Wjo|*Q>VRZ-K|}PTy%Ht+}Ta% z(&gX}Ko0(Z0RvJu7*H|@^3D>tyH5n9XA0B?Q7JgZq@^}e7qw2gyXU5fv1?s)Zd+f| zxAyy%&hF&q(-*pmml(6x%3SJRXhoPbWuP0yL&#bb%3+jb{?}@CA-N^-Oh~3J|MfZZ zIT!D!&Y6#3GPj6`_h8n@5L)7~tW`CE#ORGh+jxKw0qeEbZ~xy<{dX~=-FEVFj5Uaa z5^}-I=-Qv!aqPFg(tT0)7q#mdg@GVFFc@V498dEk5&%EAMgZ33LqD_x15-(HdOz^v z)OUZxpK)dtiO@s#kCJsLmeY}y0UK`=0HCkj4FDPLQ$hs98x3T2#0vV=_w+-YMg^8* zkG&2$?3gps|NEZLJ@zNmMsCLCrM#9O=MO7gL4`F{Gc{LnDRD@K$Y?U2Of2)4$z^Jp zPIgz$mUHEpTqO6C$H=$J_seJHZ_3ZhKak&600luoQcx6h1*Y&(NE9-KQlV0WDv}j? zg-Kyi*cF)yr=m(xt7uj%RSYRsDK;p!D)uQ3D&A9ER{W@Vp`; zs22u43;a9q-;mUhqhHA8=K(TM<%2jX?&1%)uKpf;1-=JAAdLU5eT0KDSVom$GLg(r zCi{oc!-wSO4YN=n{~(m`|UGnlTjP3x7sQ_y0q~qQzB2UbPf^1QIN-r zksPtboYe68Oy6G05|yysZgD911CY`YO}qFY0Iyho_CI&QMn$6GmUk9@j}32LnfmCB zO~hgU-M2fV{v<;KCAbwP2E0E8_T_tO*FOU{*4TZFOXOP*M4nCzG33QUcAWPF_Xt)p z9srb8)QS*H%d#SZc<~h#px;yGFP+ks9ucD!G~a4zHCIIZx&o;Yu}wYk#cDu}2BR_? z-tdC%!CpAMyn(YzbnucV)5?BuHSF3T6WSQTT}m)uKw3|v)jHdu2Y+;UyZm$LCdSEP zLTxwr${Dx$uYk(syIJ?@#oa#9k~@p@JCB9}&D682ts2ecCpb|eKW1Tx{C7PGv15d( z7|9~PMYdElD;q)Nq+AeO4+IzHwhy_}`8XLLr(;JJ((qW7=e4u?WQ5@?^u!(mB}J{G z3QR!ksUJg~UBJ+k2KvtXa$X*V*4GqC#6|BZTEJDuZ97~jqS7^~cKyQ-PUQ6KLy9sP zZ4u|~5IdLV7R0=PC)WYdQDSY!^(yM1$0=VG!+nxFOZ0OOTxaQ-tDvrAnmrf zIL7k)*_iZ6G4SHJxD~-*&dF+`Yd&d+wKRzwYQTpfQb_DExR8sAzNaOq1%qDnw{p^3 zii&5Q@%8V7t?RP+MGh=GAvQR3yFE4|%5E3D6K`vtdN>Md?DAzzv!a8J12pHmwT)ew zngF%jb>YN{xb$E>a$6i@d6A1sml64?I%O*Q+ZTBMH55D;+g-AutSWkVza8FxS>Zb0 z9rK>vM*)K0xY#m;Rq2Mg6C>Bc_i|1T;i73Vrns2nFF$gu2S z+Q>O;sWOBCfm%uU4lMv&urVPCj(%ZE`@ggRrwX+DHBgvhLfe$gh>9W}Ma!pwD;Gpn zy(j+ugthn+CI5-FJEnUj3J9WN=<<+6c|m<$_B*~joC4~B+ z)XMv>K~NLE-co40anN#7j(yyFc(OhA`FTrmij(lMO;`_h0TdMZh72ikC<-W=P_&?E zL(zev3q=o#J~TT5nq+0;{K%-F6<<4S!wEM)9OY|uf((z2caP7@6u=CTj3lkgo%+h9 z=sYJgb0;eH*lxBR#A&yvX<-uXn}^Q4Z&ogEZ2(VDPj2EAY_n@GAPgMKiXtHYL75r9 zkoB^W0zW@5TR?*uc15t_KcI@+sIN2?ce+tWMWeKL7X^uQ)Qu)6ZYk4m^WXcn#tC7^ z-Q)I}4m$}hTwK%LdmxbC;p}4nur8`l@%Obj+RY;an!E!qWWR>mRFzs(P^2C{y+7$a zxeR+)&!=vS^ZBajy=;dNxlmRzjl3mqsu=I-%txesFk>%NnR+%nH#x+3FE>!#PlC!> zS*B^-b((PcXyp-Fc%2aw6tG3a7zkhWWCwQ8#CZ$yZY!I0FM5?7Zgcs71{*?M&7h=N zPoF&WNMw8putA7m`AEzhF-fM;^W6+J8u6~Ui@;REt*++5rnk>q%m6N%=~krB(!G3q z48#`>Fh02%=x!mr>I6~)1X6qZkfC#P3uvq^ljM&w_g%c?+;!V8^;WF>aj(F=*jRQA z?nh3w$*;#+nmNPI*A)rjtomiL^J}hQs-S2DPl44o{P}5CNAb__g7yc@bz6mjcG0_QNx#!%+7;*=3T)6z_h_tjt4f75Qdx{$+6GJ3fM$K zm~#0u>=7p<%mr*w0bwcVl?qRM?SbBa2iOXFXAir4ul5+05Cl$(avX3;0h1*Jg)=H9 z>~PK7*E)CrLog;NfF;m2cmPMZ=b{iFJmb}d$hZ4^6m-zz9z!us5+()YDgrn$KqWn5 z1}WuH#>;XDj_42`sUtw00O@(2lrAh?S-P?G8iINQsCPj60h7@uM_(L$bMzB}`UR*z z!14c>@M}G*?W49f;KuQD5bwO1j%W<2YU*jL0SN5IW+2r;dxqcx#U3Ayc>?q| z0H*{15Wc|-JoOcrH-@klaUiWI#%ggr4+0OBBsMEe8oL<4i+EAGUJA_P=!9Yv4ixCg z021$4BCNPv8rymWPw+g@(vliML;%H&2T7E&0*?n#6KhzNa<;Kz7D`MMs29H|4VRCF zp#7_h!oF3nKX}YHzc^l8 zy=h!I(YlZf$%(yEjC^}yuYMoNSsoQQ>?uz6AQnOE?{dPYqg zl+AwST-9k??`c#W%`aUzb2V9>?y?T^E!D!#Tna`;FQQx6Qvn9tCzMbm#y|dC{CFOx zfRo8nKTe#(c7Qx7X!`FI!mpJWMvw}UH~mf|o`9GLt;G=CaD?aar87Av+(%%KgNyKS z@_p2=ZAE~V*G=EH$+FB#T&6j*hVlQV0yF)jV3H|dr-lj6WN5u9!iMF=sj&y~mUnSN z1K`zgB1^zYG#BrN?9m-D!5Ymva2&}1(Q5<^>KqMS$h0W|I={$*XeM#D85Gg06~8z@ zGHlDwfF~d-NZogk_1oBOiHxvS=s|?gf8cyv5MEqHiUvTSj$P4)Y%hDYdAsXvrDU#| zzWC2D=Pf3q_$s{W0MQ*`T8XrrN9r{?G#EBF0D9%l$=jW#Uv`OoEhJzufJG*3B;&=V zL~=_wq$X6?3hhTCojeNEIjYZhu$SAZ!L!V4g%rX~fv6zI;WRXrr|4Rg5lVJyCHRqt zLXo~ZWC{{9NG^plapdH#x6$flZ?i%@&@&p0ujzh#9HQW1U=`V|b%mE4_cWH0FojIc zkSD-`ckco;iB=JJlJIZ_=zy_!h#g=c!-ZcAED|Jx92V|*dM5{wLeqBDmy@+}1@T$I zw;RN84(Vy;tb#dE;Oc^5xoxeN<&9PkA1Czw{mKAof{XvhF`?r?LA!7n;u*bINS6Gd zHCq7rr5o5ap+X*{VAgm24NZpzMCb=OO_VdCU;3Pm0ZjiSQZ#j5A*EBFyha*aHVZw)9fzb6%BMhVWD`b43Rg83E}^uK zhgFDo-hr^GA=W^eOR4C>^3}KqC#RLrh~(8UfsPLJwPRYq81(J1NXS;3T51?V7Mqpf3HAKZfGVe^;Ov#Ls_@TP>2= z^u>>U`culxx0>(?L*=`FP&EFJg@;au+L{_Q=S<@IuarHDS*j-HJnXgg5zVV?<?ulaNwP$j}huNLptN20)+MH(BL9LHIMa#RR|$&Px;mYIH_pkfx3>HRnF|LW-EhDU2!yw~O&>&~2Ys4skZ;DH@V^lDEw>c@}w*1*s zy@3W#+z1np!qvhRezqCxl@Yb3ay&S1!?v8R#58c7lM(i%)R9rT(lRpe?x=BD&ya_D z_N)2e9~%Z1L1nTUSc-4+U~Z)RsHK%AgxAOYM{tVonxgUf4fwuprEY+}+L};a%12ks zRrn3^lHklPN4iZs@Y`!XMz_&-f&$NsfKm61VRMyZtQA?D)-3Nu&}jPD*@EdPNH zZcK*6iVq*R8!7qod5~mqR*bTm0b*+?binBdm7m^9?x|JjG8ZW-T=A5mYOS}bQhgtdTO7?*e7E8&n^Tfm`-#j;f*_lq3oBULYhn7YkfV{EqThC;8w)A`>pzGDxb z4HP5KQcp15_$Lt%YD97*uZi5spBaO_r}h{86O&mOkj^=xKH{n3O@-bjRRV!G#^av` zEJ{w5d*N>>#k}iV0p@#ST9sRcylgSkvFHFPKmk*!+#gl_wEr70A*LTE@j9xZeP}#8 z_X!w0Wlz-8m};(ZmV&GwHvoEU1^x;qu>VPHw=9E@ZpJ|d1DeY_d1j^AUZol%c|2anStpGu(v>tO~m%-E&i15v4?3|F6qU* zY$G)V9I$nr|8TYF3-!!>Rz?B8wv4pG1e0CtTZJK{AM>Im@BQqK!|tDut|9 z%r6-M3F$mel!vu@v^3T0piBEa5-jG0BS#8Rai#}R7vAWdOGi<^_uerH3Klry<{lkV zyHEhjk%GJx>dt5;XO>*pu$yd7k&gO^5r~oA!Y*q={ge3xY|7ux~?v&Ksn53JA9t5EQq{Zy0M*{ew*F-#`q5 z)oikef(X~KO9f=Zi!q|RtypcR*gZ{1B#sdeCy>s*63!$_GOXbm{{f&7-rdflBEy>h z4Ml$s1vQsed98dT7qMo4^T015lJ*MXkjat2w@?+oMm?70KHe|5#3;5Pc~j zu%KHH+`{o`Ww^qwD*@kEIJ(tm6q?(cd`cCnl)vFKOxdEdBDsS60)H3%_X6`6e*k&k zq<{xfgi348>fOd}DgIIesgw6H1w9sT?OjG%cL!1W?=jD6*U%wbAPU-3H<8|gCiZK1 z*Ah@fum`uBGCTw1D-gO^5lA!dO(Vf!XCJ%mCGK23W5L0L;Qmb{U@3FxTa46R(QY<| z62s2fTsnCp1`VKT(YGw+QtwmWZZxeI)5Z%)Mbk4qg~4-_p$tpZJV%rw2uWVm%Vq-W z$xcAAs1m!7%klCz{M-(;E9FjD^J#V)3od)L{*2rNgDAXtz@KneYtgQy-*}QlQjI^u zZr50}_Zr@tFT3@XlkT1dj}Nh{f(CCL9efW*EDC;_*R*@ylN!0(wGnL{Q(mmUj%HjX@4v|WaZJU-UD z=hPu$-_ZkM5PU6A9y%ZgBIw)k9Wq)vk=A4_eN%0n61_vfgtYai^4S+?$ypRNwg73> zT7g|aX7o@37S5*J<~W0Pfd@OKl#;t;s5WRMJI?(+~Fi^{Xv&v$+Ecn2+zBb{`b zqKuW+I(8lPv^2g0YPJJzw`1a41D_!n8(?TxeWz!Wqp>tpvg zFJl>MNzy}dSaqlQa>r-5;!TNRnf4YFYQPxQUgjMxa5~8IH~Pqxvdv<@wSol=oz@*O z#AcCd1AzlE8sM9%-0;({WQ$g@r$0_n#=?{5yExMPV)LS&U-;0%?T>@f&T@gTWT0)_ z4!%BR3g2i%*%wHFq7J9CUmg})!LDP#^+rlARauEfkg`Z)VQM?Yg~TQ*nHa@ZUKGR8 zejLSx20MfkP%8mMXQ6IF2kIh(HF~Yfd;5r*RpA0+m+?$jud=Y9iF)H^`ZA>DxMo|0 z+|#H*9Y%O&=7(Ix`~uz+%;VGRf->nU>YRwfq;zI1rBTL>LW~U@6|M5S;N4MS6U8{g z&}-g?O?a{t1i{PWWJjk!HE%vKB4nSZe zwe1Vh5hz>@Qsfkiffe3HK7j=&h^iO1`BT^(>)1yIk|na1_J`~I4t~UKq`RAf?Tuf& zdBc9v^nni?18U!ECAz=A*?#YPk3$+hU;~sy7ZGbifn*7mzashi2x6C04X4is)S%UHuW zZsk`zS4wV75wwV`S~A{KrAW=s?oAuN6e#W=dxN0v$Cj&Ho#oqq;uy?4MPFJ-StCxoLTCWX5AUjxBZ5C>G8yo6s!)#}9b@lMbvZ76yNhX- zgc-LZkH;cEi&G%_S@+Ln!tns2EcJ7}BL)l*7dRPZzom@8>V3HQJr^4mTvnh9F7}F^ zmspw<5Zo3Zd;;a`NE^tH5epqLz)d#PhCBsz;4@T26vW_-G%!$wLYjWmCIgsW;@hCh z_fbH^W?B3Vtpd`pga+`n6K8=)nO!~L0cBzKO<&U!!}j zww^8LQ7sm~Nv=wk?|0Qv(~Ypb>uL_+>z^f0_nkpI5Pw`M2!%uU9)~X*D~~rtRx{W^?wsY~rA48F7yQ_P0g24e}wj ztOe}+p|_R}kbn|>-Nz}}oYNkoYM&E1x)@Sz?xw=z2=OV@KXTaR5S}aGu4$XTiMCTSvX4-gbL|iCACR# zbURFXF^v5oGI${SEBn-X5z(tWnv<{wNKN4IB#O(oSSTZlsA32l$@sB|(nd;bc%-#t zUFnvIfIwN7^iW4j`(A6bqPDQ3n={5$B#!Vb3k=VVwnTnk zKyD@GL()li!dG)pJV^99TVP!W{4;ck*qMQ1Wi4j`67aJrNYdHD6HdHz(#bFF5@hc} z`p5wY({G8YXaZ1-^Qk}h(@VxF)2#VLQI8+Qx@@QpoX;q5CESH2hNafjj`9QDjiBk& zkA?-otpdWDthAOSD7A=*Bk(RJ_8^o;NZQy>F{KK^)(RjBg_ClmD4RkVUPbT5{lVCD zc8J;FxSma{q}T%dbSxUD+WF5|`X_>}xn-LHW|0Zy0%L(asu)t;U>hj8Ik0%05*wmd zz)vEZ$WmG>S4rdk!1~LtGJYvG$d|^Un($bQIn@I;P(5lRw##D3d<*KL<^9l;#XSY%rou>QMuPeMuFN<$>06LzPVBF57&dg&L zp<{$jB8Z`3K8*i^8G?d=;gY!H^jYr!PQ3h(!M>t}d1Rx|a9tyHyWh=~pZ5#J_n>aH zP5vU9e-T+4-Jm+7P|1dgl|W-GZ_w!XKg0*tx#C#Z&AuIhS?A!o@I{E7wfc`tMk`ayPIM?&EB5 zVc$%E#MW}szBBfMoNH_YT*-{E=IZ=I8?h;(v|idG2NIxoiiZo-ddIiim05jvFAYHa z6AVr??}S>;N<*`^H0hsIPD6LfKS777papj zJAl896Wg+E!-%p&@kCxoTJ`xzu`FB(57japc{Q&_0wK)_mU0IyE*Cf>IuK}CJcIU8 z948+cl2n?QKE3pO$%%~M?cR{kfwW=WCPL4*dHL4HKQ`>rV-x(*LNub{d`4yD1N^JJ zhsUFVM+{Y%U{gVqO~45$idp_lM)L9qlB;tJ4R6pfF(b3wJ48@VT{;P5w4x%<6TsEY zFc4UBmPX-7USZ^{ii`2Sfi~S-see2*$3SZV5UK1UAma*Z-A1{@Hur;aBDA;CS-nDWuvr6z*m;7`STMV~ zCZB5>ODky)NJD$A`*|i}ZaSU8{!7RcnD{3WT;nPa^?_1qj?Z~5UFx-Fc_FCi`jo7Vjj#4c2+XNWw=G)H>)Gx6cy=N?qJd?~A4m@~ zc0xCZvX68UkIKs%WoVql9f`9p@;9UygdaiL{E$DKfhA+E_tS?D<)zcal0EB?;SIzH zuC}D_RR~JILdGpZTRD?7i#1@yv^#q;V>X%Qvv?xGMaKwa8-{kePni?P%d0U4?604w zozvO++hJs(7;As&m*H*mFWQxVb3zD;O#Gd{qWvwSz41$bqwL8ztQ=Iw^|0`nx!C%Z zzcGF|Xj@TI{2P*bg|v&4+}3K}|II(8f6D=JV!iM!IT6oYnfAp0((T-rgDu0%^V2OyOTh_GcnjL4(?6~kVk4bF5ehYIS4GuaZKr*H7AX8fau zctYhGlN$c#H?yalp%s$2IYIjeFfVJr#p69 zpdM80cxpucv!w4S)xUm0KD-<<%AuIpv7Nw9Q(SB@aBy&+$WjCzMec=sB1o&*xPh%C ziq2QU=bB!STb96m!6m_`XO;c7hm@Pk(Z+FmIH^^AITCzQA*rG72yLRd;KZZr2LG8J zcMB)i z^C%w|G{@1)@hpFdAw}5S{!1$GSWZ)qgO4lsvEX3RUCWGX<3O!e_<*i=)$gMZk%H*D zRHI`nOxNQTfyB3Sq+CbkLmcEalq#>y&ibeL+t-KF#`fImS93!9Mx@XC)V$W%FEuOq zMa8^tjAO+q#b5$|_juUwOCpIztoa$~TC?hVOmcpua>cI~rZlpEnV9;fymVvgQ@~BUjH)RjtloF!fAM= znfI|nN{N^_k`;dex1Q(a!l6W=rC|b9_JIuA9wN3Q^s*!`z_0RTawN_$@+>mN%-;J>qoVQm|qz5`7;Ll z+Cgp;M8pO9^zVRdEfM+8@&W7 z@>LxFP?K(JU%<)uHGHNXHZ3l1xv^hf;2(eu{fW{&d(rWy_#Un9m<|+n%II>%wIwix z9n+4%1}!Fz#bVn4redq*KLn_LO#7drO0r*9>0+|tr9-0f^rQo{*$>Fb!GHOAq9_O& z5(xwDYg%VJ<-vIdmqE)Rz-6VNk;nCZlni(dzLg92_kkvq)4~f`8?r{$gs$ZSb7^29p=bxV0C=qVfCzpf&&c7`d9wsPmH3iL9~qSf{59f~O5Gi(Xmdlv}rU zm17Rxf|l=O<>kBnbuJ#c3zG}B@n{2;{yJB>bOwS*a9iM5QOIGbc|NbklQ(Y(ZgwYE zvb4e__Pnn+Ou!`adHUz(ZiYlc;jNi;h6v*C*4Eu6i=}-Bvh>jj^H$5cnEXxJL460c zzx0^zXQ~Pdef=I5H52^YU%Fv`}Yb%j}k|X>I>oaq7=a`Nt8w;{SCF zCOnV7DTtC#21=*|oJbV66s6+T6_L%8`7s`+*Yck)Gi2_)oDeX>&hCrahfJeg|)6Z(6=tnF0Iu&hUnU7&r`q1|DBvbim(Vh{LV^Q619% zvoR^h$FSiH2^o3FTBUtBl_qa1a_2wQtWs0I+(-3wz9&L&b)Np_C8KF%Rv&&mEwNd@;lkiHI93VaM9lXyhdZ5==V&f6hLvZp0u&c{TB@mD1KcXNAgw!1UwPchm$r2RUZmrc_M@=@DxW?h?J zUl$kfdB*1|O?M~p^!*@1PAHH|^p3J2oG7+)XsKRdDD#DA(ittbF@yAcwOBMji;5YKE@>rS7)RGYW z@Z2F@kcuW)b~ab;oN5?i3DeNo5|FFo7*$pucXp=lZ@JZc&f1K!ZjQp=w;D=F-~bor zIbPe>TH%>!?J(8qxod>7S!7fC13{=cg#CGGut=dyIJ{2Tn^5+DW~{H7t#$gRE>0?r zb8np(dv%x&{Y3Iga(jewo6LVw77A{d1H?zJ|JJ`O1*CU$#_9jA?E!WZWuC|ylxzxZ zmv`)ZW|7=83i4_>1{5d4asn)s5~wSt2ox>}nt)b_L@001$#vm2N^dwY6Zt>L{pC%_}q|lBf&dS4t5xa(ni!jLQ*s(UyFk722+*6h8 z$qa4XAXM-A)_H$}`?qXci78cDB$IT@LIA5RGG*@z)VZErEf3AgX;^qZu>7yG{S=4U z3@de+9Cc9mxzu*LeRh6s|3bwYe5N!afbT(8>iuqKX2gk z3T4B3B2*Vsmb;l8CMSuz=|Y)ndQrl-RlikP&tP&`{VQXlMwpBdg=M>G8?yK3N=YCfUqLyoy!8QLv6!k*<%g6n0Vn_PtLIIb=s~DDo>(76>Yw~|7 zq;ZO)`5*j+dv&{8B1fXD%1eKCxxhdL=5wnvpWgr)nbp-`pqNK945FKEy)>I`P+saY z!|Avd)dB-szQ&LPv=Q1GYF<)BPksD4i!(;Ah|yb|>-}0w*^#!-v~-U=MDAe~m`p`Q zYY*L-LB}wm2vIM@pL`26Kl;bsJ+2+J72UYxNN8p4c?O=~UR@+;O}FZ@i@?P+PDVK~ z4^s?W3M-;y_nki}#_%8<6FJThD`iBRryS*f&B>U8aRL+~6pWco5DDoSOFkV-=39 z3h(LLUFT@a5p2bT4N3ypHpw88HwGOF9QL&3nkIxo&p?AWGb$?ufkF)LUqZqIJG(jrINR1c?Lv8r=hZsLGS^atf4bS=Q z0v!+OerxDohngbyG5W|Y&UJ})?}q7h7MzZ*r2d4CUW3VaQ-`OiWGiIbr!z+yhK^l} z#A)c#$xTc=KnX$T5lG`2pY!6#pr1rUOt~gB#vMnEEPRzt6XVRM1Q{OCJfuhM#2Y`{ zpiU5J#?C{9A1(yCj^uSt5CR?`7Mpwcf}THf=rEJx)w8%_xI=+1 zcpa=dd8sRM)M_yGIL6b;2+C)^59y>*vR|yv39i&0UCG+JhciqKP*PdF8Ci9n*}y$3 z*)!YOgP1tS#~9ZBbe!(4s&nUBh)zg`*i_ET-D;|@50$`SGd0#g8P#puuA}A=ap#m3 zy1m9%*}U5~<~xn81-n%PD!%mM5er%~LAp524QlT{xSSj_5t&2LYEb$DE*jw89%NCN zub@^!7y$-f@FUcl?vb*1M{^rhfN)h zBVmQh!+?uxRQ#Bnz1)ducAd%vV*~Bn4b|d^t$MKYD;jS2sd~72Rk$H8yJmDjO{H~vPz#QP+{BzkGf*u?oc`77 z&Y!9HfU7m975e68O5wha{az@!7LQ6}sm@%O(U8#yg-75>nPSV$etAvj&hFNs~01c0$MjP+tNhgV_uw z$C*wOEdQga29ioCFh>AUP*gi3;$pptM97p0CYOpBVoW0YyZJOmL=?2%GtFT=0Jo~j~<;OKpZ3`3Xeiw$P|m? z6o+z4)9THMO4@Xmte=GP5`K+U=tz$RQmb5Q@=K_WC>?myx+D{>?0Kl+jR-_D@}-NU zhw(MHuy$wxp$uUyqezbw6N(8C;%^Bms9n_CV2rE!c2iD)DKWj^3u$;bPp@U-yYlO@ zl4#w(G_yAl^vvn|zm>9l^|yw@r! zHu@urX9HX4ryhnuAFBCDyx)mgZ#Pi7C%-QaX?4*H8;iM<+O1otSt)5|l9R65_jcL@ zSIQwlzv9On-jxlkVky>DZlEnI^?kbcFD3J1O7z^)1vjX;MQ_4QNi^|a3-C-5+=^`K zD^y6k5<8{7*9gH{D={Iq9rx<{-;7%Q+^p z+9D75fRPakPMvFQaUq8lBS_=|-zZzkE)iI;K&o=1WuXX*MO*~LR`uS5f_R{auv$h| z;5g-Y{eroQO&p&jgbs@tIHi6%quwMV|6gIJn0`x2>q^XxijXu&{fDL4KZG%Q0xO;S z!R-c9v_OC-&CPJSJ~vT{Q@?5=kFxZ8AOz2U^~~-#>%xt8oN~OR38mufFXF86wn}}A z1*gn4H{GD1;|oa$?nMqoT;QGCa>9YHA0<6`Yjac>r@?tV7Sw$bk}q(yE@;gUh}~4{_8IL+iw@qa>uOFdbRsS z{?KxzDc$6uYzrPa6;b`)-;H%`ot0F!^o5oF#fY;f-ir33UV1D?<9sFUtBq5u6KbKQF2D9H;MF+oMlU+u89JvG`Ue)EPcqr&Wg~6*T(oL^)*~WjZj=9=1rW*NPnf2R@?)wFH69Z(pLM3nq6wis53f+eB)oD>g`R|Wa z1xVoQWrT79a_l4mn#XSkumg&BLrH7`$%nIGD@|4IM<}OH-)(4Mn@Jet7O&ZtoEfg5 zcYVN6zi>e$6GukR&gIzJ5!@<_OI(qxYY*r&L}*t8=-QJLSHuaeIOVvfb&iT_qPukM z1gP#C2oi~KWZ~JlJfuHyIYYwr%c_5052CmVj+S5`k%_zu#aw#SfUmhhw|prmz7RCC zSgK{f$;T^G71o4$*O^Y1DGT{$`KdU0u&^4X;9@aMD0>FEeGHL{5^&_}xia@48LvF{ zPH=+3X(`CXDaWfCP%7>hB8K3kAXO-QqqNAXB01TnNOihv`-7+Wq3mi9vvgX9;z({S z|B#?MYH2btzOUmyPfFJ;%upnR8@}oID5^t)lU-jF>mN0L3oDK1H~|@AeHmY(@E2zX zQOrmr38o(;P~Le*yO+m+u)&uH4~MqqrD+zXqmWdJ0L~Q{xpYZB!)Kxa1Bdl_26u@5 z*SF|qs|bEt^$vXpU!(YHJs4UCs)?;>-1>gfVZEHgfFQu&a1&f4z$-Ha?31?m4Z6t%`diujC}ej*2&{< zK{CIUiwB;p+4ZvZWhJC}iO<-c4EV<=S!g|{iqwawx+{TONiRQKieGwa4V-!uMn1_u zc3t^ml~AELE7NUJa8oRG5}8kav44I=t{|t#IXWcYsTq|0ObiL$%7Wsx9x`DPiV2Vr zNa~3|fpuwF4k1*YuME##oGBDP7y4vPI)Mdy5r=CI0XQTK3{Xi!Saei4mcerh zgY#bbAy{%}Nyxa+KRPD#>xzsgPNv_s1M8koeiNA^rokzn3Eou}u3V@M6`R zx7mKZ0mx6VC`agXd7o?FWlFvx4kw_D$n|U=n3=?QL%1EU^5+~w9wtSJE5D!x5#g6| z1^TS5tZ`Z57g0oxbXz2Q7BwQlbBpSaQ}Ae+x^zpos#K5n61l!V!#?98Ps@)_cTgY) zWF!Y%Bh_BK6v4oQa7G@3|4zX7DMgfwX@uK=VFa82g$e;dhv$5MFtRJM3knOvUu_^O zqX%OKAsgj_ufK%Ci)m}?Xz%Fg?1ofiL7nRxZAV9#ZhL2^?BqoOpCIIQd{gM;2?-2e zJSh`tW!Jd2))gEAGAq|+K@j}=9*IF}$#0Cz4bMK5-&1MzOe`vQ}Om%F@Xky2B*Cf}EL_ zq5c^Jk}Au`vYN@g^pA*%2V3t*WHZVbRh^6)cUw&0^iNWk^JxV?gq#fx+YlJ`tWRSn zc-F|{#~SME)xAYWm&Y*?A4nw9MVuK{yU?GR_ z*>^QAl6dOMdeO4gA*Jd}_kqti!iY?w`sjrnqBmy%J_X$tFv3Kp|$rI zG>yF5*&0R8$_16_R7(asb3X|WKsQ3I`#v|Wt~%;=EzV2OwY0qTCPhi=+OTLre0j>U zmls+SySq(^jq@zD)NDo*M6;?E=7}6TO~u%=^jfssMo9W~8ExZ&mifB#J#zx6);V^j8k^uWM)VD`V4cWVr3TkN;pmme8# ziZeqXJ}^Dd9xyeENDT4z}! zpc80?=nvK*V@%j8965hl>*J%lq-@)ywx8a)OWvh|J2orrqet^{Hf;<^@4nl3rWJhI z3MdOXVHpRC+H`yRnETg=+P7#19mT>d1(lwcdz2~e*!EHJFXjB4$$s-Xzp>@gDWzg+ z14mlx%v}R_Kfo0i75M$Q()`i3isNLw1pd5Sm3a$@1+Eq8fuEPcB{&^ju`^PL|62O{ z=~uaqtLay+h2u!fHOe)pA42wvA*9+O#eO{cYBZKc@T@g{{5CE(%JE0cGxOvdG@L-A z1Rqo$8$G^fT6r*-LL=Y;KMhr)gz>~Y@H775Qu5S5{$ojKM0=(Z0#Gg$(YAWV1|VmJ zK7G?+2<3`qWX;f)ZXoLqaBk?(Kd z7n{`3tfEXqMpv7-S`9ZJ)bv*PACj92TnU^55&Nk^Cr>|YYA0rrw@$3WS+4487QSj? zE18&SY9H3~oI>jUhyzHK?v*2$RZdOUR?^awGukuKlULHNH5I$)<|K*k{|PgC-sDC{ zK|Al!kfnI;73fchc5f#{8~8d|qu=^bZ;+t6(dor3bVk0U>V1lZgf+}_kzyir=~Bz@ zvke@=#LuAxkOM;~miMccXeUtC;_1;k2qBL4B#(Dbk)W8ERX9=r1Nnzs0!{$ZO~pLd zMGy#)2kpkvH%&F!tqtbIZy0#){7#>i(j;09ktK+r8DcWqLJfmtC=gt9@rpM|0Rbm) zS`emxKEoW8B>U~QC`iOc8i?>(q^&)>o;ZZ-7Wh40OdHYWR z{Gboz#*l88tLNm34<3*yQ(JrGNJLj}{}~V3sgf%BqBf2Zxw+=2LqER3U|tBdtqP%o z9Rl@NG)11fZ%D6Reaj?VKYlB}itRK0ISF{-wZc@n6!s5)Cg93bg==9iAbmdW>yO5w z{=VZMBM=QUAX0^w(#ASJVWYCyRNDmWJf+RcfSCT|EI}Wnj-)>D)%jAcf72dh zSem1S5xPz$g<3@B$aHiB*5)j|AoSC=0AvyL-CSP0OFro<{4R<>e&AxFEOz3Yh6BOA z9~I)&iqTEx8FFKgy4km=J^YMilqM!!Lsd9_j_z zzNQA82(`XLW3)oYS)^Vx+NFo>1Qr^Ba15tSm*uMTEp$$m+oj=?d_BW4V_0zo%{yGP} zLn3}bu#+>x-}T>%^_l=HbU#+opEn>5=a`_lD`(dJb%EI>n!#$UpCWs(qlCd zzR2fdxe7+O5y=`jmZ%XylM`=U1bljyg%ErASY>80xPB#x`*}DzxqdyPAslt*)I;RO>Qex!pYl zf}1Sn%>qGp508q4PPcJQ(wA*|HOa))xWMcIqn zoG2mM!e=j~v%FP`6#I5iR(=u{bb+$+?Wy)kg%{}mMoV_?1Yv|&1K+KM=rf!Exyyj& zbS`%D_+$tnqFkfQz;W|B7o$0b8h)?V53ks@0~7#eMzfVF6{!}>OZn{r`9fs{D{N1( zS0OKJNC%zZL>IS-vQ->fV-hc`w&tNT}VQ8+#HRL*@umk-R^96%kE&F<|TMENOf=->Uu=Tlx3^myaXULTA z@1ui1h(nv|!6}ZQ;-Y74*_4*Tgc!t>Z|EO#)cfC4$Om&0YEp`=-#;|W=iDCaSzYI2 zUciAN(&#=+&;^X=|N1&V9T(+X&Q6R$wn@kSf7f7vN?kmF`bj`F2wGk+#)>}71JcP)dk$*3Z24`o%=C4ET6?MW-$xsq(W1BMM zLtGt^MB=^6`R+L=0J#Fgx6ieEF%pTW;||GlU{q=AVv#!B_CsvHZGQO>sOJlSey*)J zz$+()hW@mqgDbGbLCEOi4cqJ>O()=^#Z92;eod?WZ2m7V{RfgBf7|hJH_unr0L5T%GW$%u49DM}I{DkcwwUN`}u!C(I z9`6x~JX&r?mZD2fj5G;NL4@M=T17(x7vI>$Bnb)~qx3zC3hCzzC$y;vd@{F&m3{JH#LGLaC8??aRcN!gOfl+b2`&;pUGn=(SRQ|S##D~w!s-HtBdBcsxshhmK#Vw zKghJf)Hya;O19e}JijQ4$X)qlQk(_NGPy$gUh<15<13%PQo_{O#AsBm)l@sS2xG95}J5P6tOHpqDe zFPbiGS4^Kgm}8nWs!y5qF*##rK*7IS0@1@Q0_8{FwrX{`0xqwBZm802x(rrvz^co) zv~S7j1w5`GSEoI1t31_+HddZGZ@Z6lPj;`w$NOzd`LR;>ag!t}=Co{fn$bEpe#)ApCZ zf)8U(H-Zz?^&#QbRDJ5mSrX;!_d>ZuD*RVKP2!q8`56d1xV4Vev21~kV+wr9S?nt5 zqd9pCCyh4weo;e#Av?)bVJXr7(EX&h#^hi4J2YU*1AYHvE}jcGi%CK(k2?Xj&fk_G zqGRpp6H)341L-;j`0<O3TvI`)u)^y0@HM&f zeU?+IfVAD)2zk&`wr?y1azGX62*y;OBL5% zWb|?jrG+M%hFrb~(bI%RXHsfnfn-1+9BW|u%zy`{ydekb7yVqHU*i?3CHDX9v7BIZ;C(bC z8d$PNcIqAf%6{kQFoQ+KAX*@$Ea}O(=f~ zl(SiYi9lW!lRLsbUpFF&QYYmKX`9W+f3c08^U<|I&VRW*Kpzc}AQtc$p+V8L>$sMc zQJZPP+$43K`QGE#GXmN;L0hg!G+;0Vg2d(BVJ2T2+WV?o=z<^|G?Up`SGEKV@y=f$ zm1pUjee_Fg5uJ6U3+H)YZAqF1%+ESp_}$9|g6#5Igc+3I@nnl)9=FykazrLqi1&jN z3;jvZ04v(x*4|Dj!QP7c{3QRDHD{hC4(aNP;LGZzl12GxF^wDNd+c!dL|b^m8Ib3t zUd2kQR#+%6sFCT|H*?pYha24G zgewHKM8C-Qmymh{5lVxv#l;(B^%X3%`8Ee;cvfX!09QEQwAF zURJ88Q7yP4b_~L^RjfWbdKqZH;&piKmS_*K&I-o=%P8Sty{-*(zMfIBb|cwJk}DyELv5ux*bYIhfl%b)1c2WBPpP? z-nmAeAjUA5QsfIsXh&1Eth&KHzC&|J>q#)6ldz^x@yYg3&ELTY^ zjDCExrG6i!flqyB6A9t@t44LvN&dDH6e|YHMJzUxF%s?A36|J+bt67UV1s9WUL}`@ z4iUtpx~5#4b9J-1=WvM*SLJAAL?)NPBcEhW^0$h&i?^BU$VH&d?8JSC47o*6-ofNB z89n9;gdhe|swXKJ17afM#(c*?GN6Mlw#Mp$d=7$t9ZWfcR>H5(H)kX*l>}Uy`y@?y zxP(SW8NPao?P7I@MCfjSDtn5f=&4)-UGX`V@#=#{J*be1ASS?#4_>{2#6evPX~H;? z$_sFtn35oTUGK|4=}l_97<2o5c!5w0RQx@1)>IqgE04zezVb9a$G{2DYQiksrYgSS zVz{(~>l*1UWb~f^#|?C9KKYMwI78KPyVQJV@x(FkWfNoPDxU?8kdXQo^W3h?c238c zL#B?M0Ifz|L+wRKc#fLXaI0wOJJ0AR1!4Il1oI7O)o2rZ(UBG6y+d#uO-oJPfKz!>>5+d*q z+!Gy}B5{?X`~p4D2lkh71h$JJBgmJ?S~0P>B>&$cUj>F(w7D-(p9%`X@)1&{Tt%r1 z4Wt7F{3ithzD<*#FJBx2gQCkQHU;)^S|yBYkbJ)`KsgPe^twTi~saQN^T`-Oj9gUN_O$fZSJDikBD)t(LWGBd=Pa|5rB{ zsGbdwTNTE#a)S3AO!v0+YuAXovmzQ6WhYK`A`~53sZ%$W7vN~v`qL**o@VKjKKiH$ z#oCE{MY69SSJ?L5w6--x-trwga%6mR_VDEB;aA3|W?#0z(f>qgA5^F4BZ3#K1m)P& z>Ye`VHjO<8_s}#lPpJLvw@sTODX>hmh!!@DKU*BM=IQvZGpRlU9xQY!8tuNlpq@|v zqD|YD>5pK8To}xrtm3V7bvN}|A)nG~9Cm1d*4dHCdq(mfLaOT<`@mubreTF~(RC$|ufBmU#JLswYptjmGG-NcaU^53Cf6ISSm<8m(FTs-tg6agR zSWrwFUhfIF9+gvxVJ6K7^{@2T=6~@YPj(s!@}7AtU_$&Bb{dw}yiVx&H~;zw5~7=IART!*Y94n{B@_N5{f5^_oM*@Oa)crYYq_Q~<^^7m{Q0t~T)ygU_61AzEjJF{|6YA&?2`h9=85_@04-EL zX&}vqhco-$Rd5BAH#6C6#@n&B*Y_>GoBYRNzk%kv-VHVamCa_dzv|fXwO_5#RNKmY zwKO*ED_|@MM3^$4FUIz0HFg=e#%3rOq`=~Br%x+gdd6k-@}aGu7!>j;D(G_ZN7k5L zl-U!#b1i{S#EO4%dCMnVE)cVJAL*FzIH)-Wz+w>DRO%2`qb3i*0#bX&-k|9kS%x08DX~6DVmE9UC^3d&sCz8x*V+qGV4w zY+&o;KmFu}#r;K0N%xTmE<#C5uw2MZMRq-wSSrr3_=o%q=7P0#&XFivuG`vsxgYdS z=*_;`3bxMFu<5t=>QQ;&oncT|$VnTrEj0F!X0cXRNWN1hs+_AGi?Cdw<5* z>(>uARwbaAD#wAjR*e16*SKDj-VQaaTj}LqR^|(7!hGdr?)h!Kw@)lmwgv3O6mS55 z7N470yEWRqe_hX6D|F<=f*lh}&F(!bfuS=ep_1)OGcT;jaV;#TS%`v4X9Bbak}Fo# z6XYawwb!MunKE)}6pILCYJKu4cD-_1>Ha*g-fBs!Tks1nehMtR_)Sev>PK83`B>0$s7aiH2h( zSYJOXh`z9J9=qa5+REFXYf#t3Nso!6nZ>X#$(u{lF7$T zu22nAtKbNo88zbDT`DxPX}T~n1%0HM54$~cK>7FdR66zTkKnhj(3l(sZz!npQN>eE z#gjViq8-o>nEyMMr=JWc@K4)HU`8^q*0&0;GsJlYzXsnLKpAo-^;Ne6#@2^B^h%e#-YioWW+L!A}MLi0?j*&x+=IgBP!_M@o6G zc{w~sao4UgEpT#(emP#(RfCP1>A6j&Q=@0?N%SWq06|BkES2krWLp!{N4vuK=6WMn>v_b&-+sy?lX}%d3U5Y9U@GwL#E&g4vuPk9OVqtTB{KM)%5Jsa}-e z-!mbMy(dobn*@s7-#_7A^B#dAX}v^N-|R=|f~eTw&m1n55>A-rF6`^TOCK~=iufG@ zE_+dBS`rz;k{hsi?m7czP zt=SU^o;qDtnxAc!61be6R+Qr~Bxpkf#8i*^@*-#ZKQQM%TMRepDZ(8|L4!j{SwP8D zm{7sjJS2dXIjHDb8VMV+ln<}^wf6l<9)$z&%=d%MvMrG^wjE4UIrX(BwsoZH@R84s z{)}L%VWn2T73uBwuNRS>jk#L|<6$eWK>TJ)qrD;>I9xOi1p$jy(!`#GHO34UMJ`m| z)z@vx8_2cJJDy3kwJLv~`)$cMU!@czxuv9zq#H<|Ktwz4vz-mV%&WdXF~Z=i!PbcDZubfbt%sO2qsPNjF{ z4YHhuQl-(`>Mh|CIbxwt_hA+;P^zYI1t$`qSu3lOdhpDsvo=|-QtMfkr3}?`wSq(^ zQ0yk!)e!$`=~jplwxSHZM$9gh8kX2=?aC~0NGfwll(X_M_vK`Qr3>| zzl~e><7EUfmgfMxPxg)Vr+M9H)yxJdRR~ff2}uQsASmcQ7x`Bid5cQK*wb-gQcd?= znBKE*5v%o zD?f~DrPw-J0*iM`D}!|C64D+*;Hljd3hUQ zaKv&RS;l~A`i9t8>9N=ppRt6f%w0<6qm;+o0tDtYDuoRS&6v31+_AI+qFnQD*Ed5CNmeT(#nFi z45_AjQEIFWIi&ErtKM@@(+Ao!jnoqcfC%faNdg8apQZW<1aLsTnqC4rARjMvAck)p ziX*($fyMZ@L$xHIwVJ4dWlfa+u5Cj;={v~f$pv&OO#}(zaqoN`&1w^bFG$M|%9zPQ zHF6r{Itnt08$CtF!9MK;&1j2OG~y{eZ?Hiad`x2BmPx<0fo{LK@v&HtBpulGPFZoU?j^1VKK6%-_TYzo2OP}bbW?4 zo=V7r{s>gTHW!g934XFR2&(xO8K%mbEf`dewj^3)941dwtEX>ZXk=_+YG!U>X=QC= zYiAD!8@9oWA>%$X>L+7X+vALBcO7*s#64e{iei|hyHPdimhHIQ9I1b@lW+Aji1H0q|XUe@XGTjY07ZJAE<-UzJ8F=X&XQS5|G+`#4;%dX-6(Gtz2ymD)RcE@wNSU=z)eoQ0Q@|99u=Wv#pOV}R)pnCF+jKJWW8`ay%5>c!WUUitQC!{QFWcE1PbhpE;- PaXo+be{0we>31`C1)00bZfi3|sW4Ge)Y8+vFJaF2oire z6Q%w*9*@UcE$Y4k+e^FZm0k67gIxW+`kdS|b}&XiMSq7>q)bYx2$o>!2#tM`J3!Of z-6gqP{3N;LV!d3FCbcw|CKZjqK>q{y!)|_X0IcwQ+DtC0gcbP84|}u$I@pj*3Huz9g3@`{>+yd*6g1KS(89qAp8!=MX|4OE;Y>cP@cH1c;ddwB&%?1p!gJ1o!rlpf(V^pj0r~kCH=* zWsD*>N^(e{cTvaIu3C46yZT&|jYrl}ORRuc*a}(a0EmPob^v?@M%l{tRjY`Hq-QO; zWx}d0etO%zeU6aoHM+(NS|#i;|GU3e^N}^VyS6T#QHYFX5HiXB>zK<>wcB!b&aoR~ z1Lg>j01-&GF979#J&Om>bGj7(Hhz5YH#QLTb58)iUH9O>KTh$L%of0nUg$XVOsuMY z_ZbIlIl}<}{;GojfOcD%=iu@vX|%{qgJ(_ur-nx>OOd8py=BJjbt@gP?tZu*>%IL%@9#s4EKSk6fByx5W|k&HtwtOSyzH0jwYpX}diyi( z>w}97t)jL6FM9rS&s}%icFRZ3JK;(D?6$_FQ42ZXkM+2{W^MnL7oIUHv?m^Sy?M<* z+Eq=7R30)`Dx0=%523N!~#qE^`M%ty+hGH2Y%l%#!bup`_#s zFZO+@wiB3N7lLar`?*10Ejn&-l03!clCA9Q{H5j9OOke|?=q5UO;d0b_F@+aw+OOB z1UUvUW+1W-xX?%=d`#eK`DfP1^XEsxV*0Xj{4r5s&7@nxl$HrA(~qZC!o z4GnD-jJ7r`hJo;Lfy||St|{0&RYcq*Y(txb$sonpdjRaXoPm=7cIVvQ9iz40bnj_C z3DXR4>O`e`{sm2rP>|&T#NPxF)klYd3zeM<=KwCQjvCw7pPbUhe?KM4aJP!gJ0VR>p2ncjMq&9jfH1sRUAdUU02X^4IL=^R z+cK{L%09!BIrOy$7-JV&5VD;8x+8>hM1}$1oxn^I^O3NCCo+@^Qa)i&t|})oJ+$RYib>jAC8GoMs%gCc z8jAcL#OrvCE-H{Yy%XMlS(c1-namSrQIPI`bJB4OR6VJPeM;DU304?xfR~&39Wx?IV=^t{xy&` zFGGCucm@|Q>A0}EjMUPpCGR~0ko~ryTC!7ZUSi`~bVMk~^&EN92nrfQhbEv?lhCCp z=+-p!Xa@9ZCiH36S{us$M09!oHK`*I{4kdTe5n*E^%X(Y9?$Teb*vlyFa;uOi*-@(-nbBvYd( z=4N%|hnrla8{I&gYF1%ikad(dj0^D-Uy5yrcG}$e&gbn%eB_b<~mq<@I1N&^pI9P`Ah(#l0W#<_tW*URku`0uo?KPRM zFrS)<|Esnhwn%USW}`)uYhW(gcwukV4G5A2^pG*q3FQERiM4ltlg@NY^x40J>r z7EKLc>43Ht;XrUxb4h`x1NvGz1MCwaF&Jh5(RF}vCL)1pq@^0POoNtd5QR%z*Gd{g zr32PlL<7MsttADW4%lmv11((BMz)6OI>0#-xhPV&W&qoDfO{tA4-{e%lxLxYTCx{v z;to0+q3%2{9w6|}AoI-t{u6}as3=*En&r|I+o4-Kh#4Tw!1FmLuw(_+tiYBP*ewNP z2ADJOCFdmWti+R*c(W3prQpv1!=GoU@q&Nn#rB6sZ*;OH)`MDOWAr`D2C+L?+^r|L ziU84^0(xOe4jj11c>uEl!15LP{&E24GN>S-HJ7+IslC|r1lS(AqI#IhHx_2Yw}sCI zqc9%D@)%|)r1%Uxly*N131}dJKiiNG(@Hg(g+eDmVrvL0Oj{C8VKM?&ITp1qC~=WK zlN@&ts0`JLMETNEnGbQvqy<*0`Ow%fn&MrNJXEHj(r_0es#n$p1DQiJ&FNub8mU7O zsb)P2lcd}s4@%R;>D?*ItCjL>JWi3GkyDvo-&j>0E*9fT%PNsmiVi19B`hjS@1|I} z%%h<(g^EFOWjI0jRftj@n`MoTsmTu2qQp?URH~u0T8&1;6LHH#9G5nh#q$KvQ=lA^ zLQ{BwrsQD|1f0Jya~?j=U!c{lJWF+W!WYk)+}a5KbRwWrDX%O3rlC4wkr&wo$H(Cv zu%QK$4b6}5G51vrtEMqHKe2@z_jjX;Civ>O ztWZ!+*>)@$a#VbXF_h#Vwo?;eIx(vtS?ETzN_2QwBU$66Ezf=gw(D`J8-E? zNGtt;k<(-^%n*ZqF~*GIyJ}MO6Px=D&i*v@iBH|a+9oB!Rx_FYi-O~Jge6VCnral+ zV!2uo?J0o^4tgO74XH#+J}}@sm!N__U7aofX-J4A>m1bu#T1s8=oIwrF!!6{aq#_+ z7Jzk?dDr3`1WbqQ-}=f2o@Uag84%VaN94Ui3q~_FAk5;sBm4=Y?uE+GM@tRH_N0}T zNU1Dv%v(bOe>xcio<>Gzl%tT=8Ce4!8{WJ%kVgK0$ODoE1Is=}_-D6i zah{`b=aq8}g#&e(c~`qz(q@r(`V>S9V0XOLWKy&7pI`zRnfn=lg=Q)A5ORRME~hy2 z=QQ-7M*;i}5*2?>_V4<^lh`uk=w>o2Xp*(!m;lw-{THnD2@cICR~ znv6-rruNsuWS@a&CC5-0pA=_~hlxa6f81KLZ(lJtqGt%TtPF}b-lldnlXXjvYcz!` zl04%=jL2h6);13A%T=AiT-{qzXaPm!Zp8;D+-iH@rEC!#=P3w{JkN2FfbKx7rl{AU zZs`P*F-oH1^fb0JX5Qn|KZ9+b$|s78>#DIi`=G9_aq|9mW=#UY#hCX9jgFFaYCu+K z^$N$+#JLy|)-=bi%*mCnZxdTcTpS8*;lTQnqsnacNSktCyJe(CUR-rs(YB_Rvi~FL zpkY|hiMABD$??|LeviUdH=Tq2l-2DW#zvDA3Vdn!8e1fgMWp4B568c(MwWFPKc}u+=n(U}x zjmh4d6jaA_T?;MpHnRbt-Q*3~$1um_O*@g65Lsi@sA?#7b>$ug9Le|SPmFTG z)Hya`5+mIti-0A`8N3o(PV}Ol-;MP5V6Yj(nLDi@Fz>$ zOu?l@Ny;6?_gCTR6Xo16L@1Kw8)HX6(};)w|Cj`OSvv~dnf4C+J&)eu9mU09BAA$< z5E?0XgA3%5&%NEKF8hPniza^=5;k_jHc%nJ4cXlJ`Sm{SrqrqR0x> zDPH_<;#wTl3BzZQ9|o&#TPVQ8(DCBI0k*a+o%PD(zO8^nuvrRn(C$h>i()*VEgqSJ z0IhVuvnMXUAm@H@RP=q~Ns7su)&%vo_0CXu^8X%Crb=?9qWhGL#It;hq}Jhd>>B zcN}IO4<_kF$u4lu;7B6WC|L>qAYNI-V&(@p(XZH*Go{xTT?iJKtTfKabVx8Zn71Zp zIl8v|<_)%m5(mRtg*?^kB`TnN39Mvp zsita4HfNtyv`(Q@lgF!}buzZ_5Zr@>?Ow?>ZmA02NAu{_idf1q;u`CU6#s@UKqHGp z0eFxPE06AY`>aXG7L);kY*Z{f9}vx~y!@Kc#2o{@75>QEjPfZ4`Rn^M=AINllimBK%sda=5@)wu2v<1^xm>-+9gyO8{5s=46jh9%IRFdT$tR7fWdYFJ2&{uXKJN&%Ts2 zBTnadCM0jMk7;|`y-`J?ep+fM#JB?kgFLlZwiItMl5xQBR*{SrEv%yJ<5EX)P-M(E z(He+^C8syzu4kr-ap<=W9g5aD*;o-)%`&lLR2*MDMlz5UK3_&n1LI(a zW`N0dnt^~OZ97TS*z*sZwo~Ff?-~@X>6!!<@0G9KyM0_TO}Wc`}K*$SwD|I z>K%3zar5h@*SzJvLAnSvxmO9fe)QlP4WOGa4=Rf7Z;f4%KHj)`sVTZY0e0CDY7+^v5vH}{W@Hh+tyrOdqo-eQk zNu!Wb7RD{Zlq7(97>Vwt6weC#~rq8%5lckCVnxIl5@HZ z55J@Ah?n*4$5-2sxY+DzFr}cGY)`kY0k#NNvWv*)ImV5vb(d||5~CLrCn(g-uu^14 zp#_l|=1~@H9VP5Fx*aN~(@;qWiZavY*ODCD-}FwYjrp)a~Q+ zCYif$u&X`xsBeKng7&WRZL^@knU+D6=t<&q`tygUVhFZ=cZl$sqb=<_(+XOx5l}9z zX(}Z+uIP;F{*l$1dBb<@woC?OCuzn+G+cvJ9KSfOs%CF-g0if^d^`uy1JB~78|F#m zo}~1wING~VVrpp-M9i_uurKMzydJNG#$U2C|EXq)$%sq%6DD(>$#Zr)`9HZXo<~rz znHI5bLhLDaH%^wTCTR#~K0%rwt-%sS)qqqJ4~cSJtpb`gPmP@ra z%w;UK)}{M{BDGUGuuiPIuc{XKZpC%?URMv&h0M`(Sw02|4PBCim1&nvsrj9p^jqQc zs>9B(AiP(ldJTTK66Ze8_k0v~wrJ)l332029Bc&J-P*@wZz)bW_Ay=}A{EY6gN+}WNuKXHOD;Oj(t{=S_}v9`z^^@)AbnKyFkk>qKb3I^FQ z9wrFkwF6|Qvw_gYpO9qb9HvHSj6P9MO6BIw8qwp$V~lsssX2R~anVU88%KhHA2et`mAepNfgsKF?X(&l%e8)( zBYox|@wZ<0_edMwJIhWxl_l)1UU{m{nf+BD9hVvB0XsI;ZhV&pGRJK5MR-``6D7_2 zz`OXS$A|%MbS!i16JMu|{n&WAbB4)o%DTqt0*$L5OW94XTAUq_gYJG;Q&3QNp9~k6 z+*iRC_j5eZG4G2}($*!yZp({oZRIhzPKk1>bhwvo`Uc*|s=w)&z#HJ}WDe)d`0ZQs zmV5We^*Aze&C8>0p?jd}U(k*e6A(_Bt~{yP9J^lkZmBCnKQOmHj)+tihCyiU2Y&ox z7n;TqXP+Uz#X8mT!4j5Q1$We~W<6z@s->vM?r!vlHp|LjmHT)cLTNi%=h)WJg(=Y< zKd)EM@PN?2zfMfW5Pf++zZY=?B+>#|s%Ls^tV$JFcg@gV+qEZeQD{KAOQ(oc#VZiek)tA?*)>IOoC#YP%)&Cd0fA{$v5 znd>A{NLj^y6Sdg zg^}2uf10~~g07v_U>Z_;1w*WOC!Aral)ot>HZiL!C#%Xi=6iB`KwwLaF-`ozaVnqv zKE7O7>D9<@=pFBgRoIt1om|E4Ir;Vn734o>W$>hrZCUAKC@_M4J@+}y&U{zh%m-`E zs1GN1+04)8ht``hs?^!Ku=+D7Wg>URUQ;662)k7d~!Jz33L8x6b}B4X3w$ zbF|aSXdJWYrW$6+gmuZ?spe(c0900MCO2By?n^W_Epu#IRP{R+TlYf(5f-WBg7{e^-%R7w*940Ie^WM~n0vf>sgfGr!Dgu8_idI2`)Dg|z(Ie;iBU)wk?}ZO zX3{nb>?!4RDnM4>c8lsU=j_-|N?Ip*s#Gd)CjPQ5-I6q^?Fc;6GWGWz)nZhsDc1|1 zJ{9ub;t=bVPK?kf1j@S9GEAvNd2qXx-Xk?4-X7&zPqxNr3<6wySSzKh>6TctJK5>T zBf=Y8iDr@4Ex&Ebt_GYl4s_l7^M#5zT}i(8jgbH0OzV#hE{AtweO z+lp8j$e8aWt6xYCNJBXG2X_h}D-iBtk_m5Fg%oPajdP|EDvAoir&J|vxo58tyoZRK z%;#(erNj%g5Ie%B-sGZ8A=A}h`vo#j_5_@CvtT>&*jZ1$4o;T8P_#Dxp6j)M9k@g9 z{v|BHeh#SQU*7Ov8n5mhik*sP)^W@MEPUC}sDUYR(-cljk{Ya(&x@PlWVWmZ?KBOd zD@X(l7mvF^lQh~YJw<5I{yqp;T@;0Xpc$@lpVo;3q;x6e|seMI2@rnu!K%)@7y2rs_ z@O$>Jzw1bGRbqN(a=A6j)zpBx#k!l0tgNo#!obZPLdkbxf!y`x*YCq(T#T5^7N^k$ z4L=^9b8{9HviXs|l9}>|kWmfO*5uxYiwHl1>|6HMCs?k${F8;C-J7_8&ay2mRm|b? z;#zr^E!r|zXTG)#UtLYaO8tXsb$I_xVN1u(Kgmm+2NJiYjGW;Y|s<||X>IX>1=e#AFSQx8-$%7jm? zm&>G)U*y;{n{C6P+v`CCd&EG0zfJiF_8_@^}nfA~#cMGUxp_cCT! zN?r*kPt$wKK#ifAbi)d)Nd`lXv6jJ4UODLYh$fTO$UWgio+HI2aBigp6~o5O7oRCa z{`Y1Nu!qB2V8*v#qF7P35!yBbbSMaAVE1moyu&mTF%I`ah5c*K@_AAKPE zW$(Bn_UV@T7AQ2IEV+sam&UBHosT|&{JKMd!r4rg27uZ;(?a>AziDQsE4&fJl{jxX z9*273#KmE@SxIc)dWURR}ccnn@a$khMsWhB7BquG1_vER&^p@UP)y4$HcmE{o za$W{+9O_fVHNm8DgY|#05eTZ%WH}4|Zfrg1mPoI5gv|q3`WveIlaDQix&kRtMtW}o^XN8ntrS84Y}zN z{jiA%le{J|OPc0m3u}uPXcyw8 zV|^9qdj$OX1N)ab9^OwLrf;n;(PEM>0GGTH=Xj&|Y%KjO>eF^GJGb~$3F(!-s6h&o z^e~~w=0`Vl3S=YAkoyCrOyya&#Adi)Qg|LE+fnj3$&Y?&ZNd$CrLra!fnlsrE*81l zU86ZuBxPt4aGmW5?H~gI9XeOm?CE7rrF8dOXG@nlK9Bb>4;d((Gs_HJed=CmQRC}| zs28{zbk1?=@cpB9t{wh%@sHM=D14E;e73iFL0#e*jaDOa=LOyL(om{8gy#;ol&9SP z?IKrHax&=G9!xp}-QhHVq(6g)3<2A@DQCWLirG^j%BN#QPgGc@xc zB)^^Y!pekx_1j9lc;6dTyRu#p=}`T?B&Hh=J&gQGX+zrR&BXz5hNBJWEa$taNOfmM zzddu^y3XP)QEw+p(z9=0b2qM9Rw34_FFne~1bhvIypi7#nQdQ?izOl6y#3<~3L?Fr z{8K4gOL|6|vk=aAaK`2>=}|-jcR2eb?jMtZ5Xj}pBkGBG2AU9vRBSW4XrN5tmJ}?A z+4EVHVPiS4_^-vJ`fDb_#V`D&1E3AxP*hg_wTYX&+|=LRY#7d#yb-VUEzEFg+)w7vx4n zu(KlGa-10`ZfG>tf%*>dm@2}*VC-ncQRH+QFH`Bqpo+&2XsC(3b`99OmFyL}jxNY` zJdkkd;>O3zNL!&ytX-=v&b8@tgm>=(cb`a}J-^srV@pCo?XZ3r%FP8PgSfV8PL&eh znf~9vv-C=OB>+`a0CO>(R-xT=DSDS9;s|LnB@GQ@ZJ+XC}#&myQ9w?Ir*$52|kBZfrvq;GcoZQg%MX zZjvXCaTVnetD-A4azMnaR(X&!9&oJ@fTCjz^A=p*;qM7y>V~O9CL-CDB4MS#vi8;M z^{MHu44ib^gMsPg>h8Q5JP?@hwPCg4j97uOK^2lMxmksn*h+g{1T1Q0U zF1k;MknBpKpyPKFF&%GHDHh%~H@iP5z$UXwR0kds04T=hHzjPlq=geW9R09vSXpen ziTOP{lq3aq!_Adfh)^R6M|3GvubXD{OBYJr8R<}RG7!$+@2(6+wt<8KMXVW#B?gv- zrz3Kbdbbtk`5zlAr5WO(j>QQNglI%Vp?K2b-40W@?WMmKE2-WwEVEn}Hl-+w zD{LqXSuX!S;qtM>B%2-bJ6AfJ(W9S=&@-jRFizYXpq~$a4+GCKfi2cGg0@m>pJla! z+9lw`l$~i0Kk@_ zzmoP~G3NkHa|2oXFs5h&^NqnBA#U58O*&9@u=HxfG#5Iw>c}cyKPpQo3wp~XgsUtK z>3Ttp>N1Ip4D+-kJrJf8PL{}-nmtAY#zquD^n^KT$ zi-J?&0AM#a1DZ`CLoO~DXK$Ba0Z^|i03|^(n7Fm7=WzX{xEs%cbxXNWKd3rxDhrmC z7?3fuVfuVfs=z(gLLun^{ot+|9P+Z1&WT5kd@Ar%@P{>O#t~8Lk_|mcINA->MU#$XGfB)3gq}{reb;KQ%xDN zzci=^);v{jod!V;xWA7qK2=BD%JCQYRWBA3NhLe9LS}UxAT~?uI z`R&voORD2Se8rA0E^gIa=oNqauN#A(a=SQC+Ao0a6m8~4Q2yP#8tZlgsbOP_WEpnI zQTU2w^@$DZZ4%|hIHWB)z9f{Acnn>~pl>7u;>};08p>i*SV`4y!{8+YqLgx79}?L@ zg5VFsJQ|)DcKTB`YY=t@&BU_M&&whgn!jhatTBE@N}4yUhQNJacqRO1(4}5%KUiL# zM;j=e%bD(w=Vz*=@M~&}nDhs-vw^8;X1&bg$4o%G>vLz_nxiG=5Jms5O8L1T;aMeC zD?2OV82`^z^czS8J1u~iVNI+$HQbLrFwXQ%L95>v@gtyUB6E_jnFbx~au9wK?Oxqb zqqJ!qZ`vWPF#8I-efg4nS*#8wFvMk(8$zf0A=Tdd-kB`ESpz{GSnD1EhD?%U7VkF z$!*w&CVSVQX?vI_Ehn9$U!c7dI+@5bJtW}$`SdS}@TbbeZm2+fv^Z{+%ExqGE)Ujl zz&Q^OX*ezoEprXMWkGZXvJ1+;hD`YYZgDJ`9Gr|>>slWf6>XRo5|g14^jMp^6;#SG zex!dM;E9k12m+IK17OY%o*WKXGN;VW@qg^GBUK`LLK4-JaMls_ooc<;cizrQHpjeNfJ9^em5fVV*Z$(bnA)@`}Q zt>NKgcMeMRG zLdz&s{gZzywc)RGi6Wv9xxF;8ernfV9@|8Qt64`#!?5QMZo!*0j6RE5*l%NMkdoY*04HM#<^Dm(7tRF@I|= z7vFPAcb65FG-svBw=lLAXbNJRk~^6EO|>n_1*~1>)h-O-r$jWM|830O5?4Z;q4t1pLbt?M5iK?jg{2S6S?=S<^ z8XvGQ(HKBmV*)BAM5ItX z@$XV^*G@XV=N@IeZKQ6h!;j%ckT%RFTU$0IAWQj**W^3r3iEN}#a^;shQt|}j*qjO zasuqeX^!f?%CP%q9-nU*)t+VUbC35BHYFxr!xtf~2r1jP%Qqy4RT)_E0jB!1r;S0Lxx`I0V1uqr}Kk=-;LYuALF`l?QRIm0p^K&q<9>e)fV2Q+LWk zsMifj#unuI@LR($@d9j^Pi4pMM8i+3-1q|MO1uGe89uyljLfXLF1;ErPWC!(7np_u z#X_oBx&I8o7yH3-5KIV*egac|Oz8&QR{3=~4AE;1>p&YyDafLPstVm`H|p6AwdPZb zzh<&|kNF`;s!HZ;9V91SH8m&@@Wgf6v@SZ_I~}NqXqdvu9*vsmQC6*5(kS^}bx=KB z)(=ftwlt?8Z{r)(Xq_st$F3BFHUDOdtVgo=QELF>45ZPrSbO36T#)iz>19=gSBNlG z%6BXAg0G%l2%?9peV7dX`U2yIl4L8q9$r#ltg7yxO7Yc_4nL7L$g0HOzkKSy@;rP{ET-6IVc5=? zOpkmQ9LL`??TVjqN+pPDoIJbB8zJ0L_+oT^rT{w1iP-+MQc8Rt7QFD3I?YZ^9C(Vy z$WK8g-$P#6T+TVr!i|A#~y({eUUa=P5(ALO6BIZ&aKxU zSZO9QnQ8+j;u8cmzVhtOnrPd<5sIsHxjdK2OhI3IDDr?^9BrA=>IrzPU(3@Qy%B8e z6G`EDNuvheuH+5hBpzL7ATkXV8elTp=UY(-KBZ?U$#qy&Z-C;ex%mmFBHLp*K#5gq z*N0?cjgR70IUi2^oYa!0En(QNN50u#LsnFZV*hyy-jkdmQPa=pM%ArGB@V7WtR|C2 zqtga)m7P8NjMLLup1-q!gRKxCcdx9)LyoN~WU#z3uTk~$PwLov(-KkBYl8`s zq|TMK`O@08Zdd-!BFN6!3%j|fJJTgbd7@r$4#7OXz~&G5aR~q1xkr9|7d*i9UJ?X$CnykkjixUM=x1x$}{w)NUhaB?zCOnNUjT!CJ z{&S?&k&$|M_~JV}P_wF>)c(q(SbZzLj6T7c-BqGr+9%A53BkNqUKYWxoOBvs_`ikO!7_0qcf2xnYTT`^HV}O}Loo>-|vo#N#ts=HipuAn6n3 z@bw4;VoSDdZv4i~ft0XH^Y!V-50;?>unX+pG-h zgLf)3blOjSh{wuLR@9m{M+1SRd-vV@qu)HUBI|FZn$O0<-$6lfdRBIcVKwT{=zsG! zXS`p1$95^|ncNJdh~JvZu*1IO#=KBv9zjT(`)14Js~gNe_$2r861$tU?mAp^hRGcl z$Dy{fdTwz+iRT9R=LV+GK`o`1-NzT}T zOrcC7{(H~v$aO_?cwEHF`c_Q7w9x)iqNy$G^9D)OE_2vBjOtHP z+s*l}${*gmB}UWO^>^-SZhJh)nT+QNv+(U4e&~Y_22VH7o*oDc2XQCGdEUTsVaV`- zK(sgDId-hAgy{XkEb4;thSK!0Z&UsUgVWv@mctwcKDDeh296q_WE%N5BWCwkfFd0F z$FZgqm@4t~m&aX%gX_a~hI@Zs@>J?7DTVU$$%c{(4T@SO`!xfuV%DP4H9`)cQx#!u zz4=NqEufqA%&}{IFh!A3V0Kb6$TsY)V@RD+#SFJq+Z!7|QkqZ;iB2b-qWnvEu#<4qk?+_D?_QB8;tJUlw$TZ<2f=4(;yy!3?F76EmQCeF42MCNw8B%{nM_I1CuR`>Ajp58*z4^HrdqZ8V>Z zZf2v|X%WwHm@p4e6sT0NkTeJTfh861ulwk@R1g8KUK4E(dgas$5{`A=7!siJpM)GG z^=C$&RVvajsN~+wc-BOnQHgWn&*8+hUeC^pIL2dS_JBk{m4*C`G9m2!@Oc1o=T83z zih{yv2QtAI`cnA*ts!>jdH8k*+rQb~xI534lViH>J)K$S1%nAtZYsWm(-X>Fm%A3` z5zHfFyO)86zNNs4T>inGy1Zs@i9#$HCLm$i10yjVZeiy|JYtU*WGW97@0bS%qwZPw z;X5fKu~{dQx3lVr7QXn6nvnYgJ1o={H(}D%pn;sU*IoJE=k#a98=lPEs+@2bMUv3X z*o=S9QLUUKc-|IfV_-TM25m8eAc<=?3>oQpv2Vg{X;eGdH&cK#rM%&ms&9R?E58Og z%6s7=l$_Mdccf?>r+Yz4b&m*Wdd7*Ug(PWjaK_Z=F&}9q_xLkU_zX=#{)sDGa68T$ zRhq*?dwWeik{KUdgIRKk7I7N$DYhs&Y^kkSRq=aCa*}6Sq6_R@6Zd|?l}|J?QnMSWuaiY_q36zt`s%!Gb5a$Vyg0h4RTIVH{(CaEN~*Fm!R(7W2YTsDI(PzKzAQ{0wqI zT>e}6#hklV4oF`b0GQLuj2r=U8KB1?Qmu3?AfrLc?)YeW!KK)ACNn9{s^W9h zQkpYT*EmI?f{vDTcy^0S#9c1Qw+okRLsrdFjz0?6bS6JLB|b{R*;J|-f7uqPm8vG` zRxgw2YEb5xdZbiOHtJePw@Y*-AW4dmnM7PJc{5_9=`*zzSqXaKHtJ|}q3c;H-2~_a zpksjECeb~Bt_Som2od|UF6DrL*l=BrqSPpgJEfLZ-csaemZQQ+iC%1qGMqZszFF+2 zFXKa&97Y7P=u0Op-A||#0=CSkWKbN;Nswl7x|0#X^*BOjah(EOt+>wv=%pr^F8y^; zAme9QE=8c&s1bo!k|DITX*C0<&*b_uTsBk?)uWa8i3)SP$r2!aCd-rRpuh%2gBHu9 zJx=SB6lSN#Vesq3s2GxRBCi7jY3Ae5XHBrc2MPpq5m4643)jU-W3`k6IlYUuYD7u_ z&}mnfrdTO@zD3HJ1}JY>(~}JKHq{pD^aP;7ilr)i)=@sYK!Q`z##`@M6$2oEkNp>y z95B?&Qh!EdoG$=>X1V#%OWBd#GM|FSXZ;QUg2BSL8`Zj-@mLdpf&l@@ur;d^gEymb+8(M|4ZCpTDE}kf&F8q9?d>jkB61-E;0bF9wuPgzj>C zo8ZZy`a7!iDqHKB?(_d{^1)c^ec~SVj92O<^=VP@1oN*d3VxlYMY&F|)oit8W`3)< z>&~w_#BAy#e9FPzPv3uRKM7PTC?Txfu^0URp#u~bCdn$(ht zTpBp7_Wswl+BjEx=FgoXAe9_<^|8dM`+8F*=chCmqT@dk3@s#@)4b$&ajF1ZGYBOo zaUWHJx2-L58bAd<)fDwL{;?t%`E?S5er_3$nM{l4W$mg(zV&QcJZj2AxGZ^cDx1~; z{i+zcDe#1IEDQ_h^5$bn*4$%RD(SqZVu}G9oX>(nnUPSHL@U%WJW2OYZpK&bzCN&9ZpUow9bncCC)2jrKcFMkB4n z%=^?U3dqY?vY(O6;wsA)cuK|xHE%<{M1_lWU|1Z;ArMat@5wk30=%Z8=Y$ib8h&fp zEYhf|9Trk;DH})sCFvrh8syOH0_|#?^*iR#82!*mE20JbB0l+0Bynv)pOjXp(W2qf zP`X97GnRJ`*zsV7ZG3pgevbw)@fd5~fGfU4$`$EEE5GVL$PWU)D19$z4Y!4c#XNJ=UcH4QBtJsQKv z#4MbJRfI@UqQ$U@O|$>44so1Z;w4CwBw317Y0|lQc==_@k}XHB1@h!8P^d_;5&=P_ zLduk@P^n6_8nqe&;oY=bW^A?2UXT0GQOCl;Z+F8bMH>IyaMN|S!zYt0vdJNrJn|`^ zFqq>`IPHv+PAxCF(`g^}*t1(l;}UN0CCzxcy}a!6ixxE&euA+iC$IEc>tG|Ce|}L@ zOCwZq9V))g3tn&U`1+xH1D)NAdpO0{IyuE>{)i(zNyvMTSC9P|f$ztU(r-VXbnh7W zyRRC6w2b?{=`v-K?fG3*t*BVA`^k9N1Q6$#hv+W2xexpR4)|YGXzkI8qswcr=J2RB z!m}nYr32#QnqT$#1?SBP;NTs9D6JuV^;112HXy(Cp8kEbvFSyv=~t>{30T_$Kmo+O literal 0 HcmV?d00001 diff --git a/fonts/KaTeX_Main-Italic.woff2 b/fonts/KaTeX_Main-Italic.woff2 new file mode 100644 index 0000000000000000000000000000000000000000..b50920e138807f385d0b0359f4f0f09891f18406 GIT binary patch literal 16988 zcmV(>K-j-`Pew8T0RR91076^<4gdfE0E4su073x(0RR9100000000000000000000 z00006U;u(d2wDl83=s$lfzV`upmYH?0we>33=4t?00bZfh;j#m7Yuo}gkBMuFlG6J5B*sHHKd(*=umo3RRA1q&Aq{Qq;*?z?Zs zS6lWBvpA{|4kRGzglV7W)AM`dl?u#krjN&WNtdj+pK9tmbDj6g11qm=IR>q4=|=`? zti%rTtj4WAvC1G_rIr^=2^+WshA@nFohl_hT*y>e+7AVqh%8x7!MALuOl3;G|JvJS zZ2pf6{GYmVua&&rfSf~>Q|VHyoWtv{ooO}gpZNn4!G}Ns2Wky}~; z-+Rx%Qf?d6zTgLFWNq{L)|&XtUDJ@rBvM+z<#qC}{~v8;7xR!-65^qpmB9aR)86*I z(Fb`#+6{RXz>gL8A*j+OT~ahDXWkvbdrxCqZx*DH?W|_}L8Ap}LZi^ z0IlqWBQJkKu7V{2mMO|~b$%JDQZ#*va?6C3FLd5So^>i7j8{2goP1iH=I;vx?RqZ+f%D!E1Q}Uf z{0KzZ#6dL*1rA#A#nlOe2*^SaCA87WYSuH!F-~xf7kHOX_>w>4Ow>GI^i|*Yqu$(o zy|edpvIl#l$1ki=Wz?DEGei2WNuq=@I_Sp34KMx$U-n%;?B1Oo?y(DFR2sE^JKR2X z-8G;1*ayx#?E#1FbCY3f%;g&TKkL8!pWgZVe&=t0G8VL%TMb-GT|7;&|I;&j zkM`FvLW;i-j(9}~p?4@p##%xxg#6NNA;2G8NdOw#s3Z)rVoM@GbAqhjDO`sP5rWI` zddKCYp`S4K#-PLrvlAPlH{%u_3>X|uvq!cmzm;uF_#UBueexp|=;6wEg#<-aPj zO2>wF3fYv914sg zp$!>z%#4E66NKBGCU$09PCSu}|0gCgJH|;w%eD_&Chn*gwF-LfJu|~jXh6f26o5i5 zv=E$ZMC1zH2?(VfMZ%L2!B2vMv)L2^K6_*wUZT#}mw<#y zTcCP5%QzGnTzj6hJM<`XN2wET4&g$%Jpob0t-?9S17aH!^vo`#aofV)Go>6J8R8Zm zNFf2FlwhQi5Tuq+q>(VBm2jk!1V}Ft$RG)O(;y-=CEix|yr3fZoHGY4ncikgezV^v z&Dhem+25PYh=OYd+egsPPDGUiiA~su&DgL78@6J@N!YLr8&1ZC?bvV%Hk^vh&IIbb zMOpcQ%7%^xp@$fX^vESsxkHx!*` z8PkoPf1#mrca-J;XlDa&{qM;^p%zk!O@j2Oa-#+Dr;zq^zsiT4tz5uwl3bw1AczDZ zzuk*U=ApV*m(1^wCg8AZU;#2L{1hrR30daMp37-`;FlBOkIdRT&|RCaVB_{Yt6Oig zA|hGb64DR0Ku%f~);#TPQv;Nt5n_yusik-{%))wC)-f3cBRNI-@q?L75&Lhq3=ygJ zHDJp`QK_?#k|Y)}E8Es2T81J8Me@*kIve5cTC$iCirP4=sD#uX8n!GkC;~8+9 zc9a5OOd8*czk`^sP>VH@6N7g;+AfZVSF`*cjF!rZB_EQEdFFSNJwSrcm4$b6%8opo zXvYIV#if$1T0y^McGRQRDm#>2h&;LXd3Vg#!hHx;yS>VOurT}04S+?Nj4LU${h0DQ zD4{efI>u1YfcPSf75)>El0}OExlJpmQOO4qcL-TD3fFONXZCN!pp;2qWHo!)T0R(C zG~=v#izt_SQQ^)Ft$4~h&dQF2R1yhXjd7D-w9q_{-m3aTsZUF7aD6c&urUlf>Bb_X ze^7HG;!7xiehPCYT8nudXHB8*?l189t@>n0~k5)@!|=BAippP zplJt~MfMzQ;DzI*fma55O-#_6u@TV#NM}<(DohV0rU9_d;k+YYeqJPW05NhTH576H zDIGwK{I$i5iqm*>+n1Rs4YJ#e{jA8{*82y5vJ1i~ko!X=*mzljpCu#jie z1<%8NmGYRSJY^}*S<1^&dM(gf!SfDR86R23XO{7mWqdECp91|BxFq`zr;gvhJ?-;{U?B*Z z4Z#qHcQ1Sa31vZA4qiwVYhxt^5N%)GEmGIal1(-4o$PUW>&S}Umx6InD){m5;8B#5 z==BSTLIuUFlk4@yXqthNP@Kv&e^zBp4j)Kn*#cT3kr`rS6LJc z)s=K~)i&A0Qc9A%TjpT+MFEP+l+uNR$})y3(km#Q)=DUejpMv5!LzvyDQQ`WK*wB( zWJ4!Qs`MI-UT?Ge$sV_3kv(dT_za4xDG(N`BCyc+A$=}b1I-}IgtK{n7Gn*xfI_L3 zNdmaU5Jm;qQ2V#1CMHhgK#2sZW*Ww_y7MwE~SKKEVnJI8Ww; znjb!eLwzJTZyZxWxFqgs%z9QNU&UCXGWi%Z5t)O8Q7CA7;V*x2X@GzKJFXoQ?#okB zYN;mQ3Wh!~v{_uzD3yR0g)$+y?<1}HbzVXAfrKzy!UzXuVL#zxm!qn_hMJF6Pnl2C zWm2r-n}N>Z{^PX6NPJlB{^*bjVrWemY`lpPGuxe$q$CQc!soke)SQK2htF3_%SI|; zn3A4|T>#AVR@=W1I?{+V3@6Pr1xLDI3jdNyE#k!zv&n9=Pqv4|zNkB_as*j}S{WFWVj27}?Uoq5_GUyfl@>s_i3333Q$g(#pRCdm}jY~Pb(!!8lh4c!(ZF8nFP;8Ng@P7I_q-Ss^i!zr*bYe_~-*Q5tk z0W=4Ot^I&-u@pu$ph|5KiH5q5Tp$x65Y$PMwchEbTzLgF(9O1!)gycS^Mtk$EPhJZ z6mdCS& zm=bOoVVI_~*z?)u3X(_`CNY3dp;5vcCi`l=v6_d{WKCO4-3EiD7|gKqS$Q@BEfoFT z2%4!aGXYYljWUSeLJx&BA*^Gj$p!gDw~z@XLpDU4YQ1M8x~w#qi$pnm)WFPoxEpJI zjYPy|F~f2~oNe!7tiDDcg2G0`sFAaq-tZGzDi!|rrke<5jghzSDfEQ{bg%;m<6A*_ zO*V>8!30%mfsGQ+xb`L^%p^aMK^}Fcg4|q~f5=j?k+9fG!ZHOe1ry`WE>1p+Y$yG{ zKyGViW8u51|3$HUlCQ=ym4%8#J?!uIB7^#%ECceKCW!4Mni#H>q3)#MM{oe=er;XN zi7p1eLHLuzKoZu7(B+}JQ}l6gL87nxa*~3qB;2DlQrX)8Sw=Y^mkCO=400?>Z^h%J zQQQaFr_Io*kQ5XN9D1Hi(NL_rwYf)}w50n{8^wowkkZHp1<2}ePc8FZyq1A6FPHs) z>5Y| zOhwWFb?E03?7JUsxSywBb-h2ohNxl$yZq8*>AbbZQ%Do?(nQZxi){Azd?5k_RuCG@ zJd_t;toAhjapE3ALbr=GvD?kuFj}Jo#i<#MdMwPq-K=G{cNM`vxuB@ucxDTE$rE8y zBWtURlAc8@r+pvaAlnsZQ95sLmvq4v@lxzebAQyHA@>)@B{6|6uuY_TwG4RK4}#c< zV}U|i;i5Fgsu;X!1+ia!)2$>jNV!LMyG94CG|1pU-0mKo;;CjZEY)dBDA<0IRDQH8 zJ1^;{h9O3+4v?4B=Tbfrk|0bwJm}WSIdLBuP z4}c=2^8m=LPia-5c_hC2hIhl3F1P@;`22sL&&2;L$v=>tJJR131;fPc_=|~;Oc2n+ zK4H}N$4-Tf2E!)U1^RjKln;TVO=7ICOAU9nH2R~OkNizE414K<<2WVf^SA(X%Z^d0 zrHswC@7NcPVy7rk>^LFRVgO6QdXHptyM?4Oy(5w-I9_H^kB}#+`ER46swU%=myOVs zX_#gRD=##!N;5O*0m>JVb7m~al0I7LaEOW^s*qYnJDZCjB?Q>=Auj5E%VPqsomB4; zOe)2ZA6RA(Lm}E7K4^k8ZKT7tPwsMU;&ry#)1;AP>)Vyqr_m3(Zgnols_GXe$a}@E z*(SMf5pM^@^m@oSTw8I@7jbG$CKgK`buz*r+zZWxlMO{wtwClawh`xaXhMm9;4wvL z8LD!Um)v4mY>CnN$oZiBZL(P}&c-Pi67b1v$SDFXb4q+n7%UMK-BM8`+|O9Ws=RSo z)2Hc<9-7Bz>X|SI(NC>Nzg9FGOzHWKC@-EMVVKXPVh|wLJkgKI!5>b6kiXj+&M@Hi zLCcUEF#VT(qcCSQ4Ckw#jE_2s^k|B-Z<_oDw^Etu3#d@bV81I>RS;hj8OR6{ ze&!MkQV6Zp8Z+^KL5HxkyGH**DXiTM%c(_jFQgZ3wmXa*)9L?qZF%E;n5MFHgi+1} zh60(WFk#!#PEijF8nsLozR4%7f(D*rV+kAQ&?$#*81C;=4ic%~ zY{z}7Wya0e-i7x(+m7WKFz9sPhq6MEem$_Vh4@_wM(_9hmn|5I4H%elfE1o{>!1ql z9T}`xW8)?+hN>9@$_RW7glTTMh2KrA{jtU8H||DM0T+q;7_*HeLHZ`p&$Ip}p#jva zrG@7`E70}2E!8LNRg5JDzs^270W$GaD2%``ES5hHZsM3Q>2-XIt?ZcD&m|H7RK%@# z&BSx(c7z6)>wUXM&RcSb(<$&11+6IM+*@Q`Nt z=fNCl9nCAyLnK<0sR3m?+Tn0unRJN+v$qjnd^>`+(ecP*B54m{XO=k}Tl-;KoHI4o zQ%MpF>o4*@vmspqbRSoH5ycJZ5_plc3SMDiIkOR~NI}q-N4JGUEG`U*WIQlS_I061 z*Qf=TO;J-am?i)le|x+{*t9KSd`eM2O~{rYm|3jMHR*21IkR%Ri0p+$w~vL>aklU7 zcOYRthz_w4-`tktH6CuL`bLPYCp(~a!Io?;9Ji4(=Nl#%nr#O zq%sM)EzGBt$albx;6$6v);tH$ySZcuLpFV@$Gpq<;`N1d(BpJ~8mVz@o1hU>*Ru}u zU+YYfx#8y$5&NbQs64Wq%lVF6uxD1g)9H;tcWK755GNbgNfJu1ar4O9WBp87F;YsL zu6T2zd5Gx5Ibny)ci#1cV6EyUmT=ouxW!K~(tGQn`Di}MStlr5NBRe9e0+EqC0KiW zIgL=|x{a*w=U!z5ZjhsbeiD0mdSa~Jxh^%#LSvvaq*6LMC`E?**JI0(00U47!RX+oxB;Pp#FnIo}hyI zx#D@6^+kjo`3d1YQZf37YPDoSf7)wF&kSrxvF^QBCzlI!k(L-3ubX!0c5c+m8Z9j* z1f~^HX8ZSRPK=41W=O8ly$QN+qOUO<*`A(k%4=iKHo!U&>FQ+s6S}dF{~O_UqV^g*40Z^~E-_9ncFKgXFlvjoqcD zM8VQVE+q#@Vn7T}#D&C=v*6F_3D9ngb6udG$m6L@(+jQDTLWW|Ae;2)zY*Vm~#%|ApE!2^5 z2Za=xhHCVAzCzjhJHs=9dLSCxYG~Rmc;#)aJcMX(nBg4zqNA(zQVtUqpLF zX*2H@6E4&Xb_&M1)IEnWJ9!O4%G)4ae?NskC^uWIuwU&)>j&~3+w7of)=LbJNvj!= zaa;JJ6G}cy9!u-Zt>)sPq#!ZXsXT{Sph@C9_tq>jX^4oJB_^_055b}v4^mWV^}`qz z$r(Dk_j?iY6_zt9(_Ir<+oP1*EY>+nM{^?eozL?T#M|Ufek=L9HoqQee-XjzRQ{`? zgr%828U129Trd;QC#xeW$n^5jVCH!V&r#6-?AkN_DB`2N8PjdOekfKM*%nk}Xw0g<00!xi68(;S`l|-<= zzo#FoImC1FlCBCn&NH*b^U@@A5y?n5!RV$loIcwTChg@FdbqG zCD`qX$PB{>f|?4(C9qy8kCW7(PNhXYj%h6s0mL{XZ7vAXbU&k&pbdO^gO-wYu++)0 zmmKMj{d4$TCQu(U`CpQeD;_7235QN)%D50d)nE2^zWH?2oy!c12zSi0FZp0Eiv!)f zhE|*4O#=$MvL$(gJX}_6y?9^sROCySfR6|rK2gWI(?^+Nvugp-ppvR3l z@cnFohB^^-5kQorM+kDh}%64gs)d#H*+jUS3F_c_n>h}J-qnced#N8idT5` zM>_62At+WH{$okvyE7?PxRNr zN!3YVFgsy-L@GIBTD+*{p2+^Vka&_nyqjiB!9g&5WFkNa-d_A3$y%fi}whS?v!KfJ-pJ`-7{=I|Yn#ddZ}Z8h}ehmReGzyAZCX!&GNrCk4O zPH>j8t4Hdsc->JC3tkZ-fUDh9wU+YZ#N!0aS=AxV3-&?|_kCZ{b;&iEvjSYVoUB(R z`?E<5ud3a=qapD6p=VxRQN~25fS#~^G&UvrV#S!Zlv-nu;;AX2+$zsD{!de(CbZ4u zaW6}l8`n0c;>PT@sVCo^F=e)$`E8cPpIjqdoThYYK)Dl8^( zs>s8Axp3%8m5dDZJ}CU!>aVOUDq=u2pz4xKusykwVJs=Z(=L{#b^nBe^)Ru^ek8e*E5*1`t&1LuYPT8z(q4+-fED` z^>Ai}J0O)EkrC0l8bnfgM=)`Lg2f+-K-OMnZGD44tyMD>?OTI}^;2c;5dND5MH?QG zz@`7&;mxDY!^*?X@vR8#7a=WT;=B+y4jV^CM@?s>;xnf4anqRTCj9iuY(K4GI!Z&= zqM}cUW7>Omr4<3#^tnWFl-K5sg57w{-w6bLie@J}7Q5UC*3_K9@8ZrYbdTw|S9skk zc;JgXF+{zv`Prv(n&{V+|NKAC_}%+%e%Pa#XFuqVxjhy1a@81mDDS*_G`TUQWo_YC zZ|5f6ZIEFPO~2~CVn38_cyEP=)wzFv*Y%oV-7*{T$G5ClwgEN5;{k0>#VX)LW#pbP zBIr5@nVVs9Fd(K|fY}rWW-;6kICTNr)xZ1_SoRqHPMzv!HKCYPH;h3)G$aQbXH_X% zkLOO$D?L{7lXn%sO>H5mf$^NZJXsVFD*|x3B9?W|spv!>>^mit4t>AB2veZ(q0b*?Tx>u>b_GE=}LRs$(@rvE= zdnymV^>str_VrCfmn_$p`w+%9mRNl1AD1A$_iQ=u{lwHhqjv77hj0>>;r|{o-4TFS z95_SQKcu{!+OtUe5hMdAEE3O4`s2nxqx=Jt#28IL+8nnT@a zTI!vCF5X|5=k?v9Qzo|W?;sH`RuC*N?ea5mN@Z0b0@tfa_+^piZLWn1SPe%tl zUI~6lpGpEtfcjqLc>B6_0gMghl~yJN!>P)4sV~1(Fy$*udazr|2rCR3_b#3lDyR^M zwH^g(wVNp=9kf5AzpN9SOezi)o@579MuFb`l7L9R__fONL$cMT^@#Me381y=W}j(dgEeK3%drDg9p`}kwL{(gOC zG2g~Si^^Bg&dqC9Bgp?VakCU!8N0d&$8duG+G2K=x3tBw`I`6L%HlkvKIF7mh;JXF z`bf0w-_V>V{)sw&&M67xE1UE$j>SEnBzUbt&d0yMi{r>RBAWRBtVQ##q4-Xyd%o_I z7k3;AYd@Ek$aVV@-knYiR#DX+9x&5mhxR8$vkK9$Qf^{)KWj_NLwT z;YfX8;h~q4b)U71+HHGP`~*U5_Re(;$!BMFu39PSB8(;>wX`|_L%F)^c!R8(2Z2*ly{*%9YDrT3Z z%n?m}A1-Vyo73J58!J42Pj@v45}Ri)Eg3AD z)0%%aDBgG)>TKP~vpBH(!Qdn%$FWjlj)3fQW{v7QMb&O;Fi`&v;IC<~ajtDD?#L%f z5-2&Ct#{0>FmE-F1r-vfb<9um4e$9uP{=Fx2{4ow(tut#hBrDU&+mDAG9% zs@*0Wk3&o=WHLq|xr}omV#-Wi+Blk(mbmfVncF9TQ6W~Y%sJ8k?`Gwu2$-^24I2y_ z9lL)^+;ShRf?0f#K;DNTr8CUXrw9pb(xjRFTfW1v-mpgY3~Xlhkv!sEtvby!&8Q%2kSA{n)5Nc#hi3y2fZbl!)jDIn%L0oULa#?h?exHPRJ=aLmc zr>W=m%bB!D7*it?ArH8+ItV24+f2;gONzuSg(Pxc~H*1aywRJnMKG zhFH9jNkWDhI6BMgGz!@`P<0H8)@%%X1Pn$-j9W~b3HW$^U80RrH=edglB!U|yP1oW z54TlZn>5u6D*s6`?>=4MOpm9bg8k2=@VQ93-(keqcA)M&DYn_6UAoBVuC4(1g(adW zJB-qq4j)N9-Kh*fGI4n-%<+I9p%=9!t@_-a)K&LQ7h4$0ciB2j>@BdyzQkjmiQDAf zbNO%C+TJGq1W?pMv=j)H!_`x`Sm=k=v2sh;0S;_k(_fpb0I~*>uUwt1QnDN<+|FxD z1YC0x8+oTC?gX8YS#@@ESIIGTIe31O3BktVxa8>yIt(#Vj!rKNi8Iw$4~ZPSih%To z#E9?YMh?@)Wk1TD$LE!qx>RitM+xZbD=~TU@X~yEn*&BYfj&R&Z#J})^qZPtr0HLX zQBR%6?*ohnl1qik1k3ya=We2~8IML+m&puVR%Ab2KOWf%-3*-0 z3!Jw_XS{BTBgW!*b47%uPEJFBDH(W*^q$DREH-#a5tddQ7mwtM9E9k^HJI@E&myFw zsGu{c%2sX!JWnOuyT+fYx^ut`*8YJQ_A(ru1$cx3Cd7ejo|5P;H%a=p_gAPY&565@ zbsK)n>XWBxDLp!j$9GJIL zK`ID)gI&J`E|Q_g1vGX)aTR|(z0=BHjKu^J-Q{MeG zb-IYie+PZuBPk2#=CR-XFD)Xwuaz1`j2nZnK~Ap&XBvUBZ9<)4T{IL~B$=e`<~V;I z6Q*n40=u=vxzm^EHW`m-pu{p0Pg zQE`bN|8ujMBn0&gDnRpfBZK)Z-6fj4LR;+ffACN;b0g_%>c355ojtvk+WLgsN*YmE zLLdcSF_w!5%__%FJ`!Ls-z#;Ahu5G065!T%AjC--%_JjqZ!Jz9;&L)PUJJD?1BK0r zAY{)~4?VF$-w!G2llBETa?;p!_(FgW(gFmj&*({OF?8JS##eFmiTM$w8}HkTuE+I_ z)MHPp=YIfu*z8tk=;|JI6zNx6X#qGk8Y`|?KDa1VGNkWgQrzOF$IZVzfNN1O^9GwL#0SkLk?9=RpzZla% z;=vs~>+&XvZ?BOd;A{yF2S;2TFoMgsZIaAgApN;Ko4iC|XOF1xVxHR@jdN5SqTffq zT+@2&Yu{=eNU-EG0jgXM^1IYL?M@@5!ljpXWA~Y>xbz@ID5<05va8?Z^vVH)Xw7oD zIqENti+l1Hz{0V*Ot%TY71&a{1+Pc1Bzi3jo2mZQJxhyh88@YGFpphQlf=zUyr)pS zTO=_WVbPd3Ej~FRu=8-)d3f|5%UprDWJ+wK(_tmTk|q?9SHP;Alg1H&GGV3m4E$~1 zaBFtn{@h9T)=RovINk3wo`9+~HIQ7&(pjak6UfuXcX3erIdp1&Q$L+6P*SpJ^hqw` zKWE6v^31LRYu;{DCfpBZKgg`Qq_@Etj%?YL{Kc@S;+|G!V($bF$Mx__|73&xIBS%O z1StwQH-bxl;j5{^tjQaQIXTNO0Lnz|Y?oKqQ0kAE|$&c%UwU zSFV0r-EJHa>F9I`whRj@BtOiD2m4rSmxga!O8f~&p-ATvpfYqgrRPzGyV1V{~TQr zjgp@O+)UlE0qO}*@u6}C?^Tf>uNXuDpj{NRhq5uZ-z92+kQ0rW=os$?>y<^Td9gGfD<5yhA;`aw+>?r&jjG@GxZDC_@s-2b-O=hx&^Npq|fL1_gbAVVN&Aa$1~x!NjaieWMK{U&xnw)Z-xA9pg(&{E-~>xaF~T6x}~f&-0R&w~U(Kv{Z~X z1Ys7FeYx;fX=NtUDoEArP;P?L(_?&TS|TG8M!6g%zh=&}^CkqA-;6p`L&flcT5>6= zgc{)`UOhJU!~@9JZvg;Z$&C*Bz<2Hj4;*XXIrIMrd*+*@Ev1K7mW$ zzOB<)IOGI7LN0ro~l?#iZ?m zjr%Ko-Et-VO(SPfP_rq8m#5;A=Oz7OBehLj=7MN4fR-p?*)=ZO`k;+Q;pSiAD9MtH zamn-(7HLK(7sLo*6N{{9%k`p*rGw|P;)r0z*;_50AWCChGPUFR&n~+@TaxsvPs{Ru=ti9C=xPDpIG`89#8ZYOY~@ z^83YFBB;XDoI3m_uUY%N#dGgQRsZzGUz;z`iA|hz2g)`8z)De=iesurwJpUSnHT-F z;QpcAC!w+P6|$d2bBS(T`^3MxIynR5fFX0VgJ}WD5xnme_1HmE(nl7Nh8rtP-?&6+ z%L?(@5;Q|%;;HGQ|8Mv~2@(GbC;IheeH@EkOjNj&=B$2qV|ji}prO60efW3>bAvCB zv{h-!xq11|r24G-&zGv3HSMmLkywwzeHl$MA?pE;Q3jJCPhAq=KmctFT2QtnIA@M^M$wEx!wPaA}eKkaqv zP2;AU@?+4CCHxDNJ>%6CuL>GX*vtRwTysY#{(~XDe5;(wuqBl*Ypv+`V4cG7rIzZW zta8%m1lZVWmubzsA65Lv)B7qm+dPix*BUZDOwn9X=y3I7DJdrCFjEV`8JP|GcaUz& z?)bx-20Z{{j8C8beZ_mC!d^K=#TFiW_uAMsz1?D$TKAZ@LvTh$9LX$!*s0_!x=!vL zANmNF2n&D6w_g0Ua(=p;GZVqa(}6A1meluCFo~smZM!1q%n;)^Qfafn`K!Dt1<#~) zq&V@z3t|$)DT<0Fl)Zod!S~F0Jq6r%6dxI8t(mKJHo8u?EY-hh?-$8sK2MQ}4(Ow^ zQa3y0`i0fXZjvzXOu{6($i7i+brEs$&g_L;Y@P~x@*-Zl+$Yc^wox0W1QvhwbWN+(4P)qGadz`+}l(AiaYI_*}qMTcw19x}D0Va2VKxaUEgJ?BbR zrren>TAZo#yn%x_#lp~%(C)l;_(wzO<(xU$NvXZ0!VEA&dv|K=ye}O=?`V`^-;rTY zS<-FRy@jpdfuri0wTXaz#UfOw7tH-n{wa5v68bc@pYS*|27`wd+920ATj^pRg(xq=L>AQkENA3KgC@tNvH zEGnu05^`;J3N=SR#F1vz9lF%8ZmW)c?7AwoT76^r1j-)c49^n}ziNHc$P6Exj*!I} zygX@od1K6xn)T>aqdHA9zKeJZ&lReTF}|$i!3@jjxe+~%VBE7CCnS#2la5{{p`ej!ox^2JSCeoc4s&h8{ZqC7V?}2Pu)D^@Lrp+Y$&+v7+ z75AX3f+W+ZX)LKE-xfcnR(&kQ@UjIQ|K&R#n_;bf9gLez`9H@+fk&Xf`Hla54NVzee@AXUAcvPP&+Gal;mTf@J|JJiDAFeZ z3Ph24=9^KEGyL#d>P?<%1f-`^Ms8*XpypG}h5zZZcgqkv3z4vCq_@0LIIF$b{|xr! zqe`q|ZeM9~*s6S(*A(g2`T%nKtDJD}4_t#+&W=8128%M1((ao6nN*o)(Sm@lTvT>Fb9yQAA(Mp zZCD0ewHc14J2Y~Iv{PZUN~c(GA`jND{`WgL_i3==?Kd(Ke+`L0Dh)A(k}6&&cophb6_6>*2<$v#__QsJQ%|CmZM$YG$@z~946W&%=lNeC@=LkvzQiPNdnswNsem&cZD$#BZL+I4D{kR8ZU?T4_-%&2Y@gG ze?NhYo)cwfKmFcRi1GSJI@`hxD5Z<8YIz~70SbhL z%!mV#27yLhbtQ5#(j9SW-lX7L{978p%Rd;rcsK>)F?ctOcXiGx{Fgi7#Fj-UfJ$ga z5y}d85u_=a+anR6zr6Ao)U)h{w^4%jGp@eCKDPK86ohPdaSY4Tiy?UPD1uBtEJNi2 zXj9Ep(~#MiKwwmXctpm3}Jg`{!=Zjo6qzNh@*j@z$-jR#GvIcyuV@Djo{QyNN3@g8Y zL1#&j%^BNQkDORI8zxtnAOzTUZP`6OA6i(Byzu?w34LQ~RPMmhrYZZ9nk3SMVYlYN zX?k3(=m+}2%hImhRa4=8Ya%%ivak`K37^jz0Ck1(s$A;3!ks&DNI^*a8Z|N|NVF9*8!xvtBtmW&laSo{3W`aq52C{ zJ0UzCXN|$LqLHWIxyNw;Kz!1~FAfKelAxYkl#=$aa#qDzpVc6)(9{vC^gk}sL2LQo z2Ileu_al~Ws@!oLkO=4>NM4!z@J+0B&o^x`42NGa zNES+DOI`rrS0P1{%usyoriUcAQeqVOdLogyF+3badLFxS*?Km->E$syBn>k_lv zTRNgp!imG>dET6CMdnDxI+B;J5^E(_QlnBnloB0DT)Xye`+0K22dD$wJ7-$c415fMo*m34B;m48Rvbt3n9LTB)2R zmP^y+5G&GfXwa8u*R&P!gU(i#xRYrJfiZzXhuuCyNwDFL)lx=~my6(FU8P+d9PBAb z8565hK!eUU)dmYSFtUnV9Z9e>gM_)lKW?o1Sf4^p75OZ6-TKA}r7DYk#-@~bFs|B5 z(fL^_%VlE`bdjuS z3fB5knP7p_#P}+$aA}^^CL5%wA_Kur%FGZ!%jJlyM$BRfK$Ijw9U}x*V>m@%*#11D zkd6!BlEO%bq>@y161Xl0DcPlx9e|T81u3xr4k&3N5>V=no7J4T!u~R6G9`;hXoTKQ zS7U9+#k$W1O7pYq(q@sxxCPfNEXvqkN37B-hU$2NC#~3I5kQiNZw3xQFs%6z@y^h5 zWf+puQY%D&;)!0jMJYiLp$ulG$YEIl$t4801Gcwz)$(~>kz6ewm(L3p@dpcFo)7`{ zrV&gn3jz?eWslbRqrKcIFa9Is$k&{^uYEZaW3{fq(O##4AOeCR$W3vTS{iEY{}Hqp z&`NZ66My6CkgNf6mJIfIgG?U#tJ3*s;SGoK1b)RBmg2&P>oYS{^q$ z7n!fmvCw%T`pts`K!Za#Os|pR41%Dhx(J&Ynb}}GIXg$(!M9VLYMN95y%@y%vX>~# zmjIfJ{11kKJf8euroBrk#OUV1z)VNu$O=f)eUAg~z4yT`RwQ^&|F<-5o)^~=hHi*n;A4A$96(u& zz6T106j0hR3DPeTNbf1M#P-%Ug!q7F*$QAC*a{}`=vD}y|E*Bwpj%;lvCWS+ZY6Df zp#Q|mWcQ2wG`fIEz~R|2yIyCHq>JN9709?zrxh9nFf0eEDvGLz8A|2!(&v@c;kzcn zf4EaN&ZprZC$OM*A;Izny+@6(b_nHep5(q)OVVd`K?!y{?`q8aj-;f>QjS)i2dyFYrS!>kqBs}4GqHx?fK}?|FQH)>w~y5#C>4c) z(n^WMxURLFY4nL%>LqOI7zPpoce+JLmjkDL;Mgn9U?i&=Xx7mkO7Ux}anNNo1rf{i zuQGWS>*fYR9_nFbxInJ z#uoh|XEqfs9h?40SNOkmyE+ksM8qVdWaLN`8iU2*DJZF^X=v%_8JSsFC9z3nmm*b~ zbQv;b72AESi(9rFx$@*IP^d_;5~Vz{atew{$||aA>Kd9_+B&*=`UZwZ#wMm_<`$NS zz|c;cd~CM~TTR;U9VeVjp?6&m3NU~}ANbHm-t$QWfB-@u0%9NmQXm6zKmrOn<+Mkg z^@uas2$nAxaJ=~O!g$E5*Y6+D`MCLyLWh-i4-R(QPQ>evZ*Io=XD{oa1=%ve_1lg$szem2=a}pBF z({>1!YW6>)A>=45Iy@o?=U_`XF9_boBw^wWi5~%ZWLiFk5K!Q?g0XFX!t=lRfchkR z_c?-{3kuwtd~(P+Pka?%gva;py-f6~&*%sWg=MMdU_Lnd&V$AMVIMdYH~;_u7N@=P literal 0 HcmV?d00001 diff --git a/fonts/KaTeX_Main-Regular.woff2 b/fonts/KaTeX_Main-Regular.woff2 new file mode 100644 index 0000000000000000000000000000000000000000..eb24a7ba282b03d830fa6c63ee897d92a5188736 GIT binary patch literal 26272 zcmV)0K+eB+Pew8T0RR910A`>74gdfE0Mb|h0A@!30RR9100000000000000000000 z00006U;u_x2wDl83=s$lg4ZO1h%W&)0we>7bPI$&00bZfh>~Lg>lfqq!H9{pqisKVY-r;FZ|J_}3x%f#O2oVCoLIe_|K;jSrB#_|6tcF#nQYuiY zRK(X+)^(Nr)_--CzcH|L6YOKIgtS zV^e?n{KWzdGz>Uvr3ogO(O4za|Gv{cJ82%+Gi-Qo5zvVr0DLZxboS5QW$DVXQ;r?L zmIH039WJ0HEy6d@pqu?CAy_CO;Dwq|QLaaOJrjSrzwPh3%zqSH-@JXOXu3ou^maSn zD6Y9G97Z4w7UP0&7>6YQ{`#g?zwBT4E;k4aiG}91V;Mr|0QXGWtJ_n;Rp(_G-LZ7X zBgu&ZY&pQNp#j4J@h#fb%-g|!nDK9Z{#y17F$vj|Ow$cw^7Zx5lyr?)4bguwH}XpQ zh^e)Sc&Uh2jvmQxaQ?x06H|Yz6Aq_$_jY?{Yg@O_mO4~aKnjeqsU9vsh70XIBy6)b zDEZG{)L+!>A4obA0Y9^&d{=I z1rQNW-S`)HK@33?1Q_TF+)dX^5`^^cPky~Ft6Q`9TUr!UZBCSJl$f=3h(YRSXRjSf z|1Z&uk0Zv)$I=m0ewE+k>r|MjE&PC~R_Rj!|nOT6qEFfVQj7#Ym zT#(NMmbwG?5(z-e(xsRnh)SU3rz4djk$ndW^Y3v+-m1yqPKC2`3yQvS0RN8Pob@ zd;8b!bXHN=2_&HZ8t7F$c?Gy^Nih!q&MrSe2jI^R0kDYQI<#j9%){aPfS)?x`Q=&T ze;vONSt<60DE_GxGmtaG3@m-&0D!*R0D!`{Qih;{g+tkB+RXlPxk(?CPmP(j+F`GQ zj(Fb(uJ9QTdCD7m7S|H|w>SDl@6XB!CYp(vn%POFc7rMk#lR-EFj=&{{lr&x)zesW zo%Ggj?bnAoubcV=pc+-I%2cJQ&y*#GBe3Jl9S1IQ$j46|O^jh0a~NO=>)6F!u5gu~ z_(jcDPuwRQ3n#;e;bQnHHpB_(`}9-#Gv@EO>}~ZQzI_W&s53_1v-aUppUVH2i=Oh8 zUh8N5YF50z;;G)iid@mRvCYk9@@waPI-_&)9l3J4dyfH&BTol!q@AhsGk^3j+vQ90 z%O}UwV^UsNR`u6KTZH&&GeE;Z?ohz3NPHDm~^WFB$G|bQc{%3#t zH$VCDj~eXRv1#=-x$atBdbrr%&&ypOiNWIh<`>T%eDmOxlRj|5aql|hpab^VYmYTn zT5i}<3oX!VvTjXkj8-ZnUmm?$81vtj|1v0$zr1pCBzfUmiYZV@#p@p#Ym?$XdCBE4^S-Ac8B(w}LdoqS zW{SNqT+QhZn;21I>&bWg=z=wGxLwj{noRNmp)%vbIlS`JibX7HBJo@N->MG@^Rsy1pre=gd~{zgdtpy zn2n_Z+Sm>>R52!1rK&`UBA$BF7r=;I6;&lbvI-NX#p-VGC!c$0vW0^JY!88O1>p%H zDGt6c0`W*mKw2U)l8}|W*nrUgC57b6b`VsA56Kdl`^~*g$Dez)niYTfv>cY$x|!>Q z>G3*Y7tCXxITjL*q7X{rP!>i-JgO2XO&mKpn8??2YsiG;$qkT$&t(L+zLq z40TcUyY+XHJEaF;3U6AHmgU5rzW{T_OMSAk3Ts#3Q{}fUIH7`~80902Nxl5E?yOGI?4JPi3SJD(HQ~V!qEX=>C!sDHfKlD)RXhnK;z_jrBbge7wwh!-@4pFm_VvjVzjHy%f1I zr46__VjuTY9Z2x%YPmJ+3}kD28wJ42B&V_3;nbrKcK-s-hM>YE7bSIMO(_WI=rNA> zsQ3^VMNNd>0niYKOcAoO5(c{ipd;>e@gpFT=o#U60St^op_o9CC>A9$l&U1HEXk2~ z04&6zQiPnUgrV*L*oea|T%@ec)*)qGwjNubZNN6-7A`OX5%8%5oj6dP@hY_{ic7gA-L&R?^ME=QQtoyyBdiN-P$&opG?g=KBml07vkd* zUTfQfs%iHeN@>zlRDVFPtw=6=#zGKmEnltGSDw0CL*K1B!#q8-j^-x4YUAEYp65S^H&E4vkORn<)pBD;FR^%>Kd zRDt-5P{wP{7;-*i0IA&@F{6mG^AKYAxd+Si>-;U4})pIlVQG zF@uXIkQ*_YVfrFqqU?8*PRBGd>H_8v0dOZW;^kbUX(1JRfZ;^x|B)`UU~%cisy;j8` z9Mq=7g)VqrMa)i`jv|a6WoyK5m8vGIEj;L!kzzW4TBhy<%oB+Ggee0!2k_0bA)ELN z25&eu&w0+Psylo-vv~-ISRrnMl8SW+1P9F|{i8+`woj}t=L6PXmL%)x(w&6-lMWom zZ9O8Qq67y(gfVKf0^3Zyn>m$hn+0PrLLJ^h!wPYb9hrQd6fie(w|u2QiJKHBb(s-o znW8u7iL6WUY(DD6PAX?JNlxb=j+IKnZKW1Ma6jG65ys-J$dL|4`V2+>7{dP(lK8Az zHAiH(brn_HU8@J!7dj)P%>SgN`d#R_4t*jgJidVmxc zj}otq)`2S4#+h<4F)=pSXK@*vD9}`vB&SdsN54)ail`KuH z$E{0(c+#09wUL9k7-0Dven`ECk(qi|FPt{Ce;r>fiS@R8n#OZ>dSTsnBBB*?keR3A zTVYWDj+Up5*4+EFS)8RWaE1OS{(HJzGX_n57cq~@)>Bg%Am(ZOqYMw$)pjZyc~Bg~ zYXiHiY17y1@vYkK@t*jnsz zr`UQ=i6j#3U=TS}sfyzK5T%RU@aT>H6I>l@tMw+Cg{?i-vi|;nZJILrhPDXckS^{3 zy`Wv{B8(nPy11x+%cx)fC~R!354^)Jx9rvx5lb38GUyaBnGB25B_732qnFy3+LOW^ zB`9RsX2M=^+smS$K_bn`Q8mDmreayLj2T8A5>iVQf5sk<@mb~@JHj82N|svW!kL_4 z$`sM&BCAYAL7|V>8#4A>h9}jc+mkCXU_+rY!iJs}BGdb~Z4Zi;SFlFkPs6Z@uJ7R} zD%(p{%YxqC7KZhp;;LIa8Hj{xV)jtw&R#kKo&5UBmCH8m3nzHJ{RjIGui9$mp?!^8 zYcvzm1&?#YTCSM*e&SuZ-5@DY0_Sd-R9My4Ma#f^8l?<0a=<~Y^R}C&Bf8*s*HcHi zLw8wY{e~DC-~95jxoFw=lkx9#L~g@w+vLC#Y(@W%_d&$*k=qaxlW}e@g&<+{VnS3- zmttqEOTy_~nM{Jlup|r@>0sBY?)P-c5~ybEe}DyR4Nq zA4V*rw|CGu#H{A~NQLMPanLp~3-o=<9^=jNDd41-fV6DV+v4N?Mz&pr^Z6ukF+jSQ z`CIfUxhi2gP`7zZQ9s;!1jl|uNs8a2bQ%U)$F+pI)abWQzSVQVn0u|Lt>v@t=xrQX z*hRNxI%+xMpYlu%RZk*I38b(}bt0x6u2oan1AV>unzadQyX$e~90~A=9{V|mXlB{C za&|FH_++zvnnbtOeN@IbHuNeD&A7uf~*FDSy3;WfpSsD zw}^*&btbEnHcA3>YB?&C3sfUDhN!#((oH;40r=WRn+Q?1)S|IJCSg^%ByBdnHKcJ> zjZzF(=X4@S@Sua^3y+1Zf+nLxu*8I#XB^BuBLS~dzY3r_H5=4fPNU#1HRcW-VC!kL z{Ix76G)Pin%=$oDR#el;5Y;#+5R$;i21*JAV+3bE5NVkUdQdVpvKwYaz0uSaOb*EU z(2`!WzrPE46M(LWEOx$Tv?>E>c4JH;FCV_e(o25Dq&BP2>l9QdI%<9EkFj^71cN;Zg~_`Xs&ATcc$3?RsJ(YF)OoL3-jy(L zXluqq>#qSkoSczTNO2RLIsVi2=) zizn^4xjUrGUCpx}u#{L5{p)bcJ0y->C_MSpJ~q>26w(bu%2^MF zf|o1+P5u2qni@7?bva zAJrx^;k%Hmfh4hSvWkLbw`N!h^Q4jt;GCgB54RPFYmb!HVfeVFnO;R7Hzr z?VCdyR<)4fE#lW|?FSJ(Ax1TS6n=(QO|-iof5oYvfE_8e6gu#}@dFi7APpiOC7PBl z+q3ROzl*$g6sJzJQj4^F#1lw`NT_WS(`CtscsC;x(+2_zwbQMF1XZ>+qG?PHkaD_V zJP$cI_}eVD$^cNwB6c58yY7eHaEZ4#=p^yuewOsjU>@<1_T(J4`fLlL5?5nEz_D`8 z&j9lf$wmQzI;pn(W5yg33_RR~Iczu(8LJUvsey8iF4SNL6?K42V9x~3Uf zEEt&X{@|0x&6m?sM9DT!2#@0CF^VY!Q5{qJ>Tx4pv#ab1j>@{5&5C=8Oxd<)v>n{h zSM9P7fBjX-jgxDMqIgd|(=%KJ;%fX*Hj?aUW<%^xW%+VrJ!5I7Pd8nq&d`DOq1&!* zQd2T5X7NNTVvU2TYzcH@*UUFmJtr8X^`z?_UJa(L&1b`OOUUkdo>Xk&BaZ`>2@4M5 zQUCldPjNCn+Vo3bxCB{hD#4%?x|hY@$}VC%geoD`8?pJgH}-1SK?H*sBy<>9e$()r zZ83R%7lC6tdkMaYX&%XgvCEu+Tq9;F?0F z&4h1lhzZrqI%Kb4BgK`K+{*BjuG5=4Q|}$A9QE3=S@9qOQxL>MBpfM8bT=$j?8}BS zr8#Awi)9|7La~HYRo_+-KZno{P7Og`-w~2Z(M^2utY;EoS7z-`3DLBA(QWSE(hF(P z553&cgp7{M^1J=+bHeZ_i69Ay)<`z?qaiCE_QGBjS8PvL`Wrh2es17acd;lbypvn# zEqNZeRL>}N={gCB3e!ZfO+ML438Q%WvV-4PC`Eck3gI~$4f(3`nio2uNX=aXe1c+q)R+RGsKc| zwJ5y<2>D=Sl3t%%HKcgSgWg zB5KwlsBMe-P>ad+Y4HK3BQYQMJB=gwL|x(S5kL2<$wU1t1ZOC;NI}gXjjj=|qrFGS zUK?^-&EE_N1Lm6*ERNC?| z*%)mwO?OL9Sr3U0rB@g?ujr-xiuIBzBoIqd7 z-D~b$LM5ggZyx6FicZAd7gO| zi^gD+ZXhM;q_3mp?4ahM7F>FY&*0iOS}=$tHVDQ|qD6Zt^T(E5?Yg-454z>Ok94yh zakth*Es;?u2I9gD2bvRvTCX1FIZhD8a{42{?Da;qW`Z*;n+$Ksks{KT2_a@v8^NO$ z;-edNnrJ4VO4njA2t=n%J*Ddn!wy+ZEjWf;V*9B--~@JTrW4dNsezalN?#x_hcyRw zKbR@z;*}h8wY+2%5qv4!C6cArQCTu-;B5j$=(+gU^d&AP>&%RotKUSssXc3mV*w$x z59~tZeYSw7hDS5x9NxzPQ#O&|uKNp$GJGEJF&Ci*;uwd$xb$gwPD#Thwn|+PzoJ&L zB}O$}m4u?4z=kBKDlbz_KG?2Om)h3o>3dN*$_3b<_DtQ9gZf}v%&crEfE*W(BJoNz zpx$A~Y6#t!DyNex2-Bz47$r%}%JAo}V_q*RA$EC>_{b4po|p{WqhbFd6Kla)?gV0J zi8uN-`Q%!T^h=rJ)Q8-w7SeGwdPY~b1q7}u8VR{_F?96gNoJrZ02JR$jNgzEJ%U^V zJXzsor_7`Fl0lA>*kL33pRlf4VmJv4e+*Ek6Oms#QeJqOH0SON2CR}>4m|=s6FS@G z6NDD<1F6ZA(ugdECDdh!-t(E&O*Ofr@w8mpLI=VF^GbH(KO!tAbThH5 z78-kQ>g=)Q@@#efpCuMmZr|dRgLrP_*1AHsuwZu-O3nu2VW?rTWqWU>^fo_o^>XD% z;ha$IQDpZJ@>xgW&`c)e98{;-Y3ht|7VsKo)qxC9rk#)vPEpAT6+RN?G*|BWBanqY zg>R$w6%)Efhu_rN^dEeftuSuaSx~7PH0m$D7}=UW2@GDcH0jaOCIHv6c94wC@H@g% zad8lzRSTIuGzyu<^oUfm{>i536nt9RLr*Yps;HGdi*EucbH*3ieWz*_V&jaXE~?je zEvpe_69B(d9EI4Svv(Cu$qSw)RR{#6(@GgMy3hj*^ZqRWfk`EO8bI%3Lgu>SX^jKq zJ&&(i2OQ8OEkccb5ZsL zY|P?LMF&ks4I(g$q+;fJDmMtTVst}>BtY2=Y*ZB`kJ7Vg5M!4XUw%51{sG*NC1QHL zWCrqu{k`KimViHuLi!Tn1kf*{-?jm{G>bbR=-1QLD&qVp!tg*JsVQ~od$G`O05*oT znDs}*T|L$;Fo+aj3-dB87LJQXx~&Wjt)c| z^8?1NRva9C8K7(|(==;ZP*Xn&J3hYXeZ$jspRl&N9X)*5%fj_zdH}?Qb9m27QS)$& zPM%yk^cvqo3|w&A#rKlw#qO51gQ1mc{wQp^N38ooP^bap4!&X@hm0+ZEzYQW4%razh!{`nq z3Yoz|-nFzhZtzWTQ4+VSYg@gv(1~Z2XB4t(Ro;KIr2sIak#6Z#vs_L{C6YL!y*@|; zsr#EcQfI9L5Cl%~_;bDBbyne!TA z{acJn&8rC?J;UiDGjjcEUC*v8oBJ~)M$-=_i!)ZxO**NU<)JU+m(wjzfUv_vfJKGl zzCQvSr@}J2$&aXR$*$H=CdUw*eZY4Q3^i?le^x~t#;oxTmXgNl)&nGSxnwS#6Gu}8VDpAza%6LOQefAp}3xW5f$Pb zT`1(|m4Ay=Vv7!Krym7%UJ^(9ZWy^!sAA;&-JSi$X_DBZJsx{lXEyE`i$<>=Wq1|D|ZCeVe>LXoHc)0bU z*a!mI*+R~-Pt9lM>1JO6-s*}>$A*k%LL1?#%Y)v z8WRg+?OZZXi86$Pb-vl@s6M?Hq6RHDSGq|n@M~dIhha+en5{koVMvO~Q2DTR>eH!) zdA-Fv-3+GK)>a3*RmN1aNO((kGK!WDXE| z30Cl8z>>!6B_L-=6Dxq&V5Lv5q<#A40w+ zUu5}QPVdGUMb9(0ESb&d0XAwtg_cw(Jz4rft6n2KZD{1avCE%_hd}Z@LENdRoR z`xXZcugNpUNacXF5M0M06fzP@bQ^FJeeKup(GywScqA|z>bSG4*~(T7qwxvID5Kwi zChNRb`C2y$(W)?dQo{;oC3TLh2TF}DbXTIk7Qy{m?64bACK7y2x&URhw4(x(IMj33 zG&NF>4pmu>I$!iNOliB#;FvS}y6bugal5}_g)0SK>q-_P3I`TX*E^ zTZ}LE2nIRUcE-MXLz{~UKv;jrvY*^G!pq2q?mx+dVio6q7Cs`&xouPZ0a24ZV1u$H zVSh<#;m$%0GkvOa`t;Q4J3OwZun+h5CnDlrYWHeb(ZT?#`yvw2qyHK}||8xP1*G?TAIW21E>k)$yjWXqP5 z3g(|w@}tJ$5?%oKMItuNa-ij+l36;3RU5ohPx?6%sTpVrOWzCkiP@^a6SzB!CevAb zvAcXXqyV%*EH8Ty1j8lCM8Pq<7K#yi1=@9$Mt~9ZaMEzpYTfap47_d)d;kvTAbUgc zw8L0Tl5PO!AJaWpoXP#{aQgGuMld`8Y1~2CnCN}pZv@eNt%9DW-D;{3&k>A5>t$t} zLk9tzx6)b4&bdO|$yP#Og~jL?f)A%QkLi9|gzbup7;pqo643xoNJosB^V-7J%aWCH zs&E2^wdl4WE|6rhCa#`qe`LxIYES%$Z#AuD-#v92PppbNhId%)Gw|RU+836DzB@{j zxQ!5$+(`1+KiE5mh!a8q|6cXBbo^wB@47Q={eb(4-mCjxaJKtTo?TF@co<v)1EjY6M*LB+h&!)K&x{4T}LtAPQB z{^=2fP1}=}Lh;_Gb@@@TGA7JzH$c3m&N!2o!^ysFGRA8U^vXp(t#r|c&=|3~`WJYk zyUwvseBm$@4~GB)Q_^3fi4o!=kFpvAnKah&J8qLq_SR2;0|@e}ogBDwD6R-~+xP_d zd3-LnXvyudVs}daRln~}E#wICvPHurY+_}E8nHN5l{CcuU zD{WLRWPcOtl#UDM(3X1-P)T;(oUO%-9+Nb?JzKQl<4{3+uWY5&Oe4!Bjs$#|EdbYDl<8{6+jt793g!I>RxGOT1Q>8{&fB+S5XU(u;Qz-={*xd^u18@? zmoO&?y?&EJoOFt?xi>uq|Hae>Q1}hoS*?oTm|9bS*M3-L#z5_)hH8V}E^B1&*~lfA z<+4ejs^McfaTrhy%8Ou2`fP?>jJDtY3H&?nW3(*{aqsG!RX(^pB;1Wj8(u;_{ozyV zpQJxqu*{N&EjWK~R<&O!0DH1f2yPEXg^fTC<3S~rbRWn1sx=fV=%7XBAUZR86xl6B zSsKK+9NNUO3jT{89l{W!Vp9jWfJ9b?#z)(>3E!?`qT@D|O0{sL6LndY!xL2jT?%*m z)Cf@_biAyTEE?6?JNSmSR^F;+BC2eRlw&1elM4${+|Z1JHV&oNF?*QPB2l^~fdkyK zG7?kKq6;7l>s7Dj+PsO^KA73kN9=6~1AIb<4?0aIp1aOBV=?@XIHaz`RO8lLZ3v3| zgkIGgd(PdhJnFMdGx%2mW&r%e_XTUmQ2c<0EJtzGg68oX8GMUnmZinT@pegCN(vu< z=dEvh&}Yh46uibBsR@^X&Knf^vjDy`Ux0ITL$=@G8}<{zZ3-sgN>4e?mDGrTDc+iW z*zl>$sPY^&tR^Dae=+l+wnMrF0XIN8`7f)B0b$%>4qw-W2 zi*L~!cJ1NEPKs=t;I^Y3_2y+`i>% zHD4>Qv=AbYzn6;`n?aXFv*I{Hruz-t)(>Q~{U3oSdZ~6 z?ygr~(4oWe>)$lkwo{^qVidV@_o7~?hitPIrBrNjT6|V!k)d)OLta?<4>=x;-%&i z9zw0KBFqn&3KPA@#J~<Vv%n*=4@AN?XFJc7NgKP6b0r>>Zh??`I~-ZL%G^EZx-b#>9=SHBE9AmlHy0``7R2SifUGn()1FR%>&LmSre-F)6&ZMS)DmTCO9w#l@rfDkCC`PBKuD+_HD?(~!4n+JOi33Jzqy%#)$4qq(eHbfHWw5xtvy z@qeam0+|tA{dF$4<1|Va9y^^|&caS%EaAlu(V85Kzb?0KUu;y-@P@d+$?}!)-N~(S zfeoW2Q$W`3;KLHW4f3PFCaM)8uD?U?#Kpc7`WtZxYem3@LVmst+X^pP1aowxyR$4S-9(wAV7l~ci4;a>eiZgNEUnzPo1gvKrr^X9 z897xAHY?tFuDB{AIXN`Y<+3+fQNCME0?sZSO$J9k`UD0WQl8uON_0zS_aDpO3H>-42rdY0X z5{S?pxmWOoZ!EytKal{bI8w-n`swpH&yP`+EjyM)7sNQs^=v{&9gu?nI~65hp;hYi zSi`#M7|He5PLG^7d~oq7Drm=p6ALS6&KaG3H2&l9nc;8Ip0ZGv`$wI10Wy7|Tc-+T zly-$hl48dx>Y(>G3H79s2);LOY~D6ULMS`kooSZd(%+CK!q1K+Xqv&e@*|u6P?~mq z(`&);v|h}74dS=++hKu##=7rC=Jdums=g`8AWeSeKq_$aI83Jg87Vmz!B6AO&mYLn zE_*Qg&^$v!aXJnmTJ%5xKiQQQ|94f;Y;iWYPtZw`m}kpN!W$rbBH_&_4@~MRpO#iW z$0Qc>^86{qGyZ!te%j<(S&C`CB0kl*a}}5ws$gg`LcX+EyOPC>h*wPZ>OZ5+>pA{i zdN1o>jW7?^L!ar}R8-wxP|Fa*qjh-w7UxBYBRO538!~xN10n466N$mNl7)*hYGdlN z%-O#5jui2Y#@EAS^nTY(uhZk=MMu0l>7c5h(>D$qN(uH}#M@c-KaYb{GAy%ohMTzl znn5&@LJt0SGhH1Csr2F4aS~m^(=1rxSn6zKv3o`lJjN0fYXX62#o&&7@xM*zIb+dg zJms=K%>-Gmj`3ej2aT#|8u#gp5v&;S7NLycilvSvg$0d-axiiLB}lp^Iqc>C6DK4O zSihGfqjMnLb8*hmwo5Qhr_GBgcrMRw8*Qg5J<;J|1_c|Bf)dz2rIz0&H%D<3cj!~| zR0{o2tT=P`S?`VPZj~N$3mw0yUBdtY;Plv7<&E9BWAh6fi8&>>pDHsKX(Uoyk8yjJ z`npK|>hk%us@$aN^7u2Eqt5s=)vH@fw?swLr-b+>W#-aIv_4~9ur*gUC4OeULz$;( z8fMormCKJ@naS=Td^LZw)(DfgZ0EBSU!=4-ij`Cn`)DSk{AM`=drQ`pA7$wH9@q@G zBsUvD49?W2fU{|0x5l(jFV``jbj*Ij(sA7+EcS@q->0Xebahp&h^|{x5nfW0Zdhep z4K+1m{o~fD`;@wCSHbx*YFYiMa8n>?<1cqH8uM?^NwN5PU9ppS{u3~wQ}(IXO}m(s z>{tUyYolsq@VRL9j2XqnU|3NX7-w)w1!)NrCBvWxONXQ4O1zZc<;Ks6GX2m_%I?F&fx@ajO;W)euNQ{gj69G7RaC66&=~? zaupQp>D9P?=yG^+$F#EDITRy=&enRk`$0#rPB3>DcO0doxZ@XZ9YdVI3a;tu!m?m7 zkOPsP!<5Ki$#7?>%}b5Sw;pYZpFZ&nHme=tO^?#ByLAw-M7(KHgtRT)4#T_^ET zX9Yg|uALuTS)-2+st{=QtmI|I$WB6t^C~2EBE`#+`@pQpuMTh3gy}fT7tKqIfzk9tV4i1ZxY z9wXARiw#BM9~#iI!(m3bvy2jDMq$~J#0T_)6F@S{fpJ#(s^t;2LORP%2Bj_1@_j1_Rk(8i_gD@>=$IFpTQ6Wb z!hyWdpj(BbXv?$0bhlOb{y&4$kGh>|JIvk-Mm98GV4}f6kAfJj(!}GdLQC^JGyr$@ z%7NYuuDSTXAz4EkzIH3wkrOu%X#2Xxn^}YP5#!1|{(H6nubcQ+Iy+ix%XPLhy?JT> zYYt%9BEN&1Z7bcAmM2(?rQpZf>2tL{`lND>T`UrcKd32s9&7~FQzn!5b)r#gqScERd-DBuy4jYSbODn)nVRpI3rXgDGdn-@$x`Nx6CKsm!%Q>}NTNPJmE8TRdJ=95q zVK_RNEj&aCHwcyc_9Cq9*{lJ)vb=i|s1(CjRn3JT`ey~rgz{;M480B4!H8Izo+T#=4@vEZ1io8b0sLatL-P%IvdsTt^-DLF< z{Cs~ABH1Yld`7XhFgn?8PfoRM-FdT)^1C4;>pz#2*((qiIX7# ziK;pp@#kgWNZFWRLA`_G+7f}XQ+uMoCFz7Z1@h;j4}&A3b-~|UB2~y(S(jU z9Gdi)t>fzczZ|9I{os9`b-{WQ7UqQ3-wD@Y_u6~yEFITFuKsNC5dlp7)z8+UybC?` zM=>2y2LGP2`8NnYB2>xEJb{k+WWw|!wvJA$7a)^P!BERqsN&|MCzy_TKt=#2RjyWB zv)<>;Y}J(GwUK4h>LqkZ7>K7cCr3qWdRp|<)&K(r?{xsvq3ExDGvi_=Tc<{~wl^Pa zc}I0$FBFW4UpxBxWkCL{gM&*$OY&yr_d_Hz;(tsXb6dU3z|irFkb|IlOXa%OHY(=c zlO&N2b)I6fZiIaj;_?C69U#Kf%0QnLb6BocpgBw}2JvYK_RG&e8O7yMXA(}vK+DeM z(Y!8}$0C3Q=)^z1TcE95Tc<@WUr-dg+$_BKA%l4mOJsEt6<*dZXz^Da`r-7wlV?wZ zOImIjYVyZl-_tyixP5D#3C+^{ra_1Fx`!fO=k@%ERC{g4Px)|NJ;)i&!OmHo8=C98=WUo)hrWg99VUPXvMa42*C$2jc12c^^aP+ zv|oe?_tRFeU}Vi&NU0iEL_TqItEZGvksN>5_)va(^DsF!2g=b4;t~Je@kBdl)P z>=N&?=GMi_qBr=F(@?wscV$gj`zT5MT9JZne#K~(@x3YP+_L!Frg!5)Tmg%wRTtSu zQFDjN1F^?6RbyrrF!ij;>h^#Q8*3HS-$~|YmoYxV2y$Hgy>~k)?jNJ=+dMjt9oVJ6 z2OL)*Kv({u5}($c7L!8S?DO5Nn~H(gK0!Bj>vqV}xngUi4$WD6I!*dOhMRCjeuNu> zAicFay9XvnOdq>j=d9Jo?;zF7=7C4Wpr-?;s>Kv3yf-7gpy;FfcZB@d=Pwz%vQl(c zPFv!37vyP@Oef!+W)|xd9o{6T;*33FSzgk2qpMp?5su5LO+vPI(j+&fR8XGz%>u59 zCEHJ5!GaJ^rnhJsy91ru2hE6M<2vlZl?#{-$5L=;5X@&xc&ni z20c5B86FKx8DW}YV6!M78=n{L-}p&0g6x=rkk zW5Bi)DtJL($AV}u_>vc|U|>{gqC*!ezOQ>JmUe%Pa{4zja>6#!P3v)iSR8;a)Mwz^ zKq@~ljpZkFH8FqZPTirfxo={^L*DvalrbmW$QKQ}xTAYZsYs^P zH~Pxw3TMWoP$|^wzzivrkeDJ-dDB4zwEh|!9_}$&f6{t9ae~qYS7zHDJ=UW?ou68s zvGD&xt}(eQqUE)A&iqp7_un;g1>h1vm2fbk%)v$u!$-9Cb8fq({Xl@=`<;A6Eo)cSA%>r69uf|49?+r7>tYH-b*0^aKttlOJ2BoUN|*h|&2=O>~B? z+fZfWQUmXOwjl2X;iQwEpvO1r*rdTwa39796Ix!=U)LZ{r>5ED z?;z~%MO=eH`{3F9>+_f+J2w;_LKl_twI2-V29|;8pn61|z;rXB)mpXAvBwr~{?m>w zUQnoE+BZIQxV(Cyj)N0)FA){4-N5uid_#f(=c`VS(WCE;mGbbf57+XxXqDBaTY-Yv zU@X(K#mE+m(ZC^Fd{kN|UB~VcQ2hZxj)2Np*h))#cBDh1LzkD zAY%)LufS|wi_-wVC zq%5<$+FxxI>Co+g3c#1n03V8<6+Z(xL@ZP_`4^}Mae)q9?yb7V(4p6!1ijl)9nVbz zrWaqP<){0JK@zI-hp;P9$Uh#83aHH(`zIDG7NbeFxHCfDA3F?&1}^`TFD)vT z=Y8*~@rg{njUqC;omiyGKP7e>VDuZ^u+x@mOn& z7>z|?=6VdgLiLMEb@WFN?qep#qep1L!}FgjjY+7GlRb68@9H1QWraXjaeZG8C>w1tAVs zMe@3QSw+5qemXOMoNBxV^V0hVd>b6<**sE(u6ZLH_Y{0PT{^7msPzkO3XAD)OSz{7 zJjM!_DFJv2G0ymRd@Rrd7Q7avxRZ^!x$G3o;Evrw1A}0IC~690VYTO^G14nY-{RI9 zuoQH0(rB^p{5FYtWAm3^Ko(RxLWs8=S^hWwF8X&Kc}$H90%Spc;^gKimMAqNZ&aH# znv^^a_!&*PahZ;X(TVTDP(nfoMwS58XsXD%CM!6h(&B}BR-O8Bgy8GvpIw&j;7c%A zEE!##DditJKlZ+rGn-0!o`)gQIbNfY4B~ni!ewoOpfzNEC6W@j@QH3O=2T_mmroXJ zt+D@Hmrs{^g zM?Yl0hUFw?I99HO;_b%353G(Su{J|lZXB+_A*{MV1WP5bNDNEo{d`_2*s6v)V6jpx zQHn)Ln8hv|0dFRd+2Pgq{&JJSS_In1yhc~dpKgxwt*#=es@0yD&FAIM~0I0 z)*I}d2F3Pu=4I#b_+salw2Lj}q(*x&A@E$A+PfyIZ7{kZU-`Y1u3Ix^vDiw}FH9PM zV22Z%7>=E0(j$GomX_AmwicxU!ERu%P}AJp;?Nn=P&d*UBcN=nBWUaMMbeq4F`8vT ziy~eq7Bp!QuRZL07dlE{E(`yR{8>gqIf?Ev3*a=**eH#!7q{ zW)CK@&-QZ9SnH|oKh%!;Y@f})FC-oFeAC~X|3QL>Qw@3TP{tbw`TfdgDW)p@d#rxA z@+jhaRV~mJAskR z!iq5=NNEb=EU41{7_P{CUusgxR6+my3o_P7Dzn`!D{A60Lg%MPrSHAgj&;i+p_)-R z^GcmK%uoN-?*~8y{VNt7M1-!4XyVr~VG!KXg387Fu(@56+<8hRWb1?-&hhb8rrfrlYf{X*enk|7V5uCkup$qE#?K&{Im{!YX)to*Cg|HH^2%C5*;A{?9hjY(I58ggy=YtC zWpG(_mx2a~*a)kRH~GtKiC4cY7Mj*O$__z|pW&?GqsFiHKz3-0Id=siC2tk*hfVo|2J+J%5cghjX?~lXjB1lHxS= z!u*tu6)v=9gf$hC@%A!nabuRf$c(o!ByuU&*W6mb;1n!sIO~Q?DcJ>;MP(Cq#MqOx zM=ou3+R5B&+<3j|_PFs;CUoq_`p4wQuknHq4{mK?r5u9B`Nf3K`ObPjG(HP%?0W+x zf2*r@gojK}LIuJ4JxDEg?=3{QXePYAXaFlk>lL zMlD|pz|V)MmWs{nH_=7VF@e-LJqf}$wr5ZPN>Zi zv0JUn@WBt$ZL2Gg*RL%dj-jc4y$0ANxHX#;e^f*}47*v46Zu7(UA9RaUw-@izZ9m* z)Vunkd3CZpZ+Y;|;1;dwFO~LY$ynJJJtPA2>NG@sR)Z}i+1P1d`*B*B4tvr*1v6LN z910o!1QNNPh&x4{2vt=lq1SeT>jT@-LG83>;A}Ih`x{0Vqfi3$Iy@~*O{xF*=*RU_ zC|Fzh|C3r%vPqi{y$?aqwG4p(P8<^-T6T2k=(14!m_%40*d1V5jh~)C>Pg2~1dnUAFn+vN{ajMI^3-Ixtm4~v4<4uI0RJ%|f8BNyDtQ-c9J&e1d zBs`Z+k@OQK{=50{9|O2NXg~JoQ8#M)nY@}@e%HsG>gxMZq57dOpfq~7T-EpM2_d&5 z*U6-t5LU{JWY??DoGiP?xVx5w3lZE z82J>US5zd>wlmk9)Yc^=n3U3qX#Jk6aNK_rX0H&RPvjWb-jLVviciDPC-Buhs1M?W z_(1~J(&(9EXC^Bz`4f<#*&{czn_sU~$fpXui^o0*Vzed$PPbvUYV_*y3i>in!*K;G+Un@#@H0dG+Kz zIk))~`erf-eM!&e@A3&LC5?9fn@B~l^R8|R6z^Y0L;g5$6aEy)2=t!>_4GSNb^l|3 zo+LwWJd2XORPFDo|Ff*J2j|#-v{oQdEYB7W9Uj;qBIidl_ zhhjf%PFrr}*%=7EhBz-=l9)`1HthX{#@WL1L^@yIdL_h%G8-Xp-bmb&gs&?~ia6Dh){m-7Ra(ob z!%3s6Mf>Ysu>UXgcTeS?cUhN{WW{2-6g~JZVVbm-#u$G-_aRz8b)pcv!E-taR(`#k z%?$0@^#-_bHLRq;*hwb!?7)6-mBqLT%8krF0yCH_!C_$tQP?qP2@B$|nBoe!s_Ges z^~ZUHDkSrun?8#zC0VTNPn>~^xV`Lf&b_!|u7H<%O7H$zD~*wB@C~{t9EVPvVIVv0 zTw`FYa(?9Oyz7yi2^@AdJ#xBYI;@JqzX9eyi>7o33%sUay7$-5*^!U{>*Bx=6SZnk z&e)~33Ee9!&WwY(l5q3JH2XAEn6pG`WxClMH_JDrjPKMp?Bq7EC65$b!@pK(bgQ4W zuSUqa9_6m$_hpV64#r`N=J)=}3b6?r#;9fS{Lsajd$@ZyUTa2p0|dDYdn|UpD9hZDWO%!snv6 z))G(#?t^*)RPJR4s1L6)h4I z9#y9=2WwG1xM9jkn}#6@8kfKqv0#L74&|6()-@p-N!R{1>1P#!&Qu8~DCAQDp80k4 zl}I{{BD4m2J!4!t2+qT+5JDUO^gGDVxo-*$qtj?68kTthR=&J^i38=v2mIhwsfK}! z>Kgg<$cvb@p!hh8tIwFqj5Ni_-v_Mu%9p>1vKQKW=n2z2<%6oP97*dQ2*{L#r#6O* zg>2mhqgYtjUYvrkw~If!8lHqsK{2jALp5RQ{N)>*$hGk}Qu6f^F&=T0X0^mUq986? zMdHMl6j?VxHBBuT{b5q^Ht6mDe;-fdMP#i684xOY_P46JAaZI5VGB8pQjwI%Y3y`| zeH+E4++mHKL=GH=#27nKAsY!rOlmDs{S9QBSQL$pkgyG|!+q3*DI7nm=!y=ai(ou| zOqZ9$>tGv9B6OO7h4yzxT5H=LjFXLf(3a@R*NDLXn?~jzcXG6M=}Z`b*aA+YMBO8_ zH?=xM{dm7a)YK}pHyWjloIdYWK7CB#Kj5>_{Nut)j_JblVG$kDUGZ}`{s~ij)XXtq z0#(61ygqq>=6AsQIkuQ%g1x!DFmk%V6Q_C-He2VibRhdtw*kg?bMuuZ6^$vi$Kx2= zol9u{qUu|0)Z0h(8QnnSiK0r+9XWdTb6J_S- zt58gWr0;cAClxG4O$cMFxui`dF|*MC8v0BP4H*J3b_SzCf}x>*|6RBUYSiF{B9=3b z1!}%Td!4nW5n8zT-+zV{QV@c@gQ3dTLJ-5t3JQvg9T1Q+NzKOO^LBGk%MAnh(=tBp9{qf?)Vtd*VGQaO_c`Q=x zSw2h(WNE;xZ4BDeqylnycPEDaYDxo{--Z}i%IX1s#&QVG(D%`Cq1vC+-%_aJK9f8H z=C_PcL$v0(&L5id^3}C|wGihN=Vz^$Tevy}9Q}$!qWsg z$NAE*XhSoDw__-nG3*O+U=!m59U9)y(OYq*r!DJmgfqZ8?$d^K8kIATh6&j9sky^T zTr0m^9%KcVH%T}4CstP2xHuEZQ#m#38vagI+yipfppFP*pvAIg*?+2D{=nBqL5j*~ zL$HIuU^o?c`Ck-n=5kVYmB#gNmDNK+gu?YOW|h_VZ!L}6mBQgR!{~qC$|;~XF5>X4 zix&DLY?NSa;X>d6mJ05OKC{lHv4xC!(p|WDr}LlpX*dlJJ14OswTL6YXz=IV%EdR+ zU;GLzJI+~T1o~6@w>o5&#rJItYqH|jFBGARulJX`mw{6TU{E(Vyoy%m0QVwmgq0Gk z^)FmJ9>o3aE9Md$h9%6JY=d6Eg4Cu@!|Zu9mZ&z6lImDB*9E8Sz;~p;LwT7?Q&R%9 zA{H%A^fA7AU9kdRQE)+CLi~V5b#c|ILU}L->7}AblwGn~2^8$+Z2`*V@ zML)NufK>@#)z^Qa);f|)ynl7v+{fW#>+rg<;Tx|lIngdds|78cZVP`OwTNU3E->r}9THk&f%Ha_t4cVu13*2gW_eKc9p@I6T zR&ebvYA(qd^=(d0!dwPN=`Z5d54B_n1E%-N1AcFPiYsbwO}!*cQ7UToIvklcj#?}? z+eEk{jw&*D7pV4!NBVx3cv)Nht>9pp_vr;_Ov$dzno!(*zbi_93>sCq ztJsJ(#U`K1C_nEvFN-LWx|d0;@xM$%mLDaJg`M2K4k4F;%>&f1y9#28ur>Z{5_zhJH?# zG(6?9uC{>jV5OIAt0kPJT=>j0$+I&sx0G#Fal6T?b+a27was-;x$LX0H?K6j=q;3_D7E*o(@ zlRR?)%e_RNp~n#utOKr?M018PP6f4URs1w--{7ypeS#n8S1+)Ps-y5d3*sMGbp=@nIWz&i|DvF8|>JAQebr|Z`tIZOv`2k zPQM9scN7E{mihx769S^q5Jv97Ug*}okKT9SUb>2i@L1E7~dm~GHd)7$W= z&2HiEGM7Dj)0UU>}uMf2&lKtY5YIYH<~xJOb8H+^5dpxv;R!GE{`qnb$Ei z8Mq1uH(7JJ$xOh$3VsDy3NZI!KF+G3u2U5pECdW-+JwiK808$Mv)u4Bg)ljP6K4!mw zpR9R|AL7izJH*=r)nRjUcvfb@*qafpp7(Dg`)Bi4i~rXDLX?a48)Hs`i{p7p($tw; zV0#dbg_l0evscep8lG;Uy>$-ix=F5BJgF79hnT)x)3VDYR+z{T4)7v+{mOC=z z8RyT-1a$77@FLSP{YiVnl=(ln5~Du9I;EB}w(`{B2EnXT7A`$#A>hNbcriZR_rak5 z>4WgA5UY#veYgV8K2efumD=Fsz|4T{@$r9p>j&^7Qt{pScrq6!@dFq_Qxna2xo5Q8 zBg)G5XhCVQy@I}57N;;h$0b~U6rMA&1Nh0_`uX@>vGm9gF{$preu6({pEiHp<$^e{ zoF<`(`}@>a=T3&_n!$aC-ea%r4Is>e_@BPL|JzPz=p=!LQp!Q1k;6LP9gk+eV1MU0 zL~^}7idxY{3@mCeVi5fC`�Eo53fd-;B(R!B1iIIdcW8p~aM%r;bv`+4KtJV;&Y# z0SPPvW_k-m&oGsML|2aBiewEPO{VbG13B|^8Ze5&LXa(Lw)-xC00aPpzpf4P*{R;% zAN=w-AcC9p3~>J{^|LXM%bvsFI4%+39{$|b8B_I-kr=~j(P~4C9r)0n#KGqA)8z{} zq>xeY%v<@N=qhob**`fWa%>CO#>Gyt*t?l;(Mq_6dSepq_uvA_Y9-dnC#NgMb@D|d zt!O1VeSEO_XR#M`0G9vUn?^l~F-kTpmuNHC17J|=r^b!t6f(kOjLmtqV|bU7^$Wn3 zo5QZ#RNKg0JBzF$+tN&xZPKxE9pBOoS__Qv)@_O;smM)USWkDHZ9eCoLgi}Tp{bLy z5yLadGXp4U(V!lJAlR#GwNRINZCA7dXI{Do9x3nalkr^cPkqB?{<%F+M0t5wD4Avp zY=0wqlS_d*E-#%5MZxGX8OQRUNuH&=N=}F(1-2nTGH>x;l~hWUkAUn7*+@ZsZ(MJE z!6)$(nO>!Eud%-?Z7kKu8@H9SB?5%CHqh2Yr*5Ul?|}Sc8Fz5bdnJp!6FFWsK2@+6 z0I>R-=DPmHjdeB6b43yCmKiHYhyQB~c+{S#+WD+9G#%x2YvgO{2SPp~L zwsc87=PrccxW$4KShWsLXJ9&pKzCClCc4{5?KH_R?!U;x8!O5FAyy-ntH*LNR{QXh zCQhv^thR|W3^W2i7I{<0hBpRraPC}9ZEcNmtzn?1hS0R8Oz`+mIjd_NTqM^#!0rN? zm*Wc^#@Vy7t;f|hYnI!s;!)R8gX<@h>vI!nqpLbQKf0w{`yPAR{=L%-x{*7sGDvsE z!HN0>X3x1rU@yupXw4otJE7dgeJ^WgwiHow$lNkV&R3MYas_mlhAdF34ycU2aiH3@ zC01|YY#o>S;Zxbu4}seqOyZ1X7hAj6Zvjs?jM*Z-=_=6(?nO#g`;F*LTw}Y_G{t`a z3U-_k>LCc)=+*ne9pIO5=QJ4Z-=|_?sI`EhVUF#~FEtj6;54p(cgEFK)znnc`GBDh z&mF7ft`v?q57B75Ga@cRXCvtllS6-Lu+Ql>lqFOiL08uSw@dtBcZ0gsC{poG52HMR z0uYA@fn?mc3@*I_mt4jNW^&*FzN7kT_c?HS+?~l73pJ zR}CJ3IWuqm#D2G_Wz-vJ8HATy215~uPDi|M`-n>cf2T~NpBJ1zT|LvgKOl#d)&HiEco+9R^Yl| z?^sZ_bsfg#p@-kehqr*dDcDVvxiQY>G0&~vN!L%Mb!WGZ%C6bSL~mluBlFI1xbw~& z0p=!b1Cz6PRN>un)}8WEg=e=CBppg$)X)@K93E@6Ntc8-g&G#6L*V6%ws43&p(jUU zOU(0Wm~4X0Q36GICf*qVmd0@85VL0vjpi%v{;gi1Vsg7nGsx};@bYiKg+abn5-+2( zF&fP8tIF!;GF5`ogoLtLN_tZa=!6;5C2{*-jI*k;>oEj|U=|I6X)rTili=03ojt&G zPQV@c`VE_=iEdp_3aLiJ2cZ)|ALMO-avLBZ{m$DnxG|}jU|_~ISGq&tw6kCOd?Yd+ zGr#+Kgo~aCoeU|BJfqDs+@LfDU~@$Z%J*47)nwp!kFR&;^Lt!i7j zu5az0+b`CVeX&VHJrTQ32&UO%(+-R4X05BxxFZTgzw9L1=lW`R{S>%&qs7|mOm=DO z#59@_%M<0<=*-;)yJ0trZWZO_VMdyKzRk|Uh1{@mc#Jxi;|PuO+5&lo*`s?|>^+9r zfxJ>*S%M99(82v1X~E1sGAgFP@~xhen&-7FL1CELF>Y$F$7L$ZtZyiyvG-+`nLMuE zaZ{NcFpL)H$6R?NZ6*2wzUy)zEx3~AVR9Wi8=Q}r^x;bAk{~9%SQSGV!hHqN6 zy!%tNVBD?MD{#F0qc+IOGP@I#%%5oa#gT+Nqv?T2Y#;~|4!o7Cz%gWIN@&L=s|`=ihHQav zCo@!G_WJ%yBONMwbIaXmte}2Qt)TfPABSz?!g>gara>Z5E_F`}u7`WXnJHNFNBN72 z=L`eMERTNwK5NR1j%rXK5J@nKrw@MIYn8JI!|F7RKc`zix)Qb3lDXOy0a|*VKd^j} zfGsqPa3r#$Q_n)v|9y<cj#Cd1`{w43n1*n)nrRNC9!F3z15D5pmtj30uf zGI%InC=rr8vKTKe!iytxRVtesg<_HLMIwaTYNVw=z_sw?HVEYkwL;$F4+K3N6k`TC zco5iw0Otgm;CP`}!0wIws&Y#|iG8RYd=rYb)I>GkU&sr$jsHsYZ%gS@y)|jPmdIYV zKwLz5zd(F%`2``>FrP(_K;{{Y42r;RGDJRPWwmVjo3p*8QJLcV zb|3GLcP9M!Um8xNG7Tdebpe$CAxtclUH4DPQ6b8VSLbE;%nO8ux^l?^-lUM%#hqfZ zG==y5w>6n+1R}T8PWoYH;UAldfTPEhI;tH|B~)SR#AuL|MJ8Tvj@NnZc$$Ju|7|Qr zjf@G#Qe4-_SiD(AW2QG)PnlX7E#Su`=I|_J8IJ*o!AhXpaUu#+yowDs=ZEXf1meM) z<32cU<}r`6QI?cfEV;pevye1mjAP6|b@f||Rnc!)24gc@H>hi9x*g_ilF4UnHzzw? zIA|b9S)q{R{$EvJnZylC8C$F_=V*9vc|HePH*BR$Q@_O--*+J$4)Q4gOjTu^xR}9M zLda8?cFkG%=hNFd0iQTKXmC7mbssWuAutF+Y8)|U3QBJ9;hLiN0%T&`=F-d{jlHs6 zUH|p<>L{dK5|{NXCZo3H$#~%Se-Y@~54RrK{@>x&{8ZPkPtt7E4MLcN4560y3ZP3G z5;$5cVxAw=H6hyKhEw%GN1hFlEmliOk03R=|IxwTKyHe=J*}iOrbPihGUm4FkSp0H z2Bmy-6VW_&m0AasKi7hu3r`VZrG+9r0uPtJC7)?K>WXRMo|&2cxarHk`kVgy^HvGB z0KmY2gv@1eOvTnwEqVJNsyXnm0lMH%jI0!THeCL5O6L^hm1=BKgU8Y^EaK{od8$3N z0JWAzrB>%-%YZnI0b1;3qa4>gyewNh@sLAi4U1wJ;8s3kDNmsRlEg~j!pbKcPM?zUmcExMDfl9u@6u_E##`GDW$Z?$_ngzW_Q|94VjNjck zi@@hKNA3bRdPC55pjEu)!oCddBR-YBxQ$MY^L>hL5J#7Bj~O5jq;i@d&IOR4IEjKi z&r&gNl7FkuvBrYj2lO#Z9$r?Krc5CR{++_%=zCA5Zo}x3BV}3>_4zJ7C=u39UE9JU za`H@AWNBvY>v<|8IZ)O;l6zDKX#xN~A&$f;m|fouf*xW}3sR|OvNd3de>n$3W8B1V zbnaLW%d^O~_*H^O)G?FwYo~gORjfp9uf-hTyk*(SGM_;{D+Ahqsj7GbwgAfqHZm)+ zGSJ^QO*pH6KstSq4O+dcm@Q`5Yf~@6BE^jC0-5~jWVYd@Hk#t_BjE1i7h8ygzkYG#*b2sRNT`_Lal`|9BK?zJ>OMBcWn37X5URa6Ek7sqkYBPX42VKK@I^<(MigOk9v25E;uY+M?VdLQ9;lmL~6agU-F$pP|FySJ|MN&{w zQH!DxErwRCIPnrB(n*?Z|2vILlBF=SNR=jChEXzQ$!29^=j7t%kt3H^9-n*#3i$;T zDHaq`qEwl36)II3ty+y*b%B{@z9n{=V}(HvSmtMjEwI%Gw)vF9jwH)xJeFo`!k2u- zeLm-*3^Q{JODk&|TRRexQVJ9*Qmlldj(Oh+?>VmD1rFp^Wri7UgmNQQs8preC^beK zqt;mCjE^3oV&W2#QqnTAa`Fm_N_h|!RWLXlV^mB|%Km0F{vt)r`_Z(wL-Y+`C=ZeeL*^f8f$Yn6r^hj=Rv#Vm8fi_XD2@kED$rI-AjHJIiEVZ%#jjrfQvnu zrjtA^1L9IA3zPK{nV9P>keOI!?U8kA=Th|S8CKbbLPN7n<#u7Q8GA{4o4U61Ajh-O zSFU-^`hD6dL0V6!I(d-l5|L&ABbdTu*6KSDt)=T$X67XpiDi4;ZK}r8gv|)1Ba^uR z`0m+Fbb%w8(Kw-}Cqjo=c&c!@xI5-HRGRdukOnqx7e*sD3A>&dDpTwxNaIfH@ZRcj z)4MzB8V6z6Y&K|~kp{f!+N@Ir7jsuyT&a)-F76iY6flDYQXvg&%u!)8xxuFE^bIb( zQ4jJy09T93jzG|o^1~1q+G8C@0KxBnlb~lpVGXmK_Qj9qqse7}!yWiSn=`F^4s$us#6Mcu_;pho0{r bkH82T%!~T~dOL3iZSfI!+IWoKhyte*`46Vs literal 0 HcmV?d00001 diff --git a/fonts/KaTeX_Math-BoldItalic.woff2 b/fonts/KaTeX_Math-BoldItalic.woff2 new file mode 100644 index 0000000000000000000000000000000000000000..29657023adc09956249f6295746c8ce4469b50d3 GIT binary patch literal 16400 zcmV+rK<~eIPew8T0RR9106-7`4gdfE0D43K06(+<0RR9100000000000000000000 z00006U;u$k2x2I17PZ00bZfi3|sWeGGvz8}4HTsSn}h_&&m_g4$s+7>x}(e0b|zhiFmih3+Y z_JHa$ux;c|a`FyO&iVK5;5haj2M0Us5CRDY31pB2cF2N2#x@CA?hH+IC$1T5oL#Oi zTm8l{f35!3j;S46ZTBB`{Z8%g_kYV-Npt*qbNf{)Q`HU6L<5cyhmJv2>TM?E4I!B; zTrs$#{npsIL(Zb)U1m1L)1HRv;hxQZYYB2DMJ06qtE=2;?F$=%RNirU)ujURtb7>?5s{7KnM;^!<)4(Fm5+BJ{pbl7Y+ig#pY8WtNs@R;Tv}Vb2zWA1jQzm*#o`3DI zY!Lj&klRuUKmwu&j_kk{H`eCp-_vbX8mEgy4^o9{Y;D`8bQQe5ncy0wN9SLFsawuhEI@!jD6#EQ9wi)K3zoxV;?`!a^soM1A0#+O2q9KiRK~gx40mr#h`^il zZVIM5HcJKuSG5?>jK5AE+syVBx&R<)q*ZxDgS_aq3?!Y?rd;$kJ} zznvM-#jF)AbEqu~X<-Qmg2H62$`k9B)$6!d`Tf6NKjrJ0h5H=%>B@|McT8H*%y`vb z(%rk>@RCE*6N6rnrAbrV{r!LUjAD%&0?-v-O(btVFYk|g>A9-v%&i0jKer!j?XGS& z<+bDDY`-WK+F91kb{WD=t*O*|E9?6lh zmQXXHp!8Y@NHBUw0BY;l5r$Z?jtJ14BAd4+e3v8LqOKEP;%_?Ao?k!C_D5stN`Qb#dilpsL~Lt7xl?!e&&4S2=E zR{2+JNlWaH`b0~xsXo`8-vLLO+@wrgzj0rcEa>Pjcu^EFD>bx0qSJ`!4s=W)SB7DX zyeW+chsOzOWsuXMyNTP2sw-^>J9!)tN(MreuiV;}0bNt7IZIc#j3n1`#guNA&>Xg4INZAV3h}GAY<`bg8ox+~@ zEJqxB2|yuNW{M9&^Gdu^OA0)0gm8&_rxmUklFo)kf)TlsEy77;Lqu5J3xzT2=~ME@ za^gr%^4no`_dRXwz8N{T7zGk__bri%5HwFB)V2_IUxXhTJ|DrhfQVmM{8&nc`@9M2 zXW;`Y>&Y(L$PqX$=~u5($l+$x_;fizt0k1976`f_JpvLcZ9z((ubTuD1zh$5Mds0` zz&!azxO&7(+3ute6E`Nj_ec=&1{1U*o(*p996V7+3I&pM9Hm+ZM5e<;t|LUDGl)`W z5|xe;way|M9U~b!dwMn`4h@Oc)x9972tJC&*aY9UL5<3vTYEF-@6WWD;D@_Uf_DBs z#D|;c(4t2%pcqk1C}xyQ6bnigiWNO`fSS0@6sQ>5_QONDm4#ZS})jb=GnDsb<++9`MP5Y5ABCCsK6# z1OcgPe*jTu&{d@OP3B5o+H(0WaRW7mZg_-({3&wupt@5#7L1uiz|q?Lg($F4&rmf* z$WS!B%X!n#M3@kc4ExS+zAZ>;>*i}1Sp-59rFWX)PddDH;Yom8c8+t70d+3;Or*FI z)w110%}-KbC%4S+y9uWZomHd4JiD)+af=)x8zy=(h%+`qq zmZ*8+O%8%Zp*R`>iz92bPPMa`3&xBf%8CvUVcQ{1?HmCwk#{g3!1tVj8kNlHDUYCV zCf$!chN=Cl7$!5g27GqiTIP&Rn~YVsBsv``>Y&5RP2xNK$2M`Sg*GAhZ2!et{QvfwD0HP(pY?U`~n}OR6++i?h=qBvW(Wt8fh;DSXe-#52$2u#kmt|A1y7QWd-)-cPnK@ma;NS8P8HC zHlbAow7S5)rnEBFW*O_UjP+T@hD~T=0c|R9ZnmA|9&rCZfhtcjU?kjR&?$Az&4KI_ zSnmnMm{_!G_h+6R0wTPR5NfxX2gN>xR`3V}X}clF^apfh;T(gnCpvu?0v`_i$`RIJ z+Ei@jh**$?k( zrfOsK`lg4QEV~?;Acltu=zD_V2Gcbn0mUMMVXrW?ONwM8CNz}N%W`~)Fa2-mI?xqH z!=N}Tl>ha&5U`|`{o@E=_R_WwIpVYF@9)~n#%%{z+rHfnV>?n^r`pF48%*NN(_bN4xTXWen6;A%fKBKh1AkiwDiLZ5&f>9 zg6qVZ=o(X4(&5o8S8@M0zKaYHDqr?5a=E zEK_S6$4%#%s)VqJaa^@Wc2!dE(cH(>hnNPUfp4xOAMInBCg>BMxNJH>Vx6eEDN|;k zWsNxONPv6#KWMji)PKrkuxR;KDvp3|cq2+8OEhoN0yNqtEY33b$_ElD0u4qA8=%$w zrdX|JEL;}($`?0GP9_Y4R3IJ4_z#+i!Z&M|Cbq^qQ3x!+n}|Nqk6ZrHqX!R`N~Ii4 zD7-q8SgYl}cH)xD{2a1TONpR}Mqp5s^kiCvHD!ZaZO|>_#-ti&1=q5@&qQ&tkVxIl?8Z4h|EbuVLwU+pt@owAm0E^WOR5=hOs!SOS zzo8!zCdTiapnT20---od64lN*=@I5;d^zd~UOhY51+b^!Y4-`-{PgMza2~SCY|?}- ziWU^4tah0Mo|cbXAB;O~U~nrmvYx_@S~m}jRc*f5oo*DLdJ%FCmh2w{u|@%=#s4LH zuz-N8_2!GfNKk?7&sfh5&W6yEVtNgvS5W`T_^ekX-cR+KtghXko+AH|f3eI(a$I4V z-$?PV=3h6i(*|nqd5=Qs328S_{l>p?b(wGOGEKf9drHgyIC99<0tT*Dd=xMLMALs4 zz~ZI|RQt*5Dw(pa6)s1w*#dg<{{j$IV{8_*zaddF@mwSDtR$a5!siYB!5jaZ_!2+l z!GLS2*Rhz}ED=hmEUj$0f%`%wFW>3wl5ON@gn+Z$C|{wi;Xe1gFebxk3{!{ICZ}x5 zy6}uB%p!i68ptk%+5c|NWSubWzH?q!Ur;VE7Fz9b zU#Y}Tf{TQ~*=rojW{X*8c9z>Wh+uZP19(*Xk5I%S6VFfB$SXr5>|bN|he758U|MC1>v`4Kuj+J5F5e=O??MH`ZIJS3 zP`wEK?CCHbTC%q?E3Z+e+Inww88OH?d&7t^n{C?>;U0gb9bD`y<0~?sC`A51fIQuP zjpSp0f+q@#eWQEcr8pkTz-BwjdC@XgWwYRfN`t%1My+#D6v3pjAbl2=FUT3K^~_X; z-)IRK3&;npTt)lwr~Mkw83e=JpAF&P2&i(%_q{I-9wNP6x^Hm_T*K$A`&v`qr72NI zAT#W*r374hzJySJ=EeRmYcp?SLp8c=C1gpvw7P9iNfD!OvU_WbrzG-%o9(0`_u3WDGFa2TGgpJ(A z$gPglL(;}e=q)r5p z$C&ZESV}y}fXdDSBS$Tq#l4Uo6w|`O-S#&P!yA!Xtd`P$;ZwWnf_d zCPTWG$P9uqtUnC)sO^n~XLTIotH33S6oNm{sx1*t3HGAV|Adx}?W8^PrScYg!g`C5NLJZnUXz zjkx(TKcyL9VuAB0#5mUJ^cW=&%2B)4JHSt#7w<4FGE9XwW1e2l#4$Qi<-9n(Ndbq> zDA1>pu#v21wC_<6Z)9dssviDd!Plha?NOTdBUG$;%&LOS#8SJ8^C5^_&O zZFfZ+rPymKad?K45-M|L>?8*G%?14%aRexz3Xef%&~Qze=aUy2x26^Fd7#`-@81lw ztb&CD#SN~Qv*+|TZDJlv{mdJ1`Z8c`e61a894SihH5^)_htbfyD|5`boYb!7d5Pq! zR8ms_BZ(+_IO|0h8hXSu!De&hVR?+DHYGrL-`$e!iLPP+yzCnT*EQIw``4Im5yIfo zHwm_9N(T2vHL!fcYXwbK=0g{+KuaGHa7D=Rt&>ouMP|TMt+SDjx^u%D;Rd=Jm#hm} z9Wkw}<4w!_DTn$Ikm2^1=n3pLLy%fyWk&mC4Rsr*wedJ*a*eqnZF!5cT+QXIuB=Aq z^nqRh;hf5^;-J|F4iAO;Fz5p{&X1ejZHCObnYNyp;x0tFGFc@P^-pPuARS#X41}la z#yzkwF1#5ge%dZk75)UGbA#BubbLSl=PDr;*tRIjd+`RioSg)Up-}G5_9TUx0;g>? zpMi;hvTL*62<32`S2^s&Qw-DoXfIQy)EdRo`Iwk1LI3r5*!&BPoM5l4OJgL{u+ItB zmksAdF5DI_yKMF0T%norSxNWfvVj`HgSuuLfgVuB4agXWSf%fQyA6PS&@ zYy`e31PHvlZF#G$W!A(?)`>qRFO}PE5OZcDIhQn!FDOp-a}^hXqpRj!&J>a5XlN2n z(!Mk8&{Vd!&@$hm3d65bph~~cv4oQ~Z^RwlU9C|7dr!n&I)@79of-(sss6QKrCv7O zxpQ@TB0lgeu1>bhD%x zCRsyN+PlK=A{E&666s=KU8n)e%ysM2HF5cvJ5=lCVZcd75wD7?DyNU~k{!xe3_ z_tnCtqhWQMmiMS2C^sy-OJ@Y}P?5BBJpuX_e0w4t*tTVZICA{oTg8MjI|2ReT<@7s zbe^vKsJiSluHja24Zox_G_e!Vd(NBFrsc6($Tp8sF4GPB*I3 z-Eu@eJc4}B>#{hqAS=mMGK@-w6FQUx@f3%SpLFYMwfyk@qxEV$psgl>mhTC$snT%g z!aD2L8J~qt^f)l5W}My7{l548+*C1aZlp`^Cor15-g5Prw%n0OS&R;yno~ow0gNay z?SR5dGgdLRJzO>oTJtu&2voqcAcdW`1an$ylZzD*N@NCwfmp}e8VyP$IwZPZt*-gL zhibS@3G3AknSHpHW?no!$pSw_E42yJQ0lDRgTb(#-t^#Ia zE>Ibs7ZwbJr9IW1RRfC^EQFfVvRg5+o7PM#nuosWc1Ke-jzFWWT8p$eCQBQ;CD9Tl zhT?vr81M8BT{U(Zww$@4*RRj$AnMOFk)9F?-;_TzMP~xGX=9A>3mCglYeWj$WsuiU zNG-9RE7zF$1gUDU9%95iXmhMHl@$ekaWa(EGKuE+@S9vMRJ(ZHL<5UNqzG&ILeSPQcPQVt0G1u<%snZ#+RfxNC5_a#ZkrUB z%?xOP5$)#JjE#`_iBGGZWsf{#N)0rHCx90dMT`2FjYEdR zu`Uu&rm;daO4$z)8~j6LMH?v#E)#I{z zs5<7Er7N#oLZg(I=Xsvd{m&%$&nUn|G5`w|G}#2pd3YQrG0>-^=R`JY_&%-pu#x}A zh+YjFRJZnGiqn4EeRcI}#b#10@;4T|%AAZz?0G-F5A1S+O>zHZPml=&W-X_1B<0!^ zE#AsNMnGUuEYBC_IaayCi>ZYCBwD%jolp!Rg(>{_6!PS|&gL$Hu1JOdY#u=7tr#H) z3NA(xs0}Py(t71K=N1WImneZ{RuMd94IX7EMK^wVD@88x-?0|n50D#-VqX9iqQ#l! zDa5$E{<}U)kX!$>6|2LCIRI*w-N88K_7c{cWw#l}dkq(^L_iq5U*<-{)2~WgILP7K z_&R+ek5G)t)*r%!8ZKHQk(kjdl~YpFHQcYjtIXA&#(vq*pdlp|fUzuQ>v_6m>Y~;6 zD&To@qjl#nrVluR^Y?geX0iv4@3gx3p9t{HolhNn^QF$d9~a*mRKQAegth8RSlfcr z@az+Qm5pu_U9r*(*6n;AElIu8B#K+RSt5(5bVcXNAU~t!62n+#3KywdzrJNtdzqVD z7yIE&xb_U&cQ(wcB-ZJR=rH`9Bpsu^N}q=tyR3)eP`67rnCFwBHGj~oMt72Z-~vK1 zVu%yZy+$V7nUJN+Z&HBjoF32xB8sz<*r;)!`*M*EIu%8 zc`n~x_Pu5BjKhR<1w>-K0n-2KPPFG>I9@EZ2^Av?ydwkIa;#J|=fgg($eMzR* z7;=_JQ|NZWsruzoiTeWVP(kKN9ppq4bAf7)ke|Bs*r1c5d&B9;!;+j-?=;w&her@D zMx1?W9A}feTCxkevkf4Xpt|sK=gn+>v$Kn$xi;1{E8kemsH=SYOh2+&MUN60iM2Xn~Y7jKc2U5Xo0+k%r zd5ib#1`h;~9|tkhP76AfnFkcAw+A+OPxN#DN_#Q_<115kEiIij>rv=Bclm&JH%ZWI zSS-zcu_Q^q_PVaSkf4ID!BE=!!}pNU8<+fHwXp!Pl~kZ77Qqfff2dzil)l>^sHmRh zXgjZ_?|%5ysW0oqONVkpCx4!6@z;-6aQsZJ@nN&^?|SPCP#^%M=`-E=;p|aQ<-9AK ze#te{Jz}u-C*t&W)~F?yWwoOpUft;-*@Crx2fb$9S~_VGNhwcaGp$D$jO(aEmo$>s zUNC3UQ;sP*)4axzeFOJ3L@P8srBr*ni z)Pd6O+$SR8-l^fC)>m(Pb^QiEtCWzQ_|PxXuXi>%%2(W}?>r~YtshvjMkuWiJ=0e2 zhd{s-QPjn&mG7Wai9&{pYYS!xTj72IG1q48Jif25I+%{V7bzbZthlw!*BI^Hz$J=* z2xcTSE^nSPlXWBDmo>e9sV|V4_p2dreP9HN^Zf{=BA>_c5D)npfym@NVreFH3=D?keIqZr`w&dacO7X^{_t`i|h3w&rbM?4Ygh8z_NKe+XC2=mWvusAs^1c3oaP1LRGg9fmJCCsoiM8Hk{ z?kq-GeK-B}HR#9R8u={aceaKl8e~WdqeDm{&X2cQO>l;PbxkvK{LVLri)cpue@s_@ zTX3Qa>Q;|w#^AaXbg%_CG#zj$!-svdp;_8B+BFc|(*sR=0~LF;9Nx2HTW71_@Qo|l zS_FFuWt2f8&s-L{@Kw(a0(OY1i^3#_^{ z#;{O{ZOc1lm-2h|hH5NzjoB@pkx#dw_B`#6ZjH}mEg#@@Vp<6*eE8)LcFMl`>@sxI zg1?S!4}~g%Ae0h^)=}%z zN8wo0m$eu)X6-UoiFzhERHF&73f5e{Os?)S?2Ktt_XNK8SFI;1qWqqAD2X7NG4+_? z`mfL8QO9mEL9b<@K8DymgiE8I+*u-}`?NEmSu{)FD=USIigZUfBpsHxzQEcK#6*qS z?|&yPmWqf8gOfHG5Z7xU#9{~a8?c_FG{er;F%yyM?amzMg8cqi~5=UZApsGcaP8&Y?H91(Mw z$c6i9TD3s65KK+ov%#w`$y~#g%mkU{G$5t#7>ZloW~Zmny6)uU?98-sLO7k5r^@MY;{$Wzz{lghuQ}X@QhpaIembKa zkmy(>5PDo?FaEjoF7#6ze)cuD^^Y16has{&kXb9pFep_&G$X(9v+Ntbp%#Ay18>Ru zY=u!tE$UhIjPfdHq2~izVH55|J5l<51`CE*7ompfhQHyf>|CDIdTnI53l%j2#N^p*b3Kscl1Y{iw>PjYJ|=C$+GBh=VZuA z#xz4fA-h;`am&g)^)!tUVl!28Y{5D)J{%D2N3mG{TdPhkF@A7 zNr?BAphkZoG#3u?dki+Bkc^*^8HzhW&_>+N#MA%=CkRz@}8}W_% z){c`*-p16tlGNq&*ysa2WJ`}aD2?PFovfb~IC-}+kt%m|WRaJ(!`emu>guNQ$j7O| z>~TdEw{j*MckNCNQc_k>tNY|j2*x`@?7GT;|DwNPjg-*~bt>jH{kxGq&A%6%B$FpQd&3vafE2R@r;eN}(8#7uAmyy}TzyHIh6KCLs;5Sq?jYFTQbzh zzp8C``r4tpy{cdk=d#iuUol@j1zchEOj5MG@zuSoVo~H*WEV_xp?QwtDeXF^n0QR z5hJ1>twUe{QwR7zPbeTH5WfuXEg)F{24iqoLe!ka^CJ+0D4>2 z7zw1DJ!mNTjPf9tRohKQKOS114nb?XNwGg^D7=Dfy0z(Mh*-D^muL^8lsV6w$1s}c z>YPb^Exscyp8=$@jjSq}G6Lqg_A_!T3tI=CY;A{)#`VwDk?1hY*emH0+^l$eJOq%{ z@Azj0W=$0;2u4X+bXc1}-zVUnK9YpLU}Bvo1x4nmbFd)^joUI*RI9D_$KU>{$g(ZP ztL=7rCkM@jO9*#j68ouN(FbHiDWfd-coEJpC5=e{;)z9zhP#9ZF;9uX`V=&|sT4cL zZw=qV>kz_z1?gdrdfE1Myp&%!XM+{qQ&IOOy?amRl&pce6rJM<5Y*Cr; zZY8FL=Q6>M(6axIO}wL);jH;apif(g_qj+NM?|jXlO)Ismcjk~5B~R9_~Dm7Y*@WD zQU!Hhn~}&g&hzdPi9;zi9Jod1`*chc8sTKaQZXPg6{h+u`FuUQrBl;_6eDhJHygdl zs_(9=)$PQ~yXS>uw;g^*9+9e%OJAkfnk9zKc}$^NBw4_0jHd0#%8WRYQ?4GR77xA(~^ z3}*F=HZ%>Snrq_|Y}}j}4b3dkIG)za?oe4@FNDomX1~6;Mc6Y(8Sj|*>-*trJl3W1 zsGXaGnz3hmR>8L^AnlfQ!`cQXD-ofZz;`^-Y_rd!%Tw(u0wt=)$C37-YIY@)Xv;5; z4?M!9hrBgT2M;;>{fm#95$n$TugUjk(3_S?0woZzG(jETU@xUiszEONrH|<*n%LR|;674!$p*ILlQhMnBQ&KiA3sBhzl^1Iz@+U$LZyjnt+fWb=E)(BYL) z7?Ld0oVcu6u}=Ts1eyD%MgO^8b_e~kzPlkV*5f@}*AHN{zo0z?0|JNQeP6+prgiIe zYcD^mRYkHEE<$c8^tTQ2n~Kb=aj(l2SOCBE3;?IEcFa-P)y2ohp0pg=JaYGu9NJj&n`G@w+dVNaqKc}$U2inV1IYR%RVG8XxLK6(lzrhn9fQT? zC!9CGkN4uJ|A&Sk%%Q^YG~0A5<|Mx?eh3A$>`h7)Tekz1-;rrc({r7XTpK0_U4Mcg zN62G8SO1^ev!sPT6{wBmS-*P3B6Kp<`9H|d6D(9`O$77xYkttm@5t4k>7;)Nb}F*h zn=;M*zrLs$toDvxI|Rc{^7!w9`5MV$s@6gCnyi!9ryJK}BciOT!eXL}bR1 zwFhM(%frGfXE1ArgbCZS7_$P} zk39=RXZ}-fn8%ATHtZF0^sA{l1*M$%qN&>@60nuxkNgWmcX}9`=(-A5F}+SF`pVFL zXSLLsox8Q=S+e-&!njj%SHjL%ty_=CMXH2}lQ@**HR^4t(=BF*<0ee0-(H=mS*BSk ziKBn9(j(1{a~tb?WogkGa*&O7E^4gTjEhsNM_LHx*xF>v?5x2#+$tt6AG^5QS$S-Y zD1iqsJ1c)FWSoMPs@-k?AzlF#@*CXe|6-cBgskZMHKMA29k-Xj>;dl+k<1G4r`ZO; zFS$hOyX$NDCB)2!wmVzYABerOQ1udjk?<>g=m)ZjOk$s~xKJNNUnr1@54(SQeep#W z`VtrRl7i^hl&9eW<40~Q{V7zylPZe#t zW}GtZ63s*RdLAlte|F7EyeNBNFm(v*r_9+mZPEFb&Ps09N+M&ET5?{Z42{8S6Y^?) z0f)cuKe7P#AIYNJkKJ|Kmo^`wj5mz(n~DPTIkc#P&K2r5>NkR%TzV&mI9KO(5#>aA ztR+YKF~ue#rK@E!(Drm!C7gD-#JbJ8b+Ak*S}sTi7K`SUV>!z0ACC8<)FsJX3CpmH zh!PPR#mE0U`7Z`PmU_LoBmTg+ zG3Ufa32PR;YI(#zK0H00SkIKDqE1&Z&m{WV(7a|J`v0M5NV_lN``O~UQh{m5kIUw^ z2((56zqU83UhnvFApZ?hum0!<#yLL<3OPi~x#p-L!&N`U0CXWLU1+-bHm?6e5KrB{^07#wixzbShT z#LOV>l>8y)rzZ=Wd+PuD7kb~>F4kW$$nHpW-=9=awfp=P!ll3;xR3tv4+oDtS-Ij+Om^sB z@4Vs=$ifB$Jw9^#yL5GJXHveOToPP;-V5c0nV5%On*mwEcHcZT81y2q7A@$` z1VplhAUnSKG!|R~*a=iK=8`0@?SNUk9)TX&5HY9@>Bp+Pp!Chs>!7l|b@=hOzJ{<~ zeCwe#D>WFWA@#@~3kRO&N?j+eNOC4Wb@a7e2o!P_&hQ?&wqRPh}g>$Z3%hri-?ekpg-wI_~0`Y=@ekkjuqEX9ZWMo*N<%sYY zkO!|gfFyUhj`X?o%je=74pG7byQQ$(6b9v@*HbGnc2D|Pc9pVaIGl3`>?`if3a)$$ zKp?O~ZWGGypg+e35saz7cN=;eac_GR*nkJ=X0y0x03`1?8L4$TO;nrcoz!1k%+_$lMsNUZG zsEfFYa+vmuH~fki{NtSNi26 zr;l*4dT^y9JmO&7Y(5f6>q} zGa)>ep+6elLHe8q4x8*M(-^C%{JFz>CHn39^#Cp`4IBbO*MB=P`5qU|x*PVgQl??6 zaVOZ4D`*tQDsn!qFWN~{zBGmwOS)^&A4_C2*Z{kc!sZm-n<37fQ{8x)Bp5J^L$V$i z6cu^{4w9~wy1{UX7fdy?v`iSD07SS^87}B$a1}Qzll2AbIoGc~58$GrZ6o{a`j~A9 zP@?frc4#LA^GBnisku2C!N1;vwZQxHV_%?}rAI%CfQ0Y&VBoTp(hqWqt{F&dKTGw6 zuGs6}P^6xDMr{wwalA;sG%-Q=5=b&MuAL9$g4NqaYF9X}1$*SFklIjv{jqgd81e}felRvCH9SlCWcp02g_|A$_x7LtN#*e*2Bq%z1k6zgq+R%SbEqXN`&AcfTK(YOmGbMd92PbiWS*M z+kz~>;W8vUV#1u7&xQUnm@G^u9!Up8EWv3ub9>#Cch^2XBdQp<|J6Ulg5L=7hg6d^ zloq5~{co-AYo2kmD~mw?V0DbN)R+0k{u}iRTUxUl3q4<|SUg6l0fl-gITSuH$Sk~^O zIDfL4Lp3M@9XzRM%aMH6AB44^Kzo>VV_p&6R+W+5mOT_yM@aNonLk(CAX$>f;^a=U z+?$TR^o3>`*5WW=%A`NDJWC~8O&awenW!c!DCD`iYyYIVbp_wLUiTEy($^^Vg11<* zd`Z2_O12EQ4_KF)X9db@YFjzTbwK_7sY8Z@3jovk_y=F z#-fjkc}76qxkyF9r?b$mWeq#qc1F@5X&9-LQ-4tW58gq*9mA7x-^UB2t&o{HGQye0b#J^gR)*Q8$*Qh&*1`7Zs}fGFAE z8E^cnlt<+k#Z0FO!<+KOoDs}ygIBt2<^yA=CqM9-*;j7Drzffgbnhv(%= z?n;CeYFUni40S$YM!)g}v;)a{#(oab8zs?(l*6T81@IrQL=mA_$jm-vKmB!!u{_e! zs2z69?zU2&Q0#1FUn;e0*Kal-UzT2rmhTqh>@~XALb9-qTVwG_n&PD&FN(M=9(&7} zg$C&VqD_XRC6o1(TN8R$>>JC!jXMCC z`sva?tvt#7n~U+=)%Y)k9L7RR!2}iCzgm{TWto@HenWOReLWXNdIe0Z6HV;+N`n0Y z5RT^h?t7V~%6P_HaETYrhaEHmW`EH56xFy_(z9GjaV6XW>cjGNGT)bs*a5@QqX|me zgE1dY&QD^{$H#mlZ3^megChz>l$dUoqv8OrDMG=XptagE9%9#~qN(}~Kl_b|qJk8F z2(n(<>M3$aKc=wGwY8>xt3Xks3U5-fEarz`^ya>t3VpySN)ll`CeM39z}uVGnd8eK z3^@_2yDa@l%-Mm7;_oSNL6Z>8E{%2(-Z>um5Gk5CsnGwe!T+F(u1e*Rf38bY_j%}{ z_oV3OtcHO^jcS>6#)gSr43Ix&<;ho#kF+VQweOea!}%5_H5!lC)@G^=577CG?klRC zvD!Lwd`dMJd+{Q4@j~qlGoD?0WV$vDL*h-6NmKnch4fVk8)3Ba3SbvS-wSO`A|}$X2$;)I?G>(tl5h)MDZDz?PefA z&5$$ruWg*OY;FsBZh!tGen&vqQGG#1sb{H2=HGVU5?TJNC-*60GGB&x`CFRo+(e#ch# zW3OO^R}~uW&AUG*sjQijcF0U2g3Irz=}2m2JGg>x8mku{d|nYt`Y*g7roy*F+d6I(lM z+3QDCrhU6-S#P2HPktnAOb&MCTtrX=_I3VuUl33*33Lbyh^sIpCClR*KbVMV=*p(d z6IPjA$)GxrBQ|0aOZo-^!?N3xHu|p1;d9!)S=e$j1!mF zZl9OoWv-^D?#|2RGB!jFJGtEoVB^BlOXx#wxbHxf5o+6VF_}QrMUy zw{Ez(s|FzO&Q3BbV2?CeH+;WN4LI(uYPkxR_K}H!@n2q1hw88ca03LwEluKHh5e7S zl{11}QHlMI9x}$qtbtmVUcE~fAI`gMw?V&pTRhTighe>RB7e3(JE1c;zKYeqoqa?? z1Qvv8Y)>9@AxH81x2fq+FZ5EqN5-G;Sg_#!8SKd>i~9abJr*`2{Svg z7X;7c8IMTXUG0m*crb_ylC(duxVW4F28FJLV**dpkJ=qIJY{q>3fekwvq-tecLm;n zUVPpSO&qc;z?bs7;}vawAd%q3oaxgqJFXREF0QPOZ=FN9q(=Yrj#N2^!Jj%r1teW- zu^ec9=6EK9U_r1m`;>wQ6s)L~!7ZIBE>aLgSiU*wwr5b5Tejz%KcCK2@)7btj$XFw zOmjT}!F8rGQtZiEJLO~ZCml95Uvvlnsbm6+7?pgOc@V*7CY*doA%kk3(Mj15YSLe7 z6SUP<7Un826>5H80R+vNFhNTsBomhhErc2tIhb&FS-vW;%dLV1saRRY;bd+m#YIg< zF;b#sZ^FP+RsoCJbn`G6Hf9t-24xgUh(4s3a*D}Vp*pBRd<2!*C9Rap`~TYL>Ngzap7zOP~KKw;VsGl zh?d`DW5ZnJh%60Wga8CBKjpP%em6tt{S_0Iu^$3K%btg~(tG`j<(|JP0%6cw5Mc)F zz;uU}8x3iW(82y$a~}7!l@_Sh?(M*3a{lQF-K9HpZKiNb_Zf~G>SeE6b~H~%^|V#C z(^F##dcVH=G!|*?wYm07;YK4oE1kpgeMh=p`3)5N8D%amhuF7^Y#;2GYx@MiS9uuASL`vFHt(OcSrWFLRJcb;dLI(s_+{G7h#nYyemTSDnI?dpnf2 z&K73CRF3|Oi)aP2qkdm`QVa&+)Y%#HAZa<0#ReAu=geD`2g_h)??q~q%mR6xE?GgG zm#q)UDX+1`#@JjtTx&kJh=S^Ev9=KK_NzQ-(I@k4rl{fJj56?l~7EUsyz^LI7zo6UoZ7>c<^96@cSc z32DO`o`jR5uqwU}=yEUFm95emI9kRT(FOKt_Lc!Yf)kR#{0KZ(_#@iz_^}xv#wt3t zUf=U4;shGkh0Kof{+Cn7ymt}bNRpTYMM_3aK}p5P#4M9V7OQMFb~$n%((kX6OP+jg z9t8>&DdtrogeMS5WD1o=XE0f84wuIl2t{IvR3;B3O0uGAx?x(j<9Y}pBryq!l#HB$ zk}5n%O(TPrj-G*$iCHF#ELPcUb>URb{wbmygPV_a7UnVQdi@x+S^ev#MKVip)try* z?^n;7ZgsgeVi$csj4wRWp-D?D1O>iV=}fb0>F{=-pTg@6*|1up@(uT9+@hFVlK^Y` z-=0c`uTqR2p8JXyyj!rgeBJt262GDyc`M^%3yZnhI34tsG|h0hG eto0caMqseOdLG;#8C$2}qx2NB2Zcf*0001K|EysE literal 0 HcmV?d00001 diff --git a/fonts/KaTeX_Math-Italic.woff2 b/fonts/KaTeX_Math-Italic.woff2 new file mode 100644 index 0000000000000000000000000000000000000000..215c143fd7805a5c2b222bd7892a1a2b09610020 GIT binary patch literal 16440 zcmV(}K+wN;Pew8T0RR9106;hZ4gdfE0D72I17PZ00bZfh;j#meGGvz8}?&GBPzE8 z1u0OUJSyttUiBVPluy!d#s9|yDnr%+PdDJI6W~D+hF7dn3876mx~G$_T&rr^uln5x z|BT}}4pu5P3e*HEr8*eDNTG<1F_;U3ZA=tqpJ7vDW=sX5YRKxDB`FY!LZL8@ z!bX`TSd8YAvLOreMkita9aZ$fQ$*@8r}n?8&fXI{KJWmoXc#0=X$40A*07 z&SI0gyJXs?ugX_CC|r4aZcQPu+bcrpYg<7f7bmfQRh4#o+@zM{cG#5I0dklZ z)z<8ItFoM}%JCB=SLYwy?cof?1GGfhVUk-3A3vRct*O30o6@Q!dZh;dM6m*cJeAl!*4z~IaFs+R8AEDeJOU?u3$8JXqZrnAU^RPh+F zU;a;L|F-we${!dyOb=Y9sM9p#JJMP+Bki*!?>>9v2ey3PS!?%!*)SOVy?*)743p>5skoe=iCPWL7}q;e-a9(G+RBfkb0t=i8_N*+ z7_N0U_z$PkZB<@dmg^}j2qDKj_ZiD2E{-^a@MxAp%Lt*{=gz|MvAU+<%dmy%)1*fC9?>djP?CJbUm!@N*vrK|8L#IrzmL7}7602l}4y?RTD= z#6!3r^5Ona!>#G)S?_S5-S-FtfgimK1aUrG4ns(0(V#gV^>8f@hf-*su5ukNasBL{ zgLBnfJJ-)mbL-qOFU-SP%s=z%Z}%T+!EL+v^$fiHW#`{Ax6jd+tNxX~{?eYf=hVw& z*ze|P61T)(fBbU{mHHA0(6Y^eWse?T|L=*6X=cUCf~xpmtLO*gUB^F|M`rr)E7$la zYxyr@6;nP4W&KEj4@Z#n<^!?2U!Fz#w7-M}Qudi}#A94=>6^>8v6fIfp`dgF1SA+- zMF4VjQ4xk%u@w=Z-$gdg7Oo{tgy1r~(YkCMCt-eDf?_AkHuglXmjgUD#^7k|E?Zl6 zkZ!J=UPd7!ZlHBtFii+0{EiNC9rFul2FYaUfe(V*>Gog^dhqy^X!7cW12aOln0e=^P-ZnLl#qLQ#7r3Oe7La2?Ib8(RC|iNyUMS;^To8AQ{T z4^tCo>P4-BzB>=fh~tcCt%`h5z;b}#Yy-Zdz@325a-~Rkv>^Ddl0S?_08q|KIX^0OZw63{Y=(8w7`DXu%dD_IbvOuaQ?^`5OLLx#r+`^All1Y!=LjPHjjUZ(Dp zgb7ocC>oFviPYQ>j!@}K=0=hMsT*Cg4dezXeE8-w`qSwRN;+9?E?sYJ`43;$fw6Ih zzAS?bQSEn^qFn^dk<1!d3Wv+G4HA10Yzc_OqH+@RM8l1DK31X;b2wyuXhR zQ$_;t*sEriPL;ZwM)xrDbaUh%C|B)G(mnu_BH$_g4aF$bJ1Kz;K_)cX+JxkLknZYU z%33bcO~&7q5}?6^MU_wxdH5NXqCVeLEbGxA;Jj24@f-8^&8W-CBQPQ@0WaYb~#;VhN_MJ#uc(}5AUf}sGTxH({yT2-N)^ckVs~?s*D4EA`<36A9?my(<&%KFXS=y6E6kPfC?XXLmg{T zFtS6Eaa=Re2s!@Rii8aHK?7z=loVctoP2p+MDnl=(KHqo5~0q=XC^{7EhQ&6te~HonR+x@XP0i2l2`P<@ytx$c>rN-x34+~ zR%E~3A+Rzh&YDX55K~!?3^CSpSsjj?s?6T9AAMSvV1{=l-79 z{}z*4CT8?u_Qj2?8Cx~;R>?wiBUDjJBV#o_&s&*0oJxtnI*)zzhXeFBcTcm2l?-2< z_+mXW1WEx*q0s=AUqIt^LGqEH#yFXqWMLDgb->0#rWpeSjXfq9faDQCFvV1*fjD6q zQjk3Y2(~cIwqh58iq>J<41o3{RRMA{Q9PIdCa{>u!X%cG17nye)Pi~hpvIzfAjX(M z3d|z_Ef#H)!_bU_C+ON1@GNLwkS<3xH}pAvV^Q*jVaTi34`d0r~=9C_s+eq2XkOvlT8@xH<~90$?vd9{SMnw8qOC zZ)2VMApk67^bso@_8zpx zArSWtf~+r)b_qNT{^^)v76(T-|u$UBFvrSsBt2{0N{Ly7_xkhen+2Q4Ml ze^vrI#GK{-EgR@=LVZCfTfvJKQ^j_QDQ1I$3YLz!)GI~?ZVVUg$gF8qs)DLwt$0k4 z?(1mW_`hynk;0)a57G`Y?q%x4W#WpV(uo8^rcWpi9?|_k5CRA;b|%z6T|B*l@uL*Bc|%h3CCoWzZ^Q*TB0sB% zJOro3q>vb~wA>$umX)$Q$AWX`zCRO&GdTu&(SER{E%P_9$Th8MBq!40 z+~t)sk{fPo2}J1;@{@xoTh1q%JsN>(7A;r;qv0DPByIIGHs?#gtVqf9kR5V^C~Ud@ zOImuX_*~ekSJbb{6>_S!N95r!OQb$Rt3!5Lat_hl4iwUl74^$GmqFuTv1^egSAEy{ z%=j5~=PXV6;6VG$!;zun!Usn2iGweZxSnXggVhbjVS6_ z#0X?d+Bj(29rr)W(@e_{u#l)s;G)LrDpr<^3@QQ!8R|_AW;ma%)eXl|G%u-NC6NAd z8d*K-k)j&ZaOYd}tU)2xy8j+CNWDmlA1#;0?^Fb!=&2+ZkC0LI zDg}%AWtUFk%d~)=x$}^G|NYjM-pk!qllU5~)H)-I=Is<+XJ)2vJ|?L`J_1MX z<(e>u=3U>Hv)@LRZESS|`7 zfz@jFVsoQZewlL+ef(?kJue}or^cKYuW_JR1finE-WMo+G`v|JzmTr}C7b2q@o z5b5^)@?z4NErhiTZbbLD$LbWK+b@&_a)$}lyP_idId<$qkb|5s5cZ2luS?lVKW<%m z9_ANFkG>e4w+TtI&L+A+SGz@BihmBnBJVbST)Er|(BQ-2z<#>ockEw6B2lW31cf?+ za)W*x8D|uG`sQbw#nOs%n`YaYPTP(g@Vs!)=~VGU3vFbw;0*WXzdM^Zlx;V4LTVja z!KCd1jaucrxkKl6UDJkSZMFnsx7rkVy^hCKLQG%1OPwUyd#bE%o1aGYQOE?F{g6QUrme= zF|ud}g2WT%(49R94K5as&Q^K)h-;!*qOVM`X;2u?8!ZPH19sSScYSDth>q#MPd%upS3ky=sk`Mh z(XE5vXzB=QiF0$ebkV#h+T}984i+~<6kQ-TQNAn?5jT+0yQJ`7pzUDIf`6>U#Gs#; zdHgenRu`dES~}{Un~AV#*;zRV18GR++48X!{5$1<*HH0dg?fq5yUFN zEw8`qbr?jyrCH$h-FRw|;Fl&Pw)OH=GGaEP5aoQLF>e&2ILOKcT z(hy~gs5vhNCLwHE()|0#>C+)_De(H+unPP4xt*BsFuY`qx=Iut?s znr-m(WXL|Z1>6FXUMbW$Y&sCsi{a+{+Tjb4HoN2iBgv<%`G7t}Y)^wyF_v1@EQp&5 zOLKuZh#sVVEH6{mmJ=Xv`V|oKY8vWzJZD{W9ulS`vNhv_3XB<(vLuBtZ}h33I21`Q zCaEZt%tJx(A(A0fJW(xNs8GV;G!{Qk9<`Xu^%w0dPh}v@Ma!XXjY&{MJjf_rj%uaC zi{Fd=vSoe^@~CkwhD4Ye_Z-G|`K+`FPFMteMyt9bckuE?RuF3~wMTL#)C?FXcv~gA zF8i#Ue{YCirT520k0nxN7hb?HmN|D;b_)r|Czx&phZdH$FzD-Z8K*WDiUZMG!`faczN6~&{m7t8lrk%|--?}Qgh>V=szV>owavKfyPifC$A4d$ zx7)eisC7Sa1*rYy--;Qvol)Bd4yDfcw!I0J?efIcCSsy`7c_7WciGYGFk&V&`$C#N z7_QrU@H9+5q<+>gRtACNpx^lyU&}(m7Zij|(W=@P1%`{;Gp0}3!3Ry}nw*YloTs#= zTf$wR`m-w>Psg}P!qEsRRgx>tF(7Zb)yfVn3Q38i3Z>Fz9U%QzskIDyF`#0|20i_l zwCuIZXO+AJC%tN}T&1!U=DsaQPYZN>nm!E*3{Pj}0(Y_%uT#-s70BQybMU~VDKY(k zHUpd2CzOdL5vgs&Ytq-x8;|TS>PcM@j-M2%4NOwfdj1F*f2sRh%rKC1b#LARMUe|qO{0Ko0%pSdyaP+VLaRN$o4Rp%rxpD zV!2SihPX6ms*6cB?*^sR=_6ArTnKcCUE`6hF0KdKy5kgUDOYAU9>ybrC7PB9#pymL zLRZl25A~le+WwG)P_B$y5?Oz4d`!B#={?kK#tzON3 z`#U;z(qhxkzF52{VRlVZFPkHy@`9s*n6If)l877^(=RQ?ipF-5^4pe~iOX@LftspK zbryT`dvOY}?$yRyAp?+EsV!=MsC{9>51ymzdQ*Omh*ub2@|r=4bsGDrhCzrs*+>wX zcM17|Z|KvCWlUQ`{mfyri+1DXou6s>9j+cz~ zMa~0wKs#E%zON(HRv6zu+J1ax-We$*0~;m62R)lqoQIQzf(QRy+U-~U)a4tI9Ps>kz+<=}^&)1G!1oRR8< zn6ae@RStqfA!6G37}ru*@_EOcg-1cPQWhb4;S zw%2djKG#&Y&ZuRqOp95e*|ilq)s8s^XUHRy44>mPOP93G>yS=K#W}5uqRVifCQZAK zmER%#J)FOxmE5>Xj^pp~Q^&7-OC$%4+G*_B6J~fEE5~4U%vJrDu@EktD~S1-N+^FI`FG_?ou%=4qI#SNw?Z1{VVe1GkimR2V+hh zuiszKUo1T!nwg3a?T)|+t1bw~*_3mqTB2d8oX{%(Vc+p$yeom+9+DVaw^L`bK#m*< zXb!k=Qz=-Hv9s;iSw2Dw7FM;K#Pc2Q%qqjcq~{zKy#;xfiw&)d9nnlJqQ&#o8>7%+ zUNT7ILRhDQaN+GUw5@Z2<>|TZ^1&OeJAxC|KH8(EjMIFJJrCprKKdY)kqzSL35*Ao zVKh3lilu&5f2VKj3Y4;BGBG8Ck|LZ$LS8i0VIo}`{3QBslpK8a;bw&s&%lgBS)_9K zVj$3R=sn$j%%*#8<55~DPd6OQk(gc8@g3gcoLOnmn_Df*OH2(nrF^n!jfgylc7+vM z29y7DdzM5D&@C>85kqp=%xF2-T4E0}vqLDo#E~G@(R2|7G#6H0)SapI$P^0;l&MQo+Y*r>QQ=#QX2|-7F+A=@ zF7-U?7%>WYq+5Md!m($K#_R-z>EPT!_9P$;Zb4u)jA{^iCLG71TiNpY-X|aoB$qXC znhp(;Ezub^isg5v7^F#mto5Rt``6Mjk$zofjn*1v2E17d&1`fm~T2WN=cVm%p0W>tELR)N-Z_ZYMFtr>)NL7U5Kw^3VC{Er45QaR@SGJp>Dd%GTBy^>(?x-EAin4aRXH z9RTfn)aG!^yFAB*6eK_3dOI!H$w)>rkSa&izm5-=@CNOSD^M*ek76#FFbVn%O=v_X z2*~EFIc8#_->|KG_hIclq>~bir=S9Iy)(xX&JVIWiS^7B=|3f<4CL+n0!q)XU-_S7 zS~=XsF)e`1O@a0UX96@){B}`LM-h|rVsRhyp zGSzLSAmCMU0a}H8BKd~8W=UwXQ97!5z14mTjk+S#e z8=%Tw8Uz#}Hs=UiKQ3purP89cEV5hWv$;h0R2urWkB05;EXMM5{{s3tYipv1LD5_n zobT~Ix96w_vb{Few{B?F@XXXVue=)KTOCJ-=M3l`STEW*)+DHN1>}J_o56Vh=p$N( z7|-tWQpy2%)#WH}^2BknB#HWzlO$0hqPs!73(%qxf}B+P(A8FO&DA4yKs|_+G**mO z#WQ17@9`*>byXP$JFZIEj}fa!s^Q^rAQ-*0HY*YPZR+(T$R68%9)SQ!$Vm9MvA@1) zD0DTI_>12s{iAw%!F~uE!c?%5-NX2h8~0yUs9WdnFaPnnH1(ghOx>Z&V`w60(n6$Co3RbQ-yCf45{m4vKHYTh( z8Fu_oR)jsZABuyWQ^hA1gKkqftboT02uhC@mw)%rWc|C2VJZ5fC zv^UZVMA?C_T<&0HdifRjwGPE8KR;#H##dX6dg1tY=L1J$Ka~nJ!BF~8ag%<{tmJ&n-nfvdr9Q4Ow})U^;J}re;+F3wdjtkl^mBRK15KVB{$!9;TB}{ zMV~B_5kBwfkG9;uD{jnvB=mk=2#^0N_S;b7v%t&q@x+6uG}wFa60gx1Ssd%Jcv6BL z=9q;(kdt=+RU((C_q|w^{1%4nsVkts>cd4I5(|AF9_o*Wd%|z=D97Z+2OfHB)<|MG zV#0TEdAhl2S@J`L+;=JF*!0!)XT0}6>#X-UxY?Od{^|oR@tB5ET<&u@7FDGpuAGk^ zi#gx2PE7E67XA*)%Ck+vDVO3Lt9bv65Sza@FX-@%&hgvwf(^vW-@L79ty=VL%RLz@ zcuDvYTrX&y6E1G`4#%$lYh!s;Q$?}r{j*Qhm~$VQ75Sn$qP#!vD9X9(!eAeHJN`FW z2k599&!UA@lt&td|I03Ep<){-vJGegngA8AVr@viGa{l=K(*wA`0u}KndG&i%P*)Z z(NezZRa(fi7qtF|F!s=$e>t1muNZ`eaKmaqx!hxzuv?5O_cD~z?}pYRFNXvJlU_5| z+U<+)^W%xS(wM)dp>724K6BF8=Lc|ef)ipI_?4J>t9dwND*S&>24ap#Brg?HHGe0Q zM>oej-f*!z|Er=z;}is&b`oJSjE;q%_HG~6KOo$8J{?;UDt>EeLDjO7Zpj8d+uq)r z#=9l9?H-L{X;ZKN#%}LQ9@~LFQ|= zc3hrT7}NaWe?vyiTTuwH25W-efH2!~P(C_-!jMG^+^M`ll&5+F$SLsv_At=4L5$e4 zfr_S3Q5Y5Qs&uheVyj!4A=fwyaqA6prAHFH3;x$(1;TKCj3@5rAvG82A&`u`dMTsd z%mzvg>kMne$zxGf9*qH6ay{l}rw;AEH2xgQ)SeOha;Kgq7f80e+}W`P!%ErL?_W;)n)T!WP#UCdjFVyk||J^rnyNfX5?UYQ?nqS&yy&AzR<2 z%s{k+rJTM1k9VH$n{-<&72iVe-n}qV@tFiRC%eUSGM+`qwppZ97Wh(tkZxLZlz)7h zq%7O=5k5NpvLOO^`9C z_;Vrhasg71cnPci96B@^T?W@bLMHmqrFu5PGun>UyW z>UI46tB}E~-L_cZV&&Akn6?Up{GRZskT}mCY~a-!y+B2AFQ3)evN^Vas?<43}z@ogV#Wtv3erPGu!ixxV(CZR{gpP++9 zNkP6y-Wjme+F)XNNJO>(BbR~*N!HSRwBm3h4!AgRs!r+>%dYQ6&}$8^4%tG`Lwzq* zUXc0B`!;Sw38Mb1?3AnFe|@C^v7`;PuPRuVYbA{T0aC?aB54R{V$hf|$%lsl%R~{R zc!OAsA^_~$quR$Hs&u-qdCrVP^I$Mx_Z6ke7bT#gwB2|AeNYfec6S>+7%zhq8zbe@ zvdw|;{h~b$I70%GRVf|Sh83W7+sGZymM!RQmWVsKS;I>Ngc(J3t=oki089uXWH_9Q zAbB8z3xcpWHm@Q4x}zxKRw2>V*v(j9{ML#TzgF~$RQ(Gpr}AM1N|PjtNMo=@9RL!k zKsm@T5t!NED5s^yi|v1{dI8^wu1HP|$w%0!r%2nL9?9hH61&+jbj`Q@G3hdW|recTm_>RYB7OO9%n;Lyn!uGQqJ zC!iDOn`-XkF)GEwo=|WZ+1&$m>85n6rO9T7)9?l=Z1-*HjzOeL?w1#9+G(7J;A9#a z3kZtuB*O>sUCkmBAN}MV+o-uhGeVcnBb#sea?H!;0S1FNKVh(auzN9Ipu`64Ghx#< zm9xTYw0zQhvY}|nW727XaWd#$UgT1?JEmWft{3WuGZQ?#AX1AhI3EyDd$c_5l-eZJ z_q-ER$45V^++Fsi}7_S;Y=t*v%J- z4T@RSmxSlG&)vtvhV|S=m=6*p?k;7Pnq2hZhzP?$ajkd{4UR`)KMI3zBXqe>Soj+o z*Bfvd@{|K;7IuwEF}rS`j{H= zwba%NU;aAYxKE+*l_WNrjE@(^i#%ncYaLOci!U0!?%u4JU-oHM!U!;g$6?oL)&lc- zqYT{d7}}};Gy#FYKGQZLcxRZxcsfHce0%#nhR%Uj5hBULn68}-eVH13Z4*Es7+|J1 zA;e8eux_FV;+yAHiYLAwI{JfiLm1kgkMd8vdfaq^feT;^W+0M7u`9Nho+(SM9Z|-6 zHVbnbQ&xuvVp`}`JtzN2;ZrrbwrjTbB$syz>v*JsRC><1p2PX;;lDaS@wt-ov<@q{ zlZ*o@O!Bj6A*_IDUII(~LvDqv-j$hDfS`8Xj zd>-Fe1GO`>9C6G*%3sbaV;qfmUxo09NaAzB*XkC>EuS%b?se=cx@jwu+naW29mVTGWUv5apKR$e3L{9Nm38p<& zS#hej^*-FXoD&T&e}SNk-t3Z=E>Lr=|0eH2&WwxtEfQHhWY8yTyBKORM~D(Wy!dPI z=s7Sgq@M$OfLO@S&Cg)AGEs=!z#q7pX~>s^Jj$85d%n)18dMJ2Cz4+*m^sb{7q|n2 z_^0YiOu|SNMVW-xr-e-3pRQiCW_0by4gv8KDTFo7h)5cSmEOJ34cO&g5$Gs-W?{pj zxdW;p^(eMP#fs1*FJQdz9qDnx7!8vd@&;jTJ2X}=$R-taFv}nSSO_xLuymHc6Ico3 z7hi-BxK)+{ruHS!SPahuHL;aDXGR3r@vV}$jmp!`-4>+l(=Gx>X&iO1>5GHL+PMY* z8ABzNL1^?DIi86=` zZ@Uxh5(2RR4>JJCY7QM$AFZrT`^K)mZ;|fmM$;-?CvczkoYr9sA7xFMK(*2I=Rl$w zo&y!{k!CY6?NBXIxu!2FjfTzo01+Xh_?^9m79E|T$=cs05cJkOQ|XyQhNvuXSR4Cz z6)F31v7|Dz6+sssvs4^-bBQELF3oMV6gUgD@eRXu{Dj2(&NQ~%xFE;*`84f%B%b6l<7UJ9`cnq+3gy1~;Bn&l@e-&rA@JZW(NceL zk;1v5;8H>^nH6cpujHjAjI``gSL6pf_E4)LtD?40@@XYCEj+0tVP(q?-vS0Ac_=2G zZc=5*n+^8r9ElI)&*aa9g(^~d%LB@^Bd8_QK6@nXvPo?u3p##+n{j(u-J&M@2~CNH znh?C8Q;Y7uJy!sif+UYGonEAi{;IZsmw0i63h+q6^}Of*Ie#?-zMWU*{Akops^|gQ z@{>tHdWd(-`c`zbb? z-+5sW{%80E}x1sKoUb)&XGH(1I5xNup z8wP8#Q}58CRE|<%x%p5Uu%tALpg!H?`>O<%SHB2+*k}R4!TiZ!Rg)%H^qhivXeOBc zVJSEEb+kQN`L!jw(6%GnEb#FNb)mF<_pW$}<6|4e#uVmkR+8YUdQ!E2@|k)%hHKd@ zfoXj)g_eDH<8Fst-ZzCxSQ-_yG{t1f;k1m)fZVA#m{cw?9lRYj0OM~je%0V-l# zN(_u4;?{|mb*La$C7ueh%;OIAXi5be>S)X17SSZtNJdR?Cyn!-;>S}_J3tiPnr2(* z1O)mVv%s5Zxp|>aAr=zb-3U(bQ5D_tnB*fd4~gi5&C^`%9jiq)aY?=X4$0Y&=wXSW z*q;f;`nHA3)6w&kd)*=_n=AY9y1m-f#_h3F*yMHe07Vx5{w&}K$nwRx!iMu-vYc#w zi!apuOz)=jj^eT%ucmtFAS2bjq9WXc@q^U>DVi+E=`>T{9b9<(jZc4I5fkbf*s}DA z6^x+{+Z@c(@O?^q1L|oWX)WcFYc?Q47;tp7n6jF=5H{ny7xKfHY=LsH=A=b7ShiDv|z18 z<2&WiG{0rPYz>v)ds-$h#*QDB)<`84pAl-MXP-t9&7EDk3Ke>)|DokU1?+;atj)LX zEp)F*$`X=-p#I%OXDz`*ZLLPxY8!U!nY?DbC4Oy^%>B>8=pBCY%bUyLxLA3WqQDYlB=KSWYrv==tqdyU#;3Mlfo&yrU8uLMr6?+7+4uE&7K6EE=k3$IQa zArn4eFt5v{0QRYU#p>t2s@M|w8Cdq`9I~FmK7HsYPj=O*_rH@1{QSE|5l$q@V!LaP zJloyU9C`7v^KyGWZU1~{Sz62pf#Q>&Bbj^szY4{`^B&3Szn-i@60NWGq}T$5>RG=u{l;i?@+wcu-v7`r@{m+9NA5 z^V{=bEO{)VB1QP7nZevX9AuX-^TG&tBhGh%n`rBc3F4(xSpvGv@ z=vDcIj|di=VuXJrEhBi&R@L7-Y#TMEmJ5VgVDJCPs%n z`qFF~VhE-SK$d?b{jma@)f>RYlZ?jIpU8*ec1E!GuYw2fm_-4E2sB#|IVB#%GGleaSK>}^v1O0?6Kq@V1dcV2#*52%6jP( zOr>=c2gm=$2J103Yg8MOuibpk&8rdqyZEq=pBGl(O%JyBKeHX$P$#*uVF0k6e=dvW z<(S$_LC1s1POP%b+L3G#BCH5xKZ9uv^qD<~hsuQ{dUc#ZG=7g!t2Gt#)o+0!nRo)r zm*WW&kGZ;{Yq9sXCugiQLR;t8)~-x*A~U@gKbRVg5Uc%O>2h%GUT zb+v8?QixI*+lH)XL+q-db?f9EiX~LDZaBC2_Td`a7uV))5@CHSCGARy=)0^Dv{py= zs!@yDut62#u}7Qn*^E#B-KLG1G~qkZH-{ojvv@xmR%!cN!L=uUJofjfUDBix2sIm* zw61ag4w$ylqoCde05#P_TiXKOve%wF;?>R;KDxJ4bWGUnIxGC>iQ?CbUgu*U_nPe@ z+YB-_vAv>=b^p1%yNX@~_kTCAO+7feTHB!Z<#FPeBR7mG>qfs+bk1Db#^wkSlFcHR zoxdC8S>!gwl{we9P=&8T!Q8Ap&$Xpmq`LfGJDgc_4c6*0i%?Ln()l^o6>#tv zTlvpOVU`Jh(2BG!EmA5MH{#9kh6kf+3q0PDQvS~Wi;kJO*Una}(|_+>^4v6h9<6PP zSGh|UT|85j7}~kBTe?@%ZVeUJ{=-rwW46jnMB1%XQs^r+>?hT&D^#gwKMzNVvI?K4 zV_+9LgjJZXaWotFws&#m;Vc5!#I;2S6IyX4 zKb0^kWpLET`g+>05Ni^DRcG1OcU35eue2=j3`8J8iamWfeV7%wU-OHKT)6(zOGNp- zGY&(vv^Otpi(h+I!_OmA&U&DYQT-k9bee-h=GO{k{iDBP~5=PB6%IYM0?<`^1AtPkyZ4v zj9=Q>kcB^3f#qzFk*S9TB*}wgEKi3(FhO(^$uT~i z+<#7_+d_;P1|FNA?BB!ID~lG_88@xX{pkk>q5gi)f2$}>Yd3?R#(AlAU#nlhrjIDXM z?_=ubu#`9Ai>Jy+Ue^(D8vzU*c%6UKizh7wc2$Xn-b|s2{pT76Mo;o!_XY_Q%vA>$ zGx8f{#J>wv)RC6ZxQ1y8-DzJB8hHy@XG4Tx2bBq6jD??w3uqyl*W#Oc2B0CmB{-7W9u@zMY{z2?lVbSKho@J7kO#e$sU1H(B zC%I?|e ze>;DP>x|}bMdJsGULrXDFlY0om?-{XglwVYI$~=haf2v?NLBf=_@zS$Nl@v6I;5fx z#ND_4W{i!u96*Fc_mEd)+>Z?#?S=LplKoDCpXOuZt=L1taJoHIyl_P}?VWuE+P@vr06>)LcYN_v@W z6(UhM)|$J>F(qZ%dy_HuU;F*tmLA*rO~4v6Di0lKv-#?)*7=krNe9G(4LxoA62)r18!E{aGE zsI!C4(azV`-Q>7vcW0Y5k(VX$9WP^R(&-Bi%kkh6Mu@I@)YqUod~RO7xE&xL{F+K4 z6v?NU*-bMWcXMlOO~!y+dPOpK70a#83$i)C%S5RQXYC7f#qa+RSdH+n;-eO1OSLVt zZZ${dgcBIQxBV!FUH`CMW@hyHv$py$rI3I`EEP8yB@AD9<7Nb4Ec4TfDLODh79=o&!F8}&uRiUawFnO<+>>-+oo!ZQLP7VZ`{@?_qt?Bc}lmD4nK=&HMW z1qO@IaaBE>17P00^X?p{hHV;T3ndqEm?tm7?(c~Ob&n6OeL$I(x7~m8t$V}4=8NcH-KEVd~pqfAH3H}#sRqUJ8n-^KDB%9rvBt>J_8RysxIi2B_D?P&c_NKhgS{Cij!5E?Cc`X&M#gD zNWr6pkHN0}_pEfQcEp8e1&d~!uQ5?~u#L5kavSO!b3}9oQ!TnhNr5h{ew}ekYgBM( z6UG;EEn<{ikkj`N>FC1J$rpm8!Lc-;FJm`D{k1Gz-H3!H`oq%bEhEvGOMT z%sr7{ZdrljjUS<*RF}-(+a*n~Nn2eRP^s#%R=H;D<8PMFnD1o88b?|x$@1_Cp^%EA z&!2*f2(A#yd=`5TXH9dTj`Oy@wI?_B?MkEU>0d_rfnc++I32Ccq0;^38~}+U zoz)k^*P!McIYc)_z>E&3l_WsHK_RTo$MUoyD3GONPO@l8Hu&8%h4-c7rPLHTqxhe>K2AIXkvsKIWm;_ZYC0 zIUYnWF!y&{PxDL_V?So-MuwrPtJgB*Vd^@RPmWyAE$uX1@w#@xf6qfEsiV_uPyua)L~!uq(!9R zqEXsjMcIDTpirW7Of8`(28r@GOJ1SLgYxrZz`f1s<*JW+c<;h?QsjaHksz081*$ye z>08RsN`@RmREzE|o{m#>JGv{#+Kg?6W2&5PE|>%C37|8#KA?mr+z2@wf@?}UO-s8g zhICC}T+#*`0tgcOkl|v0apT1>u?H_k1U!8)$`tfsomR;p;u2wG{( ztZ^fT44c5Q>yw++JX|R*SFo3E?Bs+DSnVKJcuaGH1G10G{JO4dK0PNP{;6(7SSIU* zx(6HmwI2Q0UT#)>1vBTj>Cz}C#IlaIdn_}u)*@Dp>WQn`xFJnJw3G5DufUOarQGSYi>>=D|0!q$U(83G+ZEuW&R4jdJ6jeS;omLSM2vx{*us4mFeeV&0o$! zj%ISEY76rpQX{u4!@~MYp>Nl-7z{7-F`hO;F6N}zk*IQtZtBOC@$#G|J(iCyov5u? zC?oaTuXdK{90%p}g5w?sb4p0k`KtrUNv-=SXbzd$c3PbVW15XQ4C23i0}kYmQxTq% z-ss?MPLC-qM_5jwmn{9V=$^2~FKH;+xPq`m9Oammg(+UGuXJ+EbE};c)-4nI`@c}L zhz7?9rr+enjXc(^xI5z0Nn^0&6qHodG_)+NY;xG;%Hxo)fKy=|{qObgDpIUOsWRm% zRH{-fBrGB-rcPYF2926DOGrvd%gAccs!h8NofcUf7$5)zJb(c{z<~e=fe46!1W17l z5FtZ_4ih%=D58ui>S&^MRdmtE5H7};VvZ%&*pd@_a+4QF^0z0)h|A@7@uIPOd5`Hq zc*~1;nH-qt!5U(DZ+{QmR&b(t=^ASL<=M4*WZB9UNFqm&#Af%4{pGv|c?4+hXviDF z)4YeQRQLnE0`!t|g>;b<*U!a=kIc@cF*eqNEem9$O$h|y6&s!@{>lfY@HHLJmDuXw zk(+n18JUR54re4dCi_US=<@oKfuSDEN8m=!BR6LD+~{+WD^`4F*zI-Svd3Er)qjUh zruv&?)=hdHw#v3!DrL0I>S84hMp741qEmzf5I@7;GE> z-@x7*MOh-R-d(0&hfQyWlWSYq+9C>6daQjd5wv59|LwrqrN(m2Iz zjgG#xY->=qP+|u}aS$HIaj>INeoI=nnhxdsxp%{LEI0@pN**u;qJ4SJ5gPj>cX-<7 zzYC6|;y_A{Rzc(dZIq+L1~Gd&qo<217v+!IFE@2jfBTu+e&qI}is%3T-uLI)=Z+C- z*gBQQp^RXekNZ&0?8w@zpcKM&WayL*^KngtN zhj;7%9XKS@AxJ^#?AxNgqE=Tu`8fXnPnV`iSYvluZIT0q%Fji$;JZEIy{4EScmK!T z%zUlJK+;kOKyV2ES5y68x&0sCW_C;hJ%`_tTM_Y}<)VnKfl5Th8pj#(t<+$e{$-a=4?9%!CIie7vRu^>+F`vd_m> z3D&aPaMIPF8lrvt@BgvobJIn%0VmS(iEnYYw^Eb+8e_>JV#SO;-fdn0=VD#L z0N@8c27qnx&;S(}d=9~#c@^;eSibpZ$3$*}9l(p6*C1p+qprU5*F3QE1_1#2t1|!~ zVTv0eNf!lrJreatRTh%=rcySKdd-$tVcPv>%sCgT(hK-PJy-A4`)yy2vdgo1J}>1o z_f<+NNX`Gu>9Y&Z(dsxjQDaaCOH5wIlVX8+Zz4h~3k0hXjNL%PiWxo!Ad;4wTjewFG{t1^@xS zHyI(2tkaAzM2pUd0R1ttb!%iwN(k>wg11VOOxaJEJ4Ybb2(t`5(d(lD?mBuy-Qt0+ zi68jeW8VXuabgBZlB5d>LBt-qL6+db5E_RB30kD>NG3F{u0ju9-5^?i4GD?Ix~qxx zRugfz_1jj)t5~CqT>FxDX3Th>lJVk@ib&|00Kzv~A`aO>gs#S5int}5h%Na*ChKMP zJ4r)nns=XKim;Q*j-cEU6m^ueD=HxIiScLQLMUBp_<|vAtucLYgn|X>ky}K{D8^-E z05ynu=s_kk`N%Xw+>Fw?K3X$krlyF(O3b;zF{r94(c!rv;aYcO%rvY%5y}6VaU{pk zM6_&LzoEjGv*NS^y>}L6WfMV+&N4DV7AFIM#~9(UEHeUv)@ZX#F+kFI zKD!H4+VY;&@K#p@eRbRu8v|=o{Iz+lL4!D{AX2#us-TcmS47>Tj)sQb&-!0 zdW{t#;zhOUe{OiRI*ku7$XFsiC=+wcTNfml>0K+)?zPS+K!UrT9W9ZJLW~Ij1ze)` z?3Niv;Wu2a2wjCl^xzEAD=tuJkA_AOJz|S8%_8YljO87h(4WdZC2t`|0g{Z{w9DJ) zy3(UVGPo28h|673Y#R}3hN5ulSg@NUxWK}Cgmwf(e36ssG@`x{w_wPKaHgfl`>Con z1bYm373(NqOQG;2(u`C#D?pTV=peEl8c}BPz`182E zF%XSzjEphbBk3X&YDv0m<<`mJ6PHnj1c*sSITHxQ5f~{5f|LYBD#Ac&f*}oIqIiNM zEn$tZLTqnKtS;|ZK~Cr+Qs|ItYbcR9f6tm+Vs`#LV0<0({-ZQSEl)F-nCuK&vzt(erDZ!MPuAl(4 znH_0Ln31HOeXFcAM^66CO#D&rZG}k95+iNb_N~)Ub(tpn_NW{9B=zW2jEW9=eg>hC zBXgYzWGCRRQT0t`k~8Pk#9DKchsix6U0TR#&C7TGi8+8{7Q zitS?D(poD4_CO)-Vwf2+6108ub;c|Z$S5Cl)PG!;-V;}R`^W)c~uZJ+7)TSj1sch%vM1*IozN}DN7+qQt})j!-GlN!5~@$ATA+RK+z;VqT2#F zc94)5#wbNdikWzcCrEai*a#R992m&0=M>?sOoLNY*c^pulu4kdVe63G&Mj4hVAC zj`K+b1&YfMP6+X-ITqkoICBK$

    uJ`Rl(T>WUyh(#Il^}b(;p^jcl4C!H=Wktd|_LD8=O1B zj`)fCX-8idj-LzkAE7uNhIqp1!IMspy7&Y8&=Nn?h?cq_w9EyecEscBcmhB%4(`q%1dweo1+K0< zf&l^L!mk*X4fDgSrGM1V1;~nIh3= zsDo~)JdSTnpt!+gtFb8LN{!bj#FRkIOEC!a?93dF*r}38jTw?~Dp#uGS@@>ROjmLa zooX@2WD<^4Dlscaky<6;7^G6Io`;L%$=bMhT_&B)XGhD$0=YsiS133P4qC-QtONeX zM*bjlHl4SuTOcUr4>%)}5|a{9RMV?z>Aj#_oS9h~=}kK;G@)e?hCc@shRr`ib?jeH zY1{!-1#0XM+f~{8REp29qEwEl59r7ff#M%pB@ve&t@%0=-nAoQ$sKKxq#zX9OL4Q= zDguO+!`3cKF~qqPFI;OusF+D!a}3Ls zKqz{k(J-|iL7321gb0QTOxjZ$`k2%KgqS7lT@O_l+9~}#g6MHV{~>gu67{Uc_#CuE z(SwAYv+42(l+0wR972+!d5d@Ihf|Y}O|F#YuD<6=M#Ts#c_J4IDl8B}!w#MWBMl67V)zhYw`JRk89lH|8m75bcXjot5`I{?i(Pf) z*yRBt)AP_B(_t?wxwDX}&U7#a^VL8uD+f)wF+v3HifE@BAj8fWAZzpU282GXdM;c?x`gPQsmq+P)4am zkj$L{oEz*Q?I73n_E}F&!(<_9*o_>GT6f5?|0~zv9}y+VzvmBob~AiBBXkQFwjzWx zcZAM>uqDzF@L~CleWvDNXdpzWED|a@V)H1REd|grToS=%yIjd-!x9r&A(KZT5JsjW zts7h0EvrhVv3wd%>*=E+gN;0hC>1Ky$g@eXDTnV#LVsVQvy*gs*mmSI@Jy*9LA*c; z%6hp&7ZCQxKJy3#GhgBEg=bVR`K&;FFqrWA0|E83VkN1N$uLPH%?1clpDWx^ z=}KqwXQDtKjM<)fm)`<}?s0_CJNk?npNF(5jR{9Y;!_NQYj;#f5frr|?#Us{|bj2#XtXA#yFuv|5uusCt#JX zDJy{Lt^KN^Xw>A^#C^XXVL;tEf92fGrbUEepj7+l>$E7-x?E+mgn3IWm6c}LmW2Cx z#z2Ipmk9%$On}1JR=LWO?Mz zfV;9P9~@EM5JI$zzphKrUbq&+U|L6d1CvQhS363{0nNNwuF)o)Bnn~c`as3)1K%Rt zZj+fKR|fW!!TmXZ`9GDfnLj^~s`~x_fz6cAlZ%B@(^zL!&Pn6L6TRrMHzf6VY^eUv z$UCSt>)41a?b6IC79>LGwz&+SwqFfo5k(^5Rs1i9?w?Q1_`b{?+|7mj;SC5uQ!fo zNLYC%1bm+4@Mi||jW2VYXR+cmT-a3h&`7b)EoWbxi@dQW;bFodzTMEc{{G7UAy5Zw zdM~`o#mB$kk_)$(j5DD44{Xc{@c=sBjq&5Eg_BoQTxY3vsscZ~C12b8g78Kn)py?& zUvtb&_orGrW2)j8-yvZ4GW|zTwp8gxLUn}~b}p6HTP+BJgyNly^bFIudO4FJN)n1A zQ{T(cD%P-hH{RX9HgAQ2K3fbn$?p{7O~ua1q|rF1U@ssK-w`T?=K`&$KjXY8I_6;` zQ8ak9Nd7@SuEo0~Qghvqr~J*Ix2m9>k{50~hhf|ffDG!I53jb7kCclOR|Y;b0(Zvb z+K+-s^hndIR&l7VMIUAmFQZj}mDEdY)T(O3rYsveQ8Z=c5uuy|8jv%RX2Fy&& z84K9u_Dd|HL1OXr^b_^C<eQuGoraK3 zoMT-S%bnA1PK^)1{QhzZEAA$|TduJcl>}Sv&Pe4_S1jrix4F+LNj*G4kc5cIv$uD> z<9_wf^fKOt5GnvlAvBEz78iTTk<7|UQ>qN|XifS4TS9=6< zrQ9VJ7MQc@jkP74ehP1`4jku6FryuE0A#fQ%1V2dOdkA{BDhL8q3F!s=g@6TQ$?Kb zCYen&aHo};%c|OWGP;{IIc5Xv{Pbi~PcZr8O{~b<{VV94n|Y{{lqtTiV}2+0qZ?o; z9)d?IgsEFF#|N5Onu<;;n~jEq^R+RG(X2BjxJl=ON+-9OxFK(gsta}1%T!+)-hvr< zrh4ww=R&M4l?0#<)Y7tc@2q6O3&}f2lou#!MKJCBf#Rt5=E4kYSUdD5f1Qra432Zj zOVK_ST05h0&`+z?;-t`G43RQmrS%|ldJUdy1S(Klo+oyC+dwY8@ve?m-PI_D)b>f$ zS;xr%+-k|podhy09rl^T>5<>TpSkh!!Voi*m5&;!h~x>2c2(!6df8kRt4}sA+7!pBHaXs97gcFy2snx!IWG=QEhrc z6N?kqg^EZBCm(^1il>D?9_Bm4zT;M0TUD;0$PhyGXE$HmJ4qoAOi>I*LrI!FVevau zwlk7aKOpzfY7^+aONbzXWT7Dwu3@tR#R&^elS&1q-dWLoRt-G{LR@MZIunB5kTt(^ z;)`oAJFI1JEM?gn+98c%zsVKbsPx73-L}7+CO<{~9i5{+Pbem|ZZWDgSu_>dJa|ij zLWIDzgo}DDJAvPUwy9fUu(4jv0NcS^9$|2}v~hoOy?LD#>#Tvjw>4hDAnnnzO1e+y z7G(ug-Sz=y_WsKx_uEE3=O*sKpDFjEJm?WvBU;pQS)A0dTj#j;k+9yL~ zJAGEay6Dv(+dRV5J7yyo!>XJ*JTbH7$F|d^pO(f`^{tL-y-bA&^mG`-9GmxEJK9Dq zGneDM&j;(98ncryx|g>5X(ii_p@Nd)KKI>wgwegpw%@TvHVZe595_?OU9ZSY`lFpp z&+pM{Kc*MYR6njQO0AWmn;#)`$Is=t8(@{=p^ED^&epSsTfnuN>&W_)4F{mrH<1+?{8IOx zX#5>GtzHKCp9u4jHruKU|Hkc;?o-Q#bS^l5&E|ut`=Ok~6wyvOPdULK^C5!sV#xSv z>8nNq_66fvvDBxdQ%qD9Wu%D;qFh4Trt{0$R>Fsy9x+69eD9uNP2EXU|%ecz8+Bl^YZ?5Zi zY=PM8DTNCPw8M#eLbs*6!XHw}TtDJ_K%@Sr9yG{mNj^YseI2(9EGNmle571Z!@m!# z6oiBe0Bqh07vuv;5dTbD$Zr}cZ8v_f?QH?V4jNJ{xYv)*DN)AG;RysgfBg?Q0t*lQ zdE@)>fUo27A@xtJ_yb;nR3~9G>jXaQUkEDdf=oE$V3S{P3WAU2Ld+Kd8LxjIg{o>} z=_w8DdkoLbo_YS@xUc@%`h(XXA?mvnw5_c9@2Q=ayk~B49`m($y|lN*_ZUq%1a&VI^t2T!KKy>N zRL!t?UfkGOZQCCuaOj_&>kND*WqW(qgAjPfsLh(a`&@73osYWXe#~cu%=GV7i4AaB zZ-`s2%%{Ig?f7#&)ev7+QrR{f#(!j1X+|w+vStYG{3v24)g_;oD}T)M72U{=Fa2eh zWk^2FjyQgYV*THuT?HGCtkr!xv}Z{7{gKrhAYe3fBaDZe#)!w4wPY_l^f2c8T4ywD z>>z%-?}iPe<_?1dW?WrzAS+|Z;j0J}yLnlnmc{i-8IWQWa*os7X?0MoT?P#sz^HMV z_GV6V>2nRQJf>|J=2>_RaYRdr$@^^2VL5*)1;$;wiRIe(hl$<0jQ&!!8|?8>)E_1tw--iCK*83E8hUM zS6fGivki%!dy$Z~OAh=vRLS$Y^olsWi|2(Zap0GCiqH!Dtt9Qq@Ne5?;ucH&Pd~vI za%Cbyw~&ssA;NE0IheK@!fLH}6f1u(Bh_zZN4)H~N-vvHKk5EWlD0f|=?=$-UPZ}R zQQ)5)-t@h$fp&DAng*CQYNUyHEm1C^AG-uhV_Y)*$X)*YE2l7zGGV8Yh&-rxhii%`RauaVg8k6b zWfU0#BF_fbVDxU21y1jV~_zgBU;ZdE4jcx4wqo!Q~w#54Z zlZ+Z^BA1|zl!M(0lAfj|>_-r%?8Y=*^pk5i!zI#IBlyE%b8JC>C{~;v@rc4oRA2k5 zCE-+M0@Ncd4@bp)BU8`s#sdqxQN~1wZWTXmJ#}_|CK8m&ozva?Bzol37Xw+GxU*N@ z`n;vuS-P5x?6#_gWw-e2`!+8rc|C*0qUt6Va>YTNN94>^Fv8cb$Ja{I3R5#(d~8gAZYB{PUefiTzEBe`sAYkmHkH z)y14b5p_2LhO z0GoF05EX?Nf%|SdaU~NFM{`x^Zp`oH`1mr?nT(o>Q-F1QmmW zHeO(Z@%v0`&TrXO2Qsfyjuf23I+ag8SX7sBx}&hufC*&*KizUaw0O3<-N9_d2i(eE z|7{#v(Q2)FcTIkPlkY8i{P+>X!ecVt#Q$v8}}c$Q*>*bDaCU2XA%X>LRFQw z|4w(*B(cJBCWrNtd1s%%-QDEl$+4^(zXs zmZ_YsUnkjl_ss1`cRm&3G-I-nn#g~}dpjIvZ1C#{)Vrg9kC=c3pP`IbMFd-*=S)A* zwenP;ed}@k{Vh>%o|40Ko4R(jZGrzRl|U$$9SVZ$6D4Dxwkl_qibOlMFZ;7#q|1NT zhOamXW}YMSUTy7!9~`*9hyei@Jsj;hR(a+AR&N^lvjj_Bwq$n21+aYiS_YX6O>`wl zmo8g%dDSI}m?^{#=fg0;SAL;qN7Kn~zoCb|lfx2{fFJs~a!J)*(8Nn= zBmLX&jm4w}Lh|sh5B`XCe@)dkty{_^j+wPtTJzY4v975mBGJj3nEaYyiaPy`+H2J| zk_|{5HHC@Wpvo`=jO3w^X~AltC@ob8I#yKI93qV%>c@QgDe9LehT1tQC8xdRiC^d` z%(c&PTXtYyce=?{8>Yo{j1<;_y6CJnzClkL=$Dr&J+{(3VZW#ao#Wk5+M z#iZm%2%ab2u+R3^KAq;|$;c{Ao_Uj= ze2A5R>8%gETGKqAncbpy#Uhw&HL|DYt$AqN$=J@r!hDdY`rJ0YGGRDh7@yyD=o)a^WllD4w^2A2OFb;mpve`&o?M+39q5lMv}DD)!@;y>?D%0t z?Z7c`9Nl4coGM6GKl>W%P+47)ZCyN3fw|{CKY{XP@34F+^}cU1%(`PS5&NfaCVCbR zFh$9$o|1p`&D76E*^xkrD(|CXMcHTm3)rlI|IXk(c2L#UMzNPF%j#^&bg*&#Jw*tm zD_C%7?K1~7b2)2F8-J}hZ=?=%lmt!1xbf>ZPYdB`)XzW2RdL2B^@k?gU=G5pamRv1 z^#S{u&XlimW1NloX&EW@x>v7#|002>&Xv_AS`}G2jk?GFPX#oCU{hV|ca;}qgwg(9 z6E5@HQQD@iCu2gI?<;isD>qeVdpUQF$l`Gw-ube_8vlq)#cD6&_7}v`R}K>uNe!h5 zzoUB^mJmyYy#|aPQMwf}kwWZ7qUpk<1PP-~CzXL*dt@ww>Rz?1?4qFjttrRwx*eEN zw^mnVtabg~k-KUbJE){_!DM~=tzhDD*TdjgG+k&<``$m z_KIx#$H9gvPBSk>D3gT>%*sMUh{%`a-q?x1q> zsE)gzIcFF#j>lDD7oJNLU_F~mdjnCAZ~n=FdU=bgCxgvR)=bJ9Q^z`@iAmAGUQ^FT zh9sRNZGSHbvW7ihWt?%4-ff<87ury!onsWeW}k3K>lFcD$V?SdBU zT6HxeEw{wUfBo~KS-w1zRe89>Cf(JL1d^zLs*k~wGf zj+aR72lBWpIs=|L2Lk?O66okg66n>_#Mw)-Do7$uVwq6z77c}%uFW)gd)HG9O4&!ST8~B`aedc}GNCNQ+>?z1V-h^bV zt6Aq#G@9OM(1HAN)J*t{!)ybAd6>w~%Is>S60JnKj$Rso6`UV1Y9w|4z~un%*ec zBD<(?aqw|t=asHh$-|$u9z)?b2nEn1W4tHM5B$#H1u)nOF>nN*SVpp4X7m_VJ13-4 zg#8Ay8G#%v@N03ZN3}$AruUUe9^B%95VLv5RO$y0OF)IY8oe2&x@~*;qPv7>0yBzz zZi7(SPCf0((^q^w4E}wb8!HmG+Ae+2h=hhOe&!~z> z_1f#UUC|UzW{=nb<3_stc9ts=8`-;lZPa6&QBb>0H?1<;(0OzeLYpC-6_jdEoB#^D`0*z&oq+ zCN&p%Egf2@2TRUY$0A{euQ9%tTj^s1MhrNtW%G$DE`V25!I&cMPzpAci_)_@wAe&Z32cz20Bg>sr6lU5FtU_pq_7}w zUdm^|O@>mWBs>%-XM$Rwawr~i%#p-_KE`*NH7bm=FgWBZOi9xMG|~eX%rH~I!vPJSVmer0~aYV#zE;O#DS0nFqw-+2rcYeQb?~}E;@Mg zo>a30Q<*e8&|yP2l*J%{RFW|sPIGWpo~lgzNP<+x`Uu##hAm=|WK)wI~ShjNPYV+1Z|6^Sd{2c&r zFaXxBPK>JSiVF#E&|+`uE%6tpodz8y{Poq)9T+G(Q`^r|W>m)jo|Y#iPLVvM%+OYj zztsen{eytp1O&Nkl~4>eu!B}i!|sBhWRrP&F@^g+B=t4aV^@1qGOrQbE}Gt-j;07y zwi$c<6UKtFy}fQ+CFizB8nS_s1c>G`RVM&(Y%&ewYMLk2psXye%zEMjco=All9n%- z#9CAS2l0sjO`1h+{L}zoPkes~OXOW%T5AWXTY(agk_L~BaeMB4V)l{BweI{vSzm}_ zDy$~&X;4<@FQBZxdcb+_X1=r)kFdjBniptC+RTRQeLoARlL5K$_RDECAh)I^rkm~3 z8$C<10}P%_sEll@bvD6qwT^Imywoi~FT#&A18G(R0)>U{XPz8y1 zXB7;0wF(jTY!xaY!YT$|GEQS#RlFL2mV7OryM4iL(2&JO^jM(V7*c|EiENx4Uz;g8 zVv1Ii0y>StctAr;OX%cw%eFuYocr0aQHv>V$l#)~v?2m+T6NHDzr~6!sPJnviyiVP zOQ*ZMi_f6GHV$$AfH8l>0-Xe6=X;+lBtlDacsvlPT9OLxprP0eXCFMaaMvRqXEUgK zX&#U*ivUkEgPlvF>epop3B%@?$Y$;OwMx@%A@igg(&j(Om3Tk#{4W(c+y^=z>**bea`n(V9&rko|US|m)5J_~KM+@*`Ol37}G&|tH$ z??@950jGTJsCN0<z(I{S3PO5uOsC866l1 G>;nKVNojrn literal 0 HcmV?d00001 diff --git a/fonts/KaTeX_SansSerif-Italic.woff2 b/fonts/KaTeX_SansSerif-Italic.woff2 new file mode 100644 index 0000000000000000000000000000000000000000..349c06dc609f896392fd5bc8b364d3bc3efc9330 GIT binary patch literal 12028 zcmV659DkbG}7@mjJD1@jO-Eqc8pH1xbNXy>V zuj4@|WLKW95E7|5CLkNL;`-Y+wfA&?GtJ-Z&L(!k4v|`??3CPcqTcL|tNjQ{K536( z{p-EnmtzN&6c7(-?6J;0;$I;9*Or=#CSe6e`Kj!u4Ul0&Ix>QOQ1Y#>s9n_Rs?i!K z`N8}1e;oFIb6U<-O6FuJcnRoEPTZX=aW9wuuhQ&I(s%2$94HMXDG%c+*1)?j&HvPt z{x5f&l`#j}k2io7&=!!w?=Rc&|6fkeUw4gUWm(R$oMkzA?`+>1cE=cO4|J9@oUwe@ zJq9WYEP(~E3>U5e2q**H@Lxant9$O-_qA1~YfFUmMWi9#7(z1*h0+O0B{7{3D{D^4 z+y+H#pL-pvasQi8$-7u`oy}^Vd1cS&h7d}o=09l#K=2N@4Uhmp8_<0KfKAV*4nF{9 zh``OnQviI=2H$)OZk$-3w+A?YOeVo(|CfPQ^gZ}X2Ef)13;=i^x&{D{0emUK0O21D zE;`}h2dxaq;I_*Km7p55ff-;SSPBk+6W{{40nMlsJ&B%0@1SXH7j`GM8{3B+zz$=_ zu#+;rEJr5!|Nnl_4|b>)w1dn}KY^Y`Z=qY*&M}W-CltGC;W3{5am+sQp%1+8mU~@s z)-i_vmS?{EEpPUg*S+dxFL}Z9o@?xb?}G~<-N^lQjQk`ZI}rTy)pLNZGKgSfq7o;5 z3C!o|;180KTmF@N!@SWef~L?@VC@<(_tr=p{0g*xco(8POvL-AAYBu2CpE-(Pg^7< zM^Ab3%zlk+nVs?3GjK8DTb^inatT2!oMR+)?S3PUowMxCg0eG3A)(Z;sCeEYpJ1XU2Jp}l7$I*6 zI6xy&p)wjudn4F^U5%uGuuCZ1$Q&p=y(q&{2;f zKrbeREM6T+Ko7)CYCtk?2a>fX1#8CI)v)hK=p9wy%t8)58sTxvW*qoQCGuy8Bx_BV zoRMWu7lbROj3Msrgt%?et_D%7pyMD^V*VfRke2622B|#P0%UJMS(2)~fZ!M_5rred z2-%CRYaEa|mdV3woIUz3r@ zsRDSjcf#7lhn~97stOI11A?yl>nS&NRT8SHmDI zY-?rR`%X4=0J*Sqny+N>V4&<$Yq47FB)0sp0MOE1LMEvBfI=MqO@OfiE$s(#wMUOk z?a9zYzDK;u?vGQ0?veN25XS#CVNm#a$Bl0EN*#qLK;RrjRM4`8EJv8-3OBJxmM6j_ zBAZkc%NKQ72XVu_B>c7gAgBnhq9!*k>Ki46emlE3S>ShfCc_v%r|u?UaIr6tLuw*N zh605Wg$jilMFEOJ6h$aBD6}ZHumPw&7Z_tBvwd`g$Iu{&avGpp#snH2jkXUm0~plp zR729dB>4JMQey;Qaqo=6%q{^h7tOYiM5h0`~o*gi{E6v*hEL=GsOXV?O4_ZQRHx~t)UzRQP-ftfIt~F zwkvtViXKQpI5z0J8QQmHLUiuWI#z%{_$C?w+&rb``3s$9%;LF|Y|ucR%RZB+EI}o9 zE(z_Kf?y}Mly&TdGh9t8Lriaas2*{nG)7i3s?v|Js~om8qMo}rHG^|(gd|Q4xY$54 zl}5y?l~qfEkew&}G;f47?iVhF#=Y%l#EJ?b;vkWRNHPi6+Bitu8;oEGMm&gGtDuc6d+M@+8kNlV zWA&lX(#E%KY~TJ$48V+4!+3V=TIP*~O{rCRfqw?5aK<445$&Z`)@uc&4(WnmOA!8p z7DRgOo}RMX#e{b2Pyl56EUjx{u>5V2=YViYP@$idfzbw0cy^x=ZeKlG0G2y3L5pV~ zk&tLK(6XY&0LstbI>0fB^pgKMdSt7K79u;F0qHaMuDL>IXM7*Z^Rq0D&f2 zFC7CUfB|?BJ%esz0Ff5<{WucQVj!sUR1|h#dr|>60~BRR%d$nxcqWPcIm#^3I~d^k ze`biDMdK`oorMCP6J9Dd2v9O(wl^_lNhvKraG!($7{>qy=uj5cXga0YK&dTM^Qh7l zSQ$4=l^j@KZEQ&qXaX&88_hM=0_s1eAcR3!GSG*fiyN4UT2tvVvssEdh!QXiN(7Do z5C;>m4nf2b;doeuAcnQehCsdoD3jqChUcL@v@@DG{66BQJOC>amPVIw90N#zx%s(j zBn(s4_wfLHHOb;kSu8ETmw7=0Fea>mq*Kcxl|o3id1T5QgUGqePw~jXg-HeyO;b1C zAwx4&WPYcdN>e0NX>eYt+Ao+$YDy`ea=ElAX^qA_TR_yZO=XbF@lhT?gMo2oRUlcG zqtO-#lSD2X%xlvs;SZ?{^MMGYc|=m|q;ovDVt*U?z1sjMA{xoYlZ^?_YjH<=J5)xl z00=7-5v@lNtDTKRG=*6+K3@DJT6y(E?4(B1(7v--&BfcB}z}?cna>21Ttx zG~{fct&y~3qhX86BPb*f&~C-U`iwDXaWcnO`gFhMPj#e8lhaYSwD=@SW zTN!vOG{`rox6-geZ1K9)KDP{*fB>4VwXMu23TNc;&EsJOutC#}z6~B?)}m|nA|Ck6 z7KH_{17;Ru$th1I(FwVsCyaq63hJ!fZT1;=uJhy(fSTu1qA#ukro`)24RD;WbhgzT zHNz}?zn>9t6j5%zv!AK0!AZUafHhpB($H6~P^poQ$$ifX=JXnf$_aoXR3>~@F17~Q z1tmn1!tsLm{qM7x>X%sBEtNqWvvf*Rgn>OnkYWEY<1W?zxi?Uwc}K)rR#>sS9+cHb zM~HTFnFw)Q>5=DJmV%GFTp2{~yueiM5#smppj=CRZh!}%?)j7p=FmLn@>l$fhDdkhC!{|~muRIgFFLiA@ZBCMhH;GW~$}|-tku#mPtZ7U& z12(KT`vE+$i|;L=)ToWMJe9hh5Vx49K!;NE4P8yrl_U@RBJ(&TK4BtZ^VMmY(+vM{ z#`Ue}K;1>k0i2u4L^jKO;yWNy`j3M+veO(zjJ5Q+U_d25r|V}BTMc39hF(9jh4oRp zJeR19=nD|XV6GFf)QSuol@qjiqtc}2s#?70La*m(Rg+a+rm2(%LG zKIPOvA~2$ver&qB1MNOCjale1AUD8KTe$EchztPKN;`x^s2T-ugGwzf;S4#gUPsq; zJs$XEf+b@0N-S8iCbk`ul*33dE!etT2vk{aJ8pK{;F*XVC_m+H)Xa+YshB6YIxf}0 zWd+y6iOMKhYO{G))eNaVR}UO}pr`p` zaw}&R?1iOU3PXbp+*WeEe>#C#BlB@X1T&yD1IQ=w?nqqqTDud(93{8TcMbBD_js(r z6tLXi>3{s?@zQDWbd_T^i$(Gbm|E0OOV0}>1l~8JWu50E1A78vY-+|~B3od-2k%QB zTR}7rk1NH1I(|-f<%q4@apMTjQE3O-5T7-#6479#qIS&kt)wx_!{-$d=7>_YTyg6> zZw$5=W>WX_lZLPa&%<#SAt#+|*3LrG*BqltowbJgTpvUNnP?)wviPB&tfUt5?iEIS z0?o`Uu(I%dPjND|afnKZ+GYcJyUOCVno+Xs>bCp3%1u&WF4k%-)XAgH!TL7B3t-U@4YUt9@q0 z?xqw0>QHe_PUbH9B2cO@Z)U1+X5of2Ml&)1+QUmgBzQ}b6;ag)UAzVTLoY@snlHu>dF0aw=BDIwb_q2PUnqecP|fMs`9oSPSJdwbDx_I z!7=N-(}gjxB)(vwOgE*`yHr0h#xUg+4zJiW%Y;oNO7d4`$jfgh%@-y@YlW0Qb4u!(pRC8xz?WI#78o36Aw;f24~j*LrRqyme=S**_HiC~UvPT>tatLHX;-oseQw{! z10Rw&K`%&BMCOZ<)nizFo}I5*;N2zikNceD?=a$Wllqd3=Iy4P1mFS-RZ($0)v)N+ z%Tog6xTDhOXPG7HqZ!B;z|cij>VaVG7cG&fB@fpMF^!1CRz~Kyx z&6yPT%d-G?mShL}+Vo8#8aDg6#1gNMTy+h75ozAl8;QzD)6iFv*@}v8RdavNP-iEh z;Y3oX$K*6(XhyHtpt41yF+;r6v{8nQSr`h{GJTUZ*R&#~6yI{zYKZb9)qzhZt+Yf$ z*9#TO*enc?iRL8YSk^0PSX|}S2}8twwiwQgiM-jdih(4;aeLjFND#=9nO#uAt#wNk z&9(N@kkqt9K`7!el?wdNdT!{U%qQGWM0e$2LoFVr*+T4kF0-E3wGe$>Rue1VPMxUs zjOg>W^RYpR3b#>NXNxZJmOjx+~6&M#22cj67p^kthE~1rjmP06z&;-7j=^zMxI0_ z%@-JQ(0XpLfJr_hyYe{>udNv6`kdyi1e=6=o#{FZMYuPz@R^(}6q4=gu~^EPQ1gf! z@mfLf@b%_|frr-7PS;aLRg#l=Q7)Z)j{Cn@(<9y}VhC5jD{4}HsLNrkD7dMQ|CA;y z=oLCT>SQ7?9}_hU_i5T}*@|dR^j4LD#_fhh^lC}#@=#i$5H|>PGVhfYo`&5tjj|JVZATZJIe1N_l4TxRuWSxHr<`{B4enmQiU z3i2~V?h9dQ7Cb|UC-Hy_%SE4eT_(d(Xx6Y9-o?u}Z`2K}ykC!-?8j_jvU0HFSpN`9 zXR~Ip!$mn3w7euGQvE|yyYdjo2|CEvPShjHUc`3;pnR=x;hD!;KZ^@96h*_y17oC- zW;=MUWtnaa7kJ5?3cyU;(1yk-qm-W3!h@zuTDmUcIVbv)7g=oX)L4t6SQO|_V4)^= zb~o$?;DO~alt`L4u0FokYc_I_L?W>@vy!2Cg-YhrIyCs>sjzVyVag%3)(&M`z_NO7~{vjt<08-7Vy#y<3DCI%o&qy zEdQsl5DLcpT3#BUF2rv~U6fUC-n{=O$YLVw>=yfTCnN=O_g%3xJeHIFFgSO#He6|r zV%~P@k1Xn6zlHXor>F4IDECoBQ}m}`d;5o50{89m?@A`YQ#8hB52+%fp)ew zvTlnnSOn^JhxTwtR?A~j;YI~O?P=iK(bP@`^)Ie)p=XNZ+?!+waZRpWt%8#nym;c{eJ#}M%~bSKYP0!*JB8(RS2wuh}1#vOZy@x^S!i162VTxKboB5 zg-*n2e_irG(l8BoU6bQ#H%<6TN+#b*#4?t!t=>tyNXT#A9+u1z%|2J@lV{iDzPB%1 z`YfM$YrZ_a=Rp_2;gZzc)<3yPDk};(kbL>$NG9Jjb^QKXv+>zG%A|Mk8rLcojj=^< z{G$q*vfH^GHTz5DSl0BUtj%0rvFg$v`o*jp&p4>Ia$l(iQv}wg^~g6%o1R|OQh#7O zswjt~4UW03O{40CXB3tPx-g4(zK>}O2TRL34e0@8ODtFH`C{6#>V8RXkx-mwL=*E8 zzuDH-Xz=Z;w=6qR#-m_V4B_P-GJ$R8Y~?WYw7dk z9fgbPYkwMind3h7U4IpShGd()QRjM4laRW!E^Xdw(Qrl43D8t=)THsKuF$<&52em{ zFoYn=CiM6?fwo~nK{V@J79HVB8&GvMGjRG85I-nhV)==9^lNLgNmj7T{Xb;?hmnp& zX3h^Zhp0}Rm(8KM3WRCbuQ#r5pFmQg9;o*~R-F)SHJ7Y$mW-x5D~|RhnF$GTzeGB! z&^GEG8vx+@_tu4@J(Nyn%|^)!ON$U0k>i2ti67;=l0~fyF{^R=RL`v1*Z>s!p~BXc z(wS}1*gg_7`q0=1M#S zQH0~xY?i9aALH?2Pye?RQdV(ei{R-~7}Q!t-T!lE$zENq*>%e1j%9)_an?xGLHm)D zoIIt&;lPKVPe>-*8Ey+ajE+nf~_ zN!-Fev=yOn^$(i=wAeP-?@#;m&+B|!exl7g!rb$Oi`%5wH_(?#c0|7;Rrdd5R{Hhr zx@<2JAn0<3t6MZpiQI^x=oGij>8cCvJ2f0q|8{;bCsbbW(KYxI$!m(VQ_gPOZ#F}3 z=xJ}!5wETvg*P7TDVt}@YpTtc^DdjKYfzlecrd)S#KmvqzCpQJo!_jj3mE1?ZzH1a z-g%?6XlgNYa7NgE-s@5Oo@g&Dgp60%-o(81Khv?!zvJ(8G(8<}R18}ur*a**Ptvri zeNk|hA+WY5%v-2WCVJXZIcZ^P-J;Np!p;ktuDSceq9(EY+lQEO5pT4YUEl1Bal1QY z9Ru@n>vU;l&W@m|w@erDDcnvwOucW2!8VWBC=JWD1N$)p5bfyLnw5s;%8dnXx=1oN*iEs)HNLz3g(;#UAGT9ixN2 zH|i>{69?OZsoQP?qaEzw&BMz>!^MHS2AavEbIuL)R&45tC8FhAhC{NcYYuE`1Q!?Z zgChnnvzL?WT3i&RG(pbR(*S+)G2)C{l^4zdgam`a{zC_0eE~(|2f!g{`V69L;v`_k zSYZKrjc7}5)Tf@(dg3_1M5DqX1b6Pz9}*Yk-yypT*=$5s!%XGk(GS7^sp%KZZ-UO1Jc5aQhjA28aV~6w*sqq-fLbhXOJGcsZj7 zBTdM$e^YS>?PY=Yjwn7pPUk`ufIqrs^II@hP`ZhD=`d=2&N$OBSlSsm8$AbhEQM^{ zJ8WdJ^nD$fEf57$C>Bx`%wzO zineUMz#dv_izis>d9=;`S7SG5$B<;5cnTt?d@>LHZvM2XGaMAJm8?hgQSfj-yDJ zu^z_0TU+WqGyjPRgt0No4~|KP%@llI)w@%6m+Wq5RA}zrR1WF&0 zwLTv1=RTYO3DJa~;jA{Gx|Z&4mLhnZa$vgc(2m({0qt!-*$Loty-m(^)U4g}=J~3G zN*^+(Ir1#;z_?$uST{FSvj(VUz;*uMxP3F{S)A^;D^d018;4CH;>ZjJ2bxT1a{QlK zL#+WIn+>65Nr*22#Pz2v-}Gas=N8Q8WTGN_wk}!R`T3K4^H-)%)7Xp$+Xas5S9Uae z`;#M`v@n7skwj0t+g6b(wZn!Xi!LieZ<1zVacN}hi*1cY15EE8ec<_&-42HqNiGno z>wyZ0$iM4Hjz-GnWJqNCHO{|{6^8QsmWNkY%x#8eQfFHGaL9U<6d@nVx0H!+$RAYH zRj*l2So<>=GVftweUj`LF=J%eF)Kh-)kSer=hK0fU55i>f{%V%2Rp9}TH3EY2^aXb z`*&10eX-@+=QQ=5yb*37ZoiDGt43BxmU7_dm}*0b4EFBo?|~na$+UC#+NMn%O&ua3 ztrq=HOC}LUbbf<+-WdEjc!u^rYLaZ8v`IE;59A%xC6k10r95O#m=ZAj!K-(|`e1LE zbLTChBGmKOpNQ!L==~UmeB4TuJnM{ChkR8y11o$ydkD3nagDQ~QkZ$uT9D)3a84V@ z9mM&80NdP|;WayoT@X+saFhL~;dss-S)sG=dHx+Z%DRwY&wP-wt1Xz)7o*Bt2zTzP zD`*g8g1V-17MZp@o^*Tb{D1Yqb^$UPlEH(}PBn>)RqJ}0e#z!Qn>n0WNC_RDecS0C zI=gJIzwx)vARD;Y9g0^4tc#VwG|ipQ3bTs#d@-Ly?OJ@cDZajmVE$qxj2y>XrTxMI!2l$_Tcf5quGPmG z-d4(~VMz7>Y~sx4TtR)NH_=v=aHWO>CNgc?9m+|mQ3egqmn|1Y;)a}?!Uqa-Hh-#n zo6-(pWEdcY98F{tKtpgFFd`dKj;fPm; zMl#s}yru|8?Pys!pSaHndEF2VpvMIMYSfC-m++bur%X>Avf7}(ZHMi1lk)b$R)~iG zp*_te)g<*vz;lgy#8#=i}8){UGxT`xD68S~c1 z^F^8Ma%-zGV00K96m-vAXm%xv+ZfyZx>$8u^o8k`r^rYSj32-Z#^gAp2TWn*aKk>;ENI`;{QCSF#r3@xt<9r%;4 zJAEs!woSf=7O62@h}U$L)a&fi_cGm-@8?f9YY(FXh@wZMY1}bXFH(!fg(DnPT#VFz z?CG@QxSq&HM1N?y*Bz}=o`#YLgf3UqtN5Lx;Onm)&on;5PQR&fC_EjSM#0#)ATNNe zxhql|YGvl!ziMr>Q&D(SKqr22>z}u}@Ym+?EP~3UD4b*b1fjwLG?6J99UTj|YqjWw zX}3E((7PZM(7bA7T8N`mjjV`C600vMkHd2Pfi#7EkJ98T-j3C35HuP*?q3+=(2UQ_ zAufFIyh%^f3#Zz7`+$F14&!$h-y zBd>1tE40B&&VfHnbOD$2Q!ECl5oj|1EoTqzvP8*(Vc}5myTsHT-Ip&z z-37T(S4; zxonEbd;KrsBR{_#b)kLxAnJMqgWMEAT?py}IeUPaGMlO1C6`X7YQ>JnyYhseWdDsX zmbT_f%{T`wRLd!y55m`PK5C1Hxo=KBZio`cZ^rr|iAV1V@7Igw@BIYkIk1f@FH+~M z*_wl*Lxu2No3QeZ_vF_wSnecnwoV3*+?iBVPy${S~VU>+pYn_PU9eoCmijrvpNKpy&as zXffm~BF`)e84Pe@x+D<}pjYbOrc#m+ZavLLdwvlfb9dhbmd)Ux0fL?Ureo;LWi)Rt z_@PFH31^xfu75x(Byrd{LSLQ3>`t<<$Xg@Qv=vj#Ep&0EY0?S%4f!}FySO*A4pZ)HCec%4V zMn>vvV0kzCzYrD^*m&pdN5Fke8=E#k5^l?$XE8%_$-M7~ue3Q-$s^+2R)<8j@|g8U z^%Z~y(78|#vsu<~3#8c9Afo@;_&V{8CKpF zxXsV%YN5Gsj`I4Fv1Te%9F!lJUSj(`7s(vZ;{l6==1xAX0Rnz61kTPqlFQm-lVZu& z%CQ$T$Y#r&vZ+{MW~g8|B$b&>Kr|-VSn^K>gY0n8L#EFmvHOg3jMK(zD_o-f_3^9a zHpB`*;!sERd-84Ju-n(e>f}IvFF;+y9Y4A|LIJ@QXI4)_bHi-S9nS8rVCJRJKZuin z@i@RBBB7w9QRJOikiYb~Q!8krypEM|p=YDCDKh$q#i@Vid3=gRj?v?gRVPIMpp^w> zSGe3jim2c|;Ng)rzx<5eQmEMMmxcFHAt{x!?@n_=PG@212krNMz#=|R?w)nN`{Q9a z-2@-RcMUArU*)mL5Lt9rixmQz+p9BOK`nE=HPuj8&c`6TgPuL>4%rhQ-w^LT`zfgK-IJdsi5# zz{!FM*PUe+EgxXHSBZuKCT{@~xOmt>>8&pkGkZJB`IKH_5eBT+y`@ER9$mkpgrc1V z45$?1+67#ca@ugH0%SC2Zz6nJWRObexFya+Qo33u(9osEmal6RYza|@Lp-j55hHqEo(hM$x zhLd{>8Dv<>1TjY7kTNzF%Eyi^C?XPjXC($^@=4H;D4~i}Ao7r?!yO!lSY$#@pr*Hw zNkO`RLvV^DkWK)0n^m%aQ{BEygaRNm-OJ?_DB;pgF&2d|tax9KW;dy`slbVWD%Ukq zK9h=J5@H^cE12ekcSFz|~*?6QoD>U^FnSk=i)1Qqr0Uk^L>J&;rZ+HAAoi zZl#eB`(cg%MoY18fwO2gm|s91(nmtez+&{uSf~jkQ8`FPmY~N#GLzXMK`4n+k)>w2xk3%Kzs?pLt!iz1nI~Jy+o0<08DygmjNXl1Q|K8 z6+RD!(P=PD8C=yagS;4f5;H1QKSls@;C&z?;nqan&fp#=w1dxVz*|rVUPd3m6&x1X_#+CQ&ywszu~Vq*NnkDO?OsQ@zD7_64x)KfD_K1#-da<6y{QFc*+UMF4c*;p@B%oDeH|p^$A8Yh7E$|Guy=`VwCiLy@Jf3|AnzU;>JHL0Q5Z?y^ghsYV3tfm5@2Yu3@K3yhZ4`U_s$jlzHy*si@RK~1^ z?NNLb>NJhmGsl@og8=);OY~WW6j}P?+lVMty1sWQLib zz8*)1Y*1LYd_*Q=ULu1!BCrcjRYSxw!n#v@2o=2oZGRykqlFleKCT-DlF39NhJ-o2 z(9ixx^?bs<3bM4L|F2{*W%19SynliE&V_=CCJP+{6AK#$7Z0C+kVv*1xy15FNXaND zsi+kwR768dN3WQHk%ZAde56-iarc)ZBuf~w70zr*%mc*Lwiq#xeHSOGr0 zb3DaLRH-%IWLxZU$ni)jzs}Tmb-AwfieA&}dsA=e?Y*n_u7vzZe(VRLZ(9jDAAg~< z{-(~=#k$(dkGQkKjyzQ`)$g9TN+Uh6(FO&9*7@)=wBO=IbUWS1Wr7ZL3;5In&{ouKr^jC~kC6N*wp;O?) z3D7S;P+b2CTv%oIF)ooGAILnNYNE-vh3pz@2_Ax4+7TexkKPf%YFRomh!yLo0K>jA zcX`b>42T$gVRMZytzMGx+X|FM#wHD#E(Iml{*pw z7WQ zIZj`BRFq{Z4eVMa#dW*I~SqUlfrfocRB3HkDq$pXxlk!f8y-9NoqE^A3>wv;wqSRw&jw+~g zG6HO4qBYgc3kdN@iLA9GwoR(d5Z3`k3v4b$-t;j$bRS7t=AB< z*o!nNAci4QlH@U)ksB2TLq{Om8nakk<&LpTD&E!F@)yP8HQ2lW(B_8N*qG|~tuaw{ z`(TY&UAK-73hUYBcTLLCMQ{Lg_@3LpTIQ8*3aqN@D&ny%V357wgydUpRP-2;zl>Rv z$XhnFqF zS^@8V3-rySqivp+krj`4oGzUaPcDl0UV9Q&O{_{d6nu}>yXqLD06QELrbtrCNRBEb zPl*&LCq*hqiK?VbHBzDac>@Uct`z0Nw;-s9uPuf7d50NYW6#HNM_t>V&pWJ&HO_{P zQ;5~!9WIM>gBtLm4hjuWXo5lu6xyKB0fjCo^gy8xni&JNw~~oHGA(H2tTy&!%vu<( zdWKs#!UNNEoC27^k!eXA(y6zfDU9Z1F1Sw@dtf)%I^wihc$)9R1JzKSH_dFYGYh~| zrO#c&+HxVg@)E>QqfJ^GIREfk(7u$7vXJKWyhE0N8Z*^Rf|{7mE~C0yFN?L3k1-Sd zqZL+Bn8c0>GeS~J$-c|8efwAmVb}DyoiIPHq%?nN-Ej>B&UfMs@^2uIS)`mxnw;$A zu>o~nffHD7KqX42C_+GX5^w!U#huHrPkKSkKIIE5>U-H~29XKv?$XFGzrwfiq zC5Ukla;Aa&CnFgYv6pKV9!mmclPuG;VS>%zl+2fagq22YgeJD~@0f6>71j?oL3Z zddf6}XY;+Aw*)QNW}qvM66WudwqFqW&?Ac*td`|AWM6X!qCo^%+Izy#o4E$mT9qu# zO*+TlJ^kGD3*Rf&ZtxA>2iKyqrU&49U61x{#c8Fe#J-h$1> zr?8AqMI{@elSe3qj(ao5{rL+q3t-d-`><=)vSDnfG+I@W9G?e8fe1gz*uBxp7Bwkq zKAdXon2(Imy2BTxZcELRa+WOwAe2b^6&g=ub7NJXyT%?2-b+cic~ z0(Am|A~9tEi$>UN(5Qn;;>rLXjorsS0Z9%52}#%kAd(_t2n9`OG^NpuCUSY8&;r+_ zlmRLlQL{m(4K7J519WKAu1X+FJ-E~dSsK8lAzT{4r7>KZz-LWSXv2EyEM<`Qo;e6& zVer5T#PG5T0A5?IK~UFhF9>2YnHYhv^)RsWFxq|vA~^tn_Z&g+oIoV!$;66+i-(1) zhlQJmg}ahT9$t{A7yJcXIe2?G_;@(@dN}wgOY--E44ru~^NwG0R@;PPb)=r{&_S%R zs(wPPOJ%EH4b(0!4nUy6ha9i+MEs>82bNW7?i3l2P2O1Y~_ zBG-??&bBS5!!&G~)+nYy#xHr3)&tKiIDX&vY_lgRjQWqrWZTivv}l^DVHJ@lYF$f_ z)%3M}Yg*F!enh3~9P=^Hz$i8C6@mb331l>akR}K-8m$`UHpTPdQ#MCIR=I~Ft5{3S zN;(IYuW1%y)?yB&@mzViE)*fhXa<)2eayJTmZoW6a=Mn_SkzrrMGf~eZjeQsJk_d& zAfVVd+K>g!Qr{h-5Cl~u!62dTDHBt9t1Co(7FKrYguMU{bu|OP#~%|G(gL66nL9LN zED-zrech#*cn+*fDEN3)H?a$cIut&aIsd6intT6lha3Kud{e@8eNUbF*%PYz?3C)< zU_Q0>TG-m9vb^ov3q!C#ekSfktG=WM;y#zA$30S}a9a+2Y}ic{+lBRGdx2(}b1=A8 z;rE-Si@aoLWF{uq1XvGivM5aCv%zo8CcKvYjjqtfqcetz4Z&};ddk!GGzvvGyk*3s zqM2SHSj;(cWVGg`(aFR#)kt&>zT~D@uR;OzpKsQ3{S0>GFYd%k|y|gtOUd_7KlCW+eEzfhz zLnt6fZ0fKp2N?N*9a2B6VXduPnkY^tPG`pr?F}>Yy{+c`^NVeZ=4^mTLbz!YB{q6> z*Xyo7CfuW$EfdX+Q^dW`-M&-ZDZsQ1*Hx~*((HgmX*32DEabPFW7m7Z@{e2zu2aOD=UkZ$ej<+M>G&4S_?pEW zE;wH_Smf$n?e#mpGfv%e3{uxInR&(772kEA-I(Op*Uvjr`WQ(Jn4cT~phT8Q)AP8N zvSrOL7xy)WFN2b8^&x@x%j2G^z6t}eNccqk0Q9K^eAg@rVyEw;*gDxD8#fM@h_<%3 zRXrkE<#ltyK2X(bq0vQb**0CsDt9cUH>~*h0IS(c!xTYCCWREWZSmEJO@F7rg%f+@ zi|be1v>mGU_Scvaf8i6(aDcSohPX}>`yKVfw+X^$wU4fsZY?pI2y`p%`v)9rsbOeK z%u+R3(lr>V_W3JVfu2QqoFkj4_b)i)oq7Wjy?0U6y(bhdVA?}$UsfzijRI!*tfMas z!%`InG$+THB`_a@nn0gLP!}6F()mo9XZ!;rSG2TiP(WEH*LM@!7;C@vjIJNA!gX2Z z5qsCv#akhj`I-;*2Kr4Dayw6S_F7wB1T-<7VjP7&3KF79P%=Ud&4EHn^HA{TvMoSA z(6L*X9|LND1qFa6qzWS)!X%Vnq^D@u6qd;)<{hD$k2Th^Dz>OVjhhaM0#Z2 zk%xcPKyNNrThv`tWGfFbQ>+E_AD}kl*VoUsC#Yel{tke$yVy)BDcR21#BzlqQ{D63 zoQq0cum=2hp|*w^E0t;{A~@I5sW0n)Flnn@abKtAr6pDq1bYLpmZTlVxYrsIs-*m$ z9U5b`#E@pCVvbPW2#uJUM6kDGkZip7i)_PE=p%zgQmB;qPD`k$P1HMv9g=C8MecQT z3^6Jv`^{BgbmK$f>DHHh{!Uqpdt%E347CJVBeEGE=^>I+INp;PV|{I6?XNJcIz$ny2vAhJ~?n@BIQPY zbFzvD{0$>LP)Dw+0?kKgpS;;Bn0IV)X=VolMV@XQzFD{N)~n9Z3^tBpp~(}Si3D?; z$RMgPhG0Yf;2)qU!iw~QEssZFR(Hp)QHZ~Z&vbxjlmQ=3{$w~?8w(ix-{ zsiNMggF!-dh-T_1${jEj4)d9BMKMB1ey99_c+UswwrjTJc2=20(T250Bu(@+B^xLT zHM$;6sj72_#r*aEK)h|?Vv8>vQG~_R;&9n!zNu0CyJbky#U||Hg+59ZKt^C9no&@=bZVQz7R0)yC1!C6vcY4pAd{tGEaLdw<=v+QEe2EUAtV-ziQe7k||V{b@1^rTpI;~ z&t&xVXw%vOsz&Lfw=}<)(M^VFpsvrinRw9An)S(tvvy#Zo!O&N*{Ly9ZN!p5SBOj% zp#aTaV*Zv1nCXtGu|!DDC<^WsdBGqttJTkS*rfu^9G2MDo3lP%hGHPV%v-gtjTZy; z3DnG)?tYKGO$@{z?c5vcyF!=Px=k}+3Ee~i%$bR68#07@^BBd5Hi_bPkr$16(@IHM z7w|TwT`my!K2+vSyb6w{Q6o%~82rRUW=-6QYjhL$?x$7MJMSvW25NNOoBEqrEF(Bg zh8wZgIdWQ!-n4>?oNi#+>z8F+=(;|`Q(yp1F&KX7Sg%bOvjqs>whjPSc824XCW9#Y-@7pG2ol98}`e$3*(Mx zi)2}Ulm=#9{&B0bB+!97|0;63w9AP6%7ny#kgr3!TNYvY0J9#8ev1^}TqF}PFPl8w)~>s>4ldrR{qk%r@e~h0-$@hcMBr_reB15)_(}0L>D{{k4m)~LE1K`4ogY6Q zvgRfgP>ClHyjcXGn%cW(?iD>FtRt2jPa(iy^R#<(t?uJ|c_JAJiN(%KBPjQ~& zmjP>7m9?Fxg*`px9{>Bly*=RfLpv8vW}Bs_OL86xE*DrUEMI6v~bM z4OXcUbQp!%(D7H{vkJ|9w#vempPw<)G^Mz&C3T~CKg+{TAz5isHm%r@uf`{SQf5!+$FcDM(nmlL%!adf zb+qsML0owlwmP#?KZ{9^o0Tj=3$IM)<&VeH4q^6e4-}lixFSgu9G@N`SH+P%RxF8V z<-I%i0K>ZVJ7<5Jtup}RYURP)xpO@Dt5qPSjjT0HWOFex*@2pb*C>^NwE#9Yl{ z?33w>+kVu`_A#>WHzhh9$LeD;k}8n=yHV#eR)LipNVJah^jo}JKeyf<)t;V#c7>wgCXkX3(aXY__R3sZ4=?ZSB_!sRd65kz6k%rOhs)}g-OM8e8?u5W_Ysh#xnN#M)VOFq*gHD^YZ zTZ^*43zILIW)MvnL!+C-KKbOZSgNv8Gk1Ayr6zmdda%K{*sM_xD|c)qBY6v-`^AMh z#T7-l67}AZY=Hn8fx5Z01H!b|=~C^l2h24v6L(IlA;Lf7aq@ryXXO;Bh>vDSE5u|y zLU&H?cXyi2^Fj!HA=I|B%22hrW;1LU`&0kVoGrb00_s@sIB#-95@biO=N8C~kYb98 z>!I_irFfIl_c3`PQF*@Uy-6;}XQz%bE(j-gdk>@3wLQ@)!yAr5eN({UOAGUOk z%vRtX$*Jn5Q4a5&#?nO&_Q8x<;Bxoaj2G5B~<_>q01EI;7#WAJP4 z+L?!6m-i4Atk^zwqr>B}^`~X>vdOU$Zz`v?Hwc2C7 zsgrI|DHlpW>C+QoPbY#hrh%5WIwR1HXsuwEp7H0$5mIIR zkAh+bPn=Ql*69VISL&SZNTQI*Bxe=vuZWT{>Ktg1vDnycrwdGF{29^$4g1y};dK}xc8~mMWNR=UT)M91W z{4s{#2s>&rLYa3P;s#Dl>MgAiR~pll{4%eKhv36}K&sZ31j6cEq`viC!Rn=z+)Ida zs42A~wQ0_(E7XX~ysbk>+|=B9ZZtyB_>6k3kHQm$a zK2&NTsQ+H*kB;WeJqI_LZS!sxeRniAgLMxrNcGTMBYc3?vu5palxbM8sE2j{HqIOJ zNq~st4NQIJ@IxQCX*qjTFMysAS5q{)vS_A=3NLcxAd%xZ1Ancn7@+9Vh5>V zb4z#4ZX2_k!|uiy{@tj1Xwf3@xr5r#rw=cuDch@c=u)pMd`DZI1(+ku7Ess9WO)dj z>?tuQHxY=-3QY6H@iWv%NrJ8_R}~AIrpnh&dWQl_{r~D2JlH)AYI*ZEyJJLFVxH33 zwA(?!XcBwgYMHsOGq@28Tgv7rU@?TchvqK=Q=57`qwL~hYmI_Cxc#WqF7<5^%K+qB z>s+%U_i*dyR$#qvtpc-bET)PrV25kb!_3-!HQ`^yQkl=HsA+QRrQ@Ret*I*SDE>OO zqSt7483ct8qYflW&1KQKGF9d-b~qjXDe~gS54EW3OFUC1hhk>9C}wd8Nvg%_u*s8v zzsWxdAkNR9Ha!EM=;oXas$y&9F)9Rf?){ zTh5nQUqR!I?ar~#hJDYvp~UVjIoeVe1kD|qJ2X~R+|*OaODFGX-4A1V=7Zh34Z zMMZ)N<>B*o){4C zUPVGhBIeZ_=Ai4=cvE*>a&Wo_Bo#Rf+*xf!LLZ(L8G~2skJZ0S2r(ECGZmke7|lpb zuH9>hjiB5tE;xejTw#(_MHUVg^cxF~+>~nE#Z3Cz5ovctE z*tNsA5p2X?(kJEI_aZZ=`G&lRO5XH#*2#yx!>H^2Q?qAfxEBQ@kmbx@nQ0GW&@g2L zl#p~WSqhQ`H8NFNNoNEY*?;~b=L?1>&905^R#5}hG-XS?XY_!ZM2*KRG}`$J zm912w>c>JSj-+v)y5iBD%PXWo_H?;?w%KW)rlMo4%6Wazf4<4y2w3u@kg2#Ww~Z<- ztIEr<%|ZEBeAP2FC?ytKw|sS>cb@Og%F9MLnjqIqE7|b(oYcq(stiN6veF|fRJzc8 zGnGmk(Ms;IsaNnof4}z&hZZ^gowYI!YHZLatEK0vsIfn;AiZpDOX}lloE0WRWdavR zH?P#BRmlHILt{6cds$RSC_WogsMdU=K#@X!cscxTMKP5=)J#<84vaNwu_^W`v$eCw zfH6@Mnv}F{NG0Wv?+`d>zmsU*qbE*S>l^l_2GybtKF?Z1M2>7b4&bb8n8~Vz7J({K zoF4YV+fN|0Q&mD6ljtCk@EZO5tB$yeM@^A9K<%Md6n+`$jtwS{Q(fif2p!S*N)jSS zo+n&9l%74Jx{93q`{VQV#kykM)|Z7k2}qg0=eeW4@{iA<_4NwZui|k7XZWSA(8-&~ z8Ble#`U-%u#hQ-P7=*}>rPc1 zh6uZL4U+an^|J~;9S>^ow~CJAlC1a^2Gop2uaipPa z21f#)0H}4$y6q{cNA`26G|q-EQqq>M=g_FzslriWVOksdQFD?-Ab@p6p6l@|fyjK-J*x5x*^RHN@JN^-H#rjIVETTy@H_uh#gC!Op6N;!F z(O?3_`0*6Pew67e_0K7Xt`NY}9I1{#elpn`1SA7NCbKon%E-4A8d3!W14)25<89TE z5lvRZDn#VNgy_O|Y}K9YEJ&bU&GBCB4RsyefUR2#LddsOn>=mbUp+T_0CX1u-DPYu zF7nn_J9mwMo49Km9B964^^u>ZP`a4f5iGS~EhWGfv*_JQ+pm}=-$gwf8+W*ux$zKv z0;#q95ifhspV|dA-CgV5jPA&c+VWW2;$Vx|Sm@1B1R4Y61yx<1#!gR{2hPU|@tpGc zAE8(jo)_g8u5DIwGet0x<#La5zln7XyFj74+)Z{Kh7I*i%d2YCWgZ$bD#4v$%rLF_mB66DpRp~@w{)B$$^B$^R>S@i8CYk)V{da4 z%Lw$06Z^9oc0WmS;}rC_P7C`p_%p(76UpYGp z3j~l~{New#hQ!-uUif)kZvt?3{?M}^@aq1TMkV86X~rOvMu5n$U~K`~*<%H{S((vz zoHRp0HI^64GLpCq1Q4nd_+6&*xTj(2HxI_s=q(R)*%Lv=GHBUdkNLM05NDaHg5|P| zthT8GoEbIJ^j5yraTNjuTKr$mdd-L_G}WwSnhzn6p8BvavNYyvH3Q*0+|ZzZC1C~s zvtgx#(4uLse;i=3a@|9{_^PLxw!boe2Q^2Ho>Ac2U5*K*K*2IIvWQfaLa8C^0|vNJZ13RGwel`n*PheE~c zg!XeLDMTOUTLLfne{R|-g%p#&@i8`$k?mqy4iJKdLkOTS}(zoh908lUhW;qjdUZuZ7F5p%1t2M!E zkuJMKC**ZmXirC;;CI_x#MnGZi1%&cc1Gf6~4~UsJ zAq^QKeT~He#qAg6*LnpBV)o^&DWJH1y+51ZI~L5!GJFb%^VlPHzS}ejFKJL6DyWH6u8A%3K~me+Y^I^cj}OkYL3`Dq3xS zUS8_~btoUc?*9yjrRykKn!-}`@UYVunQ|r348rO5AJA(*Ity@)<|qcL4O_;%QD<2) zY(Nx>Rn*|71Z8jrYzb{R>et^$tMxj^l^`9nXa%tn>A3iT=a=*56Cu(I!y|;VKTmvw z@A^>_wIECg1Au2?KmH7rfHHt&G#qG%1h6f59s`N9Z48X=voSa(KaRo6O3WAnRdn+r zv@x{mfEGMeI$6J_)~U-lqcv;Pq!(YBAR)Ju5)&(wnQ)2C=hLXy1LGYTw?$^5o(E?x zDpc)i^RkeI4v~;S0oV6czd%sN{6ds#H;(=Q`!u&&HYV?3wSFCIVBPGE`n2&Ev2vX~ zwU_YGl3FiE%~E=EitxoOATybhK-Eb_T%^vJL{{R(8}E(0q0jp`)~PAhcOapT0q}yf zC36Vfu%tu@ib#yo|CYzYI8{S3uv2{kBjP;mQb>sS(zw8b`c}q zWqI}|(Icoo%XzQmS%6|fNZ<9dnUyoZqp;UA{4gV_NfZAmLFm5|eCL89A)}z8p$o&n z6pkeV8wVFpq$ts1#EQe0C`qyu0;$pnrOP0aDN8mn38@@1x$@*IP^d_;QA(6jP*Tw- zQ?5cKEgd}rBNH=>g_Vt+gOiJ!hgX$qKK{U9kr}SL5FEJZX7CUJLckSQU31Be5Fr#I zL1c&mQ6U;chr%F6n2tDV$T1%q9PR697K@b`87R%k@18Yi?|oa&+}Hw{>>lu%_n3_F(PJ`6#Nt`0$e zVdM667!VJSrU5Md*nBWr3&X?YWO#~TS1HorDI&lFFbZ`;84eT_6+glOnwMmpd*ME$ znCnhRh^EDlqhO1f>8t3&+ewp?=v2^<=Io&TCcf@{Fjiv@!SwVG`7mp=@P$dv*MtxP GG{*pT{>~Tx literal 0 HcmV?d00001 diff --git a/fonts/KaTeX_Script-Regular.woff2 b/fonts/KaTeX_Script-Regular.woff2 new file mode 100644 index 0000000000000000000000000000000000000000..b3048fc115681ee6c1bc86b0aa158cfbbf59daa3 GIT binary patch literal 9644 zcmV;dB~#jWPew8T0RR91041yd4gdfE06`=G03}%f0RR9100000000000000000000 z00006U;so2FbSLt5eN#^0K-)QHUcCAd<#GT1Rw>82nT2kfhQYDH$_Kij|0iTRZ#qY zNZ@1)o(`sckdP20P$0OrPQ{=ic2J5&*+!ChSkp2Rs1rz~I>ZN2PfZP|%j9GmD|WTN@oMZAt6{_tM4>FlNS+!xZI%6m@k(BVdqZ9U7OrP@-QZ zDBh>VZ61-poc=-&g!PsJ<)aAAxd%3xm6)*>1gS0Utr4p)ZAlI?JXYBXhb0M2Hmv4w z`qBcVMq}{1F}fMHSKVYN=uS;BpHyJ$R^uB+H$eF=QH}<*T-c2$aJ@P^7yu2 z-Mtiyoie=cd}N5*+qb!V5<%xkrWzK*;WFon#7YEP0wS@>?8G$DaA^vQhs4lIcYeY# zOaSMYc~2@i9Fed&Z5E%+$CDe(5OhuY1SC}40@d3`7Kb8(>z*gq9R_5(Bg+YzLpT%d zbc8If70x*rfWJQkUFOdur@Q-)w4?wTitCmXB7+f#7!2_Yfdqy^BEukw;gHNIkiw{t z%4j!bLxQj<@wU3>1r@=2&hUIs<(xwW#_yGL4pkU`ZXqbkE3N%bd!wfXcM8hn!k_xEf7SyRgQA1A=+4C%=qEsPwNCU*q>FpVo)B+eG zq>;oqDev=VlLi9N^_`>4o~pQOMeQ(Sx;gN#)mBIEr1>+Ja)A%}-YcKQXCG@`mymo&W)5^&tLay~LFf+whwCM3(5 z@^YFQ`4va_BSXC_yK7CVo7Z3Z`T`IVP`DS+xS6xtXQtT5VD~tw9H^7YTutFHDxph= zyW`Pd6S1spx%M;EuA1R-xw@y0ZmV=6$@n}O2D(ostqhdc*P0eU85$wR*vvNi5Jr%J z?q=omqhKUaWEkhnr0E>CtsQ8ei5EiJ6HKNTI25v?W(=G~NPtqOz+a1Gx^n=<>9T?vmCQ*=yO8M< z;a#H$?prRMCCIg`MNFW%^sH|gV9ahhj&0&BwFqMsxalo3evKTs9 zGgb+0VMGsWMGtF34{Jw{>d+1ynNDkXbZN7-pPnnAN)XT(p7?^o<>qT-5@WU2mOVpln?dBqxix!{90&jvh+{Y+)nUa}VFIzwAo2+s4r4m& z9t4{}A>hjZJV64jNks1nz7Ad>AhcF_>kA!43M@jz`UR;=W%_G3XS z>1n4OV5C$2U0)*N5h)AsqYygj2i+$91GmQ0P`V^ySFToDK^Y2B1jQqm^5q}#Q4ooE zcTOrk#BoK6l70p{mWOMMQxA!D`xA#6iMb{9*7|rU@*EeyD3>vo0XQhIEl;LvI#9aG zuu#a1i9Yh3t2R%~vx_{&NWT->!y#SLtc;P>&KJpho=5W(t0ifvA_GBG6C7m6d35?X zMoTaf*wZ?TU1=)vL9STkWAdXQN#qRaFUDurr!F7)X-qU+dN4ijZcn4NxJ0bBhq(s>o4Xihjly3+c!zuuaj&87ZD9$goQs^~YQsr^m@rGJWG?qzezS^Q0-+@tXZ;ejd z)tF(TponK$x@pp0#1n{C+vh=!L?j-O=e;pCE*+(s8-ZyXOS30xOG$CDm3+uh+i&z{ z2>C7G2SJ|2s%02|y^xWRM?5Kavd}F$;D!Ol=g^VZvN=KfYfXVKGUZ*)!S zq5#|%8Wq+u!&GSD@)*iK5e=uG37#&Z5ij<{MH)vFbtg1Zm^t9EIy-U()4)GaKsTvixfM3|dWjNyLC+>nh80JPP972#z5W{Iwr|?`K|AQN@@rygHVwGw zGjiHaB1?Nkgvrd451uHAB2kArBu4%e#xY8ir3%5n><2ONxZhi9%5#zhh={bb?r#X1 z?Pc(e+LM@prZkqR)0ngpK?GjmQk){*LD3eFNgjdk{5C_x*;JNFrUm7H6qYMwNj%c; z=RZuL@V7DQyCWkm9{EHW^&DC4^4QgM_p6I4AL!B3{Q@!z(18y}Z6k(wGpU#NLH8F~ zCemotWn#oWHuj6)x$N=}z5p)*fgo=)24d6G$LaW&e~K;BU%z zvlMP`aG?&=J(u~?p4{hI%Ec|Ccv^$=#+P-X?AJFjX|pi~4qq+`^$vrxdQEb8LQ!5k zN+Hlx1W)jmiV>bTfrN0=VcWVk39e8UqmUa^&@~=z9G@Ir3<4oOFp9x6BG#z?q!$^4 zG%!Qj5ew~!?4%~pA)K_0!vgBLEP>w}@I)EyJD>iIL|KzsYJDi?dDNg?Sd6#mS4@HE zkZzYZ=_k}u^HPudxOLFO1uWj5y9Tz4pywwXhRq<0Wc>^l*k!DppXx(A|G zfc=leU3WUo)VBwWEb*BK$i+OnR#J!42`qmqFr!!EM)=m`gJq=N!7f#47&3p-zH&&U zt*3<+LTU__&gY7&+=FR21Tm3QY72?@OSms&@N7|$rOMp(X}EB0K(Tt&94!F->jd$f z+$f@4PEx@U<=oYmNvNy+AI?)|<{3v|MbT)P784gF(7^h3Q5m3YTbFsYYp%L$B{(!) zVCKv)s(#4oe}dXO@!E!>tJ|e|Q8A;D^f(cS30RWYz$GQLN)>_ib_wOY&8j-TDF4Mgkk_bf zblNF1*Cf8;Rv)+2+;;4QRlWc9`x}c|Hxp6ZC&UprfRjt>jLX!{-Eq>c5F8xV0pRkv zDerr9z0P8-z8+O76IsP4rf;}Z{nAIMoty<*^3XB|Zfhe!bG2Yf)pA5r)lCpdjYk#s z+oh6ylND?pt8;gsCW+>!sS|12c;rqHhk06UBQ1kZlcTJXuDJuR9N|eH54OZol^s&p z?ua?^l&k@Hh!nKXRN9C6tuuG$O0}&~@QF4IC9j}VmXzp9Glz2P$xYs_Rq5vdW#9t9 z$GWFm*KLbfI)lot$dN3;nLcQ#Pim=iM8bCzAmpsN zuTQYta*L{!p>gwMNHj~y<7R_8(K`(5&IWEBac^`i+kcB=x)jAeHHJo&645-AJVujC+Cd|1`ua-u|)WswBqFie%u;LaR1v|YKR5T?s{6m$K z%eh=~%B_$(N7HW8!=aZ3Sh4C%>XIlC!n#BiF(~F!jU)C_iw`zW$qF|RoiouNdHzxrTctQyH*djI0mA)w__Wv3&6vKc~oI6da(fH)qf z7Y_Pvoap%otehAq*O5bHgOWzV)mr+zm|L$!_;uXR2zl6;mhP$YT=3Fr#ckD|VYPi9 z?5Jm2$rD9%)p*8bp4S3hpv0Q_xb#F2sF;%$9w4;!f036uH$x@Y-V^oy-A)tfhfa7( zoIw-#JK1J6RE=V3Id@4&#Y3x0bOG+g0_*51tQJIcxy)tA(x})S^59Wr1vKG##Vau} zIlRYO|7+(Hgw)}>J5vW)+HEVp%p6Kd&R-0ng8HcDm&1qs07=-hA+R(jefmi_(1%^} zMrs0#hYs(h0@97KCzE$EN~yJ}U`sl12Xpl*VyL-|ut~ZPG7I|+tB~w!?Iep@-huJX zQiTdTv|In~$SK1m!5Y<`JU!_Lwr-i$agxEcEdi&_B9hiWN;F5-+A*L-tDDt9rG@>u zMz8*{2()GAjN4|cRN9)_K3RQ!@6?;CuB_h=5d;h~trX;x@Hyj4HOpRIqh*B)Cf@aM z&T*^LNI+x=2@oFx0)lBac0Rpf}X(eM5@Z+|s&t;4ijacmFz&N1Sv>9Q5~F9Ssa}pKf7rE{@BCR6ig>|*IB}d2Gd{`2F_@r zkc%KT2)+X}bmLKkA_?NCbnkt=rvauSwI}fzDu7QHheN(cw-2$whuBBzWWnyw?*wA6 z6y#9RJGs6$9KRVd0u1W4B)NU{a#jHv}r-EfxIb_q_ghN)Kp#bwcV#_Zhxo= z&f`-5E`mDf^T0iy7md! zOun*+UvW`so2MkeZj?e5VENx`MKP|yr5HvSM0T9}RC~zXto^$sA-O$g%M<2391uK& zen>3c1Vbd%%$;UYu)=sfL`z)r`FUUJ%FS}Kwl}S$@n4Cu#2n21Z+aq}29rZ#&DiD) zHunCPRqpY+GB!3%+yrof%2CBL&lU6 zOU!^m#eSnAmNrP;c>Rf%_*bNs+Ke2HW5wa@w79t<;sioJ%Y)H16#8rC)LA%Vapi|y z3+{H;+ZeNSZy{UQy`g$+Ds0WTD;_4qcn(_H6-$xiR@!<&l$Z#AcH}GZMD>ib(I=*KHt&6 zjmStql4R}F7w1>emy!c$M|}6H2QTa0B9QQ5{(Np>*xfRuNbLf$5Jd{?~Dp4&;10vzcI4O|d$fxh3tbpo;{J(A5nTTHSE zPNXy8bS0G{z$tt3e0N1GYH~Co?$0Af7N#las5^1dVZDW%oIKLBMOYkEQ$PE#Cb^oG z`b71jHJ*W#N!jF+2p-7h9UZJJZ3(5Hl61_d7Sr3;)aE(ML;j#YJuW+~5erHgpwq5EHes4%5h z$rqd^Uvo5;^?Is0r%~C~Qd#2hhnJX)2ibIH9Q8`muIFJu>JY5=|CYQ;F*UU}UX-v9 zXC>uVv~*N)tKN_7CLn~;OhxkC`)?xeOpK;k8auh+`dpHhG{PY0}_m zBzeuYuN`!)BKc4iBBiC({nKVJMw*U>0lfLU8yz?Mr>?u+N|;)7AdRLc0%tdblU=z7 zYV} zXb{h7InS@PDpr>;=>gTvbV2O0!^O1(UDX{<$B}t`AzS`mxEJK^;|?sBa6b+<<(3}a zz{Nz-?K9TWXnnvF+Bg6BE`&NyffRa*{CBeK+E~$8$(+J!6L6fDog6^ zF8{9N&;o`}Th8Sh|J=Z@T%%^Q%b|IsPtkH@?G7g;7NK zp_#ReURAoy;57CzN^=R2jKC3?-p6k*t`E=e@hE;@%28e4k%hq8=+1cv_53pk9VRJK z0a+t6@F^(!_<3yJ;ez?i$J=+-)X00X-Jw%i-X1G6At{A1>ss{TPNPfIf^!M-I7~|* zMe$3&Q#m*Hz4IeAN12__mfAB`J>7GNB`|*2PruUg#J32=oP~#9BY}QFkyYbnP1qg` ziFnUB12q+QV)dP64*V~BQou~Ma^lv;OXR$S{Ir6NUbn5~f5P!Db4ib@M9z3Hs(_o8 zb!>v@hk}0Qa$H39E;D)RETPep#hk>O?R=#AGtDb+Kb?{|rWo6%{XQqOa%obQ*EGD^ z9n1<+2FcP6z2!AU>Z8f+|9fw(-)7SR@Vk$7tD{_hu9Jijrj_||(4PCUi_7xX$OL+x zlV>r8 zF_y_Dn6u>4x{TVLB#nerFpWeLYn-vS#dfQUW})X4W%GsXii(OzWP!RtUODEJzj7T9 z!~^V$D|7iuLH0>{sZ)N;e2Vf~8WsODU{9J!Yw1rB62v~HE z^SN=(;$@XtD=&P;V+Ki5!1rIAkdUoskINp){vPtxsr`4wR4D>BhZ6N=kbl{8Bq?!D zy;A8&jH4qGNV1^Jza*vw5Fl8#f~3s24$yq#GO;(+>)DP8pyX1GUIHPZw)STnE~Izx?>qNu9SWz>a|hh*Q(J=3tO{yY8GIIDrTTbT`Z8gK zp*89!FkbZjxrOW?nZl*GQg>c4rL4q$`<&-je1f2;ulkPdcxE(ct9ojFfbp>~KeR$Q z*vMV;Q&Y-`3TfM_BzLc^`6}zyS8%AAD0ZX>H>G6W^{|#Sa(?8-_q?2x?64DA&Qs}d z5(Sqv%74ya21Ar51`VMV2L%L&eXzun#`>v(@3MG-dj)f6hGcLT<=BqF5`CCs2D9F4(?ni>g+qBA! z;E5YvyV++5RV-Xf1XrS1xDdxi?wmQ`XjM6n?Q(dmO;sO!u=<2J0;BKOSoa7AShlbE z!nkkKo3n&_FXNv-V5VjZj?I)bxIGsMJ%Y{^W&|V-%{r)`zgKCnSPTBM_|+nq|@3gXH|CT3&HPpzc*Gt z5Fx%J1UNRIIDahoq?e}){YHToZocwqW6Na#E&OYAm>q5ZDjJ_X`c7I+Cd<&pCHdO} zW^+V4L`wDv6HcDM8yXaAq{%mzw0BxkUd@>lH?=tiilnyE!y9S_hpO1PO_C{U!)d7K>jFqLzB!bA$}N#T}rhO%WzB$tNZ z5<)69R=jL#DNzk*^quCF8p|1!snW5B3{MXj%b6BL0K?=nfVQ0EsMyZIemipr-y_WN zXY+*I`k~hQ)3$q@)-}-kiMXL{N9XtNPupO4N06MtH8giNtvmKJzWB`()(nhdMiIW$ zcD*j%Gi@GUVe}nY;EyL%wy+`yeJ1>r>AYS&kJ^k-XdYn>(=vxKzWyenfp1ZLJa0BL z{;Dz0?`Yg|TU=C6{1{{&?8z-ZlbJ9_!rl0i#-Vjx63|2dJPTuA1~LU~lx{P5d|#H8 z;QEHldx}q>pWF&(hrg9daL}9;()gl74D!^9`9HUWhOkb*@`l_tt$USC?IrT}S5102iBo!l%tW&a7FX==nDe`5uJQ z+|^eBo#*Io&RNJif2U^93KBQ1nB_W2DT*eD@0=WZ?$yb8LPB_zNyw7N8U$s*hgnV& zLQxj7mgik-IH6`i;CUE*-&oJ*9;kci{zG!GhPFx*bh1UamHPl7?_D*^G5@*zw@Y$C z{yzlw?7EjB@ePPU^cDm`kgWP0`8{4=is|doj^U0$?YO2&T*m^CWKhog=!Bc1FaQ2v5 zv0z*Yg|j&vzz^56;*%W7^@2Ovy0P0kI(=*)n6}V2`la7<$B*n;>qcv*cQut7^em76 zy4$Pyene%)5k6Wbba){>b$0#h_gW*O0)XxdKhfVe(8wwJr*e=loJ$tY_dhq9;@^Mw zYj4E||8_t}laGsB3q@-t1TJWL<`Ad)Q*@id!4CfX5RoZau9F&jBqR=5Lr0ZMp!8^l zn0ZZdW-6>Dsn0FK#k(PP%_JpPZ9{ylDSs8s5y+6ChyNn2oA?^uUNK|zL#9ll${8K; ziu}wImRN*<9w+=CLQTzmk@fuelmU~5W}0CLP@_3GVoh`aB1bx4Y!^BZ9#=b18HMP; z*ox_%_|pznbb|T&%9fiSvl}pIo?%@&bQ&d=p+#ol>u9bZU(Q%)sZq?K%?O9+PZ;J7 z+e8Z&N?CcgPfdj`{#318G>KAB#YCgkk7*^p&peeUQ7Hs98l{p@F_=V1>DggSubA&L z@BuYC62q!$lciLeKe+;8QTLH^x@(w4m86E@$PD;eDkcg`F}jL&P>eZ$KSerf@W zY!uKBNAlrj>iPom9DqSUI})<2_Zvb$j%PVob5S#6SyM9!tt>-7O@$6LFFGa8rk@fQ isFOeq9&M@oI}Pp55h!41eSwD&UH=U4=~t{3ha6jZwt}$$ literal 0 HcmV?d00001 diff --git a/fonts/KaTeX_Size1-Regular.woff2 b/fonts/KaTeX_Size1-Regular.woff2 new file mode 100644 index 0000000000000000000000000000000000000000..c5a8462fbfe2c39a7c1857b9e296e62500a8a8a5 GIT binary patch literal 5468 zcmV-i6{G5RPew8T0RR9102N#S4gdfE059|a02KrP0RR9100000000000000000000 z00006U;u&y2o4FH3=s$lu0*3V0X7081A#sZVgLjn1&II$f_@Bv92*KLBN4WPw1P)b z3)3bP{M7+ZMOOX{84}{EYouy;ApBw9=Qs{FP0hRc*Aw?6B$@qzw)yYf9S4VSgo05A z7zl`f_8gK{O=qmAg&P)PEyG2}$L+WKk+J>AkO$&keSc`inv`I8;lfZX9KysS(r(}i z*Lpo){eO>B_-D4>9=lQ4Jw;-EVp5rn#HBiO$nW6F0iq_%%*u%teFUCQUCBk2umWHC z;T=0b2M%fJ5Tu}V>)WEfqIOq3`Pfp?*=cQR?WNZ{fxl%tWuiAb5bdyx_#cO=`4^xu zIU6TZM1Hd0y{z@q#Ti!WmDUDo!AlDZzJ^FyYFPjKwchMKuU`jQCN44&4%xZeZ)VaM z>Iw9pQ1?tKHJ`gX)PV&ihmt4+B$tKSm8jTl`3SqUDz(;agi)(Qro*~=E~XJE+y1^; zj~cs9g+dBJ27e5M#tm0NApBGkyr>fB+$PCBP3-`1U*aN#ofa z02^*flicKVM$I^z1K2*B1YyJ(FGUq%fXH1G{AfkE=`W1K$&zE1C6+lsJW0GylAKbt zQ?*<5it07BOr4elbKe!AtkmGpl5+x9p0 zZ|dI60tDeYQ(a*Ypw;(-$m$iahgImiU!J@L+Lt(%ru7-Z(zPH6_(ytVtOYs%r}kPv z&gcpdaCuxnK&{#W5>lU%!&?)sOEe`$mx*E5<@Bl(f_o=|NFmrwHPrPGFbf}IG ztTNfMqe;gDX(iOP(J?x*J_Q>6acGs1a7XGvMmJX#~Q@bEQM`qgTq*x4WT zq4(ZGTG;vRyOO497aFhMY}@8jBxxvm36fcqYP6*w<(M!zCIfmnCSz&FQj3IkG#n1% z2qmI`3W69y&o&?o5l29?2Wq%&xn+t-NvE8pD`^-3!z*6!g$qgKjbQ7Ml~IWd`8vyVtgXDC(9C<%!U0(A5s1EYikCQ>4zi4~d0ohFf6E zTmWf7ujlIii0w=#Ee*KM6|rh!u~Tsm$hB+B)~F4yZGi-tsJIElqXH?Gln4^8STY)c zx?n0Pnjwt}WFWchY*DVL;BPbq8KX2FL3WaEQI6F;pQ)c-c#8O_Ck90?-1e)x*VBz% zwCKKLkU`$vx8#rpi$mt;UJAlomfS#^1;;9ow&hoOOhcJ##>9OjJ+<0DN#+?C5r)nw z;sFVVNX0O3rD(UOl-tb!H?#*5u(lZS_M9m&krC@Xk6fMfVbvj4z~dxd#!V+dHgRLZ zIY$J=tQjmhrln_dXYnMIm=YNj9i&)+6ekFZ7bGPJiV_8nk_1i3f=?+zK&gV6uZPxQ zozQu8&#RQ+$3?^Q-3?kTmGXDM?3Nkw?=9mnLCVuz2$u6}#cq)%RN$b7Km$P<1nCfD zK#&Q67J@7YbdZV>QZ+8+BqMQIy4rTTrDgOn_HNY#a{T_$oEDfNGL)*8HO=V^fBS)s zA%QIUt8!)=?#^2u=F`lJioSmvlJ#=)bo-%|Jjka6=H+98-N)YdbAuj}QkOw_2Et0c zZ#tLrq9WzDqySRMFpU6kPT!$|LX>x^f}&FxIbifB3}Q-AO5P;U>WoT)XS8H( zH~y58SEfiy|@R;f~qL>VG;=`?))+CkG zR+0|VoKb`vK-e?q?J=XQ9A&l!?1&LOOZrx|OHe5oVKxbcfqFBai$XyuCAOF|d5HyD z&3Rf*Eh2-XQQ7MUrMFcnAZygUP)@8joxGVHB7#kx7qcDsyW*F zcQ1=*3d{Do5iXCXKB?4oHmHRIfeGrsx!oMJzET$z23xpL(eRK|-|VbD-{*R;i@aIX_`JvM^)2-aEau zuZdwdtJKsudv&FA#`euj8{(yk`B2g!$F8Kj&9u6H6rIZjsyxN{?^C@F7rGT~w<^#L zNp-cxFb>$99w{87T0^AxNp+h7Wv2K6#ZuOwO^V{38PX{sRa|zoQ({5VP?;U?p9fq_l8p#!hrB4O9f{-0 z6LRp8{0C1AWH)Gbv$oqK7y`H(fzRYiz}>C85&KLtd-De*-7q5Er%Atn5M=O0?%+mp4-f9P;3c=77GUUta0CGKY9 zVN0|0U%1yiao_6lrPTh-e)AWbare)-^@mGhEZO zsWun^uJS`~W^}{L)W-B|&s1Ff5;>9Ng+4fs!LPUp; zGb=5tj9_^l4;SnDR8nmeh%!@TrFQ6Niz2b>&7YHVGqBa2F|;AzV>Ecw@Ls&996o$R z6C&MitEJlQALbLwY_lmFjo=njqehKv&6>{)$*rp(qY&=Bu}+F2j#OHfpD7YKte>_^ znPlK_B{9#*_b#13Q60X|uVgC^f;^xPS**kg>r}F|KFVQUsdG>GZMDWy*43ptP1GtP zddIA}6GGyh&uW?SVtQrAWE$WqUvPEc%F9tcA6m*)J2|-$MfN*vrMa(61;N%7p_O$2 zgstqy^MWx*nytZl9d`&}%~v6HpCCvX*U6oQTVWt_2!j{%-e;e33Z+#_sQ4Hck=47@S=8iKjbR zfdpZq3AUA$_fOPhU#>fGnAi4wYfapZ&pK0+6KZ&ePt;wm$)4z!1N}*pjmHx^pbxc^ zYXW?*s_ zpqY*+uD4rCWi9LbFXq~W%Et>aHix0E7CZHw*Y%!3#kO)`&EUEmyWxg6t+wj9KlOh; zw{YuyZy4;W^-y?{KeA!TNml@tZdMc&HJm!ux#8=__1wxmZj~)>KiqYC zzW?w2Unm9oPn`SRyze0OQx)GKl5w=Mym;iW)3F)mr6a+Aga2UEo@dre;b2V(?DSh@ zl6oPd5*C&?tcR!_I0^>+&VF>f)eQOV>N7n*Onn=vU%AT(3qMe{$g z(N8bCOTxY=en7G+{@J{^?G?uDZxA2yK7KDpIdT1eTgSxvB1&n%&`@_?U_S~%VOJnGj{T~Tg^G%{;`8qi(A|%_V=sNpZveZQp4q{lODsSbL8ZQ7vT%CygJ17{f$#sb`fDB$nkcQ! zGv+uQG?~cvu_Jdb)f>tu2WT>ZS0UMw#-o3ql~)CxANi<^CSqgAJ@Pa0%15G4KHu

    aNwB2jZ-4n)90Y*Z}3&c9z6gi%=8fLLhXtD3v}-uoY5RHSqm|jLu6>y#645Gc<5ryOS06MIVird z-m1E1_HPJWjEapSP^4IaB6M*!5)S1FPtUV3r*{VUx%GO=zDNxu2dsi+v$v=qw!w&v zDv1pR!9MCM+IWdr!?-9;|M^cn?W@!a`>F%{K3%Uf0>g}C2$TR&G)`)pXLki3SbkA} zKd6zCPI~Ubc>V!q>CV7#s+zx!nbs`(FN3yB>D<{4;1ebJ3>Pq> zEr5S;GBH4x_pc9cSKptDx-Oxs8XBmlXZ*0UX=<*>THo6#tpFSVML`brdMK%;O&Z@AmQ=bg zWTCF4qD)xLC>u5e=)ob`zIz01P&z8=6t%i)oCL-mOR z=OCAh#a-O;PfWf60jLPV^R-sm|GMWdaNk@=#vP~;E+Avf897+BvmIiRsdYN#cLS)d zeAtmNv8-cM_~&EUH{EkKrMFAeNYoc@$WG#?$(NM6#u1|Ymgq)NII{70q(nG_HO#;1 zviAR(WhKG-J#-OYWF3V=EE-_pLJC!g?dbnM`ZIq9G@3!I0<49EIl(5O0k1ZlHA3Ja zI0Y_6oU?#^YaSSL|}l1pzBFGRv|GD}NuK)j9S=`v2XrgZJ5-nK?C8QBe^Q5m7a_zjt8;&K0N!0t8ua zZ~t4CvoSgIc}*xKEdhc|zGrGq-GJS81TK37kLRq&DZG&YrU0~tLV!ICNEqNA)2)db z&^$qho78oaO}TlhX^bJxRps_bd>{x2b*r7|aw=3P!TLh_aI)fNc3 z(Oy0Rly`%*mB2>=ls^oP%0`-tpZtRDkFcJw*OrlAG7KDZ!Phg{bjgUr?XFo)J*rP*B>Tl^+*u+@H` zboYsJ_EtJZn_RF~8*#KYyWVCwTb?^wp7|R1AUrL=PJRS)o9t1EQspXC_Py`{^wm$T z0R|eR&R|2;8)l?YM#BWnmI(`(#T3Rdmfm!wJuRj2keb#Y%x-(2#B?tfPF|<|JS2`d z7#NTh69-fd?Y;w4rk5WGDLnMl-w-g+^e)i!ItbR-1Bqj#Y3u9)Yf7x2uxLxGu#wd) zrG+^!YnYSfxY;+Wr)3VFrQ5jtX`JaZaYj%5Mj$>YM@y$@I#1qYk||`shVcV*^MO~R zo{W3r#<(=jjAQ)-(Su|6*g5_iTbHgME63tBO`JxiQO}rBRb%)lo1#%Xaxt&T8;038 zQb+uB9+4wtXouH^9CrlgJ8noM&S0eL@c#Do%XG$=zUzxV>YZNOxWFlnu%FJ6+xt&9 zcWsw%NaV$GA!56JUe$@2ozgm@mP&@cd{7IU)66C}w&B&)Z$pg?VhvwDVP6(bLlndB zn>|MTu5=3ssenUrzWr8<@j zPHFOEO!`J5(db_u7@sI3jVR9Hg^5u%fwAa^-F^UhQf_v4LHGyfqMi7i+-w>7pLMSn zG-6~ksth#s50pk1M3Z3UXuZf{L`y91O!H=wZ+7!>lXtq+Ub(*fLS>#CZu3^LOEkBE zk>*)GJ+8@`tSeb^MQbdUC(k1R`lt5Kom5Z0t+C(3IzVoCWgb4#G=x|u;guD1Mf1wY z7wxQd~y9Xk%C~hL^S>1B_d(BL;G5acNVw3BM%uB)9pP*e%#uS4c#UjXxBUF4howg*~g^p(Z=nk82( zTJz4j;?+!c703j6JMndk5(Y~Ym4JwVARXva)x2l;!YdKwrbG{6{ZZB?wp`7_Jy}0e zGSWAsAE5uP3fO6q%IEfn+z@_M;y>fmWC(orSPnbxx;zW73qu|ij|?MQj0PNfo1Yw!Nom5h%+Te*%{V{ zNc9WgxWc&}o<5eoe)Ff!XK49MbiF>6jBvI_hnA7z@)>`kuWfjG1*dZIjK{} z*#r|gnq(3elT9%Uo7M~-j+rAfYaBEV+w5VPGk)fdo%y+$2LW4vc8prbFmw)PcQ~$t z9NdsY7_P3f5{Dh(>*(N)jns+pbS4`UQh?prFxP3k-59Z(N;s2pbP7lG;`Z=U! zS-R$-`kG}KOJoZ1b}qe9yd|sH-s;a|bwH!Ma>T0X82Y^+$-}Co35zb#I+hN-T4>#U zN{7>LfPCj2$@Y{7Ej|JuT84BQlR|FJc64V07+q5^GCqV8J3SDu(!5?a|C?mxMENmWW>JvpnL42gPbb>FC z%MrO8#k6snM+l`VW-HvyXG{0EPi9`G9Ook+^ng-7Ht8X%RFSRn45swlRGy#G3ln>( zT2Ztp4M#~bnvoUxq(mphS+!9MJ}J3+ZT#&U-uBTZ(xdA0KH&@ETgS%?fB#8@;rn<6 zL=UFy4eI-Ulw@gzc^S*;i-!MamrWb_+LscaOUo|6Z{13F!UuoBmaMPsZb499x4q%n zu4J~ix2TebG0S(_$NlEQpY!Cbke`542}-a?ht!Lqbbc|;E!QBNK?gA3xhPIJP-#l* zwB7G%2Y1gtr*#RCAo1a>W<+MXU-(Vm^*!G=+p;!(W3rDBZeaaV!E@Ol$BAB zuSKO+EHZUUZda}$Ed7I5&Hc-N@PL5lBd~XiBp>JEIv?aWc`s!BI6aE z@SXZ}@KLYNdQbeAvAJzqRiNH$F*9=})Kqykg{OL>&`%xslUf${!ZVzL@TaH*P9-AN5p_ zT6#9D{uZ{DNmZ%(OPDi#<6t{Zagw@I7gqh*^zG`z#S5}G`HkD{%bb#)4zd>Z00Kz; ze}%WM!6?zrPc6#``=Z^PG=reB38&c*7gEEH)M!6T}&>I(7``?T^1FZfn+sw5KL% z_{hYlwI|HOQ&V})-S*VpAspxVm3kl9Xj{>^8?=KXbtIM?Ft%*o`bcqK*XD9(yD^T3 zVz_{3O^TJtfXHQ3eT-6Ez0Ik8 zTW1v^oXfQ8yZp$90rYI+hMS06L!AtB$8dL!cGn1Z7dXI8x*sFVM|$7E2hInm<3qIV z&G5-c0>Ki0h0c(U*o)HQdCU>$@kvaRK(Jga`*+FX@h{V`cbfs0K;n+?ZjjXF>~L~A4ruTG-#)dSn9 zGoPhbf6(U0QAe&=*vf#jz0oFB>64kSmr;@$`xHUrO~zoIFloBBzWzpV{$LrUD@=8r zp0q0sHz&NURGF379(<$>GGdUf(~&uw9|da-D$DzEeFYLhiM?Ftk~wwPV(HkmYa5zo zbDK0qP*t+Wmix-PWj<)QrNeEX;bh(=Seu(~171R!jX7Egu@NGq-OQOpimbOr@vjn2 zd4ZU~%0N})$~e-Vvg%X=2y&{__@NgFUaGS8ka8BuDmlbxzZ?7 zS`SZmDiSUvoUxt)38xN>L8^WP*4n<-S(|baNj_Z5JBb1~{fAGs4N1l+vTf;+|Jvmx zJdV)foy`YtN7v;Gb6z?ppUFaL!jaSh$mEd&GH~JmTzMg0w#;T-iN6{L?IwhEV~-Qq z0n{T_GubX)re2ydWC$J*w6M3FP9vnVinaMRK~jQo4>biq{)C*mD_FCH%*!AEPPR$W zSOfzB;eOeG$5S&QR~u5aA2r<7`7B~6M71zIjq^1U4Ma#HDl9zI3Hn00feGt<$I(Pb zKX2Yl1!w-Nxzy0{a)^3i%$WkoITsEGAY6gurUcDLo?d7P`bCPN1L>kZaL%v1k+>_E z^puMjwdBR20}TNU%}`N_*WUd_C*s%XQ-yO4WMGL^kvF<`MZ3i}ig9rVrSo&^`8h>R zZn8Bkg^URIlIpP~?z*Q(MqHsx!wrn{)vnZCOuN`*hL~(GqCwpmMak-0Tku^7wO;uz znyXizR~WTK?JooV5Lp7r@J_Wr`7;0x4`c+R9k6WW&Jy!^Hu;ULl|`4^gz z5Flm6jT+`o9AVN5N8i*`E+$YbI0;*wT9Fca6ySCWNV?QeU>r2sDjC7_l=r$(>}Pg? z>Ur3^I*PkAuJ5+r(!2pov^n|rlDZgR@r+bO+t%_Ur3Jqu!xK&+yWFpL!`c{(=~a3y zo&kd7L-E3a<*=fJk^uPFiw7L&-KmFcP(s8P zy?tf&?zZ<#53fEjb>w&%x#X0gCHJ&V2fv&%Vx_S_-=W-kh_bE=>CRR$j)#(zkmV#; z=>yKgq+y0Hb4GvxKm$zSE^twp+7sLFP9jU?#J1gj+gwgTq%ykkpo6U79t)mS15Q&6``dewY3Qy9cuaZnVvpvV89p}5ym#y z?zEUKcAbeE*>)UYyyVOSeNZenO?0!l*N8;pK(7h+PbBThQ`LyeSkIom)o zb^$$<@YeOS(6CZ^sEEALH`3OEBQMG&Z#%J7;H;(Las{pGzypKHRzrA)dhxPu3l=nG59SflTaiqnx%&| zdBLDMe~KD`CRPY5^cerB%Kz^T$W<{^OrV zh48s6S>FH~*kmCrNp<_JTp zOtDR(rP+h$Ut|JzKgOg&1xj&X><8I|lqobdQQ*O3Us+A)pL+mPIn{Oj(9gp`T;yK@ zk=Ah%Djyas1*B|Bwr}ssdJGjt;c-KbU7&SEv64R``d~WZM15^)ED@52^M`#E@QM~| z&Lk6a!5kYZEtDH^wI8`Q1cyAR@F|heid2v3<4eCPC~-ECY%-M@LJ%%&6sd7=%~uz%lqTU2!I0sz$0jYJZ(ED=rQ}XQ1w!bSWh*z5!J3xQ6>=F_bFFCuj{zSY`CUzTh-IS}&I5YF z3}C1|fZ*GYB-H>q;gFK%lmOO+@-ABJ}oL zcsYK`3E30TAtmC+_x1ysd_TwVT2l8Tkt=<4&|sW(?a}mudi#AD@xGWLOfo4ksKKtqaLbOXXGdkG@I&2&JX>HQEo8`Ujs=C zcB9R{oI=389r`^sOdyXm8&dGPi03;B}jx61DVtG z6g(nIfx;!rF(^$>#wDZ>AWV`0OlfKo4gonWy+lT(>FgD7Y_2@{OOUMu32e<67Czap zhVRv&7@sO)%Y_GDak3PpZ?-{e&ZK=87up%vN;R7uwm%Vpu~8qxXbf zys@7b1n2dbSYlI6L(8Z@|C!6Ju+l24t+CcR>uvaP zW$orec$aU+;2~ED{7!Xg_!%4;O>L-TKwyD9NvsncO{7V)77Hx2$YM(@wajrZz4F={Z@mjb7{U<=kr4$^5e?B1 z1KA+Hu0KUH^YKKn`@{=2{^gn;{Vxh2&`WJqps-a!06(O`3^UErXtp`#nrFTPo_Ok+ z_2G#)^NkJAgkMu};{hk3{d%${%YbKmWQLdCu?d81fD14d^y=2KTYD)oK?>iE;I=$> zqkl~#+hMy1h5mEnsc)0ze*VSBJ`$6O%~iHZ@BiqN&x?`fv69Wy+FyLt4MVED`ngLO z*tksJ%dGBq?O_<~G$vEp#T;=T4@a5+2h^U?OJW^F+*H0)=0iKPDe8duFmFh^qGEZ% zjQ|~-hqCzUHz_5^XC)gcgY1S3@?vrUOZgPB0l$O+*@}XbVMI6B5)5U+xkqE8p^I(3 zs=s!}fjS$~3D7-&?2tA<|JVv#Hg|?!-u+3r956>DGK?*6!6x~Ge9g}OoXDNrE5g@E z!s)nV1p%H0&xJ$aP&g8fg$v*ccqe=TfkaForjR+vJZ?+>zomdS2tGorkFSR8^H~@0 z3a71of^a4Ta}2&WmVbbCfFc2?_w*0xAKWjhVW7_6yN?aP$6o*+A5ZU#Jqmpk{P2s( z9@ag0wr(Xp0Rgjs^`3#a??y^6Zf51`ZJsn$+UKwXo&``lII^5z`}liYb2NEqSbB}kGYQx=14 z`3e;&QOeAs(nwXR)fi{IIulHCGLD?`+e7<3@xoK@<0MzTJf^y?-?i8osRO_KuQk5> zK^!_0!hfc@VW%D1bfF?4qobfn$BuvtK38lK3LZSE$bF*}L@PibJujm~ix4SR zlo)XmWk{7KU7i7Q43un;p~?(4+z@?+8LQT4W7MlKk=ls(7^6TbS6p_-UAGbb@-Dqt zaRY(JLp-C`S8iz`kzA53{xWcU6I0uO>;M#*CV6Ci4k1La>ZHFJwJ3)8b^9d1Q>pO9 z+??7nkEWtWPnS`kuq67r-y1ly@P2xlMw=k+@x21O{}8yl6mOqA_wTv-9u`RVcv6f1 zRT!X}%EVYp%!w<~4Ip4}6$#kS7ZoWm1ApX@r%%Ib^w>{(ip*Ow)05BMiZ$te@Z{(^ zbWx4rju#xiE3%;_&bUgVAb7Ybo2tQ&Qm{b!bi4;f4o%i?GgEPg;7|)%V}`_4NQkyH zKd{Z8H#Nq!0{qPj|?~js_R zg-<;bWQ6*;6sl!N3dhhDR0lPe-3Iy@Bs&3_9V{DABfpNOPowYf)yk~zSv4|%dIj%N zm5yWj@OE<8D<3OPnSoByk&rk)kQleub&92onrEJ&I`p*aXp}N{2qeYtc)1KS++2Df zC%uuMD(>%S#S9r~Q8CvX0R=}v$uUrI9JDwO)SLhfCqbK2pu_2TYY^-+De~PjFQ_g1 z4ie$XzAoS>X8cv&a4gUGKSFo0#5S(u;PmLyM;IUs5k?4Oge8P!gcXEUOHY45DC!0Jo1= zv@kV`d73EDq~oz_PBozJP9tw3=?M5h;>f&s?0?ed)y}Anv|6Z3rt=k%Mh!wT3VA@r zBnt_R%pIdphMABt&TbNYEgQ>1GRxWQbVUKklZ@h;5h{*IE#QH6HGnZGW$ChDiLhr; zatcPslU9n2#A$(~%dFufeW^cS0K3`j&d6L zjabv9>%D-U9Rk7{{kCU#V!d|POCow7L5G{|*p9j9C^v+CGw4@I&5l^9bOX@b(!$VS$TB}vfgG{LobI4-b|uQ!C}pcO7^ zLxIB^Y98eJfOwX!^ql+Gn%qp@Dl^DMfCo{!?URpQgW2j(^nx0rG%C>2-%_I4i*Blv z-6VB`&={q4z@jrs-yjS|KSo2dQ=0vZ6f9Q1A_be(??}O6J$EAG%zM#a!UjrD!Hqn4 zPJBiv{rBM->f}?}UnvPzyA48}86AZBF_giN&Dj;>iYpnfNa_@o6JDx%>H|F!13i-h zJ(CN_6h$&sQ8^9OFs27#Gz4MH2*Q|IKxQeDMnzZ6R=3ef*hj2=+3jjt`4?PzqxVDc zCnp1f%D<+7m`|b zWx2^T){wugVJScljENE=FQiD| zy*4f>duE)TiOzNc+g6m)6eGqsHQru}EV1Q6s+5ol)n7>|_Ql`EwyskwVu9ApmNtIi zOviD{g~+1FR!X;wRlY8)uh&&7eWy)FuSu7ILBtH<*+WTERED22umI= zv%n$N=B`r$9e&q|4+cs_6>_(fLBUSjZ7vTxlht8a`T-Yms+5)Bkzu@FIt&k7-N8wz}GneuGc?>xJ@Zd7y#+h};_9c*eW+C6h@_^vaZd80g zsXb2?ak}!k3!bExWAaz(YZB_^?h%geWbo+prM`HIf%-Vwu0Sp$xx7q|Ije!IPg1D3 zQe)?pfOjinlEYGlT%lEbL|LdiR z)k1GUNaA6$O~^K{U8AltNJA>GboIe=+4Tix#c6b^>rNv`nypM$7sR*8B9|?;+39u2 zHMz{_&)v7go<6pO`7f$2$I>SmG6I=1C2xrOW;GWK=Kjhr~G44i5yK1{ zkJ)|oCC2tr@HpK_HGVg6X*r%s)^mDCIFA=#;ij_l2+Xiu2F>gd;+8KQN{W(lE z)_adS+U{ZJ7rpQFNS!?Ng<;9>rvNLfCOdd`^w|i9m!ce+Ut;qcoK9Na8ef0%HV=I& zjvzE_?txNw?4|iL9}>Ejzppfo_+Dw){4&nloW^B5 zj7Pgx=*e5OB=p9GVjZEZ-{!49$K97F{|iZ&UVG1>?>ZA%SOwfoLQ3#EvU8-8W!u8iTuZjU{Uh-WeN9NAGHD0+v_#|3QPC8- zbgzep6N8=4*JCj41mxn&Q&3Gk*)EMoy@d+imlJ8`8BGa=uIu9~< z$aWbDbGx5YaHPaF5#BX1lt5|Q)=&%gv;686UVnrf4$_rn>WYPMEdl{cNiy!+R|`h&^w^m};65AK8&I@1wI$~$VMy`4Bn-5G ze@l={SmfY=t&@jH^{MHF#!m!@urRq>KGzWjYejfVsg6o(zK>AyE+e12333tajYh;P zUez>ae+8Ku(=Ay}p$}Ik#<>PsJ!vmzdDlRJRLQzWg7g00m5nzhDU~G%{EHeZq-8lOB{1q7Mt%# zF{78L-}QrOk$emFCkn7ka$~bxP$OsTP5*qM1O8~6${mXE@Ck(4IWml*cF2$tGwop^ zph!o5ujb}|?7AeVmx!-{O!Q&z0bn3#eBJ&=SuEhZUdd)xw2{popbTvsF?}@HLJy2m zA%+NZKBw&Q;kZE`RA`_i_4UgDZgy^8eZcam&_u@^O|RT5 z(`$*6F;VmTII5QF^&So}&R!bY*0bA5-i-9|w?^TTVJY1DD0XP@DP4+X+$2LAm9Ue| z1|D(o>gIRWQa6uf+I`DGKO#Q%Q`l^;_ATe)6H4^&(cHS&uv(~3>3Q%3p0TNHUH4!f zg}0{rOb@%Sdt}tN4EA{F_k3(4#Ym|3M%R9nS;&Q6pt|Zo#Qoa`4v?XdecP~_oq`j_ z#K)%B%KEQY!0}AU{NIWf{8Ydld-*!M{U$EBvy5;5J8tTWCfCqCNPDQ4bNyU3yb&hi~K6#Z%DZVy(e<`Ky<$+{ZMA45xNKG!Vr? z4O8NO-zeI#RDn7tGrl1=2KqI@(MJ$L%gw8pcDa#pNzb z7rj6Xt1Nl=8G???JxEKd=+4~o;=YuFN{YL5lHJKSCeFR_>YmA07Uwac2U1Tswl&0P zv|$9K=T2{nV{{pD^X=x%ZCZS8!ZmS2D*7UsVfuGz9{TiRc6eryYF!-5F#UYxdgvCM zaCoU6|BXs(0E&o~+W5#OOP^hG_hfxW@HbnFd}w;lnGK$-Y=L3rX0fKh&9Y)sUZ1y%7jLt|I8? zI&+Ky??Cs}72^~4#EVNkvt#?GIk{%g{B77%68mu5=Q()_?~Bb8=Q_K3uB}xwH|%uM zhmx5lc)50U_vz57)%6M^cdo@cpqX8Xuh3csH!K`XPBt}nOttr0zaLq=q^wj6H2vGv z|EOtm(uwBQ?y1g)p!Z^rv}u$PwMZ}12vus3nuQ`%!1h`jceQhU-cg%oe}9yUelFSL zcv6p}5xXT@Uj8O#<8vK(Ba4@FE-K|-b@55k&ifrU3BVEaWDJd(SiKY_+y!(dT``e1 zkAnnXJy;8iRQk)ytGd`$^8n+bT;JwIviM3i9ooIGx(N}iGVz7ZMyi69p3E3}Qa7r5 zsR5z+LM4cGifsey*EL@oxu6xPC4fk+y)atLO0GgR{|H$M7Fae+*B_rjZ z%QB*uYZbTA4b&Skk{aSTyZ-jG7A(W;_i9}OzD^mG`7KLeEiQG1FclY1e>x{d15x%s z0PDrb8K3`x)~6U`QXc9So~`k!qVihmUx+}N$WrkR9z(uvIh0Y(w-=YVFIb?JrWI;y z>U*{h4x*QDicpz~6#cdT-l^U2EO=$9KdiYi-@gQ_n;fw*hALD5QH6T4tL;ua13IO{ zl2=^jd#Y;KHoBOozMD>kjyqwtQZvtRC>z>yDj>G-OTPG#XVHnO4J|TZzr!I+w5ar~ zEuah#c4l|041nvlwIuARtbd9~Qg7dBTO}Jc5b43XnPDq)s9Fse#?zAz&_X{%@4=V? zUm(PEFv71mEw7E+1;fo6y*w%?Z#7EkEdgn{z2|>S+nXQTuoC%WZIRoOAuCqt6~dR( zlZ8I-GGLFke$vDE{>&ft73iYrV>_eqCul=>Dw|igx*|7Whqwb zuQLCdctXaDXZYJrB~G~lE`h!};8n?>Xy+kPu<$2DB!vRdSqyVES&DwPvJeAU1uhI# zL9~o{5`lUQQO)ZpF}JX^i%95Il0~oQlS)=B{YKI-`CMm+0@#;FN?wOefV^l0B+4(0 znrhDi%Ad0QOdI>ox~JYuPQS z3ZcD%BBOlwhk?up9D$h}hU%LTnhj~b+5vmDb@(S{an`;Ec)PeL`b;UrQT+1F#1o#L zg{_-jXBQ5&D2-j~r`H?jV5`*L%dF&i_$|2ISlwkT z$!{2U42A5&6?^af@90xR)Xp6>p<>u1!q*Q;6xO%3H%|5!E-Kcbjms=K&H{VD-WAUr z=}-4J=i&~QmgZ1?Y5{34nTQ;+%I3?sbWIA>&dTr~m{JpE_LWWtO)!)Se%V7_37hq|0y|Y;XH^7!K6c z1fDoZ6G;@Zj8EvKY#hHW!yi88wk6O90~OpKy3=F%*TGr04-hi5QK%6(W zis0G|NVgEm1^{V4;s5@~L?p5!bLouO`56ZO)T+lHQNwG~?_(ZtbjGFPkQ z*-|K;1Bh6HB@sK*ho(PGBUF-cfBg-pe9m5F`kz^M4eo+^&b}POA0FS8Zf$v)GV)w}d5lrb*PJ-u`_0~o`3_wYmgkgpbH$!k zre4>?5W2aYadr)-o-MG{l!?S)oWRJbYUa&;M<(L`kzwmrVhB(Q=ZW{o6o;bluBFUJ z`-Q_ATIk!-yU}{|`MS+;h;Kb|yg9v!qx7;|EP7a`6h|7lQht!4SQhbd@flpXL}n!N zHZS#^IextFh0abYbo@l$=}t~Hqx;E;&B^6T6Lfjnx-HiQOS-I3LR+V$x6Ov3nnE|jE%0BLfvq`(29ZPX=JF)eCMIz>fQEN^Gl2sA$=y=l?5vfnxMF#5b* z;gj%1{^HbWuYZA;-y7!{sAe{wZwnJemHib?2HP;O^Jg%P1fQC!OTm*+WOm_)6qZYs z_fi*DMq_@J1o=#0IQJZyY-L)dfeMq64bCjmGMs2Bm`br z3e%&}Y4Sp7aZ$l<#iXg+|GVVPhja{I)iUn^`9P)}+VHJAGh_)fRDnYtD3Ytv0P=v% zdW*YRH0HMC1RCoJk?>1R>o=*9>Hee<5KKL+#b$~k1k+wPZp!E zEK|24RE{~tfqE}&T6$7nro8wJ8aZx+vzU5#4^nAE0_bvvvs@-~@ELp+reXYiVcz_U zw<@5yc`riXBvN6~y;$98I>Z2HAK{kw*XaBb|Up^y}vh*-1^UzRpQRY+}v~%yESV;U13esTM>%h** zINzp4tfc^vswLrH==gclAQst!BVX?PIsc1d#5tUrE42Zx$cE)!uN4)2;kZ{s(1O%= z;3(6CK$~J{R4<-lyA<)70O-;~^M zE{YBVFPN650j6WqqRV7R1Le9{o4&X1VI3Cs9o2xkE?B&OZ;^i;6`%x69t2v>Jx_WQ z+kibwI?qGP-EcGGKPZ(Oo&m4?EUp3fCg6rW2-Ax21|Iyyd-oRwr`13W@Unko)pXzK z4nJDJXERv~kHXzwUu5E8pO#7S!(OilI^%pD)dg!&sUYCJ>p)j73!(F6fGgnhIVS|p zgHq|dv!&Vw*<0JT%Fc%ZRu16P4bc}`T10?gGePse>*Dmot*s=`1c2AV(KN`;Xf5*eNA@CIe5I|sy6y_d{=suF z@We%6OoN~O84G&>esI6bhMeQxpD1<5;C>9uJLG^eZ7MwF|MDc%RzIT;!E|U!o;Gy; z-w041gHd|jL!+J|mzYh4%LYS^T)I+kdT2CJ0R_cq{8Vp1Ddzg(LP4C(ZV?DL0K4(8 zj;eZB)@*1x{vVrFuG7e?xpF48w06+k2&<^jX=|!&tEWO!`6etJ&}68K%P8a6qUt@Z zA!yL=X8*dwppYqagh;zKhuE^EKd-};t(IEs*%}q3d8)rQ;^0v%dDn3qgFIXLdyeM5 zPa*aIfX=ti0uOOMsLjP}YVv-g)djLk6BQW*VWu9et)gBmPRGrq;_rmp?mG zJ2TrnJ6$_Hi{lhVCL++TA2gb-&aPgKrn9fN&$>Ih`tIgyLD|`MR$`$iahOmo*&rDQ z{lg+u0^`62LUrPB4=9`P=*ttt%^6O2e^a4&trf8A2Z*~f9e?{pfo8`lMDO(e*)&rY z!PH!|v97#iW!3LCmXXXX7RhWZqtOfr7z$&}E6WHeI89ZR=97%ROzbH{9kp1Y1+r_( zz-Lz0<;x||aGabbHZaNbl^D^)Vp9(6gg#{whCEN~T6Sw(j4%C$^`; z_Dre9liz$F^rE&yFQ_Z1mljwPuI=bjIu^|+39n6N zq<08I!d^3jzNsqZ%yJP-zTA{;ac3_%k;S8&)V+jIL_!HsNS`27{(E;z(o@ zj;dns8F_kG=xKqyT+Yjy$`kw6v!bI#yab2K}=xhL#pAWvyH+ zy@WtqM58VqKkF}{a9Jy~*9OqQ=Uz~XgvAVh;Y9%;TRUjupmozAXxI$_$(>3Clc7@b z_$noXsZ#LsWxI=tb`|9BDk|EY&y9%vGyQ|;wKIeJ=zOeO_-?u5`_$8N2D|2u7`KQU zGQDuIqyR-6>awvNj+NvJ-ql${bw|~*|Hg0)j0N|iyaU-3|8KK>?6AgP*Dcrgb@a(P z#%v#HLN#0R`D!N-b=yE84k**-)0K`yl*L)5_nHQziVyH5(~3|L;n8vzKk8(7_!J zRH5`ZAf(Ffl-rvM52f0})mY2%<$xUC$>D<>cGVeZb;hhS7bU4*~IS}6(droekCvLoI6Yq@)e zloY!w3E!l^w@c(Pj9bXhAygVE*7&`I#uuFh{AkfUox69fmIkL!^Ye(1;hadqo)p-- zMP8gtw>905apI#je6ohqonU>gqFc~qHrx=+U^$2mnzgjo^}2x-%+{5<%B=p!akmK= zWP4fwm6eqP4PCwRE&gDXl`92TbTQ`+;qInByy>^U zC4{&1*$3`{!)DmQJScTrWPw9qo_6=!JMob&`pJI2+|xmg#B?aVV!_Lyhbs%kt>n1_ zum5Yjq9^>oOb1d=57=J5r5cb{APyFyKo!%6#j zUK9P8%=sRf>SrClak-unxP?iNU>_~@B$gyPbThQ)?uPrVhG?n)BWkKbP=%mc3zPUw zj&yw-x9n0Dz3+(ApWf@)OaS_StvZkiq8ORB?eyeFzyZhpe*(%+AeYukx@A~%ORr9C zA`8U#0=i{gGvM^QqP`yX=X>hwJ_}*2X>WDE(>4xrWt&jV&uQFp(l*^PteIRB31w0% zC*7jW7g|?8kh4f6NBmVSR6dN`(gBWxia$A2zK)A`)dTN_5Gsf^xOUwEF{|=*6U6Lt zHQ3Yh#FOI5z1EWx=Vw>uD`_D9_o_#jb9GhuFmCo7kFvX!XO*wxw$5S&>vyChzBCk6 zkpsv=M#HloF&MSWL%(#Rf1)Jv3=N`#@*YJ39a0it46;6zSW3)B`RfR zqy+4R%7kb;+0ynweTojm^CXcrJ;TDdWSWwfaUwG=K6Wy>YI4i3WUlgqK;8oE%+?fDHBI5;QU2%>3%o}nHWdXS5hI~;^U9Xh;5c{>9@ zYDNonaTOzOT{{{cR()OJhKIZpn6ZY~&K5+V26zy^OoRQTO`Ez5E`tlxE2r-({EUH3 zOvIF;RRFBvm|e_3R0Hb?od7kov{JKXH~xzjg}u<>^cN>)iZQ7X!Kly>Lp=l#Y*B6v zVi$al)xgzyUYAF^nT=BC@OfaB6KMhZz&-I-6v%h|;21nCqeN!0YcW|X%qH7ha^`2y z-vIye>LyE*IAY*1+^5PLYsL-;WYqFzfL9A5q7XA_=MA3#b^@J3i@J1f#sG!6%n*AJ zZjCdfOEpU5EO2_(UtthN!-Ui!3VMY=w86LrBM4jo|71&TXar?S%W4K7j*df$l6mGH zm62eS2-IZ&7;JxHm`TDgVFB;}eha-VT|1dhR-U^xGcY`b2f#}Jfs|{)3~c)NEb7QoY72CYKCD{%?$(7U8u&u91ecOlhB@! zH)yoyrpj7aQq?b!nC!SaLz zZGduLEowH}^BjYRc_#^g1UjgZSXg+xI_ESFIOl9!CMGOAWH8}-lw)ZFHXi6!Spqra zX0e1_d%#l{N<%uqg?;()Q8&MPMps$fAPiJI!QA&v5YvVcuz!0b%xI!aF_LwE(jgWki+mHKX$ zKYYNYPF+UVN=vEMIpM;8_b5*Owz+I^rt2u;P1FXjJ4Q@OiBUD*=RBnO8^GXgHeld` zwWi)=iip%mQrgY@QqDIRTx|x7Zh@}RT24Kk|J-5~J2Hn#eVY$eJl zU}MZJXAF?kEG9f+h`3(lJ5N@(+eiy4B{ghZ&$sRuFmP1kA=tS_njf4|Xx0(OVWzn& z0-_`FeiXBnuJ1jbyB<3v|4K!250-8AmeT1Qq`@iGS8AY;vUPHbEiGe zwo)$yHtll6=$TPGPYy)MW>v^W6pFE#OkW4|;Otd7vK1hUL1zelA=9^d0Y73>XV znHy~0wU(A@OxpM-o_wrh^SF-x_WsQyJ5rIcV0yk6XK3F%eyvT_n5TWR1!$sWyM^P^E+ zkW@%Re9JB*k%mYdB!!*03E0kar~!}Y);KeL`LkdLf}6opU6n-|GYURNGq;X^Y^v;V zBVpCJ;_|k8b7lw!)w&NATiG9npF`RMf{r^$>=8ULwgrI<>mUFpbhMu zfGbpDbIVLkJ(#^@TBHUgqF}seh4E5`!-{-_HK5tnXJl!W=7r90d_WV{6^5LwPsl+g}VyF=Z;uVmD6 zuCPs8UXe151r*;?1d@}42SQmQR1u8V;tS!DvJTpCS7n4m2!11hBUY2cHVS<_ zzX2g8`&`aEIfxFyF*f1I7OQTjEy1CT`AEN+XS*r0SzX^8fL=d0Hw{#9VUMbpagaeF z?e145iN-eRDCak0jAVFpJNeOTo{12laRlSQ&@dcn~ zge>dXN0dxVAm|4N$6<2yT352V3@{tMYW|#=lxuAMSH7dM8VJCMK38_yvF0|bYrxui zFvNV-eG6@9Mk&4RWURHU1B$rN%K-)rs%Ibl*6K^8Md{_xMWi~Fmap|D#h z-76tq1d(ZYPVDE@tsKx&xom5wpp@FM#wFMk#A19ff3c9z60$acoWE~H@XeY(I*Iex zq{}d|A{rpY$sOT_Fwqd)=g`vAe| zCG5N0uQUgjCtVqeVz?SEg(>u?=UUVz1@ozj1W@!zR~3*$wi{)6=&PabdIN|027@Tt zfHS@)s7{9%nH}vF1|+PCKoF}{9!g6n_{3!;ybS|R`0=&{0k`lT7S^}YB^bZpmD&=U zil`efF7c7SImn04wz5?U#kdHbK?&WtmS$|TB?>sg=Ihg7Cwvv>+GqBahZw+&$HBF11? zr5upfJP;F4ARd8oluw|~Nc{MQ%=7?s!m8P$)n34j8X1TJrUq|lh=yW^FH*P1e28VH zRP+~O`G-eQ1A|Okg+ik{`e&R#QOM*>YlF2_YRHhnsJF_)JHa!Olk5Oei%YBjB=FVI zhWmI>7XRlsI>Le+o|7*CJcQqT0`SWGQ%UMLk6K9|zvddaLWtpe zG=~Mq$eHISxYLj$!$`F{xpuPl)F*?2c$RR>V&DP*pe(Rfx`37CT$^O)NkXP?NMWjP z?dfPb8Iv+$x%`@hi!r&bRh=2fV9?HjAwbuDsVuimi*49!#=VZ=<=~f0JuhQ(+f-F* zQ)^R~#ig;ioLw~J=V%Ufiv@j%}x#Itm{Gc(1vDP zekAUV#!4Y#3>NDbZ?7j=(rXzKlHzp$kIpGqDY%yJ@)|;H=`n@a3Zmf9)_*z z`}~L82h1Eq=RW{TJkClI_ioUDyV|Gp$W>bc2ys49hJoKSHH?7u8*L_RaLIlTRcMKQ zf#icK&t@+zhZD%r{rz^N-Zf5 zrCg;yq-aT}D6q4X+oJ(SBJLfeW=2hrpzX;8;;TPjN8Bt!>H-&0_X@f zt<)yt=h+WATGC~dIS8d5JLcd_Uonpc(+ucZ%Q3I~0n~WUW7JAk3S^~gdMr@zc82+O zRax2stNma)0SYK0PQOs)>X!nDP8wQY4%dQ>)cDY`cZl+rIZ?$o1u6p>OVhfXWjQfEL&tfEQze&2%0$171}2jRs#Qdrkr5Lo>_H47wAmTGRyV zUXfv2I$vv5L_sZl0(sg)6DRpQK3MdKYq653Fq)(3+5fk1^ryQFnVE6VafFR!A%i5b zS!<9BABk;}t=5XVC5IRvMa)rskdQt+$3Pz@esh0EyZr}Ye1SZvqWA&^JfSzlkU2%} zH7i9?qIods9+n>fCx@nqqG`N*ceuU2H2Y>}R8&V*kxkF0r(3^{`=7hdeb*$%yq0H3 zD6X*}TUWFFD@H@_-g$1tb13mV>fsfP!c_Dq&y6AHi`h~#yQE4kTAyA_>cl*_0UX$y z*UukdANHhCRX2XLXRAGt*Nrch%R5s5c2C{dZJ`HUMgrdv zIZw-f#RUZZ3V=1W_}aoa{2JuVIF8siq9`hZP^_4O|_#u7)}%X-J{4a z3!MH6>hT;`uq@!_w%(B8k-bMFDN+vubPWp)pjh=gLIC~y?(TBhZH*!=X|e=DOztl& z9#TzQpe$^di|%3J_Pv2nrg|*OB9}c5;YD;-^Hj2^67$~qxF0ubOw4{S^1FULR}Q_} zBl8{rYVa9nk$9L5V|n4IB>xG*WfaYK{bJ?FQmdnWPu#2Tav}*S7CsW35axdf^o#n6 zvxMH&SBuliXI%wvdq9wd-f&JZ3*2XRLm_u^e%#I}+zGg3eCM15`qoJrJKp4B~-NQUE1g zU}xM)n2#Qa18QL1LETNc!#*zS2?FWpNqUl)MpPIE(i#`thm60|iKyTl%_tfIilt?a zu8@1MGxv~=g`80&(y68oEFZv(?)BdvU}>|5;WZUXmaiGz1ToDoyI-yiLz5#ok8RQ**C(FIM47z^6TJuZGZJ-$t%=^m5#?J5@B(R(y`?_5=yuzP zfg7L%`nzW(mR>JF&Ux^@Q#nof~hhDW8pY3 za_JaQ?*}MRy6!E(!|)3{0-gp7Lj(R8Wr!tj{la@hiOx_BH%7N2lwb)A9c)7z!T?Bz z=jG~0Am$l_onllNog{OCOB);^K|phZ;ZTDP;I<3(x(K0lT@1_mb#Yo2JBijM<1?&F zA)=L8M?2W6mSp<)=tita^*&>#=NVhfXMzMmLYCET%w2?A@Cx??hd zs7Y-y#jMLLkI#q+hbn|5*;mzRwmJt=BN!d9Tuxh3>TZK#$pprC&fL)|vz3b^F{aEI zLyPF(W1V5lVq0FKXc7}WS?R#fPa@_45>D#0lLq;pS*sQvWXgDYO|IN2XPl*=q@s4t zc^6!y;l(@HMSS1E{9FnSmkn{%0^4lo@4X82v4ZGabKOukw5?a`y%l!zjy!_JaFr^o z7k9bc1aBm2S^vC7Ns=r@s+($!F*YO^EiGh7mk|nN$_f?6F&G~jOi-`R1{3X&?E|9$ za?CbRu1ThtYO*}}3KV*0uOeLzTVrkLV8>pW8>-eS_=9wf$xebOXQ+0=Pjl2sXIQ;fYeQU$-8;Y(+R~79qBOk!(W2=9p)?60bxhOM}@O9bk?F%{9+_3oNwAVoNO5 zOS5tGVO8+xfiJ?B+tvK8e%R9-o4fzHV0( zZ5{gexh|VL5@p4h9nLvaPOOZ5TnYcsV<8b}k+Rt?Yk%qmwZDMeTXpLWbmdW*m+jJM z8TTfmmUC?t^=v4OI_w=9O(*jx6-8N++ZlF6yg@`zOiYT1w}`+cVlZKo2`3XVK;+T| z0UHDYzy#11Kp=n%5CEPM0KP>XabvAtC=V%JSu|9}GTP`oU5kjVkvg(~#-&tlS5lT= zPC-E_^c2@z@79OJP<|$?I_wXJS;Yz1rT1{&(V)z*(G`bRadZ#pG-AwF)n1uKc`&&c z?h|LYNR~9@^BS&fJsS!(+1A_H;E*H+xX}yZQRrF5KmVZ2!XA^5ACw25iDzgA2_TlKrV%mk; zYq*}%nzFIpv|wlEN)?EkutwO$`3hoY(W#jem9Rvljyu|fCr3E=?Ay^YMiGcN()_q= zn8jk6$*!WjpeY!5U)}cc%<>9F<*_nK%9~A_ik6h)zNMSQ!$~X%iDA~?h>cgI_1gmc zP6krGz^TKzI}mERa~x^uPW^BPQ0JVbFZvW67~>06N=j*Z&P-bMws@Po)$J*#Xi#Z) zP0>QB-wfRtH&N5K(xlVLnsbis_KTp)sf*Xeirn9|*98?lLx-I~(v1}NiXDSK&CK#l8w*^$E#d#awNNKPZIc3Zkl-G=O`Co!l@<0X7081Bx63AO(aJ2aa_N zfmIvE;V013wII*kHh`x2JiGe3UZA?AJU$X3Y#czq&Qrzz|DT#P;?Ue7 z$vqFO)vntHCbFGWLp2A%R1vd_4YgE}4%OXRwSqQGlG-ZMqMbMjb>d3C3QLrosX3EU zuBjjKN!)&+!VV8uM`PYoJ}|S35c;lIA{beW7kYy?yay>9`FHZUM-oSy!Nj5ME!nF> zi3mnTM&=s~;mqbC8shjIHpBSIh~G?26S=4R2!H?K;0Py!q2!886bKJ}zCL%n1AA2d zxl>N*J=HU?ZRAgK@)AMg;D7cWME_(aA!MRTQB36hJZuyC2a; zh?FE6;Ws)o(?;qLifE)nGNX&Py9a2SEuEw|8&HrGTA~C6j%o?XFedh}=gj3VDt~(x z^)WxP_L2LFeGol=44U14k)#EfAW>XR7SS37R(c38{p)H90o?z8Q_Xwtd++}l00hXa zoHqq%Z37O#jsmygVKoSXz!44{Qk6DQcJ2z5sw&XCLv7hdzn`CogF0n${@wK+zR+%@DC5wrm6$ zrV%sSI?0fxY&Qi?On*k9n}0@t(#vQYAV2_Y0sQ;$bN+iShNzr!iYcX($B<8y0V^O6 zr1qSekYD);JHP*@vqv2gp9YhTJ=d8_Ny|IJkEo{FV*4(Qu_``Mo{^1d$A_ufKd{_n zTN0>YgDN1&r6t!2NyaNB$IEPDxc7kcKW@nIDa>n&lRqtD$p>d99Wer zQ>)y}Zej^=P5{fhd)#TP%RN@P1UQK8c3f>?*th77c^8aqA)RzSV)}{wd(>3)VdYMhKO3G_|(d50TfgTJz%E@ zVLB<#2fXzFxgI`rN(+!PU?xxiIuSq(|NmS~XS(OL(oAJLV1VoLja&8)m_UHpdb|u% zOf+BC>h*;sqB375LWD@S<{n^r0EBc}$ zB1Vic#uy`_&fojlPqP}#%?$`n*pI1R+V4In0j2}AgkpmU3@9*Q2#jdOg5W8GRJg8w zpxfx_V~mA74VO*jK|HqF$$+E$fU6#Uk&-`>5YSwqV+adhiq=5n=@xw@$j|o_Re?tn*Zgn?85f&xX&Jt%DGES+)8kUh59XtjO|%{J8pV{~e!SE*R83>vY* z1yS;XV%t8DzYSgk1@O}#FV|{N96JRR_pShWYxgtDe6rUo+5fH|g6=PAFeYU^ITqzh z5Bln>eN3%6QXMnx<3d*_&+1O$nNWczjLcrOq@rBb5)@avY+s3J9 zg1|A@X*F9=zft8WKDj63Xin@2KS5YadAyG3xE_bYUClLl4Y zIB}vUbOJ^`(h&@Q?0{Ct5lp=iji?y{{;z-b=YH2`7<$lKy%MOe=XwHo2>0O*+>C2C zTHeK-+v%Nj;a!|MZW-I%*49_o;ibTQ%)*q5#5c0)s_Iio-D~GOpe33h!=mUx4Es|o znj_ntZ}~Cbto>Q;s~ za+48FVvjQ6z#vqj*G8ha#v$C8haEabQWOA;L%;mhyIqT7Yl1?-SRh*fwS{u>pschX z84k2e$;Dw>3=5Szx@Ix)l3DYIXiwvxxOt_$6Q_ZuagVKGc&1b@%~MKLp8BX@w)X5Y zL2yiiSysgCvMEY#4LVKUE%!#O3x)(Qp6LcQwH|xqWbsq;<5sS>gKK!?dQO~Kr!I3z zJ$Ghv>&we}q8ONW*FO=XQ@qfGs!LN>^D7)uYj({^k3w}iUx6Ah0KlVJY;#Kfdg7Kf ztF?{N*<{;u4z;zpNa~WT$*s-E3{G4H)-b5)@q9BOlK18I4rl@L!MW^P7mk@@cVe|U zO+bb`Fg23bmM$@LS}->y|MNEsSl_KmRoa4p$AF)1gY2F0B|)*r3n>g#;)7@eA?=_#XHU@(6MV zat(3;atd;U|F>MDS`q$!oI58xmP{}puo{Y`FmLBaMjsRWC*huY?GG2Y8Mqd>9JmZP z3mk_OLb8Faz;0tremMwFN|^9r0rUs*>6c=k`wH=^$+)SetFh4*^)9E-jBc9+kU1?j*F3}`h~+J| z)egvBh(j%L+zH63J!E*HIi2!hp#|+YEMGu;H5>cYf4KimCMrr5@OYE#ZMH=}<8pX! z5F#J|cG9Me|6khMc${w-z#RWc5MF;v!t2*UJdo~UBe8#9FmYv*8sh@Z@cXy^6Odl_ z5n%YOJq}g%6T5e#iMY9|HYZ=AZE@oG0s(5a^TYBgZpz-noOhoFsbp{AXo^F=_>)hQa4-5;dOb|=9Xzyhe+)5h^_to_87ij+UYsbdiV_r5P2 zC@dA&-yir3H@i@4hM8uWZI0wJ-$E8!@--{0wAxx*ZL{4DJMFUD9(x^<-v6Uh&IhOg z>Lo_Q>2!k05-TZ*H8g~JCSr4Qu|%S7X-Qg1P3+jA*tKhF&z^>T2ULd+X^tF;9lMmc za;53UQ;BDuu{`%&;sYP*_}u4~zVx-kcfOMtm1@^sRxML{jXX7JVy0O$b1hm} zXw}Y4hYprHbzQag^9GaK~|U0=}~vs1#*-sAFyrLO0>Lh0twy?zG5V4~RVkd5Xw$ zth|8kl`j1htEk|P{Usap&-|_|Yy`21X%Im;K|Eqs11HEX!BF>8L_UugEc{EeNr? z32HhfRN4M4FU*c9$Hf!mMY4XUVa(HK8GCY39|o*}XsP0J7wHv3H)kncOdFCY6EpD> zG2e?oi(dG~<6`w1FdX?7qhba2JKLgIAk+%~fm@zW`pCXFaq0TkvM&0|G<&RzHZe@`|?DTEWB1fm)9js5K z^zKlp=>1ssN)&e2Ylyf#D@PX%^yHE42`+AAx^CqzR?2wQ4G3~ZmVGk;yw;zh~9z7>WC;ER5-Tbq_ZdltYWDFa0;H3D++vrZUwQv6{%u4f^b zZYH=cf{n>-Vl|!nIN|LRt)fUu&CS?EY=Vlvdzr1eJA--_1c`O}@@(@huuz}hyr=7R z`6C(V8-xuqD+J4zbGeG>BbLjhh$@~6jNziNM?&jgVRs!Ho6f*;`!O)B!txX3{<=Yy6Tyv(hOA|Kx&nbeaQS5iQ# z!uK8LcvjC^0Y*YplBn80vEN_eq|?qg>yiba{%>wkFp*5(FpMmiUq?_CH2rAWH58oK zWSPplaoSNr8y&d`k7RR>DMka|NUCjNG-enKHbjh-MQ#QMinMcWuQ3}zva;IU>@cm` zvSA*A{H6qYlqixF>|2J4lyh-CoF1x?@*>8+TNhoZ%w_f?rSU_|DI|DoL#L zkqFh0*f9vl?;`g7%j%20@B7}e;&F{9uIyNth0uyXknpP@@{5fwI4sVR#97@ zGgQ|XX2$d)EXerj)8LD2879g~6k%H~4jpY;_*skLY{F20!8srW7I+bNXQ-u&bA$^`kt5bhywBV$RS^*{^r96` z4-PZO_CNT*!99~aVd2+cQ4dAhzI*`~0x(;N`lu_@skKJGWgL5{hc zD^aRUg-RW|Ofra1?z-nbKaEL*qndp;fSKGhystU*w+_qzDpGQkZ zRW>7@+U}ftru))7csU-3>)4T4DQ5N|1rjakBIOC8CsLr}$YTd1HP+#L@HADT#Y)%U zY*bC=_`?Qdf;j<~toLyxPT#$pHDEs(k(?^_&E0hnY;@0x`&g#{+FyOc-obt`D3Dkk z@0y8~7Aq8UM@PxQuiq5reH#K*=JRP~1+ZFpJF~!z%mwa&tpkK5DjY!c*TU5zvk`?4 z-fZFnob1cciUm_PrSk-}y&Bzn!Mq8@RGzq%;~Lp{EpgSt5l~apt+)On;a_}otWBmIAlJV}w zN%HB9MTi+UiwTnU+#q8!*Hcq%r!$}sSP--pyiFdAG-qP#^BQ=oww@XsuvXiXdMITT zXUqf4jM2BzVm6urOQ@n5MvY6DFjjV4mxvupJRr*xF1N17v9hsAUaL=S#!Q&xrWe$M zSJ|+&W9D+3qr8NCDI|B4S^t&=MVF zBt;}_FTt_9lnR9Wp-jDhIDHuL&?$}es=0s`k#0)CxOco_Uo2^JgG^?Nm-T>tmKPf^ z-xPYFqA;u=tDYnYls#ZFg% z++Hnyw&{`J(SowdQ4eW>sGo+87UyWLd&Mv1T-`mjs8Hgn(1q*7|cdPU}ErNR*LJ{3&3uP^wm*g%KMwRqWK~h!Yj9iz*ZNFzqVL zo>t580qz9$2|_Rv4gq>j{h@URVn<+NzTg7{Yoq!N)c~Xol!{}BkOxbUpx+YpqT%J5 zTtkz1pDo1ZeIH6}_>?Cmj;tMq(2+ySRAPnD+FGIH-OO6DAHTJ z7G(VNIp8Vlv9+a&VrON!lhDzMg`c$)Du==3W6%N|0|Q>b-7!Tv06+uifYbbz6Ebs) zE$b_UMjylma&o*C=g4g_IpKswSFfS^c^*$08+pDnijuJs)uM+0V+i6l3Oa!tGPnx7 zNCB?2mQYq9RfXVn1R*t0HQR!gHce-?t}7z-#EhzCUD9-Qbv3bupR47A#MYUli5EXX z3Mr_Fz1Xl)$7nbghjONcf+!oQFi$*HQ7_nT}IhJU~JN;d?6A=Lq>C~92=4Nq|Hz! zx|T;tqkZCT5ChsnPg|c`z?6b6*>X~vnoy!7wurWRSp?bGIAn1MHsdKc2Csm~D)~7@ z;m&uI@`lw4Oy101^hvT@_1UH}o-Q#T`V>4_MM-rUyVi7gj%rwak=$(*U|fVP6t>YE z8Xe;>rpjAHQ|l*6NOd){p`^i8WG7sBVqW4$2e9fWmyoX`RHk^0kb19Bgmbz|JSYeR z#~?Ho2rx-SR!>G%qunS5+urc}Bh8cf0#6e#8afgkIRCsj{N(gq%2EdMZI?f7y_r)f+SJUqUf9y*=;<7E;nZpW+(VNxQmIN9W*eHR z)(l3iNvcW=<2u+n0f7$nOx{;{bjetGoRIWRqd`olQ7K{M{7A_Jw`t7H$AXUY}E(rEo2Bz0~~2dHyv!}!p<=gMKESu(xzB= zUB=0=zlmzHWHviUjHf6@BzGY29y7wif+vtLwh;!Q5ZHL_b4mO1H5Etz)5~5X;mq|@ zVV%quqmJNmSjs5=SA!iKKoV)l1hQIOg2f6nWl-IK^*LalVh!KC=taLl8z9T@8-Idvv<&!ZuGx=LbT4oS zH`71Q2T+b;TPx-+eKt;Vcpjlt%cKB@_sD*0VK?vRJ79Tp+|Q=BYR~E^>-B-Qjv8PK zG)co|_}LqrhUdsney~kIK&aZdGBTv+->i+rhv0=fm(m)w`;Zk5?U_bXFyN}|cb{sA zg#yR&BT$!&EfX=|Lrp}t)|*F&{aL|tWa_ z$7V9xK4*#&xkI`Ak_LkRGnJ<%GPQN=#C3aadC5`H5nDQR z<;lyF+`M2bYa3fQaOv^OGZ*}cXRVfznSB=?g*&$}rlO{yJ?AnUu7A9gp`c-4*O~j* zFrf?P;?CT0>Mn5LSF^rQPwK?2=jP$*yvlkk_WXfbP*sD4ek6TES6zh#%>AEDc{|0t zKGMF`T9Su}F3%QJVy-X_xXiK9kyhZ8qF?V^rAJ@x-wU4B0o={I2c-*^47RH>gT{S7eCAcH};a1KpV*$(Cf9Niq^ft2+}(UMjxN-!i6|Zibm= znQe}_=9%xL*WP&Ro%cRu2_hmAA|nc-A{sJ4bYzGa$XYHKvhk*ZM~C96und24K_Drj zA|}F0K$fyD{$R%I(QATY3-#PA0?fBolaXZaR!#%4?g0A)01B@LH)& z^V$b?2#5i!>MScv$WCQ@NkpCn*{UcZu);=6Y_ReGLLxhDy6E!B^*d1I@g`3j&xkTq z`p^95%0f5Lp&UJkLO4ed!VnG^Lh0eRoks&Fpna=!JAcpwhDH?3!`w45M?ENbXXtR9 zMi~vk#p^Z_F4-XlI8|gL0$If7T3ALaErZy-R%*+Tx+ePRirSERJ|jnkk*Wl358_Ue z5Q@kzP*847+Wy8ZKbs&~#sKn8NacYZ z1t{$@2uf8kz}vMJ*RmtTNMW!G32?wSpr(WzET zuSv5OtvZ~F1*iRT*g;Rd^vtVRYNEHMjB&$nJHpXdbAFm=OQifs3A-a>ld*2vZkrtr z>q!bu&`2tsrNHA0)K%4l9FdW}f!NT0#!~B8Cnclcp+*pY0n`Eo3lT0(v>36{B}B+hni zBiizLc{lbGgeDRlg1*oJktuDDfytVW5;83t-%@`O2 za_Jp?uUGPF(?>r_QxLCR%L6 z2pDWZ0=A1`K??N2_doLVsvbq1tzL^VJ0UZF{Mw0%N$~ln#O)*J{nb6_=C=8JvVgqy@bhAw`byG?qjR$|`42eruiHS zLM^3QBjQPlf*dL;=x0$`xQXnDkwKojREpF`_97!Lk;-lTXVi1j?~|t^7YOgDPB@q0V+J!VDBFf)u5Wwr@_Ms zO?@F1wK5HC*(K=#(29E`qI0E)Yd1%3K})5m{Oho&*$5-6D7{xajg?Dgwn($2lQDLZ zU~d*tb^<1;SM}PMbh8tq;+MovvXE&f^DAp#K^w^c(k8ceqF!CK-bQTr0xjiZ*a7Ia z%q0Bdp-xdb{VWEg&kTDEw3>^ZQN1v@C%MZpLKdnnjP!2t>mQE-G(m;%+_3bV0+UV(-- zMWaIvlFjLWjn82*JQ*+bXUhUW2Ys2>xT3(k}qOvKZ6%`dW_WW}($kF!-iRk{$5o?L*(S9M4fPTOCZ>XG-wa)m5*9_t zqKd^#%@S4>uLbr7b520RzoPrm;OHeqf~(c)K>dM3m1ML*$|ijnJtWXNX>p#6SFS{* zVsw4^N}%Y7gfwl@*86zYg=P0{t-nki;L)Rd+6UUk3?B%Tta-STpt39(sDg9H?8N8$^tFsw^0#^c6S-4km?AvT)c;a0nYorkdZkRM+4gU7nTQ{CXX zZt$W3t{%e8Lw-m7;-hZyS-1GATYPJPkB9K}@R;Ax$Z9CJV@1(d#NpN4d*eT% zj0Fg)|MMsyO90B9Kn4Tt9|H6^v;Z1i3pDr;7;zH_0Hr>RA#f-lcDfw7On6qI(9y?p z64l25m8HI?^QI3`63X{bE|7{P9NQ3;&uQtiM=rqCliKmscl4#DqANs!e0WZ~vigq| z!T0z4ioxgEiD9J&rFG#tBZyYv3|p2qVy?BR4WRWXgs#tBC2fp!c7Z5h$un}@+MzUQU3V0SCm~21`Rm1yA|#pNztz z!#G$!#>cG*qbx`rUwk=o9VPTgmgB3>N4-0c*aM-XqfbXk2SAfIpyC3vB3#HU7)wqq zMbenlDTJK6>KRbw_Lno9kL%&`cGwIdP#qV-$Os$FR&oDe1@lKHW5h#AL(L+ibY^b{ zsrBbWOr%C%miL?@bQ7-axgM|WpEpq_Z<;st_^6kVzRu-)y&8*?n5eoxO`7;js-zf| z2-{2*j!hF^0)fS@K@6NHkU$8}5%)j$>(mT&D1gB%>lY-A;W&AMQ!);q1^*T;a8pVx zoUOS*p-|c&!U^Z(lJNLy72Qkjz+1mYo-|IEi36Q3IpK zb5l|_C(#vCcE3-aS$=v7%-_O>ogcTza09Ap?G}PTg&IT9U_&sRQ$cQY4=Y2^V2DA4 z{Vf~v4%`L0lw&H$g^yX-(s&n)Eb<1rCg4PFi@ybiOEB}W;mU^#9IPRUkJLI|%}k39 z4eJ=3T}~cRzlie+G=gl%YZG0yZkAVM-TohpE+{OFJb^*!n@(5sU6igar0{oYH|wV$ zV)@DpT}7&Cqy+&ez4GoprSEG*TJZ2_iaN>1>0%X1?ApxmB9iWi=#L7)0DrdrW`&xl zai|}cwPn%}jKnVE!ixxR)U-vcS`aAE0Sb=$Z#QXa;K*a2`h99dE;stFnj%S})7@4b zgN8LPU5RO$pflaK7lNN`*+w;r;KafSj^d|X(zs+K%iX^N-6yHYbwZGp9@>O$XBKKA)!&!)0Q5|P1nAzbPe-4(uvEo0UA+_l^)=8R;Q4kTO?G| z>@plXnbkm+0zJ{EQ;?eVmaJBCVnQ&q(LL0fjFZ%*+q(jSOncb0t;_NKomT^HtvG83 z1Dxb8@i*Jz0pdu0IP=SQa+_T`kKm{J!a2TeBH#r$(a9x3tB?qjrd66Vk#lA3Y;A71 ztX{u{>dXf9iu^C&N=e8|HA~vad(p}x6Y*Q%$i3TVZ@9SN$R#Idq1e&%0hQ8et#YZ0e$?JBrr2*QHt%XEXZd zCD3I3e087BUEtXsu5;SJ293sE4=&ur$;EGxYBRy(CX|n!L1B3ZNy_^7T9{Jw4B%`BA1HBfxACFiDI;A#w&dx*i&9Xb~w`JCAUFab?rVMZqyB zTNzRXC5nA&pq?P2Z$4z0as_pY>HTM%)@vA#7Lj03jk<};`YJ9&qHtPxOks*EZX^LI zYlMdw7W&9z<2JOg&l-}U%MdWv&Enea$6zh^y=o8AKIyuj5tNIt$66?4Bnxy9b9!Tv z+2?0?R0Z0v*F>~LEK;eHRmjo$C(deG$*eeb42Zys_Vf<(axXszYPdi%Y_AVPA)8v^^a zFA#tK>#>kmww2_Br8#bblOs}617A@I4TAU)Pm$tDh{{zzFgFbws)-mihpN*F6G7OW z^W2p!SDA~9LVk~dY}=9M&7f%`>Y$C-mE^2w%Z4jR7GN$WcfjsD`o7di5|T_sJvhT9 zV$D3|lCmQ{MlM1|{C!c?W9}CtLV^COP<4Rc>|xx4#MNEp?p{;?TU&kW&N65=y~oM5 zJ9tnJ=mf4R&r*o`tw_H%&nir@|GsGB_mS=`lG%yGNJjrT7m4V5(HF>(Ynkd)t3tmZBhg*N@RFV>M`-Y+*fshKI9!ZnUo)i zgOL<(EO&sw^t>Ev%5P*(G{Ow1#R6}F$hwscth6mQ22OP$ioC?8vujJzh+Z9K8n1}B z)+D3PCy&=&?v`qd;*ohKW5sNaI!ST8kVWZ}?H-oklQp!;;%*gOLWn~ z>q|qf{aC4|fK1+C_X+1X$&Sm^krWN!t}WOpxEcB;?l!X6KgeSKcK$8+cWJjWD9H_l zau${$Xd70+d{&PU!)JBLu`6r4BuI$TL?jhGM4FVhL=9BZ^#{Y~BdT~jDU)T~CI`aO z_f-GMzRe*tFu*n|Ga+!~Ef7vKQd3D}c3xdbUO?-aQ!_7vZg;Om<7wp+XX{WxzF2;J zLm(%%cHp%34R5_mHN7LJdg%+VQYuD(gb^;q5kZa>EL*&-{{`^WFQp2CX#znZ`eN{m z9zuCC_zf5qT<^e6i&DU z%T1o|KPY}sP5GOK6M{B%L;p<{j{q|bJo*=v9|Cr6$R&4+vpL;uN)N{}vEbJe z!E(-;)rGWpx+nAZJjvWTJ>0Rsak#Ca)oAcXkeeTNIW2GgzEszTgeG$bpsrk$%YpPG zIECMRN&ywe%gZ-{zbS;=1%vF$$Mn_9=$x94i_i~Ih|RSm0})ZJgd-}j(0Vv*d&$Ai znhwtK^M`u!EsHPKS?KJTy#_J=J2d)9@iU*oVtVkwAIt~WXYxOo?!R7UX!s&(R04_3 zD^I=@$v@FOZnUZ0E(QG5XH_??OKYA&ZV?Z@15@FU0W0frH(#CsQy)fWlJ{%F5oI2U07;il?UR` zp3TFgCzIoNk*0_9C%d<;G~GVaH}_yf`SI7sRNpl^(^2a7=CDg?raz5!AsXKZcA4r( zCy~~x?-(-VWA{N^_f@~zD6Pn&qW4g@--AZqLp=+F#WqFqELa{H{Tcn@tI+6cWXxnF zPeISyn~h53QxsdWgK^C5R2YELwks1ed<{i5*ymH2}!j4!e$zQjkE;S)#46AtG z%d~{00B!EphTluu$R%0n2pTg?-PdK&CJMIN2W+x3%n{dIVzR{9aVeaGrtXHQ$8oG5>B zQvN)#gj>v0X!T%S(^HeE_B=Jew=+Mdlzl3z6|BDWLH%wwV)PONxo@nZ$}<^ZV3tndcxE!nU`dU&!uDGF*W*a2y$9yjzh5%w=x8o(II zs#k*)k;FkfNJ`!C?uSEr>+yv+89LF21<%J<+p3KZ>dx)UPB|{iQkcn7yWM^G0yh5OLTC$t(_ZMK9zWG3`Q&l z8tvwA?@J`~D2cDOV)~^kOpQk||1}vCFQe_6ZNY|Lnbo+(ET=;pNM;8zriMM^nFuek z%(^rgDvqoOo8XRaFX=KdUVlbtRz zw-%#csyu~`z7~~k2z1FWP9y`;Ae$GI1H8$0m&v(QO|r)|GBa7P46Uv8G$UFarsq^m z7L97Uu&Y9=Y3Mf#u235OVchWVEn2)HPEeGK+14=7+LrB0+a!Bdr4thV+uY|paS6BV zBDP5rhv;eboBK3~=}MBV=?A)UEdALSjC64X48H{h z^Ot*9v-rD&Whhr{9EJhCifK|w%TfH18GL@rYEorl#cCS&v(yZQ_1f-=B>{bVnE81G z;o`G=PhsRL83NB69ERfO%$2D$vsC6U`%!aO#`MUqMODQwG;`UFzttkzJ)TaaItS7gVSUFlNm)eUsOlAFy+VZz*)8bv(SLZqE+oa7T%qLU0%-Br zupVioSMbHd&jry9V~%(y-TLgD>n**-+g)5o3?h23H9b%MNd-VI9n>z5s>Na#})Rfu7X~lP&uau;-Be4bi%YIx7pPm zcZv>;w#7LAkL^)7lYYCVxpwjq5_*&zeHPPf+eCP1ye+{yjDBexUN|}LYDdA0*gDON zG@D?1ZOUr~>OYMNP)4*LNgktV_tfqt)EoO;GAVYCilOiHolCO~-sS-IymUAfvI(u6h|1Q7=_;OkcziiHtN8<#8tu+B`%O}MJh*jVY3YUIPifCnSxjG8tOmxI z&X(%~^9dcG(5en#w!A?CQJ z&z!Eki@1TCc z8rj;>Rk%1{f>`)qh95D-y?*KXB=#``#9wRsy(&KQA^$!sPIPf^V&pTIm0cc_UUqqP zLipz0Ngen8pBH`B=VzPB)pWaA$b4PXhYv$M?lnrccmtDmLSFB6>q7ctJe#!pS~SgB zh`R$^bPGBh(mGb1a^>8W1ddzgAr<>pb9e*XQlt*_|2a{f%A*={P&Ks@`fYDXA?z%4 z*ECqE;L4)*UKXZ$X=NVER+W`lY-qbtFKGgmm26rHh8%btYr@?;1GYPze-$c-^_OcX zl()n1*$zhC zJ0$W?d>v4l24&%^Y^XRx_9Tc5>BnCI7NS7@mIz1Wdf5Y+#(eZ zk2pfANWIje9DlK{Ue2yDP{N+7)9VBE;fbyzkFCH#^Bj_ z!fJ#x}RXSiv4_8MYm=Dykv~-0ts$V{BHZ?T@ z?c)l!Cd)?H(@MjRJfA zcX{2NeY=R4J1Z~KJ#a(VBLChl00d|oHQ+&>c|N#+lU{=kE~vavCo%fME~RLE+?CLr zdBzv=$ayop{+8CvSnsg;z3sE<=6yor5JwTtmA0w%9>kz2++XVztu${cF!=pRCWPP)0U zCq$H!iMvU-%FEAS>i#=ExQ=0^(UeTy`T4e7@}YUeA{N3wUAr@jj5f$!OaqhR5-9{D zeRhxKE~dw+YRIbC8we_~j)^|2Znhd}qaH&OkWA+3X|raUy@Iv=*Pn@|te~=vNRC8k z%D4!p-0!MgepcOBPi5(i3WMl@Qd1R37xJ4NEp??+<&}w4ms0Czl%7?KXw(Fx7eb~o z6?Q^>y%yJbkyMYrhOfF)ODqM-YrD}UlNHQ6R{?<&@E!&0Sx|2X;=Ng@JP5bc%zouY z#jLQH)f6}a^)wQh=XhL}#Yq#oxr&$GV3F_8*i7_)8q6o4v5Lx@0v^L=W7O-^cD;!| zkuU?o^=q;?Qri>T_^9`Y3Th>i6e!;D;X!|w&D`lK;S%&!I7S~v)0t&Ke96PsHXhL;|tq``12XlZo=*NNi(cA_g?MWe!vJr`oy2syw$1 zKl=TwZuo`u@SNr0>>~eHrYD`Y+k}fVADlBkXsf=d6Fl1p_2}z%w!Vqs=S`$gkCy-J zK#P{Rz6~%8txaUV;swtRuN<*({no8oJs)nCbBM~+Rb1AHq%J%NVOv&GXW2A$ad*FT0d;<#@mqv%>A&`SFjX`@wis>dQC2AgNC3+^tvpkBX4VagJEcG zBK@5qetr0&L!qyk2b9&X3@)tkYAB_s`u77%!BvYXh5k@WqoNFnd;$wY9>W!7NCF?~ z$(1yv4`XR~$nULY!M9W1%Y()H(x3IgV&4`5=jzHH5TOBB!ij+MtluDZ=eDmvD zh<3f+9)`tlgS5Ay!E8Y@7Ztk(3Hv+g8fZWX)+*o`h^HqV%1MI`A!-Lk7C7_?kOt{y zz}9Jyb{a7}ju_68+#d~f=^0=qfw_!ne>!g8j1P`^{d#A1r~_8ECsw+<3!<^=wI7?Y zT$x!Y#$!JBp`Bh8gVyYo$d{Gvj+X5%Fq4Zln(tLe3RlixU>krkE;~Zsb`Pcd4rF}? zseRnhpjMF70$zY2Fx{XTw;NIc(j8V+7{JMo?4~3fpMO{xWfhXbVr%BMU zhwc$9r2uJ_MSW0LPbMPwvFl?l0 zWxKY*5&;q+?cQ4@??^M?i7lnO$b!m`UUM}Yf0loaHT#o;Hcc!yn`_cdDgO%4u8HOf zii?MM@pDB3Th3yVj%mtN!Sg&^!Z}Hq7DVD_iv|jci9c+Kpxfa{SrtH0cLu7X5&CdZ zmH!VVw>b-eFg=C_&n^z@K`E#|Jk3WSNpk)_^wS>|<H_WnAiL5+w$OnUv`0nC&ES>=mRLgdT}z+-y??Y6);(%bj@GX=SVd*d(u_4vyC#enZ{(#$!~(cUchyG0lY>Fgn!o_k+kB;Yd8Ntk8u zDoQ0?;y~sahVGkOv;N|wX+F`Som*>;24lFgKo_}l^r2+>YX8a=KYnxgA`t)X-P-S3 zYYa^r0hQxs@p2G5SmOyN{YqHnJ1peUL`433qfRK?vKA6`?( zpj(3V>N?klWaRj|aUr25iXHUf9TQO*+Bn_B^H$e!%(GhFJgTJP*o*42|G1tw_ln5S?+j)v zVxI1#ntd3B-1Io_lXcsg%d0p)Tz_GTP+s+N2W#1H+Z?W~p`dGPuHy6UaJaVygYIq1 z#e5oNw_M(DG|KzBnsizbZ|YOxP5qre12x*l;Et*~;xjVoX;NjVsYRi;29g0O-D763 zCvUBL}~ zuThe&$S5l8tK9bys_RJv4my4*Uuo%~NuqSgO0ebQHGz^F4I8Hiime>jB8a)>ichm< zjJUXM@l@f7fo79ZQ15cGc*5vAvZVGCh&PSuUUl`U_K9^{XU8(ubDNSuSHi6xc)t4- zc(Kj`*w#LJh_KlQaeM1qhGG6JXw0On!D3YxE&(#0Ju0+&(L$LeQ`gj?<8w`qy+UCp zNyTNa|DY>ZG;pbW?b}-fB8fFgX=*i!csiGf#mALaU45AU;rmExWgyNEJ5s1h$fEi} z+zba<`)n%+ac9{eQc(+F_ueTH|sCnf0S6;NdprYsM?osQ? z(NvEIx$vm#eHLCS$CG*QvvKn&HHy!x$}}Zte3iRPgq@Rj88Z^l@)OHG+n^MY%I`w2 z{|Q1|`CU%9py1=1Dz{-EJ}h?TcC4=giN`+7cuT zR}UI^pGt9m_PxC>q+RkudPUV0pZIJk8;+gW~Y7! zd%@`c4SAhe^m3;85j^QgK8)*Prp#spi$O+{)pk-eu5~@htK@7;t}ut zJyyW_`_c)~-XCKHRIq~s4dUTp!1lYXz~|P@kJjBGD|CNe_N#ywD!8IsTaUWqfI=@j*DIb%zg0^v4tcA$&$F#G zrzrTYrW>RQEZ`JY6)p>z8qo6kLLLd!A}vlV`E%^71O^yP51@fXH3wW;(th=ESj^=x zNeZ#2_#5!W@#PH^N)$)^8jl)!%)Wq3rO*Y=F_kW=7IDj?@s_{hw#{=}ekdMt^C1{W zZ>wasV`(td0P}1+Kru)h9yXDUs&+QtTm+wi!7gR^v6HsGh z{#4xW=y$L|T;vZJYvBN}mJbr4NV866z1~^AgU(v?y1iJ%f`R~~Nnksj8F#&{ekXNm z)#zYUz|oCb9KS{$9r`Rc=dYTwvqcrZvg9>Y05t6KTPYYs|5gcorRxu1(5C(jsBZwJ zcLyM^$PR3uw)!DoHU@QlxMjO`0P>1hZ%F-#95Dg^F}e9Mx#zLjm-;4y2tc`hP&_VM zrkLSb5mvE&E2{XInQ6}oO{;WR4$4Kgz#xv9vPyMhW%<4MGBtyo%n1M|um4i;|EAEX z5~LAi;;U3-^9$yXDae&YBv@P6-rsxqGHq-Sd_UAj>$S!6`&vI91aP>NQh^g>{SL*15ZUv>orUGRba}X_b=FS&qsFo@kNUCX?PV z9xjuLzPF|WEE`w!tIu@>xNea_XxtZ1H#;+_Yk?YiJ0UrNkagPdhkB2WXEz*py@TDg&u0q!m>F=diZcj6J{VUzMcn!IZW?Y*Q&Zq}l|dLO={PAV4hO zZc~`O;@UTTqK8S&iQA5=X>+D~A>m?v0{e2 zXc_>6ZCPOq29_9YFtgX>^ZYPt84XYqmgTs0qqqaSEKW`wqyQALzM}wef}0!yf&1rW zUw)8pfB3>sTpMg|G*%$3=HiafiH_qeNuu#WW=WrdSaFV!+ha49MqbY7SDMPNa2i=@ zN{RX6-Qs6<^4{n7k+&wrNNN*iRVk$y>#;EMkT?Y^!Zv)jcGC#aY@0#UqT11Q_vPL9 z==a4n>Z_swq^Uwm&vDk{Q{gm5IF3mhk4+%*33D?_$xMWvE)-Kltb~T{`j{+B>KITA zXfKKaZJK{|!D7}j+c3`J$oJKr;{?HA;u2=6g&dh$zU<5l=%JW$X>)c2Qg zE)iihbnhD7Y!F-LLIv!9D1ZDj&o+Q%*^psg)_UF4WNV0cFi4joc1@T6Dz(A<=SX(pL9B}wVIX& zy}UrN-8i}hz#5ZgOVi<@YrAGrd@co~A_3nH7 z`{Fix%D_ECE8b=Kc19Lwn$e9aw0XLYIVYW@8$%2 zhtX*xR-AkEk~2CvP``}sdA}IYfedBIfq2a}i)T+yC*X^hPw$`IpPrl^76E8p!H0X9MoGh^tUg6KuNw$@jiL2iunAl+~Kf#2on zuc7!G`Af>XunuU^Uk)=uOV+>s@8xEvKbxzw>gK0ZEHtrfjIi*h4s4;p{)>fStBV&O*1*uh40F-DECI1 zrdw(GZ2khoMFv$FgqiU>cTCkVS;QjqjBf1>z9b}=`jyfeP5X^Y&jRsg$R*(nefN$&_R00 zT9pTKF)?qMr)Qz81t{qhx59wn^hgPt7=SUH>)Z}E{h)1YbhCxy6o#{;Y=iP(;~D7? z<1F663(o8nZB?pYEMAkaHYlUbAV#m4+8y!<9Dt_rp4z#XgOR{j z#h`D_TU@$5bk}Y@-VB+0WlkHrZLLRc!kB%}L@>2q=Ms>reFBWh6f0Wvg8o9GivgHm z%}-=5)BWeYtqa+EQW`l;0YUOHMWV4F<5;u+=5b!kQf(5;%(>v8H-DnU7cOL87w-m7%mn7F|UUa6z4h1M?^2Cg#bjYyHZ8h?R&(@ zj2%W&g~&{Z)Ubqup85Exr*HnDEuq<&i)TLf_=UqB?PpQ!*CIiA*H?&VJyy#p=x|){ z5Ej#la9Er6o2!%t5uCrf>!GJeEsFPGHWAsYsu-@&g0PlQaIHr@pg_#ZCgun~oTRHU z0hQQbvJ{Ych(k1ubU@JL5|J5OR4iE}M@_s|aGyy5`gk9kYly51P(LoID~ddExGoh? zEE9fp&$MEEm3?1+_0A0dJm8H+6too9Ad@ry890AQp($>4P_C2wcM%0 zL2KZ_xomzq>b>6e7A+cW&0-HlxU5lw0xmSu*n-mh=c2|(trGFydXblRs^x%a4NcKg zA$J>*yy9nMnYLL6&*EsZCU7&}dsb=oGsp9627NCZb@One1V>BCAK+aMaw;ii2Sr0wWVv2AZ(gVrwP3$zA8;y&a_gxv1gh0z8f7k zkq15BjB-yqJ|R+KjWpBdOqw@!7lUbx-QUgae96af^V1YE5j30(dZ>%;R_ib)9+>Q9 z&lg?GmYA{_e~LR7_B99(dIKQUNNJW8zbrDwH1Y8XV8XJOeosVlMBOmfwr=mg3pvjw z(jH}2ZQWV0*N@`Z`baYkIMWGR6(F3});5{nCcUE+OL}g0PyIcmw1Nc-Lcnw znJ>y%&sTNouu$T~TS(av%?j z&5IjmUCxqW@-X{6_^=%)=<~vUI?rbeseaI^kM_MC@HVE;!d68gzpfw1!zbUv*1n4m zQ@7Da4?e^MVH*&c024H|gs%~xg3WFuU0oDMPTfPfH+h{TH46m}nl!~lg z$UEIC;PbHdCBIY0O2~sS>*`&%UU#?M&DyTb9_SYPrGQ{C0l1_@rg-1jyzfQ>)GRSC zolT>oC7|fg0sZhbdh9MGv|T)}dPB zi{FR^Z=OFrmHDr=&kDqHWzf+w2z7`#Atk8i}n&*cb5$O;7@YOJ)I7kwCJ>V}ur zTBF-|8?Ntl%PMJ4#NA6Ya#IFSimd8s=Ru_f&^b=g{T6MTW$m#&WKC8N_K){wh7zu7 z>L%h}QpZ*^PB;WE1c(d=Gp*0}2k2XF{XejrGG@-2`YpwLC2$TIOHsq=z@2_ELWc^< z$bgq0m$e)@c<%(@Z&Y#~yXG|#@b&i}t<7}`j3Cn@HHptRWYn|GpN<_frc;u*0;t$_ zn7DCs{$QdynXz8%J&;Ze&i_l`yW+xPqg59FEw$AtbMML@059-V{sQpFufHVOYd?wv zNE~BBTLU}<&_?SR$HS7`FSSDJn)9UC+9W?f;QpUfPXxB-e|c(WMf8_MesVqHq1V z{8;Ln-RFehwXnnqHN#(+;BoFen|ilHtGWO;iv|v(TLVfwu1=Fwj2BG!@2Sn(yzof;)~q1UbB zL*(@uk@3hQ&z3Qep;qB?%86x0G1hFQfLCRvsBi~3Yr0dR6$gwYdc3#h8V+52IXWlw zs@or|iP)EF=kwR$N=90{5NH(yqpSe|9-BpG*|%SAx*7TgiIR8XS1 zY-!SNx26btS-4*i)uQb{Qx%HsDcdq>uAbI;p~#jlGO~)&h_fUI9rTDq`@Jm+RO1RN z%`%p-c)uI=q!Q(DGXpY{krRnxM#`E}S$cL6STT|>PmA)Dg0<((T>@YqSrW5nb2-}u z>Cy8!I(2Ev;m?62v6p5g7VB29$d3gt2%{5exC}7V~y`*$jm2H_Wd?y_GN z6BtadCkP;Zjmczw!x5bDDr#UE@cFJ&ArPmcFNenpQ(gX@@?Lj<(Ts!4bR?^WT8L*^ z)D_ut3UG0n(B8{*fjTU$w-Y7SmV-_XiDCIR5_@}}+^3W*^%Gk0fW|{I!z&1dso3D# zdAc`v_*J%ubz!#f4iPSNo0d{{p8=mfJiCAM3QzGwceW@=EDwV=d30;V!bOVG)a_WE zQ(5~g-BRu~=V)fjx(43A)cbme3MG$j6U}5IIYJzARR6V21UnU(jh&|b-JOFW(kB;N zgq>(zg0|VwD#@`krqS8#{&_Qh*zik3DnDG%_D9UHD*s|HX_?mOWO!t65J-wt#XYFH zjw0a7)B4Hvyx&?KRZ%H2gy`N%Gch*M7hg-dU?uUeaQj+^P^KDWltnHZ6bLV3X{4wY z2DvvrSdC-2!O(Zs4CKj<`jbY23PU&+AVZbfPulUW)M<=|7y6iIFHTalo_~mA@d~!| zGS@F{_!u&YtQz6ppaRe-<(p4P+wj1~4BnMQR+ZV^rLUoqIVm?PDF{ngR&P5T60IxX zf>9b0lDCP~%-=`)sXTQ=`t079K_%LTvSH8{4_33+`v*YZ>;jA95KhMkz#lo`xae?rRBTjbwWL$0A7yFKHi=$m6&pQW zc^1N0jmeT}v3mxKX!eP`cD9e1iU~=*PRsg+^Ho!AMqJBRrNx3_*xs#woJxW^m@LV^ zz!KegB)ePS*5-t$5nQC4Qi=heFol3mxFW#i6#!ni;L$`fkxec>C+pU)nP7;OOJ65J zJ`{ghEDpUuzh58#{DU+N|Lfa(OV~*HZ{cG61;B^9a4VJ3cl_L^_V*N)nCier8qJ*ASdAB}scNL9k4#ox=gLW2V-$ z=`JG?4-D{-qzl(rVK~<>Gf1>?k^%6ph9_4IKv;_Mph;o%s9q!-ZA& z|5s{o&oI0S;nW=Ofx-O<=-w@Sn4uwhVj^0Eg42T;%Fz^Q7TG`!%8-Kg=!dzeM3L;l zG-jdzBd`R6(0jJj)VbTGTU_OZ5e2fCLS|6+bh$5`qD$}4!gnD@@l_`*-h@NY9H60!)!Dz?yO^l~n z^A_{wy7!Mt6oP4}1yP78vMek-S687DW$Hz%lkM~5XDX+n#oNG1iBCg>YuOe3K9?hB+U{) zfpc)uarrhVu+dbGoD_2Q5?_%MPC3nmD>v@WIP0AAJO~JbfrwZ!i3=_&aoIGRZ06}L zDH$)`d|Yu=scU@6DJZ?>7aY{eRH#%=r^-?xLRAa%O1K(&b!tV36eZeq^%^yW01aY7 zgjjJQLA->Jp;@99ZQ8Y3ro$FV-qA>wqF1Ukow|+GC0&M0S>D(~8w#Srkm1mf0W7jO zbTDS}FY(#GlNVN_WylyI=Gat(@mz4`TUlu72(7f1tBt%7KlIw`a9l(&mw8sezL79| z$vgZVHl8&j>kteeVX@PXh=z+TC_=L3QVC#yJ~oR7=E18AwGrDzfLJ=nyH;)!xK7Ii~Az=|wF>wh=DQOw4+O+q%54~+8z-}LSCpZmYYq7Lhy)~{YHXvCh(2XE=r%!joBTlx*RVR}rK9E+m ze3IkGgOXFh!+J^b-56%YC`;m9W)>-6B$d=~Dkf5rkqRVbj-)J(RKOG?9s!sI076m% zCIJ8>696G=fRHFX;$7^GV}t4NmB33Q?FjMOp8&0q>X)DIVZn+Dn~|G0HPAu~<)JTN z_i$xQdvUM>FWy|=+^o)%Lb5$o!04D$j(rbp&Ql0PC!ioGS8F@g2rf@co4KQe^O3-h zo3R+<6WwDQ&z9qz966f5!%2cT0X0F%0QLacAaLjMe26R_-yaImuZ@hHz91^JTCi3n z>W(@)d7VbvoO3p@b*3GAE$~TXuug z=G<_;g(m;*^vuD$Bi=**tzl( zVx83n#@YFUm8FrYN={cPZ=0S>6MRgFEGClZ@4tP?MPUck7hHvY4uGg%aN=;w7KHj< zzli?HHFN75TYxopH_x0A`fK(z^6GQvdbmTTytu_C)_y6yXfAF8L#Dg_g#J%|wPf^_@cfU@lZQ_0Fc+4DdA8)-=~%43IAo<6f*Q=d{EbUJ3TJaH-t8zDBbML`Z|a-)6Q;uTB0q8P!kq2jwVX~Fq*Urq&UPKqod2`CmrEQ7 z9zt@7qY2_^z-vJHkQ#mPFira*6*Wq!h!INrsJKxP2cl}o>X`+JvJ?`dDTGT|$*eps z8^b51zPO)XD}8^EcNTzV36GeP^q`2!vyUnnQzI*H0OnR;OhH{yF&2?9*TITytf|;W zj%XE?Fd8u6%H|kW{2h7`ZQcK0hr;Gq1CL|~A^Bb4vG&X4ps0{DS+RM>Wxg-M?v-V$ zT?70+U9U3&!;JK8Pkv z)at4yhyBm#fBHzWigjJ&+JE)?rS2}kseptAXLw-gh=--~Oi&2f9OY&+uj6(rCRj~U z5#40Jf3%{G*eMh|2|VFk-qhwTw7 zfB@?=)vv0$duA4vgy_GqhDyNiAwwm2IJeq`pw)_xXIzYgyz^P0P;qeaKdbi3@8h`% zb-h}#L6AUT<6t!-I=%Z-p;1MA}v+~ z7ZQvG1QLM(BnWF~cCi>NAbuttkrEv;^m7CRMM8o4F~*{CNJa15sr2uB+`0Qr>l7*% zW#!7pMQ0xVxp(?+V*#b#8uZ*c(FW>t{9|K*ML0#iH7E?zh~oKwmN}c9OWmb?y5+=y zLb#zzj6}xIroW`Cp;U=nVG_5((LF*U@q1QAdV~X>@2?;4tgRiu1$=J%?RTl{)*nCg z{f_4WCfY0(NRvv)QDGA`Q3xqyefz21*}Dm$@iC^>d<<<+l}G}B%ZqhUHI8+iDLfxn z(`H^Ds9P|=z+Q*JiMv~kpJvC2mt|DcgxUnycu<>!Wt59hIKHy@5+u}jquzW8{qEkD zL4pJc60FGda^3UZ6aV?Y-PrE;y&W@i)Ko=9MMOkI)gDX9fICwU4d7_^uYIjUHggA| zPTvPj@IXvqGOW#p!|OmXl0%q;w0_UbTy{%AmF)`vJieWg6?m!yxC_8hC{ivkP%y|O zR@xCLR8)?O7;z4bG-}t;#z0!*Wu`}tL>9S*l+lEA@vRPs;g2N*99HBw>V6MMwLq7H z!8KJ7eR5x13BH$mHY-R_fN9qVHoo}1F&giCBP`r^4_G(^FMWQE6|w<0(yfEcKxOrM zx{Lt|g%wv|$qXSv7eH{JbaEex8v%*4jyq_tMq917(qeUHnPQv~ z2B}e{M4oIG={iYZ5)QfDw~$R!2x;z1$mU6eJQ+FU{wSACrSd2^r7N~g3tbYrJ9fEQ z7CQ_!O-sMjkiLh8a9tO2b&Ki=!Fx$4)|RBM^dU^Wm6ap|3?$*9!zE?Y)%V)9QYTu` zi9V7+GhdK4X_rpvl5XjdUJ;~U24ql1q)+-M1VGP=NyByI9QLEL-~42?$*N0}>irEG&%+=^bID-e20(#LMgaq(DF7Dd|nM}O)!D?aOoeY>yrc_$s#qRIBh z8+&yx?fRax$D=7SZI5aWC-kTu(zdpuOo4wM_vno7(n)RZ$PRA*)-DVQm#L_baR??_ zB2$0rTYack`A@bfb-!-bt0?)sz}%?~SNIRnz`e zRV9^I*=6ZbmA-V6!1Or0jOAPEl9fk^OMvN>KrZ@~FL?)fS?7rNfrLfmS-2>YSOhy4 zYNrI0{$yaW27-njg+yQbO4f27gvVQs)SzG730AK_e$v%XU~IExpmD=je)SBE^H|Oq zp{{{a*V`DGmX>Bg-O*T?Ra{E}EroSgN^<4EBtEp8;?w+Y7a*n`TKMo|rkR-`Uz^@l z&e$XhV*@2YVJmZBWB*BS;wV_3DRQnz;i-c20AZRb3_&Pj+aE+>A!n)_52)XQkZ=kt z18D*R3e&887Dih>`wjPh&d2MBQ)}%yN~w&r6@c5LzdOS z#Ik9^h>3wA0fDE<8!;!>XY!oOktau1I3NxKshMv=MUG$z$Gtp(R|K;EIQV=MPea+o z_b~c~eCc=f>-taqfY%to`apl%MUm$v%qFxL5-vm-D5^6X^LY^xmC$(1M6`OY9gagL zK^u>1I1B^yixt50fM*PQiA4 zSZeNdX>slO&cDOU;_0C#`^WVGa>J2NM~)u8nogt;3><{@LIJ-t4HqTtJ>P`!XTh}2 z^VuxY-~JD(*e614MCW-J$G8N10A$j+*c8(d^|oQ#VHdeG&Qp5t3oXjm1W2=q?XefJ zAL59KU2+w23*x>>eDw|TqmBI4)}093+qBKHkY`Y)LQGG_>aD=G(l#fg#*y_Sd!Tyg zsOR0Mz0Y55V9wsf|Hb~21L_9}=_8R6UJ?^dnGo`AHkw@>n6SIeXY3Xu+(Lc_Y2iHt zLeyJb9BZS!y+z4c7hdGPN}lHjX)>rYa*M6ape|4QVB~3Hw^|~UN zWImrP6x_ukrBqAR>$FBA-E4YVZAPcV>JE8FW~|v+(cD~aeIu~9S2(z^uCJ}zTkZbd zc=(|7_-H;o*`J>sFCUp7f9(9^)15)fUnR=d#J<7yEwb;Bd{6NQ^q(ZSKiCzm{0^Bv z;LM;+V9i1X3$kC41K{MKsdC6+L5@HiMeR5`r-i?VNZ7`s*fqo8I&wEKxQW~?6S?i4 zAooF9F?xcRrwF_i{U#$}a}&HRF{yYo4j^zv9J~f(5!VQaa}EEvEIkQ4eorTXx z8aRwU=T8B^Mg*LIftKt;lxE|^6d!%FIRcE}$VKn%bpzjK9p&(RKR*L&0S^+4XV=f# ziCisQgEBtAvA(bVsb}66wnU5+ISMrUsmkhyiu#$#R7RQ9^J(|}pHfb#O((+f*c>FE zK$}WoHJ(Vbw}-CPJhN&GBG>GYdk@~LdCk&Wu#33cVFxnmj|pObgPFX%U_4J zv4>q;b|M@nM7;4`3jJo0kSW}mr0D{4`(FltL8}=kHKT~q{R6d z-A+kBrev4W9RL9;A|V0af>s(ItQ*d7xRAm(u%PbLpvswon5lYJ`{h&>|gLo;e8b6-J6`Q#+TfOZ&rGxw}k?>Z9lt zZe|E|=aq;hv3%VpKy?XQ7NgGpO(h`#&??Z`3RiigorYWKqsUH$O294$Qv-+$M!tA` z-9^!0jX1Xa z_Sxinjvz6MWo}AEfWRo5Iw~6a{Z^WsjoaY?7~J-G?292<*8puaQ!-r&~Oqj#P8~IRLMw88b+KC68MlF|eU- zTu~<%^1x2VA>@%-w|VVUH9EHL#Ds~)I7b5NDWzCjVNS<^au&K7*02ZFnkCL`_um*_ ztERM441rJ7a+E=T!q?cCK1#>v^YZ+qC-l$c`2e7y$*FhisNxAxr>3eE8bh-NXOa}4 z!*X`_0)h_RlT_S^b{NK_eI~s|Ru&o_P(PcF@WHCT+Q`%x8Oz8L(4+olFkdj z|JiU!O|y6(lD2YGShc7f4wvNBmSrnYowiEH9U~=&i*MNNiMvB-R)vMUTC~E+ZhAAJ zA1tQJP(yt-Wb@$&5>iqpmj|dq4a>&WB|`u)fB-*w4yUHV;VEzl zMv`I5NDzOWRym~;2&*YLXQ){GpArV+9vMZ(#xS$9xVbsP{5)%6fwH(LSz4j3u2R<4 zXq%hr);42jpLKoBxw+xp-U{ySNcZ=mhYuu=kFuvH<@s5C`AGK3Cz4M;#nyQ9CPlTW z9q$MBb!m0Eq3m<2A1V9>ep^@SBt|+G8*3+U7ltERfX&b)RJ;t2+s_I%Z21gG93TL; zX1<(XCG6(N0)q?cNx}5Q4jNLbgQbXDhkV~Pr5{QU7T@)%g6$B6`vN0#008A!udpXV zi0_0zdD+SciZ+K>yqo0N!s3CNYG5P-Osn65=uy_3;n~Y(U{-BlthvHDvgz6vv4g5} zl0LO>pSj0l0rgtEay*o#EV*S^UilPaQph)QZrishc;l^Br%wwwKv%q+$CuJnvkvhYS;1rp%)@Z@kGHUo6hWh%-;aO*)lR7HpjF zC~~wJU=eMG1DoRFG(6fm@@~;HsCt$3%y3ngbaI#SVxr4Ti$#`^kONi>#p|5r}z2gr)3a|Z}lU~x$ zkFHv>T9J?v>7<(qeB{I;aKae-02N_8!Wb;)qjp+araSBe3;|XIUNgE?S=TB<4j+S? z6rHfUETt8aotmU|KtNQ?fe*BWkWkDWCAVnK{A6EB57E&$$;KMh62dwrOIIITm2zog zirlm9>1(x0yDN}dnsWH?nM!JH$%s9c)DywqAltNI`MX`%=x9H3ZAD>`a1 zB|N)Yb!EEN+fFVr1I|)iMBSimN``_l&5)jUkt%X7Tze03UvSow-`S`pBUuMF2Bb7w z0eon4=-Y{muh5$kZV2#^C2kU#Blm9MBXBp$O;wQ=a5J)d<5DixW_z;~up+FRtfDp2 zf#l)36_-#bnv9GK>zyyXE4kcw#+Xd2<&w30&gI}COyn7yQZwQ|uDUXIy4QzV0|a^i zeq!oqh=wCVDioij7pvYF3XY6%0MH;^HaRM})X<1$7FakGJacj64=P>vD)uXO5G*)z zgtJz7F>FowBp^ei@QQp@jYLu$b_VQrLGj>}8Ix&4T?|vhc3wd{>mhs*@2z|*?(OHZ z+eE&!?Xdk0fKzSr?vJyOkSUPd)eV@vww|f1Gd$8}3QHExLO*X?rc$(N^}Ux*6GL#K zxZ;@!V%gLbWAg?%}!p~+MaNayk~qZu&oaI{Q3UO2oTT!N8IAAlu@2VF|(WCDv1_0ddpQZPR5 z0mlmpDn2Y>q$WER17|Y`W-rO^pk_jp<^hTqhR-zo0ah@X6ADuzX}&*-%Yq<>l80v@ zDj+Eajg)F?hb?Wlp-+<7HZcjm7TtlEK|9BWhkJ{e7()FBkiKm8Psj`JEM@uswjrR9fI|WpZghG14jDlJMZP?(D{tTKDf*gE1HP5 zP7^3{qzGrF(&=nA3#ASbGsK7d%#opjv8dQS^7#K6Hfgm%adW} zA|j_GFNX~KFVXD#b}bNh5%R0mlB@IZ;)Q>KdYY8(g=Q0zbF^H$+?~ail+Ip&fekz~ zf?0(!D8{C>pUgIRp$W}R6rnDz+#*Zp7WpIDcw$Z^T6UA`M)BbAo@3G;C4mZ7J$VUU z*d^Tc-J3xmLqb<+%jc?fRh}Rf?wGKtAo)+a9a@VC(Zieb{EP2K%>bmpEE8h`jVSp> z+RZL@6uL$Qi*%%LDv`EYxVj7{L;R%zW3SF6(^V;RI7L`#s$iQkRu-%n&???}Objpv zO9?%?+CKY8OvnJNaQS5{Pi=k!xafKu$V<@^4^M{Q;CP)&u`F+ z1L;OF{%C?4gt42KvD`y_v|-V%z-M?(wz@4mj`-lh_UXuB*y^TIP0}l7gof28A^J8# zN!f?)#>{ghk9p_{N(_49-A6Nol@w>pI&fHQ22!Yj9za5JbGR`}cMTR|?t*XgFU z2u_#s7g|5J7%EFLv8DL@)9QBz=jpeq4+}Ot1N+xsitTp%V83CiYnZzEVk+vdU+mr~ zx{{Q;61PHcAC*aLwOMApJx?cb_ruKk$w85=*r(d8&B;S=aCpt)*~9tPz|6)8=5x$Y zuGv4mejMhrY{6`!Z))u*%x4&ZOuct<^)Sq*>Hc)BXJX|b%%^C+RJA+4ydUP1RBy7< z8C%*5vk8hPQErbe?uL^wa58tiG_tTmfH;YfxME)%{`LGe{uL29qlKZlt?<7MAaF#i z!P(8JAY}*nRW^M2_<{?o`{C0|_<7d8)%fVq|L@6j#(S6a%j!z=apPi3VHMtLy_FWL zGs~2vJnj|k)irp;#;cw$j0d54-7~Ja2M7@%4g?SwjfKK?$JD{@A1eSN<=XYZ+p)!w z6Ss|r*Vg`^L!R0mOGH}xd^feVF&_MkfWWkByyvTq1~cS`DE5xsKFwO zEwR)x%dPkUmR}m2kVtI&9SM;m)XcJEE40!otF5utI_qt)(WW22l?h7pkG-_bG4BVD zEiQw(;6W(4u%^6%SsRnfK?5oM;BN>~+f^gA_b&t45V5>FMxu`|__3-Z5}YWs(b&Z* z6GLQ1ztvUai!H4gh(4;4>r z8hw-tb$xamMxVjZr(yD@5D{mvuwW&!m;QY!RRT1YHVT$wr2ia(WLO2f_9T#*VWwGT zn`5qd=Bu;7G0(m5(krjM2|^eVL?ITU5gTz37x54uN#X_L7-u^8CdGkP&+y-Yss5^M zL;!&c*R7PU*mB+;o|buX z3=4qoIELrBH~2w_4^AF!>9p!<>jp}+2T4#+>AK?3N}Fh6+nt9H8eX#AUB%<(E69Je z%k$0PaA#$k((Ly>_*g;Jh3=MYpBn$kXJ24c>;9j)h&P;&z)!zu{sS&B-rbYt)4T!f zuzLeh)iJmeNSBvz%pmfzl!$%_WE0bz49KFVRPExJ6ARrtjiLl4cr44X9+NConX3g0 z)JLip@X&0LJVS8IppI||3%X2$7m|^lEBD<`N`U2ryTRA(D$rjGmw`S9s54~;E^|H} zG;kJ)ul-cj1NRY!1rsueGD15FN>;Vh@w#1i8xe|diK=}r<1=R&2_s{ajFyRJk^;8C zW~Wrlc5}U0>Dt!*8pkk|{GR*wx?N?;G&@FYx>4y>pEZV;)95`1GK7Fy#J|f8S|^fO`Q?^91Dc`5;#+pUmV( z4@IWM%6|^o=ScvafWs$>HZHu!75g34?1yy> zu~cs~Tb+OW@$aHP4|az~#wKRx<`>pCw{~_9F0XHH?;jqYo?j40I1x7|{q;bLR?j^4 zHtunXDPp5t)8=ZN6Bk#1Y_T;#+L5ECMB8kP>vq~_fHR*mZ(tbhjIhi^f$mT)rRv|8DkP7 zjoM|G+;+z;WPSM|{j!Y&cZh7I%*V`C%!~PPVH;cRpw56%s(O#l`%()^Ze{p?0Y#3P ze2-=RZ+U?B!?$sBh16(Wx`Ho*i6^t5Z;z&c}pD3LBjI}B=c2ZWS-8vQ;n3?lEBmyn;OkL%HTWVe891d zal6B56K&O=wnQn%`m;o}ru8Js>yTc#{3ZsA8n5==%MgWIAyT2+-APDiGXlmhLWODU zG7v&fA_A;y?lE5)4?&%2ysUPV zNX142e~)fzDUrf}4k4cmqStNa;}|s2c`9m8zYM4_W)%Jra!?L^c~vHq-LTY0Y%YbT z??To0Sv)&g{b4`CDu4Rx@bv99;WVlGni>`4f%oB>?n3FFb;Nb`8TYlg(Q*`J(?Hx$ zQCS$L3h8o-$=j>iwAm1GM8xQXJqAY>xnv2t<{_|R#JFe$bemCdnU%vl$a|V9b?45}%4JznOOB)rPiK$@3uHeL>5X7mF z#HCQgtf z!nM7h@A001y}&-Q9j^VfJkDT5x%Ww()mpv8w%h3-V(vf4odP1mPJ*Ql77=g|2M z5;l(B$K`fur7t6_oPQl{etfC8arCkoT8Cg#frR=8hCMgaY_{d00ez`=*3)Q4H)5Ow z59C@cc3sEl-t+L&98aqp?JLug=-p{QlPKXnaa-*B)wD{HTpC7?d9X|yBc6G)hfQTU zMkIIU+4CA@14tBG6v)qY9pd-OZrj*p3q_D%@~e% zw8;$%T8b>tX8m4ARm&km6kY&K4Kj?j3D}wpK96QGbm&bT&##Aoq#zQ`xhaohJc_WO zavSmzrs2`f8IqgWPRmOJs+UZEdX6DHeiw+-A1LfL~(cUpC zptl4oHatFP)haS^Nnp+m9Tw%#`IVeRk+q)73t!GmF#-&FOe>O^0us!s%3K{_2=j_$ zp@0O7s%Mw@2>^W#%MQs(5eZhE%31>eVcj9wC?dh8)Be`X7|`vgkevb&?5fIM9bg#y zisYbx1c$12L>>Cwaa7s~M1WJLb_NmP+#$Pw2yp522O{BDmPyRmR?8UB_!w);_=zrkN>9i@^u{}D!sJbuy~!5&90P00vJtWq zy@PBAoW27t-@$HCff3DNwuM_p79+&a2X8}R;uM>dW4^STh zxeA>61~~68!1f-{zXtcZ0}9VhI-?Ms6%W`LB?I0Gm&i0&aM>g!^J~vq0wWUU0#+aj zv;r#V;6PaPC5n21Gl}Gltqx62 zk-5^D3dsahaHue~?J1$jma2SbGal^L6)ss+ZkB4PMn%qQUAg4)rA!y+ih_EZjUW=8 zGN)=UNzW|0uNNffg|F&@l@m*P-*C!n;D%7%E*gZ8eKb@yHyqJvAFT!gQfqhHfd zlh7y+&v5brLr^?wc}oJtKx3TTmZ3}$^0|IiPiT0iqK%M&ik1-Y_wpcH5+qd$N}1N7 zesNohREmODRq53@l#mTJ@XcK_Z^X1uQ^RQ!@cndgaZ;O#cEKhsBV9sv`CCyCS9?mfqeMNs}Aq1N?6Z(Wuf`&D;g2h8^1$^2jHAfeiQ{ zoptN=PVFHY;o;H3<5f?WoyC+ylqReUwV{hpA8k%mTcASuY17%`)nxjMja0 zr#hvh^mjw211THnqW>3B6W0|+UEyv*?Aj%Rwz!*@@fC;R{fa?+x3U_nuOhy2Rwg;% zO7{r7_o>6t6G&V2tJ{$>*nf2w*|tXy_D7s;SKSNaxa8}~7hyb(Y4KyFZ$&?|q1!Z~ zQBPh_QSaE`KIP}lazQ$}yRtFgUjPO=vdF2o}?9;a)Z*D-BbP}dzD9kMR z-4;UI&xTD03_|RdekF3uR+%MlMrydgo`GF7hWf!zjBxIJL_0X$$oNEOvtM2W(Cv@vHrD#9R zk;>Q-GS!457}ZNk?Q0-E0N0UU@u7uVf(^_y&M$9!+Lin*-PdogXJ5atjV)Dcgn?k5Sb8tm-U>$kY8##W zcF^hK|5Sxh6wrmuwIL*JsnBST-x6_JIZ1TYlWqc96fMT3-q}+-2#%6N#1ddi_`N7c zHZWW0k*kKz3!7#MZ!q2p+B<8!ar|(O@{1K#;bV}=k4Net13#Sl3yFtvO-6Z$O7j2Ne z3Fdynz0ABv&9_n7i?5?If{~KvL*FQj3k34`iuQB90tBQ3OjX2kFXRMUA+IkYt-aST zb>xP(Wj#h~1&zp_rG0f(@oHq~LDL+D^k{&$J%r6Wv1N&_k!FQQ9M5!smmle#d#nRx zTrW{tKJHn12O)#1a3aRJqM0&uk|98LQ+ck`gb7i$yyh`ugC>I-CrE&ich?by^k4YB>8&1P_HlV!P&dX2?(v~F)Y3Q zG10u;Q?akIZWb5RX_seD|5gto55in?_;aLVU3C(hyDKWxVogh*!Vq#FIjoFL?2p4J z0`wH}@ouc|QDLqB|Ez>$B@5LJoOPXE_a&zfB#^a_3Kl>fLom0P6CnG9*)H4e9F;v~ z^Z0oi>lo2{Z9P3^ipbe1N|z|eFQc6R43dn&7LckiIjV#e#z%m_KG^eawELBYWi#|m z>Lw3@N2}+8cFKgz7PL`1d5i(!#P^0HL$jDBt#Nxqi9QsbqpQpwwBt#2G*)O@dN*`( zSa4zC_#;z8X8^^KlHk}^hU>i zltg<hfmn4X--)!4X9;Po&4*Jq@<(CW1+tv_{NWgJ<9T9tB=BQe0XTBP;J zwcpV!xz+3e$klfBvG~3Xy7}a1@7`!dXVapW+?6==!Uy*Tqo!tz`tG*a<=N9~IjUaP z?Kv`+h;+#_^!j7yH&Zw@nBhyF=wSICAZ1c}+a=$=jrMEq375RzuJ0MZRs$6taI?E* z-H1@yyiodN|KnkeAp@s>i8DF{c zY?Hl}%W7|sE9TJLB3i>FQe=t0ya4J%apa}=Z1G*3@Y)MzR*XRg((IBeC(sXIpyI^i zI+y!J=lKrDfukt-IL5iQvH!RZ;cHghI2iaR8vK7a>1?9A&GBVZy~DX7P5C3b1B;EI z)%D3*%*n@jGFPjYFQfM<1v~o$shfPeuci(`n&r3}#AaV(rSN|3{HL+){O%UMi)>g$ z<>XRE6ZIv2r7b1>ckVXZ)7|FyQXBqLehTYNtN&|J&E%%APDa#zMP;&|&n9p9ikJQs z-SJp+yu`~`g;=W%0f9q7AeJMD>9FZ6a_y(eEw-hC}Ouwl2FZd0^B z>}bu~`!0R&c~BAvwgKVmeu{rY$vwiNwf+)x==3df?x|0gpWS`P>JzH9-j`lKF08c? zVnY4%QVcuLrM_0yFtZXtuNb_KE+UlX_MUEYn;P?xKwVkgOqT^F%8d(cQSPIx~mRlDVUomST?i{Wf3AGX6FE z!t%n#*95f2ct5%P=y3k6Ef+Kd%A{Gu`1z~!QuhzUBc>6V@^Yy#AX+~aG)<3)LFTIqP zwXHjMPuW*13)jy?weve2!Qc+N_C&muAv+#ZWv4tgIH-s#)$-WTkRqzGs9H7ivHL~m z#gLsnFzle5pg9riHBWvF)s-m04ScI#-f7w~auKpo^(-CRZrkW3dU|v9HLjA{as3#} zJ!)6aFKXlkKjx_5+`0^I%V)|q1pkX)`QJ@Rd~iS-7mFqFfuDxksZS*jL|fbUcJ%2U zEi8W~aNZF$B?R|`o~P6Y;?b_X-71Mal?#n!0{?ST{vDy<|H2@Zlh$&1fnF2CHZ;08I2Gs04P z(@Ko^mCmK)TZmA2j<-8n2M>ol5=p3sW48~pzp}ccHaLTM8kcYNP-BQdm9b3Zj?&cb z{3NJv6L*2T)Gsf8pek$W7P&^p$D*$;JSSs_xjcqg_S{0LDtRmU(%s~l5mpb2$FeTR zlW*I>Zt!c-gI z0BwLK_&3>0T4sQT@AWXQWDeNx^=!Z})vMoNF}pRIDm_}~fTx?2Lya-=HNZwy4YW3c z9ILDJy>f~Fh7Ze8;7V2%)i7`Uh}8h3$JiwouwtiI6I0ex^F{7ni{GPl4tshz*_09b zC`#?0*jkuUku;>N74y68M@R_=?!`6o?PKrX^iSrm!G)pl#h(}bJNP`ZYVQ^+W5B19 z5S7TO*v^Nu;QUrCnpAT82|rOqU>iPubTTjLMmk{uS!EWJ%{Dk~Yz4F6{1@_|adX7d zE*JIMY@(rdwb8wAot0gZY~Nc&a-j87O{CLu$9sEf%zN-~XCK$-4_6-;wXg?5DzP52 z7ByG*08^DmVp{B#Bn@HmuG4;Vq+B@GrZ=mjrQ%kjjNR%Jmzs>9P?S^EA@cTrF34+4 znVVLo&jX(-o^&eh@Oa%n_a1?{uxjGd&&jM}u zQJoutTy4hoGmo?w8d*$y^oJhD7^WaFnJ45#pZ;faj97Zx$gdqm;JFWR7DY~Y1zFfx z^xB*FS8;I`Ilgy`eRF@C!rZ<6=fzOtRI}YlG0|zKtt?-CDCl+IT;xWJx-$mHbcgu8 z_U2>WV9|EP;rPTqhQ|YAVIr8V=a}umy&-d6jocK)pTARLky={1$M_1=%73-1DG&O+noS8EaH(sx zmEB)UV(IVWox1^h9+_!&{98PkfOq5`dEMzPJZmRnUJ&<4Un*E<~S{hYeqtQA|eRFl#$$W+|I@bVzu7zGb z2|ZnTICz-%2-*a_t{hX0U2TOPPlG@$kckx&sUVVZ?VKGNK-l1Ya!KK7m2Vxp9K2d{sROi z7m7d|V8<~TSN;pD=y!n7c}|sfGV7VQ3OylSx*@RuE7mD_vKmEb(|nyMN6m!FGMBzT zIOO2f%4D>qCKQc_BR|H#tJVrkYmmy*GyJkK@pxkQR`Bq!k*wQXv@1tJqIvfLzg^lW zWaQj{)z4Lia>_Nw7KfKlogBW{+iT({PcfI#3vcUzR=M5K>K+6lfpL!q|GT>zVd?*3ed3lU}BGC&zy6u>Ih4J&`Q#Q}Zq=)4yabs7hY1~=mv~a|F)`TGH&vZ97G|e5K zzT;%kBT7YSYqLZ<+;`?+OnGY5=XOd-{L1I4e1#w2JZA+|`zkk!+Hss`Q|o;y7+tsL z8-7(!Qoq;;87RB2k+=lh&F)UN#ni?Uy13CkPKaO4DYev-DI|3< zzB0o_DND)08yLiNp7{|t5mBptAE_D~jD)45DhrH(A_=Li;(!gfBxg17q*JyKq2=02dwXZ8N%&H&~pd`$(`+kip zey~ElQcvNT=@N}q3YyQ^Un&W7b1nKF_M+V)kyzMb4z0FR3TdR#CP>&`GEQ3jmDv{X z?2Kox>qyyscz1E#%@@aLCnowpC%2t)zb*T7Kbs%vWYMcsT1it^nN=O-%n9T2%Z_JWJ8|6M zlqlXu@A@ZMnI4$R`W}Ysl)YmWRR{%T-Zr+`5Mz~k_#HjmprDp7u+@^KRsDWPu$F)9 z;UNNc$M?(McB!yOFw{R0c=Gu@{}-cdH?|0rnbpM`Q>MWtE7H~5V+jbDkq1Dma&#hIEE8+)+D5% zzW8v}JeB9sl~?nmVj*fMuP`^SU_C;!(IhEc$;wRTQLJagrIr2dPdO;IR@+Tu*T#@4 z{Fx@h=k~jGwiCL|aGpvdQ3lJc0lr*PnoEU&;qVvp^ZHHyEjULkP->(EtWrl{xf~6? z=Eh;4@H9dGY7ufbJ$#fI;sJd-SQ%R9b2@I{fhjz|v;tnV9Skb2d*`5YCa5IT$7u{bDj> zc@Ues!My>x(AL?%0{%wFV-Z0zuRWP@t+nW)GWVvSP7R$L*<|EvGq0|t4Lm%8GE%hh zKF47=f`{IpnP1Ygh$CDHk?1-K{`vU2L^dLC8b&P?k3M+wdUk;UF7ieU?)s^<@IJ=u zhqip7UPyBlW{elt3!`i6vf;(kDC#SbpYNT{DG7quBEqD4cR_&%Sh42{hW^B2)=-p(oXjN)QiEtPx=FX zMU+=55Qwh8(}`AB5QSFqm&o&&A@-xs;$g>!v7#O^Po%Ij`-bpd)m`DD3behT1V}jcn1#sVIOAH=_H@PJ_V(UUIB|K zm9QASq6+Zl)h2Bq+&>m~I83;|ofD9jmN7R+StWX5+cwaeIU+J~g<+U+uC*03(3mp; zi~s6}t{TS0?yk79x;wFT>jbGD3dsDO_#shD$tQ$ZDY}`@i2?E8%Y(1XdHtgZV2pU} zKinpzt6d!hTHdz2feb}5%>{V8LOwu@Y0(CI}Yp;6zC*6Y?t;@0R>70Q|hp-3Xs z8>qHzQ*+w#|Aw)iX2@f)^Qbi&yYuTEkh$2wk#t+8*{PEH=slP`ngH0O^!jzWnuu+~ z-q_v{NE)ZMOSmS&_pof8%N&6P{0{b}8I_<^ts!*p)CaTCR?#JyU06LONfKX~|EajB=~IqOv(wEf3M80cF_} zg<6m6vh}jE{-@2qu0aQaO-{)1*vvq>Ez{`IO1<=6d_JQT*r@P^jK)ZH`NmzbT^I`v zp|KI=`8dKoc&?rojKKT>H#_~PL|CfO5V}ujA;i|H{_M_e%poa^?H{b+yNVL-8@#z2 z!TcK}`x3e~4kldk=5fM9C>M#W5v`MlX_8|jUM$A=h~ewj>*jhz@`^2J9aE2yHQQ#} zMy;djD+ye+Jvolwf{%;l&&xtMm2=OG^Rg%Vb9-}V|1dheF0Z57;cxp$%{Uxo8U-rdV=Exyh54!5rfbf;e4-Iq)1;hgc;v5;9l!_aFWK ze68Qz&5^ulXxqbZk#=50CH+v#vlJMlE<0KV}yn+;m8wqMgi6*>iF;tB=1 z9IvL3soDTpQBVaf${+t11A=*{NZXEE#rQ?KDC_v)hNH=$aR}O*F%EgqwyN9aui75% z)!aNjjiz!`VXUmx$YyxOXc=Zp7Ubt_lRifyE!CQ6&+b7|Sn2>y!VVX8vs_}NOhXa@ay5ju5Uv>QO_hF0cU?AW+&j3qHzk(h$5i+YDBJwXclqGEte~ zoxk)dm3>B|vZq%;H6K^?KwQj>yIPfR8*}Y~7ZXt>f-<$TS63EciQ?@04>N@A8**S zbD!jQ{_jUPr&}#}rjf~H=&d+1*@A1jm@I|?j)h$8b)!(4l9CD(%3Z<(hY5SK1*>u` zds=oQ{hYL{ANAMD4maGXzBAkWql4uSJqQIiMXQ%@)D1tCeCn8AH$7^yNvdf)8>jkY z>*-B@I#`B*g=z3MbI6aB)~5Js*Sq7`NCl$d`BQtax^7opyNS*4%Fs$1Jqy5DX2{mb z$}l(B%lk0e4tJ#0!DYKw^af_;`mBG=*?MW2(MYx7ZoCG{pZUh`Dqm54@xS)<8Hup3 z;qb2!h*Kc_3=^gKKmlJ=JhQN@>9V414l@M}( zWjEKQfnWa=BbSN@Wkr+pW_roSqNyQEu~G3wvh zz6UtalXqGT*a5&e%VxLskOW$~_E9g^^sNK1cF#3Id(&lpFu?zbC!QD#>>T8ZN6Vpr z`OjC=F?IR3B`fuw(A~-1IB%~$#HAR@L4;hIL8ERBPyE+^pRc>;({kYO5 zot&w!(o$-G038B)10b1*R~v`Zj7P7SgkCR@@hTimK(|dqKNyF8E8x-f)T5fR@SrI? zh=&KfoV+dvQj740e{QBqM-cMrQ@olig3l&mmT_2MJo>jl#!Ny?K;M>#bKr{^TA_^) zUZ*k470l=I>>@LHWobTImLpcAxuDF;w5u@(qATB`D}SRa7qCpd!@n928%R6n%hVmh=s zUB^SdczJp!2cRD0RKZf59*AN?g438r$zCI<7v2 z${U|SKF^0WHa#4gox;qXy0G93_VsKyu^Sc58xh(~sd+OzcfWq$IlXqTUKMssGl6~B z@^(A z0MHg=c2A9b2#(;L|33ip8PwCdg=n9*q{v6LI`O&uDFyB0B>>&Mg#29XK5~?wvv@r4 z@Pg{%ziUA~vFj+-`CerZ(Vdr|9s4%K&N(9G$hj6MvX zCuj38>9w^9Go13)#Q8O$5;URT<-@R0|2jw-3f0yD?iieU`4d~zB|iT3j5=1<2a1HH z@6gi?SkE;|3FXBDl~o*pG+i)oBdu2+4sww{mQg#59r%u8LK zubqg??%YZ&x%72@VS-Fi*iu|vzmO&1Th((<#n5^ z)`WK=-X|?BKfj{l_(wlyVcU7PJ#}p_QMHW_b?c$oorLxyPJgDZ>sXa=qmSiH1~aMG zUpWd5t^a1!V_0t^_d4u*jU$Jq5Ky*uH{4D zHyGDdml0I;^; zk*OZ?6N*S4UAN63vFx%fcqhcdz29qe@N>u0WFvF;7+LqGz{D6uFq(27Ke zJ%dOpprRLdq7?=CRq6d<$@qykpw0!cSWg}%q`1QEq@Tmj@+|&bAJe8`7fM6Vk5(Um=}G)5C{!4~_UoyO z^(+a#wzthXH6+Xy(@DyYnGt@Nvqq5w2&U%+tQ%Fw>eU{=R#?I&y#{zYC^gK(q1<18j`n*TyNT=d%E{?hz@lXQIYpgW+Le5K0>H!3U>9QB{a8 zmG3f?g3cBoefHj2l(5nVEegH6hpJW%!tA@L(s{_$kt_x|Z38A4pGK0&{hYu%jU)JO z-C?FW(r81OlLL{rIp~;V-=W=C?gkT7{L!Gff#J-al5z}C?e05a&?VD4qC+h9iLN;u zi&rR23Or!WK{AItupeGC?2PGtTM`M0w8cme+?aWBxL}#34Z`r|DR zyds+=VFy4jqCJ@maR*IS!jYUu@^T2`c{*>~upRC3BQDFtCjbQS@RWBu_VW~+pMjQ7 zh(7jdr{_`eIfj3#gP2qjW8wSi#mry?eL9y!DyyFR5aB8Mv7i^E+`Kn? z({ptcPv`vg?&sGpZ{GwPoOfx9Z`?60Kgq1ZbX=!p72&ohN&3;ZR?=XrP>x$^KotV+ zj-WEO>2HWY7ZI21%Y$=>!-=h%uOw~sLqCRh1eh&}lk970Mgh>Dk;(ZJ(;Z0@UUnTb zKV}5F4!%8w-eJ&DV~0(1Nq1#N9tUSGWJIv`5UEmtsy0kB z9&_rC!A)V~v%ZlgQBh2_L|)EIm-O6RMdAWN%pKA__@4txk?p~=H!#vHN(rVkA{rtd z1kRmMD}c>_bZv4}Mn-j@)MK{yBUkJi+7)ohlJCq}6d!_p#s{2}bibgB%kONkaPe9e zHeTo#$W=zQ#ZwBk_Lc&wu-DYShMX^_9+zrTS`U!dIh{3q&jGAF+f#DYkMtlBk}Gv} zSBT_IUg*!)FZ10Gj)qTD@^z)Lib)#~)S?PyOY9*C?T4rRQXN6W^&>+061LEifLb%! z&QaH%>E^SkZ++?fKyvxdH*KoA{0 zfKL)cJ$~D}cbJ<@vFz%DDH*4TvQP+p`lxCTOkRxs`r2s835F7*1LOSzWs_a9!TXM* zXHJI2Leam#m%H@TgqMMJw^rvnr&`spFqf?{-D!4?D*@&0miQnUSZ2!hK$%H0qE~Vs z=t!WHp88bQ6;EMeJCy9D9|MTN@A6*kO>=Q_%A?RmJQTvvZ0l=~ts%RN)bWA3&hRorz(w0|wOco`1~7fKqFU$!_K*cu;M^%ddWe z^O2T`tQwUEUNq`|N0SKyH3BU~JlKMT(wmxi*Vqy~_C+6-k zYS2PdjrM~!qqN2AG_cmPSj*uw7U92L0I@rq1&sH?{}-}R`&Yk0d+?jnhHh@&Xp&7f zW|o}AxXS;oiV6;!Q94l-NrL&TIUb%rhr`IZ*q!*zWdlR6KvrIKT_ZOMa>oB)Q0EDq zO@jNLwkJ&Vw%usDz9$_jWtp>%a6*WDl9P?+$e^vg*5(oDK<@jTvP%7GV@b#n^Yj zQqZXNJa|tGDzhg}yRW-&9sl`fw4gY)b-RO7w#d5HR9WQ-99cN3xj56h(|$b2AW&0C zUH~si`$0xl;kuwj%beKyXqr^oo;kp!>E2UhM^M7-n>8pn>Ab=5lX zFqM`#PRjbqHQo-uyZ6qg;W*6R!iM$z;IiG}MvDao4B$c^>n+rge`ejIb||#`H~MIG zdNgYfY9e)1-AG+}#*=Sl17?esDQ51*p=97kV80; zV4?|ecGbMmr^}C+DWb=wd8KOJWM|c{bNbq$PR7@MZRDHeY&e#>9;_Fqz zU#c^2s#=#=i&eZG9l#-(TT#b**Y+{vM>Vanv-!>R6EfDYZi9s&pV_1!DCD67U(@W)uKg3d3NTNfFPfEz2?C;=Vq&4ai@J>~8%pD#8f@}Fkxva{2 zmWctJBsRmvLU$%xw59LRHR^R`ku+j{$qxcQJYp4%2UYo32;|7>i(Z{N4`^*-MVdaT zD^zH6c$~UOi%!jer*?%$xpAog$9rMe|9 zKXy=c1%iXqT)bQ6aPLm<+S(+wwo($uOtDLeppAM_fEo~RdI@Ch-a2;OU1Se*!ncsV z1obhom1Y;#D8|4_LcER{v1)VE?4qj{c<$QHZiFTNZhab(ogwx56f~+z!|5K4x-U2D zooK5R9fL>PVhIp_g~0wH9U>$9$T#VKw@O~C%0s8}wSG!vsn)J=D(4Q)nh-E5NImO* zt={yVQbS=n;58sl>CY2_Z?5P%0H2&HFgKz!O3r$JB7 z$9V{tnO+L+V}J&(vO@u0WV@V~!sZbTJ`1N~V1gULl{W`^Ae#|@-HsN0G^*vA<^_rM`z zmUl}dSE=W8&~nH?TOb%^b^|`_&eJONa85EymUM*9PMl|ua5(Ig5EWeyTXh+1$UwyD zIj6>6w-?}76W7FE64UmW`SB702>#%lcXk|X7-x+p#=?LKdZX?Wuo+t3CNNz@+fRWy+03BRZ4I2ROtWkZ5GuP4wAUB;5q4#H%G`R zTXn#6OpO;9B5%0it=5><+^YV3qNpnIVhIuStX={bQJ+~?J*%Lc0DG# zxA6+jgEqVuOf@|*drm=Q$`aSdC6)erTL*c0$2yVr4J9@PXWDeU(9W3RpHYfHPm)h& zFhJ7(!Pga!ga2QEa)#q{KK=P)o_z8X0A*mow^N=5t0IFKFryXvv$=iE$j(zY)xcDQ zg)9))Mv*>WGtt0x@Ff>Z(8@SZS{V2bygCX4WTE#YM&uN^Pp#TCA?;o%?NG9=id|*i zxZ9B2(+W$Zqe_1ev=5fHWo%vVy(}Nzy=kxQB{vzj)lmkTAIpe;7i2QN;ROLO4>b5f$0rwIv85sq+^n1fL zKOSpmlPv8_KJep*`H~(bB+p8t-#7J7oyJ}^$^vo&%hU7K7aoC4qo!&I87n= zPy~@4Px<_PP{ms1RGFq@!L+ClEd+)IKbmwa%{;^l0L6|@w*&C;?~W1h8gR!vM^gUcPG7J|aYQx8xsic3x=Y~FzkGOYC$Vq2oQ|_N z%x|cIw*Dt|LLZK4ef^#1YK;}shg(@7 zE)MA}NCJNaNJz6a3fkWBf1jrb29<`J!W2r@&@-K|h{oZn!}Jaf#_1<&SF)|`s#EJ> zIjlPdhY!LiLDt8x&rZGA_upIO0&3KJt#xi|=hx~%J=wdUM^F12D^_YV`@A3^^1v@? zqj*aYBBQB`?^($YqLSfs`~dLRPO6;I)w@w_Pe2d_C+xN>x%!Bi>dYF-^6g-zZPGs& zm!rAIIlK!J8fFb4*1!zafQ>ZRo$0~vjO5s5>r`d;G z@Dlx@L@qLUk%*{dq#-ITNr(!Qf+&v!4c}2FR4_r2(P;HHPx%c_6VSi1O(E--xkdL) z!{3^HvOoa1!h75Q*Ka;P)bC*WFNcs9fM0Jjnf#a^x2pbp+EJd)UHuvd5q7p$o5_!(*@f2;48W1`- zSIOC(;B=U;HFy|7NR0S`EMT~kcTpr}GPD=K+6g$TZNe=nZutnxMbGE%HW-;ae=2i+ z;wOtCu9_qc|l~CpP^~`jop=9DU1uf-T&dMy{zea7; z{r`1S8ahZWv$gikf5(BMS3V!Q#-ydD@LfmKg-p85o4%|$_ZwFB~@;ruZy6IyJg-N_+?kX1G`CDWhP z*z8s2%TQapSe0TW)M^(xY!4JK4winPu?zNEpZfuYP&?&>0$UW?Y8DNxB04YW6+7v) zGko~+WbO6*)GJ}-_CvK;vz)4>Y6gw8U6H|yw;)r z7OqsKf>pKUl3P5`(JP%8{JeerUuRu(mFfnY0S1PG{?fvNblpNjhW~{PgJc>U4h%KS z5GxF~LzZ_ey6a)Go_ZN!l+i}&En6S|cw?^|2OYA+(s03<3m+lm@*}1Hmq!GQ8=Z8t zq_ee{TioLj&q(4GX}plvZNlkrBsV zf?Rpb;`nwgY{Vz9%TA67;_kF%zXOg*QHva9>vokv zo&Wc_ic<@ISgH|q+zz!RGH&l(kN+YyFdb5M*FPX0ec!P0Sim;@6B-wkk~z7$B}9?A z?A3ue*75;XCZ-pjnQ6S>IW1%(#fQS%htzk_28rs|u zwt-@KX2U{-HTW01Hr(`?8YXG@^U;M`G2jcr)i2447#k)4^Pyz(xPn-{Q0y>7V(E3* z%5jdex`Ls?pDVPC%uEL9WQYNRtP|V15b2H<#~ciK(4RMk^gS-qUsk}-;C6#Fk>I2Z z2ZjfK$4MP#bxEc9EM}8EW!05^YwSUiPfbrXT*`|A$cSMVUy^-nja=a)%3^_7NhgM| zZY{ylWa7MtsbWn@HH2c}^u%L^japVPhpm1N+oeez`gMe*C^bfBbyk&iiZ6l7 literal 0 HcmV?d00001 diff --git a/fonts/fira-sans-v17-latin-700italic.woff2 b/fonts/fira-sans-v17-latin-700italic.woff2 new file mode 100644 index 0000000000000000000000000000000000000000..bdf8f5f9844d5d875b915e68ff4b4965df337049 GIT binary patch literal 26072 zcmV(|K+(T!Pt24Db%EC_-y37QrW2nvFh2!Zz$3xyB>0X7081Bx63AO(a32aa_N zfmIvN_9qlKOouA+>&@zQ!|)gXh%%XO?i7?a_RVfzMWIyDfgCmt2K=__lK=ldFR8>~ zP0rG`cVMv1zlpiKg)qa>OA(fknQ49GP|bbOvUtf>jdTkWY&*P#-hNOuh^nFZ$*y}n zFkrl%^N_8hAbFkpOya|~9?V5G<5%F_v~-p)@!)R1f(cv0A}CChg<|*(!)B9!ota zn;*yY;f^wAl@VXNTMxdpUOYu_y~r{!b{Uk2HddT?c|P91o^S1{bG!S?0~0A2P6{fb zUj01H?Y)1uHDin#W3ppKkK7DuqzE>sfTSZOonTN#C3a&Zm>3mc6k;^^|8J^!?|tw6 z|Azr2s1yRUwgCsy*Z?&+<1`vjFf`<$L#o*jcJ2z5TNkc(2Vk4JLNO4*NTMVqDkNG& z2?Y_OP>eaN7Oq@;x^S7e%KO}2nH1H2yghpX6e_~8F_BR~nz($7LXfdQ!jTpK!8RDe zy1%TnsbnBHgXUzoZ7T14QKbq$PM;J4_~G2+zotn;mkSh<=J5d7NFdg%*q9kT)__KB z?jv03D*x@QTdIr9kc4)SQP1@3j_!1Mjug)Cin}+V) zhA!hRLxCq!kyT{XJ=Brw_X7$jdXdlh1{q{K%JmB19~v=+Kj)Y*5oscNeWfHR1wXWX zv!Vn~^M=7!5Ib2c`vv^YGidUys441n)yv`m@c+*}dc*jUgD->yCI{pz%;waD?C~=W zh1t(k?J>5K2uTRKO6Q^CcC~Ty4a@(-vZXrkg!^e;-~(S$=Ih4Bt-^`H)2l20jK;D| zOAs%fy%1&vIu}jcg}UmxHZMQg)hF#syY`%b%%=TqV=j4vBS#+!tZU2Vpa|;4S_4$A zv1_}XlnTKZLH+u2)2$anbQ*k^Uw!VC7J>!Qzb{p5H~-(C5CO_|5#|I=7AMN9oxq*L zMUmRg+>mqk`>*lw`*#CGgRl?;3nXPKP!a=_0vZjHO^^<0M;d!Vmc2>iO^FmGImmJh z8&f)^a5>HF$#YA`J?(8T#~hBgJseIEKKiAz`!=Pi9~B!RZz4>!;w~zk+8q~nID|tg zbg6$(NQ7hHAO2V6bk)sTodmuEA(1UypSB7r*#c>L{;~(bzTUUF5B868Jf%d~1rS`A5cgn&AS82Ey~Fm|VUsnM zTWGea#;Y-cS&c$DG9*jTQ;cvy3@{$O2!=~NhhbBd&==}BjG=2`I&~fNjXDP7&<@ZK z$^?BU|6$avfYG!8db1+nT)m2o^A_2HEA8(mZ_drU={5z3 z;6RHLH}&SUNjJ$RWU*O5|7Y=D@bag`6PJA%mu5S=j7zWrmJVD|B9GfG@#51o)z-hdwLf(8+C1wA zeaq&iuXH1vsNq1_$ z_H1o43mGdo!iwLi@AV zm>`#BDP6#bsKRm~MV8blboDe9RG;q;1L6-rm*XhU3tQtf z%fia&Nx13H?yd-0)fcxGm*3jimmACdjch7S*zY*^eB+w$BGJG+ld}@N%8(?m!0Pb> zp!oI&1u!1({HZ4PADx#}m{;E57}KUkD^_ly+AxWqY(Y<_rEworao{YI)m~EW=lpD! z>N#PjwS@;@i>9S3t*BZ;E^2=D#uuuff@q%oCMF>MwiInX(3sNf_}Z)ZTC>IC_2S*4d2xBCpz)EWr8(a@W~Z<`uksbjt5@BX zk9Xx*rN^|xZ87pdeKGTP(9^Cao(3CkXM{?_rA`0-xlkx2z~fabGRn6KBK9RP zLcp-^?F|0~eFN|Z;P=oA=n-@Wy0*jq2Aw`ZeCLjkn_~VA#gi68#)b$2CO)W1Fk2JU zry}zI2c^k-|3C!140r+XEZ`}?>V*8{ErXZhQknUu&j)m*7# zI3RP3m$e~!s5Eqr`W4ZMc0DD2d9s~B^7JJxxatR7N2uL%Oqu}LHH0_QOGt5R=W)F^i z_EWg#CZ#r{Kub>G5K(lbJ#o}Al!hqfY0_=lG0k>aGyKDb-Ip$c74KV|VqQvK) zNXmqlNhDmG%!jr|Io(}HcTjLmQu3z?)IQ_%~LnElba+cNAllDd=W>;`E4g z(n^Zaykc(`Wc)3MsdDmGo-(%fk`y1>B-y%KbUCsxIc0o5nau$z#arbprduY3D0xs6 z5*<2KAn9}~(!7-$8TBQ>_vw~(``!vUhEDnjsqlhGqZ9B8sWa~OX;2<=OB3hig zMZqXbuc~Hs!)jYj*E#(~bm`Lk${lp~uH@c5^!&x@-Mi?+NA%?j`u5HE{(bf1ho!RF zF#d)c&fW+kNR2d-g9=sbRjVdbqlU;RqxcwYoSsO4$R8>3e3}0ta&e3S(>T(M-O6%27h?9UiL%ru(DZUX?2 z58DyYtpQ8(TMu83tk48ou~FlSa_aVNO~+Q3w|LQ*gEb3iBv?n|Xex{Xu|YThkk#oF zIvt`kLP<=;=_HLrZOLxmkM`_q9jKL(liso8QBXGSq>8e#C6^e{m62Q>(X|m=AKs0! z#OMh_hEUT|N<;$QkF$21uceLn$InC}FY5=M-PmQ9bEa)iFJs7qlFfAU; zGv&^GHmq9J@YH?w&~nS1bkUqqC@Nb>NZueGkG$1bGI|^LSd3XQ28w$Y&MsDr)rC-E zx8Vzmmu89+s<1VQV?myw-k+Xdtk?Dhfcb2dP-s;8$!D)#zftE8mggT;`ByUaWyB_4 zRUrD4z1~p$(&+U%r7?#auV{h&Uk13?ncWSt(e`O?!p@>xD1^ry?ODwA)? z6Mm$oOi7*ozi=bWc19xN4o^W0d>9`{d9FcXF^RT^&p26B^bKm#KSG1wdyL;%d&(M6 zM1*|egz~raGK*h+`~8o94FIbD`b+hTf^?W9NsQ1-iE@}q;&GmM=BcxiCQp}V-sr9r zDUbs&8lWY4;<(~}7~9xJ-C1EzHtrYSr+)i``u7<#EUQU5S}yzUpHfePSKBT;j<*q; zZUTQ5a-2|E=wjZ~aM3CiqT=$wTQjM6A>GclC7;wR#BO%HWE)<>R0@(0lN+v`B`$BCddzgjHNhLzO;>@^|!2^t$T^k?ky7Ht%5P zHNKS53e(tEuzoUcTFJYFyr>P~MRn}qG}Tv|Mdu6bZJQIc=4CB)Zcy^Xs1LMJw2L&q}m9j!&3??R=Yk~$jWpyC&HR@W%cvhIQ@!WXZ zPYlk8nGg}=Uf-5Ls3zlz!uWk!*G(>O@McBqMrSOQkQG>5SO~a?c#!YR6gR%(NGef4 zE?rJ+9gy>|eBcIQ>b8H~u(Wdr(wPV(8RcNGE&#}(rnI;%hxHZ!USqA9L@Y_zQr29l((t4kgx^pbxgbzXsDy=5v>_)G*;tmutVj~K;Y9tY zVQI|Z89OYEi`SB8EEV=r#=UjFYR8i7b}VUtA;8VyOsFI^WUBmYxGJR~WR1)%S6oC~ z^Ws4|;>CQ{hHrPPABu=Ej<2$(AEm zo_qxgRU2ixJv2`4iKlOY=xcqM+Sb@zuRkyRBd;gV5{GnjIosNFL`z4jgoH|HZduXM zot1QNbtL0RPL@+h*RkbCbSULPz-O~I%ZIz!Sqz0yU}CzrxOf>nq5}GU^r=E#-M>^$ z5pmx5Wz`Q%?;5e$99;B!{oLG!&M0Dfh8Y|ro|HUO_7YPW^{hIIsbuPzu2Zm@biQ@y zG%_$`uRdD50PESf80ssreJx%Kt>>Ak6Pr_3$Y+%_o>%3rvKxs5YdkX|OQDuDy4 zGE>r(TYY#F-1_q)=UX98elDMYRRvX5Ev8k#6?qGo2TUE7P*sBi4wXP~Q%b9b^*yj= zJ=(u1d|G6|d^Q=;DOJ=3YG*u!JP0Brk>il!s68OEKfn%9y@^+^_UB2JqK71=Lu$u` zdVQUj;?8zf5&_KqLNdL8Sj1DnYx43d^2 z*4qUp;1_5~=nHZB$|~jbQc^XmwxJJ1J|H!3w#lQ8rg9MzEUTd^9JQJnJ6x4`TfN}R zDW)x_Xlp#K$l+M`q?o>^?d>;-;>@&8 z-nf?(7S?dc?<%YaxC_=aHm1ueSEta^iIFS4LU_qhRq^&)VL?NSyJ|+?zwA*~vAZ+a z2(j9=%4&usp?ra0sHW-c+L8AMfhVJ{3J%1I$&pgBE_rwqM_Zx11>K9<|J8)WTllVm zBLTRE2~Lp`MyS!P*hism9oXl%5~EKCBkdT^GW?|Ol}U8xq>u_q*v~* z9|Gygn6nMco{0;!np0K`|BR*s;Jp?ukN;apu3D<>TE~%~{C?nX|D@oIbP=a$JS?>9 z%G5D~M;x-U2%@=Ca{;x@aQzxyan87`PJ{W z9cJh9qgF)&M%3k#qyl<_lrVs=K8k+tNmZzHkS2k*?8&jhJho@taXze@YGMSYclv-*=~+4Ik~Xw;ZInYXZAoHQy;(@md)q83%6Y+EwcZtK zKL-W|KY1E$u$3)y%W?H4I}?_6=)is^21_9j>8z6g^iV^Z6h)h^7Ud|PJe%B6ra};| zMcoWB($SPm{YHG?u5!Py;Msu*K(BFo;OY1{=NR??4Y%+l+6V$6Dw333;(%%ro}(gr z^ndqI21D9t!kA8Jvl(kXHy2CJYQUCzyD;j9K{R^0F2!(T+9;>I2fj=>HXmD0BbZt75gTEVz)!)B72wFyNY}M zvuQwgw$t!{KK9^hBpe^qT=!UaX)6IW8`v#IH^w1P0)pv@iE*z!G7lF{gL)aJwqUK* z)O*LS!DPB;f?RD*INfNpD>Cx7cr1s25sA*m#EG6jV^qxfstb@nUljhzKP4q!95tppr?cGIt^?rahlVHvGL1oOQNi$5RKZQc}F61)IZ8kF9R0|L|PATFYe|P z=361v19#|c7J2fHt`VTo$EPAJ%H)Q^l7#c{cv-(B%#%*Rf$`>4pgzUGRJhTzq8u%LbU!)iiYhx<%z8XXgq=c4BP~tIQg}(og&5^N2CZmdv;!*I3K8g;kRaagghaKmzaeDlXz%chXIN_#8 zsYbxPh*j;`V-#9~F@`+)+M^c2Jeo1bAOt8rOlh(H9st7DhPPLvD38IQxa`}=``PBn z>pk8x#s&U3J4B84uvMb=(?RGXj#TNE*YQ@kH)-a8pA(=v|zWgLdUX+wmL4CJar;PlinUm25}Wlp~T3 z%f0Hxw+~JwN{kNy*abhICGPo5&Dt#degfAydsoX+IZt-{gt~{MWit& zW~igJn{=1&{DtBZ(-gy%6SbFa|Ao+rDYC)x6gC%c{e=QWKJc7varEm8H^VI}5JcAe zP@TU)g3BK*PGHXV<+fJqcV0VNRNrcHiSs6nao6l19ZbF>5zfhY6UZePn13#oS+3R!E3LBH8f&fldDkDx z1SL2j35_xGD58X%P}D-iOJ=g(1{-a%*%n)Ev)zuLfn8TX^f9DkI;C^EB(O|KH9*+l zmp+h&ICKax?FofcY@p=MY80uRVTd|sEE}^R$*DtrAC!O(;RInlgOP2b!U|h z+_bR^Ag&jdOh*5vv^gMwCIl5yh^>2z-+?kJsDyU_Vq*i*97RP3#^p0`GO#{>2kT>) z45nS##voFSP6M&^dRO_I#vF6aGv5LWEwb1WOP%-L2OoX%Sqsw0LN;=ci#+6`0EK9Q zBJ2<+1ji(^!IMMPBr5~0@E5EEML9}|lFLWE4!Q5iB$G`s)il%1Fw-ov)oar1wXnlj z82yIwu6~b($^Y-nQUuE!OMx%=?0oOFfFLxAzzUipZwRLKtt3c11}67hN7vgyliUkC zirDbxC3~(OFdx9+xe_n7H%r2B;Xk+y+7aTZ+K(Kd4~`NdK?(>u^T1bK#m6Qp^dl&$ z`$iiCpC&YuW*khM@hsmh5u(%>YaB%BZL~3HF?9l()JQD|ib!#(WM@HHP>1GVY8C)h z9&A*qsKGoxjjUJ+!fYzK&vndPOBpMcn>s_?E`65KzZ)sej;QMjr~y?Th4w z=Oe>mHH)L6HXhZWKN=nb-wUYIst!0GYz6z`>8STNeYzF{H(rM_8Y5-oOYF=?^R&A*jp|#%QR#mf|E2%uyrTq1thPM+KETia0Q~&b_JcqB zAmrJur@uZOe82j==T9DC69ldY+{-JF_hpT(CGU{VTfQ}h%j76r1C2?;QSL^CZn0|NHqfXD^<+ za0yL}Ub^d{rzHLKH$bdGa%IVuFUNPtGt5wB%2g^<#lzs3i4Ht2ZoB2NCmz}4dwxi1 z@9+Q}dMA3!-g8y4nyXytqztH1R;Ph+j#+zlKC2GIuO2U&-X_+S-4uTw9|}hKI^_Of z_cniX?7$bB3lKCT2_tE9bI!Fb(f93UixdOjM(Kg@D2xqw`w!W9OaJyM@Wr0T_qalS z6sVg12iHL{*O?O`JR=u$G=PE8H^jhYx@w363-Fgsi=T$8Cmhem^hppBY6qW#sJQ$T zyt}t&&zdW=azpuUC>T9y!K*QQbd82AgiL-7!3z2JloMV?(OQmM{F9cGyeryKa>Ojj zDnX7f!?XM=%M$ir0)X?Kvgf>;UDRW++=s>F(SW>%UwjLQ}OmF6e~w|b*#D4A8}1w zy&v8lo>NYk8T0EXps2_3VKS1Ec@E8QM^M$5@H_ZD6f{>qmjZ;4x+qJo7*%^@x=0 z_jtOFMtJ%BvrJk?{#Na;SVI#9jH;oP8k22Y0}~pW)X0>^rZq96saeg;U7nz(e~~_Y zdlVEcvF{*Br-u$iZBhQ~cWdYJ|D&E`jg_g$f;mfs6~Y=}gRn)|A?y(j2uH+neIC%c zD)EO$j#KpdO7-@PORygJ>ra{h^o{1eL|SI?7DsM!z;g8p1o~{mmt_wA!T}T z*y)+ETINRq=yKV&n5r8sy%b5&Q0tlXHgRl!c0c^o^Jedo^>MQ_pG*f>B5yFVI*Gn6 zW73KV4NJ!iIO9S|FfHb|K1)|xF_~4xyFp0-l2IpV%PCn-sA@T*3yf$i1yY+WxjBEJ}O=Ff%M*q8;ZFnMU58hoMEM z;zV)Y52Wmn@+wStUEtAzzOHR9mKFRv(f#HNVBV})2UL|iX5+3Nh1D8Tk5@io*mDOK z&{e$7}P<#RPln|0{ek ziA#zO-r1u3!|27junqOZ?(P*+-vvb=OnmJ=_@h>1xqodIQK3VB)3myBp@DkCJP zS8OZDLw5(_d3vT*PoLvly}ec!z+UVy!|8S1ta#RqkH8))T1;}28Ef}u?Z#yR5gj( zsR_WKwWw!NwS zqf-1@b%;i8A+mdjBqd2Z;0d%4d-E@B|?VdO;@l)|vO06{zWcd_S+-Upyi0uOg4wbA!ibiN|jU;?BD zpRiZZ^!}+q_)0u{c(FZL)d7BT!hkhB1X2dIcW9A?*vQnct4l`C$~+M5>*YI4)f`0W zN|a)_MoMEqO@IQest^#9lu3g`(ICpjB60&#wXjBN2WgeZnQG-Y>qvES%OXaEB*YY< zMRzsQabV+8aJBH5#E-T5N|2Rwsbw zFqBhE0WoHQjwn9yxhbVQWZ5zyoEwz%h;oiMd@_RNOJ;GhY{@(V1<>T-ZumiL}m1MReX*!+}BW11+ek^bS7F- zaL@uEyhs49&){#%pGpGTVbW;^K zk+DjVlJqsBLpM?bqsFT(%ql5%d-UZ@lMMTOC5h;K4+>lFN9XKJ}jDwIxngdFi`iu(>lV9|l7(zN%OzU9+BM2b*_XIt#QPydPtW-RidMrq7}9f3vddVA8Z!=Z8uI!xxkMDjT=WyCEDRy6-Ml z=sJOHNcj#GEJFn948K0&ExLTLLx0F;VR}|HV7rzLsl?NiPKRuuzng&uLTB6{Zn99`XhddU#RF7n^1MHj=!7HWt z%Ew=aX`^%;!l4!B&+e4gYrX#dUAD?r$7@1wYCvc)PZNN`h8C1uP8F%A+CM`8>~)i- zY}7H`b2F{A9D7O1z2*%4r4^f$<#uQ=9m}TnO}&kZZtD7gXKo-&bfPXI8&ylb>FU^$$Fr9?I19j;QjlBK5qYNc z6#>c98?1#wMsk66fY+6{Pj9G%K%3zryfeQ^Tiyunt0T$%XfI*|=pk{bNxBCAp0FH- z#RUtOevV{dN63<#e6^GvE0b2gl~seI4%K?Nktkl7+n3ZuzI`GyVb5lpi(=lJxkZb z2Q#aqpi#*ITF1oWG&ZXj8$!V5{Si@rK(;D-aP1&*xm38Z9^uwHq@*5Dw^v4f*~Cuc z;5a+c(%RSIC&tsV3*{{4M&8VCoL`E`^Q<6w68Nu}K`w;)V?u4LmHY3Rw~8SfqH`%H?<{N0OI^4a~hAwXB6Ie)w?-vY48`zKkprXc8DGD;||2W@SrvGuEC)vrF-JKL& zmdKoiE>1v>xgs{2t}E=;#r6WW1I>^4$T8C7abna{WgIMc%Db3Vw-P(d5hRKUyA|D# z`$3RAit)8%9`DD&yem$WlH&>5hhhZ>PY^z!;-hbKV%A}vF+XFa40J(e+)i&;&D0+J ziPAOr2zf>ue&r;WLi`Y#EtN-1GI+h6_bw3*c6GJ%iY{QrQ-ms(5o+mCr~~Poqtr{* z@+P0`d|2Q^bZL`0w-@>8?;b+xXj&dO`~cI)2QkJyLQ z($|cSey_1pd(~fxkl8QG`&xLvtR}IPI+eR)K`lVcmt=Jub9&o39hn$OrvYx;RL=1j zeAb=kSkyPNn9SNA$GSXarD zWv5|xI6mmj#&;ZtV7gqe_RwwV708EZYm(@nYGw1mUkb=6QCD`c-4QoYZ?bwn{xy~-cm1^XP3lpQ;Me`}OWiuj>sm8ENHUM#_he2tX@SZtfuP@07If z3W0qX5A-F;o_2#5chV`wlG+z>QnEbDD<=Vdoa<%(doX>3xH04po0k_0cuXzIS%xtXZ` znf(*idT+0Yq+1_<4+l%>is2~Eku>L#dFPU{im3TDVNmCme%Psu5&WDrKatoHo4a-O zhpW#A6E}(7(kI!i)z=3cT9MNB{P59;RB3vq6py;el^nlrv-3_(WYkO)Tw^!G63DI} z@{YVDioKM7enn>dP%u#iNg%pDEx7WOW!F4MY9mGkMp zWRYzqY!4V zecChyF?MekLNM}Eto!zgoY!kmcW;(vt!lQnBNq%>>fKwVS2A*Za#Jugi7SN}I;Oepcpsiak|EiKum46LGHNoT;voD{J^N zIvMrlt2GE$m6|K8?G<~x<^*csxP`N5;atcXP^muwY7MPJ5_i0(C6J4iJzNZZ8Vf0# zr|?Ab6ou@G#lXGyf@f$*d=R>& z>x?yHSH{_&N=8*@WFJqzjMn3AO%2R8iN2_X&;F`}P1R%mc^Vd~Mwg>w z@B49Fi3dxT6C$^&c7dQW66*6P*H@$IPzT5-&-qLFb*IpBrLnS$r58`S*{AVEFZ|38+eP8Vp0$le@t%ojoj025 zSZzrZn}tnaXICZcBvDe|aYrqm)_=Ml%CDIjOuMta&cZp^(d;t5gkHT_#WUtLGudw! z!$XgXmOoe~fc?eijKc{&aL?cEXYjao(XQ}t0_#3ucr$sr&@ z`-@oOiZpq>bVRP!^ut@47>%iRd1H-KTY&3$La0npG21Pm7E3VI(oyTP%SjyHYU=3w zsyeRxK6L%~xcM!b#Xn*C*jcbn6KW1 z^}dLfD#f`)?BRKu9}2K<1#_i?c=UYzrwf*(z~?=Dru!d=9x|_oa6&Cl36(&V{Jr_G zH-!3n3H#}h!Br)vE2DVqydE;O(!IjL zrc+;T{nyPZn|?_pz1agsvxeTZ(Opi&2FV}+-Tcx~jq(Xt{r7)I6+yn2GOa3H*i{6( z2|xBS)|Gy_McmcXXy@-4uWN|Ld+LijHa}k9VCm#;OLDO+ST%3EizUU`e}9+Y6WI9+ z?O8KytezGme_$QKFTyp%FsJwHyKwL+z0_FHK&8B~-Xo0|#m0hY8TpABZCWAc#j=~# zyE0e%Dp8+%c)l7D(3@P zHXNnR2I26d$Q+eP%w#&6=w@{%m1DMjZpH7-gRGwWepH@JE1)usb!8fFsOj>}O{yO< z8Ybgyl|hS?=n&1V%Z6^8d$Ru-5}oP`3k~QWHuCEiiU^cq*qd+uor&>S^WpgT;+&&- zW>A~_-Bi26A^%S8c;lQEz+MdnZN%dvKbfFty~(7{#-e`FgIcVJ_yhZt?E z)e;Dby>^~f16?CkL8u%@nSEXlnOtes2mEbl$TyJdKFBf5p1D188UwlnxeA)>pS*^F zEUa8uzpyJ~p?ATM4%zkhsN55>`(5|XT#8o0eKr{6dt`l+) zb^5^RgR&POpkg4Y3D&b4)Rs!R1n$;Hcvf(D{;D3+sq8NrQ=5wZpH*{TD8#hqOt3?Z zY|^4ygPcY+Mc7dFPx&Z62MiiYaXl5@5&VPE;%9Xq9Iq}e?lLV zcG7HT5BU!5)+Nn*SRFslID;4b6q=REBG*oB7z=}woJX9`=-4qjFpI>H*{+uDDT&6!}N!1J4^RZ=I*cfobe-c)2I4!Pq0!V8W?qj4H34) zZw2WkN|(fC%3Zs$k>32+;?fhzLAQiE(N|sF(LB`E>v&~hOoQjF(yOEKoIa>qDXhOrbt*&o zJKq-Qb{Uu=rxG#yZk@VhjkorjKVdK#IW|u-Gq&)n_hr#Y5*_v`zQ1 zZX1Vh4j^6Mso^B5o=kM`F1dl_1JPcm1<|Q zXmuO6PBs-MIgfZUqhsgL*7aNu3EP9k%261%CDOLtHLx7O({&W7rN)xG(^M`K%A3bk zf$|tf;V;i{3XCd&wO)Z}E)xpm1o+3L28~qXX{?&=%u2S5tD&~}R#lLZ_t&$-K5uNQ zz@MDVJ6T}@8zTXu@&D2#NkHl{8rLnokQDUF zIa7T;UrWnye8Be3-ib|~Sw$s}&U1yKKB}e!k7+OKRuDdfbJ@vZ2)=^DoWyA>g3~NM z9C2l@x|kLYhZpHr26YiC+c%5U;cruG(JC^X6>O6_sykdpzR;yaj())*DzU-skKUu; zPz2;}fual@{qV+HjRuE%x3v1wa_QRo8xQR>yd*8dC7Wvzo@Xp&dMd%qSMY|`I;tf< zqiQuGdPwGw3%+r|&+1(^6J?!Ouh12(M#@0d|309)OUE?0;%owLOpPmnTKIg6;dMXePXIH&SF*wpyWt6qb}hJo0jc`A*Jt1I_A^3Upc6v9N&b|Qhq zP`J>nFioZ6t?_Ychv(cc!RK4@ONjYM66HQs$M<&BoJe<3(&AfE9k)_V3+Ywpp%1hO zzbD<_V|E?@8vJPLX%35Ftt1P4bhU>2DjBs8N5mJtXMul_e-2)BgTtcPonGVZq1mdzX05lFiKhke0(jV{cw^IO1P5@xRW=V?+nK+v;pg2jitSAI*-@iBU&|U z6Jd5#Ld?2E1MD5y00Yb$0a)L-rN-|epdO(K>xr;G-cu-8B!X6rC$cSJ|LSWrcmf~dW%O6_+?4o>YrvK)f9}Wec@J_L219uVe7GHWLxYH*Wi}xvZ9}3*?U$;W0HE!e z%)!Vh+o1SSEa7da*673G+|Py5odiRZ2oQ3A;MjxE9KTPC$7xF2^_|YEt}uWRKX7z8 zJdw|@EyXGEvBTB@fWWN3S$&^?`(U5xt6imkPeB3LeuYPpZ2nQka}oD>^NuhCI7V7{ zR~UNz9gl3`xj~Nr@rOH^yw8d~vo_hjWi3XIJ0-oQ*T~OI1?hTter9aoxJ{V9Zb~kZ z)C^N{_MDEK$23q=hf6`7scSTXvv;;Zw;Iw^ub0=~`U`Y*tU;wVl^dl}vB{`b8_QSA zWvh*aF1MP*QrQDcDz)Ly`O~chY*qo4R={Ex(CUv4IDJ}c(?D}(&a#f2-JfMLe)Txy zaxd!#BI0;wCBp8NS)1Ey(z55a=gj%D6-$Lm6TC&&{UuC z$?X*@fZ0nr?3Y&{L!ov!cACpnn3B)rxy(LCxj0+-3&Q?UismJ_?fMGMI=<3M0##fz zfJv=uhXCCb2%9)X`RgUc_U-HIXf*PLzL!VT8>7qZv4?*(}{-sQF$y2X)W^=ly zr#U<>i2SlXjee zu0L=Z(`W2Q4+CD6;^O83?4T^xaT>ZFkmdUM#W899paP++C$-eB;vu#Tb8BXS4EVW} zYgh6_UrlJC(>c4*;I-I==UuP4#e{2qt=pldll+wuxyo%{!^FU?P%!)$6;a5fpw)O0 zi+9asN7BJj0qSF-X~e9Z|C`|Urd3>FS6#}Ro|W9*()}3EH}k>hAE!I=(}eL$7ZtdY ztivyT?EAn?Ljx>wXd4a7 zRM5qXPp_MtIx(obQR`BTOlX7T2y`~T71f=?9le(mz0%#=@zZyQc5}U-BEQsTOW5lx zH1tb{mj~jgDl*?t;b3+S`U+I*2(*CI7>tZa73H`lj7(WeVOf|eb*+ougisO46kCX8 z!i4M5dA!PRw>cI3Q`lPdBnoqdC_X;DyXnOQ=i|}IS;^K~AK>Hc=`7`^bt|Ja4wJrh zg749uUQ)@@S3^Lg=fp9tcnQhO`d73C&CFK8>Q}U zm5rI(|FZq7n6d1lwCB(&XavIF?<9;at_FzDH}$LaHhaOJK@P%iC!e6DMZyx8BAKeJKe{1$y)OWB<{qun3zi^v`el^HtqTa`vLU^Z*| z*Qw2>0kyUtz71*z1~exA`yK|ZS}dXYJWK)K!({lyVn(%x!EgWm^Ap{=?EJdih_=wF zloKgikuVYlK`9PhO%!>XiS!te-jU}0Wn)v;A;YoLEva5202FD)!u?V8#;wJF`u=<@ zWwG6DQS(?89x7Yqwy4|vslo1NRV`GVDa>q6=Ob<6W&+m%VR5e$Z_dF9nk=CeX zYbI`N!Ax7yYuspaXNDsJY&HmrzAfs%aYHHLI76J8$`ZcZ-a=6HXgQ*)mwqa(lw?wm zXKHd~LMDl;duqF0Aa*v9RQv!;AaRHEq}#<1z}n|rzMfF$3LKwM;P~7>SGiJzW4d8D zIu6+b!-muEN4hV4IgSzSeg{oDM#jF4CLJf^Qco$Ln(#2bUkyn5nbi0%ev}n}EuhO5 zrUO0G5?NPO;fk9fxtxW=$O33|=eEfGFcwMp%pU_H575TFiP!R>O{Z36Nw*X!8EkyYTpSMJ`1+zlctO+4k z7h8If`ghl#B=8|O>u();%{0s!t=s?d{Vs_J9J=&mCBgW<4Uh!gPwW20fiwZKS{bs1 z;Xv=ONY>+kB<=lBqBl9U?vGx<%C#BoGtW1r=a?;{WEXK~_BVN-su8a$8CC|_KZ z;Q?0DdjEQ+L9u#yxh@_kQ9#Elw*b>wmv5at3Ojq|QfKd6Xz|H!ChqK&Go5v5>guIroOW( zA37`Yqs2LmETJ~zS)T0*Aa zAEvW&E;*Wca?DDsA!KGBLuQPQ8SK1MA!VDK3Tk{Zb0zXgfO}X*n^mT(sW`MYw61MA zufjsLp%vQ7!&2G+T+rSo;&Q7U4Jd?GE_oAaFwoOFpOUHU)UN=MUX$W= zi1-`1?HZSCwd=+}J*aPakcE24gdVcz(dRDHi>^(a_9XA7H25|PqWK^|*;_ZzUR?EBqTED#Ha&_&`?n`WF<#$6&^y;+vvfD8iAx>ry8}3(GLcf8wv(cjA z9g{Iv!e2-Hl%w#=j$Oky%}MMe zIRLQE`a{D9pa1tn-)z)BAmF5F1Q-H)Ya@a^Z@WS-ZCGV!MG3)7ZN4q#D1{)HVUIbL=1 z^n3Ak?^tbCIgOMIjco74qVkK3L;4)jB_F?6E4zbea$UmXA@>v(} zjxXkHL!a}7807C&JngIPP}X`CNLPhLmu`Osbge6cWfEy<{}YYaGVxEQh?d*$Y3su9 z2GwF+Y#1(n;VXI4h*3u<^t+21)G?%(&YO{BsR-u&$BD9<$jN#jaaz;f%IVx6O~jI> zIgi>PZAR173Te}x##ZV#n=_~W%NSoeJ0x+|=GB%eoUb#k_iGrsAwTDN*C|~|_|L9Y zG~Zd5ufE)_mrA*~gv+K8=*wNQj*m3K*jw)M>YZq` z1sY^Q4pJGnWUV5InK7QzCOw{-Y7a7DNKdQxFu%=iv_8`{dGTLQ~@H5Bp2Dx z^aE^ny?;?|dR#GnFV1Rd>3(Wso4TZD_qq>oms1)t2-}c|O(AXOFFFIT)-c=a5UCbv zUte`B3IZTSZDmHydA0Sg zpK0I!;}J*WsKjbtfaDZAr?n)w)E3crB3cI^2iY(z0NLY9HcdG-z$#YH#oL@Azi_dD zHwo@D?YdVTTbyhu8$cZ_t4+0rd`;873ROQG9&lO%**Zjn#@rKk5>0El+Yr}bp?zY> z4mnQ9u!dYopMVeG0-J^l53^_#0mUb0*US#H%UX(xN4daKbB&=XQhXp3-}E7hrV8gs zCzghTny}DbfYTAaQHCWtJ~4p7`YtE*$%yUg>s}C;-P`dW;BWm?iQ?(5A(RrrnYEB# zGH$J<_jzJEIG2qJ`r0g3fLC7S#H<2@xl8-7zNmI?QfN9OVL`HRiJktUIZt5g?3GrjjPOfgS1HE(IcPvqbwHv?gNhp>Z^5z;# ztAyEjF~``+OJSQ`t3k48VD5_DK!rH7B2CVK)i9RLcoqCO9)#0KLni=Ce5>z>=jx?|aDK97;y_lC8!CbbO*i(GcAJYT{m$qe&mNakd2QG?n z&e?lK=@Z9*nVQ65Vjk@F6xZ$`Y1P5IUayZ3bei7;S>A!Q0@$5s~W|jl<13biirL*?3BX=yduZlo9 zy5J`7FwknW!x$(1t3P=!B52c#lHUAS3k-yFL4-BLqHK%f5lce2MTe7H5Ln?Y&lV%2 z({bQjCNV70oo1rnaQGG0kkm_t6aa-4}eYc1=7Ll zr~<6uuISR4wr`s>T@miuY~=g?D$m;GjDubhg6T%eRy3CCgB>3eR~oNONa^pO*P@tZ ztV?IX&5p|ULdU;|4$IoBTf^Fxh(knGb~?Q{#YGj@$fV;UvXhb<-#Wk`&;4uaQtROb zWh+)#7^^)D=~({Zt9dI#Y?7I#5E&UikEl>>$%z6J7%xIwE!p5Z-W=Uw2iG*$h!Y3h z)g_uSeXxE}eOHS6n1Q=e@tDQ88nT>Dn2d2fzT|B81nxFqYb^BA6}ckN=9z$lE`n6+ z*mk1ufj8)@$hnysnwpB|wJ(tCHXNSp$QS?>te6CyPIsz#^W}0ueDVIv->+XTuP&d^ zLmr#}V1YCoXA~ujThJ;3pN9q9G3>|@Lu}Tp@U;xl!+ ze=IxRkXMm3{!a*Y%c3?<5UVECOBJ!8-Ng{r7K_-=Ub@@$Yrl9m`F&1mh;s>E$jvhF zn1}g4tO6#}3eJ?NfHGH4UIS{iHY4x5((w^*sBiY*q0CO>F&R{ADTLoc7tOsqkk!3Ee9I#q%K2LpW$>r4qBM7@n#RlcE6)Y&==2^p- zywX}PyCxsWZkoKX^!I$k&tz)DLqc?QB>H~M>Q0F`+m^0x(VEo>eAhfln7qY_h;KxP z4NW)<9BABNg?bi*)jDl~lguYx$6SUtD{{U_zR+A#r4ZMJh>A-Y=WFwU0ER8PU9l^p zrn|&$TEpeaLzAq@422M9frvAPL5F&}*Z^H2zywBX_51zL?tmQyx?#k%-CzWyG+ekJ zTOf$TkSB|ncRMT93pQ9KrE~yZ%=1P^GD9HM1QFBFgvJes4Q0)@I3GcJ;dPXA`ocdv zmxSTb+QiFjJr4#ZO9Dk-@n6GyoSl=o&t4fNadKI%iw7bOA3NlP-t9#5=wTD zlNtakhB#=?T~o-9-Cd>@*o3sJzCglbyMZ>Uq^X0h=y{GaR9gT+EJ}Lt&mGtOu7Og$ zl~j295|vO04N$q2JInR%x9i%bDwGQqIa%T+V5LpyDU=ve^+5(VDNG8S6-KA*ojTLK zM`D?8bl^ew(3kqTpImp|f)RnOHf@9G@U&J$7*YKME<*}L!oh{v9;6V!nKlnAB+vcP zj2r-75|lHgw@gpAsL2p=mb-4QTw=|8W1XhA*QM*0_shHUv768G#rY9jY%CCcLY$GZ zb;?_ZXj`LVgiFsmy+&uk&f$DX&ewGg@cQBigV?nmLYULK1ed&ia9tJ4r^8@Y^sRnm zI%1xwAQq&;w^RuxffkUM4|tmyh-(sKj_7ZAl^Zl-C?XNssQ$Q`9Grw13piH#v@7Y4 z&Cd3ps~-nu!r&P5K_XESv=cT_DBEFK_oYmU;gj3yiMdlF&IdmC8dGZ5Z`uY0H7x*W zP50M*{)i3q`Uy=ma_YS$oD^uRTrwOQ3+)NAW793Pi$EH`6J4IswA;jwhsG0Y@)-r| zZk!z9bElhK$?x~r*X6Y1*+4<4x~TgtMdobG?cnWY9vaugE>kcqMjM!RYfD^vfFAx7 zaX=~nUbr@Uz%UA)%-n6rKtkMM!UBfnK04{MKYU+?Bn(7 ztmcgfQ#hs5cLcq3PVG`HeQ0n_HuJD;a?ggSH>`GWLb zgC!?rl6n_)VL7c!LFJFd>rVZA@BSi6(ai&a5$x=TeI{}rl(2!vh$pO|I1X=(&DeX2 zY%%vcO1)O)f>EBnL4BZ*BwTG^Lr}d+;FUF2>a}S?*K3W0=yFo!vYf2*t*w7q3Okji zpp^fWYST;ejD{gUY7Y%myk_G5Qu4Hno`4+Qx#qzM0CE5E>CNQ~M>s4KYPhMvL$WC} zO-Nr3xX`7h8u2dwb=mfcCJ^zzI9J&=6FKC7rM!d}7#&uBgij0CI| z4}mrl7Y70Hko(M#B6tmVxV8iM<5tgEk?%C(+RXeYg-iqupH`~d$pgSZ00q1)7(Nsj zA3qIx==DcD1aJas>D-`2k1}h0%Llj99_H#^9`p_%N&(X!UduP>D7H=j6Bd-7&4r8$ z;hB=vMcQQQY$nlxAN%%Z+VfMpiFAT8i>zy1V~g$V4;JaPmQJp5l_O4{a%gL`WYPFp zhE^v51(8bvm&RIzPC$12`!RZM^Q251dsZDdJI;A3is}9IuJ8pMVYP2u62`F)-PTt0 zD=_y4F4|080Gtwj_>CT#iruf`b1ppWfRVRDQ#Xg4sNn$9hqJf3jYmqg!Sk^=*wLJ; zS$w)*m2kH6X%%i9F7x2j(=0X9mR_TY_LqLMaoAy_=9`?}l@3m~?&yK$V=Gb24`xC@YEx1g`A2faHW!}=s!d1<^{|6R`Xl`zAw{-hRZto3BN8?wR~JYRC6_*{Eb)VCxP0qu~5Ju zu$LNK@XF_#GP$?685;FyQd`v=y@vIMfPw~9wdv9fD&Z2HR7y9dUGY9wZs-lYLW6EB z+^b)!+SqSCkn1$f0PaXBwK^@~596w+J~?+nP}`E;TwhPtpR$Nef&}VO(r`i3rDxM< z-0k4esp8yHdD2F8anqrrPHpZ$7}QYsh@n@7-{NCqRql z5`cevnEN{~l*dExf}Z6YoV+LI)~tFPpye7M`Qr*Eq0>~QNFq2+%7t=6H^*%(D?HGi zjBJi%%P>6llY);mWZn8oRsLfOYHfN1XTBEtNUKH@vq} zl6J4Ogwq&UA0RC1{3w-E|pdH)C=w z*1Q=dD=V{(76PiKs#R4L!2l`+x%3@atsIrCsSG_gOn?U5XJmy>X)?p_hQ7I=HKH*CH<7Z5J5Pmd)DU*Fq(cn2zA7i1p_WMTdLB*K*n7hsY z0#!|Jbv=V{l#a|x9nYDAPyeR`jv;Q;|HUH zBr1fjX@C3knWixTc%Z{!bW37!FXx#}IEZAQTVtG54`im#C(uO8u7CW!0}-eJq9qW( z@ev-MBxi3*8@YF2oRf|hMAAwoKhz2GwBKOu69Pgpc3St3>AwwxYtD-m69?i zOG;k36#H&BrUYpmq0Ym{6IJt@>eIc>)Z&IO>uRlxR_uXFUJ@= znRB|%ZO921?Lg-$lkf``+P?^eoFX^7F zTxG2G%;oSQv&+aekfOxpxo*iXJF*xZxcwCet^J^G?o3{PmRMQsO7aO_r>4q!Ojg?j z%1ei~uBb=A$dey!nhP4pi1rgGRe*3XQ{R1110#~6zs_OUS6#uC9zdb0Oj&g;vZ zQBBeg3<1cM4uA3uF;G;hs%9p4Z7XZoaj~e5$|U%j8-El!LpEC8bc7p+9W@B0g}wA=?d{n( z;I%)rY?07PnTVxy6WdEZV%~%Z7&D`Ga6fNBD)j&GX=pF< zeLD`mD5rj3F++?mxeKb6h829cy!ghUnd_-4Z;`)sE7IV~>Z0 z+hHEI*0R2~RwY-v6@-^q6n51@1%T4?XKyd=kjp%IaNAI`#eZE0@{^`|jxF(JU}T zNx2K8AS_`KG>VL5>PPG}snrRibly0q4~* z!(kzM++gIePxj;I<66p|<8iEZT4zH|{NzWUYR<@nxYRsJgoNBD_ISoWhAa!GV;kUa z6FJ-zPqP|TZ#=ZUUltpx!4EgkcrMrp*!BpE2dS$a#)HNqoRcKGuK`ph=)7vU2{1zq zU=0TQdfvFNr4;4-!(-mo!Tr;mRW*fN`^PgkfzgK+#)Ox|9u8IG4)K_Ag?K!;LF~^3 z;<0Ic$33K7I<^%qthm92bO$D0JIokm08=mL?TNVEy-R?=y5c_v=qI|RTZ;b9rKmT6 zZ=X~)#+!fRBh|mp|JClEyf&b45P*O+XHwhG2c+4!JogNrhsjNA3#FIf=WSFsp3PY^ zj%PZ@(Q^rMY`whGh=&D^NcEJq3fh@HnG)+d&L2y#|KN!hr~R)pIlhTDa|y4J51L*a z${#RM)BgNz3?*wa zY4_)oeTQ%a`|+a=*V#{sdC9Y1b8Ua8C6qTz^OD)?uZtb3LCDzdhML*;9F=#Vu05?r zE}i9jcgKIOZC>huSEBY-J!rZ>I)N-p%V&JJhz1ZUJZXf`!4mB%#k6&7A`7acB0{?7 ze;OeqUXf`h4iWw|f$FJiNJaf+4+`QT<0me=H13YRoM@y~`cb%5@ zrTvL_+McPJgVI&xo}li|)9sL;3Hh~V+t}mI#nwvcf=gsZDonG1Y}jRjP1L_B z&$3#>lUD{vYSXDRxjtY9b86!xjnh0%j?K%6?rniSi^~RT>Ek>hQ0DH2_^=wsF-9RJ z8LKxx$<9IK;b|kdlvp0E50eW%{io2zGu5HaS=-uaH(U_+i^TFC?Jo5Z+9a-h%}vHs z+KcvranVQ_8%}geyHH=+k*cX~UBnvK4?5=d7OkJS%~t`752;hkdbt}o1LD@Op8Zd6 zZ2~dlXc*Qyn(-lB?X$qqaxnSSO7c3oNlGL)OMa*{#`#n$X~>SqxKKxWM5>WTq5p4a z8gC8AEHUwPwp&v7rDcj-gMMFoW^_(sc7-*xu&p$QBAT8Ln-1HdA#jj`f{O>>U6K4zNTTIYgq;VEq6As-D4M&nN3qBxKZ;E&K#I;f z@GxcGR;ml{;X|32<#)1dM|FnE!u%Ci!Yr4!UZQmuEuUGYc$ta~glc`WX zlm4=qRdz2?j1fS$;H`K~GStXSU>+)EKU@TgkRVdHKo9<^e)cl5mAR5-QK*nD(ovaj z?HMK|N{xg{nx`07(lD3-jD!KrmOZXiMekIh3XLw7E7py5L}jud%w;Pyl~V$j z=r5-e7HtH~uV+;UKcD|5%}s$qQ9JLPLAEp5VKxn|EH2)1m95bQ7rAlg!P6y|U2&Bc z9q$PE@Rh^QHP_|3X^x$C@%K>xJ%f%qx#hMzcXZZ8pdjxBM?s`~1quyTtjH=+qLt|C zofxIeh8m)qSaG_$tIRONTMgxUv<7XiQ*Ofl=XwMdpMp$WO0l< z9pV&4n8n6csiOY>mr1vWqR!EUzrN@#ggRxC4lHd&TZ_$#(i$v$P9(ykN|Pakk$`Xo zwb}jcwTHL>n{8Q$@vTU#BioCPo{Ml zao1VN8;+~lzJn-243e%F-w52^AiKR1LiRaJTEiM5z>YdQG zVOH8k)5qm3KsNK|bzZkQI9^ha>6?^!DJSxb%PTA*Ch+B@xBsn*<OZWxQJ%h@NZ&E-aaJgD8nW=T(b z)0J?e0Ga7dJaNwf`FK*xQYk`ABvV65pB!NGt<)9SGI8P0RAQr`HT9&r#3I$b-*?!g+<*1{Pb8vH;SQOw{zU8vFk}JT9)(Co(N+^OX`i%7Ymx z`+cN*W(mT$F%xHmrM*v=q#%+uMYP$SYl?ul-_Us0vm0^d-OuC4{2c$$Zs6SDdc5t= zZ5j~a3moooCl*iSnh*Yi;lSIwZ%&KDO*+nOcGWJrbME9Dz120kfub8+pNIVXs6N(* zdNdw;cVCZ#=c(;^l8iQDdI}=HsB!Y`J-dw4i2}*ew1+#)9SxW9WhQ50Hr^A`?GaDr jmK}lz<3X_Z+?d4?x_=JaCwy+q_;_s|`HhveONu-VDS4(Y literal 0 HcmV?d00001 diff --git a/fonts/fira-sans-v17-latin-italic.woff2 b/fonts/fira-sans-v17-latin-italic.woff2 new file mode 100644 index 0000000000000000000000000000000000000000..b9619dd5d7e7d0fd16d0cd692437b3a76057ad80 GIT binary patch literal 24936 zcmV)2K+L~)Pew8T0RR910AXkV5dZ)H0QUF*0AU3H0RR9100000000000000000000 z0000QbQ^)90vwP=24Db%EC_-y37QrW2nvDlXo1i?3xyB>0X7081Bx63AO(Y92aa_N zfmIt3;}_UA?S^5!Syc((yZwZsLK(M{=uS{=`_z+n0XN2J&>ft_6#LcW|Npa+6B%PX zVc#{=>{bx7P1BBo)l-5~CbFD@qfjsmEB3L{(zdP{Iv?Xn_Uz0uv#18&@luJ5-3ncz zhp@$}>cR=Nz4;ZlPhrHFhCU}MW)y#-U>qUC+LA4bXRBKV%O$$?MlR!;Y(h&D`ToLp zKI|q}5UYnAv*2L*x7iPYvs+n)IZ z1R-EZ5g0^S=~>xL06jY}PmU_k!>zs+9nP6SjeKm~~kK`I~F2H4H=y#1AP zYj4rtMX|{9B3GBSyr}x$sR_X`T*MCW8g)a_8>mm6TU{BtvHtUxGNk&xok($hhWt{f zYPsRquNsyRf=W?h1V*|(oO}GVy*8KYC22}Y9?*bLO(-BXhK-rgW6j1+^8XA0&RMQ0 zAP+J}#(aen@A7}_0e32*TjkVNeO3VfKB&vDCt0RJ6OV04wg)gUlaETWhfA35sB7+b z6;Qhn;?yp&G6C}TL)$kiO7Jvq7<>h>lf|-M!0&v5Cf|yhqE1)6EWW5K zJz~-~LJzR$f(LxzR~i>AHwsWM=_D zioAsGtBPQyO(g@t88j!uZBu#Yiz-$4ar#7ob!{nL$x;OIZ;Co0 z*r-gTjup9oo0WHG>aQLx@R<03Bfkrh<;Xyx`Q?t)RrOW+zq(sH(#W$KEzvBH%uD(W znpV#-M+S}vFi0p#03#=flhDrYvb)sTW%vL4)3UwyJ!>u5vnT%JfF|rkPuNB0@iJ7Y zQv&P1|D+F3Ulv#!f$jNYEy&i8B+nRkW5MLe_ACGg00aZ%00EaN)7C&06=j(!70|ISqCnqb^T!fsNQ-%KH&@_{shv`Hi`=)8-r#G=S-awjV zLJ6TI;Q@Ov!H1KnAUMU>cI;op_CeHq#u+yOr^jiH9((Sv>)_3CqST*8Kr zwZ;rGSYxcnvY7Ldc2A_f9UI)ScV=d4s-mJIq9USd$A0Sfl#JPF48rA@3K&w;w?5z2 zv_1T}`o)E!LAn7wH1a$qpyZ7EofU5$Wgd*nx0|f(HF|R!?kYARA&~*y55B1+?`N-dH{0O8=wd(=-jfKD>E9v1O&q+q=92gv1Ly6S!lkM>Y0A= zp7}4ncmB3y&F@BeOfhR~)O0qbKa&1J^2Qo1bYpV?L;yj#)WdUPju}6eL=nUq8y9?V zaO>cvT%T)lWiHFPIV-2$tWFWfQmCI7gtuS@IfI=&9B-D@lS%dk6ybGMu8hwaJw zYKO_K*iY8l_4X544a<3h1@je66`|PZx-QDwcn4*ae zh*YP^L)3Ix7eFo~p6&8N2<_m$dgb@jle%9w3BBCib-qs4;q&*_ z_8Mvb+E~BUPuYIcW%U`X=Uw{k%1u%|ym)8LskUmUs_kZ#l%qA3Q&TFr;w!2wn`}oz zQQM14k9tbgo68JKOER&1OktThkbz!gEO%4g9}0;@fcyj`<|fzD^IME;3lvvIBWqS@ ztU#$tT`MSVuwtz(9-I}`UY^df*`gDb>S`aTuK!C~^}p9kUz%KujIB5)0g zzIs8Wpk`d>Lw@d_#eo``#OP0{Gn60moU zrjmE<2^g#pnr}bGLXEn#Gw;2KBAE$)wHwx}dxMOD#!deN-pqyg5c=01W-&^!f__8SrNSR7omq z8&r4Oo4r$nS6rZG?0a7=FC1owAR9e@73L6!ri;0C^>6t~qgrZvIK}PUfFov(!R*II z=+8bhSw_tR0u7-t6{-H65=QFA1@8(JAk||zxrJ44+d@HoI1KGA1lkXL;gQ0ALHq{; z|5KV?189st4clO&zdA1e8ey|7U$etbyX|$hO*r1n)zzNdX1XEFS*<)l|K0E zZn#-72`^4=-u(0`t&T(4v8bp}qG(7o@L!44mPo-qAwiKB8s-s`r_CuC&mU8en(3hD zDzfYN0K|;VCv(?)O;sN>Tpb1)Jcwn9hm1Uh?dmbDr-gQ@UvRzA}Sb4DZee?hfzXsNEmVg9bfD zgoZTKD21qt#Im0h?W9}_GxeWH3!ce~`rAp>ougJ|N@Hy*x(L_hCqoG4{s75E(Jq`3 zY6`|hBg#XvwFAhiP%U+>rtdp9v#8{NG5FoSP%nc*f3QZ>3^K8T)KTw26Nsc^YRCLY5NR+ncY z8P%)Cr}->Gy{~r7S!{K)h~$+@q~Gz&Y4n+Ru}1FA zD7+ogyC~qaE@!6o-bUu*0G}%Zq~M|2^d;s?o?n#@=RFh!PuzYs?tf%YgtX1d>NYDk zLerU;NC&!vZjdJUq0=<=$dPFe|FdLK7qQKxe^`S*aGc+nJ!b|K389oUR{pkJzkpx< z@Tb50ZvaUBm#@$-^1?a@0$<868Boa;0!MQ2aNOBhljF|$PLSGQZ}T!~-Ys#Vbnl8-?829- zQ)Qs5w9(0FnSuBp-LJNmPpT`C#X&;NA$&U0b=j`MErRYobKnBwZ+LJcC(1z{_&r0T zp?+zzLk@=dzjxeBWo9;ZB%VoOAp+Zl2~)Lx^BG!?Xob0hEM|Z;hh_ydC=GCeaH=M##RjPX1;+2iN#2k+(Aqzk%g0d}J_k z$Ou&(RF{kMb~HSd1I=WF4vjX*ClhLtr-JH!Q;fkBHz$9`?PO%1<{C3|5|}h9&~0u5 zPa_sgcB}j>M#eB-9@Che0CzuiRiCJq_{x8)CM9Pyc@5P%Ruihlw6a*jsEzd#1R|uXU z?%c46?ag&jtgS2p`*RUULM#ECnb87QM7fwVa43M1>K^QLXZ>wZe29+V z*$3A!O8~_o8@7mAVb@D_4nQpR13guqKcbM`26L*th6MFqjgGt={QvHsK-?rs<&dvj zg-TVb)u>gk!9rbnZMDrg=Up%g%R=B#;o|bMyN*B4{*mj+uOv3>Xj9nQv`kCOtN4tH zZ*Do!(w-&5TcJF8@#dKHL%n$Rqn_iwJ=G-*dxO+0^*4f zspX`nWllQf{ZFd7v+*{Fp7Z#p3@~aojzczOCnSK1BN2NvqM6yX3m#e>nyhmL4nj~O zCmu5A61a1UuHo%MRiiRirhv{@i=keB(_S1r$oi3Vk2U8(`Lk=-{kxJt{>b0R0#!4M zIf8K1bsV_$*9V+$L7dWDK8BTmsixJXEEhAnaKqZlMG@x$K`tUQZI8_MIUS#AD&2OJYdD} ze|)fC6(>AG78b%w{^%A5@%REsZyg07Gvf2(2D}X~!B&YBrv3Wgv1pJJ%c4TU zBZa$QC#iK^Hn>GAJsnS7=_x2nk!^}QZiST$EgdrXAI>>v6DO%)6U0Pu1>vHasDEL{ zkdAcTh90GYpe=V(NKE-6(!JzZj|?D*M0G^?FhPIo*S&~8NzMh%9>6_BxFk+MyWpOs z9SSKG1snyN?bEY^B-GW-^8h7+t;BMsd3XI(q|62K#C}ws#rNThp^FVHPGp^4=%#=2 z4FLF_U7jpo?zz%xtWbxvq5eID^0#OFv1GJCoa~J0NEHDBxsylQ&x;JHfDKaTLxD@L z+Xp(ZG;(@15eWuT6#NlgLozY|fn<>VzS54j29W8*Z1t^ZO57$Uxa|OOb5+(z#>Ogu z!mNfkf9*DK+vP}J%av1nz!UG$_$&3o@nb?sw8N*rUwdWHe}Yy7ZM*Z&lU(o{dWjG4 ztBuBg?HOB?j*utwK0^DsFNGB8fE+7DO-!{DHAplVlvbWW@>OH#3qTIwzqyHAOMpaZ zKWF4O)V*k6VLo;wgor1P|8qTotOk-U)!7vPf+Y$3M9yBa9xqMuA;WroImG;i1L&Cp z=o-(~i)IoPTB1cUMD>icn3%ZaeHb^8oWhl;S_2}`ZCNS0cE5@A`dW-QYZzTilAtmNWPYJ^+om8b&s`-uo=`A!vYW# z%YRzkg)CtxFRrv15Uu?Sr;3Ozg}hf@61^F)2WAF}-F*4W*7a;=XxTX1H3G52@0W9+ z3ccar)I*uJQK7z{%_=xgt_h4>b5xn+MYnIfB$V>ilc;kh2eLzRO`V95nGExr3vmX{ z>&W)%?p}!z6((3~ggY2c*}Oz}S%m9LR1B(Iqt;}SN9S9Afz^#mnlk|h#v8eyh6)Qw z=O+JJd$2L%P=GMo5{`R?(_;8(=@$VdiYBvFBs_r$f|-?ob;R@)Dz|`$F0KO*ME(i~ z9!J&Vzvw{pR}SO96ZORPx71qMGlvWfj3V(jRct$nPG2^EY(^SVZ{^+tEG)5f?c^qM z6A`Nn)_tjlmlzAR@c%BA2;N7fpx&E!v>8NIRDBJ}uK@@2s(=6dclIMJKr6w2^AX`x z8S=|qNjHkAJ;5n@qJM%R_>V)Wo2nHqel=W*S=1&Id?3rnG0x$5aDm}|?Xc$VM(YibL;ukMJ11Zj` zpp2M5y-gZ0sr%yp_K$ZsNy*a{V593_thG`6JJQYi*oI_`H zInvrQzUaWYusP>liE~8TZl=$Ij=Kz(*0buv9|2}UiRQ$UFO3jZNisq`WaiAwCgwpY zh)J|WQP0fuscH;jmWlzPH>)MBRRF`7?mVM<7SWQ(_Mx|6j`II7XQ;J?Za%N*28q*(r zoTTV3$m4g^>wE)KK!ub;5d}(6Oxcv8EJ{)u#iDP$2!Ri|W<5Td9ZuX1dd~GSN7)k# z#83L|uIZePsq+_LNrHy{%EYT-iJQ&u}^&JGoSn7)4RSa z6P4O-7)B|bKY3_-;zn?t!TedTN4_||v6_k$n(^l4xZ&YX}~5}L4tCnAw$GN}~i zf?K*?RKsLWXvHP3J$DsC@xuZcealtMOthLK6x7~5qJ@-Q*7NQUv(TIb% zh==${fP}~=G8o%3{op-^;>uV_J@k^(KoMS}M0k&nseDpDG0QBs!b+?3>a*IL`i;2a zs%wLty)F#L_;?r3UmK>s-j$^=mNnJ_UsP?bTkhk9L_%=N&GhaF>R+&tY{YX=@0_so zrJpdJzve9=6f;W6IiWdo8!FvV;^}4(tr%tS-|Dyt1bkE#S{>~6!D>PXBLXloaq4Rh z;MPXsdr~TF`yv+@cb#A!qZpk z39*4n3zM*{vZHlnPeL|#&QC?=MAfVj>tV@8)}-`ffqH4>&0}eH8bd{lj|QMlu!u`2 zWl9eM?&T}=dUx&du!!Jzh_8=Vpg$B21HB7Sr^184xe@o^dQOkX{FR@q_krt*#exaw zgzGec49Tv)YkQrpvyBLn;1Iq&>D)Z#^o%DXW0Z_P6T#T=9rzy7$jg^0G zHR77rk=WL4_-F0E9k@>F604g$ffc zLX^FR?aRx~!dN9rk|IrpOj)uy6ev`zM7es6nlx+GX0|!znrETidD!EHOa61k4OiXF zGcE~@s~#u4bRxHeN9ws>3}*H!&NdX{XG@&&yWjj_3pNr92ZhEZ;KGT7GjAR|c@gmy z$d5m@0AnVxFfj`eDOihmF=E-pu}P3@s&tc0F~c;urb|_(T7^orsytR>mUbOxny$Cy! ztBnKj_8(@!TN-bljMsY(?{S6vtC4E@Z@CVNxz3yj@kBi8XaE7DZ%Dv8T{Wb@0{qh_ zi=T$Uk2s!>X(T4pG#q?3QE~YX@P|DUs^Gv&ZQ32;M(|D~kfaS6R8+7i zdhQ`)UVEJvtP-J_x&_ppvJfG1d`RD}TRAi(S=_g{=h8ti4HB-XIy7sz_HiF%IbH`% zRs(3Xz|c&z6og48(tM@#!bPY*UCadBO&@dqkGXtJzG5l{2*pvkHVcEGl_3IE4j&~OH)0b&!rQ6V>x-~)?s@F$#F4d>{D6P984$6S$lwtHnpP>a%_R@sx3`C@fD=dk)*cGx=CL-fGD$Mex#evJsroWm<8(O5 zNDVV}zH_|0-T<&Hq>XE1_Y40>5e)qL2kdghEU- zNC<Hu>t`fngc9&$DF@ zU|P5*`!sFoRk3)K;UWMB_p&xwasMp3Uyki=Xr(wtr#P9!33%kQe#Jc=5<_tkbD*GT zgNS|sz~z~4m6H!!csIEQI!v985Rc}asNoIT3thuoc|XZi{xbZGLfz^bS{)U5)Xt zfn&JZx1aR9S-WZ=Zf3y`rYVcaoZ#1qKTgKiq!9-+{-vV=Wn3sVriIsNsk`2YgIQkM zLzNUDi#kbLPHAyMszR}Jyb;V$&~<9WL_~E>Ij>}lEOtt$BX*5^xSU{53%BoCEObo5 zdW48}TkrMHL$om31ejsggT5DHrA6*2kHjz5qEm6CXLSltPeZ^^V$$m`@H~M9&uw>a z86m%YFYlEeaBq$HbwJ*Bds6Iwh0bUr>B{SNXnXD;7`o7woewI;ys!6p;P$3h^rA_( z^L@>W86Evl^UiX8?sDt|=8Jq98C&iIJcbbECyo3pwiF$Vxutojuj*no)Ssk?R=*R| z++`hM!_=*Iy5%HG!V>(1zx3i##X|op;X1;iGk0gymgC>N;YA)C@OswH%`Oy5||nYXOgj% z#W!X6E0nSUfZF}Y0RZasBNqUu+s}~)3a*+&d2%MG*s+&V?K|*TD6R2%jfnHURrAmNxc%h1k_k2mEF-heyNtH24RSjON;`J(KzC;=L+w_3=|;L*lPk8+!lNbmd0~)vd?B6#s{E06{Zh1CSd5>XjfD1gHH6 zaJI{Nuss*_cfiH}0|`*`a10?JrEn7ogy8THLHq$Nix@vDl(uteno0zM6iY6iH325s zgR1!`eL?jBZXguFG%B^W{QQAks?Ql>K-!=}T-ND6X7GNHMh`C8wdVp?qKIIo2S#-e zWkmYSev{R-T`3k^mFx6@aDQA8bH=R7tis_2Dvf2DGL%ph&KeF%jSVZKdZX0}?4)Kz z-mD{C>A23BN!h9C$avsEy(*a4^K0d()Ksz4>6NLL?H`73U>};r#=**k0z)u0M#fck z8cIuZuSb>2xWWY7sxk(GB&8WS z9r4N)3qM^eDl@Q@z5qjpn57()(Rx=oXR;eAp+z&G5o;r{lpLwemQn8R1#^UkJ6OH+ z7y#*tUoiYeqhQ`hfUZULvp1)`VffL>$6||_Brsw)_G0+0b8d;24WP%+*gMliO=%Fg zSl5Jk&k#tEg~9impUEl}8Au2=Mh8tyQkqJFDqgSFk3g8o`;%4|F_a`A&s*&djxkjH zswyY))7YEaA^@zN+UXiU*hGRLau?PcsWCDmin)HWFjBpXqc#lIz^L*1jM>&H$2~F* zG*g;(J*L3+s$FU5Bf~?ePJ8yWLa*;Ms5KDKbwsp@FnZ)|b=67B8w8s;V6oHMG8;=dDp@bIN?>3zsk+*5D@)w>^2jM-U zs&(-O%0V8w6p7%>OC_nOECLlF=}JPJx=xk~H$@i@?-5vF1AiKXYw6XfW`TyryWw6t z)MK6PTUJ;gyLEUf2YCff9&_4j@kD>j0J{d8)ZR>)ysf5zuj5tQqXTOLt0&ZmLtXS@ zCT#dGieK|t(#W{*!hXt96c-LIsP;|iHL2a^jY`!P38L80BBn>1fx1d((15c4#%9%N zW%r(1?&-UI+4H2;K|#G)Eah`lIi72cI_~9J!0p%*3A((RI%OqlJCpnn$4it08pEXv zPOiB>T~oONjx=aRVs^!9Y^9E?CU>$dTo`>AYjGL!*6_ZOxIm5{60)ASCn>gdLC z7AzRyP6c`{OdKs8DX>|2un?iH1^emfL*n1Y1mqv8QDOUd8hD>?oD@6Br#DH^8~xpG zG?UW#3fcu?Y-(=L9eyP%)u{OVQy2@BJ~5RuJUM9h}D*?{4BG-=JcjyNf~hv&0qG8nKJ z%q^N?MF97@S-b$&yQ&EMB|vZ38X|wZW>*bxdD$u;N{jp}*_s(^-i&^-p)bRm9h z-w)CmZOqWWoyYV?aj9Lp23N|MYc~$fc6pNC^-Jf5BG-I~^hGy4riQeHOjPwQ^SR*( z$Wq;#gW<8wNCu;ZD~sGos#Y^mS8Le2S0YZmz!6UtNn9DYLvBuBA#?m0^SBN^j+Uz4 zm9o83scMFl*#dg$(d2Z1c8G=tTu_`DIGbp+n9|mGr^ZS{G}89F zs}n=}Xw1vt-Yf=3INg=h(Ce;oP906%o-EzS<>>PFjlZONN17l9rpsG9x%N5R zX~s7aq-wjJA=`Ngn(j?0UTYwgPZDmm*OaE|-?D?Je+BWbY$QtfSDGB7)~I|@ki;gj zWnGy4Jd46>%PpXbrYW$GLK1Yc#E#}DHpoj;N0*}7!HKcWqLl=_JTs265x|1C2}s++ zeY9x1&nGBgzNGILfYCqMkN*H!7}wU(7fT0C%3ds6?^6%!@r|}Yc~h-2_26)KC!0m6>)JqP#nD08suURgo_)m zM7m^SsA`_}N73F?#j8&`rsqnwtU4%;l3sy)$dPUpWgl;0Xm@Am8AdUv*WAGOUMNv- zbw6SeQ7m$uAW!^e`vi{ktZ!Q%jmn}oW?aql`;)?SztUhXd%zM=`ku0gkgvA)axHc2 z>qx^wfP`)-jG)Y5CJt^@Lbrilp93%a-K!u!ixH%#>^WBs93L6h_4@_zeWG6X?DZ2_ z!_UeU(W}h_OVj!|@SW_Em5e(kE1lxdRRyXlEQfdZ*7t4m$7u+xCoRF7;>OCX!1a;w z?~TAr45iWco!zj$#~q?d`hsdc9Kb00$^Sx%eWTel__5>-Z#Uy()}-$mbLB`gKK;GA zsdx0+GTH{4^*cgZ7a6PRJjYc)c&$6cVSpH?qpUW9if5DmW3d2RJD`4h{fB;s9jAU1 zZlZ0UFUU_kiubwcn^DCr<9q+j(;Xg3%wiqG?1NS3o zaZSi!YF#-<{4HAl>_U{J4}A7KDbU%={eLL!O_(_*?9`r!eQ@C64J$I{t6Qe~#dWm1ZRhK5ZFd#eVyX&JBJX}Z^Myz9wL&449sR5nu^Z95>4lF2l_XU08h^kFQ0GB z&C~(*8Xz^&CfpNuh}=Guoc#pRTgp~Nz@{jJJws}_eypw7ySu=q-Gm>3`qCU6fZ*}xG)d*jAV-5$|7q6^?oPuWF%PX_~^L+Y(h8=q} zH|G5D=8uoiF;mZ_^1hLtWXYqAx$N@|Mo{Y#@o*IT;KIWjRjI6eDF+IV$t z)^v1R(xLQj#(MwsgyHj507X=9OaX~p;*moLHlA-51n-Q|GWMASod5@ z#1U0X3~YOpHNDWp7@z;o3M`ddDW*5rtAnVd*CSVC#x=2Zp7_Nd-9(8qVb`#mE!9bU z&}HVyqMdbit{{i-JP~L}1sa|y@(}p%!P;lC{jELiQ3P4{YD)VG1+F-(-h$k(y`DnH zbBbKcWUe`E``1R044(cfH^I`rq8(-AVpYj^ldb&Z)g(=t`%JZSux)^MgV&MYJELoB ze&F;2)Nroq5EF4pO8vlvtw5lu!N=4Ce|nF^a9(6}aAS9r(IRDLBOAA7vq7{mn&tbu`IZvfnidYD~Z zMYVnC^U5?P8^_MkRI`bo3zt#B?q*-z&c*FbY=7y-%*{BIQlYWom|ClrR>_pF9IaJ( z0+c1XB?+~Mho4X{?;@n(Zih6IYVB`z$hMEQ$HnYHVTLVwLU=lWS7;VBdFZ z$gvk172J?u#Q!=X29^_iax0&m`|HU`U6Uf^Gw(GUu5EgYiS zLq6lOpvKKpe!)8%-B9LraZ9&Pw5GWH)Os^JT&JzBqB^`oP(KTQ;DQBW zT2g5qQ67a@xgonmi>@(le6W=Fup}YoB-9QzB;5}3z)x(eAii9_uUXc6<>OPGX1MSx;G|6&HGebdMiG|@Zy!Semrw?i8i^JU z$3=YzFzH1UKjhUgmGQQFaR^6a>&>uk!ECU&4OU}bzwx2c5z`Ox-MSbW>^80A2%|+I-Ro9QRo2+9h<2IP9Fw^R*6S9A69u7$Oq01<} zSzSgF4Y1y-kaVk-8}PD-Kl!w_MwL>>!uKCmmA=?2@=LiR#Ht!W&9b-Zt>f~}qV}Oy zyL4`%qp_*2v)d$PI~#R2X9zc`T+yx3h#%a;{`eL>sUfI|Iw+mAB9u!f=_yTZwiPB) zibeTX=uO5rZ=D>zUzWeIrMHnScWPKrWRmRTo5U@sLehR++p;DWGL?b4K2ygs18I3H zJEG9sWo}O&Bz*NILr;`)In0%>>vR%XK(M>nTeoXbd!qo4c{Nsqg}afDW?6$$kD>fs zY3my<{HgYhL@{`1!8xgwT6>q|R-H(S`kP#{Y;Fv#@6oJxGTH73R#Xs#E9sfbu_8X4 zNep7d10EX^Wl zWW|UR5NoAA%`gG2`Rs83sntsH~~kTx^}hg zB$LAlMrB&^YuzQkZA2(#1|~h=Wpjyiwer{BaM%+>nZW`vng7(&=c(uT>Pk>eYjp*) z^G>r`rBf>qD3&4)F*o2REQRIEvX$mR!RjKTQB_V5kHkd-gi_*57>>gb=7lEm8wJ$Z z;**LU`LMr)Jsq&L<*{cUBfJB90=5YK*v`i$c(7RQ%kwX{;a}eKGVN>Fvwy9vXieYR zd#me1RQ9J9|1+zep_V*Ek1gwHgFa}9=m~FTi5XaZ2KigFGGrMTD>>CH-$(yrZcKKT#YV`s?*irM0ByATNhql%w@It3&-Wf@42LW z@o6@kJXF#ehqiqb7mt*KboxMjv!E-^PqMz4pIR$l6;0FdQrlXYR<6Yzr=0Ul zsJZH2L5{JV$(;$eU_OPl-Ck1HIp3TBWU`Kp+h!)|`3T4VAohKm*KHI=_*^`jX&{9* z|Ip5>ceKqXqsDqi#9lsZv8bf-_5q_;)yVz&^Z_lFVG72r{P{XD+>F=T>~+i%Hr9k?&%E)mXps?V}t4m^l{wp#8Cr9ukH=&(DiiLx1I zmVU#mv)17QjP7*pjhj}kr?qF*#b_d^5-;u!dYWPreIw@ARxNLEtXi{HYVBAFAG8Nk zs7bvJonWEhfWI?TL^a^R7w?(<%rkZWTzyi$#5xWn$mcIgsoj7_K&JM@DVQ2`@9R}`O`Xp_E^ z-P{~YWXIcNYCU?ZcQN@&Jj}6kwZ0`Udx-lRiyg47h1g~xw!`Ls4<>NN+eZ3ADc+{ zCq1Yq*_k3+Xdfn^2GsaCr!`ai{@*}eRoREI6xY70R68OGpGLB1%%3#ucsdaeYJ?AW zMSbb!Z2!3B{h5``_A8H0$?U!B;S(u8gI_kSGgUY7r2n$He(~SrD!eS}+mNb7aj8Cf5o)L_hN!PnYvH-pTO^4Aj2r{`4L3t04d;wMS^fK0cht|7eji{snC~mmaan`_Xz zt#q*E)N{I{RP(pWycsepaVHu0qb!6_V+aTsGx?Hzq%z*u$Fe`zh5c2h%^r>ub9 zQO~E{$TY~MLA6>2NIAsir`?C$Lm7Ujnh^>b8d@7Y{Us^x}T&#*XcQ zzR|-pkm=lY5yC>2=OX8uEWQ%A7Ic-rlMotoh?Ua~(^}E!@J2kzy+T>AD@ob8LB%Zn z$q%$C>nsBeEdnLJC!z7jaJ8xOV>s-+=i6Bli$%n4J3iA^5e|}FEJ9bDc`v-xpgp9+ z;f~`l=1-(ITI@HHKg6Dr-IMk_M96OOQ!Un~JVj49>fSa$j1Ja*SAsckT3U$F_Ts9N zCL4X53trZS^VkldujHE1g@~tKNYMqZ>UZA2mb1JiiUgEhFWzD}{vwX> zG@a%klc$r7le5<%Pbp>od3F+9eSPoiP&joISNDjI_TFM&k|>F~4sui8t5 za=}*v)Imr3NyD@41&1^2&D_Xorj4J$FLNzcywGzj-UBK*kZ-g&d#;Yc!)eZ@&ts6} zjxnk~)?}!OUuILxlnzV3_k17?(uOZu8Un$UL!B=t18d`RsAymFwd?_8%YoP0UwdTz zJH4Q_$PMrIUVF#1|FyQ)Km%XEsw*Zx4XsgWA8o**hcI)#<2F`Y?z|+Bk@wQXB0^3UJEkW9!olFJ%9K7TpYdE{c2to z@3hhNh@nF7fVG0v)|Y)?B$_oBMFTxHYX6prWX3MfBG1rP?49>9-hW>SCJFy+fpx#M z=B2Xn=3fj-1hB8r=IGJHN(Xdnbfp7DzMga_W8V3tzJF$Aadc&NWyN%=VtQ3}b#Zj{ z%)qQZGe*5h?ZQ{lJf(iwVET%gw z`xNo02l41HRtljNWMgGTQsUdwA^J@&$9?p~6gjdxq2 z(cmHresbGXMmfFDE(F&1hq90+(JDsD#^0HGw|w~lrn+OT%cpcxy7EOga&J1OXwLl> zdPug0niebGQK$_d_?GohU_E?uAX&3eV0ILzX(=~V%VXDmQvJX2wy95BCRa~(O=E4@ z$88E!UOrCsA1whjArm(nNS`H=ZRjRZurltS4-KwUv~Wu#^Oi}tc?|gEQ$Rhf9F>mHQJwI1lI8RxYbqhNy%@1BQoC5SblaMB8!xZ)-e`>j>u3Gxh77U7 zx;$N>9=p`idTwa6{hN>XoK*Hc{wndiuSqdrV{@A$dU&DHqv5diMt=9Ud7&F^_hR@h zN>{4QB=RL;JzPV5l*4riboz8eY@=A{Ts9D7D|rSJ2Y2x$9r2uouq6~n?pO^5w zl;LBK8&~EE-LIV*Z_smD9PMAr>}#XR_U zw#5J7SL-~!b+MRl-8y$DH0$2ID zdQB;_rdRXdOPf8Kj@7e*HWnv6|IM&bKVmlPhldRo(~tpV9-@&Uqp9xYm{^!pDut<- zL?Mq#K<1l#Uot9|cYi6pW*aorcT{)Q!CjMqbquVOiP(>+O`piQ$2n#P$Gmv<`U*Sz zEpeiIDOz8TL__`LSFGk0ZGy7NvM%tktlOp)a{XSOP;;;Yljy3l-WP$rhylhiu7w-!2j?scZ{R!EE5Vd&t56!vT z1QaI^wjcmMH1i=6EksxC?O%3Z303R9uf~jG(Ep`;jtbdCxG?b43qep`q`){n2x>u~ z3CHIC`qBP{em^STZ(PCPTMS|@{TcUuK_lA{m_ihC3?XZtEyY~=9a3@iH;p)`MLxl~ z{yU`X`QI8=J&M(!wwHp9rTDR@GSfA+WZWyrc@bAbqyKqf!pI-B<^2)2XoqEwu>KVE zpi-P9TeZx!>C82Mk?G{s`Gu+JEicv!aHf4wH~r|(m*S6e;x75l`|Bu4e{>1-zvF-s z0d#`%Gw@h#PTQcIx0(!DU4BgHGm6*-XUJ-E&IaXTLX+QJ8jGK#WJpSmqyz@!NjX4F zem;JUGNCV}t7P}@YO5^|6I4Da9Q_}V6$;`)5b}Y9fFuMeA-7!-yFX6}Q{Fz*=fwPH z$&&KFvAF!NEg}E9CFd_VC36Qf#{}?}0Nxb9X#!Jx-WNJ61VI4+1y0*zvjk0XzVu|9 zV!nTmdt>H&sx%js=AP2rRoWk?tPr1QkaHU3wg$PSL9X~De3d85<_u})7-Lu2^%sx^ z>-guC@lzDrKDT|*vR-iUwhwI|k&k8YtCsWmwUu{y`*3K0fbHY${zh!dC4CcfEqvGP z=fKfJD23O*4d^$oh52_Bgvq((pnzP-A$cH9^P5k*CC+$kXXr)gq9MFcGJlqaEgBMV zQv-JO2%!AROKq}(PM6!&vtW1xTu?htSscpww|7FoBQ+OsuZGM-c?j}7Cy)>MmAA5Q}#Gjp0y1HlN0vmgAAy8hP2ihU&SzVfr zfr~nmBJLNnr~PJkj|e~0u=`>%AdSPuZ!nf~a)1^wS{I`PI`uKDL7gOeK?izH z(+kO51-iNAOx?qJsZ)0^9nem{~N411RwhKJCy4WnzjUhJS>L;H%Oaz6BNE>+V)sF>Mo#^RE`pIyH3iG8aGpU%|`7tEF3#qa!sH`ZD$pq%=%wy+s?WvzVLK4 z#}t3n&3mY4)LnGgBHOs{*3s^HC~82L;=WIB4bJUxIJrjldcVT$4G}PY<<1kh z^0azIQq)W8X1=HgaCrFK2$VOn${x);PgUI&$G4H1&1`G?bC?w53nk;V_lk{0P*yFv zgNJS;m4(33k~CGca{XN__MPSr>q)yJiyF;UWqc_=Tdu9$&tXa0VNM0e!q=>2&)wgY zOu83&ly0T^8cnTPt;uj5;+W2)wPKPH!3JV^GcTXCRN<`7r!@i11Z*QrpLJ=j(eBY} zNqpNmrawP61$FZ%GrCv81>)(vdeNrE&#>@GoQKKkRce<<7Il%5IiOxQN6k6$!GS3a*lyu?UP%Y0|;r9@yBYIgJy=bH7-uOo9O2 z1cLVnSE8|+W>o?Q_rN|Vxfu{m7VZ#9mag>EEaSu+p3lW%>x7A(<`}tQvT}zA0u@3j zxfvU=SWpPuNBRk=NF+U%ROaI)azB;Zg%m0}v0Z>$6Q^#B!0Bm$h*Y5OwGctn+ze1~ zFR(V4puV^32h4~DgYC#MWDFwM0kVyfnER)vF!t~ zmS)Z zO_MkZFvVIwkt2tVO;m{ijM^)AI0Y;Vpo{KGajmpF<*K|^+=F`#-BhAvDTC9SxY8&C zD-5EUAdM0{rQ_nT7<>^WcRdL;Do_Lz`)(0pYb3#na+3 z4k&qZpi;LG%&Ik{n3aw&Wk_t$#I$-gm769>nq@O2b+TAtY^c8em01&#z4ja+HKcT4 z7MDE^>L#REM=J^>sXapu1DqxL%@YlBa1MtFPlm1G zLUrdsR!)-(b|)l9$xvdvm>K>#RX4k~0IWs(W};w21|Q8%r*+8=WOdQq49Z~6cVU(e zxn+T3GhMa?z?vcRk*P@3wVAY){({1I#mBq_1tF^nFm=FrRvU_A;FO4YRUksRyZ8p| z>$l|(f2eFl8h1F6$0HU$m5jw=6Edps1f@5&@vw6+6!fC4EJdIhnF3Z{+XRr1qdEgY zZ7DlZ9%d-ZCJ$9q>2?cz^!#$(-fnNO!CE}T20k&18qX&%o`hCT``W4CY!i+HoG6?; z4lzd$b<&Omu-@u8u;KMOT3M$Ni@*yU9CvK#l5gDF{sX$2eIIKoRymI7Iwxta3Rik! z9o9ltVKn-3s$AuJWqyt;Sy4@sFsO3NL2|t_E|Ym=E+eVBD)KCe!@&1Om;uQ#TR~8* z3Ijvc^TwaU@I4wzlLjkDsKTsY&mj{pQgADIbmtxI=NX}@_Qa{ZO@H`9CF6dm-Wi2N ztpO~^6;uQ!aZY%&JJ}R`v%uJ#yZ*!UcS_jJgjRG&l?1(tU%IXF(s6SH_Cn-j;1|P+ z0yw`c1~UjbGAY3*Gz7N1{6sW^RBk7A!?}hCeHps_?RGBeJXp}MiBAlI!#C5h#OiAe zl=dLf~y$J1`Q=f9uvhc?rQC*5Ilum;&e(DApsuaQSHgOs~g@_rUR`Hgq zj%&<-MgyGKw{TBp8|dE}$f) zH}UAQ7}`X9Qi&hh@Qv`l)Qc)l10PeY4IOEfEEO~X7LNZgi9gyt#Du(ktF)D2Iq#}s z+oox|YL{t~)_2T>tV^Fx%_RdNyyjAgS(eNIQdViNp~}^8>U%D^;8L4e&0CFbJ<3(} zgi~Bl!63Bw8VJI3U{ueG`o-iG1;+)cbPMV@UQh9?D5e*vVa%}E14zEgwI2j-2gM;A z%td4zp2bOI@pX+2O3FMaYj?`nO14hLClMd}N==gqngt>OWm{F_0WS_U0a7diH3tl3 zOD-TAdmEf&ZJ^iB_=B;7@H;=qs07{QrUh4Z9h|TEnrAb#OF*jr2y%r(jHBdTZN^B6 zkLe}C+|i@oN3><$Gu{}xU@J<6Yb*556c0UVft+cB?}kEr9mA~i5`du6Wj0FZ!9BO( zd*p)dk@@i)$|g5b*`bRaVX-|Hsd564>{yuMWuNCJ8qIOEn7*jhmM>0u_^y32#ek7i z5t#{*S{D+K8QVp8q@lCHb0NvMJkz|U{R|3Kg)OM=*abXJx7B_CDsCni!n{rn0pG+% z*%5TWfpd>;x*RA{hvI#hO+@zUNDh{0K^T3z;2=ig?1Dora@PNMq+Hc7KqanwX3UaZ$` z3*6hq;C2J_)jEL&HJ4(%qZ>|Y)S!S1tr=d>8~@8eIDrW$m9F$cn(0g)`(>i6+z z#-3B1DXIFdhkRc!Qz8==UU1#^T=*$`;|u!nEc;uJ_VHkbw_*?|^ zi3S8gfe?OVjxgPz0)8I^Q+vzag3|UU^=|aJola7DPMRy!kYc{}5Dk}4V$x4y7 z?zQlinn`r}dWGBQMI+?;n5DhQXQWH`Q3}}+(6En&NA=L_=Wd{RfTykCMo)!~kc>{2 z_|ulZl?S~ANHr}kg|n2GylP0Ax|8>T+ntA#ETie z_H(>a$XtlaxdT%>G(W_X3X%jkEfY}{h!OGVd&>t&{FI4oQ1Q^E@oK@*%Ff%O28hpO zUm2XC?AMfx%Wj)-3g*uT*z>}+vl`q70QC*JE={{*cSvO_Rw6!|9=U8+JZtJ`0@@M4 zu!w|Yo?3MnMol#FZu=VzUx>fmiy~myMopO`M6fYp&5-TKbdqZky1}U9`xuNFmUxTs z$~qj3^m!9xUNm!?zN+>0V;D`)ZM5`a=rJ|+_J%j2=lr>fb|v8UTnt5s2~&a2yOF}ab3hj+H-z+vweoEE9A2jf>QuA=VQx<>6b+i_Kew-h4^>U4Gq;&7psX8D zWw|g=@=hKU^+E2`W#_125ly;ON6vOJs&li%eqA?lGCrxQ2--q*Rpk*mwjQY-vn1{@ zBdm?&NMiBTqMB|C{>VmB<>upY-vU>+?PloEpe`~a1Ep;BOp}J36PykSLMw6mTtqSXbz%X zDX z&83(XQnBpdbYBFoMhA?V&ljC;+i)Veh;UZsAI$b3uKU>!6&0Ao>_42 z+~gd~WmD8EegJqbZRu4a_hM3wE2!Pb4P0NY`a?lVOjC^oc=q3BVKTqdR`SLSn?J|1$c&Dg8-$Dov;?pD`KJNn-q;f)EpCo z?;n*2{*V1=YaIVyz)?zV(EZ`Ne^v1Pse%Qln#aJWWRYc%B$n4M1S}MSbj!Y2g$)S~ z2uj$h+ycb0C{jDCdn49R{OtUZnbb^DAS0_v377~jZMCnJZftR+>?wa*&HU>zIY(3C zaD6=h=B8#4j0s{8s|6 z1)G0^i-Mn*j4TvK(kk@8<6>1|JID*w25^ndKxWzzZbPl&vlwuz>^TKk4R8~`&{{#I z7f|$Zs3%Djsetxln5+<2nJzlK;GdqI>bH1KvE|J-mL23(lgGF~+;edey^se|yuV^Q}|n)G@6Srm8)kVU`33 zIllwi2=MIKY??J{EPOW=3^WElJSC8ZRR2QB%gRQ4{bXja>+=PXKK{va-ig-RvLJyg z)62Nzf(IUS(zT(%SlFJf7R z;C2-|$XopUwBN3mL*GfkFKzxZpF&GeLhIW)CFo(K?Jjejj`545sT?mR2eF8nWQlFk z4L0?1Hk02rFl-1tg@*IXBlU{Q;HCNx98QL0G~vH|?4v z=L%d|6dZY`*9MZiqvffM?K&cT|FbWrm1t}Fkk1TYJo;lPTCrpvTIoUW2e2CNDKg3+ zrE;f);)}V&HmCe6byO7=JqP8K%A6u+X7OIk&2T!V0DkY0?j~)PrE+zu_+boOhXJK_ z-tC|&$EN-u_ZKi~8&if+{jInT&5*_}t%I24K##N)~y! zGqLlXZXl#P(tXaHY$#In?8qibE}n-b56?rFgXeVqd(O{yWe`i4WgG*!1>X=~z{D%i zlxKDTeRj9G+~AqWF9Zl!m;2ZI8Wv)pl;q8LQ<$cbl?cPg9_pLZE}k4;o3nbl{RG^VjK3`->9Z!Bdtm7Uil2+v(9 zc_F~pns=Be1^XDb>~N`-A$;t;A(QPp70-+XYvwb?#_N0YoLI&d3UA+xSK4eyIp4lC z5udfIbhAT5qchr1%~SOMJdct>C4X95`)sNV%I#E>5$rCHmy=E+uL%^^_maB-<<2}V zA$W8TWPeM42pR?XP!KnI(U6Q38b7>{g%$STr(?jFqTx@39_vs3{fpSDSF``pV4#f~9k z(@YE@gC|auwy7vyMb0v(xuV{LSg9L~%Sx5R(ObV}@qrm!R-ee=gbS(gY>JR_&-&+f zvCN7j=VeBS^n(N}vA%m4J)aRwOiTpl!GKG`YLXoUB1DRZn^?Lhcf@s<@q40e%%!UC zS4g|W&y8(u)-s#gs+vYgOqH@IDjcI%PFZ`AO)g1f5l*@-T|MT*I`6XegmsSGy~;_m zMg;y#tz#CcSPiBR3kvE}hjYhG`dUUedWKi%EO7i&FrN`2#*XhuobfIARH5d}MDiz6 z#a8*9WM_Wk_`JiJZ?9?jb0nT5J@V>Sn4jX(Oi!k`0sI_R+TRI0eALOYm^ z%Qb5;R~t3TFfCme z^bD#P9dt;wBi8uYFHG(*3tzSFU7k+e7U?pB zL%ssHZB!VII51*UT*QM9eH0&@xy&CB|L%VEo=jp?gv4{esPmz^9X`k-p7Dxzd?JfH z%ybo#zES-PN}ZDq$F=^RI$};B#+K<}E)@A5>2nk(EB0wwxMU>a(nNKVi3#Dwm-Zx};C?k%OhC>A|a z#~m1Z5|WstBqt@QNlSVrXG*3fBbmucHeVdeEw#!@y%sBWU0gYtmfTEFUS`CR{1l`x zMJY~6N>i5dRHQOhsZLF5QBU$tbeNJF27PcEeo)}3`e4(}L5Xl5{3cAa zVm6yDU;x5z+`?@vU}y>k!A)1(^kXmxZI~_vKogpSTMu=> zs#Re{bjY#J*VBpi)xJY0LitAi!NmE{Nl}h9EB9H3EIBY>uXAs#R`|v_0QT>;yWQgb zX0Yo~7Y1i6Od${gPNOk|6o4EcUZ8HmDuq05uf{Z?#?8+0rV}j*H)cQza3fo;AL674 zA43@M4S`Am@)!Wpk6W-?ztJJ+6-|>6WRMg<#NP-)^mIB6>%xj^>MD+sNbLg{Nl%TW zDNIi1*wFRFB9(ChsVeN-f~&$91-mlIR^UB0J5&!@?r4&P=t(Dxa~RL{&f!wM?%BQt z#iQZ-AuQa50y`~^PG##J;*TTjyPhV9Y|@1w*eM3sjJ9w|Zx^e;7m8h2Ddnw?U^}-VXyvQ!=W&vxD_d&;of4>3uYOA7+sw zyra192-yeFhcnAft&ybABO<$3mnKOhHu<=A=bITI?F;O@oi~Wk>bvC7UljkwuLpsB z-D`8+dREtTn*rF=yl*XDO1JHc_Nn`@1NA0bY`Wt2VW z_^kJc`-o&j7<)8wFoKO^lGlf{xss{bjQAApT3Vc&}__N^VOe06H7iq_I(ul3xx^*0X7081Bws?AO(YH2aZn+ zfmIvA-WM3B1;el2K-$f0>96ivASWAMZW}6C?l0YV;ZZqr-jwF-{T|x)Dd!{Eh<|1Wll4jYV+@!3iTU_ z4WTbnbuOyQD#J$MGbf!l{Gd+E`)(|4ZzK|m8E0%TItr&(|HJzwhldX`-7!`*?5H3* z#cZ>J*qMIe{I?TMPCU^NGzu+d6hEVoSRsS2IgrQ_eI!X6;wB@Aji3wLU6+Be%b-NG zv69nXo`2rI{`)c4+NbI^;oGkvej}42Gx`x2I((LN^0Ugi*-pn81=hlnD4p6DsfWcr9{Z{WS z-diLaBL{;XFd_x32sPo{}EraPy@ghZM{8vG$1XI_j|&Cb+}I|;680qGzd@=-|18} zJuFkE>6f96SvlKN0H*f)(x{}L3$6SK|73(yAmPcAxscT1VYrAPvBTlni4(3 zwD?M|ht4ypstZ)Q>E-=ErkX0b)J9M)yk+u1*o{o-U$G}f*)r4VTdjS2kMlA-&>1E3 z{k!s~%o#>Z>5^VMH`x<(?u{2EBy*r@Er$0yR||F>yx zd+!^e^^?c}#G;YC5aiRR=r!-X(VLk!q8Z5`Szbq8@LCJ9Z{oD zc)K^H;s$8g93BAivINio6!`!BsjJh?*CQI)G5z)R0?z!`K&G38Mp^yb9wMPg3HojL zS)Ovq-QOjMNEl=gu_7WOgXI3(c29iz*WLF!XQrkqDykwXA|mR&_FBK7Nc!k;Boakm z`z_O2R)c{!CU;HQ2@yn;TaZJO?D5;$V{Ns&7g1s~FyJ6j`aLsq)-A9~cLAcuui%jb z=ShHz0d|EVTn|4dWZ4$Dbiox%`AShQnN?W*Ioc*!lpcFvRphUR>g#j!A9roI5 zyNy;`YQCA;jn~R<02_-Mm5dB>q_Im7B@}YJcOX+I39_b-AV&uvP7I$=XNo*Wq$#%- zPaBQffvJ49S0*BEGKcyu^>;aycPnk`Hlf2-w_SU3q=eRd+j7uxtIAejw#=)_B5sj_>^^0w+G#A^Li|Lq* zv2G*A;L&gKAB{^6YBhQe^C%xhBY$L#lo2;{BiNvXFC@u@!*%cmgG9pr^^gA4Z!GXx zKk7SutuNpdj$l7_VsmM0dwDPH**$f|TQTs7rbPVc;o8HxrJDgO>d+&3X&1J>Gdihb zI=r>5FvvkbU^@Ggb8s4t;WX?|eX9@ks=AQ)LEWk=-BRc3M0K#Ux3G5>bOf40%6?}4PYxJoDcimPcF*kW7Spup#18lBeB5uaau@ikZxzv-c=cbPmaKqfS&AiK5!3x5(fiL9+jT(j(Se9wf`pL`<4XeN@Ty>oA{@F#I@ z;GLZ7Z6M>Dc~yivfCGFpF3UUMi zXPl;+xXBx~X!mV+^etxL{|c_tbN@{sV<96TgCYGOjgX$e)4-#UB1k?Y3z7nfgXo|c zsx8p;S)>|t0LFV@+OY}2#l_t~#SHucXI|Phti;-)zTJfiNtp=$yi_2rt&%7}>w@*?&{Dc>r8QQ%b9ec86(U^r$!ii*V2GsLACmS6Lb*Q-_@?ZI>^=?>C37o+u-y(j?Xr8~(tQrlLpuI0 z9dp7-r(Jf%Ro7g1!%er`_P|%){O~tUFgb8^Bn%8>ENp&Ux$@)5lYoqZ9~Bip8X6w7 zv?zjv@fR)}RfGrubaaFwMWKlnjV?wqPpNXL>FKfM$)jXcf>5Q3hDk4KR#s|_8acAD zan_{2AOj5GYM_DKv}nOM$PljV?A#4COfXo%Miu25P36W=7h@^cILa}eYE7U{CULQN z5JIdF+d&m}P==ipvzy~(rN}`GIRxsUBT(wFBQ%au+%YP1g8DeanIeRT$Q=uF-KokA z>g6U?xkbI)4n*#_PvZeaI;mP0_3)IkyydydgWJL+D7zn3yQQ&X`!(01FPV2MlO!?gX2Pb{sRsRByLk+*}C4=Pg~|!?&af+WqtWiJ@Ymk#6^yAj!WFdse*Nm6x2DUU{&@lje2O|zyYiZ5-)!bH7@>Cq_`gq<*YcDjwbM%`x4F-HRLH(1hk!AXF20E zHW`yAm{C%TIJe^Ga18@#c+AyTItCe+nXOqW9#>tw>v%13kz)4l$K#x7b%YX+yX z4I}L&e&Zh^^^0T-XtYe`cZ;t&bC4qC7J7~hPfl|5c7g-uLh_-OUvI2Dx7K#*9q-3ozweIw$ znZcQrn;eIW7Ffv7k2SW~^HXF^Ey3`Xjnwkttr#V%sy$KElBgpqQBGz?nIT_1qKk*K zbhWhVT#xTn-+UM&JUePd4O%s0O(g*e2e0q5@6Ix)+==lD6Vu3PWhE1cRd@ZU7N(9-jje_gOv^~;TEi9ZncA7x2ZNQcO&prdEJW8 zY}OtdpT&4kXP)K0u{Jn6G#rH-_RC`mAR*kRU>htr@d*2Dr~+vNk+XP@np(=iCMYt^4Gb$Ua0a5lT@8)^TtS4Z-rmX{|ctuPRchsz5y?keUCHtpM~ruzfeu+I}Xoe#sl zW}IhEk~pn)($ex+$TGRF+j{Au;`y|@TgjGu4Mx;jLQ=8rGy5Ta`t6Uu5$zQ02RD`+ zBK*?xyqavs2#|tMBvyQz^ue|RDz^T9aS5%|?lQ6}GMwc8taxipPC2RWCriT``&s`@ ze*2382EsLByE@!AaO4{~K}%ECYbFr7hl@JwVRIzL!+?xJCfQQ*ylU@6cy7e3Mwsc( zioU%es|U4CpEV@b$RUp|NORjcNOjm5AE_@KZUE=ia2wyRbT(XHZ1??q{jD|CbggX8 zT*+smLZ?oSI{uXt5x_}%2TEnoxwWSh(b;aIp+hS~TfuPvEhnlA(>#6cs(e+rtDfQi z=5YUiee?I-h~MTXbL!B#J^hBE(ttl=YephDOoQurWlQNA`j|z1bXH$!_GI0!4ouE= zljwWMSj4Fi5)$2CClG1PrZL08Pl;H^W0*qo`m7SQ6IsAW5`K7*Lo- z+gj?-)3s)i25o-;53)1wI;0rKQfLsk*$<%uXPS>B?dCfJEIgim)7!8rol0x?Ta-Ngtn0rUU^^FV;J z51aCi?ooo&2etx|Z4ic?qvLjjsW6 z0qEVaIObAcilI~N$VxFc8|lsRr1Zna)Iv*Yt~Y3KqB?{ugByz6VpMq(UCqU-zn|*Gkf}_x$<*MT5RY*uWrc{rBPHh;ttD032EFbRq9H( zwT`7rzFcbI9y`6>T4TE{FZQI<*SnW2c6XLa*It*KL~8GNC5#oUBW7_AtQ(U>ycU;h zY_4_@tJ2l`WZfAqc1F8K|18mgxQmuxhPMane5-+-YvNgMyK~yi=4MrF+U#(4O8cR{0g^z;9bZ^aobkU2-0|IReX?nY+rkLJ42*@{vU34Tca|>YLd<#xmP`1gj;q z2M%Q*+>FY4%jICngQSb`_^YW3>t!N%@~rC3CE(4>zx4Z&BKC*lMrq%Hq)VYt@g%ez zD1Ih_38zfIipzI9wE~d-!)Ko-!x?F_xAAg{xRtAp{) zPWlwLDQ0?&o}aS@8Y^yDh0HT9SxzK35n<(rJc;Q14v(h^^HOHJ61a~0fFBZfnySr> zP{y^|vKlraRW;I==_s*@wdwKedfAs2odxW_0opk@E2D?TqsOpHRmLgm zFtq55o8P1h>k7d*R3L*j<&an3_JFukZq)ou0TK$N3)JXQP2h+JUj@&HyrKPZvK5 zoyetfG#J}Q`wz*!(>tqZf|N#Sc>E%@S427AY`vEL>s-oY;|>&C$zBMowI>0vh6AO- zGk2nkF#&U5X`N;=7?J2uL0v#xdR#1U&pD0O|m&krx#}m^Kh0Gl>WGBG0 z=PA#mufI*U_jDWf5}lfxpc9!a0T&g*@c_I4A{L`MN&pN1HUNitAi&CneK;Q7!x*U{ z@asaaq1oPBkfO%JmlF#I-&Vdd_QeJxyrN1`WWZVjnGSx9%cYdZ{T7Q@teJ?MIND6l z_uAZ0RHnK%G>xTg`yvxVq!__u<1s6eAH5 zo{swj#vMgcwVCqXO^MU)CdBxs;(X3NKSBHw>PE)s-3eTlb5+i5bo^pE#=Qj$2#)QR zQ)EMP9^bL(^5|tWCBNBeyA00Q7SN)EvgapEW8zE{7_h`A9`Bo~_%Ke48(&Z0s+)fSZ(?x)wIl5|b7KBI3Jtl5>5ab_t4d_COv^+ZhvEFl`0M@l>#>XURprQ2E2W3N2}c^JPQ3^OVY3i>b4z(dosSU&}R|h4yi(L z9{>K}J#KCnSh)fRwOx>oA4{<`x!E^oxlROyVwga5sWO6@@2*5>043iKBuD!uGqkTL z9D&>~nYqGxJG#$mzkBum zYuG!akz5Z3SN1V?GXspol9O~TU8_K`W%Dpu${>xr82)cx05RU>K)O1_Xc~_Rw6w+G z<-*%fSd71GRX=yBSm%doCOlU|2*Zqv;ik1!-uS%F>Kov6g02??&v*%J^w( zLvQTZ%J`YKDigMMW&Qm6+A3`Ov>}rP+Ze0WmYQ#-cH^Js))#j6wqf?yFaG_?*Z|Bg zf5NugfZ$-GK>!XzK}JGN2jp7)Q~~Bgda~|rCl?+Et_L1HjDv|Sx3+L_@Xo%_JKNeA z)>@?%l@n2VWj`g9&Uj1`FT;&MuR#g_D`%Tyu6gELV4+18Tk;gkCutL8#UB5W5HC2H z7zK<>mRe@H6;@hhwKdjS_w=ojCc0-|CS#6iPanH@5sWhigrpp1r{gDH7vrT21xVrD zZ#yDOS_+!nZ{KZ%IC`gI@c70bJWsVQ+C-r6OdhQA5jb4L1Ge;AxRU*jOqyVXuX-5Y2_9_ByYF|tqrA-v5UC1~YbS#2r zRod+Wueq3%03Fzy8LZlz2kKgcPCy?A)E?Lt;7GY8oJ;${&%gYnnhjhn4jG0`C4$}m zXi`x7>qOnDdyQ}sPRFI~cO;Y8mkjL>imbyJ5AL8VFf0_grSN1vVfUW@A1CE3fZeM$k zs}4G5x1)Z?+y5!#P&j~NV&UL%;mQr4ClN1V5;B2Q)HJk$go~gPDcWf}oC)8FM2nFk zRk}=idGZx7DpjUJB@+v)290c*3@}iOLF`V()hT~Hv|p!Zo_HI#I3y~LhP&>cYjH|k zT>P=Y#%TNx&(7$qH^L2DZLv)UDiSg}3K|ABXAT@W5ppNsflJDdHy;6fedjMsun?i5 zDD{ybR-7d95+zHMD@(Q<#kwifU4|a&nAPa1)(`diYt~mkgY`CqLa(Tk7-3|txa^L* zZmWzZ2-3?92Juj?nEAEs>S9=S)@s94AcMwAUF`udPoWt)F#jwM;TSia{&%Kb0vycy zdV#-jJVCR-hq<{+AMU|kN2|m+%oBW(oZD-}fsfx(?m+m)_Z4{i5B%3#8gHLGueaR1 zhaJ*4o>=35%e7p-mX)!V@FT*b^g2L}!Bs?HpX@4PU<3YZL=rxA8}G2c?$e0gQd6CL z_ExM(--Dlz>RlIJ)jT}+1Mc4ynIS)JxWNpJ?D3p}Cu;JqDD04ahi7OIHnGoEIPo}B8FjNL_pwz zNSy76>LSlU)QekT9%Ib}?QQRRyl#_rpg@md~xp!`-8of1Q^|p;M9x|>( z{@j^g(Z^~4@+jX7q1?ja)TLtZCA^_41^}5^V(^c+Jc)GHU^3DwYq^Vv8^ha~&!p(- z)v<=9{4luLXYAijn~<@q5Ty-~A>iBy)F?!$V_>ROAy${^0bUHzLO@NAU^ZY5N!?CA zU~KDQWwi5SmZ2e75$zPMq#V)%rLhL?S}RU0Hv{Y=Jt7ibbjbVTl^tO(1IL+XAP#-H z;^+v?#32x+zxj9{2JY$7k8{{q_^V=jMJvY05ET^@?Ir|4N-$(ZgPag3hz=z&pdu#J z#Da#{{TC41uSz3%JM)5?=zEdGm)0#oF!lY#F2Tw7|2^Gek7LsjJ8ZG1Z5RlKk!T%z)X{0~!ZmY%L$_6bJia4G07J}VS>lmo z#pbC@V*xm6zt=_!9v@lv^S-~UO3Jf!nj;y!1Rlw3TzOBxI8u?w1emewA|d?+fbC~; zlrMdv;CJL2XfPDIhw#X8-%sfV^@XP5EqR8hsg5+>A!E0=hB_4pVrdM$PCpE#3`h8t z$*zs!x?7LtXK#m*_aLNXkR|%XNSCM0Vw(;EH0i#tlZPB?ei;&zQWwA_5&(L^&OGf%djDBuetK?d>2 z2rUkX^*fvBgaObLU`W#pj_B1jiYH-#Bxog75LH>DbUAH0U9Z#=TNr5M^#FRLIeHI1 zb!gG(1E3?*8B9IvW(sLmZiKIWjYh07MY9Oh-H?G4Y`3Mr$JWRo(18I0FfqU_QpaCb3I9I)0W~-*#X@#`;pBRQN)r6+0FKpz< z*dWPUl@s3Shx@`7#=Ay*&s#y7HbQZH&q@}#-9bF-XIi1_$Hu%r^g)>cRkFN^`iDN_ z?mK+69;AIijX@Hrwd{{eKhE-_`-o4<4g-MgggFF3ZW{vB69jqf0M}wZK~T_!01X6< z>_*!L;3~pG1wr=+0xVJx6h9syXjBlCL=a%9g3PjM@fuQ2E2wBgfRzM6RXe~A>_HHi z+7O_bAXzONUai#79n?k;V4Z?wJ)i)4DhPT-5THdtdwbKifX<21ipg${S$qu`Yc?95 zRT!uDc}*fZu=$bFW6%|h!oj{M9O8>Y zyDtidY5<1$5e)YuV*~`FailLATYb?u$`_5JH2`D$2*&!+m~o12bP~2<)f2X{wCc~{ zvfBr&#dmukAZWfZ1!NmgZv{CP?Da3efgb>t*Mt5EIQ1VO*#*~~x4$7c1Sww(LmkFF zz=4AJfXfuE-MyNzhg{vm0U$j=%|t;JOur7UI|>?|_0cqqm7Y~>-zd1mxmMa5-PJ-7 z$}v`@sFPB0Y?s+^3)m~=DOtLj6I<(iZ!=uST&pHTW|dn{`Ve3OshZsaio$PXLM^p4 zrunvA9c{<+snb&862st(Ik{z3)U`c3b$okkMW#n>r?D?g%4m7uUgxD|_TWZ@62tFf zzs%9fO{+C6=E{37HeIJ|k-#Yw*OpM5)Rda#Hs}i1tUNz;DRpb!CQm72&3p>V)G-st zjonkkBmn{DOAe{YXgJgmPC&ZOvKR|PlBsF>F>Ouv)7Ty)C(HbV$Q*5&nL(&qw8q`@ zZk?Vw{)sbIq(aZKQbrtQHtrRtS$T{{X+>h1kmk%rJ|S-^i6^~yz?<|JOJITrVBTQ* zjyxhDwlaVj5^!8}8kG99TN zNT8u=BoVmKN`gRtmN&cq!?X%Uevet-_eK>{AvjX2(L*y1eCPvXM(j=Ve|u)FA&DDR zV}mm0;HgQ5L3D{bjZ7KOhq958P2*~a5&L=E`!TG~Tgde>!ICKSnIIh%J7*}#VjZ3x z-}WqY$?|P-LI+)Cs!VQaH!1|8@TtS zZ1?!Jb;Ca^TY*|gJ68Y~n!&#-TGRsdH#jG+^8W;1CZ)qxC8ON>Beb0POjg2jH-g>9 zfYHgPg>HR{zAq&y>GNk?Cu@!ly2$PzqLz@>{HeEb<5jFvEsPUy)OA8s!g7F>vI&RB z0}Jiy(lw0v++*5fhg53Dp6{BWAxbRC?>3Xd4*}$yofiSdM=!U~LZ(?}eIN0OroQPT zrGBO~*}jaHYtv5=_S7kL>aImsSxswE!d`eY*B)Hm`&wFaI)*aNG(F)83tR!c`VMLb zW!Q6)DUv;3n6}@_H$sY(sIKaB;)=Jb-;Pvqsyg_5jU-)qfhqm`L)vl{q1vP+F96+* zRy|gqF3~jy&&5(~X7Caa-NyXmVQ{pzgFsR1j z9q`HHXc0Y(SA%%{9@Z-BbF?FEx4-!f)4hZIC6r7f^1i*gcZosP$(`;gR3jG7Ngwf) zau)B1QVGVl>hkGpu7w~}%Hgfg!cKHFhQJ>JXJpaUF<&p9-t=ULodHN=250Qvd9He&JkeBt9yaF$~k#pYW*RZ8T|eYJxwmnun{Or7|qHubW9AiL4|J@G1iki_Ly zw&NL5svop8{qt7#H|Y={jK?Y>AVr`(_?>2b1Fw!wtpjNL$G8gbC|vIS%o}*_QG-6= z`N32}RfZlrmKu)Xzvb)|P8vlpCF!QmBYz4jwO?q?pWXaRM#(Ta(8{arGrTFnuNkw{ z3=w#tW?@2<-33}dM7}pU(8v$E7jXZc`E;=L@ZHCx_JYc6>=m0w#2$% z{H?&~T8n@M{5{T*tH`?g7CtN`g3O*TC(S@W=kSIflrq0nF$N;xPm2&fcC*Egcx+{o zs7KrC%=3G`rbT4k4LL+32xJA>Aqou!a+iYq9aa;df_oW-t4fhLR=DI;KBd z-{1d8a%uHWKOg?Tq$HNsa$`}i=u0ws zN1Q=z*dnCCi z!Fl zWKlf#N$ubHcy50#uAH6D7#>t~#W|5mzQ#Fx2^mEy4OG}hkf6Uz*uh1+WTAlFR?-kP zpW8X{SL^v1#-p3snU`>S9yRpG0bo+u7c+w5a)Wg1j_rtU`3t63yjOikl6~1H{-)Wb z>fzr)o>SP{k6mS);yq&1DY&+NxIt~to&GADUko<zB$Zx37sN*Jj_CTA=UxDM4R=;&EnhRL5uDsQmH`So11ynT6qr2 zgdOr$-9_CUihAy#ZpnL<>=WSt^vj_^E&2!eAUovV{`-gNPHU59uF=1LRh_5(G{-2z zf6;iySm#m(g&>6D;gbmCkymrfbc^&G8>}}P>6TwjJ;0&2w|UR-XrK6U@*$m z@S&&)&Lgu5i`3{&w}Y0rxV_ymJehre@a(P6pj-20nqDcPM8KZ4ftzKQ8c|=n6}#w3 zl#h|59Rn=mlW--&cfMn3?$a=iq3+Vo5OMp_!A-A-;+%I0gi07 zX#bams-uMV!-@ zc`HjVp2D~`wb2{q{QBG9^x~-LAkHSdRJ2Zfg}x58?0z-{Kg_(n`dv=RpY#QPqNk7t z?7GsLxxy)Ap0Ms2lgq!9L7)CCKK{*gr`k#`SXr3c&>l1WTzu+IT#S*Mn8Zs=3{Fbq zCeFOd-4_#o$|~+gdhSH#zx=A9mX=|90<(zwW&rytlOtE+O?=^_H~kGscF)luxn1rt zSwBoZJF#=_5?8UzXz|^A`AwY+7V~9Ry1hEPm<+2r%PV8aXW6)hUcg0BU z0yj;SYyA1w09ECjW7ltMYcp+|ZL{*;^xH{V#vj*lEFD*n^ZKW`4+=7Oq^GZ9#(Q8? zha1??NW5W+0WX+xG%`8%;kn683wKY9u}o;BqPufrv%I66prUPjJ)Xi3`sri+HR#3) zKH3a!{sWPH9f>zhfAjg2K2e^J%U6ww??)!e&%RY2EUxk8WNB}G zgJB`%DIIQKMoTg~I}<}O0M)velwsoSp$Tly6^H+YR1CwXlLn@lE|7Jx-A*DH>FvXbz%xW$-573kQkydI$7Qy|qv=UEjp zNl6PA9`zNA$6Yu+;84hLo1RS6V=KJ~PhhK}D;cjMan^Gc=3Z!>+qPivt93Gg} z@Ok+)D`YVkA+zmT1qL6v6A9jn1os*C845Tl6H6m~vw$I>dugP!rF33t&BD_5Qld6| zE8Mh&wT%_L-ZH6bS~7L%)F3uLa&K>3MeMz|>-ReMIt%Yc5NC=j-g*S~r17lG3%)Xs zWnSu0p1IEK^+3)ZZ^%Xzm5U?}OoqC$&{9aQ`d`K;QqqFS1Syhmx zK4hu86!-g`JfdMZ4(z(9uaVxoFwU9Q6mx%D4Xh28!YN$t9M?KxxsB$8RT4 zbxytwPg7BlL3^*O3P;un9r+!fiX9+{jPK+)G+GfA{ov476p+j3Is6RqO-FoHTT!bB z;0wfZ_ZSg(wr$*kwz^Dx{$|mBGWm_?@INkzBgma)^iv6mrHR=mu!cg9R&WQcu3TXj z{^d_O_56kZ$&$}5{O}dNa~VY|3kEKk>T>CMT=zEg|shjiw4{zC1&j+^cmC1v#jDl z7ZyhJzU&64Q7+GZ-QO`aWxS{LZE?&`tO9UxBVoofho)oT@Fqq*ie1zH}#xybZ3&cGlMOKl1y}eq9wM$ z2uWErg=kl9bG-maFQW7E^QZmlNq3vn<{q1;$E0ci zo0`wJoUg;Or{Xq8VAlAu9XNQUs&lyzt%3zhV@H@4klsxg@1tEd;7GC0VDVt*i!pE*86PS`X6m zojX$9QdJ&oEAiKaD$8rNdqBHvSs<`X&(g3b8_x?HIrg0;+v1x3&H`mrFDRrIe*9`_ zKcm4H|E)jlwOCo@P5u)4{5`Fax8H7^2!%w!QX?TiuNWE|Qw*yBJ5MeMwapHP>GAMV!~7+oVP?6IcZx&4ML0Jnz*gAu_7u|@2ty8< z_p4(Z4!uNJTFcYQYiRzeC@q$(gg}{E!&h=?$b$>lKcy@bt z=czBAgRw`}oqg-D^$2IDGv*_*$X(kSP>X|gBAvXPve@~CA}XM_7z`?v2z_d)-qz3@ zJnmq!%XN^bsX`*{Y}~iLS+=XqXNJF)Jrn62i>HOt$boqR5#lHEd49YY7I1{nre&`_;;^;@ zX)%|2Da^eBS&?4JFN%ELz9^Ha7YHGl!rio|c}eeL!=ANOv+-%#`S_99(TxFw%H}zE ztO}J@9H`()wT*mxREwknkSY;9CSxp>@ljqcH@eTw2L+&o3GWmP-Pz}^rQRyOE#-$ryZyY0Et z95PeUo8@7#w78zF)z&e^9&z71v5#XGNW|7s5}#j65St}jp>h8x>Y|YMEtuZ+!xB3G zvOq2|sQIMB0AZVl$TW&1dWC}5GZ|VwYt*=ZLttLKN*3eC=1psDM`#?ri_Z>d^pao| zU#9C7IHS5`)oQ8IiWsGOK0kFY(o$cKgkTs6>F5^Nhl5;h`CpAdD1_YZLXbd7-nJdF zSBlb>+6$)cHEMXc1cL~t*zsO?U`YHTR4FCDb=7oU&9QaO-vL>BvPKEaSQGz@x%I zBop$Kamf)Ib^7u7gC2c+9<|l)b!u0CWgHyQJ+~S#8?t7j2%0uLN%QdF$V2Va%5r z9g?=g9QcNo8=x~{zEpw6)U{^d8$eidG^cKCz~Fo1WpaIOW|Jq~6e>g}?y>#7X^c!S z;ZU!HQN_Z1vY%;{Ko1>N15@QJ+m$^CU~>JE0iHBzPupKhM~LJS2IXXXj7R?~N@{#J zA;$DoWB0i9R3eg`5FRwApr)TPk2ut` zIeD;2Rtr(`G#1h`y$8Orig6)x z>XmuuYV=yT#c&GQ9?9ay8=99L{v3Va$8qbpcY4jTa5%WiJ7bk)6%gzH2&pmS=R}>! z7(`4Kjhcg)K?LDxRCw58rm;k6bS$%r3D$sX7Ahc>N*tL~p$GJT7f2g^YA&yJ&Rl67 z>x;2je2}hMX_bo$mfjiP%5o_Ub64^n^OmN!lGJ-PeoywBIIEd=7> z-3D6Db!w+trVcp*L9ft55})b!;@NtB>rL6suBtnFUk(3tRn~iEY_P8FM_J5ds|&|h z+7wdUvd81K*m4gHRg_ucR#{i!k)r%e#E78?G+)=%JbeFm2c2tH2=1@2*kBE2s2d(i z8EDbHU{*!*LEO7jB+Gl8+E^jlL2D5w9Ln+sU9aCME->*%}!#`V*YjHoWZ={gnE%#)yPtYx@~KgG>Ni`(WH;KtvlC;dQtlP_wLHca}AY;8|MV}R*If4 zqJkoU)!$t`t9wBe#gIIInj!_)@Tk%>y3*X(va8B-AQW=GyR)plyrLir3|FNn7hG#; zzqV*j`>h*2^GPlFu748bb3ZUK5r!`?X(!NiRH@OaA{^XJw5EDoS-3FY8md$AD@qSE zGC*}TUE~xgbbc)r%P_IDWo{=)^ClD(FJQ>5&rfuoTe6bR2ul? z=s!sG6l@klns3MGReYU^^Q0}%wqMEiq-Nz^yg~a9=S_A0{PT#_KH~G)M@B4e_o&73 zl*N72>V~-ODpfZOt2#qS47Ui2wjnNzM$*3*^l^&S? zyhE$*1VMF2hX&GxHK0I^I>TC>__~kBDV0h&Wj?+{K`tmaP~d8H8vDDb+m1G!;W`0`ZY^BjYg4^Lf12@4>j$Homo`ps2tgMC~;#Q zjHnDkVo--#6c;uD#Ah_%-~kRD@#3!SIH<{55(L?@57a3%*4#o2OW*3sHUN^M5&X_M zc(B1@7rHQBa?PSfFX*e0tRZ2$!LO@wD{^SAG)XZNILF@AXAr{nag?AW9?kn^YT z-FJ1|UvWOxEjYSx1{Z_j_8Bz#Om^0_*R^o-=yTdnhUrP2pY#($h3WTc1=PP{xy@hpllyV9 z+zrXPW5MQEgYz|RumuD6eLY{0vxz47dCw05KJWfN0k8Rf?VTQAJFjx2*N|UW{syIYLNybkY>LKcAfJanEr-Due z-35wxo$S%^>H)JZap^zyaQl;LF_#6vk-s%=)1xQ`BhH*2`UrU7HUEDAtUz7RZAzTF zLG~;0NcvW0kU#1Wr)Jv$4`UZd^O

    BF$fM9vsYs(%;pVL{QgttFZl2LrhoVLUHN_ z*%fVNWKol@#Hpe^eH${Uql`fG&AS#uT(fl1rDTGmh(PBumv-*=`QmzoV2uh@4i$WL|O10-|QK2;QTuYN0 z!*eFj;7D_=`hy%(wj=5__}szvH$W=f{jWun@{!Nq~kq%F;I z;VWL6eoxPydKkk(rnake;~rI)``-n_kL;I&EZrK47Q&Z0dA$(BmZSOKq zleJVg+7-VhW>qKr&1JoCaIwY#I_@DIyRITnrh}>=BhNWE@_}W&3z73H5^_noqd+L? zi0}q?3=IGqN4VL{eYyk8&d0vogBNKz!9(5!%w!mLEa!akmz;8|hDS6U&W}4=?M5UV9-yRO$x_Tu=_6TG(qkq98x(hc!G*P$IL~4LH;! z%m%mHox&~xvYak190p*)X@qRbrw8$&0k;;M#GfU3K_k|AlhW4WflaFgL3-@k3l{1P$@%> z0LthDuZS4#EtHdDD{)mP02pkp8RjAaGhq*K$=a(Mn}b1BVt`l0$!P#$ zIJGwN7y$TPnrI;I50abZ4SE0noz&Z`${*Zltf9e(UkPU1YbGAYOqX;@<%l5G7YmV$ z-SdQzd~m)=tK47iz0JDPSX$%1-&;PoK?_@C+J|~-+sD?!_s}Bk0P(s+-tH2gs zlyBnrXx#OA-p~D%cX_*2MsAjmUdI!^UkA{Ua-=TfuGS&lbc>wP%BgENW}V!aK-(tV zOkmJrKbaI`ZcW$q%vz$VU>aZ=U_X=s8^@1U|79E_UWWNJFlYIO_C^+v`VKQS-jLii z_g_t5xO6u>C<9b;Y362G&jtn$^DYtq10DT%JnUY3yNJgEv986XCc@q$g9*RF-Igr? z*8-1KMFt5Z)BXpnM;AD25knCs5Ht#wUC-;tKLm$#;Ov42fB2GTnz+C`(j}RI|3^SY zxmQ(hi*b@Bp+O#`M51@+T8_}<%xpzro&_!S_@z!1BYg?UlWSJ#HZ#xsY;R`u0Klk( z7Mv~SFJ0T!EPVATOAfwlZyIg17Zj95xa{W?!jjhuv#b8h(e{OI*G@%uIDkf&!_Z1J|=jHoDj ztz9s*M$enP1%d&5&{F}d&?O>L8%gO0ou-n$<3OLZuGc-%u#eAfVK{_^v8Mlv*5yu5 z?yipqH3}i~?vZ=>*wS2v=b5K&g-FqQkw+aAAD}gQn0Z`~mKr7G?ikQwUF+A>+8T`n z7RMUpm?u`ObQWp>vGtBjJDGL%gPw;VkCp=1gzMo|2ispiWLoC4nITb&*ASR&Sk0HN4&^;m78^HrM7Eq*8s;)K!tENgO#G%HPqw zq)YuaPguI`tR|&fr0-{n`XXU9?2p z%?-6^1mGOG&dDld=&sL?NIiv$)j&@n|A6NjsUf9PhX^IUL!Ilo-uC|i2+5VYVO*zyv4#(M^~Z;|Hp{h$ z)Qt??Y+c+kx6JOho@EEf;7Q~3Qnvsei70Sb`QG699CtV?7nCdyLD}!%kj@=l>E2qU zwV~04NLcpA0f4O~wU);iy)XeQ;ADM`eUpWbiOhY@OkL0rZ5onAFc2-^>=JO40+XSC zZ*f?8tPB88Ks)kiEW7P|Wch<3IAeowq;~Fe`DM=oOX_T8erwALzB* zM)2_h7gQ@IkhDx7Ta7WAcUP@Sw5duF3s2+0IB%p>dnh?1ny|znyY`;%01!mi&@z3| zxjzGwr~HSeuF5P4xrsv?+r6Rb@B_v)y!Lk?qnFQBJ&zfRPk&a_)xi*U{6Xlp8|bD^ zrCi>Csq15ohBPi(tYDZSQ^6A^KE{dMtv~1LomvD}BNgSy{dW@2QmSq_@qR&W!am0W zcZtIo#RY-g9_tCdxEMRjO-_H z-%v4rAhE# zsYziiuzl%yBrF=lIaV!b$*r^kCi`$O(OBZ;ePwu)bl2v zJ3kj|%6{_?8fE=j5^4vW5 zAY^>)G$pvyHMnaqIZ=ETH8WF>9RV@7Ood`r{^C;5ihmr$L`}bzSsxK7KRF2|sLY;} zdrgkMm3BuBe@$`gViPdY@Hlc`vOpDH_t*40f9q_0)`a_9Q400>99Z=)V^YcuIsYS; z7ClgE_(VkC*WKf=`TXZ%Xmb>a2~7j=(q^9C%vT#asG(Yfa29cjbd4S`;6fi)3=Hs> zvU@a}=&pZ+${1}^?b|L|&*VjU=sw5U494VcER%#zz&bDYW0uk#-7>!nF?iNqte170 z>mrUQNOfaav3HP{We%=trZL};aoxsqOI8e(qwo=%U*yDni}p0eT48=rrS- ze~i--$jF#S|H{MCXKiTcAW3Jbo7yhw9+JF<%L>mj{e1HN1nbo`w#Ps)^$kzT+&V4& zC(JxsnavYcPn69WZfOlC+t?1HDLazm^mRtXp9^l`J@HZGDe3#YgM(DNu#S1uk0$kS z*$=@{u?U*&Jsm&xOfZ?pfgo^gr`?$f1@f^9bT<$CmFMUHCa`tX*-3o3v>-JSfF!C2 zLQ307>rg5+GE}1hFtI!N(2|hT%;P8LlC=2uHIPVq5ybE6k}UM z4w+Dsg^p>kmLDbM6B7km_kJOU0Iwdl5Etjl>b&;s?E*jx|*wLCoQicJv#cziPc=fvk^1y1q^3{Mjm~fJYn*jBz4_FkKr=>`NA{> z*z{>v6_7x@GYrY#7IvOeVgxXIqn(0gU(7!K2otx1PpWsEGZGK>weICXEQ8<{KA9%$ z7{O|w z#4c@%LP`k4&NHBj3kWYbZmQT3h~c`wn1?Y*#{IZUhNQm`hhOk4L8<{^IyQ?57qg22 zR&CrA8AK2Q;s?Hg+&A;r@9^6tqON1imXR$2PYZq_%kGVMC4yB#+7mIy)AK3jca-$^ z;{NHzJj)t5w4UW%i)kJG4PiK^2hL_IvuY1Tc}4yS*o58szZLlAvIg^bP?djvoE)t` zq2I%0-Q|w{76rc?zpYHJt5`K~lxx!BC6(2XmdzL8VVO4bQ)e{CCMpOaMR%xj@@qps%Dw0s&n7$lQU8AY;4GuR)gPHY@$kTor=@nDADJ#!o9M*F!diY zZJqUwwzf@GruMp{FzHG7q7-9lxfr593|Ux~rqT)j6=V=YxnY36I=8N0Hvo@qnpq4` zL$$3Q2k$3^mw&HlDEcc~E(Cum*&B7K)*o?V5_7hjBD|!@Y^{Pka_cz_-{QHe(M-U*f8b~n?wj##tQPVZD_K0%@q>X82#2^ zTf_!UL>4=I{v-Y+iE+b58n%DRzu~7vzb|Y-I7a-jh4&L%)^O1&XfUWT1+?*&vYEIr zKTUj$C-$XsuoBCLoSX*3ckpS-qd>_84|y6gB77)Fx@l0JrkAsiJotyoaUwq9GLHb~ z2R8VuX-l8PNE|ZsChwZ-Y1!prF6OGtu-W5{HMm?h(RyD2;tv!qi;zc*DzA;;(WM#2 zPtX1k@*IQ`33n7~E-a#=;d6;y!G;t}9XY4gkva;<^nP>(1MtMTuO^78m%EITVjOxd zN1jK8YM}X;v-&O?i8)j<*TJ@T#I%xgdiGKTVIG3m?Y{m_yX!~^p7PMjNBQRe7~`jQ zRpr?1iI$q=6OMS-Y9{z$+%^OT>$fEUTps$z`T3+MT?U#h86LzmjH)7WUszDU6=Y35C* zy!rwVb4qQqh3Y?Rs@{t%_h8R5=YyW5QIgz}_S63UY1c zxfp=APyNzwp@TN!X@-I@+_RXvhu|MjaLgacd^*dB<)Ns%FnxA?>@%~{5Ic#g#lr^j~}c3GPbo8oVlQ0!1p7v{JOyIZ=f2$p@Df~A;TkkzZD3? zL?y3lzy9hAmv=p508ifccbBK#c9N`PZJzFUO1ef`q8-P}W}90a7H+>P5Xw|fMpbgv zQxIOFtE**9rL7FVdwJY15$VNBiU&U({a+*sy*Z)!Jpg3zP|qP5Hx?N$H%+i6{D$)x zs{#D|yk8nfslAWUdFQQ~Flir3wMN>d9r`_Mv^OE08O;Iab3b=PNh*B?%Mv-EBf~s% z!gtK=j1B+1xtYfPg6eQgl;CbWysU=-f&OJEj=8nEP+{STdw^d~sK(Y^e8??O%?*R&X*f&Y zo~rO|oQe|F7ffvNFK7(sh9orGqd2#UsrlpT50dja2cfh^xeg)MO6xf*8XRkpY(T1u zX@N-3$NCmaMe@P3**iXS#7PJjd%Rc!F=s4+m|Ipr%*+A^KKC0v!#xI_8EbG8yd45@ z&F6;#o~+4(IoWQX`y~;}!_5K&z!?e7`TzglkA7B&`fq~cF91I|Mda&i`nXg2H~a77 zi+<>VH4GrHM`?ZpEMF45|GnFXm=nl$%{3@=fO7%WWhf=KdVZ-&=BkBlto1&k?VRhz zj8I;~-(Of)a~}{7X}%#J3OPhWgmp9L6WSUE#B?3=yxuO%JHwkbnVD@1ls(*H?j-}a zW-`K2ptMdIC`2wfRwxFDN(l5$UK`Cy}exgsm$)XIF|%TGLDu zm8P-68d@&~I+Jfu0k19v9^am!gV94SXlw&Ck^?+!0ksEk1JY!(@t# zw4W2JqR(RT1tcvK&XGV{POE$f&+H;OVes|*&~qcgmF@i3KK5f1mGPfU6CMQOAQk+4orCSaJJf)LC&#{tjQT>eHns^U#dZ0aZ098{_4nzB%8 zU{gyaSBfkt>e*B&P{pcApnTP8^<`1TrcgCoxZS`SHB0%vyE22b3Ed$glm3_!DUm^v z1d&lE_N-YXmNc^3MzhnRn)wYgZzi^F(xA~mHq>z<4W=P8&?z2DfnX3&&9Ya#r99li zf|PE3S$Q*a=T%-cFnu+PYBjK$rt~bO_|CW#h1bU18*g`tBJ=P!`!U+?C^H)Io* zCJYJZ9k|n>JlD8|ANL625n((jz?Dxf2->}6xY79?Y>yRu%;Xq<3 zG6oUHC?qIXDMp-t4JE5Fv23#yFPg9Q4?gIStIPem$Il^!w0oa)r1HgzVYK0VVbmh_G_4QceiEt4gtPi*eE z?{=C-*3%8moZKf&eVeP5mIjkWpOs0k*CaONXHxrq*|CwDZohhG9vKtPW`{S!zb-g< z(y5p32j5Aq8e%O!Fc$ymdI0}Pj;3(%%P39T<~F;NMoV)(T`*^pHKbsZ%XDmfF%+bT z*WrHzm5{(NfeaBeAUG8QKvaWhTL>VD=o$j31ONd7paB2?P6+{l3jm;qo|L|;+|>H| zo0_x@#*J+>E_sphiMJE3Ylx)@y<(2P+F?WiO3}@{P}!HMwhLa1qd0zz5P|hLt3;bjOa>A~W^-Z(o@2=I#O)!WB9q+3p8Avc@eYxao+j9{*zHX#~k zoomWt9!gGN`96cy03A;{v3Q>5uu4Z)vNzLg<;GUNYwmFdDP>U_}_geE@_LEj86|Lqo_UVSBf+G`rSCu)Go->7ol zXqs)Sd@ExseC@x829;)3PCI4rs%~Xi#V?wc)vA`9tFNMqzb@=>>u~Jg#O>U%?m$In zxNHvMo;uudNct>8WA7;59Ji>*AZCv|YAs7#7K>m2gmws634&x12nvFhY=QVf3xiGo5~*MTHUcCAhZqDP1%rGCg&_=r zEgQ|IN5q{SMJ3Q31W{Glb(xU}8#P*CqY;hU0VRs`NcR8#f6CG^L=$8WpsL&2?vN!C zhXSIE5_(}23KLan^n{{TVG9*uj7e*uddqb0O{3vBrCYY8-QPZGSF;)iZ+x&xacFT_ zU#O)Zr)8}RvhF|N-m)J1r|}~H{8Qsm<86p!$mt4&9JcH!s~}5|t@9x1Is>0`BRN^D zFV*b5^ZN*0)cq2dwZaq+ORprJEPjH*5)P+5{bHJGnO^cc1KUQvCMPcs(b}VLc4zN? zN+^+i!mfnmm{cnfRBb@E>`_G);m-hVGi*>%^k@M=5D^puF|cR_3&lw60?e3mF3LGK zH+xaKIcF_?F6y^gn@iW>qWx0sm0>|F!rcdX_r$M%9L#-=1W^%64mnh68mFSN%hI)r za;M*__po>Se~`goxOP=K?b&(GjqdmN`2xWIoUX!Qx$FA5>S^qUP0RD&Sw3(iRUx`J<`0UNj5wG*>x}Ses(ZQgE zVcS9p=!+qyHyD^_sQttsUFKoVOn@U|JIMmTtG^y#Mdu+FsDM1#*S$u5`_>>Kf$f!^m&-t#JN8@O{=TbKFo9u+ zQp8yIBI+n-IwKwKN(Yp-&;H8az&o!3?e5stHM%qB90JMnu`WM5{T+qC5CS$7{@&EI zeTxN8OWbJ&5EW==-YM+yn!BQN4t;K#|KEOa|Ng%?EEb>$EI=Iy@&W)#2A4dGq$v4t zA@LM4Er*;K96(TsR3sHihmfiqs$4WK-Fn>A?#i5svUBasAcutD|NqTdpYB5;=9Tod z7B$926NT-v@3Tz22cqCs(R3AR18vcGja7diQ7}eO?bJQaWwfdd~EHaKldUaakQY%wvE~M zQzg*IiN6wm}J%rDjmTlBSyd zjHPF$lB!==6@IG;BRci#d;;B8zmgEzHX^+u6fniAAlvyG`AU1dW#l3n=!AUHvO* zp2j~<)7(DYtgU@7&_O`1V{Ofo&k2!(h=}_lz@7iM09juP-W#Ox!f9Qu9ulCa{e=e3 zzYKk!|3M3o`U66r=`*MS!}`q-6qHeo!0H!cCSXjN0BQA>T4sfg#)dW9(lP5Z20J$F zYs;ZNVRB@L#hz0gu!5Xmt`ojRpt6L1-c?bsitzT zrNUONqjn{wF0CP>*{s&(oVL793woD|`bq}MhOHP~tQxDCv~GH#VWw%WWzn|f`Hq#Y zb$hnw`gR8P9XgyHIT|~eICtuDX69<{)`k1&rH7TLwRbl@r?$R!e%6TZ$?RA}U#~XLOb=^WAel`ohmDFa7e$@4oh@(i?xh_0PKi^?hj6gb#WjQ9m&? z?z6!%>kIBzuEu=heHZ#etYd!K`DO37i~cdzsJ|xvARzt{RNjjn$Zn7tn}~M1^qqS& zB5g3${y~S3x2bln-EMdHt`MYj1-nzwyg|x|4 zCJ{}<-G4`-+YBlUw0!@s{-6A_+PB8{C%B*Ma%)_7*bZIgS$Ru&mC6}4d1!F)Dm?=1YI)Z>&n^Mq#j$W>t0O&ct_?Urb3m8n*v z)=7^PsZ*|AgGLpaH0x4og-R_}YBlA7RjRaEZH*neUGcwABV>j=Rwzh-Fo8xL6VA_O zM~xXbVbWE{J#@rj5&Q+)DZ~>?wrCemAx@$MN$C32Nz$g&urQm&JL6f{8IShBhi2^C z#&{VC3p@OSDd}(4Ga!2`1CYyo40APP=0gq%&%GZ*MPYU(y0aJ5eBJSNO%Jw@@8lzad%Ml9-H&%~$EFMX255C#+&sFa z>XWsLlf2dl7ZXSNn(PXeF;>_#YonwqXzJL(q6Y9rMtnNKLfd1a?X%I^=URNZX|?C@ z^rVAq4ZhiZgV?;^Y1G;Dw*zRT)rZhcf*lf`RjZb8+uGzEY|#@Ys^+(>SCQ_g`=>`^hA`Us1iaqQ(N*mGPBXb=3&q{pDg9249MZ!HUmlaJlAZ3}6Ss|`WjmJQ4&I3Rc z4IFiqPq7~ZkXrQ^&yl>GY09|3DX=qVN(GXj{p7T$S5ik$$m(+pTD@D*Q(eSaJv?W_ zyNf;2)0PXxmc-H(%AJ9ti3fiJTPoZ^wpU()xuyJ3x(JUotNc*;=g72Km1k#&|u z-c6LtZl^S{Rx*SViI}U+q^%+32}c=w7=m%m@xey+0gnC@UDC0ko{RDe@J8dxh%;lY zL7O;d4_G$0tw#i84G+TE<(5wtO1_3ivResX*X*HY_wg1C+66kZyDD*rY$$uXmiwHd z=uunx);B#T9|W#BO1gF*pISemiw69C6a=$}q1I_Qze?}~=FSG5EtFQJ)~T!r*CVBU zqDdTRW{V;&-4#DS#^9y{cI)a1Gwsu|S7~C!q)nB;Rgl^OotXv!Fgb+AY`ia9Vz)aC z#|GXSq2Wp6t)#M4#Zb>E$N2ZXN;qKuHYtUjb15XIR!f_Vm0H$XYuE# zGrxDMP_k)Rlrdw+*`J$wMIcO$A!>NM>OMGQNM4<0EB3L7i4IJ|Wb&6vk^EN*RqTkC zq)*w)){y0l=&BPFDtQo$N0dDhsVQ$`@RE13Fw?6e?#UAy*k7K>*?Em~>&xrT7Hd9` zh0e8uVqw@RqF!NA5^R3DOy#4itBp~*Bz_u7bCr#C5?M-6r7~ikxx*6YI72>I|l@s0`@m(!67xOBnSFPbv9m-OcUe_$1%kACWGUh~~N#Dz1zy zPM8x5J>m!wg(xOT!n8~^qoh4$$^+S(hP27$3DKQzw<+kj&9XlxcWwewzQzA|ZR}N*=ljooJ|w~l zqYQdl*-b`;AH3T1oHX@$ENyS@irxF`wCki$k%ojsCP{P_QD;tEc+lCvXkS&{U4_{r zZRG&%yxj^gq^|UcbrFu|AMY4dz2aB8H_>tIoopYT^oAVgl(Ao-XRT?g(ef@y=k9gL z`EaLnK0em<_4O1#soSHC`vKa9GU&^#i=?gR(qnNQRNxUuzGapW6R&~XsUe@ADn7^9 zkC^Vh8M#njTrTn=^=sTb59s5c5PuK`I35Oio6B$b#*TRRRc=v|#FMmaIV_spV!BnU%Cc8yOjU%k_TKBciVI6quUT_H;sb|(<73RvZssNQ zIpf0D9B@9(2eEj?rj>tH~IUy3f6z%po;&zZ=87ley#Y6^v+nZ}fFA@Op21YuvzS4hc z|KCloSS~o0upM-5Zy1KUCm+iUh=g;uNp_Rj&>$DKu@p>m+1fbk zrqVO~G&H9P0sW3%B(Bc-Rv5fQP42H|~X&##6S~lVXhp zE|zRoD1*ovVcp5(-4;qs3u*@Xh|O&+L5_3Co~L*1h9!DF_BxNpERy>&ZxZD;)GN^0 zY3F9)8~cMah_fhnoI5_x=`R}IbDW>@$Jkd4M-yBimfx4Xknk-^t2nN8eK#*gDwDRp*Ah=Idob z$K+&MqJ$8}ad_&d%v^2nq^dNgzQE%8{x*nqL9JQToispQ^db&~)zi34IeNXQeYpFj zrKRwtQa~#0K3#vl`=a($K!3Ex;_YZSr<*U|PIkEcUUyyDyM#-33D-IqKBPSvH*19) zl8%YQnV5OOggk*LqnESJhnV7MMOLo^bG+ezA7z~q7`GD}Q{QijCkbi>V3ik7`*D|( z&r64&yX7j^y1!njaV@x_t}y+zv}5QPgX2L$fT>;a7qb{E5(xG1%g^wyzKm$*WYtZQ zW*=sUq{AA)h{V{&@!Xwf0E4ac&&=@r4w$CCZ&(Y~Cv%ZT5YuEoyS@JDn<*e@LoDO` z%bXsue@MZ-R{(6Bgd~0YGF#!Rj(?1WKeaVF^svR57DRGUG&q^^j1Kveds^fl&K6A7 zz6I(%cFU&W4x*R<()A>MHb*3z&r31vqZy+I6N0s3_0j~YH6-X75}*o1xOK&a9}%bQ z9X_xt?Jj`^@>4|=`=UPqRDZXXfkF{}N6aRIu61|r?h+oc;-Zzll&7qcxBr%~oM_Gi9ZoEMt5@y#f!?Sk ztUDCcnm`W)f?QO0#612?wOP-|Ly_D+yfb-vPho)f&}!J-I+Sf6hWLmSVaJn8x>p}e zcMM0&M4F9cdm5^8*lYml)N}qr6y)4+!p%UO$u-{d_w4@^p7#7vwg7>CWOMEF_s-7! zXRY$x2XfGwHJe zzH#K8d0?YQ`&~H8G$|oNg5MLRgUoiLMy2Hl$gOA%WQO}1m-@VeVS7`Yt3sT4J%;g6 zs&guW^o1}Tf9`;TYDoi!0^?7eeDFvCg>yc#Y~mIE32IO;r15wB#>OMUg#F{U=jBLq z+1tcrVg&)Db9Xxe(DmtD8jRc>;#wQATKz%66RtGAVJT<%`VK0y@_AX>Wt&J-p{-AW8_LJB2;wRZy^|9unc5~v~iKZ4kRU06^7)M?My^w<*Z;7eHqOo~Ic;?P2aEEBfy zoocOotWeL_po&!X;{M5v49=S9NwMI3j46D2#2WtjNDL71(`w%3rk@sI?-$BU0aZ?0 z0dPLb)D#$@EKb1YCMdx4NUY-1YT8QE+lOIBpFKVslRaQ(57!KZyaVC}PM3aeEbPaT zORYX@$tP%grNsSqZn4fH8+3m{e*4U)>c*&&O*rkW&9NqEP!jaNzZd>0py1i6Z@h_P z6K^mn3l~>Ug#K?lYn(81{w0Tmde-r^`t06#OF$Nr{4>cax#h;#m_Vr0Fes{eR+BKR zzeuo8+_975^g~WRnO z=;i}kY6rlM(gjWq8D2|S_J@u1sKCsp-2qWdMZgNbm=kyz4o>Psgr55uYryntXYkN5 zq|bFt*U#KI9d^Pc)UGqK=LeU`U|9v<*( zw%TS+(`ag%IsJ0Gtd#+VODUjo&%FqyqbV$?URW#W{HgRpDJYF&M*2HDqQypKrD>G} z@2vG@?6!FaVH+>N z)Z`;0hMkw0?{2S`=1a^>;JoFp1z9*7Xhl`Vt`nqR#)X-|sU<&iCr#hMf0H$rj8PCj zw2yH4(w%PH(X+`u%qBxa4K-PoC*PJ3=owl_QX1w8nV!L!_qf*>+pv7(pKBH0&%eJ` zNHjOM`FGu0(rb2S+nYBdw|A8u)x0+!Pktja?kq)kltR{AfT`RISCkj0d+!UjQ9$?4 z13B#6oS2GMj4Ij841P=xt2~xu*70|0NP}7M`?K=*4TqC8Z9^suJcn%&FroL?uSbTC zgBPzII5zi+rAu^C*Yh|9u%G9Qa#^K~#kCFVL3R(nj2$g4+?$y)nlSD2j1~$8g=m8!q=xc0H8jl2DOpf%Eo(? zIP{C$n7e7UFN=5CN$UpNXLSe9tUg3O`A4}xlH%aVLA3nL$|QY9cBb*FVYi2T?1Opy_)-(p>Utq?MlQwETiwHB6(^$rYOm<6_hW zNf9ZLWQjiA1*q=kY6O0(_VMj#W>jFa8|eR&de zHTz49#64l>X$m7v|8~o?T-*BaSIfDLmue}YhhAOl#h)^I{P^o%gTE8`C91Xr>p08> z|Kr(LGQ$3j|@i)fW)E9gT!;qLJ{K6zB(g7)W2!lfY z?ErONyje~6Fez{@PN@v>367_Wq}F^i1}!;v$k(09;6NUndUC9F<@DF#gG&qC8!FOz7{bs&-f62ll)1U;r~^edM;mj}5BJ8Pl!lb3+6$3Ji+Fk|nY;}e2QoS%J4 zAgN|G<<;44N?N8vG>u@9<=F!9Ey-`rVwKX09g=ByN|Q$|#KG%H+(EnM)Zm?k1(IEj zxuecG<$$V(DS)Baj%NL7s4M`vN48>Ter9uiA9BKKZ5?>0rx+q_)#U54OOp!}%s_yD$mq1C(O1XByATEYUkYJ;P6U zbUEnm8c6t_@_(T&zCg4HA;T|PhDVegpf83Q3;GP~pIkeMHqgRjM_u!`?q~FBxb2BK z1gaf95&mS8zYdEPpxeJ3j$vTwCK$6IhdQr#MjX90JSNU2lWULn_x5FNI>1R5x-nA< zB$M>Em{$1j>J2E=7Su%8kz$dqt(8c(@AGCF9pi3_9_3l*J2Q1orMZmVgpe&af6j6b zvZhBd)w|V1l0Y8gns4!<^M?zX?MLnL+3{`=Gze$O_La( zexXQ^XvL)aLeA-qD|@}(L;`Lh1FTTHXuAijhN@|c6+S-s0Z0+MG%}?q_~fu#xP{b+ zPXI)`%BuKdE+vWUEfa7+?|Ip6ee!eb1G+Vcq1gHiPkNi9GJQAc+ zQ?WVMVHi6SG`T(nu60Zt6ySy4`UH7%ZHR0Q!649DnV7~)DG}C|aCvyOQ@xmuV9HO^7m^6Q=|A1w-2n^Oa8Wz#HEG0m z6rd1l*YS)5OHAbCR8ecc$M@FLNJcMQhwNfN8YyJ&4Awq3A}LpkPRVJ46q$kK^i3Tr z^p ze#R+LO_<^Th4KH)5 z*zkMF7QXcmb`JIYhY<1wpgzbZ3GWfpYOlz&8!S;Yi*Gk?`!BS@HcD?0csXkBm$)Tj z%xzCVRoY6pc$%%;hRd!t?Xk{;xsk4v>|S+XOAWM9w!&a;;G*eMa4R?7y`wy9(ycDC zi=_4wl}8Dzi^WMXa?-(%I|U3zOlUYqfzRTGc-G`cblS%HUiAoBy%G73`?V;+lX?(&@zcWpDqB^EQ|&U69;_d!(|Pal!M(Jcpvt zup$ROuhE5tITZ2uPFN^wJiZnhT6>Bo7l_<3*U4^lx*PdA#=Uzi)5x+OQ+8Dnt@M_3clWVuPC#PID<2Wgzp{kAw7fvztnzfV3KP01aIVxCAOV+13dacn zI1u|wix?mcmrjbs`2YYseE~tJg;?djX0~n1Ej?iNcgOeo$#CP+ zJYr;h;PoJc99fPpE?4z*$HOsbUTkg7PJ^r#vlQHHz1~RrT3b$L6Ukde%~tAYF_=pYL~H;8 zn>NQTK;s?lp&?Zp_j`q$T8lt?uibcitwycJt|{+d|4%EKzeaa`t^GR1ga4-fSrx2t zvEks(lT6DzZw@KzcjwsF+RkGQQE*55D0suxW1aO|NB>x4a=fhynB6C~*7Q#YSVY@~ zn#lUkbPKQlfu^ zV;z}6z+Mu+Gr)C%Y{V<9D>8%Osp#FT3``RXgQLAY#W>9y7946A*EQVi+61P@Y;8O# z;orhB%|O%L_)b68(Pa@!z*!)fp~0T+0zA++`~HJYtX*rY_qOrf{pnmkod8ER2aq{_ z#ZiUOj+fgNL%2&a6Gx$v7UpN4BP!#>2zIE|I|MP&9r2oA2isi{9W&lgR87Ltz`#;` zO$`y!;+I5x^NpKO6SkePA}BvUXa!??xYqR1F6U+_bfEX_nN=bfn9Ea^%N2b40J^T< z=?O6Rj6&P}sK^M+<$$>&qm$FaSPRFVLWZYVfC*)Y-KnpI-}dIL!wpPzJw7Y+n;#6q zC5_xYaM#Y0O=w&T`@2c!uUIN?SltlAw7Ku)-j4fjIh_{oqi=YaZ*bU=)lK{IIB8;n|zI8mmw6k9);6MpvfMeZd3nbGsmRp{RL$ z%8UDBlO&Cl{pLT$Or$pco-&SiwSQfKnf&~Mw|J*CdU|;Afx-mK{g9>QkZJ+au?;$Z zlEED5*d4Sz-n}w}#p|)og|X=|Cw=R1_&q}V+*Q{Gh`jJ#j z{8y0p+IP63Yu!G#iKjzh`{UwJd)?B-wvl)j3q|U#^v(8nNC=Qlp1Z1dN{-33<-W3X zlu^$c^bN6ZzqYR;nlv}HrNZV4eUG{-MJX^yV74dHne9lWz^U`gH_UPs+Jo;aurVgi zP7&~zOopvZykBxsnh3s$mKme3Kl3w0Bq}M5NVks^7%e-{{0(lp{yG$^gUP(1H7A18 zN1RATmn%`u3RilgBl9N3Wd88n5lm*R&cPo(Uu6ci>eA2vN(yx)cndbI*uvR5$e*2o z@z-x`D~9=j4SZ2UU8bEyIU_mY20@81NjwY^sLUYFZH}4$mvBoT<6F9T?vQ0*Jl{K| zC;c!E)u9MBGw$gbUXL$M(jFZ}oRNVYI0}HrAd6WCo2^?YVb7^FF2?dI29f*=uMukU zm@ZBu2;E4*j!cPlo>ZDf_4G=^N}Oq796L{oEOB6#jU~^9qqzoQG|)Fa5aQw#MRB)s z(W*s4H}@SmD|2Q=SkhfSOS;B(l)R6hEJu{JSeF zA0%)4w-j}>tZICbIDRxeYI9S#j|>j(PAmT=sTxJtZQ#vL!^MyK+5NvS22BN+?>zlE zc@XEg-f7P?oHNzsvh&Bez~h1D-KW1K=?fot#KM0oPD2fS4x02SnhMx`3jlCE<%wvb z*tWX?AYUtGxW~W^6?1YURDnc!LFwOz+pFs8Pf9eP zYICed3GDb6yw<;E#@SW{_@@$GowI;R+eb>wtZY3tT38CtV915{wMCw(u5~p3tzC`P z(LU=sQ$Dfx`L)JZCz?B1$W3AMW6bMy)LK}Wdc=M=kKMycP<6R0N@+*S>RqotGv$Rz z!b?rE?p~{nkgp`u-F3RrjuF;;r!K*^-t8*m98G?7gi#eaxSdYPwuff4OwBVI&$egOQLYBGV-dAE!Kg<)WKycm8W1~+UxCb7wS_&%2RD}rBHwm zMz)7IIs$d1fvgS(&7-cz%%Ltdn5z$Lmc@gkmyKLKt6pq6q$wu)BvofsbQh8hA@NUA zTM-f4+}1Qn3Z?qG!fn`wlm?ECL8_`=DkLPoCB9!;4WMWJ zUO##ORLZK2KLaDvlozOdFlhtVtNaud?qT5R;cZey45hkyvvkRfC}P@@y-q_&SIa={ zHCBsa-IUJm8533;tRqKl=|65b5CTnmP9GQO#&*+R#Ep3!2pijPJe(6l00jg}rb*2W zX34Tm3@c_$lGAE7(VimsjqPiBv*xn@7_XQ$51u}*Kh+ll0RzeD>Jm_XX^xdyj;*p7 z|0gm@U@SOe1Bv>sSr0N=vR-7%E4P0c8rH>j*T$ml)M%?^YHFCc_k0yt0i-mV zreSY>d~2;UBf&VeIA~Jz$ON@XgdH>*{ZP z6F7g_vAVn6RfEysqugCL>o`14!v~B&X#04Di~PV~JnS5wvW`VXi8YiM#UNYpmh?_tlc$1bVN@yHjKq|ff+R4)*tytpE|Wp5>7045M@z)w+cjzUnS|?I^P@??{kBvitL-Ae;t+JO)le$h$Fw1lPA zIp9c$Gs655YB%dF-r|~PPwyBK;l=uNOn@{Xo24aJ#cBqz6AkluJcqwF(wbR*jFb#l zv61tE3$J5w;5-Q`AyGAp>f%qp4+@d-Mhfa6;LQ!=83(r|Zl%&>%@aLL_iZQnLt|4rXBUI%-ZGTtLs|bhbSP5^g_+uDN^c98NlZM6ocAfcq-N6At8Y2# z;Uw9SJ<&eeE7eAg_SuL5&y4$XaSS#y&A^wFcnlp>Wvbd}mm;yS6Au#`QJ6Eb(xLPr z=PuL{ymKG}wHA8UQClD=!9arvRYU?~@cS!HPyH%=nxZ8moBsqMCy|+eX_@E{rRQ+g z?;M8(YD2d&G7CDq;w*wACdx}<_DpR+GJ$|)W*WRQ{sYsU(G##i#ZIxJPs^cA?1%|z zmuR3?$;>U2T+csT>@1z_72R0fA&SYW^O0YIL+K25+wQ78PK96uCt8~q)FqAWih8Qm za)heYZEUOB81B1B3}0OdrWPJvSP|5)!y~5^mL0|!TxMh{*_M@P3GoI`5NB{l7$J!f zn57;w-hWU5<()#)Z(($MK8v$y9q9;#8~JHCTIXLXDqmNW*IZW>*=+KCLNXi3jA*U# z8U-$bP?0X->U&e#CXD4*FP~V(CP9f91}2V{0_0=~&D5y3F@iU-8EC=*v>XNE6ql{* zC)hbGLax8HcIcSY1~oyIsaxEBSjU5unMMF{A!J2Rl^*#;7O3Bvz`bjiLB&?laqBp= zTbjV}b9LU|oVPSNJag-w{oDBQE;r6ECHP6;{_siqRmVO5-{GN}1O1E4F6MzhSN)yI zUVBJ3*mf%(x8@9EcoDq%Q@g46kz!R3L>n}@G_%00Fewr0j?7hb(+-GAEq#~Vz6C|r z9Mt)V!6~L`iM~&^;LJ5i9Qsi?+kp_!q7@giaos&S$=VlvstTjDF)<&n>&m0m>RTpa z)&~(iB@Ev8w6j6SdPodw@dgQ2+XPcM6&4KShmu4N2tw7}t-nPMVg*$i2w7Op% zVn6X|syOPbK_?-N%P}$2SRbAS{7`*0UpXbWu5jEJ0+Q#KRd|&<(^0OlXmnMw;csy< zK%UTo8~>&OBj947O#GNP6?I{#-V4|tRakc%Nv^_%Ms*{OlzRUXUJ`cFX3CyBp-5;WgF=NvN9m>P^|_k(-0ML*f+~X%!}O3*d4b4M7tE zZv+NYNWraW!bKa<_HE@^#mg@yo&~2pao$hKKRJyM_$MXkOrh3v+5>l$m^0HZP$JW5 zx5j0%L-ci6VXNuf(uJ=EVf%r0lMUpM=ppq00)Zbcbrs7;E%g=TRG zcH8Oh8mit*c|YYSo)#U4*BaoJ$c05c(t#kuOe(q&f`8L?(E>8H{-f@~y!v+A8_AFc zfdp3CU1_wLL>S*7U`^*<6*$0&cQadWdyP_Un`D(%Q7Ix#hJP+(5(Hy+a~)#sjB$pv z(N#kjZJ5tAU%1Y%ABm)HpyBQbn{pCpQ{hGDditfdN_erG*cCoj=}wI9;@z7T!z@GZ zDzYAjO}a;%YA-=kNN9g%Ut2h`7>65yFxfe3A9aX1%42`OT_NhU+PbGL)Q|s_`b>9v zQC+6pc9l5DAS%(lPsipl zgfdp2umxomTDY`}qps9?RD5-$g1XFp{?Mg98XsC^&=Mgsi|Zb2)z<-XGgI@CsDH$S zp1<+ncqY#e-=Hak4h9HgSW6f8CL$@)Beg1=5Gu98OAk6k*ATR3N{DUKL~PFin6`{%QWYc}!525o+x0E+vk~Z8|^g=g@4ZhvKztflf=dv!es{GmR zr?!G}mlXh97F6j#Fr;$t(j3G7{C;kx8=QUh36+-iK-7EnByiEnId8f2!gs}a;YwNR z$1|%6`JMKE*!=+fm*9(D1gZLBl5Xs)j_^||YNOu1mTswZbL8c3T*nGVMeweJ_*In< z@jR_RT|M7|V^a5(Zbt7){P~m>#(G+))7B}T#$+L~QYE1&#DYbj)Uk$je!*QUXOI9z zWc8DqL{Mt^&O?ZVxKM`O&*`y)uEQjOsr|jx$E@Smz~4 zkIAR!s29~+9O9}}cy2#HU+RxZ@@o@(vkAauvYel;f0<{110z~eoU&sQcYI+-!LzC;+83Ba=172+U=kqp|9YcQ>!3sVsF4)x_7S-q+1q-$ zg}Yn)Ub?eUQVg^;E_mFjNh?uxV|8ax-5Z9$MLyuB zz*&&E)KeW4k!yLxa>=)zJnu;mjWZR&lN|viS+`lp_TfZFh)$_Ng#*`Jsy4WBhV4US z*nr(DB_P=|0$CV`I*XxE;2hBAM8xw0Ww#K;TVt0*Go_N=0mXm#Uk8Pmb;@#t6 zc=#tmWF~o|9OIaVRR;|dx=1$Gk<(-hTSFOD`^LmXB2?N~%xXsO7mm3V{y1u*M>?L1_TG?gr8 zFs);>B4EDp64<)|p{4#}hOa;oJBU#WG+Z(vR**{81|`|ksI?*B`RHJ@W$cy^lOuUe zGYt93q14+*BLy92+Z3~w>jC9i%Kl!}2P}!+GK3R|F*MLFdSS~R(78Oq+-zc^PRf|a zHJF%0FtZ5nG?62Pn6~|@Am&MI zkpb1Niqfj#gsfd_QTRxhi<<~b-!zJlTuxY4(AVT8KFwBmm&?_2^v2#~*t3@wA)Kzg z9>3N;-rw5vO0O0)d{Hq}-GE%%!^Zc>@ycH7=CHD^o$r@oMriDWsZ_}gXc%gn-AzCC zN-Gv47WV6(1l?EOgc7wHn_A8!UyUA0$Lhzh&P=Fp`gAc)c0 zB=kXfh>i;>gCfuQ{X}ym*#| zc8~k1`hr*A+TA3nT`+)MeJBd0m44Nw%cVJI$9B&pNgXIA4_zp-zn2as0{#XlV$Ft+ zYg=qy#)?B*qz9J`DXY&VhkHuY%vKdOSj&lb9#&f!>+vD%MH8u70?J3>^qXZ0Ej7-b z-qD5NQ#)p>S$U#>LFMj^Qth5NF*-zIwvj_L_8qyv5f8FeDUoYTF1Iwk$fng)C$_!7 z#VZvKSaHbq8hKt+{M0~vOqSVxZrz)$v<%R!zJK|M1)Cn)lbE6&%E^2ihB#@`;S|LQ z#VkJHEhQ=K#{Z`N-74=U4x)dY13u?nGdkRJKQx`4c%=e212G-fZ<1wIcP_dok;}T-4H^moNiF3eX2NM~_a|Bvz%| z7O9@@Icb^zn`7(Z)RJ1#r)y_52auI}mRWI+JbbaVhUSoStV5fo6M4azs4pJVt1&e! zt)G-L3~+0;OES23?Afj|SNY$!!9-;69CmLD75j^BAcc86s-p=%jD|PHYm=*unuL+D zH@T7<(xK8DeY%xM35IE7E=F7}Wceb$3V`|{3 z>V5z$WwUaT)su130q^fal)E(DuhO2f6JyUs&hO1T3uckX1CM5QxjnwrTk(?*pLpxD z`7hdG6Yr(wR|zh)gBy0|_3gXT6GRWTAL%bV)x)kD%%*a=PB_tXo_{P;+8cQ8E_UbI zjc-kk>%rZEyVu*@Ub!wF%iB#)7bWgK`6KjVqiIP!qLB{Adn{%^!wVlWblEhlsNA|! zSD4S(?|J=CIzQlO+a1SjLK_Svn2qZ|Q^H~iuYMhjc-bKv)}L4J1aVs@xSQX@MiYy{ zg46|#NU7i1BQ(7_)IChx7YC)@1XiQ$(mmE>TW2|PDu7xoT3LQk-x()3)IES@18d4Y z95KKvp|h8>*+Gn)lokX!-${4_zRd>>dy47M*W^`)SOf$@6cx2J+r}jfVBw_Ac$#jY7CpgOyP+vPKn=Nwfs|+ zRz=oED_EUAk8|X0mEHY6NCg==+|v!ZqRz>kDxIVZtch(L9fp!6gx)>K1p*rrA75~U z53lw^^Y!xwouh9(XIs3N`|{tz*K~KfYF)p+q@rK=o&fra?g-iYaLcBc=c*zE0Impl zI&SUw8p^Zsy<+!L_x|_+Tv!6sKzs{GDuJcDjJ4%OSJhI9D%IE*ODtknxGi%J%bi)J zESVDtPzZ2Ihwd_lJ$}UbgmEpd8J7w4vkRSvT&S_2&=hiS9*o(OF^`-7Wq!U;VqqmR za!4!$Jh_xf@P#&EAWI^`jkT(%)*-*^yF~0`zxCOOMVp zuyiB205Mp=Mq2b2c9E$Z1A!PJ8Uy2sP=iGxL@FSRdv6sH)!RWqhMimvL@ME8Z4=-} zJBV=KA;}d88xx4_#mov#XdOycPYthT1%o9&@sOh7I>5YoL98Mt@!qr?!ZP%ynnA=Z z5&fbnk0gT)d;=S*i7IH$W+)OXmKSfMLN(0I422nS+rAB1(zwMM zl!m}1?OOn5AiAm;r9crDVY%nF z($_@6c5&d!G$Uh!qZEa&hsXS&5w)*wZOVsOCEQP!)}M&kH$A8uc`JT zBNKQnd5pR!_RtSR3Z*uPL`^J*$A(4(P}?vi8oBhUN$j(8OLj%24L2e|3J~GgL!n(~ zuhHcN+O(-mmh-@EpL6f~lRh~=8aUNvd7!vz_K~+olNfFDa=$9X9|Q;`9Tvttv?|4l zk9?&CO^yK8a(i;N`rXD%Gh`1+x>2)#G{fwXJ5Q;k8A7@)(W!Zow%J9aux{fv(JO-; z39W!XwE8{oqXvt-|9Z3OX_*5~zi!igdi(Y{`^@yr@9FyMMO3Ju?J?Wu$=cycmbryb zmbriJ@`F0h)Kx$Om6zpK!GEWD_UMVpXB`dOYO*Yw{Lj0p`*;RVsiZfOJt<_RAiK$7 zuq)Yjjo<0TDAS$XG1v0Z3g`H9=Y2$q;|J%zIUM$8GIXQ%{Py&*>zUir;Ct@gv-ck? z*ZF2wyP+E9%2X-LQ%%QI)@JxWWP`AI{T_)NQg}-qwEAZc@7+uq`yy}l=xhy5BF)_1 zn{TO{xd*e4TZ41vki&R$wg-Iud#Wbr%9C}HH$PgbxwjHf%pzv3%Lh=)w854z$CQ7T zfO5$>Z3!4S3os!A0%GMHIuJnctd&W*VRrIm*h1Q5mhj?j*u>d4Rf-V8wvGM6P4J*84;zixfRf#%6R9ALjd3exLJmra=rl-V+!!CK1o_gBjOAZ zZz3om5YG{b8AS*hhk%q3=@zB3AplXr9J_F>y&q@!PMt<}45FcV-1 zK})juU>ZKjQerk@*;_apLE2aZF!83!76Q|>#44mJI5b9Pz?NIoZyUnL*59QwG zyg%v(`GY-56jP*RAt@iM6iJ&pckxG$)UCofP?xm>5C@8WP z8c!6*F4Y1Q~RL$BpwwaQE54(h3Isn{LtF^3NtO`jz)ZH zHef;_IFS-k0hmToU&^sOm}>yaDhIU*NLz+ktk^z4fxcZXAdtm}Gxo0Gf0TFWJw7v{3NSWWL%G;3Mj^(cL`?p|tr z8AflVm5L&&_Dc(Krkt@A&!oATS=o@a@Tz*lsB>K>N~xqo;Q*2n+BFaN+`B^#_H^+A zDqD;<>qMn=Ej3+MtXc_PD=U`JTIo3#sxWVEO|7ku22hHWQh>h2S&cWsS?a^&(d~Xd zJ^%c5edyztFKFPssnN(Z{H3-6-mZT5y&cCo`>135SXF-2*#;N$;$F?Q07RK}fE1YS z-fQ*lFn^Y^%`v=ieeWUwEoVs&5^HgxzmE>bF`xqkk8m56%I5v6E|J#G+D3k^tq!lT zk8UnK&e@MLrB9LC=csFSf18NCS??{<+EYw9%{hq>-&T8let-Y_-_wV={;7gnDM>0ge?*LA=I4qoALbSj(IfBjM&eE zQ+b|8KhM>EoXm6ioFmB|g;^JHc|mQ9MKkn`>CFWH>T)KGDRt|zjh$QKS{&A@|Y zQ5vhPM1go1-kqR@Y=(i2jB)-90fn?m$hsSA#TZlB0k#ggjpGAd5mBGXuB&UPs_xl4 zX?yv!)xRUu#v%aJiUFGx=z}@Iotw4=uuNh#alw%Zr6=rJ3s3I~OkD#_%cVlDwPZyR z0ZAB^573v$OmfCkf&{X@hV-=zZ9Mz0gc1hXwn+k067&ZDG!qh!3M3-=;vMz zFVUjv*eEy%fGb_8X?iOS={d3DM^oS^u@+u%{%C^WoJd@+?+L-W9>l^!Jm0*_7m9CXY&1oy8E-A=9NthvBTY6@7Lz8QtX0mwj%s|XgEj*& zDWycL>Z)$r!7JO0(0D1OMno+e{~F-2);6y%%{Wr32^p)>4#HHezF5w zOy=BPy!iV4xJdctN*6ktg2ZuZ$JxDc!SpuX;%e`-fHiMv^3(jKc=#4dNL-^e);gPU z#~lVS`>6xd&5mSjcqc0x^VAzv>YD`6b)jv6-bbM#!TS3Y`*oclLLXdA?1s(sE7Kia#MdYaM~F9~Y&@F%N@o-w1TMS?J$vg`ejJ1$gjW%)Cu04MYAv zol50=Ph}fEq@1=iH)Y*yz@^#u(>%G=PM&7xP!{$AQQ1;L`#G!p9#7ItaukJKOL6qx^qpo0df<4G@|@2%vJ0 z#?9Gg%ZavBVXON2gstPAdT8yyS&W+r7fix*#vMsq+t}{b>v*+}d880E@3P3XxP1#@ zKaJnM;NuV>E+awvU*b%#-?$f_CI0LF}q{H)4_6QdS1vu}}p6^6kAJj`- zNCWMgTi0du#hiQn#1;*BJQq@ws4lQPr}+oDX{mchZI&W#~%TkOuVd8b? zxYAxsj21#0)SmIkj*{8c+uK&y&}-0|hqlQUx_#04qh06^czKs^R5aGAN#oI2yQQhl{yKbbFM)%Pf`F(+(&M#2=oznj`vEq!mR=aYrmo5ytz8!2PQ{t83Dg9>>^xBrFN zQC_aAz2itS@AJ%#()Jkok&NHN)i=`C@!Cctc$|P~BDh9@ZXUqx9{TM#++?goQ(&uT zZP|rGo=YjrR9sK7&UKu=r)e|sTqb<3QAh*GR%_`gp!1uBZTdBuJJCwLg|tl~SKJ)- zrgukaK)Z32Ca|kVY4Nh|C~X$p&Il@$I z|XzyHsCAiKOD6=QiZD)vRioLDNC9(hY#2X`9%#h;j2~zBVR2s=9%B^=`7USz@fl1TzL#+-h|0UfD z6pbb=!DM{-@fRY9lw7DV;Us(nh!7}Bv{*6X*s$Y*fyR|J2UL!n&{?rW!NTUo9+NX$ z9G={H0Kg$(A)uH+!@x0N43EHoq17VY(&8q8HA>VeP^?gnHzq8~Rz$59nT1~ZbewU_ zsG~-l1=GxwH!oa#+WJ6EgIM9dd?}$786&2crMW2871zx>@1P`?U2w@Y|GR3=j6>4h zupq;02k6;juXr!Ka>QY}6cU&tdFicpR%!rdgor0mqox3BcRV1mjoa?Y3j@_^L(_vlyB~9e0dbwE<-1~xw$ek zCuO*vDlgOCo@cLpUNF%;R|q*aP4m5OM@I*CJj|ZuXtPuvpA9_+?6$)SHH1z_KA$QD zdWl6v`6UG@qX#@R%ZUNpX9y2ds|Fe`>;JcR_E*M&xvT%JJF>}xrqllPZ?AG5&Q7;w z_uN()T6w{9EZ)k0d2O~yRtugi%PJnm{=<*iD>M0nuk@?$(Nc+4=(p4ln?+gpj=wk0 zW&A?AzX^xDD-QLUBmON3oy@MHUwZA2$FjfJkzR+|wc<~fWf^ytOFyKt{MOE5Ppy=t r$|JW&-Ntr0t+WSoy$Iv_6k8c%9JrR={P%z54?Fn?h9Ntv01n9wT-eOF literal 0 HcmV?d00001 diff --git a/fonts/noticia-text-v15-latin-italic.woff2 b/fonts/noticia-text-v15-latin-italic.woff2 new file mode 100644 index 0000000000000000000000000000000000000000..9b83b0712894271751c61c2129c16baa44222e3a GIT binary patch literal 17356 zcmV(@K-Rx^Pew8T0RR9107J|G4*&oF0Fx*H07Gy90RR9100000000000000000000 z00006U>1vD0E9jWL33OHj-{5+&4h z*Wbc3W9)y zgd&P!qJo)kVb;H5H0J;Np}t~1`u}qMd%*)CA?h>!Jl|ASZO^`!Q_YZdiK6)Q_It~Y zvvvoX3!nf}Sbz)pE5`Ke>o13qB)8g}Zt&>-W3HCDgh!a~)WhKo1LL&yhw=(~(#cu6 z>8sYSA3xhUCV-JbkVa8NMTf$kMYT;)xL&yf01y%u!2iHJOAaG=X#e}1rrh%Tl9jNg z$`T)YBfPis{(s+=HwrshLRr7$>CI_Q;jsf_UIHgs09K-fTdTpgs8KS!RK>_)fF+flgh54Z{cNyETu>deL7FMe@%d zTJfq%SG$xcx<<_ZQcc_UNE~J&`_RQdJwipIhB{99ZS&axDr97Ox~*+1lckHLFPgJ9eVrpoXH4|L&D*Y&DBsf3#Q3 zi4r0#h{{Lw{czU5^u)U-|7T5V5Fkj988Q=T_d&HF7I6R>9}NyjoSgmCzX}rqksQhq z0@+~yGRWB=p0#(p>F(*QW`lYf0lH%Ut{~l(>QmT!$e#N0Aq82;2sT#;(wF^&K*8oL z7&wAM6ahK^hlGNHE*dbu!@vUIV1dQK&u>5kc+MqonO`|`<-(0C_qrj@FWiw3kxN3E zpLw7n^F-lQD%$+S6P*`EX_#{c9SZ}yOy2V&79VVWy!qEh!2G~hAU{F%7d-zHAVeUJ zAfXKwHs1>ojw7O>xbvMbk-|lb5L2$$`BtPjQQ{koH~$rbFP1=@gvJxjfAI95NIP*m zNKQIQbxG1q)*i`6z2y2R+D~~fKxL4+Lo|ECv_|NR(sxYC&N!n9rcO%Tnv!N(x)~Xr zmANq|%e?F^$XQ#IYe}AE`CU=CvdU~tQP)|P0Ez*X0I?RVbOE9aRC!@4=HMzJR6(jK zO6?3<9gO;JXqej6XiHPK&6(KIY*&jtbGxr~>_D4C?LE>la;(#d`A&89O!v^a9v6Ch zi8g>mhr@u!ECH*Jh=YV%GF}e_AC&-&uymq|L5xXK7HPpI!y(6|D33DnsR?K*qzxiE zV){xL{z)0hn8=x{VELnDrDCg^{g;N5mWz(NdY&H!UPiu}_`jJ2SOi&xY7_oq7vT`C zQ~Z-lf?JYDs$S_2J{f-52ILBY@B}04#MlDXu zAm~U&DP|hY!mzR2a=a9tPY_fTCP^Z)m?EhvP0(a?c@0IJsbs0ynmXDTSI5)WH$(+S zp-E(JY>7y%GFx+dSm98*wQ>)sJv5$LuXf%+y^q1SqhG+}GW%Ns9+18bo1aI#W9L2l z{>S0xVIMg9$jJ<7KY{)H#b;Z=ON#qe24ZwOlM)|K|kR9Oi>^Nby64l2w-hS zI{WllzAi##&sCsEJgMgTnNCBS$MSqW$VaE(sqR!V)r-oca;Q;MVf|wL`QYU_Gz^b8 zFT&5C2E-|XMBz&__Nu5Rk5&e$u2j;=hfpIuj{}+iK@iNq#xCvbli4e?>C@9|ET(DW zw0`>Nw0N379XpMDdh2QPlfRz4c{1?CLO(XRAZ`QkfN_v`NcwY0iN&X*XOJR}kx8ln zk)lLPlP<%cg%*h+kSR;HA&Z4WZ~y}Z=MLZ~43;w|_Fj1j1qlO$gN8@o%7vSwbQ%V* z1W>%Bd`p3ifLKrL56W_Aqx59t@CaJ1ykZKnDW#Kvair=+# z)m>jUgLg;#oWJUUp+d9oM!9=ITtF0Fig-wn7a-1KL0v!<>db0trBg)V>T8{=qUY&~ zJ~K1icIOuFZV=4u)n%O<<0?;<-Z%HApsR>#A>IvEdP_&W4YG#67#H-qU1yDLVt82- zT%{s_nF78U+oEW~1C;!N&#)zaUUj5kO<2w&Ze5w071UKSoyT{n)ROUXQ8$UF`}W~{ zbC$m_ILuY4s53(;zdUAAFRx6JK!T;<$-KB#uyH|eWk3Duk)d zW@6ea^}Sgf`|X-Z>>*_qS`m3(Re7K+8C{9J8zDqy3ZLRNd$#DVSPpj~OYRR^TI|=b?9RhQBze zG#;$p@Nx@k6$a6^7RP~>2qoU2sL*owY)|$Mhqu`&-oSDB`;}CxFLZrj^V}*Z)aYTV z8}c=hgVoD`hX@JEfFu}~Rd*ACN1~Mws_OS*ib7mtEMrUzq80@d!(olUg)yR!`L~Qw z_Un4_)&K#N0jz7ABVv(Y?PKnxq8d{TDy2L>wY}f;w?`XMxS>!P$R~snL>xm^3?eu~ zf@7J$RS}&~FsRNnPBy35LJf5S$!;S{x}p=fBI8XVV_LXT04jsy;=8tRl{&%;G$csw zoT^|6>N*M|sPW5TTeeg=1%I2KSeZXTDWXX6&m`8`+({_LKUAi z>b^}xfXEPtWisOmf|S@Bh!QnYeJhlgth;NhiWgN-vC1A98&@*U1ilytVJKUf*EMyl zO4-7CTw)eI0jC^FIBA`d>}7@%e+F95W$QW#tcwP$)C7Ke|GekSjA4<($MdQV8LmGt+5>Qh5B%4$JE1q z#f$>U!`xy*7KM0^=EVd9E;w*T@v}geV`5OYgS`bFs?@W@a&i-Wk=(2qGugGGwYBBi zjl^c-rwAP#~}k=Ku2&IJIv@Tho>>Q{#HDrFv1puFgMqX!IQzy zP~h+_iWMZ2ff7u`_YcJ8p3oz2-&Sgmu_Un%uPE@NZiHIQ7~$P%TmAdTh1>6^kdK9b)xG8-F{{NTVs(#4i@2>{n-{ z9Yba|UlA^y1U%{ULZrbC(5o{IG+ zT|2BTi*3qhxDQCUrP3Nf-3JDVv?QW$ZJd>hW`ddF#ofZmsK!(w^MaE2Ovf~Kdw@r< zWDsu&Ponm_h%#yT$ukGOLaJ_57 z14^@a-m14Caae(Y;4#$qTHxEPS0|=`3^&t$rg6O@Gh}zL&A#lVng)F~#QjX5SCA78 z@zhlc4i}nZ4vs|D(b6l=wSb~E47-*X{7EGV4%=A|5@BJIYe8G@=zmn%A9Ra!?JX*Vc@+LdTM4Eb2A$O0eElxrgBM5QpSX^kne4Z6d6uu2o!cq7Vbsj*;ZF3@G!ph{(!VWm@AfdD|;s&Y= zfaO*Tu=@}D)+CwLW5q0rudtMq{dafcj&3_?$8FZTvZu>-J_Crg^|I6IU1n4bJ0bqdh)8+(+DzS_8xglpZ0{S0`ByBZgzGQLF=25TpGdGN^3-w42H} z=^~ASDrO=SWlL*lW|Tmnrj)^BnVC}93~QRkC1q$Zm_ZcCR03fwP zszhKclYFPLsg9~ZG@7$j0RF^g{-%xYa5$_{ECp_woH+&w%I%r?DJSi3cpR^$Sp|@# z(p4|kQc806n}4_dJ$OH=UN1zN`pL?DG*ed+Mh=x9d1hm6_pTrurmH8(BNx+VqhrhU{=D92< z=Uc3y1sjuFHWg(a_c_fqPuS$9ES!ozP{|A^R=Ln7(!!%zaP==Dj7e5j)(!1<;?(w!`Qaekh)xjIYE~1$KgXwhE zI`jp8OJ@`00@}E0M#;N|D)VURXSf48U<8q?Ix2%D z4sJg|Txwt7W&zLd_Jz#K+|Zm46c9U1B5Wt96D!D(?{32_qsQX#vR^)UW30{pjvxLT z@&8KuXh{7}x%Fy&@*enmq+-5>F8tqC<9V~YFQ2anDtY>P{E&B}RCj)1PJiLkT?AE>v%7{^+8 zm;Go#n>y8VE-uU;uRTP%>2{R%70 z&`RPfpJeV4phl;8MNsP;;vlOz$#{NgMpwbpJp|&*7Y*)HlD$`t{QTa26C$t2y6a4v?I2_;X{+_f%=n0v3;SThN7|1 zw8_m+DbJDVbOaD{dEL;^?~eWn$yaa{RaU!DUlsm8uB)LDl`p8&(B*EyGj?}J-gs%q zGEsS)c=aUh0QhIU`-#AVdAbAZWX-ywrxqYEqFBusKJN&=Rq-vO z4^+k(I?i=vZ>%{=y6$$A_KDzgJ>`bKmV$Vt49g5SfUa)y_$_igUA}X`xKM9-YX*XX zO5A>D3j}AeHEQToZ2jGIpHw$rTA07B>=fzZr)RYPUFcUrtY~H0uKEx8~3 zvz~Z5XkV`8;2L?G-dt+IMVzd4ck$s}02-~qow4my3<|F5x!cjyre}kd^DTY&;p{#Y z{kmI=eHtXD3nQj>T^?hvM%YVD0O{Ab?#(0VJ}T1rh`%j}9r;TzF(ca*<1$b4s)Jgm z4J8XFo%yNG_f4qE#A$klUx8n#X+Aqpu(RX>@wD4fuNi0G>-sCcCQqjqoh%C3`(DNo z@4v9sD(@?(_AOU+4zi^L$KjR`3w(qLH_+xJc-^1iu+C8Oovo)=$IT(G_bW?sS?C^d z*|!5}goXO_gZoB9*>Vq#g6$FEokWUAV#hj$#_lFvKdE7Ra^Tv~)P7t~*r3A4>a)U- z)6Pm*S+vJ>PuhxI$;A5ICFbR*JaECg(Y@Mb%mA0S8uD3q8X_bp19*eKW`v346&ngy zWTo{Wjkv~#t9Gk~X%yFYYU=r4v~XX)6kw}pLV=K}GUGy^8>V_dKzD_pk~`g+E66K< zsCyVb1y5^K?0CPl%mad>rX%@#iZ_G^<#rV=w3~3EUF~{{2vF@o;eZ_k$6HYRFnPmk z(bZz7PWSp($VVS5cyb11UmG5VdC8s&Q`^iHm6x;#KsQV<=j?;ZEjG6nB?f){+K)3s zr()Z=@3?M8hb#qhnw{0F%T=8*FFM&|lFxn90j7jZ?JHru-V>_IL7EwXmHv`=rQD!37&J>SZ(jfcI)Oa9YQ}eEkLIC< zllh0d+|tz4a`4uPK3tFgnSVB@cNDq>zxY`-e%ck=*H*BW$??#|-hpfH!tk!78yhc8 z#5B20`IU7nA;-T7>_%n7gq-7W?Fr_~qo3CWX1mt1%3d~maLWb1V5+q7yDjA)pj+pp z>j&d`k5=*eD5w+4z|}u_!)I~@LIbo8_V+KBdr$XA%mFpwtj1GCT$ zLgo_zl+o|<%6VwHa&-WY9hqgY!!N;hlBX|zzLd}ClT!a0ha>Rtxk_T4D#iT{a*^|lqdr3#;+xaKfMmA=jIqF?Ph0|9Q z4T6;6jg^bN^AD0FzKq|+{b5Nzd=htPe8denxM9W=9lA)s=*& z6*IzOK2bHfQWTsD5rTQ~wIF?3%o*uABgOVo47FS2vg5>|v8Y<&9~e7>|CJ9+H&^M3 zNX7zWs?)ymNih71q=#00t}4aqfn2Xt@cZ=KrBUGVrM&slWMJrwWuZ)A@Oay|f^d3^ zrF2S#NE#i;zpFcdDIDO1$8D%Q5H>CWSW~+#;6eijJh?g~BIzL09brFBAq!74(v(Rs zNE5Y{1E-+9^r;=9$eDTkc&*HkUozX$y(RnfIv6cNk?d&?5TJjO7OWf+$UDQ*MoFSVN zS(wYp*_2=8D@DL0H`-$(`S0qvT`oJY&5Mr~`BdG5H-do9?uYq+8s6HagG ziwfiHM>zsH$0@Iu{j*K6*ayfITtt}*?u=A}11Y%Aa;4frXK#O_IaofbTtF@qPG5v% z$)7#})J$K%DmyH9bW*7Fy{oqJ_jJ>ed(7_)0RvC0_Z}qzYDgk7>>M6oGsoDgYokcr7$>bf`}>UEHj4} zv2%hAY?}8CINt~>Ll?}cDF`lQmjvgq={WWw6Hf)BmMEy-jz<$%3YTp?U-wmb#yIDP zXJ%wd!g$HqiK;Sh{7k{sJ?Q-_4&WCbfSbg$CxZw){og;=gY?I%-SPCt_s8&*8F7SA zla#*QkHift$bpz@7=My$fgWec?cPF$t$z@UnA!7aB?-BJGlTiKaZIz zFl3o{p;TIMjaCuTBAGY$ungXA^3581>! zW*V^Ol*d}hHy5Kk5N(j4^b@-o}sO`f$C-V-YpkA^e1jaAUjR9$}p??ZW+cGG|k+M+eEv5%$ylU|_%$ z9Me={U?qLee-tV<`h-yq5WTY!ujR+k~#9x>{)VXB&^3AIZD(_3yDHT$z z^{HOD7(RR9N#g}h8bR7ZdX{&YZewu0`H+2Aj`WKypvXm>GMECUbgha@%<_s&!{%lL z89ar;z(Qz3tE*8jcL`t$VH2NzQQp+j5q4u9ozAk!?Gw(cq5NR8KrRc5zoy`Z>0PQ| z5>&o!w6kzmXk_vUC*1;&`pJEhU-h1yKKq&@E#ZBW5q)(|x_;2}-2liNBsYW0xpvA{z0B%kH8lzk1UqbaIrk`?*|6Axp%U|zf z%?ezGE1%i;I`(@9X znwm#~;V&L#a;!P=J_q1iyleJF(%Hy_Z!n2?UUl~B$XxAQno2^o!V>$qg=&4SfXVkL zkjAIGR>33)wW7bha9?D3`T#p!#cD#RV1no>V|uCN;5R8hKm!zpW&*8+{npqVx+Km| zug(Ju9H}vm?|w5x6dEb4!IJUS z;R+oq%wLajZ;FQ-(3Q4(yc_lL3H%Iio|0AJn9rikbeWZe{9QoUTL>jKYV+u(B2l`i(llmBG|U*nNec`Io; zzc(JmZ~ETOl8S$(@>kOI{uDwzJ5kT?sF?sW!=r3nMy^uGg$pi4hdh{Xkqu)>H(Q8T zvTY3LY|PbZBchq`Wa@kvd|!Hrcoc9y(c*R_*;WEKprAK;5G(l}q8b;#uXuYGEPa?1 z6@L+etG`~!_B)jCD36NXtZq{~NO#c^8DZ-%+MFd1@Jh4Pbpd={aX_M)S~@ToZ}m&p z2k`h)Yh4?s0%W>kD)lnnOQup`WZDuc^$JLnG4>@7#LGoV56x3iVlWsj2B5sQuU1K? zosj97TjZh_P23oN8SJ3rs4f3yCNd3-RIiDbb2GVr#CH{qd08X@WpJ4XOen0*$*EJ0 z?efVarNC7JdcUZqE_EWJ$k61SB=ShjrVL7p>vGp-XNIa8*4D@I&YqL7jwB4;=yBTaA!OS6(?*$m-6P+H)$>#2MUo{C$UZ=Cn$S?XD<$%0GGKGO3cNA6Ftd+$+rlF zTbhGQ}$ktU_WB>Z_bxm%;EH7#zt zuwn*Y$^1}wdr6X0ke?iR!S(X}-P`eUHCzQ*4x0Vg{9z}aL;2`VYQYD$pi_50vTCVU7bdsbsn5?bQZb#$6;;%&RwZL%K`joBQzd{rv0eGj-UAA5SgYN$! zUQK}Al-#dLr%LxKh6#|mqB@yh8aWrr2U=e@pVhbHA7|!8*`?mEv)`|D;Dl)4zjGg~ zZY@3Kl|mJ%6Fb#e91)`=Nu(p@Ekx>zTBLy=-SrK5VcA8}^}e;L2K=fYUeR`G_Y2N+ z2pxSm8u)paEdztizXHb932{~8k{1&1TH)!nA&P3FyFeIUCYJl{&5xeD-Y2P61$Ljdh`4e;J<;C-C23Y{Xmot3 zTN-334%!Mdp$d$vx{9`i<$S!MFrl3>*be2M3hROZc}y0{wdrq+`X2MP66(*hg?i zh9|;mILA{mJA$DSaebL?Nnpyorr#&fX7|CE6b;KeB#lUIml}LtR927@+eR}fsojeB z;>b>xGA7Sc5Km5DfY7DRAJ6z0vKdnfS2)%NC`?Q#wKI1(*YtY|%YBfzr4|r%>=ZC% z0?D{IW6khjVnYNGD4PQ5kx!Z`+n$rFq#uMfKCH& zLnq0!Z4nLb6D#T{VkbU2MN{KR$>KIyUR5c_`_7H)8HMX<@76O8`QGeI;C1R5kJ`%H z7`Wrhli40ilG*TvszOfBThEvAxUB+M{WQRZ)p;B2z6~d3P6ebibh8(3+s{)PzbAt9 zB!bj*iL{@5qPZXktl#`X@cEgs2F7%J6iSK-G|niOPWMaG+MY(R5*v z8Jx?#M@}Mnw`~Vt^<6mpu%)ZeT@CYE9=f;r?P`-pXU#>AG_vS*?%09$xr_kmIjMz~ zI1|==(0kZ@@L!xvP!Vml?SyN}DmE(>c(+mXF%23kDs!)R&R(@#71RsrQ$3W)Bo-+) z+C#}^V%z-p7nBc$=w!VV?Hwyxwl9(R`(|c-$uA-E=0sk@uWVdRQud*ht1>(~V+EpG z0GxB?OcQ(ZpRNBY(@D1EHMKJx8lz*WLHxq`8ZdgQRD)kFj8a&n67uiq7RHn zo$=x+`#Zj+QhUP6w`t#W*q}fe-YqjVGdkN;P*Hr|es6?D1ZQ6O4X##-dKwDMu|^h> z9_%ebEc;`n^SIOjZn(!gimR<4xXHF*3bwwuXz1}UmK)M3d?c}!`MH=mJ}~gT7Hg`g77Y$!xBKKc77!0 zyxjU28SFNs=RsuEgfnN^`TzU-05=}jU7K%TTII3{Y0@s3ld&R5caDLY1d*MgYWR7l zEpL83>YS8bh)a)5$Y;vtiT+E1JKO(FP{~s}iz(59I29+&lapM^;-vv2=yJEC=yLV> z_TjyTif{}1o4>ptgz1jLbORu!@YPdxa}$+kGe|UT3Gz`g5+mb;Ki_TiMZKRUBrrc8 zIr@_O;|60Oa{!rME^nWCkT+eS2)Onjv8v10k5_+2(2l(y%BKPhqEAcj83udq$tS<( zo!)+WQ9kD}vkB9cN1hbvman~WW%o1cG%B5iW<}n;uB-aE8QZhwNwimpA;D6&V>xH$ zaB_+H!AbJlKn+mma-i;HpqBN9MS;!N&OXt0wkG3g)ME}z)d5Lv?*IlCu5deA zPT6|;kGv(7TEc&$nV#twXLeVe<|0WlH(tnYlm*)fw6YFoHuOZQ;!|DJuyN6;Dvxr; zt^094!#;7t$HPnN^T`f=R!8nr65vXFKbf)ihSzE@YY~9`Z9lnRiHF~cedK6Bwil6U zpIve_s{%p+hbz_*XVV+xA|xDm-BkyH&eXx`>0G-0YYK@&H-Z_Y3{MS-4}zfL8i`y3 z3k>tr9nn%ks75e{l<#RIi9j6Qe49YF!aPn-_HWMesp7{nOZ^v&w-)z~k7T)oaxz_( z_HJmi3d)~zkKy}PmoMDH5A*O&H7heH1*{s{QT&zbsU202{QTskQCoo<;i(&i9;Wco zaZvGfCYzvH)?jYhWjWr9!Jm5G6Ch=v;O8Dkl=CeBjau{KiNUU5pqb< z=`IgCAGQ4ccHM5|Wd$}UwvZy_dFP4Fq~uArx3z7T=H(SotEJmR(A`>)+nW7!V&Z95 zYb!!jXFX-I$fIv|tA3Slx3auk+3mY3cQTBNUcspl-uEu#x84&?p4rYrg zB_UdU#Bt7b394(=3Rv`65xVPRmk8Z>_axUDzxUR-cZ|Cn$27zzIlgiWV`Yd$8LY6d z1#W6qMhLpEZK3pV#!VveCL^4_xFD7>6&o+z1U_s%Fnqut=-55;X%x-om7YYg^kyK@I3b-KkpYBG9Qm>J-qGQqJo}Zx z!AT5=AF}%Q^*q8sn2QWRY>r}Q^};UW_jBYK09(M$irTPt#ev}i@P`AGyS-4HXG>2d zNVaN_`c}CD?nY1OY7!7HMVmzBynqz<2sR(pbGf-}!DjO|3jV{oy~DED=u$v*O$c%% zy)#DJF%A8C!_6cQf(u+CvwxrRVWM`0v@UB@V9~(qZu)HSMrv z#Q^fvswV#wex#D*!{mb(mFWY%Mjlt`?#mK@mq1>%4954DvVi>?_DxvTisQ*}zPHpL zRWQ6^d_iT|-`L0aZzD#x*aDWyp*!_fkD#O(`m*N)jI+v9es2EI6A@!+zNm z$xDS%9h|-Le3Z9kL~r_U`?;bzZ`B!@n>XY6ctoiv|0*4Od&9nsQL)jLjDkmW?7kms<2Nm-bd=Z@<`eCjN~T!=Y8BmVA2!Nqi>Gi zJ)9G?7?p<=Aya`itIIHdDUqFkS^l8^pJUa5OHtWE#6K@Z@1OW&!Y-|@Cdv7QAL$9u z2VDI5Uv%kP8L5Cn@H}%yzM~7&9P%pW4qZCDBrzopAC;d=tZ%ml-_|;;F#p0jJI6m%@2G_6sNyO-gpZ6O@7&+pl?G)~IER{PYa z)?+NC@WgPdT$)1<4^_Ala4B=MnuCkv$@#vG;yfooSDCXjYyZoQXSa^v6G|48tsTiB zxH#{h+H~sh2%eu#-A}j8ix5n+6 zUBWiI_zZF1VV3yL*x|e4f8QNveNP;#y>TuSef$)KU83+q6wY_rzu2*}^(Y*cy@~Jg zx^~+MyY^%!-o7L1d}lI!SJwLOjIBKxmOu@(E07QcGEad>!|@CcUYPcZpY)AG)_*7e z{4r;8xoW;?N5`%V6M)FQYE;u6pjs2ZgT>auiX`TZA1YRdyQ)!(VjSs99H9dOFo-$n z1DPg!zz}Hmhi)^}gjttaYFS7XFVij3grx^35C||p#moZ{t-%3u`DQ0bKf8Q^2ov<4 zYqrVHEw_kmsg~3*J_HUNq%MOsi^*_-pIL8DkQe9BEH@0wGAo3k+ld=> zYF2{GYzZjadqdlNN69xh(99Z>;D!_+7Yb!k0Wk%^e7#|I_w*ffDuDnX{z6b3Qa6R? znhUEda9V1i6;h`-3|EFX|1eWuw;tlAWEPoc7wEhqNYfI+nb8Yujx{&aPCBwC4mN1A zoQm`mpLv`!VDOHnWhu543`Q~XncXiM8sAvo%VPHTNAi%-J?7qI$Jk(GqPgdQAAps( z5F#5q5)S~IlIYg(@Lc;HSsEXh@_nc)M-t{C9_DUPjNgHUxcKP7IKJFRLhDm^)9R0XKUKnZ^dhJjSoLQ=25+|(V zn$AK8h+cc})`#FGLQ8@H4h0;efW$@8=4n=cOxBM1$2#5E#$GJKk)inw`Z~l6ryS0u zgX81uB~~auEJGK8A*{Et5fXPh(I~22256?paP|bCAX-UF3LQCg;aQvTnr~~1Jm!RX zz~*F}=wJ&VvP?E269e3BA+$Po*|ZvvSGZuZR%mWy3KJC4tCYh;-YGeCtm&?DSKU#N za1FQ(Y!?Get=Lk*&HYYOSY|;Asqm#`2tX1Jdy+09 ztheHpg`_FGOda&75Qi9G6lE-#G5Z9g5{dVTAgpviB;i}r(jtoz=75<>TVmjF!=Z?O<%P%l?ZNGO9?MBg{_>&TpUmo5KbUm zf>?mnx`(AuFV-S8NSaCk`OL;8$15WV+QsQ0Q>1w`NVKsfECzTXouy%bZ4?A7)+!v+ z?9lktVXQ1@8B7GS-Ju`jJSeVr{dM89P3&s%P4aP` zyP3ukj0)gv^zAr4-FSKk=hlp;8@DwS!#c0m>t-gK-ql}Fty;6Zwcl?m8kmt|(C_r; zk6xaX?w!v(>KrZHlUd!r-7~uCT~l^FGgaA_S&OUXdk~JycS4WiI@UEbX2uh z)v>L>I@}scM4{T{uVWRK`EPO7smivynJ$TWT7Oy(ZqAX73?ic7G+&5@U9A8?y$01* z;krJ$#zBGjj2Z+I|5dZo>Q3*Q$uj+Qh@sPBE=S8FdM7BrU4 zV-Uh3frBZ_t4t2)Q2?RN2(E73qwJQt9SaNB0*8(`P@|-_cHT}(8Z;!<4ncm8@2CG1 zhU~!GvgX#fe2Hm2Yh{H=IeiIjCCK$ngaPZ^% z9)g?mrLV+Hkn$?u*jtZq%ibY}<}NUr$BM)JGvE^b5tZ6a-JX{EiO;PEt-qlrNmCHu zStbXhf_Qz<6u|EH7b5|C`0}=BxUs_him5W7OJJ$XmhnMCc{(dJz^vLkQk={*51K?@j&X9?g1`@rrXcHS{N4%F`;?0Hh8XeuD8K_vb0<%^q5}?`$25r z%qh%S!};<8(-Rw`+o>KN`~Aqr5ZZ8173-NI_8qxV7O(G@*;b2O^^ zrz?lN)BGmr^P3N}GeYlBJtCpt$46DxS8Lq6G`%rL1Z-%ij8xnwL=y5*NGAwuz4+Ojt-mEVNQrDBG-bpnk81O zVx3bnDY$6HPpwbrvqPL(w}dSpG2xT>D}b4Q9l#s$4c@~&ZzQY)_nRgE7>{51*J$r< zeBpHJVjU^-ha4nc;vW7VmhxkG2@N|+F%!TpfdHgG|?scuQN)e`@v-l}p>I;{+fW2TFu4SXa zO|;9myqe(SafgiA<0CXubU^pQabyTo+g@j=rt0HFTzUy-Dvfg+vcb`mkpo6d(fS3o z^I2%UwN@UFj<*IZGrV~0v5Pab8wK(U9Y2EZY^XrKpbzF%E(nM=L6h`M&?Jf5PHrP} z=>Ut4!53OTIU3dt4n1i%oX>s6oKKfgD!HJoIaYgO@fU8NZ*vPy)&?K(ku;a>k*yvv zjmguv?Yyu7<*#}3ra$}I=$)Sq=%fF-j?cQd7FtZ(QL%=S#TKfw#(=O1pTnh^SLYIH zCX>~94Ad4WmjfbhGkSU5uH0%5Yed7$I5D>_qJVBG0QB%TcyfQ`j%{_Xr!l?4--nUm^T)891#z5>R`w3Xfm((znZB zCQ^RqSu7t;a@2>S-Xc_a>)0U2Ak$`h8bYVf5Ep(X5-FqhDPhFH@ip?Cp%n4G389xt z7KCeeN6#q^V(B17(hOZKHUjLirM8d$Rwv0Bb}2&FdOf?iA_wDL*Jt++ayw~2XBXZt z&1ptwc9Wj#N_L=iRd1t_8yI^gG^V1Q&-ko#ceH@^B#aK8>5kE*uk5g%jKSSEKa8+o z!_md7rf%7p;Kc7ZET>@qNM&^0+fYxOx>qHoVHps4?0GlLESZb_2ED1Wqfog$?f|J(+ULKk;Q7I56RY(YUboH+ zDWq>pIs=ygrqjC19<4*;##JEg{zPA+>b%8-i#Qw}!l)B1v(}WS+LEiFO|pxi5iW@k z3JJrBtx`aQo>+<)?8nSidG1*FC2_j5{&`^k$B!>uPx_~S?SHJtHbWrzZMBVpK=}Po z=P&=S_wRc7dL3IZwjct)!{LD2oS58+7)5ne`p+dNAkg zIq-&iXZAYK?&CQkwu%F68v*0}qm6CsvxR*%q4yW4@GHl)WO004HWmTj)_{&=?A`;~ zE~t%$Fh`M&z9DMuZ|r_G&vqR9u7l1Ni}SgQmFQwu8p&3v^~qRfNbP9*vqVFT5@#u1 zyNb$ZM%EI-G8B~L|btr=IaX8UYz+nnIQcZg%9I9qO8tK z>VFBkN_(F^FewhTIYz3(7`Qhy7Jlu6D4Bl7RH-FvfiYcb^&MQ}QT(YPUzVs4BM{X2 z*Z@6d4+jXmFL2Blh}A-hNu(5kYAG1B&sk-8?R5FomN1Ty{*lt`u=^}M4NubJC`wI<2g!fqeI|v^jQ2C9z}*xyi7ymhct96WV|O6yycDfAoWDOReQNe8^5ttIVO)?Ck`MiH$MY;_>$ zI;8VUome?r;}M+$NMEaY;mhtNfGzXOa1Y}0@z1;z z1}3Q#(xu5Dg)ejrOe}2PeE9O?FF>Hzy$`_=DonTt+)tYQ4JJmcWC;e`hXKIyVh?VE z^&HR?v#3R7J6dVs^apLi0$__iod?UJahCQT5uQ6M~ z0kYLz`y6!0S^FJuPIoxkI6)?z2&fIr25y6}K|+ps-+z5*rjLErlQ z&C}*@N9>U6k_&dqlkbYl3S4xQ^k`y8k zZ1pE$H)IRh8v$&6ZT4dAiUA+O#)NqjF_3LJgv-z*1i2NRPlZe%W`qGGaq#i7oO>su+!6O6d z?tmV`lSsh8^pI*nD8o$;MRLKRpn7OmJb-Z0!_Yij0C-IR7L9;9m2gmwsI34&x12nvFqSb~613xiGo5~*MTHUcCAhZqDP1%q4%g&_=r zX&d>fSH#_SisW_xhE$bp7>Nir4oJX|jgbgp;{cHDzo6{@|NoPc${5-NND4X}s{0Kw zJ4~{Nak$6U_s_ttnI;2vgDs6r(sjVsp`zYWFIZ=tY~l*jdBZblGKWg8uOW*>xAG@; zCjRKx$c{^ey9)nMsG848qS7bC{tvV5HdCnJlyRL`d=?muLLK0xNOZwlaf|G53yi11 zY_Q2yZ~IZj4I*zX)lBAg9cHuL46}7K+auXKsoFb2W1pm7^3eZ&|GH<+-1{Iz5&%_F zL|h(0bw$M&B`P3QTlJ0X8GyMtN*K9F7%R3h#>f#hV9BV#lBkX75jj$%LTN!U5yeQr zK&3>FeFY2*42uNqPH(!$`;4+|LCZU|bTqES{d0wO8GLX7(&L zL}#*4IE%9A(}JXM+?H=Y9m@#r!bq-mdGv3Y>xa37uO2w{aCp-}w$;Xhm`F-Ul%Ak{ zSlk))RiR5n+ug?)kOa1~wB2w1e zPMeWL+ZA9ZhFtBR*Y(G1R}1LQxOCEr#D0+TlP^E8omSjhr(7GDXKbT%LYRjj5|iw| zb`Q97$N7RtT+*t6d`|ZKH(R7)VoR;MGV}+My%QzbnYb2p84i2I`$R0{do@WPw28@Z z)oWXVBohIudp@XZC3jnaO})iTA}=P>(`i9XBACD5=X`y3c7TNiy+H~2X;uMY8{3F= z3O}UKx%)-+i`spEPd{kkJ>q~dz5TtZX8RX}tp(-LfR`e55yU0RsZMn)YP%@Y|L-q| z9~R_dL7jjFI9dc9^BGt`9uTBF1TT@7awL>8c!{DTNk>|aAvLX=+FhGcQFrc4fh<#6 zDjgSqI$Z#5K+VWKbE~W(JE2`XgoUxd)=+pQ5C@+BSG8>KBS88?8l6LGbZptV46$;( zo8^$ZhWsBC!UH%QfRo4x616F6oPt2^>=A*{Y)D$CTyIhBaTQBf?!1jD|CeA9Tmx-1 zMUdc|e~o*8u3m`BZqJq~93n(ADGZZB^Xh*+WomNLA1nWo1l<{Jldv3Yu<^R{!0>&{ z0>B&=oyMbg6=VVQXaleuSdZM7SJeR}5|)}bik_rMRlC$*?=87x!mwVAie!qNW8wHP zImXOj;8`G{pt3?^&4xV(4BCi&%>op1jM@P)r@lvO)p5=8>W%C=E*mHH(QT&|4A`A= zNNMcEbb$4n+s~YF#C2dmW3#MLu~!&U%K*0q#GobRmb_JeY&!0&XqH`f(t_h@(+QS0@!xskwAlAS6w0|TgpeyOL@wKt`n*iGZJfev)UwM;Q0`P@@ z2iM#1bP!crs>5FlM>WDUNRq3^eU00G$l0McLSGpGT>{+l5qMvQ9= z)L%@1fk1#k3jym-P;fAa!Xf(u0tyluifPfz`kg5ZGuUF_`i(g}ECL*2@htik0SOVg z7AXCK#1a{`6juGr5)Bod6`Ru7_7iJ%=fFYJ8b;6PH6auv(ts@DKj9-Oc2P%J>0J^{$g4#0$vj}SoX~z-DC8|f(wbYOTV>c} zcBg9QkmZ!!OHNa_T#r021$`?ld=&XA?vJ|UPYmT{_3<{p5RihZA>A(w5u;JFPs|dx zC7dSRUMWx7Z$_<0R$Wd*Ub6+QZbg6+uw_t}3Ro4Q25lYI(tv9s+Cp|}qX1|irVzFR zjDz5d5}Gg~oK%9`KvGatG_4H1j%DaD%du*BHi1LrR?@4I^(h8b4J$Mwx-r9~rfHdF zrfXi?vc$3CTI<=gZ(B65Gqmr>p-*E+6DL#W&RqI1ceQZq(xZ1PPiwDkynD0tvGcX} z>%qUh)5ICq&6@973k}X$^q(8%-0FF^>s_$qqC36hZk@~Sx#GU7mixa4wXS*Sx<{S& zxWToCU|h=h)$D}@l@|Na58!B+8-I8QD^@hCiI zdq=$cdvqkg|L^m*r?W;cb>es^1$SaWs{vYix7^=5)lO!9+^2)c5IlT zBd}nFgvJ&Ijx~FZ7#yTXmTH$Y{w})YGO$%Z4CvAW0i#ccHXuVrjG2JqfkQw+Lffdv zfMI)O*lmyf_UV-eQ>ypwSkknpA4mqSb^a+N`$LI_AM@@DOz7@NIw!4@pPR#6zQV1eF}ktfTzh@V)5v{Vd|w`38;rHoAPn{TmM$=Jvh5 zys&~Zl|G-mtF}Cpib-uq9PpAqCr^Gx#fIF&K<|H9qfG47B4Y?=8YK}9vHCg8L-UfT zdKldsZCCNT>gd?yWTd%+Y3H4}e)dNK{ko+)NARY8pzmfaZ}G!x{{h%;^1Xvf4$JeZ zN$pP6vPXPyL;3ScqQ=9F-k;mhkcfIY0%*|a|G)!afzQS7KORc~);$LRHhlwt{1PC( z2RP$9&>^Bpyi_x{FS%Ae(x}|Z!!=D>{5CXYtJP4hSrgc?x-Krl@DV}#nhVQSxQ^C> z<~!L%h^Xpry@p|Qjy9|SoU;xuhjf|4)6=3|&22--mm&K`En1n@!zJ`qYaeDyVf)|mSC!&xvUkZ76->+)&pVXMyRmpVcB=Da$$ z!U_QEwy}AACx;bJisT<;Ob7xL=mx*U1@^!He({pukQ4dvL8;nW+Lr(CICNDRLe&0@zum6z3u)M3HspFn4EYMRLJN$nfho1w9M6BZ zKq-Ccx1aL61Sie%Pb_Qpw$4gDin289+%$gMO=a~pTTxQTGsP7UAD+r>1Kb{s$zT?xB9MF@wOT}xtB}ix z^d5+$oko#?X!(BG0igBhrA8zZIm&=07SjvZrN-`-6>}VH^3zWl$c$3}(49HCT5ndR=$27&_srh61uq$_3uR?DfbXyOzyiaCnyntRy-V5NAr z+p);lFrcW@D@Kg&fbKg4^B)xY%CZ~D)#YbAZA3>9i%G|_QcPo7MPX>R4&b`|#cW?F zoeThNC~4p?gUa{Sn2~41jlESv)LPGwAgfJ9qs5lCMkEZ%@Wha3bY7*A8-dwAF;ADF zCRf52^+p<37VM0=`X)tMm~xk97D*q7*;H<{Je*WRw2rV=E3X&roqa*l4sp@gP-u%& z6PhB5B}lAY_YJ|7GL%uB8EQFL5qVttH-SA1VmMaD2t>`x@nwYGaCRlEO1FAKq_?KD zd%z^hZ@9vlvgs-0=?w`z9SXJ9BU4ux3o;e{A=`tFgiQmxgq|k1OC%ruH*4cK9=eO? z<{20z$-f?q*Jh3h1&{6x(0Z3rEwR@|L8&iqjG#hXYCg%34|bV!Jog#PTkGGStT}w* z6xJ1kfjHKsrsIW<=n(_Mq|w7x7^WdKr9ZM!DTU67(l;6#ttgVHBwA}K^5w)4m3wyt z$!n!{*j)PAQo+iuoeEJnGc~g2?I6YSy>xPsrsM9HfusuYB!fL^gTWMmTb*!-Q5vw; z$b;Ki&2*f(uAY#1ft;su4vu>|nf`Z*kVLg>*t@E|)P2J=IH8C0MDLVfMZ$ldAWcz7 zH=A1P>3E4WHCvZxAa${KDyf!ZHA?!Ldtw~9J;w%UJqoTgcxh~>Mj-;ksHJ|+Le;Jy zrr>)Fh9^Ssom!5SRFeScq@j}fn8^?s4M7c$Y{WwxMS||~60GK}z>p!S6$z?Tp}?UC znTuzcIvA8iAKP1^b0}PxA2KV2rXL(bs?rsx3_wOQ458S90{v=S*kMpy(dj!7IXOgC z#!uk2)}hQ>DPQ%RD+AbQhT|^zA4V62bUxQ;%DSUYIB> znB8jkisCN0zjGf99PGrs4BVkkpi@Y&&^1EAlCoE1yH@v_TdBBk@U*=wYi19T0$8YI z1Y~*%w222Rx|p7Rjvfu(xxeeGAK=U?5G!(VkRk)eXKx&FFhgC)*-;rVd0K^*_o9s# zQm)U~ox&ciN7lW)j9j+J=K6sCqq!4D9D*yenVaV5Zb69zXhG0!Ng+m_U5&w%3q3X; zxH+HGJ9@3AvOsvZSG;&(L~sHwXZzPv+Z|5)w@}CTb^VD=%|IbWc1X&yiI!e8!OP!{ zHYxA&__iu-M(eQZs6}T%C`F`Tn4c8Rm|Icb6p_D75W?a~_pEug3YgdI5k&G9qykO} zM=w^@_n&c{f<@2|o8sI3+_S}s)NU2K zJi3+>tkx?X52A8qOZ+TM92nx{pr}u4vz|r{RfbN(gmaFp zUZtpE0LmjESR~NF5jJJwX}4rqv_z4D)iwp;-Kvs%jw%YsGEq88k;FQSmazKnX9G4; zsDpYCk9I5$wVL74kJdw74VsDXwxl+RSY9HZRws@{z9?Y9S>YHzt~bpvu?CBkBWhd} zv*yV`&ELg62c4gBrRpA^5x18TCM8QJ%URhSJx0(ZNayaLNg?(nPJxgp!359OleFy+ zdTKT)th$x744WGx&^Ert56Mq}aeQwdDCB_>dpCH{FbH&VE>2Q(C)PO<64^=+?Y|C5 zloW2lEg*v69lVXyh9p%D5mpb1F7s8AQi7o4%8r?c4LZ?iwn2kb&467NDg*!}Ov1LO zc28Z185chso>Ln*RK2DkPRjQoiMnI8uH|JmZ8PKZlH|0|DI0JIjxMjhZLgzZ(5ZGt zqu{x};M6K%5Oy;g68(zjh4;KSUbr%CH0saYL-KpXD*er9!LYJBlC+qtbqzm zd~{%B63D%8fp2JV!L_2;QK4sC8DUVbtzB&&`Nq2=BX(k7Hga;Lh|1)%(tMM>_YOM0 zN(u4Q$uk`dZ;FmY^A}$vsQY)>i&9ts!Y%&4>eur+RNV&G*dq`cNY+nl7``V;x<)e zAC9Z)Y&0-p-*C1ZoN1QHxj^t)t5_Jxaww~J8vkd5^ODjB46PiO?@*JcvhhF63PVU5 zNAc+L;LK>ZY#*`tLly7LJMB9)$n5!b&ADkes~dWy9IPD|5y6Gm;>%+FuA0VE8Bl@?^O})DYId$^Gb`G)X^a+F1o2@&~CT&$8-uF8f`C`LBkr z^?I=G4I12G5?r6nxit%(Y7Q7X$y^zPZ^cg`BZ(kM5>J8Ot}WGP2w>?{m?&7xp>S%f~S!$RPu?SnwgCB^ovAc z)|?sG6M>a$`jdqbD&i7Dmu^?6)2dEXbHn!N!U#S>^Dz6fLy|l4OE0g{27*lA;A}oK@hvVMCMd8% zQTn%+Jh8N<8f$K7y%*;!jv@^mpwa z;F~%2w`SdS2lbc_SoMfls*cR%beIT4dG zvU_|+OtKQ5fQFYv>5pH(hSSO7dEdA_MMp~OZ>67XA}XyJUN=Wt-v$aB1Ek0Bm8Ecnj1W2kty6IPdYMua$4gu?6;&h6bEgPWzB3d z>p_eYk}X${kEZ$gi<^ho(mmAOYTJq;OE-~w1`)pW{Q3Veu;1SQFMWKz6bt<2?N_sR zU}Bx7tBUBhfp9XjczEAvS9s9zdPfg|dlJ?Ytv>ztU<7qisc?Q#?qv9Yxuu7TX6IzcoQ*vBnJY zPk5u6fQbEJ3CB*a+>bT+;omEWQj|@hSC#yHw z{@-?f$VCO6vZ$VHN4dh`l_4faGcHXIe?*R+UzI2;CnhxB8CRF?ovOeGLpx*d6%oB! zE7o=I+lqt6w+Tq;P;kB^ZL{tz?rV>N0ApLH9FokH|E(LQ?nLOiHO8^DhA|H3PAmk@ zn7a*6n2Sw9c{x>3Z~_N3;~k%><+iFAcVfVh{PPPS3onq#h}Qy)F&8I7`CG9X3euv2 zKxZ}|14B21jJv3HP^gl>-@cp4gDMpegydYr_XF3OJ&VmlEvgf`u$%}%JSGHPz*870 zE{8z!xgbalS5>_esf;oS+Q;21Gl42&p~`6E7Y?Au_Aw0E<%XGXH;PY16(Z@d?-vf} zEho-+os5esD#qy)eF8a-3{8w`-!H{jLhj0mk{iR$_K*E%GwTVg^&j}-Y%#`8hf2Aj z;;9rk%G&vIOe*uyIXZK9yq+<^!-$~N^WJUEl@fFJBh)~dlQ}2XA58TVSp6Sxw@@cX z$H21AY_HaQD4t3|AZca6>ejIvX`Kwen9%HO5}_m>DvXB`O82J_mQUUs3Td)wGq*mN zc&d%)RkVsBi$4(EAAi2lG; zIJv9vMj8>N9-UV4)8>5B{!EW(DzezbJ8ZyKZ4>SEwV`hQ!?WE^NzkileFSL6f6$Ee zgbd>XnwEyKb+9!TdOPPp8MHi1gB7mdys!mzj2R?(RTKN+ss5u}W2w~G?k(KiuqiKh ztJn&c1#9aon11=-GD!aQdiuworsyW*@SI5ot8iOYOTYj58etYHW)YRb%3Pb=(xI!& zz?juu=rLWmu;YfUv3*u!Vi2$55Ube|;c7(Zw3~iSTvq&Y|K-jjLs}NC z=IvJh5=i_<<0QMHO-=oYHL$h3{{PPKf$E~EWIHkJSx0Q7CE>>wqp+#VILf>$!3+Dq zX%5AG4Lw`Xq^I2&_-7~xz5?B2(D;mL6f@J63zKHr7t+m6^Ly(+@6BE_E(Bysf{cxx zRk?t$v*T&Fm2r?uESU>_@fe&M#WssLZxsw0pZ;o8LO68pKXnH&@AHMq{YSamt#dT} z$4S+`qvb<@y;7ee?S^Rm6(( zno5Qvtw$^9qs(A!(M*w5ZZLZx-%P+dY;mEPekVwyqZmUX;j%c+sMMnOqmRmALDrG8_T%`?qi~<6a+%z)6uZ@*{9)aafjtQl~aTXcZ7_@I6PyKU+!O#HIY?| zOxQ>`u|6dKRTfF?%6g_N9WvYtHY-vcwdvMZB%8q)@#f0iX&g|ES#Pn-gt3w z{6>&X_*zAdx-ui9y*@R#sNCgovRajG$t4HX#>Yk_heu|XBrU;XFS)Sr8hN^2(@R+p zX2FiZrka6{df#F&7ZoQbW}n|9KzGknqCA#9otyd(^(QLDQ<*)jZ4;>9T;QwYh?&sh zKJ990brl_5xY}oa_T&9C3oGF7hqBApc9gL4%wh7gJ-2c*%GQ;Hg3s(PYUovYm19>4 zZmxM=o}1m%qFFO<8*La-@YzqBepQ?Lw(Iytrey2QiyO_)Km2&<`W_xac@9LK*HSkG>au9SnxI1`^tp!Diz^A6YkG-3=Dx|C#p{nyM|WDm?tB*<(55isgavHX7-3ti)I(n$AE04AQgzp>l{#Z*9zJ=rMJHMX}2Bs?; z!)5|44OgTa?MjjaTXJ*QyNXqVE=tV>;myKJWo}7St#Rf0DvhY6uXE=3Po#Pb`#_wN z08=32v_2Let@&nKch)$;2%_{?A&?+o9{@g2M;X?oqVH9If|%aZ!$Z(_^FC~p-8%4v z_6bZowq`rB!{=Y+z^Pv+e#HXu&kJgE|JRKAULU^6YM4#tlYhAK4sLbzxgzM5ZNOVB ztH&z}`L^Un!|0)TK2?enn9k61RI_Ho-i=9dos5}^^}dG1kN1pSul&ks9M+8(8;pC} zT1Gz=*rrsbG1IU!9Y&$S=+lu`?@ahH!~|PbG}%oIsxgQ$h&Ij+oGEVKAx>cyql|L7 zx>^`Q5IoR^8{m|S9Z0KYU1(~#?$?n%vO(}0hwav)Bjfu>DSpl=9CvsWLoSVafrdIH_O!&^;@@-&qf z;<;h0Ys|#DWYuCLI_*VJ*bouelmWjjSuqLlwNEON9na3~?<3vwrD3}vcw{-=fF}IH zEZkW$v9rw%edcYnl^?AmADtPOw6e{~bT$MFL-nJuum?K=18O|~WdF_f46F&vgOwk{ zTK*$za35*I-E7i>5GopTq1d+y#eW3km;`>*4fomN$@QfdJGj^gf#(qC72AcsBcWcR zL2s#>-0hxsed(Cr$pf8j^9Z~Wrh>0Uv_he@ZrC`s9d+^0CtiF$BpzC%BU`pY zO#<1^esIXsM_H05%7JetpH9XC@un8FKoFX$$9wOlLn^OeV^xW9f$iY=ic9Gl5ukW* za8Ph=$VrRs_;XX`u?j&yXsY5QSAz$X8vGo%qigGZ2WSHa=tV5ogX1ps*nimIvx2Q3 zFck0QM0m9x>BQ%yF)!O8Ls)NzO+JXj*1%elEko?ADi$F~hw@HI*%_@-)?$fqdc5w9P%I7s5Fc*fNiW z!hu7Pg}KAboP5`9NiiL~d!@a@K?yc-X#a}9V)U=#@6=4^Hn}Jr?`-1_+3-6@dv+hB zCcHS7Q7@CFTe{H%kUhV*YE18etd3k~UR#y}fHoAiNxXJ(-@HYW_YPQ^!$z2;`JJYB ztZVO@G_4(3f{Mldj?Ondy|A7({X8ChxD%_V3Om@-p*{l2u}3ZWO^1e_H1DimKng&##51aClgRZ3%(v zhrn8~?$<`Ktvj|ccndbvt#A+i(hv9^24=&Gu(#KLsYSR+_^0Q{Ek#RU{^R@5FBe}Y zt|5M&_ewGr>|y5PIlFDPr^FVyp3JG)%PSa&(tJrh!;8xU!*T3&Im#Xf>EwzpJ)Xzb z=X#x_`Zq1d)tTWyUy>76&Shp1Lsx5ss04rxW4%`|KJ09$ZIZdSw8>GSa^9_ut@XND z(6>jd@>Uy-M?0s@i9|@Hw(z7e7EVqvRKLBFdrs<`zS>x4DP)O$=-1H$;PQZG5aUFe z@FUMRj?tHvzRf)=u$B-X=w2EjAQm!{WzqD5GgTK}1PP^1;b?_N2%|hkR%H|9p9gFE z%XpRrwAuAF(W#I^>8HqF#ISs_@MMs`b#Q>Joym8c(YeMt8=2&lVxHkyq{>Wl^fzw2 z5SZ>_ucPqIcE>sTCLJBLvt>uswNi85_{yj8Z!$5!R-W1Fd}Y(*v?HM7^7hV&hfW3lo97(shJOKNzR z*_Gt^+u?K<&AY3}b=q>3xQUpl|Lelz>a`Uam#{4cLVbNlda+AILQexUX zZ)LCF9Hun*RrHOcnF)=&g#8!o?Is>WKi-&DAI?H-GTyG>KU|lE@;|GadltXQ9GErRzVM5AjuZh;b=oQ)!KdJptPC>Qtd z8ZZ4@Doh?cU9}neo4&)hvg{P$x7DUqrr1&vMR@&`Sgf|Fvbc48qIEcqmd9dJR5r~! zR;M@Z=#4`~*`to85IlWEpE82F>f(pZ>#*An6xk==5Mr z|GVDJl_2fMOcDMClLl#yxb|2YQ&E2_uuGmnCAKHrS3(-E7z_a%w zfoBIthR_&OTbP4h&Dh|X9TZbE4hyO|^yTXiPDxq#m(}y-3xS`muVGs@$hu^F5oTI; z7Hp2;2ZPO~WQ$;PLtc>aVX-TB%s&mrbasY|+mIKSlKid-`m|@PYfOg8U$3-k4~|pW zap^pR`nfcNDUOkKXqCpUF4VSwT8t2A6^He^75uVj1<_-X}d|ctHrZXC~wP zeXSCBXTlQv_f=Kx^G`^q@P?0LOL#q6bNp(>^3c$7-0IZ|D>ZIe#ARQxPi* z?2rcQfiT^gv5%aQW@$rjQ(P|(RIihg78=I!6pgPcyW(e5Kd=GlImAF1b17 zhJYQJ-(lrt8VsSxeFpT-XjJ^)#e9j|5+ba|B}pR?)cfO{fzE`%pI+i{%l~$jSLxgd zRy+~v=<-4QJACzYzkj{CAYd~!&ckrn)?nCUznLarAn2cm-N$C_-cQA3w?luQHt{%A zyN>`>{)M|A3XVN2N^RZKQhbav?ibgaS>K2k>ry=Dl|Zx6L-@$cbEA_Z-+G@>rcRpp zQ6;LFh`^2ji()u*WYJUDE6>T8!F*&{aViaI5M%yug*ulRS z!e1p>AWrS5zk}3MxGN+zt=V0YPuyRit_(_Wua%3Ei8h`o(3UsVirw)Ks!WC6DnyKZ zKtQb?lN-aVvX-$_gisbeE+^1EffD41SHlEx{$)GhHj~gCDXRu=k7N6DphOOHYIip{ zMVoV44y&@21<~AS97yw}J%)AuJ85g%Q?L(_fblZUVZEOjdvz%c?XyUVBL6^J`F#;1 zg}}Dqf;_zU_t?K1fdfb@qc$`ZjW6`#$V{EwV=0zpTFIaP2h^xds!jqu%N35fu|pC; zK(0FzS>%k-IhTfjQ5HVmFjEC+4_x(pDFWNu31KB~t?lTFz@+$eKI{lJ%}-zdzw2Ti zuUH+HVjs>i;W}9H4UXyU9TMoE({4Z?%Mi%T1~hY`kNF!6U25w@Ww1^D5%Yun88x!U`Z&(^Z_ zXxU|wTu3qxJ0>pO zM;J?IvFs|PCMd{{9XEEZ3zM`^JZTw8A56iw#ukrPCb9ddw6y1}n}1|THO`;IltcIb zC>EUu*>r{-*o~dO*A+Bg_`af*vA)3jVFgi_=WrE#brz-r0I!`>$@5&PqCcr};oM4o zS<$9^(_@z|@!4*$(%|lLv-gDZ_!XP)Wd8@K3tlIrm8{;j`r!OJZ%tSQ;7WPB-n%V} z6PoKH$#04hcH}=vh;R=iYrX=;e{}I~egQRmPET3ayYJ=Q=V0(9`70BCUKl&|+hl}% z#hH$m(I3?U~zN<6b{>9b?AK7}sM;<%>{WZzaY}JNKcH8|%Ne@_)Jg$V3XG`LzQeT}dj+!>s zOBYkd^cL2(@Wyf+Ilg@TRds}uVcmC){KldXpDr{*w$$M>Jj-(zQ^sRo|K6cK@Uo&^ z^z;hDXm`7%j^-f+-kP?BSL@@}!?lg`M%y^=K+fo+pEIP~yW?Fvd)O|Ica^JpI~>Ei z4zBTub~0&Rw#f*c_V25=XSqFAfWI^He|fWmd(#fdc`xHHqiky=5#g2k@Fpa8x#&i~ z0l>fB`oBJQM*pq)r2YSWGv%N3KLC06@D!ylXKF+7p*?=qAAL=xnedP6bzfBCL(+%v z)MRWwXP`a?0mz5Ky82*|e%$cOx!C7&{dzV@5Xu<{g8U*$mLzuokU6|VGPyKKbWLY( zNX}fEgAl;;c^vr=S$saPL<^fv`J>d;|K#oVS^#v!T+=@~o}TgvMRgDaim6XfU<}TPFlvy0 z%h>^Z{R1Ft0^7ZxJ3#@OmB=c6K>&FoECnjx^}(j8mfIOwYxpEU0Wc6Ub#yeE>Q(Z{ zkcb=NB4k7g5^MyMs4eve0wE9taRxE!dOe7SXe=g(J@$?sYzAuC0i?a{7$Y(FuE37l zhFB9uD;@wtjFX+)C(1}E$arHsN!H24YFVpe%dy175*tN)G7|eLEksi=V;!RD0?j|q zc-nV6Slc{+qKSQ;Ix2cc7iQSh&oVsz`(Q$tg)S7bD)oZ(t?Js~ZBwYDV5nYM^X*h@ zM?rfNsUu0)2}NsZt6{&5`ZW$RLI9@B$2&?1@HW!0YwcMY~^N*4?r@ z7OHzw_y3C_`q}MRx^X%@5(3wvBZ!fl^!^w|#)R1C$a?`a1*W{(Glf>hAo&x`(%tAT zG8_#HVsF^9Y|VChH`1IWL?OXwfzPy75VB)pz1H+$3d3nZbrs6v>pV4qCE=aeA?%mo?~l9WgzOAQ}|i(Lz?qtitSO z51*j(gR*1@bOy4L7p&^bC?hw{(HP>a&H#(iz~7N4$+Sy>o4Z8w;$|-Pqo}A1-A*Hb zJUX=ze%`nRFztkMX#?bdBD$Uc)KBs|n$x>GV=8 zsB1jLxy;S;9O;7UPeu{`ONPL#6aMb5$(}))KjgIl8Utf3B02&(^=2nF)yfx7w}?8X zh0+AWvq_A+Qx~bXs-@gf9rCuNS1dY)?3TpF*ka@`-OUl#J?o-xx>!p)R*y75PL!aj zC;$ifRK4U*7PN{)X=OEft*KvSgKir$c4SQ)yq#j=?^+I7B(8)GEXIxrckn?{H|qG4 z&8A;^r%Otc_31I!u67525{VL%B_W_|C0(iRBW6fxho>8z>ECC}ma962P1U3rwf)*v zd11n;5>l0e3D+H1MoYx5T;kNyan@?sX>Sn1rujl>TaE)r1SkwlOE@ESREdPw9TqX2 zs9lp#+i(kRoC7DxQMGim*R<~8GzK3UZRF5l+Gad-h$~u|`*&U+0yA*?AkYCp&B%NT zhda^BN1C7vrn3)1GP0blpu*{fng+}O0z(i(t+R)8lB-dQ8gGF12cbEfE$*cvkyR|P z97#$^%cd*Yo|?!y{s^kfNGTlan|iOIB8+*(?LC;Vy}qzo8f2|-tluKAFWd@Q(=cmj ztqx+EY-{W?O-g8ur;H~aL#ukuZGAFsjH^hI6Qdr;##`|v66GpRGk_uWaa%hUgKG5k zibfw*_a%*pdWa;^6EzKWl@=3tjAW~}JEafkK?s*A{zNQUS+VwF6DQVUzoyWpJg?N>$yif^h)sP76QfVwYpK3htLexmTkZE;-yjHlnh5RM#i6-zu z7%Wp*>P)(WhF6(V;07P8C}?5OQ5_s1NkIj)Y>S3BS0-_5uVP-+thgXzvhx!RVenfT z&}eWA6OKkr7_cHPi*6H?SBnWAaA+Jrj3(fybdW9w`9_mW_dZFMJPT7>c0k31Ov!qg zFT4>yuq^{4OlhHFhbNE-nn_%Mq1{9_%dr%a5nc!j2@P0ARVWj~ms{X=&W8maOhf8H z;vo56NdqMZVHNsTpvacfiM=FfbjS*%u?d`r8o{Ls|Bfmn#?V28hEf!x@dJ512Ed_Q zS&(5WdG~u0Tu@!@szv8m$S65Ahc{Hom%7*0C!s+O*Gu!feD+muq!C18$>`huqpIou z=1uRQx~WxCAR8oSQ2eu-@6+`I_ZELbzH^BR@pbPeyILWM&xQ-T-i!Q=RE0vY;K84K zK-u^j93N=9YwJR-=PnnndS`6cYgQT_uwzGqiG??;?0wNRF4{K)O98XPdfISKCZpU~ zsP8n%R(ck_3B9?clfBxPSR3OokA9$~S({B>Vq)7Ww!1%*y&CHfeu6<&+=JFL41W&1K}tZG#j32(GTzv@_l?TGYh(ji)i+;vt=rg}68bMT@1eZG7i z)3nfXFBK!<&D>^Jb*b39TJj~*i&hn9*dr#CjIU8j3trz+khE<9Oxp-2!S+$T6byT_ zyQ6u%aYaT|n<+E%QAx0a->WfX76i#~39H)GNFtbD;vRdr*VU)HkkmVOdkY|>Z!r=8 zq8&p6DW$d;;?NBdvywpRl$QpI;qF|+31eQuv&Gw?_dT-9Y49ha|tIfo1FCV)@ zzs|SS0DSSNh-y|gTKsXpC7ZFvzbdPNA>`$;A-z$fk&>l?1Ii-t=Zx1IHBhyWjjN9- zVkA%&{4yb_X+cJl_<^T36q!*~iM4ZW90saHQVR>?pp0vgPi#LBua~q-g+#U#V%(Z^^}q8kDf%L|6`^#gJ6dOg=Q!dLx2n5$- z)53U@>?9PqTZnE%r{&xcR#Brx+p4#wS|9TB-{l6>>ckX#mD=par6X-BFb!(4LCPwB z-9sTE5o(GxXI^Y9Oqblrl8auLW1qzPRwMIuQ@pLD8)b1%!NT z!bSq3QfTOv#gA`XBEgYauA=61DfMdvi-Vbp#HLv& zrZXBbm+O-kob)%jKj=aD~KQTGy<71@q zZU%(1vC?stl$|@32}_Jfo;{&tWZB}DBnFO!8$VzWUt!>uDP;vj*7(9QW(tUQlvWgc zzt4AWD6m!l*4wX5iNs^pJb7-6dwGcXVRqt=3|qtOgbcZdI$)3E5c+YQxYnLpx@lpEzHcjV5TjtAnTTwa1QJjQa zlL^&z+pH)Uatz>SVoct0uy{cy-ao_uRq3(OLL4och|XcI3*`Q*59fVxGFMMpoBaw#c#Jc z!9EUf4GytRi`3_QijNe-)BqJ8xuDL&V;uP|4)k`nvtyMXU8n)BaP@w6&kYKkL#DaI>o4tS~QAhOzl z0-Ty60aX={BP#P?sfY7=VGfc|;}71!H0~vhQR9X99bbYhfT)DOV_aIy`GIok`68@K zoX8IIl1BMH@dp4`M3o#E{`nPVp)uNOftJRzn950n5_6b(c+ft)ys}Mu6|dQg^hRh^ zX(x#dWN3mN%m{=>I4fucH%rj0H!;8sZPlGbfTIcrJKT!{L~b3wIoZ^GaQkofLRa@< zU@A1*OQcV$*v7|S6<8ptCmZZlJ3_QK5Tpjg88eDwNRTD1O}$$S^M5$C7OBvHp3I}H zN@bONrF65R*afJzI!INysTfcxdGVOYK7~tKKr`4y!uu^^-E5-t0Q93a>`4dH2QhP*uCVdLJvWOpv&Tpmpm~?zL^3Wj*?4>Tg$N_zg=F>FS_~DSXiQ5$d2wD*hPNQkmLNXw9_swqxv(u*x!X6GP|B z4v1VYXIB)i1`x8FPEzqf)$cUac@rNONSvtO%`QaMU@@BJ>PLV|tq7#yET8Xq8Ou__ zyl)0UiHF$~(l~K;$V7y=YPD7r0jhwQ0)8s2#l9T~XALbX8T=3l>=Q2KWL0855Nsiw zLJG?sp&(+jv!w_QLL@Xx2%NxmTx|-KwIw>g@Q#cU_evO)V-ygDqG#0!4ZOkz6Jd?R z1cl%e;4DzDK?-~fWw901sSV4fYWBlUj^q7VkoQTtM#E8>%B7}r5q#R^7P;jlZYi<;!`G<_AHxgttwP-(dJ!p*=N+ztHt>}wf3v*?C6UAEN}C#c;x0YemW0%$3^S$Twlnmn3q|)SQaqAQXi%#!a$wMa!XrN9smS@K@2&> zw@u@6A%cJokTvT?%3m-sRr^IJ@*j7J1M#sOv_=gtX3D^~_b9b3K<5L(EH+g0R2M$o!zv_t0z=3yphQ9xPB zcSsVEwpf~X?JDCjz}gcqCv94{acZqh*W@|wAj#jZ>`>^K#wGJ3AP4L+9zWHH0;n8- zkv*zoiPLrR(!{AWqb%{;mg=j4GEK=ko`Fu~EZ*;I*ypD)6sP0JVRT4g;*8tuIK=CI zzUke&Fgl&4DXrt2Xoq=BvvMqpZOf3rNd(G?jB;JYq}p4-)&Mnw14Ydq${3OOzQxzr#fj)v zamTwuFR)VMfeTWaag-obx0^Tq$lb za?#NWbU#Ia4NHDASx`#XPm-7A{++vA`?l8#P&A~OF^tNY;nL?l$#o^>tb)1gO;~sn z2L(5#mbxC4J3gdy#-g{S+9{7IlP*iysn_V)-q~H5F?X?rk_-4FFv*!U!GfJ;3ANST zC3~PX@cL>p633=i8Y)x17h8V`or6xKpfY0?l;293TETk6u$40N!I}r|yWCE1o35J= zgG5-|G>84AHDHp)OQlaCUSJhi#7Jrh(Fb~FH+Bbf{LCd4Q!ZID^X9sGr*3OMr_>%6 zY`O(Vv~TK*)bmdatjdg+ohNg=WR0w@b`g!lAi&_#eea#La42$QZ+AD6X9+aj%NZ+e z=E@q`4QNFJoJUbL7!~P-tt05KL|#auEq6?=?T0HpJ7r_ev22eA>6_)=srV1+}3qan{m! zA^v-2gok9zYB#*X!UW{~7NmKb&85v2HTFWz7W_X%)-;0flMb)al3WGDM-!lR_+KaJ z^=iJMiqwY7MJK@JfE)Q!9{D0lvUJ_sy)MFj>$Dj!`&BpB4~Mz)pVQ%f*fC$D_{A5m zL8mAYdK91Wod2(1ypAWyDETGFjpHO$S~0A5pFKROlbBGbvf-=vC(M^`zgvutINh{T zn(Iu?=iNv*pcYHQE0MhuMZ;aHd(j6Mc?k|ZLsH>#6YOs=STZRDBL`BGYgaHR=)3urww|Ex3qK)M7Q_?5_$C7jN-QuV0Pd6YVsmhr; z>|@F7p6F}(V|>X5xf-V#7?Or%_UF0yzUy3P8tBM+WCz03J{rQn0AIM1|9N ztEaVGw^Upal)xTwZRUfPH_Edx7Fx|hJLe9d7>>)_)Kh^%IsBz;pN^C5%XcxWmgK)j z(J|F|P#1xyUt}TTS?Xg{16fh(l}~8CHW3kUDUnPoNnD(>Fz{+@jeQ&`reJ?4K>=J91KfE*}|Hj85w|46pxEkUz5 z|0LAsRjBuiVOS5=&R{L{_6uUWaE*S*i9|RHuQWxelNiek=H2SG$Fx3gdMM3IESPeQ)_GuzZq(n*`3DT@RgRBIfGnF7qJh1&T zdE&y9#ZbCvOZHV_$@!*P z5v>u+Nz0f?0oHH@)IKKFCWtZI{YjZiwNkBS$9l>|O}#@QiB3?W?8Q2kf44j-QXz0#0Cet+X9u!jfwtO)3MuLN}1nJa0g&OzkV@#Bg<78QNcRET!l3z;IObNi)7S z@8iw*WCpM%nm3An0uh8wu9=OKOd}^9$}$uquT?#5B`3N-yqdie+`6~L0Z)RNAh<`^ z2oWy-^N{w~!GYu*hUfz8;{yc#5oY4u=p8cFN!-ZH7n|8~skk@!`w8@7e8y~(H_ser z<{Rs0(;}K?9)QGlf(!y6MF@S4LRT|WB{g`lVoB$H-Koo8tYrElFCfNUGGij(Yv4eD z*ZT9uw?UdysKc&5`M#N73C=H+LwVa8kUC%G&~s*U=bY7zXZCN2e?!uAxu&fmKm}mr zYrr4Igyw(YyGa^^l0$jKqAtr-vSeJ5J6~X7NCNe z=P{-Lg!LHX@z17hr%$*iL~Km#bYO2A3Ystp8MDDHD~Ue);0E21EZTx}W{xDoI+D&6 zr+V(hvb6URq^q9QPwL+s~OmprHJ+JkJ^+1zG^|?-S;n30zY*sE-sZdtbw-7Ig zoN2&>wu*owYPB8Rt_dW$e!&V+((cJ~O!zL*s)UHlU4ja7=H$c5!b?3^ zwgraKNh#qZhF6^G=_sLllec6zx1S!aq1>u&j1A9WeLi=|dULs4Dyj-iFFhihwR`cX z2Ser7R_|tf)KVZp1_-$)<*GdCRe{S~G=>*(O&b=OQJHgU=FH!bsOMz^J1^UN)qong z(rDQ#P?fko>P%_s>iJC_ikW&fL&WeE2R&=7RouJyS`iX%KVea40osqD@rdf_a#`55fN-zb8^i3lRFZEETqZB5Z;KtS^-8JH5VA41ZW0>5MG4SrE zx8m#UY(?)2RpE7Me}6wP&WSvaQE^9`2M+nnfar$c=2#S>(siv+>kAf*!7ADq+NQC&td%K!=ow|W(WvlrPya@ zVJ)K+VF4lZ(Y55XrqRm6;uK%c)bdeN@%Bc-_v(@7-cg{eOtep$cQ-4=zhg2-OpBQx zbMNZpBh*^Z7%}4nK4LUxxAW}!FkX#zz=A{q%n&(qks?Rpzhiky=7 z)dj9XntXfoy_6$;c*+gb)GfPL>jLCNh6OBAIYUD&rJsr%I*-VO^66*2>e_ zVk8CMZ!QK15@&#mfQ)~u-ojGPp=MxkSSU+rylKkbK-ypGpNlFC>6Cz zV#XYTytQUAsiRi4$DPhz6$+aNJ5x84RM)^`qYHs|(*Zqni*6(x`EVDO3ifY#Mb_o^z!FYF`(r(2Q7Z&P>2{ zb+$S%=6wb?xkjd>;V4{&#xZNHHrXzb9}d-x=t1XpzeoS>-S&>qJB-XQW%UT$)!eG1 z){>!FT~fsoMY2v?cZ(?Aj5oHEqeMid>bhy#Rt0UDKo$_uYAr2I@QU&wZnQ1KFjyfN zGfmw$3m?FqFSR&eagI@Ph$)0pCF6`zZEN0{n6+h=wDHYB8SPNlCRo71)*)D8%mBl^ zk5lXF@Jd44z|JnI=Mpxvetn(h; zDkX0zg*koBL4J!%OoLIzTGuLfUEjMk5C_XwFG?|X%+UltTJs2%^&Ma$0M29EPVHWR zN$=h>alms*T`385?lP{JqW66tzQ+tev<-3XUVIF*4Ggl$xQWT|KH#7(?2?jMWj3%4~5H;zRa^9Xt|anz2?*L zaLU`cLL4$Ha$4OhZOG-j4|JQ?3>w22kL;oo)bBS}e?29MN-ENmpaRMI$ zF(0<+b}RA60WmNBea;JmUClc_@YCh;?C0t0x8>CJ0MGys&VKkgdDmY5^vrGm0DgTG zD*(W6&$^4>z(0=fdb^+~Us2R{@#)^a^%Q2dkrt(&&$GQo+)utY)c#L& z))2Ix0xF;J@D)Mr5;O>b21+peCa6A%155G{x+$>AV!~<^R5N`>_=Jz$cMf#ns+KCK zVj5M8!k=96-)fUiTtAQ|zF(R?d3lTTzE9RRbKEy@OA~7UBrT|{GLu?Fu}RT7H;hcF zz7^HC1dZ2C>pY2NBEPSRz^=6TIE_Ia}jVUTx!b6Y7URt*y zle{qJ*djPrxYNHaD zAb9#gzL5(utxFRFx@ouEAUS2J7x&t;I%5nev&P9M`t=5n$*<#zZsoFVEeqeS*3TIQ%>%rJTwHM z3~78=b~8-hvL~PR$JXgdA9QNhx#fXQVkEqNx7Ph7b@B8zB^zEZ$~|GV;%QTz8fD_k zzyT^Jo>J$-XN{h6%ml|(*?y7Gmlw>+M^$5|9;O->n>Pes5TWc?ngpGzB$Y(X zV>ZO^Sc*b1S86V2GOu%W*|Oj{uw~C4Lx5nCl4q)O^MHqH#^V(Y4#fy+9 zmXeQ77NFot1i0fzbT5y{mL~B+`v``=qzeF%G-(kDB@ifxScm`;QZjP>`~(Xl6d_Wy zC^6{lxUxp&#)<<9M^0!gk&!Ssb7#+%3mYDoJb8hFK`;e}WCjHd1I&auECYtxguAWL zO&n_#TO&ulT$x@QcS{BZ|Djj0K(w7c9kY%(YRss!KZ z__j)yraX*dX)N=>N1p<+$!1@C^*P``0u9Vzdu`J(!s~*9^i!Tz7A4sxe8^8SN_;3O zFDXAQztp3zyr;0>;7F7IheXr=om9(rD|jd~u~fJ4@icpT)>!-B016b$6Yx(_4IWE7 zIyyMNZEw$T)EQD1duH@6pEvy;v9zYmk$uRrkGjgI^RkO063F0pF|B-vwIe|;>l`^W zr(M_n-}&hLMi+NZ!A_(~a}hfB4Pn{7S7K_uJ{pQTw3}fBwF^&EWSpZ*hbCBB?!2 z{pe@2z3YL*lO;_UY*?yE5F*8i*DJ^$T!o0b$<1S zE8V1i%GeZ1P_KS>``nU1oA$?Jhy3(3tn)ZyoVBHlpLtScvG3QI$8D7eYbacG1AEAm P&>NsQ4M7L++xr0k%F9lN literal 0 HcmV?d00001 diff --git a/highlight.pack.js b/highlight.pack.js new file mode 100644 index 0000000..7d1bcd0 --- /dev/null +++ b/highlight.pack.js @@ -0,0 +1,634 @@ +/*! + Highlight.js v11.7.0 (git: 82688fad18) + (c) 2006-2022 undefined and other contributors + License: BSD-3-Clause + */ +var hljs=function(){"use strict";var e={exports:{}};function t(e){ +return e instanceof Map?e.clear=e.delete=e.set=()=>{ +throw Error("map is read-only")}:e instanceof Set&&(e.add=e.clear=e.delete=()=>{ +throw Error("set is read-only") +}),Object.freeze(e),Object.getOwnPropertyNames(e).forEach((n=>{var i=e[n] +;"object"!=typeof i||Object.isFrozen(i)||t(i)})),e} +e.exports=t,e.exports.default=t;class n{constructor(e){ +void 0===e.data&&(e.data={}),this.data=e.data,this.isMatchIgnored=!1} +ignoreMatch(){this.isMatchIgnored=!0}}function i(e){ +return e.replace(/&/g,"&").replace(//g,">").replace(/"/g,""").replace(/'/g,"'") +}function r(e,...t){const n=Object.create(null);for(const t in e)n[t]=e[t] +;return t.forEach((e=>{for(const t in e)n[t]=e[t]})),n} +const s=e=>!!e.scope||e.sublanguage&&e.language;class o{constructor(e,t){ +this.buffer="",this.classPrefix=t.classPrefix,e.walk(this)}addText(e){ +this.buffer+=i(e)}openNode(e){if(!s(e))return;let t="" +;t=e.sublanguage?"language-"+e.language:((e,{prefix:t})=>{if(e.includes(".")){ +const n=e.split(".") +;return[`${t}${n.shift()}`,...n.map(((e,t)=>`${e}${"_".repeat(t+1)}`))].join(" ") +}return`${t}${e}`})(e.scope,{prefix:this.classPrefix}),this.span(t)} +closeNode(e){s(e)&&(this.buffer+="")}value(){return this.buffer}span(e){ +this.buffer+=``}}const a=(e={})=>{const t={children:[]} +;return Object.assign(t,e),t};class c{constructor(){ +this.rootNode=a(),this.stack=[this.rootNode]}get top(){ +return this.stack[this.stack.length-1]}get root(){return this.rootNode}add(e){ +this.top.children.push(e)}openNode(e){const t=a({scope:e}) +;this.add(t),this.stack.push(t)}closeNode(){ +if(this.stack.length>1)return this.stack.pop()}closeAllNodes(){ +for(;this.closeNode(););}toJSON(){return JSON.stringify(this.rootNode,null,4)} +walk(e){return this.constructor._walk(e,this.rootNode)}static _walk(e,t){ +return"string"==typeof t?e.addText(t):t.children&&(e.openNode(t), +t.children.forEach((t=>this._walk(e,t))),e.closeNode(t)),e}static _collapse(e){ +"string"!=typeof e&&e.children&&(e.children.every((e=>"string"==typeof e))?e.children=[e.children.join("")]:e.children.forEach((e=>{ +c._collapse(e)})))}}class l extends c{constructor(e){super(),this.options=e} +addKeyword(e,t){""!==e&&(this.openNode(t),this.addText(e),this.closeNode())} +addText(e){""!==e&&this.add(e)}addSublanguage(e,t){const n=e.root +;n.sublanguage=!0,n.language=t,this.add(n)}toHTML(){ +return new o(this,this.options).value()}finalize(){return!0}}function g(e){ +return e?"string"==typeof e?e:e.source:null}function d(e){return p("(?=",e,")")} +function u(e){return p("(?:",e,")*")}function h(e){return p("(?:",e,")?")} +function p(...e){return e.map((e=>g(e))).join("")}function f(...e){const t=(e=>{ +const t=e[e.length-1] +;return"object"==typeof t&&t.constructor===Object?(e.splice(e.length-1,1),t):{} +})(e);return"("+(t.capture?"":"?:")+e.map((e=>g(e))).join("|")+")"} +function b(e){return RegExp(e.toString()+"|").exec("").length-1} +const m=/\[(?:[^\\\]]|\\.)*\]|\(\??|\\([1-9][0-9]*)|\\./ +;function E(e,{joinWith:t}){let n=0;return e.map((e=>{n+=1;const t=n +;let i=g(e),r="";for(;i.length>0;){const e=m.exec(i);if(!e){r+=i;break} +r+=i.substring(0,e.index), +i=i.substring(e.index+e[0].length),"\\"===e[0][0]&&e[1]?r+="\\"+(Number(e[1])+t):(r+=e[0], +"("===e[0]&&n++)}return r})).map((e=>`(${e})`)).join(t)} +const x="[a-zA-Z]\\w*",w="[a-zA-Z_]\\w*",y="\\b\\d+(\\.\\d+)?",_="(-?)(\\b0[xX][a-fA-F0-9]+|(\\b\\d+(\\.\\d*)?|\\.\\d+)([eE][-+]?\\d+)?)",O="\\b(0b[01]+)",v={ +begin:"\\\\[\\s\\S]",relevance:0},N={scope:"string",begin:"'",end:"'", +illegal:"\\n",contains:[v]},k={scope:"string",begin:'"',end:'"',illegal:"\\n", +contains:[v]},M=(e,t,n={})=>{const i=r({scope:"comment",begin:e,end:t, +contains:[]},n);i.contains.push({scope:"doctag", +begin:"[ ]*(?=(TODO|FIXME|NOTE|BUG|OPTIMIZE|HACK|XXX):)", +end:/(TODO|FIXME|NOTE|BUG|OPTIMIZE|HACK|XXX):/,excludeBegin:!0,relevance:0}) +;const s=f("I","a","is","so","us","to","at","if","in","it","on",/[A-Za-z]+['](d|ve|re|ll|t|s|n)/,/[A-Za-z]+[-][a-z]+/,/[A-Za-z][a-z]{2,}/) +;return i.contains.push({begin:p(/[ ]+/,"(",s,/[.]?[:]?([.][ ]|[ ])/,"){3}")}),i +},S=M("//","$"),R=M("/\\*","\\*/"),j=M("#","$");var A=Object.freeze({ +__proto__:null,MATCH_NOTHING_RE:/\b\B/,IDENT_RE:x,UNDERSCORE_IDENT_RE:w, +NUMBER_RE:y,C_NUMBER_RE:_,BINARY_NUMBER_RE:O, +RE_STARTERS_RE:"!|!=|!==|%|%=|&|&&|&=|\\*|\\*=|\\+|\\+=|,|-|-=|/=|/|:|;|<<|<<=|<=|<|===|==|=|>>>=|>>=|>=|>>>|>>|>|\\?|\\[|\\{|\\(|\\^|\\^=|\\||\\|=|\\|\\||~", +SHEBANG:(e={})=>{const t=/^#![ ]*\// +;return e.binary&&(e.begin=p(t,/.*\b/,e.binary,/\b.*/)),r({scope:"meta",begin:t, +end:/$/,relevance:0,"on:begin":(e,t)=>{0!==e.index&&t.ignoreMatch()}},e)}, +BACKSLASH_ESCAPE:v,APOS_STRING_MODE:N,QUOTE_STRING_MODE:k,PHRASAL_WORDS_MODE:{ +begin:/\b(a|an|the|are|I'm|isn't|don't|doesn't|won't|but|just|should|pretty|simply|enough|gonna|going|wtf|so|such|will|you|your|they|like|more)\b/ +},COMMENT:M,C_LINE_COMMENT_MODE:S,C_BLOCK_COMMENT_MODE:R,HASH_COMMENT_MODE:j, +NUMBER_MODE:{scope:"number",begin:y,relevance:0},C_NUMBER_MODE:{scope:"number", +begin:_,relevance:0},BINARY_NUMBER_MODE:{scope:"number",begin:O,relevance:0}, +REGEXP_MODE:{begin:/(?=\/[^/\n]*\/)/,contains:[{scope:"regexp",begin:/\//, +end:/\/[gimuy]*/,illegal:/\n/,contains:[v,{begin:/\[/,end:/\]/,relevance:0, +contains:[v]}]}]},TITLE_MODE:{scope:"title",begin:x,relevance:0}, +UNDERSCORE_TITLE_MODE:{scope:"title",begin:w,relevance:0},METHOD_GUARD:{ +begin:"\\.\\s*[a-zA-Z_]\\w*",relevance:0},END_SAME_AS_BEGIN:e=>Object.assign(e,{ +"on:begin":(e,t)=>{t.data._beginMatch=e[1]},"on:end":(e,t)=>{ +t.data._beginMatch!==e[1]&&t.ignoreMatch()}})});function I(e,t){ +"."===e.input[e.index-1]&&t.ignoreMatch()}function T(e,t){ +void 0!==e.className&&(e.scope=e.className,delete e.className)}function L(e,t){ +t&&e.beginKeywords&&(e.begin="\\b("+e.beginKeywords.split(" ").join("|")+")(?!\\.)(?=\\b|\\s)", +e.__beforeBegin=I,e.keywords=e.keywords||e.beginKeywords,delete e.beginKeywords, +void 0===e.relevance&&(e.relevance=0))}function B(e,t){ +Array.isArray(e.illegal)&&(e.illegal=f(...e.illegal))}function D(e,t){ +if(e.match){ +if(e.begin||e.end)throw Error("begin & end are not supported with match") +;e.begin=e.match,delete e.match}}function H(e,t){ +void 0===e.relevance&&(e.relevance=1)}const P=(e,t)=>{if(!e.beforeMatch)return +;if(e.starts)throw Error("beforeMatch cannot be used with starts") +;const n=Object.assign({},e);Object.keys(e).forEach((t=>{delete e[t] +})),e.keywords=n.keywords,e.begin=p(n.beforeMatch,d(n.begin)),e.starts={ +relevance:0,contains:[Object.assign(n,{endsParent:!0})] +},e.relevance=0,delete n.beforeMatch +},C=["of","and","for","in","not","or","if","then","parent","list","value"] +;function $(e,t,n="keyword"){const i=Object.create(null) +;return"string"==typeof e?r(n,e.split(" ")):Array.isArray(e)?r(n,e):Object.keys(e).forEach((n=>{ +Object.assign(i,$(e[n],t,n))})),i;function r(e,n){ +t&&(n=n.map((e=>e.toLowerCase()))),n.forEach((t=>{const n=t.split("|") +;i[n[0]]=[e,U(n[0],n[1])]}))}}function U(e,t){ +return t?Number(t):(e=>C.includes(e.toLowerCase()))(e)?0:1}const z={},K=e=>{ +console.error(e)},W=(e,...t)=>{console.log("WARN: "+e,...t)},X=(e,t)=>{ +z[`${e}/${t}`]||(console.log(`Deprecated as of ${e}. ${t}`),z[`${e}/${t}`]=!0) +},G=Error();function Z(e,t,{key:n}){let i=0;const r=e[n],s={},o={} +;for(let e=1;e<=t.length;e++)o[e+i]=r[e],s[e+i]=!0,i+=b(t[e-1]) +;e[n]=o,e[n]._emit=s,e[n]._multi=!0}function F(e){(e=>{ +e.scope&&"object"==typeof e.scope&&null!==e.scope&&(e.beginScope=e.scope, +delete e.scope)})(e),"string"==typeof e.beginScope&&(e.beginScope={ +_wrap:e.beginScope}),"string"==typeof e.endScope&&(e.endScope={_wrap:e.endScope +}),(e=>{if(Array.isArray(e.begin)){ +if(e.skip||e.excludeBegin||e.returnBegin)throw K("skip, excludeBegin, returnBegin not compatible with beginScope: {}"), +G +;if("object"!=typeof e.beginScope||null===e.beginScope)throw K("beginScope must be object"), +G;Z(e,e.begin,{key:"beginScope"}),e.begin=E(e.begin,{joinWith:""})}})(e),(e=>{ +if(Array.isArray(e.end)){ +if(e.skip||e.excludeEnd||e.returnEnd)throw K("skip, excludeEnd, returnEnd not compatible with endScope: {}"), +G +;if("object"!=typeof e.endScope||null===e.endScope)throw K("endScope must be object"), +G;Z(e,e.end,{key:"endScope"}),e.end=E(e.end,{joinWith:""})}})(e)}function V(e){ +function t(t,n){ +return RegExp(g(t),"m"+(e.case_insensitive?"i":"")+(e.unicodeRegex?"u":"")+(n?"g":"")) +}class n{constructor(){ +this.matchIndexes={},this.regexes=[],this.matchAt=1,this.position=0} +addRule(e,t){ +t.position=this.position++,this.matchIndexes[this.matchAt]=t,this.regexes.push([t,e]), +this.matchAt+=b(e)+1}compile(){0===this.regexes.length&&(this.exec=()=>null) +;const e=this.regexes.map((e=>e[1]));this.matcherRe=t(E(e,{joinWith:"|" +}),!0),this.lastIndex=0}exec(e){this.matcherRe.lastIndex=this.lastIndex +;const t=this.matcherRe.exec(e);if(!t)return null +;const n=t.findIndex(((e,t)=>t>0&&void 0!==e)),i=this.matchIndexes[n] +;return t.splice(0,n),Object.assign(t,i)}}class i{constructor(){ +this.rules=[],this.multiRegexes=[], +this.count=0,this.lastIndex=0,this.regexIndex=0}getMatcher(e){ +if(this.multiRegexes[e])return this.multiRegexes[e];const t=new n +;return this.rules.slice(e).forEach((([e,n])=>t.addRule(e,n))), +t.compile(),this.multiRegexes[e]=t,t}resumingScanAtSamePosition(){ +return 0!==this.regexIndex}considerAll(){this.regexIndex=0}addRule(e,t){ +this.rules.push([e,t]),"begin"===t.type&&this.count++}exec(e){ +const t=this.getMatcher(this.regexIndex);t.lastIndex=this.lastIndex +;let n=t.exec(e) +;if(this.resumingScanAtSamePosition())if(n&&n.index===this.lastIndex);else{ +const t=this.getMatcher(0);t.lastIndex=this.lastIndex+1,n=t.exec(e)} +return n&&(this.regexIndex+=n.position+1, +this.regexIndex===this.count&&this.considerAll()),n}} +if(e.compilerExtensions||(e.compilerExtensions=[]), +e.contains&&e.contains.includes("self"))throw Error("ERR: contains `self` is not supported at the top-level of a language. See documentation.") +;return e.classNameAliases=r(e.classNameAliases||{}),function n(s,o){const a=s +;if(s.isCompiled)return a +;[T,D,F,P].forEach((e=>e(s,o))),e.compilerExtensions.forEach((e=>e(s,o))), +s.__beforeBegin=null,[L,B,H].forEach((e=>e(s,o))),s.isCompiled=!0;let c=null +;return"object"==typeof s.keywords&&s.keywords.$pattern&&(s.keywords=Object.assign({},s.keywords), +c=s.keywords.$pattern, +delete s.keywords.$pattern),c=c||/\w+/,s.keywords&&(s.keywords=$(s.keywords,e.case_insensitive)), +a.keywordPatternRe=t(c,!0), +o&&(s.begin||(s.begin=/\B|\b/),a.beginRe=t(a.begin),s.end||s.endsWithParent||(s.end=/\B|\b/), +s.end&&(a.endRe=t(a.end)), +a.terminatorEnd=g(a.end)||"",s.endsWithParent&&o.terminatorEnd&&(a.terminatorEnd+=(s.end?"|":"")+o.terminatorEnd)), +s.illegal&&(a.illegalRe=t(s.illegal)), +s.contains||(s.contains=[]),s.contains=[].concat(...s.contains.map((e=>(e=>(e.variants&&!e.cachedVariants&&(e.cachedVariants=e.variants.map((t=>r(e,{ +variants:null},t)))),e.cachedVariants?e.cachedVariants:q(e)?r(e,{ +starts:e.starts?r(e.starts):null +}):Object.isFrozen(e)?r(e):e))("self"===e?s:e)))),s.contains.forEach((e=>{n(e,a) +})),s.starts&&n(s.starts,o),a.matcher=(e=>{const t=new i +;return e.contains.forEach((e=>t.addRule(e.begin,{rule:e,type:"begin" +}))),e.terminatorEnd&&t.addRule(e.terminatorEnd,{type:"end" +}),e.illegal&&t.addRule(e.illegal,{type:"illegal"}),t})(a),a}(e)}function q(e){ +return!!e&&(e.endsWithParent||q(e.starts))}class J extends Error{ +constructor(e,t){super(e),this.name="HTMLInjectionError",this.html=t}} +const Y=i,Q=r,ee=Symbol("nomatch");var te=(t=>{ +const i=Object.create(null),r=Object.create(null),s=[];let o=!0 +;const a="Could not find the language '{}', did you forget to load/include a language module?",c={ +disableAutodetect:!0,name:"Plain text",contains:[]};let g={ +ignoreUnescapedHTML:!1,throwUnescapedHTML:!1,noHighlightRe:/^(no-?highlight)$/i, +languageDetectRe:/\blang(?:uage)?-([\w-]+)\b/i,classPrefix:"hljs-", +cssSelector:"pre code",languages:null,__emitter:l};function b(e){ +return g.noHighlightRe.test(e)}function m(e,t,n){let i="",r="" +;"object"==typeof t?(i=e, +n=t.ignoreIllegals,r=t.language):(X("10.7.0","highlight(lang, code, ...args) has been deprecated."), +X("10.7.0","Please use highlight(code, options) instead.\nhttps://github.com/highlightjs/highlight.js/issues/2277"), +r=e,i=t),void 0===n&&(n=!0);const s={code:i,language:r};k("before:highlight",s) +;const o=s.result?s.result:E(s.language,s.code,n) +;return o.code=s.code,k("after:highlight",o),o}function E(e,t,r,s){ +const c=Object.create(null);function l(){if(!N.keywords)return void M.addText(S) +;let e=0;N.keywordPatternRe.lastIndex=0;let t=N.keywordPatternRe.exec(S),n="" +;for(;t;){n+=S.substring(e,t.index) +;const r=y.case_insensitive?t[0].toLowerCase():t[0],s=(i=r,N.keywords[i]);if(s){ +const[e,i]=s +;if(M.addText(n),n="",c[r]=(c[r]||0)+1,c[r]<=7&&(R+=i),e.startsWith("_"))n+=t[0];else{ +const n=y.classNameAliases[e]||e;M.addKeyword(t[0],n)}}else n+=t[0] +;e=N.keywordPatternRe.lastIndex,t=N.keywordPatternRe.exec(S)}var i +;n+=S.substring(e),M.addText(n)}function d(){null!=N.subLanguage?(()=>{ +if(""===S)return;let e=null;if("string"==typeof N.subLanguage){ +if(!i[N.subLanguage])return void M.addText(S) +;e=E(N.subLanguage,S,!0,k[N.subLanguage]),k[N.subLanguage]=e._top +}else e=x(S,N.subLanguage.length?N.subLanguage:null) +;N.relevance>0&&(R+=e.relevance),M.addSublanguage(e._emitter,e.language) +})():l(),S=""}function u(e,t){let n=1;const i=t.length-1;for(;n<=i;){ +if(!e._emit[n]){n++;continue}const i=y.classNameAliases[e[n]]||e[n],r=t[n] +;i?M.addKeyword(r,i):(S=r,l(),S=""),n++}}function h(e,t){ +return e.scope&&"string"==typeof e.scope&&M.openNode(y.classNameAliases[e.scope]||e.scope), +e.beginScope&&(e.beginScope._wrap?(M.addKeyword(S,y.classNameAliases[e.beginScope._wrap]||e.beginScope._wrap), +S=""):e.beginScope._multi&&(u(e.beginScope,t),S="")),N=Object.create(e,{parent:{ +value:N}}),N}function p(e,t,i){let r=((e,t)=>{const n=e&&e.exec(t) +;return n&&0===n.index})(e.endRe,i);if(r){if(e["on:end"]){const i=new n(e) +;e["on:end"](t,i),i.isMatchIgnored&&(r=!1)}if(r){ +for(;e.endsParent&&e.parent;)e=e.parent;return e}} +if(e.endsWithParent)return p(e.parent,t,i)}function f(e){ +return 0===N.matcher.regexIndex?(S+=e[0],1):(I=!0,0)}function b(e){ +const n=e[0],i=t.substring(e.index),r=p(N,e,i);if(!r)return ee;const s=N +;N.endScope&&N.endScope._wrap?(d(), +M.addKeyword(n,N.endScope._wrap)):N.endScope&&N.endScope._multi?(d(), +u(N.endScope,e)):s.skip?S+=n:(s.returnEnd||s.excludeEnd||(S+=n), +d(),s.excludeEnd&&(S=n));do{ +N.scope&&M.closeNode(),N.skip||N.subLanguage||(R+=N.relevance),N=N.parent +}while(N!==r.parent);return r.starts&&h(r.starts,e),s.returnEnd?0:n.length} +let m={};function w(i,s){const a=s&&s[0];if(S+=i,null==a)return d(),0 +;if("begin"===m.type&&"end"===s.type&&m.index===s.index&&""===a){ +if(S+=t.slice(s.index,s.index+1),!o){const t=Error(`0 width match regex (${e})`) +;throw t.languageName=e,t.badRule=m.rule,t}return 1} +if(m=s,"begin"===s.type)return(e=>{ +const t=e[0],i=e.rule,r=new n(i),s=[i.__beforeBegin,i["on:begin"]] +;for(const n of s)if(n&&(n(e,r),r.isMatchIgnored))return f(t) +;return i.skip?S+=t:(i.excludeBegin&&(S+=t), +d(),i.returnBegin||i.excludeBegin||(S=t)),h(i,e),i.returnBegin?0:t.length})(s) +;if("illegal"===s.type&&!r){ +const e=Error('Illegal lexeme "'+a+'" for mode "'+(N.scope||"")+'"') +;throw e.mode=N,e}if("end"===s.type){const e=b(s);if(e!==ee)return e} +if("illegal"===s.type&&""===a)return 1 +;if(A>1e5&&A>3*s.index)throw Error("potential infinite loop, way more iterations than matches") +;return S+=a,a.length}const y=O(e) +;if(!y)throw K(a.replace("{}",e)),Error('Unknown language: "'+e+'"') +;const _=V(y);let v="",N=s||_;const k={},M=new g.__emitter(g);(()=>{const e=[] +;for(let t=N;t!==y;t=t.parent)t.scope&&e.unshift(t.scope) +;e.forEach((e=>M.openNode(e)))})();let S="",R=0,j=0,A=0,I=!1;try{ +for(N.matcher.considerAll();;){ +A++,I?I=!1:N.matcher.considerAll(),N.matcher.lastIndex=j +;const e=N.matcher.exec(t);if(!e)break;const n=w(t.substring(j,e.index),e) +;j=e.index+n} +return w(t.substring(j)),M.closeAllNodes(),M.finalize(),v=M.toHTML(),{ +language:e,value:v,relevance:R,illegal:!1,_emitter:M,_top:N}}catch(n){ +if(n.message&&n.message.includes("Illegal"))return{language:e,value:Y(t), +illegal:!0,relevance:0,_illegalBy:{message:n.message,index:j, +context:t.slice(j-100,j+100),mode:n.mode,resultSoFar:v},_emitter:M};if(o)return{ +language:e,value:Y(t),illegal:!1,relevance:0,errorRaised:n,_emitter:M,_top:N} +;throw n}}function x(e,t){t=t||g.languages||Object.keys(i);const n=(e=>{ +const t={value:Y(e),illegal:!1,relevance:0,_top:c,_emitter:new g.__emitter(g)} +;return t._emitter.addText(e),t})(e),r=t.filter(O).filter(N).map((t=>E(t,e,!1))) +;r.unshift(n);const s=r.sort(((e,t)=>{ +if(e.relevance!==t.relevance)return t.relevance-e.relevance +;if(e.language&&t.language){if(O(e.language).supersetOf===t.language)return 1 +;if(O(t.language).supersetOf===e.language)return-1}return 0})),[o,a]=s,l=o +;return l.secondBest=a,l}function w(e){let t=null;const n=(e=>{ +let t=e.className+" ";t+=e.parentNode?e.parentNode.className:"" +;const n=g.languageDetectRe.exec(t);if(n){const t=O(n[1]) +;return t||(W(a.replace("{}",n[1])), +W("Falling back to no-highlight mode for this block.",e)),t?n[1]:"no-highlight"} +return t.split(/\s+/).find((e=>b(e)||O(e)))})(e);if(b(n))return +;if(k("before:highlightElement",{el:e,language:n +}),e.children.length>0&&(g.ignoreUnescapedHTML||(console.warn("One of your code blocks includes unescaped HTML. This is a potentially serious security risk."), +console.warn("https://github.com/highlightjs/highlight.js/wiki/security"), +console.warn("The element with unescaped HTML:"), +console.warn(e)),g.throwUnescapedHTML))throw new J("One of your code blocks includes unescaped HTML.",e.innerHTML) +;t=e;const i=t.textContent,s=n?m(i,{language:n,ignoreIllegals:!0}):x(i) +;e.innerHTML=s.value,((e,t,n)=>{const i=t&&r[t]||n +;e.classList.add("hljs"),e.classList.add("language-"+i) +})(e,n,s.language),e.result={language:s.language,re:s.relevance, +relevance:s.relevance},s.secondBest&&(e.secondBest={ +language:s.secondBest.language,relevance:s.secondBest.relevance +}),k("after:highlightElement",{el:e,result:s,text:i})}let y=!1;function _(){ +"loading"!==document.readyState?document.querySelectorAll(g.cssSelector).forEach(w):y=!0 +}function O(e){return e=(e||"").toLowerCase(),i[e]||i[r[e]]} +function v(e,{languageName:t}){"string"==typeof e&&(e=[e]),e.forEach((e=>{ +r[e.toLowerCase()]=t}))}function N(e){const t=O(e) +;return t&&!t.disableAutodetect}function k(e,t){const n=e;s.forEach((e=>{ +e[n]&&e[n](t)}))} +"undefined"!=typeof window&&window.addEventListener&&window.addEventListener("DOMContentLoaded",(()=>{ +y&&_()}),!1),Object.assign(t,{highlight:m,highlightAuto:x,highlightAll:_, +highlightElement:w, +highlightBlock:e=>(X("10.7.0","highlightBlock will be removed entirely in v12.0"), +X("10.7.0","Please use highlightElement now."),w(e)),configure:e=>{g=Q(g,e)}, +initHighlighting:()=>{ +_(),X("10.6.0","initHighlighting() deprecated. Use highlightAll() now.")}, +initHighlightingOnLoad:()=>{ +_(),X("10.6.0","initHighlightingOnLoad() deprecated. Use highlightAll() now.") +},registerLanguage:(e,n)=>{let r=null;try{r=n(t)}catch(t){ +if(K("Language definition for '{}' could not be registered.".replace("{}",e)), +!o)throw t;K(t),r=c} +r.name||(r.name=e),i[e]=r,r.rawDefinition=n.bind(null,t),r.aliases&&v(r.aliases,{ +languageName:e})},unregisterLanguage:e=>{delete i[e] +;for(const t of Object.keys(r))r[t]===e&&delete r[t]}, +listLanguages:()=>Object.keys(i),getLanguage:O,registerAliases:v, +autoDetection:N,inherit:Q,addPlugin:e=>{(e=>{ +e["before:highlightBlock"]&&!e["before:highlightElement"]&&(e["before:highlightElement"]=t=>{ +e["before:highlightBlock"](Object.assign({block:t.el},t)) +}),e["after:highlightBlock"]&&!e["after:highlightElement"]&&(e["after:highlightElement"]=t=>{ +e["after:highlightBlock"](Object.assign({block:t.el},t))})})(e),s.push(e)} +}),t.debugMode=()=>{o=!1},t.safeMode=()=>{o=!0 +},t.versionString="11.7.0",t.regex={concat:p,lookahead:d,either:f,optional:h, +anyNumberOfTimes:u};for(const t in A)"object"==typeof A[t]&&e.exports(A[t]) +;return Object.assign(t,A),t})({});return te}() +;"object"==typeof exports&&"undefined"!=typeof module&&(module.exports=hljs);/*! `reasonml` grammar compiled for Highlight.js 11.7.0 */ +(()=>{var e=(()=>{"use strict";return e=>{ +const n="~?[a-z$_][0-9a-zA-Z$_]*",a="`?[A-Z$_][0-9a-zA-Z$_]*",s="("+["||","++","**","+.","*","/","*.","/.","..."].map((e=>e.split("").map((e=>"\\"+e)).join(""))).join("|")+"|\\|>|&&|==|===)",i="\\s+"+s+"\\s+",r={ +keyword:"and as asr assert begin class constraint do done downto else end exception external for fun function functor if in include inherit initializer land lazy let lor lsl lsr lxor match method mod module mutable new nonrec object of open or private rec sig struct then to try type val virtual when while with", +built_in:"array bool bytes char exn|5 float int int32 int64 list lazy_t|5 nativeint|5 ref string unit ", +literal:"true false" +},l="\\b(0[xX][a-fA-F0-9_]+[Lln]?|0[oO][0-7_]+[Lln]?|0[bB][01_]+[Lln]?|[0-9][0-9_]*([Lln]|(\\.[0-9_]*)?([eE][-+]?[0-9_]+)?)?)",t={ +className:"number",relevance:0,variants:[{begin:l},{begin:"\\(-"+l+"\\)"}]},c={ +className:"operator",relevance:0,begin:s},o=[{className:"identifier", +relevance:0,begin:n},c,t],g=[e.QUOTE_STRING_MODE,c,{className:"module", +begin:"\\b"+a,returnBegin:!0,relevance:0,end:".",contains:[{ +className:"identifier",begin:a,relevance:0}]}],b=[{className:"module", +begin:"\\b"+a,returnBegin:!0,end:".",relevance:0,contains:[{ +className:"identifier",begin:a,relevance:0}]}],m={className:"function", +relevance:0,keywords:r,variants:[{begin:"\\s(\\(\\.?.*?\\)|"+n+")\\s*=>", +end:"\\s*=>",returnBegin:!0,relevance:0,contains:[{className:"params", +variants:[{begin:n},{ +begin:"~?[a-z$_][0-9a-zA-Z$_]*(\\s*:\\s*[a-z$_][0-9a-z$_]*(\\(\\s*('?[a-z$_][0-9a-z$_]*\\s*(,'?[a-z$_][0-9a-z$_]*\\s*)*)?\\))?){0,2}" +},{begin:/\(\s*\)/}]}]},{begin:"\\s\\(\\.?[^;\\|]*\\)\\s*=>",end:"\\s=>", +returnBegin:!0,relevance:0,contains:[{className:"params",relevance:0,variants:[{ +begin:n,end:"(,|\\n|\\))",relevance:0,contains:[c,{className:"typing",begin:":", +end:"(,|\\n)",returnBegin:!0,relevance:0,contains:b}]}]}]},{ +begin:"\\(\\.\\s"+n+"\\)\\s*=>"}]};g.push(m);const d={className:"constructor", +begin:a+"\\(",end:"\\)",illegal:"\\n",keywords:r, +contains:[e.QUOTE_STRING_MODE,c,{className:"params",begin:"\\b"+n}]},u={ +className:"pattern-match",begin:"\\|",returnBegin:!0,keywords:r,end:"=>", +relevance:0,contains:[d,c,{relevance:0,className:"constructor",begin:a}]},v={ +className:"module-access",keywords:r,returnBegin:!0,variants:[{ +begin:"\\b("+a+"\\.)+"+n},{begin:"\\b("+a+"\\.)+\\(",end:"\\)",returnBegin:!0, +contains:[m,{begin:"\\(",end:"\\)",relevance:0,skip:!0}].concat(g)},{ +begin:"\\b("+a+"\\.)+\\{",end:/\}/}],contains:g};return b.push(v),{ +name:"ReasonML",aliases:["re"],keywords:r,illegal:"(:-|:=|\\$\\{|\\+=)", +contains:[e.COMMENT("/\\*","\\*/",{illegal:"^(#,\\/\\/)"}),{ +className:"character",begin:"'(\\\\[^']+|[^'])'",illegal:"\\n",relevance:0 +},e.QUOTE_STRING_MODE,{className:"literal",begin:"\\(\\)",relevance:0},{ +className:"literal",begin:"\\[\\|",end:"\\|\\]",relevance:0,contains:o},{ +className:"literal",begin:"\\[",end:"\\]",relevance:0,contains:o},d,{ +className:"operator",begin:i,illegal:"--\x3e",relevance:0 +},t,e.C_LINE_COMMENT_MODE,u,m,{className:"module-def", +begin:"\\bmodule\\s+"+n+"\\s+"+a+"\\s+=\\s+\\{",end:/\}/,returnBegin:!0, +keywords:r,relevance:0,contains:[{className:"module",relevance:0,begin:a},{ +begin:/\{/,end:/\}/,relevance:0,skip:!0}].concat(g)},v]}}})() +;hljs.registerLanguage("reasonml",e)})();/*! `javascript` grammar compiled for Highlight.js 11.7.0 */ +(()=>{var e=(()=>{"use strict" +;const e="[A-Za-z$_][0-9A-Za-z$_]*",n=["as","in","of","if","for","while","finally","var","new","function","do","return","void","else","break","catch","instanceof","with","throw","case","default","try","switch","continue","typeof","delete","let","yield","const","class","debugger","async","await","static","import","from","export","extends"],a=["true","false","null","undefined","NaN","Infinity"],t=["Object","Function","Boolean","Symbol","Math","Date","Number","BigInt","String","RegExp","Array","Float32Array","Float64Array","Int8Array","Uint8Array","Uint8ClampedArray","Int16Array","Int32Array","Uint16Array","Uint32Array","BigInt64Array","BigUint64Array","Set","Map","WeakSet","WeakMap","ArrayBuffer","SharedArrayBuffer","Atomics","DataView","JSON","Promise","Generator","GeneratorFunction","AsyncFunction","Reflect","Proxy","Intl","WebAssembly"],s=["Error","EvalError","InternalError","RangeError","ReferenceError","SyntaxError","TypeError","URIError"],r=["setInterval","setTimeout","clearInterval","clearTimeout","require","exports","eval","isFinite","isNaN","parseFloat","parseInt","decodeURI","decodeURIComponent","encodeURI","encodeURIComponent","escape","unescape"],c=["arguments","this","super","console","window","document","localStorage","module","global"],i=[].concat(r,t,s) +;return o=>{const l=o.regex,b=e,d={begin:/<[A-Za-z0-9\\._:-]+/, +end:/\/[A-Za-z0-9\\._:-]+>|\/>/,isTrulyOpeningTag:(e,n)=>{ +const a=e[0].length+e.index,t=e.input[a] +;if("<"===t||","===t)return void n.ignoreMatch();let s +;">"===t&&(((e,{after:n})=>{const a="",M={ +match:[/const|var|let/,/\s+/,b,/\s*/,/=\s*/,/(async\s*)?/,l.lookahead(C)], +keywords:"async",className:{1:"keyword",3:"title.function"},contains:[S]} +;return{name:"Javascript",aliases:["js","jsx","mjs","cjs"],keywords:g,exports:{ +PARAMS_CONTAINS:p,CLASS_REFERENCE:R},illegal:/#(?![$_A-z])/, +contains:[o.SHEBANG({label:"shebang",binary:"node",relevance:5}),{ +label:"use_strict",className:"meta",relevance:10, +begin:/^\s*['"]use (strict|asm)['"]/ +},o.APOS_STRING_MODE,o.QUOTE_STRING_MODE,y,N,_,h,{match:/\$\d+/},E,R,{ +className:"attr",begin:b+l.lookahead(":"),relevance:0},M,{ +begin:"("+o.RE_STARTERS_RE+"|\\b(case|return|throw)\\b)\\s*", +keywords:"return throw case",relevance:0,contains:[h,o.REGEXP_MODE,{ +className:"function",begin:C,returnBegin:!0,end:"\\s*=>",contains:[{ +className:"params",variants:[{begin:o.UNDERSCORE_IDENT_RE,relevance:0},{ +className:null,begin:/\(\s*\)/,skip:!0},{begin:/\(/,end:/\)/,excludeBegin:!0, +excludeEnd:!0,keywords:g,contains:p}]}]},{begin:/,/,relevance:0},{match:/\s+/, +relevance:0},{variants:[{begin:"<>",end:""},{ +match:/<[A-Za-z0-9\\._:-]+\s*\/>/},{begin:d.begin, +"on:begin":d.isTrulyOpeningTag,end:d.end}],subLanguage:"xml",contains:[{ +begin:d.begin,end:d.end,skip:!0,contains:["self"]}]}]},O,{ +beginKeywords:"while if switch catch for"},{ +begin:"\\b(?!function)"+o.UNDERSCORE_IDENT_RE+"\\([^()]*(\\([^()]*(\\([^()]*\\)[^()]*)*\\)[^()]*)*\\)\\s*\\{", +returnBegin:!0,label:"func.def",contains:[S,o.inherit(o.TITLE_MODE,{begin:b, +className:"title.function"})]},{match:/\.\.\./,relevance:0},x,{match:"\\$"+b, +relevance:0},{match:[/\bconstructor(?=\s*\()/],className:{1:"title.function"}, +contains:[S]},k,{relevance:0,match:/\b[A-Z][A-Z_0-9]+\b/, +className:"variable.constant"},w,T,{match:/\$[(.]/}]}}})() +;hljs.registerLanguage("javascript",e)})();/*! `sql` grammar compiled for Highlight.js 11.7.0 */ +(()=>{var e=(()=>{"use strict";return e=>{ +const r=e.regex,t=e.COMMENT("--","$"),n=["true","false","unknown"],a=["bigint","binary","blob","boolean","char","character","clob","date","dec","decfloat","decimal","float","int","integer","interval","nchar","nclob","national","numeric","real","row","smallint","time","timestamp","varchar","varying","varbinary"],i=["abs","acos","array_agg","asin","atan","avg","cast","ceil","ceiling","coalesce","corr","cos","cosh","count","covar_pop","covar_samp","cume_dist","dense_rank","deref","element","exp","extract","first_value","floor","json_array","json_arrayagg","json_exists","json_object","json_objectagg","json_query","json_table","json_table_primitive","json_value","lag","last_value","lead","listagg","ln","log","log10","lower","max","min","mod","nth_value","ntile","nullif","percent_rank","percentile_cont","percentile_disc","position","position_regex","power","rank","regr_avgx","regr_avgy","regr_count","regr_intercept","regr_r2","regr_slope","regr_sxx","regr_sxy","regr_syy","row_number","sin","sinh","sqrt","stddev_pop","stddev_samp","substring","substring_regex","sum","tan","tanh","translate","translate_regex","treat","trim","trim_array","unnest","upper","value_of","var_pop","var_samp","width_bucket"],s=["create table","insert into","primary key","foreign key","not null","alter table","add constraint","grouping sets","on overflow","character set","respect nulls","ignore nulls","nulls first","nulls last","depth first","breadth first"],o=i,c=["abs","acos","all","allocate","alter","and","any","are","array","array_agg","array_max_cardinality","as","asensitive","asin","asymmetric","at","atan","atomic","authorization","avg","begin","begin_frame","begin_partition","between","bigint","binary","blob","boolean","both","by","call","called","cardinality","cascaded","case","cast","ceil","ceiling","char","char_length","character","character_length","check","classifier","clob","close","coalesce","collate","collect","column","commit","condition","connect","constraint","contains","convert","copy","corr","corresponding","cos","cosh","count","covar_pop","covar_samp","create","cross","cube","cume_dist","current","current_catalog","current_date","current_default_transform_group","current_path","current_role","current_row","current_schema","current_time","current_timestamp","current_path","current_role","current_transform_group_for_type","current_user","cursor","cycle","date","day","deallocate","dec","decimal","decfloat","declare","default","define","delete","dense_rank","deref","describe","deterministic","disconnect","distinct","double","drop","dynamic","each","element","else","empty","end","end_frame","end_partition","end-exec","equals","escape","every","except","exec","execute","exists","exp","external","extract","false","fetch","filter","first_value","float","floor","for","foreign","frame_row","free","from","full","function","fusion","get","global","grant","group","grouping","groups","having","hold","hour","identity","in","indicator","initial","inner","inout","insensitive","insert","int","integer","intersect","intersection","interval","into","is","join","json_array","json_arrayagg","json_exists","json_object","json_objectagg","json_query","json_table","json_table_primitive","json_value","lag","language","large","last_value","lateral","lead","leading","left","like","like_regex","listagg","ln","local","localtime","localtimestamp","log","log10","lower","match","match_number","match_recognize","matches","max","member","merge","method","min","minute","mod","modifies","module","month","multiset","national","natural","nchar","nclob","new","no","none","normalize","not","nth_value","ntile","null","nullif","numeric","octet_length","occurrences_regex","of","offset","old","omit","on","one","only","open","or","order","out","outer","over","overlaps","overlay","parameter","partition","pattern","per","percent","percent_rank","percentile_cont","percentile_disc","period","portion","position","position_regex","power","precedes","precision","prepare","primary","procedure","ptf","range","rank","reads","real","recursive","ref","references","referencing","regr_avgx","regr_avgy","regr_count","regr_intercept","regr_r2","regr_slope","regr_sxx","regr_sxy","regr_syy","release","result","return","returns","revoke","right","rollback","rollup","row","row_number","rows","running","savepoint","scope","scroll","search","second","seek","select","sensitive","session_user","set","show","similar","sin","sinh","skip","smallint","some","specific","specifictype","sql","sqlexception","sqlstate","sqlwarning","sqrt","start","static","stddev_pop","stddev_samp","submultiset","subset","substring","substring_regex","succeeds","sum","symmetric","system","system_time","system_user","table","tablesample","tan","tanh","then","time","timestamp","timezone_hour","timezone_minute","to","trailing","translate","translate_regex","translation","treat","trigger","trim","trim_array","true","truncate","uescape","union","unique","unknown","unnest","update","upper","user","using","value","values","value_of","var_pop","var_samp","varbinary","varchar","varying","versioning","when","whenever","where","width_bucket","window","with","within","without","year","add","asc","collation","desc","final","first","last","view"].filter((e=>!i.includes(e))),l={ +begin:r.concat(/\b/,r.either(...o),/\s*\(/),relevance:0,keywords:{built_in:o}} +;return{name:"SQL",case_insensitive:!0,illegal:/[{}]|<\//,keywords:{ +$pattern:/\b[\w\.]+/,keyword:((e,{exceptions:r,when:t}={})=>{const n=t +;return r=r||[],e.map((e=>e.match(/\|\d+$/)||r.includes(e)?e:n(e)?e+"|0":e)) +})(c,{when:e=>e.length<3}),literal:n,type:a, +built_in:["current_catalog","current_date","current_default_transform_group","current_path","current_role","current_schema","current_transform_group_for_type","current_user","session_user","system_time","system_user","current_time","localtime","current_timestamp","localtimestamp"] +},contains:[{begin:r.either(...s),relevance:0,keywords:{$pattern:/[\w\.]+/, +keyword:c.concat(s),literal:n,type:a}},{className:"type", +begin:r.either("double precision","large object","with timezone","without timezone") +},l,{className:"variable",begin:/@[a-z0-9]+/},{className:"string",variants:[{ +begin:/'/,end:/'/,contains:[{begin:/''/}]}]},{begin:/"/,end:/"/,contains:[{ +begin:/""/}]},e.C_NUMBER_MODE,e.C_BLOCK_COMMENT_MODE,t,{className:"operator", +begin:/[-+*/=%^~]|&&?|\|\|?|!=?|<(?:=>?|<|>)?|>[>=]?/,relevance:0}]}}})() +;hljs.registerLanguage("sql",e)})();/*! `bash` grammar compiled for Highlight.js 11.7.0 */ +(()=>{var e=(()=>{"use strict";return e=>{const s=e.regex,t={},n={begin:/\$\{/, +end:/\}/,contains:["self",{begin:/:-/,contains:[t]}]};Object.assign(t,{ +className:"variable",variants:[{ +begin:s.concat(/\$[\w\d#@][\w\d_]*/,"(?![\\w\\d])(?![$])")},n]});const a={ +className:"subst",begin:/\$\(/,end:/\)/,contains:[e.BACKSLASH_ESCAPE]},i={ +begin:/<<-?\s*(?=\w+)/,starts:{contains:[e.END_SAME_AS_BEGIN({begin:/(\w+)/, +end:/(\w+)/,className:"string"})]}},c={className:"string",begin:/"/,end:/"/, +contains:[e.BACKSLASH_ESCAPE,t,a]};a.contains.push(c);const o={begin:/\$?\(\(/, +end:/\)\)/,contains:[{begin:/\d+#[0-9a-f]+/,className:"number"},e.NUMBER_MODE,t] +},r=e.SHEBANG({binary:"(fish|bash|zsh|sh|csh|ksh|tcsh|dash|scsh)",relevance:10 +}),l={className:"function",begin:/\w[\w\d_]*\s*\(\s*\)\s*\{/,returnBegin:!0, +contains:[e.inherit(e.TITLE_MODE,{begin:/\w[\w\d_]*/})],relevance:0};return{ +name:"Bash",aliases:["sh"],keywords:{$pattern:/\b[a-z][a-z0-9._-]+\b/, +keyword:["if","then","else","elif","fi","for","while","in","do","done","case","esac","function"], +literal:["true","false"], +built_in:["break","cd","continue","eval","exec","exit","export","getopts","hash","pwd","readonly","return","shift","test","times","trap","umask","unset","alias","bind","builtin","caller","command","declare","echo","enable","help","let","local","logout","mapfile","printf","read","readarray","source","type","typeset","ulimit","unalias","set","shopt","autoload","bg","bindkey","bye","cap","chdir","clone","comparguments","compcall","compctl","compdescribe","compfiles","compgroups","compquote","comptags","comptry","compvalues","dirs","disable","disown","echotc","echoti","emulate","fc","fg","float","functions","getcap","getln","history","integer","jobs","kill","limit","log","noglob","popd","print","pushd","pushln","rehash","sched","setcap","setopt","stat","suspend","ttyctl","unfunction","unhash","unlimit","unsetopt","vared","wait","whence","where","which","zcompile","zformat","zftp","zle","zmodload","zparseopts","zprof","zpty","zregexparse","zsocket","zstyle","ztcp","chcon","chgrp","chown","chmod","cp","dd","df","dir","dircolors","ln","ls","mkdir","mkfifo","mknod","mktemp","mv","realpath","rm","rmdir","shred","sync","touch","truncate","vdir","b2sum","base32","base64","cat","cksum","comm","csplit","cut","expand","fmt","fold","head","join","md5sum","nl","numfmt","od","paste","ptx","pr","sha1sum","sha224sum","sha256sum","sha384sum","sha512sum","shuf","sort","split","sum","tac","tail","tr","tsort","unexpand","uniq","wc","arch","basename","chroot","date","dirname","du","echo","env","expr","factor","groups","hostid","id","link","logname","nice","nohup","nproc","pathchk","pinky","printenv","printf","pwd","readlink","runcon","seq","sleep","stat","stdbuf","stty","tee","test","timeout","tty","uname","unlink","uptime","users","who","whoami","yes"] +},contains:[r,e.SHEBANG(),l,o,e.HASH_COMMENT_MODE,i,{match:/(\/[a-z._-]+)+/},c,{ +className:"",begin:/\\"/},{className:"string",begin:/'/,end:/'/},t]}}})() +;hljs.registerLanguage("bash",e)})();/*! `shell` grammar compiled for Highlight.js 11.7.0 */ +(()=>{var s=(()=>{"use strict";return s=>({name:"Shell Session", +aliases:["console","shellsession"],contains:[{className:"meta.prompt", +begin:/^\s{0,3}[/~\w\d[\]()@-]*[>%$#][ ]?/,starts:{end:/[^\\](?=\s*$)/, +subLanguage:"bash"}}]})})();hljs.registerLanguage("shell",s)})();/*! `plaintext` grammar compiled for Highlight.js 11.7.0 */ +(()=>{var t=(()=>{"use strict";return t=>({name:"Plain text", +aliases:["text","txt"],disableAutodetect:!0})})() +;hljs.registerLanguage("plaintext",t)})();/*! `graphql` grammar compiled for Highlight.js 11.7.0 */ +(()=>{var e=(()=>{"use strict";return e=>{const a=e.regex;return{name:"GraphQL", +aliases:["gql"],case_insensitive:!0,disableAutodetect:!1,keywords:{ +keyword:["query","mutation","subscription","type","input","schema","directive","interface","union","scalar","fragment","enum","on"], +literal:["true","false","null"]}, +contains:[e.HASH_COMMENT_MODE,e.QUOTE_STRING_MODE,e.NUMBER_MODE,{ +scope:"punctuation",match:/[.]{3}/,relevance:0},{scope:"punctuation", +begin:/[\!\(\)\:\=\[\]\{\|\}]{1}/,relevance:0},{scope:"variable",begin:/\$/, +end:/\W/,excludeEnd:!0,relevance:0},{scope:"meta",match:/@\w+/,excludeEnd:!0},{ +scope:"symbol",begin:a.concat(/[_A-Za-z][_0-9A-Za-z]*/,a.lookahead(/\s*:/)), +relevance:0}],illegal:[/[;<']/,/BEGIN/]}}})();hljs.registerLanguage("graphql",e) +})();/*! `ocaml` grammar compiled for Highlight.js 11.7.0 */ +(()=>{var e=(()=>{"use strict";return e=>({name:"OCaml",aliases:["ml"], +keywords:{$pattern:"[a-z_]\\w*!?", +keyword:"and as assert asr begin class constraint do done downto else end exception external for fun function functor if in include inherit! inherit initializer land lazy let lor lsl lsr lxor match method!|10 method mod module mutable new object of open! open or private rec sig struct then to try type val! val virtual when while with parser value", +built_in:"array bool bytes char exn|5 float int int32 int64 list lazy_t|5 nativeint|5 string unit in_channel out_channel ref", +literal:"true false"},illegal:/\/\/|>>/,contains:[{className:"literal", +begin:"\\[(\\|\\|)?\\]|\\(\\)",relevance:0},e.COMMENT("\\(\\*","\\*\\)",{ +contains:["self"]}),{className:"symbol",begin:"'[A-Za-z_](?!')[\\w']*"},{ +className:"type",begin:"`[A-Z][\\w']*"},{className:"type", +begin:"\\b[A-Z][\\w']*",relevance:0},{begin:"[a-z_]\\w*'[\\w']*",relevance:0 +},e.inherit(e.APOS_STRING_MODE,{className:"string",relevance:0 +}),e.inherit(e.QUOTE_STRING_MODE,{illegal:null}),{className:"number", +begin:"\\b(0[xX][a-fA-F0-9_]+[Lln]?|0[oO][0-7_]+[Lln]?|0[bB][01_]+[Lln]?|[0-9][0-9_]*([Lln]|(\\.[0-9_]*)?([eE][-+]?[0-9_]+)?)?)", +relevance:0},{begin:/->/}]})})();hljs.registerLanguage("ocaml",e)})();/*! `json` grammar compiled for Highlight.js 11.7.0 */ +(()=>{var e=(()=>{"use strict";return e=>{const a=["true","false","null"],n={ +scope:"literal",beginKeywords:a.join(" ")};return{name:"JSON",keywords:{ +literal:a},contains:[{className:"attr",begin:/"(\\.|[^\\"\r\n])*"(?=\s*:)/, +relevance:1.01},{match:/[{}[\],:]/,className:"punctuation",relevance:0 +},e.QUOTE_STRING_MODE,n,e.C_NUMBER_MODE,e.C_LINE_COMMENT_MODE,e.C_BLOCK_COMMENT_MODE], +illegal:"\\S"}}})();hljs.registerLanguage("json",e)})();/*! `python` grammar compiled for Highlight.js 11.7.0 */ +(()=>{var e=(()=>{"use strict";return e=>{ +const n=e.regex,a=/[\p{XID_Start}_]\p{XID_Continue}*/u,i=["and","as","assert","async","await","break","case","class","continue","def","del","elif","else","except","finally","for","from","global","if","import","in","is","lambda","match","nonlocal|10","not","or","pass","raise","return","try","while","with","yield"],s={ +$pattern:/[A-Za-z]\w+|__\w+__/,keyword:i, +built_in:["__import__","abs","all","any","ascii","bin","bool","breakpoint","bytearray","bytes","callable","chr","classmethod","compile","complex","delattr","dict","dir","divmod","enumerate","eval","exec","filter","float","format","frozenset","getattr","globals","hasattr","hash","help","hex","id","input","int","isinstance","issubclass","iter","len","list","locals","map","max","memoryview","min","next","object","oct","open","ord","pow","print","property","range","repr","reversed","round","set","setattr","slice","sorted","staticmethod","str","sum","super","tuple","type","vars","zip"], +literal:["__debug__","Ellipsis","False","None","NotImplemented","True"], +type:["Any","Callable","Coroutine","Dict","List","Literal","Generic","Optional","Sequence","Set","Tuple","Type","Union"] +},t={className:"meta",begin:/^(>>>|\.\.\.) /},r={className:"subst",begin:/\{/, +end:/\}/,keywords:s,illegal:/#/},l={begin:/\{\{/,relevance:0},b={ +className:"string",contains:[e.BACKSLASH_ESCAPE],variants:[{ +begin:/([uU]|[bB]|[rR]|[bB][rR]|[rR][bB])?'''/,end:/'''/, +contains:[e.BACKSLASH_ESCAPE,t],relevance:10},{ +begin:/([uU]|[bB]|[rR]|[bB][rR]|[rR][bB])?"""/,end:/"""/, +contains:[e.BACKSLASH_ESCAPE,t],relevance:10},{ +begin:/([fF][rR]|[rR][fF]|[fF])'''/,end:/'''/, +contains:[e.BACKSLASH_ESCAPE,t,l,r]},{begin:/([fF][rR]|[rR][fF]|[fF])"""/, +end:/"""/,contains:[e.BACKSLASH_ESCAPE,t,l,r]},{begin:/([uU]|[rR])'/,end:/'/, +relevance:10},{begin:/([uU]|[rR])"/,end:/"/,relevance:10},{ +begin:/([bB]|[bB][rR]|[rR][bB])'/,end:/'/},{begin:/([bB]|[bB][rR]|[rR][bB])"/, +end:/"/},{begin:/([fF][rR]|[rR][fF]|[fF])'/,end:/'/, +contains:[e.BACKSLASH_ESCAPE,l,r]},{begin:/([fF][rR]|[rR][fF]|[fF])"/,end:/"/, +contains:[e.BACKSLASH_ESCAPE,l,r]},e.APOS_STRING_MODE,e.QUOTE_STRING_MODE] +},o="[0-9](_?[0-9])*",c=`(\\b(${o}))?\\.(${o})|\\b(${o})\\.`,d="\\b|"+i.join("|"),g={ +className:"number",relevance:0,variants:[{ +begin:`(\\b(${o})|(${c}))[eE][+-]?(${o})[jJ]?(?=${d})`},{begin:`(${c})[jJ]?`},{ +begin:`\\b([1-9](_?[0-9])*|0+(_?0)*)[lLjJ]?(?=${d})`},{ +begin:`\\b0[bB](_?[01])+[lL]?(?=${d})`},{begin:`\\b0[oO](_?[0-7])+[lL]?(?=${d})` +},{begin:`\\b0[xX](_?[0-9a-fA-F])+[lL]?(?=${d})`},{begin:`\\b(${o})[jJ](?=${d})` +}]},p={className:"comment",begin:n.lookahead(/# type:/),end:/$/,keywords:s, +contains:[{begin:/# type:/},{begin:/#/,end:/\b\B/,endsWithParent:!0}]},m={ +className:"params",variants:[{className:"",begin:/\(\s*\)/,skip:!0},{begin:/\(/, +end:/\)/,excludeBegin:!0,excludeEnd:!0,keywords:s, +contains:["self",t,g,b,e.HASH_COMMENT_MODE]}]};return r.contains=[b,g,t],{ +name:"Python",aliases:["py","gyp","ipython"],unicodeRegex:!0,keywords:s, +illegal:/(<\/|->|\?)|=>/,contains:[t,g,{begin:/\bself\b/},{beginKeywords:"if", +relevance:0},b,p,e.HASH_COMMENT_MODE,{match:[/\bdef/,/\s+/,a],scope:{ +1:"keyword",3:"title.function"},contains:[m]},{variants:[{ +match:[/\bclass/,/\s+/,a,/\s*/,/\(\s*/,a,/\s*\)/]},{match:[/\bclass/,/\s+/,a]}], +scope:{1:"keyword",3:"title.class",6:"title.class.inherited"}},{ +className:"meta",begin:/^[\t ]*@/,end:/(?=#)|$/,contains:[g,m,b]}]}}})() +;hljs.registerLanguage("python",e)})();/*! `xml` grammar compiled for Highlight.js 11.7.0 */ +(()=>{var e=(()=>{"use strict";return e=>{ +const a=e.regex,n=a.concat(/[\p{L}_]/u,a.optional(/[\p{L}0-9_.-]*:/u),/[\p{L}0-9_.-]*/u),s={ +className:"symbol",begin:/&[a-z]+;|&#[0-9]+;|&#x[a-f0-9]+;/},t={begin:/\s/, +contains:[{className:"keyword",begin:/#?[a-z_][a-z1-9_-]+/,illegal:/\n/}] +},i=e.inherit(t,{begin:/\(/,end:/\)/}),c=e.inherit(e.APOS_STRING_MODE,{ +className:"string"}),l=e.inherit(e.QUOTE_STRING_MODE,{className:"string"}),r={ +endsWithParent:!0,illegal:/`]+/}]}]}]};return{ +name:"HTML, XML", +aliases:["html","xhtml","rss","atom","xjb","xsd","xsl","plist","wsf","svg"], +case_insensitive:!0,unicodeRegex:!0,contains:[{className:"meta",begin://,relevance:10,contains:[t,l,c,i,{begin:/\[/,end:/\]/,contains:[{ +className:"meta",begin://,contains:[t,i,l,c]}]}] +},e.COMMENT(//,{relevance:10}),{begin://, +relevance:10},s,{className:"meta",end:/\?>/,variants:[{begin:/<\?xml/, +relevance:10,contains:[l]},{begin:/<\?[a-z][a-z0-9]+/}]},{className:"tag", +begin:/)/,end:/>/,keywords:{name:"style"},contains:[r],starts:{ +end:/<\/style>/,returnEnd:!0,subLanguage:["css","xml"]}},{className:"tag", +begin:/)/,end:/>/,keywords:{name:"script"},contains:[r],starts:{ +end:/<\/script>/,returnEnd:!0,subLanguage:["javascript","handlebars","xml"]}},{ +className:"tag",begin:/<>|<\/>/},{className:"tag", +begin:a.concat(//,/>/,/\s/)))), +end:/\/?>/,contains:[{className:"name",begin:n,relevance:0,starts:r}]},{ +className:"tag",begin:a.concat(/<\//,a.lookahead(a.concat(n,/>/))),contains:[{ +className:"name",begin:n,relevance:0},{begin:/>/,relevance:0,endsParent:!0}]}]}} +})();hljs.registerLanguage("xml",e)})();/*! `markdown` grammar compiled for Highlight.js 11.7.0 */ +(()=>{var e=(()=>{"use strict";return e=>{const n={begin:/<\/?[A-Za-z_]/, +end:">",subLanguage:"xml",relevance:0},a={variants:[{begin:/\[.+?\]\[.*?\]/, +relevance:0},{ +begin:/\[.+?\]\(((data|javascript|mailto):|(?:http|ftp)s?:\/\/).*?\)/, +relevance:2},{ +begin:e.regex.concat(/\[.+?\]\(/,/[A-Za-z][A-Za-z0-9+.-]*/,/:\/\/.*?\)/), +relevance:2},{begin:/\[.+?\]\([./?&#].*?\)/,relevance:1},{ +begin:/\[.*?\]\(.*?\)/,relevance:0}],returnBegin:!0,contains:[{match:/\[(?=\])/ +},{className:"string",relevance:0,begin:"\\[",end:"\\]",excludeBegin:!0, +returnEnd:!0},{className:"link",relevance:0,begin:"\\]\\(",end:"\\)", +excludeBegin:!0,excludeEnd:!0},{className:"symbol",relevance:0,begin:"\\]\\[", +end:"\\]",excludeBegin:!0,excludeEnd:!0}]},i={className:"strong",contains:[], +variants:[{begin:/_{2}(?!\s)/,end:/_{2}/},{begin:/\*{2}(?!\s)/,end:/\*{2}/}] +},s={className:"emphasis",contains:[],variants:[{begin:/\*(?![*\s])/,end:/\*/},{ +begin:/_(?![_\s])/,end:/_/,relevance:0}]},c=e.inherit(i,{contains:[] +}),t=e.inherit(s,{contains:[]});i.contains.push(t),s.contains.push(c) +;let g=[n,a];return[i,s,c,t].forEach((e=>{e.contains=e.contains.concat(g) +})),g=g.concat(i,s),{name:"Markdown",aliases:["md","mkdown","mkd"],contains:[{ +className:"section",variants:[{begin:"^#{1,6}",end:"$",contains:g},{ +begin:"(?=^.+?\\n[=-]{2,}$)",contains:[{begin:"^[=-]*$"},{begin:"^",end:"\\n", +contains:g}]}]},n,{className:"bullet",begin:"^[ \t]*([*+-]|(\\d+\\.))(?=\\s+)", +end:"\\s+",excludeEnd:!0},i,s,{className:"quote",begin:"^>\\s+",contains:g, +end:"$"},{className:"code",variants:[{begin:"(`{3,})[^`](.|\\n)*?\\1`*[ ]*"},{ +begin:"(~{3,})[^~](.|\\n)*?\\1~*[ ]*"},{begin:"```",end:"```+[ ]*$"},{ +begin:"~~~",end:"~~~+[ ]*$"},{begin:"`.+?`"},{begin:"(?=^( {4}|\\t))", +contains:[{begin:"^( {4}|\\t)",end:"(\\n)$"}],relevance:0}]},{ +begin:"^[-\\*]{3,}",end:"$"},a,{begin:/^\[[^\n]+\]:/,returnBegin:!0,contains:[{ +className:"symbol",begin:/\[/,end:/\]/,excludeBegin:!0,excludeEnd:!0},{ +className:"link",begin:/:\s*/,end:/$/,excludeBegin:!0}]}]}}})() +;hljs.registerLanguage("markdown",e)})();/*! `c` grammar compiled for Highlight.js 11.7.0 */ +(()=>{var e=(()=>{"use strict";return e=>{const n=e.regex,t=e.COMMENT("//","$",{ +contains:[{begin:/\\\n/}] +}),s="[a-zA-Z_]\\w*::",a="(decltype\\(auto\\)|"+n.optional(s)+"[a-zA-Z_]\\w*"+n.optional("<[^<>]+>")+")",r={ +className:"type",variants:[{begin:"\\b[a-z\\d_]*_t\\b"},{ +match:/\batomic_[a-z]{3,6}\b/}]},i={className:"string",variants:[{ +begin:'(u8?|U|L)?"',end:'"',illegal:"\\n",contains:[e.BACKSLASH_ESCAPE]},{ +begin:"(u8?|U|L)?'(\\\\(x[0-9A-Fa-f]{2}|u[0-9A-Fa-f]{4,8}|[0-7]{3}|\\S)|.)", +end:"'",illegal:"."},e.END_SAME_AS_BEGIN({ +begin:/(?:u8?|U|L)?R"([^()\\ ]{0,16})\(/,end:/\)([^()\\ ]{0,16})"/})]},l={ +className:"number",variants:[{begin:"\\b(0b[01']+)"},{ +begin:"(-?)\\b([\\d']+(\\.[\\d']*)?|\\.[\\d']+)((ll|LL|l|L)(u|U)?|(u|U)(ll|LL|l|L)?|f|F|b|B)" +},{ +begin:"(-?)(\\b0[xX][a-fA-F0-9']+|(\\b[\\d']+(\\.[\\d']*)?|\\.[\\d']+)([eE][-+]?[\\d']+)?)" +}],relevance:0},o={className:"meta",begin:/#\s*[a-z]+\b/,end:/$/,keywords:{ +keyword:"if else elif endif define undef warning error line pragma _Pragma ifdef ifndef include" +},contains:[{begin:/\\\n/,relevance:0},e.inherit(i,{className:"string"}),{ +className:"string",begin:/<.*?>/},t,e.C_BLOCK_COMMENT_MODE]},c={ +className:"title",begin:n.optional(s)+e.IDENT_RE,relevance:0 +},d=n.optional(s)+e.IDENT_RE+"\\s*\\(",u={ +keyword:["asm","auto","break","case","continue","default","do","else","enum","extern","for","fortran","goto","if","inline","register","restrict","return","sizeof","struct","switch","typedef","union","volatile","while","_Alignas","_Alignof","_Atomic","_Generic","_Noreturn","_Static_assert","_Thread_local","alignas","alignof","noreturn","static_assert","thread_local","_Pragma"], +type:["float","double","signed","unsigned","int","short","long","char","void","_Bool","_Complex","_Imaginary","_Decimal32","_Decimal64","_Decimal128","const","static","complex","bool","imaginary"], +literal:"true false NULL", +built_in:"std string wstring cin cout cerr clog stdin stdout stderr stringstream istringstream ostringstream auto_ptr deque list queue stack vector map set pair bitset multiset multimap unordered_set unordered_map unordered_multiset unordered_multimap priority_queue make_pair array shared_ptr abort terminate abs acos asin atan2 atan calloc ceil cosh cos exit exp fabs floor fmod fprintf fputs free frexp fscanf future isalnum isalpha iscntrl isdigit isgraph islower isprint ispunct isspace isupper isxdigit tolower toupper labs ldexp log10 log malloc realloc memchr memcmp memcpy memset modf pow printf putchar puts scanf sinh sin snprintf sprintf sqrt sscanf strcat strchr strcmp strcpy strcspn strlen strncat strncmp strncpy strpbrk strrchr strspn strstr tanh tan vfprintf vprintf vsprintf endl initializer_list unique_ptr" +},g=[o,r,t,e.C_BLOCK_COMMENT_MODE,l,i],m={variants:[{begin:/=/,end:/;/},{ +begin:/\(/,end:/\)/},{beginKeywords:"new throw return else",end:/;/}], +keywords:u,contains:g.concat([{begin:/\(/,end:/\)/,keywords:u, +contains:g.concat(["self"]),relevance:0}]),relevance:0},p={ +begin:"("+a+"[\\*&\\s]+)+"+d,returnBegin:!0,end:/[{;=]/,excludeEnd:!0, +keywords:u,illegal:/[^\w\s\*&:<>.]/,contains:[{begin:"decltype\\(auto\\)", +keywords:u,relevance:0},{begin:d,returnBegin:!0,contains:[e.inherit(c,{ +className:"title.function"})],relevance:0},{relevance:0,match:/,/},{ +className:"params",begin:/\(/,end:/\)/,keywords:u,relevance:0, +contains:[t,e.C_BLOCK_COMMENT_MODE,i,l,r,{begin:/\(/,end:/\)/,keywords:u, +relevance:0,contains:["self",t,e.C_BLOCK_COMMENT_MODE,i,l,r]}] +},r,t,e.C_BLOCK_COMMENT_MODE,o]};return{name:"C",aliases:["h"],keywords:u, +disableAutodetect:!0,illegal:"=]/,contains:[{ +beginKeywords:"final class struct"},e.TITLE_MODE]}]),exports:{preprocessor:o, +strings:i,keywords:u}}}})();hljs.registerLanguage("c",e)})(); diff --git a/hmap/Hmap/Key/index.html b/hmap/Hmap/Key/index.html new file mode 100644 index 0000000..14f48ef --- /dev/null +++ b/hmap/Hmap/Key/index.html @@ -0,0 +1,2 @@ + +Key (hmap.Hmap.Key)

    Module Hmap.Key

    Keys.

    Keys

    val create : unit -> 'a key

    create () is a new key.

    Existential keys

    Exisential keys allows to compare keys. This can be useful for functions like filter.

    type t

    The type for existential keys.

    val hide_type : 'a key -> t

    hide_type k is an existential key for k.

    val equal : t -> t -> bool

    equal k k' is true iff k and k' are the same key.

    val compare : t -> t -> int

    compare k k' is a total order on keys compatible with equal.

    diff --git a/hmap/Hmap/Make/Key/index.html b/hmap/Hmap/Make/Key/index.html new file mode 100644 index 0000000..9559c5c --- /dev/null +++ b/hmap/Hmap/Make/Key/index.html @@ -0,0 +1,2 @@ + +Key (hmap.Hmap.Make.Key)

    Module Make.Key

    Keys.

    Keys

    type 'a info = 'a Key_info.t

    The type for key information.

    val create : 'a info -> 'a key

    create i is a new key with information i.

    val info : 'a key -> 'a info

    info k is k's information.

    Existential keys

    Exisential keys allow to compare keys. This can be useful for functions like filter.

    type t

    The type for existential keys.

    val hide_type : 'a key -> t

    hide_type k is an existential key for k.

    val equal : t -> t -> bool

    equal k k' is true iff k and k' are the same key.

    val compare : t -> t -> int

    compare k k' is a total order on keys compatible with equal.

    diff --git a/hmap/Hmap/Make/argument-1-Key_info/index.html b/hmap/Hmap/Make/argument-1-Key_info/index.html new file mode 100644 index 0000000..b41bb69 --- /dev/null +++ b/hmap/Hmap/Make/argument-1-Key_info/index.html @@ -0,0 +1,2 @@ + +Key_info (hmap.Hmap.Make.Key_info)

    Parameter Make.Key_info

    type 'a t

    The type for key information.

    diff --git a/hmap/Hmap/Make/index.html b/hmap/Hmap/Make/index.html new file mode 100644 index 0000000..388d5a4 --- /dev/null +++ b/hmap/Hmap/Make/index.html @@ -0,0 +1,2 @@ + +Make (hmap.Hmap.Make)

    Module Hmap.Make

    Functor for heterogeneous maps whose keys hold information of type Key_info.t

    Parameters

    Signature

    Keys

    type 'a key

    The type for keys whose lookup value is of type 'a.

    module Key : sig ... end

    Keys.

    Maps

    type t

    The type for heterogeneous value maps.

    val empty : t

    empty is the empty map.

    val is_empty : t -> bool

    is_empty m is true iff m is empty.

    val mem : 'a key -> t -> bool

    mem k m is true iff k is bound in m.

    val add : 'a key -> 'a -> t -> t

    add k v m is m with k bound to v.

    val singleton : 'a key -> 'a -> t

    singleton k v is add k v empty.

    val rem : 'a key -> t -> t

    rem k m is m with k unbound.

    val find : 'a key -> t -> 'a option

    find k m is the value of k's binding in m, if any.

    val get : 'a key -> t -> 'a

    get k m is the value of k's binding in m.

    • raises Invalid_argument

      if k is not bound in m.

    type binding =
    1. | B : 'a key * 'a -> binding

    The type for bindings.

    val iter : (binding -> unit) -> t -> unit

    iter f m applies f to all bindings of m.

    val fold : (binding -> 'a -> 'a) -> t -> 'a -> 'a

    fold f m acc folds over the bindings of m with f, starting with acc

    val for_all : (binding -> bool) -> t -> bool

    for_all p m is true iff all bindings of m satisfy p.

    val exists : (binding -> bool) -> t -> bool

    exists p m is true iff there exists a bindings of m that satisfies p.

    val filter : (binding -> bool) -> t -> t

    filter p m are the bindings of m that satisfy p.

    val cardinal : t -> int

    cardinal m is the number of bindings in m.

    val any_binding : t -> binding option

    any_binding m is a binding of m (if not empty).

    val get_any_binding : t -> binding

    get_any_binding m is a binding of m.

    • raises Invalid_argument

      if m is empty.

    diff --git a/hmap/Hmap/index.html b/hmap/Hmap/index.html new file mode 100644 index 0000000..651dab2 --- /dev/null +++ b/hmap/Hmap/index.html @@ -0,0 +1,2 @@ + +Hmap (hmap.Hmap)

    Module Hmap

    Heterogeneous value maps.

    v0.8.1 - homepage

    Keys

    type 'a key

    The type for keys whose lookup value is of type 'a.

    module Key : sig ... end

    Keys.

    Maps

    type t

    The type for heterogeneous value maps.

    val empty : t

    empty is the empty map.

    val is_empty : t -> bool

    is_empty m is true iff m is empty.

    val mem : 'a key -> t -> bool

    mem k m is true iff k is bound in m.

    val add : 'a key -> 'a -> t -> t

    add k v m is m with k bound to v.

    val singleton : 'a key -> 'a -> t

    singleton k v is add k v empty.

    val rem : 'a key -> t -> t

    rem k m is m with k unbound.

    val find : 'a key -> t -> 'a option

    find k m is the value of k's binding in m, if any.

    val get : 'a key -> t -> 'a

    get k m is the value of k's binding in m.

    • raises Invalid_argument

      if k is not bound in m.

    type binding =
    1. | B : 'a key * 'a -> binding

    The type for bindings.

    val iter : (binding -> unit) -> t -> unit

    iter f m applies f to all bindings of m.

    val fold : (binding -> 'a -> 'a) -> t -> 'a -> 'a

    fold f m acc folds over the bindings of m with f, starting with acc

    val for_all : (binding -> bool) -> t -> bool

    for_all p m is true iff all bindings of m satisfy p.

    val exists : (binding -> bool) -> t -> bool

    exists p m is true iff there exists a bindings of m that satisfies p.

    val filter : (binding -> bool) -> t -> t

    filter p m are the bindings of m that satisfy p.

    val cardinal : t -> int

    cardinal m is the number of bindings in m.

    val any_binding : t -> binding option

    any_binding m is a binding of m (if not empty).

    val get_any_binding : t -> binding

    get_any_binding m is a binding of m.

    • raises Invalid_argument

      if m is empty.

    Functorial interface

    The functorial interface allows to associate more information to the keys. For example a key name or a key value pretty-printer.

    module type KEY_INFO = sig ... end

    The type for key information.

    module type S = sig ... end

    Output signature of the functor Make

    module Make (Key_info : KEY_INFO) : S with type 'a Key.info = 'a Key_info.t

    Functor for heterogeneous maps whose keys hold information of type Key_info.t

    diff --git a/hmap/Hmap/module-type-KEY_INFO/index.html b/hmap/Hmap/module-type-KEY_INFO/index.html new file mode 100644 index 0000000..451d1fd --- /dev/null +++ b/hmap/Hmap/module-type-KEY_INFO/index.html @@ -0,0 +1,2 @@ + +KEY_INFO (hmap.Hmap.KEY_INFO)

    Module type Hmap.KEY_INFO

    The type for key information.

    type 'a t

    The type for key information.

    diff --git a/hmap/Hmap/module-type-S/Key/index.html b/hmap/Hmap/module-type-S/Key/index.html new file mode 100644 index 0000000..b9da930 --- /dev/null +++ b/hmap/Hmap/module-type-S/Key/index.html @@ -0,0 +1,2 @@ + +Key (hmap.Hmap.S.Key)

    Module S.Key

    Keys.

    Keys

    type 'a info

    The type for key information.

    val create : 'a info -> 'a key

    create i is a new key with information i.

    val info : 'a key -> 'a info

    info k is k's information.

    Existential keys

    Exisential keys allow to compare keys. This can be useful for functions like filter.

    type t

    The type for existential keys.

    val hide_type : 'a key -> t

    hide_type k is an existential key for k.

    val equal : t -> t -> bool

    equal k k' is true iff k and k' are the same key.

    val compare : t -> t -> int

    compare k k' is a total order on keys compatible with equal.

    diff --git a/hmap/Hmap/module-type-S/index.html b/hmap/Hmap/module-type-S/index.html new file mode 100644 index 0000000..6190b3b --- /dev/null +++ b/hmap/Hmap/module-type-S/index.html @@ -0,0 +1,2 @@ + +S (hmap.Hmap.S)

    Module type Hmap.S

    Output signature of the functor Make

    Keys

    type 'a key

    The type for keys whose lookup value is of type 'a.

    module Key : sig ... end

    Keys.

    Maps

    type t

    The type for heterogeneous value maps.

    val empty : t

    empty is the empty map.

    val is_empty : t -> bool

    is_empty m is true iff m is empty.

    val mem : 'a key -> t -> bool

    mem k m is true iff k is bound in m.

    val add : 'a key -> 'a -> t -> t

    add k v m is m with k bound to v.

    val singleton : 'a key -> 'a -> t

    singleton k v is add k v empty.

    val rem : 'a key -> t -> t

    rem k m is m with k unbound.

    val find : 'a key -> t -> 'a option

    find k m is the value of k's binding in m, if any.

    val get : 'a key -> t -> 'a

    get k m is the value of k's binding in m.

    • raises Invalid_argument

      if k is not bound in m.

    type binding =
    1. | B : 'a key * 'a -> binding

    The type for bindings.

    val iter : (binding -> unit) -> t -> unit

    iter f m applies f to all bindings of m.

    val fold : (binding -> 'a -> 'a) -> t -> 'a -> 'a

    fold f m acc folds over the bindings of m with f, starting with acc

    val for_all : (binding -> bool) -> t -> bool

    for_all p m is true iff all bindings of m satisfy p.

    val exists : (binding -> bool) -> t -> bool

    exists p m is true iff there exists a bindings of m that satisfies p.

    val filter : (binding -> bool) -> t -> t

    filter p m are the bindings of m that satisfy p.

    val cardinal : t -> int

    cardinal m is the number of bindings in m.

    val any_binding : t -> binding option

    any_binding m is a binding of m (if not empty).

    val get_any_binding : t -> binding

    get_any_binding m is a binding of m.

    • raises Invalid_argument

      if m is empty.

    diff --git a/hmap/_doc-dir/CHANGES.md b/hmap/_doc-dir/CHANGES.md new file mode 100644 index 0000000..ac21d5b --- /dev/null +++ b/hmap/_doc-dir/CHANGES.md @@ -0,0 +1,9 @@ +v0.8.1 2017-10-03 Zagreb +------------------------ + +* Build depend on topkg. + +v0.8.0 2016-03-08 La Forclaz (VS) +--------------------------------- + +First release. diff --git a/hmap/_doc-dir/LICENSE.md b/hmap/_doc-dir/LICENSE.md new file mode 100644 index 0000000..ca386f0 --- /dev/null +++ b/hmap/_doc-dir/LICENSE.md @@ -0,0 +1,13 @@ + Copyright (c) 2016 Daniel C. Bünzli + + Permission to use, copy, modify, and/or distribute this software for any + purpose with or without fee is hereby granted, provided that the above + copyright notice and this permission notice appear in all copies. + + THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES + WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF + MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR + ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES + WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN + ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF + OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. diff --git a/hmap/_doc-dir/README.md b/hmap/_doc-dir/README.md new file mode 100644 index 0000000..3f4d1ca --- /dev/null +++ b/hmap/_doc-dir/README.md @@ -0,0 +1,43 @@ +Hmap — Heterogeneous value maps for OCaml +------------------------------------------------------------------------------- +v0.8.1 + +Hmap provides heterogeneous value maps for OCaml. These maps bind keys +to values with arbitrary types. Keys witness the type of the value +they are bound to which allows to add and lookup bindings in a type +safe manner. + +Hmap has no dependency and is distributed under the ISC license. + +Home page: http://erratique.ch/software/hmap +Contact: Daniel Bünzli `` + +## Installation + +Hmap can be installed with `opam`: + + opam install hmap + +If you don't use `opam` consult the [`opam`](opam) file for build +instructions. + +## Documentation + +The documentation and API reference is automatically generated by +`ocamldoc` from the interfaces. It can be consulted [online][doc] +and there is a generated version in the `doc` directory of the +distribution. + +[doc]: http://erratique.ch/software/hmap/doc + +## Sample programs + +If you installed Hmap with `opam` sample programs are located in +the directory `opam config var hmap:doc`. + +In the distribution sample programs and tests are located in the +[`test`](test) directory of the distribution. They can be built an run +with + + topkg build --tests true + topkg test diff --git a/hmap/index.html b/hmap/index.html new file mode 100644 index 0000000..bbbbeb7 --- /dev/null +++ b/hmap/index.html @@ -0,0 +1,2 @@ + +index (hmap.index)

    Package hmap

    • Hmap Heterogeneous value maps.

    Package info

    changes-files
    license-files
    readme-files
    diff --git a/index.html b/index.html new file mode 100644 index 0000000..05abb47 --- /dev/null +++ b/index.html @@ -0,0 +1,2 @@ + +_opam

    OCaml package documentation

    Browse by name, by tag, the standard library and the OCaml manual (online, latest version).

    Generated for /home/runner/work/nanoev/nanoev/_opam/lib

    Packages by name

    h

    1. hmap

    i

    1. iostream

    n

    1. nanoev
    2. nanoev-picos
    3. nanoev-posix
    4. nanoev_tiny_httpd

    o

    1. ocaml

    p

    1. picos

    t

    1. tiny_httpd
    2. trace

    Packages by tag

    \ No newline at end of file diff --git a/iostream/Iostream/In/class-empty/index.html b/iostream/Iostream/In/class-empty/index.html new file mode 100644 index 0000000..12e779b --- /dev/null +++ b/iostream/Iostream/In/class-empty/index.html @@ -0,0 +1,2 @@ + +empty (iostream.Iostream.In.empty)

    Class In.empty

    method input : bytes -> int -> int -> int

    Read into the slice. Returns 0 only if the stream is closed.

    method close : unit -> unit

    Close the input. Must be idempotent.

    diff --git a/iostream/Iostream/In/class-of_bytes/index.html b/iostream/Iostream/In/class-of_bytes/index.html new file mode 100644 index 0000000..d4eb266 --- /dev/null +++ b/iostream/Iostream/In/class-of_bytes/index.html @@ -0,0 +1,2 @@ + +of_bytes (iostream.Iostream.In.of_bytes)

    Class In.of_bytes

    inherit t
    inherit Iostream__.Seekable.t
    diff --git a/iostream/Iostream/In/class-of_in_channel/index.html b/iostream/Iostream/In/class-of_in_channel/index.html new file mode 100644 index 0000000..32d1d66 --- /dev/null +++ b/iostream/Iostream/In/class-of_in_channel/index.html @@ -0,0 +1,2 @@ + +of_in_channel (iostream.Iostream.In.of_in_channel)

    Class In.of_in_channel

    inherit t
    inherit Iostream__.Seekable.t
    diff --git a/iostream/Iostream/In/class-of_string/index.html b/iostream/Iostream/In/class-of_string/index.html new file mode 100644 index 0000000..64d9d1c --- /dev/null +++ b/iostream/Iostream/In/class-of_string/index.html @@ -0,0 +1,2 @@ + +of_string (iostream.Iostream.In.of_string)

    Class In.of_string

    inherit t
    inherit Iostream__.Seekable.t
    diff --git a/iostream/Iostream/In/class-open_file/index.html b/iostream/Iostream/In/class-open_file/index.html new file mode 100644 index 0000000..a0c263f --- /dev/null +++ b/iostream/Iostream/In/class-open_file/index.html @@ -0,0 +1,2 @@ + +open_file (iostream.Iostream.In.open_file)

    Class In.open_file

    inherit t
    inherit Iostream__.Seekable.t
    diff --git a/iostream/Iostream/In/class-type-t/index.html b/iostream/Iostream/In/class-type-t/index.html new file mode 100644 index 0000000..c8da54d --- /dev/null +++ b/iostream/Iostream/In/class-type-t/index.html @@ -0,0 +1,2 @@ + +t (iostream.Iostream.In.t)

    Class type In.t

    An input stream, i.e an incoming stream of bytes.

    This can be a string, an int_channel, an Unix.file_descr, a decompression wrapper around another input stream, etc.

    method input : bytes -> int -> int -> int

    Read into the slice. Returns 0 only if the stream is closed.

    method close : unit -> unit

    Close the input. Must be idempotent.

    diff --git a/iostream/Iostream/In/class-type-t_seekable/index.html b/iostream/Iostream/In/class-type-t_seekable/index.html new file mode 100644 index 0000000..11bcb2b --- /dev/null +++ b/iostream/Iostream/In/class-type-t_seekable/index.html @@ -0,0 +1,2 @@ + +t_seekable (iostream.Iostream.In.t_seekable)

    Class type In.t_seekable

    An input stream that is also seekable.

    inherit t
    inherit Iostream__.Seekable.t
    diff --git a/iostream/Iostream/In/index.html b/iostream/Iostream/In/index.html new file mode 100644 index 0000000..e6d6738 --- /dev/null +++ b/iostream/Iostream/In/index.html @@ -0,0 +1,18 @@ + +In (iostream.Iostream.In)

    Module Iostream.In

    Input stream.

    class type t = object ... end

    An input stream, i.e an incoming stream of bytes.

    class type t_seekable = object ... end

    An input stream that is also seekable.

    val create : + ?close:(unit -> unit) -> + input:(bytes -> int -> int -> int) -> + unit -> + t
    class empty : t
    val empty : t

    Empty input, contains 0 bytes.

    class of_in_channel : ?close_noerr:bool -> in_channel -> t_seekable
    val of_in_channel : ?close_noerr:bool -> in_channel -> t_seekable

    Wrap a standard input channel.

    class open_file : ?close_noerr:bool -> ?mode:int -> ?flags:open_flag list -> string -> + t_seekable
    val open_file : + ?close_noerr:bool -> + ?mode:int -> + ?flags:open_flag list -> + string -> + t_seekable
    val with_open_file : + ?close_noerr:bool -> + ?mode:int -> + ?flags:open_flag list -> + string -> + (t_seekable -> 'a) -> + 'a
    class of_string : ?off:int -> ?len:int -> string -> t_seekable
    val of_string : ?off:int -> ?len:int -> string -> t_seekable

    An input channel reading from the string.

    • parameter offset

      initial offset in the string. Default 0.

    • parameter len

      the length of the slice we read from. Default String.length s - off.

    class of_bytes : ?off:int -> ?len:int -> bytes -> t_seekable
    val of_bytes : ?off:int -> ?len:int -> bytes -> t_seekable

    An input channel reading from the bytes buffer. See of_string for more details.

    val input : t -> bytes -> int -> int -> int

    Read bytes into the given buffer. This returns 0 only if the stream has reached its end.

    • raises Invalid_argument

      if the arguments do not denote a valid slice.

    val input_all_into_buffer : t -> Stdlib.Buffer.t -> unit

    Read the whole content into the given buffer.

    • since 0.2
    val input_all : ?buf:bytes -> t -> string

    input_all ic reads the whole content of ic into a string.

    • parameter buf

      the initial buffer to use internally.

    • since 0.2
    val really_input : t -> bytes -> int -> int -> unit

    Same as input, but reads exactly the demanded amount of bytes.

    • raises Invalid_argument

      if the arguments do not denote a valid slice.

    • raises End_of_file

      if the input does not contain enough data.

    • since 0.2
    val really_input_string : t -> int -> string

    really_input_string ic n reads exactly n bytes of ic and returns them as a string.

    • raises End_of_file

      if the input does not contain enough data.

    • since 0.2
    val concat : t list -> t

    Read from each stream, in order

    val close : t -> unit

    Close the input stream. This is idempotent.

    val copy_into : ?buf:bytes -> t -> Out.t -> unit

    Copy the whole stream into the given output.

    val map_char : (char -> char) -> t -> t

    Transform the stream byte by byte

    diff --git a/iostream/Iostream/In_buf/class-bufferized/index.html b/iostream/Iostream/In_buf/class-bufferized/index.html new file mode 100644 index 0000000..669b200 --- /dev/null +++ b/iostream/Iostream/In_buf/class-bufferized/index.html @@ -0,0 +1,2 @@ + +bufferized (iostream.Iostream.In_buf.bufferized)

    Class In_buf.bufferized

    inherit Iostream__.In.t
    method fill_buf : unit -> Iostream__.Slice.t

    ic#fill_buf() returns a slice into the ic's internal buffer, and ensures it's empty only if ic.ic is empty. In other words, the invariant is that this only returns an empty slice if the input stream is exhausted.

    method consume : int -> unit

    Consume n bytes from the inner buffer. This is only valid if the last call to fill_buf returned a slice with at least n bytes.

    diff --git a/iostream/Iostream/In_buf/class-of_bytes/index.html b/iostream/Iostream/In_buf/class-of_bytes/index.html new file mode 100644 index 0000000..d21f9c0 --- /dev/null +++ b/iostream/Iostream/In_buf/class-of_bytes/index.html @@ -0,0 +1,2 @@ + +of_bytes (iostream.Iostream.In_buf.of_bytes)

    Class In_buf.of_bytes

    inherit Iostream__.In.t
    method fill_buf : unit -> Iostream__.Slice.t

    ic#fill_buf() returns a slice into the ic's internal buffer, and ensures it's empty only if ic.ic is empty. In other words, the invariant is that this only returns an empty slice if the input stream is exhausted.

    method consume : int -> unit

    Consume n bytes from the inner buffer. This is only valid if the last call to fill_buf returned a slice with at least n bytes.

    diff --git a/iostream/Iostream/In_buf/class-of_in_channel/index.html b/iostream/Iostream/In_buf/class-of_in_channel/index.html new file mode 100644 index 0000000..c0b826b --- /dev/null +++ b/iostream/Iostream/In_buf/class-of_in_channel/index.html @@ -0,0 +1,2 @@ + +of_in_channel (iostream.Iostream.In_buf.of_in_channel)

    Class In_buf.of_in_channel

    inherit Iostream__.In.t
    method fill_buf : unit -> Iostream__.Slice.t

    ic#fill_buf() returns a slice into the ic's internal buffer, and ensures it's empty only if ic.ic is empty. In other words, the invariant is that this only returns an empty slice if the input stream is exhausted.

    method consume : int -> unit

    Consume n bytes from the inner buffer. This is only valid if the last call to fill_buf returned a slice with at least n bytes.

    diff --git a/iostream/Iostream/In_buf/class-of_string/index.html b/iostream/Iostream/In_buf/class-of_string/index.html new file mode 100644 index 0000000..edc11e7 --- /dev/null +++ b/iostream/Iostream/In_buf/class-of_string/index.html @@ -0,0 +1,2 @@ + +of_string (iostream.Iostream.In_buf.of_string)

    Class In_buf.of_string

    inherit Iostream__.In.t
    method fill_buf : unit -> Iostream__.Slice.t

    ic#fill_buf() returns a slice into the ic's internal buffer, and ensures it's empty only if ic.ic is empty. In other words, the invariant is that this only returns an empty slice if the input stream is exhausted.

    method consume : int -> unit

    Consume n bytes from the inner buffer. This is only valid if the last call to fill_buf returned a slice with at least n bytes.

    diff --git a/iostream/Iostream/In_buf/class-open_file/index.html b/iostream/Iostream/In_buf/class-open_file/index.html new file mode 100644 index 0000000..1fe1359 --- /dev/null +++ b/iostream/Iostream/In_buf/class-open_file/index.html @@ -0,0 +1,2 @@ + +open_file (iostream.Iostream.In_buf.open_file)

    Class In_buf.open_file

    inherit Iostream__.In.t
    method fill_buf : unit -> Iostream__.Slice.t

    ic#fill_buf() returns a slice into the ic's internal buffer, and ensures it's empty only if ic.ic is empty. In other words, the invariant is that this only returns an empty slice if the input stream is exhausted.

    method consume : int -> unit

    Consume n bytes from the inner buffer. This is only valid if the last call to fill_buf returned a slice with at least n bytes.

    diff --git a/iostream/Iostream/In_buf/class-t_from_refill/index.html b/iostream/Iostream/In_buf/class-t_from_refill/index.html new file mode 100644 index 0000000..f1cf546 --- /dev/null +++ b/iostream/Iostream/In_buf/class-t_from_refill/index.html @@ -0,0 +1,2 @@ + +t_from_refill (iostream.Iostream.In_buf.t_from_refill)

    Class In_buf.t_from_refill

    A mixin to implement a buffered input by only providing a refill method. Add a close method and it's good to go.

    method private virtual refill : Iostream__.Slice.t -> unit

    Implementation of the stream: this takes a slice, resets its offset, and fills it with bytes. It must write at least one byte in the slice, unless the underlying input has reached its end.

    method input : bytes -> int -> int -> int
    method fill_buf : unit -> Iostream__.Slice.t
    method consume : int -> unit
    diff --git a/iostream/Iostream/In_buf/class-type-t/index.html b/iostream/Iostream/In_buf/class-type-t/index.html new file mode 100644 index 0000000..068b212 --- /dev/null +++ b/iostream/Iostream/In_buf/class-type-t/index.html @@ -0,0 +1,2 @@ + +t (iostream.Iostream.In_buf.t)

    Class type In_buf.t

    The implementation of buffered input streams.

    inherit Iostream__.In.t
    method fill_buf : unit -> Iostream__.Slice.t

    ic#fill_buf() returns a slice into the ic's internal buffer, and ensures it's empty only if ic.ic is empty. In other words, the invariant is that this only returns an empty slice if the input stream is exhausted.

    method consume : int -> unit

    Consume n bytes from the inner buffer. This is only valid if the last call to fill_buf returned a slice with at least n bytes.

    diff --git a/iostream/Iostream/In_buf/index.html b/iostream/Iostream/In_buf/index.html new file mode 100644 index 0000000..470dc30 --- /dev/null +++ b/iostream/Iostream/In_buf/index.html @@ -0,0 +1,18 @@ + +In_buf (iostream.Iostream.In_buf)

    Module Iostream.In_buf

    Buffered input stream.

    class type t = object ... end

    The implementation of buffered input streams.

    class virtual t_from_refill : ?bytes:bytes -> unit -> object ... end

    A mixin to implement a buffered input by only providing a refill method. Add a close method and it's good to go.

    val create : + ?bytes:bytes -> + ?close:(unit -> unit) -> + refill:(bytes -> int) -> + unit -> + t

    Create a new buffered input stream.

    • parameter refill

      will be called to refill the content of the bytes, returning how many bytes were added (starting at offset 0).

    • parameter buf

      the underlying buffer

    • raises Invalid_argument

      if the buffer's length is not at least 16.

    class of_bytes : ?off:int -> ?len:int -> bytes -> t
    val of_bytes : ?off:int -> ?len:int -> bytes -> t
    class of_string : ?off:int -> ?len:int -> string -> t
    val of_string : ?off:int -> ?len:int -> string -> t
    class bufferized : ?bytes:bytes -> In.t -> t
    val bufferized : ?bytes:bytes -> In.t -> t

    Read from the given buffer.

    • parameter off

      initial offset (default 0)

    • parameter len

      length of the slice in the bytes. (default all available bytes from offset)

    class of_in_channel : ?bytes:bytes -> in_channel -> t
    val of_in_channel : ?bytes:bytes -> in_channel -> t

    Wrap a standard input channel.

    class open_file : ?bytes:bytes -> ?mode:int -> ?flags:open_flag list -> string -> t
    val open_file : + ?bytes:bytes -> + ?mode:int -> + ?flags:open_flag list -> + string -> + t
    val with_open_file : + ?bytes:bytes -> + ?mode:int -> + ?flags:open_flag list -> + string -> + (t -> 'a) -> + 'a
    val fill_buf : t -> Slice.t

    fill_buffer bic returns a slice into bic's internal buffer, and ensures it's empty only if bic.ic is empty.

    val input : t -> bytes -> int -> int -> int

    Read into the given slice of bytes.

    val of_in : ?bytes:bytes -> In.t -> t

    Make a buffered version of the input stream.

    • parameter bytes

      the buffer to use.

    • raises Invalid_argument

      if the buffer's length is not at least 16.

    val consume : t -> int -> unit

    consume bic n consumes n bytes from bic. Precondition: n <= get_len bic, ie. one cannot consume bytes that have not yet been obtained via fill_buffer or fill_and_get.

    val close : t -> unit

    Close the input stream.

    val into_in : t -> In.t

    Cast into a In.t. This doesn't allocate.

    val input_all_into_buffer : t -> Stdlib.Buffer.t -> unit

    Read the whole content into the given buffer.

    val input_all : ?buf:bytes -> t -> string

    input_all ic reads the whole content of ic into a string.

    • parameter buf

      the initial buffer to use internally.

    • since 0.2
    val copy_into : t -> Out.t -> unit

    Copy the entire stream into the given output.

    val skip : t -> int -> unit

    skip ic n reads and dicards the next n bytes in ic.

    val input_line : ?buffer:Stdlib.Buffer.t -> t -> string option

    Read a line from the input. Return None if the stream is empty.

    • parameter buffer

      a buffer to use to hold the line.

    val input_lines : ?buffer:Stdlib.Buffer.t -> t -> string list

    Read all lines from the input.

    val to_iter : t -> (char -> unit) -> unit
    val to_seq : t -> char Stdlib.Seq.t
    val of_seq : ?bytes:bytes -> char Stdlib.Seq.t -> t
    diff --git a/iostream/Iostream/Out/class-dummy/index.html b/iostream/Iostream/Out/class-dummy/index.html new file mode 100644 index 0000000..c81c89e --- /dev/null +++ b/iostream/Iostream/Out/class-dummy/index.html @@ -0,0 +1,2 @@ + +dummy (iostream.Iostream.Out.dummy)

    Class Out.dummy

    method output : bytes -> int -> int -> unit

    Output slice

    method close : unit -> unit

    Close the output. Must be idempotent.

    diff --git a/iostream/Iostream/Out/class-map_char/index.html b/iostream/Iostream/Out/class-map_char/index.html new file mode 100644 index 0000000..d5e4fdd --- /dev/null +++ b/iostream/Iostream/Out/class-map_char/index.html @@ -0,0 +1,2 @@ + +map_char (iostream.Iostream.Out.map_char)

    Class Out.map_char

    method output : bytes -> int -> int -> unit

    Output slice

    method close : unit -> unit

    Close the output. Must be idempotent.

    diff --git a/iostream/Iostream/Out/class-of_buffer/index.html b/iostream/Iostream/Out/class-of_buffer/index.html new file mode 100644 index 0000000..3ebf973 --- /dev/null +++ b/iostream/Iostream/Out/class-of_buffer/index.html @@ -0,0 +1,2 @@ + +of_buffer (iostream.Iostream.Out.of_buffer)

    Class Out.of_buffer

    method output : bytes -> int -> int -> unit

    Output slice

    method close : unit -> unit

    Close the output. Must be idempotent.

    diff --git a/iostream/Iostream/Out/class-of_out_channel/index.html b/iostream/Iostream/Out/class-of_out_channel/index.html new file mode 100644 index 0000000..9dc2346 --- /dev/null +++ b/iostream/Iostream/Out/class-of_out_channel/index.html @@ -0,0 +1,2 @@ + +of_out_channel (iostream.Iostream.Out.of_out_channel)

    Class Out.of_out_channel

    inherit t
    inherit Iostream__.Seekable.t
    diff --git a/iostream/Iostream/Out/class-type-t/index.html b/iostream/Iostream/Out/class-type-t/index.html new file mode 100644 index 0000000..90afbd6 --- /dev/null +++ b/iostream/Iostream/Out/class-type-t/index.html @@ -0,0 +1,2 @@ + +t (iostream.Iostream.Out.t)

    Class type Out.t

    An output stream, ie. a place into which we can write bytes. This can be a Buffer.t, an out_channel, a Unix.file_descr, etc.

    method output : bytes -> int -> int -> unit

    Output slice

    method close : unit -> unit

    Close the output. Must be idempotent.

    diff --git a/iostream/Iostream/Out/class-type-t_seekable/index.html b/iostream/Iostream/Out/class-type-t_seekable/index.html new file mode 100644 index 0000000..e4cdecc --- /dev/null +++ b/iostream/Iostream/Out/class-type-t_seekable/index.html @@ -0,0 +1,2 @@ + +t_seekable (iostream.Iostream.Out.t_seekable)

    Class type Out.t_seekable

    inherit t
    inherit Iostream__.Seekable.t
    diff --git a/iostream/Iostream/Out/index.html b/iostream/Iostream/Out/index.html new file mode 100644 index 0000000..e22f212 --- /dev/null +++ b/iostream/Iostream/Out/index.html @@ -0,0 +1,13 @@ + +Out (iostream.Iostream.Out)

    Module Iostream.Out

    Output stream.

    class type t = object ... end

    An output stream, ie. a place into which we can write bytes. This can be a Buffer.t, an out_channel, a Unix.file_descr, etc.

    class type t_seekable = object ... end
    class dummy : t
    val dummy : t

    Dummy output, drops everything written to it.

    class of_out_channel : ?close_noerr:bool -> out_channel -> t_seekable
    val of_out_channel : ?close_noerr:bool -> out_channel -> t_seekable

    Wrap an out channel.

    val of_buffer : Stdlib.Buffer.t -> t

    of_buffer buf is an output channel that writes directly into buf. flush and close have no effect.

    val open_file : + ?close_noerr:bool -> + ?mode:int -> + ?flags:open_flag list -> + string -> + t_seekable

    open_file file creates an out stream writing into the given file.

    • parameter mode

      permissions for the file creation

    • parameter flags

      set of unix flags to use. It must contain write permissions.

    val with_open_file : + ?close_noerr:bool -> + ?mode:int -> + ?flags:open_flag list -> + string -> + (t_seekable -> 'a) -> + 'a
    val output : t -> bytes -> int -> int -> unit

    Write the slice of bytes.

    val close : t -> unit

    Close the stream. Idempotent.

    val output_string : t -> string -> unit

    Output the whole string.

    val output_int : t -> int -> unit

    Output an integer in decimal notation.

    val tee : t list -> t

    tee ocs is an output that accepts bytes and writes them to every output in ocs. When closed, it closes all elements of oc.

    class map_char : (char -> char) -> t -> t
    val map_char : (char -> char) -> t -> t

    Transform the stream byte by byte

    diff --git a/iostream/Iostream/Out_buf/class-bufferized/index.html b/iostream/Iostream/Out_buf/class-bufferized/index.html new file mode 100644 index 0000000..e8b58fb --- /dev/null +++ b/iostream/Iostream/Out_buf/class-bufferized/index.html @@ -0,0 +1,2 @@ + +bufferized (iostream.Iostream.Out_buf.bufferized)

    Class Out_buf.bufferized

    inherit Iostream__.Out.t
    method output_char : char -> unit

    Output a single char

    method flush : unit -> unit

    Flush underlying buffer

    diff --git a/iostream/Iostream/Out_buf/class-dummy/index.html b/iostream/Iostream/Out_buf/class-dummy/index.html new file mode 100644 index 0000000..79dbcc5 --- /dev/null +++ b/iostream/Iostream/Out_buf/class-dummy/index.html @@ -0,0 +1,2 @@ + +dummy (iostream.Iostream.Out_buf.dummy)

    Class Out_buf.dummy

    inherit Iostream__.Out.t
    method output_char : char -> unit

    Output a single char

    method flush : unit -> unit

    Flush underlying buffer

    diff --git a/iostream/Iostream/Out_buf/class-of_buffer/index.html b/iostream/Iostream/Out_buf/class-of_buffer/index.html new file mode 100644 index 0000000..2b68aa6 --- /dev/null +++ b/iostream/Iostream/Out_buf/class-of_buffer/index.html @@ -0,0 +1,2 @@ + +of_buffer (iostream.Iostream.Out_buf.of_buffer)

    Class Out_buf.of_buffer

    inherit Iostream__.Out.t
    method output_char : char -> unit

    Output a single char

    method flush : unit -> unit

    Flush underlying buffer

    diff --git a/iostream/Iostream/Out_buf/class-of_out_channel/index.html b/iostream/Iostream/Out_buf/class-of_out_channel/index.html new file mode 100644 index 0000000..a2ed765 --- /dev/null +++ b/iostream/Iostream/Out_buf/class-of_out_channel/index.html @@ -0,0 +1,2 @@ + +of_out_channel (iostream.Iostream.Out_buf.of_out_channel)

    Class Out_buf.of_out_channel

    inherit t
    inherit Iostream__.Seekable.t
    diff --git a/iostream/Iostream/Out_buf/class-open_file/index.html b/iostream/Iostream/Out_buf/class-open_file/index.html new file mode 100644 index 0000000..b1dc57a --- /dev/null +++ b/iostream/Iostream/Out_buf/class-open_file/index.html @@ -0,0 +1,2 @@ + +open_file (iostream.Iostream.Out_buf.open_file)

    Class Out_buf.open_file

    inherit t
    inherit Iostream__.Seekable.t
    diff --git a/iostream/Iostream/Out_buf/class-t_from_output/index.html b/iostream/Iostream/Out_buf/class-t_from_output/index.html new file mode 100644 index 0000000..efbdd06 --- /dev/null +++ b/iostream/Iostream/Out_buf/class-t_from_output/index.html @@ -0,0 +1,2 @@ + +t_from_output (iostream.Iostream.Out_buf.t_from_output)

    Class Out_buf.t_from_output

    Make a bufferized output from a non bufferized output+close.

    • parameter bytes

      the buffer to use. It's owned by this channel as long as the channel exists.

    inherit t
    method private virtual output_underlying : bytes -> int -> int -> unit

    Emit these private bytes, unbufferized

    method private virtual close_underlying : unit -> unit

    Close the underlying output. The bufferized output will flush and then call this.

    diff --git a/iostream/Iostream/Out_buf/class-type-t/index.html b/iostream/Iostream/Out_buf/class-type-t/index.html new file mode 100644 index 0000000..bbf5971 --- /dev/null +++ b/iostream/Iostream/Out_buf/class-type-t/index.html @@ -0,0 +1,2 @@ + +t (iostream.Iostream.Out_buf.t)

    Class type Out_buf.t

    An output stream, ie. a place into which we can write bytes, with a buffer to amortize the cost of operations.

    This can be a Buffer.t, an out_channel, a Unix.file_descr, etc.

    inherit Iostream__.Out.t
    method output_char : char -> unit

    Output a single char

    method flush : unit -> unit

    Flush underlying buffer

    diff --git a/iostream/Iostream/Out_buf/class-type-t_seekable/index.html b/iostream/Iostream/Out_buf/class-type-t_seekable/index.html new file mode 100644 index 0000000..ea83c7d --- /dev/null +++ b/iostream/Iostream/Out_buf/class-type-t_seekable/index.html @@ -0,0 +1,2 @@ + +t_seekable (iostream.Iostream.Out_buf.t_seekable)

    Class type Out_buf.t_seekable

    inherit t
    inherit Iostream__.Seekable.t
    diff --git a/iostream/Iostream/Out_buf/index.html b/iostream/Iostream/Out_buf/index.html new file mode 100644 index 0000000..2146520 --- /dev/null +++ b/iostream/Iostream/Out_buf/index.html @@ -0,0 +1,20 @@ + +Out_buf (iostream.Iostream.Out_buf)

    Module Iostream.Out_buf

    Buffered output stream.

    class type t = object ... end

    An output stream, ie. a place into which we can write bytes, with a buffer to amortize the cost of operations.

    class type t_seekable = object ... end
    val create : + ?flush:(unit -> unit) -> + ?close:(unit -> unit) -> + output_char:(char -> unit) -> + output:(bytes -> int -> int -> unit) -> + unit -> + t

    Create a new output stream from raw components.

    class dummy : t
    val dummy : t

    Dummy output, drops everything written to it.

    class virtual t_from_output : ?bytes:bytes -> unit -> object ... end

    Make a bufferized output from a non bufferized output+close.

    class bufferized : ?bytes:bytes -> Out.t -> t
    val bufferized : ?bytes:bytes -> Out.t -> t
    class of_out_channel : ?close_noerr:bool -> out_channel -> t_seekable
    val of_out_channel : ?close_noerr:bool -> out_channel -> t_seekable

    Wrap an out channel.

    val of_buffer : Stdlib.Buffer.t -> t

    of_buffer buf is an output channel that writes directly into buf. flush and close have no effect.

    class open_file : ?close_noerr:bool -> ?mode:int -> ?flags:open_flag list -> string -> + t_seekable
    val open_file : + ?close_noerr:bool -> + ?mode:int -> + ?flags:open_flag list -> + string -> + t_seekable

    open_file file creates an out stream writing into the given file.

    • parameter mode

      permissions for the file creation

    • parameter flags

      set of unix flags to use. It must contain write permissions.

    val with_open_file : + ?close_noerr:bool -> + ?mode:int -> + ?flags:open_flag list -> + string -> + (t_seekable -> 'a) -> + 'a
    val output_char : t -> char -> unit

    Output a single char

    val output : t -> bytes -> int -> int -> unit

    Write the slice of bytes.

    val close : t -> unit

    Close the stream. Idempotent.

    val flush : t -> unit

    Ensure the bytes written so far are indeed written to the underlying storage/network socket/… and are not just sitting in a buffer.

    val output_string : t -> string -> unit

    Output the whole string.

    val output_line : t -> string -> unit

    Output the whole string followed by '\n'.

    • since 0.2
    val output_lines : t -> string Stdlib.Seq.t -> unit

    Output a series of lines, each terminated by '\n'.

    val output_int : t -> int -> unit

    Output an integer in decimal notation.

    val tee : t list -> t

    tee ocs is an output that accepts bytes and writes them to every output in ocs. When closed, it closes all elements of oc.

    val map_char : (char -> char) -> t -> t

    Transform the stream byte by byte

    diff --git a/iostream/Iostream/Seekable/class-type-t/index.html b/iostream/Iostream/Seekable/class-type-t/index.html new file mode 100644 index 0000000..12a0565 --- /dev/null +++ b/iostream/Iostream/Seekable/class-type-t/index.html @@ -0,0 +1,2 @@ + +t (iostream.Iostream.Seekable.t)

    Class type Seekable.t

    method seek : int -> unit

    Seek in the underlying stream.

    • raises Sys_error

      in case of failure

    method pos : unit -> int

    Return current offset in underlying stream.

    • raises Sys_error

      in case of failure

    diff --git a/iostream/Iostream/Seekable/index.html b/iostream/Iostream/Seekable/index.html new file mode 100644 index 0000000..76cee2d --- /dev/null +++ b/iostream/Iostream/Seekable/index.html @@ -0,0 +1,2 @@ + +Seekable (iostream.Iostream.Seekable)

    Module Iostream.Seekable

    An object we can seek in.

    Files can be seeked in, i.e the read/write head can move around.

    class type t = object ... end
    val seek : t -> int -> unit
    val pos : t -> int
    diff --git a/iostream/Iostream/Slice/index.html b/iostream/Iostream/Slice/index.html new file mode 100644 index 0000000..80913c3 --- /dev/null +++ b/iostream/Iostream/Slice/index.html @@ -0,0 +1,2 @@ + +Slice (iostream.Iostream.Slice)

    Module Iostream.Slice

    Byte slice or buffer.

    type t = Iostream_types.Slice.t = {
    1. bytes : bytes;
      (*

      Bytes

      *)
    2. mutable off : int;
      (*

      Offset in bytes

      *)
    3. mutable len : int;
      (*

      Length of the slice. Empty slice has len=0

      *)
    }

    A slice of bytes. The valid bytes in the slice are bytes[off], bytes[off+1], …, bytes[off+len-1] (i.e len bytes starting at offset off).

    val empty : t
    val create : int -> t
    val of_bytes : bytes -> t
    val bytes : t -> bytes
    val off : t -> int
    val len : t -> int
    val consume : t -> int -> unit

    Consume the first n bytes from the slice, making it n bytes shorter. This modifies the slice in place.

    val find_index_exn : t -> char -> int

    find index of c in slice, or raise Not_found

    diff --git a/iostream/Iostream/index.html b/iostream/Iostream/index.html new file mode 100644 index 0000000..a0388fe --- /dev/null +++ b/iostream/Iostream/index.html @@ -0,0 +1,2 @@ + +Iostream (iostream.Iostream)

    Module Iostream

    I/O streams.

    This module defines generic I/O streams. They can be user-defined and can be composed from other streams.

    module In : sig ... end

    Input stream.

    module In_buf : sig ... end

    Buffered input stream.

    module Out : sig ... end

    Output stream.

    module Out_buf : sig ... end

    Buffered output stream.

    module Slice : sig ... end

    Byte slice or buffer.

    module Seekable : sig ... end

    An object we can seek in.

    diff --git a/iostream/Iostream__/index.html b/iostream/Iostream__/index.html new file mode 100644 index 0000000..6a731a6 --- /dev/null +++ b/iostream/Iostream__/index.html @@ -0,0 +1,2 @@ + +Iostream__ (iostream.Iostream__)

    Module Iostream__

    This module is hidden.

    diff --git a/iostream/Iostream__In/index.html b/iostream/Iostream__In/index.html new file mode 100644 index 0000000..7861afd --- /dev/null +++ b/iostream/Iostream__In/index.html @@ -0,0 +1,2 @@ + +Iostream__In (iostream.Iostream__In)

    Module Iostream__In

    This module is hidden.

    diff --git a/iostream/Iostream__In_buf/index.html b/iostream/Iostream__In_buf/index.html new file mode 100644 index 0000000..705aca1 --- /dev/null +++ b/iostream/Iostream__In_buf/index.html @@ -0,0 +1,2 @@ + +Iostream__In_buf (iostream.Iostream__In_buf)

    Module Iostream__In_buf

    This module is hidden.

    diff --git a/iostream/Iostream__Out/index.html b/iostream/Iostream__Out/index.html new file mode 100644 index 0000000..0d3e126 --- /dev/null +++ b/iostream/Iostream__Out/index.html @@ -0,0 +1,2 @@ + +Iostream__Out (iostream.Iostream__Out)

    Module Iostream__Out

    This module is hidden.

    diff --git a/iostream/Iostream__Out_buf/index.html b/iostream/Iostream__Out_buf/index.html new file mode 100644 index 0000000..69cf153 --- /dev/null +++ b/iostream/Iostream__Out_buf/index.html @@ -0,0 +1,2 @@ + +Iostream__Out_buf (iostream.Iostream__Out_buf)

    Module Iostream__Out_buf

    This module is hidden.

    diff --git a/iostream/Iostream__Seekable/index.html b/iostream/Iostream__Seekable/index.html new file mode 100644 index 0000000..1ee5df3 --- /dev/null +++ b/iostream/Iostream__Seekable/index.html @@ -0,0 +1,2 @@ + +Iostream__Seekable (iostream.Iostream__Seekable)

    Module Iostream__Seekable

    This module is hidden.

    diff --git a/iostream/Iostream__Slice/index.html b/iostream/Iostream__Slice/index.html new file mode 100644 index 0000000..6acbe4a --- /dev/null +++ b/iostream/Iostream__Slice/index.html @@ -0,0 +1,2 @@ + +Iostream__Slice (iostream.Iostream__Slice)

    Module Iostream__Slice

    This module is hidden.

    diff --git a/iostream/Iostream_types/In/class-type-t/index.html b/iostream/Iostream_types/In/class-type-t/index.html new file mode 100644 index 0000000..cf61c5e --- /dev/null +++ b/iostream/Iostream_types/In/class-type-t/index.html @@ -0,0 +1,2 @@ + +t (iostream.Iostream_types.In.t)

    Class type In.t

    method input : bytes -> int -> int -> int

    Read into the slice. Returns 0 only if the stream is closed.

    method close : unit -> unit

    Close the input. Must be idempotent.

    diff --git a/iostream/Iostream_types/In/class-type-t_seekable/index.html b/iostream/Iostream_types/In/class-type-t_seekable/index.html new file mode 100644 index 0000000..8f7c9b1 --- /dev/null +++ b/iostream/Iostream_types/In/class-type-t_seekable/index.html @@ -0,0 +1,2 @@ + +t_seekable (iostream.Iostream_types.In.t_seekable)

    Class type In.t_seekable

    inherit t
    inherit Seekable.t
    diff --git a/iostream/Iostream_types/In/index.html b/iostream/Iostream_types/In/index.html new file mode 100644 index 0000000..4da7481 --- /dev/null +++ b/iostream/Iostream_types/In/index.html @@ -0,0 +1,2 @@ + +In (iostream.Iostream_types.In)

    Module Iostream_types.In

    class type t = object ... end
    class type t_seekable = object ... end
    diff --git a/iostream/Iostream_types/In_buf/class-type-t/index.html b/iostream/Iostream_types/In_buf/class-type-t/index.html new file mode 100644 index 0000000..a241d1c --- /dev/null +++ b/iostream/Iostream_types/In_buf/class-type-t/index.html @@ -0,0 +1,2 @@ + +t (iostream.Iostream_types.In_buf.t)

    Class type In_buf.t

    inherit In.t
    method fill_buf : unit -> Slice.t
    method consume : int -> unit
    diff --git a/iostream/Iostream_types/In_buf/index.html b/iostream/Iostream_types/In_buf/index.html new file mode 100644 index 0000000..ee55e62 --- /dev/null +++ b/iostream/Iostream_types/In_buf/index.html @@ -0,0 +1,2 @@ + +In_buf (iostream.Iostream_types.In_buf)

    Module Iostream_types.In_buf

    class type t = object ... end
    diff --git a/iostream/Iostream_types/Out/class-type-t/index.html b/iostream/Iostream_types/Out/class-type-t/index.html new file mode 100644 index 0000000..0b65936 --- /dev/null +++ b/iostream/Iostream_types/Out/class-type-t/index.html @@ -0,0 +1,2 @@ + +t (iostream.Iostream_types.Out.t)

    Class type Out.t

    method output : bytes -> int -> int -> unit
    method close : unit -> unit
    diff --git a/iostream/Iostream_types/Out/class-type-t_seekable/index.html b/iostream/Iostream_types/Out/class-type-t_seekable/index.html new file mode 100644 index 0000000..ea8520d --- /dev/null +++ b/iostream/Iostream_types/Out/class-type-t_seekable/index.html @@ -0,0 +1,2 @@ + +t_seekable (iostream.Iostream_types.Out.t_seekable)

    Class type Out.t_seekable

    inherit t
    inherit Seekable.t
    diff --git a/iostream/Iostream_types/Out/index.html b/iostream/Iostream_types/Out/index.html new file mode 100644 index 0000000..7faf49e --- /dev/null +++ b/iostream/Iostream_types/Out/index.html @@ -0,0 +1,2 @@ + +Out (iostream.Iostream_types.Out)

    Module Iostream_types.Out

    class type t = object ... end
    class type t_seekable = object ... end
    diff --git a/iostream/Iostream_types/Out_buf/class-type-t/index.html b/iostream/Iostream_types/Out_buf/class-type-t/index.html new file mode 100644 index 0000000..b752269 --- /dev/null +++ b/iostream/Iostream_types/Out_buf/class-type-t/index.html @@ -0,0 +1,2 @@ + +t (iostream.Iostream_types.Out_buf.t)

    Class type Out_buf.t

    method output_char : char -> unit
    method output : bytes -> int -> int -> unit
    method flush : unit -> unit
    method close : unit -> unit
    diff --git a/iostream/Iostream_types/Out_buf/class-type-t_seekable/index.html b/iostream/Iostream_types/Out_buf/class-type-t_seekable/index.html new file mode 100644 index 0000000..300c1bd --- /dev/null +++ b/iostream/Iostream_types/Out_buf/class-type-t_seekable/index.html @@ -0,0 +1,2 @@ + +t_seekable (iostream.Iostream_types.Out_buf.t_seekable)

    Class type Out_buf.t_seekable

    inherit t
    inherit Seekable.t
    diff --git a/iostream/Iostream_types/Out_buf/index.html b/iostream/Iostream_types/Out_buf/index.html new file mode 100644 index 0000000..617efdb --- /dev/null +++ b/iostream/Iostream_types/Out_buf/index.html @@ -0,0 +1,2 @@ + +Out_buf (iostream.Iostream_types.Out_buf)

    Module Iostream_types.Out_buf

    class type t = object ... end
    class type t_seekable = object ... end
    diff --git a/iostream/Iostream_types/Seekable/class-type-t/index.html b/iostream/Iostream_types/Seekable/class-type-t/index.html new file mode 100644 index 0000000..215bfe7 --- /dev/null +++ b/iostream/Iostream_types/Seekable/class-type-t/index.html @@ -0,0 +1,2 @@ + +t (iostream.Iostream_types.Seekable.t)

    Class type Seekable.t

    method seek : int -> unit
    method pos : unit -> int
    diff --git a/iostream/Iostream_types/Seekable/index.html b/iostream/Iostream_types/Seekable/index.html new file mode 100644 index 0000000..b3e59a7 --- /dev/null +++ b/iostream/Iostream_types/Seekable/index.html @@ -0,0 +1,2 @@ + +Seekable (iostream.Iostream_types.Seekable)

    Module Iostream_types.Seekable

    class type t = object ... end
    diff --git a/iostream/Iostream_types/Slice/index.html b/iostream/Iostream_types/Slice/index.html new file mode 100644 index 0000000..9ec7d9a --- /dev/null +++ b/iostream/Iostream_types/Slice/index.html @@ -0,0 +1,2 @@ + +Slice (iostream.Iostream_types.Slice)

    Module Iostream_types.Slice

    type t = {
    1. bytes : bytes;
      (*

      Bytes

      *)
    2. mutable off : int;
      (*

      Offset in bytes

      *)
    3. mutable len : int;
      (*

      Length of the slice. Empty slice has len=0

      *)
    }
    diff --git a/iostream/Iostream_types/index.html b/iostream/Iostream_types/index.html new file mode 100644 index 0000000..0e43845 --- /dev/null +++ b/iostream/Iostream_types/index.html @@ -0,0 +1,2 @@ + +Iostream_types (iostream.Iostream_types)

    Module Iostream_types

    module Slice : sig ... end
    module Seekable : sig ... end
    module In : sig ... end
    module In_buf : sig ... end
    module Out : sig ... end
    module Out_buf : sig ... end
    diff --git a/iostream/Iostream_unix/In/index.html b/iostream/Iostream_unix/In/index.html new file mode 100644 index 0000000..6839759 --- /dev/null +++ b/iostream/Iostream_unix/In/index.html @@ -0,0 +1,2 @@ + +In (iostream.Iostream_unix.In)

    Module Iostream_unix.In

    val of_unix_fd : ?close_noerr:bool -> Unix.file_descr -> Iostream.In.t_seekable

    Create an in stream from a raw Unix file descriptor. The file descriptor must be opened for reading.

    diff --git a/iostream/Iostream_unix/Out/index.html b/iostream/Iostream_unix/Out/index.html new file mode 100644 index 0000000..64545ea --- /dev/null +++ b/iostream/Iostream_unix/Out/index.html @@ -0,0 +1,2 @@ + +Out (iostream.Iostream_unix.Out)

    Module Iostream_unix.Out

    Output stream directly writing into the given Unix file descriptor.

    diff --git a/iostream/Iostream_unix/index.html b/iostream/Iostream_unix/index.html new file mode 100644 index 0000000..28562c8 --- /dev/null +++ b/iostream/Iostream_unix/index.html @@ -0,0 +1,2 @@ + +Iostream_unix (iostream.Iostream_unix)

    Module Iostream_unix

    module In : sig ... end
    module Out : sig ... end
    diff --git a/iostream/_doc-dir/CHANGES.md b/iostream/_doc-dir/CHANGES.md new file mode 100644 index 0000000..c8c987f --- /dev/null +++ b/iostream/_doc-dir/CHANGES.md @@ -0,0 +1,28 @@ + +# 0.3 + +- refactor: extract type definitions to `iostream.types` +- perf slice: improve `Slice.find_index_from` + +# 0.2.2 + +- bugfix for iostream-camlzip (assertion failure) + +# 0.2.1 + +- bugfix for iostream-camlzip + +# 0.2 + +- camlzip: add buffered version of the input stream transducers +- add In_buf.skip +- add `iostream-camlzip`, depends on `iostream` +- rename Out to Out_buf, add Out +- add `Slice` type, used for buffered input +- add `iostream.unix` optional library +- split seekable into its own class +- breaking: use OO and `class type` for all types + +# 0.1 + +initial release diff --git a/iostream/_doc-dir/README.md b/iostream/_doc-dir/README.md new file mode 100644 index 0000000..32e9253 --- /dev/null +++ b/iostream/_doc-dir/README.md @@ -0,0 +1,20 @@ +# Iostream + +[![Build and Test](https://github.com/c-cube/ocaml-iostream/actions/workflows/main.yml/badge.svg)](https://github.com/c-cube/ocaml-iostream/actions/workflows/main.yml) + +This library defines _generic_ I/O streams of bytes. The streams should be +composable, user-definable, and agnostic to the underlying I/O mechanism; with +OCaml 5 it means that they might be backed by an effect-based scheduler. + +The goal is to provide a reasonable interoperability layer that multiple libraries and applications +in the OCaml ecosystem can rely on, while providing the modularity that standard IO channels lack. +Modern statically typed languages like Go and Rust provide this layer in their stdlib and their whole +ecosystem can build on it. + +## Documentation + +https://c-cube.github.io/ocaml-iostream/ + +## License + +MIT license. diff --git a/iostream/index.html b/iostream/index.html new file mode 100644 index 0000000..d685a86 --- /dev/null +++ b/iostream/index.html @@ -0,0 +1,2 @@ + +index (iostream.index)

    Package iostream

    Package info

    changes-files
    readme-files
    diff --git a/katex.min.css b/katex.min.css new file mode 100644 index 0000000..5f1f857 --- /dev/null +++ b/katex.min.css @@ -0,0 +1 @@ +@font-face{font-family:KaTeX_AMS;font-style:normal;font-weight:400;src:url(fonts/KaTeX_AMS-Regular.woff2) format("woff2")}@font-face{font-family:KaTeX_Caligraphic;font-style:normal;font-weight:700;src:url(fonts/KaTeX_Caligraphic-Bold.woff2) format("woff2")}@font-face{font-family:KaTeX_Caligraphic;font-style:normal;font-weight:400;src:url(fonts/KaTeX_Caligraphic-Regular.woff2) format("woff2")}@font-face{font-family:KaTeX_Fraktur;font-style:normal;font-weight:700;src:url(fonts/KaTeX_Fraktur-Bold.woff2) format("woff2")}@font-face{font-family:KaTeX_Fraktur;font-style:normal;font-weight:400;src:url(fonts/KaTeX_Fraktur-Regular.woff2) format("woff2")}@font-face{font-family:KaTeX_Main;font-style:normal;font-weight:700;src:url(fonts/KaTeX_Main-Bold.woff2) format("woff2")}@font-face{font-family:KaTeX_Main;font-style:italic;font-weight:700;src:url(fonts/KaTeX_Main-BoldItalic.woff2) format("woff2")}@font-face{font-family:KaTeX_Main;font-style:italic;font-weight:400;src:url(fonts/KaTeX_Main-Italic.woff2) format("woff2")}@font-face{font-family:KaTeX_Main;font-style:normal;font-weight:400;src:url(fonts/KaTeX_Main-Regular.woff2) format("woff2")}@font-face{font-family:KaTeX_Math;font-style:italic;font-weight:700;src:url(fonts/KaTeX_Math-BoldItalic.woff2) format("woff2")}@font-face{font-family:KaTeX_Math;font-style:italic;font-weight:400;src:url(fonts/KaTeX_Math-Italic.woff2) format("woff2")}@font-face{font-family:"KaTeX_SansSerif";font-style:normal;font-weight:700;src:url(fonts/KaTeX_SansSerif-Bold.woff2) format("woff2")}@font-face{font-family:"KaTeX_SansSerif";font-style:italic;font-weight:400;src:url(fonts/KaTeX_SansSerif-Italic.woff2) format("woff2")}@font-face{font-family:"KaTeX_SansSerif";font-style:normal;font-weight:400;src:url(fonts/KaTeX_SansSerif-Regular.woff2) format("woff2")}@font-face{font-family:KaTeX_Script;font-style:normal;font-weight:400;src:url(fonts/KaTeX_Script-Regular.woff2) format("woff2")}@font-face{font-family:KaTeX_Size1;font-style:normal;font-weight:400;src:url(fonts/KaTeX_Size1-Regular.woff2) format("woff2")}@font-face{font-family:KaTeX_Size2;font-style:normal;font-weight:400;src:url(fonts/KaTeX_Size2-Regular.woff2) format("woff2")}@font-face{font-family:KaTeX_Size3;font-style:normal;font-weight:400;src:url(fonts/KaTeX_Size3-Regular.woff2) format("woff2")}@font-face{font-family:KaTeX_Size4;font-style:normal;font-weight:400;src:url(fonts/KaTeX_Size4-Regular.woff2) format("woff2")}@font-face{font-family:KaTeX_Typewriter;font-style:normal;font-weight:400;src:url(fonts/KaTeX_Typewriter-Regular.woff2) format("woff2")}.katex{text-rendering:auto;font:normal 1.21em KaTeX_Main,Times New Roman,serif;line-height:1.2;text-indent:0}.katex *{-ms-high-contrast-adjust:none!important;border-color:currentColor}.katex .katex-version:after{content:"0.15.2"}.katex .katex-mathml{clip:rect(1px,1px,1px,1px);border:0;height:1px;overflow:hidden;padding:0;position:absolute;width:1px}.katex .katex-html>.newline{display:block}.katex .base{position:relative;white-space:nowrap;width:-webkit-min-content;width:-moz-min-content;width:min-content}.katex .base,.katex .strut{display:inline-block}.katex .textbf{font-weight:700}.katex .textit{font-style:italic}.katex .textrm{font-family:KaTeX_Main}.katex .textsf{font-family:KaTeX_SansSerif}.katex .texttt{font-family:KaTeX_Typewriter}.katex .mathnormal{font-family:KaTeX_Math;font-style:italic}.katex .mathit{font-family:KaTeX_Main;font-style:italic}.katex .mathrm{font-style:normal}.katex .mathbf{font-family:KaTeX_Main;font-weight:700}.katex .boldsymbol{font-family:KaTeX_Math;font-style:italic;font-weight:700}.katex .amsrm,.katex .mathbb,.katex .textbb{font-family:KaTeX_AMS}.katex .mathcal{font-family:KaTeX_Caligraphic}.katex .mathfrak,.katex .textfrak{font-family:KaTeX_Fraktur}.katex .mathtt{font-family:KaTeX_Typewriter}.katex .mathscr,.katex .textscr{font-family:KaTeX_Script}.katex .mathsf,.katex .textsf{font-family:KaTeX_SansSerif}.katex .mathboldsf,.katex .textboldsf{font-family:KaTeX_SansSerif;font-weight:700}.katex .mathitsf,.katex .textitsf{font-family:KaTeX_SansSerif;font-style:italic}.katex .mainrm{font-family:KaTeX_Main;font-style:normal}.katex .vlist-t{border-collapse:collapse;display:inline-table;table-layout:fixed}.katex .vlist-r{display:table-row}.katex .vlist{display:table-cell;position:relative;vertical-align:bottom}.katex .vlist>span{display:block;height:0;position:relative}.katex .vlist>span>span{display:inline-block}.katex .vlist>span>.pstrut{overflow:hidden;width:0}.katex .vlist-t2{margin-right:-2px}.katex .vlist-s{display:table-cell;font-size:1px;min-width:2px;vertical-align:bottom;width:2px}.katex .vbox{align-items:baseline;display:inline-flex;flex-direction:column}.katex .hbox{width:100%}.katex .hbox,.katex .thinbox{display:inline-flex;flex-direction:row}.katex .thinbox{max-width:0;width:0}.katex .msupsub{text-align:left}.katex .mfrac>span>span{text-align:center}.katex .mfrac .frac-line{border-bottom-style:solid;display:inline-block;width:100%}.katex .hdashline,.katex .hline,.katex .mfrac .frac-line,.katex .overline .overline-line,.katex .rule,.katex .underline .underline-line{min-height:1px}.katex .mspace{display:inline-block}.katex .clap,.katex .llap,.katex .rlap{position:relative;width:0}.katex .clap>.inner,.katex .llap>.inner,.katex .rlap>.inner{position:absolute}.katex .clap>.fix,.katex .llap>.fix,.katex .rlap>.fix{display:inline-block}.katex .llap>.inner{right:0}.katex .clap>.inner,.katex .rlap>.inner{left:0}.katex .clap>.inner>span{margin-left:-50%;margin-right:50%}.katex .rule{border:0 solid;display:inline-block;position:relative}.katex .hline,.katex .overline .overline-line,.katex .underline .underline-line{border-bottom-style:solid;display:inline-block;width:100%}.katex .hdashline{border-bottom-style:dashed;display:inline-block;width:100%}.katex .sqrt>.root{margin-left:.27777778em;margin-right:-.55555556em}.katex .fontsize-ensurer.reset-size1.size1,.katex .sizing.reset-size1.size1{font-size:1em}.katex .fontsize-ensurer.reset-size1.size2,.katex .sizing.reset-size1.size2{font-size:1.2em}.katex .fontsize-ensurer.reset-size1.size3,.katex .sizing.reset-size1.size3{font-size:1.4em}.katex .fontsize-ensurer.reset-size1.size4,.katex .sizing.reset-size1.size4{font-size:1.6em}.katex .fontsize-ensurer.reset-size1.size5,.katex .sizing.reset-size1.size5{font-size:1.8em}.katex .fontsize-ensurer.reset-size1.size6,.katex .sizing.reset-size1.size6{font-size:2em}.katex .fontsize-ensurer.reset-size1.size7,.katex .sizing.reset-size1.size7{font-size:2.4em}.katex .fontsize-ensurer.reset-size1.size8,.katex .sizing.reset-size1.size8{font-size:2.88em}.katex .fontsize-ensurer.reset-size1.size9,.katex .sizing.reset-size1.size9{font-size:3.456em}.katex .fontsize-ensurer.reset-size1.size10,.katex .sizing.reset-size1.size10{font-size:4.148em}.katex .fontsize-ensurer.reset-size1.size11,.katex .sizing.reset-size1.size11{font-size:4.976em}.katex .fontsize-ensurer.reset-size2.size1,.katex .sizing.reset-size2.size1{font-size:.83333333em}.katex .fontsize-ensurer.reset-size2.size2,.katex .sizing.reset-size2.size2{font-size:1em}.katex .fontsize-ensurer.reset-size2.size3,.katex .sizing.reset-size2.size3{font-size:1.16666667em}.katex .fontsize-ensurer.reset-size2.size4,.katex .sizing.reset-size2.size4{font-size:1.33333333em}.katex .fontsize-ensurer.reset-size2.size5,.katex .sizing.reset-size2.size5{font-size:1.5em}.katex .fontsize-ensurer.reset-size2.size6,.katex .sizing.reset-size2.size6{font-size:1.66666667em}.katex .fontsize-ensurer.reset-size2.size7,.katex .sizing.reset-size2.size7{font-size:2em}.katex .fontsize-ensurer.reset-size2.size8,.katex .sizing.reset-size2.size8{font-size:2.4em}.katex .fontsize-ensurer.reset-size2.size9,.katex .sizing.reset-size2.size9{font-size:2.88em}.katex .fontsize-ensurer.reset-size2.size10,.katex .sizing.reset-size2.size10{font-size:3.45666667em}.katex .fontsize-ensurer.reset-size2.size11,.katex .sizing.reset-size2.size11{font-size:4.14666667em}.katex .fontsize-ensurer.reset-size3.size1,.katex .sizing.reset-size3.size1{font-size:.71428571em}.katex .fontsize-ensurer.reset-size3.size2,.katex .sizing.reset-size3.size2{font-size:.85714286em}.katex .fontsize-ensurer.reset-size3.size3,.katex .sizing.reset-size3.size3{font-size:1em}.katex .fontsize-ensurer.reset-size3.size4,.katex .sizing.reset-size3.size4{font-size:1.14285714em}.katex .fontsize-ensurer.reset-size3.size5,.katex .sizing.reset-size3.size5{font-size:1.28571429em}.katex .fontsize-ensurer.reset-size3.size6,.katex .sizing.reset-size3.size6{font-size:1.42857143em}.katex .fontsize-ensurer.reset-size3.size7,.katex .sizing.reset-size3.size7{font-size:1.71428571em}.katex .fontsize-ensurer.reset-size3.size8,.katex .sizing.reset-size3.size8{font-size:2.05714286em}.katex .fontsize-ensurer.reset-size3.size9,.katex .sizing.reset-size3.size9{font-size:2.46857143em}.katex .fontsize-ensurer.reset-size3.size10,.katex .sizing.reset-size3.size10{font-size:2.96285714em}.katex .fontsize-ensurer.reset-size3.size11,.katex .sizing.reset-size3.size11{font-size:3.55428571em}.katex .fontsize-ensurer.reset-size4.size1,.katex .sizing.reset-size4.size1{font-size:.625em}.katex .fontsize-ensurer.reset-size4.size2,.katex .sizing.reset-size4.size2{font-size:.75em}.katex .fontsize-ensurer.reset-size4.size3,.katex .sizing.reset-size4.size3{font-size:.875em}.katex .fontsize-ensurer.reset-size4.size4,.katex .sizing.reset-size4.size4{font-size:1em}.katex .fontsize-ensurer.reset-size4.size5,.katex .sizing.reset-size4.size5{font-size:1.125em}.katex .fontsize-ensurer.reset-size4.size6,.katex .sizing.reset-size4.size6{font-size:1.25em}.katex .fontsize-ensurer.reset-size4.size7,.katex .sizing.reset-size4.size7{font-size:1.5em}.katex .fontsize-ensurer.reset-size4.size8,.katex .sizing.reset-size4.size8{font-size:1.8em}.katex .fontsize-ensurer.reset-size4.size9,.katex .sizing.reset-size4.size9{font-size:2.16em}.katex .fontsize-ensurer.reset-size4.size10,.katex .sizing.reset-size4.size10{font-size:2.5925em}.katex .fontsize-ensurer.reset-size4.size11,.katex .sizing.reset-size4.size11{font-size:3.11em}.katex .fontsize-ensurer.reset-size5.size1,.katex .sizing.reset-size5.size1{font-size:.55555556em}.katex .fontsize-ensurer.reset-size5.size2,.katex .sizing.reset-size5.size2{font-size:.66666667em}.katex .fontsize-ensurer.reset-size5.size3,.katex .sizing.reset-size5.size3{font-size:.77777778em}.katex .fontsize-ensurer.reset-size5.size4,.katex .sizing.reset-size5.size4{font-size:.88888889em}.katex .fontsize-ensurer.reset-size5.size5,.katex .sizing.reset-size5.size5{font-size:1em}.katex .fontsize-ensurer.reset-size5.size6,.katex .sizing.reset-size5.size6{font-size:1.11111111em}.katex .fontsize-ensurer.reset-size5.size7,.katex .sizing.reset-size5.size7{font-size:1.33333333em}.katex .fontsize-ensurer.reset-size5.size8,.katex .sizing.reset-size5.size8{font-size:1.6em}.katex .fontsize-ensurer.reset-size5.size9,.katex .sizing.reset-size5.size9{font-size:1.92em}.katex .fontsize-ensurer.reset-size5.size10,.katex .sizing.reset-size5.size10{font-size:2.30444444em}.katex .fontsize-ensurer.reset-size5.size11,.katex .sizing.reset-size5.size11{font-size:2.76444444em}.katex .fontsize-ensurer.reset-size6.size1,.katex .sizing.reset-size6.size1{font-size:.5em}.katex .fontsize-ensurer.reset-size6.size2,.katex .sizing.reset-size6.size2{font-size:.6em}.katex .fontsize-ensurer.reset-size6.size3,.katex .sizing.reset-size6.size3{font-size:.7em}.katex .fontsize-ensurer.reset-size6.size4,.katex .sizing.reset-size6.size4{font-size:.8em}.katex .fontsize-ensurer.reset-size6.size5,.katex .sizing.reset-size6.size5{font-size:.9em}.katex .fontsize-ensurer.reset-size6.size6,.katex .sizing.reset-size6.size6{font-size:1em}.katex .fontsize-ensurer.reset-size6.size7,.katex .sizing.reset-size6.size7{font-size:1.2em}.katex .fontsize-ensurer.reset-size6.size8,.katex .sizing.reset-size6.size8{font-size:1.44em}.katex .fontsize-ensurer.reset-size6.size9,.katex .sizing.reset-size6.size9{font-size:1.728em}.katex .fontsize-ensurer.reset-size6.size10,.katex .sizing.reset-size6.size10{font-size:2.074em}.katex .fontsize-ensurer.reset-size6.size11,.katex .sizing.reset-size6.size11{font-size:2.488em}.katex .fontsize-ensurer.reset-size7.size1,.katex .sizing.reset-size7.size1{font-size:.41666667em}.katex .fontsize-ensurer.reset-size7.size2,.katex .sizing.reset-size7.size2{font-size:.5em}.katex .fontsize-ensurer.reset-size7.size3,.katex .sizing.reset-size7.size3{font-size:.58333333em}.katex .fontsize-ensurer.reset-size7.size4,.katex .sizing.reset-size7.size4{font-size:.66666667em}.katex .fontsize-ensurer.reset-size7.size5,.katex .sizing.reset-size7.size5{font-size:.75em}.katex .fontsize-ensurer.reset-size7.size6,.katex .sizing.reset-size7.size6{font-size:.83333333em}.katex .fontsize-ensurer.reset-size7.size7,.katex .sizing.reset-size7.size7{font-size:1em}.katex .fontsize-ensurer.reset-size7.size8,.katex .sizing.reset-size7.size8{font-size:1.2em}.katex .fontsize-ensurer.reset-size7.size9,.katex .sizing.reset-size7.size9{font-size:1.44em}.katex .fontsize-ensurer.reset-size7.size10,.katex .sizing.reset-size7.size10{font-size:1.72833333em}.katex .fontsize-ensurer.reset-size7.size11,.katex .sizing.reset-size7.size11{font-size:2.07333333em}.katex .fontsize-ensurer.reset-size8.size1,.katex .sizing.reset-size8.size1{font-size:.34722222em}.katex .fontsize-ensurer.reset-size8.size2,.katex .sizing.reset-size8.size2{font-size:.41666667em}.katex .fontsize-ensurer.reset-size8.size3,.katex .sizing.reset-size8.size3{font-size:.48611111em}.katex .fontsize-ensurer.reset-size8.size4,.katex .sizing.reset-size8.size4{font-size:.55555556em}.katex .fontsize-ensurer.reset-size8.size5,.katex .sizing.reset-size8.size5{font-size:.625em}.katex .fontsize-ensurer.reset-size8.size6,.katex .sizing.reset-size8.size6{font-size:.69444444em}.katex .fontsize-ensurer.reset-size8.size7,.katex .sizing.reset-size8.size7{font-size:.83333333em}.katex .fontsize-ensurer.reset-size8.size8,.katex .sizing.reset-size8.size8{font-size:1em}.katex .fontsize-ensurer.reset-size8.size9,.katex .sizing.reset-size8.size9{font-size:1.2em}.katex .fontsize-ensurer.reset-size8.size10,.katex .sizing.reset-size8.size10{font-size:1.44027778em}.katex .fontsize-ensurer.reset-size8.size11,.katex .sizing.reset-size8.size11{font-size:1.72777778em}.katex .fontsize-ensurer.reset-size9.size1,.katex .sizing.reset-size9.size1{font-size:.28935185em}.katex .fontsize-ensurer.reset-size9.size2,.katex .sizing.reset-size9.size2{font-size:.34722222em}.katex .fontsize-ensurer.reset-size9.size3,.katex .sizing.reset-size9.size3{font-size:.40509259em}.katex .fontsize-ensurer.reset-size9.size4,.katex .sizing.reset-size9.size4{font-size:.46296296em}.katex .fontsize-ensurer.reset-size9.size5,.katex .sizing.reset-size9.size5{font-size:.52083333em}.katex .fontsize-ensurer.reset-size9.size6,.katex .sizing.reset-size9.size6{font-size:.5787037em}.katex .fontsize-ensurer.reset-size9.size7,.katex .sizing.reset-size9.size7{font-size:.69444444em}.katex .fontsize-ensurer.reset-size9.size8,.katex .sizing.reset-size9.size8{font-size:.83333333em}.katex .fontsize-ensurer.reset-size9.size9,.katex .sizing.reset-size9.size9{font-size:1em}.katex .fontsize-ensurer.reset-size9.size10,.katex .sizing.reset-size9.size10{font-size:1.20023148em}.katex .fontsize-ensurer.reset-size9.size11,.katex .sizing.reset-size9.size11{font-size:1.43981481em}.katex .fontsize-ensurer.reset-size10.size1,.katex .sizing.reset-size10.size1{font-size:.24108004em}.katex .fontsize-ensurer.reset-size10.size2,.katex .sizing.reset-size10.size2{font-size:.28929605em}.katex .fontsize-ensurer.reset-size10.size3,.katex .sizing.reset-size10.size3{font-size:.33751205em}.katex .fontsize-ensurer.reset-size10.size4,.katex .sizing.reset-size10.size4{font-size:.38572806em}.katex .fontsize-ensurer.reset-size10.size5,.katex .sizing.reset-size10.size5{font-size:.43394407em}.katex .fontsize-ensurer.reset-size10.size6,.katex .sizing.reset-size10.size6{font-size:.48216008em}.katex .fontsize-ensurer.reset-size10.size7,.katex .sizing.reset-size10.size7{font-size:.57859209em}.katex .fontsize-ensurer.reset-size10.size8,.katex .sizing.reset-size10.size8{font-size:.69431051em}.katex .fontsize-ensurer.reset-size10.size9,.katex .sizing.reset-size10.size9{font-size:.83317261em}.katex .fontsize-ensurer.reset-size10.size10,.katex .sizing.reset-size10.size10{font-size:1em}.katex .fontsize-ensurer.reset-size10.size11,.katex .sizing.reset-size10.size11{font-size:1.19961427em}.katex .fontsize-ensurer.reset-size11.size1,.katex .sizing.reset-size11.size1{font-size:.20096463em}.katex .fontsize-ensurer.reset-size11.size2,.katex .sizing.reset-size11.size2{font-size:.24115756em}.katex .fontsize-ensurer.reset-size11.size3,.katex .sizing.reset-size11.size3{font-size:.28135048em}.katex .fontsize-ensurer.reset-size11.size4,.katex .sizing.reset-size11.size4{font-size:.32154341em}.katex .fontsize-ensurer.reset-size11.size5,.katex .sizing.reset-size11.size5{font-size:.36173633em}.katex .fontsize-ensurer.reset-size11.size6,.katex .sizing.reset-size11.size6{font-size:.40192926em}.katex .fontsize-ensurer.reset-size11.size7,.katex .sizing.reset-size11.size7{font-size:.48231511em}.katex .fontsize-ensurer.reset-size11.size8,.katex .sizing.reset-size11.size8{font-size:.57877814em}.katex .fontsize-ensurer.reset-size11.size9,.katex .sizing.reset-size11.size9{font-size:.69453376em}.katex .fontsize-ensurer.reset-size11.size10,.katex .sizing.reset-size11.size10{font-size:.83360129em}.katex .fontsize-ensurer.reset-size11.size11,.katex .sizing.reset-size11.size11{font-size:1em}.katex .delimsizing.size1{font-family:KaTeX_Size1}.katex .delimsizing.size2{font-family:KaTeX_Size2}.katex .delimsizing.size3{font-family:KaTeX_Size3}.katex .delimsizing.size4{font-family:KaTeX_Size4}.katex .delimsizing.mult .delim-size1>span{font-family:KaTeX_Size1}.katex .delimsizing.mult .delim-size4>span{font-family:KaTeX_Size4}.katex .nulldelimiter{display:inline-block;width:.12em}.katex .delimcenter,.katex .op-symbol{position:relative}.katex .op-symbol.small-op{font-family:KaTeX_Size1}.katex .op-symbol.large-op{font-family:KaTeX_Size2}.katex .accent>.vlist-t,.katex .op-limits>.vlist-t{text-align:center}.katex .accent .accent-body{position:relative}.katex .accent .accent-body:not(.accent-full){width:0}.katex .overlay{display:block}.katex .mtable .vertical-separator{display:inline-block;min-width:1px}.katex .mtable .arraycolsep{display:inline-block}.katex .mtable .col-align-c>.vlist-t{text-align:center}.katex .mtable .col-align-l>.vlist-t{text-align:left}.katex .mtable .col-align-r>.vlist-t{text-align:right}.katex .svg-align{text-align:left}.katex svg{fill:currentColor;stroke:currentColor;fill-rule:nonzero;fill-opacity:1;stroke-width:1;stroke-linecap:butt;stroke-linejoin:miter;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1;display:block;height:inherit;position:absolute;width:100%}.katex svg path{stroke:none}.katex img{border-style:none;max-height:none;max-width:none;min-height:0;min-width:0}.katex .stretchy{display:block;overflow:hidden;position:relative;width:100%}.katex .stretchy:after,.katex .stretchy:before{content:""}.katex .hide-tail{overflow:hidden;position:relative;width:100%}.katex .halfarrow-left{left:0;overflow:hidden;position:absolute;width:50.2%}.katex .halfarrow-right{overflow:hidden;position:absolute;right:0;width:50.2%}.katex .brace-left{left:0;overflow:hidden;position:absolute;width:25.1%}.katex .brace-center{left:25%;overflow:hidden;position:absolute;width:50%}.katex .brace-right{overflow:hidden;position:absolute;right:0;width:25.1%}.katex .x-arrow-pad{padding:0 .5em}.katex .cd-arrow-pad{padding:0 .55556em 0 .27778em}.katex .mover,.katex .munder,.katex .x-arrow{text-align:center}.katex .boxpad{padding:0 .3em}.katex .fbox,.katex .fcolorbox{border:.04em solid;box-sizing:border-box}.katex .cancel-pad{padding:0 .2em}.katex .cancel-lap{margin-left:-.2em;margin-right:-.2em}.katex .sout{border-bottom-style:solid;border-bottom-width:.08em}.katex .angl{border-right:.049em solid;border-top:.049em solid;box-sizing:border-box;margin-right:.03889em}.katex .anglpad{padding:0 .03889em}.katex .eqn-num:before{content:"(" counter(katexEqnNo) ")";counter-increment:katexEqnNo}.katex .mml-eqn-num:before{content:"(" counter(mmlEqnNo) ")";counter-increment:mmlEqnNo}.katex .mtr-glue{width:50%}.katex .cd-vert-arrow{display:inline-block;position:relative}.katex .cd-label-left{display:inline-block;position:absolute;right:calc(50% + .3em);text-align:left}.katex .cd-label-right{display:inline-block;left:calc(50% + .3em);position:absolute;text-align:right}.katex-display{display:block;margin:1em 0;text-align:center}.katex-display>.katex{display:block;text-align:center;white-space:nowrap}.katex-display>.katex>.katex-html{display:block;position:relative}.katex-display>.katex>.katex-html>.tag{position:absolute;right:0}.katex-display.leqno>.katex>.katex-html>.tag{left:0;right:auto}.katex-display.fleqn>.katex{padding-left:2em;text-align:left}body{counter-reset:katexEqnNo mmlEqnNo} diff --git a/katex.min.js b/katex.min.js new file mode 100644 index 0000000..e4d78f2 --- /dev/null +++ b/katex.min.js @@ -0,0 +1 @@ +!function(e,t){"object"==typeof exports&&"object"==typeof module?module.exports=t():"function"==typeof define&&define.amd?define([],t):"object"==typeof exports?exports.katex=t():e.katex=t()}("undefined"!=typeof self?self:this,(function(){return function(){"use strict";var e={d:function(t,r){for(var n in r)e.o(r,n)&&!e.o(t,n)&&Object.defineProperty(t,n,{enumerable:!0,get:r[n]})},o:function(e,t){return Object.prototype.hasOwnProperty.call(e,t)}},t={};e.d(t,{default:function(){return Zn}});var r=function e(t,r){this.position=void 0;var n,a="KaTeX parse error: "+t,i=r&&r.loc;if(i&&i.start<=i.end){var o=i.lexer.input;n=i.start;var s=i.end;n===o.length?a+=" at end of input: ":a+=" at position "+(n+1)+": ";var l=o.slice(n,s).replace(/[^]/g,"$&\u0332");a+=(n>15?"\u2026"+o.slice(n-15,n):o.slice(0,n))+l+(s+15":">","<":"<",'"':""","'":"'"},o=/[&><"']/g;var s=function e(t){return"ordgroup"===t.type||"color"===t.type?1===t.body.length?e(t.body[0]):t:"font"===t.type?e(t.body):t},l={contains:function(e,t){return-1!==e.indexOf(t)},deflt:function(e,t){return void 0===e?t:e},escape:function(e){return String(e).replace(o,(function(e){return i[e]}))},hyphenate:function(e){return e.replace(a,"-$1").toLowerCase()},getBaseElem:s,isCharacterBox:function(e){var t=s(e);return"mathord"===t.type||"textord"===t.type||"atom"===t.type},protocolFromUrl:function(e){var t=/^\s*([^\\/#]*?)(?::|�*58|�*3a)/i.exec(e);return null!=t?t[1]:"_relative"}},h={displayMode:{type:"boolean",description:"Render math in display mode, which puts the math in display style (so \\int and \\sum are large, for example), and centers the math on the page on its own line.",cli:"-d, --display-mode"},output:{type:{enum:["htmlAndMathml","html","mathml"]},description:"Determines the markup language of the output.",cli:"-F, --format "},leqno:{type:"boolean",description:"Render display math in leqno style (left-justified tags)."},fleqn:{type:"boolean",description:"Render display math flush left."},throwOnError:{type:"boolean",default:!0,cli:"-t, --no-throw-on-error",cliDescription:"Render errors (in the color given by --error-color) instead of throwing a ParseError exception when encountering an error."},errorColor:{type:"string",default:"#cc0000",cli:"-c, --error-color ",cliDescription:"A color string given in the format 'rgb' or 'rrggbb' (no #). This option determines the color of errors rendered by the -t option.",cliProcessor:function(e){return"#"+e}},macros:{type:"object",cli:"-m, --macro ",cliDescription:"Define custom macro of the form '\\foo:expansion' (use multiple -m arguments for multiple macros).",cliDefault:[],cliProcessor:function(e,t){return t.push(e),t}},minRuleThickness:{type:"number",description:"Specifies a minimum thickness, in ems, for fraction lines, `\\sqrt` top lines, `{array}` vertical lines, `\\hline`, `\\hdashline`, `\\underline`, `\\overline`, and the borders of `\\fbox`, `\\boxed`, and `\\fcolorbox`.",processor:function(e){return Math.max(0,e)},cli:"--min-rule-thickness ",cliProcessor:parseFloat},colorIsTextColor:{type:"boolean",description:"Makes \\color behave like LaTeX's 2-argument \\textcolor, instead of LaTeX's one-argument \\color mode change.",cli:"-b, --color-is-text-color"},strict:{type:[{enum:["warn","ignore","error"]},"boolean","function"],description:"Turn on strict / LaTeX faithfulness mode, which throws an error if the input uses features that are not supported by LaTeX.",cli:"-S, --strict",cliDefault:!1},trust:{type:["boolean","function"],description:"Trust the input, enabling all HTML features such as \\url.",cli:"-T, --trust"},maxSize:{type:"number",default:1/0,description:"If non-zero, all user-specified sizes, e.g. in \\rule{500em}{500em}, will be capped to maxSize ems. Otherwise, elements and spaces can be arbitrarily large",processor:function(e){return Math.max(0,e)},cli:"-s, --max-size ",cliProcessor:parseInt},maxExpand:{type:"number",default:1e3,description:"Limit the number of macro expansions to the specified number, to prevent e.g. infinite macro loops. If set to Infinity, the macro expander will try to fully expand as in LaTeX.",processor:function(e){return Math.max(0,e)},cli:"-e, --max-expand ",cliProcessor:function(e){return"Infinity"===e?1/0:parseInt(e)}},globalGroup:{type:"boolean",cli:!1}};function m(e){if(e.default)return e.default;var t=e.type,r=Array.isArray(t)?t[0]:t;if("string"!=typeof r)return r.enum[0];switch(r){case"boolean":return!1;case"string":return"";case"number":return 0;case"object":return{}}}var c=function(){function e(e){for(var t in this.displayMode=void 0,this.output=void 0,this.leqno=void 0,this.fleqn=void 0,this.throwOnError=void 0,this.errorColor=void 0,this.macros=void 0,this.minRuleThickness=void 0,this.colorIsTextColor=void 0,this.strict=void 0,this.trust=void 0,this.maxSize=void 0,this.maxExpand=void 0,this.globalGroup=void 0,e=e||{},h)if(h.hasOwnProperty(t)){var r=h[t];this[t]=void 0!==e[t]?r.processor?r.processor(e[t]):e[t]:m(r)}}var t=e.prototype;return t.reportNonstrict=function(e,t,r){var a=this.strict;if("function"==typeof a&&(a=a(e,t,r)),a&&"ignore"!==a){if(!0===a||"error"===a)throw new n("LaTeX-incompatible input and strict mode is set to 'error': "+t+" ["+e+"]",r);"warn"===a?"undefined"!=typeof console&&console.warn("LaTeX-incompatible input and strict mode is set to 'warn': "+t+" ["+e+"]"):"undefined"!=typeof console&&console.warn("LaTeX-incompatible input and strict mode is set to unrecognized '"+a+"': "+t+" ["+e+"]")}},t.useStrictBehavior=function(e,t,r){var n=this.strict;if("function"==typeof n)try{n=n(e,t,r)}catch(e){n="error"}return!(!n||"ignore"===n)&&(!0===n||"error"===n||("warn"===n?("undefined"!=typeof console&&console.warn("LaTeX-incompatible input and strict mode is set to 'warn': "+t+" ["+e+"]"),!1):("undefined"!=typeof console&&console.warn("LaTeX-incompatible input and strict mode is set to unrecognized '"+n+"': "+t+" ["+e+"]"),!1)))},t.isTrusted=function(e){e.url&&!e.protocol&&(e.protocol=l.protocolFromUrl(e.url));var t="function"==typeof this.trust?this.trust(e):this.trust;return Boolean(t)},e}(),u=function(){function e(e,t,r){this.id=void 0,this.size=void 0,this.cramped=void 0,this.id=e,this.size=t,this.cramped=r}var t=e.prototype;return t.sup=function(){return p[d[this.id]]},t.sub=function(){return p[f[this.id]]},t.fracNum=function(){return p[g[this.id]]},t.fracDen=function(){return p[v[this.id]]},t.cramp=function(){return p[b[this.id]]},t.text=function(){return p[y[this.id]]},t.isTight=function(){return this.size>=2},e}(),p=[new u(0,0,!1),new u(1,0,!0),new u(2,1,!1),new u(3,1,!0),new u(4,2,!1),new u(5,2,!0),new u(6,3,!1),new u(7,3,!0)],d=[4,5,4,5,6,7,6,7],f=[5,5,5,5,7,7,7,7],g=[2,3,4,5,6,7,6,7],v=[3,3,5,5,7,7,7,7],b=[1,1,3,3,5,5,7,7],y=[0,1,2,3,2,3,2,3],x={DISPLAY:p[0],TEXT:p[2],SCRIPT:p[4],SCRIPTSCRIPT:p[6]},w=[{name:"latin",blocks:[[256,591],[768,879]]},{name:"cyrillic",blocks:[[1024,1279]]},{name:"armenian",blocks:[[1328,1423]]},{name:"brahmic",blocks:[[2304,4255]]},{name:"georgian",blocks:[[4256,4351]]},{name:"cjk",blocks:[[12288,12543],[19968,40879],[65280,65376]]},{name:"hangul",blocks:[[44032,55215]]}];var k=[];function S(e){for(var t=0;t=k[t]&&e<=k[t+1])return!0;return!1}w.forEach((function(e){return e.blocks.forEach((function(e){return k.push.apply(k,e)}))}));var M=80,z={doubleleftarrow:"M262 157\nl10-10c34-36 62.7-77 86-123 3.3-8 5-13.3 5-16 0-5.3-6.7-8-20-8-7.3\n 0-12.2.5-14.5 1.5-2.3 1-4.8 4.5-7.5 10.5-49.3 97.3-121.7 169.3-217 216-28\n 14-57.3 25-88 33-6.7 2-11 3.8-13 5.5-2 1.7-3 4.2-3 7.5s1 5.8 3 7.5\nc2 1.7 6.3 3.5 13 5.5 68 17.3 128.2 47.8 180.5 91.5 52.3 43.7 93.8 96.2 124.5\n 157.5 9.3 8 15.3 12.3 18 13h6c12-.7 18-4 18-10 0-2-1.7-7-5-15-23.3-46-52-87\n-86-123l-10-10h399738v-40H218c328 0 0 0 0 0l-10-8c-26.7-20-65.7-43-117-69 2.7\n-2 6-3.7 10-5 36.7-16 72.3-37.3 107-64l10-8h399782v-40z\nm8 0v40h399730v-40zm0 194v40h399730v-40z",doublerightarrow:"M399738 392l\n-10 10c-34 36-62.7 77-86 123-3.3 8-5 13.3-5 16 0 5.3 6.7 8 20 8 7.3 0 12.2-.5\n 14.5-1.5 2.3-1 4.8-4.5 7.5-10.5 49.3-97.3 121.7-169.3 217-216 28-14 57.3-25 88\n-33 6.7-2 11-3.8 13-5.5 2-1.7 3-4.2 3-7.5s-1-5.8-3-7.5c-2-1.7-6.3-3.5-13-5.5-68\n-17.3-128.2-47.8-180.5-91.5-52.3-43.7-93.8-96.2-124.5-157.5-9.3-8-15.3-12.3-18\n-13h-6c-12 .7-18 4-18 10 0 2 1.7 7 5 15 23.3 46 52 87 86 123l10 10H0v40h399782\nc-328 0 0 0 0 0l10 8c26.7 20 65.7 43 117 69-2.7 2-6 3.7-10 5-36.7 16-72.3 37.3\n-107 64l-10 8H0v40zM0 157v40h399730v-40zm0 194v40h399730v-40z",leftarrow:"M400000 241H110l3-3c68.7-52.7 113.7-120\n 135-202 4-14.7 6-23 6-25 0-7.3-7-11-21-11-8 0-13.2.8-15.5 2.5-2.3 1.7-4.2 5.8\n-5.5 12.5-1.3 4.7-2.7 10.3-4 17-12 48.7-34.8 92-68.5 130S65.3 228.3 18 247\nc-10 4-16 7.7-18 11 0 8.7 6 14.3 18 17 47.3 18.7 87.8 47 121.5 85S196 441.3 208\n 490c.7 2 1.3 5 2 9s1.2 6.7 1.5 8c.3 1.3 1 3.3 2 6s2.2 4.5 3.5 5.5c1.3 1 3.3\n 1.8 6 2.5s6 1 10 1c14 0 21-3.7 21-11 0-2-2-10.3-6-25-20-79.3-65-146.7-135-202\n l-3-3h399890zM100 241v40h399900v-40z",leftbrace:"M6 548l-6-6v-35l6-11c56-104 135.3-181.3 238-232 57.3-28.7 117\n-45 179-50h399577v120H403c-43.3 7-81 15-113 26-100.7 33-179.7 91-237 174-2.7\n 5-6 9-10 13-.7 1-7.3 1-20 1H6z",leftbraceunder:"M0 6l6-6h17c12.688 0 19.313.3 20 1 4 4 7.313 8.3 10 13\n 35.313 51.3 80.813 93.8 136.5 127.5 55.688 33.7 117.188 55.8 184.5 66.5.688\n 0 2 .3 4 1 18.688 2.7 76 4.3 172 5h399450v120H429l-6-1c-124.688-8-235-61.7\n-331-161C60.687 138.7 32.312 99.3 7 54L0 41V6z",leftgroup:"M400000 80\nH435C64 80 168.3 229.4 21 260c-5.9 1.2-18 0-18 0-2 0-3-1-3-3v-38C76 61 257 0\n 435 0h399565z",leftgroupunder:"M400000 262\nH435C64 262 168.3 112.6 21 82c-5.9-1.2-18 0-18 0-2 0-3 1-3 3v38c76 158 257 219\n 435 219h399565z",leftharpoon:"M0 267c.7 5.3 3 10 7 14h399993v-40H93c3.3\n-3.3 10.2-9.5 20.5-18.5s17.8-15.8 22.5-20.5c50.7-52 88-110.3 112-175 4-11.3 5\n-18.3 3-21-1.3-4-7.3-6-18-6-8 0-13 .7-15 2s-4.7 6.7-8 16c-42 98.7-107.3 174.7\n-196 228-6.7 4.7-10.7 8-12 10-1.3 2-2 5.7-2 11zm100-26v40h399900v-40z",leftharpoonplus:"M0 267c.7 5.3 3 10 7 14h399993v-40H93c3.3-3.3 10.2-9.5\n 20.5-18.5s17.8-15.8 22.5-20.5c50.7-52 88-110.3 112-175 4-11.3 5-18.3 3-21-1.3\n-4-7.3-6-18-6-8 0-13 .7-15 2s-4.7 6.7-8 16c-42 98.7-107.3 174.7-196 228-6.7 4.7\n-10.7 8-12 10-1.3 2-2 5.7-2 11zm100-26v40h399900v-40zM0 435v40h400000v-40z\nm0 0v40h400000v-40z",leftharpoondown:"M7 241c-4 4-6.333 8.667-7 14 0 5.333.667 9 2 11s5.333\n 5.333 12 10c90.667 54 156 130 196 228 3.333 10.667 6.333 16.333 9 17 2 .667 5\n 1 9 1h5c10.667 0 16.667-2 18-6 2-2.667 1-9.667-3-21-32-87.333-82.667-157.667\n-152-211l-3-3h399907v-40zM93 281 H400000 v-40L7 241z",leftharpoondownplus:"M7 435c-4 4-6.3 8.7-7 14 0 5.3.7 9 2 11s5.3 5.3 12\n 10c90.7 54 156 130 196 228 3.3 10.7 6.3 16.3 9 17 2 .7 5 1 9 1h5c10.7 0 16.7\n-2 18-6 2-2.7 1-9.7-3-21-32-87.3-82.7-157.7-152-211l-3-3h399907v-40H7zm93 0\nv40h399900v-40zM0 241v40h399900v-40zm0 0v40h399900v-40z",lefthook:"M400000 281 H103s-33-11.2-61-33.5S0 197.3 0 164s14.2-61.2 42.5\n-83.5C70.8 58.2 104 47 142 47 c16.7 0 25 6.7 25 20 0 12-8.7 18.7-26 20-40 3.3\n-68.7 15.7-86 37-10 12-15 25.3-15 40 0 22.7 9.8 40.7 29.5 54 19.7 13.3 43.5 21\n 71.5 23h399859zM103 281v-40h399897v40z",leftlinesegment:"M40 281 V428 H0 V94 H40 V241 H400000 v40z\nM40 281 V428 H0 V94 H40 V241 H400000 v40z",leftmapsto:"M40 281 V448H0V74H40V241H400000v40z\nM40 281 V448H0V74H40V241H400000v40z",leftToFrom:"M0 147h400000v40H0zm0 214c68 40 115.7 95.7 143 167h22c15.3 0 23\n-.3 23-1 0-1.3-5.3-13.7-16-37-18-35.3-41.3-69-70-101l-7-8h399905v-40H95l7-8\nc28.7-32 52-65.7 70-101 10.7-23.3 16-35.7 16-37 0-.7-7.7-1-23-1h-22C115.7 265.3\n 68 321 0 361zm0-174v-40h399900v40zm100 154v40h399900v-40z",longequal:"M0 50 h400000 v40H0z m0 194h40000v40H0z\nM0 50 h400000 v40H0z m0 194h40000v40H0z",midbrace:"M200428 334\nc-100.7-8.3-195.3-44-280-108-55.3-42-101.7-93-139-153l-9-14c-2.7 4-5.7 8.7-9 14\n-53.3 86.7-123.7 153-211 199-66.7 36-137.3 56.3-212 62H0V214h199568c178.3-11.7\n 311.7-78.3 403-201 6-8 9.7-12 11-12 .7-.7 6.7-1 18-1s17.3.3 18 1c1.3 0 5 4 11\n 12 44.7 59.3 101.3 106.3 170 141s145.3 54.3 229 60h199572v120z",midbraceunder:"M199572 214\nc100.7 8.3 195.3 44 280 108 55.3 42 101.7 93 139 153l9 14c2.7-4 5.7-8.7 9-14\n 53.3-86.7 123.7-153 211-199 66.7-36 137.3-56.3 212-62h199568v120H200432c-178.3\n 11.7-311.7 78.3-403 201-6 8-9.7 12-11 12-.7.7-6.7 1-18 1s-17.3-.3-18-1c-1.3 0\n-5-4-11-12-44.7-59.3-101.3-106.3-170-141s-145.3-54.3-229-60H0V214z",oiintSize1:"M512.6 71.6c272.6 0 320.3 106.8 320.3 178.2 0 70.8-47.7 177.6\n-320.3 177.6S193.1 320.6 193.1 249.8c0-71.4 46.9-178.2 319.5-178.2z\nm368.1 178.2c0-86.4-60.9-215.4-368.1-215.4-306.4 0-367.3 129-367.3 215.4 0 85.8\n60.9 214.8 367.3 214.8 307.2 0 368.1-129 368.1-214.8z",oiintSize2:"M757.8 100.1c384.7 0 451.1 137.6 451.1 230 0 91.3-66.4 228.8\n-451.1 228.8-386.3 0-452.7-137.5-452.7-228.8 0-92.4 66.4-230 452.7-230z\nm502.4 230c0-111.2-82.4-277.2-502.4-277.2s-504 166-504 277.2\nc0 110 84 276 504 276s502.4-166 502.4-276z",oiiintSize1:"M681.4 71.6c408.9 0 480.5 106.8 480.5 178.2 0 70.8-71.6 177.6\n-480.5 177.6S202.1 320.6 202.1 249.8c0-71.4 70.5-178.2 479.3-178.2z\nm525.8 178.2c0-86.4-86.8-215.4-525.7-215.4-437.9 0-524.7 129-524.7 215.4 0\n85.8 86.8 214.8 524.7 214.8 438.9 0 525.7-129 525.7-214.8z",oiiintSize2:"M1021.2 53c603.6 0 707.8 165.8 707.8 277.2 0 110-104.2 275.8\n-707.8 275.8-606 0-710.2-165.8-710.2-275.8C311 218.8 415.2 53 1021.2 53z\nm770.4 277.1c0-131.2-126.4-327.6-770.5-327.6S248.4 198.9 248.4 330.1\nc0 130 128.8 326.4 772.7 326.4s770.5-196.4 770.5-326.4z",rightarrow:"M0 241v40h399891c-47.3 35.3-84 78-110 128\n-16.7 32-27.7 63.7-33 95 0 1.3-.2 2.7-.5 4-.3 1.3-.5 2.3-.5 3 0 7.3 6.7 11 20\n 11 8 0 13.2-.8 15.5-2.5 2.3-1.7 4.2-5.5 5.5-11.5 2-13.3 5.7-27 11-41 14.7-44.7\n 39-84.5 73-119.5s73.7-60.2 119-75.5c6-2 9-5.7 9-11s-3-9-9-11c-45.3-15.3-85\n-40.5-119-75.5s-58.3-74.8-73-119.5c-4.7-14-8.3-27.3-11-40-1.3-6.7-3.2-10.8-5.5\n-12.5-2.3-1.7-7.5-2.5-15.5-2.5-14 0-21 3.7-21 11 0 2 2 10.3 6 25 20.7 83.3 67\n 151.7 139 205zm0 0v40h399900v-40z",rightbrace:"M400000 542l\n-6 6h-17c-12.7 0-19.3-.3-20-1-4-4-7.3-8.3-10-13-35.3-51.3-80.8-93.8-136.5-127.5\ns-117.2-55.8-184.5-66.5c-.7 0-2-.3-4-1-18.7-2.7-76-4.3-172-5H0V214h399571l6 1\nc124.7 8 235 61.7 331 161 31.3 33.3 59.7 72.7 85 118l7 13v35z",rightbraceunder:"M399994 0l6 6v35l-6 11c-56 104-135.3 181.3-238 232-57.3\n 28.7-117 45-179 50H-300V214h399897c43.3-7 81-15 113-26 100.7-33 179.7-91 237\n-174 2.7-5 6-9 10-13 .7-1 7.3-1 20-1h17z",rightgroup:"M0 80h399565c371 0 266.7 149.4 414 180 5.9 1.2 18 0 18 0 2 0\n 3-1 3-3v-38c-76-158-257-219-435-219H0z",rightgroupunder:"M0 262h399565c371 0 266.7-149.4 414-180 5.9-1.2 18 0 18\n 0 2 0 3 1 3 3v38c-76 158-257 219-435 219H0z",rightharpoon:"M0 241v40h399993c4.7-4.7 7-9.3 7-14 0-9.3\n-3.7-15.3-11-18-92.7-56.7-159-133.7-199-231-3.3-9.3-6-14.7-8-16-2-1.3-7-2-15-2\n-10.7 0-16.7 2-18 6-2 2.7-1 9.7 3 21 15.3 42 36.7 81.8 64 119.5 27.3 37.7 58\n 69.2 92 94.5zm0 0v40h399900v-40z",rightharpoonplus:"M0 241v40h399993c4.7-4.7 7-9.3 7-14 0-9.3-3.7-15.3-11\n-18-92.7-56.7-159-133.7-199-231-3.3-9.3-6-14.7-8-16-2-1.3-7-2-15-2-10.7 0-16.7\n 2-18 6-2 2.7-1 9.7 3 21 15.3 42 36.7 81.8 64 119.5 27.3 37.7 58 69.2 92 94.5z\nm0 0v40h399900v-40z m100 194v40h399900v-40zm0 0v40h399900v-40z",rightharpoondown:"M399747 511c0 7.3 6.7 11 20 11 8 0 13-.8 15-2.5s4.7-6.8\n 8-15.5c40-94 99.3-166.3 178-217 13.3-8 20.3-12.3 21-13 5.3-3.3 8.5-5.8 9.5\n-7.5 1-1.7 1.5-5.2 1.5-10.5s-2.3-10.3-7-15H0v40h399908c-34 25.3-64.7 57-92 95\n-27.3 38-48.7 77.7-64 119-3.3 8.7-5 14-5 16zM0 241v40h399900v-40z",rightharpoondownplus:"M399747 705c0 7.3 6.7 11 20 11 8 0 13-.8\n 15-2.5s4.7-6.8 8-15.5c40-94 99.3-166.3 178-217 13.3-8 20.3-12.3 21-13 5.3-3.3\n 8.5-5.8 9.5-7.5 1-1.7 1.5-5.2 1.5-10.5s-2.3-10.3-7-15H0v40h399908c-34 25.3\n-64.7 57-92 95-27.3 38-48.7 77.7-64 119-3.3 8.7-5 14-5 16zM0 435v40h399900v-40z\nm0-194v40h400000v-40zm0 0v40h400000v-40z",righthook:"M399859 241c-764 0 0 0 0 0 40-3.3 68.7-15.7 86-37 10-12 15-25.3\n 15-40 0-22.7-9.8-40.7-29.5-54-19.7-13.3-43.5-21-71.5-23-17.3-1.3-26-8-26-20 0\n-13.3 8.7-20 26-20 38 0 71 11.2 99 33.5 0 0 7 5.6 21 16.7 14 11.2 21 33.5 21\n 66.8s-14 61.2-42 83.5c-28 22.3-61 33.5-99 33.5L0 241z M0 281v-40h399859v40z",rightlinesegment:"M399960 241 V94 h40 V428 h-40 V281 H0 v-40z\nM399960 241 V94 h40 V428 h-40 V281 H0 v-40z",rightToFrom:"M400000 167c-70.7-42-118-97.7-142-167h-23c-15.3 0-23 .3-23\n 1 0 1.3 5.3 13.7 16 37 18 35.3 41.3 69 70 101l7 8H0v40h399905l-7 8c-28.7 32\n-52 65.7-70 101-10.7 23.3-16 35.7-16 37 0 .7 7.7 1 23 1h23c24-69.3 71.3-125 142\n-167z M100 147v40h399900v-40zM0 341v40h399900v-40z",twoheadleftarrow:"M0 167c68 40\n 115.7 95.7 143 167h22c15.3 0 23-.3 23-1 0-1.3-5.3-13.7-16-37-18-35.3-41.3-69\n-70-101l-7-8h125l9 7c50.7 39.3 85 86 103 140h46c0-4.7-6.3-18.7-19-42-18-35.3\n-40-67.3-66-96l-9-9h399716v-40H284l9-9c26-28.7 48-60.7 66-96 12.7-23.333 19\n-37.333 19-42h-46c-18 54-52.3 100.7-103 140l-9 7H95l7-8c28.7-32 52-65.7 70-101\n 10.7-23.333 16-35.7 16-37 0-.7-7.7-1-23-1h-22C115.7 71.3 68 127 0 167z",twoheadrightarrow:"M400000 167\nc-68-40-115.7-95.7-143-167h-22c-15.3 0-23 .3-23 1 0 1.3 5.3 13.7 16 37 18 35.3\n 41.3 69 70 101l7 8h-125l-9-7c-50.7-39.3-85-86-103-140h-46c0 4.7 6.3 18.7 19 42\n 18 35.3 40 67.3 66 96l9 9H0v40h399716l-9 9c-26 28.7-48 60.7-66 96-12.7 23.333\n-19 37.333-19 42h46c18-54 52.3-100.7 103-140l9-7h125l-7 8c-28.7 32-52 65.7-70\n 101-10.7 23.333-16 35.7-16 37 0 .7 7.7 1 23 1h22c27.3-71.3 75-127 143-167z",tilde1:"M200 55.538c-77 0-168 73.953-177 73.953-3 0-7\n-2.175-9-5.437L2 97c-1-2-2-4-2-6 0-4 2-7 5-9l20-12C116 12 171 0 207 0c86 0\n 114 68 191 68 78 0 168-68 177-68 4 0 7 2 9 5l12 19c1 2.175 2 4.35 2 6.525 0\n 4.35-2 7.613-5 9.788l-19 13.05c-92 63.077-116.937 75.308-183 76.128\n-68.267.847-113-73.952-191-73.952z",tilde2:"M344 55.266c-142 0-300.638 81.316-311.5 86.418\n-8.01 3.762-22.5 10.91-23.5 5.562L1 120c-1-2-1-3-1-4 0-5 3-9 8-10l18.4-9C160.9\n 31.9 283 0 358 0c148 0 188 122 331 122s314-97 326-97c4 0 8 2 10 7l7 21.114\nc1 2.14 1 3.21 1 4.28 0 5.347-3 9.626-7 10.696l-22.3 12.622C852.6 158.372 751\n 181.476 676 181.476c-149 0-189-126.21-332-126.21z",tilde3:"M786 59C457 59 32 175.242 13 175.242c-6 0-10-3.457\n-11-10.37L.15 138c-1-7 3-12 10-13l19.2-6.4C378.4 40.7 634.3 0 804.3 0c337 0\n 411.8 157 746.8 157 328 0 754-112 773-112 5 0 10 3 11 9l1 14.075c1 8.066-.697\n 16.595-6.697 17.492l-21.052 7.31c-367.9 98.146-609.15 122.696-778.15 122.696\n -338 0-409-156.573-744-156.573z",tilde4:"M786 58C457 58 32 177.487 13 177.487c-6 0-10-3.345\n-11-10.035L.15 143c-1-7 3-12 10-13l22-6.7C381.2 35 637.15 0 807.15 0c337 0 409\n 177 744 177 328 0 754-127 773-127 5 0 10 3 11 9l1 14.794c1 7.805-3 13.38-9\n 14.495l-20.7 5.574c-366.85 99.79-607.3 139.372-776.3 139.372-338 0-409\n -175.236-744-175.236z",vec:"M377 20c0-5.333 1.833-10 5.5-14S391 0 397 0c4.667 0 8.667 1.667 12 5\n3.333 2.667 6.667 9 10 19 6.667 24.667 20.333 43.667 41 57 7.333 4.667 11\n10.667 11 18 0 6-1 10-3 12s-6.667 5-14 9c-28.667 14.667-53.667 35.667-75 63\n-1.333 1.333-3.167 3.5-5.5 6.5s-4 4.833-5 5.5c-1 .667-2.5 1.333-4.5 2s-4.333 1\n-7 1c-4.667 0-9.167-1.833-13.5-5.5S337 184 337 178c0-12.667 15.667-32.333 47-59\nH213l-171-1c-8.667-6-13-12.333-13-19 0-4.667 4.333-11.333 13-20h359\nc-16-25.333-24-45-24-59z",widehat1:"M529 0h5l519 115c5 1 9 5 9 10 0 1-1 2-1 3l-4 22\nc-1 5-5 9-11 9h-2L532 67 19 159h-2c-5 0-9-4-11-9l-5-22c-1-6 2-12 8-13z",widehat2:"M1181 0h2l1171 176c6 0 10 5 10 11l-2 23c-1 6-5 10\n-11 10h-1L1182 67 15 220h-1c-6 0-10-4-11-10l-2-23c-1-6 4-11 10-11z",widehat3:"M1181 0h2l1171 236c6 0 10 5 10 11l-2 23c-1 6-5 10\n-11 10h-1L1182 67 15 280h-1c-6 0-10-4-11-10l-2-23c-1-6 4-11 10-11z",widehat4:"M1181 0h2l1171 296c6 0 10 5 10 11l-2 23c-1 6-5 10\n-11 10h-1L1182 67 15 340h-1c-6 0-10-4-11-10l-2-23c-1-6 4-11 10-11z",widecheck1:"M529,159h5l519,-115c5,-1,9,-5,9,-10c0,-1,-1,-2,-1,-3l-4,-22c-1,\n-5,-5,-9,-11,-9h-2l-512,92l-513,-92h-2c-5,0,-9,4,-11,9l-5,22c-1,6,2,12,8,13z",widecheck2:"M1181,220h2l1171,-176c6,0,10,-5,10,-11l-2,-23c-1,-6,-5,-10,\n-11,-10h-1l-1168,153l-1167,-153h-1c-6,0,-10,4,-11,10l-2,23c-1,6,4,11,10,11z",widecheck3:"M1181,280h2l1171,-236c6,0,10,-5,10,-11l-2,-23c-1,-6,-5,-10,\n-11,-10h-1l-1168,213l-1167,-213h-1c-6,0,-10,4,-11,10l-2,23c-1,6,4,11,10,11z",widecheck4:"M1181,340h2l1171,-296c6,0,10,-5,10,-11l-2,-23c-1,-6,-5,-10,\n-11,-10h-1l-1168,273l-1167,-273h-1c-6,0,-10,4,-11,10l-2,23c-1,6,4,11,10,11z",baraboveleftarrow:"M400000 620h-399890l3 -3c68.7 -52.7 113.7 -120 135 -202\nc4 -14.7 6 -23 6 -25c0 -7.3 -7 -11 -21 -11c-8 0 -13.2 0.8 -15.5 2.5\nc-2.3 1.7 -4.2 5.8 -5.5 12.5c-1.3 4.7 -2.7 10.3 -4 17c-12 48.7 -34.8 92 -68.5 130\ns-74.2 66.3 -121.5 85c-10 4 -16 7.7 -18 11c0 8.7 6 14.3 18 17c47.3 18.7 87.8 47\n121.5 85s56.5 81.3 68.5 130c0.7 2 1.3 5 2 9s1.2 6.7 1.5 8c0.3 1.3 1 3.3 2 6\ns2.2 4.5 3.5 5.5c1.3 1 3.3 1.8 6 2.5s6 1 10 1c14 0 21 -3.7 21 -11\nc0 -2 -2 -10.3 -6 -25c-20 -79.3 -65 -146.7 -135 -202l-3 -3h399890z\nM100 620v40h399900v-40z M0 241v40h399900v-40zM0 241v40h399900v-40z",rightarrowabovebar:"M0 241v40h399891c-47.3 35.3-84 78-110 128-16.7 32\n-27.7 63.7-33 95 0 1.3-.2 2.7-.5 4-.3 1.3-.5 2.3-.5 3 0 7.3 6.7 11 20 11 8 0\n13.2-.8 15.5-2.5 2.3-1.7 4.2-5.5 5.5-11.5 2-13.3 5.7-27 11-41 14.7-44.7 39\n-84.5 73-119.5s73.7-60.2 119-75.5c6-2 9-5.7 9-11s-3-9-9-11c-45.3-15.3-85-40.5\n-119-75.5s-58.3-74.8-73-119.5c-4.7-14-8.3-27.3-11-40-1.3-6.7-3.2-10.8-5.5\n-12.5-2.3-1.7-7.5-2.5-15.5-2.5-14 0-21 3.7-21 11 0 2 2 10.3 6 25 20.7 83.3 67\n151.7 139 205zm96 379h399894v40H0zm0 0h399904v40H0z",baraboveshortleftharpoon:"M507,435c-4,4,-6.3,8.7,-7,14c0,5.3,0.7,9,2,11\nc1.3,2,5.3,5.3,12,10c90.7,54,156,130,196,228c3.3,10.7,6.3,16.3,9,17\nc2,0.7,5,1,9,1c0,0,5,0,5,0c10.7,0,16.7,-2,18,-6c2,-2.7,1,-9.7,-3,-21\nc-32,-87.3,-82.7,-157.7,-152,-211c0,0,-3,-3,-3,-3l399351,0l0,-40\nc-398570,0,-399437,0,-399437,0z M593 435 v40 H399500 v-40z\nM0 281 v-40 H399908 v40z M0 281 v-40 H399908 v40z",rightharpoonaboveshortbar:"M0,241 l0,40c399126,0,399993,0,399993,0\nc4.7,-4.7,7,-9.3,7,-14c0,-9.3,-3.7,-15.3,-11,-18c-92.7,-56.7,-159,-133.7,-199,\n-231c-3.3,-9.3,-6,-14.7,-8,-16c-2,-1.3,-7,-2,-15,-2c-10.7,0,-16.7,2,-18,6\nc-2,2.7,-1,9.7,3,21c15.3,42,36.7,81.8,64,119.5c27.3,37.7,58,69.2,92,94.5z\nM0 241 v40 H399908 v-40z M0 475 v-40 H399500 v40z M0 475 v-40 H399500 v40z",shortbaraboveleftharpoon:"M7,435c-4,4,-6.3,8.7,-7,14c0,5.3,0.7,9,2,11\nc1.3,2,5.3,5.3,12,10c90.7,54,156,130,196,228c3.3,10.7,6.3,16.3,9,17c2,0.7,5,1,9,\n1c0,0,5,0,5,0c10.7,0,16.7,-2,18,-6c2,-2.7,1,-9.7,-3,-21c-32,-87.3,-82.7,-157.7,\n-152,-211c0,0,-3,-3,-3,-3l399907,0l0,-40c-399126,0,-399993,0,-399993,0z\nM93 435 v40 H400000 v-40z M500 241 v40 H400000 v-40z M500 241 v40 H400000 v-40z",shortrightharpoonabovebar:"M53,241l0,40c398570,0,399437,0,399437,0\nc4.7,-4.7,7,-9.3,7,-14c0,-9.3,-3.7,-15.3,-11,-18c-92.7,-56.7,-159,-133.7,-199,\n-231c-3.3,-9.3,-6,-14.7,-8,-16c-2,-1.3,-7,-2,-15,-2c-10.7,0,-16.7,2,-18,6\nc-2,2.7,-1,9.7,3,21c15.3,42,36.7,81.8,64,119.5c27.3,37.7,58,69.2,92,94.5z\nM500 241 v40 H399408 v-40z M500 435 v40 H400000 v-40z"},A=function(){function e(e){this.children=void 0,this.classes=void 0,this.height=void 0,this.depth=void 0,this.maxFontSize=void 0,this.style=void 0,this.children=e,this.classes=[],this.height=0,this.depth=0,this.maxFontSize=0,this.style={}}var t=e.prototype;return t.hasClass=function(e){return l.contains(this.classes,e)},t.toNode=function(){for(var e=document.createDocumentFragment(),t=0;t=5?0:e>=3?1:2]){var r=N[t]={cssEmPerMu:B.quad[t]/18};for(var n in B)B.hasOwnProperty(n)&&(r[n]=B[n][t])}return N[t]}(this.size)),this._fontMetrics},t.getColor=function(){return this.phantom?"transparent":this.color},e}();H.BASESIZE=6;var E=H,L={pt:1,mm:7227/2540,cm:7227/254,in:72.27,bp:1.00375,pc:12,dd:1238/1157,cc:14856/1157,nd:685/642,nc:1370/107,sp:1/65536,px:1.00375},D={ex:!0,em:!0,mu:!0},P=function(e){return"string"!=typeof e&&(e=e.unit),e in L||e in D||"ex"===e},F=function(e,t){var r;if(e.unit in L)r=L[e.unit]/t.fontMetrics().ptPerEm/t.sizeMultiplier;else if("mu"===e.unit)r=t.fontMetrics().cssEmPerMu;else{var a;if(a=t.style.isTight()?t.havingStyle(t.style.text()):t,"ex"===e.unit)r=a.fontMetrics().xHeight;else{if("em"!==e.unit)throw new n("Invalid unit: '"+e.unit+"'");r=a.fontMetrics().quad}a!==t&&(r*=a.sizeMultiplier/t.sizeMultiplier)}return Math.min(e.number*r,t.maxSize)},V=function(e){return+e.toFixed(4)+"em"},G=function(e){return e.filter((function(e){return e})).join(" ")},U=function(e,t,r){if(this.classes=e||[],this.attributes={},this.height=0,this.depth=0,this.maxFontSize=0,this.style=r||{},t){t.style.isTight()&&this.classes.push("mtight");var n=t.getColor();n&&(this.style.color=n)}},Y=function(e){var t=document.createElement(e);for(var r in t.className=G(this.classes),this.style)this.style.hasOwnProperty(r)&&(t.style[r]=this.style[r]);for(var n in this.attributes)this.attributes.hasOwnProperty(n)&&t.setAttribute(n,this.attributes[n]);for(var a=0;a"},W=function(){function e(e,t,r,n){this.children=void 0,this.attributes=void 0,this.classes=void 0,this.height=void 0,this.depth=void 0,this.width=void 0,this.maxFontSize=void 0,this.style=void 0,U.call(this,e,r,n),this.children=t||[]}var t=e.prototype;return t.setAttribute=function(e,t){this.attributes[e]=t},t.hasClass=function(e){return l.contains(this.classes,e)},t.toNode=function(){return Y.call(this,"span")},t.toMarkup=function(){return X.call(this,"span")},e}(),_=function(){function e(e,t,r,n){this.children=void 0,this.attributes=void 0,this.classes=void 0,this.height=void 0,this.depth=void 0,this.maxFontSize=void 0,this.style=void 0,U.call(this,t,n),this.children=r||[],this.setAttribute("href",e)}var t=e.prototype;return t.setAttribute=function(e,t){this.attributes[e]=t},t.hasClass=function(e){return l.contains(this.classes,e)},t.toNode=function(){return Y.call(this,"a")},t.toMarkup=function(){return X.call(this,"a")},e}(),j=function(){function e(e,t,r){this.src=void 0,this.alt=void 0,this.classes=void 0,this.height=void 0,this.depth=void 0,this.maxFontSize=void 0,this.style=void 0,this.alt=t,this.src=e,this.classes=["mord"],this.style=r}var t=e.prototype;return t.hasClass=function(e){return l.contains(this.classes,e)},t.toNode=function(){var e=document.createElement("img");for(var t in e.src=this.src,e.alt=this.alt,e.className="mord",this.style)this.style.hasOwnProperty(t)&&(e.style[t]=this.style[t]);return e},t.toMarkup=function(){var e=""+this.alt+"=a[0]&&e<=a[1])return r.name}return null}(this.text.charCodeAt(0));l&&this.classes.push(l+"_fallback"),/[\xee\xef\xed\xec]/.test(this.text)&&(this.text=$[this.text])}var t=e.prototype;return t.hasClass=function(e){return l.contains(this.classes,e)},t.toNode=function(){var e=document.createTextNode(this.text),t=null;for(var r in this.italic>0&&((t=document.createElement("span")).style.marginRight=V(this.italic)),this.classes.length>0&&((t=t||document.createElement("span")).className=G(this.classes)),this.style)this.style.hasOwnProperty(r)&&((t=t||document.createElement("span")).style[r]=this.style[r]);return t?(t.appendChild(e),t):e},t.toMarkup=function(){var e=!1,t="0&&(r+="margin-right:"+this.italic+"em;"),this.style)this.style.hasOwnProperty(n)&&(r+=l.hyphenate(n)+":"+this.style[n]+";");r&&(e=!0,t+=' style="'+l.escape(r)+'"');var a=l.escape(this.text);return e?(t+=">",t+=a,t+=""):a},e}(),K=function(){function e(e,t){this.children=void 0,this.attributes=void 0,this.children=e||[],this.attributes=t||{}}var t=e.prototype;return t.toNode=function(){var e=document.createElementNS("http://www.w3.org/2000/svg","svg");for(var t in this.attributes)Object.prototype.hasOwnProperty.call(this.attributes,t)&&e.setAttribute(t,this.attributes[t]);for(var r=0;r":""},e}(),Q=function(){function e(e){this.attributes=void 0,this.attributes=e||{}}var t=e.prototype;return t.toNode=function(){var e=document.createElementNS("http://www.w3.org/2000/svg","line");for(var t in this.attributes)Object.prototype.hasOwnProperty.call(this.attributes,t)&&e.setAttribute(t,this.attributes[t]);return e},t.toMarkup=function(){var e="","\\gt",!0),ie(oe,le,be,"\u2208","\\in",!0),ie(oe,le,be,"\ue020","\\@not"),ie(oe,le,be,"\u2282","\\subset",!0),ie(oe,le,be,"\u2283","\\supset",!0),ie(oe,le,be,"\u2286","\\subseteq",!0),ie(oe,le,be,"\u2287","\\supseteq",!0),ie(oe,he,be,"\u2288","\\nsubseteq",!0),ie(oe,he,be,"\u2289","\\nsupseteq",!0),ie(oe,le,be,"\u22a8","\\models"),ie(oe,le,be,"\u2190","\\leftarrow",!0),ie(oe,le,be,"\u2264","\\le"),ie(oe,le,be,"\u2264","\\leq",!0),ie(oe,le,be,"<","\\lt",!0),ie(oe,le,be,"\u2192","\\rightarrow",!0),ie(oe,le,be,"\u2192","\\to"),ie(oe,he,be,"\u2271","\\ngeq",!0),ie(oe,he,be,"\u2270","\\nleq",!0),ie(oe,le,ye,"\xa0","\\ "),ie(oe,le,ye,"\xa0","\\space"),ie(oe,le,ye,"\xa0","\\nobreakspace"),ie(se,le,ye,"\xa0","\\ "),ie(se,le,ye,"\xa0"," "),ie(se,le,ye,"\xa0","\\space"),ie(se,le,ye,"\xa0","\\nobreakspace"),ie(oe,le,ye,null,"\\nobreak"),ie(oe,le,ye,null,"\\allowbreak"),ie(oe,le,ve,",",","),ie(oe,le,ve,";",";"),ie(oe,he,ce,"\u22bc","\\barwedge",!0),ie(oe,he,ce,"\u22bb","\\veebar",!0),ie(oe,le,ce,"\u2299","\\odot",!0),ie(oe,le,ce,"\u2295","\\oplus",!0),ie(oe,le,ce,"\u2297","\\otimes",!0),ie(oe,le,xe,"\u2202","\\partial",!0),ie(oe,le,ce,"\u2298","\\oslash",!0),ie(oe,he,ce,"\u229a","\\circledcirc",!0),ie(oe,he,ce,"\u22a1","\\boxdot",!0),ie(oe,le,ce,"\u25b3","\\bigtriangleup"),ie(oe,le,ce,"\u25bd","\\bigtriangledown"),ie(oe,le,ce,"\u2020","\\dagger"),ie(oe,le,ce,"\u22c4","\\diamond"),ie(oe,le,ce,"\u22c6","\\star"),ie(oe,le,ce,"\u25c3","\\triangleleft"),ie(oe,le,ce,"\u25b9","\\triangleright"),ie(oe,le,ge,"{","\\{"),ie(se,le,xe,"{","\\{"),ie(se,le,xe,"{","\\textbraceleft"),ie(oe,le,ue,"}","\\}"),ie(se,le,xe,"}","\\}"),ie(se,le,xe,"}","\\textbraceright"),ie(oe,le,ge,"{","\\lbrace"),ie(oe,le,ue,"}","\\rbrace"),ie(oe,le,ge,"[","\\lbrack",!0),ie(se,le,xe,"[","\\lbrack",!0),ie(oe,le,ue,"]","\\rbrack",!0),ie(se,le,xe,"]","\\rbrack",!0),ie(oe,le,ge,"(","\\lparen",!0),ie(oe,le,ue,")","\\rparen",!0),ie(se,le,xe,"<","\\textless",!0),ie(se,le,xe,">","\\textgreater",!0),ie(oe,le,ge,"\u230a","\\lfloor",!0),ie(oe,le,ue,"\u230b","\\rfloor",!0),ie(oe,le,ge,"\u2308","\\lceil",!0),ie(oe,le,ue,"\u2309","\\rceil",!0),ie(oe,le,xe,"\\","\\backslash"),ie(oe,le,xe,"\u2223","|"),ie(oe,le,xe,"\u2223","\\vert"),ie(se,le,xe,"|","\\textbar",!0),ie(oe,le,xe,"\u2225","\\|"),ie(oe,le,xe,"\u2225","\\Vert"),ie(se,le,xe,"\u2225","\\textbardbl"),ie(se,le,xe,"~","\\textasciitilde"),ie(se,le,xe,"\\","\\textbackslash"),ie(se,le,xe,"^","\\textasciicircum"),ie(oe,le,be,"\u2191","\\uparrow",!0),ie(oe,le,be,"\u21d1","\\Uparrow",!0),ie(oe,le,be,"\u2193","\\downarrow",!0),ie(oe,le,be,"\u21d3","\\Downarrow",!0),ie(oe,le,be,"\u2195","\\updownarrow",!0),ie(oe,le,be,"\u21d5","\\Updownarrow",!0),ie(oe,le,fe,"\u2210","\\coprod"),ie(oe,le,fe,"\u22c1","\\bigvee"),ie(oe,le,fe,"\u22c0","\\bigwedge"),ie(oe,le,fe,"\u2a04","\\biguplus"),ie(oe,le,fe,"\u22c2","\\bigcap"),ie(oe,le,fe,"\u22c3","\\bigcup"),ie(oe,le,fe,"\u222b","\\int"),ie(oe,le,fe,"\u222b","\\intop"),ie(oe,le,fe,"\u222c","\\iint"),ie(oe,le,fe,"\u222d","\\iiint"),ie(oe,le,fe,"\u220f","\\prod"),ie(oe,le,fe,"\u2211","\\sum"),ie(oe,le,fe,"\u2a02","\\bigotimes"),ie(oe,le,fe,"\u2a01","\\bigoplus"),ie(oe,le,fe,"\u2a00","\\bigodot"),ie(oe,le,fe,"\u222e","\\oint"),ie(oe,le,fe,"\u222f","\\oiint"),ie(oe,le,fe,"\u2230","\\oiiint"),ie(oe,le,fe,"\u2a06","\\bigsqcup"),ie(oe,le,fe,"\u222b","\\smallint"),ie(se,le,pe,"\u2026","\\textellipsis"),ie(oe,le,pe,"\u2026","\\mathellipsis"),ie(se,le,pe,"\u2026","\\ldots",!0),ie(oe,le,pe,"\u2026","\\ldots",!0),ie(oe,le,pe,"\u22ef","\\@cdots",!0),ie(oe,le,pe,"\u22f1","\\ddots",!0),ie(oe,le,xe,"\u22ee","\\varvdots"),ie(oe,le,me,"\u02ca","\\acute"),ie(oe,le,me,"\u02cb","\\grave"),ie(oe,le,me,"\xa8","\\ddot"),ie(oe,le,me,"~","\\tilde"),ie(oe,le,me,"\u02c9","\\bar"),ie(oe,le,me,"\u02d8","\\breve"),ie(oe,le,me,"\u02c7","\\check"),ie(oe,le,me,"^","\\hat"),ie(oe,le,me,"\u20d7","\\vec"),ie(oe,le,me,"\u02d9","\\dot"),ie(oe,le,me,"\u02da","\\mathring"),ie(oe,le,de,"\ue131","\\@imath"),ie(oe,le,de,"\ue237","\\@jmath"),ie(oe,le,xe,"\u0131","\u0131"),ie(oe,le,xe,"\u0237","\u0237"),ie(se,le,xe,"\u0131","\\i",!0),ie(se,le,xe,"\u0237","\\j",!0),ie(se,le,xe,"\xdf","\\ss",!0),ie(se,le,xe,"\xe6","\\ae",!0),ie(se,le,xe,"\u0153","\\oe",!0),ie(se,le,xe,"\xf8","\\o",!0),ie(se,le,xe,"\xc6","\\AE",!0),ie(se,le,xe,"\u0152","\\OE",!0),ie(se,le,xe,"\xd8","\\O",!0),ie(se,le,me,"\u02ca","\\'"),ie(se,le,me,"\u02cb","\\`"),ie(se,le,me,"\u02c6","\\^"),ie(se,le,me,"\u02dc","\\~"),ie(se,le,me,"\u02c9","\\="),ie(se,le,me,"\u02d8","\\u"),ie(se,le,me,"\u02d9","\\."),ie(se,le,me,"\xb8","\\c"),ie(se,le,me,"\u02da","\\r"),ie(se,le,me,"\u02c7","\\v"),ie(se,le,me,"\xa8",'\\"'),ie(se,le,me,"\u02dd","\\H"),ie(se,le,me,"\u25ef","\\textcircled");var we={"--":!0,"---":!0,"``":!0,"''":!0};ie(se,le,xe,"\u2013","--",!0),ie(se,le,xe,"\u2013","\\textendash"),ie(se,le,xe,"\u2014","---",!0),ie(se,le,xe,"\u2014","\\textemdash"),ie(se,le,xe,"\u2018","`",!0),ie(se,le,xe,"\u2018","\\textquoteleft"),ie(se,le,xe,"\u2019","'",!0),ie(se,le,xe,"\u2019","\\textquoteright"),ie(se,le,xe,"\u201c","``",!0),ie(se,le,xe,"\u201c","\\textquotedblleft"),ie(se,le,xe,"\u201d","''",!0),ie(se,le,xe,"\u201d","\\textquotedblright"),ie(oe,le,xe,"\xb0","\\degree",!0),ie(se,le,xe,"\xb0","\\degree"),ie(se,le,xe,"\xb0","\\textdegree",!0),ie(oe,le,xe,"\xa3","\\pounds"),ie(oe,le,xe,"\xa3","\\mathsterling",!0),ie(se,le,xe,"\xa3","\\pounds"),ie(se,le,xe,"\xa3","\\textsterling",!0),ie(oe,he,xe,"\u2720","\\maltese"),ie(se,he,xe,"\u2720","\\maltese");for(var ke='0123456789/@."',Se=0;Set&&(t=i.height),i.depth>r&&(r=i.depth),i.maxFontSize>n&&(n=i.maxFontSize)}e.height=t,e.depth=r,e.maxFontSize=n},Xe=function(e,t,r,n){var a=new W(e,t,r,n);return Ye(a),a},We=function(e,t,r,n){return new W(e,t,r,n)},_e=function(e){var t=new A(e);return Ye(t),t},je=function(e,t,r){var n="";switch(e){case"amsrm":n="AMS";break;case"textrm":n="Main";break;case"textsf":n="SansSerif";break;case"texttt":n="Typewriter";break;default:n=e}return n+"-"+("textbf"===t&&"textit"===r?"BoldItalic":"textbf"===t?"Bold":"textit"===t?"Italic":"Regular")},$e={mathbf:{variant:"bold",fontName:"Main-Bold"},mathrm:{variant:"normal",fontName:"Main-Regular"},textit:{variant:"italic",fontName:"Main-Italic"},mathit:{variant:"italic",fontName:"Main-Italic"},mathnormal:{variant:"italic",fontName:"Math-Italic"},mathbb:{variant:"double-struck",fontName:"AMS-Regular"},mathcal:{variant:"script",fontName:"Caligraphic-Regular"},mathfrak:{variant:"fraktur",fontName:"Fraktur-Regular"},mathscr:{variant:"script",fontName:"Script-Regular"},mathsf:{variant:"sans-serif",fontName:"SansSerif-Regular"},mathtt:{variant:"monospace",fontName:"Typewriter-Regular"}},Ze={vec:["vec",.471,.714],oiintSize1:["oiintSize1",.957,.499],oiintSize2:["oiintSize2",1.472,.659],oiiintSize1:["oiiintSize1",1.304,.499],oiiintSize2:["oiiintSize2",1.98,.659]},Ke={fontMap:$e,makeSymbol:Ge,mathsym:function(e,t,r,n){return void 0===n&&(n=[]),"boldsymbol"===r.font&&Ve(e,"Main-Bold",t).metrics?Ge(e,"Main-Bold",t,r,n.concat(["mathbf"])):"\\"===e||"main"===ae[t][e].font?Ge(e,"Main-Regular",t,r,n):Ge(e,"AMS-Regular",t,r,n.concat(["amsrm"]))},makeSpan:Xe,makeSvgSpan:We,makeLineSpan:function(e,t,r){var n=Xe([e],[],t);return n.height=Math.max(r||t.fontMetrics().defaultRuleThickness,t.minRuleThickness),n.style.borderBottomWidth=V(n.height),n.maxFontSize=1,n},makeAnchor:function(e,t,r,n){var a=new _(e,t,r,n);return Ye(a),a},makeFragment:_e,wrapFragment:function(e,t){return e instanceof A?Xe([],[e],t):e},makeVList:function(e,t){for(var r=function(e){if("individualShift"===e.positionType){for(var t=e.children,r=[t[0]],n=-t[0].shift-t[0].elem.depth,a=n,i=1;i0&&(o.push(kt(s,t)),s=[]),o.push(a[l]));s.length>0&&o.push(kt(s,t)),r?((i=kt(ft(r,t,!0))).classes=["tag"],o.push(i)):n&&o.push(n);var m=mt(["katex-html"],o);if(m.setAttribute("aria-hidden","true"),i){var c=i.children[0];c.style.height=V(m.height+m.depth),m.depth&&(c.style.verticalAlign=V(-m.depth))}return m}function Mt(e){return new A(e)}var zt=function(){function e(e,t,r){this.type=void 0,this.attributes=void 0,this.children=void 0,this.classes=void 0,this.type=e,this.attributes={},this.children=t||[],this.classes=r||[]}var t=e.prototype;return t.setAttribute=function(e,t){this.attributes[e]=t},t.getAttribute=function(e){return this.attributes[e]},t.toNode=function(){var e=document.createElementNS("http://www.w3.org/1998/Math/MathML",this.type);for(var t in this.attributes)Object.prototype.hasOwnProperty.call(this.attributes,t)&&e.setAttribute(t,this.attributes[t]);this.classes.length>0&&(e.className=G(this.classes));for(var r=0;r0&&(e+=' class ="'+l.escape(G(this.classes))+'"'),e+=">";for(var r=0;r"},t.toText=function(){return this.children.map((function(e){return e.toText()})).join("")},e}(),At=function(){function e(e){this.text=void 0,this.text=e}var t=e.prototype;return t.toNode=function(){return document.createTextNode(this.text)},t.toMarkup=function(){return l.escape(this.toText())},t.toText=function(){return this.text},e}(),Tt={MathNode:zt,TextNode:At,SpaceNode:function(){function e(e){this.width=void 0,this.character=void 0,this.width=e,this.character=e>=.05555&&e<=.05556?"\u200a":e>=.1666&&e<=.1667?"\u2009":e>=.2222&&e<=.2223?"\u2005":e>=.2777&&e<=.2778?"\u2005\u200a":e>=-.05556&&e<=-.05555?"\u200a\u2063":e>=-.1667&&e<=-.1666?"\u2009\u2063":e>=-.2223&&e<=-.2222?"\u205f\u2063":e>=-.2778&&e<=-.2777?"\u2005\u2063":null}var t=e.prototype;return t.toNode=function(){if(this.character)return document.createTextNode(this.character);var e=document.createElementNS("http://www.w3.org/1998/Math/MathML","mspace");return e.setAttribute("width",V(this.width)),e},t.toMarkup=function(){return this.character?""+this.character+"":''},t.toText=function(){return this.character?this.character:" "},e}(),newDocumentFragment:Mt},Bt=function(e,t,r){return!ae[t][e]||!ae[t][e].replace||55349===e.charCodeAt(0)||we.hasOwnProperty(e)&&r&&(r.fontFamily&&"tt"===r.fontFamily.substr(4,2)||r.font&&"tt"===r.font.substr(4,2))||(e=ae[t][e].replace),new Tt.TextNode(e)},Ct=function(e){return 1===e.length?e[0]:new Tt.MathNode("mrow",e)},qt=function(e,t){if("texttt"===t.fontFamily)return"monospace";if("textsf"===t.fontFamily)return"textit"===t.fontShape&&"textbf"===t.fontWeight?"sans-serif-bold-italic":"textit"===t.fontShape?"sans-serif-italic":"textbf"===t.fontWeight?"bold-sans-serif":"sans-serif";if("textit"===t.fontShape&&"textbf"===t.fontWeight)return"bold-italic";if("textit"===t.fontShape)return"italic";if("textbf"===t.fontWeight)return"bold";var r=t.font;if(!r||"mathnormal"===r)return null;var n=e.mode;if("mathit"===r)return"italic";if("boldsymbol"===r)return"textord"===e.type?"bold":"bold-italic";if("mathbf"===r)return"bold";if("mathbb"===r)return"double-struck";if("mathfrak"===r)return"fraktur";if("mathscr"===r||"mathcal"===r)return"script";if("mathsf"===r)return"sans-serif";if("mathtt"===r)return"monospace";var a=e.text;return l.contains(["\\imath","\\jmath"],a)?null:(ae[n][a]&&ae[n][a].replace&&(a=ae[n][a].replace),q(a,Ke.fontMap[r].fontName,n)?Ke.fontMap[r].variant:null)},Nt=function(e,t,r){if(1===e.length){var n=Rt(e[0],t);return r&&n instanceof zt&&"mo"===n.type&&(n.setAttribute("lspace","0em"),n.setAttribute("rspace","0em")),[n]}for(var a,i=[],o=0;o0&&(p.text=p.text.slice(0,1)+"\u0338"+p.text.slice(1),i.pop())}}}i.push(s),a=s}return i},It=function(e,t,r){return Ct(Nt(e,t,r))},Rt=function(e,t){if(!e)return new Tt.MathNode("mrow");if(it[e.type])return it[e.type](e,t);throw new n("Got group of unknown type: '"+e.type+"'")};function Ot(e,t,r,n,a){var i,o=Nt(e,r);i=1===o.length&&o[0]instanceof zt&&l.contains(["mrow","mtable"],o[0].type)?o[0]:new Tt.MathNode("mrow",o);var s=new Tt.MathNode("annotation",[new Tt.TextNode(t)]);s.setAttribute("encoding","application/x-tex");var h=new Tt.MathNode("semantics",[i,s]),m=new Tt.MathNode("math",[h]);m.setAttribute("xmlns","http://www.w3.org/1998/Math/MathML"),n&&m.setAttribute("display","block");var c=a?"katex":"katex-mathml";return Ke.makeSpan([c],[m])}var Ht=function(e){return new E({style:e.displayMode?x.DISPLAY:x.TEXT,maxSize:e.maxSize,minRuleThickness:e.minRuleThickness})},Et=function(e,t){if(t.displayMode){var r=["katex-display"];t.leqno&&r.push("leqno"),t.fleqn&&r.push("fleqn"),e=Ke.makeSpan(r,[e])}return e},Lt=function(e,t,r){var n,a=Ht(r);if("mathml"===r.output)return Ot(e,t,a,r.displayMode,!0);if("html"===r.output){var i=St(e,a);n=Ke.makeSpan(["katex"],[i])}else{var o=Ot(e,t,a,r.displayMode,!1),s=St(e,a);n=Ke.makeSpan(["katex"],[o,s])}return Et(n,r)},Dt={widehat:"^",widecheck:"\u02c7",widetilde:"~",utilde:"~",overleftarrow:"\u2190",underleftarrow:"\u2190",xleftarrow:"\u2190",overrightarrow:"\u2192",underrightarrow:"\u2192",xrightarrow:"\u2192",underbrace:"\u23df",overbrace:"\u23de",overgroup:"\u23e0",undergroup:"\u23e1",overleftrightarrow:"\u2194",underleftrightarrow:"\u2194",xleftrightarrow:"\u2194",Overrightarrow:"\u21d2",xRightarrow:"\u21d2",overleftharpoon:"\u21bc",xleftharpoonup:"\u21bc",overrightharpoon:"\u21c0",xrightharpoonup:"\u21c0",xLeftarrow:"\u21d0",xLeftrightarrow:"\u21d4",xhookleftarrow:"\u21a9",xhookrightarrow:"\u21aa",xmapsto:"\u21a6",xrightharpoondown:"\u21c1",xleftharpoondown:"\u21bd",xrightleftharpoons:"\u21cc",xleftrightharpoons:"\u21cb",xtwoheadleftarrow:"\u219e",xtwoheadrightarrow:"\u21a0",xlongequal:"=",xtofrom:"\u21c4",xrightleftarrows:"\u21c4",xrightequilibrium:"\u21cc",xleftequilibrium:"\u21cb","\\cdrightarrow":"\u2192","\\cdleftarrow":"\u2190","\\cdlongequal":"="},Pt={overrightarrow:[["rightarrow"],.888,522,"xMaxYMin"],overleftarrow:[["leftarrow"],.888,522,"xMinYMin"],underrightarrow:[["rightarrow"],.888,522,"xMaxYMin"],underleftarrow:[["leftarrow"],.888,522,"xMinYMin"],xrightarrow:[["rightarrow"],1.469,522,"xMaxYMin"],"\\cdrightarrow":[["rightarrow"],3,522,"xMaxYMin"],xleftarrow:[["leftarrow"],1.469,522,"xMinYMin"],"\\cdleftarrow":[["leftarrow"],3,522,"xMinYMin"],Overrightarrow:[["doublerightarrow"],.888,560,"xMaxYMin"],xRightarrow:[["doublerightarrow"],1.526,560,"xMaxYMin"],xLeftarrow:[["doubleleftarrow"],1.526,560,"xMinYMin"],overleftharpoon:[["leftharpoon"],.888,522,"xMinYMin"],xleftharpoonup:[["leftharpoon"],.888,522,"xMinYMin"],xleftharpoondown:[["leftharpoondown"],.888,522,"xMinYMin"],overrightharpoon:[["rightharpoon"],.888,522,"xMaxYMin"],xrightharpoonup:[["rightharpoon"],.888,522,"xMaxYMin"],xrightharpoondown:[["rightharpoondown"],.888,522,"xMaxYMin"],xlongequal:[["longequal"],.888,334,"xMinYMin"],"\\cdlongequal":[["longequal"],3,334,"xMinYMin"],xtwoheadleftarrow:[["twoheadleftarrow"],.888,334,"xMinYMin"],xtwoheadrightarrow:[["twoheadrightarrow"],.888,334,"xMaxYMin"],overleftrightarrow:[["leftarrow","rightarrow"],.888,522],overbrace:[["leftbrace","midbrace","rightbrace"],1.6,548],underbrace:[["leftbraceunder","midbraceunder","rightbraceunder"],1.6,548],underleftrightarrow:[["leftarrow","rightarrow"],.888,522],xleftrightarrow:[["leftarrow","rightarrow"],1.75,522],xLeftrightarrow:[["doubleleftarrow","doublerightarrow"],1.75,560],xrightleftharpoons:[["leftharpoondownplus","rightharpoonplus"],1.75,716],xleftrightharpoons:[["leftharpoonplus","rightharpoondownplus"],1.75,716],xhookleftarrow:[["leftarrow","righthook"],1.08,522],xhookrightarrow:[["lefthook","rightarrow"],1.08,522],overlinesegment:[["leftlinesegment","rightlinesegment"],.888,522],underlinesegment:[["leftlinesegment","rightlinesegment"],.888,522],overgroup:[["leftgroup","rightgroup"],.888,342],undergroup:[["leftgroupunder","rightgroupunder"],.888,342],xmapsto:[["leftmapsto","rightarrow"],1.5,522],xtofrom:[["leftToFrom","rightToFrom"],1.75,528],xrightleftarrows:[["baraboveleftarrow","rightarrowabovebar"],1.75,901],xrightequilibrium:[["baraboveshortleftharpoon","rightharpoonaboveshortbar"],1.75,716],xleftequilibrium:[["shortbaraboveleftharpoon","shortrightharpoonabovebar"],1.75,716]},Ft=function(e,t,r,n,a){var i,o=e.height+e.depth+r+n;if(/fbox|color|angl/.test(t)){if(i=Ke.makeSpan(["stretchy",t],[],a),"fbox"===t){var s=a.color&&a.getColor();s&&(i.style.borderColor=s)}}else{var l=[];/^[bx]cancel$/.test(t)&&l.push(new Q({x1:"0",y1:"0",x2:"100%",y2:"100%","stroke-width":"0.046em"})),/^x?cancel$/.test(t)&&l.push(new Q({x1:"0",y1:"100%",x2:"100%",y2:"0","stroke-width":"0.046em"}));var h=new K(l,{width:"100%",height:V(o)});i=Ke.makeSvgSpan([],[h],a)}return i.height=o,i.style.height=V(o),i},Vt=function(e){var t=new Tt.MathNode("mo",[new Tt.TextNode(Dt[e.replace(/^\\/,"")])]);return t.setAttribute("stretchy","true"),t},Gt=function(e,t){var r=function(){var r=4e5,n=e.label.substr(1);if(l.contains(["widehat","widecheck","widetilde","utilde"],n)){var a,i,o,s="ordgroup"===(d=e.base).type?d.body.length:1;if(s>5)"widehat"===n||"widecheck"===n?(a=420,r=2364,o=.42,i=n+"4"):(a=312,r=2340,o=.34,i="tilde4");else{var h=[1,1,2,2,3,3][s];"widehat"===n||"widecheck"===n?(r=[0,1062,2364,2364,2364][h],a=[0,239,300,360,420][h],o=[0,.24,.3,.3,.36,.42][h],i=n+h):(r=[0,600,1033,2339,2340][h],a=[0,260,286,306,312][h],o=[0,.26,.286,.3,.306,.34][h],i="tilde"+h)}var m=new J(i),c=new K([m],{width:"100%",height:V(o),viewBox:"0 0 "+r+" "+a,preserveAspectRatio:"none"});return{span:Ke.makeSvgSpan([],[c],t),minWidth:0,height:o}}var u,p,d,f=[],g=Pt[n],v=g[0],b=g[1],y=g[2],x=y/1e3,w=v.length;if(1===w)u=["hide-tail"],p=[g[3]];else if(2===w)u=["halfarrow-left","halfarrow-right"],p=["xMinYMin","xMaxYMin"];else{if(3!==w)throw new Error("Correct katexImagesData or update code here to support\n "+w+" children.");u=["brace-left","brace-center","brace-right"],p=["xMinYMin","xMidYMin","xMaxYMin"]}for(var k=0;k0&&(n.style.minWidth=V(a)),n};function Ut(e,t){if(!e||e.type!==t)throw new Error("Expected node of type "+t+", but got "+(e?"node of type "+e.type:String(e)));return e}function Yt(e){var t=Xt(e);if(!t)throw new Error("Expected node of symbol group type, but got "+(e?"node of type "+e.type:String(e)));return t}function Xt(e){return e&&("atom"===e.type||re.hasOwnProperty(e.type))?e:null}var Wt=function(e,t){var r,n,a;e&&"supsub"===e.type?(r=(n=Ut(e.base,"accent")).base,e.base=r,a=function(e){if(e instanceof W)return e;throw new Error("Expected span but got "+String(e)+".")}(wt(e,t)),e.base=n):r=(n=Ut(e,"accent")).base;var i=wt(r,t.havingCrampedStyle()),o=0;if(n.isShifty&&l.isCharacterBox(r)){var s=l.getBaseElem(r);o=ee(wt(s,t.havingCrampedStyle())).skew}var h,m="\\c"===n.label,c=m?i.height+i.depth:Math.min(i.height,t.fontMetrics().xHeight);if(n.isStretchy)h=Gt(n,t),h=Ke.makeVList({positionType:"firstBaseline",children:[{type:"elem",elem:i},{type:"elem",elem:h,wrapperClasses:["svg-align"],wrapperStyle:o>0?{width:"calc(100% - "+V(2*o)+")",marginLeft:V(2*o)}:void 0}]},t);else{var u,p;"\\vec"===n.label?(u=Ke.staticSvg("vec",t),p=Ke.svgData.vec[1]):((u=ee(u=Ke.makeOrd({mode:n.mode,text:n.label},t,"textord"))).italic=0,p=u.width,m&&(c+=u.depth)),h=Ke.makeSpan(["accent-body"],[u]);var d="\\textcircled"===n.label;d&&(h.classes.push("accent-full"),c=i.height);var f=o;d||(f-=p/2),h.style.left=V(f),"\\textcircled"===n.label&&(h.style.top=".2em"),h=Ke.makeVList({positionType:"firstBaseline",children:[{type:"elem",elem:i},{type:"kern",size:-c},{type:"elem",elem:h}]},t)}var g=Ke.makeSpan(["mord","accent"],[h],t);return a?(a.children[0]=g,a.height=Math.max(g.height,a.height),a.classes[0]="mord",a):g},_t=function(e,t){var r=e.isStretchy?Vt(e.label):new Tt.MathNode("mo",[Bt(e.label,e.mode)]),n=new Tt.MathNode("mover",[Rt(e.base,t),r]);return n.setAttribute("accent","true"),n},jt=new RegExp(["\\acute","\\grave","\\ddot","\\tilde","\\bar","\\breve","\\check","\\hat","\\vec","\\dot","\\mathring"].map((function(e){return"\\"+e})).join("|"));ot({type:"accent",names:["\\acute","\\grave","\\ddot","\\tilde","\\bar","\\breve","\\check","\\hat","\\vec","\\dot","\\mathring","\\widecheck","\\widehat","\\widetilde","\\overrightarrow","\\overleftarrow","\\Overrightarrow","\\overleftrightarrow","\\overgroup","\\overlinesegment","\\overleftharpoon","\\overrightharpoon"],props:{numArgs:1},handler:function(e,t){var r=lt(t[0]),n=!jt.test(e.funcName),a=!n||"\\widehat"===e.funcName||"\\widetilde"===e.funcName||"\\widecheck"===e.funcName;return{type:"accent",mode:e.parser.mode,label:e.funcName,isStretchy:n,isShifty:a,base:r}},htmlBuilder:Wt,mathmlBuilder:_t}),ot({type:"accent",names:["\\'","\\`","\\^","\\~","\\=","\\u","\\.",'\\"',"\\c","\\r","\\H","\\v","\\textcircled"],props:{numArgs:1,allowedInText:!0,allowedInMath:!0,argTypes:["primitive"]},handler:function(e,t){var r=t[0],n=e.parser.mode;return"math"===n&&(e.parser.settings.reportNonstrict("mathVsTextAccents","LaTeX's accent "+e.funcName+" works only in text mode"),n="text"),{type:"accent",mode:n,label:e.funcName,isStretchy:!1,isShifty:!0,base:r}},htmlBuilder:Wt,mathmlBuilder:_t}),ot({type:"accentUnder",names:["\\underleftarrow","\\underrightarrow","\\underleftrightarrow","\\undergroup","\\underlinesegment","\\utilde"],props:{numArgs:1},handler:function(e,t){var r=e.parser,n=e.funcName,a=t[0];return{type:"accentUnder",mode:r.mode,label:n,base:a}},htmlBuilder:function(e,t){var r=wt(e.base,t),n=Gt(e,t),a="\\utilde"===e.label?.12:0,i=Ke.makeVList({positionType:"top",positionData:r.height,children:[{type:"elem",elem:n,wrapperClasses:["svg-align"]},{type:"kern",size:a},{type:"elem",elem:r}]},t);return Ke.makeSpan(["mord","accentunder"],[i],t)},mathmlBuilder:function(e,t){var r=Vt(e.label),n=new Tt.MathNode("munder",[Rt(e.base,t),r]);return n.setAttribute("accentunder","true"),n}});var $t=function(e){var t=new Tt.MathNode("mpadded",e?[e]:[]);return t.setAttribute("width","+0.6em"),t.setAttribute("lspace","0.3em"),t};ot({type:"xArrow",names:["\\xleftarrow","\\xrightarrow","\\xLeftarrow","\\xRightarrow","\\xleftrightarrow","\\xLeftrightarrow","\\xhookleftarrow","\\xhookrightarrow","\\xmapsto","\\xrightharpoondown","\\xrightharpoonup","\\xleftharpoondown","\\xleftharpoonup","\\xrightleftharpoons","\\xleftrightharpoons","\\xlongequal","\\xtwoheadrightarrow","\\xtwoheadleftarrow","\\xtofrom","\\xrightleftarrows","\\xrightequilibrium","\\xleftequilibrium","\\\\cdrightarrow","\\\\cdleftarrow","\\\\cdlongequal"],props:{numArgs:1,numOptionalArgs:1},handler:function(e,t,r){var n=e.parser,a=e.funcName;return{type:"xArrow",mode:n.mode,label:a,body:t[0],below:r[0]}},htmlBuilder:function(e,t){var r,n=t.style,a=t.havingStyle(n.sup()),i=Ke.wrapFragment(wt(e.body,a,t),t),o="\\x"===e.label.slice(0,2)?"x":"cd";i.classes.push(o+"-arrow-pad"),e.below&&(a=t.havingStyle(n.sub()),(r=Ke.wrapFragment(wt(e.below,a,t),t)).classes.push(o+"-arrow-pad"));var s,l=Gt(e,t),h=-t.fontMetrics().axisHeight+.5*l.height,m=-t.fontMetrics().axisHeight-.5*l.height-.111;if((i.depth>.25||"\\xleftequilibrium"===e.label)&&(m-=i.depth),r){var c=-t.fontMetrics().axisHeight+r.height+.5*l.height+.111;s=Ke.makeVList({positionType:"individualShift",children:[{type:"elem",elem:i,shift:m},{type:"elem",elem:l,shift:h},{type:"elem",elem:r,shift:c}]},t)}else s=Ke.makeVList({positionType:"individualShift",children:[{type:"elem",elem:i,shift:m},{type:"elem",elem:l,shift:h}]},t);return s.children[0].children[0].children[1].classes.push("svg-align"),Ke.makeSpan(["mrel","x-arrow"],[s],t)},mathmlBuilder:function(e,t){var r,n=Vt(e.label);if(n.setAttribute("minsize","x"===e.label.charAt(0)?"1.75em":"3.0em"),e.body){var a=$t(Rt(e.body,t));if(e.below){var i=$t(Rt(e.below,t));r=new Tt.MathNode("munderover",[n,i,a])}else r=new Tt.MathNode("mover",[n,a])}else if(e.below){var o=$t(Rt(e.below,t));r=new Tt.MathNode("munder",[n,o])}else r=$t(),r=new Tt.MathNode("mover",[n,r]);return r}});var Zt={">":"\\\\cdrightarrow","<":"\\\\cdleftarrow","=":"\\\\cdlongequal",A:"\\uparrow",V:"\\downarrow","|":"\\Vert",".":"no arrow"},Kt=function(e){return"textord"===e.type&&"@"===e.text};function Jt(e,t,r){var n=Zt[e];switch(n){case"\\\\cdrightarrow":case"\\\\cdleftarrow":return r.callFunction(n,[t[0]],[t[1]]);case"\\uparrow":case"\\downarrow":var a={type:"atom",text:n,mode:"math",family:"rel"},i={type:"ordgroup",mode:"math",body:[r.callFunction("\\\\cdleft",[t[0]],[]),r.callFunction("\\Big",[a],[]),r.callFunction("\\\\cdright",[t[1]],[])]};return r.callFunction("\\\\cdparent",[i],[]);case"\\\\cdlongequal":return r.callFunction("\\\\cdlongequal",[],[]);case"\\Vert":return r.callFunction("\\Big",[{type:"textord",text:"\\Vert",mode:"math"}],[]);default:return{type:"textord",text:" ",mode:"math"}}}ot({type:"cdlabel",names:["\\\\cdleft","\\\\cdright"],props:{numArgs:1},handler:function(e,t){var r=e.parser,n=e.funcName;return{type:"cdlabel",mode:r.mode,side:n.slice(4),label:t[0]}},htmlBuilder:function(e,t){var r=t.havingStyle(t.style.sup()),n=Ke.wrapFragment(wt(e.label,r,t),t);return n.classes.push("cd-label-"+e.side),n.style.bottom=V(.8-n.depth),n.height=0,n.depth=0,n},mathmlBuilder:function(e,t){var r=new Tt.MathNode("mrow",[Rt(e.label,t)]);return(r=new Tt.MathNode("mpadded",[r])).setAttribute("width","0"),"left"===e.side&&r.setAttribute("lspace","-1width"),r.setAttribute("voffset","0.7em"),(r=new Tt.MathNode("mstyle",[r])).setAttribute("displaystyle","false"),r.setAttribute("scriptlevel","1"),r}}),ot({type:"cdlabelparent",names:["\\\\cdparent"],props:{numArgs:1},handler:function(e,t){return{type:"cdlabelparent",mode:e.parser.mode,fragment:t[0]}},htmlBuilder:function(e,t){var r=Ke.wrapFragment(wt(e.fragment,t),t);return r.classes.push("cd-vert-arrow"),r},mathmlBuilder:function(e,t){return new Tt.MathNode("mrow",[Rt(e.fragment,t)])}}),ot({type:"textord",names:["\\@char"],props:{numArgs:1,allowedInText:!0},handler:function(e,t){for(var r=e.parser,a=Ut(t[0],"ordgroup").body,i="",o=0;o=1114111)throw new n("\\@char with invalid code point "+i);return l<=65535?s=String.fromCharCode(l):(l-=65536,s=String.fromCharCode(55296+(l>>10),56320+(1023&l))),{type:"textord",mode:r.mode,text:s}}});var Qt=function(e,t){var r=ft(e.body,t.withColor(e.color),!1);return Ke.makeFragment(r)},er=function(e,t){var r=Nt(e.body,t.withColor(e.color)),n=new Tt.MathNode("mstyle",r);return n.setAttribute("mathcolor",e.color),n};ot({type:"color",names:["\\textcolor"],props:{numArgs:2,allowedInText:!0,argTypes:["color","original"]},handler:function(e,t){var r=e.parser,n=Ut(t[0],"color-token").color,a=t[1];return{type:"color",mode:r.mode,color:n,body:ht(a)}},htmlBuilder:Qt,mathmlBuilder:er}),ot({type:"color",names:["\\color"],props:{numArgs:1,allowedInText:!0,argTypes:["color"]},handler:function(e,t){var r=e.parser,n=e.breakOnTokenText,a=Ut(t[0],"color-token").color;r.gullet.macros.set("\\current@color",a);var i=r.parseExpression(!0,n);return{type:"color",mode:r.mode,color:a,body:i}},htmlBuilder:Qt,mathmlBuilder:er}),ot({type:"cr",names:["\\\\"],props:{numArgs:0,numOptionalArgs:1,argTypes:["size"],allowedInText:!0},handler:function(e,t,r){var n=e.parser,a=r[0],i=!n.settings.displayMode||!n.settings.useStrictBehavior("newLineInDisplayMode","In LaTeX, \\\\ or \\newline does nothing in display mode");return{type:"cr",mode:n.mode,newLine:i,size:a&&Ut(a,"size").value}},htmlBuilder:function(e,t){var r=Ke.makeSpan(["mspace"],[],t);return e.newLine&&(r.classes.push("newline"),e.size&&(r.style.marginTop=V(F(e.size,t)))),r},mathmlBuilder:function(e,t){var r=new Tt.MathNode("mspace");return e.newLine&&(r.setAttribute("linebreak","newline"),e.size&&r.setAttribute("height",V(F(e.size,t)))),r}});var tr={"\\global":"\\global","\\long":"\\\\globallong","\\\\globallong":"\\\\globallong","\\def":"\\gdef","\\gdef":"\\gdef","\\edef":"\\xdef","\\xdef":"\\xdef","\\let":"\\\\globallet","\\futurelet":"\\\\globalfuture"},rr=function(e){var t=e.text;if(/^(?:[\\{}$&#^_]|EOF)$/.test(t))throw new n("Expected a control sequence",e);return t},nr=function(e,t,r,n){var a=e.gullet.macros.get(r.text);null==a&&(r.noexpand=!0,a={tokens:[r],numArgs:0,unexpandable:!e.gullet.isExpandable(r.text)}),e.gullet.macros.set(t,a,n)};ot({type:"internal",names:["\\global","\\long","\\\\globallong"],props:{numArgs:0,allowedInText:!0},handler:function(e){var t=e.parser,r=e.funcName;t.consumeSpaces();var a=t.fetch();if(tr[a.text])return"\\global"!==r&&"\\\\globallong"!==r||(a.text=tr[a.text]),Ut(t.parseFunction(),"internal");throw new n("Invalid token after macro prefix",a)}}),ot({type:"internal",names:["\\def","\\gdef","\\edef","\\xdef"],props:{numArgs:0,allowedInText:!0,primitive:!0},handler:function(e){var t=e.parser,r=e.funcName,a=t.gullet.popToken(),i=a.text;if(/^(?:[\\{}$&#^_]|EOF)$/.test(i))throw new n("Expected a control sequence",a);for(var o,s=0,l=[[]];"{"!==t.gullet.future().text;)if("#"===(a=t.gullet.popToken()).text){if("{"===t.gullet.future().text){o=t.gullet.future(),l[s].push("{");break}if(a=t.gullet.popToken(),!/^[1-9]$/.test(a.text))throw new n('Invalid argument number "'+a.text+'"');if(parseInt(a.text)!==s+1)throw new n('Argument number "'+a.text+'" out of order');s++,l.push([])}else{if("EOF"===a.text)throw new n("Expected a macro definition");l[s].push(a.text)}var h=t.gullet.consumeArg().tokens;return o&&h.unshift(o),"\\edef"!==r&&"\\xdef"!==r||(h=t.gullet.expandTokens(h)).reverse(),t.gullet.macros.set(i,{tokens:h,numArgs:s,delimiters:l},r===tr[r]),{type:"internal",mode:t.mode}}}),ot({type:"internal",names:["\\let","\\\\globallet"],props:{numArgs:0,allowedInText:!0,primitive:!0},handler:function(e){var t=e.parser,r=e.funcName,n=rr(t.gullet.popToken());t.gullet.consumeSpaces();var a=function(e){var t=e.gullet.popToken();return"="===t.text&&" "===(t=e.gullet.popToken()).text&&(t=e.gullet.popToken()),t}(t);return nr(t,n,a,"\\\\globallet"===r),{type:"internal",mode:t.mode}}}),ot({type:"internal",names:["\\futurelet","\\\\globalfuture"],props:{numArgs:0,allowedInText:!0,primitive:!0},handler:function(e){var t=e.parser,r=e.funcName,n=rr(t.gullet.popToken()),a=t.gullet.popToken(),i=t.gullet.popToken();return nr(t,n,i,"\\\\globalfuture"===r),t.gullet.pushToken(i),t.gullet.pushToken(a),{type:"internal",mode:t.mode}}});var ar=function(e,t,r){var n=q(ae.math[e]&&ae.math[e].replace||e,t,r);if(!n)throw new Error("Unsupported symbol "+e+" and font size "+t+".");return n},ir=function(e,t,r,n){var a=r.havingBaseStyle(t),i=Ke.makeSpan(n.concat(a.sizingClasses(r)),[e],r),o=a.sizeMultiplier/r.sizeMultiplier;return i.height*=o,i.depth*=o,i.maxFontSize=a.sizeMultiplier,i},or=function(e,t,r){var n=t.havingBaseStyle(r),a=(1-t.sizeMultiplier/n.sizeMultiplier)*t.fontMetrics().axisHeight;e.classes.push("delimcenter"),e.style.top=V(a),e.height-=a,e.depth+=a},sr=function(e,t,r,n,a,i){var o=function(e,t,r,n){return Ke.makeSymbol(e,"Size"+t+"-Regular",r,n)}(e,t,a,n),s=ir(Ke.makeSpan(["delimsizing","size"+t],[o],n),x.TEXT,n,i);return r&&or(s,n,x.TEXT),s},lr=function(e,t,r){var n;return n="Size1-Regular"===t?"delim-size1":"delim-size4",{type:"elem",elem:Ke.makeSpan(["delimsizinginner",n],[Ke.makeSpan([],[Ke.makeSymbol(e,t,r)])])}},hr=function(e,t,r){var n=T["Size4-Regular"][e.charCodeAt(0)]?T["Size4-Regular"][e.charCodeAt(0)][4]:T["Size1-Regular"][e.charCodeAt(0)][4],a=new J("inner",function(e,t){switch(e){case"\u239c":return"M291 0 H417 V"+t+" H291z M291 0 H417 V"+t+" H291z";case"\u2223":return"M145 0 H188 V"+t+" H145z M145 0 H188 V"+t+" H145z";case"\u2225":return"M145 0 H188 V"+t+" H145z M145 0 H188 V"+t+" H145zM367 0 H410 V"+t+" H367z M367 0 H410 V"+t+" H367z";case"\u239f":return"M457 0 H583 V"+t+" H457z M457 0 H583 V"+t+" H457z";case"\u23a2":return"M319 0 H403 V"+t+" H319z M319 0 H403 V"+t+" H319z";case"\u23a5":return"M263 0 H347 V"+t+" H263z M263 0 H347 V"+t+" H263z";case"\u23aa":return"M384 0 H504 V"+t+" H384z M384 0 H504 V"+t+" H384z";case"\u23d0":return"M312 0 H355 V"+t+" H312z M312 0 H355 V"+t+" H312z";case"\u2016":return"M257 0 H300 V"+t+" H257z M257 0 H300 V"+t+" H257zM478 0 H521 V"+t+" H478z M478 0 H521 V"+t+" H478z";default:return""}}(e,Math.round(1e3*t))),i=new K([a],{width:V(n),height:V(t),style:"width:"+V(n),viewBox:"0 0 "+1e3*n+" "+Math.round(1e3*t),preserveAspectRatio:"xMinYMin"}),o=Ke.makeSvgSpan([],[i],r);return o.height=t,o.style.height=V(t),o.style.width=V(n),{type:"elem",elem:o}},mr={type:"kern",size:-.008},cr=["|","\\lvert","\\rvert","\\vert"],ur=["\\|","\\lVert","\\rVert","\\Vert"],pr=function(e,t,r,n,a,i){var o,s,h,m;o=h=m=e,s=null;var c="Size1-Regular";"\\uparrow"===e?h=m="\u23d0":"\\Uparrow"===e?h=m="\u2016":"\\downarrow"===e?o=h="\u23d0":"\\Downarrow"===e?o=h="\u2016":"\\updownarrow"===e?(o="\\uparrow",h="\u23d0",m="\\downarrow"):"\\Updownarrow"===e?(o="\\Uparrow",h="\u2016",m="\\Downarrow"):l.contains(cr,e)?h="\u2223":l.contains(ur,e)?h="\u2225":"["===e||"\\lbrack"===e?(o="\u23a1",h="\u23a2",m="\u23a3",c="Size4-Regular"):"]"===e||"\\rbrack"===e?(o="\u23a4",h="\u23a5",m="\u23a6",c="Size4-Regular"):"\\lfloor"===e||"\u230a"===e?(h=o="\u23a2",m="\u23a3",c="Size4-Regular"):"\\lceil"===e||"\u2308"===e?(o="\u23a1",h=m="\u23a2",c="Size4-Regular"):"\\rfloor"===e||"\u230b"===e?(h=o="\u23a5",m="\u23a6",c="Size4-Regular"):"\\rceil"===e||"\u2309"===e?(o="\u23a4",h=m="\u23a5",c="Size4-Regular"):"("===e||"\\lparen"===e?(o="\u239b",h="\u239c",m="\u239d",c="Size4-Regular"):")"===e||"\\rparen"===e?(o="\u239e",h="\u239f",m="\u23a0",c="Size4-Regular"):"\\{"===e||"\\lbrace"===e?(o="\u23a7",s="\u23a8",m="\u23a9",h="\u23aa",c="Size4-Regular"):"\\}"===e||"\\rbrace"===e?(o="\u23ab",s="\u23ac",m="\u23ad",h="\u23aa",c="Size4-Regular"):"\\lgroup"===e||"\u27ee"===e?(o="\u23a7",m="\u23a9",h="\u23aa",c="Size4-Regular"):"\\rgroup"===e||"\u27ef"===e?(o="\u23ab",m="\u23ad",h="\u23aa",c="Size4-Regular"):"\\lmoustache"===e||"\u23b0"===e?(o="\u23a7",m="\u23ad",h="\u23aa",c="Size4-Regular"):"\\rmoustache"!==e&&"\u23b1"!==e||(o="\u23ab",m="\u23a9",h="\u23aa",c="Size4-Regular");var u=ar(o,c,a),p=u.height+u.depth,d=ar(h,c,a),f=d.height+d.depth,g=ar(m,c,a),v=g.height+g.depth,b=0,y=1;if(null!==s){var w=ar(s,c,a);b=w.height+w.depth,y=2}var k=p+v+b,S=k+Math.max(0,Math.ceil((t-k)/(y*f)))*y*f,M=n.fontMetrics().axisHeight;r&&(M*=n.sizeMultiplier);var z=S/2-M,A=[];if(A.push(lr(m,c,a)),A.push(mr),null===s){var T=S-p-v+.016;A.push(hr(h,T,n))}else{var B=(S-p-v-b)/2+.016;A.push(hr(h,B,n)),A.push(mr),A.push(lr(s,c,a)),A.push(mr),A.push(hr(h,B,n))}A.push(mr),A.push(lr(o,c,a));var C=n.havingBaseStyle(x.TEXT),q=Ke.makeVList({positionType:"bottom",positionData:z,children:A},C);return ir(Ke.makeSpan(["delimsizing","mult"],[q],C),x.TEXT,n,i)},dr=.08,fr=function(e,t,r,n,a){var i=function(e,t,r){t*=1e3;var n="";switch(e){case"sqrtMain":n=function(e,t){return"M95,"+(622+e+t)+"\nc-2.7,0,-7.17,-2.7,-13.5,-8c-5.8,-5.3,-9.5,-10,-9.5,-14\nc0,-2,0.3,-3.3,1,-4c1.3,-2.7,23.83,-20.7,67.5,-54\nc44.2,-33.3,65.8,-50.3,66.5,-51c1.3,-1.3,3,-2,5,-2c4.7,0,8.7,3.3,12,10\ns173,378,173,378c0.7,0,35.3,-71,104,-213c68.7,-142,137.5,-285,206.5,-429\nc69,-144,104.5,-217.7,106.5,-221\nl"+e/2.075+" -"+e+"\nc5.3,-9.3,12,-14,20,-14\nH400000v"+(40+e)+"H845.2724\ns-225.272,467,-225.272,467s-235,486,-235,486c-2.7,4.7,-9,7,-19,7\nc-6,0,-10,-1,-12,-3s-194,-422,-194,-422s-65,47,-65,47z\nM"+(834+e)+" "+t+"h400000v"+(40+e)+"h-400000z"}(t,M);break;case"sqrtSize1":n=function(e,t){return"M263,"+(601+e+t)+"c0.7,0,18,39.7,52,119\nc34,79.3,68.167,158.7,102.5,238c34.3,79.3,51.8,119.3,52.5,120\nc340,-704.7,510.7,-1060.3,512,-1067\nl"+e/2.084+" -"+e+"\nc4.7,-7.3,11,-11,19,-11\nH40000v"+(40+e)+"H1012.3\ns-271.3,567,-271.3,567c-38.7,80.7,-84,175,-136,283c-52,108,-89.167,185.3,-111.5,232\nc-22.3,46.7,-33.8,70.3,-34.5,71c-4.7,4.7,-12.3,7,-23,7s-12,-1,-12,-1\ns-109,-253,-109,-253c-72.7,-168,-109.3,-252,-110,-252c-10.7,8,-22,16.7,-34,26\nc-22,17.3,-33.3,26,-34,26s-26,-26,-26,-26s76,-59,76,-59s76,-60,76,-60z\nM"+(1001+e)+" "+t+"h400000v"+(40+e)+"h-400000z"}(t,M);break;case"sqrtSize2":n=function(e,t){return"M983 "+(10+e+t)+"\nl"+e/3.13+" -"+e+"\nc4,-6.7,10,-10,18,-10 H400000v"+(40+e)+"\nH1013.1s-83.4,268,-264.1,840c-180.7,572,-277,876.3,-289,913c-4.7,4.7,-12.7,7,-24,7\ns-12,0,-12,0c-1.3,-3.3,-3.7,-11.7,-7,-25c-35.3,-125.3,-106.7,-373.3,-214,-744\nc-10,12,-21,25,-33,39s-32,39,-32,39c-6,-5.3,-15,-14,-27,-26s25,-30,25,-30\nc26.7,-32.7,52,-63,76,-91s52,-60,52,-60s208,722,208,722\nc56,-175.3,126.3,-397.3,211,-666c84.7,-268.7,153.8,-488.2,207.5,-658.5\nc53.7,-170.3,84.5,-266.8,92.5,-289.5z\nM"+(1001+e)+" "+t+"h400000v"+(40+e)+"h-400000z"}(t,M);break;case"sqrtSize3":n=function(e,t){return"M424,"+(2398+e+t)+"\nc-1.3,-0.7,-38.5,-172,-111.5,-514c-73,-342,-109.8,-513.3,-110.5,-514\nc0,-2,-10.7,14.3,-32,49c-4.7,7.3,-9.8,15.7,-15.5,25c-5.7,9.3,-9.8,16,-12.5,20\ns-5,7,-5,7c-4,-3.3,-8.3,-7.7,-13,-13s-13,-13,-13,-13s76,-122,76,-122s77,-121,77,-121\ns209,968,209,968c0,-2,84.7,-361.7,254,-1079c169.3,-717.3,254.7,-1077.7,256,-1081\nl"+e/4.223+" -"+e+"c4,-6.7,10,-10,18,-10 H400000\nv"+(40+e)+"H1014.6\ns-87.3,378.7,-272.6,1166c-185.3,787.3,-279.3,1182.3,-282,1185\nc-2,6,-10,9,-24,9\nc-8,0,-12,-0.7,-12,-2z M"+(1001+e)+" "+t+"\nh400000v"+(40+e)+"h-400000z"}(t,M);break;case"sqrtSize4":n=function(e,t){return"M473,"+(2713+e+t)+"\nc339.3,-1799.3,509.3,-2700,510,-2702 l"+e/5.298+" -"+e+"\nc3.3,-7.3,9.3,-11,18,-11 H400000v"+(40+e)+"H1017.7\ns-90.5,478,-276.2,1466c-185.7,988,-279.5,1483,-281.5,1485c-2,6,-10,9,-24,9\nc-8,0,-12,-0.7,-12,-2c0,-1.3,-5.3,-32,-16,-92c-50.7,-293.3,-119.7,-693.3,-207,-1200\nc0,-1.3,-5.3,8.7,-16,30c-10.7,21.3,-21.3,42.7,-32,64s-16,33,-16,33s-26,-26,-26,-26\ns76,-153,76,-153s77,-151,77,-151c0.7,0.7,35.7,202,105,604c67.3,400.7,102,602.7,104,\n606zM"+(1001+e)+" "+t+"h400000v"+(40+e)+"H1017.7z"}(t,M);break;case"sqrtTall":n=function(e,t,r){return"M702 "+(e+t)+"H400000"+(40+e)+"\nH742v"+(r-54-t-e)+"l-4 4-4 4c-.667.7 -2 1.5-4 2.5s-4.167 1.833-6.5 2.5-5.5 1-9.5 1\nh-12l-28-84c-16.667-52-96.667 -294.333-240-727l-212 -643 -85 170\nc-4-3.333-8.333-7.667-13 -13l-13-13l77-155 77-156c66 199.333 139 419.667\n219 661 l218 661zM702 "+t+"H400000v"+(40+e)+"H742z"}(t,M,r)}return n}(e,n,r),o=new J(e,i),s=new K([o],{width:"400em",height:V(t),viewBox:"0 0 400000 "+r,preserveAspectRatio:"xMinYMin slice"});return Ke.makeSvgSpan(["hide-tail"],[s],a)},gr=["(","\\lparen",")","\\rparen","[","\\lbrack","]","\\rbrack","\\{","\\lbrace","\\}","\\rbrace","\\lfloor","\\rfloor","\u230a","\u230b","\\lceil","\\rceil","\u2308","\u2309","\\surd"],vr=["\\uparrow","\\downarrow","\\updownarrow","\\Uparrow","\\Downarrow","\\Updownarrow","|","\\|","\\vert","\\Vert","\\lvert","\\rvert","\\lVert","\\rVert","\\lgroup","\\rgroup","\u27ee","\u27ef","\\lmoustache","\\rmoustache","\u23b0","\u23b1"],br=["<",">","\\langle","\\rangle","/","\\backslash","\\lt","\\gt"],yr=[0,1.2,1.8,2.4,3],xr=[{type:"small",style:x.SCRIPTSCRIPT},{type:"small",style:x.SCRIPT},{type:"small",style:x.TEXT},{type:"large",size:1},{type:"large",size:2},{type:"large",size:3},{type:"large",size:4}],wr=[{type:"small",style:x.SCRIPTSCRIPT},{type:"small",style:x.SCRIPT},{type:"small",style:x.TEXT},{type:"stack"}],kr=[{type:"small",style:x.SCRIPTSCRIPT},{type:"small",style:x.SCRIPT},{type:"small",style:x.TEXT},{type:"large",size:1},{type:"large",size:2},{type:"large",size:3},{type:"large",size:4},{type:"stack"}],Sr=function(e){if("small"===e.type)return"Main-Regular";if("large"===e.type)return"Size"+e.size+"-Regular";if("stack"===e.type)return"Size4-Regular";throw new Error("Add support for delim type '"+e.type+"' here.")},Mr=function(e,t,r,n){for(var a=Math.min(2,3-n.style.size);at)return r[a]}return r[r.length-1]},zr=function(e,t,r,n,a,i){var o;"<"===e||"\\lt"===e||"\u27e8"===e?e="\\langle":">"!==e&&"\\gt"!==e&&"\u27e9"!==e||(e="\\rangle"),o=l.contains(br,e)?xr:l.contains(gr,e)?kr:wr;var s=Mr(e,t,o,n);return"small"===s.type?function(e,t,r,n,a,i){var o=Ke.makeSymbol(e,"Main-Regular",a,n),s=ir(o,t,n,i);return r&&or(s,n,t),s}(e,s.style,r,n,a,i):"large"===s.type?sr(e,s.size,r,n,a,i):pr(e,t,r,n,a,i)},Ar={sqrtImage:function(e,t){var r,n,a=t.havingBaseSizing(),i=Mr("\\surd",e*a.sizeMultiplier,kr,a),o=a.sizeMultiplier,s=Math.max(0,t.minRuleThickness-t.fontMetrics().sqrtRuleThickness),l=0,h=0,m=0;return"small"===i.type?(e<1?o=1:e<1.4&&(o=.7),h=(1+s)/o,(r=fr("sqrtMain",l=(1+s+dr)/o,m=1e3+1e3*s+80,s,t)).style.minWidth="0.853em",n=.833/o):"large"===i.type?(m=1080*yr[i.size],h=(yr[i.size]+s)/o,l=(yr[i.size]+s+dr)/o,(r=fr("sqrtSize"+i.size,l,m,s,t)).style.minWidth="1.02em",n=1/o):(l=e+s+dr,h=e+s,m=Math.floor(1e3*e+s)+80,(r=fr("sqrtTall",l,m,s,t)).style.minWidth="0.742em",n=1.056),r.height=h,r.style.height=V(l),{span:r,advanceWidth:n,ruleWidth:(t.fontMetrics().sqrtRuleThickness+s)*o}},sizedDelim:function(e,t,r,a,i){if("<"===e||"\\lt"===e||"\u27e8"===e?e="\\langle":">"!==e&&"\\gt"!==e&&"\u27e9"!==e||(e="\\rangle"),l.contains(gr,e)||l.contains(br,e))return sr(e,t,!1,r,a,i);if(l.contains(vr,e))return pr(e,yr[t],!1,r,a,i);throw new n("Illegal delimiter: '"+e+"'")},sizeToMaxHeight:yr,customSizedDelim:zr,leftRightDelim:function(e,t,r,n,a,i){var o=n.fontMetrics().axisHeight*n.sizeMultiplier,s=5/n.fontMetrics().ptPerEm,l=Math.max(t-o,r+o),h=Math.max(l/500*901,2*l-s);return zr(e,h,!0,n,a,i)}},Tr={"\\bigl":{mclass:"mopen",size:1},"\\Bigl":{mclass:"mopen",size:2},"\\biggl":{mclass:"mopen",size:3},"\\Biggl":{mclass:"mopen",size:4},"\\bigr":{mclass:"mclose",size:1},"\\Bigr":{mclass:"mclose",size:2},"\\biggr":{mclass:"mclose",size:3},"\\Biggr":{mclass:"mclose",size:4},"\\bigm":{mclass:"mrel",size:1},"\\Bigm":{mclass:"mrel",size:2},"\\biggm":{mclass:"mrel",size:3},"\\Biggm":{mclass:"mrel",size:4},"\\big":{mclass:"mord",size:1},"\\Big":{mclass:"mord",size:2},"\\bigg":{mclass:"mord",size:3},"\\Bigg":{mclass:"mord",size:4}},Br=["(","\\lparen",")","\\rparen","[","\\lbrack","]","\\rbrack","\\{","\\lbrace","\\}","\\rbrace","\\lfloor","\\rfloor","\u230a","\u230b","\\lceil","\\rceil","\u2308","\u2309","<",">","\\langle","\u27e8","\\rangle","\u27e9","\\lt","\\gt","\\lvert","\\rvert","\\lVert","\\rVert","\\lgroup","\\rgroup","\u27ee","\u27ef","\\lmoustache","\\rmoustache","\u23b0","\u23b1","/","\\backslash","|","\\vert","\\|","\\Vert","\\uparrow","\\Uparrow","\\downarrow","\\Downarrow","\\updownarrow","\\Updownarrow","."];function Cr(e,t){var r=Xt(e);if(r&&l.contains(Br,r.text))return r;throw new n(r?"Invalid delimiter '"+r.text+"' after '"+t.funcName+"'":"Invalid delimiter type '"+e.type+"'",e)}function qr(e){if(!e.body)throw new Error("Bug: The leftright ParseNode wasn't fully parsed.")}ot({type:"delimsizing",names:["\\bigl","\\Bigl","\\biggl","\\Biggl","\\bigr","\\Bigr","\\biggr","\\Biggr","\\bigm","\\Bigm","\\biggm","\\Biggm","\\big","\\Big","\\bigg","\\Bigg"],props:{numArgs:1,argTypes:["primitive"]},handler:function(e,t){var r=Cr(t[0],e);return{type:"delimsizing",mode:e.parser.mode,size:Tr[e.funcName].size,mclass:Tr[e.funcName].mclass,delim:r.text}},htmlBuilder:function(e,t){return"."===e.delim?Ke.makeSpan([e.mclass]):Ar.sizedDelim(e.delim,e.size,t,e.mode,[e.mclass])},mathmlBuilder:function(e){var t=[];"."!==e.delim&&t.push(Bt(e.delim,e.mode));var r=new Tt.MathNode("mo",t);"mopen"===e.mclass||"mclose"===e.mclass?r.setAttribute("fence","true"):r.setAttribute("fence","false"),r.setAttribute("stretchy","true");var n=V(Ar.sizeToMaxHeight[e.size]);return r.setAttribute("minsize",n),r.setAttribute("maxsize",n),r}}),ot({type:"leftright-right",names:["\\right"],props:{numArgs:1,primitive:!0},handler:function(e,t){var r=e.parser.gullet.macros.get("\\current@color");if(r&&"string"!=typeof r)throw new n("\\current@color set to non-string in \\right");return{type:"leftright-right",mode:e.parser.mode,delim:Cr(t[0],e).text,color:r}}}),ot({type:"leftright",names:["\\left"],props:{numArgs:1,primitive:!0},handler:function(e,t){var r=Cr(t[0],e),n=e.parser;++n.leftrightDepth;var a=n.parseExpression(!1);--n.leftrightDepth,n.expect("\\right",!1);var i=Ut(n.parseFunction(),"leftright-right");return{type:"leftright",mode:n.mode,body:a,left:r.text,right:i.delim,rightColor:i.color}},htmlBuilder:function(e,t){qr(e);for(var r,n,a=ft(e.body,t,!0,["mopen","mclose"]),i=0,o=0,s=!1,l=0;l-1?"mpadded":"menclose",[Rt(e.body,t)]);switch(e.label){case"\\cancel":n.setAttribute("notation","updiagonalstrike");break;case"\\bcancel":n.setAttribute("notation","downdiagonalstrike");break;case"\\phase":n.setAttribute("notation","phasorangle");break;case"\\sout":n.setAttribute("notation","horizontalstrike");break;case"\\fbox":n.setAttribute("notation","box");break;case"\\angl":n.setAttribute("notation","actuarial");break;case"\\fcolorbox":case"\\colorbox":if(r=t.fontMetrics().fboxsep*t.fontMetrics().ptPerEm,n.setAttribute("width","+"+2*r+"pt"),n.setAttribute("height","+"+2*r+"pt"),n.setAttribute("lspace",r+"pt"),n.setAttribute("voffset",r+"pt"),"\\fcolorbox"===e.label){var a=Math.max(t.fontMetrics().fboxrule,t.minRuleThickness);n.setAttribute("style","border: "+a+"em solid "+String(e.borderColor))}break;case"\\xcancel":n.setAttribute("notation","updiagonalstrike downdiagonalstrike")}return e.backgroundColor&&n.setAttribute("mathbackground",e.backgroundColor),n};ot({type:"enclose",names:["\\colorbox"],props:{numArgs:2,allowedInText:!0,argTypes:["color","text"]},handler:function(e,t,r){var n=e.parser,a=e.funcName,i=Ut(t[0],"color-token").color,o=t[1];return{type:"enclose",mode:n.mode,label:a,backgroundColor:i,body:o}},htmlBuilder:Nr,mathmlBuilder:Ir}),ot({type:"enclose",names:["\\fcolorbox"],props:{numArgs:3,allowedInText:!0,argTypes:["color","color","text"]},handler:function(e,t,r){var n=e.parser,a=e.funcName,i=Ut(t[0],"color-token").color,o=Ut(t[1],"color-token").color,s=t[2];return{type:"enclose",mode:n.mode,label:a,backgroundColor:o,borderColor:i,body:s}},htmlBuilder:Nr,mathmlBuilder:Ir}),ot({type:"enclose",names:["\\fbox"],props:{numArgs:1,argTypes:["hbox"],allowedInText:!0},handler:function(e,t){return{type:"enclose",mode:e.parser.mode,label:"\\fbox",body:t[0]}}}),ot({type:"enclose",names:["\\cancel","\\bcancel","\\xcancel","\\sout","\\phase"],props:{numArgs:1},handler:function(e,t){var r=e.parser,n=e.funcName,a=t[0];return{type:"enclose",mode:r.mode,label:n,body:a}},htmlBuilder:Nr,mathmlBuilder:Ir}),ot({type:"enclose",names:["\\angl"],props:{numArgs:1,argTypes:["hbox"],allowedInText:!1},handler:function(e,t){return{type:"enclose",mode:e.parser.mode,label:"\\angl",body:t[0]}}});var Rr={};function Or(e){for(var t=e.type,r=e.names,n=e.props,a=e.handler,i=e.htmlBuilder,o=e.mathmlBuilder,s={type:t,numArgs:n.numArgs||0,allowedInText:!1,numOptionalArgs:0,handler:a},l=0;l1||!c)&&g.pop(),b.length0&&(y+=.25),m.push({pos:y,isDashed:e[t]})}for(w(o[0]),r=0;r0&&(M<(B+=b)&&(M=B),B=0),e.addJot&&(M+=f),z.height=S,z.depth=M,y+=S,z.pos=y,y+=M+B,h[r]=z,w(o[r+1])}var C,q,N=y/2+t.fontMetrics().axisHeight,I=e.cols||[],R=[],O=[];if(e.tags&&e.tags.some((function(e){return e})))for(r=0;r=s)){var W=void 0;(a>0||e.hskipBeforeAndAfter)&&0!==(W=l.deflt(P.pregap,p))&&((C=Ke.makeSpan(["arraycolsep"],[])).style.width=V(W),R.push(C));var _=[];for(r=0;r0){for(var K=Ke.makeLineSpan("hline",t,c),J=Ke.makeLineSpan("hdashline",t,c),Q=[{type:"elem",elem:h,shift:0}];m.length>0;){var ee=m.pop(),te=ee.pos-N;ee.isDashed?Q.push({type:"elem",elem:J,shift:te}):Q.push({type:"elem",elem:K,shift:te})}h=Ke.makeVList({positionType:"individualShift",children:Q},t)}if(0===O.length)return Ke.makeSpan(["mord"],[h],t);var re=Ke.makeVList({positionType:"individualShift",children:O},t);return re=Ke.makeSpan(["tag"],[re],t),Ke.makeFragment([h,re])},Xr={c:"center ",l:"left ",r:"right "},Wr=function(e,t){for(var r=[],n=new Tt.MathNode("mtd",[],["mtr-glue"]),a=new Tt.MathNode("mtd",[],["mml-eqn-num"]),i=0;i0){var p=e.cols,d="",f=!1,g=0,v=p.length;"separator"===p[0].type&&(c+="top ",g=1),"separator"===p[p.length-1].type&&(c+="bottom ",v-=1);for(var b=g;b0?"left ":"",c+=S[S.length-1].length>0?"right ":"";for(var M=1;M-1?"alignat":"align",o="split"===e.envName,s=Gr(e.parser,{cols:a,addJot:!0,autoTag:o?void 0:Vr(e.envName),emptySingleRow:!0,colSeparationType:i,maxNumCols:o?2:void 0,leqno:e.parser.settings.leqno},"display"),l=0,h={type:"ordgroup",mode:e.mode,body:[]};if(t[0]&&"ordgroup"===t[0].type){for(var m="",c=0;c0&&u&&(f=1),a[p]={type:"align",align:d,pregap:f,postgap:0}}return s.colSeparationType=u?"align":"alignat",s};Or({type:"array",names:["array","darray"],props:{numArgs:1},handler:function(e,t){var r=(Xt(t[0])?[t[0]]:Ut(t[0],"ordgroup").body).map((function(e){var t=Yt(e).text;if(-1!=="lcr".indexOf(t))return{type:"align",align:t};if("|"===t)return{type:"separator",separator:"|"};if(":"===t)return{type:"separator",separator:":"};throw new n("Unknown column alignment: "+t,e)})),a={cols:r,hskipBeforeAndAfter:!0,maxNumCols:r.length};return Gr(e.parser,a,Ur(e.envName))},htmlBuilder:Yr,mathmlBuilder:Wr}),Or({type:"array",names:["matrix","pmatrix","bmatrix","Bmatrix","vmatrix","Vmatrix","matrix*","pmatrix*","bmatrix*","Bmatrix*","vmatrix*","Vmatrix*"],props:{numArgs:0},handler:function(e){var t={matrix:null,pmatrix:["(",")"],bmatrix:["[","]"],Bmatrix:["\\{","\\}"],vmatrix:["|","|"],Vmatrix:["\\Vert","\\Vert"]}[e.envName.replace("*","")],r="c",a={hskipBeforeAndAfter:!1,cols:[{type:"align",align:r}]};if("*"===e.envName.charAt(e.envName.length-1)){var i=e.parser;if(i.consumeSpaces(),"["===i.fetch().text){if(i.consume(),i.consumeSpaces(),r=i.fetch().text,-1==="lcr".indexOf(r))throw new n("Expected l or c or r",i.nextToken);i.consume(),i.consumeSpaces(),i.expect("]"),i.consume(),a.cols=[{type:"align",align:r}]}}var o=Gr(e.parser,a,Ur(e.envName)),s=Math.max.apply(Math,[0].concat(o.body.map((function(e){return e.length}))));return o.cols=new Array(s).fill({type:"align",align:r}),t?{type:"leftright",mode:e.mode,body:[o],left:t[0],right:t[1],rightColor:void 0}:o},htmlBuilder:Yr,mathmlBuilder:Wr}),Or({type:"array",names:["smallmatrix"],props:{numArgs:0},handler:function(e){var t=Gr(e.parser,{arraystretch:.5},"script");return t.colSeparationType="small",t},htmlBuilder:Yr,mathmlBuilder:Wr}),Or({type:"array",names:["subarray"],props:{numArgs:1},handler:function(e,t){var r=(Xt(t[0])?[t[0]]:Ut(t[0],"ordgroup").body).map((function(e){var t=Yt(e).text;if(-1!=="lc".indexOf(t))return{type:"align",align:t};throw new n("Unknown column alignment: "+t,e)}));if(r.length>1)throw new n("{subarray} can contain only one column");var a={cols:r,hskipBeforeAndAfter:!1,arraystretch:.5};if((a=Gr(e.parser,a,"script")).body.length>0&&a.body[0].length>1)throw new n("{subarray} can contain only one column");return a},htmlBuilder:Yr,mathmlBuilder:Wr}),Or({type:"array",names:["cases","dcases","rcases","drcases"],props:{numArgs:0},handler:function(e){var t=Gr(e.parser,{arraystretch:1.2,cols:[{type:"align",align:"l",pregap:0,postgap:1},{type:"align",align:"l",pregap:0,postgap:0}]},Ur(e.envName));return{type:"leftright",mode:e.mode,body:[t],left:e.envName.indexOf("r")>-1?".":"\\{",right:e.envName.indexOf("r")>-1?"\\}":".",rightColor:void 0}},htmlBuilder:Yr,mathmlBuilder:Wr}),Or({type:"array",names:["align","align*","aligned","split"],props:{numArgs:0},handler:_r,htmlBuilder:Yr,mathmlBuilder:Wr}),Or({type:"array",names:["gathered","gather","gather*"],props:{numArgs:0},handler:function(e){l.contains(["gather","gather*"],e.envName)&&Fr(e);var t={cols:[{type:"align",align:"c"}],addJot:!0,colSeparationType:"gather",autoTag:Vr(e.envName),emptySingleRow:!0,leqno:e.parser.settings.leqno};return Gr(e.parser,t,"display")},htmlBuilder:Yr,mathmlBuilder:Wr}),Or({type:"array",names:["alignat","alignat*","alignedat"],props:{numArgs:1},handler:_r,htmlBuilder:Yr,mathmlBuilder:Wr}),Or({type:"array",names:["equation","equation*"],props:{numArgs:0},handler:function(e){Fr(e);var t={autoTag:Vr(e.envName),emptySingleRow:!0,singleRow:!0,maxNumCols:1,leqno:e.parser.settings.leqno};return Gr(e.parser,t,"display")},htmlBuilder:Yr,mathmlBuilder:Wr}),Or({type:"array",names:["CD"],props:{numArgs:0},handler:function(e){return Fr(e),function(e){var t=[];for(e.gullet.beginGroup(),e.gullet.macros.set("\\cr","\\\\\\relax"),e.gullet.beginGroup();;){t.push(e.parseExpression(!1,"\\\\")),e.gullet.endGroup(),e.gullet.beginGroup();var r=e.fetch().text;if("&"!==r&&"\\\\"!==r){if("\\end"===r){0===t[t.length-1].length&&t.pop();break}throw new n("Expected \\\\ or \\cr or \\end",e.nextToken)}e.consume()}for(var a,i,o=[],s=[o],l=0;l-1);else{if(!("<>AV".indexOf(u)>-1))throw new n('Expected one of "<>AV=|." after @',h[c]);for(var d=0;d<2;d++){for(var f=!0,g=c+1;g=x.SCRIPT.id?r.text():x.DISPLAY:"text"===e&&r.size===x.DISPLAY.size?r=x.TEXT:"script"===e?r=x.SCRIPT:"scriptscript"===e&&(r=x.SCRIPTSCRIPT),r},nn=function(e,t){var r,n=rn(e.size,t.style),a=n.fracNum(),i=n.fracDen();r=t.havingStyle(a);var o=wt(e.numer,r,t);if(e.continued){var s=8.5/t.fontMetrics().ptPerEm,l=3.5/t.fontMetrics().ptPerEm;o.height=o.height0?3*c:7*c,d=t.fontMetrics().denom1):(m>0?(u=t.fontMetrics().num2,p=c):(u=t.fontMetrics().num3,p=3*c),d=t.fontMetrics().denom2),h){var w=t.fontMetrics().axisHeight;u-o.depth-(w+.5*m)0&&(t="."===(t=e)?null:t),t};ot({type:"genfrac",names:["\\genfrac"],props:{numArgs:6,allowedInArgument:!0,argTypes:["math","math","size","text","math","math"]},handler:function(e,t){var r,n=e.parser,a=t[4],i=t[5],o=lt(t[0]),s="atom"===o.type&&"open"===o.family?sn(o.text):null,l=lt(t[1]),h="atom"===l.type&&"close"===l.family?sn(l.text):null,m=Ut(t[2],"size"),c=null;r=!!m.isBlank||(c=m.value).number>0;var u="auto",p=t[3];if("ordgroup"===p.type){if(p.body.length>0){var d=Ut(p.body[0],"textord");u=on[Number(d.text)]}}else p=Ut(p,"textord"),u=on[Number(p.text)];return{type:"genfrac",mode:n.mode,numer:a,denom:i,continued:!1,hasBarLine:r,barSize:c,leftDelim:s,rightDelim:h,size:u}},htmlBuilder:nn,mathmlBuilder:an}),ot({type:"infix",names:["\\above"],props:{numArgs:1,argTypes:["size"],infix:!0},handler:function(e,t){var r=e.parser,n=(e.funcName,e.token);return{type:"infix",mode:r.mode,replaceWith:"\\\\abovefrac",size:Ut(t[0],"size").value,token:n}}}),ot({type:"genfrac",names:["\\\\abovefrac"],props:{numArgs:3,argTypes:["math","size","math"]},handler:function(e,t){var r=e.parser,n=(e.funcName,t[0]),a=function(e){if(!e)throw new Error("Expected non-null, but got "+String(e));return e}(Ut(t[1],"infix").size),i=t[2],o=a.number>0;return{type:"genfrac",mode:r.mode,numer:n,denom:i,continued:!1,hasBarLine:o,barSize:a,leftDelim:null,rightDelim:null,size:"auto"}},htmlBuilder:nn,mathmlBuilder:an});var ln=function(e,t){var r,n,a=t.style;"supsub"===e.type?(r=e.sup?wt(e.sup,t.havingStyle(a.sup()),t):wt(e.sub,t.havingStyle(a.sub()),t),n=Ut(e.base,"horizBrace")):n=Ut(e,"horizBrace");var i,o=wt(n.base,t.havingBaseStyle(x.DISPLAY)),s=Gt(n,t);if(n.isOver?(i=Ke.makeVList({positionType:"firstBaseline",children:[{type:"elem",elem:o},{type:"kern",size:.1},{type:"elem",elem:s}]},t)).children[0].children[0].children[1].classes.push("svg-align"):(i=Ke.makeVList({positionType:"bottom",positionData:o.depth+.1+s.height,children:[{type:"elem",elem:s},{type:"kern",size:.1},{type:"elem",elem:o}]},t)).children[0].children[0].children[0].classes.push("svg-align"),r){var l=Ke.makeSpan(["mord",n.isOver?"mover":"munder"],[i],t);i=n.isOver?Ke.makeVList({positionType:"firstBaseline",children:[{type:"elem",elem:l},{type:"kern",size:.2},{type:"elem",elem:r}]},t):Ke.makeVList({positionType:"bottom",positionData:l.depth+.2+r.height+r.depth,children:[{type:"elem",elem:r},{type:"kern",size:.2},{type:"elem",elem:l}]},t)}return Ke.makeSpan(["mord",n.isOver?"mover":"munder"],[i],t)};ot({type:"horizBrace",names:["\\overbrace","\\underbrace"],props:{numArgs:1},handler:function(e,t){var r=e.parser,n=e.funcName;return{type:"horizBrace",mode:r.mode,label:n,isOver:/^\\over/.test(n),base:t[0]}},htmlBuilder:ln,mathmlBuilder:function(e,t){var r=Vt(e.label);return new Tt.MathNode(e.isOver?"mover":"munder",[Rt(e.base,t),r])}}),ot({type:"href",names:["\\href"],props:{numArgs:2,argTypes:["url","original"],allowedInText:!0},handler:function(e,t){var r=e.parser,n=t[1],a=Ut(t[0],"url").url;return r.settings.isTrusted({command:"\\href",url:a})?{type:"href",mode:r.mode,href:a,body:ht(n)}:r.formatUnsupportedCmd("\\href")},htmlBuilder:function(e,t){var r=ft(e.body,t,!1);return Ke.makeAnchor(e.href,[],r,t)},mathmlBuilder:function(e,t){var r=It(e.body,t);return r instanceof zt||(r=new zt("mrow",[r])),r.setAttribute("href",e.href),r}}),ot({type:"href",names:["\\url"],props:{numArgs:1,argTypes:["url"],allowedInText:!0},handler:function(e,t){var r=e.parser,n=Ut(t[0],"url").url;if(!r.settings.isTrusted({command:"\\url",url:n}))return r.formatUnsupportedCmd("\\url");for(var a=[],i=0;i0&&(n=F(e.totalheight,t)-r);var a=0;e.width.number>0&&(a=F(e.width,t));var i={height:V(r+n)};a>0&&(i.width=V(a)),n>0&&(i.verticalAlign=V(-n));var o=new j(e.src,e.alt,i);return o.height=r,o.depth=n,o},mathmlBuilder:function(e,t){var r=new Tt.MathNode("mglyph",[]);r.setAttribute("alt",e.alt);var n=F(e.height,t),a=0;if(e.totalheight.number>0&&(a=F(e.totalheight,t)-n,r.setAttribute("valign",V(-a))),r.setAttribute("height",V(n+a)),e.width.number>0){var i=F(e.width,t);r.setAttribute("width",V(i))}return r.setAttribute("src",e.src),r}}),ot({type:"kern",names:["\\kern","\\mkern","\\hskip","\\mskip"],props:{numArgs:1,argTypes:["size"],primitive:!0,allowedInText:!0},handler:function(e,t){var r=e.parser,n=e.funcName,a=Ut(t[0],"size");if(r.settings.strict){var i="m"===n[1],o="mu"===a.value.unit;i?(o||r.settings.reportNonstrict("mathVsTextUnits","LaTeX's "+n+" supports only mu units, not "+a.value.unit+" units"),"math"!==r.mode&&r.settings.reportNonstrict("mathVsTextUnits","LaTeX's "+n+" works only in math mode")):o&&r.settings.reportNonstrict("mathVsTextUnits","LaTeX's "+n+" doesn't support mu units")}return{type:"kern",mode:r.mode,dimension:a.value}},htmlBuilder:function(e,t){return Ke.makeGlue(e.dimension,t)},mathmlBuilder:function(e,t){var r=F(e.dimension,t);return new Tt.SpaceNode(r)}}),ot({type:"lap",names:["\\mathllap","\\mathrlap","\\mathclap"],props:{numArgs:1,allowedInText:!0},handler:function(e,t){var r=e.parser,n=e.funcName,a=t[0];return{type:"lap",mode:r.mode,alignment:n.slice(5),body:a}},htmlBuilder:function(e,t){var r;"clap"===e.alignment?(r=Ke.makeSpan([],[wt(e.body,t)]),r=Ke.makeSpan(["inner"],[r],t)):r=Ke.makeSpan(["inner"],[wt(e.body,t)]);var n=Ke.makeSpan(["fix"],[]),a=Ke.makeSpan([e.alignment],[r,n],t),i=Ke.makeSpan(["strut"]);return i.style.height=V(a.height+a.depth),a.depth&&(i.style.verticalAlign=V(-a.depth)),a.children.unshift(i),a=Ke.makeSpan(["thinbox"],[a],t),Ke.makeSpan(["mord","vbox"],[a],t)},mathmlBuilder:function(e,t){var r=new Tt.MathNode("mpadded",[Rt(e.body,t)]);if("rlap"!==e.alignment){var n="llap"===e.alignment?"-1":"-0.5";r.setAttribute("lspace",n+"width")}return r.setAttribute("width","0px"),r}}),ot({type:"styling",names:["\\(","$"],props:{numArgs:0,allowedInText:!0,allowedInMath:!1},handler:function(e,t){var r=e.funcName,n=e.parser,a=n.mode;n.switchMode("math");var i="\\("===r?"\\)":"$",o=n.parseExpression(!1,i);return n.expect(i),n.switchMode(a),{type:"styling",mode:n.mode,style:"text",body:o}}}),ot({type:"text",names:["\\)","\\]"],props:{numArgs:0,allowedInText:!0,allowedInMath:!1},handler:function(e,t){throw new n("Mismatched "+e.funcName)}});var mn=function(e,t){switch(t.style.size){case x.DISPLAY.size:return e.display;case x.TEXT.size:return e.text;case x.SCRIPT.size:return e.script;case x.SCRIPTSCRIPT.size:return e.scriptscript;default:return e.text}};ot({type:"mathchoice",names:["\\mathchoice"],props:{numArgs:4,primitive:!0},handler:function(e,t){return{type:"mathchoice",mode:e.parser.mode,display:ht(t[0]),text:ht(t[1]),script:ht(t[2]),scriptscript:ht(t[3])}},htmlBuilder:function(e,t){var r=mn(e,t),n=ft(r,t,!1);return Ke.makeFragment(n)},mathmlBuilder:function(e,t){var r=mn(e,t);return It(r,t)}});var cn=function(e,t,r,n,a,i,o){e=Ke.makeSpan([],[e]);var s,h,m,c=r&&l.isCharacterBox(r);if(t){var u=wt(t,n.havingStyle(a.sup()),n);h={elem:u,kern:Math.max(n.fontMetrics().bigOpSpacing1,n.fontMetrics().bigOpSpacing3-u.depth)}}if(r){var p=wt(r,n.havingStyle(a.sub()),n);s={elem:p,kern:Math.max(n.fontMetrics().bigOpSpacing2,n.fontMetrics().bigOpSpacing4-p.height)}}if(h&&s){var d=n.fontMetrics().bigOpSpacing5+s.elem.height+s.elem.depth+s.kern+e.depth+o;m=Ke.makeVList({positionType:"bottom",positionData:d,children:[{type:"kern",size:n.fontMetrics().bigOpSpacing5},{type:"elem",elem:s.elem,marginLeft:V(-i)},{type:"kern",size:s.kern},{type:"elem",elem:e},{type:"kern",size:h.kern},{type:"elem",elem:h.elem,marginLeft:V(i)},{type:"kern",size:n.fontMetrics().bigOpSpacing5}]},n)}else if(s){var f=e.height-o;m=Ke.makeVList({positionType:"top",positionData:f,children:[{type:"kern",size:n.fontMetrics().bigOpSpacing5},{type:"elem",elem:s.elem,marginLeft:V(-i)},{type:"kern",size:s.kern},{type:"elem",elem:e}]},n)}else{if(!h)return e;var g=e.depth+o;m=Ke.makeVList({positionType:"bottom",positionData:g,children:[{type:"elem",elem:e},{type:"kern",size:h.kern},{type:"elem",elem:h.elem,marginLeft:V(i)},{type:"kern",size:n.fontMetrics().bigOpSpacing5}]},n)}var v=[m];if(s&&0!==i&&!c){var b=Ke.makeSpan(["mspace"],[],n);b.style.marginRight=V(i),v.unshift(b)}return Ke.makeSpan(["mop","op-limits"],v,n)},un=["\\smallint"],pn=function(e,t){var r,n,a,i=!1;"supsub"===e.type?(r=e.sup,n=e.sub,a=Ut(e.base,"op"),i=!0):a=Ut(e,"op");var o,s=t.style,h=!1;if(s.size===x.DISPLAY.size&&a.symbol&&!l.contains(un,a.name)&&(h=!0),a.symbol){var m=h?"Size2-Regular":"Size1-Regular",c="";if("\\oiint"!==a.name&&"\\oiiint"!==a.name||(c=a.name.substr(1),a.name="oiint"===c?"\\iint":"\\iiint"),o=Ke.makeSymbol(a.name,m,"math",t,["mop","op-symbol",h?"large-op":"small-op"]),c.length>0){var u=o.italic,p=Ke.staticSvg(c+"Size"+(h?"2":"1"),t);o=Ke.makeVList({positionType:"individualShift",children:[{type:"elem",elem:o,shift:0},{type:"elem",elem:p,shift:h?.08:0}]},t),a.name="\\"+c,o.classes.unshift("mop"),o.italic=u}}else if(a.body){var d=ft(a.body,t,!0);1===d.length&&d[0]instanceof Z?(o=d[0]).classes[0]="mop":o=Ke.makeSpan(["mop"],d,t)}else{for(var f=[],g=1;g0){for(var s=a.body.map((function(e){var t=e.text;return"string"==typeof t?{type:"textord",mode:e.mode,text:t}:e})),l=ft(s,t.withFont("mathrm"),!0),h=0;h=0?s.setAttribute("height",V(a)):(s.setAttribute("height",V(a)),s.setAttribute("depth",V(-a))),s.setAttribute("voffset",V(a)),s}});var yn=["\\tiny","\\sixptsize","\\scriptsize","\\footnotesize","\\small","\\normalsize","\\large","\\Large","\\LARGE","\\huge","\\Huge"];ot({type:"sizing",names:yn,props:{numArgs:0,allowedInText:!0},handler:function(e,t){var r=e.breakOnTokenText,n=e.funcName,a=e.parser,i=a.parseExpression(!1,r);return{type:"sizing",mode:a.mode,size:yn.indexOf(n)+1,body:i}},htmlBuilder:function(e,t){var r=t.havingSize(e.size);return bn(e.body,r,t)},mathmlBuilder:function(e,t){var r=t.havingSize(e.size),n=Nt(e.body,r),a=new Tt.MathNode("mstyle",n);return a.setAttribute("mathsize",V(r.sizeMultiplier)),a}}),ot({type:"smash",names:["\\smash"],props:{numArgs:1,numOptionalArgs:1,allowedInText:!0},handler:function(e,t,r){var n=e.parser,a=!1,i=!1,o=r[0]&&Ut(r[0],"ordgroup");if(o)for(var s="",l=0;lr.height+r.depth+i&&(i=(i+c-r.height-r.depth)/2);var u=l.height-r.height-i-h;r.style.paddingLeft=V(m);var p=Ke.makeVList({positionType:"firstBaseline",children:[{type:"elem",elem:r,wrapperClasses:["svg-align"]},{type:"kern",size:-(r.height+u)},{type:"elem",elem:l},{type:"kern",size:h}]},t);if(e.index){var d=t.havingStyle(x.SCRIPTSCRIPT),f=wt(e.index,d,t),g=.6*(p.height-p.depth),v=Ke.makeVList({positionType:"shift",positionData:-g,children:[{type:"elem",elem:f}]},t),b=Ke.makeSpan(["root"],[v]);return Ke.makeSpan(["mord","sqrt"],[b,p],t)}return Ke.makeSpan(["mord","sqrt"],[p],t)},mathmlBuilder:function(e,t){var r=e.body,n=e.index;return n?new Tt.MathNode("mroot",[Rt(r,t),Rt(n,t)]):new Tt.MathNode("msqrt",[Rt(r,t)])}});var xn={display:x.DISPLAY,text:x.TEXT,script:x.SCRIPT,scriptscript:x.SCRIPTSCRIPT};ot({type:"styling",names:["\\displaystyle","\\textstyle","\\scriptstyle","\\scriptscriptstyle"],props:{numArgs:0,allowedInText:!0,primitive:!0},handler:function(e,t){var r=e.breakOnTokenText,n=e.funcName,a=e.parser,i=a.parseExpression(!0,r),o=n.slice(1,n.length-5);return{type:"styling",mode:a.mode,style:o,body:i}},htmlBuilder:function(e,t){var r=xn[e.style],n=t.havingStyle(r).withFont("");return bn(e.body,n,t)},mathmlBuilder:function(e,t){var r=xn[e.style],n=t.havingStyle(r),a=Nt(e.body,n),i=new Tt.MathNode("mstyle",a),o={display:["0","true"],text:["0","false"],script:["1","false"],scriptscript:["2","false"]}[e.style];return i.setAttribute("scriptlevel",o[0]),i.setAttribute("displaystyle",o[1]),i}});var wn=function(e,t){var r=e.base;return r?"op"===r.type?r.limits&&(t.style.size===x.DISPLAY.size||r.alwaysHandleSupSub)?pn:null:"operatorname"===r.type?r.alwaysHandleSupSub&&(t.style.size===x.DISPLAY.size||r.limits)?vn:null:"accent"===r.type?l.isCharacterBox(r.base)?Wt:null:"horizBrace"===r.type&&!e.sub===r.isOver?ln:null:null};st({type:"supsub",htmlBuilder:function(e,t){var r=wn(e,t);if(r)return r(e,t);var n,a,i,o=e.base,s=e.sup,h=e.sub,m=wt(o,t),c=t.fontMetrics(),u=0,p=0,d=o&&l.isCharacterBox(o);if(s){var f=t.havingStyle(t.style.sup());n=wt(s,f,t),d||(u=m.height-f.fontMetrics().supDrop*f.sizeMultiplier/t.sizeMultiplier)}if(h){var g=t.havingStyle(t.style.sub());a=wt(h,g,t),d||(p=m.depth+g.fontMetrics().subDrop*g.sizeMultiplier/t.sizeMultiplier)}i=t.style===x.DISPLAY?c.sup1:t.style.cramped?c.sup3:c.sup2;var v,b=t.sizeMultiplier,y=V(.5/c.ptPerEm/b),w=null;if(a){var k=e.base&&"op"===e.base.type&&e.base.name&&("\\oiint"===e.base.name||"\\oiiint"===e.base.name);(m instanceof Z||k)&&(w=V(-m.italic))}if(n&&a){u=Math.max(u,i,n.depth+.25*c.xHeight),p=Math.max(p,c.sub2);var S=4*c.defaultRuleThickness;if(u-n.depth-(a.height-p)0&&(u+=M,p-=M)}var z=[{type:"elem",elem:a,shift:p,marginRight:y,marginLeft:w},{type:"elem",elem:n,shift:-u,marginRight:y}];v=Ke.makeVList({positionType:"individualShift",children:z},t)}else if(a){p=Math.max(p,c.sub1,a.height-.8*c.xHeight);var A=[{type:"elem",elem:a,marginLeft:w,marginRight:y}];v=Ke.makeVList({positionType:"shift",positionData:p,children:A},t)}else{if(!n)throw new Error("supsub must have either sup or sub.");u=Math.max(u,i,n.depth+.25*c.xHeight),v=Ke.makeVList({positionType:"shift",positionData:-u,children:[{type:"elem",elem:n,marginRight:y}]},t)}var T=yt(m,"right")||"mord";return Ke.makeSpan([T],[m,Ke.makeSpan(["msupsub"],[v])],t)},mathmlBuilder:function(e,t){var r,n=!1;e.base&&"horizBrace"===e.base.type&&!!e.sup===e.base.isOver&&(n=!0,r=e.base.isOver),!e.base||"op"!==e.base.type&&"operatorname"!==e.base.type||(e.base.parentIsSupSub=!0);var a,i=[Rt(e.base,t)];if(e.sub&&i.push(Rt(e.sub,t)),e.sup&&i.push(Rt(e.sup,t)),n)a=r?"mover":"munder";else if(e.sub)if(e.sup){var o=e.base;a=o&&"op"===o.type&&o.limits&&t.style===x.DISPLAY||o&&"operatorname"===o.type&&o.alwaysHandleSupSub&&(t.style===x.DISPLAY||o.limits)?"munderover":"msubsup"}else{var s=e.base;a=s&&"op"===s.type&&s.limits&&(t.style===x.DISPLAY||s.alwaysHandleSupSub)||s&&"operatorname"===s.type&&s.alwaysHandleSupSub&&(s.limits||t.style===x.DISPLAY)?"munder":"msub"}else{var l=e.base;a=l&&"op"===l.type&&l.limits&&(t.style===x.DISPLAY||l.alwaysHandleSupSub)||l&&"operatorname"===l.type&&l.alwaysHandleSupSub&&(l.limits||t.style===x.DISPLAY)?"mover":"msup"}return new Tt.MathNode(a,i)}}),st({type:"atom",htmlBuilder:function(e,t){return Ke.mathsym(e.text,e.mode,t,["m"+e.family])},mathmlBuilder:function(e,t){var r=new Tt.MathNode("mo",[Bt(e.text,e.mode)]);if("bin"===e.family){var n=qt(e,t);"bold-italic"===n&&r.setAttribute("mathvariant",n)}else"punct"===e.family?r.setAttribute("separator","true"):"open"!==e.family&&"close"!==e.family||r.setAttribute("stretchy","false");return r}});var kn={mi:"italic",mn:"normal",mtext:"normal"};st({type:"mathord",htmlBuilder:function(e,t){return Ke.makeOrd(e,t,"mathord")},mathmlBuilder:function(e,t){var r=new Tt.MathNode("mi",[Bt(e.text,e.mode,t)]),n=qt(e,t)||"italic";return n!==kn[r.type]&&r.setAttribute("mathvariant",n),r}}),st({type:"textord",htmlBuilder:function(e,t){return Ke.makeOrd(e,t,"textord")},mathmlBuilder:function(e,t){var r,n=Bt(e.text,e.mode,t),a=qt(e,t)||"normal";return r="text"===e.mode?new Tt.MathNode("mtext",[n]):/[0-9]/.test(e.text)?new Tt.MathNode("mn",[n]):"\\prime"===e.text?new Tt.MathNode("mo",[n]):new Tt.MathNode("mi",[n]),a!==kn[r.type]&&r.setAttribute("mathvariant",a),r}});var Sn={"\\nobreak":"nobreak","\\allowbreak":"allowbreak"},Mn={" ":{},"\\ ":{},"~":{className:"nobreak"},"\\space":{},"\\nobreakspace":{className:"nobreak"}};st({type:"spacing",htmlBuilder:function(e,t){if(Mn.hasOwnProperty(e.text)){var r=Mn[e.text].className||"";if("text"===e.mode){var a=Ke.makeOrd(e,t,"textord");return a.classes.push(r),a}return Ke.makeSpan(["mspace",r],[Ke.mathsym(e.text,e.mode,t)],t)}if(Sn.hasOwnProperty(e.text))return Ke.makeSpan(["mspace",Sn[e.text]],[],t);throw new n('Unknown type of space "'+e.text+'"')},mathmlBuilder:function(e,t){if(!Mn.hasOwnProperty(e.text)){if(Sn.hasOwnProperty(e.text))return new Tt.MathNode("mspace");throw new n('Unknown type of space "'+e.text+'"')}return new Tt.MathNode("mtext",[new Tt.TextNode("\xa0")])}});var zn=function(){var e=new Tt.MathNode("mtd",[]);return e.setAttribute("width","50%"),e};st({type:"tag",mathmlBuilder:function(e,t){var r=new Tt.MathNode("mtable",[new Tt.MathNode("mtr",[zn(),new Tt.MathNode("mtd",[It(e.body,t)]),zn(),new Tt.MathNode("mtd",[It(e.tag,t)])])]);return r.setAttribute("width","100%"),r}});var An={"\\text":void 0,"\\textrm":"textrm","\\textsf":"textsf","\\texttt":"texttt","\\textnormal":"textrm"},Tn={"\\textbf":"textbf","\\textmd":"textmd"},Bn={"\\textit":"textit","\\textup":"textup"},Cn=function(e,t){var r=e.font;return r?An[r]?t.withTextFontFamily(An[r]):Tn[r]?t.withTextFontWeight(Tn[r]):t.withTextFontShape(Bn[r]):t};ot({type:"text",names:["\\text","\\textrm","\\textsf","\\texttt","\\textnormal","\\textbf","\\textmd","\\textit","\\textup"],props:{numArgs:1,argTypes:["text"],allowedInArgument:!0,allowedInText:!0},handler:function(e,t){var r=e.parser,n=e.funcName,a=t[0];return{type:"text",mode:r.mode,body:ht(a),font:n}},htmlBuilder:function(e,t){var r=Cn(e,t),n=ft(e.body,r,!0);return Ke.makeSpan(["mord","text"],n,r)},mathmlBuilder:function(e,t){var r=Cn(e,t);return It(e.body,r)}}),ot({type:"underline",names:["\\underline"],props:{numArgs:1,allowedInText:!0},handler:function(e,t){return{type:"underline",mode:e.parser.mode,body:t[0]}},htmlBuilder:function(e,t){var r=wt(e.body,t),n=Ke.makeLineSpan("underline-line",t),a=t.fontMetrics().defaultRuleThickness,i=Ke.makeVList({positionType:"top",positionData:r.height,children:[{type:"kern",size:a},{type:"elem",elem:n},{type:"kern",size:3*a},{type:"elem",elem:r}]},t);return Ke.makeSpan(["mord","underline"],[i],t)},mathmlBuilder:function(e,t){var r=new Tt.MathNode("mo",[new Tt.TextNode("\u203e")]);r.setAttribute("stretchy","true");var n=new Tt.MathNode("munder",[Rt(e.body,t),r]);return n.setAttribute("accentunder","true"),n}}),ot({type:"vcenter",names:["\\vcenter"],props:{numArgs:1,argTypes:["original"],allowedInText:!1},handler:function(e,t){return{type:"vcenter",mode:e.parser.mode,body:t[0]}},htmlBuilder:function(e,t){var r=wt(e.body,t),n=t.fontMetrics().axisHeight,a=.5*(r.height-n-(r.depth+n));return Ke.makeVList({positionType:"shift",positionData:a,children:[{type:"elem",elem:r}]},t)},mathmlBuilder:function(e,t){return new Tt.MathNode("mpadded",[Rt(e.body,t)],["vcenter"])}}),ot({type:"verb",names:["\\verb"],props:{numArgs:0,allowedInText:!0},handler:function(e,t,r){throw new n("\\verb ended by end of line instead of matching delimiter")},htmlBuilder:function(e,t){for(var r=qn(e),n=[],a=t.havingStyle(t.style.text()),i=0;i0;)this.endGroup()},t.has=function(e){return this.current.hasOwnProperty(e)||this.builtins.hasOwnProperty(e)},t.get=function(e){return this.current.hasOwnProperty(e)?this.current[e]:this.builtins[e]},t.set=function(e,t,r){if(void 0===r&&(r=!1),r){for(var n=0;n0&&(this.undefStack[this.undefStack.length-1][e]=t)}else{var a=this.undefStack[this.undefStack.length-1];a&&!a.hasOwnProperty(e)&&(a[e]=this.current[e])}null==t?delete this.current[e]:this.current[e]=t},e}(),Hn=Hr;Er("\\noexpand",(function(e){var t=e.popToken();return e.isExpandable(t.text)&&(t.noexpand=!0,t.treatAsRelax=!0),{tokens:[t],numArgs:0}})),Er("\\expandafter",(function(e){var t=e.popToken();return e.expandOnce(!0),{tokens:[t],numArgs:0}})),Er("\\@firstoftwo",(function(e){return{tokens:e.consumeArgs(2)[0],numArgs:0}})),Er("\\@secondoftwo",(function(e){return{tokens:e.consumeArgs(2)[1],numArgs:0}})),Er("\\@ifnextchar",(function(e){var t=e.consumeArgs(3);e.consumeSpaces();var r=e.future();return 1===t[0].length&&t[0][0].text===r.text?{tokens:t[1],numArgs:0}:{tokens:t[2],numArgs:0}})),Er("\\@ifstar","\\@ifnextchar *{\\@firstoftwo{#1}}"),Er("\\TextOrMath",(function(e){var t=e.consumeArgs(2);return"text"===e.mode?{tokens:t[0],numArgs:0}:{tokens:t[1],numArgs:0}}));var En={0:0,1:1,2:2,3:3,4:4,5:5,6:6,7:7,8:8,9:9,a:10,A:10,b:11,B:11,c:12,C:12,d:13,D:13,e:14,E:14,f:15,F:15};Er("\\char",(function(e){var t,r=e.popToken(),a="";if("'"===r.text)t=8,r=e.popToken();else if('"'===r.text)t=16,r=e.popToken();else if("`"===r.text)if("\\"===(r=e.popToken()).text[0])a=r.text.charCodeAt(1);else{if("EOF"===r.text)throw new n("\\char` missing argument");a=r.text.charCodeAt(0)}else t=10;if(t){if(null==(a=En[r.text])||a>=t)throw new n("Invalid base-"+t+" digit "+r.text);for(var i;null!=(i=En[e.future().text])&&i":"\\dotsb","-":"\\dotsb","*":"\\dotsb",":":"\\dotsb","\\DOTSB":"\\dotsb","\\coprod":"\\dotsb","\\bigvee":"\\dotsb","\\bigwedge":"\\dotsb","\\biguplus":"\\dotsb","\\bigcap":"\\dotsb","\\bigcup":"\\dotsb","\\prod":"\\dotsb","\\sum":"\\dotsb","\\bigotimes":"\\dotsb","\\bigoplus":"\\dotsb","\\bigodot":"\\dotsb","\\bigsqcup":"\\dotsb","\\And":"\\dotsb","\\longrightarrow":"\\dotsb","\\Longrightarrow":"\\dotsb","\\longleftarrow":"\\dotsb","\\Longleftarrow":"\\dotsb","\\longleftrightarrow":"\\dotsb","\\Longleftrightarrow":"\\dotsb","\\mapsto":"\\dotsb","\\longmapsto":"\\dotsb","\\hookrightarrow":"\\dotsb","\\doteq":"\\dotsb","\\mathbin":"\\dotsb","\\mathrel":"\\dotsb","\\relbar":"\\dotsb","\\Relbar":"\\dotsb","\\xrightarrow":"\\dotsb","\\xleftarrow":"\\dotsb","\\DOTSI":"\\dotsi","\\int":"\\dotsi","\\oint":"\\dotsi","\\iint":"\\dotsi","\\iiint":"\\dotsi","\\iiiint":"\\dotsi","\\idotsint":"\\dotsi","\\DOTSX":"\\dotsx"};Er("\\dots",(function(e){var t="\\dotso",r=e.expandAfterFuture().text;return r in Dn?t=Dn[r]:("\\not"===r.substr(0,4)||r in ae.math&&l.contains(["bin","rel"],ae.math[r].group))&&(t="\\dotsb"),t}));var Pn={")":!0,"]":!0,"\\rbrack":!0,"\\}":!0,"\\rbrace":!0,"\\rangle":!0,"\\rceil":!0,"\\rfloor":!0,"\\rgroup":!0,"\\rmoustache":!0,"\\right":!0,"\\bigr":!0,"\\biggr":!0,"\\Bigr":!0,"\\Biggr":!0,$:!0,";":!0,".":!0,",":!0};Er("\\dotso",(function(e){return e.future().text in Pn?"\\ldots\\,":"\\ldots"})),Er("\\dotsc",(function(e){var t=e.future().text;return t in Pn&&","!==t?"\\ldots\\,":"\\ldots"})),Er("\\cdots",(function(e){return e.future().text in Pn?"\\@cdots\\,":"\\@cdots"})),Er("\\dotsb","\\cdots"),Er("\\dotsm","\\cdots"),Er("\\dotsi","\\!\\cdots"),Er("\\dotsx","\\ldots\\,"),Er("\\DOTSI","\\relax"),Er("\\DOTSB","\\relax"),Er("\\DOTSX","\\relax"),Er("\\tmspace","\\TextOrMath{\\kern#1#3}{\\mskip#1#2}\\relax"),Er("\\,","\\tmspace+{3mu}{.1667em}"),Er("\\thinspace","\\,"),Er("\\>","\\mskip{4mu}"),Er("\\:","\\tmspace+{4mu}{.2222em}"),Er("\\medspace","\\:"),Er("\\;","\\tmspace+{5mu}{.2777em}"),Er("\\thickspace","\\;"),Er("\\!","\\tmspace-{3mu}{.1667em}"),Er("\\negthinspace","\\!"),Er("\\negmedspace","\\tmspace-{4mu}{.2222em}"),Er("\\negthickspace","\\tmspace-{5mu}{.277em}"),Er("\\enspace","\\kern.5em "),Er("\\enskip","\\hskip.5em\\relax"),Er("\\quad","\\hskip1em\\relax"),Er("\\qquad","\\hskip2em\\relax"),Er("\\tag","\\@ifstar\\tag@literal\\tag@paren"),Er("\\tag@paren","\\tag@literal{({#1})}"),Er("\\tag@literal",(function(e){if(e.macros.get("\\df@tag"))throw new n("Multiple \\tag");return"\\gdef\\df@tag{\\text{#1}}"})),Er("\\bmod","\\mathchoice{\\mskip1mu}{\\mskip1mu}{\\mskip5mu}{\\mskip5mu}\\mathbin{\\rm mod}\\mathchoice{\\mskip1mu}{\\mskip1mu}{\\mskip5mu}{\\mskip5mu}"),Er("\\pod","\\allowbreak\\mathchoice{\\mkern18mu}{\\mkern8mu}{\\mkern8mu}{\\mkern8mu}(#1)"),Er("\\pmod","\\pod{{\\rm mod}\\mkern6mu#1}"),Er("\\mod","\\allowbreak\\mathchoice{\\mkern18mu}{\\mkern12mu}{\\mkern12mu}{\\mkern12mu}{\\rm mod}\\,\\,#1"),Er("\\pmb","\\html@mathml{\\@binrel{#1}{\\mathrlap{#1}\\kern0.5px#1}}{\\mathbf{#1}}"),Er("\\newline","\\\\\\relax"),Er("\\TeX","\\textrm{\\html@mathml{T\\kern-.1667em\\raisebox{-.5ex}{E}\\kern-.125emX}{TeX}}");var Fn=V(T["Main-Regular"]["T".charCodeAt(0)][1]-.7*T["Main-Regular"]["A".charCodeAt(0)][1]);Er("\\LaTeX","\\textrm{\\html@mathml{L\\kern-.36em\\raisebox{"+Fn+"}{\\scriptstyle A}\\kern-.15em\\TeX}{LaTeX}}"),Er("\\KaTeX","\\textrm{\\html@mathml{K\\kern-.17em\\raisebox{"+Fn+"}{\\scriptstyle A}\\kern-.15em\\TeX}{KaTeX}}"),Er("\\hspace","\\@ifstar\\@hspacer\\@hspace"),Er("\\@hspace","\\hskip #1\\relax"),Er("\\@hspacer","\\rule{0pt}{0pt}\\hskip #1\\relax"),Er("\\ordinarycolon",":"),Er("\\vcentcolon","\\mathrel{\\mathop\\ordinarycolon}"),Er("\\dblcolon",'\\html@mathml{\\mathrel{\\vcentcolon\\mathrel{\\mkern-.9mu}\\vcentcolon}}{\\mathop{\\char"2237}}'),Er("\\coloneqq",'\\html@mathml{\\mathrel{\\vcentcolon\\mathrel{\\mkern-1.2mu}=}}{\\mathop{\\char"2254}}'),Er("\\Coloneqq",'\\html@mathml{\\mathrel{\\dblcolon\\mathrel{\\mkern-1.2mu}=}}{\\mathop{\\char"2237\\char"3d}}'),Er("\\coloneq",'\\html@mathml{\\mathrel{\\vcentcolon\\mathrel{\\mkern-1.2mu}\\mathrel{-}}}{\\mathop{\\char"3a\\char"2212}}'),Er("\\Coloneq",'\\html@mathml{\\mathrel{\\dblcolon\\mathrel{\\mkern-1.2mu}\\mathrel{-}}}{\\mathop{\\char"2237\\char"2212}}'),Er("\\eqqcolon",'\\html@mathml{\\mathrel{=\\mathrel{\\mkern-1.2mu}\\vcentcolon}}{\\mathop{\\char"2255}}'),Er("\\Eqqcolon",'\\html@mathml{\\mathrel{=\\mathrel{\\mkern-1.2mu}\\dblcolon}}{\\mathop{\\char"3d\\char"2237}}'),Er("\\eqcolon",'\\html@mathml{\\mathrel{\\mathrel{-}\\mathrel{\\mkern-1.2mu}\\vcentcolon}}{\\mathop{\\char"2239}}'),Er("\\Eqcolon",'\\html@mathml{\\mathrel{\\mathrel{-}\\mathrel{\\mkern-1.2mu}\\dblcolon}}{\\mathop{\\char"2212\\char"2237}}'),Er("\\colonapprox",'\\html@mathml{\\mathrel{\\vcentcolon\\mathrel{\\mkern-1.2mu}\\approx}}{\\mathop{\\char"3a\\char"2248}}'),Er("\\Colonapprox",'\\html@mathml{\\mathrel{\\dblcolon\\mathrel{\\mkern-1.2mu}\\approx}}{\\mathop{\\char"2237\\char"2248}}'),Er("\\colonsim",'\\html@mathml{\\mathrel{\\vcentcolon\\mathrel{\\mkern-1.2mu}\\sim}}{\\mathop{\\char"3a\\char"223c}}'),Er("\\Colonsim",'\\html@mathml{\\mathrel{\\dblcolon\\mathrel{\\mkern-1.2mu}\\sim}}{\\mathop{\\char"2237\\char"223c}}'),Er("\u2237","\\dblcolon"),Er("\u2239","\\eqcolon"),Er("\u2254","\\coloneqq"),Er("\u2255","\\eqqcolon"),Er("\u2a74","\\Coloneqq"),Er("\\ratio","\\vcentcolon"),Er("\\coloncolon","\\dblcolon"),Er("\\colonequals","\\coloneqq"),Er("\\coloncolonequals","\\Coloneqq"),Er("\\equalscolon","\\eqqcolon"),Er("\\equalscoloncolon","\\Eqqcolon"),Er("\\colonminus","\\coloneq"),Er("\\coloncolonminus","\\Coloneq"),Er("\\minuscolon","\\eqcolon"),Er("\\minuscoloncolon","\\Eqcolon"),Er("\\coloncolonapprox","\\Colonapprox"),Er("\\coloncolonsim","\\Colonsim"),Er("\\simcolon","\\mathrel{\\sim\\mathrel{\\mkern-1.2mu}\\vcentcolon}"),Er("\\simcoloncolon","\\mathrel{\\sim\\mathrel{\\mkern-1.2mu}\\dblcolon}"),Er("\\approxcolon","\\mathrel{\\approx\\mathrel{\\mkern-1.2mu}\\vcentcolon}"),Er("\\approxcoloncolon","\\mathrel{\\approx\\mathrel{\\mkern-1.2mu}\\dblcolon}"),Er("\\notni","\\html@mathml{\\not\\ni}{\\mathrel{\\char`\u220c}}"),Er("\\limsup","\\DOTSB\\operatorname*{lim\\,sup}"),Er("\\liminf","\\DOTSB\\operatorname*{lim\\,inf}"),Er("\\injlim","\\DOTSB\\operatorname*{inj\\,lim}"),Er("\\projlim","\\DOTSB\\operatorname*{proj\\,lim}"),Er("\\varlimsup","\\DOTSB\\operatorname*{\\overline{lim}}"),Er("\\varliminf","\\DOTSB\\operatorname*{\\underline{lim}}"),Er("\\varinjlim","\\DOTSB\\operatorname*{\\underrightarrow{lim}}"),Er("\\varprojlim","\\DOTSB\\operatorname*{\\underleftarrow{lim}}"),Er("\\gvertneqq","\\html@mathml{\\@gvertneqq}{\u2269}"),Er("\\lvertneqq","\\html@mathml{\\@lvertneqq}{\u2268}"),Er("\\ngeqq","\\html@mathml{\\@ngeqq}{\u2271}"),Er("\\ngeqslant","\\html@mathml{\\@ngeqslant}{\u2271}"),Er("\\nleqq","\\html@mathml{\\@nleqq}{\u2270}"),Er("\\nleqslant","\\html@mathml{\\@nleqslant}{\u2270}"),Er("\\nshortmid","\\html@mathml{\\@nshortmid}{\u2224}"),Er("\\nshortparallel","\\html@mathml{\\@nshortparallel}{\u2226}"),Er("\\nsubseteqq","\\html@mathml{\\@nsubseteqq}{\u2288}"),Er("\\nsupseteqq","\\html@mathml{\\@nsupseteqq}{\u2289}"),Er("\\varsubsetneq","\\html@mathml{\\@varsubsetneq}{\u228a}"),Er("\\varsubsetneqq","\\html@mathml{\\@varsubsetneqq}{\u2acb}"),Er("\\varsupsetneq","\\html@mathml{\\@varsupsetneq}{\u228b}"),Er("\\varsupsetneqq","\\html@mathml{\\@varsupsetneqq}{\u2acc}"),Er("\\imath","\\html@mathml{\\@imath}{\u0131}"),Er("\\jmath","\\html@mathml{\\@jmath}{\u0237}"),Er("\\llbracket","\\html@mathml{\\mathopen{[\\mkern-3.2mu[}}{\\mathopen{\\char`\u27e6}}"),Er("\\rrbracket","\\html@mathml{\\mathclose{]\\mkern-3.2mu]}}{\\mathclose{\\char`\u27e7}}"),Er("\u27e6","\\llbracket"),Er("\u27e7","\\rrbracket"),Er("\\lBrace","\\html@mathml{\\mathopen{\\{\\mkern-3.2mu[}}{\\mathopen{\\char`\u2983}}"),Er("\\rBrace","\\html@mathml{\\mathclose{]\\mkern-3.2mu\\}}}{\\mathclose{\\char`\u2984}}"),Er("\u2983","\\lBrace"),Er("\u2984","\\rBrace"),Er("\\minuso","\\mathbin{\\html@mathml{{\\mathrlap{\\mathchoice{\\kern{0.145em}}{\\kern{0.145em}}{\\kern{0.1015em}}{\\kern{0.0725em}}\\circ}{-}}}{\\char`\u29b5}}"),Er("\u29b5","\\minuso"),Er("\\darr","\\downarrow"),Er("\\dArr","\\Downarrow"),Er("\\Darr","\\Downarrow"),Er("\\lang","\\langle"),Er("\\rang","\\rangle"),Er("\\uarr","\\uparrow"),Er("\\uArr","\\Uparrow"),Er("\\Uarr","\\Uparrow"),Er("\\N","\\mathbb{N}"),Er("\\R","\\mathbb{R}"),Er("\\Z","\\mathbb{Z}"),Er("\\alef","\\aleph"),Er("\\alefsym","\\aleph"),Er("\\Alpha","\\mathrm{A}"),Er("\\Beta","\\mathrm{B}"),Er("\\bull","\\bullet"),Er("\\Chi","\\mathrm{X}"),Er("\\clubs","\\clubsuit"),Er("\\cnums","\\mathbb{C}"),Er("\\Complex","\\mathbb{C}"),Er("\\Dagger","\\ddagger"),Er("\\diamonds","\\diamondsuit"),Er("\\empty","\\emptyset"),Er("\\Epsilon","\\mathrm{E}"),Er("\\Eta","\\mathrm{H}"),Er("\\exist","\\exists"),Er("\\harr","\\leftrightarrow"),Er("\\hArr","\\Leftrightarrow"),Er("\\Harr","\\Leftrightarrow"),Er("\\hearts","\\heartsuit"),Er("\\image","\\Im"),Er("\\infin","\\infty"),Er("\\Iota","\\mathrm{I}"),Er("\\isin","\\in"),Er("\\Kappa","\\mathrm{K}"),Er("\\larr","\\leftarrow"),Er("\\lArr","\\Leftarrow"),Er("\\Larr","\\Leftarrow"),Er("\\lrarr","\\leftrightarrow"),Er("\\lrArr","\\Leftrightarrow"),Er("\\Lrarr","\\Leftrightarrow"),Er("\\Mu","\\mathrm{M}"),Er("\\natnums","\\mathbb{N}"),Er("\\Nu","\\mathrm{N}"),Er("\\Omicron","\\mathrm{O}"),Er("\\plusmn","\\pm"),Er("\\rarr","\\rightarrow"),Er("\\rArr","\\Rightarrow"),Er("\\Rarr","\\Rightarrow"),Er("\\real","\\Re"),Er("\\reals","\\mathbb{R}"),Er("\\Reals","\\mathbb{R}"),Er("\\Rho","\\mathrm{P}"),Er("\\sdot","\\cdot"),Er("\\sect","\\S"),Er("\\spades","\\spadesuit"),Er("\\sub","\\subset"),Er("\\sube","\\subseteq"),Er("\\supe","\\supseteq"),Er("\\Tau","\\mathrm{T}"),Er("\\thetasym","\\vartheta"),Er("\\weierp","\\wp"),Er("\\Zeta","\\mathrm{Z}"),Er("\\argmin","\\DOTSB\\operatorname*{arg\\,min}"),Er("\\argmax","\\DOTSB\\operatorname*{arg\\,max}"),Er("\\plim","\\DOTSB\\mathop{\\operatorname{plim}}\\limits"),Er("\\bra","\\mathinner{\\langle{#1}|}"),Er("\\ket","\\mathinner{|{#1}\\rangle}"),Er("\\braket","\\mathinner{\\langle{#1}\\rangle}"),Er("\\Bra","\\left\\langle#1\\right|"),Er("\\Ket","\\left|#1\\right\\rangle"),Er("\\angln","{\\angl n}"),Er("\\blue","\\textcolor{##6495ed}{#1}"),Er("\\orange","\\textcolor{##ffa500}{#1}"),Er("\\pink","\\textcolor{##ff00af}{#1}"),Er("\\red","\\textcolor{##df0030}{#1}"),Er("\\green","\\textcolor{##28ae7b}{#1}"),Er("\\gray","\\textcolor{gray}{#1}"),Er("\\purple","\\textcolor{##9d38bd}{#1}"),Er("\\blueA","\\textcolor{##ccfaff}{#1}"),Er("\\blueB","\\textcolor{##80f6ff}{#1}"),Er("\\blueC","\\textcolor{##63d9ea}{#1}"),Er("\\blueD","\\textcolor{##11accd}{#1}"),Er("\\blueE","\\textcolor{##0c7f99}{#1}"),Er("\\tealA","\\textcolor{##94fff5}{#1}"),Er("\\tealB","\\textcolor{##26edd5}{#1}"),Er("\\tealC","\\textcolor{##01d1c1}{#1}"),Er("\\tealD","\\textcolor{##01a995}{#1}"),Er("\\tealE","\\textcolor{##208170}{#1}"),Er("\\greenA","\\textcolor{##b6ffb0}{#1}"),Er("\\greenB","\\textcolor{##8af281}{#1}"),Er("\\greenC","\\textcolor{##74cf70}{#1}"),Er("\\greenD","\\textcolor{##1fab54}{#1}"),Er("\\greenE","\\textcolor{##0d923f}{#1}"),Er("\\goldA","\\textcolor{##ffd0a9}{#1}"),Er("\\goldB","\\textcolor{##ffbb71}{#1}"),Er("\\goldC","\\textcolor{##ff9c39}{#1}"),Er("\\goldD","\\textcolor{##e07d10}{#1}"),Er("\\goldE","\\textcolor{##a75a05}{#1}"),Er("\\redA","\\textcolor{##fca9a9}{#1}"),Er("\\redB","\\textcolor{##ff8482}{#1}"),Er("\\redC","\\textcolor{##f9685d}{#1}"),Er("\\redD","\\textcolor{##e84d39}{#1}"),Er("\\redE","\\textcolor{##bc2612}{#1}"),Er("\\maroonA","\\textcolor{##ffbde0}{#1}"),Er("\\maroonB","\\textcolor{##ff92c6}{#1}"),Er("\\maroonC","\\textcolor{##ed5fa6}{#1}"),Er("\\maroonD","\\textcolor{##ca337c}{#1}"),Er("\\maroonE","\\textcolor{##9e034e}{#1}"),Er("\\purpleA","\\textcolor{##ddd7ff}{#1}"),Er("\\purpleB","\\textcolor{##c6b9fc}{#1}"),Er("\\purpleC","\\textcolor{##aa87ff}{#1}"),Er("\\purpleD","\\textcolor{##7854ab}{#1}"),Er("\\purpleE","\\textcolor{##543b78}{#1}"),Er("\\mintA","\\textcolor{##f5f9e8}{#1}"),Er("\\mintB","\\textcolor{##edf2df}{#1}"),Er("\\mintC","\\textcolor{##e0e5cc}{#1}"),Er("\\grayA","\\textcolor{##f6f7f7}{#1}"),Er("\\grayB","\\textcolor{##f0f1f2}{#1}"),Er("\\grayC","\\textcolor{##e3e5e6}{#1}"),Er("\\grayD","\\textcolor{##d6d8da}{#1}"),Er("\\grayE","\\textcolor{##babec2}{#1}"),Er("\\grayF","\\textcolor{##888d93}{#1}"),Er("\\grayG","\\textcolor{##626569}{#1}"),Er("\\grayH","\\textcolor{##3b3e40}{#1}"),Er("\\grayI","\\textcolor{##21242c}{#1}"),Er("\\kaBlue","\\textcolor{##314453}{#1}"),Er("\\kaGreen","\\textcolor{##71B307}{#1}");var Vn={"^":!0,_:!0,"\\limits":!0,"\\nolimits":!0},Gn=function(){function e(e,t,r){this.settings=void 0,this.expansionCount=void 0,this.lexer=void 0,this.macros=void 0,this.stack=void 0,this.mode=void 0,this.settings=t,this.expansionCount=0,this.feed(e),this.macros=new On(Hn,t.macros),this.mode=r,this.stack=[]}var t=e.prototype;return t.feed=function(e){this.lexer=new Rn(e,this.settings)},t.switchMode=function(e){this.mode=e},t.beginGroup=function(){this.macros.beginGroup()},t.endGroup=function(){this.macros.endGroup()},t.endGroups=function(){this.macros.endGroups()},t.future=function(){return 0===this.stack.length&&this.pushToken(this.lexer.lex()),this.stack[this.stack.length-1]},t.popToken=function(){return this.future(),this.stack.pop()},t.pushToken=function(e){this.stack.push(e)},t.pushTokens=function(e){var t;(t=this.stack).push.apply(t,e)},t.scanArgument=function(e){var t,r,n;if(e){if(this.consumeSpaces(),"["!==this.future().text)return null;t=this.popToken();var a=this.consumeArg(["]"]);n=a.tokens,r=a.end}else{var i=this.consumeArg();n=i.tokens,t=i.start,r=i.end}return this.pushToken(new Dr("EOF",r.loc)),this.pushTokens(n),t.range(r,"")},t.consumeSpaces=function(){for(;;){if(" "!==this.future().text)break;this.stack.pop()}},t.consumeArg=function(e){var t=[],r=e&&e.length>0;r||this.consumeSpaces();var a,i=this.future(),o=0,s=0;do{if(a=this.popToken(),t.push(a),"{"===a.text)++o;else if("}"===a.text){if(-1===--o)throw new n("Extra }",a)}else if("EOF"===a.text)throw new n("Unexpected end of input in a macro argument, expected '"+(e&&r?e[s]:"}")+"'",a);if(e&&r)if((0===o||1===o&&"{"===e[s])&&a.text===e[s]){if(++s===e.length){t.splice(-s,s);break}}else s=0}while(0!==o||r);return"{"===i.text&&"}"===t[t.length-1].text&&(t.pop(),t.shift()),t.reverse(),{tokens:t,start:i,end:a}},t.consumeArgs=function(e,t){if(t){if(t.length!==e+1)throw new n("The length of delimiters doesn't match the number of args!");for(var r=t[0],a=0;athis.settings.maxExpand)throw new n("Too many expansions: infinite loop or need to increase maxExpand setting");var i=a.tokens,o=this.consumeArgs(a.numArgs,a.delimiters);if(a.numArgs)for(var s=(i=i.slice()).length-1;s>=0;--s){var l=i[s];if("#"===l.text){if(0===s)throw new n("Incomplete placeholder at end of macro body",l);if("#"===(l=i[--s]).text)i.splice(s+1,1);else{if(!/^[1-9]$/.test(l.text))throw new n("Not a valid argument number",l);var h;(h=i).splice.apply(h,[s,2].concat(o[+l.text-1]))}}}return this.pushTokens(i),i},t.expandAfterFuture=function(){return this.expandOnce(),this.future()},t.expandNextToken=function(){for(;;){var e=this.expandOnce();if(e instanceof Dr)return e.treatAsRelax&&(e.text="\\relax"),this.stack.pop()}throw new Error},t.expandMacro=function(e){return this.macros.has(e)?this.expandTokens([new Dr(e)]):void 0},t.expandTokens=function(e){var t=[],r=this.stack.length;for(this.pushTokens(e);this.stack.length>r;){var n=this.expandOnce(!0);n instanceof Dr&&(n.treatAsRelax&&(n.noexpand=!1,n.treatAsRelax=!1),t.push(this.stack.pop()))}return t},t.expandMacroAsText=function(e){var t=this.expandMacro(e);return t?t.map((function(e){return e.text})).join(""):t},t._getExpansion=function(e){var t=this.macros.get(e);if(null==t)return t;if(1===e.length){var r=this.lexer.catcodes[e];if(null!=r&&13!==r)return}var n="function"==typeof t?t(this):t;if("string"==typeof n){var a=0;if(-1!==n.indexOf("#"))for(var i=n.replace(/##/g,"");-1!==i.indexOf("#"+(a+1));)++a;for(var o=new Rn(n,this.settings),s=[],l=o.lex();"EOF"!==l.text;)s.push(l),l=o.lex();return s.reverse(),{tokens:s,numArgs:a}}return n},t.isDefined=function(e){return this.macros.has(e)||Nn.hasOwnProperty(e)||ae.math.hasOwnProperty(e)||ae.text.hasOwnProperty(e)||Vn.hasOwnProperty(e)},t.isExpandable=function(e){var t=this.macros.get(e);return null!=t?"string"==typeof t||"function"==typeof t||!t.unexpandable:Nn.hasOwnProperty(e)&&!Nn[e].primitive},e}(),Un={"\u0301":{text:"\\'",math:"\\acute"},"\u0300":{text:"\\`",math:"\\grave"},"\u0308":{text:'\\"',math:"\\ddot"},"\u0303":{text:"\\~",math:"\\tilde"},"\u0304":{text:"\\=",math:"\\bar"},"\u0306":{text:"\\u",math:"\\breve"},"\u030c":{text:"\\v",math:"\\check"},"\u0302":{text:"\\^",math:"\\hat"},"\u0307":{text:"\\.",math:"\\dot"},"\u030a":{text:"\\r",math:"\\mathring"},"\u030b":{text:"\\H"},"\u0327":{text:"\\c"}},Yn={"\xe1":"a\u0301","\xe0":"a\u0300","\xe4":"a\u0308","\u01df":"a\u0308\u0304","\xe3":"a\u0303","\u0101":"a\u0304","\u0103":"a\u0306","\u1eaf":"a\u0306\u0301","\u1eb1":"a\u0306\u0300","\u1eb5":"a\u0306\u0303","\u01ce":"a\u030c","\xe2":"a\u0302","\u1ea5":"a\u0302\u0301","\u1ea7":"a\u0302\u0300","\u1eab":"a\u0302\u0303","\u0227":"a\u0307","\u01e1":"a\u0307\u0304","\xe5":"a\u030a","\u01fb":"a\u030a\u0301","\u1e03":"b\u0307","\u0107":"c\u0301","\u1e09":"c\u0327\u0301","\u010d":"c\u030c","\u0109":"c\u0302","\u010b":"c\u0307","\xe7":"c\u0327","\u010f":"d\u030c","\u1e0b":"d\u0307","\u1e11":"d\u0327","\xe9":"e\u0301","\xe8":"e\u0300","\xeb":"e\u0308","\u1ebd":"e\u0303","\u0113":"e\u0304","\u1e17":"e\u0304\u0301","\u1e15":"e\u0304\u0300","\u0115":"e\u0306","\u1e1d":"e\u0327\u0306","\u011b":"e\u030c","\xea":"e\u0302","\u1ebf":"e\u0302\u0301","\u1ec1":"e\u0302\u0300","\u1ec5":"e\u0302\u0303","\u0117":"e\u0307","\u0229":"e\u0327","\u1e1f":"f\u0307","\u01f5":"g\u0301","\u1e21":"g\u0304","\u011f":"g\u0306","\u01e7":"g\u030c","\u011d":"g\u0302","\u0121":"g\u0307","\u0123":"g\u0327","\u1e27":"h\u0308","\u021f":"h\u030c","\u0125":"h\u0302","\u1e23":"h\u0307","\u1e29":"h\u0327","\xed":"i\u0301","\xec":"i\u0300","\xef":"i\u0308","\u1e2f":"i\u0308\u0301","\u0129":"i\u0303","\u012b":"i\u0304","\u012d":"i\u0306","\u01d0":"i\u030c","\xee":"i\u0302","\u01f0":"j\u030c","\u0135":"j\u0302","\u1e31":"k\u0301","\u01e9":"k\u030c","\u0137":"k\u0327","\u013a":"l\u0301","\u013e":"l\u030c","\u013c":"l\u0327","\u1e3f":"m\u0301","\u1e41":"m\u0307","\u0144":"n\u0301","\u01f9":"n\u0300","\xf1":"n\u0303","\u0148":"n\u030c","\u1e45":"n\u0307","\u0146":"n\u0327","\xf3":"o\u0301","\xf2":"o\u0300","\xf6":"o\u0308","\u022b":"o\u0308\u0304","\xf5":"o\u0303","\u1e4d":"o\u0303\u0301","\u1e4f":"o\u0303\u0308","\u022d":"o\u0303\u0304","\u014d":"o\u0304","\u1e53":"o\u0304\u0301","\u1e51":"o\u0304\u0300","\u014f":"o\u0306","\u01d2":"o\u030c","\xf4":"o\u0302","\u1ed1":"o\u0302\u0301","\u1ed3":"o\u0302\u0300","\u1ed7":"o\u0302\u0303","\u022f":"o\u0307","\u0231":"o\u0307\u0304","\u0151":"o\u030b","\u1e55":"p\u0301","\u1e57":"p\u0307","\u0155":"r\u0301","\u0159":"r\u030c","\u1e59":"r\u0307","\u0157":"r\u0327","\u015b":"s\u0301","\u1e65":"s\u0301\u0307","\u0161":"s\u030c","\u1e67":"s\u030c\u0307","\u015d":"s\u0302","\u1e61":"s\u0307","\u015f":"s\u0327","\u1e97":"t\u0308","\u0165":"t\u030c","\u1e6b":"t\u0307","\u0163":"t\u0327","\xfa":"u\u0301","\xf9":"u\u0300","\xfc":"u\u0308","\u01d8":"u\u0308\u0301","\u01dc":"u\u0308\u0300","\u01d6":"u\u0308\u0304","\u01da":"u\u0308\u030c","\u0169":"u\u0303","\u1e79":"u\u0303\u0301","\u016b":"u\u0304","\u1e7b":"u\u0304\u0308","\u016d":"u\u0306","\u01d4":"u\u030c","\xfb":"u\u0302","\u016f":"u\u030a","\u0171":"u\u030b","\u1e7d":"v\u0303","\u1e83":"w\u0301","\u1e81":"w\u0300","\u1e85":"w\u0308","\u0175":"w\u0302","\u1e87":"w\u0307","\u1e98":"w\u030a","\u1e8d":"x\u0308","\u1e8b":"x\u0307","\xfd":"y\u0301","\u1ef3":"y\u0300","\xff":"y\u0308","\u1ef9":"y\u0303","\u0233":"y\u0304","\u0177":"y\u0302","\u1e8f":"y\u0307","\u1e99":"y\u030a","\u017a":"z\u0301","\u017e":"z\u030c","\u1e91":"z\u0302","\u017c":"z\u0307","\xc1":"A\u0301","\xc0":"A\u0300","\xc4":"A\u0308","\u01de":"A\u0308\u0304","\xc3":"A\u0303","\u0100":"A\u0304","\u0102":"A\u0306","\u1eae":"A\u0306\u0301","\u1eb0":"A\u0306\u0300","\u1eb4":"A\u0306\u0303","\u01cd":"A\u030c","\xc2":"A\u0302","\u1ea4":"A\u0302\u0301","\u1ea6":"A\u0302\u0300","\u1eaa":"A\u0302\u0303","\u0226":"A\u0307","\u01e0":"A\u0307\u0304","\xc5":"A\u030a","\u01fa":"A\u030a\u0301","\u1e02":"B\u0307","\u0106":"C\u0301","\u1e08":"C\u0327\u0301","\u010c":"C\u030c","\u0108":"C\u0302","\u010a":"C\u0307","\xc7":"C\u0327","\u010e":"D\u030c","\u1e0a":"D\u0307","\u1e10":"D\u0327","\xc9":"E\u0301","\xc8":"E\u0300","\xcb":"E\u0308","\u1ebc":"E\u0303","\u0112":"E\u0304","\u1e16":"E\u0304\u0301","\u1e14":"E\u0304\u0300","\u0114":"E\u0306","\u1e1c":"E\u0327\u0306","\u011a":"E\u030c","\xca":"E\u0302","\u1ebe":"E\u0302\u0301","\u1ec0":"E\u0302\u0300","\u1ec4":"E\u0302\u0303","\u0116":"E\u0307","\u0228":"E\u0327","\u1e1e":"F\u0307","\u01f4":"G\u0301","\u1e20":"G\u0304","\u011e":"G\u0306","\u01e6":"G\u030c","\u011c":"G\u0302","\u0120":"G\u0307","\u0122":"G\u0327","\u1e26":"H\u0308","\u021e":"H\u030c","\u0124":"H\u0302","\u1e22":"H\u0307","\u1e28":"H\u0327","\xcd":"I\u0301","\xcc":"I\u0300","\xcf":"I\u0308","\u1e2e":"I\u0308\u0301","\u0128":"I\u0303","\u012a":"I\u0304","\u012c":"I\u0306","\u01cf":"I\u030c","\xce":"I\u0302","\u0130":"I\u0307","\u0134":"J\u0302","\u1e30":"K\u0301","\u01e8":"K\u030c","\u0136":"K\u0327","\u0139":"L\u0301","\u013d":"L\u030c","\u013b":"L\u0327","\u1e3e":"M\u0301","\u1e40":"M\u0307","\u0143":"N\u0301","\u01f8":"N\u0300","\xd1":"N\u0303","\u0147":"N\u030c","\u1e44":"N\u0307","\u0145":"N\u0327","\xd3":"O\u0301","\xd2":"O\u0300","\xd6":"O\u0308","\u022a":"O\u0308\u0304","\xd5":"O\u0303","\u1e4c":"O\u0303\u0301","\u1e4e":"O\u0303\u0308","\u022c":"O\u0303\u0304","\u014c":"O\u0304","\u1e52":"O\u0304\u0301","\u1e50":"O\u0304\u0300","\u014e":"O\u0306","\u01d1":"O\u030c","\xd4":"O\u0302","\u1ed0":"O\u0302\u0301","\u1ed2":"O\u0302\u0300","\u1ed6":"O\u0302\u0303","\u022e":"O\u0307","\u0230":"O\u0307\u0304","\u0150":"O\u030b","\u1e54":"P\u0301","\u1e56":"P\u0307","\u0154":"R\u0301","\u0158":"R\u030c","\u1e58":"R\u0307","\u0156":"R\u0327","\u015a":"S\u0301","\u1e64":"S\u0301\u0307","\u0160":"S\u030c","\u1e66":"S\u030c\u0307","\u015c":"S\u0302","\u1e60":"S\u0307","\u015e":"S\u0327","\u0164":"T\u030c","\u1e6a":"T\u0307","\u0162":"T\u0327","\xda":"U\u0301","\xd9":"U\u0300","\xdc":"U\u0308","\u01d7":"U\u0308\u0301","\u01db":"U\u0308\u0300","\u01d5":"U\u0308\u0304","\u01d9":"U\u0308\u030c","\u0168":"U\u0303","\u1e78":"U\u0303\u0301","\u016a":"U\u0304","\u1e7a":"U\u0304\u0308","\u016c":"U\u0306","\u01d3":"U\u030c","\xdb":"U\u0302","\u016e":"U\u030a","\u0170":"U\u030b","\u1e7c":"V\u0303","\u1e82":"W\u0301","\u1e80":"W\u0300","\u1e84":"W\u0308","\u0174":"W\u0302","\u1e86":"W\u0307","\u1e8c":"X\u0308","\u1e8a":"X\u0307","\xdd":"Y\u0301","\u1ef2":"Y\u0300","\u0178":"Y\u0308","\u1ef8":"Y\u0303","\u0232":"Y\u0304","\u0176":"Y\u0302","\u1e8e":"Y\u0307","\u0179":"Z\u0301","\u017d":"Z\u030c","\u1e90":"Z\u0302","\u017b":"Z\u0307","\u03ac":"\u03b1\u0301","\u1f70":"\u03b1\u0300","\u1fb1":"\u03b1\u0304","\u1fb0":"\u03b1\u0306","\u03ad":"\u03b5\u0301","\u1f72":"\u03b5\u0300","\u03ae":"\u03b7\u0301","\u1f74":"\u03b7\u0300","\u03af":"\u03b9\u0301","\u1f76":"\u03b9\u0300","\u03ca":"\u03b9\u0308","\u0390":"\u03b9\u0308\u0301","\u1fd2":"\u03b9\u0308\u0300","\u1fd1":"\u03b9\u0304","\u1fd0":"\u03b9\u0306","\u03cc":"\u03bf\u0301","\u1f78":"\u03bf\u0300","\u03cd":"\u03c5\u0301","\u1f7a":"\u03c5\u0300","\u03cb":"\u03c5\u0308","\u03b0":"\u03c5\u0308\u0301","\u1fe2":"\u03c5\u0308\u0300","\u1fe1":"\u03c5\u0304","\u1fe0":"\u03c5\u0306","\u03ce":"\u03c9\u0301","\u1f7c":"\u03c9\u0300","\u038e":"\u03a5\u0301","\u1fea":"\u03a5\u0300","\u03ab":"\u03a5\u0308","\u1fe9":"\u03a5\u0304","\u1fe8":"\u03a5\u0306","\u038f":"\u03a9\u0301","\u1ffa":"\u03a9\u0300"},Xn=function(){function e(e,t){this.mode=void 0,this.gullet=void 0,this.settings=void 0,this.leftrightDepth=void 0,this.nextToken=void 0,this.mode="math",this.gullet=new Gn(e,t,this.mode),this.settings=t,this.leftrightDepth=0}var t=e.prototype;return t.expect=function(e,t){if(void 0===t&&(t=!0),this.fetch().text!==e)throw new n("Expected '"+e+"', got '"+this.fetch().text+"'",this.fetch());t&&this.consume()},t.consume=function(){this.nextToken=null},t.fetch=function(){return null==this.nextToken&&(this.nextToken=this.gullet.expandNextToken()),this.nextToken},t.switchMode=function(e){this.mode=e,this.gullet.switchMode(e)},t.parse=function(){this.settings.globalGroup||this.gullet.beginGroup(),this.settings.colorIsTextColor&&this.gullet.macros.set("\\color","\\textcolor");try{var e=this.parseExpression(!1);return this.expect("EOF"),this.settings.globalGroup||this.gullet.endGroup(),e}finally{this.gullet.endGroups()}},t.subparse=function(e){var t=this.nextToken;this.consume(),this.gullet.pushToken(new Dr("}")),this.gullet.pushTokens(e);var r=this.parseExpression(!1);return this.expect("}"),this.nextToken=t,r},t.parseExpression=function(t,r){for(var n=[];;){"math"===this.mode&&this.consumeSpaces();var a=this.fetch();if(-1!==e.endOfExpression.indexOf(a.text))break;if(r&&a.text===r)break;if(t&&Nn[a.text]&&Nn[a.text].infix)break;var i=this.parseAtom(r);if(!i)break;"internal"!==i.type&&n.push(i)}return"text"===this.mode&&this.formLigatures(n),this.handleInfixNodes(n)},t.handleInfixNodes=function(e){for(var t,r=-1,a=0;a=0&&this.settings.reportNonstrict("unicodeTextInMathMode",'Latin-1/Unicode text character "'+t[0]+'" used in math mode',e);var s,l=ae[this.mode][t].group,h=Lr.range(e);if(te.hasOwnProperty(l)){var m=l;s={type:"atom",mode:this.mode,family:m,loc:h,text:t}}else s={type:l,mode:this.mode,loc:h,text:t};i=s}else{if(!(t.charCodeAt(0)>=128))return null;this.settings.strict&&(S(t.charCodeAt(0))?"math"===this.mode&&this.settings.reportNonstrict("unicodeTextInMathMode",'Unicode text character "'+t[0]+'" used in math mode',e):this.settings.reportNonstrict("unknownSymbol",'Unrecognized Unicode character "'+t[0]+'" ('+t.charCodeAt(0)+")",e)),i={type:"textord",mode:"text",loc:Lr.range(e),text:t}}if(this.consume(),o)for(var c=0;c +Background_thread (nanoev-picos.Nanoev_picos.Background_thread)

    Module Nanoev_picos.Background_thread

    val setup : Nanoev.t -> unit

    Install this event loop in a background thread

    val shutdown : unit -> unit

    Shutdown background thread, assuming is_setup returns true

    val with_setup : Nanoev.t -> (unit -> 'a) -> 'a
    val is_setup : unit -> bool

    is_setup() is true iff a background thread is running a nanoev loop

    diff --git a/nanoev-picos/Nanoev_picos/Base/Raw/index.html b/nanoev-picos/Nanoev_picos/Base/Raw/index.html new file mode 100644 index 0000000..c8b69d5 --- /dev/null +++ b/nanoev-picos/Nanoev_picos/Base/Raw/index.html @@ -0,0 +1,2 @@ + +Raw (nanoev-picos.Nanoev_picos.Base.Raw)

    Module Base.Raw

    val retry_read : Unix.file_descr -> (unit -> 'a) -> 'a
    val retry_write : Unix.file_descr -> (unit -> 'a) -> 'a
    diff --git a/nanoev-picos/Nanoev_picos/Base/index.html b/nanoev-picos/Nanoev_picos/Base/index.html new file mode 100644 index 0000000..c5ad37f --- /dev/null +++ b/nanoev-picos/Nanoev_picos/Base/index.html @@ -0,0 +1,2 @@ + +Base (nanoev-picos.Nanoev_picos.Base)

    Module Nanoev_picos.Base

    val read : Unix.file_descr -> bytes -> int -> int -> int

    Read from the non blocking FD.

    val write_once : Unix.file_descr -> bytes -> int -> int -> int

    Write into the non blocking FD.

    val write : Unix.file_descr -> bytes -> int -> int -> unit
    val close : Unix.file_descr -> unit

    Close the file descriptor

    val connect : Unix.file_descr -> Unix.sockaddr -> unit

    Connect this FD to the remote address.

    Accept a connection on this fd.

    val max_fds : unit -> int

    Maximum number of file descriptors one can await on. See Nanoev.max_fds

    val sleep : float -> unit

    Suspend current fiber for n seconds

    module Raw : sig ... end
    diff --git a/nanoev-picos/Nanoev_picos/Global_ev/index.html b/nanoev-picos/Nanoev_picos/Global_ev/index.html new file mode 100644 index 0000000..b770b98 --- /dev/null +++ b/nanoev-picos/Nanoev_picos/Global_ev/index.html @@ -0,0 +1,2 @@ + +Global_ev (nanoev-picos.Nanoev_picos.Global_ev)

    Module Nanoev_picos.Global_ev

    Global loop.

    val with_lock : Stdlib.Mutex.t -> (unit -> 'a) -> 'a
    val bg_thread_ : active:bool Stdlib.Atomic.t -> evloop:Nanoev.t -> unit -> unit
    val get_nanoev : unit -> Nanoev.t option
    val get_nanoev_exn : unit -> Nanoev.t
    val has_bg_thread : unit -> bool
    val setup_bg_thread : Nanoev.t -> unit
    val shutdown_bg_thread : unit -> unit
    diff --git a/nanoev-picos/Nanoev_picos/IO_in/class-type-t/index.html b/nanoev-picos/Nanoev_picos/IO_in/class-type-t/index.html new file mode 100644 index 0000000..0a1a4a1 --- /dev/null +++ b/nanoev-picos/Nanoev_picos/IO_in/class-type-t/index.html @@ -0,0 +1,2 @@ + +t (nanoev-picos.Nanoev_picos.IO_in.t)

    Class type IO_in.t

    method input : bytes -> int -> int -> int

    Read into the slice. Returns 0 only if the stream is closed.

    method close : unit -> unit

    Close the input. Must be idempotent.

    diff --git a/nanoev-picos/Nanoev_picos/IO_in/index.html b/nanoev-picos/Nanoev_picos/IO_in/index.html new file mode 100644 index 0000000..84ab11a --- /dev/null +++ b/nanoev-picos/Nanoev_picos/IO_in/index.html @@ -0,0 +1,6 @@ + +IO_in (nanoev-picos.Nanoev_picos.IO_in)

    Module Nanoev_picos.IO_in

    class type t = object ... end
    val create : + ?close:(unit -> unit) -> + input:(bytes -> int -> int -> int) -> + unit -> + t
    val empty : t
    val of_bytes : ?off:int -> ?len:int -> bytes -> t
    val of_string : ?off:int -> ?len:int -> string -> t
    val input : t -> bytes -> int -> int -> int

    Read into the given slice.

    • returns

      the number of bytes read, 0 means end of input.

    val close : < close : unit -> unit.. > -> unit

    Close the channel.

    val really_input : t -> bytes -> int -> int -> unit
    val really_input_string : t -> int -> string
    val copy_into : ?buf:bytes -> t -> IO_out.t -> unit
    val concat : t list -> t
    val input_all : ?buf:bytes -> t -> string
    val of_unix_fd : ?close_noerr:bool -> ?buf:bytes -> Unix.file_descr -> t
    diff --git a/nanoev-picos/Nanoev_picos/IO_out/class-type-t/index.html b/nanoev-picos/Nanoev_picos/IO_out/class-type-t/index.html new file mode 100644 index 0000000..25a964a --- /dev/null +++ b/nanoev-picos/Nanoev_picos/IO_out/class-type-t/index.html @@ -0,0 +1,2 @@ + +t (nanoev-picos.Nanoev_picos.IO_out.t)

    Class type IO_out.t

    method output_char : char -> unit
    method output : bytes -> int -> int -> unit
    method flush : unit -> unit
    method close : unit -> unit
    diff --git a/nanoev-picos/Nanoev_picos/IO_out/index.html b/nanoev-picos/Nanoev_picos/IO_out/index.html new file mode 100644 index 0000000..c58a133 --- /dev/null +++ b/nanoev-picos/Nanoev_picos/IO_out/index.html @@ -0,0 +1,8 @@ + +IO_out (nanoev-picos.Nanoev_picos.IO_out)

    Module Nanoev_picos.IO_out

    class type t = object ... end
    val create : + ?flush:(unit -> unit) -> + ?close:(unit -> unit) -> + output_char:(char -> unit) -> + output:(bytes -> int -> int -> unit) -> + unit -> + t
    val dummy : t
    val of_unix_fd : ?close_noerr:bool -> ?buf:bytes -> Unix.file_descr -> t
    val of_buffer : Stdlib.Buffer.t -> t
    val output_char : t -> char -> unit

    Output the buffer slice into this channel

    val output : t -> bytes -> int -> int -> unit

    Output the buffer slice into this channel

    val output_string : t -> string -> unit
    val output_line : t -> string -> unit
    val close : < close : unit -> unit.. > -> unit

    Close the channel.

    val flush : < flush : unit -> unit.. > -> unit

    Flush (ie. force write) any buffered bytes.

    val output_int : t -> int -> unit
    val output_lines : t -> string Stdlib.Seq.t -> unit
    val tee : t list -> t
    diff --git a/nanoev-picos/Nanoev_picos/Net_client/index.html b/nanoev-picos/Nanoev_picos/Net_client/index.html new file mode 100644 index 0000000..b25bd30 --- /dev/null +++ b/nanoev-picos/Nanoev_picos/Net_client/index.html @@ -0,0 +1,2 @@ + +Net_client (nanoev-picos.Nanoev_picos.Net_client)

    Module Nanoev_picos.Net_client

    val with_connect : Unix.sockaddr -> (IO_in.t -> IO_out.t -> 'a) -> 'a
    diff --git a/nanoev-picos/Nanoev_picos/Net_server/index.html b/nanoev-picos/Nanoev_picos/Net_server/index.html new file mode 100644 index 0000000..a2f6b25 --- /dev/null +++ b/nanoev-picos/Nanoev_picos/Net_server/index.html @@ -0,0 +1,17 @@ + +Net_server (nanoev-picos.Nanoev_picos.Net_server)

    Module Nanoev_picos.Net_server

    type client_handler = Unix.sockaddr -> IO_in.t -> IO_out.t -> unit
    type t
    val join : t -> unit

    Wait for server to shutdown

    val shutdown : t -> unit

    Ask the server to stop

    val running : t -> bool
    val max_connections : t -> int
    val n_active_connections : t -> int
    val establish : + ?backlog:int -> + ?max_connections:int -> + ?exn_handler:(exn -> Stdlib.Printexc.raw_backtrace -> unit) -> + spawn:((unit -> unit) -> unit Picos.Computation.t) -> + client_handler:client_handler -> + Unix.sockaddr -> + t

    Create and start a new server on the given socket address.

    • parameter spawn

      used to spawn a new computation per client

    • parameter client_handler

      the logic for talking to a client, will run in its own computation

    • parameter backlog

      number of connections waiting in the listening socket

    • parameter max_connections

      max number of simultaneous connections

    val with_ : + ?backlog:int -> + ?max_connections:int -> + ?exn_handler:(exn -> Stdlib.Printexc.raw_backtrace -> unit) -> + spawn:((unit -> unit) -> unit Picos.Computation.t) -> + client_handler:client_handler -> + Unix.sockaddr -> + (t -> 'a) -> + 'a
    diff --git a/nanoev-picos/Nanoev_picos/index.html b/nanoev-picos/Nanoev_picos/index.html new file mode 100644 index 0000000..167003c --- /dev/null +++ b/nanoev-picos/Nanoev_picos/index.html @@ -0,0 +1,2 @@ + +Nanoev_picos (nanoev-picos.Nanoev_picos)

    Module Nanoev_picos

    Basic interface with picos

    module Background_thread : sig ... end
    module Global_ev : sig ... end

    Global loop.

    Non blocking IO primitives

    module Base : sig ... end
    include module type of struct include Base end
    val read : Unix.file_descr -> bytes -> int -> int -> int

    Read from the non blocking FD.

    val write_once : Unix.file_descr -> bytes -> int -> int -> int

    Write into the non blocking FD.

    val write : Unix.file_descr -> bytes -> int -> int -> unit
    val close : Unix.file_descr -> unit

    Close the file descriptor

    val connect : Unix.file_descr -> Unix.sockaddr -> unit

    Connect this FD to the remote address.

    Accept a connection on this fd.

    val max_fds : unit -> int

    Maximum number of file descriptors one can await on. See Nanoev.max_fds

    val sleep : float -> unit

    Suspend current fiber for n seconds

    module Raw = Base.Raw

    Building blocks on top of Base

    module IO_in : sig ... end
    module IO_out : sig ... end
    module Net_client : sig ... end
    module Net_server : sig ... end
    diff --git a/nanoev-picos/Nanoev_picos__/index.html b/nanoev-picos/Nanoev_picos__/index.html new file mode 100644 index 0000000..62c63e7 --- /dev/null +++ b/nanoev-picos/Nanoev_picos__/index.html @@ -0,0 +1,2 @@ + +Nanoev_picos__ (nanoev-picos.Nanoev_picos__)

    Module Nanoev_picos__

    This module is hidden.

    diff --git a/nanoev-picos/Nanoev_picos__Background_thread/index.html b/nanoev-picos/Nanoev_picos__Background_thread/index.html new file mode 100644 index 0000000..7676661 --- /dev/null +++ b/nanoev-picos/Nanoev_picos__Background_thread/index.html @@ -0,0 +1,2 @@ + +Nanoev_picos__Background_thread (nanoev-picos.Nanoev_picos__Background_thread)

    Module Nanoev_picos__Background_thread

    This module is hidden.

    diff --git a/nanoev-picos/Nanoev_picos__Base/index.html b/nanoev-picos/Nanoev_picos__Base/index.html new file mode 100644 index 0000000..a497d10 --- /dev/null +++ b/nanoev-picos/Nanoev_picos__Base/index.html @@ -0,0 +1,2 @@ + +Nanoev_picos__Base (nanoev-picos.Nanoev_picos__Base)

    Module Nanoev_picos__Base

    This module is hidden.

    diff --git a/nanoev-picos/Nanoev_picos__Common_/index.html b/nanoev-picos/Nanoev_picos__Common_/index.html new file mode 100644 index 0000000..4b8cb29 --- /dev/null +++ b/nanoev-picos/Nanoev_picos__Common_/index.html @@ -0,0 +1,2 @@ + +Nanoev_picos__Common_ (nanoev-picos.Nanoev_picos__Common_)

    Module Nanoev_picos__Common_

    This module is hidden.

    diff --git a/nanoev-picos/Nanoev_picos__Global_ev/index.html b/nanoev-picos/Nanoev_picos__Global_ev/index.html new file mode 100644 index 0000000..365d3a3 --- /dev/null +++ b/nanoev-picos/Nanoev_picos__Global_ev/index.html @@ -0,0 +1,2 @@ + +Nanoev_picos__Global_ev (nanoev-picos.Nanoev_picos__Global_ev)

    Module Nanoev_picos__Global_ev

    This module is hidden.

    diff --git a/nanoev-picos/Nanoev_picos__IO_in/index.html b/nanoev-picos/Nanoev_picos__IO_in/index.html new file mode 100644 index 0000000..4450c48 --- /dev/null +++ b/nanoev-picos/Nanoev_picos__IO_in/index.html @@ -0,0 +1,2 @@ + +Nanoev_picos__IO_in (nanoev-picos.Nanoev_picos__IO_in)

    Module Nanoev_picos__IO_in

    This module is hidden.

    diff --git a/nanoev-picos/Nanoev_picos__IO_out/index.html b/nanoev-picos/Nanoev_picos__IO_out/index.html new file mode 100644 index 0000000..bedb4b4 --- /dev/null +++ b/nanoev-picos/Nanoev_picos__IO_out/index.html @@ -0,0 +1,2 @@ + +Nanoev_picos__IO_out (nanoev-picos.Nanoev_picos__IO_out)

    Module Nanoev_picos__IO_out

    This module is hidden.

    diff --git a/nanoev-picos/Nanoev_picos__Net_client/index.html b/nanoev-picos/Nanoev_picos__Net_client/index.html new file mode 100644 index 0000000..26828a2 --- /dev/null +++ b/nanoev-picos/Nanoev_picos__Net_client/index.html @@ -0,0 +1,2 @@ + +Nanoev_picos__Net_client (nanoev-picos.Nanoev_picos__Net_client)

    Module Nanoev_picos__Net_client

    This module is hidden.

    diff --git a/nanoev-picos/Nanoev_picos__Net_server/index.html b/nanoev-picos/Nanoev_picos__Net_server/index.html new file mode 100644 index 0000000..61e2423 --- /dev/null +++ b/nanoev-picos/Nanoev_picos__Net_server/index.html @@ -0,0 +1,2 @@ + +Nanoev_picos__Net_server (nanoev-picos.Nanoev_picos__Net_server)

    Module Nanoev_picos__Net_server

    This module is hidden.

    diff --git a/nanoev-picos/_doc-dir/README.md b/nanoev-picos/_doc-dir/README.md new file mode 100644 index 0000000..3c391ee --- /dev/null +++ b/nanoev-picos/_doc-dir/README.md @@ -0,0 +1,34 @@ +# nanoev + +A minimalistic but modular abstraction for IO event loops. + +The goal of this library is to provide a uniform abstraction over multiple +system event loops, in a way that plays well with Picos. + +## Usage + +Very basic usage would look like this: + +```ocaml +module EV = Nanoev_picos + + +let () = + (* use a backend, eg. select *) + let ev = Nanoev_unix.create () in + + (* install the backend *) + Nanoev_picos.setup_bg_thread ev; + + (* setup a picos scheduler and use EV.read, EV.write, etc. *) + … +``` + + +## Backends + +- [x] select +- [x] poll/ppoll +- [ ] epoll +- [ ] kqueue +- [ ] uring diff --git a/nanoev-picos/index.html b/nanoev-picos/index.html new file mode 100644 index 0000000..a595af9 --- /dev/null +++ b/nanoev-picos/index.html @@ -0,0 +1,2 @@ + +index (nanoev-picos.index)

    Package nanoev-picos

    Package info

    readme-files
    diff --git a/nanoev-posix/Nanoev_posix/index.html b/nanoev-posix/Nanoev_posix/index.html new file mode 100644 index 0000000..7c2dcbe --- /dev/null +++ b/nanoev-posix/Nanoev_posix/index.html @@ -0,0 +1,14 @@ + +Nanoev_posix (nanoev-posix.Nanoev_posix)

    Module Nanoev_posix

    Nano event loop using Poll/Ppoll

    include module type of struct include Nanoev end
    type t = Nanoev.t
    exception Closed
    module Impl = Nanoev.Impl
    val clear : t -> unit

    Reset the state

    val wakeup_from_outside : t -> unit
    val step : t -> unit

    Run one step of the event loop until something happens

    val close : t -> Unix.file_descr -> unit

    Close the file descriptor and clean it up

    val max_fds : t -> int

    Maximum number of file descriptors that can be observed at once.

    val on_readable : + t -> + Unix.file_descr -> + 'a -> + 'b -> + (closed:bool -> 'a -> 'b -> unit) -> + unit
    val on_writable : + t -> + Unix.file_descr -> + 'a -> + 'b -> + (closed:bool -> 'a -> 'b -> unit) -> + unit
    val run_after_s : t -> float -> 'a -> 'b -> ('a -> 'b -> unit) -> unit
    val create : unit -> t

    Create a new nanoev loop using Iomux (poll/ppoll).

    diff --git a/nanoev-posix/Nanoev_posix__/index.html b/nanoev-posix/Nanoev_posix__/index.html new file mode 100644 index 0000000..dd99336 --- /dev/null +++ b/nanoev-posix/Nanoev_posix__/index.html @@ -0,0 +1,2 @@ + +Nanoev_posix__ (nanoev-posix.Nanoev_posix__)

    Module Nanoev_posix__

    This module is hidden.

    diff --git a/nanoev-posix/_doc-dir/README.md b/nanoev-posix/_doc-dir/README.md new file mode 100644 index 0000000..3c391ee --- /dev/null +++ b/nanoev-posix/_doc-dir/README.md @@ -0,0 +1,34 @@ +# nanoev + +A minimalistic but modular abstraction for IO event loops. + +The goal of this library is to provide a uniform abstraction over multiple +system event loops, in a way that plays well with Picos. + +## Usage + +Very basic usage would look like this: + +```ocaml +module EV = Nanoev_picos + + +let () = + (* use a backend, eg. select *) + let ev = Nanoev_unix.create () in + + (* install the backend *) + Nanoev_picos.setup_bg_thread ev; + + (* setup a picos scheduler and use EV.read, EV.write, etc. *) + … +``` + + +## Backends + +- [x] select +- [x] poll/ppoll +- [ ] epoll +- [ ] kqueue +- [ ] uring diff --git a/nanoev-posix/index.html b/nanoev-posix/index.html new file mode 100644 index 0000000..ed74286 --- /dev/null +++ b/nanoev-posix/index.html @@ -0,0 +1,2 @@ + +index (nanoev-posix.index)

    Package nanoev-posix

    Package info

    readme-files
    diff --git a/nanoev/Nanoev/Impl/index.html b/nanoev/Nanoev/Impl/index.html new file mode 100644 index 0000000..59e2715 --- /dev/null +++ b/nanoev/Nanoev/Impl/index.html @@ -0,0 +1,12 @@ + +Impl (nanoev.Nanoev.Impl)

    Module Nanoev.Impl

    type 'st ops = {
    1. clear : 'st -> unit;
    2. wakeup_from_outside : 'st -> unit;
    3. close : 'st -> Unix.file_descr -> unit;
    4. max_fds : 'st -> int;
    5. on_readable : 'a 'b. 'st -> + Unix.file_descr -> + 'a -> + 'b -> + (closed:bool -> 'a -> 'b -> unit) -> + unit;
    6. on_writable : 'a 'b. 'st -> + Unix.file_descr -> + 'a -> + 'b -> + (closed:bool -> 'a -> 'b -> unit) -> + unit;
    7. run_after_s : 'a 'b. 'st -> float -> 'a -> 'b -> ('a -> 'b -> unit) -> unit;
    8. step : 'st -> unit;
    }
    val build : 'a ops -> 'a -> t
    diff --git a/nanoev/Nanoev/index.html b/nanoev/Nanoev/index.html new file mode 100644 index 0000000..a19bb8c --- /dev/null +++ b/nanoev/Nanoev/index.html @@ -0,0 +1,14 @@ + +Nanoev (nanoev.Nanoev)

    Module Nanoev

    Nano event loop

    type t
    exception Closed
    module Impl : sig ... end
    val clear : t -> unit

    Reset the state

    val wakeup_from_outside : t -> unit
    val step : t -> unit

    Run one step of the event loop until something happens

    val close : t -> Unix.file_descr -> unit

    Close the file descriptor and clean it up

    val max_fds : t -> int

    Maximum number of file descriptors that can be observed at once.

    val on_readable : + t -> + Unix.file_descr -> + 'a -> + 'b -> + (closed:bool -> 'a -> 'b -> unit) -> + unit
    val on_writable : + t -> + Unix.file_descr -> + 'a -> + 'b -> + (closed:bool -> 'a -> 'b -> unit) -> + unit
    val run_after_s : t -> float -> 'a -> 'b -> ('a -> 'b -> unit) -> unit
    diff --git a/nanoev/Nanoev__/index.html b/nanoev/Nanoev__/index.html new file mode 100644 index 0000000..e2375ae --- /dev/null +++ b/nanoev/Nanoev__/index.html @@ -0,0 +1,2 @@ + +Nanoev__ (nanoev.Nanoev__)

    Module Nanoev__

    This module is hidden.

    diff --git a/nanoev/Nanoev__Trace_/index.html b/nanoev/Nanoev__Trace_/index.html new file mode 100644 index 0000000..1126dd7 --- /dev/null +++ b/nanoev/Nanoev__Trace_/index.html @@ -0,0 +1,2 @@ + +Nanoev__Trace_ (nanoev.Nanoev__Trace_)

    Module Nanoev__Trace_

    This module is hidden.

    diff --git a/nanoev/Nanoev_unix/index.html b/nanoev/Nanoev_unix/index.html new file mode 100644 index 0000000..041c0a7 --- /dev/null +++ b/nanoev/Nanoev_unix/index.html @@ -0,0 +1,14 @@ + +Nanoev_unix (nanoev.Nanoev_unix)

    Module Nanoev_unix

    Nano event loop

    include module type of struct include Nanoev end
    type t = Nanoev.t
    exception Closed
    module Impl = Nanoev.Impl
    val clear : t -> unit

    Reset the state

    val wakeup_from_outside : t -> unit
    val step : t -> unit

    Run one step of the event loop until something happens

    val close : t -> Unix.file_descr -> unit

    Close the file descriptor and clean it up

    val max_fds : t -> int

    Maximum number of file descriptors that can be observed at once.

    val on_readable : + t -> + Unix.file_descr -> + 'a -> + 'b -> + (closed:bool -> 'a -> 'b -> unit) -> + unit
    val on_writable : + t -> + Unix.file_descr -> + 'a -> + 'b -> + (closed:bool -> 'a -> 'b -> unit) -> + unit
    val run_after_s : t -> float -> 'a -> 'b -> ('a -> 'b -> unit) -> unit
    val create : unit -> t
    diff --git a/nanoev/Nanoev_unix__/index.html b/nanoev/Nanoev_unix__/index.html new file mode 100644 index 0000000..a04f086 --- /dev/null +++ b/nanoev/Nanoev_unix__/index.html @@ -0,0 +1,2 @@ + +Nanoev_unix__ (nanoev.Nanoev_unix__)

    Module Nanoev_unix__

    This module is hidden.

    diff --git a/nanoev/_doc-dir/README.md b/nanoev/_doc-dir/README.md new file mode 100644 index 0000000..3c391ee --- /dev/null +++ b/nanoev/_doc-dir/README.md @@ -0,0 +1,34 @@ +# nanoev + +A minimalistic but modular abstraction for IO event loops. + +The goal of this library is to provide a uniform abstraction over multiple +system event loops, in a way that plays well with Picos. + +## Usage + +Very basic usage would look like this: + +```ocaml +module EV = Nanoev_picos + + +let () = + (* use a backend, eg. select *) + let ev = Nanoev_unix.create () in + + (* install the backend *) + Nanoev_picos.setup_bg_thread ev; + + (* setup a picos scheduler and use EV.read, EV.write, etc. *) + … +``` + + +## Backends + +- [x] select +- [x] poll/ppoll +- [ ] epoll +- [ ] kqueue +- [ ] uring diff --git a/nanoev/index.html b/nanoev/index.html new file mode 100644 index 0000000..f104eca --- /dev/null +++ b/nanoev/index.html @@ -0,0 +1,2 @@ + +index (nanoev.index)

    Package nanoev

    Package info

    readme-files
    diff --git a/nanoev_tiny_httpd/Nanoev_tiny_httpd/index.html b/nanoev_tiny_httpd/Nanoev_tiny_httpd/index.html new file mode 100644 index 0000000..7da6a5e --- /dev/null +++ b/nanoev_tiny_httpd/Nanoev_tiny_httpd/index.html @@ -0,0 +1,15 @@ + +Nanoev_tiny_httpd (nanoev_tiny_httpd.Nanoev_tiny_httpd)

    Module Nanoev_tiny_httpd

    module TH = Tiny_httpd_core
    val create : + ?masksigpipe:bool -> + ?max_connections:int -> + ?max_buf_pool_size:int -> + ?timeout:float -> + ?buf_size:int -> + ?get_time_s:(unit -> float) -> + ?addr:string -> + ?port:int -> + ?sock:Unix.file_descr -> + ?middlewares:([ `Encoding | `Stage of int ] * TH.Server.Middleware.t) list -> + new_thread:((unit -> unit) -> unit) -> + unit -> + TH.Server.t
    diff --git a/nanoev_tiny_httpd/_doc-dir/README.md b/nanoev_tiny_httpd/_doc-dir/README.md new file mode 100644 index 0000000..3c391ee --- /dev/null +++ b/nanoev_tiny_httpd/_doc-dir/README.md @@ -0,0 +1,34 @@ +# nanoev + +A minimalistic but modular abstraction for IO event loops. + +The goal of this library is to provide a uniform abstraction over multiple +system event loops, in a way that plays well with Picos. + +## Usage + +Very basic usage would look like this: + +```ocaml +module EV = Nanoev_picos + + +let () = + (* use a backend, eg. select *) + let ev = Nanoev_unix.create () in + + (* install the backend *) + Nanoev_picos.setup_bg_thread ev; + + (* setup a picos scheduler and use EV.read, EV.write, etc. *) + … +``` + + +## Backends + +- [x] select +- [x] poll/ppoll +- [ ] epoll +- [ ] kqueue +- [ ] uring diff --git a/nanoev_tiny_httpd/index.html b/nanoev_tiny_httpd/index.html new file mode 100644 index 0000000..616adf7 --- /dev/null +++ b/nanoev_tiny_httpd/index.html @@ -0,0 +1,2 @@ + +index (nanoev_tiny_httpd.index)

    Package nanoev_tiny_httpd

    Package info

    readme-files
    diff --git a/ocaml/Afl_instrument/index.html b/ocaml/Afl_instrument/index.html new file mode 100644 index 0000000..5c789b0 --- /dev/null +++ b/ocaml/Afl_instrument/index.html @@ -0,0 +1,5 @@ + +Afl_instrument (ocaml.Afl_instrument)

    Module Afl_instrument

    Instrumentation for afl-fuzz.

    val instrument_function : Cmm.expression -> Debuginfo.t -> Cmm.expression
    val instrument_initialiser : + Cmm.expression -> + (unit -> Debuginfo.t) -> + Cmm.expression
    diff --git a/ocaml/Alias_analysis/index.html b/ocaml/Alias_analysis/index.html new file mode 100644 index 0000000..23b758c --- /dev/null +++ b/ocaml/Alias_analysis/index.html @@ -0,0 +1,10 @@ + +Alias_analysis (ocaml.Alias_analysis)

    Module Alias_analysis

    type allocation_point =
    1. | Symbol of Symbol.t
    2. | Variable of Variable.t
    type allocated_const =
    1. | Normal of Allocated_const.t
    2. | Array of Lambda.array_kind * Asttypes.mutable_flag * Variable.t list
    3. | Duplicate_array of Lambda.array_kind * Asttypes.mutable_flag * Variable.t
    type constant_defining_value =
    1. | Allocated_const of allocated_const
    2. | Block of Tag.t * Variable.t list
    3. | Set_of_closures of Flambda.set_of_closures
    4. | Project_closure of Flambda.project_closure
    5. | Move_within_set_of_closures of Flambda.move_within_set_of_closures
    6. | Project_var of Flambda.project_var
    7. | Field of Variable.t * int
    8. | Symbol_field of Symbol.t * int
    9. | Const of Flambda.const
    10. | Symbol of Symbol.t
    11. | Variable of Variable.t
    type initialize_symbol_field = Variable.t option

    Simple alias analysis working over information about which symbols have been assigned to variables; and which constants have been assigned to symbols. The return value gives the assignment of the defining values of constants to variables. Also see comments for Lift_constants, whose input feeds this pass.

    Variables found to be ill-typed accesses to other constants, for example arising from dead code, will be pointed at the_dead_constant.

    val print_constant_defining_value : + Stdlib.Format.formatter -> + constant_defining_value -> + unit
    diff --git a/ocaml/Allocated_const/index.html b/ocaml/Allocated_const/index.html new file mode 100644 index 0000000..90cfefe --- /dev/null +++ b/ocaml/Allocated_const/index.html @@ -0,0 +1,2 @@ + +Allocated_const (ocaml.Allocated_const)

    Module Allocated_const

    Constants that are always allocated (possibly statically). Blocks are not included here since they are always encoded using Prim (Pmakeblock, ...).

    type t =
    1. | Float of float
    2. | Int32 of int32
    3. | Int64 of int64
    4. | Nativeint of nativeint
    5. | Float_array of float list
    6. | Immutable_float_array of float list
    7. | String of string
    8. | Immutable_string of string
    val compare_floats : float -> float -> int
    val compare : t -> t -> int
    val print : Stdlib.Format.formatter -> t -> unit
    diff --git a/ocaml/Annot/index.html b/ocaml/Annot/index.html new file mode 100644 index 0000000..c250cc9 --- /dev/null +++ b/ocaml/Annot/index.html @@ -0,0 +1,2 @@ + +Annot (ocaml.Annot)

    Module Annot

    type call =
    1. | Tail
    2. | Stack
    3. | Inline
    type ident =
    1. | Iref_internal of Location.t
    2. | Iref_external
    3. | Idef of Location.t
    diff --git a/ocaml/Arch/index.html b/ocaml/Arch/index.html new file mode 100644 index 0000000..1f7ef29 --- /dev/null +++ b/ocaml/Arch/index.html @@ -0,0 +1,14 @@ + +Arch (ocaml.Arch)

    Module Arch

    val command_line_options : (string * Stdlib.Arg.spec * string) list
    type addressing_mode =
    1. | Ibased of string * int
    2. | Iindexed of int
    3. | Iindexed2 of int
    4. | Iscaled of int * int
    5. | Iindexed2scaled of int * int
    type specific_operation =
    1. | Ilea of addressing_mode
    2. | Istore_int of nativeint * addressing_mode * bool
    3. | Ioffset_loc of int * addressing_mode
    4. | Ifloatarithmem of float_operation * addressing_mode
    5. | Ibswap of int
    6. | Isqrtf
    7. | Ifloatsqrtf of addressing_mode
    8. | Isextend32
    9. | Izextend32
    and float_operation =
    1. | Ifloatadd
    2. | Ifloatsub
    3. | Ifloatmul
    4. | Ifloatdiv
    val big_endian : bool
    val size_addr : int
    val size_int : int
    val size_float : int
    val allow_unaligned_access : bool
    val division_crashes_on_overflow : bool
    val identity_addressing : addressing_mode
    val offset_addressing : addressing_mode -> int -> addressing_mode
    val num_args_addressing : addressing_mode -> int
    val print_addressing : + (Stdlib.Format.formatter -> 'a -> unit) -> + addressing_mode -> + Stdlib.Format.formatter -> + 'a array -> + unit
    val print_specific_operation : + (Stdlib.Format.formatter -> 'a -> unit) -> + specific_operation -> + Stdlib.Format.formatter -> + 'a array -> + unit
    val win64 : bool
    val operation_is_pure : specific_operation -> bool
    val operation_can_raise : specific_operation -> bool
    val float_cond_and_need_swap : + Lambda.float_comparison -> + X86_ast.float_condition * bool
    diff --git a/ocaml/Arg_helper/Make/argument-1-S/Key/Map/index.html b/ocaml/Arg_helper/Make/argument-1-S/Key/Map/index.html new file mode 100644 index 0000000..8575eb0 --- /dev/null +++ b/ocaml/Arg_helper/Make/argument-1-S/Key/Map/index.html @@ -0,0 +1,8 @@ + +Map (ocaml.Arg_helper.Make.S.Key.Map)

    Module Key.Map

    Maps

    type key = t

    The type of the map keys.

    type !+'a t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key -> 'a -> 'a t -> 'a t

    add key data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key -> 'a -> 'a list t -> 'a list t

    add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

    update key f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : (key -> bool) -> 'a t -> key * 'a

    find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : (key -> bool) -> 'a t -> key * 'a

    find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : (key -> 'a -> unit) -> 'a t -> unit

    iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

    fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : (key -> 'a -> bool) -> 'a t -> 'a t

    filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : (key -> 'a -> bool) -> 'a t -> bool

    for_all f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : (key -> 'a -> bool) -> 'a t -> bool

    exists f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val of_list : (key * 'a) list -> 'a t

    of_list bs adds the bindings of bs to the empty map, in list order (if a key is bound twice in bs the last one takes over).

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    diff --git a/ocaml/Arg_helper/Make/argument-1-S/Key/index.html b/ocaml/Arg_helper/Make/argument-1-S/Key/index.html new file mode 100644 index 0000000..6f8c80e --- /dev/null +++ b/ocaml/Arg_helper/Make/argument-1-S/Key/index.html @@ -0,0 +1,2 @@ + +Key (ocaml.Arg_helper.Make.S.Key)

    Module S.Key

    type t
    val of_string : string -> t

    The textual representation of a key must not contain '=' or ','.

    module Map : Map.S with type key = t
    diff --git a/ocaml/Arg_helper/Make/argument-1-S/Value/index.html b/ocaml/Arg_helper/Make/argument-1-S/Value/index.html new file mode 100644 index 0000000..bcae300 --- /dev/null +++ b/ocaml/Arg_helper/Make/argument-1-S/Value/index.html @@ -0,0 +1,2 @@ + +Value (ocaml.Arg_helper.Make.S.Value)

    Module S.Value

    type t
    val of_string : string -> t

    The textual representation of a value must not contain ','.

    diff --git a/ocaml/Arg_helper/Make/argument-1-S/index.html b/ocaml/Arg_helper/Make/argument-1-S/index.html new file mode 100644 index 0000000..3005ed4 --- /dev/null +++ b/ocaml/Arg_helper/Make/argument-1-S/index.html @@ -0,0 +1,2 @@ + +S (ocaml.Arg_helper.Make.S)

    Parameter Make.S

    module Key : sig ... end
    module Value : sig ... end
    diff --git a/ocaml/Arg_helper/Make/index.html b/ocaml/Arg_helper/Make/index.html new file mode 100644 index 0000000..2ce5e99 --- /dev/null +++ b/ocaml/Arg_helper/Make/index.html @@ -0,0 +1,2 @@ + +Make (ocaml.Arg_helper.Make)

    Module Arg_helper.Make

    Parameters

    module S : sig ... end

    Signature

    type parsed
    val default : S.Value.t -> parsed
    val set_base_default : S.Value.t -> parsed -> parsed
    val add_base_override : S.Key.t -> S.Value.t -> parsed -> parsed
    val reset_base_overrides : parsed -> parsed
    val set_user_default : S.Value.t -> parsed -> parsed
    val add_user_override : S.Key.t -> S.Value.t -> parsed -> parsed
    val parse : string -> string -> parsed ref -> unit
    type parse_result =
    1. | Ok
    2. | Parse_failed of exn
    val parse_no_error : string -> parsed ref -> parse_result
    val get : key:S.Key.t -> parsed -> S.Value.t
    diff --git a/ocaml/Arg_helper/index.html b/ocaml/Arg_helper/index.html new file mode 100644 index 0000000..0bdd28f --- /dev/null +++ b/ocaml/Arg_helper/index.html @@ -0,0 +1,2 @@ + +Arg_helper (ocaml.Arg_helper)

    Module Arg_helper

    Decipher command line arguments of the form <value> | <key>=<value>,...

    (as used for example for the specification of inlining parameters varying by simplification round).

    Warning: this module is unstable and part of compiler-libs.

    module Make (S : sig ... end) : sig ... end
    diff --git a/ocaml/Asmgen/index.html b/ocaml/Asmgen/index.html new file mode 100644 index 0000000..fe4fec2 --- /dev/null +++ b/ocaml/Asmgen/index.html @@ -0,0 +1,20 @@ + +Asmgen (ocaml.Asmgen)

    Module Asmgen

    From Lambda to assembly code

    type middle_end = + backend:(module Backend_intf.S) -> + prefixname:string -> + ppf_dump:Stdlib.Format.formatter -> + Lambda.program -> + Clambda.with_constants

    The type of converters from Lambda to Clambda.

    val compile_implementation : + ?toplevel:(string -> bool) -> + backend:(module Backend_intf.S) -> + prefixname:string -> + middle_end:middle_end -> + ppf_dump:Stdlib.Format.formatter -> + Lambda.program -> + unit

    Compile an implementation from Lambda using the given middle end.

    val compile_implementation_linear : Unit_info.t -> unit
    val compile_phrase : ppf_dump:Stdlib.Format.formatter -> Cmm.phrase -> unit
    type error =
    1. | Assembler_error of string
    2. | Mismatched_for_pack of string option
    3. | Asm_generation of string * Emitaux.error
    exception Error of error
    val report_error : Stdlib.Format.formatter -> error -> unit
    val compile_unit : + output_prefix:string -> + asm_filename:string -> + keep_asm:bool -> + obj_filename:string -> + (unit -> unit) -> + unit
    diff --git a/ocaml/Asmlibrarian/index.html b/ocaml/Asmlibrarian/index.html new file mode 100644 index 0000000..0f89e76 --- /dev/null +++ b/ocaml/Asmlibrarian/index.html @@ -0,0 +1,2 @@ + +Asmlibrarian (ocaml.Asmlibrarian)

    Module Asmlibrarian

    val create_archive : string list -> string -> unit
    type error =
    1. | File_not_found of string
    2. | Archiver_error of string
    exception Error of error
    val report_error : Stdlib.Format.formatter -> error -> unit
    diff --git a/ocaml/Asmlink/index.html b/ocaml/Asmlink/index.html new file mode 100644 index 0000000..48b47f0 --- /dev/null +++ b/ocaml/Asmlink/index.html @@ -0,0 +1,10 @@ + +Asmlink (ocaml.Asmlink)

    Module Asmlink

    val call_linker_shared : string list -> string -> unit
    val reset : unit -> unit
    val check_consistency : + Misc.filepath -> + Cmx_format.unit_infos -> + Stdlib.Digest.t -> + unit
    val extract_crc_interfaces : unit -> Misc.crcs
    val extract_crc_implementations : unit -> Misc.crcs
    type error =
    1. | File_not_found of Misc.filepath
    2. | Not_an_object_file of Misc.filepath
    3. | Missing_implementations of (Misc.modname * string list) list
    4. | Inconsistent_interface of Misc.modname * Misc.filepath * Misc.filepath
    5. | Inconsistent_implementation of Misc.modname * Misc.filepath * Misc.filepath
    6. | Assembler_error of Misc.filepath
    7. | Linking_error of int
    8. | Multiple_definition of Misc.modname * Misc.filepath * Misc.filepath
    9. | Missing_cmx of Misc.filepath * Misc.modname
    exception Error of error
    val report_error : Stdlib.Format.formatter -> error -> unit
    diff --git a/ocaml/Asmpackager/index.html b/ocaml/Asmpackager/index.html new file mode 100644 index 0000000..11a8088 --- /dev/null +++ b/ocaml/Asmpackager/index.html @@ -0,0 +1,8 @@ + +Asmpackager (ocaml.Asmpackager)

    Module Asmpackager

    val package_files : + ppf_dump:Stdlib.Format.formatter -> + Env.t -> + string list -> + string -> + backend:(module Backend_intf.S) -> + unit
    type error =
    1. | Illegal_renaming of string * string * string
    2. | Forward_reference of string * string
    3. | Wrong_for_pack of string * string
    4. | Linking_error
    5. | Assembler_error of string
    6. | File_not_found of string
    exception Error of error
    val report_error : Stdlib.Format.formatter -> error -> unit
    diff --git a/ocaml/Ast_helper/Attr/index.html b/ocaml/Ast_helper/Attr/index.html new file mode 100644 index 0000000..1746a55 --- /dev/null +++ b/ocaml/Ast_helper/Attr/index.html @@ -0,0 +1,2 @@ + +Attr (ocaml.Ast_helper.Attr)

    Module Ast_helper.Attr

    Attributes

    diff --git a/ocaml/Ast_helper/Cf/index.html b/ocaml/Ast_helper/Cf/index.html new file mode 100644 index 0000000..c82358b --- /dev/null +++ b/ocaml/Ast_helper/Cf/index.html @@ -0,0 +1,44 @@ + +Cf (ocaml.Ast_helper.Cf)

    Module Ast_helper.Cf

    Class fields

    val mk : + ?loc:loc -> + ?attrs:attrs -> + ?docs:Docstrings.docs -> + Parsetree.class_field_desc -> + Parsetree.class_field
    val inherit_ : + ?loc:loc -> + ?attrs:attrs -> + Asttypes.override_flag -> + Parsetree.class_expr -> + str option -> + Parsetree.class_field
    val val_ : + ?loc:loc -> + ?attrs:attrs -> + str -> + Asttypes.mutable_flag -> + Parsetree.class_field_kind -> + Parsetree.class_field
    val method_ : + ?loc:loc -> + ?attrs:attrs -> + str -> + Asttypes.private_flag -> + Parsetree.class_field_kind -> + Parsetree.class_field
    val constraint_ : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.core_type -> + Parsetree.core_type -> + Parsetree.class_field
    val initializer_ : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.expression -> + Parsetree.class_field
    val extension : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.extension -> + Parsetree.class_field
    val attribute : ?loc:loc -> Parsetree.attribute -> Parsetree.class_field
    val text : Docstrings.text -> Parsetree.class_field list
    val virtual_ : Parsetree.core_type -> Parsetree.class_field_kind
    diff --git a/ocaml/Ast_helper/Ci/index.html b/ocaml/Ast_helper/Ci/index.html new file mode 100644 index 0000000..553d1b4 --- /dev/null +++ b/ocaml/Ast_helper/Ci/index.html @@ -0,0 +1,12 @@ + +Ci (ocaml.Ast_helper.Ci)

    Module Ast_helper.Ci

    Classes

    val mk : + ?loc:loc -> + ?attrs:attrs -> + ?docs:Docstrings.docs -> + ?text:Docstrings.text -> + ?virt:Asttypes.virtual_flag -> + ?params: + (Parsetree.core_type * (Asttypes.variance * Asttypes.injectivity)) list -> + str -> + 'a -> + 'a Parsetree.class_infos
    diff --git a/ocaml/Ast_helper/Cl/index.html b/ocaml/Ast_helper/Cl/index.html new file mode 100644 index 0000000..51fbf84 --- /dev/null +++ b/ocaml/Ast_helper/Cl/index.html @@ -0,0 +1,47 @@ + +Cl (ocaml.Ast_helper.Cl)

    Module Ast_helper.Cl

    Class expressions

    val mk : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.class_expr_desc -> + Parsetree.class_expr
    val constr : + ?loc:loc -> + ?attrs:attrs -> + lid -> + Parsetree.core_type list -> + Parsetree.class_expr
    val structure : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.class_structure -> + Parsetree.class_expr
    val fun_ : + ?loc:loc -> + ?attrs:attrs -> + Asttypes.arg_label -> + Parsetree.expression option -> + Parsetree.pattern -> + Parsetree.class_expr -> + Parsetree.class_expr
    val apply : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.class_expr -> + (Asttypes.arg_label * Parsetree.expression) list -> + Parsetree.class_expr
    val let_ : + ?loc:loc -> + ?attrs:attrs -> + Asttypes.rec_flag -> + Parsetree.value_binding list -> + Parsetree.class_expr -> + Parsetree.class_expr
    val constraint_ : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.class_expr -> + Parsetree.class_type -> + Parsetree.class_expr
    val extension : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.extension -> + Parsetree.class_expr
    val open_ : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.open_description -> + Parsetree.class_expr -> + Parsetree.class_expr
    diff --git a/ocaml/Ast_helper/Const/index.html b/ocaml/Ast_helper/Const/index.html new file mode 100644 index 0000000..f1cedae --- /dev/null +++ b/ocaml/Ast_helper/Const/index.html @@ -0,0 +1,6 @@ + +Const (ocaml.Ast_helper.Const)

    Module Ast_helper.Const

    val char : char -> Parsetree.constant
    val string : + ?quotation_delimiter:string -> + ?loc:Location.t -> + string -> + Parsetree.constant
    val integer : ?suffix:char -> string -> Parsetree.constant
    val int : ?suffix:char -> int -> Parsetree.constant
    val int32 : ?suffix:char -> int32 -> Parsetree.constant
    val int64 : ?suffix:char -> int64 -> Parsetree.constant
    val nativeint : ?suffix:char -> nativeint -> Parsetree.constant
    val float : ?suffix:char -> string -> Parsetree.constant
    diff --git a/ocaml/Ast_helper/Csig/index.html b/ocaml/Ast_helper/Csig/index.html new file mode 100644 index 0000000..52a7d60 --- /dev/null +++ b/ocaml/Ast_helper/Csig/index.html @@ -0,0 +1,5 @@ + +Csig (ocaml.Ast_helper.Csig)

    Module Ast_helper.Csig

    Class signatures

    diff --git a/ocaml/Ast_helper/Cstr/index.html b/ocaml/Ast_helper/Cstr/index.html new file mode 100644 index 0000000..20a0596 --- /dev/null +++ b/ocaml/Ast_helper/Cstr/index.html @@ -0,0 +1,5 @@ + +Cstr (ocaml.Ast_helper.Cstr)

    Module Ast_helper.Cstr

    Class structures

    diff --git a/ocaml/Ast_helper/Ctf/index.html b/ocaml/Ast_helper/Ctf/index.html new file mode 100644 index 0000000..d82350f --- /dev/null +++ b/ocaml/Ast_helper/Ctf/index.html @@ -0,0 +1,37 @@ + +Ctf (ocaml.Ast_helper.Ctf)

    Module Ast_helper.Ctf

    Class type fields

    val inherit_ : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.class_type -> + Parsetree.class_type_field
    val val_ : + ?loc:loc -> + ?attrs:attrs -> + str -> + Asttypes.mutable_flag -> + Asttypes.virtual_flag -> + Parsetree.core_type -> + Parsetree.class_type_field
    val method_ : + ?loc:loc -> + ?attrs:attrs -> + str -> + Asttypes.private_flag -> + Asttypes.virtual_flag -> + Parsetree.core_type -> + Parsetree.class_type_field
    val constraint_ : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.core_type -> + Parsetree.core_type -> + Parsetree.class_type_field
    val extension : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.extension -> + Parsetree.class_type_field
    val text : Docstrings.text -> Parsetree.class_type_field list
    diff --git a/ocaml/Ast_helper/Cty/index.html b/ocaml/Ast_helper/Cty/index.html new file mode 100644 index 0000000..1aba8f3 --- /dev/null +++ b/ocaml/Ast_helper/Cty/index.html @@ -0,0 +1,30 @@ + +Cty (ocaml.Ast_helper.Cty)

    Module Ast_helper.Cty

    Class type expressions

    val mk : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.class_type_desc -> + Parsetree.class_type
    val constr : + ?loc:loc -> + ?attrs:attrs -> + lid -> + Parsetree.core_type list -> + Parsetree.class_type
    val signature : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.class_signature -> + Parsetree.class_type
    val extension : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.extension -> + Parsetree.class_type
    val open_ : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.open_description -> + Parsetree.class_type -> + Parsetree.class_type
    diff --git a/ocaml/Ast_helper/Exp/index.html b/ocaml/Ast_helper/Exp/index.html new file mode 100644 index 0000000..04a1304 --- /dev/null +++ b/ocaml/Ast_helper/Exp/index.html @@ -0,0 +1,181 @@ + +Exp (ocaml.Ast_helper.Exp)

    Module Ast_helper.Exp

    Expressions

    val mk : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.expression_desc -> + Parsetree.expression
    val ident : ?loc:loc -> ?attrs:attrs -> lid -> Parsetree.expression
    val constant : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.constant -> + Parsetree.expression
    val let_ : + ?loc:loc -> + ?attrs:attrs -> + Asttypes.rec_flag -> + Parsetree.value_binding list -> + Parsetree.expression -> + Parsetree.expression
    val function_ : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.function_param list -> + Parsetree.type_constraint option -> + Parsetree.function_body -> + Parsetree.expression
    val apply : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.expression -> + (Asttypes.arg_label * Parsetree.expression) list -> + Parsetree.expression
    val match_ : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.expression -> + Parsetree.case list -> + Parsetree.expression
    val try_ : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.expression -> + Parsetree.case list -> + Parsetree.expression
    val tuple : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.expression list -> + Parsetree.expression
    val construct : + ?loc:loc -> + ?attrs:attrs -> + lid -> + Parsetree.expression option -> + Parsetree.expression
    val variant : + ?loc:loc -> + ?attrs:attrs -> + Asttypes.label -> + Parsetree.expression option -> + Parsetree.expression
    val record : + ?loc:loc -> + ?attrs:attrs -> + (lid * Parsetree.expression) list -> + Parsetree.expression option -> + Parsetree.expression
    val field : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.expression -> + lid -> + Parsetree.expression
    val setfield : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.expression -> + lid -> + Parsetree.expression -> + Parsetree.expression
    val array : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.expression list -> + Parsetree.expression
    val ifthenelse : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.expression -> + Parsetree.expression -> + Parsetree.expression option -> + Parsetree.expression
    val sequence : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.expression -> + Parsetree.expression -> + Parsetree.expression
    val while_ : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.expression -> + Parsetree.expression -> + Parsetree.expression
    val for_ : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.pattern -> + Parsetree.expression -> + Parsetree.expression -> + Asttypes.direction_flag -> + Parsetree.expression -> + Parsetree.expression
    val coerce : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.expression -> + Parsetree.core_type option -> + Parsetree.core_type -> + Parsetree.expression
    val constraint_ : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.expression -> + Parsetree.core_type -> + Parsetree.expression
    val send : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.expression -> + str -> + Parsetree.expression
    val new_ : ?loc:loc -> ?attrs:attrs -> lid -> Parsetree.expression
    val setinstvar : + ?loc:loc -> + ?attrs:attrs -> + str -> + Parsetree.expression -> + Parsetree.expression
    val override : + ?loc:loc -> + ?attrs:attrs -> + (str * Parsetree.expression) list -> + Parsetree.expression
    val letmodule : + ?loc:loc -> + ?attrs:attrs -> + str_opt -> + Parsetree.module_expr -> + Parsetree.expression -> + Parsetree.expression
    val letexception : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.extension_constructor -> + Parsetree.expression -> + Parsetree.expression
    val assert_ : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.expression -> + Parsetree.expression
    val lazy_ : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.expression -> + Parsetree.expression
    val poly : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.expression -> + Parsetree.core_type option -> + Parsetree.expression
    val object_ : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.class_structure -> + Parsetree.expression
    val newtype : + ?loc:loc -> + ?attrs:attrs -> + str -> + Parsetree.expression -> + Parsetree.expression
    val pack : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.module_expr -> + Parsetree.expression
    val open_ : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.open_declaration -> + Parsetree.expression -> + Parsetree.expression
    val letop : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.binding_op -> + Parsetree.binding_op list -> + Parsetree.expression -> + Parsetree.expression
    val extension : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.extension -> + Parsetree.expression
    val unreachable : ?loc:loc -> ?attrs:attrs -> unit -> Parsetree.expression
    val binding_op : + str -> + Parsetree.pattern -> + Parsetree.expression -> + loc -> + Parsetree.binding_op
    diff --git a/ocaml/Ast_helper/Incl/index.html b/ocaml/Ast_helper/Incl/index.html new file mode 100644 index 0000000..4bc373b --- /dev/null +++ b/ocaml/Ast_helper/Incl/index.html @@ -0,0 +1,7 @@ + +Incl (ocaml.Ast_helper.Incl)

    Module Ast_helper.Incl

    Includes

    val mk : + ?loc:loc -> + ?attrs:attrs -> + ?docs:Docstrings.docs -> + 'a -> + 'a Parsetree.include_infos
    diff --git a/ocaml/Ast_helper/Mb/index.html b/ocaml/Ast_helper/Mb/index.html new file mode 100644 index 0000000..ed0c177 --- /dev/null +++ b/ocaml/Ast_helper/Mb/index.html @@ -0,0 +1,9 @@ + +Mb (ocaml.Ast_helper.Mb)

    Module Ast_helper.Mb

    Module bindings

    val mk : + ?loc:loc -> + ?attrs:attrs -> + ?docs:Docstrings.docs -> + ?text:Docstrings.text -> + str_opt -> + Parsetree.module_expr -> + Parsetree.module_binding
    diff --git a/ocaml/Ast_helper/Md/index.html b/ocaml/Ast_helper/Md/index.html new file mode 100644 index 0000000..0545723 --- /dev/null +++ b/ocaml/Ast_helper/Md/index.html @@ -0,0 +1,9 @@ + +Md (ocaml.Ast_helper.Md)

    Module Ast_helper.Md

    Module declarations

    val mk : + ?loc:loc -> + ?attrs:attrs -> + ?docs:Docstrings.docs -> + ?text:Docstrings.text -> + str_opt -> + Parsetree.module_type -> + Parsetree.module_declaration
    diff --git a/ocaml/Ast_helper/Mod/index.html b/ocaml/Ast_helper/Mod/index.html new file mode 100644 index 0000000..8e1f879 --- /dev/null +++ b/ocaml/Ast_helper/Mod/index.html @@ -0,0 +1,40 @@ + +Mod (ocaml.Ast_helper.Mod)

    Module Ast_helper.Mod

    Module expressions

    val mk : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.module_expr_desc -> + Parsetree.module_expr
    val ident : ?loc:loc -> ?attrs:attrs -> lid -> Parsetree.module_expr
    val structure : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.structure -> + Parsetree.module_expr
    val functor_ : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.functor_parameter -> + Parsetree.module_expr -> + Parsetree.module_expr
    val apply : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.module_expr -> + Parsetree.module_expr -> + Parsetree.module_expr
    val apply_unit : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.module_expr -> + Parsetree.module_expr
    val constraint_ : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.module_expr -> + Parsetree.module_type -> + Parsetree.module_expr
    val unpack : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.expression -> + Parsetree.module_expr
    val extension : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.extension -> + Parsetree.module_expr
    diff --git a/ocaml/Ast_helper/Ms/index.html b/ocaml/Ast_helper/Ms/index.html new file mode 100644 index 0000000..63b6c01 --- /dev/null +++ b/ocaml/Ast_helper/Ms/index.html @@ -0,0 +1,9 @@ + +Ms (ocaml.Ast_helper.Ms)

    Module Ast_helper.Ms

    Module substitutions

    val mk : + ?loc:loc -> + ?attrs:attrs -> + ?docs:Docstrings.docs -> + ?text:Docstrings.text -> + str -> + lid -> + Parsetree.module_substitution
    diff --git a/ocaml/Ast_helper/Mtd/index.html b/ocaml/Ast_helper/Mtd/index.html new file mode 100644 index 0000000..fe3b217 --- /dev/null +++ b/ocaml/Ast_helper/Mtd/index.html @@ -0,0 +1,9 @@ + +Mtd (ocaml.Ast_helper.Mtd)

    Module Ast_helper.Mtd

    Module type declarations

    val mk : + ?loc:loc -> + ?attrs:attrs -> + ?docs:Docstrings.docs -> + ?text:Docstrings.text -> + ?typ:Parsetree.module_type -> + str -> + Parsetree.module_type_declaration
    diff --git a/ocaml/Ast_helper/Mty/index.html b/ocaml/Ast_helper/Mty/index.html new file mode 100644 index 0000000..c637967 --- /dev/null +++ b/ocaml/Ast_helper/Mty/index.html @@ -0,0 +1,31 @@ + +Mty (ocaml.Ast_helper.Mty)

    Module Ast_helper.Mty

    Module type expressions

    val mk : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.module_type_desc -> + Parsetree.module_type
    val ident : ?loc:loc -> ?attrs:attrs -> lid -> Parsetree.module_type
    val alias : ?loc:loc -> ?attrs:attrs -> lid -> Parsetree.module_type
    val signature : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.signature -> + Parsetree.module_type
    val functor_ : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.functor_parameter -> + Parsetree.module_type -> + Parsetree.module_type
    val with_ : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.module_type -> + Parsetree.with_constraint list -> + Parsetree.module_type
    val typeof_ : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.module_expr -> + Parsetree.module_type
    val extension : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.extension -> + Parsetree.module_type
    diff --git a/ocaml/Ast_helper/Of/index.html b/ocaml/Ast_helper/Of/index.html new file mode 100644 index 0000000..bd8ae62 --- /dev/null +++ b/ocaml/Ast_helper/Of/index.html @@ -0,0 +1,11 @@ + +Of (ocaml.Ast_helper.Of)

    Module Ast_helper.Of

    Object fields

    val mk : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.object_field_desc -> + Parsetree.object_field
    val tag : + ?loc:loc -> + ?attrs:attrs -> + Asttypes.label with_loc -> + Parsetree.core_type -> + Parsetree.object_field
    val inherit_ : ?loc:loc -> Parsetree.core_type -> Parsetree.object_field
    diff --git a/ocaml/Ast_helper/Opn/index.html b/ocaml/Ast_helper/Opn/index.html new file mode 100644 index 0000000..ff40ef9 --- /dev/null +++ b/ocaml/Ast_helper/Opn/index.html @@ -0,0 +1,8 @@ + +Opn (ocaml.Ast_helper.Opn)

    Module Ast_helper.Opn

    Opens

    val mk : + ?loc:loc -> + ?attrs:attrs -> + ?docs:Docstrings.docs -> + ?override:Asttypes.override_flag -> + 'a -> + 'a Parsetree.open_infos
    diff --git a/ocaml/Ast_helper/Pat/index.html b/ocaml/Ast_helper/Pat/index.html new file mode 100644 index 0000000..d160e61 --- /dev/null +++ b/ocaml/Ast_helper/Pat/index.html @@ -0,0 +1,66 @@ + +Pat (ocaml.Ast_helper.Pat)

    Module Ast_helper.Pat

    Patterns

    val mk : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.pattern_desc -> + Parsetree.pattern
    val any : ?loc:loc -> ?attrs:attrs -> unit -> Parsetree.pattern
    val var : ?loc:loc -> ?attrs:attrs -> str -> Parsetree.pattern
    val alias : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.pattern -> + str -> + Parsetree.pattern
    val constant : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.constant -> + Parsetree.pattern
    val interval : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.constant -> + Parsetree.constant -> + Parsetree.pattern
    val tuple : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.pattern list -> + Parsetree.pattern
    val construct : + ?loc:loc -> + ?attrs:attrs -> + lid -> + (str list * Parsetree.pattern) option -> + Parsetree.pattern
    val variant : + ?loc:loc -> + ?attrs:attrs -> + Asttypes.label -> + Parsetree.pattern option -> + Parsetree.pattern
    val record : + ?loc:loc -> + ?attrs:attrs -> + (lid * Parsetree.pattern) list -> + Asttypes.closed_flag -> + Parsetree.pattern
    val array : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.pattern list -> + Parsetree.pattern
    val or_ : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.pattern -> + Parsetree.pattern -> + Parsetree.pattern
    val constraint_ : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.pattern -> + Parsetree.core_type -> + Parsetree.pattern
    val type_ : ?loc:loc -> ?attrs:attrs -> lid -> Parsetree.pattern
    val lazy_ : ?loc:loc -> ?attrs:attrs -> Parsetree.pattern -> Parsetree.pattern
    val unpack : ?loc:loc -> ?attrs:attrs -> str_opt -> Parsetree.pattern
    val open_ : + ?loc:loc -> + ?attrs:attrs -> + lid -> + Parsetree.pattern -> + Parsetree.pattern
    val exception_ : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.pattern -> + Parsetree.pattern
    val extension : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.extension -> + Parsetree.pattern
    diff --git a/ocaml/Ast_helper/Rf/index.html b/ocaml/Ast_helper/Rf/index.html new file mode 100644 index 0000000..7a80d34 --- /dev/null +++ b/ocaml/Ast_helper/Rf/index.html @@ -0,0 +1,12 @@ + +Rf (ocaml.Ast_helper.Rf)

    Module Ast_helper.Rf

    Row fields

    val mk : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.row_field_desc -> + Parsetree.row_field
    val tag : + ?loc:loc -> + ?attrs:attrs -> + Asttypes.label with_loc -> + bool -> + Parsetree.core_type list -> + Parsetree.row_field
    val inherit_ : ?loc:loc -> Parsetree.core_type -> Parsetree.row_field
    diff --git a/ocaml/Ast_helper/Sig/index.html b/ocaml/Ast_helper/Sig/index.html new file mode 100644 index 0000000..fcf264c --- /dev/null +++ b/ocaml/Ast_helper/Sig/index.html @@ -0,0 +1,43 @@ + +Sig (ocaml.Ast_helper.Sig)

    Module Ast_helper.Sig

    Signature items

    val type_ : + ?loc:loc -> + Asttypes.rec_flag -> + Parsetree.type_declaration list -> + Parsetree.signature_item
    val type_subst : + ?loc:loc -> + Parsetree.type_declaration list -> + Parsetree.signature_item
    val type_extension : + ?loc:loc -> + Parsetree.type_extension -> + Parsetree.signature_item
    val exception_ : + ?loc:loc -> + Parsetree.type_exception -> + Parsetree.signature_item
    val module_ : + ?loc:loc -> + Parsetree.module_declaration -> + Parsetree.signature_item
    val rec_module : + ?loc:loc -> + Parsetree.module_declaration list -> + Parsetree.signature_item
    val open_ : ?loc:loc -> Parsetree.open_description -> Parsetree.signature_item
    val include_ : + ?loc:loc -> + Parsetree.include_description -> + Parsetree.signature_item
    val class_ : + ?loc:loc -> + Parsetree.class_description list -> + Parsetree.signature_item
    val class_type : + ?loc:loc -> + Parsetree.class_type_declaration list -> + Parsetree.signature_item
    val extension : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.extension -> + Parsetree.signature_item
    val text : Docstrings.text -> Parsetree.signature_item list
    diff --git a/ocaml/Ast_helper/Str/index.html b/ocaml/Ast_helper/Str/index.html new file mode 100644 index 0000000..75d31c1 --- /dev/null +++ b/ocaml/Ast_helper/Str/index.html @@ -0,0 +1,42 @@ + +Str (ocaml.Ast_helper.Str)

    Module Ast_helper.Str

    Structure items

    val type_ : + ?loc:loc -> + Asttypes.rec_flag -> + Parsetree.type_declaration list -> + Parsetree.structure_item
    val type_extension : + ?loc:loc -> + Parsetree.type_extension -> + Parsetree.structure_item
    val exception_ : + ?loc:loc -> + Parsetree.type_exception -> + Parsetree.structure_item
    val module_ : ?loc:loc -> Parsetree.module_binding -> Parsetree.structure_item
    val rec_module : + ?loc:loc -> + Parsetree.module_binding list -> + Parsetree.structure_item
    val open_ : ?loc:loc -> Parsetree.open_declaration -> Parsetree.structure_item
    val class_ : + ?loc:loc -> + Parsetree.class_declaration list -> + Parsetree.structure_item
    val class_type : + ?loc:loc -> + Parsetree.class_type_declaration list -> + Parsetree.structure_item
    val include_ : + ?loc:loc -> + Parsetree.include_declaration -> + Parsetree.structure_item
    val extension : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.extension -> + Parsetree.structure_item
    val text : Docstrings.text -> Parsetree.structure_item list
    diff --git a/ocaml/Ast_helper/Te/index.html b/ocaml/Ast_helper/Te/index.html new file mode 100644 index 0000000..bc1c63e --- /dev/null +++ b/ocaml/Ast_helper/Te/index.html @@ -0,0 +1,39 @@ + +Te (ocaml.Ast_helper.Te)

    Module Ast_helper.Te

    Type extensions

    val mk : + ?loc:loc -> + ?attrs:attrs -> + ?docs:Docstrings.docs -> + ?params: + (Parsetree.core_type * (Asttypes.variance * Asttypes.injectivity)) list -> + ?priv:Asttypes.private_flag -> + lid -> + Parsetree.extension_constructor list -> + Parsetree.type_extension
    val mk_exception : + ?loc:loc -> + ?attrs:attrs -> + ?docs:Docstrings.docs -> + Parsetree.extension_constructor -> + Parsetree.type_exception
    val constructor : + ?loc:loc -> + ?attrs:attrs -> + ?docs:Docstrings.docs -> + ?info:Docstrings.info -> + str -> + Parsetree.extension_constructor_kind -> + Parsetree.extension_constructor
    val decl : + ?loc:loc -> + ?attrs:attrs -> + ?docs:Docstrings.docs -> + ?info:Docstrings.info -> + ?vars:str list -> + ?args:Parsetree.constructor_arguments -> + ?res:Parsetree.core_type -> + str -> + Parsetree.extension_constructor
    val rebind : + ?loc:loc -> + ?attrs:attrs -> + ?docs:Docstrings.docs -> + ?info:Docstrings.info -> + str -> + lid -> + Parsetree.extension_constructor
    diff --git a/ocaml/Ast_helper/Typ/index.html b/ocaml/Ast_helper/Typ/index.html new file mode 100644 index 0000000..4fb29c4 --- /dev/null +++ b/ocaml/Ast_helper/Typ/index.html @@ -0,0 +1,64 @@ + +Typ (ocaml.Ast_helper.Typ)

    Module Ast_helper.Typ

    Type expressions

    val mk : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.core_type_desc -> + Parsetree.core_type
    val any : ?loc:loc -> ?attrs:attrs -> unit -> Parsetree.core_type
    val var : ?loc:loc -> ?attrs:attrs -> string -> Parsetree.core_type
    val arrow : + ?loc:loc -> + ?attrs:attrs -> + Asttypes.arg_label -> + Parsetree.core_type -> + Parsetree.core_type -> + Parsetree.core_type
    val tuple : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.core_type list -> + Parsetree.core_type
    val constr : + ?loc:loc -> + ?attrs:attrs -> + lid -> + Parsetree.core_type list -> + Parsetree.core_type
    val object_ : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.object_field list -> + Asttypes.closed_flag -> + Parsetree.core_type
    val class_ : + ?loc:loc -> + ?attrs:attrs -> + lid -> + Parsetree.core_type list -> + Parsetree.core_type
    val alias : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.core_type -> + string with_loc -> + Parsetree.core_type
    val variant : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.row_field list -> + Asttypes.closed_flag -> + Asttypes.label list option -> + Parsetree.core_type
    val poly : + ?loc:loc -> + ?attrs:attrs -> + str list -> + Parsetree.core_type -> + Parsetree.core_type
    val package : + ?loc:loc -> + ?attrs:attrs -> + lid -> + (lid * Parsetree.core_type) list -> + Parsetree.core_type
    val open_ : + ?loc:loc -> + ?attrs:attrs -> + lid -> + Parsetree.core_type -> + Parsetree.core_type
    val extension : + ?loc:loc -> + ?attrs:attrs -> + Parsetree.extension -> + Parsetree.core_type
    val varify_constructors : + str list -> + Parsetree.core_type -> + Parsetree.core_type

    varify_constructors newtypes te is type expression te, of which any of nullary type constructor tc is replaced by type variable of the same name, if tc's name appears in newtypes. Raise Syntaxerr.Variable_in_scope if any type variable inside te appears in newtypes.

    • since 4.05
    diff --git a/ocaml/Ast_helper/Type/index.html b/ocaml/Ast_helper/Type/index.html new file mode 100644 index 0000000..f336741 --- /dev/null +++ b/ocaml/Ast_helper/Type/index.html @@ -0,0 +1,29 @@ + +Type (ocaml.Ast_helper.Type)

    Module Ast_helper.Type

    Type declarations

    val mk : + ?loc:loc -> + ?attrs:attrs -> + ?docs:Docstrings.docs -> + ?text:Docstrings.text -> + ?params: + (Parsetree.core_type * (Asttypes.variance * Asttypes.injectivity)) list -> + ?cstrs:(Parsetree.core_type * Parsetree.core_type * loc) list -> + ?kind:Parsetree.type_kind -> + ?priv:Asttypes.private_flag -> + ?manifest:Parsetree.core_type -> + str -> + Parsetree.type_declaration
    val constructor : + ?loc:loc -> + ?attrs:attrs -> + ?info:Docstrings.info -> + ?vars:str list -> + ?args:Parsetree.constructor_arguments -> + ?res:Parsetree.core_type -> + str -> + Parsetree.constructor_declaration
    val field : + ?loc:loc -> + ?attrs:attrs -> + ?info:Docstrings.info -> + ?mut:Asttypes.mutable_flag -> + str -> + Parsetree.core_type -> + Parsetree.label_declaration
    diff --git a/ocaml/Ast_helper/Val/index.html b/ocaml/Ast_helper/Val/index.html new file mode 100644 index 0000000..a02da9d --- /dev/null +++ b/ocaml/Ast_helper/Val/index.html @@ -0,0 +1,9 @@ + +Val (ocaml.Ast_helper.Val)

    Module Ast_helper.Val

    Value declarations

    val mk : + ?loc:loc -> + ?attrs:attrs -> + ?docs:Docstrings.docs -> + ?prim:string list -> + str -> + Parsetree.core_type -> + Parsetree.value_description
    diff --git a/ocaml/Ast_helper/Vb/index.html b/ocaml/Ast_helper/Vb/index.html new file mode 100644 index 0000000..0d64e19 --- /dev/null +++ b/ocaml/Ast_helper/Vb/index.html @@ -0,0 +1,10 @@ + +Vb (ocaml.Ast_helper.Vb)

    Module Ast_helper.Vb

    Value bindings

    val mk : + ?loc:loc -> + ?attrs:attrs -> + ?docs:Docstrings.docs -> + ?text:Docstrings.text -> + ?value_constraint:Parsetree.value_constraint -> + Parsetree.pattern -> + Parsetree.expression -> + Parsetree.value_binding
    diff --git a/ocaml/Ast_helper/index.html b/ocaml/Ast_helper/index.html new file mode 100644 index 0000000..583c151 --- /dev/null +++ b/ocaml/Ast_helper/index.html @@ -0,0 +1,2 @@ + +Ast_helper (ocaml.Ast_helper)

    Module Ast_helper

    Helpers to produce Parsetree fragments

    Warning This module is unstable and part of compiler-libs.

    type 'a with_loc = 'a Location.loc
    type loc = Location.t
    type str = string with_loc
    type str_opt = string option with_loc
    type attrs = Parsetree.attribute list

    Default locations

    val default_loc : loc ref

    Default value for all optional location arguments.

    val with_default_loc : loc -> (unit -> 'a) -> 'a

    Set the default_loc within the scope of the execution of the provided function.

    Constants

    module Const : sig ... end
    module Attr : sig ... end

    Core language

    module Typ : sig ... end

    Type expressions

    module Pat : sig ... end

    Patterns

    module Exp : sig ... end

    Expressions

    module Val : sig ... end

    Value declarations

    module Type : sig ... end

    Type declarations

    module Te : sig ... end

    Type extensions

    Module language

    module Mty : sig ... end

    Module type expressions

    module Mod : sig ... end

    Module expressions

    module Sig : sig ... end

    Signature items

    module Str : sig ... end

    Structure items

    module Md : sig ... end

    Module declarations

    module Ms : sig ... end

    Module substitutions

    module Mtd : sig ... end

    Module type declarations

    module Mb : sig ... end

    Module bindings

    module Opn : sig ... end

    Opens

    module Incl : sig ... end

    Includes

    module Vb : sig ... end

    Value bindings

    Class language

    module Cty : sig ... end

    Class type expressions

    module Ctf : sig ... end

    Class type fields

    module Cl : sig ... end

    Class expressions

    module Cf : sig ... end

    Class fields

    module Ci : sig ... end

    Classes

    module Csig : sig ... end

    Class signatures

    module Cstr : sig ... end

    Class structures

    module Rf : sig ... end

    Row fields

    module Of : sig ... end

    Object fields

    diff --git a/ocaml/Ast_invariants/index.html b/ocaml/Ast_invariants/index.html new file mode 100644 index 0000000..50696b2 --- /dev/null +++ b/ocaml/Ast_invariants/index.html @@ -0,0 +1,2 @@ + +Ast_invariants (ocaml.Ast_invariants)

    Module Ast_invariants

    Check AST invariants

    Warning: this module is unstable and part of compiler-libs.

    val structure : Parsetree.structure -> unit
    val signature : Parsetree.signature -> unit
    diff --git a/ocaml/Ast_iterator/index.html b/ocaml/Ast_iterator/index.html new file mode 100644 index 0000000..62eb120 --- /dev/null +++ b/ocaml/Ast_iterator/index.html @@ -0,0 +1,6 @@ + +Ast_iterator (ocaml.Ast_iterator)

    Module Ast_iterator

    Ast_iterator.iterator enables AST inspection using open recursion. A typical mapper would be based on Ast_iterator.default_iterator, a trivial iterator, and will fall back on it for handling the syntax it does not modify.

    Warning: this module is unstable and part of compiler-libs.

    A generic Parsetree iterator

    type iterator = {
    1. attribute : iterator -> Parsetree.attribute -> unit;
    2. attributes : iterator -> Parsetree.attribute list -> unit;
    3. binding_op : iterator -> Parsetree.binding_op -> unit;
    4. case : iterator -> Parsetree.case -> unit;
    5. cases : iterator -> Parsetree.case list -> unit;
    6. class_declaration : iterator -> Parsetree.class_declaration -> unit;
    7. class_description : iterator -> Parsetree.class_description -> unit;
    8. class_expr : iterator -> Parsetree.class_expr -> unit;
    9. class_field : iterator -> Parsetree.class_field -> unit;
    10. class_signature : iterator -> Parsetree.class_signature -> unit;
    11. class_structure : iterator -> Parsetree.class_structure -> unit;
    12. class_type : iterator -> Parsetree.class_type -> unit;
    13. class_type_declaration : iterator -> Parsetree.class_type_declaration -> unit;
    14. class_type_field : iterator -> Parsetree.class_type_field -> unit;
    15. constructor_declaration : iterator -> + Parsetree.constructor_declaration -> + unit;
    16. directive_argument : iterator -> Parsetree.directive_argument -> unit;
    17. expr : iterator -> Parsetree.expression -> unit;
    18. extension : iterator -> Parsetree.extension -> unit;
    19. extension_constructor : iterator -> Parsetree.extension_constructor -> unit;
    20. include_declaration : iterator -> Parsetree.include_declaration -> unit;
    21. include_description : iterator -> Parsetree.include_description -> unit;
    22. label_declaration : iterator -> Parsetree.label_declaration -> unit;
    23. location : iterator -> Location.t -> unit;
    24. module_binding : iterator -> Parsetree.module_binding -> unit;
    25. module_declaration : iterator -> Parsetree.module_declaration -> unit;
    26. module_substitution : iterator -> Parsetree.module_substitution -> unit;
    27. module_expr : iterator -> Parsetree.module_expr -> unit;
    28. module_type : iterator -> Parsetree.module_type -> unit;
    29. module_type_declaration : iterator -> + Parsetree.module_type_declaration -> + unit;
    30. open_declaration : iterator -> Parsetree.open_declaration -> unit;
    31. open_description : iterator -> Parsetree.open_description -> unit;
    32. pat : iterator -> Parsetree.pattern -> unit;
    33. payload : iterator -> Parsetree.payload -> unit;
    34. signature : iterator -> Parsetree.signature -> unit;
    35. signature_item : iterator -> Parsetree.signature_item -> unit;
    36. structure : iterator -> Parsetree.structure -> unit;
    37. structure_item : iterator -> Parsetree.structure_item -> unit;
    38. toplevel_directive : iterator -> Parsetree.toplevel_directive -> unit;
    39. toplevel_phrase : iterator -> Parsetree.toplevel_phrase -> unit;
    40. typ : iterator -> Parsetree.core_type -> unit;
    41. row_field : iterator -> Parsetree.row_field -> unit;
    42. object_field : iterator -> Parsetree.object_field -> unit;
    43. type_declaration : iterator -> Parsetree.type_declaration -> unit;
    44. type_extension : iterator -> Parsetree.type_extension -> unit;
    45. type_exception : iterator -> Parsetree.type_exception -> unit;
    46. type_kind : iterator -> Parsetree.type_kind -> unit;
    47. value_binding : iterator -> Parsetree.value_binding -> unit;
    48. value_description : iterator -> Parsetree.value_description -> unit;
    49. with_constraint : iterator -> Parsetree.with_constraint -> unit;
    }

    A iterator record implements one "method" per syntactic category, using an open recursion style: each method takes as its first argument the iterator to be applied to children in the syntax tree.

    val default_iterator : iterator

    A default iterator, which implements a "do not do anything" mapping.

    diff --git a/ocaml/Ast_mapper/index.html b/ocaml/Ast_mapper/index.html new file mode 100644 index 0000000..cfb07f7 --- /dev/null +++ b/ocaml/Ast_mapper/index.html @@ -0,0 +1,81 @@ + +Ast_mapper (ocaml.Ast_mapper)

    Module Ast_mapper

    The interface of a -ppx rewriter

    A -ppx rewriter is a program that accepts a serialized abstract syntax tree and outputs another, possibly modified, abstract syntax tree. This module encapsulates the interface between the compiler and the -ppx rewriters, handling such details as the serialization format, forwarding of command-line flags, and storing state.

    mapper enables AST rewriting using open recursion. A typical mapper would be based on default_mapper, a deep identity mapper, and will fall back on it for handling the syntax it does not modify. For example:

    open Asttypes
+open Parsetree
+open Ast_mapper
+
+let test_mapper argv =
+  { default_mapper with
+    expr = fun mapper expr ->
+      match expr with
+      | { pexp_desc = Pexp_extension ({ txt = "test" }, PStr [])} ->
+        Ast_helper.Exp.constant (Pconst_integer ("42", None))
+      | other -> default_mapper.expr mapper other; }
+
+let () =
+  register "ppx_test" test_mapper

    This -ppx rewriter, which replaces [%test] in expressions with the constant 42, can be compiled using ocamlc -o ppx_test -I +compiler-libs ocamlcommon.cma ppx_test.ml.

    Warning: this module is unstable and part of compiler-libs.

    A generic Parsetree mapper

    type mapper = {
    1. attribute : mapper -> Parsetree.attribute -> Parsetree.attribute;
    2. attributes : mapper -> Parsetree.attribute list -> Parsetree.attribute list;
    3. binding_op : mapper -> Parsetree.binding_op -> Parsetree.binding_op;
    4. case : mapper -> Parsetree.case -> Parsetree.case;
    5. cases : mapper -> Parsetree.case list -> Parsetree.case list;
    6. class_declaration : mapper -> + Parsetree.class_declaration -> + Parsetree.class_declaration;
    7. class_description : mapper -> + Parsetree.class_description -> + Parsetree.class_description;
    8. class_expr : mapper -> Parsetree.class_expr -> Parsetree.class_expr;
    9. class_field : mapper -> Parsetree.class_field -> Parsetree.class_field;
    10. class_signature : mapper -> + Parsetree.class_signature -> + Parsetree.class_signature;
    11. class_structure : mapper -> + Parsetree.class_structure -> + Parsetree.class_structure;
    12. class_type : mapper -> Parsetree.class_type -> Parsetree.class_type;
    13. class_type_declaration : mapper -> + Parsetree.class_type_declaration -> + Parsetree.class_type_declaration;
    14. class_type_field : mapper -> + Parsetree.class_type_field -> + Parsetree.class_type_field;
    15. constant : mapper -> Parsetree.constant -> Parsetree.constant;
    16. constructor_declaration : mapper -> + Parsetree.constructor_declaration -> + Parsetree.constructor_declaration;
    17. directive_argument : mapper -> + Parsetree.directive_argument -> + Parsetree.directive_argument;
    18. expr : mapper -> Parsetree.expression -> Parsetree.expression;
    19. extension : mapper -> Parsetree.extension -> Parsetree.extension;
    20. extension_constructor : mapper -> + Parsetree.extension_constructor -> + Parsetree.extension_constructor;
    21. include_declaration : mapper -> + Parsetree.include_declaration -> + Parsetree.include_declaration;
    22. include_description : mapper -> + Parsetree.include_description -> + Parsetree.include_description;
    23. label_declaration : mapper -> + Parsetree.label_declaration -> + Parsetree.label_declaration;
    24. location : mapper -> Location.t -> Location.t;
    25. module_binding : mapper -> + Parsetree.module_binding -> + Parsetree.module_binding;
    26. module_declaration : mapper -> + Parsetree.module_declaration -> + Parsetree.module_declaration;
    27. module_substitution : mapper -> + Parsetree.module_substitution -> + Parsetree.module_substitution;
    28. module_expr : mapper -> Parsetree.module_expr -> Parsetree.module_expr;
    29. module_type : mapper -> Parsetree.module_type -> Parsetree.module_type;
    30. module_type_declaration : mapper -> + Parsetree.module_type_declaration -> + Parsetree.module_type_declaration;
    31. open_declaration : mapper -> + Parsetree.open_declaration -> + Parsetree.open_declaration;
    32. open_description : mapper -> + Parsetree.open_description -> + Parsetree.open_description;
    33. pat : mapper -> Parsetree.pattern -> Parsetree.pattern;
    34. payload : mapper -> Parsetree.payload -> Parsetree.payload;
    35. signature : mapper -> Parsetree.signature -> Parsetree.signature;
    36. signature_item : mapper -> + Parsetree.signature_item -> + Parsetree.signature_item;
    37. structure : mapper -> Parsetree.structure -> Parsetree.structure;
    38. structure_item : mapper -> + Parsetree.structure_item -> + Parsetree.structure_item;
    39. toplevel_directive : mapper -> + Parsetree.toplevel_directive -> + Parsetree.toplevel_directive;
    40. toplevel_phrase : mapper -> + Parsetree.toplevel_phrase -> + Parsetree.toplevel_phrase;
    41. typ : mapper -> Parsetree.core_type -> Parsetree.core_type;
    42. type_declaration : mapper -> + Parsetree.type_declaration -> + Parsetree.type_declaration;
    43. type_extension : mapper -> + Parsetree.type_extension -> + Parsetree.type_extension;
    44. type_exception : mapper -> + Parsetree.type_exception -> + Parsetree.type_exception;
    45. type_kind : mapper -> Parsetree.type_kind -> Parsetree.type_kind;
    46. value_binding : mapper -> Parsetree.value_binding -> Parsetree.value_binding;
    47. value_description : mapper -> + Parsetree.value_description -> + Parsetree.value_description;
    48. with_constraint : mapper -> + Parsetree.with_constraint -> + Parsetree.with_constraint;
    }

    A mapper record implements one "method" per syntactic category, using an open recursion style: each method takes as its first argument the mapper to be applied to children in the syntax tree.

    val default_mapper : mapper

    A default mapper, which implements a "deep identity" mapping.

    Apply mappers to compilation units

    val tool_name : unit -> string

    Can be used within a ppx preprocessor to know which tool is calling it "ocamlc", "ocamlopt", "ocamldoc", "ocamldep", "ocaml", ... Some global variables that reflect command-line options are automatically synchronized between the calling tool and the ppx preprocessor: Clflags.include_dirs, Clflags.hidden_include_dirs, Load_path, Clflags.open_modules, Clflags.for_package, Clflags.debug.

    val apply : source:string -> target:string -> mapper -> unit

    Apply a mapper (parametrized by the unit name) to a dumped parsetree found in the source file and put the result in the target file. The structure or signature field of the mapper is applied to the implementation or interface.

    val run_main : (string list -> mapper) -> unit

    Entry point to call to implement a standalone -ppx rewriter from a mapper, parametrized by the command line arguments. The current unit name can be obtained from Location.input_name. This function implements proper error reporting for uncaught exceptions.

    Registration API

    val register_function : (string -> (string list -> mapper) -> unit) ref
    val register : string -> (string list -> mapper) -> unit

    Apply the register_function. The default behavior is to run the mapper immediately, taking arguments from the process command line. This is to support a scenario where a mapper is linked as a stand-alone executable.

    It is possible to overwrite the register_function to define "-ppx drivers", which combine several mappers in a single process. Typically, a driver starts by defining register_function to a custom implementation, then lets ppx rewriters (linked statically or dynamically) register themselves, and then run all or some of them. It is also possible to have -ppx drivers apply rewriters to only specific parts of an AST.

    The first argument to register is a symbolic name to be used by the ppx driver.

    Convenience functions to write mappers

    val map_opt : ('a -> 'b) -> 'a option -> 'b option
    val extension_of_error : Location.error -> Parsetree.extension

    Encode an error into an 'ocaml.error' extension node which can be inserted in a generated Parsetree. The compiler will be responsible for reporting the error.

    val attribute_of_warning : Location.t -> string -> Parsetree.attribute

    Encode a warning message into an 'ocaml.ppwarning' attribute which can be inserted in a generated Parsetree. The compiler will be responsible for reporting the warning.

    Helper functions to call external mappers

    val add_ppx_context_str : + tool_name:string -> + Parsetree.structure -> + Parsetree.structure

    Extract information from the current environment and encode it into an attribute which is prepended to the list of structure items in order to pass the information to an external processor.

    val add_ppx_context_sig : + tool_name:string -> + Parsetree.signature -> + Parsetree.signature

    Same as add_ppx_context_str, but for signatures.

    val drop_ppx_context_str : + restore:bool -> + Parsetree.structure -> + Parsetree.structure

    Drop the ocaml.ppx.context attribute from a structure. If restore is true, also restore the associated data in the current process.

    val drop_ppx_context_sig : + restore:bool -> + Parsetree.signature -> + Parsetree.signature

    Same as drop_ppx_context_str, but for signatures.

    Cookies

    Cookies are used to pass information from a ppx processor to a further invocation of itself, when called from the OCaml toplevel (or other tools that support cookies).

    diff --git a/ocaml/Asttypes/index.html b/ocaml/Asttypes/index.html new file mode 100644 index 0000000..2a86afd --- /dev/null +++ b/ocaml/Asttypes/index.html @@ -0,0 +1,2 @@ + +Asttypes (ocaml.Asttypes)

    Module Asttypes

    Auxiliary AST types used by parsetree and typedtree.

    Warning: this module is unstable and part of compiler-libs.

    type constant =
    1. | Const_int of int
    2. | Const_char of char
    3. | Const_string of string * Location.t * string option
    4. | Const_float of string
    5. | Const_int32 of int32
    6. | Const_int64 of int64
    7. | Const_nativeint of nativeint
    type rec_flag =
    1. | Nonrecursive
    2. | Recursive
    type direction_flag =
    1. | Upto
    2. | Downto
    type private_flag =
    1. | Private
    2. | Public
    type mutable_flag =
    1. | Immutable
    2. | Mutable
    type virtual_flag =
    1. | Virtual
    2. | Concrete
    type override_flag =
    1. | Override
    2. | Fresh
    type closed_flag =
    1. | Closed
    2. | Open
    type label = string
    type arg_label =
    1. | Nolabel
    2. | Labelled of string
      (*

      label:T -> ...

      *)
    3. | Optional of string
      (*

      ?label:T -> ...

      *)
    type 'a loc = 'a Location.loc = {
    1. txt : 'a;
    2. loc : Location.t;
    }
    type variance =
    1. | Covariant
    2. | Contravariant
    3. | NoVariance
    type injectivity =
    1. | Injective
    2. | NoInjectivity
    diff --git a/ocaml/Attr_helper/index.html b/ocaml/Attr_helper/index.html new file mode 100644 index 0000000..c6625ca --- /dev/null +++ b/ocaml/Attr_helper/index.html @@ -0,0 +1,5 @@ + +Attr_helper (ocaml.Attr_helper)

    Module Attr_helper

    Helpers for attributes

    Warning: this module is unstable and part of compiler-libs.

    type error =
    1. | Multiple_attributes of string
    2. | No_payload_expected of string
    val get_no_payload_attribute : + string -> + Parsetree.attributes -> + string Asttypes.loc option

    The string argument of the following functions is the name of the attribute we are looking for. If the argument is "foo", these functions will find attributes with the name "foo" or "ocaml.foo"

    val has_no_payload_attribute : string -> Parsetree.attributes -> bool
    exception Error of Location.t * error
    val report_error : Stdlib.Format.formatter -> error -> unit
    diff --git a/ocaml/Augment_specialised_args/Definition/index.html b/ocaml/Augment_specialised_args/Definition/index.html new file mode 100644 index 0000000..d75910c --- /dev/null +++ b/ocaml/Augment_specialised_args/Definition/index.html @@ -0,0 +1,2 @@ + +Definition (ocaml.Augment_specialised_args.Definition)

    Module Augment_specialised_args.Definition

    type t =
    1. | Existing_inner_free_var of Variable.t
    2. | Projection_from_existing_specialised_arg of Projection.t
    diff --git a/ocaml/Augment_specialised_args/Make/argument-1-_/index.html b/ocaml/Augment_specialised_args/Make/argument-1-_/index.html new file mode 100644 index 0000000..469f44b --- /dev/null +++ b/ocaml/Augment_specialised_args/Make/argument-1-_/index.html @@ -0,0 +1,5 @@ + +_ (ocaml.Augment_specialised_args.Make._)

    Parameter Make._

    val pass_name : string
    val what_to_specialise : + env:Inline_and_simplify_aux.Env.t -> + set_of_closures:Flambda.set_of_closures -> + What_to_specialise.t
    diff --git a/ocaml/Augment_specialised_args/Make/index.html b/ocaml/Augment_specialised_args/Make/index.html new file mode 100644 index 0000000..e1c3beb --- /dev/null +++ b/ocaml/Augment_specialised_args/Make/index.html @@ -0,0 +1,11 @@ + +Make (ocaml.Augment_specialised_args.Make)

    Module Augment_specialised_args.Make

    Parameters

    module _ : S

    Signature

    val rewrite_set_of_closures : + env:Inline_and_simplify_aux.Env.t -> + duplicate_function: + (env:Inline_and_simplify_aux.Env.t -> + set_of_closures:Flambda.set_of_closures -> + fun_var:Variable.t -> + new_fun_var:Variable.t -> + Flambda.function_declaration * Flambda.specialised_to Variable.Map.t) -> + set_of_closures:Flambda.set_of_closures -> + (Flambda.expr * Inlining_cost.Benefit.t) option

    duplicate_function should be Inline_and_simplify.duplicate_function.

    diff --git a/ocaml/Augment_specialised_args/What_to_specialise/index.html b/ocaml/Augment_specialised_args/What_to_specialise/index.html new file mode 100644 index 0000000..f741906 --- /dev/null +++ b/ocaml/Augment_specialised_args/What_to_specialise/index.html @@ -0,0 +1,7 @@ + +What_to_specialise (ocaml.Augment_specialised_args.What_to_specialise)

    Module Augment_specialised_args.What_to_specialise

    type t
    val create : set_of_closures:Flambda.set_of_closures -> t
    val new_specialised_arg : + t -> + fun_var:Variable.t -> + group:Variable.t -> + definition:Definition.t -> + t
    val make_direct_call_surrogate_for : t -> fun_var:Variable.t -> t
    diff --git a/ocaml/Augment_specialised_args/index.html b/ocaml/Augment_specialised_args/index.html new file mode 100644 index 0000000..9d7bb85 --- /dev/null +++ b/ocaml/Augment_specialised_args/index.html @@ -0,0 +1,2 @@ + +Augment_specialised_args (ocaml.Augment_specialised_args)

    Module Augment_specialised_args

    Helper module for adding specialised arguments to sets of closures.

    module Definition : sig ... end
    module What_to_specialise : sig ... end
    module type S = sig ... end
    module Make (_ : S) : sig ... end
    diff --git a/ocaml/Augment_specialised_args/module-type-S/index.html b/ocaml/Augment_specialised_args/module-type-S/index.html new file mode 100644 index 0000000..9dbf747 --- /dev/null +++ b/ocaml/Augment_specialised_args/module-type-S/index.html @@ -0,0 +1,5 @@ + +S (ocaml.Augment_specialised_args.S)

    Module type Augment_specialised_args.S

    val pass_name : string
    val what_to_specialise : + env:Inline_and_simplify_aux.Env.t -> + set_of_closures:Flambda.set_of_closures -> + What_to_specialise.t
    diff --git a/ocaml/Backend_intf/index.html b/ocaml/Backend_intf/index.html new file mode 100644 index 0000000..43c7aae --- /dev/null +++ b/ocaml/Backend_intf/index.html @@ -0,0 +1,2 @@ + +Backend_intf (ocaml.Backend_intf)

    Module Backend_intf

    Knowledge that the middle end needs about the backend.

    module type S = sig ... end
    diff --git a/ocaml/Backend_intf/module-type-S/index.html b/ocaml/Backend_intf/module-type-S/index.html new file mode 100644 index 0000000..5e85409 --- /dev/null +++ b/ocaml/Backend_intf/module-type-S/index.html @@ -0,0 +1,2 @@ + +S (ocaml.Backend_intf.S)

    Module type Backend_intf.S

    val symbol_for_global' : Ident.t -> Symbol.t

    Compute the symbol for the given identifier.

    val really_import_approx : Simple_value_approx.t -> Simple_value_approx.t

    If the given approximation is that of a symbol (Value_symbol) or an external (Value_extern), attempt to find a more informative approximation from a previously-written compilation artifact. In the native code backend, for example, this might consult a .cmx file.

    val import_symbol : Symbol.t -> Simple_value_approx.t
    val closure_symbol : Closure_id.t -> Symbol.t
    val size_int : int

    The natural size of an integer on the target architecture (cf. Arch.size_int in the native code backend).

    val big_endian : bool

    true iff the target architecture is big endian.

    val max_sensible_number_of_arguments : int

    The maximum number of arguments that is reasonable for a function to have. This should be fewer than the threshold that causes non-self tail call optimization to be inhibited (in particular, if it would entail passing arguments on the stack; see Selectgen).

    diff --git a/ocaml/Backend_var/Provenance/index.html b/ocaml/Backend_var/Provenance/index.html new file mode 100644 index 0000000..4c50924 --- /dev/null +++ b/ocaml/Backend_var/Provenance/index.html @@ -0,0 +1,6 @@ + +Provenance (ocaml.Backend_var.Provenance)

    Module Backend_var.Provenance

    type t
    val create : + module_path:Path.t -> + location:Debuginfo.t -> + original_ident:Ident.t -> + t
    val module_path : t -> Path.t
    val location : t -> Debuginfo.t
    val original_ident : t -> Ident.t
    val print : Stdlib.Format.formatter -> t -> unit
    diff --git a/ocaml/Backend_var/With_provenance/index.html b/ocaml/Backend_var/With_provenance/index.html new file mode 100644 index 0000000..a8eceb7 --- /dev/null +++ b/ocaml/Backend_var/With_provenance/index.html @@ -0,0 +1,2 @@ + +With_provenance (ocaml.Backend_var.With_provenance)

    Module Backend_var.With_provenance

    type t

    Values of type t should be used for variables in binding position.

    val print : Stdlib.Format.formatter -> t -> unit
    val create : ?provenance:Provenance.t -> backend_var -> t
    val var : t -> backend_var
    val provenance : t -> Provenance.t option
    val name : t -> string
    val rename : t -> t
    diff --git a/ocaml/Backend_var/index.html b/ocaml/Backend_var/index.html new file mode 100644 index 0000000..7732124 --- /dev/null +++ b/ocaml/Backend_var/index.html @@ -0,0 +1,2 @@ + +Backend_var (ocaml.Backend_var)

    Module Backend_var

    Variables used in the backend, optionally equipped with "provenance" information, used for the emission of debugging information.

    include module type of struct include Ident end
    type t = Ident.t
    include Identifiable.S with type t := t
    module T = Ident.T
    include Identifiable.Thing with type t := T.t
    include Hashtbl.HashedType with type t := T.t
    val equal : T.t -> T.t -> bool

    The equality predicate used to compare keys.

    val hash : T.t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := T.t
    val output : out_channel -> T.t -> unit
    val print : Stdlib.Format.formatter -> T.t -> unit
    module Set = Ident.Set
    module Map = Ident.Map
    module Tbl = Ident.Tbl
    val print_with_scope : Stdlib.Format.formatter -> t -> unit

    Same as print except that it will also add a "n" suffix if the scope of the argument is n.

    val create_scoped : scope:int -> string -> t
    val create_local : string -> t
    val create_persistent : string -> t
    val create_predef : string -> t
    val rename : t -> t

    Creates an identifier with the same name as the input, a fresh stamp, and no scope.

    • raises [Fatal_error]

      if called on a persistent / predef ident.

    val name : t -> string
    val unique_name : t -> string
    val unique_toplevel_name : t -> string
    val persistent : t -> bool
    val same : t -> t -> bool

    Compare identifiers by binding location. Two identifiers are the same either if they are both non-persistent and have been created by the same call to create_*, or if they are both persistent and have the same name.

    val compare : t -> t -> int
    val global : t -> bool
    val is_predef : t -> bool
    val scope : t -> int
    val lowest_scope : int
    val highest_scope : int
    val reinit : unit -> unit
    type 'a tbl = 'a Ident.tbl

    'a tbl represents association tables from identifiers to values of type 'a.

    'a tbl plays the role of map, but bindings can be looked up from either the full Ident using find_same, or just its user-visible name using find_name. In general the two lookups may not return the same result, as an identifier may have been shadowed in the environment by a distinct identifier with the same name.

    find_all returns the bindings for all idents of a given name, most recently introduced first.

    In other words, 'a tbl corresponds to (Ident.t * 'a) list Map.Make(String) and the implementation is very close to that representation.

    Note in particular that searching among idents of the same name takes linear time, and that add simply extends the list without checking for duplicates. So it is not a good idea to implement union by repeated add calls, which may result in many duplicated identifiers and poor find_same performance. It is even possible to build overly large same-name lists such that non-recursive functions like find_all or fold_all blow the stack.

    You should probably use Map.Make(Ident) instead, unless you really need to query bindings by user-visible name, not just by unique identifiers.

    val empty : 'a tbl
    val add : t -> 'a -> 'a tbl -> 'a tbl
    val find_same : t -> 'a tbl -> 'a
    val find_name : string -> 'a tbl -> t * 'a
    val find_all : string -> 'a tbl -> (t * 'a) list
    val find_all_seq : string -> 'a tbl -> (t * 'a) Stdlib.Seq.t
    val fold_name : (t -> 'a -> 'b -> 'b) -> 'a tbl -> 'b -> 'b
    val fold_all : (t -> 'a -> 'b -> 'b) -> 'a tbl -> 'b -> 'b
    val iter : (t -> 'a -> unit) -> 'a tbl -> unit
    val remove : t -> 'a tbl -> 'a tbl
    val make_key_generator : unit -> t -> t
    type backend_var = t
    module Provenance : sig ... end
    module With_provenance : sig ... end
    diff --git a/ocaml/Binutils/index.html b/ocaml/Binutils/index.html new file mode 100644 index 0000000..21d126d --- /dev/null +++ b/ocaml/Binutils/index.html @@ -0,0 +1,2 @@ + +Binutils (ocaml.Binutils)

    Module Binutils

    type error =
    1. | Truncated_file
    2. | Unrecognized of string
    3. | Unsupported of string * int64
    4. | Out_of_range of string
    val error_to_string : error -> string
    type t
    val read : string -> (t, error) Stdlib.Result.t
    val defines_symbol : t -> string -> bool
    val symbol_offset : t -> string -> int64 option
    diff --git a/ocaml/Branch_relaxation/Make/argument-1-T/Cond_branch/index.html b/ocaml/Branch_relaxation/Make/argument-1-T/Cond_branch/index.html new file mode 100644 index 0000000..06f58e2 --- /dev/null +++ b/ocaml/Branch_relaxation/Make/argument-1-T/Cond_branch/index.html @@ -0,0 +1,2 @@ + +Cond_branch (ocaml.Branch_relaxation.Make.T.Cond_branch)

    Module T.Cond_branch

    type t
    val all : t list
    val max_displacement : t -> distance
    val classify_instr : Linear.instruction_desc -> t option
    diff --git a/ocaml/Branch_relaxation/Make/argument-1-T/index.html b/ocaml/Branch_relaxation/Make/argument-1-T/index.html new file mode 100644 index 0000000..2799649 --- /dev/null +++ b/ocaml/Branch_relaxation/Make/argument-1-T/index.html @@ -0,0 +1,5 @@ + +T (ocaml.Branch_relaxation.Make.T)

    Parameter Make.T

    type distance = int
    module Cond_branch : sig ... end
    val offset_pc_at_branch : distance
    val relax_allocation : + num_bytes:int -> + dbginfo:Debuginfo.alloc_dbginfo -> + Linear.instruction_desc
    val relax_poll : return_label:Cmm.label option -> Linear.instruction_desc
    val relax_intop_checkbound : unit -> Linear.instruction_desc
    val relax_intop_imm_checkbound : bound:int -> Linear.instruction_desc
    diff --git a/ocaml/Branch_relaxation/Make/index.html b/ocaml/Branch_relaxation/Make/index.html new file mode 100644 index 0000000..ad31cbe --- /dev/null +++ b/ocaml/Branch_relaxation/Make/index.html @@ -0,0 +1,2 @@ + +Make (ocaml.Branch_relaxation.Make)

    Module Branch_relaxation.Make

    Parameters

    Signature

    val relax : Linear.fundecl -> max_out_of_line_code_offset:T.distance -> unit
    diff --git a/ocaml/Branch_relaxation/index.html b/ocaml/Branch_relaxation/index.html new file mode 100644 index 0000000..fc9fcec --- /dev/null +++ b/ocaml/Branch_relaxation/index.html @@ -0,0 +1,2 @@ + +Branch_relaxation (ocaml.Branch_relaxation)

    Module Branch_relaxation

    module Make (T : Branch_relaxation_intf.S) : sig ... end
    diff --git a/ocaml/Branch_relaxation_intf/index.html b/ocaml/Branch_relaxation_intf/index.html new file mode 100644 index 0000000..699c2a5 --- /dev/null +++ b/ocaml/Branch_relaxation_intf/index.html @@ -0,0 +1,2 @@ + +Branch_relaxation_intf (ocaml.Branch_relaxation_intf)

    Module Branch_relaxation_intf

    module type S = sig ... end
    diff --git a/ocaml/Branch_relaxation_intf/module-type-S/Cond_branch/index.html b/ocaml/Branch_relaxation_intf/module-type-S/Cond_branch/index.html new file mode 100644 index 0000000..d33b063 --- /dev/null +++ b/ocaml/Branch_relaxation_intf/module-type-S/Cond_branch/index.html @@ -0,0 +1,2 @@ + +Cond_branch (ocaml.Branch_relaxation_intf.S.Cond_branch)

    Module S.Cond_branch

    type t
    val all : t list
    val max_displacement : t -> distance
    val classify_instr : Linear.instruction_desc -> t option
    diff --git a/ocaml/Branch_relaxation_intf/module-type-S/index.html b/ocaml/Branch_relaxation_intf/module-type-S/index.html new file mode 100644 index 0000000..977e68a --- /dev/null +++ b/ocaml/Branch_relaxation_intf/module-type-S/index.html @@ -0,0 +1,5 @@ + +S (ocaml.Branch_relaxation_intf.S)

    Module type Branch_relaxation_intf.S

    type distance = int
    module Cond_branch : sig ... end
    val offset_pc_at_branch : distance
    val relax_allocation : + num_bytes:int -> + dbginfo:Debuginfo.alloc_dbginfo -> + Linear.instruction_desc
    val relax_poll : return_label:Cmm.label option -> Linear.instruction_desc
    val relax_intop_checkbound : unit -> Linear.instruction_desc
    val relax_intop_imm_checkbound : bound:int -> Linear.instruction_desc
    diff --git a/ocaml/Btype/For_copy/index.html b/ocaml/Btype/For_copy/index.html new file mode 100644 index 0000000..2c1812b --- /dev/null +++ b/ocaml/Btype/For_copy/index.html @@ -0,0 +1,2 @@ + +For_copy (ocaml.Btype.For_copy)

    Module Btype.For_copy

    type copy_scope
    val redirect_desc : copy_scope -> Types.type_expr -> Types.type_desc -> unit
    val with_scope : (copy_scope -> 'a) -> 'a
    diff --git a/ocaml/Btype/TransientTypeMap/index.html b/ocaml/Btype/TransientTypeMap/index.html new file mode 100644 index 0000000..408dd80 --- /dev/null +++ b/ocaml/Btype/TransientTypeMap/index.html @@ -0,0 +1,8 @@ + +TransientTypeMap (ocaml.Btype.TransientTypeMap)

    Module Btype.TransientTypeMap

    Maps

    The type of the map keys.

    type !+'a t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key -> 'a -> 'a t -> 'a t

    add key data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key -> 'a -> 'a list t -> 'a list t

    add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

    update key f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : (key -> bool) -> 'a t -> key * 'a

    find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : (key -> bool) -> 'a t -> key * 'a

    find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : (key -> 'a -> unit) -> 'a t -> unit

    iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

    fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : (key -> 'a -> bool) -> 'a t -> 'a t

    filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : (key -> 'a -> bool) -> 'a t -> bool

    for_all f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : (key -> 'a -> bool) -> 'a t -> bool

    exists f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val of_list : (key * 'a) list -> 'a t

    of_list bs adds the bindings of bs to the empty map, in list order (if a key is bound twice in bs the last one takes over).

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    diff --git a/ocaml/Btype/TypeHash/index.html b/ocaml/Btype/TypeHash/index.html new file mode 100644 index 0000000..b450454 --- /dev/null +++ b/ocaml/Btype/TypeHash/index.html @@ -0,0 +1,2 @@ + +TypeHash (ocaml.Btype.TypeHash)

    Module Btype.TypeHash

    include Hashtbl.S with type key = Types.transient_expr
    type !'a t
    val create : int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    • since 4.00
    val copy : 'a t -> 'a t
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key -> 'a -> unit
    val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
    • since 4.03
    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc
    val length : 'a t -> int
    val stats : 'a t -> Stdlib.Hashtbl.statistics
    • since 4.00
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
    • since 4.07
    val to_seq_keys : _ t -> key Stdlib.Seq.t
    • since 4.07
    val to_seq_values : 'a t -> 'a Stdlib.Seq.t
    • since 4.07
    val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
    • since 4.07
    val mem : 'a t -> Types.type_expr -> bool
    val add : 'a t -> Types.type_expr -> 'a -> unit
    val remove : 'a t -> Types.type_expr -> unit
    val find : 'a t -> Types.type_expr -> 'a
    val find_opt : 'a t -> Types.type_expr -> 'a option
    val iter : (Types.type_expr -> 'a -> unit) -> 'a t -> unit
    diff --git a/ocaml/Btype/TypeMap/index.html b/ocaml/Btype/TypeMap/index.html new file mode 100644 index 0000000..10d2e8b --- /dev/null +++ b/ocaml/Btype/TypeMap/index.html @@ -0,0 +1,10 @@ + +TypeMap (ocaml.Btype.TypeMap)

    Module Btype.TypeMap

    include Map.S + with type key = Types.transient_expr + and type 'a t = 'a TransientTypeMap.t

    Maps

    The type of the map keys.

    type 'a t = 'a TransientTypeMap.t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add_to_list : key -> 'a -> 'a list t -> 'a list t

    add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

    update key f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : (key -> bool) -> 'a t -> key * 'a

    find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : (key -> bool) -> 'a t -> key * 'a

    find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : (key -> 'a -> unit) -> 'a t -> unit

    iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    Transforming

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : (key -> 'a -> bool) -> 'a t -> 'a t

    filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : (key -> 'a -> bool) -> 'a t -> bool

    for_all f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : (key -> 'a -> bool) -> 'a t -> bool

    exists f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val of_list : (key * 'a) list -> 'a t

    of_list bs adds the bindings of bs to the empty map, in list order (if a key is bound twice in bs the last one takes over).

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Stdlib.Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Stdlib.Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    val add : Types.type_expr -> 'a -> 'a t -> 'a t
    val find : Types.type_expr -> 'a t -> 'a
    val singleton : Types.type_expr -> 'a -> 'a t
    val fold : (Types.type_expr -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
    diff --git a/ocaml/Btype/TypePairs/index.html b/ocaml/Btype/TypePairs/index.html new file mode 100644 index 0000000..ea8f46f --- /dev/null +++ b/ocaml/Btype/TypePairs/index.html @@ -0,0 +1,2 @@ + +TypePairs (ocaml.Btype.TypePairs)

    Module Btype.TypePairs

    type t
    val create : int -> t
    val clear : t -> unit
    val add : t -> (Types.type_expr * Types.type_expr) -> unit
    val mem : t -> (Types.type_expr * Types.type_expr) -> bool
    val iter : ((Types.type_expr * Types.type_expr) -> unit) -> t -> unit
    diff --git a/ocaml/Btype/TypeSet/index.html b/ocaml/Btype/TypeSet/index.html new file mode 100644 index 0000000..4f7cfb3 --- /dev/null +++ b/ocaml/Btype/TypeSet/index.html @@ -0,0 +1,2 @@ + +TypeSet (ocaml.Btype.TypeSet)

    Module Btype.TypeSet

    include Set.S with type elt = Types.transient_expr

    Sets

    The type of the set elements.

    type t

    The type of sets.

    val empty : t

    The empty set.

    val remove : elt -> t -> t

    remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val union : t -> t -> t

    Set union.

    val inter : t -> t -> t

    Set intersection.

    val disjoint : t -> t -> bool

    Test if two sets are disjoint.

    • since 4.08
    val diff : t -> t -> t

    Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

    val cardinal : t -> int

    Return the number of elements of a set.

    Elements

    val min_elt : t -> elt

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

    val min_elt_opt : t -> elt option

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

    • since 4.05
    val max_elt : t -> elt

    Same as min_elt, but returns the largest element of the given set.

    val max_elt_opt : t -> elt option

    Same as min_elt_opt, but returns the largest element of the given set.

    • since 4.05
    val choose : t -> elt

    Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    val choose_opt : t -> elt option

    Return one element of the given set, or None if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    • since 4.05

    Searching

    val find : elt -> t -> elt

    find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

    • since 4.01
    val find_opt : elt -> t -> elt option

    find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

    • since 4.05
    val find_first : (elt -> bool) -> t -> elt

    find_first f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

    For example, find_first (fun e -> Ord.compare e x >= 0) s will return the first element e of s where Ord.compare e x >= 0 (intuitively: e >= x), or raise Not_found if x is greater than any element of s.

    • since 4.05
    val find_first_opt : (elt -> bool) -> t -> elt option

    find_first_opt f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

    • since 4.05
    val find_last : (elt -> bool) -> t -> elt

    find_last f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

    • since 4.05
    val find_last_opt : (elt -> bool) -> t -> elt option

    find_last_opt f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

    • since 4.05

    Traversing

    val iter : (elt -> unit) -> t -> unit

    iter f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.

    val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc

    fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

    Transforming

    val map : (elt -> elt) -> t -> t

    map f s is the set whose elements are f a0,f a1... f aN, where a0,a1...aN are the elements of s.

    The elements are passed to f in increasing order with respect to the ordering over the type of the elements.

    If no element of s is changed by f, s is returned unchanged. (If each output of f is physically equal to its input, the returned set is physically equal to s.)

    • since 4.04
    val filter : (elt -> bool) -> t -> t

    filter f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val filter_map : (elt -> elt option) -> t -> t

    filter_map f s returns the set of all v such that f x = Some v for some element x of s.

    For example,

    filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) s

    is the set of halves of the even elements of s.

    If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned unchanged: the result of the function is then physically equal to s.

    • since 4.11
    val partition : (elt -> bool) -> t -> t * t

    partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

    val split : elt -> t -> t * bool * t

    split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.

    Predicates and comparisons

    val is_empty : t -> bool

    Test whether a set is empty or not.

    val equal : t -> t -> bool

    equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

    val compare : t -> t -> int

    Total ordering between sets. Can be used as the ordering function for doing sets of sets.

    val subset : t -> t -> bool

    subset s1 s2 tests whether the set s1 is a subset of the set s2.

    val for_all : (elt -> bool) -> t -> bool

    for_all f s checks if all elements of the set satisfy the predicate f.

    Converting

    val to_list : t -> elt list

    to_list s is elements s.

    • since 5.1
    val of_list : elt list -> t

    of_list l creates a set from a list of elements. This is usually more efficient than folding add over the list, except perhaps for lists with many duplicated elements.

    • since 4.02
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t

    to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

    • since 4.07
    val to_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in ascending order

    • since 4.07
    val to_rev_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in descending order

    • since 4.12
    val add_seq : elt Stdlib.Seq.t -> t -> t

    Add the given elements to the set, in order.

    • since 4.07
    val of_seq : elt Stdlib.Seq.t -> t

    Build a set from the given bindings

    • since 4.07
    val add : Types.type_expr -> t -> t
    val mem : Types.type_expr -> t -> bool
    val singleton : Types.type_expr -> t
    val exists : (Types.type_expr -> bool) -> t -> bool
    val elements : t -> Types.type_expr list
    diff --git a/ocaml/Btype/index.html b/ocaml/Btype/index.html new file mode 100644 index 0000000..c7dcfda --- /dev/null +++ b/ocaml/Btype/index.html @@ -0,0 +1,52 @@ + +Btype (ocaml.Btype)

    Module Btype

    module TypeSet : sig ... end
    module TypeMap : sig ... end
    module TypeHash : sig ... end
    module TypePairs : sig ... end
    val generic_level : int
    val newgenvar : ?name:string -> unit -> Types.type_expr
    val newgenstub : scope:int -> Types.type_expr
    val is_Tvar : Types.type_expr -> bool
    val is_Tunivar : Types.type_expr -> bool
    val is_Tconstr : Types.type_expr -> bool
    val dummy_method : Asttypes.label
    val type_kind_is_abstract : Types.type_declaration -> bool
    val is_fixed : Types.row_desc -> bool
    val has_fixed_explanation : Types.row_desc -> bool
    val fixed_explanation : Types.row_desc -> Types.fixed_explanation option
    val merge_fixed_explanation : + Types.fixed_explanation option -> + Types.fixed_explanation option -> + Types.fixed_explanation option
    val static_row : Types.row_desc -> bool
    val hash_variant : Asttypes.label -> int
    val row_of_type : Types.type_expr -> Types.type_expr
    val has_constr_row : Types.type_expr -> bool
    val is_row_name : string -> bool
    val is_constr_row : allow_ident:bool -> Types.type_expr -> bool
    val set_static_row_name : Types.type_declaration -> Path.t -> unit
    val iter_type_expr : (Types.type_expr -> unit) -> Types.type_expr -> unit
    val fold_type_expr : + ('a -> Types.type_expr -> 'a) -> + 'a -> + Types.type_expr -> + 'a
    val iter_row : (Types.type_expr -> unit) -> Types.row_desc -> unit
    val fold_row : ('a -> Types.type_expr -> 'a) -> 'a -> Types.row_desc -> 'a
    val iter_abbrev : (Types.type_expr -> unit) -> Types.abbrev_memo -> unit
    val iter_type_expr_kind : + (Types.type_expr -> unit) -> + Types.type_decl_kind -> + unit
    val iter_type_expr_cstr_args : + (Types.type_expr -> unit) -> + Types.constructor_arguments -> + unit
    type type_iterators = {
    1. it_signature : type_iterators -> Types.signature -> unit;
    2. it_signature_item : type_iterators -> Types.signature_item -> unit;
    3. it_value_description : type_iterators -> Types.value_description -> unit;
    4. it_type_declaration : type_iterators -> Types.type_declaration -> unit;
    5. it_extension_constructor : type_iterators -> + Types.extension_constructor -> + unit;
    6. it_module_declaration : type_iterators -> Types.module_declaration -> unit;
    7. it_modtype_declaration : type_iterators -> Types.modtype_declaration -> unit;
    8. it_class_declaration : type_iterators -> Types.class_declaration -> unit;
    9. it_class_type_declaration : type_iterators -> + Types.class_type_declaration -> + unit;
    10. it_functor_param : type_iterators -> Types.functor_parameter -> unit;
    11. it_module_type : type_iterators -> Types.module_type -> unit;
    12. it_class_type : type_iterators -> Types.class_type -> unit;
    13. it_type_kind : type_iterators -> Types.type_decl_kind -> unit;
    14. it_do_type_expr : type_iterators -> Types.type_expr -> unit;
    15. it_type_expr : type_iterators -> Types.type_expr -> unit;
    16. it_path : Path.t -> unit;
    }
    val type_iterators : type_iterators
    val unmark_iterators : type_iterators
    val copy_type_desc : + ?keep_names:bool -> + (Types.type_expr -> Types.type_expr) -> + Types.type_desc -> + Types.type_desc
    val copy_row : + (Types.type_expr -> Types.type_expr) -> + bool -> + Types.row_desc -> + bool -> + Types.type_expr -> + Types.row_desc
    module For_copy : sig ... end
    val lowest_level : int
    val not_marked_node : Types.type_expr -> bool
    val logged_mark_node : Types.type_expr -> unit
    val try_logged_mark_node : Types.type_expr -> bool
    val flip_mark_node : Types.type_expr -> unit
    val try_mark_node : Types.type_expr -> bool
    val mark_type : Types.type_expr -> unit
    val mark_type_params : Types.type_expr -> unit
    val unmark_type : Types.type_expr -> unit
    val unmark_type_decl : Types.type_declaration -> unit
    val unmark_extension_constructor : Types.extension_constructor -> unit
    val unmark_class_type : Types.class_type -> unit
    val unmark_class_signature : Types.class_signature -> unit
    val find_expans : + Asttypes.private_flag -> + Path.t -> + Types.abbrev_memo -> + Types.type_expr option
    val cleanup_abbrev : unit -> unit
    val memorize_abbrev : + Types.abbrev_memo ref -> + Asttypes.private_flag -> + Path.t -> + Types.type_expr -> + Types.type_expr -> + unit
    val forget_abbrev : Types.abbrev_memo ref -> Path.t -> unit
    val snapshot : unit -> Types.snapshot
    val backtrack : Types.snapshot -> unit
    val is_optional : Asttypes.arg_label -> bool
    val prefixed_label_name : Asttypes.arg_label -> Asttypes.label
    val extract_label : + Asttypes.label -> + (Asttypes.arg_label * 'a) list -> + (Asttypes.arg_label * 'a * bool * (Asttypes.arg_label * 'a) list) option
    val signature_of_class_type : Types.class_type -> Types.class_signature
    val class_body : Types.class_type -> Types.class_type
    val scrape_class_type : Types.class_type -> Types.class_type
    val class_type_arity : Types.class_type -> int
    val abbreviate_class_type : + Path.t -> + Types.type_expr list -> + Types.class_type -> + Types.class_type
    val self_type_row : Types.class_type -> Types.type_expr
    val methods : Types.class_signature -> string list
    val virtual_methods : Types.class_signature -> string list
    val concrete_methods : Types.class_signature -> Types.MethSet.t
    val public_methods : Types.class_signature -> string list
    val instance_vars : Types.class_signature -> string list
    val virtual_instance_vars : Types.class_signature -> string list
    val concrete_instance_vars : Types.class_signature -> Types.VarSet.t
    val instance_variable_type : + Asttypes.label -> + Types.class_signature -> + Types.type_expr
    val print_raw : (Stdlib.Format.formatter -> Types.type_expr -> unit) ref
    val cstr_type_path : Types.constructor_description -> Path.t
    diff --git a/ocaml/Build_export_info/index.html b/ocaml/Build_export_info/index.html new file mode 100644 index 0000000..2b07bbf --- /dev/null +++ b/ocaml/Build_export_info/index.html @@ -0,0 +1,5 @@ + +Build_export_info (ocaml.Build_export_info)

    Module Build_export_info

    Construct export information, for emission into .cmx files, from an Flambda program.

    val build_transient : + backend:(module Backend_intf.S) -> + Flambda.program -> + Export_info.transient
    diff --git a/ocaml/Build_path_prefix_map/index.html b/ocaml/Build_path_prefix_map/index.html new file mode 100644 index 0000000..f5f1e3d --- /dev/null +++ b/ocaml/Build_path_prefix_map/index.html @@ -0,0 +1,2 @@ + +Build_path_prefix_map (ocaml.Build_path_prefix_map)

    Module Build_path_prefix_map

    Rewrite paths for reproducible builds

    Warning: this module is unstable and part of compiler-libs.

    See the BUILD_PATH_PREFIX_MAP spec

    type path = string
    type path_prefix = string
    type error_message = string
    val encode_prefix : path_prefix -> string
    val decode_prefix : string -> (path_prefix, error_message) result
    type pair = {
    1. target : path_prefix;
    2. source : path_prefix;
    }
    val encode_pair : pair -> string
    val decode_pair : string -> (pair, error_message) result
    type map = pair option list
    val encode_map : map -> string
    val decode_map : string -> (map, error_message) result
    val rewrite_first : map -> path -> path option

    rewrite_first map path tries to find a source in map that is a prefix of the input path. If it succeeds, it replaces this prefix with the corresponding target. If it fails, it just returns None.

    val rewrite_all : map -> path -> path list

    rewrite_all map path finds all sources in map that are a prefix of the input path. For each matching source, in priority order, it replaces this prefix with the corresponding target and adds the result to the returned list. If there are no matches, it just returns [].

    val rewrite : map -> path -> path

    rewrite path uses rewrite_first to try to find a mapping for path. If found, it returns that, otherwise it just returns path.

    diff --git a/ocaml/Builtin_attributes/index.html b/ocaml/Builtin_attributes/index.html new file mode 100644 index 0000000..054ffbe --- /dev/null +++ b/ocaml/Builtin_attributes/index.html @@ -0,0 +1,27 @@ + +Builtin_attributes (ocaml.Builtin_attributes)

    Module Builtin_attributes

    Support for the builtin attributes:

    • ocaml.alert
    • ocaml.boxed
    • ocaml.deprecated
    • ocaml.deprecated_mutable
    • ocaml.explicit_arity
    • ocaml.immediate
    • ocaml.immediate64
    • ocaml.inline
    • ocaml.inlined
    • ocaml.noalloc
    • ocaml.poll
    • ocaml.ppwarning
    • ocaml.specialise
    • ocaml.specialised
    • ocaml.tailcall
    • ocaml.tail_mod_cons
    • ocaml.unboxed
    • ocaml.untagged
    • ocaml.unrolled
    • ocaml.warnerror
    • ocaml.warning
    • ocaml.warn_on_literal_pattern

    Warning: this module is unstable and part of compiler-libs.

    Attribute tracking for warning 53

    type current_phase =
    1. | Parser
    2. | Invariant_check

    register_attr must be called on the locations of all attributes that should be tracked for the purpose of misplaced attribute warnings. In particular, it should be called on all attributes that are present in the source program except those that are contained in the payload of another attribute (because these may be left behind by a ppx and intentionally ignored by the compiler).

    The current_phase argument indicates when this function is being called

    • either when an attribute is created in the parser or when we see an attribute while running the check in the Ast_invariants module. This is used to ensure that we track only attributes from the final version of the parse tree: we skip adding attributes seen at parse time if we can see that a ppx will be run later, because the Ast_invariants check is always run on the result of a ppx.

    Note that the Ast_invariants check is also run on parse trees created from marshalled ast files if no ppx is being used, ensuring we don't miss attributes in that case.

    val register_attr : current_phase -> string Location.loc -> unit
    val mark_payload_attrs_used : Parsetree.payload -> unit

    Marks the attributes hiding in the payload of another attribute used, for the purposes of misplaced attribute warnings (see comment on current_phase above). In the parser, it's simplest to add these to the table and remove them later, rather than threading through state tracking whether we're in an attribute payload.

    val warn_unused : unit -> unit

    Issue misplaced attribute warnings for all attributes created with mk_internal but not yet marked used.

    Warning 53 helpers for environment attributes

    Some attributes, like deprecation markers, do not affect the compilation of the definition on which they appear, but rather result in warnings on future uses of that definition. This is implemented by moving the raw attributes into the environment, where they will be noticed on future accesses.

    To make misplaced attribute warnings work appropriately for these attributes, we mark them "used" when they are moved into the environment. This is done with the helper functions in this section.

    val mark_alert_used : Parsetree.attribute -> unit

    Marks the attribute used for the purposes of misplaced attribute warnings if it is an alert. Call this when moving things allowed to have alert attributes into the environment.

    val mark_alerts_used : Parsetree.attributes -> unit

    The same as List.iter mark_alert_used.

    val mark_warn_on_literal_pattern_used : Parsetree.attributes -> unit

    Marks "warn_on_literal_pattern" attributes used for the purposes of misplaced attribute warnings. Call this when moving constructors into the environment.

    val mark_deprecated_mutable_used : Parsetree.attributes -> unit

    Marks "deprecated_mutable" attributes used for the purposes of misplaced attribute warnings. Call this when moving labels of mutable fields into the environment.

    Helpers for alert and warning attributes

    val check_alerts : Location.t -> Parsetree.attributes -> string -> unit
    val check_alerts_inclusion : + def:Location.t -> + use:Location.t -> + Location.t -> + Parsetree.attributes -> + Parsetree.attributes -> + string -> + unit
    val alerts_of_attrs : Parsetree.attributes -> Misc.alerts
    val alerts_of_sig : Parsetree.signature -> Misc.alerts
    val alerts_of_str : Parsetree.structure -> Misc.alerts
    val check_deprecated_mutable : + Location.t -> + Parsetree.attributes -> + string -> + unit
    val check_deprecated_mutable_inclusion : + def:Location.t -> + use:Location.t -> + Location.t -> + Parsetree.attributes -> + Parsetree.attributes -> + string -> + unit
    val error_of_extension : Parsetree.extension -> Location.error
    val warning_attribute : ?ppwarning:bool -> Parsetree.attribute -> unit

    Apply warning settings from the specified attribute. "ocaml.warning"/"ocaml.warnerror" (and variants without the prefix) are processed and marked used for warning 53. Other attributes are ignored.

    Also implement ocaml.ppwarning (unless ~ppwarning:false is passed).

    val warning_scope : + ?ppwarning:bool -> + Parsetree.attributes -> + (unit -> 'a) -> + 'a

    Execute a function in a new scope for warning settings. This means that the effect of any call to warning_attribute during the execution of this function will be discarded after execution.

    The function also takes a list of attributes which are processed with warning_attribute in the fresh scope before the function is executed.

    Helpers for searching for particular attributes

    val has_attribute : string -> Parsetree.attributes -> bool

    has_attribute name attrs is true if an attribute with name name or "ocaml." ^ name is present in attrs. It marks that attribute used for the purposes of misplaced attribute warnings.

    type attr_action =
    1. | Mark_used_only
    2. | Return

    select_attributes actions attrs finds the elements of attrs that appear in actions and either returns them or just marks them used, according to the corresponding attr_action.

    Each element (nm, action) of the actions list is an attribute along with an attr_action specifying what to do with that attribute. The action is used to accommodate different compiler configurations. If an attribute is used only in some compiler configurations, it's important that we still look for it and mark it used when compiling with other configurations. Otherwise, we would issue spurious misplaced attribute warnings.

    val select_attributes : + (string * attr_action) list -> + Parsetree.attributes -> + Parsetree.attributes
    val attr_equals_builtin : Parsetree.attribute -> string -> bool

    attr_equals_builtin attr s is true if the name of the attribute is s or "ocaml." ^ s. This is useful for manually inspecting attribute names, but note that doing so will not result in marking the attribute used for the purpose of warning 53, so it is usually preferrable to use has_attribute or select_attributes.

    val warn_on_literal_pattern : Parsetree.attributes -> bool
    val explicit_arity : Parsetree.attributes -> bool
    val immediate : Parsetree.attributes -> bool
    val immediate64 : Parsetree.attributes -> bool
    val has_unboxed : Parsetree.attributes -> bool
    val has_boxed : Parsetree.attributes -> bool
    diff --git a/ocaml/Bytegen/index.html b/ocaml/Bytegen/index.html new file mode 100644 index 0000000..557af37 --- /dev/null +++ b/ocaml/Bytegen/index.html @@ -0,0 +1,8 @@ + +Bytegen (ocaml.Bytegen)

    Module Bytegen

    val compile_implementation : + string -> + Lambda.lambda -> + Instruct.instruction list
    val compile_phrase : Lambda.lambda -> Instruct.instruction list * bool
    diff --git a/ocaml/Bytelibrarian/index.html b/ocaml/Bytelibrarian/index.html new file mode 100644 index 0000000..ee3553b --- /dev/null +++ b/ocaml/Bytelibrarian/index.html @@ -0,0 +1,2 @@ + +Bytelibrarian (ocaml.Bytelibrarian)

    Module Bytelibrarian

    val create_archive : string list -> string -> unit
    type error =
    1. | File_not_found of string
    2. | Not_an_object_file of string
    exception Error of error
    val report_error : Stdlib.Format.formatter -> error -> unit
    val reset : unit -> unit
    diff --git a/ocaml/Bytelink/Dep/index.html b/ocaml/Bytelink/Dep/index.html new file mode 100644 index 0000000..1998036 --- /dev/null +++ b/ocaml/Bytelink/Dep/index.html @@ -0,0 +1,2 @@ + +Dep (ocaml.Bytelink.Dep)

    Module Bytelink.Dep

    The type of the set elements.

    val compare : t -> t -> int

    A total ordering function over the set elements. This is a two-argument function f such that f e1 e2 is zero if the elements e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    diff --git a/ocaml/Bytelink/DepSet/index.html b/ocaml/Bytelink/DepSet/index.html new file mode 100644 index 0000000..f3b5fcb --- /dev/null +++ b/ocaml/Bytelink/DepSet/index.html @@ -0,0 +1,2 @@ + +DepSet (ocaml.Bytelink.DepSet)

    Module Bytelink.DepSet

    Sets

    type elt = Dep.t

    The type of the set elements.

    type t

    The type of sets.

    val empty : t

    The empty set.

    val add : elt -> t -> t

    add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val singleton : elt -> t

    singleton x returns the one-element set containing only x.

    val remove : elt -> t -> t

    remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val union : t -> t -> t

    Set union.

    val inter : t -> t -> t

    Set intersection.

    val disjoint : t -> t -> bool

    Test if two sets are disjoint.

    • since 4.08
    val diff : t -> t -> t

    Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

    val cardinal : t -> int

    Return the number of elements of a set.

    Elements

    val elements : t -> elt list

    Return the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Set.Make.

    val min_elt : t -> elt

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

    val min_elt_opt : t -> elt option

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

    • since 4.05
    val max_elt : t -> elt

    Same as min_elt, but returns the largest element of the given set.

    val max_elt_opt : t -> elt option

    Same as min_elt_opt, but returns the largest element of the given set.

    • since 4.05
    val choose : t -> elt

    Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    val choose_opt : t -> elt option

    Return one element of the given set, or None if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    • since 4.05

    Searching

    val find : elt -> t -> elt

    find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

    • since 4.01
    val find_opt : elt -> t -> elt option

    find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

    • since 4.05
    val find_first : (elt -> bool) -> t -> elt

    find_first f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

    For example, find_first (fun e -> Ord.compare e x >= 0) s will return the first element e of s where Ord.compare e x >= 0 (intuitively: e >= x), or raise Not_found if x is greater than any element of s.

    • since 4.05
    val find_first_opt : (elt -> bool) -> t -> elt option

    find_first_opt f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

    • since 4.05
    val find_last : (elt -> bool) -> t -> elt

    find_last f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

    • since 4.05
    val find_last_opt : (elt -> bool) -> t -> elt option

    find_last_opt f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

    • since 4.05

    Traversing

    val iter : (elt -> unit) -> t -> unit

    iter f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.

    val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc

    fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

    Transforming

    val map : (elt -> elt) -> t -> t

    map f s is the set whose elements are f a0,f a1... f aN, where a0,a1...aN are the elements of s.

    The elements are passed to f in increasing order with respect to the ordering over the type of the elements.

    If no element of s is changed by f, s is returned unchanged. (If each output of f is physically equal to its input, the returned set is physically equal to s.)

    • since 4.04
    val filter : (elt -> bool) -> t -> t

    filter f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val filter_map : (elt -> elt option) -> t -> t

    filter_map f s returns the set of all v such that f x = Some v for some element x of s.

    For example,

    filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) s

    is the set of halves of the even elements of s.

    If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned unchanged: the result of the function is then physically equal to s.

    • since 4.11
    val partition : (elt -> bool) -> t -> t * t

    partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

    val split : elt -> t -> t * bool * t

    split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.

    Predicates and comparisons

    val is_empty : t -> bool

    Test whether a set is empty or not.

    val mem : elt -> t -> bool

    mem x s tests whether x belongs to the set s.

    val equal : t -> t -> bool

    equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

    val compare : t -> t -> int

    Total ordering between sets. Can be used as the ordering function for doing sets of sets.

    val subset : t -> t -> bool

    subset s1 s2 tests whether the set s1 is a subset of the set s2.

    val for_all : (elt -> bool) -> t -> bool

    for_all f s checks if all elements of the set satisfy the predicate f.

    val exists : (elt -> bool) -> t -> bool

    exists f s checks if at least one element of the set satisfies the predicate f.

    Converting

    val to_list : t -> elt list

    to_list s is elements s.

    • since 5.1
    val of_list : elt list -> t

    of_list l creates a set from a list of elements. This is usually more efficient than folding add over the list, except perhaps for lists with many duplicated elements.

    • since 4.02
    val to_seq_from : elt -> t -> elt Seq.t

    to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

    • since 4.07
    val to_seq : t -> elt Seq.t

    Iterate on the whole set, in ascending order

    • since 4.07
    val to_rev_seq : t -> elt Seq.t

    Iterate on the whole set, in descending order

    • since 4.12
    val add_seq : elt Seq.t -> t -> t

    Add the given elements to the set, in order.

    • since 4.07
    val of_seq : elt Seq.t -> t

    Build a set from the given bindings

    • since 4.07
    diff --git a/ocaml/Bytelink/index.html b/ocaml/Bytelink/index.html new file mode 100644 index 0000000..c0a3a31 --- /dev/null +++ b/ocaml/Bytelink/index.html @@ -0,0 +1,3 @@ + +Bytelink (ocaml.Bytelink)

    Module Bytelink

    module DepSet : Set.S with type elt = Dep.t
    val reset : unit -> unit
    val check_consistency : Misc.filepath -> Cmo_format.compilation_unit -> unit
    val extract_crc_interfaces : unit -> Misc.crcs
    type error =
    1. | File_not_found of Misc.filepath
    2. | Not_an_object_file of Misc.filepath
    3. | Wrong_object_name of Misc.filepath
    4. | Symbol_error of Misc.filepath * Symtable.error
    5. | Inconsistent_import of Misc.modname * Misc.filepath * Misc.filepath
    6. | Custom_runtime
    7. | File_exists of Misc.filepath
    8. | Cannot_open_dll of Misc.filepath
    9. | Required_compunit_unavailable of Cmo_format.compunit * Cmo_format.compunit
    10. | Camlheader of string * Misc.filepath
    11. | Multiple_definition of Cmo_format.compunit * Misc.filepath * Misc.filepath
    exception Error of error
    val report_error : Stdlib.Format.formatter -> error -> unit
    diff --git a/ocaml/Bytepackager/index.html b/ocaml/Bytepackager/index.html new file mode 100644 index 0000000..ba83e9d --- /dev/null +++ b/ocaml/Bytepackager/index.html @@ -0,0 +1,7 @@ + +Bytepackager (ocaml.Bytepackager)

    Module Bytepackager

    val package_files : + ppf_dump:Stdlib.Format.formatter -> + Env.t -> + string list -> + string -> + unit
    type error =
    1. | Forward_reference of string * Cmo_format.compunit
    2. | Multiple_definition of string * Cmo_format.compunit
    3. | Not_an_object_file of string
    4. | Illegal_renaming of Cmo_format.compunit * string * Cmo_format.compunit
    5. | File_not_found of string
    exception Error of error
    val report_error : Stdlib.Format.formatter -> error -> unit
    diff --git a/ocaml/Bytesections/Name/index.html b/ocaml/Bytesections/Name/index.html new file mode 100644 index 0000000..3e5a9bd --- /dev/null +++ b/ocaml/Bytesections/Name/index.html @@ -0,0 +1,2 @@ + +Name (ocaml.Bytesections.Name)

    Module Bytesections.Name

    type raw_name = private string
    type t =
    1. | CODE
      (*

      bytecode

      *)
    2. | CRCS
      (*

      crcs for modules

      *)
    3. | DATA
      (*

      global data (constant)

      *)
    4. | DBUG
      (*

      debug info

      *)
    5. | DLLS
      (*

      dll names

      *)
    6. | DLPT
      (*

      dll paths

      *)
    7. | PRIM
      (*

      primitives names

      *)
    8. | RNTM
      (*

      The path to the bytecode interpreter (use_runtime mode)

      *)
    9. | SYMB
      (*

      global identifiers

      *)
    10. | Other of raw_name
    val of_string : string -> t
    • raises Invalid_argument

      if the input is not of size 4

    val to_string : t -> string
    diff --git a/ocaml/Bytesections/index.html b/ocaml/Bytesections/index.html new file mode 100644 index 0000000..1995b9a --- /dev/null +++ b/ocaml/Bytesections/index.html @@ -0,0 +1,2 @@ + +Bytesections (ocaml.Bytesections)

    Module Bytesections

    module Name : sig ... end

    Recording sections written to a bytecode executable file

    type toc_writer
    val init_record : out_channel -> toc_writer

    Start recording sections from the current position in out_channel

    val record : toc_writer -> Name.t -> unit

    Record the current position in the out_channel as the end of the section with the given name.

    val write_toc_and_trailer : toc_writer -> unit

    Write the table of contents and the standard trailer for bytecode executable files

    Reading sections from a bytecode executable file

    type section_entry = {
    1. name : Name.t;
      (*

      name of the section.

      *)
    2. pos : int;
      (*

      byte offset at which the section starts.

      *)
    3. len : int;
      (*

      length of the section.

      *)
    }
    type section_table
    exception Bad_magic_number
    val read_toc : in_channel -> section_table

    Read the table of sections from a bytecode executable. Raise Bad_magic_number if magic number doesn't match

    val seek_section : section_table -> in_channel -> Name.t -> int

    Position the input channel at the beginning of the section named "name", and return the length of that section. Raise Not_found if no such section exists.

    val read_section_string : section_table -> in_channel -> Name.t -> string

    Return the contents of a section, as a string.

    val read_section_struct : section_table -> in_channel -> Name.t -> 'a

    Return the contents of a section, as marshalled data.

    val all : section_table -> section_entry list

    Returns all section_entry from a section_table in increasing position order.

    val pos_first_section : section_table -> int

    Return the position of the beginning of the first section

    diff --git a/ocaml/CSE/index.html b/ocaml/CSE/index.html new file mode 100644 index 0000000..50fced1 --- /dev/null +++ b/ocaml/CSE/index.html @@ -0,0 +1,2 @@ + +CSE (ocaml.CSE)

    Module CSE

    Common interface to all architecture-specific CSE modules

    val fundecl : Mach.fundecl -> Mach.fundecl
    diff --git a/ocaml/CSEgen/class-cse_generic/index.html b/ocaml/CSEgen/class-cse_generic/index.html new file mode 100644 index 0000000..014f2c7 --- /dev/null +++ b/ocaml/CSEgen/class-cse_generic/index.html @@ -0,0 +1,2 @@ + +cse_generic (ocaml.CSEgen.cse_generic)

    Class CSEgen.cse_generic

    method class_of_operation : Mach.operation -> op_class
    method is_cheap_operation : Mach.operation -> bool
    method fundecl : Mach.fundecl -> Mach.fundecl
    diff --git a/ocaml/CSEgen/index.html b/ocaml/CSEgen/index.html new file mode 100644 index 0000000..77055dc --- /dev/null +++ b/ocaml/CSEgen/index.html @@ -0,0 +1,2 @@ + +CSEgen (ocaml.CSEgen)

    Module CSEgen

    type op_class =
    1. | Op_pure
    2. | Op_checkbound
    3. | Op_load of Asttypes.mutable_flag
    4. | Op_store of bool
    5. | Op_other
    class cse_generic : object ... end
    diff --git a/ocaml/CamlinternalFormat/index.html b/ocaml/CamlinternalFormat/index.html new file mode 100644 index 0000000..4bf2086 --- /dev/null +++ b/ocaml/CamlinternalFormat/index.html @@ -0,0 +1,53 @@ + +CamlinternalFormat (ocaml.CamlinternalFormat)

    Module CamlinternalFormat

    val is_in_char_set : CamlinternalFormatBasics.char_set -> char -> bool
    type mutable_char_set = bytes
    val create_char_set : unit -> mutable_char_set
    val add_in_char_set : mutable_char_set -> char -> unit
    type ('a, 'b, 'c, 'd, 'e, 'f) param_format_ebb =
    1. | Param_format_EBB : ('x -> 'a, 'b, 'c, 'd, 'e, 'f) CamlinternalFormatBasics.fmt -> + ('a, 'b, 'c, 'd, 'e, 'f) + param_format_ebb
    val param_format_of_ignored_format : + ('a, 'b, 'c, 'd, 'y, 'x) CamlinternalFormatBasics.ignored -> + ('x, 'b, 'c, 'y, 'e, 'f) CamlinternalFormatBasics.fmt -> + ('a, 'b, 'c, 'd, 'e, 'f) param_format_ebb
    type ('b, 'c) acc_formatting_gen =
    1. | Acc_open_tag of ('b, 'c) acc
    2. | Acc_open_box of ('b, 'c) acc
    and ('b, 'c) acc =
    1. | Acc_formatting_lit of ('b, 'c) acc * CamlinternalFormatBasics.formatting_lit
    2. | Acc_formatting_gen of ('b, 'c) acc * ('b, 'c) acc_formatting_gen
    3. | Acc_string_literal of ('b, 'c) acc * string
    4. | Acc_char_literal of ('b, 'c) acc * char
    5. | Acc_data_string of ('b, 'c) acc * string
    6. | Acc_data_char of ('b, 'c) acc * char
    7. | Acc_delay of ('b, 'c) acc * 'b -> 'c
    8. | Acc_flush of ('b, 'c) acc
    9. | Acc_invalid_arg of ('b, 'c) acc * string
    10. | End_of_acc
    type ('a, 'b) heter_list =
    1. | Cons : 'c * ('a, 'b) heter_list -> ('c -> 'a, 'b) heter_list
    2. | Nil : ('b, 'b) heter_list
    type ('b, 'c, 'e, 'f) fmt_ebb =
    1. | Fmt_EBB : ('a, 'b, 'c, 'd, 'e, 'f) CamlinternalFormatBasics.fmt -> ('b, + 'c, + 'e, + 'f) + fmt_ebb
    val make_printf : + (('b, 'c) acc -> 'd) -> + ('b, 'c) acc -> + ('a, 'b, 'c, 'c, 'c, 'd) CamlinternalFormatBasics.fmt -> + 'a
    val make_iprintf : + ('s -> 'f) -> + 's -> + ('a, 'b, 'c, 'd, 'e, 'f) CamlinternalFormatBasics.fmt -> + 'a
    val output_acc : out_channel -> (out_channel, unit) acc -> unit
    val bufput_acc : Stdlib.Buffer.t -> (Stdlib.Buffer.t, unit) acc -> unit
    val strput_acc : Stdlib.Buffer.t -> (unit, string) acc -> unit
    val type_format : + ('x, 'b, 'c, 't, 'u, 'v) CamlinternalFormatBasics.fmt -> + ('a, 'b, 'c, 'd, 'e, 'f) CamlinternalFormatBasics.fmtty -> + ('a, 'b, 'c, 'd, 'e, 'f) CamlinternalFormatBasics.fmt
    val fmt_ebb_of_string : + ?legacy_behavior:bool -> + string -> + ('b, 'c, 'e, 'f) fmt_ebb
    val format_of_string_fmtty : + string -> + ('a, 'b, 'c, 'd, 'e, 'f) CamlinternalFormatBasics.fmtty -> + ('a, 'b, 'c, 'd, 'e, 'f) CamlinternalFormatBasics.format6
    val format_of_string_format : + string -> + ('a, 'b, 'c, 'd, 'e, 'f) CamlinternalFormatBasics.format6 -> + ('a, 'b, 'c, 'd, 'e, 'f) CamlinternalFormatBasics.format6
    val char_of_iconv : CamlinternalFormatBasics.int_conv -> char
    val string_of_formatting_lit : + CamlinternalFormatBasics.formatting_lit -> + string
    val string_of_fmtty : + ('a, 'b, 'c, 'd, 'e, 'f) CamlinternalFormatBasics.fmtty -> + string
    val string_of_fmt : + ('a, 'b, 'c, 'd, 'e, 'f) CamlinternalFormatBasics.fmt -> + string
    val open_box_of_string : string -> int * CamlinternalFormatBasics.block_type
    val symm : + ('a1, 'b1, 'c1, 'd1, 'e1, 'f1, 'a2, 'b2, 'c2, 'd2, 'e2, 'f2) + CamlinternalFormatBasics.fmtty_rel -> + ('a2, 'b2, 'c2, 'd2, 'e2, 'f2, 'a1, 'b1, 'c1, 'd1, 'e1, 'f1) + CamlinternalFormatBasics.fmtty_rel
    val trans : + ('a1, 'b1, 'c1, 'd1, 'e1, 'f1, 'a2, 'b2, 'c2, 'd2, 'e2, 'f2) + CamlinternalFormatBasics.fmtty_rel -> + ('a2, 'b2, 'c2, 'd2, 'e2, 'f2, 'a3, 'b3, 'c3, 'd3, 'e3, 'f3) + CamlinternalFormatBasics.fmtty_rel -> + ('a1, 'b1, 'c1, 'd1, 'e1, 'f1, 'a3, 'b3, 'c3, 'd3, 'e3, 'f3) + CamlinternalFormatBasics.fmtty_rel
    val recast : + ('a1, 'b1, 'c1, 'd1, 'e1, 'f1) CamlinternalFormatBasics.fmt -> + ('a1, 'b1, 'c1, 'd1, 'e1, 'f1, 'a2, 'b2, 'c2, 'd2, 'e2, 'f2) + CamlinternalFormatBasics.fmtty_rel -> + ('a2, 'b2, 'c2, 'd2, 'e2, 'f2) CamlinternalFormatBasics.fmt
    diff --git a/ocaml/CamlinternalFormatBasics/index.html b/ocaml/CamlinternalFormatBasics/index.html new file mode 100644 index 0000000..5fd7557 --- /dev/null +++ b/ocaml/CamlinternalFormatBasics/index.html @@ -0,0 +1,308 @@ + +CamlinternalFormatBasics (ocaml.CamlinternalFormatBasics)

    Module CamlinternalFormatBasics

    type padty =
    1. | Left
    2. | Right
    3. | Zeros
    type int_conv =
    1. | Int_d
    2. | Int_pd
    3. | Int_sd
    4. | Int_i
    5. | Int_pi
    6. | Int_si
    7. | Int_x
    8. | Int_Cx
    9. | Int_X
    10. | Int_CX
    11. | Int_o
    12. | Int_Co
    13. | Int_u
    14. | Int_Cd
    15. | Int_Ci
    16. | Int_Cu
    type float_flag_conv =
    1. | Float_flag_
    2. | Float_flag_p
    3. | Float_flag_s
    type float_kind_conv =
    1. | Float_f
    2. | Float_e
    3. | Float_E
    4. | Float_g
    5. | Float_G
    6. | Float_F
    7. | Float_h
    8. | Float_H
    9. | Float_CF
    type float_conv = float_flag_conv * float_kind_conv
    type char_set = string
    type counter =
    1. | Line_counter
    2. | Char_counter
    3. | Token_counter
    type ('a, 'b) padding =
    1. | No_padding : ('a, 'a) padding
    2. | Lit_padding : padty * int -> ('a, 'a) padding
    3. | Arg_padding : padty -> (int -> 'a, 'a) padding
    type pad_option = int option
    type ('a, 'b) precision =
    1. | No_precision : ('a, 'a) precision
    2. | Lit_precision : int -> ('a, 'a) precision
    3. | Arg_precision : (int -> 'a, 'a) precision
    type prec_option = int option
    type ('a, 'b, 'c) custom_arity =
    1. | Custom_zero : ('a, string, 'a) custom_arity
    2. | Custom_succ : ('a, 'b, 'c) custom_arity -> ('a, 'x -> 'b, 'x -> 'c) + custom_arity
    type block_type =
    1. | Pp_hbox
    2. | Pp_vbox
    3. | Pp_hvbox
    4. | Pp_hovbox
    5. | Pp_box
    6. | Pp_fits
    type formatting_lit =
    1. | Close_box
    2. | Close_tag
    3. | Break of string * int * int
    4. | FFlush
    5. | Force_newline
    6. | Flush_newline
    7. | Magic_size of string * int
    8. | Escaped_at
    9. | Escaped_percent
    10. | Scan_indic of char
    type ('a, 'b, 'c, 'd, 'e, 'f) formatting_gen =
    1. | Open_tag : ('a, 'b, 'c, 'd, 'e, 'f) format6 -> ('a, 'b, 'c, 'd, 'e, 'f) + formatting_gen
    2. | Open_box : ('a, 'b, 'c, 'd, 'e, 'f) format6 -> ('a, 'b, 'c, 'd, 'e, 'f) + formatting_gen
    and ('a, 'b, 'c, 'd, 'e, 'f) fmtty = + ('a, 'b, 'c, 'd, 'e, 'f, 'a, 'b, 'c, 'd, 'e, 'f) fmtty_rel
    and ('a1, 'b1, 'c1, 'd1, 'e1, 'f1, 'a2, 'b2, 'c2, 'd2, 'e2, 'f2) fmtty_rel =
    1. | Char_ty : ('a1, 'b1, 'c1, 'd1, 'e1, 'f1, 'a2, 'b2, 'c2, 'd2, 'e2, 'f2) + fmtty_rel -> (char -> + 'a1, + 'b1, + 'c1, + 'd1, + 'e1, + 'f1, + char -> + 'a2, + 'b2, + 'c2, + 'd2, + 'e2, + 'f2) + fmtty_rel
    2. | String_ty : ('a1, 'b1, 'c1, 'd1, 'e1, 'f1, 'a2, 'b2, 'c2, 'd2, 'e2, 'f2) + fmtty_rel -> (string -> + 'a1, + 'b1, + 'c1, + 'd1, + 'e1, + 'f1, + string -> + 'a2, + 'b2, + 'c2, + 'd2, + 'e2, + 'f2) + fmtty_rel
    3. | Int_ty : ('a1, 'b1, 'c1, 'd1, 'e1, 'f1, 'a2, 'b2, 'c2, 'd2, 'e2, 'f2) fmtty_rel -> + (int -> 'a1, 'b1, 'c1, 'd1, 'e1, 'f1, int -> 'a2, 'b2, 'c2, 'd2, 'e2, 'f2) + fmtty_rel
    4. | Int32_ty : ('a1, 'b1, 'c1, 'd1, 'e1, 'f1, 'a2, 'b2, 'c2, 'd2, 'e2, 'f2) + fmtty_rel -> (int32 -> + 'a1, + 'b1, + 'c1, + 'd1, + 'e1, + 'f1, + int32 -> + 'a2, + 'b2, + 'c2, + 'd2, + 'e2, + 'f2) + fmtty_rel
    5. | Nativeint_ty : ('a1, 'b1, 'c1, 'd1, 'e1, 'f1, 'a2, 'b2, 'c2, 'd2, 'e2, 'f2) + fmtty_rel -> (nativeint -> + 'a1, + 'b1, + 'c1, + 'd1, + 'e1, + 'f1, + nativeint -> + 'a2, + 'b2, + 'c2, + 'd2, + 'e2, + 'f2) + fmtty_rel
    6. | Int64_ty : ('a1, 'b1, 'c1, 'd1, 'e1, 'f1, 'a2, 'b2, 'c2, 'd2, 'e2, 'f2) + fmtty_rel -> (int64 -> + 'a1, + 'b1, + 'c1, + 'd1, + 'e1, + 'f1, + int64 -> + 'a2, + 'b2, + 'c2, + 'd2, + 'e2, + 'f2) + fmtty_rel
    7. | Float_ty : ('a1, 'b1, 'c1, 'd1, 'e1, 'f1, 'a2, 'b2, 'c2, 'd2, 'e2, 'f2) + fmtty_rel -> (float -> + 'a1, + 'b1, + 'c1, + 'd1, + 'e1, + 'f1, + float -> + 'a2, + 'b2, + 'c2, + 'd2, + 'e2, + 'f2) + fmtty_rel
    8. | Bool_ty : ('a1, 'b1, 'c1, 'd1, 'e1, 'f1, 'a2, 'b2, 'c2, 'd2, 'e2, 'f2) + fmtty_rel -> (bool -> + 'a1, + 'b1, + 'c1, + 'd1, + 'e1, + 'f1, + bool -> + 'a2, + 'b2, + 'c2, + 'd2, + 'e2, + 'f2) + fmtty_rel
    9. | Format_arg_ty : ('g, 'h, 'i, 'j, 'k, 'l) fmtty + * ('a1, 'b1, 'c1, 'd1, 'e1, 'f1, 'a2, 'b2, 'c2, 'd2, 'e2, 'f2) fmtty_rel -> + (('g, 'h, 'i, 'j, 'k, 'l) format6 -> + 'a1, + 'b1, + 'c1, + 'd1, + 'e1, + 'f1, + ('g, 'h, 'i, 'j, 'k, 'l) format6 -> + 'a2, + 'b2, + 'c2, + 'd2, + 'e2, + 'f2) + fmtty_rel
    10. | Format_subst_ty : ('g, 'h, 'i, 'j, 'k, 'l, 'g1, 'b1, 'c1, 'j1, 'd1, 'a1) + fmtty_rel + * ('g, 'h, 'i, 'j, 'k, 'l, 'g2, 'b2, 'c2, 'j2, 'd2, 'a2) fmtty_rel + * ('a1, 'b1, 'c1, 'd1, 'e1, 'f1, 'a2, 'b2, 'c2, 'd2, 'e2, 'f2) fmtty_rel -> + (('g, 'h, 'i, 'j, 'k, 'l) format6 -> + 'g1, + 'b1, + 'c1, + 'j1, + 'e1, + 'f1, + ('g, 'h, 'i, 'j, 'k, 'l) format6 -> + 'g2, + 'b2, + 'c2, + 'j2, + 'e2, + 'f2) + fmtty_rel
    11. | Alpha_ty : ('a1, 'b1, 'c1, 'd1, 'e1, 'f1, 'a2, 'b2, 'c2, 'd2, 'e2, 'f2) + fmtty_rel -> (('b1 -> 'x -> 'c1) -> + 'x -> + 'a1, + 'b1, + 'c1, + 'd1, + 'e1, + 'f1, + ('b2 -> 'x -> 'c2) -> + 'x -> + 'a2, + 'b2, + 'c2, + 'd2, + 'e2, + 'f2) + fmtty_rel
    12. | Theta_ty : ('a1, 'b1, 'c1, 'd1, 'e1, 'f1, 'a2, 'b2, 'c2, 'd2, 'e2, 'f2) + fmtty_rel -> (('b1 -> 'c1) -> + 'a1, + 'b1, + 'c1, + 'd1, + 'e1, + 'f1, + ('b2 -> 'c2) -> + 'a2, + 'b2, + 'c2, + 'd2, + 'e2, + 'f2) + fmtty_rel
    13. | Any_ty : ('a1, 'b1, 'c1, 'd1, 'e1, 'f1, 'a2, 'b2, 'c2, 'd2, 'e2, 'f2) fmtty_rel -> + ('x -> 'a1, 'b1, 'c1, 'd1, 'e1, 'f1, 'x -> 'a2, 'b2, 'c2, 'd2, 'e2, 'f2) + fmtty_rel
    14. | Reader_ty : ('a1, 'b1, 'c1, 'd1, 'e1, 'f1, 'a2, 'b2, 'c2, 'd2, 'e2, 'f2) + fmtty_rel -> ('x -> + 'a1, + 'b1, + 'c1, + ('b1 -> 'x) -> + 'd1, + 'e1, + 'f1, + 'x -> + 'a2, + 'b2, + 'c2, + ('b2 -> 'x) -> + 'd2, + 'e2, + 'f2) + fmtty_rel
    15. | Ignored_reader_ty : ('a1, + 'b1, + 'c1, + 'd1, + 'e1, + 'f1, + 'a2, + 'b2, + 'c2, + 'd2, + 'e2, + 'f2) + fmtty_rel -> ('a1, + 'b1, + 'c1, + ('b1 -> 'x) -> + 'd1, + 'e1, + 'f1, + 'a2, + 'b2, + 'c2, + ('b2 -> 'x) -> + 'd2, + 'e2, + 'f2) + fmtty_rel
    16. | End_of_fmtty : ('f1, 'b1, 'c1, 'd1, 'd1, 'f1, 'f2, 'b2, 'c2, 'd2, 'd2, 'f2) + fmtty_rel
    and ('a, 'b, 'c, 'd, 'e, 'f) fmt =
    1. | Char : ('a, 'b, 'c, 'd, 'e, 'f) fmt -> (char -> 'a, 'b, 'c, 'd, 'e, 'f) fmt
    2. | Caml_char : ('a, 'b, 'c, 'd, 'e, 'f) fmt -> (char -> 'a, 'b, 'c, 'd, 'e, 'f) + fmt
    3. | String : ('x, string -> 'a) padding + * ('a, 'b, 'c, 'd, 'e, 'f) fmt -> ('x, 'b, 'c, 'd, 'e, 'f) fmt
    4. | Caml_string : ('x, string -> 'a) padding + * ('a, 'b, 'c, 'd, 'e, 'f) fmt -> ('x, 'b, 'c, 'd, 'e, 'f) fmt
    5. | Int : int_conv + * ('x, 'y) padding + * ('y, int -> 'a) precision + * ('a, 'b, 'c, 'd, 'e, 'f) fmt -> ('x, 'b, 'c, 'd, 'e, 'f) fmt
    6. | Int32 : int_conv + * ('x, 'y) padding + * ('y, int32 -> 'a) precision + * ('a, 'b, 'c, 'd, 'e, 'f) fmt -> ('x, 'b, 'c, 'd, 'e, 'f) fmt
    7. | Nativeint : int_conv + * ('x, 'y) padding + * ('y, nativeint -> 'a) precision + * ('a, 'b, 'c, 'd, 'e, 'f) fmt -> ('x, 'b, 'c, 'd, 'e, 'f) fmt
    8. | Int64 : int_conv + * ('x, 'y) padding + * ('y, int64 -> 'a) precision + * ('a, 'b, 'c, 'd, 'e, 'f) fmt -> ('x, 'b, 'c, 'd, 'e, 'f) fmt
    9. | Float : float_conv + * ('x, 'y) padding + * ('y, float -> 'a) precision + * ('a, 'b, 'c, 'd, 'e, 'f) fmt -> ('x, 'b, 'c, 'd, 'e, 'f) fmt
    10. | Bool : ('x, bool -> 'a) padding + * ('a, 'b, 'c, 'd, 'e, 'f) fmt -> ('x, 'b, 'c, 'd, 'e, 'f) fmt
    11. | Flush : ('a, 'b, 'c, 'd, 'e, 'f) fmt -> ('a, 'b, 'c, 'd, 'e, 'f) fmt
    12. | String_literal : string + * ('a, 'b, 'c, 'd, 'e, 'f) fmt -> ('a, 'b, 'c, 'd, 'e, 'f) fmt
    13. | Char_literal : char + * ('a, 'b, 'c, 'd, 'e, 'f) fmt -> ('a, 'b, 'c, 'd, 'e, 'f) fmt
    14. | Format_arg : pad_option + * ('g, 'h, 'i, 'j, 'k, 'l) fmtty + * ('a, 'b, 'c, 'd, 'e, 'f) fmt -> (('g, 'h, 'i, 'j, 'k, 'l) format6 -> + 'a, + 'b, + 'c, + 'd, + 'e, + 'f) + fmt
    15. | Format_subst : pad_option + * ('g, 'h, 'i, 'j, 'k, 'l, 'g2, 'b, 'c, 'j2, 'd, 'a) fmtty_rel + * ('a, 'b, 'c, 'd, 'e, 'f) fmt -> (('g, 'h, 'i, 'j, 'k, 'l) format6 -> + 'g2, + 'b, + 'c, + 'j2, + 'e, + 'f) + fmt
    16. | Alpha : ('a, 'b, 'c, 'd, 'e, 'f) fmt -> (('b -> 'x -> 'c) -> + 'x -> + 'a, + 'b, + 'c, + 'd, + 'e, + 'f) + fmt
    17. | Theta : ('a, 'b, 'c, 'd, 'e, 'f) fmt -> (('b -> 'c) -> 'a, 'b, 'c, 'd, 'e, 'f) + fmt
    18. | Formatting_lit : formatting_lit + * ('a, 'b, 'c, 'd, 'e, 'f) fmt -> ('a, 'b, 'c, 'd, 'e, 'f) fmt
    19. | Formatting_gen : ('a1, 'b, 'c, 'd1, 'e1, 'f1) formatting_gen + * ('f1, 'b, 'c, 'e1, 'e2, 'f2) fmt -> ('a1, 'b, 'c, 'd1, 'e2, 'f2) fmt
    20. | Reader : ('a, 'b, 'c, 'd, 'e, 'f) fmt -> ('x -> + 'a, + 'b, + 'c, + ('b -> 'x) -> + 'd, + 'e, + 'f) + fmt
    21. | Scan_char_set : pad_option + * char_set + * ('a, 'b, 'c, 'd, 'e, 'f) fmt -> (string -> 'a, 'b, 'c, 'd, 'e, 'f) fmt
    22. | Scan_get_counter : counter + * ('a, 'b, 'c, 'd, 'e, 'f) fmt -> (int -> 'a, 'b, 'c, 'd, 'e, 'f) fmt
    23. | Scan_next_char : ('a, 'b, 'c, 'd, 'e, 'f) fmt -> (char -> + 'a, + 'b, + 'c, + 'd, + 'e, + 'f) + fmt
    24. | Ignored_param : ('a, 'b, 'c, 'd, 'y, 'x) ignored + * ('x, 'b, 'c, 'y, 'e, 'f) fmt -> ('a, 'b, 'c, 'd, 'e, 'f) fmt
    25. | Custom : ('a, 'x, 'y) custom_arity + * (unit -> + 'x) + * ('a, 'b, 'c, 'd, 'e, 'f) fmt -> ('y, 'b, 'c, 'd, 'e, 'f) fmt
    26. | End_of_format : ('f, 'b, 'c, 'e, 'e, 'f) fmt

    List of format elements.

    and ('a, 'b, 'c, 'd, 'e, 'f) ignored =
    1. | Ignored_char : ('a, 'b, 'c, 'd, 'd, 'a) ignored
    2. | Ignored_caml_char : ('a, 'b, 'c, 'd, 'd, 'a) ignored
    3. | Ignored_string : pad_option -> ('a, 'b, 'c, 'd, 'd, 'a) ignored
    4. | Ignored_caml_string : pad_option -> ('a, 'b, 'c, 'd, 'd, 'a) ignored
    5. | Ignored_int : int_conv * pad_option -> ('a, 'b, 'c, 'd, 'd, 'a) ignored
    6. | Ignored_int32 : int_conv * pad_option -> ('a, 'b, 'c, 'd, 'd, 'a) ignored
    7. | Ignored_nativeint : int_conv * pad_option -> ('a, 'b, 'c, 'd, 'd, 'a) ignored
    8. | Ignored_int64 : int_conv * pad_option -> ('a, 'b, 'c, 'd, 'd, 'a) ignored
    9. | Ignored_float : pad_option * prec_option -> ('a, 'b, 'c, 'd, 'd, 'a) ignored
    10. | Ignored_bool : pad_option -> ('a, 'b, 'c, 'd, 'd, 'a) ignored
    11. | Ignored_format_arg : pad_option + * ('g, 'h, 'i, 'j, 'k, 'l) fmtty -> ('a, 'b, 'c, 'd, 'd, 'a) ignored
    12. | Ignored_format_subst : pad_option + * ('a, 'b, 'c, 'd, 'e, 'f) fmtty -> ('a, 'b, 'c, 'd, 'e, 'f) ignored
    13. | Ignored_reader : ('a, 'b, 'c, ('b -> 'x) -> 'd, 'd, 'a) ignored
    14. | Ignored_scan_char_set : pad_option + * char_set -> ('a, 'b, 'c, 'd, 'd, 'a) ignored
    15. | Ignored_scan_get_counter : counter -> ('a, 'b, 'c, 'd, 'd, 'a) ignored
    16. | Ignored_scan_next_char : ('a, 'b, 'c, 'd, 'd, 'a) ignored
    and ('a, 'b, 'c, 'd, 'e, 'f) format6 =
    1. | Format of ('a, 'b, 'c, 'd, 'e, 'f) fmt * string
    val concat_fmtty : + ('g1, 'b1, 'c1, 'j1, 'd1, 'a1, 'g2, 'b2, 'c2, 'j2, 'd2, 'a2) fmtty_rel -> + ('a1, 'b1, 'c1, 'd1, 'e1, 'f1, 'a2, 'b2, 'c2, 'd2, 'e2, 'f2) fmtty_rel -> + ('g1, 'b1, 'c1, 'j1, 'e1, 'f1, 'g2, 'b2, 'c2, 'j2, 'e2, 'f2) fmtty_rel
    val erase_rel : + ('a, 'b, 'c, 'd, 'e, 'f, 'g, 'h, 'i, 'j, 'k, 'l) fmtty_rel -> + ('a, 'b, 'c, 'd, 'e, 'f) fmtty
    val concat_fmt : + ('a, 'b, 'c, 'd, 'e, 'f) fmt -> + ('f, 'b, 'c, 'e, 'g, 'h) fmt -> + ('a, 'b, 'c, 'd, 'g, 'h) fmt
    diff --git a/ocaml/CamlinternalLazy/index.html b/ocaml/CamlinternalLazy/index.html new file mode 100644 index 0000000..9003828 --- /dev/null +++ b/ocaml/CamlinternalLazy/index.html @@ -0,0 +1,2 @@ + +CamlinternalLazy (ocaml.CamlinternalLazy)

    Module CamlinternalLazy

    Run-time support for lazy values. All functions in this module are for system use only, not for the casual user.

    type 'a t = 'a lazy_t
    exception Undefined
    val force_lazy_block : 'a lazy_t -> 'a
    val force_gen : only_val:bool -> 'a lazy_t -> 'a
    diff --git a/ocaml/CamlinternalMenhirLib/Convert/Simplified/index.html b/ocaml/CamlinternalMenhirLib/Convert/Simplified/index.html new file mode 100644 index 0000000..aeb3ae5 --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/Convert/Simplified/index.html @@ -0,0 +1,8 @@ + +Simplified (ocaml.CamlinternalMenhirLib.Convert.Simplified)

    Module Convert.Simplified

    val traditional2revised : + ('token, 'semantic_value) traditional -> + ('token * Stdlib.Lexing.position * Stdlib.Lexing.position, 'semantic_value) + revised
    val revised2traditional : + ('token * Stdlib.Lexing.position * Stdlib.Lexing.position, 'semantic_value) + revised -> + ('token, 'semantic_value) traditional
    diff --git a/ocaml/CamlinternalMenhirLib/Convert/index.html b/ocaml/CamlinternalMenhirLib/Convert/index.html new file mode 100644 index 0000000..1923373 --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/Convert/index.html @@ -0,0 +1,13 @@ + +Convert (ocaml.CamlinternalMenhirLib.Convert)

    Module CamlinternalMenhirLib.Convert

    type ('token, 'semantic_value) traditional = + (Stdlib.Lexing.lexbuf -> 'token) -> + Stdlib.Lexing.lexbuf -> + 'semantic_value
    type ('token, 'semantic_value) revised = (unit -> 'token) -> 'semantic_value
    val traditional2revised : + ('token -> 'raw_token) -> + ('token -> Stdlib.Lexing.position) -> + ('token -> Stdlib.Lexing.position) -> + ('raw_token, 'semantic_value) traditional -> + ('token, 'semantic_value) revised
    val revised2traditional : + ('raw_token -> Stdlib.Lexing.position -> Stdlib.Lexing.position -> 'token) -> + ('token, 'semantic_value) revised -> + ('raw_token, 'semantic_value) traditional
    module Simplified : sig ... end
    diff --git a/ocaml/CamlinternalMenhirLib/Engine/Make/argument-1-T/Log/index.html b/ocaml/CamlinternalMenhirLib/Engine/Make/argument-1-T/Log/index.html new file mode 100644 index 0000000..ef83f62 --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/Engine/Make/argument-1-T/Log/index.html @@ -0,0 +1,6 @@ + +Log (ocaml.CamlinternalMenhirLib.Engine.Make.T.Log)

    Module T.Log

    val state : state -> unit
    val shift : terminal -> state -> unit
    val reduce_or_accept : production -> unit
    val lookahead_token : + terminal -> + Stdlib.Lexing.position -> + Stdlib.Lexing.position -> + unit
    val initiating_error_handling : unit -> unit
    val resuming_error_handling : unit -> unit
    val handling_error : state -> unit
    diff --git a/ocaml/CamlinternalMenhirLib/Engine/Make/argument-1-T/index.html b/ocaml/CamlinternalMenhirLib/Engine/Make/argument-1-T/index.html new file mode 100644 index 0000000..df88414 --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/Engine/Make/argument-1-T/index.html @@ -0,0 +1,17 @@ + +T (ocaml.CamlinternalMenhirLib.Engine.Make.T)

    Parameter Make.T

    type state
    val number : state -> int
    type token
    type terminal
    type nonterminal
    type semantic_value
    val token2terminal : token -> terminal
    val token2value : token -> semantic_value
    val error_terminal : terminal
    val error_value : semantic_value
    val foreach_terminal : (terminal -> 'a -> 'a) -> 'a -> 'a
    type production
    val production_index : production -> int
    val find_production : int -> production
    val default_reduction : + state -> + ('env -> production -> 'answer) -> + ('env -> 'answer) -> + 'env -> + 'answer
    val action : + state -> + terminal -> + semantic_value -> + ('env -> bool -> terminal -> semantic_value -> state -> 'answer) -> + ('env -> production -> 'answer) -> + ('env -> 'answer) -> + 'env -> + 'answer
    val goto_nt : state -> nonterminal -> state
    val goto_prod : state -> production -> state
    val maybe_goto_nt : state -> nonterminal -> state option
    val is_start : production -> bool
    exception Error
    val semantic_action : production -> semantic_action
    val may_reduce : state -> production -> bool
    val log : bool
    module Log : sig ... end
    diff --git a/ocaml/CamlinternalMenhirLib/Engine/Make/index.html b/ocaml/CamlinternalMenhirLib/Engine/Make/index.html new file mode 100644 index 0000000..80a9595 --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/Engine/Make/index.html @@ -0,0 +1,40 @@ + +Make (ocaml.CamlinternalMenhirLib.Engine.Make)

    Module Engine.Make

    Parameters

    Signature

    include EngineTypes.MONOLITHIC_ENGINE + with type state = T.state + with type token = T.token + with type semantic_value = T.semantic_value
    type state = T.state
    type token = T.token
    type semantic_value = T.semantic_value
    exception Error
    val entry : + [ `Legacy | `Simplified ] -> + state -> + (Stdlib.Lexing.lexbuf -> token) -> + Stdlib.Lexing.lexbuf -> + semantic_value
    include IncrementalEngine.INCREMENTAL_ENGINE + with type token := token + and type 'a lr1state = state + with type production = T.production + with type 'a env = (T.state, T.semantic_value, T.token) EngineTypes.env
    type production = T.production
    type 'a checkpoint = private
    1. | InputNeeded of 'a env
    2. | Shifting of 'a env * 'a env * bool
    3. | AboutToReduce of 'a env * production
    4. | HandlingError of 'a env
    5. | Accepted of 'a
    6. | Rejected
    type strategy = [
    1. | `Legacy
    2. | `Simplified
    ]
    val resume : ?strategy:strategy -> 'a checkpoint -> 'a checkpoint
    val lexer_lexbuf_to_supplier : + (Stdlib.Lexing.lexbuf -> token) -> + Stdlib.Lexing.lexbuf -> + supplier
    val loop : ?strategy:strategy -> supplier -> 'a checkpoint -> 'a
    val loop_handle : + ('a -> 'answer) -> + ('a checkpoint -> 'answer) -> + supplier -> + 'a checkpoint -> + 'answer
    val loop_handle_undo : + ('a -> 'answer) -> + ('a checkpoint -> 'a checkpoint -> 'answer) -> + supplier -> + 'a checkpoint -> + 'answer
    val shifts : 'a checkpoint -> 'a env option
    val acceptable : 'a checkpoint -> token -> IncrementalEngine.position -> bool
    type 'a lr1state = state
    val number : _ lr1state -> int
    val production_index : production -> int
    val find_production : int -> production
    type element =
    1. | Element : 'a lr1state + * 'a + * IncrementalEngine.position + * IncrementalEngine.position -> element
    type stack = element General.stream
    val stack : 'a env -> stack
    val top : 'a env -> element option
    val pop_many : int -> 'a env -> 'a env option
    val get : int -> 'a env -> element option
    val current_state_number : 'a env -> int
    val equal : 'a env -> 'a env -> bool
    val env_has_default_reduction : 'a env -> bool
    val state_has_default_reduction : _ lr1state -> bool
    val pop : 'a env -> 'a env option
    val force_reduction : production -> 'a env -> 'a env
    val input_needed : 'a env -> 'a checkpoint
    include EngineTypes.INCREMENTAL_ENGINE_START + with type state := state + and type semantic_value := semantic_value + and type 'a checkpoint := 'a checkpoint
    diff --git a/ocaml/CamlinternalMenhirLib/Engine/index.html b/ocaml/CamlinternalMenhirLib/Engine/index.html new file mode 100644 index 0000000..af8fca1 --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/Engine/index.html @@ -0,0 +1,9 @@ + +Engine (ocaml.CamlinternalMenhirLib.Engine)

    Module CamlinternalMenhirLib.Engine

    diff --git a/ocaml/CamlinternalMenhirLib/EngineTypes/index.html b/ocaml/CamlinternalMenhirLib/EngineTypes/index.html new file mode 100644 index 0000000..7fb2140 --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/EngineTypes/index.html @@ -0,0 +1,2 @@ + +EngineTypes (ocaml.CamlinternalMenhirLib.EngineTypes)

    Module CamlinternalMenhirLib.EngineTypes

    type ('state, 'semantic_value) stack = {
    1. state : 'state;
    2. semv : 'semantic_value;
    3. startp : Stdlib.Lexing.position;
    4. endp : Stdlib.Lexing.position;
    5. next : ('state, 'semantic_value) stack;
    }
    type ('state, 'semantic_value, 'token) env = {
    1. error : bool;
    2. triple : 'token * Stdlib.Lexing.position * Stdlib.Lexing.position;
    3. stack : ('state, 'semantic_value) stack;
    4. current : 'state;
    }
    module type TABLE = sig ... end
    module type MONOLITHIC_ENGINE = sig ... end
    module type INCREMENTAL_ENGINE_START = sig ... end
    module type ENGINE = sig ... end
    diff --git a/ocaml/CamlinternalMenhirLib/EngineTypes/module-type-ENGINE/index.html b/ocaml/CamlinternalMenhirLib/EngineTypes/module-type-ENGINE/index.html new file mode 100644 index 0000000..abdad3c --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/EngineTypes/module-type-ENGINE/index.html @@ -0,0 +1,35 @@ + +ENGINE (ocaml.CamlinternalMenhirLib.EngineTypes.ENGINE)

    Module type EngineTypes.ENGINE

    include MONOLITHIC_ENGINE
    type state
    type token
    type semantic_value
    exception Error
    val entry : + [ `Legacy | `Simplified ] -> + state -> + (Stdlib.Lexing.lexbuf -> token) -> + Stdlib.Lexing.lexbuf -> + semantic_value
    include IncrementalEngine.INCREMENTAL_ENGINE + with type token := token + and type 'a lr1state = state
    type production
    type 'a env
    type 'a checkpoint = private
    1. | InputNeeded of 'a env
    2. | Shifting of 'a env * 'a env * bool
    3. | AboutToReduce of 'a env * production
    4. | HandlingError of 'a env
    5. | Accepted of 'a
    6. | Rejected
    type strategy = [
    1. | `Legacy
    2. | `Simplified
    ]
    val resume : ?strategy:strategy -> 'a checkpoint -> 'a checkpoint
    val lexer_lexbuf_to_supplier : + (Stdlib.Lexing.lexbuf -> token) -> + Stdlib.Lexing.lexbuf -> + supplier
    val loop : ?strategy:strategy -> supplier -> 'a checkpoint -> 'a
    val loop_handle : + ('a -> 'answer) -> + ('a checkpoint -> 'answer) -> + supplier -> + 'a checkpoint -> + 'answer
    val loop_handle_undo : + ('a -> 'answer) -> + ('a checkpoint -> 'a checkpoint -> 'answer) -> + supplier -> + 'a checkpoint -> + 'answer
    val shifts : 'a checkpoint -> 'a env option
    val acceptable : 'a checkpoint -> token -> IncrementalEngine.position -> bool
    type 'a lr1state = state
    val number : _ lr1state -> int
    val production_index : production -> int
    val find_production : int -> production
    type element =
    1. | Element : 'a lr1state + * 'a + * IncrementalEngine.position + * IncrementalEngine.position -> element
    type stack = element General.stream
    val stack : 'a env -> stack
    val top : 'a env -> element option
    val pop_many : int -> 'a env -> 'a env option
    val get : int -> 'a env -> element option
    val current_state_number : 'a env -> int
    val equal : 'a env -> 'a env -> bool
    val env_has_default_reduction : 'a env -> bool
    val state_has_default_reduction : _ lr1state -> bool
    val pop : 'a env -> 'a env option
    val force_reduction : production -> 'a env -> 'a env
    val input_needed : 'a env -> 'a checkpoint
    include INCREMENTAL_ENGINE_START + with type state := state + and type semantic_value := semantic_value + and type 'a checkpoint := 'a checkpoint
    diff --git a/ocaml/CamlinternalMenhirLib/EngineTypes/module-type-INCREMENTAL_ENGINE_START/index.html b/ocaml/CamlinternalMenhirLib/EngineTypes/module-type-INCREMENTAL_ENGINE_START/index.html new file mode 100644 index 0000000..cef2b61 --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/EngineTypes/module-type-INCREMENTAL_ENGINE_START/index.html @@ -0,0 +1,2 @@ + +INCREMENTAL_ENGINE_START (ocaml.CamlinternalMenhirLib.EngineTypes.INCREMENTAL_ENGINE_START)

    Module type EngineTypes.INCREMENTAL_ENGINE_START

    type state
    type semantic_value
    type 'a checkpoint
    diff --git a/ocaml/CamlinternalMenhirLib/EngineTypes/module-type-MONOLITHIC_ENGINE/index.html b/ocaml/CamlinternalMenhirLib/EngineTypes/module-type-MONOLITHIC_ENGINE/index.html new file mode 100644 index 0000000..f06f975 --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/EngineTypes/module-type-MONOLITHIC_ENGINE/index.html @@ -0,0 +1,7 @@ + +MONOLITHIC_ENGINE (ocaml.CamlinternalMenhirLib.EngineTypes.MONOLITHIC_ENGINE)

    Module type EngineTypes.MONOLITHIC_ENGINE

    type state
    type token
    type semantic_value
    exception Error
    val entry : + [ `Legacy | `Simplified ] -> + state -> + (Stdlib.Lexing.lexbuf -> token) -> + Stdlib.Lexing.lexbuf -> + semantic_value
    diff --git a/ocaml/CamlinternalMenhirLib/EngineTypes/module-type-TABLE/Log/index.html b/ocaml/CamlinternalMenhirLib/EngineTypes/module-type-TABLE/Log/index.html new file mode 100644 index 0000000..523a8e6 --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/EngineTypes/module-type-TABLE/Log/index.html @@ -0,0 +1,6 @@ + +Log (ocaml.CamlinternalMenhirLib.EngineTypes.TABLE.Log)

    Module TABLE.Log

    val state : state -> unit
    val shift : terminal -> state -> unit
    val reduce_or_accept : production -> unit
    val lookahead_token : + terminal -> + Stdlib.Lexing.position -> + Stdlib.Lexing.position -> + unit
    val initiating_error_handling : unit -> unit
    val resuming_error_handling : unit -> unit
    val handling_error : state -> unit
    diff --git a/ocaml/CamlinternalMenhirLib/EngineTypes/module-type-TABLE/index.html b/ocaml/CamlinternalMenhirLib/EngineTypes/module-type-TABLE/index.html new file mode 100644 index 0000000..81d7b30 --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/EngineTypes/module-type-TABLE/index.html @@ -0,0 +1,17 @@ + +TABLE (ocaml.CamlinternalMenhirLib.EngineTypes.TABLE)

    Module type EngineTypes.TABLE

    type state
    val number : state -> int
    type token
    type terminal
    type nonterminal
    type semantic_value
    val token2terminal : token -> terminal
    val token2value : token -> semantic_value
    val error_terminal : terminal
    val error_value : semantic_value
    val foreach_terminal : (terminal -> 'a -> 'a) -> 'a -> 'a
    type production
    val production_index : production -> int
    val find_production : int -> production
    val default_reduction : + state -> + ('env -> production -> 'answer) -> + ('env -> 'answer) -> + 'env -> + 'answer
    val action : + state -> + terminal -> + semantic_value -> + ('env -> bool -> terminal -> semantic_value -> state -> 'answer) -> + ('env -> production -> 'answer) -> + ('env -> 'answer) -> + 'env -> + 'answer
    val goto_nt : state -> nonterminal -> state
    val goto_prod : state -> production -> state
    val maybe_goto_nt : state -> nonterminal -> state option
    val is_start : production -> bool
    exception Error
    type semantic_action = + (state, semantic_value, token) env -> + (state, semantic_value) stack
    val semantic_action : production -> semantic_action
    val may_reduce : state -> production -> bool
    val log : bool
    module Log : sig ... end
    diff --git a/ocaml/CamlinternalMenhirLib/ErrorReports/index.html b/ocaml/CamlinternalMenhirLib/ErrorReports/index.html new file mode 100644 index 0000000..819e134 --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/ErrorReports/index.html @@ -0,0 +1,13 @@ + +ErrorReports (ocaml.CamlinternalMenhirLib.ErrorReports)

    Module CamlinternalMenhirLib.ErrorReports

    type 'a buffer
    val show : ('a -> string) -> 'a buffer -> string
    val last : 'a buffer -> 'a
    val extract : + string -> + (Stdlib.Lexing.position * Stdlib.Lexing.position) -> + string
    val sanitize : string -> string
    val compress : string -> string
    val shorten : int -> string -> string
    val expand : (int -> string) -> string -> string
    diff --git a/ocaml/CamlinternalMenhirLib/General/index.html b/ocaml/CamlinternalMenhirLib/General/index.html new file mode 100644 index 0000000..2ed4ba1 --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/General/index.html @@ -0,0 +1,2 @@ + +General (ocaml.CamlinternalMenhirLib.General)

    Module CamlinternalMenhirLib.General

    val take : int -> 'a list -> 'a list
    val drop : int -> 'a list -> 'a list
    val uniq : ('a -> 'a -> int) -> 'a list -> 'a list
    val weed : ('a -> 'a -> int) -> 'a list -> 'a list
    type 'a stream = 'a head Stdlib.Lazy.t
    and 'a head =
    1. | Nil
    2. | Cons of 'a * 'a stream
    val length : 'a stream -> int
    val foldr : ('a -> 'b -> 'b) -> 'a stream -> 'b -> 'b
    diff --git a/ocaml/CamlinternalMenhirLib/IncrementalEngine/index.html b/ocaml/CamlinternalMenhirLib/IncrementalEngine/index.html new file mode 100644 index 0000000..76303cf --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/IncrementalEngine/index.html @@ -0,0 +1,2 @@ + +IncrementalEngine (ocaml.CamlinternalMenhirLib.IncrementalEngine)

    Module CamlinternalMenhirLib.IncrementalEngine

    type position = Stdlib.Lexing.position
    module type INCREMENTAL_ENGINE = sig ... end
    module type SYMBOLS = sig ... end
    module type INSPECTION = sig ... end
    module type EVERYTHING = sig ... end
    diff --git a/ocaml/CamlinternalMenhirLib/IncrementalEngine/module-type-EVERYTHING/index.html b/ocaml/CamlinternalMenhirLib/IncrementalEngine/module-type-EVERYTHING/index.html new file mode 100644 index 0000000..da23e65 --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/IncrementalEngine/module-type-EVERYTHING/index.html @@ -0,0 +1,18 @@ + +EVERYTHING (ocaml.CamlinternalMenhirLib.IncrementalEngine.EVERYTHING)

    Module type IncrementalEngine.EVERYTHING

    include INCREMENTAL_ENGINE
    type token
    type production
    type 'a env
    type 'a checkpoint = private
    1. | InputNeeded of 'a env
    2. | Shifting of 'a env * 'a env * bool
    3. | AboutToReduce of 'a env * production
    4. | HandlingError of 'a env
    5. | Accepted of 'a
    6. | Rejected
    val offer : 'a checkpoint -> (token * position * position) -> 'a checkpoint
    type strategy = [
    1. | `Legacy
    2. | `Simplified
    ]
    val resume : ?strategy:strategy -> 'a checkpoint -> 'a checkpoint
    type supplier = unit -> token * position * position
    val lexer_lexbuf_to_supplier : + (Stdlib.Lexing.lexbuf -> token) -> + Stdlib.Lexing.lexbuf -> + supplier
    val loop : ?strategy:strategy -> supplier -> 'a checkpoint -> 'a
    val loop_handle : + ('a -> 'answer) -> + ('a checkpoint -> 'answer) -> + supplier -> + 'a checkpoint -> + 'answer
    val loop_handle_undo : + ('a -> 'answer) -> + ('a checkpoint -> 'a checkpoint -> 'answer) -> + supplier -> + 'a checkpoint -> + 'answer
    val shifts : 'a checkpoint -> 'a env option
    val acceptable : 'a checkpoint -> token -> position -> bool
    type 'a lr1state
    val number : _ lr1state -> int
    val production_index : production -> int
    val find_production : int -> production
    type element =
    1. | Element : 'a lr1state * 'a * position * position -> element
    type stack = element General.stream
    val stack : 'a env -> stack
    val top : 'a env -> element option
    val pop_many : int -> 'a env -> 'a env option
    val get : int -> 'a env -> element option
    val current_state_number : 'a env -> int
    val equal : 'a env -> 'a env -> bool
    val positions : 'a env -> position * position
    val env_has_default_reduction : 'a env -> bool
    val state_has_default_reduction : _ lr1state -> bool
    val pop : 'a env -> 'a env option
    val force_reduction : production -> 'a env -> 'a env
    val input_needed : 'a env -> 'a checkpoint
    include INSPECTION + with type 'a lr1state := 'a lr1state + with type production := production + with type 'a env := 'a env
    include SYMBOLS
    type 'a terminal
    type 'a nonterminal
    type 'a symbol =
    1. | T : 'a terminal -> 'a symbol
    2. | N : 'a nonterminal -> 'a symbol
    type xsymbol =
    1. | X : 'a symbol -> xsymbol
    type item = production * int
    val compare_terminals : _ terminal -> _ terminal -> int
    val compare_nonterminals : _ nonterminal -> _ nonterminal -> int
    val compare_symbols : xsymbol -> xsymbol -> int
    val compare_productions : production -> production -> int
    val compare_items : item -> item -> int
    val incoming_symbol : 'a lr1state -> 'a symbol
    val items : _ lr1state -> item list
    val lhs : production -> xsymbol
    val rhs : production -> xsymbol list
    val nullable : _ nonterminal -> bool
    val first : _ nonterminal -> _ terminal -> bool
    val xfirst : xsymbol -> _ terminal -> bool
    val foreach_terminal : (xsymbol -> 'a -> 'a) -> 'a -> 'a
    val foreach_terminal_but_error : (xsymbol -> 'a -> 'a) -> 'a -> 'a
    val feed : 'a symbol -> position -> 'a -> position -> 'b env -> 'b env
    diff --git a/ocaml/CamlinternalMenhirLib/IncrementalEngine/module-type-INCREMENTAL_ENGINE/index.html b/ocaml/CamlinternalMenhirLib/IncrementalEngine/module-type-INCREMENTAL_ENGINE/index.html new file mode 100644 index 0000000..b7f1983 --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/IncrementalEngine/module-type-INCREMENTAL_ENGINE/index.html @@ -0,0 +1,15 @@ + +INCREMENTAL_ENGINE (ocaml.CamlinternalMenhirLib.IncrementalEngine.INCREMENTAL_ENGINE)

    Module type IncrementalEngine.INCREMENTAL_ENGINE

    type token
    type production
    type 'a env
    type 'a checkpoint = private
    1. | InputNeeded of 'a env
    2. | Shifting of 'a env * 'a env * bool
    3. | AboutToReduce of 'a env * production
    4. | HandlingError of 'a env
    5. | Accepted of 'a
    6. | Rejected
    val offer : 'a checkpoint -> (token * position * position) -> 'a checkpoint
    type strategy = [
    1. | `Legacy
    2. | `Simplified
    ]
    val resume : ?strategy:strategy -> 'a checkpoint -> 'a checkpoint
    type supplier = unit -> token * position * position
    val lexer_lexbuf_to_supplier : + (Stdlib.Lexing.lexbuf -> token) -> + Stdlib.Lexing.lexbuf -> + supplier
    val loop : ?strategy:strategy -> supplier -> 'a checkpoint -> 'a
    val loop_handle : + ('a -> 'answer) -> + ('a checkpoint -> 'answer) -> + supplier -> + 'a checkpoint -> + 'answer
    val loop_handle_undo : + ('a -> 'answer) -> + ('a checkpoint -> 'a checkpoint -> 'answer) -> + supplier -> + 'a checkpoint -> + 'answer
    val shifts : 'a checkpoint -> 'a env option
    val acceptable : 'a checkpoint -> token -> position -> bool
    type 'a lr1state
    val number : _ lr1state -> int
    val production_index : production -> int
    val find_production : int -> production
    type element =
    1. | Element : 'a lr1state * 'a * position * position -> element
    type stack = element General.stream
    val stack : 'a env -> stack
    val top : 'a env -> element option
    val pop_many : int -> 'a env -> 'a env option
    val get : int -> 'a env -> element option
    val current_state_number : 'a env -> int
    val equal : 'a env -> 'a env -> bool
    val positions : 'a env -> position * position
    val env_has_default_reduction : 'a env -> bool
    val state_has_default_reduction : _ lr1state -> bool
    val pop : 'a env -> 'a env option
    val force_reduction : production -> 'a env -> 'a env
    val input_needed : 'a env -> 'a checkpoint
    diff --git a/ocaml/CamlinternalMenhirLib/IncrementalEngine/module-type-INSPECTION/index.html b/ocaml/CamlinternalMenhirLib/IncrementalEngine/module-type-INSPECTION/index.html new file mode 100644 index 0000000..b43c551 --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/IncrementalEngine/module-type-INSPECTION/index.html @@ -0,0 +1,2 @@ + +INSPECTION (ocaml.CamlinternalMenhirLib.IncrementalEngine.INSPECTION)

    Module type IncrementalEngine.INSPECTION

    include SYMBOLS
    type 'a terminal
    type 'a nonterminal
    type 'a symbol =
    1. | T : 'a terminal -> 'a symbol
    2. | N : 'a nonterminal -> 'a symbol
    type xsymbol =
    1. | X : 'a symbol -> xsymbol
    type 'a lr1state
    type production
    type item = production * int
    val compare_terminals : _ terminal -> _ terminal -> int
    val compare_nonterminals : _ nonterminal -> _ nonterminal -> int
    val compare_symbols : xsymbol -> xsymbol -> int
    val compare_productions : production -> production -> int
    val compare_items : item -> item -> int
    val incoming_symbol : 'a lr1state -> 'a symbol
    val items : _ lr1state -> item list
    val lhs : production -> xsymbol
    val rhs : production -> xsymbol list
    val nullable : _ nonterminal -> bool
    val first : _ nonterminal -> _ terminal -> bool
    val xfirst : xsymbol -> _ terminal -> bool
    val foreach_terminal : (xsymbol -> 'a -> 'a) -> 'a -> 'a
    val foreach_terminal_but_error : (xsymbol -> 'a -> 'a) -> 'a -> 'a
    type 'a env
    val feed : 'a symbol -> position -> 'a -> position -> 'b env -> 'b env
    diff --git a/ocaml/CamlinternalMenhirLib/IncrementalEngine/module-type-SYMBOLS/index.html b/ocaml/CamlinternalMenhirLib/IncrementalEngine/module-type-SYMBOLS/index.html new file mode 100644 index 0000000..3818e90 --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/IncrementalEngine/module-type-SYMBOLS/index.html @@ -0,0 +1,2 @@ + +SYMBOLS (ocaml.CamlinternalMenhirLib.IncrementalEngine.SYMBOLS)

    Module type IncrementalEngine.SYMBOLS

    type 'a terminal
    type 'a nonterminal
    type 'a symbol =
    1. | T : 'a terminal -> 'a symbol
    2. | N : 'a nonterminal -> 'a symbol
    type xsymbol =
    1. | X : 'a symbol -> xsymbol
    diff --git a/ocaml/CamlinternalMenhirLib/InfiniteArray/index.html b/ocaml/CamlinternalMenhirLib/InfiniteArray/index.html new file mode 100644 index 0000000..ed52e67 --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/InfiniteArray/index.html @@ -0,0 +1,2 @@ + +InfiniteArray (ocaml.CamlinternalMenhirLib.InfiniteArray)

    Module CamlinternalMenhirLib.InfiniteArray

    type 'a t

    This module implements infinite arrays. *

    val make : 'a -> 'a t

    make x creates an infinite array, where every slot contains x. *

    val get : 'a t -> int -> 'a

    get a i returns the element contained at offset i in the array a. Slots are numbered 0 and up. *

    val set : 'a t -> int -> 'a -> unit

    set a i x sets the element contained at offset i in the array a to x. Slots are numbered 0 and up. *

    val extent : 'a t -> int

    extent a is the length of an initial segment of the array a that is sufficiently large to contain all set operations ever performed. In other words, all elements beyond that segment have the default value.

    val domain : 'a t -> 'a array

    domain a is a fresh copy of an initial segment of the array a whose length is extent a.

    diff --git a/ocaml/CamlinternalMenhirLib/InspectionTableFormat/index.html b/ocaml/CamlinternalMenhirLib/InspectionTableFormat/index.html new file mode 100644 index 0000000..4507d14 --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/InspectionTableFormat/index.html @@ -0,0 +1,2 @@ + +InspectionTableFormat (ocaml.CamlinternalMenhirLib.InspectionTableFormat)

    Module CamlinternalMenhirLib.InspectionTableFormat

    module type TABLES = sig ... end
    diff --git a/ocaml/CamlinternalMenhirLib/InspectionTableFormat/module-type-TABLES/index.html b/ocaml/CamlinternalMenhirLib/InspectionTableFormat/module-type-TABLES/index.html new file mode 100644 index 0000000..93b169f --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/InspectionTableFormat/module-type-TABLES/index.html @@ -0,0 +1,2 @@ + +TABLES (ocaml.CamlinternalMenhirLib.InspectionTableFormat.TABLES)

    Module type InspectionTableFormat.TABLES

    include IncrementalEngine.SYMBOLS
    type 'a terminal
    type 'a nonterminal
    type 'a symbol =
    1. | T : 'a terminal -> 'a symbol
    2. | N : 'a nonterminal -> 'a symbol
    type xsymbol =
    1. | X : 'a symbol -> xsymbol
    type 'a lr1state
    val terminal : int -> xsymbol
    val nonterminal : int -> xsymbol
    val lr0_core : PackedIntArray.t
    val lr0_incoming : PackedIntArray.t
    val nullable : string
    val first : int * string
    diff --git a/ocaml/CamlinternalMenhirLib/InspectionTableInterpreter/Make/argument-1-TT/index.html b/ocaml/CamlinternalMenhirLib/InspectionTableInterpreter/Make/argument-1-TT/index.html new file mode 100644 index 0000000..81c7f48 --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/InspectionTableInterpreter/Make/argument-1-TT/index.html @@ -0,0 +1,5 @@ + +TT (ocaml.CamlinternalMenhirLib.InspectionTableInterpreter.Make.TT)

    Parameter Make.TT

    type token
    val token2terminal : token -> int
    val error_terminal : int
    val token2value : token -> Stdlib.Obj.t
    val default_reduction : PackedIntArray.t
    val error : int * string
    val start : int
    val semantic_action : + ((int, Stdlib.Obj.t, token) EngineTypes.env -> + (int, Stdlib.Obj.t) EngineTypes.stack) + array
    exception Error
    val trace : (string array * string array) option
    diff --git a/ocaml/CamlinternalMenhirLib/InspectionTableInterpreter/Make/argument-2-IT/index.html b/ocaml/CamlinternalMenhirLib/InspectionTableInterpreter/Make/argument-2-IT/index.html new file mode 100644 index 0000000..6652890 --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/InspectionTableInterpreter/Make/argument-2-IT/index.html @@ -0,0 +1,2 @@ + +IT (ocaml.CamlinternalMenhirLib.InspectionTableInterpreter.Make.IT)

    Parameter Make.IT

    include IncrementalEngine.SYMBOLS
    type 'a terminal
    type 'a nonterminal
    type 'a symbol =
    1. | T : 'a terminal -> 'a symbol
    2. | N : 'a nonterminal -> 'a symbol
    type xsymbol =
    1. | X : 'a symbol -> xsymbol
    type 'a lr1state = int
    val terminal : int -> xsymbol
    val nonterminal : int -> xsymbol
    val lr0_core : PackedIntArray.t
    val lr0_incoming : PackedIntArray.t
    val nullable : string
    val first : int * string
    diff --git a/ocaml/CamlinternalMenhirLib/InspectionTableInterpreter/Make/argument-3-ET/Log/index.html b/ocaml/CamlinternalMenhirLib/InspectionTableInterpreter/Make/argument-3-ET/Log/index.html new file mode 100644 index 0000000..c6def25 --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/InspectionTableInterpreter/Make/argument-3-ET/Log/index.html @@ -0,0 +1,6 @@ + +Log (ocaml.CamlinternalMenhirLib.InspectionTableInterpreter.Make.ET.Log)

    Module ET.Log

    val state : state -> unit
    val shift : terminal -> state -> unit
    val reduce_or_accept : production -> unit
    val lookahead_token : + terminal -> + Stdlib.Lexing.position -> + Stdlib.Lexing.position -> + unit
    val initiating_error_handling : unit -> unit
    val resuming_error_handling : unit -> unit
    val handling_error : state -> unit
    diff --git a/ocaml/CamlinternalMenhirLib/InspectionTableInterpreter/Make/argument-3-ET/index.html b/ocaml/CamlinternalMenhirLib/InspectionTableInterpreter/Make/argument-3-ET/index.html new file mode 100644 index 0000000..d04eb4a --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/InspectionTableInterpreter/Make/argument-3-ET/index.html @@ -0,0 +1,17 @@ + +ET (ocaml.CamlinternalMenhirLib.InspectionTableInterpreter.Make.ET)

    Parameter Make.ET

    type state
    val number : state -> int
    type token
    type terminal = int
    type nonterminal = int
    type semantic_value = Stdlib.Obj.t
    val token2terminal : token -> terminal
    val token2value : token -> semantic_value
    val error_terminal : terminal
    val error_value : semantic_value
    val foreach_terminal : (terminal -> 'a -> 'a) -> 'a -> 'a
    type production
    val production_index : production -> int
    val find_production : int -> production
    val default_reduction : + state -> + ('env -> production -> 'answer) -> + ('env -> 'answer) -> + 'env -> + 'answer
    val action : + state -> + terminal -> + semantic_value -> + ('env -> bool -> terminal -> semantic_value -> state -> 'answer) -> + ('env -> production -> 'answer) -> + ('env -> 'answer) -> + 'env -> + 'answer
    val goto_nt : state -> nonterminal -> state
    val goto_prod : state -> production -> state
    val maybe_goto_nt : state -> nonterminal -> state option
    val is_start : production -> bool
    exception Error
    val semantic_action : production -> semantic_action
    val may_reduce : state -> production -> bool
    val log : bool
    module Log : sig ... end
    diff --git a/ocaml/CamlinternalMenhirLib/InspectionTableInterpreter/Make/argument-4-E/index.html b/ocaml/CamlinternalMenhirLib/InspectionTableInterpreter/Make/argument-4-E/index.html new file mode 100644 index 0000000..9312040 --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/InspectionTableInterpreter/Make/argument-4-E/index.html @@ -0,0 +1,2 @@ + +E (ocaml.CamlinternalMenhirLib.InspectionTableInterpreter.Make.E)

    Parameter Make.E

    diff --git a/ocaml/CamlinternalMenhirLib/InspectionTableInterpreter/Make/index.html b/ocaml/CamlinternalMenhirLib/InspectionTableInterpreter/Make/index.html new file mode 100644 index 0000000..8b34504 --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/InspectionTableInterpreter/Make/index.html @@ -0,0 +1,14 @@ + +Make (ocaml.CamlinternalMenhirLib.InspectionTableInterpreter.Make)

    Module InspectionTableInterpreter.Make

    Parameters

    module IT : InspectionTableFormat.TABLES with type 'a lr1state = int
    module ET : + EngineTypes.TABLE + with type terminal = int + and type nonterminal = int + and type semantic_value = Stdlib.Obj.t
    module E : sig ... end

    Signature

    include IncrementalEngine.SYMBOLS + with type 'a terminal := 'a IT.terminal + with type 'a nonterminal := 'a IT.nonterminal
    type 'a symbol =
    1. | T : 'a IT.terminal -> 'a symbol
    2. | N : 'a IT.nonterminal -> 'a symbol
    type xsymbol =
    1. | X : 'a symbol -> xsymbol
    type item = int * int
    val compare_terminals : _ IT.terminal -> _ IT.terminal -> int
    val compare_nonterminals : _ IT.nonterminal -> _ IT.nonterminal -> int
    val compare_symbols : xsymbol -> xsymbol -> int
    val compare_productions : int -> int -> int
    val compare_items : item -> item -> int
    val incoming_symbol : 'a IT.lr1state -> 'a symbol
    val items : _ IT.lr1state -> item list
    val lhs : int -> xsymbol
    val rhs : int -> xsymbol list
    val nullable : _ IT.nonterminal -> bool
    val first : _ IT.nonterminal -> _ IT.terminal -> bool
    val xfirst : xsymbol -> _ IT.terminal -> bool
    val foreach_terminal : (xsymbol -> 'a -> 'a) -> 'a -> 'a
    val foreach_terminal_but_error : (xsymbol -> 'a -> 'a) -> 'a -> 'a
    val feed : + 'a symbol -> + IncrementalEngine.position -> + 'a -> + IncrementalEngine.position -> + 'b E.env -> + 'b E.env
    diff --git a/ocaml/CamlinternalMenhirLib/InspectionTableInterpreter/Symbols/argument-1-T/index.html b/ocaml/CamlinternalMenhirLib/InspectionTableInterpreter/Symbols/argument-1-T/index.html new file mode 100644 index 0000000..d4502fc --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/InspectionTableInterpreter/Symbols/argument-1-T/index.html @@ -0,0 +1,2 @@ + +T (ocaml.CamlinternalMenhirLib.InspectionTableInterpreter.Symbols.T)

    Parameter Symbols.T

    type 'a terminal
    type 'a nonterminal
    diff --git a/ocaml/CamlinternalMenhirLib/InspectionTableInterpreter/Symbols/index.html b/ocaml/CamlinternalMenhirLib/InspectionTableInterpreter/Symbols/index.html new file mode 100644 index 0000000..10bbbca --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/InspectionTableInterpreter/Symbols/index.html @@ -0,0 +1,2 @@ + +Symbols (ocaml.CamlinternalMenhirLib.InspectionTableInterpreter.Symbols)

    Module InspectionTableInterpreter.Symbols

    Parameters

    module T : sig ... end

    Signature

    type 'a symbol =
    1. | T : 'a T.terminal -> 'a symbol
    2. | N : 'a T.nonterminal -> 'a symbol
    type xsymbol =
    1. | X : 'a symbol -> xsymbol
    diff --git a/ocaml/CamlinternalMenhirLib/InspectionTableInterpreter/index.html b/ocaml/CamlinternalMenhirLib/InspectionTableInterpreter/index.html new file mode 100644 index 0000000..f2229b4 --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/InspectionTableInterpreter/index.html @@ -0,0 +1,20 @@ + +InspectionTableInterpreter (ocaml.CamlinternalMenhirLib.InspectionTableInterpreter)

    Module CamlinternalMenhirLib.InspectionTableInterpreter

    module Symbols + (T : sig ... end) : + IncrementalEngine.SYMBOLS + with type 'a terminal := 'a T.terminal + and type 'a nonterminal := 'a T.nonterminal
    module Make + (TT : TableFormat.TABLES) + (IT : InspectionTableFormat.TABLES with type 'a lr1state = int) + (ET : + EngineTypes.TABLE + with type terminal = int + and type nonterminal = int + and type semantic_value = Stdlib.Obj.t) + (E : sig ... end) : + IncrementalEngine.INSPECTION + with type 'a terminal := 'a IT.terminal + and type 'a nonterminal := 'a IT.nonterminal + and type 'a lr1state := 'a IT.lr1state + and type production := int + and type 'a env := 'a E.env
    diff --git a/ocaml/CamlinternalMenhirLib/LexerUtil/index.html b/ocaml/CamlinternalMenhirLib/LexerUtil/index.html new file mode 100644 index 0000000..0523216 --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/LexerUtil/index.html @@ -0,0 +1,2 @@ + +LexerUtil (ocaml.CamlinternalMenhirLib.LexerUtil)

    Module CamlinternalMenhirLib.LexerUtil

    val read : string -> string * Stdlib.Lexing.lexbuf
    val newline : Stdlib.Lexing.lexbuf -> unit
    diff --git a/ocaml/CamlinternalMenhirLib/LinearizedArray/index.html b/ocaml/CamlinternalMenhirLib/LinearizedArray/index.html new file mode 100644 index 0000000..bba14d7 --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/LinearizedArray/index.html @@ -0,0 +1,2 @@ + +LinearizedArray (ocaml.CamlinternalMenhirLib.LinearizedArray)

    Module CamlinternalMenhirLib.LinearizedArray

    type 'a t = 'a array * int array
    val make : 'a array array -> 'a t
    val read : 'a t -> int -> int -> 'a
    val write : 'a t -> int -> int -> 'a -> unit
    val length : 'a t -> int
    val row_length : 'a t -> int -> int
    val read_row : 'a t -> int -> 'a list
    val row_length_via : (int -> int) -> int -> int
    val read_via : (int -> 'a) -> (int -> int) -> int -> int -> 'a
    val read_row_via : (int -> 'a) -> (int -> int) -> int -> 'a list
    diff --git a/ocaml/CamlinternalMenhirLib/PackedIntArray/index.html b/ocaml/CamlinternalMenhirLib/PackedIntArray/index.html new file mode 100644 index 0000000..ff4457e --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/PackedIntArray/index.html @@ -0,0 +1,2 @@ + +PackedIntArray (ocaml.CamlinternalMenhirLib.PackedIntArray)

    Module CamlinternalMenhirLib.PackedIntArray

    type t = int * string
    val pack : int array -> t
    val get : t -> int -> int
    val get1 : string -> int -> int
    val unflatten1 : (int * string) -> int -> int -> int
    diff --git a/ocaml/CamlinternalMenhirLib/Printers/Make/argument-1-I/index.html b/ocaml/CamlinternalMenhirLib/Printers/Make/argument-1-I/index.html new file mode 100644 index 0000000..6f91949 --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/Printers/Make/argument-1-I/index.html @@ -0,0 +1,34 @@ + +I (ocaml.CamlinternalMenhirLib.Printers.Make.I)

    Parameter Make.I

    include IncrementalEngine.INCREMENTAL_ENGINE
    type token
    type production
    type 'a env
    type 'a checkpoint = private
    1. | InputNeeded of 'a env
    2. | Shifting of 'a env * 'a env * bool
    3. | AboutToReduce of 'a env * production
    4. | HandlingError of 'a env
    5. | Accepted of 'a
    6. | Rejected
    type strategy = [
    1. | `Legacy
    2. | `Simplified
    ]
    val resume : ?strategy:strategy -> 'a checkpoint -> 'a checkpoint
    val lexer_lexbuf_to_supplier : + (Stdlib.Lexing.lexbuf -> token) -> + Stdlib.Lexing.lexbuf -> + supplier
    val loop : ?strategy:strategy -> supplier -> 'a checkpoint -> 'a
    val loop_handle : + ('a -> 'answer) -> + ('a checkpoint -> 'answer) -> + supplier -> + 'a checkpoint -> + 'answer
    val loop_handle_undo : + ('a -> 'answer) -> + ('a checkpoint -> 'a checkpoint -> 'answer) -> + supplier -> + 'a checkpoint -> + 'answer
    val shifts : 'a checkpoint -> 'a env option
    val acceptable : 'a checkpoint -> token -> IncrementalEngine.position -> bool
    type 'a lr1state
    val number : _ lr1state -> int
    val production_index : production -> int
    val find_production : int -> production
    type element =
    1. | Element : 'a lr1state + * 'a + * IncrementalEngine.position + * IncrementalEngine.position -> element
    type stack = element General.stream
    val stack : 'a env -> stack
    val top : 'a env -> element option
    val pop_many : int -> 'a env -> 'a env option
    val get : int -> 'a env -> element option
    val current_state_number : 'a env -> int
    val equal : 'a env -> 'a env -> bool
    val env_has_default_reduction : 'a env -> bool
    val state_has_default_reduction : _ lr1state -> bool
    val pop : 'a env -> 'a env option
    val force_reduction : production -> 'a env -> 'a env
    val input_needed : 'a env -> 'a checkpoint
    include IncrementalEngine.INSPECTION + with type 'a lr1state := 'a lr1state + with type production := production + with type 'a env := 'a env
    include IncrementalEngine.SYMBOLS
    type 'a terminal
    type 'a nonterminal
    type 'a symbol =
    1. | T : 'a terminal -> 'a symbol
    2. | N : 'a nonterminal -> 'a symbol
    type xsymbol =
    1. | X : 'a symbol -> xsymbol
    type item = production * int
    val compare_terminals : _ terminal -> _ terminal -> int
    val compare_nonterminals : _ nonterminal -> _ nonterminal -> int
    val compare_symbols : xsymbol -> xsymbol -> int
    val compare_productions : production -> production -> int
    val compare_items : item -> item -> int
    val incoming_symbol : 'a lr1state -> 'a symbol
    val items : _ lr1state -> item list
    val lhs : production -> xsymbol
    val rhs : production -> xsymbol list
    val nullable : _ nonterminal -> bool
    val first : _ nonterminal -> _ terminal -> bool
    val xfirst : xsymbol -> _ terminal -> bool
    val foreach_terminal : (xsymbol -> 'a -> 'a) -> 'a -> 'a
    val foreach_terminal_but_error : (xsymbol -> 'a -> 'a) -> 'a -> 'a
    val feed : + 'a symbol -> + IncrementalEngine.position -> + 'a -> + IncrementalEngine.position -> + 'b env -> + 'b env
    diff --git a/ocaml/CamlinternalMenhirLib/Printers/Make/argument-2-User/index.html b/ocaml/CamlinternalMenhirLib/Printers/Make/argument-2-User/index.html new file mode 100644 index 0000000..5fafff3 --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/Printers/Make/argument-2-User/index.html @@ -0,0 +1,2 @@ + +User (ocaml.CamlinternalMenhirLib.Printers.Make.User)

    Parameter Make.User

    val print : string -> unit
    val print_symbol : I.xsymbol -> unit
    val print_element : (I.element -> unit) option
    diff --git a/ocaml/CamlinternalMenhirLib/Printers/Make/index.html b/ocaml/CamlinternalMenhirLib/Printers/Make/index.html new file mode 100644 index 0000000..0a15269 --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/Printers/Make/index.html @@ -0,0 +1,2 @@ + +Make (ocaml.CamlinternalMenhirLib.Printers.Make)

    Module Printers.Make

    Parameters

    module User : sig ... end

    Signature

    val print_symbols : I.xsymbol list -> unit
    val print_element_as_symbol : I.element -> unit
    val print_stack : 'a I.env -> unit
    val print_item : I.item -> unit
    val print_production : I.production -> unit
    val print_current_state : 'a I.env -> unit
    val print_env : 'a I.env -> unit
    diff --git a/ocaml/CamlinternalMenhirLib/Printers/index.html b/ocaml/CamlinternalMenhirLib/Printers/index.html new file mode 100644 index 0000000..56bf72e --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/Printers/index.html @@ -0,0 +1,5 @@ + +Printers (ocaml.CamlinternalMenhirLib.Printers)

    Module CamlinternalMenhirLib.Printers

    module Make + (I : IncrementalEngine.EVERYTHING) + (User : sig ... end) : + sig ... end
    diff --git a/ocaml/CamlinternalMenhirLib/RowDisplacement/index.html b/ocaml/CamlinternalMenhirLib/RowDisplacement/index.html new file mode 100644 index 0000000..b24dc18 --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/RowDisplacement/index.html @@ -0,0 +1,15 @@ + +RowDisplacement (ocaml.CamlinternalMenhirLib.RowDisplacement)

    Module CamlinternalMenhirLib.RowDisplacement

    type 'a table = int array * 'a array
    val compress : + ('a -> 'a -> bool) -> + ('a -> bool) -> + 'a -> + int -> + int -> + 'a array array -> + 'a table
    val get : 'a table -> int -> int -> 'a
    val getget : + ('displacement -> int -> int) -> + ('data -> int -> 'a) -> + ('displacement * 'data) -> + int -> + int -> + 'a
    diff --git a/ocaml/CamlinternalMenhirLib/StaticVersion/index.html b/ocaml/CamlinternalMenhirLib/StaticVersion/index.html new file mode 100644 index 0000000..bc42034 --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/StaticVersion/index.html @@ -0,0 +1,2 @@ + +StaticVersion (ocaml.CamlinternalMenhirLib.StaticVersion)

    Module CamlinternalMenhirLib.StaticVersion

    val require_20210419 : unit
    diff --git a/ocaml/CamlinternalMenhirLib/TableFormat/index.html b/ocaml/CamlinternalMenhirLib/TableFormat/index.html new file mode 100644 index 0000000..6624890 --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/TableFormat/index.html @@ -0,0 +1,2 @@ + +TableFormat (ocaml.CamlinternalMenhirLib.TableFormat)

    Module CamlinternalMenhirLib.TableFormat

    module type TABLES = sig ... end
    diff --git a/ocaml/CamlinternalMenhirLib/TableFormat/module-type-TABLES/index.html b/ocaml/CamlinternalMenhirLib/TableFormat/module-type-TABLES/index.html new file mode 100644 index 0000000..e30b552 --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/TableFormat/module-type-TABLES/index.html @@ -0,0 +1,5 @@ + +TABLES (ocaml.CamlinternalMenhirLib.TableFormat.TABLES)

    Module type TableFormat.TABLES

    type token
    val token2terminal : token -> int
    val error_terminal : int
    val token2value : token -> Stdlib.Obj.t
    val default_reduction : PackedIntArray.t
    val error : int * string
    val start : int
    val semantic_action : + ((int, Stdlib.Obj.t, token) EngineTypes.env -> + (int, Stdlib.Obj.t) EngineTypes.stack) + array
    exception Error
    val trace : (string array * string array) option
    diff --git a/ocaml/CamlinternalMenhirLib/TableInterpreter/MakeEngineTable/Log/index.html b/ocaml/CamlinternalMenhirLib/TableInterpreter/MakeEngineTable/Log/index.html new file mode 100644 index 0000000..9b1b938 --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/TableInterpreter/MakeEngineTable/Log/index.html @@ -0,0 +1,6 @@ + +Log (ocaml.CamlinternalMenhirLib.TableInterpreter.MakeEngineTable.Log)

    Module MakeEngineTable.Log

    val state : state -> unit
    val shift : terminal -> state -> unit
    val reduce_or_accept : production -> unit
    val lookahead_token : + terminal -> + Stdlib.Lexing.position -> + Stdlib.Lexing.position -> + unit
    val initiating_error_handling : unit -> unit
    val resuming_error_handling : unit -> unit
    val handling_error : state -> unit
    diff --git a/ocaml/CamlinternalMenhirLib/TableInterpreter/MakeEngineTable/argument-1-T/index.html b/ocaml/CamlinternalMenhirLib/TableInterpreter/MakeEngineTable/argument-1-T/index.html new file mode 100644 index 0000000..027778e --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/TableInterpreter/MakeEngineTable/argument-1-T/index.html @@ -0,0 +1,5 @@ + +T (ocaml.CamlinternalMenhirLib.TableInterpreter.MakeEngineTable.T)

    Parameter MakeEngineTable.T

    type token
    val token2terminal : token -> int
    val error_terminal : int
    val token2value : token -> Stdlib.Obj.t
    val default_reduction : PackedIntArray.t
    val error : int * string
    val start : int
    val semantic_action : + ((int, Stdlib.Obj.t, token) EngineTypes.env -> + (int, Stdlib.Obj.t) EngineTypes.stack) + array
    exception Error
    val trace : (string array * string array) option
    diff --git a/ocaml/CamlinternalMenhirLib/TableInterpreter/MakeEngineTable/index.html b/ocaml/CamlinternalMenhirLib/TableInterpreter/MakeEngineTable/index.html new file mode 100644 index 0000000..ff6f663 --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/TableInterpreter/MakeEngineTable/index.html @@ -0,0 +1,17 @@ + +MakeEngineTable (ocaml.CamlinternalMenhirLib.TableInterpreter.MakeEngineTable)

    Module TableInterpreter.MakeEngineTable

    Parameters

    Signature

    type state = int
    val number : state -> int
    type token = T.token
    type terminal = int
    type nonterminal = int
    type semantic_value = Stdlib.Obj.t
    val token2terminal : token -> terminal
    val token2value : token -> semantic_value
    val error_terminal : terminal
    val error_value : semantic_value
    val foreach_terminal : (terminal -> 'a -> 'a) -> 'a -> 'a
    type production = int
    val production_index : production -> int
    val find_production : int -> production
    val default_reduction : + state -> + ('env -> production -> 'answer) -> + ('env -> 'answer) -> + 'env -> + 'answer
    val action : + state -> + terminal -> + semantic_value -> + ('env -> bool -> terminal -> semantic_value -> state -> 'answer) -> + ('env -> production -> 'answer) -> + ('env -> 'answer) -> + 'env -> + 'answer
    val goto_nt : state -> nonterminal -> state
    val goto_prod : state -> production -> state
    val maybe_goto_nt : state -> nonterminal -> state option
    val is_start : production -> bool
    exception Error
    val semantic_action : production -> semantic_action
    val may_reduce : state -> production -> bool
    val log : bool
    module Log : sig ... end
    diff --git a/ocaml/CamlinternalMenhirLib/TableInterpreter/index.html b/ocaml/CamlinternalMenhirLib/TableInterpreter/index.html new file mode 100644 index 0000000..0c9c330 --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/TableInterpreter/index.html @@ -0,0 +1,10 @@ + +TableInterpreter (ocaml.CamlinternalMenhirLib.TableInterpreter)

    Module CamlinternalMenhirLib.TableInterpreter

    module MakeEngineTable + (T : TableFormat.TABLES) : + EngineTypes.TABLE + with type state = int + and type token = T.token + and type semantic_value = Stdlib.Obj.t + and type production = int + and type terminal = int + and type nonterminal = int
    diff --git a/ocaml/CamlinternalMenhirLib/index.html b/ocaml/CamlinternalMenhirLib/index.html new file mode 100644 index 0000000..7970894 --- /dev/null +++ b/ocaml/CamlinternalMenhirLib/index.html @@ -0,0 +1,2 @@ + +CamlinternalMenhirLib (ocaml.CamlinternalMenhirLib)

    Module CamlinternalMenhirLib

    module General : sig ... end
    module Convert : sig ... end
    module IncrementalEngine : sig ... end
    module EngineTypes : sig ... end
    module Engine : sig ... end
    module ErrorReports : sig ... end
    module LexerUtil : sig ... end
    module Printers : sig ... end
    module InfiniteArray : sig ... end
    module PackedIntArray : sig ... end
    module RowDisplacement : sig ... end
    module LinearizedArray : sig ... end
    module TableFormat : sig ... end
    module InspectionTableFormat : sig ... end
    module InspectionTableInterpreter : sig ... end
    module TableInterpreter : sig ... end
    module StaticVersion : sig ... end
    diff --git a/ocaml/CamlinternalMod/index.html b/ocaml/CamlinternalMod/index.html new file mode 100644 index 0000000..f75dab0 --- /dev/null +++ b/ocaml/CamlinternalMod/index.html @@ -0,0 +1,2 @@ + +CamlinternalMod (ocaml.CamlinternalMod)

    Module CamlinternalMod

    Run-time support for recursive modules. All functions in this module are for system use only, not for the casual user.

    type shape =
    1. | Function
    2. | Lazy
    3. | Class
    4. | Module of shape array
    5. | Value of Stdlib.Obj.t
    val init_mod : (string * int * int) -> shape -> Stdlib.Obj.t
    val update_mod : shape -> Stdlib.Obj.t -> Stdlib.Obj.t -> unit
    diff --git a/ocaml/CamlinternalOO/index.html b/ocaml/CamlinternalOO/index.html new file mode 100644 index 0000000..af5c82a --- /dev/null +++ b/ocaml/CamlinternalOO/index.html @@ -0,0 +1,18 @@ + +CamlinternalOO (ocaml.CamlinternalOO)

    Module CamlinternalOO

    Run-time support for objects and classes. All functions in this module are for system use only, not for the casual user.

    Classes

    type tag
    type label
    type table
    type meth
    type t
    type obj
    type closure
    val public_method_label : string -> tag
    val new_method : table -> label
    val new_variable : table -> string -> int
    val new_methods_variables : + table -> + string array -> + string array -> + label array
    val get_variable : table -> string -> int
    val get_variables : table -> string array -> int array
    val get_method_label : table -> string -> label
    val get_method_labels : table -> string array -> label array
    val get_method : table -> label -> meth
    val set_method : table -> label -> meth -> unit
    val set_methods : table -> label array -> unit
    val narrow : table -> string array -> string array -> string array -> unit
    val widen : table -> unit
    val add_initializer : table -> (obj -> unit) -> unit
    val dummy_table : table
    val create_table : string array -> table
    val init_class : table -> unit
    val inherits : + table -> + string array -> + string array -> + string array -> + (t * (table -> obj -> Stdlib.Obj.t) * t * obj) -> + bool -> + Stdlib.Obj.t array
    val make_class : + string array -> + (table -> Stdlib.Obj.t -> t) -> + t * (table -> Stdlib.Obj.t -> t) * (Stdlib.Obj.t -> t) * Stdlib.Obj.t
    type init_table
    val make_class_store : string array -> (table -> t) -> init_table -> unit
    val dummy_class : + (string * int * int) -> + t * (table -> Stdlib.Obj.t -> t) * (Stdlib.Obj.t -> t) * Stdlib.Obj.t

    Objects

    val copy : < .. > as 'a -> 'a
    val create_object : table -> obj
    val create_object_opt : obj -> table -> obj
    val run_initializers : obj -> table -> unit
    val run_initializers_opt : obj -> obj -> table -> obj
    val create_object_and_run_initializers : obj -> table -> obj
    val send : obj -> tag -> t
    val sendcache : obj -> tag -> t -> int -> t
    val sendself : obj -> label -> t
    val get_public_method : obj -> tag -> closure

    Table cache

    type tables
    val lookup_tables : tables -> closure array -> tables

    Builtins to reduce code size

    type impl =
    1. | GetConst
    2. | GetVar
    3. | GetEnv
    4. | GetMeth
    5. | SetVar
    6. | AppConst
    7. | AppVar
    8. | AppEnv
    9. | AppMeth
    10. | AppConstConst
    11. | AppConstVar
    12. | AppConstEnv
    13. | AppConstMeth
    14. | AppVarConst
    15. | AppEnvConst
    16. | AppMethConst
    17. | MethAppConst
    18. | MethAppVar
    19. | MethAppEnv
    20. | MethAppMeth
    21. | SendConst
    22. | SendVar
    23. | SendEnv
    24. | SendMeth
    25. | Closure of closure

    Parameters

    type params = {
    1. mutable compact_table : bool;
    2. mutable copy_parent : bool;
    3. mutable clean_when_copying : bool;
    4. mutable retry_count : int;
    5. mutable bucket_small_size : int;
    }
    val params : params

    Statistics

    type stats = {
    1. classes : int;
    2. methods : int;
    3. inst_vars : int;
    }
    val stats : unit -> stats
    diff --git a/ocaml/Ccomp/index.html b/ocaml/Ccomp/index.html new file mode 100644 index 0000000..8e51f9f --- /dev/null +++ b/ocaml/Ccomp/index.html @@ -0,0 +1,7 @@ + +Ccomp (ocaml.Ccomp)

    Module Ccomp

    Compiling C files and building C libraries

    Warning: this module is unstable and part of compiler-libs.

    val command : string -> int
    val run_command : string -> unit
    val compile_file : + ?output:string -> + ?opt:string -> + ?stable_name:string -> + string -> + int
    val create_archive : string -> string list -> int
    val quote_files : response_files:bool -> string list -> string
    val quote_optfile : string option -> string
    val call_linker : link_mode -> string -> string list -> string -> int
    diff --git a/ocaml/Clambda/index.html b/ocaml/Clambda/index.html new file mode 100644 index 0000000..690d5c7 --- /dev/null +++ b/ocaml/Clambda/index.html @@ -0,0 +1,19 @@ + +Clambda (ocaml.Clambda)

    Module Clambda

    type function_label = string
    type ustructured_constant =
    1. | Uconst_float of float
    2. | Uconst_int32 of int32
    3. | Uconst_int64 of int64
    4. | Uconst_nativeint of nativeint
    5. | Uconst_block of int * uconstant list
    6. | Uconst_float_array of float list
    7. | Uconst_string of string
    8. | Uconst_closure of ufunction list * string * uconstant list
    and uconstant =
    1. | Uconst_ref of string * ustructured_constant option
    2. | Uconst_int of int
    and uphantom_defining_expr =
    1. | Uphantom_const of uconstant
      (*

      The phantom-let-bound variable is a constant.

      *)
    2. | Uphantom_var of Backend_var.t
      (*

      The phantom-let-bound variable is an alias for another variable.

      *)
    3. | Uphantom_offset_var of {
      1. var : Backend_var.t;
      2. offset_in_words : int;
      }
      (*

      The phantom-let-bound-variable's value is defined by adding the given number of words to the pointer contained in the given identifier.

      *)
    4. | Uphantom_read_field of {
      1. var : Backend_var.t;
      2. field : int;
      }
      (*

      The phantom-let-bound-variable's value is found by adding the given number of words to the pointer contained in the given identifier, then dereferencing.

      *)
    5. | Uphantom_read_symbol_field of {
      1. sym : string;
      2. field : int;
      }
      (*

      As for Uphantom_read_var_field, but with the pointer specified by a symbol.

      *)
    6. | Uphantom_block of {
      1. tag : int;
      2. fields : Backend_var.t list;
      }
      (*

      The phantom-let-bound variable points at a block with the given structure.

      *)
    and ulambda =
    1. | Uvar of Backend_var.t
    2. | Uconst of uconstant
    3. | Udirect_apply of function_label * ulambda list * Debuginfo.t
    4. | Ugeneric_apply of ulambda * ulambda list * Debuginfo.t
    5. | Uclosure of ufunction list * ulambda list
    6. | Uoffset of ulambda * int
    7. | Ulet of Asttypes.mutable_flag + * Lambda.value_kind + * Backend_var.With_provenance.t + * ulambda + * ulambda
    8. | Uphantom_let of Backend_var.With_provenance.t + * uphantom_defining_expr option + * ulambda
    9. | Uprim of Clambda_primitives.primitive * ulambda list * Debuginfo.t
    10. | Uswitch of ulambda * ulambda_switch * Debuginfo.t
    11. | Ustringswitch of ulambda * (string * ulambda) list * ulambda option
    12. | Ustaticfail of int * ulambda list
    13. | Ucatch of int + * (Backend_var.With_provenance.t * Lambda.value_kind) list + * ulambda + * ulambda
    14. | Utrywith of ulambda * Backend_var.With_provenance.t * ulambda
    15. | Uifthenelse of ulambda * ulambda * ulambda
    16. | Usequence of ulambda * ulambda
    17. | Uwhile of ulambda * ulambda
    18. | Ufor of Backend_var.With_provenance.t + * ulambda + * ulambda + * Asttypes.direction_flag + * ulambda
    19. | Uassign of Backend_var.t * ulambda
    20. | Usend of Lambda.meth_kind * ulambda * ulambda * ulambda list * Debuginfo.t
    21. | Uunreachable
    and ufunction = {
    1. label : function_label;
    2. arity : int;
    3. params : (Backend_var.With_provenance.t * Lambda.value_kind) list;
    4. return : Lambda.value_kind;
    5. body : ulambda;
    6. dbg : Debuginfo.t;
    7. env : Backend_var.t option;
    8. poll : Lambda.poll_attribute;
    }
    and ulambda_switch = {
    1. us_index_consts : int array;
    2. us_actions_consts : ulambda array;
    3. us_index_blocks : int array;
    4. us_actions_blocks : ulambda array;
    }
    type function_description = {
    1. fun_label : function_label;
    2. fun_arity : int;
    3. mutable fun_closed : bool;
    4. mutable fun_inline : (Backend_var.With_provenance.t list * ulambda) option;
    5. mutable fun_float_const_prop : bool;
    6. fun_poll : Lambda.poll_attribute;
    }
    type value_approximation =
    1. | Value_closure of function_description * value_approximation
    2. | Value_tuple of value_approximation array
    3. | Value_unknown
    4. | Value_const of uconstant
    5. | Value_global_field of string * int
    val compare_structured_constants : + ustructured_constant -> + ustructured_constant -> + int
    val compare_constants : uconstant -> uconstant -> int
    type usymbol_provenance = {
    1. original_idents : Ident.t list;
    2. module_path : Path.t;
    }
    type uconstant_block_field =
    1. | Uconst_field_ref of string
    2. | Uconst_field_int of int
    type preallocated_block = {
    1. symbol : string;
    2. exported : bool;
    3. tag : int;
    4. fields : uconstant_block_field option list;
    5. provenance : usymbol_provenance option;
    }
    type preallocated_constant = {
    1. symbol : string;
    2. exported : bool;
    3. definition : ustructured_constant;
    4. provenance : usymbol_provenance option;
    }
    type with_constants = + ulambda * preallocated_block list * preallocated_constant list
    diff --git a/ocaml/Clambda_primitives/index.html b/ocaml/Clambda_primitives/index.html new file mode 100644 index 0000000..b4b6fd8 --- /dev/null +++ b/ocaml/Clambda_primitives/index.html @@ -0,0 +1,2 @@ + +Clambda_primitives (ocaml.Clambda_primitives)

    Module Clambda_primitives

    type mutable_flag = Asttypes.mutable_flag
    type immediate_or_pointer = Lambda.immediate_or_pointer
    type initialization_or_assignment = Lambda.initialization_or_assignment
    type is_safe = Lambda.is_safe
    type boxed =
    1. | Boxed
    2. | Unboxed
    type memory_access_size =
    1. | Sixteen
    2. | Thirty_two
    3. | Sixty_four
    type primitive =
    1. | Pread_symbol of string
    2. | Pmakeblock of int * mutable_flag * block_shape
    3. | Pfield of int * immediate_or_pointer * mutable_flag
    4. | Pfield_computed
    5. | Psetfield of int * immediate_or_pointer * initialization_or_assignment
    6. | Psetfield_computed of immediate_or_pointer * initialization_or_assignment
    7. | Pfloatfield of int
    8. | Psetfloatfield of int * initialization_or_assignment
    9. | Pduprecord of Types.record_representation * int
    10. | Prunstack
    11. | Pperform
    12. | Presume
    13. | Preperform
    14. | Pccall of Primitive.description
    15. | Praise of raise_kind
    16. | Psequand
    17. | Psequor
    18. | Pnot
    19. | Pnegint
    20. | Paddint
    21. | Psubint
    22. | Pmulint
    23. | Pdivint of is_safe
    24. | Pmodint of is_safe
    25. | Pandint
    26. | Porint
    27. | Pxorint
    28. | Plslint
    29. | Plsrint
    30. | Pasrint
    31. | Pintcomp of integer_comparison
    32. | Pcompare_ints
    33. | Pcompare_floats
    34. | Pcompare_bints of boxed_integer
    35. | Poffsetint of int
    36. | Poffsetref of int
    37. | Pintoffloat
    38. | Pfloatofint
    39. | Pnegfloat
    40. | Pabsfloat
    41. | Paddfloat
    42. | Psubfloat
    43. | Pmulfloat
    44. | Pdivfloat
    45. | Pfloatcomp of float_comparison
    46. | Pstringlength
    47. | Pstringrefu
    48. | Pstringrefs
    49. | Pbyteslength
    50. | Pbytesrefu
    51. | Pbytessetu
    52. | Pbytesrefs
    53. | Pbytessets
    54. | Pmakearray of array_kind * mutable_flag
      (*

      For Pmakearray, the list of arguments must not be empty. The empty array should be represented by a distinguished constant in the middle end.

      *)
    55. | Pduparray of array_kind * mutable_flag
      (*

      For Pduparray, the argument must be an immutable array. The arguments of Pduparray give the kind and mutability of the array being *produced* by the duplication.

      *)
    56. | Parraylength of array_kind
    57. | Parrayrefu of array_kind
    58. | Parraysetu of array_kind
    59. | Parrayrefs of array_kind
    60. | Parraysets of array_kind
    61. | Pisint
    62. | Pisout
    63. | Pbintofint of boxed_integer
    64. | Pintofbint of boxed_integer
    65. | Pcvtbint of boxed_integer * boxed_integer
    66. | Pnegbint of boxed_integer
    67. | Paddbint of boxed_integer
    68. | Psubbint of boxed_integer
    69. | Pmulbint of boxed_integer
    70. | Pdivbint of {
      1. size : boxed_integer;
      2. is_safe : is_safe;
      }
    71. | Pmodbint of {
      1. size : boxed_integer;
      2. is_safe : is_safe;
      }
    72. | Pandbint of boxed_integer
    73. | Porbint of boxed_integer
    74. | Pxorbint of boxed_integer
    75. | Plslbint of boxed_integer
    76. | Plsrbint of boxed_integer
    77. | Pasrbint of boxed_integer
    78. | Pbintcomp of boxed_integer * integer_comparison
    79. | Pbigarrayref of bool * int * bigarray_kind * bigarray_layout
    80. | Pbigarrayset of bool * int * bigarray_kind * bigarray_layout
    81. | Pbigarraydim of int
    82. | Pstring_load of memory_access_size * is_safe
    83. | Pbytes_load of memory_access_size * is_safe
    84. | Pbytes_set of memory_access_size * is_safe
    85. | Pbigstring_load of memory_access_size * is_safe
    86. | Pbigstring_set of memory_access_size * is_safe
    87. | Pbswap16
    88. | Pbbswap of boxed_integer
    89. | Pint_as_pointer
    90. | Patomic_load of {
      1. immediate_or_pointer : immediate_or_pointer;
      }
    91. | Patomic_exchange
    92. | Patomic_cas
    93. | Patomic_fetch_add
    94. | Popaque
    95. | Pdls_get
    and integer_comparison = Lambda.integer_comparison =
    1. | Ceq
    2. | Cne
    3. | Clt
    4. | Cgt
    5. | Cle
    6. | Cge
    and float_comparison = Lambda.float_comparison =
    1. | CFeq
    2. | CFneq
    3. | CFlt
    4. | CFnlt
    5. | CFgt
    6. | CFngt
    7. | CFle
    8. | CFnle
    9. | CFge
    10. | CFnge
    and array_kind = Lambda.array_kind =
    1. | Pgenarray
    2. | Paddrarray
    3. | Pintarray
    4. | Pfloatarray
    and value_kind = Lambda.value_kind =
    1. | Pgenval
    2. | Pfloatval
    3. | Pboxedintval of boxed_integer
    4. | Pintval
    and block_shape = Lambda.block_shape
    and boxed_integer = Primitive.boxed_integer =
    1. | Pnativeint
    2. | Pint32
    3. | Pint64
    and bigarray_kind = Lambda.bigarray_kind =
    1. | Pbigarray_unknown
    2. | Pbigarray_float16
    3. | Pbigarray_float32
    4. | Pbigarray_float64
    5. | Pbigarray_sint8
    6. | Pbigarray_uint8
    7. | Pbigarray_sint16
    8. | Pbigarray_uint16
    9. | Pbigarray_int32
    10. | Pbigarray_int64
    11. | Pbigarray_caml_int
    12. | Pbigarray_native_int
    13. | Pbigarray_complex32
    14. | Pbigarray_complex64
    and bigarray_layout = Lambda.bigarray_layout =
    1. | Pbigarray_unknown_layout
    2. | Pbigarray_c_layout
    3. | Pbigarray_fortran_layout
    and raise_kind = Lambda.raise_kind =
    1. | Raise_regular
    2. | Raise_reraise
    3. | Raise_notrace
    val equal : primitive -> primitive -> bool
    diff --git a/ocaml/Clflags/Compiler_pass/index.html b/ocaml/Clflags/Compiler_pass/index.html new file mode 100644 index 0000000..5f77656 --- /dev/null +++ b/ocaml/Clflags/Compiler_pass/index.html @@ -0,0 +1,2 @@ + +Compiler_pass (ocaml.Clflags.Compiler_pass)

    Module Clflags.Compiler_pass

    type t =
    1. | Parsing
    2. | Typing
    3. | Lambda
    4. | Scheduling
    5. | Emit
    val of_string : string -> t option
    val to_string : t -> string
    val is_compilation_pass : t -> bool
    val available_pass_names : filter:(t -> bool) -> native:bool -> string list
    val can_save_ir_after : t -> bool
    val compare : t -> t -> int
    val to_output_filename : t -> prefix:string -> string
    val of_input_filename : string -> t option
    diff --git a/ocaml/Clflags/Float_arg_helper/index.html b/ocaml/Clflags/Float_arg_helper/index.html new file mode 100644 index 0000000..a039194 --- /dev/null +++ b/ocaml/Clflags/Float_arg_helper/index.html @@ -0,0 +1,2 @@ + +Float_arg_helper (ocaml.Clflags.Float_arg_helper)

    Module Clflags.Float_arg_helper

    Optimization parameters represented as floats indexed by round number.

    type parsed
    val parse : string -> string -> parsed ref -> unit
    type parse_result =
    1. | Ok
    2. | Parse_failed of exn
    val parse_no_error : string -> parsed ref -> parse_result
    val get : key:int -> parsed -> float
    diff --git a/ocaml/Clflags/Int_arg_helper/index.html b/ocaml/Clflags/Int_arg_helper/index.html new file mode 100644 index 0000000..294067f --- /dev/null +++ b/ocaml/Clflags/Int_arg_helper/index.html @@ -0,0 +1,2 @@ + +Int_arg_helper (ocaml.Clflags.Int_arg_helper)

    Module Clflags.Int_arg_helper

    Optimization parameters represented as ints indexed by round number.

    type parsed
    val parse : string -> string -> parsed ref -> unit
    type parse_result =
    1. | Ok
    2. | Parse_failed of exn
    val parse_no_error : string -> parsed ref -> parse_result
    val get : key:int -> parsed -> int
    diff --git a/ocaml/Clflags/index.html b/ocaml/Clflags/index.html new file mode 100644 index 0000000..3a52c8b --- /dev/null +++ b/ocaml/Clflags/index.html @@ -0,0 +1,2 @@ + +Clflags (ocaml.Clflags)

    Module Clflags

    Command line flags

    module Int_arg_helper : sig ... end

    Optimization parameters represented as ints indexed by round number.

    module Float_arg_helper : sig ... end

    Optimization parameters represented as floats indexed by round number.

    type inlining_arguments = {
    1. inline_call_cost : int option;
    2. inline_alloc_cost : int option;
    3. inline_prim_cost : int option;
    4. inline_branch_cost : int option;
    5. inline_indirect_cost : int option;
    6. inline_lifting_benefit : int option;
    7. inline_branch_factor : float option;
    8. inline_max_depth : int option;
    9. inline_max_unroll : int option;
    10. inline_threshold : float option;
    11. inline_toplevel_threshold : int option;
    }
    val classic_arguments : inlining_arguments
    val o1_arguments : inlining_arguments
    val o2_arguments : inlining_arguments
    val o3_arguments : inlining_arguments
    val use_inlining_arguments_set : ?round:int -> inlining_arguments -> unit

    Set all the inlining arguments for a round. The default is set if no round is provided.

    val objfiles : string list ref
    val ccobjs : string list ref
    val dllibs : string list ref
    val cmi_file : string option ref
    val compile_only : bool ref
    val output_name : string option ref
    val include_dirs : string list ref
    val hidden_include_dirs : string list ref
    val no_std_include : bool ref
    val no_cwd : bool ref
    val print_types : bool ref
    val make_archive : bool ref
    val debug : bool ref
    val debug_full : bool ref
    val unsafe : bool ref
    val use_linscan : bool ref
    val custom_runtime : bool ref
    val no_check_prims : bool ref
    val bytecode_compatible_32 : bool ref
    val output_c_object : bool ref
    val output_complete_object : bool ref
    val output_complete_executable : bool ref
    val all_ccopts : string list ref
    val classic : bool ref
    val nopervasives : bool ref
    val match_context_rows : int ref
    val safer_matching : bool ref
    val open_modules : string list ref
    val preprocessor : string option ref
    val all_ppx : string list ref
    val absname : bool ref
    val annotations : bool ref
    val binary_annotations : bool ref
    val store_occurrences : bool ref
    val use_threads : bool ref
    val noassert : bool ref
    val verbose : bool ref
    val noprompt : bool ref
    val nopromptcont : bool ref
    val init_file : string option ref
    val noinit : bool ref
    val noversion : bool ref
    val use_prims : string ref
    val use_runtime : string ref
    val plugin : bool ref
    val principal : bool ref
    val real_paths : bool ref
    val recursive_types : bool ref
    val strict_sequence : bool ref
    val strict_formats : bool ref
    val applicative_functors : bool ref
    val make_runtime : bool ref
    val c_compiler : string option ref
    val dllpaths : string list ref
    val make_package : bool ref
    val for_package : string option ref
    val error_size : int ref
    val float_const_prop : bool ref
    val transparent_modules : bool ref
    val unique_ids : bool ref
    val locations : bool ref
    val dump_source : bool ref
    val dump_parsetree : bool ref
    val dump_typedtree : bool ref
    val dump_shape : bool ref
    val dump_rawlambda : bool ref
    val dump_lambda : bool ref
    val dump_rawclambda : bool ref
    val dump_clambda : bool ref
    val dump_rawflambda : bool ref
    val dump_flambda : bool ref
    val dump_flambda_let : int option ref
    val dump_instr : bool ref
    val keep_camlprimc_file : bool ref
    val keep_asm_file : bool ref
    val optimize_for_speed : bool ref
    val dump_cmm : bool ref
    val dump_selection : bool ref
    val dump_cse : bool ref
    val dump_live : bool ref
    val dump_spill : bool ref
    val dump_split : bool ref
    val dump_interf : bool ref
    val dump_prefer : bool ref
    val dump_regalloc : bool ref
    val dump_reload : bool ref
    val dump_scheduling : bool ref
    val dump_linear : bool ref
    val dump_interval : bool ref
    val keep_startup_file : bool ref
    val dump_combine : bool ref
    val native_code : bool ref
    val default_inline_threshold : float
    val inline_threshold : Float_arg_helper.parsed ref
    val inlining_report : bool ref
    val simplify_rounds : int option ref
    val default_simplify_rounds : int ref
    val rounds : unit -> int
    val default_inline_max_unroll : int
    val inline_max_unroll : Int_arg_helper.parsed ref
    val default_inline_toplevel_threshold : int
    val inline_toplevel_threshold : Int_arg_helper.parsed ref
    val default_inline_call_cost : int
    val default_inline_alloc_cost : int
    val default_inline_prim_cost : int
    val default_inline_branch_cost : int
    val default_inline_indirect_cost : int
    val default_inline_lifting_benefit : int
    val inline_call_cost : Int_arg_helper.parsed ref
    val inline_alloc_cost : Int_arg_helper.parsed ref
    val inline_prim_cost : Int_arg_helper.parsed ref
    val inline_branch_cost : Int_arg_helper.parsed ref
    val inline_indirect_cost : Int_arg_helper.parsed ref
    val inline_lifting_benefit : Int_arg_helper.parsed ref
    val default_inline_branch_factor : float
    val inline_branch_factor : Float_arg_helper.parsed ref
    val dont_write_files : bool ref
    val std_include_flag : string -> string
    val std_include_dir : unit -> string list
    val shared : bool ref
    val dlcode : bool ref
    val pic_code : bool ref
    val runtime_variant : string ref
    val with_runtime : bool ref
    val force_slash : bool ref
    val keep_docs : bool ref
    val keep_locs : bool ref
    val opaque : bool ref
    val profile_columns : Profile.column list ref
    val flambda_invariant_checks : bool ref
    val unbox_closures : bool ref
    val unbox_closures_factor : int ref
    val default_unbox_closures_factor : int
    val unbox_free_vars_of_closures : bool ref
    val unbox_specialised_args : bool ref
    val clambda_checks : bool ref
    val cmm_invariants : bool ref
    val default_inline_max_depth : int
    val inline_max_depth : Int_arg_helper.parsed ref
    val remove_unused_arguments : bool ref
    val dump_flambda_verbose : bool ref
    val classic_inlining : bool ref
    val afl_instrument : bool ref
    val afl_inst_ratio : int ref
    val function_sections : bool ref
    val all_passes : string list ref
    val dumped_pass : string -> bool
    val set_dumped_pass : string -> bool -> unit
    val dump_into_file : bool ref
    val dump_dir : string option ref
    type 'a env_reader = {
    1. parse : string -> 'a option;
    2. print : 'a -> string;
    3. usage : string;
    4. env_var : string;
    }
    val color : Misc.Color.setting option ref
    val color_reader : Misc.Color.setting env_reader
    val error_style : Misc.Error_style.setting option ref
    val error_style_reader : Misc.Error_style.setting env_reader
    val unboxed_types : bool ref
    val insn_sched : bool ref
    val insn_sched_default : bool
    module Compiler_pass : sig ... end
    val stop_after : Compiler_pass.t option ref
    val should_stop_after : Compiler_pass.t -> bool
    val set_save_ir_after : Compiler_pass.t -> bool -> unit
    val should_save_ir_after : Compiler_pass.t -> bool
    val arg_spec : (string * Stdlib.Arg.spec * string) list ref
    val add_arguments : string -> (string * Stdlib.Arg.spec * string) list -> unit
    val create_usage_msg : string -> string
    val print_arguments : string -> unit
    val reset_arguments : unit -> unit
    diff --git a/ocaml/Closure/index.html b/ocaml/Closure/index.html new file mode 100644 index 0000000..c9baf5b --- /dev/null +++ b/ocaml/Closure/index.html @@ -0,0 +1,6 @@ + +Closure (ocaml.Closure)

    Module Closure

    val intro : + backend:(module Backend_intf.S) -> + size:int -> + Lambda.lambda -> + Clambda.ulambda
    val reset : unit -> unit
    diff --git a/ocaml/Closure_conversion/index.html b/ocaml/Closure_conversion/index.html new file mode 100644 index 0000000..c0691fc --- /dev/null +++ b/ocaml/Closure_conversion/index.html @@ -0,0 +1,7 @@ + +Closure_conversion (ocaml.Closure_conversion)

    Module Closure_conversion

    val lambda_to_flambda : + backend:(module Backend_intf.S) -> + module_ident:Ident.t -> + size:int -> + Lambda.lambda -> + Flambda.program

    Generation of Flambda intermediate language code from Lambda code by performing a form of closure conversion.

    Function declarations (which may bind one or more variables identifying functions, possibly with mutual recursion) are transformed to Set_of_closures expressions. Project_closure expressions are then used to select a closure for a particular function from a Set_of_closures expression. The Set_of_closures expressions say nothing about the actual runtime layout of the closures; this is handled when Flambda code is translated to Clambda code.

    The following transformations are also performed during closure conversion:

    • Constant blocks (by which is meant things wrapped in Lambda.Const_block) are converted to applications of the Pmakeblock primitive.
    • Levent debugging event nodes are removed and the information within them attached to function, method and raise calls.
    • Tuplified functions are converted to curried functions and a stub function emitted to call the curried version. For example: let rec f (x, y) = f (x + 1, y + 1) is transformed to: let rec internal_f x y = f (x + 1,y + 1) and f (x, y) = internal_f x y (* f is marked as a stub function *)
    • The Pdirapply and Prevapply application primitives are removed and converted to normal Flambda application nodes.

    The lambda_to_flambda function is not re-entrant.

    diff --git a/ocaml/Closure_conversion_aux/Env/index.html b/ocaml/Closure_conversion_aux/Env/index.html new file mode 100644 index 0000000..4390138 --- /dev/null +++ b/ocaml/Closure_conversion_aux/Env/index.html @@ -0,0 +1,2 @@ + +Env (ocaml.Closure_conversion_aux.Env)

    Module Closure_conversion_aux.Env

    Used to remember which Variable.t values correspond to which Ident.t values during closure conversion, and similarly for static exception identifiers.

    type t
    val empty : t
    val add_var : t -> Ident.t -> Variable.t -> t
    val add_vars : t -> Ident.t list -> Variable.t list -> t
    val find_var : t -> Ident.t -> Variable.t
    val find_var_exn : t -> Ident.t -> Variable.t
    val add_mutable_var : t -> Ident.t -> Mutable_variable.t -> t
    val find_mutable_var_exn : t -> Ident.t -> Mutable_variable.t
    val add_static_exception : t -> int -> Static_exception.t -> t
    val find_static_exception : t -> int -> Static_exception.t
    val add_global : t -> int -> Symbol.t -> t
    val find_global : t -> int -> Symbol.t
    diff --git a/ocaml/Closure_conversion_aux/Function_decls/Function_decl/index.html b/ocaml/Closure_conversion_aux/Function_decls/Function_decl/index.html new file mode 100644 index 0000000..9c387f4 --- /dev/null +++ b/ocaml/Closure_conversion_aux/Function_decls/Function_decl/index.html @@ -0,0 +1,10 @@ + +Function_decl (ocaml.Closure_conversion_aux.Function_decls.Function_decl)

    Module Function_decls.Function_decl

    type t
    val create : + let_rec_ident:Ident.t option -> + closure_bound_var:Variable.t -> + kind:Lambda.function_kind -> + params:Ident.t list -> + body:Lambda.lambda -> + attr:Lambda.function_attribute -> + loc:Lambda.scoped_location -> + t
    val let_rec_ident : t -> Ident.t
    val closure_bound_var : t -> Variable.t
    val kind : t -> Lambda.function_kind
    val params : t -> Ident.t list
    val body : t -> Lambda.lambda
    val inline : t -> Lambda.inline_attribute
    val specialise : t -> Lambda.specialise_attribute
    val is_a_functor : t -> bool
    val stub : t -> bool
    val poll_attribute : t -> Lambda.poll_attribute
    val free_idents : t -> Ident.Set.t
    diff --git a/ocaml/Closure_conversion_aux/Function_decls/index.html b/ocaml/Closure_conversion_aux/Function_decls/index.html new file mode 100644 index 0000000..c804420 --- /dev/null +++ b/ocaml/Closure_conversion_aux/Function_decls/index.html @@ -0,0 +1,2 @@ + +Function_decls (ocaml.Closure_conversion_aux.Function_decls)

    Module Closure_conversion_aux.Function_decls

    Used to represent information about a set of function declarations during closure conversion. (The only case in which such a set may contain more than one declaration is when processing "let rec".)

    module Function_decl : sig ... end
    type t
    val create : Function_decl.t list -> t
    val to_list : t -> Function_decl.t list
    val all_free_idents : t -> Ident.Set.t
    val closure_env_without_parameters : Env.t -> t -> Env.t
    diff --git a/ocaml/Closure_conversion_aux/index.html b/ocaml/Closure_conversion_aux/index.html new file mode 100644 index 0000000..da8a133 --- /dev/null +++ b/ocaml/Closure_conversion_aux/index.html @@ -0,0 +1,2 @@ + +Closure_conversion_aux (ocaml.Closure_conversion_aux)

    Module Closure_conversion_aux

    Environments and auxiliary structures used during closure conversion.

    module Env : sig ... end

    Used to remember which Variable.t values correspond to which Ident.t values during closure conversion, and similarly for static exception identifiers.

    module Function_decls : sig ... end

    Used to represent information about a set of function declarations during closure conversion. (The only case in which such a set may contain more than one declaration is when processing "let rec".)

    diff --git a/ocaml/Closure_element/Map/index.html b/ocaml/Closure_element/Map/index.html new file mode 100644 index 0000000..ba36c33 --- /dev/null +++ b/ocaml/Closure_element/Map/index.html @@ -0,0 +1,17 @@ + +Map (ocaml.Closure_element.Map)

    Module Closure_element.Map

    include Map.S with type key = T.t and type 'a t = 'a Map.Make(T).t

    Maps

    type key = T.t

    The type of the map keys.

    type 'a t = 'a Stdlib.Map.Make(T).t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key -> 'a -> 'a t -> 'a t

    add key data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key -> 'a -> 'a list t -> 'a list t

    add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

    update key f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : (key -> bool) -> 'a t -> key * 'a

    find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : (key -> bool) -> 'a t -> key * 'a

    find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : (key -> 'a -> unit) -> 'a t -> unit

    iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

    fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : (key -> 'a -> bool) -> 'a t -> 'a t

    filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : (key -> 'a -> bool) -> 'a t -> bool

    for_all f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : (key -> 'a -> bool) -> 'a t -> bool

    exists f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Stdlib.Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Stdlib.Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    val of_list : (key * 'a) list -> 'a t
    val disjoint_union : + ?eq:('a -> 'a -> bool) -> + ?print:(Stdlib.Format.formatter -> 'a -> unit) -> + 'a t -> + 'a t -> + 'a t

    disjoint_union m1 m2 contains all bindings from m1 and m2. If some binding is present in both and the associated value is not equal, a Fatal_error is raised

    val union_right : 'a t -> 'a t -> 'a t

    union_right m1 m2 contains all bindings from m1 and m2. If some binding is present in both, the one from m2 is taken

    val union_left : 'a t -> 'a t -> 'a t

    union_left m1 m2 = union_right m2 m1

    val union_merge : ('a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
    val rename : key t -> key -> key
    val map_keys : (key -> key) -> 'a t -> 'a t
    val keys : 'a t -> Stdlib.Set.Make(T).t
    val data : 'a t -> 'a list
    val of_set : (key -> 'a) -> Stdlib.Set.Make(T).t -> 'a t
    val transpose_keys_and_data : key t -> key t
    val transpose_keys_and_data_set : key t -> Stdlib.Set.Make(T).t t
    val print : + (Stdlib.Format.formatter -> 'a -> unit) -> + Stdlib.Format.formatter -> + 'a t -> + unit
    diff --git a/ocaml/Closure_element/Set/index.html b/ocaml/Closure_element/Set/index.html new file mode 100644 index 0000000..770872d --- /dev/null +++ b/ocaml/Closure_element/Set/index.html @@ -0,0 +1,2 @@ + +Set (ocaml.Closure_element.Set)

    Module Closure_element.Set

    include Set.S with type elt = T.t and type t = Set.Make(T).t

    Sets

    type elt = T.t

    The type of the set elements.

    The type of sets.

    val empty : t

    The empty set.

    val add : elt -> t -> t

    add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val singleton : elt -> t

    singleton x returns the one-element set containing only x.

    val remove : elt -> t -> t

    remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val union : t -> t -> t

    Set union.

    val inter : t -> t -> t

    Set intersection.

    val disjoint : t -> t -> bool

    Test if two sets are disjoint.

    • since 4.08
    val diff : t -> t -> t

    Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

    val cardinal : t -> int

    Return the number of elements of a set.

    Elements

    val elements : t -> elt list

    Return the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Set.Make.

    val min_elt : t -> elt

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

    val min_elt_opt : t -> elt option

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

    • since 4.05
    val max_elt : t -> elt

    Same as min_elt, but returns the largest element of the given set.

    val max_elt_opt : t -> elt option

    Same as min_elt_opt, but returns the largest element of the given set.

    • since 4.05
    val choose : t -> elt

    Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    val choose_opt : t -> elt option

    Return one element of the given set, or None if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    • since 4.05

    Searching

    val find : elt -> t -> elt

    find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

    • since 4.01
    val find_opt : elt -> t -> elt option

    find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

    • since 4.05
    val find_first : (elt -> bool) -> t -> elt

    find_first f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

    For example, find_first (fun e -> Ord.compare e x >= 0) s will return the first element e of s where Ord.compare e x >= 0 (intuitively: e >= x), or raise Not_found if x is greater than any element of s.

    • since 4.05
    val find_first_opt : (elt -> bool) -> t -> elt option

    find_first_opt f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

    • since 4.05
    val find_last : (elt -> bool) -> t -> elt

    find_last f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

    • since 4.05
    val find_last_opt : (elt -> bool) -> t -> elt option

    find_last_opt f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

    • since 4.05

    Traversing

    val iter : (elt -> unit) -> t -> unit

    iter f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.

    val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc

    fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

    Transforming

    val filter : (elt -> bool) -> t -> t

    filter f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val filter_map : (elt -> elt option) -> t -> t

    filter_map f s returns the set of all v such that f x = Some v for some element x of s.

    For example,

    filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) s

    is the set of halves of the even elements of s.

    If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned unchanged: the result of the function is then physically equal to s.

    • since 4.11
    val partition : (elt -> bool) -> t -> t * t

    partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

    val split : elt -> t -> t * bool * t

    split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.

    Predicates and comparisons

    val is_empty : t -> bool

    Test whether a set is empty or not.

    val mem : elt -> t -> bool

    mem x s tests whether x belongs to the set s.

    val equal : t -> t -> bool

    equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

    val compare : t -> t -> int

    Total ordering between sets. Can be used as the ordering function for doing sets of sets.

    val subset : t -> t -> bool

    subset s1 s2 tests whether the set s1 is a subset of the set s2.

    val for_all : (elt -> bool) -> t -> bool

    for_all f s checks if all elements of the set satisfy the predicate f.

    val exists : (elt -> bool) -> t -> bool

    exists f s checks if at least one element of the set satisfies the predicate f.

    Converting

    val to_list : t -> elt list

    to_list s is elements s.

    • since 5.1
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t

    to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

    • since 4.07
    val to_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in ascending order

    • since 4.07
    val to_rev_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in descending order

    • since 4.12
    val add_seq : elt Stdlib.Seq.t -> t -> t

    Add the given elements to the set, in order.

    • since 4.07
    val of_seq : elt Stdlib.Seq.t -> t

    Build a set from the given bindings

    • since 4.07
    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    val to_string : t -> string
    val of_list : elt list -> t
    val map : (elt -> elt) -> t -> t
    diff --git a/ocaml/Closure_element/T/index.html b/ocaml/Closure_element/T/index.html new file mode 100644 index 0000000..5b46c35 --- /dev/null +++ b/ocaml/Closure_element/T/index.html @@ -0,0 +1,2 @@ + +T (ocaml.Closure_element.T)

    Module Closure_element.T

    type t = t
    include Hashtbl.HashedType with type t := t
    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val hash : t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := t
    val compare : t -> t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    diff --git a/ocaml/Closure_element/Tbl/index.html b/ocaml/Closure_element/Tbl/index.html new file mode 100644 index 0000000..ec16ec2 --- /dev/null +++ b/ocaml/Closure_element/Tbl/index.html @@ -0,0 +1,2 @@ + +Tbl (ocaml.Closure_element.Tbl)

    Module Closure_element.Tbl

    include Hashtbl.S with type key = T.t and type 'a t = 'a Hashtbl.Make(T).t
    type key = T.t
    val create : int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    • since 4.00
    val copy : 'a t -> 'a t
    val add : 'a t -> key -> 'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    • since 4.05
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key -> 'a -> unit
    val mem : 'a t -> key -> bool
    val iter : (key -> 'a -> unit) -> 'a t -> unit
    val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
    • since 4.03
    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc
    val length : 'a t -> int
    val stats : 'a t -> Stdlib.Hashtbl.statistics
    • since 4.00
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
    • since 4.07
    val to_seq_keys : _ t -> key Stdlib.Seq.t
    • since 4.07
    val to_seq_values : 'a t -> 'a Stdlib.Seq.t
    • since 4.07
    val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
    • since 4.07
    val to_list : 'a t -> (T.t * 'a) list
    val of_list : (T.t * 'a) list -> 'a t
    val to_map : 'a t -> 'a Stdlib.Map.Make(T).t
    val of_map : 'a Stdlib.Map.Make(T).t -> 'a t
    val memoize : 'a t -> (key -> 'a) -> key -> 'a
    val map : 'a t -> ('a -> 'b) -> 'b t
    diff --git a/ocaml/Closure_element/index.html b/ocaml/Closure_element/index.html new file mode 100644 index 0000000..4c6ef79 --- /dev/null +++ b/ocaml/Closure_element/index.html @@ -0,0 +1,2 @@ + +Closure_element (ocaml.Closure_element)

    Module Closure_element

    include Identifiable.S
    type t
    module T : Identifiable.Thing with type t = t
    include Identifiable.Thing with type t := T.t
    include Hashtbl.HashedType with type t := T.t
    val equal : T.t -> T.t -> bool

    The equality predicate used to compare keys.

    val hash : T.t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := T.t
    val compare : T.t -> T.t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> T.t -> unit
    val print : Stdlib.Format.formatter -> T.t -> unit
    module Set : Identifiable.Set with module T := T
    module Map : Identifiable.Map with module T := T
    module Tbl : Identifiable.Tbl with module T := T
    val wrap : Variable.t -> t
    val unwrap : t -> Variable.t
    val wrap_map : 'a Variable.Map.t -> 'a Map.t
    val unwrap_set : Set.t -> Variable.Set.t
    val in_compilation_unit : t -> Compilation_unit.t -> bool
    val get_compilation_unit : t -> Compilation_unit.t
    val unique_name : t -> string
    val output_full : out_channel -> t -> unit
    diff --git a/ocaml/Closure_id/Map/index.html b/ocaml/Closure_id/Map/index.html new file mode 100644 index 0000000..30d7fb9 --- /dev/null +++ b/ocaml/Closure_id/Map/index.html @@ -0,0 +1,17 @@ + +Map (ocaml.Closure_id.Map)

    Module Closure_id.Map

    include Map.S with type key = T.t and type 'a t = 'a Map.Make(T).t

    Maps

    type key = T.t

    The type of the map keys.

    type 'a t = 'a Stdlib.Map.Make(T).t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key -> 'a -> 'a t -> 'a t

    add key data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key -> 'a -> 'a list t -> 'a list t

    add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

    update key f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : (key -> bool) -> 'a t -> key * 'a

    find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : (key -> bool) -> 'a t -> key * 'a

    find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : (key -> 'a -> unit) -> 'a t -> unit

    iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

    fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : (key -> 'a -> bool) -> 'a t -> 'a t

    filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : (key -> 'a -> bool) -> 'a t -> bool

    for_all f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : (key -> 'a -> bool) -> 'a t -> bool

    exists f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Stdlib.Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Stdlib.Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    val of_list : (key * 'a) list -> 'a t
    val disjoint_union : + ?eq:('a -> 'a -> bool) -> + ?print:(Stdlib.Format.formatter -> 'a -> unit) -> + 'a t -> + 'a t -> + 'a t

    disjoint_union m1 m2 contains all bindings from m1 and m2. If some binding is present in both and the associated value is not equal, a Fatal_error is raised

    val union_right : 'a t -> 'a t -> 'a t

    union_right m1 m2 contains all bindings from m1 and m2. If some binding is present in both, the one from m2 is taken

    val union_left : 'a t -> 'a t -> 'a t

    union_left m1 m2 = union_right m2 m1

    val union_merge : ('a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
    val rename : key t -> key -> key
    val map_keys : (key -> key) -> 'a t -> 'a t
    val keys : 'a t -> Stdlib.Set.Make(T).t
    val data : 'a t -> 'a list
    val of_set : (key -> 'a) -> Stdlib.Set.Make(T).t -> 'a t
    val transpose_keys_and_data : key t -> key t
    val transpose_keys_and_data_set : key t -> Stdlib.Set.Make(T).t t
    val print : + (Stdlib.Format.formatter -> 'a -> unit) -> + Stdlib.Format.formatter -> + 'a t -> + unit
    diff --git a/ocaml/Closure_id/Set/index.html b/ocaml/Closure_id/Set/index.html new file mode 100644 index 0000000..f12644c --- /dev/null +++ b/ocaml/Closure_id/Set/index.html @@ -0,0 +1,2 @@ + +Set (ocaml.Closure_id.Set)

    Module Closure_id.Set

    include Set.S with type elt = T.t and type t = Set.Make(T).t

    Sets

    type elt = T.t

    The type of the set elements.

    The type of sets.

    val empty : t

    The empty set.

    val add : elt -> t -> t

    add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val singleton : elt -> t

    singleton x returns the one-element set containing only x.

    val remove : elt -> t -> t

    remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val union : t -> t -> t

    Set union.

    val inter : t -> t -> t

    Set intersection.

    val disjoint : t -> t -> bool

    Test if two sets are disjoint.

    • since 4.08
    val diff : t -> t -> t

    Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

    val cardinal : t -> int

    Return the number of elements of a set.

    Elements

    val elements : t -> elt list

    Return the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Set.Make.

    val min_elt : t -> elt

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

    val min_elt_opt : t -> elt option

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

    • since 4.05
    val max_elt : t -> elt

    Same as min_elt, but returns the largest element of the given set.

    val max_elt_opt : t -> elt option

    Same as min_elt_opt, but returns the largest element of the given set.

    • since 4.05
    val choose : t -> elt

    Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    val choose_opt : t -> elt option

    Return one element of the given set, or None if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    • since 4.05

    Searching

    val find : elt -> t -> elt

    find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

    • since 4.01
    val find_opt : elt -> t -> elt option

    find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

    • since 4.05
    val find_first : (elt -> bool) -> t -> elt

    find_first f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

    For example, find_first (fun e -> Ord.compare e x >= 0) s will return the first element e of s where Ord.compare e x >= 0 (intuitively: e >= x), or raise Not_found if x is greater than any element of s.

    • since 4.05
    val find_first_opt : (elt -> bool) -> t -> elt option

    find_first_opt f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

    • since 4.05
    val find_last : (elt -> bool) -> t -> elt

    find_last f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

    • since 4.05
    val find_last_opt : (elt -> bool) -> t -> elt option

    find_last_opt f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

    • since 4.05

    Traversing

    val iter : (elt -> unit) -> t -> unit

    iter f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.

    val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc

    fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

    Transforming

    val filter : (elt -> bool) -> t -> t

    filter f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val filter_map : (elt -> elt option) -> t -> t

    filter_map f s returns the set of all v such that f x = Some v for some element x of s.

    For example,

    filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) s

    is the set of halves of the even elements of s.

    If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned unchanged: the result of the function is then physically equal to s.

    • since 4.11
    val partition : (elt -> bool) -> t -> t * t

    partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

    val split : elt -> t -> t * bool * t

    split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.

    Predicates and comparisons

    val is_empty : t -> bool

    Test whether a set is empty or not.

    val mem : elt -> t -> bool

    mem x s tests whether x belongs to the set s.

    val equal : t -> t -> bool

    equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

    val compare : t -> t -> int

    Total ordering between sets. Can be used as the ordering function for doing sets of sets.

    val subset : t -> t -> bool

    subset s1 s2 tests whether the set s1 is a subset of the set s2.

    val for_all : (elt -> bool) -> t -> bool

    for_all f s checks if all elements of the set satisfy the predicate f.

    val exists : (elt -> bool) -> t -> bool

    exists f s checks if at least one element of the set satisfies the predicate f.

    Converting

    val to_list : t -> elt list

    to_list s is elements s.

    • since 5.1
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t

    to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

    • since 4.07
    val to_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in ascending order

    • since 4.07
    val to_rev_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in descending order

    • since 4.12
    val add_seq : elt Stdlib.Seq.t -> t -> t

    Add the given elements to the set, in order.

    • since 4.07
    val of_seq : elt Stdlib.Seq.t -> t

    Build a set from the given bindings

    • since 4.07
    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    val to_string : t -> string
    val of_list : elt list -> t
    val map : (elt -> elt) -> t -> t
    diff --git a/ocaml/Closure_id/T/index.html b/ocaml/Closure_id/T/index.html new file mode 100644 index 0000000..0d96b4b --- /dev/null +++ b/ocaml/Closure_id/T/index.html @@ -0,0 +1,2 @@ + +T (ocaml.Closure_id.T)

    Module Closure_id.T

    type t = t
    include Hashtbl.HashedType with type t := t
    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val hash : t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := t
    val compare : t -> t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    diff --git a/ocaml/Closure_id/Tbl/index.html b/ocaml/Closure_id/Tbl/index.html new file mode 100644 index 0000000..cabe267 --- /dev/null +++ b/ocaml/Closure_id/Tbl/index.html @@ -0,0 +1,2 @@ + +Tbl (ocaml.Closure_id.Tbl)

    Module Closure_id.Tbl

    include Hashtbl.S with type key = T.t and type 'a t = 'a Hashtbl.Make(T).t
    type key = T.t
    val create : int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    • since 4.00
    val copy : 'a t -> 'a t
    val add : 'a t -> key -> 'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    • since 4.05
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key -> 'a -> unit
    val mem : 'a t -> key -> bool
    val iter : (key -> 'a -> unit) -> 'a t -> unit
    val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
    • since 4.03
    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc
    val length : 'a t -> int
    val stats : 'a t -> Stdlib.Hashtbl.statistics
    • since 4.00
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
    • since 4.07
    val to_seq_keys : _ t -> key Stdlib.Seq.t
    • since 4.07
    val to_seq_values : 'a t -> 'a Stdlib.Seq.t
    • since 4.07
    val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
    • since 4.07
    val to_list : 'a t -> (T.t * 'a) list
    val of_list : (T.t * 'a) list -> 'a t
    val to_map : 'a t -> 'a Stdlib.Map.Make(T).t
    val of_map : 'a Stdlib.Map.Make(T).t -> 'a t
    val memoize : 'a t -> (key -> 'a) -> key -> 'a
    val map : 'a t -> ('a -> 'b) -> 'b t
    diff --git a/ocaml/Closure_id/index.html b/ocaml/Closure_id/index.html new file mode 100644 index 0000000..69255f7 --- /dev/null +++ b/ocaml/Closure_id/index.html @@ -0,0 +1,2 @@ + +Closure_id (ocaml.Closure_id)

    Module Closure_id

    CR-someday lwhite: "Closure_id" is quite a generic name. I wonder whether something like "Closure_label" would better capture that it is the label of a projection.

    An identifier, unique across the whole program (not just one compilation unit), that identifies a closure within a particular set of closures (viz. Project_closure).

    include module type of Closure_element
    include Identifiable.S
    type t
    module T : Identifiable.Thing with type t = t
    include Identifiable.Thing with type t := T.t
    include Hashtbl.HashedType with type t := T.t
    val equal : T.t -> T.t -> bool

    The equality predicate used to compare keys.

    val hash : T.t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := T.t
    val compare : T.t -> T.t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> T.t -> unit
    val print : Stdlib.Format.formatter -> T.t -> unit
    module Set : Identifiable.Set with module T := T
    module Map : Identifiable.Map with module T := T
    module Tbl : Identifiable.Tbl with module T := T
    val wrap : Variable.t -> t
    val unwrap : t -> Variable.t
    val wrap_map : 'a Variable.Map.t -> 'a Map.t
    val unwrap_set : Set.t -> Variable.Set.t
    val in_compilation_unit : t -> Compilation_unit.t -> bool
    val get_compilation_unit : t -> Compilation_unit.t
    val unique_name : t -> string
    val output_full : out_channel -> t -> unit
    diff --git a/ocaml/Closure_middle_end/index.html b/ocaml/Closure_middle_end/index.html new file mode 100644 index 0000000..4226cfd --- /dev/null +++ b/ocaml/Closure_middle_end/index.html @@ -0,0 +1,7 @@ + +Closure_middle_end (ocaml.Closure_middle_end)

    Module Closure_middle_end

    val lambda_to_clambda : + backend:(module Backend_intf.S) -> + prefixname:string -> + ppf_dump:Stdlib.Format.formatter -> + Lambda.program -> + Clambda.with_constants
    diff --git a/ocaml/Closure_offsets/index.html b/ocaml/Closure_offsets/index.html new file mode 100644 index 0000000..631283b --- /dev/null +++ b/ocaml/Closure_offsets/index.html @@ -0,0 +1,2 @@ + +Closure_offsets (ocaml.Closure_offsets)

    Module Closure_offsets

    Assign numerical offsets, within closure blocks, for code pointers and environment entries.

    type result = private {
    1. function_offsets : int Closure_id.Map.t;
    2. free_variable_offsets : int Var_within_closure.Map.t;
    }
    val compute : Flambda.program -> result
    diff --git a/ocaml/Closure_origin/Map/index.html b/ocaml/Closure_origin/Map/index.html new file mode 100644 index 0000000..6f1edba --- /dev/null +++ b/ocaml/Closure_origin/Map/index.html @@ -0,0 +1,17 @@ + +Map (ocaml.Closure_origin.Map)

    Module Closure_origin.Map

    include Map.S with type key = T.t and type 'a t = 'a Map.Make(T).t

    Maps

    type key = T.t

    The type of the map keys.

    type 'a t = 'a Stdlib.Map.Make(T).t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key -> 'a -> 'a t -> 'a t

    add key data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key -> 'a -> 'a list t -> 'a list t

    add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

    update key f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : (key -> bool) -> 'a t -> key * 'a

    find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : (key -> bool) -> 'a t -> key * 'a

    find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : (key -> 'a -> unit) -> 'a t -> unit

    iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

    fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : (key -> 'a -> bool) -> 'a t -> 'a t

    filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : (key -> 'a -> bool) -> 'a t -> bool

    for_all f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : (key -> 'a -> bool) -> 'a t -> bool

    exists f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Stdlib.Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Stdlib.Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    val of_list : (key * 'a) list -> 'a t
    val disjoint_union : + ?eq:('a -> 'a -> bool) -> + ?print:(Stdlib.Format.formatter -> 'a -> unit) -> + 'a t -> + 'a t -> + 'a t

    disjoint_union m1 m2 contains all bindings from m1 and m2. If some binding is present in both and the associated value is not equal, a Fatal_error is raised

    val union_right : 'a t -> 'a t -> 'a t

    union_right m1 m2 contains all bindings from m1 and m2. If some binding is present in both, the one from m2 is taken

    val union_left : 'a t -> 'a t -> 'a t

    union_left m1 m2 = union_right m2 m1

    val union_merge : ('a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
    val rename : key t -> key -> key
    val map_keys : (key -> key) -> 'a t -> 'a t
    val keys : 'a t -> Stdlib.Set.Make(T).t
    val data : 'a t -> 'a list
    val of_set : (key -> 'a) -> Stdlib.Set.Make(T).t -> 'a t
    val transpose_keys_and_data : key t -> key t
    val transpose_keys_and_data_set : key t -> Stdlib.Set.Make(T).t t
    val print : + (Stdlib.Format.formatter -> 'a -> unit) -> + Stdlib.Format.formatter -> + 'a t -> + unit
    diff --git a/ocaml/Closure_origin/Set/index.html b/ocaml/Closure_origin/Set/index.html new file mode 100644 index 0000000..be00a10 --- /dev/null +++ b/ocaml/Closure_origin/Set/index.html @@ -0,0 +1,2 @@ + +Set (ocaml.Closure_origin.Set)

    Module Closure_origin.Set

    include Set.S with type elt = T.t and type t = Set.Make(T).t

    Sets

    type elt = T.t

    The type of the set elements.

    The type of sets.

    val empty : t

    The empty set.

    val add : elt -> t -> t

    add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val singleton : elt -> t

    singleton x returns the one-element set containing only x.

    val remove : elt -> t -> t

    remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val union : t -> t -> t

    Set union.

    val inter : t -> t -> t

    Set intersection.

    val disjoint : t -> t -> bool

    Test if two sets are disjoint.

    • since 4.08
    val diff : t -> t -> t

    Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

    val cardinal : t -> int

    Return the number of elements of a set.

    Elements

    val elements : t -> elt list

    Return the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Set.Make.

    val min_elt : t -> elt

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

    val min_elt_opt : t -> elt option

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

    • since 4.05
    val max_elt : t -> elt

    Same as min_elt, but returns the largest element of the given set.

    val max_elt_opt : t -> elt option

    Same as min_elt_opt, but returns the largest element of the given set.

    • since 4.05
    val choose : t -> elt

    Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    val choose_opt : t -> elt option

    Return one element of the given set, or None if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    • since 4.05

    Searching

    val find : elt -> t -> elt

    find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

    • since 4.01
    val find_opt : elt -> t -> elt option

    find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

    • since 4.05
    val find_first : (elt -> bool) -> t -> elt

    find_first f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

    For example, find_first (fun e -> Ord.compare e x >= 0) s will return the first element e of s where Ord.compare e x >= 0 (intuitively: e >= x), or raise Not_found if x is greater than any element of s.

    • since 4.05
    val find_first_opt : (elt -> bool) -> t -> elt option

    find_first_opt f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

    • since 4.05
    val find_last : (elt -> bool) -> t -> elt

    find_last f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

    • since 4.05
    val find_last_opt : (elt -> bool) -> t -> elt option

    find_last_opt f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

    • since 4.05

    Traversing

    val iter : (elt -> unit) -> t -> unit

    iter f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.

    val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc

    fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

    Transforming

    val filter : (elt -> bool) -> t -> t

    filter f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val filter_map : (elt -> elt option) -> t -> t

    filter_map f s returns the set of all v such that f x = Some v for some element x of s.

    For example,

    filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) s

    is the set of halves of the even elements of s.

    If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned unchanged: the result of the function is then physically equal to s.

    • since 4.11
    val partition : (elt -> bool) -> t -> t * t

    partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

    val split : elt -> t -> t * bool * t

    split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.

    Predicates and comparisons

    val is_empty : t -> bool

    Test whether a set is empty or not.

    val mem : elt -> t -> bool

    mem x s tests whether x belongs to the set s.

    val equal : t -> t -> bool

    equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

    val compare : t -> t -> int

    Total ordering between sets. Can be used as the ordering function for doing sets of sets.

    val subset : t -> t -> bool

    subset s1 s2 tests whether the set s1 is a subset of the set s2.

    val for_all : (elt -> bool) -> t -> bool

    for_all f s checks if all elements of the set satisfy the predicate f.

    val exists : (elt -> bool) -> t -> bool

    exists f s checks if at least one element of the set satisfies the predicate f.

    Converting

    val to_list : t -> elt list

    to_list s is elements s.

    • since 5.1
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t

    to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

    • since 4.07
    val to_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in ascending order

    • since 4.07
    val to_rev_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in descending order

    • since 4.12
    val add_seq : elt Stdlib.Seq.t -> t -> t

    Add the given elements to the set, in order.

    • since 4.07
    val of_seq : elt Stdlib.Seq.t -> t

    Build a set from the given bindings

    • since 4.07
    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    val to_string : t -> string
    val of_list : elt list -> t
    val map : (elt -> elt) -> t -> t
    diff --git a/ocaml/Closure_origin/T/index.html b/ocaml/Closure_origin/T/index.html new file mode 100644 index 0000000..1b8987d --- /dev/null +++ b/ocaml/Closure_origin/T/index.html @@ -0,0 +1,2 @@ + +T (ocaml.Closure_origin.T)

    Module Closure_origin.T

    type t = t
    include Hashtbl.HashedType with type t := t
    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val hash : t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := t
    val compare : t -> t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    diff --git a/ocaml/Closure_origin/Tbl/index.html b/ocaml/Closure_origin/Tbl/index.html new file mode 100644 index 0000000..89a26eb --- /dev/null +++ b/ocaml/Closure_origin/Tbl/index.html @@ -0,0 +1,2 @@ + +Tbl (ocaml.Closure_origin.Tbl)

    Module Closure_origin.Tbl

    include Hashtbl.S with type key = T.t and type 'a t = 'a Hashtbl.Make(T).t
    type key = T.t
    val create : int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    • since 4.00
    val copy : 'a t -> 'a t
    val add : 'a t -> key -> 'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    • since 4.05
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key -> 'a -> unit
    val mem : 'a t -> key -> bool
    val iter : (key -> 'a -> unit) -> 'a t -> unit
    val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
    • since 4.03
    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc
    val length : 'a t -> int
    val stats : 'a t -> Stdlib.Hashtbl.statistics
    • since 4.00
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
    • since 4.07
    val to_seq_keys : _ t -> key Stdlib.Seq.t
    • since 4.07
    val to_seq_values : 'a t -> 'a Stdlib.Seq.t
    • since 4.07
    val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
    • since 4.07
    val to_list : 'a t -> (T.t * 'a) list
    val of_list : (T.t * 'a) list -> 'a t
    val to_map : 'a t -> 'a Stdlib.Map.Make(T).t
    val of_map : 'a Stdlib.Map.Make(T).t -> 'a t
    val memoize : 'a t -> (key -> 'a) -> key -> 'a
    val map : 'a t -> ('a -> 'b) -> 'b t
    diff --git a/ocaml/Closure_origin/index.html b/ocaml/Closure_origin/index.html new file mode 100644 index 0000000..04a0811 --- /dev/null +++ b/ocaml/Closure_origin/index.html @@ -0,0 +1,2 @@ + +Closure_origin (ocaml.Closure_origin)

    Module Closure_origin

    include Identifiable.S
    type t
    module T : Identifiable.Thing with type t = t
    include Identifiable.Thing with type t := T.t
    include Hashtbl.HashedType with type t := T.t
    val equal : T.t -> T.t -> bool

    The equality predicate used to compare keys.

    val hash : T.t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := T.t
    val compare : T.t -> T.t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> T.t -> unit
    val print : Stdlib.Format.formatter -> T.t -> unit
    module Set : Identifiable.Set with module T := T
    module Map : Identifiable.Map with module T := T
    module Tbl : Identifiable.Tbl with module T := T
    val create : Closure_id.t -> t
    val get_compilation_unit : t -> Compilation_unit.t
    diff --git a/ocaml/Cmi_format/index.html b/ocaml/Cmi_format/index.html new file mode 100644 index 0000000..a885284 --- /dev/null +++ b/ocaml/Cmi_format/index.html @@ -0,0 +1,2 @@ + +Cmi_format (ocaml.Cmi_format)

    Module Cmi_format

    type pers_flags =
    1. | Rectypes
    2. | Alerts of Misc.alerts
    3. | Opaque
    type cmi_infos = {
    1. cmi_name : Misc.modname;
    2. cmi_sign : Types.signature_item list;
    3. cmi_crcs : Misc.crcs;
    4. cmi_flags : pers_flags list;
    }
    val output_cmi : string -> out_channel -> cmi_infos -> Stdlib.Digest.t
    val input_cmi : in_channel -> cmi_infos
    val read_cmi : string -> cmi_infos
    type error =
    1. | Not_an_interface of Misc.filepath
    2. | Wrong_version_interface of Misc.filepath * string
    3. | Corrupted_interface of Misc.filepath
    exception Error of error
    val report_error : Stdlib.Format.formatter -> error -> unit
    diff --git a/ocaml/Cmm/index.html b/ocaml/Cmm/index.html new file mode 100644 index 0000000..82ec9e3 --- /dev/null +++ b/ocaml/Cmm/index.html @@ -0,0 +1,30 @@ + +Cmm (ocaml.Cmm)

    Module Cmm

    type machtype_component =
    1. | Val
    2. | Addr
    3. | Int
    4. | Float
    type machtype = machtype_component array
    val typ_void : machtype
    val typ_val : machtype
    val typ_addr : machtype
    val typ_int : machtype
    val typ_float : machtype

    Least upper bound of two machtype_components.

    val ge_component : machtype_component -> machtype_component -> bool

    Returns true iff the first supplied machtype_component is greater than or equal to the second under the relation used by lub_component.

    type exttype =
    1. | XInt
      (*

      r OCaml value, word-sized integer

      *)
    2. | XInt32
      (*

      r 32-bit integer

      *)
    3. | XInt64
      (*

      r 64-bit integer

      *)
    4. | XFloat
      (*

      r double-precision FP number

      *)

    A variant of machtype used to describe arguments to external C functions

    val machtype_of_exttype : exttype -> machtype
    val machtype_of_exttype_list : exttype list -> machtype
    type integer_comparison = Lambda.integer_comparison =
    1. | Ceq
    2. | Cne
    3. | Clt
    4. | Cgt
    5. | Cle
    6. | Cge
    val negate_integer_comparison : integer_comparison -> integer_comparison
    val swap_integer_comparison : integer_comparison -> integer_comparison
    type float_comparison = Lambda.float_comparison =
    1. | CFeq
    2. | CFneq
    3. | CFlt
    4. | CFnlt
    5. | CFgt
    6. | CFngt
    7. | CFle
    8. | CFnle
    9. | CFge
    10. | CFnge
    val negate_float_comparison : float_comparison -> float_comparison
    val swap_float_comparison : float_comparison -> float_comparison
    type label = int
    val new_label : unit -> label
    val set_label : label -> unit
    val cur_label : unit -> label
    type rec_flag =
    1. | Nonrecursive
    2. | Recursive
    type phantom_defining_expr =
    1. | Cphantom_const_int of Targetint.t
      (*

      The phantom-let-bound variable is a constant integer. The argument must be the tagged representation of an integer within the range of type int on the target. (Analogously to Cconst_int.)

      *)
    2. | Cphantom_const_symbol of string
      (*

      The phantom-let-bound variable is an alias for a symbol.

      *)
    3. | Cphantom_var of Backend_var.t
      (*

      The phantom-let-bound variable is an alias for another variable. The aliased variable must not be a bound by a phantom let.

      *)
    4. | Cphantom_offset_var of {
      1. var : Backend_var.t;
      2. offset_in_words : int;
      }
      (*

      The phantom-let-bound-variable's value is defined by adding the given number of words to the pointer contained in the given identifier.

      *)
    5. | Cphantom_read_field of {
      1. var : Backend_var.t;
      2. field : int;
      }
      (*

      The phantom-let-bound-variable's value is found by adding the given number of words to the pointer contained in the given identifier, then dereferencing.

      *)
    6. | Cphantom_read_symbol_field of {
      1. sym : string;
      2. field : int;
      }
      (*

      As for Uphantom_read_var_field, but with the pointer specified by a symbol.

      *)
    7. | Cphantom_block of {
      1. tag : int;
      2. fields : Backend_var.t list;
      }
      (*

      The phantom-let-bound variable points at a block with the given structure.

      *)
    type memory_chunk =
    1. | Byte_unsigned
    2. | Byte_signed
    3. | Sixteen_unsigned
    4. | Sixteen_signed
    5. | Thirtytwo_unsigned
    6. | Thirtytwo_signed
    7. | Word_int
    8. | Word_val
    9. | Single
    10. | Double
    and operation =
    1. | Capply of machtype
    2. | Cextcall of string * machtype * exttype list * bool
      (*

      The machtype is the machine type of the result. The exttype list describes the unboxing types of the arguments. An empty list means "all arguments are machine words XInt". The boolean indicates whether the function may allocate.

      *)
    3. | Cload of {
      1. memory_chunk : memory_chunk;
      2. mutability : Asttypes.mutable_flag;
      3. is_atomic : bool;
      }
    4. | Calloc
    5. | Cstore of memory_chunk * Lambda.initialization_or_assignment
    6. | Caddi
    7. | Csubi
    8. | Cmuli
    9. | Cmulhi
    10. | Cdivi
    11. | Cmodi
    12. | Cand
    13. | Cor
    14. | Cxor
    15. | Clsl
    16. | Clsr
    17. | Casr
    18. | Ccmpi of integer_comparison
    19. | Caddv
    20. | Cadda
    21. | Ccmpa of integer_comparison
    22. | Cnegf
    23. | Cabsf
    24. | Caddf
    25. | Csubf
    26. | Cmulf
    27. | Cdivf
    28. | Cfloatofint
    29. | Cintoffloat
    30. | Ccmpf of float_comparison
    31. | Craise of Lambda.raise_kind
    32. | Ccheckbound
    33. | Copaque
    34. | Cdls_get
    and expression =
    1. | Cconst_int of int * Debuginfo.t
    2. | Cconst_natint of nativeint * Debuginfo.t
    3. | Cconst_float of float * Debuginfo.t
    4. | Cconst_symbol of string * Debuginfo.t
    5. | Cvar of Backend_var.t
    6. | Clet of Backend_var.With_provenance.t * expression * expression
    7. | Clet_mut of Backend_var.With_provenance.t * machtype * expression * expression
    8. | Cphantom_let of Backend_var.With_provenance.t + * phantom_defining_expr option + * expression
    9. | Cassign of Backend_var.t * expression
    10. | Ctuple of expression list
    11. | Cop of operation * expression list * Debuginfo.t
    12. | Csequence of expression * expression
    13. | Cifthenelse of expression + * Debuginfo.t + * expression + * Debuginfo.t + * expression + * Debuginfo.t
    14. | Cswitch of expression + * int array + * (expression * Debuginfo.t) array + * Debuginfo.t
    15. | Ccatch of rec_flag + * (int + * (Backend_var.With_provenance.t * machtype) list + * expression + * Debuginfo.t) + list + * expression
    16. | Cexit of int * expression list
    17. | Ctrywith of expression + * Backend_var.With_provenance.t + * expression + * Debuginfo.t
    18. | Creturn_addr
      (*

      Return address saved in the current call frame

      *)

    Every basic block should have a corresponding Debuginfo.t for its beginning.

    type codegen_option =
    1. | Reduce_code_size
    2. | No_CSE
    type fundecl = {
    1. fun_name : string;
    2. fun_args : (Backend_var.With_provenance.t * machtype) list;
    3. fun_body : expression;
    4. fun_codegen_options : codegen_option list;
    5. fun_poll : Lambda.poll_attribute;
    6. fun_dbg : Debuginfo.t;
    }
    type data_item =
    1. | Cdefine_symbol of string
    2. | Cglobal_symbol of string
    3. | Cint8 of int
    4. | Cint16 of int
    5. | Cint32 of nativeint
    6. | Cint of nativeint
    7. | Csingle of float
    8. | Cdouble of float
    9. | Csymbol_address of string
    10. | Cstring of string
    11. | Cskip of int
    12. | Calign of int
    type phrase =
    1. | Cfunction of fundecl
    2. | Cdata of data_item list
    val ccatch : + (int + * (Backend_var.With_provenance.t * machtype) list + * expression + * expression + * Debuginfo.t) -> + expression
    val reset : unit -> unit
    val iter_shallow_tail : (expression -> unit) -> expression -> bool

    Either apply the callback to all immediate sub-expressions that can produce the final result for the expression and return true, or do nothing and return false. Note that the notion of "tail" sub-expression used here does not match the one used to trigger tail calls; in particular, try...with handlers are considered to be in tail position (because their result become the final result for the expression).

    val map_tail : (expression -> expression) -> expression -> expression

    Apply the transformation to an expression, trying to push it to all inner sub-expressions that can produce the final result. Same disclaimer as for iter_shallow_tail about the notion of "tail" sub-expression.

    val map_shallow : (expression -> expression) -> expression -> expression

    Apply the transformation to each immediate sub-expression.

    diff --git a/ocaml/Cmm_helpers/index.html b/ocaml/Cmm_helpers/index.html new file mode 100644 index 0000000..8b96e57 --- /dev/null +++ b/ocaml/Cmm_helpers/index.html @@ -0,0 +1,324 @@ + +Cmm_helpers (ocaml.Cmm_helpers)

    Module Cmm_helpers

    val bind : + string -> + Cmm.expression -> + (Cmm.expression -> Cmm.expression) -> + Cmm.expression

    bind name arg fn is equivalent to let name = arg in fn name, or simply fn arg if arg is simple enough

    val bind_load : + string -> + Cmm.expression -> + (Cmm.expression -> Cmm.expression) -> + Cmm.expression

    Same as bind, but also treats loads from a variable as simple

    val bind_nonvar : + string -> + Cmm.expression -> + (Cmm.expression -> Cmm.expression) -> + Cmm.expression

    Same as bind, but does not treat variables as simple

    Headers

    val caml_black : nativeint

    A null header with GC bits set to black

    val floatarray_tag : Debuginfo.t -> Cmm.expression

    A constant equal to the tag for float arrays

    val block_header : int -> int -> nativeint

    block_header tag size creates a header with tag tag for a block of size size

    val black_block_header : int -> int -> nativeint

    Same as block_header, but with GC bits set to black

    val white_closure_header : int -> nativeint

    Closure headers of the given size

    val black_closure_header : int -> nativeint
    val infix_header : int -> nativeint

    Infix header at the given offset

    val float_header : nativeint

    Header for a boxed float value

    val floatarray_header : int -> nativeint

    Header for an unboxed float array of the given size

    val string_header : int -> nativeint

    Header for a string (or bytes) of the given length

    val boxedint32_header : nativeint

    Boxed integer headers

    val boxedint64_header : nativeint
    val boxedintnat_header : nativeint
    val closure_info : arity:int -> startenv:int -> nativeint

    Closure info for a closure of given arity and distance to environment

    val alloc_float_header : Debuginfo.t -> Cmm.expression

    Wrappers

    val alloc_floatarray_header : int -> Debuginfo.t -> Cmm.expression
    val alloc_closure_header : int -> Debuginfo.t -> Cmm.expression
    val alloc_infix_header : int -> Debuginfo.t -> Cmm.expression
    val alloc_closure_info : + arity:int -> + startenv:int -> + Debuginfo.t -> + Cmm.expression
    val alloc_boxedint32_header : Debuginfo.t -> Cmm.expression
    val alloc_boxedint64_header : Debuginfo.t -> Cmm.expression
    val alloc_boxedintnat_header : Debuginfo.t -> Cmm.expression

    Integers

    val max_repr_int : int

    Minimal/maximal OCaml integer values whose backend representation fits in a regular OCaml integer

    val min_repr_int : int
    val int_const : Debuginfo.t -> int -> Cmm.expression

    Make an integer constant from the given integer (tags the integer)

    val cint_const : int -> Cmm.data_item
    val targetint_const : int -> Targetint.t
    val natint_const_untagged : Debuginfo.t -> Stdlib.Nativeint.t -> Cmm.expression

    Make a Cmm constant holding the given nativeint value. Uses Cconst_int instead of Cconst_nativeint when possible to preserve peephole optimisations.

    val add_const : Cmm.expression -> int -> Debuginfo.t -> Cmm.expression

    Add an integer to the given expression

    Increment/decrement of integers

    val ignore_low_bit_int : Cmm.expression -> Cmm.expression

    Simplify the given expression knowing its last bit will be irrelevant

    val ignore_high_bit_int : Cmm.expression -> Cmm.expression

    Simplify the given expression knowing its first bit will be irrelevant

    Arithmetical operations on integers

    Integer tagging. tag_int x = (x lsl 1) + 1

    Integer untagging. untag_int x = (x asr 1)

    Specific division operations for boxed integers

    val mk_if_then_else : + Debuginfo.t -> + Cmm.expression -> + Debuginfo.t -> + Cmm.expression -> + Debuginfo.t -> + Cmm.expression -> + Cmm.expression

    If-Then-Else expression mk_if_then_else dbg cond ifso_dbg ifso ifnot_dbg ifnot associates dbg to the global if-then-else expression, ifso_dbg to the then branch ifso, and ifnot_dbg to the else branch ifnot

    Boolean negation

    val mk_compare_ints : + Debuginfo.t -> + Cmm.expression -> + Cmm.expression -> + Cmm.expression

    Integer and float comparison that returns int not bool

    val mk_compare_floats : + Debuginfo.t -> + Cmm.expression -> + Cmm.expression -> + Cmm.expression
    val create_loop : Cmm.expression -> Debuginfo.t -> Cmm.expression

    Loop construction (while true do expr done). Used to be represented as Cloop.

    val raise_symbol : Debuginfo.t -> string -> Cmm.expression

    Exception raising

    Convert a tagged integer into a raw integer with boolean meaning

    Float boxing and unboxing

    val unbox_float : Debuginfo.t -> Cmm.expression -> Cmm.expression
    val float_of_float16 : Debuginfo.t -> Cmm.expression -> Cmm.expression

    Conversions for 16-bit floats

    val float16_of_float : Debuginfo.t -> Cmm.expression -> Cmm.expression
    val box_complex : + Debuginfo.t -> + Cmm.expression -> + Cmm.expression -> + Cmm.expression

    Complex number creation and access

    val return_unit : Debuginfo.t -> Cmm.expression -> Cmm.expression

    Make the given expression return a unit value

    val remove_unit : Cmm.expression -> Cmm.expression

    Remove a trailing unit return if any

    Blocks

    val mk_load_mut : Cmm.memory_chunk -> Cmm.operation

    Non-atomic load of a mutable field

    val mk_load_atomic : Cmm.memory_chunk -> Cmm.operation

    Atomic load. All atomic fields are mutable.

    val field_address : Cmm.expression -> int -> Debuginfo.t -> Cmm.expression

    field_address ptr n dbg returns an expression for the address of the nth field of the block pointed to by ptr

    val get_field_gen : + Asttypes.mutable_flag -> + Cmm.expression -> + int -> + Debuginfo.t -> + Cmm.expression

    get_field_gen mut ptr n dbg returns an expression for the access to the nth field of the block pointed to by ptr

    set_field ptr n newval init dbg returns an expression for setting the nth field of the block pointed to by ptr to newval

    Load a block's header

    val get_header_masked : Cmm.expression -> Debuginfo.t -> Cmm.expression

    Same as get_header, but also clear all reserved bits of the result

    Load a block's tag

    Load a block's size

    Arrays

    val wordsize_shift : int
    val numfloat_shift : int
    val is_addr_array_hdr : Cmm.expression -> Debuginfo.t -> Cmm.expression

    Check whether the given array is an array of regular OCaml values (as opposed to unboxed floats), from its header or pointer

    val is_addr_array_ptr : Cmm.expression -> Debuginfo.t -> Cmm.expression
    val addr_array_length_shifted : Cmm.expression -> Debuginfo.t -> Cmm.expression

    Get the length of an array from its header Shifts by one bit less than necessary, keeping one of the GC colour bits, to save an operation when returning the length as a caml integer or when comparing it to a caml integer. Assumes that the reserved bits are clear (see get_header_masked)

    val float_array_length_shifted : + Cmm.expression -> + Debuginfo.t -> + Cmm.expression
    val array_indexing : + ?typ:Cmm.machtype_component -> + int -> + Cmm.expression -> + Cmm.expression -> + Debuginfo.t -> + Cmm.expression

    For array_indexing ?typ log2size ptr ofs dbg : Produces a pointer to the element of the array ptr on the position ofs with the given element log2size log2 element size. ofs is given as a tagged int expression. The optional ?typ argument is the C-- type of the result. By default, it is Addr, meaning we are constructing a derived pointer into the heap. If we know the pointer is outside the heap (this is the case for bigarray indexing), we give type Int instead.

    val addr_array_ref : + Cmm.expression -> + Cmm.expression -> + Debuginfo.t -> + Cmm.expression

    Array loads and stores unboxed_float_array_ref and float_array_ref differ in the boxing of the result; float_array_set takes an unboxed float

    val int_array_ref : + Cmm.expression -> + Cmm.expression -> + Debuginfo.t -> + Cmm.expression
    val unboxed_float_array_ref : + Cmm.expression -> + Cmm.expression -> + Debuginfo.t -> + Cmm.expression
    val float_array_ref : + Cmm.expression -> + Cmm.expression -> + Debuginfo.t -> + Cmm.expression
    val addr_array_set : + Cmm.expression -> + Cmm.expression -> + Cmm.expression -> + Debuginfo.t -> + Cmm.expression
    val addr_array_initialize : + Cmm.expression -> + Cmm.expression -> + Cmm.expression -> + Debuginfo.t -> + Cmm.expression
    val int_array_set : + Cmm.expression -> + Cmm.expression -> + Cmm.expression -> + Debuginfo.t -> + Cmm.expression
    val float_array_set : + Cmm.expression -> + Cmm.expression -> + Cmm.expression -> + Debuginfo.t -> + Cmm.expression

    Strings

    val string_length : Cmm.expression -> Debuginfo.t -> Cmm.expression
    val bigstring_length : Cmm.expression -> Debuginfo.t -> Cmm.expression

    Objects

    val lookup_tag : + Cmm.expression -> + Cmm.expression -> + Debuginfo.t -> + Cmm.expression

    Lookup a method by its hash, using caml_get_public_method Arguments :

    • obj : the object from which to lookup
    • tag : the hash of the method name, as a tagged integer
    val lookup_label : + Cmm.expression -> + Cmm.expression -> + Debuginfo.t -> + Cmm.expression

    Lookup a method by its offset in the method table Arguments :

    • obj : the object from which to lookup
    • lab : the position of the required method in the object's method array, as a tagged integer
    val call_cached_method : + Cmm.expression -> + Cmm.expression -> + Cmm.expression -> + Cmm.expression -> + Cmm.expression list -> + Debuginfo.t -> + Cmm.expression

    Lookup and call a method using the method cache Arguments :

    • obj : the object from which to lookup
    • tag : the hash of the method name, as a tagged integer
    • cache : the method cache array
    • pos : the position of the cache entry in the cache array
    • args : the additional arguments to the method call

    Allocations

    val make_alloc : Debuginfo.t -> int -> Cmm.expression list -> Cmm.expression

    Allocate a block of regular values with the given tag

    val make_float_alloc : + Debuginfo.t -> + int -> + Cmm.expression list -> + Cmm.expression

    Allocate a block of unboxed floats with the given tag

    Bounds checking

    val make_checkbound : Debuginfo.t -> Cmm.expression list -> Cmm.expression

    Generate a Ccheckbound term

    check_bound safety access_size dbg length a2 k prefixes expression k with a check that reading access_size bits starting at position a2 in a string/bytes value of length length is within bounds, unless safety is Unsafe.

    Sys.opaque_identity

    Generic application functions

    val apply_function_sym : int -> string

    Get the symbol for the generic application with n arguments, and ensure its presence in the set of defined symbols

    val curry_function_sym : int -> string

    If n is positive, get the symbol for the generic currying wrapper with n arguments, and ensure its presence in the set of defined symbols. Otherwise, do the same for the generic tuple wrapper with -n arguments.

    Bigarrays

    val bigarray_get : + bool -> + Lambda.bigarray_kind -> + Lambda.bigarray_layout -> + Cmm.expression -> + Cmm.expression list -> + Debuginfo.t -> + Cmm.expression

    bigarray_get unsafe kind layout b args dbg

    • unsafe : if true, do not insert bound checks
    • kind : see Lambda.bigarray_kind
    • layout : see Lambda.bigarray_layout
    • b : the bigarray to load from
    • args : a list of tagged integer expressions, corresponding to the indices in the respective dimensions
    • dbg : debugging information

    bigarray_set unsafe kind layout b args newval dbg Same as bigarray_get, with newval the value being assigned

    Operations on 32-bit integers

    low_32 _ x is a value which agrees with x on at least the low 32 bits

    val sign_extend_32 : Debuginfo.t -> Cmm.expression -> Cmm.expression

    Sign extend from 32 bits to the word size

    val zero_extend_32 : Debuginfo.t -> Cmm.expression -> Cmm.expression

    Zero extend from 32 bits to the word size

    Boxed numbers

    val caml_nativeint_ops : string

    Global symbols for the ops field of boxed integers

    val caml_int32_ops : string
    val caml_int64_ops : string

    Box a given integer, without sharing of constants

    Unbox a given boxed integer

    val make_unsigned_int : + Primitive.boxed_integer -> + Cmm.expression -> + Debuginfo.t -> + Cmm.expression

    Used to prepare 32-bit integers on 64-bit platforms for a lsr operation

    val unaligned_load_16 : + Cmm.expression -> + Cmm.expression -> + Debuginfo.t -> + Cmm.expression
    val unaligned_set_16 : + Cmm.expression -> + Cmm.expression -> + Cmm.expression -> + Debuginfo.t -> + Cmm.expression
    val unaligned_load_32 : + Cmm.expression -> + Cmm.expression -> + Debuginfo.t -> + Cmm.expression
    val unaligned_set_32 : + Cmm.expression -> + Cmm.expression -> + Cmm.expression -> + Debuginfo.t -> + Cmm.expression
    val unaligned_load_64 : + Cmm.expression -> + Cmm.expression -> + Debuginfo.t -> + Cmm.expression
    val unaligned_set_64 : + Cmm.expression -> + Cmm.expression -> + Cmm.expression -> + Debuginfo.t -> + Cmm.expression

    Raw memory accesses

    unaligned_set size ptr idx newval dbg

    unaligned_load size ptr idx dbg

    box_sized size dbg exp

    Primitives

    type unary_primitive = Cmm.expression -> Debuginfo.t -> Cmm.expression
    val floatfield : int -> unary_primitive

    Return the n-th field of a float array (or float-only record), as an unboxed float

    val int_as_pointer : unary_primitive

    Int_as_pointer primitive

    Raise primitive

    val negint : unary_primitive

    Unary negation of an OCaml integer

    val offsetint : int -> unary_primitive

    Add a constant number to an OCaml integer

    val offsetref : int -> unary_primitive

    Add a constant number to an OCaml integer reference

    val arraylength : Lambda.array_kind -> unary_primitive

    Return the length of the array argument, as an OCaml integer

    Byte swap primitive Operates on Cmm integers (unboxed values)

    val bswap16 : unary_primitive

    16-bit byte swap primitive Operates on Cmm integers (untagged integers)

    type binary_primitive = + Cmm.expression -> + Cmm.expression -> + Debuginfo.t -> + Cmm.expression
    type assignment_kind =
    1. | Caml_modify
    2. | Caml_initialize
    3. | Simple

    setfield offset value_is_ptr init ptr value dbg

    val setfloatfield : + int -> + Lambda.initialization_or_assignment -> + binary_primitive

    setfloatfield offset init ptr value dbg value is expected to be an unboxed floating point number

    val add_int_caml : binary_primitive

    Operations on OCaml integers

    val sub_int_caml : binary_primitive
    val mul_int_caml : binary_primitive
    val div_int_caml : Lambda.is_safe -> binary_primitive
    val mod_int_caml : Lambda.is_safe -> binary_primitive
    val and_int_caml : binary_primitive
    val or_int_caml : binary_primitive
    val xor_int_caml : binary_primitive
    val lsl_int_caml : binary_primitive
    val lsr_int_caml : binary_primitive
    val asr_int_caml : binary_primitive

    Strings, Bytes and Bigstrings

    val stringref_unsafe : binary_primitive

    Regular string/bytes access. Args: string/bytes, index

    val stringref_safe : binary_primitive

    Load by chunk from string/bytes, bigstring. Args: string, index

    Arrays

    val arrayref_unsafe : Lambda.array_kind -> binary_primitive

    Array access. Args: array, index

    val arrayref_safe : Lambda.array_kind -> binary_primitive
    type ternary_primitive = + Cmm.expression -> + Cmm.expression -> + Cmm.expression -> + Debuginfo.t -> + Cmm.expression

    Same as setfield, except the offset is one of the arguments. Args: pointer (structure/array/...), index, value

    val bytesset_unsafe : ternary_primitive

    Set the byte at the given offset to the given value. Args: bytes, index, value

    val bytesset_safe : ternary_primitive
    val arrayset_unsafe : Lambda.array_kind -> ternary_primitive

    Set the element at the given index in the given array to the given value. WARNING: if kind is Pfloatarray, then value is expected to be an _unboxed_ float. Otherwise, it is expected to be a regular caml value, including in the case where the array contains floats. Args: array, index, value

    val arrayset_safe : Lambda.array_kind -> ternary_primitive

    Set a chunk of data in the given bytes or bigstring structure. See also string_load and bigstring_load. Note: value is expected to be an unboxed number of the given size. Args: pointer, index, value

    Switch

    val transl_isout : + Cmm.expression -> + Cmm.expression -> + Debuginfo.t -> + Cmm.expression

    transl_isout h arg dbg

    val make_switch : + Cmm.expression -> + int array -> + (Cmm.expression * Debuginfo.t) array -> + Debuginfo.t -> + Cmm.expression

    make_switch arg cases actions dbg : Generate a Cswitch construct, or optimize as a static table lookup when possible.

    val transl_int_switch : + Debuginfo.t -> + Cmm.expression -> + int -> + int -> + (int * Cmm.expression) list -> + Cmm.expression -> + Cmm.expression

    transl_int_switch loc arg low high cases default

    val transl_switch_clambda : + Debuginfo.t -> + Cmm.expression -> + int array -> + Cmm.expression array -> + Cmm.expression

    transl_switch_clambda loc arg index cases

    val strmatch_compile : + Debuginfo.t -> + Cmm.expression -> + Cmm.expression option -> + (string * Cmm.expression) list -> + Cmm.expression

    strmatch_compile dbg arg default cases

    Closures and function applications

    val ptr_offset : Cmm.expression -> int -> Debuginfo.t -> Cmm.expression

    Adds a constant offset to a pointer (for infix access)

    val direct_apply : + string -> + Cmm.expression list -> + Debuginfo.t -> + Cmm.expression

    Direct application of a function via a symbol

    val generic_apply : + Asttypes.mutable_flag -> + Cmm.expression -> + Cmm.expression list -> + Debuginfo.t -> + Cmm.expression

    Generic application of a function to one or several arguments. The mutable_flag argument annotates the loading of the code pointer from the closure. The Cmmgen code uses a mutable load by default, with a special case when the load is from (the first function of) the currently defined closure.

    Method call : send kind met obj args dbg

    • met is a method identifier, which can be a hashed variant or an index in obj's method table, depending on kind
    • obj is the object whose method is being called
    • args is the extra arguments to the method call (Note: I'm not aware of any way for the frontend to generate any arguments other than the cache and cache position)

    Generic Cmm fragments

    val generic_functions : bool -> Cmx_format.unit_infos list -> Cmm.phrase list

    Generate generic functions

    val placeholder_dbg : unit -> Debuginfo.t
    val placeholder_fun_dbg : human_name:string -> Debuginfo.t
    val entry_point : string list -> Cmm.phrase

    Entry point

    val global_table : string list -> Cmm.phrase

    Generate the caml_globals table

    val reference_symbols : string list -> Cmm.phrase

    Add references to the given symbols

    val globals_map : + (string * Stdlib.Digest.t option * Stdlib.Digest.t option * string list) list -> + Cmm.phrase

    Generate the caml_globals_map structure, as a marshalled string constant

    val frame_table : string list -> Cmm.phrase

    Generate the caml_frametable table, referencing the frametables from the given compilation units

    val data_segment_table : string list -> Cmm.phrase

    Generate the tables for data and code positions respectively of the given compilation units

    val code_segment_table : string list -> Cmm.phrase
    val predef_exception : int -> string -> Cmm.phrase

    Generate data for a predefined exception

    val plugin_header : + (Cmx_format.unit_infos * Stdlib.Digest.t) list -> + Cmm.phrase

    Emit constant symbols

    val cdefine_symbol : (string * Cmmgen_state.is_global) -> Cmm.data_item list

    Produce the data_item list corresponding to a symbol definition

    val emit_block : + (string * Cmmgen_state.is_global) -> + nativeint -> + Cmm.data_item list -> + Cmm.data_item list

    emit_block symb white_header cont prepends to cont the header and symbol for the block. cont must already contain the fields of the block (and may contain additional data items afterwards).

    val emit_float_constant : + (string * Cmmgen_state.is_global) -> + float -> + Cmm.data_item list -> + Cmm.data_item list

    Emit specific kinds of constant blocks as data items

    val emit_string_constant : + (string * Cmmgen_state.is_global) -> + string -> + Cmm.data_item list -> + Cmm.data_item list
    val emit_int32_constant : + (string * Cmmgen_state.is_global) -> + int32 -> + Cmm.data_item list -> + Cmm.data_item list
    val emit_int64_constant : + (string * Cmmgen_state.is_global) -> + int64 -> + Cmm.data_item list -> + Cmm.data_item list
    val emit_nativeint_constant : + (string * Cmmgen_state.is_global) -> + nativeint -> + Cmm.data_item list -> + Cmm.data_item list
    val emit_float_array_constant : + (string * Cmmgen_state.is_global) -> + float list -> + Cmm.data_item list -> + Cmm.data_item list
    val fundecls_size : Clambda.ufunction list -> int
    val emit_constant_closure : + (string * Cmmgen_state.is_global) -> + Clambda.ufunction list -> + Cmm.data_item list -> + Cmm.data_item list -> + Cmm.data_item list
    val emit_preallocated_blocks : + Clambda.preallocated_block list -> + Cmm.phrase list -> + Cmm.phrase list
    diff --git a/ocaml/Cmm_invariants/index.html b/ocaml/Cmm_invariants/index.html new file mode 100644 index 0000000..df9e6b1 --- /dev/null +++ b/ocaml/Cmm_invariants/index.html @@ -0,0 +1,2 @@ + +Cmm_invariants (ocaml.Cmm_invariants)

    Module Cmm_invariants

    Check a number of continuation-related invariants

    run ppf fundecl analyses the given function, and returns whether any errors were encountered (with corresponding error messages printed on the given formatter).

    diff --git a/ocaml/Cmmgen/index.html b/ocaml/Cmmgen/index.html new file mode 100644 index 0000000..a22c329 --- /dev/null +++ b/ocaml/Cmmgen/index.html @@ -0,0 +1,6 @@ + +Cmmgen (ocaml.Cmmgen)

    Module Cmmgen

    diff --git a/ocaml/Cmmgen_state/index.html b/ocaml/Cmmgen_state/index.html new file mode 100644 index 0000000..0bd29f5 --- /dev/null +++ b/ocaml/Cmmgen_state/index.html @@ -0,0 +1,2 @@ + +Cmmgen_state (ocaml.Cmmgen_state)

    Module Cmmgen_state

    Mutable state used by Cmmgen.

    type is_global =
    1. | Global
    2. | Local
    type constant =
    1. | Const_closure of is_global * Clambda.ufunction list * Clambda.uconstant list
    2. | Const_table of is_global * Cmm.data_item list
    val add_constant : Misc.Stdlib.String.t -> constant -> unit
    val add_data_items : Cmm.data_item list -> unit
    val add_function : Clambda.ufunction -> unit
    val get_and_clear_constants : unit -> constant Misc.Stdlib.String.Map.t
    val get_and_clear_data_items : unit -> Cmm.data_item list
    val next_function : unit -> Clambda.ufunction option
    val no_more_functions : unit -> bool
    val set_structured_constants : Clambda.preallocated_constant list -> unit
    val add_structured_constant : string -> Clambda.ustructured_constant -> unit
    val structured_constant_of_sym : string -> Clambda.ustructured_constant option
    diff --git a/ocaml/Cmo_format/index.html b/ocaml/Cmo_format/index.html new file mode 100644 index 0000000..d2a26a8 --- /dev/null +++ b/ocaml/Cmo_format/index.html @@ -0,0 +1,2 @@ + +Cmo_format (ocaml.Cmo_format)

    Module Cmo_format

    type modname = string
    type crcs = (modname * Stdlib.Digest.t option) list
    type compunit =
    1. | Compunit of string
    type predef =
    1. | Predef_exn of string
    type reloc_info =
    1. | Reloc_literal of Stdlib.Obj.t
    2. | Reloc_getcompunit of compunit
    3. | Reloc_getpredef of predef
    4. | Reloc_setcompunit of compunit
    5. | Reloc_primitive of string
    type compilation_unit = {
    1. cu_name : compunit;
    2. mutable cu_pos : int;
    3. cu_codesize : int;
    4. cu_reloc : (reloc_info * int) list;
    5. cu_imports : crcs;
    6. cu_required_compunits : compunit list;
    7. cu_primitives : string list;
    8. mutable cu_debug : int;
    9. cu_debugsize : int;
    }
    type library = {
    1. lib_units : compilation_unit list;
    2. lib_custom : bool;
    3. lib_ccobjs : string list;
    4. lib_ccopts : string list;
    5. lib_dllibs : string list;
    }
    diff --git a/ocaml/Cmt2annot/index.html b/ocaml/Cmt2annot/index.html new file mode 100644 index 0000000..eec80d2 --- /dev/null +++ b/ocaml/Cmt2annot/index.html @@ -0,0 +1,7 @@ + +Cmt2annot (ocaml.Cmt2annot)

    Module Cmt2annot

    val gen_annot : + string option -> + sourcefile:string option -> + use_summaries:bool -> + Cmt_format.binary_annots -> + unit
    diff --git a/ocaml/Cmt_format/index.html b/ocaml/Cmt_format/index.html new file mode 100644 index 0000000..49fd541 --- /dev/null +++ b/ocaml/Cmt_format/index.html @@ -0,0 +1,13 @@ + +Cmt_format (ocaml.Cmt_format)

    Module Cmt_format

    cmt and cmti files format.

    The layout of a cmt file is as follows: <cmt> := {<cmi>} <cmt magic> {cmt infos} {<source info>} where <cmi> is the cmi file format: <cmi> := <cmi magic> <cmi info>. More precisely, the optional <cmi> part must be present if and only if the file is:

    • a cmti, or
    • a cmt, for a ml file which has no corresponding mli (hence no corresponding cmti).

    Thus, we provide a common reading function for cmi and cmt(i) files which returns an option for each of the three parts: cmi info, cmt info, source info.

    type binary_annots =
    1. | Packed of Types.signature * string list
    2. | Implementation of Typedtree.structure
    3. | Interface of Typedtree.signature
    4. | Partial_implementation of binary_part array
    5. | Partial_interface of binary_part array
    and binary_part =
    1. | Partial_structure of Typedtree.structure
    2. | Partial_structure_item of Typedtree.structure_item
    3. | Partial_expression of Typedtree.expression
    4. | Partial_pattern : 'k Typedtree.pattern_category + * 'k Typedtree.general_pattern -> binary_part
    5. | Partial_class_expr of Typedtree.class_expr
    6. | Partial_signature of Typedtree.signature
    7. | Partial_signature_item of Typedtree.signature_item
    8. | Partial_module_type of Typedtree.module_type
    type cmt_infos = {
    1. cmt_modname : Misc.modname;
    2. cmt_annots : binary_annots;
    3. cmt_value_dependencies : (Types.value_description * Types.value_description) + list;
    4. cmt_comments : (string * Location.t) list;
    5. cmt_args : string array;
    6. cmt_sourcefile : string option;
    7. cmt_builddir : string;
    8. cmt_loadpath : Load_path.paths;
    9. cmt_source_digest : string option;
    10. cmt_initial_env : Env.t;
    11. cmt_imports : Misc.crcs;
    12. cmt_interface_digest : Stdlib.Digest.t option;
    13. cmt_use_summaries : bool;
    14. cmt_uid_to_decl : Typedtree.item_declaration Shape.Uid.Tbl.t;
    15. cmt_impl_shape : Shape.t option;
    16. cmt_ident_occurrences : (Longident.t Location.loc * Shape_reduce.result) list;
    }
    type error =
    1. | Not_a_typedtree of string
    exception Error of error
    val read : string -> Cmi_format.cmi_infos option * cmt_infos option

    read filename opens filename, and extract both the cmi_infos, if it exists, and the cmt_infos, if it exists. Thus, it can be used with .cmi, .cmt and .cmti files.

    .cmti files always contain a cmi_infos at the beginning. .cmt files only contain a cmi_infos at the beginning if there is no associated .cmti file.

    val read_cmt : string -> cmt_infos
    val read_cmi : string -> Cmi_format.cmi_infos
    val save_cmt : + Unit_info.Artifact.t -> + binary_annots -> + Env.t -> + Cmi_format.cmi_infos option -> + Shape.t option -> + unit

    save_cmt filename modname binary_annots sourcefile initial_env cmi writes a cmt(i) file.

    val read_magic_number : in_channel -> string
    val clear : unit -> unit
    val add_saved_type : binary_part -> unit
    val get_saved_types : unit -> binary_part list
    val set_saved_types : binary_part list -> unit
    val record_value_dependency : + Types.value_description -> + Types.value_description -> + unit
    diff --git a/ocaml/Cmx_format/index.html b/ocaml/Cmx_format/index.html new file mode 100644 index 0000000..5ebf866 --- /dev/null +++ b/ocaml/Cmx_format/index.html @@ -0,0 +1,2 @@ + +Cmx_format (ocaml.Cmx_format)

    Module Cmx_format

    type export_info =
    1. | Clambda of Clambda.value_approximation
    2. | Flambda of Export_info.t
    type unit_infos = {
    1. mutable ui_name : Misc.modname;
    2. mutable ui_symbol : string;
    3. mutable ui_defines : string list;
    4. mutable ui_imports_cmi : Misc.crcs;
    5. mutable ui_imports_cmx : Misc.crcs;
    6. mutable ui_curry_fun : int list;
    7. mutable ui_apply_fun : int list;
    8. mutable ui_send_fun : int list;
    9. mutable ui_export_info : export_info;
    10. mutable ui_for_pack : string option;
    }
    type library_infos = {
    1. lib_units : (unit_infos * Stdlib.Digest.t) list;
    2. lib_ccobjs : string list;
    3. lib_ccopts : string list;
    }
    diff --git a/ocaml/Cmxs_format/index.html b/ocaml/Cmxs_format/index.html new file mode 100644 index 0000000..26a7260 --- /dev/null +++ b/ocaml/Cmxs_format/index.html @@ -0,0 +1,2 @@ + +Cmxs_format (ocaml.Cmxs_format)

    Module Cmxs_format

    type modname = string
    type crcs = (modname * Stdlib.Digest.t option) list
    type dynunit = {
    1. dynu_name : modname;
    2. dynu_crc : Stdlib.Digest.t;
    3. dynu_imports_cmi : crcs;
    4. dynu_imports_cmx : crcs;
    5. dynu_defines : string list;
    }
    type dynheader = {
    1. dynu_magic : string;
    2. dynu_units : dynunit list;
    }
    diff --git a/ocaml/Coloring/index.html b/ocaml/Coloring/index.html new file mode 100644 index 0000000..9e2c7b1 --- /dev/null +++ b/ocaml/Coloring/index.html @@ -0,0 +1,2 @@ + +Coloring (ocaml.Coloring)

    Module Coloring

    val allocate_registers : unit -> int array
    diff --git a/ocaml/Comballoc/index.html b/ocaml/Comballoc/index.html new file mode 100644 index 0000000..d794966 --- /dev/null +++ b/ocaml/Comballoc/index.html @@ -0,0 +1,2 @@ + +Comballoc (ocaml.Comballoc)

    Module Comballoc

    val fundecl : Mach.fundecl -> Mach.fundecl
    diff --git a/ocaml/Compenv/index.html b/ocaml/Compenv/index.html new file mode 100644 index 0000000..a5f12b9 --- /dev/null +++ b/ocaml/Compenv/index.html @@ -0,0 +1,18 @@ + +Compenv (ocaml.Compenv)

    Module Compenv

    exception Exit_with_status of int
    val output_prefix : string -> string
    val extract_output : string option -> string
    val default_output : string option -> string
    val print_version_and_library : string -> 'a
    val print_version_string : unit -> 'a
    val print_standard_library : unit -> 'a
    val fatal : string -> 'a
    val first_ccopts : string list ref
    val first_ppx : string list ref
    val first_include_dirs : string list ref
    val last_include_dirs : string list ref
    val get_objfiles : with_ocamlparam:bool -> string list
    val last_objfiles : string list ref
    val first_objfiles : string list ref
    val stop_early : bool ref
    val has_linker_inputs : bool ref
    type filename = string
    type readenv_position =
    1. | Before_args
    2. | Before_compile of filename
    val readenv : Stdlib.Format.formatter -> readenv_position -> unit
    type deferred_action =
    1. | ProcessImplementation of string
    2. | ProcessInterface of string
    3. | ProcessCFile of string
    4. | ProcessOtherFile of string
    5. | ProcessObjects of string list
    6. | ProcessDLLs of string list
    val c_object_of_filename : string -> string
    val defer : deferred_action -> unit
    val anonymous : string -> unit
    val impl : string -> unit
    val intf : string -> unit
    val process_deferred_actions : + (Stdlib.Format.formatter + * (start_from:Clflags.Compiler_pass.t -> + source_file:string -> + output_prefix:string -> + unit) + * (source_file:string -> + output_prefix:string -> + unit) + * string + * string) -> + unit
    val parse_arguments : + ?current:int ref -> + string array ref -> + Stdlib.Arg.anon_fun -> + string -> + unit
    diff --git a/ocaml/Compilation_unit/Map/index.html b/ocaml/Compilation_unit/Map/index.html new file mode 100644 index 0000000..96957f0 --- /dev/null +++ b/ocaml/Compilation_unit/Map/index.html @@ -0,0 +1,17 @@ + +Map (ocaml.Compilation_unit.Map)

    Module Compilation_unit.Map

    include Map.S with type key = T.t and type 'a t = 'a Map.Make(T).t

    Maps

    type key = T.t

    The type of the map keys.

    type 'a t = 'a Stdlib.Map.Make(T).t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key -> 'a -> 'a t -> 'a t

    add key data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key -> 'a -> 'a list t -> 'a list t

    add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

    update key f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : (key -> bool) -> 'a t -> key * 'a

    find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : (key -> bool) -> 'a t -> key * 'a

    find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : (key -> 'a -> unit) -> 'a t -> unit

    iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

    fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : (key -> 'a -> bool) -> 'a t -> 'a t

    filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : (key -> 'a -> bool) -> 'a t -> bool

    for_all f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : (key -> 'a -> bool) -> 'a t -> bool

    exists f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Stdlib.Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Stdlib.Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    val of_list : (key * 'a) list -> 'a t
    val disjoint_union : + ?eq:('a -> 'a -> bool) -> + ?print:(Stdlib.Format.formatter -> 'a -> unit) -> + 'a t -> + 'a t -> + 'a t

    disjoint_union m1 m2 contains all bindings from m1 and m2. If some binding is present in both and the associated value is not equal, a Fatal_error is raised

    val union_right : 'a t -> 'a t -> 'a t

    union_right m1 m2 contains all bindings from m1 and m2. If some binding is present in both, the one from m2 is taken

    val union_left : 'a t -> 'a t -> 'a t

    union_left m1 m2 = union_right m2 m1

    val union_merge : ('a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
    val rename : key t -> key -> key
    val map_keys : (key -> key) -> 'a t -> 'a t
    val keys : 'a t -> Stdlib.Set.Make(T).t
    val data : 'a t -> 'a list
    val of_set : (key -> 'a) -> Stdlib.Set.Make(T).t -> 'a t
    val transpose_keys_and_data : key t -> key t
    val transpose_keys_and_data_set : key t -> Stdlib.Set.Make(T).t t
    val print : + (Stdlib.Format.formatter -> 'a -> unit) -> + Stdlib.Format.formatter -> + 'a t -> + unit
    diff --git a/ocaml/Compilation_unit/Set/index.html b/ocaml/Compilation_unit/Set/index.html new file mode 100644 index 0000000..00ed953 --- /dev/null +++ b/ocaml/Compilation_unit/Set/index.html @@ -0,0 +1,2 @@ + +Set (ocaml.Compilation_unit.Set)

    Module Compilation_unit.Set

    include Set.S with type elt = T.t and type t = Set.Make(T).t

    Sets

    type elt = T.t

    The type of the set elements.

    The type of sets.

    val empty : t

    The empty set.

    val add : elt -> t -> t

    add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val singleton : elt -> t

    singleton x returns the one-element set containing only x.

    val remove : elt -> t -> t

    remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val union : t -> t -> t

    Set union.

    val inter : t -> t -> t

    Set intersection.

    val disjoint : t -> t -> bool

    Test if two sets are disjoint.

    • since 4.08
    val diff : t -> t -> t

    Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

    val cardinal : t -> int

    Return the number of elements of a set.

    Elements

    val elements : t -> elt list

    Return the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Set.Make.

    val min_elt : t -> elt

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

    val min_elt_opt : t -> elt option

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

    • since 4.05
    val max_elt : t -> elt

    Same as min_elt, but returns the largest element of the given set.

    val max_elt_opt : t -> elt option

    Same as min_elt_opt, but returns the largest element of the given set.

    • since 4.05
    val choose : t -> elt

    Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    val choose_opt : t -> elt option

    Return one element of the given set, or None if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    • since 4.05

    Searching

    val find : elt -> t -> elt

    find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

    • since 4.01
    val find_opt : elt -> t -> elt option

    find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

    • since 4.05
    val find_first : (elt -> bool) -> t -> elt

    find_first f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

    For example, find_first (fun e -> Ord.compare e x >= 0) s will return the first element e of s where Ord.compare e x >= 0 (intuitively: e >= x), or raise Not_found if x is greater than any element of s.

    • since 4.05
    val find_first_opt : (elt -> bool) -> t -> elt option

    find_first_opt f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

    • since 4.05
    val find_last : (elt -> bool) -> t -> elt

    find_last f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

    • since 4.05
    val find_last_opt : (elt -> bool) -> t -> elt option

    find_last_opt f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

    • since 4.05

    Traversing

    val iter : (elt -> unit) -> t -> unit

    iter f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.

    val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc

    fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

    Transforming

    val filter : (elt -> bool) -> t -> t

    filter f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val filter_map : (elt -> elt option) -> t -> t

    filter_map f s returns the set of all v such that f x = Some v for some element x of s.

    For example,

    filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) s

    is the set of halves of the even elements of s.

    If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned unchanged: the result of the function is then physically equal to s.

    • since 4.11
    val partition : (elt -> bool) -> t -> t * t

    partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

    val split : elt -> t -> t * bool * t

    split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.

    Predicates and comparisons

    val is_empty : t -> bool

    Test whether a set is empty or not.

    val mem : elt -> t -> bool

    mem x s tests whether x belongs to the set s.

    val equal : t -> t -> bool

    equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

    val compare : t -> t -> int

    Total ordering between sets. Can be used as the ordering function for doing sets of sets.

    val subset : t -> t -> bool

    subset s1 s2 tests whether the set s1 is a subset of the set s2.

    val for_all : (elt -> bool) -> t -> bool

    for_all f s checks if all elements of the set satisfy the predicate f.

    val exists : (elt -> bool) -> t -> bool

    exists f s checks if at least one element of the set satisfies the predicate f.

    Converting

    val to_list : t -> elt list

    to_list s is elements s.

    • since 5.1
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t

    to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

    • since 4.07
    val to_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in ascending order

    • since 4.07
    val to_rev_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in descending order

    • since 4.12
    val add_seq : elt Stdlib.Seq.t -> t -> t

    Add the given elements to the set, in order.

    • since 4.07
    val of_seq : elt Stdlib.Seq.t -> t

    Build a set from the given bindings

    • since 4.07
    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    val to_string : t -> string
    val of_list : elt list -> t
    val map : (elt -> elt) -> t -> t
    diff --git a/ocaml/Compilation_unit/T/index.html b/ocaml/Compilation_unit/T/index.html new file mode 100644 index 0000000..b8afc95 --- /dev/null +++ b/ocaml/Compilation_unit/T/index.html @@ -0,0 +1,2 @@ + +T (ocaml.Compilation_unit.T)

    Module Compilation_unit.T

    type t = t
    include Hashtbl.HashedType with type t := t
    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val hash : t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := t
    val compare : t -> t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    diff --git a/ocaml/Compilation_unit/Tbl/index.html b/ocaml/Compilation_unit/Tbl/index.html new file mode 100644 index 0000000..096792b --- /dev/null +++ b/ocaml/Compilation_unit/Tbl/index.html @@ -0,0 +1,2 @@ + +Tbl (ocaml.Compilation_unit.Tbl)

    Module Compilation_unit.Tbl

    include Hashtbl.S with type key = T.t and type 'a t = 'a Hashtbl.Make(T).t
    type key = T.t
    val create : int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    • since 4.00
    val copy : 'a t -> 'a t
    val add : 'a t -> key -> 'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    • since 4.05
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key -> 'a -> unit
    val mem : 'a t -> key -> bool
    val iter : (key -> 'a -> unit) -> 'a t -> unit
    val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
    • since 4.03
    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc
    val length : 'a t -> int
    val stats : 'a t -> Stdlib.Hashtbl.statistics
    • since 4.00
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
    • since 4.07
    val to_seq_keys : _ t -> key Stdlib.Seq.t
    • since 4.07
    val to_seq_values : 'a t -> 'a Stdlib.Seq.t
    • since 4.07
    val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
    • since 4.07
    val to_list : 'a t -> (T.t * 'a) list
    val of_list : (T.t * 'a) list -> 'a t
    val to_map : 'a t -> 'a Stdlib.Map.Make(T).t
    val of_map : 'a Stdlib.Map.Make(T).t -> 'a t
    val memoize : 'a t -> (key -> 'a) -> key -> 'a
    val map : 'a t -> ('a -> 'b) -> 'b t
    diff --git a/ocaml/Compilation_unit/index.html b/ocaml/Compilation_unit/index.html new file mode 100644 index 0000000..beb86ca --- /dev/null +++ b/ocaml/Compilation_unit/index.html @@ -0,0 +1,2 @@ + +Compilation_unit (ocaml.Compilation_unit)

    Module Compilation_unit

    include Identifiable.S
    type t
    module T : Identifiable.Thing with type t = t
    include Identifiable.Thing with type t := T.t
    include Hashtbl.HashedType with type t := T.t
    val equal : T.t -> T.t -> bool

    The equality predicate used to compare keys.

    val hash : T.t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := T.t
    val compare : T.t -> T.t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> T.t -> unit
    val print : Stdlib.Format.formatter -> T.t -> unit
    module Set : Identifiable.Set with module T := T
    module Map : Identifiable.Map with module T := T
    module Tbl : Identifiable.Tbl with module T := T
    val create : Ident.t -> Linkage_name.t -> t
    val get_persistent_ident : t -> Ident.t
    val get_linkage_name : t -> Linkage_name.t
    val is_current : t -> bool
    val set_current : t -> unit
    val get_current : unit -> t option
    val get_current_exn : unit -> t
    val get_current_id_exn : unit -> Ident.t
    val string_for_printing : t -> string
    diff --git a/ocaml/Compile/index.html b/ocaml/Compile/index.html new file mode 100644 index 0000000..b6d2ca5 --- /dev/null +++ b/ocaml/Compile/index.html @@ -0,0 +1,12 @@ + +Compile (ocaml.Compile)

    Module Compile

    Bytecode compilation for .ml and .mli files.

    val interface : source_file:string -> output_prefix:string -> unit
    val implementation : + start_from:Clflags.Compiler_pass.t -> + source_file:string -> + output_prefix:string -> + unit

    Internal functions

    *

    to_bytecode info typed takes a typechecked implementation and returns its bytecode.

    val emit_bytecode : + Compile_common.info -> + (Instruct.instruction list * Ident.Set.t) -> + unit

    emit_bytecode bytecode output the bytecode executable.

    diff --git a/ocaml/Compile_common/index.html b/ocaml/Compile_common/index.html new file mode 100644 index 0000000..898bd07 --- /dev/null +++ b/ocaml/Compile_common/index.html @@ -0,0 +1,12 @@ + +Compile_common (ocaml.Compile_common)

    Module Compile_common

    Common compilation pipeline between bytecode and native.

    Initialization

    type info = {
    1. target : Unit_info.t;
    2. env : Env.t;
    3. ppf_dump : Stdlib.Format.formatter;
    4. tool_name : string;
    5. native : bool;
    }

    Information needed to compile a file.

    val with_info : + native:bool -> + tool_name:string -> + source_file:string -> + output_prefix:string -> + dump_ext:string -> + (info -> 'a) -> + 'a

    with_info ~native ~tool_name ~source_file ~output_prefix ~dump_ext k invokes its continuation k with an info structure built from its input, after initializing various global variables. This info structure and the initialized global state are not valid anymore after the continuation returns.

    Due to current implementation limitations in the compiler, it is unsafe to try to compile several distinct compilation units by calling with_info several times.

    Interfaces

    val parse_intf : info -> Parsetree.signature

    parse_intf info parses an interface (usually an .mli file).

    val typecheck_intf : info -> Parsetree.signature -> Typedtree.signature

    typecheck_intf info parsetree typechecks an interface and returns the typedtree of the associated signature.

    val emit_signature : info -> Parsetree.signature -> Typedtree.signature -> unit

    emit_signature info parsetree typedtree emits the .cmi file containing the given signature.

    val interface : info -> unit

    The complete compilation pipeline for interfaces.

    Implementations

    val parse_impl : info -> Parsetree.structure

    parse_impl info parses an implementation (usually an .ml file).

    typecheck_impl info parsetree typechecks an implementation and returns the typedtree of the associated module, its public interface, and a coercion against that public interface.

    val implementation : + info -> + backend:(info -> Typedtree.implementation -> unit) -> + unit

    The complete compilation pipeline for implementations.

    diff --git a/ocaml/Compilenv/index.html b/ocaml/Compilenv/index.html new file mode 100644 index 0000000..2b7f246 --- /dev/null +++ b/ocaml/Compilenv/index.html @@ -0,0 +1,8 @@ + +Compilenv (ocaml.Compilenv)

    Module Compilenv

    val imported_sets_of_closures_table : + Simple_value_approx.function_declarations option Set_of_closures_id.Tbl.t
    val reset : ?packname:string -> string -> unit
    val unit_id_from_name : string -> Ident.t
    val current_unit_infos : unit -> Cmx_format.unit_infos
    val current_unit_name : unit -> string
    val current_unit_linkage_name : unit -> Linkage_name.t
    val current_unit : unit -> Compilation_unit.t
    val current_unit_symbol : unit -> Symbol.t
    val symbol_separator : char
    val make_symbol : ?unitname:string -> string option -> string
    val symbol_in_current_unit : string -> bool
    val is_predefined_exception : Symbol.t -> bool
    val unit_for_global : Ident.t -> Compilation_unit.t
    val symbol_for_global : Ident.t -> string
    val symbol_for_global' : Ident.t -> Symbol.t
    val global_approx : Ident.t -> Clambda.value_approximation
    val set_global_approx : Clambda.value_approximation -> unit
    val record_global_approx_toplevel : unit -> unit
    val set_export_info : Export_info.t -> unit
    val approx_env : unit -> Export_info.t
    val approx_for_global : Compilation_unit.t -> Export_info.t option
    val need_curry_fun : int -> unit
    val need_apply_fun : int -> unit
    val need_send_fun : int -> unit
    val new_const_symbol : unit -> string
    val closure_symbol : Closure_id.t -> Symbol.t
    val function_label : Closure_id.t -> string
    val new_structured_constant : + Clambda.ustructured_constant -> + shared:bool -> + string
    val structured_constants : unit -> Clambda.preallocated_constant list
    val clear_structured_constants : unit -> unit
    val structured_constant_of_symbol : + string -> + Clambda.ustructured_constant option
    val add_exported_constant : string -> unit
    type structured_constants
    val snapshot : unit -> structured_constants
    val backtrack : structured_constants -> unit
    val read_unit_info : string -> Cmx_format.unit_infos * Stdlib.Digest.t
    val write_unit_info : Cmx_format.unit_infos -> string -> unit
    val save_unit_info : string -> unit
    val cache_unit_info : Cmx_format.unit_infos -> unit
    val require_global : Ident.t -> unit
    val read_library_info : string -> Cmx_format.library_infos
    type error =
    1. | Not_a_unit_info of string
    2. | Corrupted_unit_info of string
    3. | Illegal_renaming of string * string * string
    4. | Mismatching_for_pack of string * string * string * string option
    exception Error of error
    val report_error : Stdlib.Format.formatter -> error -> unit
    diff --git a/ocaml/Compmisc/index.html b/ocaml/Compmisc/index.html new file mode 100644 index 0000000..8ff809f --- /dev/null +++ b/ocaml/Compmisc/index.html @@ -0,0 +1,6 @@ + +Compmisc (ocaml.Compmisc)

    Module Compmisc

    val init_path : + ?auto_include:Load_path.auto_include_callback -> + ?dir:string -> + unit -> + unit
    val initial_env : unit -> Env.t
    val set_from_env : 'a option ref -> 'a Clflags.env_reader -> unit
    val read_clflags_from_env : unit -> unit
    val with_ppf_dump : file_prefix:string -> (Stdlib.Format.formatter -> 'a) -> 'a

    auto_include find_in_dir fn is a callback function to be passed to Load_path.init and automatically adds -I +lib to the load path after displaying an alert.

    diff --git a/ocaml/Compression/index.html b/ocaml/Compression/index.html new file mode 100644 index 0000000..e067dfc --- /dev/null +++ b/ocaml/Compression/index.html @@ -0,0 +1,2 @@ + +Compression (ocaml.Compression)

    Module Compression

    val output_value : out_channel -> 'a -> unit

    Compression.output_value chan v writes the representation of v on channel chan. If compression is supported, the marshaled data representing value v is compressed before being written to channel chan. If compression is not supported, this function behaves like Stdlib.output_value.

    val input_value : in_channel -> 'a

    Compression.input_value chan reads from channel chan the byte representation of a structured value, as produced by Compression.output_value, and reconstructs and returns the corresponding value. If compression is not supported, this function behaves like Stdlib.input_value.

    val compression_supported : bool

    Reports whether compression is supported.

    diff --git a/ocaml/Config/index.html b/ocaml/Config/index.html new file mode 100644 index 0000000..f87c75a --- /dev/null +++ b/ocaml/Config/index.html @@ -0,0 +1,2 @@ + +Config (ocaml.Config)

    Module Config

    System configuration

    Warning: this module is unstable and part of compiler-libs.

    val version : string

    The current version number of the system

    val bindir : string

    The directory containing the binary programs

    val standard_library : string

    The directory containing the standard libraries

    val ccomp_type : string

    The "kind" of the C compiler, assembler and linker used: one of "cc" (for Unix-style C compilers) "msvc" (for Microsoft Visual C++ and MASM)

    val c_compiler : string

    The compiler to use for compiling C files

    val c_output_obj : string

    Name of the option of the C compiler for specifying the output file

    val c_has_debug_prefix_map : bool

    Whether the C compiler supports -fdebug-prefix-map

    val as_has_debug_prefix_map : bool

    Whether the assembler supports --debug-prefix-map

    val ocamlc_cflags : string

    The flags ocamlc should pass to the C compiler

    val ocamlc_cppflags : string

    The flags ocamlc should pass to the C preprocessor

    val ocamlopt_cflags : string
    • deprecated

      ocamlc_cflags should be used instead. The flags ocamlopt should pass to the C compiler

    val ocamlopt_cppflags : string
    • deprecated

      ocamlc_cppflags should be used instead. The flags ocamlopt should pass to the C preprocessor

    val bytecomp_c_libraries : string

    The C libraries to link with custom runtimes

    val native_c_libraries : string

    The C libraries to link with native-code programs

    val native_ldflags : string
    val native_pack_linker : string

    The linker to use for packaging (ocamlopt -pack) and for partial links (ocamlopt -output-obj).

    val mkdll : string

    The linker command line to build dynamic libraries.

    val mkexe : string

    The linker command line to build executables.

    val mkmaindll : string

    The linker command line to build main programs as dlls.

    val default_rpath : string

    Option to add a directory to be searched for libraries at runtime (used by ocamlmklib)

    val mksharedlibrpath : string

    Option to add a directory to be searched for shared libraries at runtime (used by ocamlmklib)

    val ar : string

    Name of the ar command, or "" if not needed (MSVC)

    val interface_suffix : string ref

    Suffix for interface file names

    val exec_magic_number : string

    Magic number for bytecode executable files

    val cmi_magic_number : string

    Magic number for compiled interface files

    val cmo_magic_number : string

    Magic number for object bytecode files

    val cma_magic_number : string

    Magic number for archive files

    val cmx_magic_number : string

    Magic number for compilation unit descriptions

    val cmxa_magic_number : string

    Magic number for libraries of compilation unit descriptions

    val ast_intf_magic_number : string

    Magic number for file holding an interface syntax tree

    val ast_impl_magic_number : string

    Magic number for file holding an implementation syntax tree

    val cmxs_magic_number : string

    Magic number for dynamically-loadable plugins

    val cmt_magic_number : string

    Magic number for compiled interface files

    val linear_magic_number : string

    Magic number for Linear internal representation files

    val max_tag : int

    Biggest tag that can be stored in the header of a regular block.

    val lazy_tag : int

    Normally the same as Obj.lazy_tag. Separate definition because of technical reasons for bootstrapping.

    val max_young_wosize : int

    Maximal size of arrays that are directly allocated in the minor heap

    val stack_threshold : int

    Size in words of safe area at bottom of VM stack, see runtime/caml/config.h

    val stack_safety_margin : int

    Size in words of the safety margin between the bottom of the stack and the stack pointer. This margin can be used by intermediate computations of some instructions, or the event handler.

    val native_compiler : bool

    Whether the native compiler is available or not

    • since 5.1
    val architecture : string

    Name of processor type for the native-code compiler

    val model : string

    Name of processor submodel for the native-code compiler

    val system : string

    Name of operating system for the native-code compiler

    val asm : string

    The assembler (and flags) to use for assembling ocamlopt-generated code.

    val asm_cfi_supported : bool

    Whether assembler understands CFI directives

    val with_frame_pointers : bool

    Whether assembler should maintain frame pointers

    val ext_obj : string

    Extension for object files, e.g. .o under Unix.

    val ext_asm : string

    Extension for assembler files, e.g. .s under Unix.

    val ext_lib : string

    Extension for library files, e.g. .a under Unix.

    val ext_dll : string

    Extension for dynamically-loaded libraries, e.g. .so under Unix.

    val ext_exe : string

    Extension for executable programs, e.g. .exe under Windows.

    • since 4.12
    val default_executable_name : string

    Name of executable produced by linking if none is given with -o, e.g. a.out under Unix.

    val systhread_supported : bool

    Whether the system thread library is implemented

    val flexdll_dirs : string list

    Directories needed for the FlexDLL objects

    val host : string

    Whether the compiler is a cross-compiler

    val target : string

    Whether the compiler is a cross-compiler

    val flambda : bool

    Whether the compiler was configured for flambda

    val with_flambda_invariants : bool

    Whether the invariants checks for flambda are enabled

    val with_cmm_invariants : bool

    Whether the invariants checks for Cmm are enabled

    val reserved_header_bits : int

    How many bits of a block's header are reserved

    val flat_float_array : bool

    Whether the compiler and runtime automagically flatten float arrays

    val function_sections : bool

    Whether the compiler was configured to generate each function in a separate section

    val windows_unicode : bool

    Whether Windows Unicode runtime is enabled

    val naked_pointers : bool

    Whether the runtime supports naked pointers

    • since 4.14
    val supports_shared_libraries : bool

    Whether shared libraries are supported

    • since 4.08

    Whether native shared libraries are supported

    • since 5.1
    val afl_instrument : bool

    Whether afl-fuzz instrumentation is generated by default

    val ar_supports_response_files : bool

    Whether ar supports @FILE arguments.

    val tsan : bool

    Whether ThreadSanitizer instrumentation is enabled

    val print_config : out_channel -> unit

    Access to configuration values

    val config_var : string -> string option

    the configuration value of a variable, if it exists

    diff --git a/ocaml/Config_boot/index.html b/ocaml/Config_boot/index.html new file mode 100644 index 0000000..8a563cd --- /dev/null +++ b/ocaml/Config_boot/index.html @@ -0,0 +1,2 @@ + +Config_boot (ocaml.Config_boot)

    Module Config_boot

    System configuration

    Warning: this module is unstable and part of compiler-libs.

    val version : string

    The current version number of the system

    val bindir : string

    The directory containing the binary programs

    val standard_library : string

    The directory containing the standard libraries

    val ccomp_type : string

    The "kind" of the C compiler, assembler and linker used: one of "cc" (for Unix-style C compilers) "msvc" (for Microsoft Visual C++ and MASM)

    val c_compiler : string

    The compiler to use for compiling C files

    val c_output_obj : string

    Name of the option of the C compiler for specifying the output file

    val c_has_debug_prefix_map : bool

    Whether the C compiler supports -fdebug-prefix-map

    val as_has_debug_prefix_map : bool

    Whether the assembler supports --debug-prefix-map

    val ocamlc_cflags : string

    The flags ocamlc should pass to the C compiler

    val ocamlc_cppflags : string

    The flags ocamlc should pass to the C preprocessor

    val ocamlopt_cflags : string
    • deprecated

      ocamlc_cflags should be used instead. The flags ocamlopt should pass to the C compiler

    val ocamlopt_cppflags : string
    • deprecated

      ocamlc_cppflags should be used instead. The flags ocamlopt should pass to the C preprocessor

    val bytecomp_c_libraries : string

    The C libraries to link with custom runtimes

    val native_c_libraries : string

    The C libraries to link with native-code programs

    val native_ldflags : string
    val native_pack_linker : string

    The linker to use for packaging (ocamlopt -pack) and for partial links (ocamlopt -output-obj).

    val mkdll : string

    The linker command line to build dynamic libraries.

    val mkexe : string

    The linker command line to build executables.

    val mkmaindll : string

    The linker command line to build main programs as dlls.

    val default_rpath : string

    Option to add a directory to be searched for libraries at runtime (used by ocamlmklib)

    val mksharedlibrpath : string

    Option to add a directory to be searched for shared libraries at runtime (used by ocamlmklib)

    val ar : string

    Name of the ar command, or "" if not needed (MSVC)

    val interface_suffix : string ref

    Suffix for interface file names

    val exec_magic_number : string

    Magic number for bytecode executable files

    val cmi_magic_number : string

    Magic number for compiled interface files

    val cmo_magic_number : string

    Magic number for object bytecode files

    val cma_magic_number : string

    Magic number for archive files

    val cmx_magic_number : string

    Magic number for compilation unit descriptions

    val cmxa_magic_number : string

    Magic number for libraries of compilation unit descriptions

    val ast_intf_magic_number : string

    Magic number for file holding an interface syntax tree

    val ast_impl_magic_number : string

    Magic number for file holding an implementation syntax tree

    val cmxs_magic_number : string

    Magic number for dynamically-loadable plugins

    val cmt_magic_number : string

    Magic number for compiled interface files

    val linear_magic_number : string

    Magic number for Linear internal representation files

    val max_tag : int

    Biggest tag that can be stored in the header of a regular block.

    val lazy_tag : int

    Normally the same as Obj.lazy_tag. Separate definition because of technical reasons for bootstrapping.

    val max_young_wosize : int

    Maximal size of arrays that are directly allocated in the minor heap

    val stack_threshold : int

    Size in words of safe area at bottom of VM stack, see runtime/caml/config.h

    val stack_safety_margin : int

    Size in words of the safety margin between the bottom of the stack and the stack pointer. This margin can be used by intermediate computations of some instructions, or the event handler.

    val native_compiler : bool

    Whether the native compiler is available or not

    • since 5.1
    val architecture : string

    Name of processor type for the native-code compiler

    val model : string

    Name of processor submodel for the native-code compiler

    val system : string

    Name of operating system for the native-code compiler

    val asm : string

    The assembler (and flags) to use for assembling ocamlopt-generated code.

    val asm_cfi_supported : bool

    Whether assembler understands CFI directives

    val with_frame_pointers : bool

    Whether assembler should maintain frame pointers

    val ext_obj : string

    Extension for object files, e.g. .o under Unix.

    val ext_asm : string

    Extension for assembler files, e.g. .s under Unix.

    val ext_lib : string

    Extension for library files, e.g. .a under Unix.

    val ext_dll : string

    Extension for dynamically-loaded libraries, e.g. .so under Unix.

    val ext_exe : string

    Extension for executable programs, e.g. .exe under Windows.

    • since 4.12
    val default_executable_name : string

    Name of executable produced by linking if none is given with -o, e.g. a.out under Unix.

    val systhread_supported : bool

    Whether the system thread library is implemented

    val flexdll_dirs : string list

    Directories needed for the FlexDLL objects

    val host : string

    Whether the compiler is a cross-compiler

    val target : string

    Whether the compiler is a cross-compiler

    val flambda : bool

    Whether the compiler was configured for flambda

    val with_flambda_invariants : bool

    Whether the invariants checks for flambda are enabled

    val with_cmm_invariants : bool

    Whether the invariants checks for Cmm are enabled

    val reserved_header_bits : int

    How many bits of a block's header are reserved

    val flat_float_array : bool

    Whether the compiler and runtime automagically flatten float arrays

    val function_sections : bool

    Whether the compiler was configured to generate each function in a separate section

    val windows_unicode : bool

    Whether Windows Unicode runtime is enabled

    val naked_pointers : bool

    Whether the runtime supports naked pointers

    • since 4.14
    val supports_shared_libraries : bool

    Whether shared libraries are supported

    • since 4.08

    Whether native shared libraries are supported

    • since 5.1
    val afl_instrument : bool

    Whether afl-fuzz instrumentation is generated by default

    val ar_supports_response_files : bool

    Whether ar supports @FILE arguments.

    val tsan : bool

    Whether ThreadSanitizer instrumentation is enabled

    val print_config : out_channel -> unit

    Access to configuration values

    val config_var : string -> string option

    the configuration value of a variable, if it exists

    diff --git a/ocaml/Config_main/index.html b/ocaml/Config_main/index.html new file mode 100644 index 0000000..dc38531 --- /dev/null +++ b/ocaml/Config_main/index.html @@ -0,0 +1,2 @@ + +Config_main (ocaml.Config_main)

    Module Config_main

    System configuration

    Warning: this module is unstable and part of compiler-libs.

    val version : string

    The current version number of the system

    val bindir : string

    The directory containing the binary programs

    val standard_library : string

    The directory containing the standard libraries

    val ccomp_type : string

    The "kind" of the C compiler, assembler and linker used: one of "cc" (for Unix-style C compilers) "msvc" (for Microsoft Visual C++ and MASM)

    val c_compiler : string

    The compiler to use for compiling C files

    val c_output_obj : string

    Name of the option of the C compiler for specifying the output file

    val c_has_debug_prefix_map : bool

    Whether the C compiler supports -fdebug-prefix-map

    val as_has_debug_prefix_map : bool

    Whether the assembler supports --debug-prefix-map

    val ocamlc_cflags : string

    The flags ocamlc should pass to the C compiler

    val ocamlc_cppflags : string

    The flags ocamlc should pass to the C preprocessor

    val ocamlopt_cflags : string
    • deprecated

      ocamlc_cflags should be used instead. The flags ocamlopt should pass to the C compiler

    val ocamlopt_cppflags : string
    • deprecated

      ocamlc_cppflags should be used instead. The flags ocamlopt should pass to the C preprocessor

    val bytecomp_c_libraries : string

    The C libraries to link with custom runtimes

    val native_c_libraries : string

    The C libraries to link with native-code programs

    val native_ldflags : string
    val native_pack_linker : string

    The linker to use for packaging (ocamlopt -pack) and for partial links (ocamlopt -output-obj).

    val mkdll : string

    The linker command line to build dynamic libraries.

    val mkexe : string

    The linker command line to build executables.

    val mkmaindll : string

    The linker command line to build main programs as dlls.

    val default_rpath : string

    Option to add a directory to be searched for libraries at runtime (used by ocamlmklib)

    val mksharedlibrpath : string

    Option to add a directory to be searched for shared libraries at runtime (used by ocamlmklib)

    val ar : string

    Name of the ar command, or "" if not needed (MSVC)

    val interface_suffix : string ref

    Suffix for interface file names

    val exec_magic_number : string

    Magic number for bytecode executable files

    val cmi_magic_number : string

    Magic number for compiled interface files

    val cmo_magic_number : string

    Magic number for object bytecode files

    val cma_magic_number : string

    Magic number for archive files

    val cmx_magic_number : string

    Magic number for compilation unit descriptions

    val cmxa_magic_number : string

    Magic number for libraries of compilation unit descriptions

    val ast_intf_magic_number : string

    Magic number for file holding an interface syntax tree

    val ast_impl_magic_number : string

    Magic number for file holding an implementation syntax tree

    val cmxs_magic_number : string

    Magic number for dynamically-loadable plugins

    val cmt_magic_number : string

    Magic number for compiled interface files

    val linear_magic_number : string

    Magic number for Linear internal representation files

    val max_tag : int

    Biggest tag that can be stored in the header of a regular block.

    val lazy_tag : int

    Normally the same as Obj.lazy_tag. Separate definition because of technical reasons for bootstrapping.

    val max_young_wosize : int

    Maximal size of arrays that are directly allocated in the minor heap

    val stack_threshold : int

    Size in words of safe area at bottom of VM stack, see runtime/caml/config.h

    val stack_safety_margin : int

    Size in words of the safety margin between the bottom of the stack and the stack pointer. This margin can be used by intermediate computations of some instructions, or the event handler.

    val native_compiler : bool

    Whether the native compiler is available or not

    • since 5.1
    val architecture : string

    Name of processor type for the native-code compiler

    val model : string

    Name of processor submodel for the native-code compiler

    val system : string

    Name of operating system for the native-code compiler

    val asm : string

    The assembler (and flags) to use for assembling ocamlopt-generated code.

    val asm_cfi_supported : bool

    Whether assembler understands CFI directives

    val with_frame_pointers : bool

    Whether assembler should maintain frame pointers

    val ext_obj : string

    Extension for object files, e.g. .o under Unix.

    val ext_asm : string

    Extension for assembler files, e.g. .s under Unix.

    val ext_lib : string

    Extension for library files, e.g. .a under Unix.

    val ext_dll : string

    Extension for dynamically-loaded libraries, e.g. .so under Unix.

    val ext_exe : string

    Extension for executable programs, e.g. .exe under Windows.

    • since 4.12
    val default_executable_name : string

    Name of executable produced by linking if none is given with -o, e.g. a.out under Unix.

    val systhread_supported : bool

    Whether the system thread library is implemented

    val flexdll_dirs : string list

    Directories needed for the FlexDLL objects

    val host : string

    Whether the compiler is a cross-compiler

    val target : string

    Whether the compiler is a cross-compiler

    val flambda : bool

    Whether the compiler was configured for flambda

    val with_flambda_invariants : bool

    Whether the invariants checks for flambda are enabled

    val with_cmm_invariants : bool

    Whether the invariants checks for Cmm are enabled

    val reserved_header_bits : int

    How many bits of a block's header are reserved

    val flat_float_array : bool

    Whether the compiler and runtime automagically flatten float arrays

    val function_sections : bool

    Whether the compiler was configured to generate each function in a separate section

    val windows_unicode : bool

    Whether Windows Unicode runtime is enabled

    val naked_pointers : bool

    Whether the runtime supports naked pointers

    • since 4.14
    val supports_shared_libraries : bool

    Whether shared libraries are supported

    • since 4.08

    Whether native shared libraries are supported

    • since 5.1
    val afl_instrument : bool

    Whether afl-fuzz instrumentation is generated by default

    val ar_supports_response_files : bool

    Whether ar supports @FILE arguments.

    val tsan : bool

    Whether ThreadSanitizer instrumentation is enabled

    val print_config : out_channel -> unit

    Access to configuration values

    val config_var : string -> string option

    the configuration value of a variable, if it exists

    diff --git a/ocaml/Consistbl/Make/argument-1-Module_name/Map/index.html b/ocaml/Consistbl/Make/argument-1-Module_name/Map/index.html new file mode 100644 index 0000000..decb117 --- /dev/null +++ b/ocaml/Consistbl/Make/argument-1-Module_name/Map/index.html @@ -0,0 +1,8 @@ + +Map (ocaml.Consistbl.Make.Module_name.Map)

    Module Module_name.Map

    Maps

    type key = t

    The type of the map keys.

    type !+'a t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key -> 'a -> 'a t -> 'a t

    add key data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key -> 'a -> 'a list t -> 'a list t

    add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

    update key f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : (key -> bool) -> 'a t -> key * 'a

    find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : (key -> bool) -> 'a t -> key * 'a

    find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : (key -> 'a -> unit) -> 'a t -> unit

    iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

    fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : (key -> 'a -> bool) -> 'a t -> 'a t

    filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : (key -> 'a -> bool) -> 'a t -> bool

    for_all f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : (key -> 'a -> bool) -> 'a t -> bool

    exists f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val of_list : (key * 'a) list -> 'a t

    of_list bs adds the bindings of bs to the empty map, in list order (if a key is bound twice in bs the last one takes over).

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    diff --git a/ocaml/Consistbl/Make/argument-1-Module_name/Set/index.html b/ocaml/Consistbl/Make/argument-1-Module_name/Set/index.html new file mode 100644 index 0000000..185629d --- /dev/null +++ b/ocaml/Consistbl/Make/argument-1-Module_name/Set/index.html @@ -0,0 +1,2 @@ + +Set (ocaml.Consistbl.Make.Module_name.Set)

    Module Module_name.Set

    Sets

    type elt = t

    The type of the set elements.

    type t

    The type of sets.

    val empty : t

    The empty set.

    val add : elt -> t -> t

    add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val singleton : elt -> t

    singleton x returns the one-element set containing only x.

    val remove : elt -> t -> t

    remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val union : t -> t -> t

    Set union.

    val inter : t -> t -> t

    Set intersection.

    val disjoint : t -> t -> bool

    Test if two sets are disjoint.

    • since 4.08
    val diff : t -> t -> t

    Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

    val cardinal : t -> int

    Return the number of elements of a set.

    Elements

    val elements : t -> elt list

    Return the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Set.Make.

    val min_elt : t -> elt

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

    val min_elt_opt : t -> elt option

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

    • since 4.05
    val max_elt : t -> elt

    Same as min_elt, but returns the largest element of the given set.

    val max_elt_opt : t -> elt option

    Same as min_elt_opt, but returns the largest element of the given set.

    • since 4.05
    val choose : t -> elt

    Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    val choose_opt : t -> elt option

    Return one element of the given set, or None if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    • since 4.05

    Searching

    val find : elt -> t -> elt

    find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

    • since 4.01
    val find_opt : elt -> t -> elt option

    find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

    • since 4.05
    val find_first : (elt -> bool) -> t -> elt

    find_first f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

    For example, find_first (fun e -> Ord.compare e x >= 0) s will return the first element e of s where Ord.compare e x >= 0 (intuitively: e >= x), or raise Not_found if x is greater than any element of s.

    • since 4.05
    val find_first_opt : (elt -> bool) -> t -> elt option

    find_first_opt f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

    • since 4.05
    val find_last : (elt -> bool) -> t -> elt

    find_last f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

    • since 4.05
    val find_last_opt : (elt -> bool) -> t -> elt option

    find_last_opt f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

    • since 4.05

    Traversing

    val iter : (elt -> unit) -> t -> unit

    iter f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.

    val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc

    fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

    Transforming

    val map : (elt -> elt) -> t -> t

    map f s is the set whose elements are f a0,f a1... f aN, where a0,a1...aN are the elements of s.

    The elements are passed to f in increasing order with respect to the ordering over the type of the elements.

    If no element of s is changed by f, s is returned unchanged. (If each output of f is physically equal to its input, the returned set is physically equal to s.)

    • since 4.04
    val filter : (elt -> bool) -> t -> t

    filter f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val filter_map : (elt -> elt option) -> t -> t

    filter_map f s returns the set of all v such that f x = Some v for some element x of s.

    For example,

    filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) s

    is the set of halves of the even elements of s.

    If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned unchanged: the result of the function is then physically equal to s.

    • since 4.11
    val partition : (elt -> bool) -> t -> t * t

    partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

    val split : elt -> t -> t * bool * t

    split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.

    Predicates and comparisons

    val is_empty : t -> bool

    Test whether a set is empty or not.

    val mem : elt -> t -> bool

    mem x s tests whether x belongs to the set s.

    val equal : t -> t -> bool

    equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

    val compare : t -> t -> int

    Total ordering between sets. Can be used as the ordering function for doing sets of sets.

    val subset : t -> t -> bool

    subset s1 s2 tests whether the set s1 is a subset of the set s2.

    val for_all : (elt -> bool) -> t -> bool

    for_all f s checks if all elements of the set satisfy the predicate f.

    val exists : (elt -> bool) -> t -> bool

    exists f s checks if at least one element of the set satisfies the predicate f.

    Converting

    val to_list : t -> elt list

    to_list s is elements s.

    • since 5.1
    val of_list : elt list -> t

    of_list l creates a set from a list of elements. This is usually more efficient than folding add over the list, except perhaps for lists with many duplicated elements.

    • since 4.02
    val to_seq_from : elt -> t -> elt Seq.t

    to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

    • since 4.07
    val to_seq : t -> elt Seq.t

    Iterate on the whole set, in ascending order

    • since 4.07
    val to_rev_seq : t -> elt Seq.t

    Iterate on the whole set, in descending order

    • since 4.12
    val add_seq : elt Seq.t -> t -> t

    Add the given elements to the set, in order.

    • since 4.07
    val of_seq : elt Seq.t -> t

    Build a set from the given bindings

    • since 4.07
    diff --git a/ocaml/Consistbl/Make/argument-1-Module_name/Tbl/index.html b/ocaml/Consistbl/Make/argument-1-Module_name/Tbl/index.html new file mode 100644 index 0000000..7613da5 --- /dev/null +++ b/ocaml/Consistbl/Make/argument-1-Module_name/Tbl/index.html @@ -0,0 +1,2 @@ + +Tbl (ocaml.Consistbl.Make.Module_name.Tbl)

    Module Module_name.Tbl

    type key = t
    type !'a t
    val create : int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    • since 4.00
    val copy : 'a t -> 'a t
    val add : 'a t -> key -> 'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    • since 4.05
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key -> 'a -> unit
    val mem : 'a t -> key -> bool
    val iter : (key -> 'a -> unit) -> 'a t -> unit
    val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
    • since 4.03
    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc
    val length : 'a t -> int
    val stats : 'a t -> Hashtbl.statistics
    • since 4.00
    val to_seq : 'a t -> (key * 'a) Seq.t
    • since 4.07
    val to_seq_keys : _ t -> key Seq.t
    • since 4.07
    val to_seq_values : 'a t -> 'a Seq.t
    • since 4.07
    val add_seq : 'a t -> (key * 'a) Seq.t -> unit
    • since 4.07
    val replace_seq : 'a t -> (key * 'a) Seq.t -> unit
    • since 4.07
    val of_seq : (key * 'a) Seq.t -> 'a t
    • since 4.07
    diff --git a/ocaml/Consistbl/Make/argument-1-Module_name/index.html b/ocaml/Consistbl/Make/argument-1-Module_name/index.html new file mode 100644 index 0000000..d006173 --- /dev/null +++ b/ocaml/Consistbl/Make/argument-1-Module_name/index.html @@ -0,0 +1,2 @@ + +Module_name (ocaml.Consistbl.Make.Module_name)

    Parameter Make.Module_name

    type t
    module Set : Set.S with type elt = t
    module Map : Map.S with type key = t
    module Tbl : Hashtbl.S with type key = t
    val compare : t -> t -> int
    diff --git a/ocaml/Consistbl/Make/index.html b/ocaml/Consistbl/Make/index.html new file mode 100644 index 0000000..4bdfc9c --- /dev/null +++ b/ocaml/Consistbl/Make/index.html @@ -0,0 +1,13 @@ + +Make (ocaml.Consistbl.Make)

    Module Consistbl.Make

    Parameters

    module Module_name : sig ... end

    Signature

    type t
    val create : unit -> t
    val clear : t -> unit
    val check : t -> Module_name.t -> Stdlib.Digest.t -> Misc.filepath -> unit
    val check_noadd : + t -> + Module_name.t -> + Stdlib.Digest.t -> + Misc.filepath -> + unit
    val source : t -> Module_name.t -> Misc.filepath
    val extract : + Module_name.t list -> + t -> + (Module_name.t * Stdlib.Digest.t option) list
    val extract_map : + Module_name.Set.t -> + t -> + Stdlib.Digest.t option Module_name.Map.t
    val filter : (Module_name.t -> bool) -> t -> unit
    exception Inconsistency of {
    1. unit_name : Module_name.t;
    2. inconsistent_source : string;
    3. original_source : string;
    }
    exception Not_available of Module_name.t
    diff --git a/ocaml/Consistbl/index.html b/ocaml/Consistbl/index.html new file mode 100644 index 0000000..b1fc0c8 --- /dev/null +++ b/ocaml/Consistbl/index.html @@ -0,0 +1,2 @@ + +Consistbl (ocaml.Consistbl)

    Module Consistbl

    Consistency tables: for checking consistency of module CRCs

    Warning: this module is unstable and part of compiler-libs.

    module Make (Module_name : sig ... end) : sig ... end
    diff --git a/ocaml/Convert_primitives/index.html b/ocaml/Convert_primitives/index.html new file mode 100644 index 0000000..6e2ca21 --- /dev/null +++ b/ocaml/Convert_primitives/index.html @@ -0,0 +1,2 @@ + +Convert_primitives (ocaml.Convert_primitives)

    Module Convert_primitives

    diff --git a/ocaml/Ctype/Pattern_env/index.html b/ocaml/Ctype/Pattern_env/index.html new file mode 100644 index 0000000..e490538 --- /dev/null +++ b/ocaml/Ctype/Pattern_env/index.html @@ -0,0 +1,2 @@ + +Pattern_env (ocaml.Ctype.Pattern_env)

    Module Ctype.Pattern_env

    type t = private {
    1. mutable env : Env.t;
    2. equations_scope : int;
    3. allow_recursive_equations : bool;
    }
    val make : Env.t -> equations_scope:int -> allow_recursive_equations:bool -> t
    val copy : ?equations_scope:int -> t -> t
    val set_env : t -> Env.t -> unit
    diff --git a/ocaml/Ctype/index.html b/ocaml/Ctype/index.html new file mode 100644 index 0000000..f7f1cb7 --- /dev/null +++ b/ocaml/Ctype/index.html @@ -0,0 +1,185 @@ + +Ctype (ocaml.Ctype)

    Module Ctype

    exception Unify of Errortrace.unification_error
    exception Equality of Errortrace.equality_error
    exception Moregen of Errortrace.moregen_error
    exception Subtype of Errortrace.Subtype.error
    exception Tags of Asttypes.label * Asttypes.label
    exception Cannot_expand
    exception Cannot_apply
    exception Matches_failure of Env.t * Errortrace.unification_error
    exception Incompatible
    val with_local_level : ?post:('a -> unit) -> (unit -> 'a) -> 'a
    val with_local_level_if : bool -> (unit -> 'a) -> post:('a -> unit) -> 'a
    val with_local_level_iter : (unit -> 'a * 'b list) -> post:('b -> unit) -> 'a
    val with_local_level_iter_if : + bool -> + (unit -> 'a * 'b list) -> + post:('b -> unit) -> + 'a
    val with_level : level:int -> (unit -> 'a) -> 'a
    val with_level_if : bool -> level:int -> (unit -> 'a) -> 'a
    val with_local_level_if_principal : (unit -> 'a) -> post:('a -> unit) -> 'a
    val with_local_level_iter_if_principal : + (unit -> 'a * 'b list) -> + post:('b -> unit) -> + 'a
    val with_local_level_for_class : ?post:('a -> unit) -> (unit -> 'a) -> 'a
    val with_raised_nongen_level : (unit -> 'a) -> 'a
    val reset_global_level : unit -> unit
    val increase_global_level : unit -> int
    val restore_global_level : int -> unit
    val create_scope : unit -> int
    val new_scoped_ty : int -> Types.type_desc -> Types.type_expr
    val newvar : ?name:string -> unit -> Types.type_expr
    val newvar2 : ?name:string -> int -> Types.type_expr
    val new_global_var : ?name:string -> unit -> Types.type_expr
    val newconstr : Path.t -> Types.type_expr list -> Types.type_expr
    val none : Types.type_expr
    val object_fields : Types.type_expr -> Types.type_expr
    val flatten_fields : + Types.type_expr -> + (string * Types.field_kind * Types.type_expr) list * Types.type_expr

    Transform a field type into a list of pairs label-type. The fields are sorted.

    Beware of the interaction with GADTs:

    Due to the introduction of object indexes for GADTs, the row variable of an object may now be an expansible type abbreviation. A first consequence is that flatten_fields will not completely flatten the object, since the type abbreviation will not be expanded (flatten_fields does not receive the current environment). Another consequence is that various functions may be called with the expansion of this type abbreviation, which is a Tfield, e.g. during printing.

    Concrete problems have been fixed, but new bugs may appear in the future. (Test cases were added to typing-gadts/test.ml)

    val associate_fields : + (string * Types.field_kind * Types.type_expr) list -> + (string * Types.field_kind * Types.type_expr) list -> + (string + * Types.field_kind + * Types.type_expr + * Types.field_kind + * Types.type_expr) + list + * (string * Types.field_kind * Types.type_expr) list + * (string * Types.field_kind * Types.type_expr) list
    val opened_object : Types.type_expr -> bool
    val set_object_name : + Ident.t -> + Types.type_expr list -> + Types.type_expr -> + unit
    val remove_object_name : Types.type_expr -> unit
    val find_cltype_for_path : + Env.t -> + Path.t -> + Types.type_declaration * Types.type_expr
    val sort_row_fields : + (Asttypes.label * Types.row_field) list -> + (Asttypes.label * Types.row_field) list
    val filter_row_fields : + bool -> + (Asttypes.label * Types.row_field) list -> + (Asttypes.label * Types.row_field) list
    val generalize : Types.type_expr -> unit
    val lower_contravariant : Env.t -> Types.type_expr -> unit
    val lower_variables_only : Env.t -> int -> Types.type_expr -> unit
    val enforce_current_level : Env.t -> Types.type_expr -> unit
    val generalize_structure : Types.type_expr -> unit
    val generalize_class_type : Types.class_type -> unit
    val generalize_class_type_structure : Types.class_type -> unit
    val generalize_class_signature_spine : Env.t -> Types.class_signature -> unit
    val correct_levels : Types.type_expr -> Types.type_expr
    val limited_generalize : Types.type_expr -> Types.type_expr -> unit
    val limited_generalize_class_type : Types.type_expr -> Types.class_type -> unit
    val fully_generic : Types.type_expr -> bool
    val check_scope_escape : Env.t -> int -> Types.type_expr -> unit
    val instance : ?partial:bool -> Types.type_expr -> Types.type_expr
    val generic_instance : Types.type_expr -> Types.type_expr
    val instance_list : Types.type_expr list -> Types.type_expr list
    val new_local_type : + ?loc:Location.t -> + ?manifest_and_scope:(Types.type_expr * int) -> + Types.type_origin -> + Types.type_declaration
    module Pattern_env : sig ... end
    type existential_treatment =
    1. | Keep_existentials_flexible
    2. | Make_existentials_abstract of Pattern_env.t
    val instance_parameterized_type : + ?keep_names:bool -> + Types.type_expr list -> + Types.type_expr -> + Types.type_expr list * Types.type_expr
    val instance_declaration : Types.type_declaration -> Types.type_declaration
    val generic_instance_declaration : + Types.type_declaration -> + Types.type_declaration
    val instance_class : + Types.type_expr list -> + Types.class_type -> + Types.type_expr list * Types.class_type
    val instance_poly : + ?keep_names:bool -> + fixed:bool -> + Types.type_expr list -> + Types.type_expr -> + Types.type_expr list * Types.type_expr
    val polyfy : + Env.t -> + Types.type_expr -> + Types.type_expr list -> + Types.type_expr * bool
    val instance_label : + fixed:bool -> + Types.label_description -> + Types.type_expr list * Types.type_expr * Types.type_expr
    val apply : + ?use_current_level:bool -> + Env.t -> + Types.type_expr list -> + Types.type_expr -> + Types.type_expr list -> + Types.type_expr
    val try_expand_once_opt : Env.t -> Types.type_expr -> Types.type_expr
    val try_expand_safe_opt : Env.t -> Types.type_expr -> Types.type_expr
    val expand_head_once : Env.t -> Types.type_expr -> Types.type_expr
    val expand_head : Env.t -> Types.type_expr -> Types.type_expr
    val expand_head_opt : Env.t -> Types.type_expr -> Types.type_expr

    The compiler's own version of expand_head necessary for type-based optimisations.

    Expansion of types for error traces; lives here instead of in Errortrace because the expansion machinery lives here.

    val expanded_diff : + Env.t -> + got:Types.type_expr -> + expected:Types.type_expr -> + (Errortrace.expanded_type, 'variant) Errortrace.elt

    Create an Errortrace.Diff by expanding the two types

    val unexpanded_diff : + got:Types.type_expr -> + expected:Types.type_expr -> + (Errortrace.expanded_type, 'variant) Errortrace.elt

    Create an Errortrace.Diff by *duplicating* the two types, so that each one's expansion is identical to itself. Despite the name, does create Errortrace.expanded_types.

    val full_expand : + may_forget_scope:bool -> + Env.t -> + Types.type_expr -> + Types.type_expr
    type typedecl_extraction_result =
    1. | Typedecl of Path.t * Path.t * Types.type_declaration
    2. | Has_no_typedecl
    3. | May_have_typedecl
    val extract_concrete_typedecl : + Env.t -> + Types.type_expr -> + typedecl_extraction_result
    val unify : Env.t -> Types.type_expr -> Types.type_expr -> unit
    val unify_var : Env.t -> Types.type_expr -> Types.type_expr -> unit
    val filter_method : Env.t -> string -> Types.type_expr -> Types.type_expr
    val occur_in : Env.t -> Types.type_expr -> Types.type_expr -> bool
    val deep_occur : Types.type_expr -> Types.type_expr -> bool
    val moregeneral : Env.t -> bool -> Types.type_expr -> Types.type_expr -> unit
    val is_moregeneral : + Env.t -> + bool -> + Types.type_expr -> + Types.type_expr -> + bool
    val rigidify : Types.type_expr -> Types.type_expr list
    val all_distinct_vars : Env.t -> Types.type_expr list -> bool
    val matches : + expand_error_trace:bool -> + Env.t -> + Types.type_expr -> + Types.type_expr -> + unit
    val does_match : Env.t -> Types.type_expr -> Types.type_expr -> bool
    val reify_univars : Env.t -> Types.type_expr -> Types.type_expr
    type filter_arrow_failure =
    1. | Unification_error of Errortrace.unification_error
    2. | Label_mismatch of {
      1. got : Asttypes.arg_label;
      2. expected : Asttypes.arg_label;
      3. expected_type : Types.type_expr;
      }
    3. | Not_a_function
    exception Filter_arrow_failed of filter_arrow_failure
    type filter_method_failure =
    1. | Unification_error of Errortrace.unification_error
    2. | Not_a_method
    3. | Not_an_object of Types.type_expr
    exception Filter_method_failed of filter_method_failure
    type class_match_failure =
    1. | CM_Virtual_class
    2. | CM_Parameter_arity_mismatch of int * int
    3. | CM_Type_parameter_mismatch of int * Env.t * Errortrace.equality_error
    4. | CM_Class_type_mismatch of Env.t * Types.class_type * Types.class_type
    5. | CM_Parameter_mismatch of int * Env.t * Errortrace.moregen_error
    6. | CM_Val_type_mismatch of string * Env.t * Errortrace.comparison_error
    7. | CM_Meth_type_mismatch of string * Env.t * Errortrace.comparison_error
    8. | CM_Non_mutable_value of string
    9. | CM_Non_concrete_value of string
    10. | CM_Missing_value of string
    11. | CM_Missing_method of string
    12. | CM_Hide_public of string
    13. | CM_Hide_virtual of string * string
    14. | CM_Public_method of string
    15. | CM_Private_method of string
    16. | CM_Virtual_method of string
    val match_class_types : + ?trace:bool -> + Env.t -> + Types.class_type -> + Types.class_type -> + class_match_failure list
    val equal : + Env.t -> + bool -> + Types.type_expr list -> + Types.type_expr list -> + unit
    val is_equal : + Env.t -> + bool -> + Types.type_expr list -> + Types.type_expr list -> + bool
    val equal_private : + Env.t -> + Types.type_expr list -> + Types.type_expr -> + Types.type_expr list -> + Types.type_expr -> + unit
    val match_class_declarations : + Env.t -> + Types.type_expr list -> + Types.class_type -> + Types.type_expr list -> + Types.class_type -> + class_match_failure list
    val enlarge_type : Env.t -> Types.type_expr -> Types.type_expr * bool
    val subtype : Env.t -> Types.type_expr -> Types.type_expr -> unit -> unit
    val new_class_signature : unit -> Types.class_signature
    val add_dummy_method : Env.t -> scope:int -> Types.class_signature -> unit
    type add_method_failure =
    1. | Unexpected_method
    2. | Type_mismatch of Errortrace.unification_error
    exception Add_method_failed of add_method_failure
    type add_instance_variable_failure =
    1. | Mutability_mismatch of Asttypes.mutable_flag
    2. | Type_mismatch of Errortrace.unification_error
    exception Add_instance_variable_failed of add_instance_variable_failure
    val add_instance_variable : + strict:bool -> + Env.t -> + Asttypes.label -> + Asttypes.mutable_flag -> + Asttypes.virtual_flag -> + Types.type_expr -> + Types.class_signature -> + unit
    type inherit_class_signature_failure =
    1. | Self_type_mismatch of Errortrace.unification_error
    2. | Method of Asttypes.label * add_method_failure
    3. | Instance_variable of Asttypes.label * add_instance_variable_failure
    exception Inherit_class_signature_failed of inherit_class_signature_failure
    val inherit_class_signature : + strict:bool -> + Env.t -> + Types.class_signature -> + Types.class_signature -> + unit
    val update_class_signature : + Env.t -> + Types.class_signature -> + Asttypes.label list * Asttypes.label list
    val hide_private_methods : Env.t -> Types.class_signature -> unit
    val close_class_signature : Env.t -> Types.class_signature -> bool
    exception Nondep_cannot_erase of Ident.t
    val nondep_type : Env.t -> Ident.t list -> Types.type_expr -> Types.type_expr
    val nondep_type_decl : + Env.t -> + Ident.t list -> + bool -> + Types.type_declaration -> + Types.type_declaration
    val nondep_extension_constructor : + Env.t -> + Ident.t list -> + Types.extension_constructor -> + Types.extension_constructor
    val nondep_class_declaration : + Env.t -> + Ident.t list -> + Types.class_declaration -> + Types.class_declaration
    val nondep_cltype_declaration : + Env.t -> + Ident.t list -> + Types.class_type_declaration -> + Types.class_type_declaration
    val is_contractive : Env.t -> Path.t -> bool
    val normalize_type : Types.type_expr -> unit
    val nongen_vars_in_schema : Env.t -> Types.type_expr -> Btype.TypeSet.t option
    val nongen_vars_in_class_declaration : + Types.class_declaration -> + Btype.TypeSet.t option
    type variable_kind =
    1. | Row_variable
    2. | Type_variable
    type closed_class_failure = {
    1. free_variable : Types.type_expr * variable_kind;
    2. meth : string;
    3. meth_ty : Types.type_expr;
    }
    val free_variables : ?env:Env.t -> Types.type_expr -> Types.type_expr list
    val closed_type_decl : Types.type_declaration -> Types.type_expr option
    val closed_extension_constructor : + Types.extension_constructor -> + Types.type_expr option
    val closed_class : + Types.type_expr list -> + Types.class_signature -> + closed_class_failure option
    val arity : Types.type_expr -> int
    val collapse_conj_params : Env.t -> Types.type_expr list -> unit
    val get_current_level : unit -> int
    val wrap_trace_gadt_instances : Env.t -> ('a -> 'b) -> 'a -> 'b
    val immediacy : Env.t -> Types.type_expr -> Type_immediacy.t
    val package_subtype : + (Env.t -> + Path.t -> + (Longident.t * Types.type_expr) list -> + Path.t -> + (Longident.t * Types.type_expr) list -> + bool) + ref
    val mcomp : Env.t -> Types.type_expr -> Types.type_expr -> unit
    diff --git a/ocaml/Dataflow/Backward/argument-1-D/index.html b/ocaml/Dataflow/Backward/argument-1-D/index.html new file mode 100644 index 0000000..90f6831 --- /dev/null +++ b/ocaml/Dataflow/Backward/argument-1-D/index.html @@ -0,0 +1,2 @@ + +D (ocaml.Dataflow.Backward.D)

    Parameter Backward.D

    type t
    val bot : t
    val join : t -> t -> t
    val lessequal : t -> t -> bool
    diff --git a/ocaml/Dataflow/Backward/index.html b/ocaml/Dataflow/Backward/index.html new file mode 100644 index 0000000..4fd761e --- /dev/null +++ b/ocaml/Dataflow/Backward/index.html @@ -0,0 +1,7 @@ + +Backward (ocaml.Dataflow.Backward)

    Module Dataflow.Backward

    Parameters

    module D : DOMAIN

    Signature

    val analyze : + ?exnhandler:(D.t -> D.t) -> + ?exnescape:D.t -> + transfer:(Mach.instruction -> next:D.t -> exn:D.t -> D.t) -> + Mach.instruction -> + D.t * (int -> D.t)
    diff --git a/ocaml/Dataflow/index.html b/ocaml/Dataflow/index.html new file mode 100644 index 0000000..172c51d --- /dev/null +++ b/ocaml/Dataflow/index.html @@ -0,0 +1,2 @@ + +Dataflow (ocaml.Dataflow)

    Module Dataflow

    module type DOMAIN = sig ... end
    module Backward (D : DOMAIN) : sig ... end
    diff --git a/ocaml/Dataflow/module-type-DOMAIN/index.html b/ocaml/Dataflow/module-type-DOMAIN/index.html new file mode 100644 index 0000000..4433548 --- /dev/null +++ b/ocaml/Dataflow/module-type-DOMAIN/index.html @@ -0,0 +1,2 @@ + +DOMAIN (ocaml.Dataflow.DOMAIN)

    Module type Dataflow.DOMAIN

    type t
    val bot : t
    val join : t -> t -> t
    val lessequal : t -> t -> bool
    diff --git a/ocaml/Datarepr/index.html b/ocaml/Datarepr/index.html new file mode 100644 index 0000000..70d87c4 --- /dev/null +++ b/ocaml/Datarepr/index.html @@ -0,0 +1,19 @@ + +Datarepr (ocaml.Datarepr)

    Module Datarepr

    val extension_descr : + current_unit:string -> + Path.t -> + Types.extension_constructor -> + Types.constructor_description
    val labels_of_type : + Path.t -> + Types.type_declaration -> + (Ident.t * Types.label_description) list
    val constructors_of_type : + current_unit:string -> + Path.t -> + Types.type_declaration -> + (Ident.t * Types.constructor_description) list
    exception Constr_not_found
    val constructor_existentials : + Types.constructor_arguments -> + Types.type_expr option -> + Types.type_expr list * Types.type_expr list

    Takes cd_args and cd_res from a constructor_declaration and returns:

    • the types of the constructor's arguments
    • the existential variables introduced by the constructor
    diff --git a/ocaml/Deadcode/index.html b/ocaml/Deadcode/index.html new file mode 100644 index 0000000..f03088f --- /dev/null +++ b/ocaml/Deadcode/index.html @@ -0,0 +1,2 @@ + +Deadcode (ocaml.Deadcode)

    Module Deadcode

    val fundecl : Mach.fundecl -> Mach.fundecl
    diff --git a/ocaml/Debuginfo/Scoped_location/index.html b/ocaml/Debuginfo/Scoped_location/index.html new file mode 100644 index 0000000..989ace3 --- /dev/null +++ b/ocaml/Debuginfo/Scoped_location/index.html @@ -0,0 +1,2 @@ + +Scoped_location (ocaml.Debuginfo.Scoped_location)

    Module Debuginfo.Scoped_location

    type scopes
    val string_of_scopes : scopes -> string
    val empty_scopes : scopes
    val enter_anonymous_function : scopes:scopes -> scopes
    val enter_value_definition : scopes:scopes -> Ident.t -> scopes
    val enter_module_definition : scopes:scopes -> Ident.t -> scopes
    val enter_class_definition : scopes:scopes -> Ident.t -> scopes
    val enter_method_definition : scopes:scopes -> Asttypes.label -> scopes
    type t =
    1. | Loc_unknown
    2. | Loc_known of {
      1. loc : Location.t;
      2. scopes : scopes;
      }
    val of_location : scopes:scopes -> Location.t -> t
    val to_location : t -> Location.t
    val string_of_scoped_location : t -> string
    diff --git a/ocaml/Debuginfo/index.html b/ocaml/Debuginfo/index.html new file mode 100644 index 0000000..a53c378 --- /dev/null +++ b/ocaml/Debuginfo/index.html @@ -0,0 +1,2 @@ + +Debuginfo (ocaml.Debuginfo)

    Module Debuginfo

    module Scoped_location : sig ... end
    type item = private {
    1. dinfo_file : string;
    2. dinfo_line : int;
    3. dinfo_char_start : int;
    4. dinfo_char_end : int;
    5. dinfo_start_bol : int;
    6. dinfo_end_bol : int;
    7. dinfo_end_line : int;
    8. dinfo_scopes : Scoped_location.scopes;
    }
    type t = item list
    type alloc_dbginfo_item = {
    1. alloc_words : int;
    2. alloc_dbg : t;
    }

    Due to Comballoc, a single Ialloc instruction may combine several unrelated allocations. Their Debuginfo.t (which may differ) are stored as a list of alloc_dbginfo. This list is in order of increasing memory address, which is the reverse of the original allocation order. Later allocations are consed to the front of this list by Comballoc.

    type alloc_dbginfo = alloc_dbginfo_item list
    val none : t
    val is_none : t -> bool
    val to_string : t -> string
    val from_location : Scoped_location.t -> t
    val to_location : t -> Location.t
    val inline : t -> t -> t
    val compare : t -> t -> int
    val hash : t -> int
    val print_compact : Stdlib.Format.formatter -> t -> unit
    diff --git a/ocaml/Depend/index.html b/ocaml/Depend/index.html new file mode 100644 index 0000000..c5949af --- /dev/null +++ b/ocaml/Depend/index.html @@ -0,0 +1,2 @@ + +Depend (ocaml.Depend)

    Module Depend

    Module dependencies.

    Warning: this module is unstable and part of compiler-libs.

    module String = Misc.Stdlib.String
    type map_tree =
    1. | Node of String.Set.t * bound_map
    and bound_map = map_tree String.Map.t
    val make_leaf : string -> map_tree
    val make_node : bound_map -> map_tree
    val weaken_map : String.Set.t -> map_tree -> map_tree
    val free_structure_names : String.Set.t ref

    Collect free module identifiers in the a.s.t.

    val pp_deps : string list ref

    Dependencies found by preprocessing tools.

    val open_module : bound_map -> Longident.t -> bound_map
    val add_use_file : bound_map -> Parsetree.toplevel_phrase list -> unit
    val add_signature : bound_map -> Parsetree.signature -> unit
    val add_implementation : bound_map -> Parsetree.structure -> unit
    val add_implementation_binding : bound_map -> Parsetree.structure -> bound_map
    val add_signature_binding : bound_map -> Parsetree.signature -> bound_map
    diff --git a/ocaml/Diffing/Define/Left_variadic/argument-1-_/index.html b/ocaml/Diffing/Define/Left_variadic/argument-1-_/index.html new file mode 100644 index 0000000..1084c64 --- /dev/null +++ b/ocaml/Diffing/Define/Left_variadic/argument-1-_/index.html @@ -0,0 +1,2 @@ + +_ (ocaml.Diffing.Define.Left_variadic._)

    Parameter Left_variadic._

    val weight : change -> int

    weight ch returns the weight of the change ch. Used to find the smallest patch.

    val test : D.state -> D.left -> D.right -> (D.eq, D.diff) result

    test st xl xr tests if the elements xl and xr are co mpatible (Ok) or not (Error).

    val update : change -> D.state -> D.state * D.left array

    update ch st returns the new state after applying a change. The update_result type also contains expansions in the variadic case.

    diff --git a/ocaml/Diffing/Define/Left_variadic/index.html b/ocaml/Diffing/Define/Left_variadic/index.html new file mode 100644 index 0000000..7cf36df --- /dev/null +++ b/ocaml/Diffing/Define/Left_variadic/index.html @@ -0,0 +1,2 @@ + +Left_variadic (ocaml.Diffing.Define.Left_variadic)

    Module Define.Left_variadic

    Variadic diffing

    Variadic diffing allows to expand the lists being diffed during diffing. in one specific direction.

    Parameters

    module _ : Parameters with type update_result := D.state * D.left array

    Signature

    val diff : D.state -> D.left array -> D.right array -> patch

    diff state l r computes the optimal patch between l and r, using the initial state state.

    diff --git a/ocaml/Diffing/Define/Right_variadic/argument-1-_/index.html b/ocaml/Diffing/Define/Right_variadic/argument-1-_/index.html new file mode 100644 index 0000000..11e7f4b --- /dev/null +++ b/ocaml/Diffing/Define/Right_variadic/argument-1-_/index.html @@ -0,0 +1,2 @@ + +_ (ocaml.Diffing.Define.Right_variadic._)

    Parameter Right_variadic._

    val weight : change -> int

    weight ch returns the weight of the change ch. Used to find the smallest patch.

    val test : D.state -> D.left -> D.right -> (D.eq, D.diff) result

    test st xl xr tests if the elements xl and xr are co mpatible (Ok) or not (Error).

    val update : change -> D.state -> D.state * D.right array

    update ch st returns the new state after applying a change. The update_result type also contains expansions in the variadic case.

    diff --git a/ocaml/Diffing/Define/Right_variadic/index.html b/ocaml/Diffing/Define/Right_variadic/index.html new file mode 100644 index 0000000..7bbd8ea --- /dev/null +++ b/ocaml/Diffing/Define/Right_variadic/index.html @@ -0,0 +1,2 @@ + +Right_variadic (ocaml.Diffing.Define.Right_variadic)

    Module Define.Right_variadic

    Parameters

    module _ : Parameters with type update_result := D.state * D.right array

    Signature

    val diff : D.state -> D.left array -> D.right array -> patch

    diff state l r computes the optimal patch between l and r, using the initial state state.

    diff --git a/ocaml/Diffing/Define/Simple/argument-1-_/index.html b/ocaml/Diffing/Define/Simple/argument-1-_/index.html new file mode 100644 index 0000000..14d29ef --- /dev/null +++ b/ocaml/Diffing/Define/Simple/argument-1-_/index.html @@ -0,0 +1,2 @@ + +_ (ocaml.Diffing.Define.Simple._)

    Parameter Simple._

    val weight : change -> int

    weight ch returns the weight of the change ch. Used to find the smallest patch.

    val test : D.state -> D.left -> D.right -> (D.eq, D.diff) result

    test st xl xr tests if the elements xl and xr are co mpatible (Ok) or not (Error).

    val update : change -> D.state -> D.state

    update ch st returns the new state after applying a change. The update_result type also contains expansions in the variadic case.

    diff --git a/ocaml/Diffing/Define/Simple/index.html b/ocaml/Diffing/Define/Simple/index.html new file mode 100644 index 0000000..b17c638 --- /dev/null +++ b/ocaml/Diffing/Define/Simple/index.html @@ -0,0 +1,2 @@ + +Simple (ocaml.Diffing.Define.Simple)

    Module Define.Simple

    Parameters

    module _ : Parameters with type update_result := D.state

    Signature

    val diff : D.state -> D.left array -> D.right array -> patch

    diff state l r computes the optimal patch between l and r, using the initial state state.

    diff --git a/ocaml/Diffing/Define/argument-1-D/index.html b/ocaml/Diffing/Define/argument-1-D/index.html new file mode 100644 index 0000000..f0ba6dc --- /dev/null +++ b/ocaml/Diffing/Define/argument-1-D/index.html @@ -0,0 +1,2 @@ + +D (ocaml.Diffing.Define.D)

    Parameter Define.D

    type left
    type right
    type eq

    Detailed equality trace

    type diff

    Detailed difference trace

    type state

    environment of a partial patch

    diff --git a/ocaml/Diffing/Define/index.html b/ocaml/Diffing/Define/index.html new file mode 100644 index 0000000..43a56f8 --- /dev/null +++ b/ocaml/Diffing/Define/index.html @@ -0,0 +1,6 @@ + +Define (ocaml.Diffing.Define)

    Module Diffing.Define

    Define(Defs) creates the diffing types from the types defined in Defs and the functors that need to be instantatied with the diffing algorithm parameters

    Parameters

    module D : Defs

    Signature

    type nonrec change = (D.left, D.right, D.eq, D.diff) change

    The type of potential changes on a list.

    type patch = change list

    A patch is an ordered list of changes.

    module type Parameters = sig ... end
    module type S = sig ... end
    module Simple (_ : Parameters with type update_result := D.state) : S
    module Left_variadic + (_ : Parameters with type update_result := D.state * D.left array) : + S
    module Right_variadic + (_ : Parameters with type update_result := D.state * D.right array) : + S
    diff --git a/ocaml/Diffing/Define/module-type-Parameters/index.html b/ocaml/Diffing/Define/module-type-Parameters/index.html new file mode 100644 index 0000000..2f00bae --- /dev/null +++ b/ocaml/Diffing/Define/module-type-Parameters/index.html @@ -0,0 +1,2 @@ + +Parameters (ocaml.Diffing.Define.Parameters)

    Module type Define.Parameters

    type update_result
    val weight : change -> int

    weight ch returns the weight of the change ch. Used to find the smallest patch.

    val test : D.state -> D.left -> D.right -> (D.eq, D.diff) result

    test st xl xr tests if the elements xl and xr are co mpatible (Ok) or not (Error).

    val update : change -> D.state -> update_result

    update ch st returns the new state after applying a change. The update_result type also contains expansions in the variadic case.

    diff --git a/ocaml/Diffing/Define/module-type-S/index.html b/ocaml/Diffing/Define/module-type-S/index.html new file mode 100644 index 0000000..8433974 --- /dev/null +++ b/ocaml/Diffing/Define/module-type-S/index.html @@ -0,0 +1,2 @@ + +S (ocaml.Diffing.Define.S)

    Module type Define.S

    val diff : D.state -> D.left array -> D.right array -> patch

    diff state l r computes the optimal patch between l and r, using the initial state state.

    diff --git a/ocaml/Diffing/index.html b/ocaml/Diffing/index.html new file mode 100644 index 0000000..db76855 --- /dev/null +++ b/ocaml/Diffing/index.html @@ -0,0 +1,2 @@ + +Diffing (ocaml.Diffing)

    Module Diffing

    Parametric diffing

    This module implements diffing over lists of arbitrary content. It is parameterized by

    • The content of the two lists
    • The equality witness when an element is kept
    • The diffing witness when an element is changed

    Diffing is extended to maintain state depending on the computed changes while walking through the two lists.

    The underlying algorithm is a modified Wagner-Fischer algorithm (see <https://en.wikipedia.org/wiki/Wagner%E2%80%93Fischer_algorithm>).

    We provide the following guarantee: Given two lists l and r, if different patches result in different states, we say that the state diverges.

    • We always return the optimal patch on prefixes of l and r on which state does not diverge.
    • Otherwise, we return a correct but non-optimal patch where subpatches with no divergent states are optimal for the given initial state.

    More precisely, the optimality of Wagner-Fischer depends on the property that the edit-distance between a k-prefix of the left input and a l-prefix of the right input d(k,l) satisfies

    d(k,l) = min ( del_cost + d(k-1,l), insert_cost + d(k,l-1), change_cost + d(k-1,l-1) )

    Under this hypothesis, it is optimal to choose greedily the state of the minimal patch transforming the left k-prefix into the right l-prefix as a representative of the states of all possible patches transforming the left k-prefix into the right l-prefix.

    If this property is not satisfied, we can still choose greedily a representative state. However, the computed patch is no more guaranteed to be globally optimal. Nevertheless, it is still a correct patch, which is even optimal among all explored patches.

    module type Defs = sig ... end

    The core types of a diffing implementation

    type change_kind =
    1. | Deletion
    2. | Insertion
    3. | Modification
    4. | Preservation

    The kind of changes which is used to share printing and styling across implementation

    val prefix : Stdlib.Format.formatter -> (int * change_kind) -> unit
    val style : change_kind -> Misc.Style.style list
    type ('left, 'right, 'eq, 'diff) change =
    1. | Delete of 'left
    2. | Insert of 'right
    3. | Keep of 'left * 'right * 'eq
    4. | Change of 'left * 'right * 'diff
    val classify : (_, _, _, _) change -> change_kind
    module Define (D : Defs) : sig ... end

    Define(Defs) creates the diffing types from the types defined in Defs and the functors that need to be instantatied with the diffing algorithm parameters

    diff --git a/ocaml/Diffing/module-type-Defs/index.html b/ocaml/Diffing/module-type-Defs/index.html new file mode 100644 index 0000000..b98d4b1 --- /dev/null +++ b/ocaml/Diffing/module-type-Defs/index.html @@ -0,0 +1,2 @@ + +Defs (ocaml.Diffing.Defs)

    Module type Diffing.Defs

    The core types of a diffing implementation

    type left
    type right
    type eq

    Detailed equality trace

    type diff

    Detailed difference trace

    type state

    environment of a partial patch

    diff --git a/ocaml/Diffing_with_keys/Define/Simple/argument-1-_/index.html b/ocaml/Diffing_with_keys/Define/Simple/argument-1-_/index.html new file mode 100644 index 0000000..324c2e4 --- /dev/null +++ b/ocaml/Diffing_with_keys/Define/Simple/argument-1-_/index.html @@ -0,0 +1,2 @@ + +_ (ocaml.Diffing_with_keys.Define.Simple._)

    Parameter Simple._

    val weight : change -> int
    val test : D.state -> left -> right -> (unit, diff) result
    val update : change -> D.state -> D.state
    val key_left : D.left -> string
    val key_right : D.right -> string
    diff --git a/ocaml/Diffing_with_keys/Define/Simple/index.html b/ocaml/Diffing_with_keys/Define/Simple/index.html new file mode 100644 index 0000000..e8fe8a5 --- /dev/null +++ b/ocaml/Diffing_with_keys/Define/Simple/index.html @@ -0,0 +1,2 @@ + +Simple (ocaml.Diffing_with_keys.Define.Simple)

    Module Define.Simple

    Parameters

    module _ : Parameters

    Signature

    val diff : D.state -> D.left list -> D.right list -> patch
    diff --git a/ocaml/Diffing_with_keys/Define/argument-1-D/index.html b/ocaml/Diffing_with_keys/Define/argument-1-D/index.html new file mode 100644 index 0000000..8efd5a3 --- /dev/null +++ b/ocaml/Diffing_with_keys/Define/argument-1-D/index.html @@ -0,0 +1,2 @@ + +D (ocaml.Diffing_with_keys.Define.D)

    Parameter Define.D

    type left
    type right
    type diff

    Detailed difference trace

    type state

    environment of a partial patch

    diff --git a/ocaml/Diffing_with_keys/Define/index.html b/ocaml/Diffing_with_keys/Define/index.html new file mode 100644 index 0000000..afd9f3d --- /dev/null +++ b/ocaml/Diffing_with_keys/Define/index.html @@ -0,0 +1,2 @@ + +Define (ocaml.Diffing_with_keys.Define)

    Module Diffing_with_keys.Define

    Parameters

    module D : Diffing.Defs with type eq := unit

    Signature

    type diff = (D.left, D.right, D.diff) mismatch
    type left = D.left with_pos
    type right = D.right with_pos
    type composite_change = (D.left, D.right, D.diff) change

    Composite changes and patches

    type patch = composite_change list
    type change = (left, right, unit, diff) Diffing.change

    Atomic changes

    module type Parameters = sig ... end
    module Simple (_ : Parameters) : sig ... end
    diff --git a/ocaml/Diffing_with_keys/Define/module-type-Parameters/index.html b/ocaml/Diffing_with_keys/Define/module-type-Parameters/index.html new file mode 100644 index 0000000..6d8278a --- /dev/null +++ b/ocaml/Diffing_with_keys/Define/module-type-Parameters/index.html @@ -0,0 +1,2 @@ + +Parameters (ocaml.Diffing_with_keys.Define.Parameters)

    Module type Define.Parameters

    val weight : change -> int
    val test : D.state -> left -> right -> (unit, diff) result
    val update : change -> D.state -> D.state
    val key_left : D.left -> string
    val key_right : D.right -> string
    diff --git a/ocaml/Diffing_with_keys/index.html b/ocaml/Diffing_with_keys/index.html new file mode 100644 index 0000000..fd5bcea --- /dev/null +++ b/ocaml/Diffing_with_keys/index.html @@ -0,0 +1,2 @@ + +Diffing_with_keys (ocaml.Diffing_with_keys)

    Module Diffing_with_keys

    When diffing lists where each element has a distinct key, we can refine the diffing patch by introducing two composite edit moves: swaps and moves.

    Swaps exchange the position of two elements. Swap cost is set to 2 * change - epsilon. Moves change the position of one element. Move cost is set to delete + addition - epsilon.

    When the cost delete + addition is greater than change and with those specific weights, the optimal patch with Swaps and Moves can be computed directly and cheaply from the original optimal patch.

    type 'a with_pos = {
    1. pos : int;
    2. data : 'a;
    }
    val with_pos : 'a list -> 'a with_pos list
    type ('l, 'r, 'diff) mismatch =
    1. | Name of {
      1. pos : int;
      2. got : string;
      3. expected : string;
      4. types_match : bool;
      }
    2. | Type of {
      1. pos : int;
      2. got : 'l;
      3. expected : 'r;
      4. reason : 'diff;
      }
    type ('l, 'r, 'diff) change =
    1. | Change of ('l, 'r, 'diff) mismatch
    2. | Swap of {
      1. pos : int * int;
      2. first : string;
      3. last : string;
      }
    3. | Move of {
      1. name : string;
      2. got : int;
      3. expected : int;
      }
    4. | Insert of {
      1. pos : int;
      2. insert : 'r;
      }
    5. | Delete of {
      1. pos : int;
      2. delete : 'l;
      }

    This specialized version of changes introduces two composite changes: Move and Swap

    val prefix : Stdlib.Format.formatter -> ('l, 'r, 'diff) change -> unit
    module Define (D : Diffing.Defs with type eq := unit) : sig ... end
    diff --git a/ocaml/Dll/index.html b/ocaml/Dll/index.html new file mode 100644 index 0000000..d390a3e --- /dev/null +++ b/ocaml/Dll/index.html @@ -0,0 +1,2 @@ + +Dll (ocaml.Dll)

    Module Dll

    val extract_dll_name : string -> string
    type dll_mode =
    1. | For_checking
    2. | For_execution
    val open_dlls : dll_mode -> string list -> unit
    val close_all_dlls : unit -> unit
    type dll_address
    type primitive_address =
    1. | Prim_loaded of dll_address
    2. | Prim_exists
    val find_primitive : string -> primitive_address option
    val synchronize_primitive : int -> dll_address -> unit
    val add_path : string list -> unit
    val remove_path : string list -> unit
    val init_compile : bool -> unit
    val init_toplevel : string list -> unit
    val reset : unit -> unit
    diff --git a/ocaml/Docstrings/WithMenhir/index.html b/ocaml/Docstrings/WithMenhir/index.html new file mode 100644 index 0000000..d1a4568 --- /dev/null +++ b/ocaml/Docstrings/WithMenhir/index.html @@ -0,0 +1,9 @@ + +WithMenhir (ocaml.Docstrings.WithMenhir)

    Module Docstrings.WithMenhir

    Fetch the item documentation for the current symbol. This also marks this documentation (for ambiguity warnings).

    Fetch the item documentation for the symbols between two positions. This also marks this documentation (for ambiguity warnings).

    val mark_symbol_docs : + (Stdlib.Lexing.position * Stdlib.Lexing.position) -> + unit

    Mark the item documentation for the current symbol (for ambiguity warnings).

    val mark_rhs_docs : Stdlib.Lexing.position -> Stdlib.Lexing.position -> unit

    Mark as associated the item documentation for the symbols between two positions (for ambiguity warnings)

    val symbol_info : Stdlib.Lexing.position -> info

    Fetch the field info for the current symbol.

    val rhs_info : Stdlib.Lexing.position -> info

    Fetch the field info following the symbol at a given position.

    val symbol_text : Stdlib.Lexing.position -> text

    Fetch the text preceding the current symbol.

    val symbol_text_lazy : Stdlib.Lexing.position -> text Stdlib.Lazy.t
    val rhs_text : Stdlib.Lexing.position -> text

    Fetch the text preceding the symbol at the given position.

    val rhs_text_lazy : Stdlib.Lexing.position -> text Stdlib.Lazy.t

    Extra text

    There may be additional text attached to the delimiters of a block (e.g. struct and end). This is fetched by the following functions, which are applied to the contents of the block rather than the delimiters.

    val symbol_pre_extra_text : Stdlib.Lexing.position -> text

    Fetch additional text preceding the current symbol

    val symbol_post_extra_text : Stdlib.Lexing.position -> text

    Fetch additional text following the current symbol

    val rhs_pre_extra_text : Stdlib.Lexing.position -> text

    Fetch additional text preceding the symbol at the given position

    val rhs_post_extra_text : Stdlib.Lexing.position -> text

    Fetch additional text following the symbol at the given position

    val rhs_post_text : Stdlib.Lexing.position -> text

    Fetch text following the symbol at the given position

    diff --git a/ocaml/Docstrings/index.html b/ocaml/Docstrings/index.html new file mode 100644 index 0000000..5c79a61 --- /dev/null +++ b/ocaml/Docstrings/index.html @@ -0,0 +1,5 @@ + +Docstrings (ocaml.Docstrings)

    Module Docstrings

    Documentation comments

    Warning: this module is unstable and part of compiler-libs.

    val init : unit -> unit

    (Re)Initialise all docstring state

    val warn_bad_docstrings : unit -> unit

    Emit warnings for unattached and ambiguous docstrings

    Docstrings

    type docstring

    Documentation comments

    val docstring : string -> Location.t -> docstring

    Create a docstring

    val register : docstring -> unit

    Register a docstring

    val docstring_body : docstring -> string

    Get the text of a docstring

    val docstring_loc : docstring -> Location.t

    Get the location of a docstring

    Set functions

    These functions are used by the lexer to associate docstrings to the locations of tokens.

    val set_pre_docstrings : Stdlib.Lexing.position -> docstring list -> unit

    Docstrings immediately preceding a token

    val set_post_docstrings : Stdlib.Lexing.position -> docstring list -> unit

    Docstrings immediately following a token

    val set_floating_docstrings : Stdlib.Lexing.position -> docstring list -> unit

    Docstrings not immediately adjacent to a token

    val set_pre_extra_docstrings : Stdlib.Lexing.position -> docstring list -> unit

    Docstrings immediately following the token which precedes this one

    val set_post_extra_docstrings : + Stdlib.Lexing.position -> + docstring list -> + unit

    Docstrings immediately preceding the token which follows this one

    Items

    The docs type represents documentation attached to an item.

    type docs = {
    1. docs_pre : docstring option;
    2. docs_post : docstring option;
    }
    val empty_docs : docs
    val docs_attr : docstring -> Parsetree.attribute

    Convert item documentation to attributes and add them to an attribute list

    val symbol_docs : unit -> docs

    Fetch the item documentation for the current symbol. This also marks this documentation (for ambiguity warnings).

    val symbol_docs_lazy : unit -> docs Stdlib.Lazy.t
    val rhs_docs : int -> int -> docs

    Fetch the item documentation for the symbols between two positions. This also marks this documentation (for ambiguity warnings).

    val rhs_docs_lazy : int -> int -> docs Stdlib.Lazy.t
    val mark_symbol_docs : unit -> unit

    Mark the item documentation for the current symbol (for ambiguity warnings).

    val mark_rhs_docs : int -> int -> unit

    Mark as associated the item documentation for the symbols between two positions (for ambiguity warnings)

    Fields and constructors

    The info type represents documentation attached to a field or constructor.

    type info = docstring option
    val empty_info : info
    val info_attr : docstring -> Parsetree.attribute

    Convert field info to attributes and add them to an attribute list

    val symbol_info : unit -> info

    Fetch the field info for the current symbol.

    val rhs_info : int -> info

    Fetch the field info following the symbol at a given position.

    Unattached comments

    The text type represents documentation which is not attached to anything.

    type text = docstring list
    val empty_text : text
    val empty_text_lazy : text Stdlib.Lazy.t
    val text_attr : docstring -> Parsetree.attribute
    val add_text_attrs : text -> Parsetree.attributes -> Parsetree.attributes

    Convert text to attributes and add them to an attribute list

    val symbol_text : unit -> text

    Fetch the text preceding the current symbol.

    val symbol_text_lazy : unit -> text Stdlib.Lazy.t
    val rhs_text : int -> text

    Fetch the text preceding the symbol at the given position.

    val rhs_text_lazy : int -> text Stdlib.Lazy.t

    Extra text

    There may be additional text attached to the delimiters of a block (e.g. struct and end). This is fetched by the following functions, which are applied to the contents of the block rather than the delimiters.

    val symbol_pre_extra_text : unit -> text

    Fetch additional text preceding the current symbol

    val symbol_post_extra_text : unit -> text

    Fetch additional text following the current symbol

    val rhs_pre_extra_text : int -> text

    Fetch additional text preceding the symbol at the given position

    val rhs_post_extra_text : int -> text

    Fetch additional text following the symbol at the given position

    val rhs_post_text : int -> text

    Fetch text following the symbol at the given position

    module WithMenhir : sig ... end
    diff --git a/ocaml/Domainstate/index.html b/ocaml/Domainstate/index.html new file mode 100644 index 0000000..4c1bada --- /dev/null +++ b/ocaml/Domainstate/index.html @@ -0,0 +1,2 @@ + +Domainstate (ocaml.Domainstate)

    Module Domainstate

    val stack_ctx_words : int
    type t =
    1. | Domain_young_limit
    2. | Domain_young_ptr
    3. | Domain_young_start
    4. | Domain_young_end
    5. | Domain_young_trigger
    6. | Domain_current_stack
    7. | Domain_exn_handler
    8. | Domain_action_pending
    9. | Domain_c_stack
    10. | Domain_stack_cache
    11. | Domain_gc_regs_buckets
    12. | Domain_gc_regs
    13. | Domain_minor_tables
    14. | Domain_mark_stack
    15. | Domain_marking_done
    16. | Domain_sweeping_done
    17. | Domain_allocated_words
    18. | Domain_swept_words
    19. | Domain_major_slice_epoch
    20. | Domain_local_roots
    21. | Domain_ephe_info
    22. | Domain_final_info
    23. | Domain_backtrace_pos
    24. | Domain_backtrace_active
    25. | Domain_backtrace_buffer
    26. | Domain_backtrace_last_exn
    27. | Domain_compare_unordered
    28. | Domain_oo_next_id_local
    29. | Domain_requested_major_slice
    30. | Domain_requested_global_major_slice
    31. | Domain_requested_minor_gc
    32. | Domain_requested_external_interrupt
    33. | Domain_parser_trace
    34. | Domain_minor_heap_wsz
    35. | Domain_shared_heap
    36. | Domain_id
    37. | Domain_unique_id
    38. | Domain_dls_root
    39. | Domain_extra_heap_resources
    40. | Domain_extra_heap_resources_minor
    41. | Domain_dependent_size
    42. | Domain_dependent_allocated
    43. | Domain_slice_target
    44. | Domain_slice_budget
    45. | Domain_major_work_done_between_slices
    46. | Domain_extern_state
    47. | Domain_intern_state
    48. | Domain_stat_minor_words
    49. | Domain_stat_promoted_words
    50. | Domain_stat_major_words
    51. | Domain_stat_forced_major_collections
    52. | Domain_stat_blocks_marked
    53. | Domain_inside_stw_handler
    54. | Domain_trap_sp_off
    55. | Domain_trap_barrier_off
    56. | Domain_trap_barrier_block
    57. | Domain_external_raise
    58. | Domain_memprof
    59. | Domain_memprof_young_trigger
    60. | Domain_extra_params
    val idx_of_field : t -> int
    diff --git a/ocaml/Dynlink/index.html b/ocaml/Dynlink/index.html new file mode 100644 index 0000000..ac2c34f --- /dev/null +++ b/ocaml/Dynlink/index.html @@ -0,0 +1,2 @@ + +Dynlink (ocaml.Dynlink)

    Module Dynlink

    Dynamic loading of .cmo, .cma and .cmxs files.

    val is_native : bool

    true if the program is native, false if the program is bytecode.

    Dynamic loading of compiled files

    val loadfile : string -> unit

    In bytecode: load the given bytecode object file (.cmo file) or bytecode library file (.cma file), and link it with the running program. In native code: load the given OCaml plugin file (usually .cmxs), and link it with the running program.

    All toplevel expressions in the loaded compilation units are evaluated. No facilities are provided to access value names defined by the unit. Therefore, the unit must itself register its entry points with the main program (or a previously-loaded library) e.g. by modifying tables of functions.

    An exception will be raised if the given library defines toplevel modules whose names clash with modules existing either in the main program or a shared library previously loaded with loadfile. Modules from shared libraries previously loaded with loadfile_private are not included in this restriction.

    The compilation units loaded by this function are added to the "allowed units" list (see set_allowed_units).

    val loadfile_private : string -> unit

    Same as loadfile, except that the compilation units just loaded are hidden (cannot be referenced) from other modules dynamically loaded afterwards.

    An exception will be raised if the given library defines toplevel modules whose names clash with modules existing in either the main program or a shared library previously loaded with loadfile. Modules from shared libraries previously loaded with loadfile_private are not included in this restriction.

    An exception will also be raised if the given library defines toplevel modules whose name matches that of an interface depended on by a module existing in either the main program or a shared library previously loaded with loadfile. This applies even if such dependency is only a "module alias" dependency (i.e. just on the name rather than the contents of the interface).

    The compilation units loaded by this function are not added to the "allowed units" list (see set_allowed_units) since they cannot be referenced from other compilation units.

    val adapt_filename : string -> string

    In bytecode, the identity function. In native code, replace the last extension with .cmxs.

    Access control

    val set_allowed_units : string list -> unit

    Set the list of compilation units that may be referenced from units that are dynamically loaded in the future to be exactly the given value.

    Initially all compilation units composing the program currently running are available for reference from dynamically-linked units. set_allowed_units can be used to restrict access to a subset of these units, e.g. to the units that compose the API for dynamically-linked code, and prevent access to all other units, e.g. private, internal modules of the running program.

    Note that loadfile changes the allowed-units list.

    val allow_only : string list -> unit

    allow_only units sets the list of allowed units to be the intersection of the existing allowed units and the given list of units. As such it can never increase the set of allowed units.

    val prohibit : string list -> unit

    prohibit units prohibits dynamically-linked units from referencing the units named in list units by removing such units from the allowed units list. This can be used to prevent access to selected units, e.g. private, internal modules of the running program.

    val main_program_units : unit -> string list

    Return the list of compilation units that form the main program (i.e. are not dynamically linked).

    val public_dynamically_loaded_units : unit -> string list

    Return the list of compilation units that have been dynamically loaded via loadfile (and not via loadfile_private). Note that compilation units loaded dynamically cannot be unloaded.

    val all_units : unit -> string list

    Return the list of compilation units that form the main program together with those that have been dynamically loaded via loadfile (and not via loadfile_private).

    val allow_unsafe_modules : bool -> unit

    Govern whether unsafe object files are allowed to be dynamically linked. A compilation unit is 'unsafe' if it contains declarations of external functions, which can break type safety. By default, dynamic linking of unsafe object files is not allowed. In native code, this function does nothing; object files with external functions are always allowed to be dynamically linked.

    Error reporting

    type linking_error = private
    1. | Undefined_global of string
    2. | Unavailable_primitive of string
    3. | Uninitialized_global of string
    type error = private
    1. | Not_a_bytecode_file of string
    2. | Inconsistent_import of string
    3. | Unavailable_unit of string
    4. | Unsafe_file
    5. | Linking_error of string * linking_error
    6. | Corrupted_interface of string
    7. | Cannot_open_dynamic_library of exn
    8. | Library's_module_initializers_failed of exn
    9. | Inconsistent_implementation of string
    10. | Module_already_loaded of string
    11. | Private_library_cannot_implement_interface of string
    exception Error of error

    Errors in dynamic linking are reported by raising the Error exception with a description of the error. A common case is the dynamic library not being found on the system: this is reported via Cannot_open_dynamic_library (the enclosed exception may be platform-specific).

    val error_message : error -> string

    Convert an error description to a printable message.

    diff --git a/ocaml/Effect_analysis/index.html b/ocaml/Effect_analysis/index.html new file mode 100644 index 0000000..c519c56 --- /dev/null +++ b/ocaml/Effect_analysis/index.html @@ -0,0 +1,2 @@ + +Effect_analysis (ocaml.Effect_analysis)

    Module Effect_analysis

    Simple side effect analysis.

    val no_effects : Flambda.t -> bool

    Conservative approximation as to whether a given Flambda expression may have any side effects.

    val no_effects_named : Flambda.named -> bool
    diff --git a/ocaml/Emit/index.html b/ocaml/Emit/index.html new file mode 100644 index 0000000..98f3e77 --- /dev/null +++ b/ocaml/Emit/index.html @@ -0,0 +1,2 @@ + +Emit (ocaml.Emit)

    Module Emit

    val fundecl : Linear.fundecl -> unit
    val data : Cmm.data_item list -> unit
    val begin_assembly : unit -> unit
    val end_assembly : unit -> unit
    diff --git a/ocaml/Emitaux/index.html b/ocaml/Emitaux/index.html new file mode 100644 index 0000000..f76cd12 --- /dev/null +++ b/ocaml/Emitaux/index.html @@ -0,0 +1,11 @@ + +Emitaux (ocaml.Emitaux)

    Module Emitaux

    val output_channel : out_channel ref
    val emit_string : string -> unit
    val emit_int : int -> unit
    val emit_nativeint : nativeint -> unit
    val emit_int32 : int32 -> unit
    val emit_symbol : string -> unit
    val emit_printf : ('a, out_channel, unit) format -> 'a
    val emit_char : char -> unit
    val emit_string_literal : string -> unit
    val emit_string_directive : string -> string -> unit
    val emit_bytes_directive : string -> string -> unit
    val emit_float64_directive : string -> int64 -> unit
    val emit_float64_split_directive : string -> int64 -> unit
    val emit_float32_directive : string -> int32 -> unit
    val reset : unit -> unit
    val reset_debug_info : unit -> unit
    val emit_debug_info : Debuginfo.t -> unit
    val emit_debug_info_gen : + Debuginfo.t -> + (file_num:int -> file_name:string -> unit) -> + (file_num:int -> line:int -> col:int -> unit) -> + unit
    type frame_debuginfo =
    1. | Dbg_alloc of Debuginfo.alloc_dbginfo
    2. | Dbg_raise of Debuginfo.t
    3. | Dbg_other of Debuginfo.t
    val record_frame_descr : + label:int -> + frame_size:int -> + live_offset:int list -> + frame_debuginfo -> + unit
    type emit_frame_actions = {
    1. efa_code_label : int -> unit;
    2. efa_data_label : int -> unit;
    3. efa_8 : int -> unit;
    4. efa_16 : int -> unit;
    5. efa_32 : int32 -> unit;
    6. efa_word : int -> unit;
    7. efa_align : int -> unit;
    8. efa_label_rel : int -> int32 -> unit;
    9. efa_def_label : int -> unit;
    10. efa_string : string -> unit;
    }
    val emit_frames : emit_frame_actions -> unit
    val is_generic_function : string -> bool
    val cfi_startproc : unit -> unit
    val cfi_endproc : unit -> unit
    val cfi_adjust_cfa_offset : int -> unit
    val cfi_offset : reg:int -> offset:int -> unit
    val cfi_def_cfa_offset : int -> unit
    val cfi_remember_state : unit -> unit
    val cfi_restore_state : unit -> unit
    val cfi_def_cfa_register : reg:int -> unit
    val binary_backend_available : bool ref

    Is a binary backend available. If yes, we don't need to generate the textual assembly file (unless the user request it with -S).

    val create_asm_file : bool ref

    Are we actually generating the textual assembly file?

    type error =
    1. | Stack_frame_too_large of int
    exception Error of error
    val report_error : Stdlib.Format.formatter -> error -> unit
    diff --git a/ocaml/Emitcode/index.html b/ocaml/Emitcode/index.html new file mode 100644 index 0000000..4a2131a --- /dev/null +++ b/ocaml/Emitcode/index.html @@ -0,0 +1,23 @@ + +Emitcode (ocaml.Emitcode)

    Module Emitcode

    val to_file : + out_channel -> + Unit_info.Artifact.t -> + required_globals:Ident.Set.t -> + Instruct.instruction list -> + unit
    val to_packed_file : + out_channel -> + Instruct.instruction list -> + int + * (Cmo_format.reloc_info * int) list + * Instruct.debug_event list + * Misc.Stdlib.String.Set.t
    val marshal_to_channel_with_possibly_32bit_compat : + filename:string -> + kind:string -> + out_channel -> + 'a -> + unit
    diff --git a/ocaml/Emitenv/index.html b/ocaml/Emitenv/index.html new file mode 100644 index 0000000..3fcdfd1 --- /dev/null +++ b/ocaml/Emitenv/index.html @@ -0,0 +1,2 @@ + +Emitenv (ocaml.Emitenv)

    Module Emitenv

    type label = Linear.label
    type gc_call = {
    1. gc_lbl : label;
    2. gc_return_lbl : label;
    3. gc_frame_lbl : label;
    }
    type bound_error_call = {
    1. bd_lbl : label;
    2. bd_frame : label;
    }
    type float_literal = {
    1. fl : int64;
    2. lbl : label;
    }
    type int_literal = {
    1. n : nativeint;
    2. n_lbl : label;
    }
    type offset_computation = {
    1. lbl : label;
    2. dst : label;
    3. src : label;
    }
    type gotrel_literal = {
    1. lbl_got : label;
    2. lbl_pic : label;
    }
    type symbol_literal = {
    1. sym : string;
    2. lbl : label;
    }
    type per_function_env = {
    1. f : Linear.fundecl;
    2. mutable stack_offset : int;
    3. mutable call_gc_sites : gc_call list;
    4. mutable call_gc_label : label;
    5. mutable bound_error_sites : bound_error_call list;
    6. mutable bound_error_call : label option;
    7. mutable jumptables_lbl : label option;
    8. mutable jumptables : label list;
    9. mutable float_literals : float_literal list;
    10. mutable int_literals : int_literal list;
    }
    diff --git a/ocaml/Env/index.html b/ocaml/Env/index.html new file mode 100644 index 0000000..4b8916b --- /dev/null +++ b/ocaml/Env/index.html @@ -0,0 +1,313 @@ + +Env (ocaml.Env)

    Module Env

    type value_unbound_reason =
    1. | Val_unbound_instance_variable
    2. | Val_unbound_self
    3. | Val_unbound_ancestor
    4. | Val_unbound_ghost_recursive of Location.t
    type module_unbound_reason =
    1. | Mod_unbound_illegal_recursion
    type summary =
    1. | Env_empty
    2. | Env_value of summary * Ident.t * Types.value_description
    3. | Env_type of summary * Ident.t * Types.type_declaration
    4. | Env_extension of summary * Ident.t * Types.extension_constructor
    5. | Env_module of summary + * Ident.t + * Types.module_presence + * Types.module_declaration
    6. | Env_modtype of summary * Ident.t * Types.modtype_declaration
    7. | Env_class of summary * Ident.t * Types.class_declaration
    8. | Env_cltype of summary * Ident.t * Types.class_type_declaration
    9. | Env_open of summary * Path.t
      (*

      The string set argument of Env_open represents a list of module names to skip, i.e. that won't be imported in the toplevel namespace.

      *)
    10. | Env_functor_arg of summary * Ident.t
    11. | Env_constraints of summary * Types.type_declaration Path.Map.t
    12. | Env_copy_types of summary
    13. | Env_persistent of summary * Ident.t
    14. | Env_value_unbound of summary * string * value_unbound_reason
    15. | Env_module_unbound of summary * string * module_unbound_reason
    type address =
    1. | Aident of Ident.t
    2. | Adot of address * int
    type t
    val empty : t
    val initial : t
    val diff : t -> t -> Ident.t list
    val same_type_declarations : t -> t -> bool
    type type_descriptions = type_descr_kind
    type iter_cont
    val iter_types : + (Path.t -> (Path.t * Types.type_declaration) -> unit) -> + t -> + iter_cont
    val run_iter_cont : iter_cont list -> (Path.t * iter_cont) list
    val same_types : t -> t -> bool
    val used_persistent : unit -> Misc.Stdlib.String.Set.t
    val find_shadowed_types : Path.t -> t -> Path.t list
    val without_cmis : ('a -> 'b) -> 'a -> 'b
    val find_value : Path.t -> t -> Types.value_description
    val find_type : Path.t -> t -> Types.type_declaration
    val find_type_descrs : Path.t -> t -> type_descriptions
    val find_module : Path.t -> t -> Types.module_declaration
    val find_modtype : Path.t -> t -> Types.modtype_declaration
    val find_class : Path.t -> t -> Types.class_declaration
    val find_cltype : Path.t -> t -> Types.class_type_declaration
    val find_strengthened_module : + aliasable:bool -> + Path.t -> + t -> + Types.module_type
    val find_ident_constructor : Ident.t -> t -> Types.constructor_description
    val find_ident_label : Ident.t -> t -> Types.label_description
    val find_type_expansion : + Path.t -> + t -> + Types.type_expr list * Types.type_expr * int
    val find_type_expansion_opt : + Path.t -> + t -> + Types.type_expr list * Types.type_expr * int
    val find_modtype_expansion : Path.t -> t -> Types.module_type
    val find_modtype_expansion_lazy : Path.t -> t -> Subst.Lazy.modtype
    val find_hash_type : Path.t -> t -> Types.type_declaration
    val find_value_address : Path.t -> t -> address
    val find_module_address : Path.t -> t -> address
    val find_class_address : Path.t -> t -> address
    val find_constructor_address : Path.t -> t -> address
    val shape_of_path : + namespace:Shape.Sig_component_kind.t -> + t -> + Path.t -> + Shape.t
    val add_functor_arg : Ident.t -> t -> t
    val is_functor_arg : Path.t -> t -> bool
    val normalize_module_path : Location.t option -> t -> Path.t -> Path.t
    val normalize_type_path : Location.t option -> t -> Path.t -> Path.t
    val normalize_value_path : Location.t option -> t -> Path.t -> Path.t
    val normalize_modtype_path : t -> Path.t -> Path.t
    val reset_required_globals : unit -> unit
    val get_required_globals : unit -> Ident.t list
    val add_required_global : Ident.t -> unit
    val has_local_constraints : t -> bool
    val mark_value_used : Types.Uid.t -> unit
    val mark_module_used : Types.Uid.t -> unit
    val mark_type_used : Types.Uid.t -> unit
    type constructor_usage =
    1. | Positive
    2. | Pattern
    3. | Exported_private
    4. | Exported
    val mark_constructor_used : + constructor_usage -> + Types.constructor_declaration -> + unit
    val mark_extension_used : + constructor_usage -> + Types.extension_constructor -> + unit
    type label_usage =
    1. | Projection
    2. | Mutation
    3. | Construct
    4. | Exported_private
    5. | Exported
    val mark_label_used : label_usage -> Types.label_declaration -> unit
    type unbound_value_hint =
    1. | No_hint
    2. | Missing_rec of Location.t
    type lookup_error =
    1. | Unbound_value of Longident.t * unbound_value_hint
    2. | Unbound_type of Longident.t
    3. | Unbound_constructor of Longident.t
    4. | Unbound_label of Longident.t
    5. | Unbound_module of Longident.t
    6. | Unbound_class of Longident.t
    7. | Unbound_modtype of Longident.t
    8. | Unbound_cltype of Longident.t
    9. | Unbound_instance_variable of string
    10. | Not_an_instance_variable of string
    11. | Masked_instance_variable of Longident.t
    12. | Masked_self_variable of Longident.t
    13. | Masked_ancestor_variable of Longident.t
    14. | Structure_used_as_functor of Longident.t
    15. | Abstract_used_as_functor of Longident.t
    16. | Functor_used_as_structure of Longident.t
    17. | Abstract_used_as_structure of Longident.t
    18. | Generative_used_as_applicative of Longident.t
    19. | Illegal_reference_to_recursive_module
    20. | Cannot_scrape_alias of Longident.t * Path.t
    val lookup_error : Location.t -> t -> lookup_error -> 'a
    val lookup_value : + ?use:bool -> + loc:Location.t -> + Longident.t -> + t -> + Path.t * Types.value_description
    val lookup_type : + ?use:bool -> + loc:Location.t -> + Longident.t -> + t -> + Path.t * Types.type_declaration
    val lookup_module : + ?use:bool -> + loc:Location.t -> + Longident.t -> + t -> + Path.t * Types.module_declaration
    val lookup_modtype : + ?use:bool -> + loc:Location.t -> + Longident.t -> + t -> + Path.t * Types.modtype_declaration
    val lookup_class : + ?use:bool -> + loc:Location.t -> + Longident.t -> + t -> + Path.t * Types.class_declaration
    val lookup_cltype : + ?use:bool -> + loc:Location.t -> + Longident.t -> + t -> + Path.t * Types.class_type_declaration
    val lookup_module_path : + ?use:bool -> + loc:Location.t -> + load:bool -> + Longident.t -> + t -> + Path.t
    val lookup_modtype_path : + ?use:bool -> + loc:Location.t -> + Longident.t -> + t -> + Path.t
    val lookup_constructor : + ?use:bool -> + loc:Location.t -> + constructor_usage -> + Longident.t -> + t -> + Types.constructor_description
    val lookup_all_constructors : + ?use:bool -> + loc:Location.t -> + constructor_usage -> + Longident.t -> + t -> + ((Types.constructor_description * (unit -> unit)) list, + Location.t * t * lookup_error) + result
    val lookup_all_constructors_from_type : + ?use:bool -> + loc:Location.t -> + constructor_usage -> + Path.t -> + t -> + (Types.constructor_description * (unit -> unit)) list
    val lookup_label : + ?use:bool -> + loc:Location.t -> + label_usage -> + Longident.t -> + t -> + Types.label_description
    val lookup_all_labels : + ?use:bool -> + loc:Location.t -> + label_usage -> + Longident.t -> + t -> + ((Types.label_description * (unit -> unit)) list, + Location.t * t * lookup_error) + result
    val lookup_all_labels_from_type : + ?use:bool -> + loc:Location.t -> + label_usage -> + Path.t -> + t -> + (Types.label_description * (unit -> unit)) list
    val lookup_instance_variable : + ?use:bool -> + loc:Location.t -> + string -> + t -> + Path.t * Asttypes.mutable_flag * string * Types.type_expr
    val find_value_by_name : Longident.t -> t -> Path.t * Types.value_description
    val find_type_by_name : Longident.t -> t -> Path.t * Types.type_declaration
    val find_module_by_name : Longident.t -> t -> Path.t * Types.module_declaration
    val find_modtype_by_name : + Longident.t -> + t -> + Path.t * Types.modtype_declaration
    val find_class_by_name : Longident.t -> t -> Path.t * Types.class_declaration
    val find_cltype_by_name : + Longident.t -> + t -> + Path.t * Types.class_type_declaration
    val find_constructor_by_name : + Longident.t -> + t -> + Types.constructor_description
    val find_label_by_name : Longident.t -> t -> Types.label_description
    val find_value_index : Ident.t -> t -> int option

    The find_*_index functions computes a "namespaced" De Bruijn index of an identifier in a given environment. In other words, it returns how many times an identifier has been shadowed by a more recent identifiers with the same name in a given environment. Those functions return None when the identifier is not bound in the environment. This behavior is there to facilitate the detection of inconsistent printing environment, but should disappear in the long term.

    val find_type_index : Ident.t -> t -> int option
    val find_module_index : Ident.t -> t -> int option
    val find_modtype_index : Ident.t -> t -> int option
    val find_class_index : Ident.t -> t -> int option
    val find_cltype_index : Ident.t -> t -> int option
    val bound_value : string -> t -> bool
    val bound_module : string -> t -> bool
    val bound_type : string -> t -> bool
    val bound_modtype : string -> t -> bool
    val bound_class : string -> t -> bool
    val bound_cltype : string -> t -> bool
    val make_copy_of_types : t -> t -> t
    val add_value : + ?check:(string -> Warnings.t) -> + Ident.t -> + Types.value_description -> + t -> + t
    val add_type : + check:bool -> + ?shape:Shape.t -> + Ident.t -> + Types.type_declaration -> + t -> + t
    val add_extension : + check:bool -> + ?shape:Shape.t -> + rebind:bool -> + Ident.t -> + Types.extension_constructor -> + t -> + t
    val add_module : + ?arg:bool -> + ?shape:Shape.t -> + Ident.t -> + Types.module_presence -> + Types.module_type -> + t -> + t
    val add_module_lazy : + update_summary:bool -> + Ident.t -> + Types.module_presence -> + Subst.Lazy.modtype -> + t -> + t
    val add_module_declaration : + ?arg:bool -> + ?shape:Shape.t -> + check:bool -> + Ident.t -> + Types.module_presence -> + Types.module_declaration -> + t -> + t
    val add_module_declaration_lazy : + update_summary:bool -> + Ident.t -> + Types.module_presence -> + Subst.Lazy.module_decl -> + t -> + t
    val add_modtype : Ident.t -> Types.modtype_declaration -> t -> t
    val add_modtype_lazy : + update_summary:bool -> + Ident.t -> + Subst.Lazy.modtype_declaration -> + t -> + t
    val add_class : Ident.t -> Types.class_declaration -> t -> t
    val add_cltype : Ident.t -> Types.class_type_declaration -> t -> t
    val add_local_constraint : Path.t -> Types.type_declaration -> t -> t
    val add_persistent_structure : Ident.t -> t -> t
    val persistent_structures_of_dir : Load_path.Dir.t -> Misc.Stdlib.String.Set.t
    val filter_non_loaded_persistent : (Ident.t -> bool) -> t -> t
    val add_signature : Types.signature -> t -> t
    val open_signature : + ?used_slot:bool ref -> + ?loc:Location.t -> + ?toplevel:bool -> + Asttypes.override_flag -> + Path.t -> + t -> + (t, [ `Not_found | `Functor ]) result
    val open_pers_signature : string -> t -> (t, [ `Not_found ]) result
    val remove_last_open : Path.t -> t -> t option
    val enter_value : + ?check:(string -> Warnings.t) -> + string -> + Types.value_description -> + t -> + Ident.t * t
    val enter_type : + scope:int -> + string -> + Types.type_declaration -> + t -> + Ident.t * t
    val enter_extension : + scope:int -> + rebind:bool -> + string -> + Types.extension_constructor -> + t -> + Ident.t * t
    val enter_module : + scope:int -> + ?arg:bool -> + string -> + Types.module_presence -> + Types.module_type -> + t -> + Ident.t * t
    val enter_module_declaration : + scope:int -> + ?arg:bool -> + ?shape:Shape.t -> + string -> + Types.module_presence -> + Types.module_declaration -> + t -> + Ident.t * t
    val enter_modtype : + scope:int -> + string -> + Types.modtype_declaration -> + t -> + Ident.t * t
    val enter_class : + scope:int -> + string -> + Types.class_declaration -> + t -> + Ident.t * t
    val enter_cltype : + scope:int -> + string -> + Types.class_type_declaration -> + t -> + Ident.t * t
    val enter_signature : + ?mod_shape:Shape.t -> + scope:int -> + Types.signature -> + t -> + Types.signature * t
    val enter_signature_and_shape : + scope:int -> + parent_shape:Shape.Map.t -> + Shape.t -> + Types.signature -> + t -> + Types.signature * Shape.Map.t * t
    val enter_unbound_value : string -> value_unbound_reason -> t -> t
    val enter_unbound_module : string -> module_unbound_reason -> t -> t
    val reset_cache : unit -> unit
    val reset_cache_toplevel : unit -> unit
    val set_unit_name : string -> unit
    val get_unit_name : unit -> string
    val read_signature : Unit_info.Artifact.t -> Types.signature
    val save_signature : + alerts:Misc.alerts -> + Types.signature -> + Unit_info.Artifact.t -> + Cmi_format.cmi_infos
    val save_signature_with_imports : + alerts:Misc.alerts -> + Types.signature -> + Unit_info.Artifact.t -> + Misc.crcs -> + Cmi_format.cmi_infos
    val crc_of_unit : Misc.modname -> Stdlib.Digest.t
    val imports : unit -> Misc.crcs
    val import_crcs : source:string -> Misc.crcs -> unit
    val is_imported_opaque : Misc.modname -> bool
    val register_import_as_opaque : Misc.modname -> unit
    val summary : t -> summary
    val keep_only_summary : t -> t
    val env_of_only_summary : (summary -> Subst.t -> t) -> t -> t
    type error =
    1. | Missing_module of Location.t * Path.t * Path.t
    2. | Illegal_value_name of Location.t * string
    3. | Lookup_error of Location.t * t * lookup_error
    exception Error of error
    val report_error : Stdlib.Format.formatter -> error -> unit
    val report_lookup_error : + Location.t -> + t -> + Stdlib.Format.formatter -> + lookup_error -> + unit
    val in_signature : bool -> t -> t
    val is_in_signature : t -> bool
    val set_value_used_callback : Types.value_description -> (unit -> unit) -> unit
    val set_type_used_callback : + Types.type_declaration -> + ((unit -> unit) -> unit) -> + unit
    val check_functor_application : + (errors:bool -> + loc:Location.t -> + lid_whole_app:Longident.t -> + f0_path:Path.t -> + args:(Path.t * Types.module_type) list -> + arg_path:Path.t -> + arg_mty:Types.module_type -> + param_mty:Types.module_type -> + t -> + unit) + ref
    val check_well_formed_module : + (t -> Location.t -> string -> Types.module_type -> unit) ref
    val add_delayed_check_forward : ((unit -> unit) -> unit) ref
    val strengthen : + (aliasable:bool -> + t -> + Subst.Lazy.modtype -> + Path.t -> + Subst.Lazy.modtype) + ref
    val same_constr : (t -> Types.type_expr -> Types.type_expr -> bool) ref
    val print_longident : (Stdlib.Format.formatter -> Longident.t -> unit) ref
    val print_path : (Stdlib.Format.formatter -> Path.t -> unit) ref

    Folds

    val fold_values : + (string -> Path.t -> Types.value_description -> 'a -> 'a) -> + Longident.t option -> + t -> + 'a -> + 'a
    val fold_types : + (string -> Path.t -> Types.type_declaration -> 'a -> 'a) -> + Longident.t option -> + t -> + 'a -> + 'a
    val fold_constructors : + (Types.constructor_description -> 'a -> 'a) -> + Longident.t option -> + t -> + 'a -> + 'a
    val fold_labels : + (Types.label_description -> 'a -> 'a) -> + Longident.t option -> + t -> + 'a -> + 'a
    val fold_modules : + (string -> Path.t -> Types.module_declaration -> 'a -> 'a) -> + Longident.t option -> + t -> + 'a -> + 'a

    Persistent structures are only traversed if they are already loaded.

    val fold_modtypes : + (string -> Path.t -> Types.modtype_declaration -> 'a -> 'a) -> + Longident.t option -> + t -> + 'a -> + 'a
    val fold_classes : + (string -> Path.t -> Types.class_declaration -> 'a -> 'a) -> + Longident.t option -> + t -> + 'a -> + 'a
    val fold_cltypes : + (string -> Path.t -> Types.class_type_declaration -> 'a -> 'a) -> + Longident.t option -> + t -> + 'a -> + 'a
    val scrape_alias : t -> Types.module_type -> Types.module_type

    Utilities

    val check_value_name : string -> Location.t -> unit
    val print_address : Stdlib.Format.formatter -> address -> unit
    diff --git a/ocaml/Envaux/index.html b/ocaml/Envaux/index.html new file mode 100644 index 0000000..5d18f19 --- /dev/null +++ b/ocaml/Envaux/index.html @@ -0,0 +1,2 @@ + +Envaux (ocaml.Envaux)

    Module Envaux

    val env_from_summary : Env.summary -> Subst.t -> Env.t
    val reset_cache : unit -> unit
    val env_of_only_summary : Env.t -> Env.t
    type error =
    1. | Module_not_found of Path.t
    exception Error of error
    val report_error : Stdlib.Format.formatter -> error -> unit
    diff --git a/ocaml/Errors/index.html b/ocaml/Errors/index.html new file mode 100644 index 0000000..e7177d5 --- /dev/null +++ b/ocaml/Errors/index.html @@ -0,0 +1,2 @@ + +Errors (ocaml.Errors)

    Module Errors

    val report_error : Stdlib.Format.formatter -> exn -> unit
    diff --git a/ocaml/Errortrace/Subtype/index.html b/ocaml/Errortrace/Subtype/index.html new file mode 100644 index 0000000..323ba29 --- /dev/null +++ b/ocaml/Errortrace/Subtype/index.html @@ -0,0 +1,5 @@ + +Subtype (ocaml.Errortrace.Subtype)

    Module Errortrace.Subtype

    type 'a elt =
    1. | Diff of 'a diff
    type 'a t = 'a elt list

    Just as outside Subtype, we split traces, completed traces, and complete errors. However, in a minor asymmetry, the name Subtype.error_trace corresponds to the outside error type, and Subtype.error corresponds to the outside *_error types (e.g., unification_error). This error type has the invariant that the subtype trace is nonempty; note that no such invariant is imposed on the unification trace.

    type trace = Types.type_expr t
    type error_trace = expanded_type t
    type unification_error_trace = unification error

    To avoid shadowing

    type nonrec error = private {
    1. trace : error_trace;
    2. unification_trace : unification error;
    }
    val error : + trace:error_trace -> + unification_trace:unification_error_trace -> + error
    val map : ('a -> 'b) -> 'a t -> 'b t
    diff --git a/ocaml/Errortrace/index.html b/ocaml/Errortrace/index.html new file mode 100644 index 0000000..4ae5da0 --- /dev/null +++ b/ocaml/Errortrace/index.html @@ -0,0 +1,11 @@ + +Errortrace (ocaml.Errortrace)

    Module Errortrace

    type position =
    1. | First
    2. | Second
    val swap_position : position -> position
    val print_pos : Stdlib.Format.formatter -> position -> unit
    type expanded_type = {
    1. ty : Types.type_expr;
    2. expanded : Types.type_expr;
    }
    val trivial_expansion : Types.type_expr -> expanded_type

    trivial_expansion ty creates an expanded_type whose expansion is also ty. Usually, you want Ctype.expand_type instead, since the expansion carries useful information; however, in certain circumstances, the error is about the expansion of the type, meaning that actually performing the expansion produces more confusing or inaccurate output.

    type 'a diff = {
    1. got : 'a;
    2. expected : 'a;
    }
    val map_diff : ('a -> 'b) -> 'a diff -> 'b diff

    map_diff f {expected;got} is {expected=f expected; got=f got}

    type 'a escape_kind =
    1. | Constructor of Path.t
    2. | Univ of Types.type_expr
    3. | Self
    4. | Module_type of Path.t
    5. | Equation of 'a
    6. | Constraint

    Scope escape related errors

    type 'a escape = {
    1. kind : 'a escape_kind;
    2. context : Types.type_expr option;
    }
    val map_escape : ('a -> 'b) -> 'a escape -> 'b escape
    val explain : 'a list -> (prev:'a option -> 'a -> 'b option) -> 'b option
    type unification = private
    1. | Unification

    Type indices

    type comparison = private
    1. | Comparison
    type fixed_row_case =
    1. | Cannot_be_closed
    2. | Cannot_add_tags of string list
    type 'variety variant =
    1. | Incompatible_types_for : string -> _ variant
    2. | No_tags : position * (Asttypes.label * Types.row_field) list -> _ variant
    3. | No_intersection : unification variant
    4. | Fixed_row : position + * fixed_row_case + * Types.fixed_explanation -> unification variant
    5. | Presence_not_guaranteed_for : position * string -> comparison variant
    6. | Openness : position -> comparison variant
    type 'variety obj =
    1. | Missing_field : position * string -> _ obj
    2. | Abstract_row : position -> _ obj
    3. | Self_cannot_be_closed : unification obj
    type ('a, 'variety) elt =
    1. | Diff : 'a diff -> ('a, _) elt
    2. | Variant : 'variety variant -> ('a, 'variety) elt
    3. | Obj : 'variety obj -> ('a, 'variety) elt
    4. | Escape : 'a escape -> ('a, _) elt
    5. | Incompatible_fields : {
      1. name : string;
      2. diff : Types.type_expr diff;
      } -> ('a, _) elt
    6. | Rec_occur : Types.type_expr * Types.type_expr -> ('a, _) elt
    type ('a, 'variety) t = ('a, 'variety) elt list
    type 'variety trace = (Types.type_expr, 'variety) t
    type 'variety error = (expanded_type, 'variety) t
    val map : ('a -> 'b) -> ('a, 'variety) t -> ('b, 'variety) t
    val incompatible_fields : + name:string -> + got:Types.type_expr -> + expected:Types.type_expr -> + (Types.type_expr, _) elt
    val swap_trace : ('a, 'variety) t -> ('a, 'variety) t

    The traces ('variety t) are the core error types. However, we bundle them up into three "top-level" error types, which are used elsewhere: unification_error, equality_error, and moregen_error. In the case of equality_error, this has to bundle in extra information; in general, it distinguishes the three types of errors and allows us to distinguish traces that are being built (or processed) from those that are complete and have become the final error. These error types have the invariants that their traces are nonempty; we ensure that through three smart constructors with matching names.

    type unification_error = private {
    1. trace : unification error;
    }
    type equality_error = private {
    1. trace : comparison error;
    2. subst : (Types.type_expr * Types.type_expr) list;
    }
    type moregen_error = private {
    1. trace : comparison error;
    }
    val unification_error : trace:unification error -> unification_error
    val equality_error : + trace:comparison error -> + subst:(Types.type_expr * Types.type_expr) list -> + equality_error
    val moregen_error : trace:comparison error -> moregen_error
    type comparison_error =
    1. | Equality_error of equality_error
    2. | Moregen_error of moregen_error

    Wraps up the two different kinds of comparison errors in one type

    val swap_unification_error : unification_error -> unification_error

    Lift swap_trace to unification_error

    module Subtype : sig ... end
    diff --git a/ocaml/Event/index.html b/ocaml/Event/index.html new file mode 100644 index 0000000..aa42176 --- /dev/null +++ b/ocaml/Event/index.html @@ -0,0 +1,2 @@ + +Event (ocaml.Event)

    Module Event

    First-class synchronous communication.

    This module implements synchronous inter-thread communications over channels. As in John Reppy's Concurrent ML system, the communication events are first-class values: they can be built and combined independently before being offered for communication.

    type 'a channel

    The type of communication channels carrying values of type 'a.

    val new_channel : unit -> 'a channel

    Return a new channel.

    type +'a event

    The type of communication events returning a result of type 'a.

    val send : 'a channel -> 'a -> unit event

    send ch v returns the event consisting in sending the value v over the channel ch. The result value of this event is ().

    val receive : 'a channel -> 'a event

    receive ch returns the event consisting in receiving a value from the channel ch. The result value of this event is the value received.

    val always : 'a -> 'a event

    always v returns an event that is always ready for synchronization. The result value of this event is v.

    val choose : 'a event list -> 'a event

    choose evl returns the event that is the alternative of all the events in the list evl.

    val wrap : 'a event -> ('a -> 'b) -> 'b event

    wrap ev fn returns the event that performs the same communications as ev, then applies the post-processing function fn on the return value.

    val wrap_abort : 'a event -> (unit -> unit) -> 'a event

    wrap_abort ev fn returns the event that performs the same communications as ev, but if it is not selected the function fn is called after the synchronization.

    val guard : (unit -> 'a event) -> 'a event

    guard fn returns the event that, when synchronized, computes fn() and behaves as the resulting event. This enables computing events with side-effects at the time of the synchronization operation.

    val sync : 'a event -> 'a

    'Synchronize' on an event: offer all the communication possibilities specified in the event to the outside world, and block until one of the communications succeed. The result value of that communication is returned.

    val select : 'a event list -> 'a

    'Synchronize' on an alternative of events. select evl is shorthand for sync(choose evl).

    val poll : 'a event -> 'a option

    Non-blocking version of Event.sync: offer all the communication possibilities specified in the event to the outside world, and if one can take place immediately, perform it and return Some r where r is the result value of that communication. Otherwise, return None without blocking.

    diff --git a/ocaml/Export_id/Map/index.html b/ocaml/Export_id/Map/index.html new file mode 100644 index 0000000..a3d1508 --- /dev/null +++ b/ocaml/Export_id/Map/index.html @@ -0,0 +1,17 @@ + +Map (ocaml.Export_id.Map)

    Module Export_id.Map

    include Map.S with type key = T.t and type 'a t = 'a Map.Make(T).t

    Maps

    type key = T.t

    The type of the map keys.

    type 'a t = 'a Stdlib.Map.Make(T).t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key -> 'a -> 'a t -> 'a t

    add key data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key -> 'a -> 'a list t -> 'a list t

    add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

    update key f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : (key -> bool) -> 'a t -> key * 'a

    find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : (key -> bool) -> 'a t -> key * 'a

    find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : (key -> 'a -> unit) -> 'a t -> unit

    iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

    fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : (key -> 'a -> bool) -> 'a t -> 'a t

    filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : (key -> 'a -> bool) -> 'a t -> bool

    for_all f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : (key -> 'a -> bool) -> 'a t -> bool

    exists f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Stdlib.Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Stdlib.Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    val of_list : (key * 'a) list -> 'a t
    val disjoint_union : + ?eq:('a -> 'a -> bool) -> + ?print:(Stdlib.Format.formatter -> 'a -> unit) -> + 'a t -> + 'a t -> + 'a t

    disjoint_union m1 m2 contains all bindings from m1 and m2. If some binding is present in both and the associated value is not equal, a Fatal_error is raised

    val union_right : 'a t -> 'a t -> 'a t

    union_right m1 m2 contains all bindings from m1 and m2. If some binding is present in both, the one from m2 is taken

    val union_left : 'a t -> 'a t -> 'a t

    union_left m1 m2 = union_right m2 m1

    val union_merge : ('a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
    val rename : key t -> key -> key
    val map_keys : (key -> key) -> 'a t -> 'a t
    val keys : 'a t -> Stdlib.Set.Make(T).t
    val data : 'a t -> 'a list
    val of_set : (key -> 'a) -> Stdlib.Set.Make(T).t -> 'a t
    val transpose_keys_and_data : key t -> key t
    val transpose_keys_and_data_set : key t -> Stdlib.Set.Make(T).t t
    val print : + (Stdlib.Format.formatter -> 'a -> unit) -> + Stdlib.Format.formatter -> + 'a t -> + unit
    diff --git a/ocaml/Export_id/Set/index.html b/ocaml/Export_id/Set/index.html new file mode 100644 index 0000000..b8bc7cd --- /dev/null +++ b/ocaml/Export_id/Set/index.html @@ -0,0 +1,2 @@ + +Set (ocaml.Export_id.Set)

    Module Export_id.Set

    include Set.S with type elt = T.t and type t = Set.Make(T).t

    Sets

    type elt = T.t

    The type of the set elements.

    The type of sets.

    val empty : t

    The empty set.

    val add : elt -> t -> t

    add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val singleton : elt -> t

    singleton x returns the one-element set containing only x.

    val remove : elt -> t -> t

    remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val union : t -> t -> t

    Set union.

    val inter : t -> t -> t

    Set intersection.

    val disjoint : t -> t -> bool

    Test if two sets are disjoint.

    • since 4.08
    val diff : t -> t -> t

    Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

    val cardinal : t -> int

    Return the number of elements of a set.

    Elements

    val elements : t -> elt list

    Return the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Set.Make.

    val min_elt : t -> elt

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

    val min_elt_opt : t -> elt option

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

    • since 4.05
    val max_elt : t -> elt

    Same as min_elt, but returns the largest element of the given set.

    val max_elt_opt : t -> elt option

    Same as min_elt_opt, but returns the largest element of the given set.

    • since 4.05
    val choose : t -> elt

    Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    val choose_opt : t -> elt option

    Return one element of the given set, or None if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    • since 4.05

    Searching

    val find : elt -> t -> elt

    find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

    • since 4.01
    val find_opt : elt -> t -> elt option

    find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

    • since 4.05
    val find_first : (elt -> bool) -> t -> elt

    find_first f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

    For example, find_first (fun e -> Ord.compare e x >= 0) s will return the first element e of s where Ord.compare e x >= 0 (intuitively: e >= x), or raise Not_found if x is greater than any element of s.

    • since 4.05
    val find_first_opt : (elt -> bool) -> t -> elt option

    find_first_opt f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

    • since 4.05
    val find_last : (elt -> bool) -> t -> elt

    find_last f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

    • since 4.05
    val find_last_opt : (elt -> bool) -> t -> elt option

    find_last_opt f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

    • since 4.05

    Traversing

    val iter : (elt -> unit) -> t -> unit

    iter f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.

    val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc

    fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

    Transforming

    val filter : (elt -> bool) -> t -> t

    filter f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val filter_map : (elt -> elt option) -> t -> t

    filter_map f s returns the set of all v such that f x = Some v for some element x of s.

    For example,

    filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) s

    is the set of halves of the even elements of s.

    If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned unchanged: the result of the function is then physically equal to s.

    • since 4.11
    val partition : (elt -> bool) -> t -> t * t

    partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

    val split : elt -> t -> t * bool * t

    split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.

    Predicates and comparisons

    val is_empty : t -> bool

    Test whether a set is empty or not.

    val mem : elt -> t -> bool

    mem x s tests whether x belongs to the set s.

    val equal : t -> t -> bool

    equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

    val compare : t -> t -> int

    Total ordering between sets. Can be used as the ordering function for doing sets of sets.

    val subset : t -> t -> bool

    subset s1 s2 tests whether the set s1 is a subset of the set s2.

    val for_all : (elt -> bool) -> t -> bool

    for_all f s checks if all elements of the set satisfy the predicate f.

    val exists : (elt -> bool) -> t -> bool

    exists f s checks if at least one element of the set satisfies the predicate f.

    Converting

    val to_list : t -> elt list

    to_list s is elements s.

    • since 5.1
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t

    to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

    • since 4.07
    val to_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in ascending order

    • since 4.07
    val to_rev_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in descending order

    • since 4.12
    val add_seq : elt Stdlib.Seq.t -> t -> t

    Add the given elements to the set, in order.

    • since 4.07
    val of_seq : elt Stdlib.Seq.t -> t

    Build a set from the given bindings

    • since 4.07
    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    val to_string : t -> string
    val of_list : elt list -> t
    val map : (elt -> elt) -> t -> t
    diff --git a/ocaml/Export_id/T/index.html b/ocaml/Export_id/T/index.html new file mode 100644 index 0000000..68568f7 --- /dev/null +++ b/ocaml/Export_id/T/index.html @@ -0,0 +1,2 @@ + +T (ocaml.Export_id.T)

    Module Export_id.T

    type t = t
    include Hashtbl.HashedType with type t := t
    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val hash : t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := t
    val compare : t -> t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    diff --git a/ocaml/Export_id/Tbl/index.html b/ocaml/Export_id/Tbl/index.html new file mode 100644 index 0000000..0280f20 --- /dev/null +++ b/ocaml/Export_id/Tbl/index.html @@ -0,0 +1,2 @@ + +Tbl (ocaml.Export_id.Tbl)

    Module Export_id.Tbl

    include Hashtbl.S with type key = T.t and type 'a t = 'a Hashtbl.Make(T).t
    type key = T.t
    val create : int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    • since 4.00
    val copy : 'a t -> 'a t
    val add : 'a t -> key -> 'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    • since 4.05
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key -> 'a -> unit
    val mem : 'a t -> key -> bool
    val iter : (key -> 'a -> unit) -> 'a t -> unit
    val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
    • since 4.03
    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc
    val length : 'a t -> int
    val stats : 'a t -> Stdlib.Hashtbl.statistics
    • since 4.00
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
    • since 4.07
    val to_seq_keys : _ t -> key Stdlib.Seq.t
    • since 4.07
    val to_seq_values : 'a t -> 'a Stdlib.Seq.t
    • since 4.07
    val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
    • since 4.07
    val to_list : 'a t -> (T.t * 'a) list
    val of_list : (T.t * 'a) list -> 'a t
    val to_map : 'a t -> 'a Stdlib.Map.Make(T).t
    val of_map : 'a Stdlib.Map.Make(T).t -> 'a t
    val memoize : 'a t -> (key -> 'a) -> key -> 'a
    val map : 'a t -> ('a -> 'b) -> 'b t
    diff --git a/ocaml/Export_id/index.html b/ocaml/Export_id/index.html new file mode 100644 index 0000000..0f210fc --- /dev/null +++ b/ocaml/Export_id/index.html @@ -0,0 +1,2 @@ + +Export_id (ocaml.Export_id)

    Module Export_id

    include Identifiable.S
    type t
    module T : Identifiable.Thing with type t = t
    include Identifiable.Thing with type t := T.t
    include Hashtbl.HashedType with type t := T.t
    val equal : T.t -> T.t -> bool

    The equality predicate used to compare keys.

    val hash : T.t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := T.t
    val compare : T.t -> T.t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> T.t -> unit
    val print : Stdlib.Format.formatter -> T.t -> unit
    module Set : Identifiable.Set with module T := T
    module Map : Identifiable.Map with module T := T
    module Tbl : Identifiable.Tbl with module T := T
    val create : ?name:string -> Compilation_unit.t -> t
    val name : t -> string option
    val get_compilation_unit : t -> Compilation_unit.t
    diff --git a/ocaml/Export_info/index.html b/ocaml/Export_info/index.html new file mode 100644 index 0000000..a888432 --- /dev/null +++ b/ocaml/Export_info/index.html @@ -0,0 +1,34 @@ + +Export_info (ocaml.Export_info)

    Module Export_info

    Exported information (that is to say, information written into a .cmx file) about a compilation unit.

    type value_string_contents =
    1. | Contents of string
    2. | Unknown_or_mutable
    type value_string = {
    1. contents : value_string_contents;
    2. size : int;
    }
    type value_float_array_contents =
    1. | Contents of float option array
    2. | Unknown_or_mutable
    type value_float_array = {
    1. contents : value_float_array_contents;
    2. size : int;
    }
    type descr =
    1. | Value_block of Tag.t * approx array
    2. | Value_mutable_block of Tag.t * int
    3. | Value_int of int
    4. | Value_char of char
    5. | Value_float of float
    6. | Value_float_array of value_float_array
    7. | Value_boxed_int : 'a A.boxed_int * 'a -> descr
    8. | Value_string of value_string
    9. | Value_closure of value_closure
    10. | Value_set_of_closures of value_set_of_closures
    11. | Value_unknown_descr
    and value_closure = {
    1. closure_id : Closure_id.t;
    2. set_of_closures : value_set_of_closures;
    }
    and value_set_of_closures = {
    1. set_of_closures_id : Set_of_closures_id.t;
    2. bound_vars : approx Var_within_closure.Map.t;
    3. free_vars : Flambda.specialised_to Variable.Map.t;
    4. results : approx Closure_id.Map.t;
    5. aliased_symbol : Symbol.t option;
    }
    and approx =
    1. | Value_unknown
    2. | Value_id of Export_id.t
    3. | Value_symbol of Symbol.t
    type t = private {
    1. sets_of_closures : A.function_declarations Set_of_closures_id.Map.t;
      (*

      Code of exported functions indexed by set of closures IDs.

      *)
    2. values : descr Export_id.Map.t Compilation_unit.Map.t;
      (*

      Structure of exported values.

      *)
    3. symbol_id : Export_id.t Symbol.Map.t;
      (*

      Associates symbols and values.

      *)
    4. offset_fun : int Closure_id.Map.t;
      (*

      Positions of function pointers in their closures.

      *)
    5. offset_fv : int Var_within_closure.Map.t;
      (*

      Positions of value pointers in their closures.

      *)
    6. constant_closures : Closure_id.Set.t;
    7. invariant_params : Variable.Set.t Variable.Map.t Set_of_closures_id.Map.t;
    8. recursive : Variable.Set.t Set_of_closures_id.Map.t;
    }

    A structure that describes what a single compilation unit exports.

    type transient = private {
    1. sets_of_closures : A.function_declarations Set_of_closures_id.Map.t;
    2. values : descr Export_id.Map.t Compilation_unit.Map.t;
    3. symbol_id : Export_id.t Symbol.Map.t;
    4. invariant_params : Variable.Set.t Variable.Map.t Set_of_closures_id.Map.t;
    5. recursive : Variable.Set.t Set_of_closures_id.Map.t;
    6. relevant_local_closure_ids : Closure_id.Set.t;
    7. relevant_imported_closure_ids : Closure_id.Set.t;
    8. relevant_local_vars_within_closure : Var_within_closure.Set.t;
    9. relevant_imported_vars_within_closure : Var_within_closure.Set.t;
    }
    val empty : t

    Export information for a compilation unit that exports nothing.

    val opaque_transient : + compilation_unit:Compilation_unit.t -> + root_symbol:Symbol.t -> + transient
    val create : + sets_of_closures:A.function_declarations Set_of_closures_id.Map.t -> + values:descr Export_id.Map.t Compilation_unit.Map.t -> + symbol_id:Export_id.t Symbol.Map.t -> + offset_fun:int Closure_id.Map.t -> + offset_fv:int Var_within_closure.Map.t -> + constant_closures:Closure_id.Set.t -> + invariant_params:Variable.Set.t Variable.Map.t Set_of_closures_id.Map.t -> + recursive:Variable.Set.t Set_of_closures_id.Map.t -> + t

    Create a new export information structure.

    val create_transient : + sets_of_closures:A.function_declarations Set_of_closures_id.Map.t -> + values:descr Export_id.Map.t Compilation_unit.Map.t -> + symbol_id:Export_id.t Symbol.Map.t -> + invariant_params:Variable.Set.t Variable.Map.t Set_of_closures_id.Map.t -> + recursive:Variable.Set.t Set_of_closures_id.Map.t -> + relevant_local_closure_ids:Closure_id.Set.t -> + relevant_imported_closure_ids:Closure_id.Set.t -> + relevant_local_vars_within_closure:Var_within_closure.Set.t -> + relevant_imported_vars_within_closure:Var_within_closure.Set.t -> + transient
    val t_of_transient : + transient -> + program:Flambda.program -> + local_offset_fun:int Closure_id.Map.t -> + local_offset_fv:int Var_within_closure.Map.t -> + imported_offset_fun:int Closure_id.Map.t -> + imported_offset_fv:int Var_within_closure.Map.t -> + constant_closures:Closure_id.Set.t -> + t

    Record information about the layout of closures and which sets of closures are constant. These are all worked out during the Flambda_to_clambda pass.

    val merge : t -> t -> t

    Union of export information. Verifies that there are no identifier clashes.

    val find_description : t -> Export_id.t -> descr

    Look up the description of an exported value given its export ID.

    Partition a mapping from export IDs by compilation unit.

    diff --git a/ocaml/Export_info_for_pack/index.html b/ocaml/Export_info_for_pack/index.html new file mode 100644 index 0000000..8609c31 --- /dev/null +++ b/ocaml/Export_info_for_pack/index.html @@ -0,0 +1,6 @@ + +Export_info_for_pack (ocaml.Export_info_for_pack)

    Module Export_info_for_pack

    Transformations on export information that are only used for the building of packs.

    val import_for_pack : + pack_units:Compilation_unit.Set.t -> + pack:Compilation_unit.t -> + Export_info.t -> + Export_info.t

    Transform the information from exported to be suitable to be reexported as the information for a pack named pack containing units pack_units. It mainly changes symbols of units pack_units to refer to pack instead.

    val clear_import_state : unit -> unit

    Drops the state after importing several units in the same pack.

    diff --git a/ocaml/Expunge/index.html b/ocaml/Expunge/index.html new file mode 100644 index 0000000..74e1b07 --- /dev/null +++ b/ocaml/Expunge/index.html @@ -0,0 +1,2 @@ + +Expunge (ocaml.Expunge)

    Module Expunge

    val main : unit -> unit

    The entry point for expunge

    diff --git a/ocaml/Extract_projections/index.html b/ocaml/Extract_projections/index.html new file mode 100644 index 0000000..f1759bc --- /dev/null +++ b/ocaml/Extract_projections/index.html @@ -0,0 +1,6 @@ + +Extract_projections (ocaml.Extract_projections)

    Module Extract_projections

    Identify projections from variables used in function bodies (free variables or specialised args, for example, according to which_variables below). Projections from variables that are also used boxed are not returned.

    val from_function_decl : + env:Inline_and_simplify_aux.Env.t -> + which_variables:Flambda.specialised_to Variable.Map.t -> + function_decl:Flambda.function_declaration -> + Projection.Set.t

    which_variables maps (existing) inner variables to (existing) outer variables in the manner of free_vars and specialised_args in Flambda.set_of_closures.

    The returned projections are projecting_from (cf. projection.mli) the "existing inner vars".

    diff --git a/ocaml/Find_recursive_functions/index.html b/ocaml/Find_recursive_functions/index.html new file mode 100644 index 0000000..8ad2cdc --- /dev/null +++ b/ocaml/Find_recursive_functions/index.html @@ -0,0 +1,5 @@ + +Find_recursive_functions (ocaml.Find_recursive_functions)

    Module Find_recursive_functions

    "Recursive functions" are those functions f that might call either:

    • themselves, or
    • another function that in turn might call f.

    For example in the following simultaneous definition of f g and h, f and g are recursive functions, but not h: let rec f x = g x and g x = f x and h x = g x

    val in_function_declarations : + Flambda.function_declarations -> + backend:(module Backend_intf.S) -> + Variable.Set.t

    Determine the recursive functions, if any, bound by the given set of function declarations. This is only intended to be used by Flambda.create_function_declarations.

    diff --git a/ocaml/Flambda/Constant_defining_value/Map/index.html b/ocaml/Flambda/Constant_defining_value/Map/index.html new file mode 100644 index 0000000..e483599 --- /dev/null +++ b/ocaml/Flambda/Constant_defining_value/Map/index.html @@ -0,0 +1,17 @@ + +Map (ocaml.Flambda.Constant_defining_value.Map)

    Module Constant_defining_value.Map

    include Map.S with type key = T.t and type 'a t = 'a Map.Make(T).t

    Maps

    type key = T.t

    The type of the map keys.

    type 'a t = 'a Stdlib.Map.Make(T).t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key -> 'a -> 'a t -> 'a t

    add key data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key -> 'a -> 'a list t -> 'a list t

    add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

    update key f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : (key -> bool) -> 'a t -> key * 'a

    find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : (key -> bool) -> 'a t -> key * 'a

    find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : (key -> 'a -> unit) -> 'a t -> unit

    iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

    fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : (key -> 'a -> bool) -> 'a t -> 'a t

    filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : (key -> 'a -> bool) -> 'a t -> bool

    for_all f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : (key -> 'a -> bool) -> 'a t -> bool

    exists f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Stdlib.Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Stdlib.Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    val of_list : (key * 'a) list -> 'a t
    val disjoint_union : + ?eq:('a -> 'a -> bool) -> + ?print:(Stdlib.Format.formatter -> 'a -> unit) -> + 'a t -> + 'a t -> + 'a t

    disjoint_union m1 m2 contains all bindings from m1 and m2. If some binding is present in both and the associated value is not equal, a Fatal_error is raised

    val union_right : 'a t -> 'a t -> 'a t

    union_right m1 m2 contains all bindings from m1 and m2. If some binding is present in both, the one from m2 is taken

    val union_left : 'a t -> 'a t -> 'a t

    union_left m1 m2 = union_right m2 m1

    val union_merge : ('a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
    val rename : key t -> key -> key
    val map_keys : (key -> key) -> 'a t -> 'a t
    val keys : 'a t -> Stdlib.Set.Make(T).t
    val data : 'a t -> 'a list
    val of_set : (key -> 'a) -> Stdlib.Set.Make(T).t -> 'a t
    val transpose_keys_and_data : key t -> key t
    val transpose_keys_and_data_set : key t -> Stdlib.Set.Make(T).t t
    val print : + (Stdlib.Format.formatter -> 'a -> unit) -> + Stdlib.Format.formatter -> + 'a t -> + unit
    diff --git a/ocaml/Flambda/Constant_defining_value/Set/index.html b/ocaml/Flambda/Constant_defining_value/Set/index.html new file mode 100644 index 0000000..33b92db --- /dev/null +++ b/ocaml/Flambda/Constant_defining_value/Set/index.html @@ -0,0 +1,2 @@ + +Set (ocaml.Flambda.Constant_defining_value.Set)

    Module Constant_defining_value.Set

    include Set.S with type elt = T.t and type t = Set.Make(T).t

    Sets

    type elt = T.t

    The type of the set elements.

    The type of sets.

    val empty : t

    The empty set.

    val add : elt -> t -> t

    add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val singleton : elt -> t

    singleton x returns the one-element set containing only x.

    val remove : elt -> t -> t

    remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val union : t -> t -> t

    Set union.

    val inter : t -> t -> t

    Set intersection.

    val disjoint : t -> t -> bool

    Test if two sets are disjoint.

    • since 4.08
    val diff : t -> t -> t

    Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

    val cardinal : t -> int

    Return the number of elements of a set.

    Elements

    val elements : t -> elt list

    Return the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Set.Make.

    val min_elt : t -> elt

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

    val min_elt_opt : t -> elt option

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

    • since 4.05
    val max_elt : t -> elt

    Same as min_elt, but returns the largest element of the given set.

    val max_elt_opt : t -> elt option

    Same as min_elt_opt, but returns the largest element of the given set.

    • since 4.05
    val choose : t -> elt

    Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    val choose_opt : t -> elt option

    Return one element of the given set, or None if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    • since 4.05

    Searching

    val find : elt -> t -> elt

    find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

    • since 4.01
    val find_opt : elt -> t -> elt option

    find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

    • since 4.05
    val find_first : (elt -> bool) -> t -> elt

    find_first f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

    For example, find_first (fun e -> Ord.compare e x >= 0) s will return the first element e of s where Ord.compare e x >= 0 (intuitively: e >= x), or raise Not_found if x is greater than any element of s.

    • since 4.05
    val find_first_opt : (elt -> bool) -> t -> elt option

    find_first_opt f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

    • since 4.05
    val find_last : (elt -> bool) -> t -> elt

    find_last f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

    • since 4.05
    val find_last_opt : (elt -> bool) -> t -> elt option

    find_last_opt f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

    • since 4.05

    Traversing

    val iter : (elt -> unit) -> t -> unit

    iter f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.

    val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc

    fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

    Transforming

    val filter : (elt -> bool) -> t -> t

    filter f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val filter_map : (elt -> elt option) -> t -> t

    filter_map f s returns the set of all v such that f x = Some v for some element x of s.

    For example,

    filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) s

    is the set of halves of the even elements of s.

    If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned unchanged: the result of the function is then physically equal to s.

    • since 4.11
    val partition : (elt -> bool) -> t -> t * t

    partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

    val split : elt -> t -> t * bool * t

    split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.

    Predicates and comparisons

    val is_empty : t -> bool

    Test whether a set is empty or not.

    val mem : elt -> t -> bool

    mem x s tests whether x belongs to the set s.

    val equal : t -> t -> bool

    equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

    val compare : t -> t -> int

    Total ordering between sets. Can be used as the ordering function for doing sets of sets.

    val subset : t -> t -> bool

    subset s1 s2 tests whether the set s1 is a subset of the set s2.

    val for_all : (elt -> bool) -> t -> bool

    for_all f s checks if all elements of the set satisfy the predicate f.

    val exists : (elt -> bool) -> t -> bool

    exists f s checks if at least one element of the set satisfies the predicate f.

    Converting

    val to_list : t -> elt list

    to_list s is elements s.

    • since 5.1
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t

    to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

    • since 4.07
    val to_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in ascending order

    • since 4.07
    val to_rev_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in descending order

    • since 4.12
    val add_seq : elt Stdlib.Seq.t -> t -> t

    Add the given elements to the set, in order.

    • since 4.07
    val of_seq : elt Stdlib.Seq.t -> t

    Build a set from the given bindings

    • since 4.07
    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    val to_string : t -> string
    val of_list : elt list -> t
    val map : (elt -> elt) -> t -> t
    diff --git a/ocaml/Flambda/Constant_defining_value/T/index.html b/ocaml/Flambda/Constant_defining_value/T/index.html new file mode 100644 index 0000000..536661d --- /dev/null +++ b/ocaml/Flambda/Constant_defining_value/T/index.html @@ -0,0 +1,2 @@ + +T (ocaml.Flambda.Constant_defining_value.T)

    Module Constant_defining_value.T

    type t = t
    include Hashtbl.HashedType with type t := t
    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val hash : t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := t
    val compare : t -> t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    diff --git a/ocaml/Flambda/Constant_defining_value/Tbl/index.html b/ocaml/Flambda/Constant_defining_value/Tbl/index.html new file mode 100644 index 0000000..ca24f6c --- /dev/null +++ b/ocaml/Flambda/Constant_defining_value/Tbl/index.html @@ -0,0 +1,2 @@ + +Tbl (ocaml.Flambda.Constant_defining_value.Tbl)

    Module Constant_defining_value.Tbl

    include Hashtbl.S with type key = T.t and type 'a t = 'a Hashtbl.Make(T).t
    type key = T.t
    val create : int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    • since 4.00
    val copy : 'a t -> 'a t
    val add : 'a t -> key -> 'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    • since 4.05
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key -> 'a -> unit
    val mem : 'a t -> key -> bool
    val iter : (key -> 'a -> unit) -> 'a t -> unit
    val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
    • since 4.03
    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc
    val length : 'a t -> int
    val stats : 'a t -> Stdlib.Hashtbl.statistics
    • since 4.00
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
    • since 4.07
    val to_seq_keys : _ t -> key Stdlib.Seq.t
    • since 4.07
    val to_seq_values : 'a t -> 'a Stdlib.Seq.t
    • since 4.07
    val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
    • since 4.07
    val to_list : 'a t -> (T.t * 'a) list
    val of_list : (T.t * 'a) list -> 'a t
    val to_map : 'a t -> 'a Stdlib.Map.Make(T).t
    val of_map : 'a Stdlib.Map.Make(T).t -> 'a t
    val memoize : 'a t -> (key -> 'a) -> key -> 'a
    val map : 'a t -> ('a -> 'b) -> 'b t
    diff --git a/ocaml/Flambda/Constant_defining_value/index.html b/ocaml/Flambda/Constant_defining_value/index.html new file mode 100644 index 0000000..35b85c6 --- /dev/null +++ b/ocaml/Flambda/Constant_defining_value/index.html @@ -0,0 +1,2 @@ + +Constant_defining_value (ocaml.Flambda.Constant_defining_value)

    Module Flambda.Constant_defining_value

    module T : Identifiable.Thing with type t = t
    include Identifiable.Thing with type t := T.t
    include Hashtbl.HashedType with type t := T.t
    val equal : T.t -> T.t -> bool

    The equality predicate used to compare keys.

    val hash : T.t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := T.t
    val compare : T.t -> T.t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> T.t -> unit
    val print : Stdlib.Format.formatter -> T.t -> unit
    module Set : Identifiable.Set with module T := T
    module Map : Identifiable.Map with module T := T
    module Tbl : Identifiable.Tbl with module T := T
    diff --git a/ocaml/Flambda/With_free_variables/index.html b/ocaml/Flambda/With_free_variables/index.html new file mode 100644 index 0000000..ee3cac9 --- /dev/null +++ b/ocaml/Flambda/With_free_variables/index.html @@ -0,0 +1,2 @@ + +With_free_variables (ocaml.Flambda.With_free_variables)

    Module Flambda.With_free_variables

    A module for the manipulation of terms where the recomputation of free variable sets is to be kept to a minimum.

    type 'a t
    val of_defining_expr_of_let : let_expr -> named t

    O(1) time.

    val of_body_of_let : let_expr -> expr t

    O(1) time.

    val of_expr : expr -> expr t

    Takes the time required to calculate the free variables of the given term (proportional to the size of the term, except that the calculation for Let is O(1)).

    val of_named : named -> named t
    val create_let_reusing_defining_expr : Variable.t -> named t -> expr -> expr

    Takes the time required to calculate the free variables of the given expr.

    val create_let_reusing_body : Variable.t -> named -> expr t -> expr

    Takes the time required to calculate the free variables of the given named.

    val create_let_reusing_both : Variable.t -> named t -> expr t -> expr

    O(1) time.

    val expr : expr t -> named t

    The equivalent of the Expr constructor.

    val contents : 'a t -> 'a
    val free_variables : _ t -> Variable.Set.t

    O(1) time.

    diff --git a/ocaml/Flambda/index.html b/ocaml/Flambda/index.html new file mode 100644 index 0000000..8af4ea9 --- /dev/null +++ b/ocaml/Flambda/index.html @@ -0,0 +1,106 @@ + +Flambda (ocaml.Flambda)

    Module Flambda

    Intermediate language used for tree-based analysis and optimization.

    type call_kind =
    1. | Indirect
    2. | Direct of Closure_id.t

    Whether the callee in a function application is known at compile time.

    type const =
    1. | Int of int
    2. | Char of char
      (*

      Char is kept separate from Int to improve printing

      *)

    Simple constants. ("Structured constants" are rewritten to invocations of Pmakeblock so that they easily take part in optimizations.)

    type apply = {
    1. func : Variable.t;
    2. args : Variable.t list;
    3. kind : call_kind;
    4. dbg : Debuginfo.t;
    5. inline : Lambda.inline_attribute;
      (*

      Instructions from the source code as to whether the callee should be inlined.

      *)
    6. specialise : Lambda.specialise_attribute;
      (*

      Instructions from the source code as to whether the callee should be specialised.

      *)
    }

    The application of a function to a list of arguments.

    type assign = {
    1. being_assigned : Mutable_variable.t;
    2. new_value : Variable.t;
    }

    The update of a mutable variable. Mutable variables are distinct from immutable variables in Flambda.

    type send = {
    1. kind : Lambda.meth_kind;
    2. meth : Variable.t;
    3. obj : Variable.t;
    4. args : Variable.t list;
    5. dbg : Debuginfo.t;
    }

    The invocation of a method.

    type project_closure = Projection.project_closure

    For details on these types, see projection.mli.

    type move_within_set_of_closures = Projection.move_within_set_of_closures
    type project_var = Projection.project_var
    type specialised_to = {
    1. var : Variable.t;
      (*

      The "outer variable".

      *)
    2. projection : Projection.t option;
      (*

      The projecting_from value (see projection.mli) of any projection must be another free variable or specialised argument (depending on whether this record type is involved in free_vars or specialised_args respectively) in the same set of closures. As such, this field describes a relation of projections between either the free_vars or the specialised_args.

      *)
    }

    See free_vars and specialised_args, below.

    type t =
    1. | Var of Variable.t
    2. | Let of let_expr
    3. | Let_mutable of let_mutable
    4. | Apply of apply
    5. | Send of send
    6. | Assign of assign
    7. | If_then_else of Variable.t * t * t
    8. | Switch of Variable.t * switch
    9. | String_switch of Variable.t * (string * t) list * t option
      (*

      Restrictions on Lambda.Lstringswitch also apply to String_switch.

      *)
    10. | Static_raise of Static_exception.t * Variable.t list
    11. | Static_catch of Static_exception.t * Variable.t list * t * t
    12. | Try_with of t * Variable.t * t
    13. | While of t * t
    14. | For of for_loop
    15. | Proved_unreachable

    Flambda terms are partitioned in a pseudo-ANF manner; many terms are required to be let-bound. This in particular ensures there is always a variable name for an expression that may be lifted out (for example if it is found to be constant). Note: All bound variables in Flambda terms must be distinct. Flambda_invariants verifies this.

    and named =
    1. | Symbol of Symbol.t
    2. | Const of const
    3. | Allocated_const of Allocated_const.t
    4. | Read_mutable of Mutable_variable.t
    5. | Read_symbol_field of Symbol.t * int
      (*

      During the lifting of let bindings to program constructions after closure conversion, we generate symbols and their corresponding definitions (which may or may not be constant), together with field accesses to such symbols. We would like it to be the case that such field accesses are simplified to the relevant component of the symbol concerned. (The rationale is to generate efficient code and share constants as expected: see e.g. tests/asmcomp/staticalloc.ml.) The components of the symbol would be identified by other symbols. This sort of access pattern is feasible because the top-level structure of symbols is statically allocated and fixed at compile time. It may seem that Prim (Pfield, ...) expressions could be used to perform the field accesses. However for simplicity, to avoid having to keep track of properties of individual fields of blocks, Inconstant_idents never deems a Prim (Pfield, ...) expression to be constant. This would in general prevent field accesses to symbols from being simplified in the way we would like, since Lift_constants would not assign new symbols (i.e. the things we would like to simplify to) to the various projections from the symbols in question. To circumvent this problem we use Read_symbol_field when generating projections from the top level of symbols. Owing to the properties of symbols described above, such expressions may be eligible for declaration as constant by Inconstant_idents (and thus themselves lifted to another symbol), without any further complication. Read_symbol_field may only be used when the definition of the symbol is in scope in the program. For external unresolved symbols, Pfield may still be used; it will be changed to Read_symbol_field by Inline_and_simplify when (and if) the symbol is imported.

      *)
    6. | Set_of_closures of set_of_closures
    7. | Project_closure of project_closure
    8. | Move_within_set_of_closures of move_within_set_of_closures
    9. | Project_var of project_var
    10. | Prim of Clambda_primitives.primitive * Variable.t list * Debuginfo.t
    11. | Expr of t
      (*

      ANF escape hatch.

      *)

    Values of type named will always be let-bound to a Variable.t.

    and let_expr = private {
    1. var : Variable.t;
    2. defining_expr : named;
    3. body : t;
    4. free_vars_of_defining_expr : Variable.Set.t;
      (*

      A cache of the free variables in the defining expression of the let.

      *)
    5. free_vars_of_body : Variable.Set.t;
      (*

      A cache of the free variables of the body of the let. This is an important optimization.

      *)
    }
    and let_mutable = {
    1. var : Mutable_variable.t;
    2. initial_value : Variable.t;
    3. contents_kind : Lambda.value_kind;
    4. body : t;
    }
    and set_of_closures = private {
    1. function_decls : function_declarations;
    2. free_vars : specialised_to Variable.Map.t;
      (*

      Mapping from all variables free in the body of the function_decls to variables in scope at the definition point of the set_of_closures. The domain of this map is sometimes known as the "variables bound by the closure".

      *)
    3. specialised_args : specialised_to Variable.Map.t;
      (*

      Parameters whose corresponding arguments are known to always alias a particular value. These are the only parameters that may, during Inline_and_simplify, have non-unknown approximations.

      An argument may only be specialised to a variable in the scope of the corresponding set of closures declaration. Usually, that variable itself also appears in the position of the specialised argument at all call sites of the function. However it may also be the case (for example in code generated as a result of Augment_specialised_args) that the various call sites of such a function have differing variables in the position of the specialised argument. This is permissible *so long as it is certain they all alias the same value*. Great care must be taken in transformations that result in this situation since there are no invariant checks for correctness.

      As an example, supposing all call sites of f are represented here: let x = ... in let f a b c = ... in let y = ... in f x y 1; f x y 1 the specialised arguments of f can (but does not necessarily) contain the association a -> x, but cannot contain b -> y because f is not in the scope of y. If f were the recursive function let rec f a b c = f a 1 2 in, a -> x would still be a valid specialised argument because all recursive calls maintain the invariant.

      This information is used for optimization purposes, if such a binding is known, it is possible to specialise the body of the function according to its parameter. This is usually introduced when specialising a recursive function, for instance. let rec map f = function | [] -> [] | h :: t -> f h :: map f t let map_succ l = let succ x = x + 1 in map succ l map can be duplicated in map_succ to be specialised for the argument f. This will result in let map_succ l = let succ x = x + 1 in let rec map f = function | [] -> [] | h :: t -> f h :: map f t in map succ l with map having f -> succ in its specialised_args field.

      Specialised argument information for arguments that are used must never be erased. This ensures that specialised arguments whose approximations describe closures maintain those approximations, which is essential to transport the closure freshening information to the point of use (e.g. a Project_var from such an argument).

      *)
    4. direct_call_surrogates : Variable.t Variable.Map.t;
      (*

      If direct_call_surrogates maps fun_var1 to fun_var2 then direct calls to fun_var1 should be redirected to fun_var2. This is used to reduce the overhead of transformations that introduce wrapper functions (which will be inlined at direct call sites, but will penalise indirect call sites). direct_call_surrogates may not be transitively closed.

      *)
    }

    The representation of a set of function declarations (possibly mutually recursive). Such a set encapsulates the declarations themselves, information about their defining environment, and information used specifically for optimization. Before a function can be applied it must be "projected" from a set of closures to yield a "closure". This is done using Project_closure (see above). Given a closure, not only can it be applied, but information about its defining environment can be retrieved (using Project_var, see above). At runtime, a set_of_closures corresponds to an OCaml value with tag Closure_tag (possibly with inline Infix_tag(s)). As an optimization, an operation (Move_within_set_of_closures) is provided (see above) which enables one closure within a set to be located given another closure in the same set. This avoids keeping a pointer to the whole set of closures alive when compiling, for example, mutually-recursive functions.

    and function_declarations = private {
    1. is_classic_mode : bool;
      (*

      Indicates whether this function_declarations was compiled with -Oclassic.

      *)
    2. set_of_closures_id : Set_of_closures_id.t;
      (*

      An identifier (unique across all Flambda trees currently in memory) of the set of closures associated with this set of function declarations.

      *)
    3. set_of_closures_origin : Set_of_closures_origin.t;
      (*

      An identifier of the original set of closures on which this set of function declarations is based. Used to prevent different specialisations of the same functions from being inlined/specialised within each other.

      *)
    4. funs : function_declaration Variable.Map.t;
      (*

      The function(s) defined by the set of function declarations. The keys of this map are often referred to in the code as "fun_var"s.

      *)
    }
    and function_declaration = private {
    1. closure_origin : Closure_origin.t;
    2. params : Parameter.t list;
    3. body : t;
    4. free_variables : Variable.Set.t;
      (*

      All variables free in the *body* of the function. For example, a variable that is bound as one of the function's parameters will still be included in this set. This field is present as an optimization.

      *)
    5. free_symbols : Symbol.Set.t;
      (*

      All symbols that occur in the function's body. (Symbols can never be bound in a function's body; the only thing that binds symbols is the program constructions below.)

      *)
    6. stub : bool;
      (*

      A stub function is a generated function used to prepare arguments or return values to allow indirect calls to functions with a special calling convention. For instance indirect calls to tuplified functions must go through a stub. Stubs will be unconditionally inlined.

      *)
    7. dbg : Debuginfo.t;
      (*

      Debug info for the function declaration.

      *)
    8. inline : Lambda.inline_attribute;
      (*

      Inlining requirements from the source code.

      *)
    9. specialise : Lambda.specialise_attribute;
      (*

      Specialising requirements from the source code.

      *)
    10. is_a_functor : bool;
      (*

      Whether the function is known definitively to be a functor.

      *)
    11. poll : Lambda.poll_attribute;
      (*

      Behaviour for polls

      *)
    }
    and switch = {
    1. numconsts : Numbers.Int.Set.t;
      (*

      Integer cases

      *)
    2. consts : (int * t) list;
      (*

      Integer cases

      *)
    3. numblocks : Numbers.Int.Set.t;
      (*

      Number of tag block cases

      *)
    4. blocks : (int * t) list;
      (*

      Tag block cases

      *)
    5. failaction : t option;
      (*

      Action to take if none matched

      *)
    }

    Equivalent to the similar type in Lambda.

    and for_loop = {
    1. bound_var : Variable.t;
    2. from_value : Variable.t;
    3. to_value : Variable.t;
    4. direction : Asttypes.direction_flag;
    5. body : t;
    }

    Equivalent to the similar type in Lambda.

    and constant_defining_value =
    1. | Allocated_const of Allocated_const.t
      (*

      A single constant. These are never "simple constants" (type const) but instead more complicated constructions.

      *)
    2. | Block of Tag.t * constant_defining_value_block_field list
      (*

      A pre-allocated block full of constants (either simple constants or references to other constants, see below).

      *)
    3. | Set_of_closures of set_of_closures
      (*

      A closed (and thus constant) set of closures. (That is to say, free_vars must be empty.)

      *)
    4. | Project_closure of Symbol.t * Closure_id.t
      (*

      Selection of one closure from a constant set of closures. Analogous to the equivalent operation on expressions.

      *)

    Like a subset of Flambda.named, except that instead of Variable.ts we have Symbol.ts, and everything is a constant (i.e. with a fixed value known at compile time). Values of this type describe constants that will be directly assigned to symbols in the object file (see below).

    and constant_defining_value_block_field =
    1. | Symbol of Symbol.t
    2. | Const of const
    type expr = t
    type program_body =
    1. | Let_symbol of Symbol.t * constant_defining_value * program_body
      (*

      Define the given symbol to have the given constant value.

      *)
    2. | Let_rec_symbol of (Symbol.t * constant_defining_value) list * program_body
      (*

      As for Let_symbol, but recursive. This is needed to treat examples like this, where a constant set of closures is lifted to toplevel:

      let rec f x = f x

      After lifting this produces (in pseudo-Flambda):

      Let_rec_symbol set_of_closures_symbol = (Set_of_closures f x -> + let applied_function = Symbol f_closure in + Apply (applied_function, x) ) and f_closure = Project_closure (set_of_closures_symbol, f)

      Use of Let_rec_symbol, by virtue of the special handling in Inline_and_simplify.define_let_rec_symbol_approx, enables the approximation of the set of closures to be present in order to correctly simplify the Project_closure construction. (See Inline_and_simplify.simplify_project_closure for that part.)

      *)
    3. | Initialize_symbol of Symbol.t * Tag.t * t list * program_body
      (*

      Define the given symbol as a constant block of the given size and tag; but with a possibly non-constant initializer. The initializer will be executed at most once (from the entry point of the compilation unit).

      *)
    4. | Effect of t * program_body
      (*

      Cause the given expression, which may have a side effect, to be executed. The resulting value is discarded. Effect constructions are never re-ordered.

      *)
    5. | End of Symbol.t
      (*

      End accepts the root symbol: the only symbol that can never be eliminated.

      *)

    A "program" is the contents of one compilation unit. It describes the various values that are assigned to symbols (and in some cases fields of such symbols) in the object file. As such, it is closely related to the compilation of toplevel modules.

    type program = {
    1. imported_symbols : Symbol.Set.t;
    2. program_body : program_body;
    }
    val free_variables : + ?ignore_uses_as_callee:unit -> + ?ignore_uses_as_argument:unit -> + ?ignore_uses_in_project_var:unit -> + t -> + Variable.Set.t

    Compute the free variables of a term. (This is O(1) for Lets). If ignore_uses_as_callee, all free variables inside Apply expressions are ignored. Likewise ignore_uses_in_project_var for Project_var expressions.

    val free_variables_named : + ?ignore_uses_in_project_var:unit -> + named -> + Variable.Set.t

    Compute the free variables of a named expression.

    val used_variables : + ?ignore_uses_as_callee:unit -> + ?ignore_uses_as_argument:unit -> + ?ignore_uses_in_project_var:unit -> + t -> + Variable.Set.t

    Compute _all_ variables occurring inside an expression.

    val used_variables_named : + ?ignore_uses_in_project_var:unit -> + named -> + Variable.Set.t

    Compute _all_ variables occurring inside a named expression.

    val free_symbols : expr -> Symbol.Set.t
    val free_symbols_named : named -> Symbol.Set.t
    val free_symbols_program : program -> Symbol.Set.t
    val fold_lets_option : + t -> + init:'a -> + for_defining_expr:('a -> Variable.t -> named -> 'a * Variable.t * named) -> + for_last_body:('a -> t -> t * 'b) -> + filter_defining_expr: + ('b -> + Variable.t -> + named -> + Variable.Set.t -> + 'b * Variable.t * named option) -> + t * 'b

    Used to avoid exceeding the stack limit when handling expressions with multiple consecutive nested Let-expressions. This saves rewriting large simplification functions in CPS. This function provides for the rewriting or elimination of expressions during the fold.

    val map_lets : + t -> + for_defining_expr:(Variable.t -> named -> named) -> + for_last_body:(t -> t) -> + after_rebuild:(t -> t) -> + t

    Like fold_lets_option, but just a map.

    val iter_lets : + t -> + for_defining_expr:(Variable.t -> named -> unit) -> + for_last_body:(t -> unit) -> + for_each_let:(t -> unit) -> + unit

    Like map_lets, but just an iterator.

    val create_let : Variable.t -> named -> t -> t

    Creates a Let expression. (This computes the free variables of the defining expression and the body.)

    val map_defining_expr_of_let : let_expr -> f:(named -> named) -> t

    Apply the specified function f to the defining expression of the given Let-expression, returning a new Let.

    module With_free_variables : sig ... end

    A module for the manipulation of terms where the recomputation of free variable sets is to be kept to a minimum.

    val create_function_declaration : + params:Parameter.t list -> + body:t -> + stub:bool -> + dbg:Debuginfo.t -> + inline:Lambda.inline_attribute -> + specialise:Lambda.specialise_attribute -> + is_a_functor:bool -> + closure_origin:Closure_origin.t -> + poll:Lambda.poll_attribute -> + function_declaration

    Create a function declaration. This calculates the free variables and symbols occurring in the specified body.

    val update_function_declaration : + function_declaration -> + params:Parameter.t list -> + body:t -> + function_declaration

    Create a function declaration based on another function declaration

    val create_function_declarations : + is_classic_mode:bool -> + funs:function_declaration Variable.Map.t -> + function_declarations

    Create a set of function declarations given the individual declarations.

    val create_function_declarations_with_origin : + is_classic_mode:bool -> + funs:function_declaration Variable.Map.t -> + set_of_closures_origin:Set_of_closures_origin.t -> + function_declarations

    Create a set of function declarations with a given set of closures origin.

    val update_body_of_function_declaration : + function_declaration -> + body:expr -> + function_declaration

    Change only the code of a function declaration.

    val update_function_decl's_params_and_body : + function_declaration -> + params:Parameter.t list -> + body:expr -> + function_declaration

    Change only the code and parameters of a function declaration.

    val update_function_declarations : + function_declarations -> + funs:function_declaration Variable.Map.t -> + function_declarations

    Create a set of function declarations based on another set of function declarations.

    val create_function_declarations_with_closures_origin : + is_classic_mode:bool -> + funs:function_declaration Variable.Map.t -> + set_of_closures_origin:Set_of_closures_origin.t -> + function_declarations
    val create_set_of_closures : + function_decls:function_declarations -> + free_vars:specialised_to Variable.Map.t -> + specialised_args:specialised_to Variable.Map.t -> + direct_call_surrogates:Variable.t Variable.Map.t -> + set_of_closures

    Create a set of closures. Checks are made to ensure that free_vars and specialised_args are reasonable.

    Given a function declaration, find which of its parameters (if any) are used in the body.

    type maybe_named =
    1. | Is_expr of t
    2. | Is_named of named
    val iter_general : + toplevel:bool -> + (t -> unit) -> + (named -> unit) -> + maybe_named -> + unit

    This function is designed for the internal use of Flambda_iterators. See that module for iterators to be used over Flambda terms.

    val print : Stdlib.Format.formatter -> t -> unit
    val print_named : Stdlib.Format.formatter -> named -> unit
    val print_program : Stdlib.Format.formatter -> program -> unit
    val print_const : Stdlib.Format.formatter -> const -> unit
    val print_constant_defining_value : + Stdlib.Format.formatter -> + constant_defining_value -> + unit
    val print_function_declaration : + Stdlib.Format.formatter -> + (Variable.t * function_declaration) -> + unit
    val print_function_declarations : + Stdlib.Format.formatter -> + function_declarations -> + unit
    val print_project_closure : Stdlib.Format.formatter -> project_closure -> unit
    val print_move_within_set_of_closures : + Stdlib.Format.formatter -> + move_within_set_of_closures -> + unit
    val print_project_var : Stdlib.Format.formatter -> project_var -> unit
    val print_set_of_closures : Stdlib.Format.formatter -> set_of_closures -> unit
    val print_specialised_to : Stdlib.Format.formatter -> specialised_to -> unit
    val equal_call_kind : call_kind -> call_kind -> bool
    val equal_specialised_to : specialised_to -> specialised_to -> bool
    val compare_const : const -> const -> int
    val compare_project_var : project_var -> project_var -> int
    val compare_move_within_set_of_closures : + move_within_set_of_closures -> + move_within_set_of_closures -> + int
    val compare_project_closure : project_closure -> project_closure -> int
    diff --git a/ocaml/Flambda_invariants/index.html b/ocaml/Flambda_invariants/index.html new file mode 100644 index 0000000..34f0a6a --- /dev/null +++ b/ocaml/Flambda_invariants/index.html @@ -0,0 +1,2 @@ + +Flambda_invariants (ocaml.Flambda_invariants)

    Module Flambda_invariants

    type flambda_kind =
    1. | Normal
    2. | Lifted
    val check_exn : ?kind:flambda_kind -> Flambda.program -> unit

    Checking of invariants on Flambda expressions. Raises an exception if a check fails.

    diff --git a/ocaml/Flambda_iterators/index.html b/ocaml/Flambda_iterators/index.html new file mode 100644 index 0000000..6465c8b --- /dev/null +++ b/ocaml/Flambda_iterators/index.html @@ -0,0 +1,95 @@ + +Flambda_iterators (ocaml.Flambda_iterators)

    Module Flambda_iterators

    val apply_on_subexpressions : + (Flambda.t -> unit) -> + (Flambda.named -> unit) -> + Flambda.t -> + unit

    Apply the given functions to the immediate subexpressions of the given Flambda expression. For avoidance of doubt, if a subexpression is Expr, it is passed to the function taking Flambda.named, rather than being followed and passed to the function taking Flambda.t.

    val map_subexpressions : + (Flambda.t -> Flambda.t) -> + (Variable.t -> Flambda.named -> Flambda.named) -> + Flambda.t -> + Flambda.t
    val iter : (Flambda.t -> unit) -> (Flambda.named -> unit) -> Flambda.t -> unit
    val iter_expr : (Flambda.t -> unit) -> Flambda.t -> unit
    val iter_on_named : + (Flambda.t -> unit) -> + (Flambda.named -> unit) -> + Flambda.named -> + unit
    val iter_named : (Flambda.named -> unit) -> Flambda.t -> unit
    val iter_named_on_named : (Flambda.named -> unit) -> Flambda.named -> unit
    val iter_toplevel : + (Flambda.t -> unit) -> + (Flambda.named -> unit) -> + Flambda.t -> + unit

    iter_toplevel f t applies f on every toplevel subexpression of t. In particular, it never applies f to the body of a function (which will always be contained within an Set_of_closures expression).

    val iter_named_toplevel : + (Flambda.t -> unit) -> + (Flambda.named -> unit) -> + Flambda.named -> + unit
    val iter_on_sets_of_closures : + (Flambda.set_of_closures -> unit) -> + Flambda.t -> + unit
    val iter_on_set_of_closures_of_program : + Flambda.program -> + f:(constant:bool -> Flambda.set_of_closures -> unit) -> + unit
    val iter_all_immutable_let_bindings : + Flambda.t -> + f:(Variable.t -> Flambda.named -> unit) -> + unit
    val iter_all_toplevel_immutable_let_bindings : + Flambda.t -> + f:(Variable.t -> Flambda.named -> unit) -> + unit
    val iter_exprs_at_toplevel_of_program : + Flambda.program -> + f:(Flambda.t -> unit) -> + unit
    val iter_named_of_program : + Flambda.program -> + f:(Flambda.named -> unit) -> + unit
    val iter_constant_defining_values_on_program : + Flambda.program -> + f:(Flambda.constant_defining_value -> unit) -> + unit
    val iter_apply_on_program : + Flambda.program -> + f:(Flambda.apply -> unit) -> + unit
    val map : + (Flambda.t -> Flambda.t) -> + (Flambda.named -> Flambda.named) -> + Flambda.t -> + Flambda.t
    val map_expr : (Flambda.t -> Flambda.t) -> Flambda.t -> Flambda.t
    val map_named : (Flambda.named -> Flambda.named) -> Flambda.t -> Flambda.t
    val map_toplevel : + (Flambda.t -> Flambda.t) -> + (Flambda.named -> Flambda.named) -> + Flambda.t -> + Flambda.t
    val map_toplevel_expr : (Flambda.t -> Flambda.t) -> Flambda.t -> Flambda.t
    val map_toplevel_named : + (Flambda.named -> Flambda.named) -> + Flambda.t -> + Flambda.t
    val map_symbols : Flambda.t -> f:(Symbol.t -> Symbol.t) -> Flambda.t
    val map_symbols_on_set_of_closures : + Flambda.set_of_closures -> + f:(Symbol.t -> Symbol.t) -> + Flambda.set_of_closures
    val map_toplevel_sets_of_closures : + Flambda.t -> + f:(Flambda.set_of_closures -> Flambda.set_of_closures) -> + Flambda.t
    val map_apply : Flambda.t -> f:(Flambda.apply -> Flambda.apply) -> Flambda.t
    val map_function_bodies : + Flambda.set_of_closures -> + f:(Flambda.t -> Flambda.t) -> + Flambda.set_of_closures
    val map_sets_of_closures : + Flambda.t -> + f:(Flambda.set_of_closures -> Flambda.set_of_closures) -> + Flambda.t
    val map_sets_of_closures_of_program : + Flambda.program -> + f:(Flambda.set_of_closures -> Flambda.set_of_closures) -> + Flambda.program
    val map_project_var_to_expr_opt : + Flambda.t -> + f:(Flambda.project_var -> Flambda.t option) -> + Flambda.t
    val map_project_var_to_named_opt : + Flambda.t -> + f:(Flambda.project_var -> Flambda.named option) -> + Flambda.t
    val map_exprs_at_toplevel_of_program : + Flambda.program -> + f:(Flambda.t -> Flambda.t) -> + Flambda.program
    val map_named_of_program : + Flambda.program -> + f:(Variable.t -> Flambda.named -> Flambda.named) -> + Flambda.program
    val map_all_immutable_let_and_let_rec_bindings : + Flambda.t -> + f:(Variable.t -> Flambda.named -> Flambda.named) -> + Flambda.t
    val fold_function_decls_ignoring_stubs : + Flambda.set_of_closures -> + init:'a -> + f: + (fun_var:Variable.t -> + function_decl:Flambda.function_declaration -> + 'a -> + 'a) -> + 'a
    diff --git a/ocaml/Flambda_middle_end/index.html b/ocaml/Flambda_middle_end/index.html new file mode 100644 index 0000000..7c92bad --- /dev/null +++ b/ocaml/Flambda_middle_end/index.html @@ -0,0 +1,7 @@ + +Flambda_middle_end (ocaml.Flambda_middle_end)

    Module Flambda_middle_end

    Translate Lambda code to Flambda code, optimize it, and produce Clambda.

    val lambda_to_clambda : + backend:(module Backend_intf.S) -> + prefixname:string -> + ppf_dump:Stdlib.Format.formatter -> + Lambda.program -> + Clambda.with_constants
    diff --git a/ocaml/Flambda_to_clambda/index.html b/ocaml/Flambda_to_clambda/index.html new file mode 100644 index 0000000..f6fa059 --- /dev/null +++ b/ocaml/Flambda_to_clambda/index.html @@ -0,0 +1,5 @@ + +Flambda_to_clambda (ocaml.Flambda_to_clambda)

    Module Flambda_to_clambda

    type result = {
    1. expr : Clambda.ulambda;
    2. preallocated_blocks : Clambda.preallocated_block list;
    3. structured_constants : Clambda.ustructured_constant Symbol.Map.t;
    4. exported : Export_info.t;
    }

    Convert an Flambda program, with associated proto-export information, to Clambda. This yields a Clambda expression together with augmented export information and details about required statically-allocated values (preallocated blocks, for Initialize_symbol, and structured constants).

    It is during this process that accesses to variables within closures are transformed to field accesses within closure values. For direct calls, the hidden closure parameter is added. Switch tables are also built.

    diff --git a/ocaml/Flambda_utils/Switch_storer/index.html b/ocaml/Flambda_utils/Switch_storer/index.html new file mode 100644 index 0000000..1efc181 --- /dev/null +++ b/ocaml/Flambda_utils/Switch_storer/index.html @@ -0,0 +1,2 @@ + +Switch_storer (ocaml.Flambda_utils.Switch_storer)

    Module Flambda_utils.Switch_storer

    For the compilation of switch statements.

    val mk_store : unit -> (Flambda.t, unit) Switch.t_store
    diff --git a/ocaml/Flambda_utils/index.html b/ocaml/Flambda_utils/index.html new file mode 100644 index 0000000..f33d901 --- /dev/null +++ b/ocaml/Flambda_utils/index.html @@ -0,0 +1,53 @@ + +Flambda_utils (ocaml.Flambda_utils)

    Module Flambda_utils

    Utility functions for the Flambda intermediate language.

    Access functions

    find_declaration f decl raises Not_found if f is not in decl.

    val find_declaration_variable : + Closure_id.t -> + Flambda.function_declarations -> + Variable.t

    find_declaration_variable f decl raises Not_found if f is not in decl.

    val find_free_variable : + Var_within_closure.t -> + Flambda.set_of_closures -> + Variable.t

    find_free_variable v clos raises Not_found if c is not in clos.

    Utility functions

    val function_arity : Flambda.function_declaration -> int
    val variables_bound_by_the_closure : + Closure_id.t -> + Flambda.function_declarations -> + Variable.Set.t

    Variables "bound by a closure" are those variables free in the corresponding function's body that are neither:

    • bound as parameters of that function; nor
    • bound by the let binding that introduces the function declaration(s). In particular, if f, g and h are being introduced by a simultaneous, possibly mutually-recursive let binding then none of f, g or h are bound in any of the closures for f, g and h.
    val can_be_merged : Flambda.t -> Flambda.t -> bool

    If can_be_merged f1 f2 is true, it is safe to merge switch branches containing f1 and f2.

    val description_of_toplevel_node : Flambda.t -> string
    val make_closure_declaration : + is_classic_mode:bool -> + id:Variable.t -> + body:Flambda.t -> + params:Parameter.t list -> + Flambda.t
    val toplevel_substitution : + Variable.t Variable.Map.t -> + Flambda.expr -> + Flambda.expr
    val toplevel_substitution_named : + Variable.t Variable.Map.t -> + Flambda.named -> + Flambda.named
    val bind : + bindings:(Variable.t * Flambda.named) list -> + body:Flambda.t -> + Flambda.t

    bind [var1, expr1; ...; varN, exprN] body binds using Immutable Let expressions the given (var, expr) pairs around the body.

    val name_expr_from_var : var:Variable.t -> Flambda.named -> Flambda.t
    val initialize_symbols : + Flambda.program -> + (Symbol.t * Tag.t * Flambda.t list) list
    val imported_symbols : Flambda.program -> Symbol.Set.t
    val needed_import_symbols : Flambda.program -> Symbol.Set.t
    val introduce_needed_import_symbols : Flambda.program -> Flambda.program
    val root_symbol : Flambda.program -> Symbol.t
    val might_raise_static_exn : Flambda.named -> Static_exception.t -> bool

    Returns true iff the given term might raise the given static exception.

    Creates a map from closure IDs to set_of_closure IDs by iterating over all sets of closures in the given program.

    val all_lifted_constants : + Flambda.program -> + (Symbol.t * Flambda.constant_defining_value) list

    The definitions of all constants that have been lifted out to Let_symbol or Let_rec_symbol constructions.

    val all_lifted_constants_as_map : + Flambda.program -> + Flambda.constant_defining_value Symbol.Map.t

    Like all_lifted_constant_symbols, but returns a map instead of a list.

    val all_lifted_constant_sets_of_closures : + Flambda.program -> + Set_of_closures_id.Set.t

    The identifiers of all constant sets of closures that have been lifted out to Let_symbol or Let_rec_symbol constructions.

    val all_lifted_constant_closures : Flambda.program -> Closure_id.Set.t
    val all_sets_of_closures : Flambda.program -> Flambda.set_of_closures list

    All sets of closures in the given program (whether or not bound to a symbol.)

    val substitute_read_symbol_field_for_variables : + (Symbol.t * int list) Variable.Map.t -> + Flambda.t -> + Flambda.t
    module Switch_storer : sig ... end

    For the compilation of switch statements.

    val fun_vars_referenced_in_decls : + Flambda.function_declarations -> + closure_symbol:(Closure_id.t -> Symbol.t) -> + Variable.Set.t Variable.Map.t

    Within a set of function declarations there is a set of function bodies, each of which may (or may not) reference one of the other functions in the same set. Initially such intra-set references are by Vars (known as "fun_var"s) but if the function is lifted by Lift_constants then the references will be translated to Symbols. This means that optimization passes that need to identify whether a given "fun_var" (i.e. a key in the funs map in a value of type function_declarations) is used in one of the function bodies need to examine the free_symbols as well as the free_variables members of function_declarations. This function makes that process easier by computing all used "fun_var"s in the bodies of the given set of function declarations, including the cases where the references are Symbols. The returned value is a map from "fun_var"s to the "fun_var"s (if any) used in the body of the function associated with that "fun_var".

    val closures_required_by_entry_point : + entry_point:Closure_id.t -> + closure_symbol:(Closure_id.t -> Symbol.t) -> + Flambda.function_declarations -> + Variable.Set.t

    Computes the set of closure_id in the set of closures that are required used (transitively) the entry_point

    val all_functions_parameters : Flambda.function_declarations -> Variable.Set.t
    val contains_stub : Flambda.function_declarations -> bool
    val clean_projections : + which_variables:Flambda.specialised_to Variable.Map.t -> + Flambda.specialised_to Variable.Map.t
    val projection_to_named : Projection.t -> Flambda.named
    type specialised_to_same_as =
    1. | Not_specialised
    2. | Specialised_and_aliased_to of Variable.Set.t
    val parameters_specialised_to_the_same_variable : + function_decls:Flambda.function_declarations -> + specialised_args:Flambda.specialised_to Variable.Map.t -> + specialised_to_same_as list Variable.Map.t

    For each parameter in a given set of function declarations and the usual specialised-args mapping, determine which other parameters are specialised to the same variable as that parameter. The result is presented as a map from fun_vars to lists, corresponding componentwise to the usual params list in the corresponding function declaration.

    diff --git a/ocaml/Freshening/Project_var/index.html b/ocaml/Freshening/Project_var/index.html new file mode 100644 index 0000000..e3af314 --- /dev/null +++ b/ocaml/Freshening/Project_var/index.html @@ -0,0 +1,5 @@ + +Project_var (ocaml.Freshening.Project_var)

    Module Freshening.Project_var

    type t

    A table used for freshening of identifiers in Project_closure and Move_within_set_of_closures ("ids of closures"); and Project_var ("bound vars of closures") expressions.

    This information is propagated bottom up and populated when inlining a function containing a closure declaration.

    For instance, let f x = let g y = ... x ... in ... g.x ... (Project_var x) ... g 1 ... (Apply (Project_closure g ...))

    If f is inlined, g is renamed. The approximation of g will carry this table such that later the access to the field x of g and selection of g in the closure can be substituted.

    val empty : t
    val compose : earlier:t -> later:t -> t

    Composition of two freshenings.

    val apply_closure_id : t -> Closure_id.t -> Closure_id.t

    Freshen a closure ID based on the given renaming. The same ID is returned if the renaming does not affect it. If dealing with approximations, you probably want to use Simple_value_approx.freshen_and_check_closure_id instead of this function.

    val apply_var_within_closure : + t -> + Var_within_closure.t -> + Var_within_closure.t

    Like apply_closure_id, but for variables within closures.

    val print : Stdlib.Format.formatter -> t -> unit
    diff --git a/ocaml/Freshening/index.html b/ocaml/Freshening/index.html new file mode 100644 index 0000000..ec98392 --- /dev/null +++ b/ocaml/Freshening/index.html @@ -0,0 +1,25 @@ + +Freshening (ocaml.Freshening)

    Module Freshening

    Freshening of various identifiers.

    type t

    A table used for freshening variables and static exception identifiers.

    type subst = t
    val empty : t

    The freshening that does nothing. This is the unique inactive freshening.

    val is_empty : t -> bool
    val activate : t -> t

    Activate the freshening. Without activation, operations to request freshenings have no effect (cf. the documentation below for add_variable). As such, the inactive renaming is unique.

    val empty_preserving_activation_state : t -> t

    Given the inactive freshening, return the same; otherwise, return an empty active freshening.

    val add_variable : t -> Variable.t -> Variable.t * t

    add_variable t var If t is active: It returns a fresh variable new_var and adds var -> new_var to the freshening. If a renaming other_var -> var or symbol -> var was already present in t, it will also add other_var -> new_var and symbol -> new_var. If t is inactive, this is the identity.

    val add_variables' : t -> Variable.t list -> Variable.t list * t

    Like add_variable, but for multiple variables, each freshened separately.

    val add_variables : t -> (Variable.t * 'a) list -> (Variable.t * 'a) list * t

    Like add_variables', but passes through the second component of the input list unchanged.

    val add_variables3 : + t -> + (Variable.t * 'a * 'b) list -> + (Variable.t * 'a * 'b) list * t

    Like add_variables', but passes through the other components of the input list unchanged.

    val add_mutable_variable : t -> Mutable_variable.t -> Mutable_variable.t * t

    Like add_variable, but for mutable variables.

    val add_static_exception : t -> Static_exception.t -> Static_exception.t * t

    As for add_variable, but for static exception identifiers.

    val apply_variable : t -> Variable.t -> Variable.t

    apply_variable t var applies the freshening t to var. If no renaming is specified in t for var it is returned unchanged.

    val apply_mutable_variable : t -> Mutable_variable.t -> Mutable_variable.t

    As for apply_variable, but for mutable variables.

    val apply_static_exception : t -> Static_exception.t -> Static_exception.t

    As for apply_variable, but for static exception identifiers.

    val rewrite_recursive_calls_with_symbols : + t -> + Flambda.function_declarations -> + make_closure_symbol:(Closure_id.t -> Symbol.t) -> + Flambda.function_declarations

    Replace recursive accesses to the closures in the set through Symbol by the corresponding Var. This is used to recover the recursive call when importing code from another compilation unit.

    If the renaming is inactive, this is the identity.

    module Project_var : sig ... end
    val apply_function_decls_and_free_vars : + t -> + (Flambda.specialised_to * 'a) Variable.Map.t -> + Flambda.function_declarations -> + only_freshen_parameters:bool -> + (Flambda.specialised_to * 'a) Variable.Map.t + * Flambda.function_declarations + * t + * Project_var.t
    val does_not_freshen : t -> Variable.t list -> bool
    val print : Stdlib.Format.formatter -> t -> unit
    val freshen_projection_relation : + Flambda.specialised_to Variable.Map.t -> + freshening:t -> + closure_freshening:Project_var.t -> + Flambda.specialised_to Variable.Map.t

    N.B. This does not freshen the domain of the supplied map, only the range.

    val freshen_projection_relation' : + (Flambda.specialised_to * 'a) Variable.Map.t -> + freshening:t -> + closure_freshening:Project_var.t -> + (Flambda.specialised_to * 'a) Variable.Map.t
    diff --git a/ocaml/Genprintval/Make/argument-1-O/index.html b/ocaml/Genprintval/Make/argument-1-O/index.html new file mode 100644 index 0000000..f3ca481 --- /dev/null +++ b/ocaml/Genprintval/Make/argument-1-O/index.html @@ -0,0 +1,2 @@ + +O (ocaml.Genprintval.Make.O)

    Parameter Make.O

    type t
    val repr : 'a -> t
    val obj : t -> 'a
    val is_block : t -> bool
    val tag : t -> int
    val size : t -> int
    val field : t -> int -> t
    val double_array_tag : int
    val double_field : t -> int -> float
    diff --git a/ocaml/Genprintval/Make/argument-2-_/index.html b/ocaml/Genprintval/Make/argument-2-_/index.html new file mode 100644 index 0000000..3630b01 --- /dev/null +++ b/ocaml/Genprintval/Make/argument-2-_/index.html @@ -0,0 +1,2 @@ + +_ (ocaml.Genprintval.Make._)

    Parameter Make._

    type valu = O.t
    val eval_address : Env.address -> valu
    exception Error
    val same_value : valu -> valu -> bool
    diff --git a/ocaml/Genprintval/Make/index.html b/ocaml/Genprintval/Make/index.html new file mode 100644 index 0000000..ec3fb69 --- /dev/null +++ b/ocaml/Genprintval/Make/index.html @@ -0,0 +1,23 @@ + +Make (ocaml.Genprintval.Make)

    Module Genprintval.Make

    Parameters

    module O : OBJ
    module _ : EVALPATH with type valu = O.t

    Signature

    type t = O.t
    val install_printer : + Path.t -> + Types.type_expr -> + (Stdlib.Format.formatter -> t -> unit) -> + unit
    val install_generic_printer : + Path.t -> + Path.t -> + (int -> + (int -> t -> Outcometree.out_value, t -> Outcometree.out_value) gen_printer) -> + unit
    val install_generic_printer' : + Path.t -> + Path.t -> + (Stdlib.Format.formatter -> t -> unit, Stdlib.Format.formatter -> t -> unit) + gen_printer -> + unit

    install_generic_printer' function_path constructor_path printer function_path is used to remove the printer.

    val remove_printer : Path.t -> unit
    val outval_of_untyped_exception : t -> Outcometree.out_value
    val outval_of_value : + int -> + int -> + (int -> t -> Types.type_expr -> Outcometree.out_value option) -> + Env.t -> + t -> + Types.type_expr -> + Outcometree.out_value
    diff --git a/ocaml/Genprintval/index.html b/ocaml/Genprintval/index.html new file mode 100644 index 0000000..494c40f --- /dev/null +++ b/ocaml/Genprintval/index.html @@ -0,0 +1,2 @@ + +Genprintval (ocaml.Genprintval)

    Module Genprintval

    module type OBJ = sig ... end
    module type EVALPATH = sig ... end
    type ('a, 'b) gen_printer =
    1. | Zero of 'b
    2. | Succ of 'a -> ('a, 'b) gen_printer
    module type S = sig ... end
    module Make (O : OBJ) (_ : EVALPATH with type valu = O.t) : S with type t = O.t
    diff --git a/ocaml/Genprintval/module-type-EVALPATH/index.html b/ocaml/Genprintval/module-type-EVALPATH/index.html new file mode 100644 index 0000000..0df1976 --- /dev/null +++ b/ocaml/Genprintval/module-type-EVALPATH/index.html @@ -0,0 +1,2 @@ + +EVALPATH (ocaml.Genprintval.EVALPATH)

    Module type Genprintval.EVALPATH

    type valu
    val eval_address : Env.address -> valu
    exception Error
    val same_value : valu -> valu -> bool
    diff --git a/ocaml/Genprintval/module-type-OBJ/index.html b/ocaml/Genprintval/module-type-OBJ/index.html new file mode 100644 index 0000000..6c08a07 --- /dev/null +++ b/ocaml/Genprintval/module-type-OBJ/index.html @@ -0,0 +1,2 @@ + +OBJ (ocaml.Genprintval.OBJ)

    Module type Genprintval.OBJ

    type t
    val repr : 'a -> t
    val obj : t -> 'a
    val is_block : t -> bool
    val tag : t -> int
    val size : t -> int
    val field : t -> int -> t
    val double_array_tag : int
    val double_field : t -> int -> float
    diff --git a/ocaml/Genprintval/module-type-S/index.html b/ocaml/Genprintval/module-type-S/index.html new file mode 100644 index 0000000..7d43dfc --- /dev/null +++ b/ocaml/Genprintval/module-type-S/index.html @@ -0,0 +1,23 @@ + +S (ocaml.Genprintval.S)

    Module type Genprintval.S

    type t
    val install_printer : + Path.t -> + Types.type_expr -> + (Stdlib.Format.formatter -> t -> unit) -> + unit
    val install_generic_printer : + Path.t -> + Path.t -> + (int -> + (int -> t -> Outcometree.out_value, t -> Outcometree.out_value) gen_printer) -> + unit
    val install_generic_printer' : + Path.t -> + Path.t -> + (Stdlib.Format.formatter -> t -> unit, Stdlib.Format.formatter -> t -> unit) + gen_printer -> + unit

    install_generic_printer' function_path constructor_path printer function_path is used to remove the printer.

    val remove_printer : Path.t -> unit
    val outval_of_untyped_exception : t -> Outcometree.out_value
    val outval_of_value : + int -> + int -> + (int -> t -> Types.type_expr -> Outcometree.out_value option) -> + Env.t -> + t -> + Types.type_expr -> + Outcometree.out_value
    diff --git a/ocaml/Id_types/Id/index.html b/ocaml/Id_types/Id/index.html new file mode 100644 index 0000000..94e0991 --- /dev/null +++ b/ocaml/Id_types/Id/index.html @@ -0,0 +1,2 @@ + +Id (ocaml.Id_types.Id)

    Module Id_types.Id

    Parameters

    Signature

    include BaseId
    type t
    val equal : t -> t -> bool
    val compare : t -> t -> int
    val hash : t -> int
    val name : t -> string option
    val to_string : t -> string
    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    val create : ?name:string -> unit -> t
    diff --git a/ocaml/Id_types/UnitId/argument-1-_/index.html b/ocaml/Id_types/UnitId/argument-1-_/index.html new file mode 100644 index 0000000..bc396a3 --- /dev/null +++ b/ocaml/Id_types/UnitId/argument-1-_/index.html @@ -0,0 +1,2 @@ + +_ (ocaml.Id_types.UnitId._)

    Parameter UnitId._

    include BaseId
    type t
    val equal : t -> t -> bool
    val compare : t -> t -> int
    val hash : t -> int
    val name : t -> string option
    val to_string : t -> string
    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    val create : ?name:string -> unit -> t
    diff --git a/ocaml/Id_types/UnitId/argument-2-Compilation_unit/index.html b/ocaml/Id_types/UnitId/argument-2-Compilation_unit/index.html new file mode 100644 index 0000000..701ab4a --- /dev/null +++ b/ocaml/Id_types/UnitId/argument-2-Compilation_unit/index.html @@ -0,0 +1,2 @@ + +Compilation_unit (ocaml.Id_types.UnitId.Compilation_unit)

    Parameter UnitId.Compilation_unit

    type t
    include Hashtbl.HashedType with type t := t
    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val hash : t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := t
    val compare : t -> t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    diff --git a/ocaml/Id_types/UnitId/index.html b/ocaml/Id_types/UnitId/index.html new file mode 100644 index 0000000..9d1844a --- /dev/null +++ b/ocaml/Id_types/UnitId/index.html @@ -0,0 +1,2 @@ + +UnitId (ocaml.Id_types.UnitId)

    Module Id_types.UnitId

    Parameters

    module _ : Id

    Signature

    include BaseId
    type t
    val equal : t -> t -> bool
    val compare : t -> t -> int
    val hash : t -> int
    val name : t -> string option
    val to_string : t -> string
    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    val create : ?name:string -> Compilation_unit.t -> t
    val unit : t -> Compilation_unit.t
    diff --git a/ocaml/Id_types/index.html b/ocaml/Id_types/index.html new file mode 100644 index 0000000..f553a98 --- /dev/null +++ b/ocaml/Id_types/index.html @@ -0,0 +1,5 @@ + +Id_types (ocaml.Id_types)

    Module Id_types

    module type BaseId = sig ... end

    Generic identifier type

    module type Id = sig ... end
    module type UnitId = sig ... end

    Fully qualified identifiers

    module Id () : Id
    diff --git a/ocaml/Id_types/module-type-BaseId/index.html b/ocaml/Id_types/module-type-BaseId/index.html new file mode 100644 index 0000000..76e40bf --- /dev/null +++ b/ocaml/Id_types/module-type-BaseId/index.html @@ -0,0 +1,2 @@ + +BaseId (ocaml.Id_types.BaseId)

    Module type Id_types.BaseId

    Generic identifier type

    type t
    val equal : t -> t -> bool
    val compare : t -> t -> int
    val hash : t -> int
    val name : t -> string option
    val to_string : t -> string
    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    diff --git a/ocaml/Id_types/module-type-Id/index.html b/ocaml/Id_types/module-type-Id/index.html new file mode 100644 index 0000000..2a7c77e --- /dev/null +++ b/ocaml/Id_types/module-type-Id/index.html @@ -0,0 +1,2 @@ + +Id (ocaml.Id_types.Id)

    Module type Id_types.Id

    include BaseId
    type t
    val equal : t -> t -> bool
    val compare : t -> t -> int
    val hash : t -> int
    val name : t -> string option
    val to_string : t -> string
    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    val create : ?name:string -> unit -> t
    diff --git a/ocaml/Id_types/module-type-UnitId/Compilation_unit/index.html b/ocaml/Id_types/module-type-UnitId/Compilation_unit/index.html new file mode 100644 index 0000000..866c711 --- /dev/null +++ b/ocaml/Id_types/module-type-UnitId/Compilation_unit/index.html @@ -0,0 +1,2 @@ + +Compilation_unit (ocaml.Id_types.UnitId.Compilation_unit)

    Module UnitId.Compilation_unit

    type t
    include Hashtbl.HashedType with type t := t
    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val hash : t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := t
    val compare : t -> t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    diff --git a/ocaml/Id_types/module-type-UnitId/index.html b/ocaml/Id_types/module-type-UnitId/index.html new file mode 100644 index 0000000..0e3b677 --- /dev/null +++ b/ocaml/Id_types/module-type-UnitId/index.html @@ -0,0 +1,2 @@ + +UnitId (ocaml.Id_types.UnitId)

    Module type Id_types.UnitId

    Fully qualified identifiers

    include BaseId
    type t
    val equal : t -> t -> bool
    val compare : t -> t -> int
    val hash : t -> int
    val name : t -> string option
    val to_string : t -> string
    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    val create : ?name:string -> Compilation_unit.t -> t
    val unit : t -> Compilation_unit.t
    diff --git a/ocaml/Ident/Map/index.html b/ocaml/Ident/Map/index.html new file mode 100644 index 0000000..8f64242 --- /dev/null +++ b/ocaml/Ident/Map/index.html @@ -0,0 +1,17 @@ + +Map (ocaml.Ident.Map)

    Module Ident.Map

    include Map.S with type key = T.t and type 'a t = 'a Map.Make(T).t

    Maps

    type key = T.t

    The type of the map keys.

    type 'a t = 'a Stdlib.Map.Make(T).t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key -> 'a -> 'a t -> 'a t

    add key data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key -> 'a -> 'a list t -> 'a list t

    add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

    update key f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : (key -> bool) -> 'a t -> key * 'a

    find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : (key -> bool) -> 'a t -> key * 'a

    find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : (key -> 'a -> unit) -> 'a t -> unit

    iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

    fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : (key -> 'a -> bool) -> 'a t -> 'a t

    filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : (key -> 'a -> bool) -> 'a t -> bool

    for_all f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : (key -> 'a -> bool) -> 'a t -> bool

    exists f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Stdlib.Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Stdlib.Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    val of_list : (key * 'a) list -> 'a t
    val disjoint_union : + ?eq:('a -> 'a -> bool) -> + ?print:(Stdlib.Format.formatter -> 'a -> unit) -> + 'a t -> + 'a t -> + 'a t

    disjoint_union m1 m2 contains all bindings from m1 and m2. If some binding is present in both and the associated value is not equal, a Fatal_error is raised

    val union_right : 'a t -> 'a t -> 'a t

    union_right m1 m2 contains all bindings from m1 and m2. If some binding is present in both, the one from m2 is taken

    val union_left : 'a t -> 'a t -> 'a t

    union_left m1 m2 = union_right m2 m1

    val union_merge : ('a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
    val rename : key t -> key -> key
    val map_keys : (key -> key) -> 'a t -> 'a t
    val keys : 'a t -> Stdlib.Set.Make(T).t
    val data : 'a t -> 'a list
    val of_set : (key -> 'a) -> Stdlib.Set.Make(T).t -> 'a t
    val transpose_keys_and_data : key t -> key t
    val transpose_keys_and_data_set : key t -> Stdlib.Set.Make(T).t t
    val print : + (Stdlib.Format.formatter -> 'a -> unit) -> + Stdlib.Format.formatter -> + 'a t -> + unit
    diff --git a/ocaml/Ident/Set/index.html b/ocaml/Ident/Set/index.html new file mode 100644 index 0000000..cb4bd4d --- /dev/null +++ b/ocaml/Ident/Set/index.html @@ -0,0 +1,2 @@ + +Set (ocaml.Ident.Set)

    Module Ident.Set

    include Set.S with type elt = T.t and type t = Set.Make(T).t

    Sets

    type elt = T.t

    The type of the set elements.

    The type of sets.

    val empty : t

    The empty set.

    val add : elt -> t -> t

    add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val singleton : elt -> t

    singleton x returns the one-element set containing only x.

    val remove : elt -> t -> t

    remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val union : t -> t -> t

    Set union.

    val inter : t -> t -> t

    Set intersection.

    val disjoint : t -> t -> bool

    Test if two sets are disjoint.

    • since 4.08
    val diff : t -> t -> t

    Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

    val cardinal : t -> int

    Return the number of elements of a set.

    Elements

    val elements : t -> elt list

    Return the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Set.Make.

    val min_elt : t -> elt

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

    val min_elt_opt : t -> elt option

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

    • since 4.05
    val max_elt : t -> elt

    Same as min_elt, but returns the largest element of the given set.

    val max_elt_opt : t -> elt option

    Same as min_elt_opt, but returns the largest element of the given set.

    • since 4.05
    val choose : t -> elt

    Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    val choose_opt : t -> elt option

    Return one element of the given set, or None if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    • since 4.05

    Searching

    val find : elt -> t -> elt

    find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

    • since 4.01
    val find_opt : elt -> t -> elt option

    find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

    • since 4.05
    val find_first : (elt -> bool) -> t -> elt

    find_first f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

    For example, find_first (fun e -> Ord.compare e x >= 0) s will return the first element e of s where Ord.compare e x >= 0 (intuitively: e >= x), or raise Not_found if x is greater than any element of s.

    • since 4.05
    val find_first_opt : (elt -> bool) -> t -> elt option

    find_first_opt f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

    • since 4.05
    val find_last : (elt -> bool) -> t -> elt

    find_last f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

    • since 4.05
    val find_last_opt : (elt -> bool) -> t -> elt option

    find_last_opt f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

    • since 4.05

    Traversing

    val iter : (elt -> unit) -> t -> unit

    iter f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.

    val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc

    fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

    Transforming

    val filter : (elt -> bool) -> t -> t

    filter f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val filter_map : (elt -> elt option) -> t -> t

    filter_map f s returns the set of all v such that f x = Some v for some element x of s.

    For example,

    filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) s

    is the set of halves of the even elements of s.

    If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned unchanged: the result of the function is then physically equal to s.

    • since 4.11
    val partition : (elt -> bool) -> t -> t * t

    partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

    val split : elt -> t -> t * bool * t

    split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.

    Predicates and comparisons

    val is_empty : t -> bool

    Test whether a set is empty or not.

    val mem : elt -> t -> bool

    mem x s tests whether x belongs to the set s.

    val equal : t -> t -> bool

    equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

    val compare : t -> t -> int

    Total ordering between sets. Can be used as the ordering function for doing sets of sets.

    val subset : t -> t -> bool

    subset s1 s2 tests whether the set s1 is a subset of the set s2.

    val for_all : (elt -> bool) -> t -> bool

    for_all f s checks if all elements of the set satisfy the predicate f.

    val exists : (elt -> bool) -> t -> bool

    exists f s checks if at least one element of the set satisfies the predicate f.

    Converting

    val to_list : t -> elt list

    to_list s is elements s.

    • since 5.1
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t

    to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

    • since 4.07
    val to_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in ascending order

    • since 4.07
    val to_rev_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in descending order

    • since 4.12
    val add_seq : elt Stdlib.Seq.t -> t -> t

    Add the given elements to the set, in order.

    • since 4.07
    val of_seq : elt Stdlib.Seq.t -> t

    Build a set from the given bindings

    • since 4.07
    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    val to_string : t -> string
    val of_list : elt list -> t
    val map : (elt -> elt) -> t -> t
    diff --git a/ocaml/Ident/T/index.html b/ocaml/Ident/T/index.html new file mode 100644 index 0000000..e63ff16 --- /dev/null +++ b/ocaml/Ident/T/index.html @@ -0,0 +1,2 @@ + +T (ocaml.Ident.T)

    Module Ident.T

    type t = t
    include Hashtbl.HashedType with type t := t
    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val hash : t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := t
    val compare : t -> t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    diff --git a/ocaml/Ident/Tbl/index.html b/ocaml/Ident/Tbl/index.html new file mode 100644 index 0000000..a835e0c --- /dev/null +++ b/ocaml/Ident/Tbl/index.html @@ -0,0 +1,2 @@ + +Tbl (ocaml.Ident.Tbl)

    Module Ident.Tbl

    include Hashtbl.S with type key = T.t and type 'a t = 'a Hashtbl.Make(T).t
    type key = T.t
    val create : int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    • since 4.00
    val copy : 'a t -> 'a t
    val add : 'a t -> key -> 'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    • since 4.05
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key -> 'a -> unit
    val mem : 'a t -> key -> bool
    val iter : (key -> 'a -> unit) -> 'a t -> unit
    val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
    • since 4.03
    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc
    val length : 'a t -> int
    val stats : 'a t -> Stdlib.Hashtbl.statistics
    • since 4.00
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
    • since 4.07
    val to_seq_keys : _ t -> key Stdlib.Seq.t
    • since 4.07
    val to_seq_values : 'a t -> 'a Stdlib.Seq.t
    • since 4.07
    val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
    • since 4.07
    val to_list : 'a t -> (T.t * 'a) list
    val of_list : (T.t * 'a) list -> 'a t
    val to_map : 'a t -> 'a Stdlib.Map.Make(T).t
    val of_map : 'a Stdlib.Map.Make(T).t -> 'a t
    val memoize : 'a t -> (key -> 'a) -> key -> 'a
    val map : 'a t -> ('a -> 'b) -> 'b t
    diff --git a/ocaml/Ident/index.html b/ocaml/Ident/index.html new file mode 100644 index 0000000..266fa76 --- /dev/null +++ b/ocaml/Ident/index.html @@ -0,0 +1,2 @@ + +Ident (ocaml.Ident)

    Module Ident

    type t
    include Identifiable.S with type t := t
    module T : Identifiable.Thing with type t = t
    include Identifiable.Thing with type t := T.t
    include Hashtbl.HashedType with type t := T.t
    val equal : T.t -> T.t -> bool

    The equality predicate used to compare keys.

    val hash : T.t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := T.t
    val output : out_channel -> T.t -> unit
    val print : Stdlib.Format.formatter -> T.t -> unit
    module Set : Identifiable.Set with module T := T
    module Map : Identifiable.Map with module T := T
    module Tbl : Identifiable.Tbl with module T := T
    val print_with_scope : Stdlib.Format.formatter -> t -> unit

    Same as print except that it will also add a "n" suffix if the scope of the argument is n.

    val create_scoped : scope:int -> string -> t
    val create_local : string -> t
    val create_persistent : string -> t
    val create_predef : string -> t
    val rename : t -> t

    Creates an identifier with the same name as the input, a fresh stamp, and no scope.

    • raises [Fatal_error]

      if called on a persistent / predef ident.

    val name : t -> string
    val unique_name : t -> string
    val unique_toplevel_name : t -> string
    val persistent : t -> bool
    val same : t -> t -> bool

    Compare identifiers by binding location. Two identifiers are the same either if they are both non-persistent and have been created by the same call to create_*, or if they are both persistent and have the same name.

    val compare : t -> t -> int
    val global : t -> bool
    val is_predef : t -> bool
    val scope : t -> int
    val lowest_scope : int
    val highest_scope : int
    val reinit : unit -> unit
    type 'a tbl

    'a tbl represents association tables from identifiers to values of type 'a.

    'a tbl plays the role of map, but bindings can be looked up from either the full Ident using find_same, or just its user-visible name using find_name. In general the two lookups may not return the same result, as an identifier may have been shadowed in the environment by a distinct identifier with the same name.

    find_all returns the bindings for all idents of a given name, most recently introduced first.

    In other words, 'a tbl corresponds to (Ident.t * 'a) list Map.Make(String) and the implementation is very close to that representation.

    Note in particular that searching among idents of the same name takes linear time, and that add simply extends the list without checking for duplicates. So it is not a good idea to implement union by repeated add calls, which may result in many duplicated identifiers and poor find_same performance. It is even possible to build overly large same-name lists such that non-recursive functions like find_all or fold_all blow the stack.

    You should probably use Map.Make(Ident) instead, unless you really need to query bindings by user-visible name, not just by unique identifiers.

    val empty : 'a tbl
    val add : t -> 'a -> 'a tbl -> 'a tbl
    val find_same : t -> 'a tbl -> 'a
    val find_name : string -> 'a tbl -> t * 'a
    val find_all : string -> 'a tbl -> (t * 'a) list
    val find_all_seq : string -> 'a tbl -> (t * 'a) Stdlib.Seq.t
    val fold_name : (t -> 'a -> 'b -> 'b) -> 'a tbl -> 'b -> 'b
    val fold_all : (t -> 'a -> 'b -> 'b) -> 'a tbl -> 'b -> 'b
    val iter : (t -> 'a -> unit) -> 'a tbl -> unit
    val remove : t -> 'a tbl -> 'a tbl
    val make_key_generator : unit -> t -> t
    diff --git a/ocaml/Identifiable/Make/Map/index.html b/ocaml/Identifiable/Make/Map/index.html new file mode 100644 index 0000000..67a35da --- /dev/null +++ b/ocaml/Identifiable/Make/Map/index.html @@ -0,0 +1,17 @@ + +Map (ocaml.Identifiable.Make.Map)

    Module Make.Map

    include Map.S with type key = T.t and type 'a t = 'a Map.Make(T).t

    Maps

    type key = T.t

    The type of the map keys.

    type 'a t = 'a Stdlib.Map.Make(T).t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key -> 'a -> 'a t -> 'a t

    add key data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key -> 'a -> 'a list t -> 'a list t

    add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

    update key f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : (key -> bool) -> 'a t -> key * 'a

    find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : (key -> bool) -> 'a t -> key * 'a

    find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : (key -> 'a -> unit) -> 'a t -> unit

    iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

    fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : (key -> 'a -> bool) -> 'a t -> 'a t

    filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : (key -> 'a -> bool) -> 'a t -> bool

    for_all f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : (key -> 'a -> bool) -> 'a t -> bool

    exists f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Stdlib.Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Stdlib.Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    val of_list : (key * 'a) list -> 'a t
    val disjoint_union : + ?eq:('a -> 'a -> bool) -> + ?print:(Stdlib.Format.formatter -> 'a -> unit) -> + 'a t -> + 'a t -> + 'a t

    disjoint_union m1 m2 contains all bindings from m1 and m2. If some binding is present in both and the associated value is not equal, a Fatal_error is raised

    val union_right : 'a t -> 'a t -> 'a t

    union_right m1 m2 contains all bindings from m1 and m2. If some binding is present in both, the one from m2 is taken

    val union_left : 'a t -> 'a t -> 'a t

    union_left m1 m2 = union_right m2 m1

    val union_merge : ('a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
    val rename : key t -> key -> key
    val map_keys : (key -> key) -> 'a t -> 'a t
    val keys : 'a t -> Stdlib.Set.Make(T).t
    val data : 'a t -> 'a list
    val of_set : (key -> 'a) -> Stdlib.Set.Make(T).t -> 'a t
    val transpose_keys_and_data : key t -> key t
    val transpose_keys_and_data_set : key t -> Stdlib.Set.Make(T).t t
    val print : + (Stdlib.Format.formatter -> 'a -> unit) -> + Stdlib.Format.formatter -> + 'a t -> + unit
    diff --git a/ocaml/Identifiable/Make/Set/index.html b/ocaml/Identifiable/Make/Set/index.html new file mode 100644 index 0000000..6d0f784 --- /dev/null +++ b/ocaml/Identifiable/Make/Set/index.html @@ -0,0 +1,2 @@ + +Set (ocaml.Identifiable.Make.Set)

    Module Make.Set

    include Set.S with type elt = T.t and type t = Set.Make(T).t

    Sets

    type elt = T.t

    The type of the set elements.

    The type of sets.

    val empty : t

    The empty set.

    val add : elt -> t -> t

    add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val singleton : elt -> t

    singleton x returns the one-element set containing only x.

    val remove : elt -> t -> t

    remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val union : t -> t -> t

    Set union.

    val inter : t -> t -> t

    Set intersection.

    val disjoint : t -> t -> bool

    Test if two sets are disjoint.

    • since 4.08
    val diff : t -> t -> t

    Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

    val cardinal : t -> int

    Return the number of elements of a set.

    Elements

    val elements : t -> elt list

    Return the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Set.Make.

    val min_elt : t -> elt

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

    val min_elt_opt : t -> elt option

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

    • since 4.05
    val max_elt : t -> elt

    Same as min_elt, but returns the largest element of the given set.

    val max_elt_opt : t -> elt option

    Same as min_elt_opt, but returns the largest element of the given set.

    • since 4.05
    val choose : t -> elt

    Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    val choose_opt : t -> elt option

    Return one element of the given set, or None if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    • since 4.05

    Searching

    val find : elt -> t -> elt

    find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

    • since 4.01
    val find_opt : elt -> t -> elt option

    find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

    • since 4.05
    val find_first : (elt -> bool) -> t -> elt

    find_first f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

    For example, find_first (fun e -> Ord.compare e x >= 0) s will return the first element e of s where Ord.compare e x >= 0 (intuitively: e >= x), or raise Not_found if x is greater than any element of s.

    • since 4.05
    val find_first_opt : (elt -> bool) -> t -> elt option

    find_first_opt f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

    • since 4.05
    val find_last : (elt -> bool) -> t -> elt

    find_last f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

    • since 4.05
    val find_last_opt : (elt -> bool) -> t -> elt option

    find_last_opt f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

    • since 4.05

    Traversing

    val iter : (elt -> unit) -> t -> unit

    iter f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.

    val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc

    fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

    Transforming

    val filter : (elt -> bool) -> t -> t

    filter f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val filter_map : (elt -> elt option) -> t -> t

    filter_map f s returns the set of all v such that f x = Some v for some element x of s.

    For example,

    filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) s

    is the set of halves of the even elements of s.

    If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned unchanged: the result of the function is then physically equal to s.

    • since 4.11
    val partition : (elt -> bool) -> t -> t * t

    partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

    val split : elt -> t -> t * bool * t

    split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.

    Predicates and comparisons

    val is_empty : t -> bool

    Test whether a set is empty or not.

    val mem : elt -> t -> bool

    mem x s tests whether x belongs to the set s.

    val equal : t -> t -> bool

    equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

    val compare : t -> t -> int

    Total ordering between sets. Can be used as the ordering function for doing sets of sets.

    val subset : t -> t -> bool

    subset s1 s2 tests whether the set s1 is a subset of the set s2.

    val for_all : (elt -> bool) -> t -> bool

    for_all f s checks if all elements of the set satisfy the predicate f.

    val exists : (elt -> bool) -> t -> bool

    exists f s checks if at least one element of the set satisfies the predicate f.

    Converting

    val to_list : t -> elt list

    to_list s is elements s.

    • since 5.1
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t

    to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

    • since 4.07
    val to_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in ascending order

    • since 4.07
    val to_rev_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in descending order

    • since 4.12
    val add_seq : elt Stdlib.Seq.t -> t -> t

    Add the given elements to the set, in order.

    • since 4.07
    val of_seq : elt Stdlib.Seq.t -> t

    Build a set from the given bindings

    • since 4.07
    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    val to_string : t -> string
    val of_list : elt list -> t
    val map : (elt -> elt) -> t -> t
    diff --git a/ocaml/Identifiable/Make/T/index.html b/ocaml/Identifiable/Make/T/index.html new file mode 100644 index 0000000..58eea6a --- /dev/null +++ b/ocaml/Identifiable/Make/T/index.html @@ -0,0 +1,2 @@ + +T (ocaml.Identifiable.Make.T)

    Module Make.T

    type t = T.t
    include Hashtbl.HashedType with type t := t
    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val hash : t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := t
    val compare : t -> t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    diff --git a/ocaml/Identifiable/Make/Tbl/index.html b/ocaml/Identifiable/Make/Tbl/index.html new file mode 100644 index 0000000..080c5bd --- /dev/null +++ b/ocaml/Identifiable/Make/Tbl/index.html @@ -0,0 +1,2 @@ + +Tbl (ocaml.Identifiable.Make.Tbl)

    Module Make.Tbl

    include Hashtbl.S with type key = T.t and type 'a t = 'a Hashtbl.Make(T).t
    type key = T.t
    val create : int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    • since 4.00
    val copy : 'a t -> 'a t
    val add : 'a t -> key -> 'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    • since 4.05
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key -> 'a -> unit
    val mem : 'a t -> key -> bool
    val iter : (key -> 'a -> unit) -> 'a t -> unit
    val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
    • since 4.03
    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc
    val length : 'a t -> int
    val stats : 'a t -> Stdlib.Hashtbl.statistics
    • since 4.00
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
    • since 4.07
    val to_seq_keys : _ t -> key Stdlib.Seq.t
    • since 4.07
    val to_seq_values : 'a t -> 'a Stdlib.Seq.t
    • since 4.07
    val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
    • since 4.07
    val to_list : 'a t -> (T.t * 'a) list
    val of_list : (T.t * 'a) list -> 'a t
    val to_map : 'a t -> 'a Stdlib.Map.Make(T).t
    val of_map : 'a Stdlib.Map.Make(T).t -> 'a t
    val memoize : 'a t -> (key -> 'a) -> key -> 'a
    val map : 'a t -> ('a -> 'b) -> 'b t
    diff --git a/ocaml/Identifiable/Make/argument-1-T/index.html b/ocaml/Identifiable/Make/argument-1-T/index.html new file mode 100644 index 0000000..5576a41 --- /dev/null +++ b/ocaml/Identifiable/Make/argument-1-T/index.html @@ -0,0 +1,2 @@ + +T (ocaml.Identifiable.Make.T)

    Parameter Make.T

    type t
    include Hashtbl.HashedType with type t := t
    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val hash : t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := t
    val compare : t -> t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    diff --git a/ocaml/Identifiable/Make/index.html b/ocaml/Identifiable/Make/index.html new file mode 100644 index 0000000..8750f6f --- /dev/null +++ b/ocaml/Identifiable/Make/index.html @@ -0,0 +1,2 @@ + +Make (ocaml.Identifiable.Make)

    Module Identifiable.Make

    Parameters

    module T : Thing

    Signature

    module T : Thing with type t = T.t
    include Thing with type t := T.t
    include Hashtbl.HashedType with type t := T.t
    val equal : T.t -> T.t -> bool

    The equality predicate used to compare keys.

    val hash : T.t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := T.t
    val compare : T.t -> T.t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> T.t -> unit
    val print : Stdlib.Format.formatter -> T.t -> unit
    module Set : Set with module T := T
    module Map : Map with module T := T
    module Tbl : Tbl with module T := T
    diff --git a/ocaml/Identifiable/Pair/argument-1-A/index.html b/ocaml/Identifiable/Pair/argument-1-A/index.html new file mode 100644 index 0000000..a741ded --- /dev/null +++ b/ocaml/Identifiable/Pair/argument-1-A/index.html @@ -0,0 +1,2 @@ + +A (ocaml.Identifiable.Pair.A)

    Parameter Pair.A

    type t
    include Hashtbl.HashedType with type t := t
    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val hash : t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := t
    val compare : t -> t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    diff --git a/ocaml/Identifiable/Pair/argument-2-B/index.html b/ocaml/Identifiable/Pair/argument-2-B/index.html new file mode 100644 index 0000000..d35908c --- /dev/null +++ b/ocaml/Identifiable/Pair/argument-2-B/index.html @@ -0,0 +1,2 @@ + +B (ocaml.Identifiable.Pair.B)

    Parameter Pair.B

    type t
    include Hashtbl.HashedType with type t := t
    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val hash : t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := t
    val compare : t -> t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    diff --git a/ocaml/Identifiable/Pair/index.html b/ocaml/Identifiable/Pair/index.html new file mode 100644 index 0000000..d28546e --- /dev/null +++ b/ocaml/Identifiable/Pair/index.html @@ -0,0 +1,2 @@ + +Pair (ocaml.Identifiable.Pair)

    Module Identifiable.Pair

    Parameters

    module A : Thing
    module B : Thing

    Signature

    type t = A.t * B.t
    include Hashtbl.HashedType with type t := t
    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val hash : t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := t
    val compare : t -> t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    diff --git a/ocaml/Identifiable/index.html b/ocaml/Identifiable/index.html new file mode 100644 index 0000000..aaf5563 --- /dev/null +++ b/ocaml/Identifiable/index.html @@ -0,0 +1,2 @@ + +Identifiable (ocaml.Identifiable)

    Module Identifiable

    Uniform interface for common data structures over various things.

    Warning: this module is unstable and part of compiler-libs.

    module type Thing = sig ... end
    module Pair (A : Thing) (B : Thing) : Thing with type t = A.t * B.t
    module type Set = sig ... end
    module type Map = sig ... end
    module type Tbl = sig ... end
    module type S = sig ... end
    module Make (T : Thing) : S with type t := T.t
    diff --git a/ocaml/Identifiable/module-type-Map/T/index.html b/ocaml/Identifiable/module-type-Map/T/index.html new file mode 100644 index 0000000..9cf7393 --- /dev/null +++ b/ocaml/Identifiable/module-type-Map/T/index.html @@ -0,0 +1,2 @@ + +T (ocaml.Identifiable.Map.T)

    Module Map.T

    type t

    The type of the map keys.

    val compare : t -> t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    diff --git a/ocaml/Identifiable/module-type-Map/index.html b/ocaml/Identifiable/module-type-Map/index.html new file mode 100644 index 0000000..9966f6b --- /dev/null +++ b/ocaml/Identifiable/module-type-Map/index.html @@ -0,0 +1,17 @@ + +Map (ocaml.Identifiable.Map)

    Module type Identifiable.Map

    include Map.S with type key = T.t and type 'a t = 'a Map.Make(T).t

    Maps

    type key = T.t

    The type of the map keys.

    type 'a t = 'a Stdlib.Map.Make(T).t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key -> 'a -> 'a t -> 'a t

    add key data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key -> 'a -> 'a list t -> 'a list t

    add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

    update key f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : (key -> bool) -> 'a t -> key * 'a

    find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : (key -> bool) -> 'a t -> key * 'a

    find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : (key -> 'a -> unit) -> 'a t -> unit

    iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

    fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : (key -> 'a -> bool) -> 'a t -> 'a t

    filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : (key -> 'a -> bool) -> 'a t -> bool

    for_all f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : (key -> 'a -> bool) -> 'a t -> bool

    exists f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Stdlib.Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Stdlib.Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    val of_list : (key * 'a) list -> 'a t
    val disjoint_union : + ?eq:('a -> 'a -> bool) -> + ?print:(Stdlib.Format.formatter -> 'a -> unit) -> + 'a t -> + 'a t -> + 'a t

    disjoint_union m1 m2 contains all bindings from m1 and m2. If some binding is present in both and the associated value is not equal, a Fatal_error is raised

    val union_right : 'a t -> 'a t -> 'a t

    union_right m1 m2 contains all bindings from m1 and m2. If some binding is present in both, the one from m2 is taken

    val union_left : 'a t -> 'a t -> 'a t

    union_left m1 m2 = union_right m2 m1

    val union_merge : ('a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
    val rename : key t -> key -> key
    val map_keys : (key -> key) -> 'a t -> 'a t
    val keys : 'a t -> Stdlib.Set.Make(T).t
    val data : 'a t -> 'a list
    val of_set : (key -> 'a) -> Stdlib.Set.Make(T).t -> 'a t
    val transpose_keys_and_data : key t -> key t
    val transpose_keys_and_data_set : key t -> Stdlib.Set.Make(T).t t
    val print : + (Stdlib.Format.formatter -> 'a -> unit) -> + Stdlib.Format.formatter -> + 'a t -> + unit
    diff --git a/ocaml/Identifiable/module-type-S/Map/index.html b/ocaml/Identifiable/module-type-S/Map/index.html new file mode 100644 index 0000000..951354b --- /dev/null +++ b/ocaml/Identifiable/module-type-S/Map/index.html @@ -0,0 +1,17 @@ + +Map (ocaml.Identifiable.S.Map)

    Module S.Map

    include Map.S with type key = T.t and type 'a t = 'a Map.Make(T).t

    Maps

    type key = T.t

    The type of the map keys.

    type 'a t = 'a Stdlib.Map.Make(T).t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key -> 'a -> 'a t -> 'a t

    add key data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key -> 'a -> 'a list t -> 'a list t

    add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

    update key f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : (key -> bool) -> 'a t -> key * 'a

    find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : (key -> bool) -> 'a t -> key * 'a

    find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : (key -> 'a -> unit) -> 'a t -> unit

    iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

    fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : (key -> 'a -> bool) -> 'a t -> 'a t

    filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : (key -> 'a -> bool) -> 'a t -> bool

    for_all f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : (key -> 'a -> bool) -> 'a t -> bool

    exists f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Stdlib.Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Stdlib.Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    val of_list : (key * 'a) list -> 'a t
    val disjoint_union : + ?eq:('a -> 'a -> bool) -> + ?print:(Stdlib.Format.formatter -> 'a -> unit) -> + 'a t -> + 'a t -> + 'a t

    disjoint_union m1 m2 contains all bindings from m1 and m2. If some binding is present in both and the associated value is not equal, a Fatal_error is raised

    val union_right : 'a t -> 'a t -> 'a t

    union_right m1 m2 contains all bindings from m1 and m2. If some binding is present in both, the one from m2 is taken

    val union_left : 'a t -> 'a t -> 'a t

    union_left m1 m2 = union_right m2 m1

    val union_merge : ('a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
    val rename : key t -> key -> key
    val map_keys : (key -> key) -> 'a t -> 'a t
    val keys : 'a t -> Stdlib.Set.Make(T).t
    val data : 'a t -> 'a list
    val of_set : (key -> 'a) -> Stdlib.Set.Make(T).t -> 'a t
    val transpose_keys_and_data : key t -> key t
    val transpose_keys_and_data_set : key t -> Stdlib.Set.Make(T).t t
    val print : + (Stdlib.Format.formatter -> 'a -> unit) -> + Stdlib.Format.formatter -> + 'a t -> + unit
    diff --git a/ocaml/Identifiable/module-type-S/Set/index.html b/ocaml/Identifiable/module-type-S/Set/index.html new file mode 100644 index 0000000..182fda9 --- /dev/null +++ b/ocaml/Identifiable/module-type-S/Set/index.html @@ -0,0 +1,2 @@ + +Set (ocaml.Identifiable.S.Set)

    Module S.Set

    include Set.S with type elt = T.t and type t = Set.Make(T).t

    Sets

    type elt = T.t

    The type of the set elements.

    The type of sets.

    val empty : t

    The empty set.

    val add : elt -> t -> t

    add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val singleton : elt -> t

    singleton x returns the one-element set containing only x.

    val remove : elt -> t -> t

    remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val union : t -> t -> t

    Set union.

    val inter : t -> t -> t

    Set intersection.

    val disjoint : t -> t -> bool

    Test if two sets are disjoint.

    • since 4.08
    val diff : t -> t -> t

    Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

    val cardinal : t -> int

    Return the number of elements of a set.

    Elements

    val elements : t -> elt list

    Return the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Set.Make.

    val min_elt : t -> elt

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

    val min_elt_opt : t -> elt option

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

    • since 4.05
    val max_elt : t -> elt

    Same as min_elt, but returns the largest element of the given set.

    val max_elt_opt : t -> elt option

    Same as min_elt_opt, but returns the largest element of the given set.

    • since 4.05
    val choose : t -> elt

    Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    val choose_opt : t -> elt option

    Return one element of the given set, or None if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    • since 4.05

    Searching

    val find : elt -> t -> elt

    find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

    • since 4.01
    val find_opt : elt -> t -> elt option

    find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

    • since 4.05
    val find_first : (elt -> bool) -> t -> elt

    find_first f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

    For example, find_first (fun e -> Ord.compare e x >= 0) s will return the first element e of s where Ord.compare e x >= 0 (intuitively: e >= x), or raise Not_found if x is greater than any element of s.

    • since 4.05
    val find_first_opt : (elt -> bool) -> t -> elt option

    find_first_opt f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

    • since 4.05
    val find_last : (elt -> bool) -> t -> elt

    find_last f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

    • since 4.05
    val find_last_opt : (elt -> bool) -> t -> elt option

    find_last_opt f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

    • since 4.05

    Traversing

    val iter : (elt -> unit) -> t -> unit

    iter f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.

    val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc

    fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

    Transforming

    val filter : (elt -> bool) -> t -> t

    filter f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val filter_map : (elt -> elt option) -> t -> t

    filter_map f s returns the set of all v such that f x = Some v for some element x of s.

    For example,

    filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) s

    is the set of halves of the even elements of s.

    If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned unchanged: the result of the function is then physically equal to s.

    • since 4.11
    val partition : (elt -> bool) -> t -> t * t

    partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

    val split : elt -> t -> t * bool * t

    split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.

    Predicates and comparisons

    val is_empty : t -> bool

    Test whether a set is empty or not.

    val mem : elt -> t -> bool

    mem x s tests whether x belongs to the set s.

    val equal : t -> t -> bool

    equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

    val compare : t -> t -> int

    Total ordering between sets. Can be used as the ordering function for doing sets of sets.

    val subset : t -> t -> bool

    subset s1 s2 tests whether the set s1 is a subset of the set s2.

    val for_all : (elt -> bool) -> t -> bool

    for_all f s checks if all elements of the set satisfy the predicate f.

    val exists : (elt -> bool) -> t -> bool

    exists f s checks if at least one element of the set satisfies the predicate f.

    Converting

    val to_list : t -> elt list

    to_list s is elements s.

    • since 5.1
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t

    to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

    • since 4.07
    val to_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in ascending order

    • since 4.07
    val to_rev_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in descending order

    • since 4.12
    val add_seq : elt Stdlib.Seq.t -> t -> t

    Add the given elements to the set, in order.

    • since 4.07
    val of_seq : elt Stdlib.Seq.t -> t

    Build a set from the given bindings

    • since 4.07
    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    val to_string : t -> string
    val of_list : elt list -> t
    val map : (elt -> elt) -> t -> t
    diff --git a/ocaml/Identifiable/module-type-S/T/index.html b/ocaml/Identifiable/module-type-S/T/index.html new file mode 100644 index 0000000..d3ca6e9 --- /dev/null +++ b/ocaml/Identifiable/module-type-S/T/index.html @@ -0,0 +1,2 @@ + +T (ocaml.Identifiable.S.T)

    Module S.T

    type t = t
    include Hashtbl.HashedType with type t := t
    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val hash : t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := t
    val compare : t -> t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    diff --git a/ocaml/Identifiable/module-type-S/Tbl/index.html b/ocaml/Identifiable/module-type-S/Tbl/index.html new file mode 100644 index 0000000..bd19f99 --- /dev/null +++ b/ocaml/Identifiable/module-type-S/Tbl/index.html @@ -0,0 +1,2 @@ + +Tbl (ocaml.Identifiable.S.Tbl)

    Module S.Tbl

    include Hashtbl.S with type key = T.t and type 'a t = 'a Hashtbl.Make(T).t
    type key = T.t
    val create : int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    • since 4.00
    val copy : 'a t -> 'a t
    val add : 'a t -> key -> 'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    • since 4.05
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key -> 'a -> unit
    val mem : 'a t -> key -> bool
    val iter : (key -> 'a -> unit) -> 'a t -> unit
    val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
    • since 4.03
    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc
    val length : 'a t -> int
    val stats : 'a t -> Stdlib.Hashtbl.statistics
    • since 4.00
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
    • since 4.07
    val to_seq_keys : _ t -> key Stdlib.Seq.t
    • since 4.07
    val to_seq_values : 'a t -> 'a Stdlib.Seq.t
    • since 4.07
    val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
    • since 4.07
    val to_list : 'a t -> (T.t * 'a) list
    val of_list : (T.t * 'a) list -> 'a t
    val to_map : 'a t -> 'a Stdlib.Map.Make(T).t
    val of_map : 'a Stdlib.Map.Make(T).t -> 'a t
    val memoize : 'a t -> (key -> 'a) -> key -> 'a
    val map : 'a t -> ('a -> 'b) -> 'b t
    diff --git a/ocaml/Identifiable/module-type-S/index.html b/ocaml/Identifiable/module-type-S/index.html new file mode 100644 index 0000000..66bf630 --- /dev/null +++ b/ocaml/Identifiable/module-type-S/index.html @@ -0,0 +1,2 @@ + +S (ocaml.Identifiable.S)

    Module type Identifiable.S

    type t
    module T : Thing with type t = t
    include Thing with type t := T.t
    include Hashtbl.HashedType with type t := T.t
    val equal : T.t -> T.t -> bool

    The equality predicate used to compare keys.

    val hash : T.t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := T.t
    val compare : T.t -> T.t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> T.t -> unit
    val print : Stdlib.Format.formatter -> T.t -> unit
    module Set : Set with module T := T
    module Map : Map with module T := T
    module Tbl : Tbl with module T := T
    diff --git a/ocaml/Identifiable/module-type-Set/T/index.html b/ocaml/Identifiable/module-type-Set/T/index.html new file mode 100644 index 0000000..403b49c --- /dev/null +++ b/ocaml/Identifiable/module-type-Set/T/index.html @@ -0,0 +1,2 @@ + +T (ocaml.Identifiable.Set.T)

    Module Set.T

    type t

    The type of the set elements.

    val compare : t -> t -> int

    A total ordering function over the set elements. This is a two-argument function f such that f e1 e2 is zero if the elements e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    diff --git a/ocaml/Identifiable/module-type-Set/index.html b/ocaml/Identifiable/module-type-Set/index.html new file mode 100644 index 0000000..873970a --- /dev/null +++ b/ocaml/Identifiable/module-type-Set/index.html @@ -0,0 +1,2 @@ + +Set (ocaml.Identifiable.Set)

    Module type Identifiable.Set

    include Set.S with type elt = T.t and type t = Set.Make(T).t

    Sets

    type elt = T.t

    The type of the set elements.

    The type of sets.

    val empty : t

    The empty set.

    val add : elt -> t -> t

    add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val singleton : elt -> t

    singleton x returns the one-element set containing only x.

    val remove : elt -> t -> t

    remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val union : t -> t -> t

    Set union.

    val inter : t -> t -> t

    Set intersection.

    val disjoint : t -> t -> bool

    Test if two sets are disjoint.

    • since 4.08
    val diff : t -> t -> t

    Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

    val cardinal : t -> int

    Return the number of elements of a set.

    Elements

    val elements : t -> elt list

    Return the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Set.Make.

    val min_elt : t -> elt

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

    val min_elt_opt : t -> elt option

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

    • since 4.05
    val max_elt : t -> elt

    Same as min_elt, but returns the largest element of the given set.

    val max_elt_opt : t -> elt option

    Same as min_elt_opt, but returns the largest element of the given set.

    • since 4.05
    val choose : t -> elt

    Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    val choose_opt : t -> elt option

    Return one element of the given set, or None if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    • since 4.05

    Searching

    val find : elt -> t -> elt

    find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

    • since 4.01
    val find_opt : elt -> t -> elt option

    find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

    • since 4.05
    val find_first : (elt -> bool) -> t -> elt

    find_first f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

    For example, find_first (fun e -> Ord.compare e x >= 0) s will return the first element e of s where Ord.compare e x >= 0 (intuitively: e >= x), or raise Not_found if x is greater than any element of s.

    • since 4.05
    val find_first_opt : (elt -> bool) -> t -> elt option

    find_first_opt f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

    • since 4.05
    val find_last : (elt -> bool) -> t -> elt

    find_last f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

    • since 4.05
    val find_last_opt : (elt -> bool) -> t -> elt option

    find_last_opt f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

    • since 4.05

    Traversing

    val iter : (elt -> unit) -> t -> unit

    iter f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.

    val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc

    fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

    Transforming

    val filter : (elt -> bool) -> t -> t

    filter f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val filter_map : (elt -> elt option) -> t -> t

    filter_map f s returns the set of all v such that f x = Some v for some element x of s.

    For example,

    filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) s

    is the set of halves of the even elements of s.

    If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned unchanged: the result of the function is then physically equal to s.

    • since 4.11
    val partition : (elt -> bool) -> t -> t * t

    partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

    val split : elt -> t -> t * bool * t

    split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.

    Predicates and comparisons

    val is_empty : t -> bool

    Test whether a set is empty or not.

    val mem : elt -> t -> bool

    mem x s tests whether x belongs to the set s.

    val equal : t -> t -> bool

    equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

    val compare : t -> t -> int

    Total ordering between sets. Can be used as the ordering function for doing sets of sets.

    val subset : t -> t -> bool

    subset s1 s2 tests whether the set s1 is a subset of the set s2.

    val for_all : (elt -> bool) -> t -> bool

    for_all f s checks if all elements of the set satisfy the predicate f.

    val exists : (elt -> bool) -> t -> bool

    exists f s checks if at least one element of the set satisfies the predicate f.

    Converting

    val to_list : t -> elt list

    to_list s is elements s.

    • since 5.1
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t

    to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

    • since 4.07
    val to_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in ascending order

    • since 4.07
    val to_rev_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in descending order

    • since 4.12
    val add_seq : elt Stdlib.Seq.t -> t -> t

    Add the given elements to the set, in order.

    • since 4.07
    val of_seq : elt Stdlib.Seq.t -> t

    Build a set from the given bindings

    • since 4.07
    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    val to_string : t -> string
    val of_list : elt list -> t
    val map : (elt -> elt) -> t -> t
    diff --git a/ocaml/Identifiable/module-type-Tbl/T/index.html b/ocaml/Identifiable/module-type-Tbl/T/index.html new file mode 100644 index 0000000..193dae1 --- /dev/null +++ b/ocaml/Identifiable/module-type-Tbl/T/index.html @@ -0,0 +1,2 @@ + +T (ocaml.Identifiable.Tbl.T)

    Module Tbl.T

    type t
    include Map.OrderedType with type t := t
    val compare : t -> t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    include Hashtbl.HashedType with type t := t
    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val hash : t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    diff --git a/ocaml/Identifiable/module-type-Tbl/index.html b/ocaml/Identifiable/module-type-Tbl/index.html new file mode 100644 index 0000000..5b3eaec --- /dev/null +++ b/ocaml/Identifiable/module-type-Tbl/index.html @@ -0,0 +1,2 @@ + +Tbl (ocaml.Identifiable.Tbl)

    Module type Identifiable.Tbl

    module T : sig ... end
    include Hashtbl.S with type key = T.t and type 'a t = 'a Hashtbl.Make(T).t
    type key = T.t
    val create : int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    • since 4.00
    val copy : 'a t -> 'a t
    val add : 'a t -> key -> 'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    • since 4.05
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key -> 'a -> unit
    val mem : 'a t -> key -> bool
    val iter : (key -> 'a -> unit) -> 'a t -> unit
    val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
    • since 4.03
    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc
    val length : 'a t -> int
    val stats : 'a t -> Stdlib.Hashtbl.statistics
    • since 4.00
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
    • since 4.07
    val to_seq_keys : _ t -> key Stdlib.Seq.t
    • since 4.07
    val to_seq_values : 'a t -> 'a Stdlib.Seq.t
    • since 4.07
    val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
    • since 4.07
    val to_list : 'a t -> (T.t * 'a) list
    val of_list : (T.t * 'a) list -> 'a t
    val to_map : 'a t -> 'a Stdlib.Map.Make(T).t
    val of_map : 'a Stdlib.Map.Make(T).t -> 'a t
    val memoize : 'a t -> (key -> 'a) -> key -> 'a
    val map : 'a t -> ('a -> 'b) -> 'b t
    diff --git a/ocaml/Identifiable/module-type-Thing/index.html b/ocaml/Identifiable/module-type-Thing/index.html new file mode 100644 index 0000000..5049266 --- /dev/null +++ b/ocaml/Identifiable/module-type-Thing/index.html @@ -0,0 +1,2 @@ + +Thing (ocaml.Identifiable.Thing)

    Module type Identifiable.Thing

    type t
    include Hashtbl.HashedType with type t := t
    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val hash : t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := t
    val compare : t -> t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    diff --git a/ocaml/Import_approx/index.html b/ocaml/Import_approx/index.html new file mode 100644 index 0000000..9e45f7c --- /dev/null +++ b/ocaml/Import_approx/index.html @@ -0,0 +1,2 @@ + +Import_approx (ocaml.Import_approx)

    Module Import_approx

    Create simple value approximations from the export information in .cmx files.

    Given an approximation description, load .cmx files (possibly more than one) until the description is fully resolved. If a necessary .cmx file cannot be found, "unresolved" will be returned.

    val really_import_approx : Simple_value_approx.t -> Simple_value_approx.t

    Maps the description of the given approximation through really_import.

    val import_symbol : Symbol.t -> Simple_value_approx.t

    Read and convert the approximation of a given symbol from the relevant .cmx file. Unlike the "really_" functions, this does not continue to load .cmx files until the approximation is fully resolved.

    diff --git a/ocaml/Includeclass/index.html b/ocaml/Includeclass/index.html new file mode 100644 index 0000000..79144dc --- /dev/null +++ b/ocaml/Includeclass/index.html @@ -0,0 +1,19 @@ + +Includeclass (ocaml.Includeclass)

    Module Includeclass

    val class_types : + Env.t -> + Types.class_type -> + Types.class_type -> + Ctype.class_match_failure list
    val class_type_declarations : + loc:Location.t -> + Env.t -> + Types.class_type_declaration -> + Types.class_type_declaration -> + Ctype.class_match_failure list
    val report_error : + Printtyp.type_or_scheme -> + Stdlib.Format.formatter -> + Ctype.class_match_failure list -> + unit
    diff --git a/ocaml/Includecore/index.html b/ocaml/Includecore/index.html new file mode 100644 index 0000000..d097f9d --- /dev/null +++ b/ocaml/Includecore/index.html @@ -0,0 +1,51 @@ + +Includecore (ocaml.Includecore)

    Module Includecore

    type position = Errortrace.position =
    1. | First
    2. | Second
    type primitive_mismatch =
    1. | Name
    2. | Arity
    3. | No_alloc of position
    4. | Native_name
    5. | Result_repr
    6. | Argument_repr of int
    type value_mismatch =
    1. | Primitive_mismatch of primitive_mismatch
    2. | Not_a_primitive
    3. | Type of Errortrace.moregen_error
    exception Dont_match of value_mismatch
    type privacy_mismatch =
    1. | Private_type_abbreviation
    2. | Private_variant_type
    3. | Private_record_type
    4. | Private_extensible_variant
    5. | Private_row_type
    type type_kind =
    1. | Kind_abstract
    2. | Kind_record
    3. | Kind_variant
    4. | Kind_open
    type kind_mismatch = type_kind * type_kind
    type label_mismatch =
    1. | Type of Errortrace.equality_error
    2. | Mutability of position
    type record_change = + (Types.label_declaration as 'ld, 'ld, label_mismatch) + Diffing_with_keys.change
    type record_mismatch =
    1. | Label_mismatch of record_change list
    2. | Unboxed_float_representation of position
    type constructor_mismatch =
    1. | Type of Errortrace.equality_error
    2. | Arity
    3. | Inline_record of record_change list
    4. | Kind of position
    5. | Explicit_return_type of position
    type extension_constructor_mismatch =
    1. | Constructor_privacy
    2. | Constructor_mismatch of Ident.t + * Types.extension_constructor + * Types.extension_constructor + * constructor_mismatch
    type private_variant_mismatch =
    1. | Only_outer_closed
    2. | Missing of position * string
    3. | Presence of string
    4. | Incompatible_types_for of string
    5. | Types of Errortrace.equality_error
    type private_object_mismatch =
    1. | Missing of string
    2. | Types of Errortrace.equality_error
    type type_mismatch =
    1. | Arity
    2. | Privacy of privacy_mismatch
    3. | Kind of kind_mismatch
    4. | Constraint of Errortrace.equality_error
    5. | Manifest of Errortrace.equality_error
    6. | Private_variant of Types.type_expr * Types.type_expr * private_variant_mismatch
    7. | Private_object of Types.type_expr * Types.type_expr * private_object_mismatch
    8. | Variance
    9. | Record_mismatch of record_mismatch
    10. | Variant_mismatch of variant_change list
    11. | Unboxed_representation of position
    12. | Immediate of Type_immediacy.Violation.t
    val value_descriptions : + loc:Location.t -> + Env.t -> + string -> + Types.value_description -> + Types.value_description -> + Typedtree.module_coercion
    val type_declarations : + ?equality:bool -> + loc:Location.t -> + Env.t -> + mark:bool -> + string -> + Types.type_declaration -> + Path.t -> + Types.type_declaration -> + type_mismatch option
    val extension_constructors : + loc:Location.t -> + Env.t -> + mark:bool -> + Ident.t -> + Types.extension_constructor -> + Types.extension_constructor -> + extension_constructor_mismatch option
    val report_value_mismatch : + string -> + string -> + Env.t -> + Stdlib.Format.formatter -> + value_mismatch -> + unit
    val report_type_mismatch : + string -> + string -> + string -> + Env.t -> + Stdlib.Format.formatter -> + type_mismatch -> + unit
    val report_extension_constructor_mismatch : + string -> + string -> + string -> + Env.t -> + Stdlib.Format.formatter -> + extension_constructor_mismatch -> + unit
    diff --git a/ocaml/Includemod/Error/index.html b/ocaml/Includemod/Error/index.html new file mode 100644 index 0000000..5938526 --- /dev/null +++ b/ocaml/Includemod/Error/index.html @@ -0,0 +1,13 @@ + +Error (ocaml.Includemod.Error)

    Module Includemod.Error

    type ('elt, 'explanation) diff = {
    1. got : 'elt;
    2. expected : 'elt;
    3. symptom : 'explanation;
    }
    type 'elt core_diff = ('elt, unit) diff
    type functor_arg_descr =
    1. | Anonymous
    2. | Named of Path.t
    3. | Unit
    4. | Empty_struct
      (*

      For backward compatibility's sake, an empty struct can be implicitly converted to an unit module.

      *)
    type core_sigitem_symptom =
    1. | Value_descriptions of (Types.value_description, Includecore.value_mismatch) + diff
    2. | Type_declarations of (Types.type_declaration, Includecore.type_mismatch) diff
    3. | Extension_constructors of (Types.extension_constructor, + Includecore.extension_constructor_mismatch) + diff
    4. | Class_type_declarations of (Types.class_type_declaration, + Ctype.class_match_failure list) + diff
    5. | Class_declarations of (Types.class_declaration, Ctype.class_match_failure list) + diff
    type core_module_type_symptom =
    1. | Not_an_alias
    2. | Not_an_identifier
    3. | Incompatible_aliases
    4. | Abstract_module_type
    5. | Unbound_module_path of Path.t
    type module_type_symptom =
    1. | Mt_core of core_module_type_symptom
    2. | Signature of signature_symptom
    3. | Functor of functor_symptom
    4. | Invalid_module_alias of Path.t
    5. | After_alias_expansion of module_type_diff
    and module_type_diff = (Types.module_type, module_type_symptom) diff
    and functor_symptom =
    1. | Params of functor_params_diff
    2. | Result of module_type_diff
    and ('arg, 'path) functor_param_symptom =
    1. | Incompatible_params of 'arg * Types.functor_parameter
    2. | Mismatch of module_type_diff
    and arg_functor_param_symptom = + (Types.functor_parameter, Ident.t) functor_param_symptom
    and functor_params_diff = + (Types.functor_parameter list * Types.module_type) core_diff
    and signature_symptom = {
    1. env : Env.t;
    2. missings : Types.signature_item list;
    3. incompatibles : (Ident.t * sigitem_symptom) list;
    4. oks : (int * Typedtree.module_coercion) list;
    5. leftovers : (Types.signature_item as 'it * 'it * int) list;
      (*

      signature items that could not be compared due to type divergence

      *)
    }
    and sigitem_symptom =
    1. | Core of core_sigitem_symptom
    2. | Module_type_declaration of (Types.modtype_declaration, + module_type_declaration_symptom) + diff
    3. | Module_type of module_type_diff
    and module_type_declaration_symptom =
    1. | Illegal_permutation of Typedtree.module_coercion
    2. | Not_greater_than of module_type_diff
    3. | Not_less_than of module_type_diff
    4. | Incomparable of {
      1. less_than : module_type_diff;
      2. greater_than : module_type_diff;
      }
    type all =
    1. | In_Compilation_unit of (string, signature_symptom) diff
    2. | In_Signature of signature_symptom
    3. | In_Module_type of module_type_diff
    4. | In_Module_type_substitution of Ident.t + * (Types.module_type, module_type_declaration_symptom) diff
    5. | In_Type_declaration of Ident.t * core_sigitem_symptom
    6. | In_Expansion of core_module_type_symptom
    diff --git a/ocaml/Includemod/FieldMap/index.html b/ocaml/Includemod/FieldMap/index.html new file mode 100644 index 0000000..67fd0de --- /dev/null +++ b/ocaml/Includemod/FieldMap/index.html @@ -0,0 +1,8 @@ + +FieldMap (ocaml.Includemod.FieldMap)

    Module Includemod.FieldMap

    Map indexed by both field types and names. This avoids name clashes between different sorts of fields such as values and types.

    Maps

    type key = field_desc

    The type of the map keys.

    type !+'a t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key -> 'a -> 'a t -> 'a t

    add key data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key -> 'a -> 'a list t -> 'a list t

    add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

    update key f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : (key -> bool) -> 'a t -> key * 'a

    find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : (key -> bool) -> 'a t -> key * 'a

    find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : (key -> 'a -> unit) -> 'a t -> unit

    iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

    fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : (key -> 'a -> bool) -> 'a t -> 'a t

    filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : (key -> 'a -> bool) -> 'a t -> bool

    for_all f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : (key -> 'a -> bool) -> 'a t -> bool

    exists f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val of_list : (key * 'a) list -> 'a t

    of_list bs adds the bindings of bs to the empty map, in list order (if a key is bound twice in bs the last one takes over).

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    diff --git a/ocaml/Includemod/Functor_app_diff/Defs/index.html b/ocaml/Includemod/Functor_app_diff/Defs/index.html new file mode 100644 index 0000000..302b645 --- /dev/null +++ b/ocaml/Includemod/Functor_app_diff/Defs/index.html @@ -0,0 +1,2 @@ + +Defs (ocaml.Includemod.Functor_app_diff.Defs)

    Module Functor_app_diff.Defs

    type state
    diff --git a/ocaml/Includemod/Functor_app_diff/index.html b/ocaml/Includemod/Functor_app_diff/index.html new file mode 100644 index 0000000..bf3908b --- /dev/null +++ b/ocaml/Includemod/Functor_app_diff/index.html @@ -0,0 +1,6 @@ + +Functor_app_diff (ocaml.Includemod.Functor_app_diff)

    Module Includemod.Functor_app_diff

    module Defs : sig ... end
    diff --git a/ocaml/Includemod/Functor_inclusion_diff/Defs/index.html b/ocaml/Includemod/Functor_inclusion_diff/Defs/index.html new file mode 100644 index 0000000..19c1895 --- /dev/null +++ b/ocaml/Includemod/Functor_inclusion_diff/Defs/index.html @@ -0,0 +1,2 @@ + +Defs (ocaml.Includemod.Functor_inclusion_diff.Defs)

    Module Functor_inclusion_diff.Defs

    type right = left
    type state
    diff --git a/ocaml/Includemod/Functor_inclusion_diff/index.html b/ocaml/Includemod/Functor_inclusion_diff/index.html new file mode 100644 index 0000000..ce7fd97 --- /dev/null +++ b/ocaml/Includemod/Functor_inclusion_diff/index.html @@ -0,0 +1,6 @@ + +Functor_inclusion_diff (ocaml.Includemod.Functor_inclusion_diff)

    Module Includemod.Functor_inclusion_diff

    module Defs : sig ... end
    diff --git a/ocaml/Includemod/index.html b/ocaml/Includemod/index.html new file mode 100644 index 0000000..74a63e6 --- /dev/null +++ b/ocaml/Includemod/index.html @@ -0,0 +1,79 @@ + +Includemod (ocaml.Includemod)

    Module Includemod

    type mark =
    1. | Mark_both
      (*

      Mark definitions used from both arguments

      *)
    2. | Mark_positive
      (*

      Mark definitions used from the positive (first) argument

      *)
    3. | Mark_negative
      (*

      Mark definitions used from the negative (second) argument

      *)
    4. | Mark_neither
      (*

      Do not mark definitions used from either argument

      *)

    Type describing which arguments of an inclusion to consider as used for the usage warnings. Mark_both is the default.

    module Error : sig ... end
    type explanation = Env.t * Error.all
    type field_kind =
    1. | Field_value
    2. | Field_type
    3. | Field_exception
    4. | Field_typext
    5. | Field_module
    6. | Field_modtype
    7. | Field_class
    8. | Field_classtype
    type field_desc = {
    1. name : string;
    2. kind : field_kind;
    }
    val kind_of_field_desc : field_desc -> string
    val field_desc : field_kind -> Ident.t -> field_desc
    module FieldMap : Map.S with type key = field_desc

    Map indexed by both field types and names. This avoids name clashes between different sorts of fields such as values and types.

    val item_ident_name : Types.signature_item -> Ident.t * Location.t * field_desc
    val is_runtime_component : Types.signature_item -> bool
    val modtypes : + loc:Location.t -> + Env.t -> + mark:mark -> + Types.module_type -> + Types.module_type -> + Typedtree.module_coercion
    val modtypes_with_shape : + shape:Shape.t -> + loc:Location.t -> + Env.t -> + mark:mark -> + Types.module_type -> + Types.module_type -> + Typedtree.module_coercion * Shape.t
    val strengthened_module_decl : + loc:Location.t -> + aliasable:bool -> + Env.t -> + mark:mark -> + Types.module_declaration -> + Path.t -> + Types.module_declaration -> + Typedtree.module_coercion
    val check_modtype_inclusion : + loc:Location.t -> + Env.t -> + Types.module_type -> + Path.t -> + Types.module_type -> + explanation option

    check_modtype_inclusion ~loc env mty1 path1 mty2 checks that the functor application F(M) is well typed, where mty2 is the type of the argument of F and path1/mty1 is the path/unstrenghened type of M.

    val check_modtype_equiv : + loc:Location.t -> + Env.t -> + Ident.t -> + Types.module_type -> + Types.module_type -> + unit
    val signatures : + Env.t -> + mark:mark -> + Types.signature -> + Types.signature -> + Typedtree.module_coercion
    val compunit : + Env.t -> + mark:mark -> + string -> + Types.signature -> + string -> + Types.signature -> + Shape.t -> + Typedtree.module_coercion * Shape.t
    val type_declarations : + loc:Location.t -> + Env.t -> + mark:mark -> + Ident.t -> + Types.type_declaration -> + Types.type_declaration -> + unit
    val print_coercion : + Stdlib.Format.formatter -> + Typedtree.module_coercion -> + unit
    type symptom =
    1. | Missing_field of Ident.t * Location.t * string
    2. | Value_descriptions of Ident.t + * Types.value_description + * Types.value_description + * Includecore.value_mismatch
    3. | Type_declarations of Ident.t + * Types.type_declaration + * Types.type_declaration + * Includecore.type_mismatch
    4. | Extension_constructors of Ident.t + * Types.extension_constructor + * Types.extension_constructor + * Includecore.extension_constructor_mismatch
    5. | Module_types of Types.module_type * Types.module_type
    6. | Modtype_infos of Ident.t + * Types.modtype_declaration + * Types.modtype_declaration
    7. | Modtype_permutation of Types.module_type * Typedtree.module_coercion
    8. | Interface_mismatch of string * string
    9. | Class_type_declarations of Ident.t + * Types.class_type_declaration + * Types.class_type_declaration + * Ctype.class_match_failure list
    10. | Class_declarations of Ident.t + * Types.class_declaration + * Types.class_declaration + * Ctype.class_match_failure list
    11. | Unbound_module_path of Path.t
    12. | Invalid_module_alias of Path.t
    type pos =
    1. | Module of Ident.t
    2. | Modtype of Ident.t
    3. | Arg of Types.functor_parameter
    4. | Body of Types.functor_parameter
    exception Error of explanation
    type application_name =
    1. | Anonymous_functor
      (*

      (functor (_:sig end) -> struct end)(Int)

      *)
    2. | Full_application_path of Longident.t
      (*

      F(G(X).P)(Y)

      *)
    3. | Named_leftmost_functor of Longident.t
      (*

      F(struct end)...(...)

      *)
    exception Apply_error of {
    1. loc : Location.t;
    2. env : Env.t;
    3. app_name : application_name;
    4. mty_f : Types.module_type;
    5. args : (Error.functor_arg_descr * Types.module_type) list;
    }
    val expand_module_alias : + strengthen:bool -> + Env.t -> + Path.t -> + Types.module_type
    module Functor_inclusion_diff : sig ... end
    module Functor_app_diff : sig ... end
    diff --git a/ocaml/Includemod_errorprinter/index.html b/ocaml/Includemod_errorprinter/index.html new file mode 100644 index 0000000..20fe449 --- /dev/null +++ b/ocaml/Includemod_errorprinter/index.html @@ -0,0 +1,2 @@ + +Includemod_errorprinter (ocaml.Includemod_errorprinter)

    Module Includemod_errorprinter

    val register : unit -> unit
    diff --git a/ocaml/Inconstant_idents/index.html b/ocaml/Inconstant_idents/index.html new file mode 100644 index 0000000..e1d11b6 --- /dev/null +++ b/ocaml/Inconstant_idents/index.html @@ -0,0 +1,6 @@ + +Inconstant_idents (ocaml.Inconstant_idents)

    Module Inconstant_idents

    type result
    val inconstants_on_program : + compilation_unit:Compilation_unit.t -> + backend:(module Backend_intf.S) -> + Flambda.program -> + result

    inconstants_on_program finds those variables and set-of-closures identifiers that cannot be compiled to constants by Flambda_to_clambda.

    val variable : Variable.t -> result -> bool

    variable var res returns true if var is marked as inconstant in res.

    val closure : Set_of_closures_id.t -> result -> bool

    closure cl res returns true if cl is marked as inconstant in res.

    diff --git a/ocaml/Initialize_symbol_to_let_symbol/index.html b/ocaml/Initialize_symbol_to_let_symbol/index.html new file mode 100644 index 0000000..c237c67 --- /dev/null +++ b/ocaml/Initialize_symbol_to_let_symbol/index.html @@ -0,0 +1,4 @@ + +Initialize_symbol_to_let_symbol (ocaml.Initialize_symbol_to_let_symbol)

    Module Initialize_symbol_to_let_symbol

    val constant_field : + Flambda.t -> + Flambda.constant_defining_value_block_field option

    Transform Initialize_symbol with only constant fields to let_symbol construction.

    diff --git a/ocaml/Inline_and_simplify/index.html b/ocaml/Inline_and_simplify/index.html new file mode 100644 index 0000000..46ad619 --- /dev/null +++ b/ocaml/Inline_and_simplify/index.html @@ -0,0 +1,14 @@ + +Inline_and_simplify (ocaml.Inline_and_simplify)

    Module Inline_and_simplify

    val run : + never_inline:bool -> + backend:(module Backend_intf.S) -> + prefixname:string -> + round:int -> + ppf_dump:Stdlib.Format.formatter -> + Flambda.program -> + Flambda.program

    Simplification of Flambda programs combined with function inlining: for the most part a beta-reduction pass.

    Readers interested in the inlining strategy should read the Inlining_decision module first.

    val duplicate_function : + env:Inline_and_simplify_aux.Env.t -> + set_of_closures:Flambda.set_of_closures -> + fun_var:Variable.t -> + new_fun_var:Variable.t -> + Flambda.function_declaration * Flambda.specialised_to Variable.Map.t
    diff --git a/ocaml/Inline_and_simplify_aux/Env/index.html b/ocaml/Inline_and_simplify_aux/Env/index.html new file mode 100644 index 0000000..03824b5 --- /dev/null +++ b/ocaml/Inline_and_simplify_aux/Env/index.html @@ -0,0 +1,17 @@ + +Env (ocaml.Inline_and_simplify_aux.Env)

    Module Inline_and_simplify_aux.Env

    type t

    Environments follow the lexical scopes of the program.

    val create : + never_inline:bool -> + backend:(module Backend_intf.S) -> + round:int -> + ppf_dump:Stdlib.Format.formatter -> + t

    Create a new environment. If never_inline is true then the returned environment will prevent Inline_and_simplify from inlining. The backend parameter is used for passing information about the compiler backend being used. Newly-created environments have inactive Freshenings (see below) and do not initially hold any approximation information.

    val backend : t -> (module Backend_intf.S)

    Obtain the first-class module that gives information about the compiler backend being used for compilation.

    val really_import_approx : t -> Simple_value_approx.t -> Simple_value_approx.t

    Obtain the really_import_approx function from the backend module.

    val round : t -> int

    Which simplification round we are currently in.

    val ppf_dump : t -> Stdlib.Format.formatter

    Where to print intermediate asts and similar debug information

    val add : t -> Variable.t -> Simple_value_approx.t -> t

    Add the approximation of a variable---that is to say, some knowledge about the value(s) the variable may take on at runtime---to the environment.

    val add_outer_scope : t -> Variable.t -> Simple_value_approx.t -> t
    val add_mutable : t -> Mutable_variable.t -> Simple_value_approx.t -> t

    Like add, but for mutable variables.

    val find_exn : t -> Variable.t -> Simple_value_approx.t

    Find the approximation of a given variable, raising a fatal error if the environment does not know about the variable. Use find_opt instead if you need to catch the failure case.

    val find_mutable_exn : t -> Mutable_variable.t -> Simple_value_approx.t

    Like find_exn, but for mutable variables.

    type scope =
    1. | Current
    2. | Outer
    val find_with_scope_exn : t -> Variable.t -> scope * Simple_value_approx.t
    val find_opt : t -> Variable.t -> Simple_value_approx.t option

    Like find_exn, but intended for use where the "not present in environment" case is to be handled by the caller.

    val find_list_exn : t -> Variable.t list -> Simple_value_approx.t list

    Like find_exn, but for a list of variables.

    val does_not_bind : t -> Variable.t list -> bool
    val does_not_freshen : t -> Variable.t list -> bool
    val add_symbol : t -> Symbol.t -> Simple_value_approx.t -> t
    val redefine_symbol : t -> Symbol.t -> Simple_value_approx.t -> t
    val find_symbol_exn : t -> Symbol.t -> Simple_value_approx.t
    val find_symbol_opt : t -> Symbol.t -> Simple_value_approx.t option
    val find_symbol_fatal : t -> Symbol.t -> Simple_value_approx.t
    val find_or_load_symbol : t -> Symbol.t -> Simple_value_approx.t
    val add_projection : t -> projection:Projection.t -> bound_to:Variable.t -> t

    Note that the given bound_to holds the given projection.

    val find_projection : t -> projection:Projection.t -> Variable.t option

    Determine if the environment knows about a variable that is bound to the given projection.

    val mem : t -> Variable.t -> bool

    Whether the environment has an approximation for the given variable.

    val freshening : t -> Freshening.t

    Return the freshening that should be applied to variables when rewriting code (in Inline_and_simplify, etc.) using the given environment.

    val set_freshening : t -> Freshening.t -> t

    Set the freshening that should be used as per freshening, above.

    val activate_freshening : t -> t

    Causes every bound variable in code rewritten during inlining and simplification, using the given environment, to be freshened. This is used when descending into subexpressions substituted into existing expressions.

    val local : t -> t

    Erase all variable approximation information and freshening information from the given environment. However, the freshening activation state is preserved. This function is used when rewriting inside a function declaration, to avoid (due to a compiler bug) accidental use of variables from outer scopes that are not accessible.

    val inside_set_of_closures_declaration : Set_of_closures_origin.t -> t -> bool

    Determine whether the inliner is currently inside a function body from the given set of closures. This is used to detect whether a given function call refers to a function which exists somewhere on the current inlining stack.

    val at_toplevel : t -> bool

    Not inside a closure declaration. Toplevel code is the one evaluated when the compilation unit is loaded

    val is_inside_branch : t -> bool
    val branch_depth : t -> int
    val inside_branch : t -> t
    val increase_closure_depth : t -> t
    val set_never_inline : t -> t

    Mark that call sites contained within code rewritten using the given environment should never be replaced by inlined (or unrolled) versions of the callee(s).

    val set_never_inline_inside_closures : t -> t

    Equivalent to set_never_inline but only applies to code inside a set of closures.

    val unset_never_inline_inside_closures : t -> t

    Unset the restriction from set_never_inline_inside_closures

    val set_never_inline_outside_closures : t -> t

    Equivalent to set_never_inline but does not apply to code inside a set of closures.

    val unset_never_inline_outside_closures : t -> t

    Unset the restriction from set_never_inline_outside_closures

    val never_inline : t -> bool

    Return whether set_never_inline is currently in effect on the given environment.

    val inlining_level : t -> int
    val inlining_level_up : t -> t

    Mark that this environment is used to rewrite code for inlining. This is used by the inlining heuristics to decide whether to continue. Unconditionally inlined does not take this into account.

    val actively_unrolling : t -> Set_of_closures_origin.t -> int option

    Whether we are actively unrolling a given function.

    val start_actively_unrolling : t -> Set_of_closures_origin.t -> int -> t

    Start actively unrolling a given function n times.

    val continue_actively_unrolling : t -> Set_of_closures_origin.t -> t

    Unroll a function currently actively being unrolled.

    val unrolling_allowed : t -> Set_of_closures_origin.t -> bool

    Whether it is permissible to unroll a call to a recursive function in the given environment.

    val inside_unrolled_function : t -> Set_of_closures_origin.t -> t

    Whether the given environment is currently being used to rewrite the body of an unrolled recursive function.

    val inlining_allowed : t -> Closure_origin.t -> bool

    Whether it is permissible to inline a call to a function in the given environment.

    val inside_inlined_function : t -> Closure_origin.t -> t

    Whether the given environment is currently being used to rewrite the body of an inlined function.

    val note_entering_closure : + t -> + closure_id:Closure_id.t -> + dbg:Debuginfo.t -> + t

    If collecting inlining statistics, record that the inliner is about to descend into closure_id. This information enables us to produce a stack of closures that form a kind of context around an inlining decision point.

    val note_entering_call : t -> closure_id:Closure_id.t -> dbg:Debuginfo.t -> t

    If collecting inlining statistics, record that the inliner is about to descend into a call to closure_id. This information enables us to produce a stack of closures that form a kind of context around an inlining decision point.

    val note_entering_inlined : t -> t

    If collecting inlining statistics, record that the inliner is about to descend into an inlined function call. This requires that the inliner has already entered the call with note_entering_call.

    val note_entering_specialised : t -> closure_ids:Closure_id.Set.t -> t

    If collecting inlining statistics, record that the inliner is about to descend into a specialised function definition. This requires that the inliner has already entered the call with note_entering_call.

    val enter_closure : + t -> + closure_id:Closure_id.t -> + inline_inside:bool -> + dbg:Debuginfo.t -> + f:(t -> 'a) -> + 'a

    Update a given environment to record that the inliner is about to descend into closure_id and pass the resulting environment to f. If inline_inside is false then the environment passed to f will be marked as never_inline (see above).

    val record_decision : t -> Inlining_stats_types.Decision.t -> unit

    If collecting inlining statistics, record an inlining decision for the call at the top of the closure stack stored inside the given environment.

    val print : Stdlib.Format.formatter -> t -> unit

    Print a human-readable version of the given environment.

    val set_inline_debuginfo : t -> dbg:Debuginfo.t -> t

    The environment stores the call-site being inlined to produce precise location information. This function sets the current call-site being inlined.

    val add_inlined_debuginfo : t -> dbg:Debuginfo.t -> Debuginfo.t

    Appends the locations of inlined call-sites to the ~dbg argument

    diff --git a/ocaml/Inline_and_simplify_aux/Result/index.html b/ocaml/Inline_and_simplify_aux/Result/index.html new file mode 100644 index 0000000..d80d5fb --- /dev/null +++ b/ocaml/Inline_and_simplify_aux/Result/index.html @@ -0,0 +1,5 @@ + +Result (ocaml.Inline_and_simplify_aux.Result)

    Module Inline_and_simplify_aux.Result

    type t

    Result structures approximately follow the evaluation order of the program. They are returned by the simplification algorithm acting on an Flambda subexpression.

    val create : unit -> t
    val approx : t -> Simple_value_approx.t

    The approximation of the subexpression that has just been simplified.

    val set_approx : t -> Simple_value_approx.t -> t

    Set the approximation of the subexpression that has just been simplified. Typically used just before returning from a case of the simplification algorithm.

    val meet_approx : t -> Env.t -> Simple_value_approx.t -> t

    Set the approximation of the subexpression to the meet of the current return approximation and the provided one. Typically used just before returning from a branch case of the simplification algorithm.

    val used_static_exceptions : t -> Static_exception.Set.t

    All static exceptions for which use_staticfail has been called on the given result structure.

    val use_static_exception : t -> Static_exception.t -> t

    Mark that the given static exception has been used.

    val exit_scope_catch : t -> Static_exception.t -> t

    Mark that we are moving up out of the scope of a static-catch block that catches the given static exception identifier. This has the effect of removing the identifier from the used_staticfail set.

    val benefit : t -> Inlining_cost.Benefit.t

    The benefit to be gained by inlining the subexpression whose simplification yielded the given result structure.

    val map_benefit : + t -> + (Inlining_cost.Benefit.t -> Inlining_cost.Benefit.t) -> + t

    Apply a transformation to the inlining benefit stored within the given result structure.

    val add_benefit : t -> Inlining_cost.Benefit.t -> t

    Add some benefit to the inlining benefit stored within the given result structure.

    val reset_benefit : t -> t

    Set the benefit of inlining the subexpression corresponding to the given result structure to zero.

    val set_inlining_threshold : t -> Inlining_cost.Threshold.t option -> t
    val add_inlining_threshold : t -> Inlining_cost.Threshold.t -> t
    val sub_inlining_threshold : t -> Inlining_cost.Threshold.t -> t
    val inlining_threshold : t -> Inlining_cost.Threshold.t option
    val seen_direct_application : t -> t
    val num_direct_applications : t -> int
    diff --git a/ocaml/Inline_and_simplify_aux/index.html b/ocaml/Inline_and_simplify_aux/index.html new file mode 100644 index 0000000..192c280 --- /dev/null +++ b/ocaml/Inline_and_simplify_aux/index.html @@ -0,0 +1,26 @@ + +Inline_and_simplify_aux (ocaml.Inline_and_simplify_aux)

    Module Inline_and_simplify_aux

    Environments and result structures used during inlining and simplification. (See inline_and_simplify.ml.)

    module Env : sig ... end
    module Result : sig ... end
    val initial_inlining_threshold : round:int -> Inlining_cost.Threshold.t

    Command line argument -inline

    val initial_inlining_toplevel_threshold : + round:int -> + Inlining_cost.Threshold.t

    Command line argument -inline-toplevel

    val prepare_to_simplify_closure : + function_decl:Flambda.function_declaration -> + free_vars:(Flambda.specialised_to * Simple_value_approx.t) Variable.Map.t -> + specialised_args:Flambda.specialised_to Variable.Map.t -> + parameter_approximations:Simple_value_approx.t Variable.Map.t -> + set_of_closures_env:Env.t -> + Env.t
    val keep_body_check : + is_classic_mode:bool -> + recursive:Variable.Set.t Stdlib.Lazy.t -> + Variable.t -> + Flambda.function_declaration -> + bool
    diff --git a/ocaml/Inlining_cost/Benefit/index.html b/ocaml/Inlining_cost/Benefit/index.html new file mode 100644 index 0000000..2017675 --- /dev/null +++ b/ocaml/Inlining_cost/Benefit/index.html @@ -0,0 +1,2 @@ + +Benefit (ocaml.Inlining_cost.Benefit)

    Module Inlining_cost.Benefit

    type t
    val zero : t
    val (+) : t -> t -> t
    val max : round:int -> t -> t -> t
    val remove_call : t -> t
    val remove_alloc : t -> t
    val remove_prim : t -> t
    val remove_prims : t -> int -> t
    val remove_branch : t -> t
    val direct_call_of_indirect : t -> t
    val requested_inline : t -> size_of:Flambda.t -> t
    val remove_code : Flambda.t -> t -> t
    val remove_code_named : Flambda.named -> t -> t
    val remove_projection : Projection.t -> t -> t
    val add_code : Flambda.t -> t -> t
    val add_code_named : Flambda.named -> t -> t
    val add_projection : Projection.t -> t -> t
    val print : Stdlib.Format.formatter -> t -> unit
    diff --git a/ocaml/Inlining_cost/Threshold/index.html b/ocaml/Inlining_cost/Threshold/index.html new file mode 100644 index 0000000..2282191 --- /dev/null +++ b/ocaml/Inlining_cost/Threshold/index.html @@ -0,0 +1,2 @@ + +Threshold (ocaml.Inlining_cost.Threshold)

    Module Inlining_cost.Threshold

    type t =
    1. | Never_inline
    2. | Can_inline_if_no_larger_than of int

    The maximum size, in some abstract measure of space cost, that an Flambda expression may be in order to be inlined.

    val add : t -> t -> t
    val sub : t -> t -> t
    val min : t -> t -> t
    val equal : t -> t -> bool
    diff --git a/ocaml/Inlining_cost/Whether_sufficient_benefit/index.html b/ocaml/Inlining_cost/Whether_sufficient_benefit/index.html new file mode 100644 index 0000000..b37b7fa --- /dev/null +++ b/ocaml/Inlining_cost/Whether_sufficient_benefit/index.html @@ -0,0 +1,22 @@ + +Whether_sufficient_benefit (ocaml.Inlining_cost.Whether_sufficient_benefit)

    Module Inlining_cost.Whether_sufficient_benefit

    type t
    val create : + original:Flambda.t -> + toplevel:bool -> + branch_depth:int -> + Flambda.t -> + benefit:Benefit.t -> + lifting:bool -> + round:int -> + t
    val create_estimate : + original_size:int -> + toplevel:bool -> + branch_depth:int -> + new_size:int -> + benefit:Benefit.t -> + lifting:bool -> + round:int -> + t
    val evaluate : t -> bool
    val to_string : t -> string
    val print_description : + subfunctions:bool -> + Stdlib.Format.formatter -> + t -> + unit
    diff --git a/ocaml/Inlining_cost/index.html b/ocaml/Inlining_cost/index.html new file mode 100644 index 0000000..a59735d --- /dev/null +++ b/ocaml/Inlining_cost/index.html @@ -0,0 +1,7 @@ + +Inlining_cost (ocaml.Inlining_cost)

    Module Inlining_cost

    Measurement of the cost (including cost in space) of Flambda terms in the context of inlining.

    module Threshold : sig ... end
    val can_inline : Flambda.t -> Threshold.t -> bonus:int -> bool
    val can_try_inlining : + Flambda.t -> + Threshold.t -> + number_of_arguments:int -> + size_from_approximation:int option -> + Threshold.t
    module Benefit : sig ... end
    module Whether_sufficient_benefit : sig ... end
    val scale_inline_threshold_by : int
    val default_toplevel_multiplier : int
    val direct_call_size : int
    val maximum_interesting_size_of_function_body : int -> int

    If a function body exceeds this size, we can make a fast decision not to inline it (see Inlining_decision).

    val lambda_smaller' : Flambda.expr -> than:int -> int option

    Measure the given expression to determine whether its size is at or below the given threshold. None is returned if it is too big; otherwise Some is returned with the measured size.

    val lambda_size : Flambda.expr -> int
    diff --git a/ocaml/Inlining_decision/index.html b/ocaml/Inlining_decision/index.html new file mode 100644 index 0000000..7d68fdf --- /dev/null +++ b/ocaml/Inlining_decision/index.html @@ -0,0 +1,16 @@ + +Inlining_decision (ocaml.Inlining_decision)

    Module Inlining_decision

    See the Flambda manual chapter for an explanation in prose of the inlining decision procedure.

    val for_call_site : + env:Inline_and_simplify_aux.Env.t -> + r:Inline_and_simplify_aux.Result.t -> + function_decls:Simple_value_approx.function_declarations -> + lhs_of_application:Variable.t -> + closure_id_being_applied:Closure_id.t -> + function_decl:Simple_value_approx.function_declaration -> + value_set_of_closures:Simple_value_approx.value_set_of_closures -> + args:Variable.t list -> + args_approxs:Simple_value_approx.t list -> + dbg:Debuginfo.t -> + simplify:Inlining_decision_intf.simplify -> + inline_requested:Lambda.inline_attribute -> + specialise_requested:Lambda.specialise_attribute -> + Flambda.t * Inline_and_simplify_aux.Result.t

    Try to inline a full application of a known function, guided by various heuristics.

    val should_inline_inside_declaration : Flambda.function_declaration -> bool

    When a function declaration is encountered by for_call_site, the body may be subject to inlining immediately, thus changing the declaration. This function must return true for that to be able to happen.

    diff --git a/ocaml/Inlining_decision_intf/index.html b/ocaml/Inlining_decision_intf/index.html new file mode 100644 index 0000000..434a167 --- /dev/null +++ b/ocaml/Inlining_decision_intf/index.html @@ -0,0 +1,25 @@ + +Inlining_decision_intf (ocaml.Inlining_decision_intf)

    Module Inlining_decision_intf

    type 'a by_copying_function_body = + env:Inline_and_simplify_aux.Env.t -> + r:Inline_and_simplify_aux.Result.t -> + clos:Flambda.function_declarations -> + lfunc:Flambda.t -> + fun_id:Closure_id.t -> + func:Flambda.function_declaration -> + args:Flambda.t list -> + Flambda.t * Inline_and_simplify_aux.Result.t
    type 'a by_copying_function_declaration = + env:Inline_and_simplify_aux.Env.t -> + r:Inline_and_simplify_aux.Result.t -> + funct:Flambda.t -> + clos:Flambda.function_declarations -> + fun_id:Closure_id.t -> + func:Flambda.function_declaration -> + args_with_approxs:(Flambda.t list * Simple_value_approx.t list) -> + invariant_params:Variable.Set.t -> + specialised_args:Variable.Set.t -> + dbg:Debuginfo.t -> + (Flambda.t * Inline_and_simplify_aux.Result.t) option
    diff --git a/ocaml/Inlining_stats/Closure_stack/index.html b/ocaml/Inlining_stats/Closure_stack/index.html new file mode 100644 index 0000000..c9882cb --- /dev/null +++ b/ocaml/Inlining_stats/Closure_stack/index.html @@ -0,0 +1,6 @@ + +Closure_stack (ocaml.Inlining_stats.Closure_stack)

    Module Inlining_stats.Closure_stack

    type t
    val create : unit -> t
    val note_entering_closure : + t -> + closure_id:Closure_id.t -> + dbg:Debuginfo.t -> + t
    val note_entering_call : t -> closure_id:Closure_id.t -> dbg:Debuginfo.t -> t
    val note_entering_inlined : t -> t
    val note_entering_specialised : t -> closure_ids:Closure_id.Set.t -> t
    diff --git a/ocaml/Inlining_stats/index.html b/ocaml/Inlining_stats/index.html new file mode 100644 index 0000000..bb07a32 --- /dev/null +++ b/ocaml/Inlining_stats/index.html @@ -0,0 +1,5 @@ + +Inlining_stats (ocaml.Inlining_stats)

    Module Inlining_stats

    module Closure_stack : sig ... end
    val record_decision : + Inlining_stats_types.Decision.t -> + closure_stack:Closure_stack.t -> + unit
    val save_then_forget_decisions : output_prefix:string -> unit
    diff --git a/ocaml/Inlining_stats_types/Decision/index.html b/ocaml/Inlining_stats_types/Decision/index.html new file mode 100644 index 0000000..2009489 --- /dev/null +++ b/ocaml/Inlining_stats_types/Decision/index.html @@ -0,0 +1,2 @@ + +Decision (ocaml.Inlining_stats_types.Decision)

    Module Inlining_stats_types.Decision

    type t =
    1. | Prevented of Prevented.t
    2. | Specialised of Specialised.t
    3. | Inlined of Not_specialised.t * Inlined.t
    4. | Unchanged of Not_specialised.t * Not_inlined.t
    val summary : Stdlib.Format.formatter -> t -> unit
    val calculation : depth:int -> Stdlib.Format.formatter -> t -> unit
    diff --git a/ocaml/Inlining_stats_types/Inlined/index.html b/ocaml/Inlining_stats_types/Inlined/index.html new file mode 100644 index 0000000..d10ef4d --- /dev/null +++ b/ocaml/Inlining_stats_types/Inlined/index.html @@ -0,0 +1,3 @@ + +Inlined (ocaml.Inlining_stats_types.Inlined)

    Module Inlining_stats_types.Inlined

    type t =
    1. | Classic_mode
    2. | Annotation
    3. | Decl_local_to_application
    4. | Without_subfunctions of Inlining_cost.Whether_sufficient_benefit.t
    5. | With_subfunctions of Inlining_cost.Whether_sufficient_benefit.t + * Inlining_cost.Whether_sufficient_benefit.t
    diff --git a/ocaml/Inlining_stats_types/Not_inlined/index.html b/ocaml/Inlining_stats_types/Not_inlined/index.html new file mode 100644 index 0000000..f192cfb --- /dev/null +++ b/ocaml/Inlining_stats_types/Not_inlined/index.html @@ -0,0 +1,3 @@ + +Not_inlined (ocaml.Inlining_stats_types.Not_inlined)

    Module Inlining_stats_types.Not_inlined

    type t =
    1. | Classic_mode
    2. | Above_threshold of int
    3. | Annotation
    4. | No_useful_approximations
    5. | Unrolling_depth_exceeded
    6. | Self_call
    7. | Without_subfunctions of Inlining_cost.Whether_sufficient_benefit.t
    8. | With_subfunctions of Inlining_cost.Whether_sufficient_benefit.t + * Inlining_cost.Whether_sufficient_benefit.t
    diff --git a/ocaml/Inlining_stats_types/Not_specialised/index.html b/ocaml/Inlining_stats_types/Not_specialised/index.html new file mode 100644 index 0000000..0a5dd49 --- /dev/null +++ b/ocaml/Inlining_stats_types/Not_specialised/index.html @@ -0,0 +1,3 @@ + +Not_specialised (ocaml.Inlining_stats_types.Not_specialised)

    Module Inlining_stats_types.Not_specialised

    type t =
    1. | Classic_mode
    2. | Above_threshold of int
    3. | Annotation
    4. | Not_recursive
    5. | Not_closed
    6. | No_invariant_parameters
    7. | No_useful_approximations
    8. | Self_call
    9. | Not_beneficial of Inlining_cost.Whether_sufficient_benefit.t + * Inlining_cost.Whether_sufficient_benefit.t
    diff --git a/ocaml/Inlining_stats_types/Prevented/index.html b/ocaml/Inlining_stats_types/Prevented/index.html new file mode 100644 index 0000000..b9523a8 --- /dev/null +++ b/ocaml/Inlining_stats_types/Prevented/index.html @@ -0,0 +1,2 @@ + +Prevented (ocaml.Inlining_stats_types.Prevented)

    Module Inlining_stats_types.Prevented

    type t =
    1. | Function_prevented_from_inlining
    2. | Level_exceeded
    diff --git a/ocaml/Inlining_stats_types/Specialised/index.html b/ocaml/Inlining_stats_types/Specialised/index.html new file mode 100644 index 0000000..800c38e --- /dev/null +++ b/ocaml/Inlining_stats_types/Specialised/index.html @@ -0,0 +1,3 @@ + +Specialised (ocaml.Inlining_stats_types.Specialised)

    Module Inlining_stats_types.Specialised

    diff --git a/ocaml/Inlining_stats_types/index.html b/ocaml/Inlining_stats_types/index.html new file mode 100644 index 0000000..21d5a7c --- /dev/null +++ b/ocaml/Inlining_stats_types/index.html @@ -0,0 +1,2 @@ + +Inlining_stats_types (ocaml.Inlining_stats_types)

    Module Inlining_stats_types

    module Inlined : sig ... end
    module Not_inlined : sig ... end
    module Specialised : sig ... end
    module Not_specialised : sig ... end
    module Prevented : sig ... end
    module Decision : sig ... end
    diff --git a/ocaml/Inlining_transforms/index.html b/ocaml/Inlining_transforms/index.html new file mode 100644 index 0000000..dab0bda --- /dev/null +++ b/ocaml/Inlining_transforms/index.html @@ -0,0 +1,31 @@ + +Inlining_transforms (ocaml.Inlining_transforms)

    Module Inlining_transforms

    Source code transformations used during inlining.

    val inline_by_copying_function_body : + env:Inline_and_simplify_aux.Env.t -> + r:Inline_and_simplify_aux.Result.t -> + lhs_of_application:Variable.t -> + inline_requested:Lambda.inline_attribute -> + specialise_requested:Lambda.specialise_attribute -> + closure_id_being_applied:Closure_id.t -> + function_decl:Simple_value_approx.function_declaration -> + function_body:Simple_value_approx.function_body -> + fun_vars:Variable.Set.t -> + args:Variable.t list -> + dbg:Debuginfo.t -> + simplify:Inlining_decision_intf.simplify -> + Flambda.t * Inline_and_simplify_aux.Result.t

    Inline a function by substituting its body (which may be subject to further transformation) at a call site. The function's declaration is not copied.

    This transformation is used when:

    • inlining a call to a non-recursive function;
    • inlining a call, within a recursive or mutually-recursive function, to the same or another function being defined simultaneously ("unrolling"). The maximum depth of unrolling is bounded (see E.unrolling_allowed).

    In both cases, the body of the function is copied, within a sequence of lets that bind the function parameters, the variables "bound by the closure" (see flambda.mli), and any function identifiers introduced by the set of closures. These stages are delimited below by comments.

    As an example, suppose we are inlining the following function:

    let f x = x + y ... let p = f, f in (fst p) 42

    The call site (fst p) 42 will be transformed to:

    let clos_id = fst p in (* must eventually yield a closure *) let y = <access to y in clos_id> in let x' = 42 in let x = x' in x + y

    When unrolling a recursive function we rename the arguments to the recursive call in order to avoid clashes with existing bindings. For example, suppose we are inlining the following call to f, which lies within its own declaration:

    let rec f x y = f (fst x) (y + snd x)

    This will be transformed to:

    let rec f x y = let clos_id = f in (* not used this time, since f has no free vars *) let x' = fst x in let y' = y + snd x in f (fst x') (y' + snd x') (* body of f with parameters freshened *)

    val inline_by_copying_function_declaration : + env:Inline_and_simplify_aux.Env.t -> + r:Inline_and_simplify_aux.Result.t -> + function_decls:Simple_value_approx.function_declarations -> + lhs_of_application:Variable.t -> + inline_requested:Lambda.inline_attribute -> + closure_id_being_applied:Closure_id.t -> + function_decl:Simple_value_approx.function_declaration -> + args:Variable.t list -> + args_approxs:Simple_value_approx.t list -> + invariant_params:Variable.Set.t Variable.Map.t lazy_t -> + specialised_args:Flambda.specialised_to Variable.Map.t -> + free_vars:Flambda.specialised_to Variable.Map.t -> + direct_call_surrogates:Closure_id.t Closure_id.Map.t -> + dbg:Debuginfo.t -> + simplify:Inlining_decision_intf.simplify -> + (Flambda.t * Inline_and_simplify_aux.Result.t) option

    Inlining of recursive function(s) yields a copy of the functions' definitions (not just their bodies, unlike the non-recursive case) and a direct application of the new body. Note: the function really does need to be recursive (but possibly only via some mutual recursion) to end up in here; a simultaneous binding that is non-recursive is not sufficient.

    diff --git a/ocaml/Instruct/index.html b/ocaml/Instruct/index.html new file mode 100644 index 0000000..031e8c4 --- /dev/null +++ b/ocaml/Instruct/index.html @@ -0,0 +1,2 @@ + +Instruct (ocaml.Instruct)

    Module Instruct

    type closure_entry =
    1. | Free_variable of int
    2. | Function of int
    type closure_env =
    1. | Not_in_closure
    2. | In_closure of {
      1. entries : closure_entry Ident.tbl;
      2. env_pos : int;
      }
    type compilation_env = {
    1. ce_stack : int Ident.tbl;
    2. ce_closure : closure_env;
    }
    type debug_event = {
    1. mutable ev_pos : int;
    2. ev_module : string;
    3. ev_loc : Location.t;
    4. ev_kind : debug_event_kind;
    5. ev_defname : string;
    6. ev_info : debug_event_info;
    7. ev_typenv : Env.summary;
    8. ev_typsubst : Subst.t;
    9. ev_compenv : compilation_env;
    10. ev_stacksize : int;
    11. ev_repr : debug_event_repr;
    }
    and debug_event_kind =
    1. | Event_before
    2. | Event_after of Types.type_expr
    3. | Event_pseudo
    and debug_event_info =
    1. | Event_function
    2. | Event_return of int
    3. | Event_other
    and debug_event_repr =
    1. | Event_none
    2. | Event_parent of int ref
    3. | Event_child of int ref
    type label = int
    type instruction =
    1. | Klabel of label
    2. | Kacc of int
    3. | Kenvacc of int
    4. | Kpush
    5. | Kpop of int
    6. | Kassign of int
    7. | Kpush_retaddr of label
    8. | Kapply of int
    9. | Kappterm of int * int
    10. | Kreturn of int
    11. | Krestart
    12. | Kgrab of int
    13. | Kclosure of label * int
    14. | Kclosurerec of label list * int
    15. | Koffsetclosure of int
    16. | Kgetglobal of Ident.t
    17. | Ksetglobal of Ident.t
    18. | Kconst of Lambda.structured_constant
    19. | Kmakeblock of int * int
    20. | Kmakefloatblock of int
    21. | Kgetfield of int
    22. | Ksetfield of int
    23. | Kgetfloatfield of int
    24. | Ksetfloatfield of int
    25. | Kvectlength
    26. | Kgetvectitem
    27. | Ksetvectitem
    28. | Kgetstringchar
    29. | Kgetbyteschar
    30. | Ksetbyteschar
    31. | Kbranch of label
    32. | Kbranchif of label
    33. | Kbranchifnot of label
    34. | Kstrictbranchif of label
    35. | Kstrictbranchifnot of label
    36. | Kswitch of label array * label array
    37. | Kboolnot
    38. | Kpushtrap of label
    39. | Kpoptrap
    40. | Kraise of Lambda.raise_kind
    41. | Kcheck_signals
    42. | Kccall of string * int
    43. | Knegint
    44. | Kaddint
    45. | Ksubint
    46. | Kmulint
    47. | Kdivint
    48. | Kmodint
    49. | Kandint
    50. | Korint
    51. | Kxorint
    52. | Klslint
    53. | Klsrint
    54. | Kasrint
    55. | Kintcomp of Lambda.integer_comparison
    56. | Koffsetint of int
    57. | Koffsetref of int
    58. | Kisint
    59. | Kisout
    60. | Kgetmethod
    61. | Kgetpubmet of int
    62. | Kgetdynmet
    63. | Kevent of debug_event
    64. | Kperform
    65. | Kresume
    66. | Kresumeterm of int
    67. | Kreperformterm of int
    68. | Kstop
    val immed_min : int
    val immed_max : int
    diff --git a/ocaml/Int_replace_polymorphic_compare/index.html b/ocaml/Int_replace_polymorphic_compare/index.html new file mode 100644 index 0000000..9b625c8 --- /dev/null +++ b/ocaml/Int_replace_polymorphic_compare/index.html @@ -0,0 +1,2 @@ + +Int_replace_polymorphic_compare (ocaml.Int_replace_polymorphic_compare)

    Module Int_replace_polymorphic_compare

    val (=) : int -> int -> bool
    val (<>) : int -> int -> bool
    val (<) : int -> int -> bool
    val (>) : int -> int -> bool
    val (<=) : int -> int -> bool
    val (>=) : int -> int -> bool
    val compare : int -> int -> int
    diff --git a/ocaml/Interf/index.html b/ocaml/Interf/index.html new file mode 100644 index 0000000..3909632 --- /dev/null +++ b/ocaml/Interf/index.html @@ -0,0 +1,2 @@ + +Interf (ocaml.Interf)

    Module Interf

    val build_graph : Mach.fundecl -> unit
    diff --git a/ocaml/Internal_variable_names/index.html b/ocaml/Internal_variable_names/index.html new file mode 100644 index 0000000..eafb820 --- /dev/null +++ b/ocaml/Internal_variable_names/index.html @@ -0,0 +1,2 @@ + +Internal_variable_names (ocaml.Internal_variable_names)

    Module Internal_variable_names

    type t = private string
    val apply_arg : t
    val apply_funct : t
    val block_symbol : t
    val block_symbol_get : t
    val block_symbol_get_field : t
    val closure : t
    val cond : t
    val cond_sequor : t
    val const_block : t
    val const_bool : t
    val const_boxed_int : t
    val const_char : t
    val const_false : t
    val const_float : t
    val const_int : t
    val const_one : t
    val const_ptr : t
    val const_ptr_one : t
    val const_ptr_zero : t
    val const_sequand : t
    val const_string : t
    val const_true : t
    val const_zero : t
    val denominator : t
    val division_by_zero : t
    val dummy : t
    val dup_func : t
    val dup_set_of_closures : t
    val const_float_array : t
    val fake_effect_symbol : t
    val for_from : t
    val for_to : t
    val from_closure : t
    val full_apply : t
    val get_symbol_field : t
    val const_immstring : t
    val const_int32 : t
    val const_int64 : t
    val ignore : t
    val is_zero : t
    val lifted_let_rec_block : t
    val meth : t
    val module_as_block : t
    val const_nativeint : t
    val new_value : t
    val numerator : t
    val obj : t
    val offsetted : t
    val partial_fun : t
    val pgetglobal : t
    val pointer : t
    val predef_exn : t
    val project_closure : t
    val raise : t
    val raise_arg : t
    val read_mutable : t
    val remove_unused_arguments : t
    val result : t
    val send_arg : t
    val sequence : t
    val set_of_closures : t
    val staticraise_arg : t
    val simplify_fv : t
    val string_switch : t
    val switch : t
    val symbol : t
    val symbol_field : t
    val symbol_field_block : t
    val the_dead_constant : t
    val toplevel_substitution_named : t
    val unbox_free_vars_of_closures : t
    val unit : t
    val zero : t
    val of_primitive : Lambda.primitive -> t
    val of_primitive_arg : Lambda.primitive -> t
    val anon_fn_with_loc : Lambda.scoped_location -> t
    diff --git a/ocaml/Interval/index.html b/ocaml/Interval/index.html new file mode 100644 index 0000000..391b65a --- /dev/null +++ b/ocaml/Interval/index.html @@ -0,0 +1,2 @@ + +Interval (ocaml.Interval)

    Module Interval

    type range = {
    1. mutable rbegin : int;
    2. mutable rend : int;
    }
    type t = {
    1. mutable reg : Reg.t;
    2. mutable ibegin : int;
    3. mutable iend : int;
    4. mutable ranges : range list;
    }
    type result = {
    1. intervals : t list;
    2. fixed_intervals : t list;
    }
    val overlap : t -> t -> bool
    val is_live : t -> int -> bool
    val remove_expired_ranges : t -> int -> unit
    val build_intervals : Mach.fundecl -> result
    diff --git a/ocaml/Invariant_params/index.html b/ocaml/Invariant_params/index.html new file mode 100644 index 0000000..c7f6988 --- /dev/null +++ b/ocaml/Invariant_params/index.html @@ -0,0 +1,11 @@ + +Invariant_params (ocaml.Invariant_params)

    Module Invariant_params

    val invariant_params_in_recursion : + Flambda.function_declarations -> + backend:(module Backend_intf.S) -> + Variable.Set.t Variable.Map.t
    val invariant_param_sources : + Flambda.function_declarations -> + backend:(module Backend_intf.S) -> + Variable.Pair.Set.t Variable.Map.t
    val unused_arguments : + Flambda.function_declarations -> + backend:(module Backend_intf.S) -> + Variable.Set.t
    diff --git a/ocaml/Lambda/index.html b/ocaml/Lambda/index.html new file mode 100644 index 0000000..1d553a7 --- /dev/null +++ b/ocaml/Lambda/index.html @@ -0,0 +1,43 @@ + +Lambda (ocaml.Lambda)

    Module Lambda

    type compile_time_constant =
    1. | Big_endian
    2. | Word_size
    3. | Int_size
    4. | Max_wosize
    5. | Ostype_unix
    6. | Ostype_win32
    7. | Ostype_cygwin
    8. | Backend_type
    type immediate_or_pointer =
    1. | Immediate
    2. | Pointer
    type initialization_or_assignment =
    1. | Assignment
    2. | Heap_initialization
    3. | Root_initialization
    type is_safe =
    1. | Safe
    2. | Unsafe
    type primitive =
    1. | Pbytes_to_string
    2. | Pbytes_of_string
    3. | Pignore
    4. | Pgetglobal of Ident.t
    5. | Psetglobal of Ident.t
    6. | Pmakeblock of int * Asttypes.mutable_flag * block_shape
    7. | Pfield of int * immediate_or_pointer * Asttypes.mutable_flag
    8. | Pfield_computed
    9. | Psetfield of int * immediate_or_pointer * initialization_or_assignment
    10. | Psetfield_computed of immediate_or_pointer * initialization_or_assignment
    11. | Pfloatfield of int
    12. | Psetfloatfield of int * initialization_or_assignment
    13. | Pduprecord of Types.record_representation * int
    14. | Prunstack
    15. | Pperform
    16. | Presume
    17. | Preperform
    18. | Pccall of Primitive.description
    19. | Praise of raise_kind
    20. | Psequand
    21. | Psequor
    22. | Pnot
    23. | Pnegint
    24. | Paddint
    25. | Psubint
    26. | Pmulint
    27. | Pdivint of is_safe
    28. | Pmodint of is_safe
    29. | Pandint
    30. | Porint
    31. | Pxorint
    32. | Plslint
    33. | Plsrint
    34. | Pasrint
    35. | Pintcomp of integer_comparison
    36. | Pcompare_ints
    37. | Pcompare_floats
    38. | Pcompare_bints of boxed_integer
    39. | Poffsetint of int
    40. | Poffsetref of int
    41. | Pintoffloat
    42. | Pfloatofint
    43. | Pnegfloat
    44. | Pabsfloat
    45. | Paddfloat
    46. | Psubfloat
    47. | Pmulfloat
    48. | Pdivfloat
    49. | Pfloatcomp of float_comparison
    50. | Pstringlength
    51. | Pstringrefu
    52. | Pstringrefs
    53. | Pbyteslength
    54. | Pbytesrefu
    55. | Pbytessetu
    56. | Pbytesrefs
    57. | Pbytessets
    58. | Pmakearray of array_kind * Asttypes.mutable_flag
    59. | Pduparray of array_kind * Asttypes.mutable_flag
      (*

      For Pduparray, the argument must be an immutable array. The arguments of Pduparray give the kind and mutability of the array being *produced* by the duplication.

      *)
    60. | Parraylength of array_kind
    61. | Parrayrefu of array_kind
    62. | Parraysetu of array_kind
    63. | Parrayrefs of array_kind
    64. | Parraysets of array_kind
    65. | Pisint
    66. | Pisout
    67. | Pbintofint of boxed_integer
    68. | Pintofbint of boxed_integer
    69. | Pcvtbint of boxed_integer * boxed_integer
    70. | Pnegbint of boxed_integer
    71. | Paddbint of boxed_integer
    72. | Psubbint of boxed_integer
    73. | Pmulbint of boxed_integer
    74. | Pdivbint of {
      1. size : boxed_integer;
      2. is_safe : is_safe;
      }
    75. | Pmodbint of {
      1. size : boxed_integer;
      2. is_safe : is_safe;
      }
    76. | Pandbint of boxed_integer
    77. | Porbint of boxed_integer
    78. | Pxorbint of boxed_integer
    79. | Plslbint of boxed_integer
    80. | Plsrbint of boxed_integer
    81. | Pasrbint of boxed_integer
    82. | Pbintcomp of boxed_integer * integer_comparison
    83. | Pbigarrayref of bool * int * bigarray_kind * bigarray_layout
    84. | Pbigarrayset of bool * int * bigarray_kind * bigarray_layout
    85. | Pbigarraydim of int
    86. | Pstring_load_16 of bool
    87. | Pstring_load_32 of bool
    88. | Pstring_load_64 of bool
    89. | Pbytes_load_16 of bool
    90. | Pbytes_load_32 of bool
    91. | Pbytes_load_64 of bool
    92. | Pbytes_set_16 of bool
    93. | Pbytes_set_32 of bool
    94. | Pbytes_set_64 of bool
    95. | Pbigstring_load_16 of bool
    96. | Pbigstring_load_32 of bool
    97. | Pbigstring_load_64 of bool
    98. | Pbigstring_set_16 of bool
    99. | Pbigstring_set_32 of bool
    100. | Pbigstring_set_64 of bool
    101. | Pctconst of compile_time_constant
    102. | Pbswap16
    103. | Pbbswap of boxed_integer
    104. | Pint_as_pointer
    105. | Patomic_load of {
      1. immediate_or_pointer : immediate_or_pointer;
      }
    106. | Patomic_exchange
    107. | Patomic_cas
    108. | Patomic_fetch_add
    109. | Popaque
    110. | Pdls_get
    and integer_comparison =
    1. | Ceq
    2. | Cne
    3. | Clt
    4. | Cgt
    5. | Cle
    6. | Cge
    and float_comparison =
    1. | CFeq
    2. | CFneq
    3. | CFlt
    4. | CFnlt
    5. | CFgt
    6. | CFngt
    7. | CFle
    8. | CFnle
    9. | CFge
    10. | CFnge
    and array_kind =
    1. | Pgenarray
    2. | Paddrarray
    3. | Pintarray
    4. | Pfloatarray
    and value_kind =
    1. | Pgenval
    2. | Pfloatval
    3. | Pboxedintval of boxed_integer
    4. | Pintval
    and block_shape = value_kind list option
    and boxed_integer = Primitive.boxed_integer =
    1. | Pnativeint
    2. | Pint32
    3. | Pint64
    and bigarray_kind =
    1. | Pbigarray_unknown
    2. | Pbigarray_float16
    3. | Pbigarray_float32
    4. | Pbigarray_float64
    5. | Pbigarray_sint8
    6. | Pbigarray_uint8
    7. | Pbigarray_sint16
    8. | Pbigarray_uint16
    9. | Pbigarray_int32
    10. | Pbigarray_int64
    11. | Pbigarray_caml_int
    12. | Pbigarray_native_int
    13. | Pbigarray_complex32
    14. | Pbigarray_complex64
    and bigarray_layout =
    1. | Pbigarray_unknown_layout
    2. | Pbigarray_c_layout
    3. | Pbigarray_fortran_layout
    and raise_kind =
    1. | Raise_regular
    2. | Raise_reraise
    3. | Raise_notrace
    val equal_primitive : primitive -> primitive -> bool
    val equal_value_kind : value_kind -> value_kind -> bool
    val equal_boxed_integer : boxed_integer -> boxed_integer -> bool
    type structured_constant =
    1. | Const_base of Asttypes.constant
    2. | Const_block of int * structured_constant list
    3. | Const_float_array of string list
    4. | Const_immstring of string
    type tailcall_attribute =
    1. | Tailcall_expectation of bool
    2. | Default_tailcall
    type inline_attribute =
    1. | Always_inline
    2. | Never_inline
    3. | Hint_inline
    4. | Unroll of int
    5. | Default_inline
    val equal_inline_attribute : inline_attribute -> inline_attribute -> bool
    type specialise_attribute =
    1. | Always_specialise
    2. | Never_specialise
    3. | Default_specialise
    val equal_specialise_attribute : + specialise_attribute -> + specialise_attribute -> + bool
    type local_attribute =
    1. | Always_local
    2. | Never_local
    3. | Default_local
    type poll_attribute =
    1. | Error_poll
    2. | Default_poll
    type function_kind =
    1. | Curried
    2. | Tupled
    type let_kind =
    1. | Strict
    2. | Alias
    3. | StrictOpt
    type meth_kind =
    1. | Self
    2. | Public
    3. | Cached
    val equal_meth_kind : meth_kind -> meth_kind -> bool
    type shared_code = (int * int) list
    type function_attribute = {
    1. inline : inline_attribute;
    2. specialise : specialise_attribute;
    3. local : local_attribute;
    4. poll : poll_attribute;
    5. is_a_functor : bool;
    6. stub : bool;
    7. tmc_candidate : bool;
    8. may_fuse_arity : bool;
    }
    type scoped_location = Debuginfo.Scoped_location.t
    type lambda =
    1. | Lvar of Ident.t
    2. | Lmutvar of Ident.t
    3. | Lconst of structured_constant
    4. | Lapply of lambda_apply
    5. | Lfunction of lfunction
    6. | Llet of let_kind * value_kind * Ident.t * lambda * lambda
    7. | Lmutlet of value_kind * Ident.t * lambda * lambda
    8. | Lletrec of rec_binding list * lambda
    9. | Lprim of primitive * lambda list * scoped_location
    10. | Lswitch of lambda * lambda_switch * scoped_location
    11. | Lstringswitch of lambda + * (string * lambda) list + * lambda option + * scoped_location
    12. | Lstaticraise of int * lambda list
    13. | Lstaticcatch of lambda * int * (Ident.t * value_kind) list * lambda
    14. | Ltrywith of lambda * Ident.t * lambda
    15. | Lifthenelse of lambda * lambda * lambda
    16. | Lsequence of lambda * lambda
    17. | Lwhile of lambda * lambda
    18. | Lfor of Ident.t * lambda * lambda * Asttypes.direction_flag * lambda
    19. | Lassign of Ident.t * lambda
    20. | Lsend of meth_kind * lambda * lambda * lambda list * scoped_location
    21. | Levent of lambda * lambda_event
    22. | Lifused of Ident.t * lambda
    and rec_binding = {
    1. id : Ident.t;
    2. def : lfunction;
    }
    and lfunction = private {
    1. kind : function_kind;
    2. params : (Ident.t * value_kind) list;
    3. return : value_kind;
    4. body : lambda;
    5. attr : function_attribute;
    6. loc : scoped_location;
    }
    and lambda_apply = {
    1. ap_func : lambda;
    2. ap_args : lambda list;
    3. ap_loc : scoped_location;
    4. ap_tailcall : tailcall_attribute;
    5. ap_inlined : inline_attribute;
    6. ap_specialised : specialise_attribute;
    }
    and lambda_switch = {
    1. sw_numconsts : int;
    2. sw_consts : (int * lambda) list;
    3. sw_numblocks : int;
    4. sw_blocks : (int * lambda) list;
    5. sw_failaction : lambda option;
    }
    and lambda_event = {
    1. lev_loc : scoped_location;
    2. lev_kind : lambda_event_kind;
    3. lev_repr : int ref option;
    4. lev_env : Env.t;
    }
    and lambda_event_kind =
    1. | Lev_before
    2. | Lev_after of Types.type_expr
    3. | Lev_function
    4. | Lev_pseudo
    type program = {
    1. module_ident : Ident.t;
    2. main_module_block_size : int;
    3. required_globals : Ident.Set.t;
    4. code : lambda;
    }
    val make_key : lambda -> lambda option
    val const_unit : structured_constant
    val const_int : int -> structured_constant
    val lambda_unit : lambda
    val dummy_constant : lambda

    dummy_constant produces a plecholder value with a recognizable bit pattern (currently 0xBBBB in its tagged form)

    val name_lambda : let_kind -> lambda -> (Ident.t -> lambda) -> lambda
    val name_lambda_list : lambda list -> (lambda list -> lambda) -> lambda
    val lfunction : + kind:function_kind -> + params:(Ident.t * value_kind) list -> + return:value_kind -> + body:lambda -> + attr:function_attribute -> + loc:scoped_location -> + lambda
    val lfunction' : + kind:function_kind -> + params:(Ident.t * value_kind) list -> + return:value_kind -> + body:lambda -> + attr:function_attribute -> + loc:scoped_location -> + lfunction
    val iter_head_constructor : (lambda -> unit) -> lambda -> unit

    iter_head_constructor f lam apply f to only the first level of sub expressions of lam. It does not recursively traverse the expression.

    val shallow_iter : + tail:(lambda -> unit) -> + non_tail:(lambda -> unit) -> + lambda -> + unit

    Same as iter_head_constructor, but use a different callback for sub-terms which are in tail position or not.

    val transl_prim : string -> string -> lambda

    Translate a value from a persistent module. For instance:

      transl_internal_value "CamlinternalLazy" "force"
    val free_variables : lambda -> Ident.Set.t
    val transl_module_path : scoped_location -> Env.t -> Path.t -> lambda
    val transl_value_path : scoped_location -> Env.t -> Path.t -> lambda
    val transl_extension_path : scoped_location -> Env.t -> Path.t -> lambda
    val transl_class_path : scoped_location -> Env.t -> Path.t -> lambda
    val make_sequence : ('a -> lambda) -> 'a list -> lambda
    val subst : + (Ident.t -> Types.value_description -> Env.t -> Env.t) -> + ?freshen_bound_variables:bool -> + lambda Ident.Map.t -> + lambda -> + lambda

    subst update_env ?freshen_bound_variables s lt applies a substitution s to the lambda-term lt.

    Assumes that the image of the substitution is out of reach of the bound variables of the lambda-term (no capture).

    update_env is used to refresh the environment contained in debug events.

    freshen_bound_variables, which defaults to false, freshens the bound variables within lt.

    val rename : Ident.t Ident.Map.t -> lambda -> lambda

    A version of subst specialized for the case where we're just renaming idents.

    val duplicate_function : lfunction -> lfunction

    Duplicate a term, freshening all locally-bound identifiers.

    val map : (lambda -> lambda) -> lambda -> lambda

    Bottom-up rewriting, applying the function on each node from the leaves to the root.

    val map_lfunction : (lambda -> lambda) -> lfunction -> lfunction

    Apply the given transformation on the function's body

    val shallow_map : (lambda -> lambda) -> lambda -> lambda

    Rewrite each immediate sub-term with the function.

    val bind : let_kind -> Ident.t -> lambda -> lambda -> lambda
    val bind_with_value_kind : + let_kind -> + (Ident.t * value_kind) -> + lambda -> + lambda -> + lambda
    val negate_integer_comparison : integer_comparison -> integer_comparison
    val swap_integer_comparison : integer_comparison -> integer_comparison
    val negate_float_comparison : float_comparison -> float_comparison
    val swap_float_comparison : float_comparison -> float_comparison
    val default_function_attribute : function_attribute
    val default_stub_attribute : function_attribute
    val function_is_curried : lfunction -> bool
    val find_exact_application : + function_kind -> + arity:int -> + lambda list -> + lambda list option
    val max_arity : unit -> int

    Maximal number of parameters for a function, or in other words, maximal length of the params list of a lfunction record. This is unlimited (max_int) for bytecode, but limited (currently to 126) for native code.

    val next_raise_count : unit -> int
    val staticfail : lambda
    val is_guarded : lambda -> bool
    val patch_guarded : lambda -> lambda -> lambda
    val raise_kind : raise_kind -> string
    val merge_inline_attributes : + inline_attribute -> + inline_attribute -> + inline_attribute option
    val reset : unit -> unit
    diff --git a/ocaml/Lazy_backtrack/index.html b/ocaml/Lazy_backtrack/index.html new file mode 100644 index 0000000..ff88f3c --- /dev/null +++ b/ocaml/Lazy_backtrack/index.html @@ -0,0 +1,6 @@ + +Lazy_backtrack (ocaml.Lazy_backtrack)

    Module Lazy_backtrack

    type ('a, 'b) t
    type log
    val force : ('a -> 'b) -> ('a, 'b) t -> 'b
    val create : 'a -> ('a, 'b) t
    val get_arg : ('a, 'b) t -> 'a option
    val get_contents : ('a, 'b) t -> ('a, 'b) Stdlib.Either.t
    val create_forced : 'b -> ('a, 'b) t
    val create_failed : exn -> ('a, 'b) t
    val log : unit -> log
    val force_logged : + log -> + ('a -> ('b, 'c) result) -> + ('a, ('b, 'c) result) t -> + ('b, 'c) result
    val backtrack : log -> unit
    diff --git a/ocaml/Lexer/index.html b/ocaml/Lexer/index.html new file mode 100644 index 0000000..fd0b2c0 --- /dev/null +++ b/ocaml/Lexer/index.html @@ -0,0 +1,7 @@ + +Lexer (ocaml.Lexer)

    Module Lexer

    The lexical analyzer

    Warning: this module is unstable and part of compiler-libs.

    val init : unit -> unit
    val skip_hash_bang : Stdlib.Lexing.lexbuf -> unit
    type error =
    1. | Illegal_character of char
    2. | Illegal_escape of string * string option
    3. | Reserved_sequence of string * string option
    4. | Unterminated_comment of Location.t
    5. | Unterminated_string
    6. | Unterminated_string_in_comment of Location.t * Location.t
    7. | Empty_character_literal
    8. | Keyword_as_label of string
    9. | Invalid_literal of string
    10. | Invalid_directive of string * string option
    exception Error of error * Location.t
    val in_comment : unit -> bool
    val in_string : unit -> bool
    val is_keyword : string -> bool
    val print_warnings : bool ref
    val handle_docstrings : bool ref
    val comments : unit -> (string * Location.t) list
    val token_with_comments : Stdlib.Lexing.lexbuf -> Parser.token
    val set_preprocessor : + (unit -> unit) -> + ((Stdlib.Lexing.lexbuf -> Parser.token) -> + Stdlib.Lexing.lexbuf -> + Parser.token) -> + unit
    diff --git a/ocaml/Lift_code/index.html b/ocaml/Lift_code/index.html new file mode 100644 index 0000000..da2ec51 --- /dev/null +++ b/ocaml/Lift_code/index.html @@ -0,0 +1,7 @@ + +Lift_code (ocaml.Lift_code)

    Module Lift_code

    val lift_lets : lifter

    Lift let bindings to attempt to increase the length of scopes, as an aid to further optimizations. For example: let c = let b = <expr> in b, b in fst c would be transformed to: let b = <expr> in let c = b, b in fst c which is then clearly just: <expr>

    val lift_lets_expr : Flambda.t -> toplevel:bool -> Flambda.t
    val lifting_helper : + Flambda.t list -> + evaluation_order:[ `Left_to_right | `Right_to_left ] -> + create_body:(Variable.t list -> Flambda.t) -> + name:Internal_variable_names.t -> + Flambda.t
    diff --git a/ocaml/Lift_constants/index.html b/ocaml/Lift_constants/index.html new file mode 100644 index 0000000..c6eb51a --- /dev/null +++ b/ocaml/Lift_constants/index.html @@ -0,0 +1,5 @@ + +Lift_constants (ocaml.Lift_constants)

    Module Lift_constants

    The aim of this pass is to assign symbols to values known to be constant (in other words, whose values we know at compile time), with appropriate sharing of constants, and replace the occurrences of the constants with their corresponding symbols.

    This pass uses the results of two other passes, Inconstant_idents and Alias_analysis. The relationship between these two deserves some attention.

    Inconstant_idents is a "backwards" analysis that propagates implications about inconstantness of variables and set of closures IDs.

    Alias_analysis is a "forwards" analysis that is analogous to the propagation of Simple_value_approx.t values during Inline_and_simplify. It gives us information about relationships between values but not actually about their constantness.

    Combining these two into a single pass has been attempted previously, but was not thought to be successful; this experiment could be repeated in the future. (If "constant" is considered as "top" and "inconstant" is considered as "bottom", then Alias_analysis corresponds to a least fixed point and Inconstant_idents corresponds to a greatest fixed point.)

    At a high level, this pass operates as follows. Symbols are assigned to variables known to be constant and their defining expressions examined. Based on the results of Alias_analysis, we simplify the destructive elements within the defining expressions (specifically, projection of fields from blocks), to eventually yield Flambda.constant_defining_values that are entirely constructive. These will be bound to symbols in the resulting program.

    Another approach to this pass could be to only use the results of Inconstant_idents and then repeatedly lift constants and run Inline_and_simplify until a fixpoint. It was thought more robust to instead use Alias_analysis, where the fixpointing involves a less complicated function.

    We still run Inline_and_simplify once after this pass since the lifting of constants may enable more functions to become closed; the simplification pass provides an easy way of cleaning up (e.g. making sure free_vars maps in sets of closures are correct).

    val lift_constants : + Flambda.program -> + backend:(module Backend_intf.S) -> + Flambda.program
    diff --git a/ocaml/Lift_let_to_initialize_symbol/index.html b/ocaml/Lift_let_to_initialize_symbol/index.html new file mode 100644 index 0000000..fed3e07 --- /dev/null +++ b/ocaml/Lift_let_to_initialize_symbol/index.html @@ -0,0 +1,5 @@ + +Lift_let_to_initialize_symbol (ocaml.Lift_let_to_initialize_symbol)

    Module Lift_let_to_initialize_symbol

    val lift : + backend:(module Backend_intf.S) -> + Flambda.program -> + Flambda.program

    Lift toplevel Let-expressions to Flambda program constructions such that the results of evaluation of such expressions may be accessed directly, through symbols, rather than through closures. The Let-expressions typically come from the compilation of modules (using the bytecode strategy) in Translmod.

    This means of compilation supersedes the old "transl_store_" methodology for native code.

    An Initialize_symbol construction generated by this pass may be subsequently rewritten to Let_symbol if it is discovered that the initializer is in fact constant. (See Initialize_symbol_to_let_symbol.)

    The program constructions generated by this pass will be joined by others that arise from the lifting of constants (see Lift_constants).

    diff --git a/ocaml/Linear/index.html b/ocaml/Linear/index.html new file mode 100644 index 0000000..e4a32ab --- /dev/null +++ b/ocaml/Linear/index.html @@ -0,0 +1,7 @@ + +Linear (ocaml.Linear)

    Module Linear

    type label = Cmm.label
    type instruction = {
    1. mutable desc : instruction_desc;
    2. mutable next : instruction;
    3. arg : Reg.t array;
    4. res : Reg.t array;
    5. dbg : Debuginfo.t;
    6. live : Reg.Set.t;
    }
    and instruction_desc =
    1. | Lprologue
    2. | Lend
    3. | Lop of Mach.operation
    4. | Lreloadretaddr
    5. | Lreturn
    6. | Llabel of label
    7. | Lbranch of label
    8. | Lcondbranch of Mach.test * label
    9. | Lcondbranch3 of label option * label option * label option
    10. | Lswitch of label array
    11. | Lentertrap
    12. | Ladjust_trap_depth of {
      1. delta_traps : int;
      }
    13. | Lpushtrap of {
      1. lbl_handler : label;
      }
    14. | Lpoptrap
    15. | Lraise of Lambda.raise_kind
    val has_fallthrough : instruction_desc -> bool
    val end_instr : instruction
    val instr_cons : + instruction_desc -> + Reg.t array -> + Reg.t array -> + instruction -> + instruction
    val invert_test : Mach.test -> Mach.test
    type fundecl = {
    1. fun_name : string;
    2. fun_args : Reg.Set.t;
    3. fun_body : instruction;
    4. fun_fast : bool;
    5. fun_dbg : Debuginfo.t;
    6. fun_tailrec_entry_point_label : label;
    7. fun_contains_nontail_calls : bool;
    8. fun_num_stack_slots : int array;
    9. fun_frame_required : bool;
    10. fun_extra_stack_used : int;
    }
    diff --git a/ocaml/Linear_format/index.html b/ocaml/Linear_format/index.html new file mode 100644 index 0000000..b41a885 --- /dev/null +++ b/ocaml/Linear_format/index.html @@ -0,0 +1,2 @@ + +Linear_format (ocaml.Linear_format)

    Module Linear_format

    type linear_item_info =
    1. | Func of Linear.fundecl
    2. | Data of Cmm.data_item list
    type linear_unit_info = {
    1. mutable unit_name : string;
    2. mutable items : linear_item_info list;
    3. mutable for_pack : string option;
    }
    val save : string -> linear_unit_info -> unit
    val restore : string -> linear_unit_info * Stdlib.Digest.t
    diff --git a/ocaml/Linearize/index.html b/ocaml/Linearize/index.html new file mode 100644 index 0000000..4f38663 --- /dev/null +++ b/ocaml/Linearize/index.html @@ -0,0 +1,2 @@ + +Linearize (ocaml.Linearize)

    Module Linearize

    val fundecl : Mach.fundecl -> Linear.fundecl
    diff --git a/ocaml/Linkage_name/Map/index.html b/ocaml/Linkage_name/Map/index.html new file mode 100644 index 0000000..8fec78e --- /dev/null +++ b/ocaml/Linkage_name/Map/index.html @@ -0,0 +1,17 @@ + +Map (ocaml.Linkage_name.Map)

    Module Linkage_name.Map

    include Map.S with type key = T.t and type 'a t = 'a Map.Make(T).t

    Maps

    type key = T.t

    The type of the map keys.

    type 'a t = 'a Stdlib.Map.Make(T).t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key -> 'a -> 'a t -> 'a t

    add key data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key -> 'a -> 'a list t -> 'a list t

    add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

    update key f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : (key -> bool) -> 'a t -> key * 'a

    find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : (key -> bool) -> 'a t -> key * 'a

    find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : (key -> 'a -> unit) -> 'a t -> unit

    iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

    fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : (key -> 'a -> bool) -> 'a t -> 'a t

    filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : (key -> 'a -> bool) -> 'a t -> bool

    for_all f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : (key -> 'a -> bool) -> 'a t -> bool

    exists f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Stdlib.Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Stdlib.Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    val of_list : (key * 'a) list -> 'a t
    val disjoint_union : + ?eq:('a -> 'a -> bool) -> + ?print:(Stdlib.Format.formatter -> 'a -> unit) -> + 'a t -> + 'a t -> + 'a t

    disjoint_union m1 m2 contains all bindings from m1 and m2. If some binding is present in both and the associated value is not equal, a Fatal_error is raised

    val union_right : 'a t -> 'a t -> 'a t

    union_right m1 m2 contains all bindings from m1 and m2. If some binding is present in both, the one from m2 is taken

    val union_left : 'a t -> 'a t -> 'a t

    union_left m1 m2 = union_right m2 m1

    val union_merge : ('a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
    val rename : key t -> key -> key
    val map_keys : (key -> key) -> 'a t -> 'a t
    val keys : 'a t -> Stdlib.Set.Make(T).t
    val data : 'a t -> 'a list
    val of_set : (key -> 'a) -> Stdlib.Set.Make(T).t -> 'a t
    val transpose_keys_and_data : key t -> key t
    val transpose_keys_and_data_set : key t -> Stdlib.Set.Make(T).t t
    val print : + (Stdlib.Format.formatter -> 'a -> unit) -> + Stdlib.Format.formatter -> + 'a t -> + unit
    diff --git a/ocaml/Linkage_name/Set/index.html b/ocaml/Linkage_name/Set/index.html new file mode 100644 index 0000000..392e0c1 --- /dev/null +++ b/ocaml/Linkage_name/Set/index.html @@ -0,0 +1,2 @@ + +Set (ocaml.Linkage_name.Set)

    Module Linkage_name.Set

    include Set.S with type elt = T.t and type t = Set.Make(T).t

    Sets

    type elt = T.t

    The type of the set elements.

    The type of sets.

    val empty : t

    The empty set.

    val add : elt -> t -> t

    add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val singleton : elt -> t

    singleton x returns the one-element set containing only x.

    val remove : elt -> t -> t

    remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val union : t -> t -> t

    Set union.

    val inter : t -> t -> t

    Set intersection.

    val disjoint : t -> t -> bool

    Test if two sets are disjoint.

    • since 4.08
    val diff : t -> t -> t

    Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

    val cardinal : t -> int

    Return the number of elements of a set.

    Elements

    val elements : t -> elt list

    Return the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Set.Make.

    val min_elt : t -> elt

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

    val min_elt_opt : t -> elt option

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

    • since 4.05
    val max_elt : t -> elt

    Same as min_elt, but returns the largest element of the given set.

    val max_elt_opt : t -> elt option

    Same as min_elt_opt, but returns the largest element of the given set.

    • since 4.05
    val choose : t -> elt

    Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    val choose_opt : t -> elt option

    Return one element of the given set, or None if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    • since 4.05

    Searching

    val find : elt -> t -> elt

    find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

    • since 4.01
    val find_opt : elt -> t -> elt option

    find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

    • since 4.05
    val find_first : (elt -> bool) -> t -> elt

    find_first f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

    For example, find_first (fun e -> Ord.compare e x >= 0) s will return the first element e of s where Ord.compare e x >= 0 (intuitively: e >= x), or raise Not_found if x is greater than any element of s.

    • since 4.05
    val find_first_opt : (elt -> bool) -> t -> elt option

    find_first_opt f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

    • since 4.05
    val find_last : (elt -> bool) -> t -> elt

    find_last f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

    • since 4.05
    val find_last_opt : (elt -> bool) -> t -> elt option

    find_last_opt f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

    • since 4.05

    Traversing

    val iter : (elt -> unit) -> t -> unit

    iter f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.

    val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc

    fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

    Transforming

    val filter : (elt -> bool) -> t -> t

    filter f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val filter_map : (elt -> elt option) -> t -> t

    filter_map f s returns the set of all v such that f x = Some v for some element x of s.

    For example,

    filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) s

    is the set of halves of the even elements of s.

    If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned unchanged: the result of the function is then physically equal to s.

    • since 4.11
    val partition : (elt -> bool) -> t -> t * t

    partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

    val split : elt -> t -> t * bool * t

    split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.

    Predicates and comparisons

    val is_empty : t -> bool

    Test whether a set is empty or not.

    val mem : elt -> t -> bool

    mem x s tests whether x belongs to the set s.

    val equal : t -> t -> bool

    equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

    val compare : t -> t -> int

    Total ordering between sets. Can be used as the ordering function for doing sets of sets.

    val subset : t -> t -> bool

    subset s1 s2 tests whether the set s1 is a subset of the set s2.

    val for_all : (elt -> bool) -> t -> bool

    for_all f s checks if all elements of the set satisfy the predicate f.

    val exists : (elt -> bool) -> t -> bool

    exists f s checks if at least one element of the set satisfies the predicate f.

    Converting

    val to_list : t -> elt list

    to_list s is elements s.

    • since 5.1
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t

    to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

    • since 4.07
    val to_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in ascending order

    • since 4.07
    val to_rev_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in descending order

    • since 4.12
    val add_seq : elt Stdlib.Seq.t -> t -> t

    Add the given elements to the set, in order.

    • since 4.07
    val of_seq : elt Stdlib.Seq.t -> t

    Build a set from the given bindings

    • since 4.07
    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    val to_string : t -> string
    val of_list : elt list -> t
    val map : (elt -> elt) -> t -> t
    diff --git a/ocaml/Linkage_name/T/index.html b/ocaml/Linkage_name/T/index.html new file mode 100644 index 0000000..77042de --- /dev/null +++ b/ocaml/Linkage_name/T/index.html @@ -0,0 +1,2 @@ + +T (ocaml.Linkage_name.T)

    Module Linkage_name.T

    type t = t
    include Hashtbl.HashedType with type t := t
    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val hash : t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := t
    val compare : t -> t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    diff --git a/ocaml/Linkage_name/Tbl/index.html b/ocaml/Linkage_name/Tbl/index.html new file mode 100644 index 0000000..633d09f --- /dev/null +++ b/ocaml/Linkage_name/Tbl/index.html @@ -0,0 +1,2 @@ + +Tbl (ocaml.Linkage_name.Tbl)

    Module Linkage_name.Tbl

    include Hashtbl.S with type key = T.t and type 'a t = 'a Hashtbl.Make(T).t
    type key = T.t
    val create : int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    • since 4.00
    val copy : 'a t -> 'a t
    val add : 'a t -> key -> 'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    • since 4.05
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key -> 'a -> unit
    val mem : 'a t -> key -> bool
    val iter : (key -> 'a -> unit) -> 'a t -> unit
    val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
    • since 4.03
    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc
    val length : 'a t -> int
    val stats : 'a t -> Stdlib.Hashtbl.statistics
    • since 4.00
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
    • since 4.07
    val to_seq_keys : _ t -> key Stdlib.Seq.t
    • since 4.07
    val to_seq_values : 'a t -> 'a Stdlib.Seq.t
    • since 4.07
    val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
    • since 4.07
    val to_list : 'a t -> (T.t * 'a) list
    val of_list : (T.t * 'a) list -> 'a t
    val to_map : 'a t -> 'a Stdlib.Map.Make(T).t
    val of_map : 'a Stdlib.Map.Make(T).t -> 'a t
    val memoize : 'a t -> (key -> 'a) -> key -> 'a
    val map : 'a t -> ('a -> 'b) -> 'b t
    diff --git a/ocaml/Linkage_name/index.html b/ocaml/Linkage_name/index.html new file mode 100644 index 0000000..3b9e5ba --- /dev/null +++ b/ocaml/Linkage_name/index.html @@ -0,0 +1,2 @@ + +Linkage_name (ocaml.Linkage_name)

    Module Linkage_name

    include Identifiable.S
    type t
    module T : Identifiable.Thing with type t = t
    include Identifiable.Thing with type t := T.t
    include Hashtbl.HashedType with type t := T.t
    val equal : T.t -> T.t -> bool

    The equality predicate used to compare keys.

    val hash : T.t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := T.t
    val compare : T.t -> T.t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> T.t -> unit
    val print : Stdlib.Format.formatter -> T.t -> unit
    module Set : Identifiable.Set with module T := T
    module Map : Identifiable.Map with module T := T
    module Tbl : Identifiable.Tbl with module T := T
    val create : string -> t
    val to_string : t -> string
    diff --git a/ocaml/Linscan/index.html b/ocaml/Linscan/index.html new file mode 100644 index 0000000..d7307f1 --- /dev/null +++ b/ocaml/Linscan/index.html @@ -0,0 +1,2 @@ + +Linscan (ocaml.Linscan)

    Module Linscan

    val allocate_registers : Interval.result -> int array
    diff --git a/ocaml/Liveness/index.html b/ocaml/Liveness/index.html new file mode 100644 index 0000000..d86d5a2 --- /dev/null +++ b/ocaml/Liveness/index.html @@ -0,0 +1,2 @@ + +Liveness (ocaml.Liveness)

    Module Liveness

    val fundecl : Mach.fundecl -> unit
    diff --git a/ocaml/Load_path/Dir/index.html b/ocaml/Load_path/Dir/index.html new file mode 100644 index 0000000..e954d5f --- /dev/null +++ b/ocaml/Load_path/Dir/index.html @@ -0,0 +1,2 @@ + +Dir (ocaml.Load_path.Dir)

    Module Load_path.Dir

    type t

    Represent one directory in the load path.

    val create : hidden:bool -> string -> t
    val path : t -> string
    val files : t -> string list

    All the files in that directory. This doesn't include files in sub-directories of this directory.

    val hidden : t -> bool

    If the modules in this directory should not be bound in the initial scope

    val find : t -> string -> string option

    find dir fn returns the full path to fn in dir.

    val find_normalized : t -> string -> string option

    As find, but search also for uncapitalized name, i.e. if name is Foo.ml, either /path/Foo.ml or /path/foo.ml may be returned.

    diff --git a/ocaml/Load_path/index.html b/ocaml/Load_path/index.html new file mode 100644 index 0000000..524d906 --- /dev/null +++ b/ocaml/Load_path/index.html @@ -0,0 +1,9 @@ + +Load_path (ocaml.Load_path)

    Module Load_path

    Management of include directories.

    This module offers a high level interface to locating files in the load path, which is constructed from -I and -H command line flags and a few other parameters.

    It makes the assumption that the contents of include directories doesn't change during the execution of the compiler.

    val add_dir : hidden:bool -> string -> unit

    Add a directory to the end of the load path (i.e. at lowest priority.)

    val remove_dir : string -> unit

    Remove a directory from the load path

    val reset : unit -> unit

    Remove all directories

    module Dir : sig ... end
    type auto_include_callback = + (Dir.t -> string -> string option) -> + string -> + string

    The type of callback functions on for init ~auto_include

    val no_auto_include : auto_include_callback

    No automatic directory inclusion: misses in the load path raise Not_found as normal.

    val init : + auto_include:auto_include_callback -> + visible:string list -> + hidden:string list -> + unit

    init ~visible ~hidden is the same as reset (); List.iter add_dir (List.rev hidden); List.iter add_dir (List.rev visible)

    val auto_include_otherlibs : (string -> unit) -> auto_include_callback

    auto_include_otherlibs alert is a callback function to be passed to Load_path.init and automatically adds -I +lib to the load path after calling alert lib.

    val get_path_list : unit -> string list

    Return the list of directories passed to add_dir so far.

    type paths = {
    1. visible : string list;
    2. hidden : string list;
    }
    val get_paths : unit -> paths

    Return the directories passed to add_dir so far.

    val find : string -> string

    Locate a file in the load path. Raise Not_found if the file cannot be found. This function is optimized for the case where the filename is a basename, i.e. doesn't contain a directory separator.

    val find_normalized : string -> string

    Same as find, but search also for normalized unit name (see Misc.normalized_unit_filename), i.e. if name is Foo.ml, allow /path/Foo.ml and /path/foo.ml to match.

    type visibility =
    1. | Visible
    2. | Hidden
    val find_normalized_with_visibility : string -> string * visibility

    Same as find_normalized, but also reports whether the cmi was found in a -I directory (Visible) or a -H directory (Hidden)

    val add : Dir.t -> unit

    Old name for append_dir

    • deprecated
    val append_dir : Dir.t -> unit

    append_dir d adds d to the end of the load path (i.e. at lowest priority.

    val prepend_dir : Dir.t -> unit

    prepend_dir d adds d to the start of the load path (i.e. at highest priority.

    val get_visible : unit -> Dir.t list

    Same as get_paths (), except that it returns a Dir.t list, and doesn't include the -H paths.

    diff --git a/ocaml/Local_store/index.html b/ocaml/Local_store/index.html new file mode 100644 index 0000000..0e088cf --- /dev/null +++ b/ocaml/Local_store/index.html @@ -0,0 +1,2 @@ + +Local_store (ocaml.Local_store)

    Module Local_store

    This module provides some facilities for creating references (and hash tables) which can easily be snapshoted and restored to an arbitrary version.

    It is used throughout the frontend (read: typechecker), to register all (well, hopefully) the global state. Thus making it easy for tools like Merlin to go back and forth typechecking different files.

    Creators

    val s_ref : 'a -> 'a ref

    Similar to Stdlib.ref, except the allocated reference is registered into the store.

    val s_table : ('a -> 'b) -> 'a -> 'b ref

    Used to register hash tables. Those also need to be placed into refs to be easily swapped out, but one can't just "snapshot" the initial value to create fresh instances, so instead an initializer is required.

    Use it like this:

      let my_table = s_table Hashtbl.create 42

    State management

    Note: all the following functions are currently unused inside the compiler codebase. Merlin is their only user at the moment.

    type store
    val fresh : unit -> store

    Returns a fresh instance of the store.

    The first time this function is called, it snapshots the value of all the registered references, later calls to fresh will return instances initialized to those values.

    val with_store : store -> (unit -> 'a) -> 'a

    with_store s f resets all the registered references to the value they have in s for the run of f. If f updates any of the registered refs, s is updated to remember those changes.

    val reset : unit -> unit

    Resets all the references to the initial snapshot (i.e. to the same values that new instances start with).

    val is_bound : unit -> bool

    Returns true when a store is active (i.e. when called from the callback passed to with_store), false otherwise.

    diff --git a/ocaml/Location/index.html b/ocaml/Location/index.html new file mode 100644 index 0000000..e19541a --- /dev/null +++ b/ocaml/Location/index.html @@ -0,0 +1,42 @@ + +Location (ocaml.Location)

    Module Location

    Source code locations (ranges of positions), used in parsetree.

    Warning: this module is unstable and part of compiler-libs.

    type t = Warnings.loc = {
    1. loc_start : Stdlib.Lexing.position;
    2. loc_end : Stdlib.Lexing.position;
    3. loc_ghost : bool;
    }

    Note on the use of Lexing.position in this module. If pos_fname = "", then use !input_name instead. If pos_lnum = -1, then pos_bol = 0. Use pos_cnum and re-parse the file to get the line and character numbers. Else all fields are correct.

    val none : t

    An arbitrary value of type t; describes an empty ghost range.

    val is_none : t -> bool

    True for Location.none, false any other location

    val in_file : string -> t

    Return an empty ghost range located in a given file.

    val init : Stdlib.Lexing.lexbuf -> string -> unit

    Set the file name and line number of the lexbuf to be the start of the named file.

    val curr : Stdlib.Lexing.lexbuf -> t

    Get the location of the current token from the lexbuf.

    val symbol_rloc : unit -> t
    val symbol_gloc : unit -> t
    val rhs_loc : int -> t

    rhs_loc n returns the location of the symbol at position n, starting at 1, in the current parser rule.

    val rhs_interval : int -> int -> t
    val get_pos_info : Stdlib.Lexing.position -> string * int * int

    file, line, char

    type 'a loc = {
    1. txt : 'a;
    2. loc : t;
    }
    val mknoloc : 'a -> 'a loc
    val mkloc : 'a -> t -> 'a loc

    Input info

    val input_name : string ref
    val input_lexbuf : Stdlib.Lexing.lexbuf option ref
    val input_phrase_buffer : Stdlib.Buffer.t option ref

    Toplevel-specific functions

    val echo_eof : unit -> unit
    val separate_new_message : Stdlib.Format.formatter -> unit
    val reset : unit -> unit

    Rewriting path

    val rewrite_absolute_path : string -> string

    rewrite_absolute_path path rewrites path to honor the BUILD_PATH_PREFIX_MAP variable if it is set. It does not check whether path is absolute or not. The result is as follows:

    • If BUILD_PATH_PREFIX_MAP is not set, just return path.
    • otherwise, rewrite using the mapping (and if there are no matching prefixes that will just return path).

    See the BUILD_PATH_PREFIX_MAP spec

    val rewrite_find_first_existing : string -> string option

    rewrite_find_first_existing path uses a BUILD_PATH_PREFIX_MAP mapping and tries to find a source in mapping that maps to a result that exists in the file system. There are the following return values:

    • None, means either

      • BUILD_PATH_PREFIX_MAP is not set and path does not exists, or
      • no source prefixes of path in the mapping were found,

    • Some target, means target exists and either

      • BUILD_PATH_PREFIX_MAP is not set and target = path, or
      • target is the first file (in priority order) that path mapped to that exists in the file system.
    • Not_found raised, means some source prefixes in the map were found that matched path, but none of them existed in the file system. The caller should catch this and issue an appropriate error message.

    See the BUILD_PATH_PREFIX_MAP spec

    val rewrite_find_all_existing_dirs : string -> string list

    rewrite_find_all_existing_dirs dir accumulates a list of existing directories, dirs, that are the result of mapping a potentially abstract directory, dir, over all the mapping pairs in the BUILD_PATH_PREFIX_MAP environment variable, if any. The list dirs will be in priority order (head as highest priority).

    The possible results are:

    • [], means either

      • BUILD_PATH_PREFIX_MAP is not set and dir is not an existing directory, or
      • if set, then there were no matching prefixes of dir.

    • Some dirs, means dirs are the directories found. Either

      • BUILD_PATH_PREFIX_MAP is not set and dirs = [dir], or
      • it was set and dirs are the mapped existing directories.
    • Not_found raised, means some source prefixes in the map were found that matched dir, but none of mapping results were existing directories (possibly due to misconfiguration). The caller should catch this and issue an appropriate error message.

    See the BUILD_PATH_PREFIX_MAP spec

    val absolute_path : string -> string

    absolute_path path first makes an absolute path, s from path, prepending the current working directory if path was relative. Then s is rewritten using rewrite_absolute_path. Finally the result is normalized by eliminating instances of '.' or '..'.

    Printing locations

    val show_filename : string -> string

    In -absname mode, return the absolute path for this filename. Otherwise, returns the filename unchanged.

    val print_filename : Stdlib.Format.formatter -> string -> unit
    val print_loc : Stdlib.Format.formatter -> t -> unit
    val print_locs : Stdlib.Format.formatter -> t list -> unit

    Toplevel-specific location highlighting

    val highlight_terminfo : + Stdlib.Lexing.lexbuf -> + Stdlib.Format.formatter -> + t list -> + unit

    Reporting errors and warnings

    The type of reports and report printers

    type msg = (Stdlib.Format.formatter -> unit) loc
    val msg : ?loc:t -> ('a, Stdlib.Format.formatter, unit, msg) format4 -> 'a
    type report_kind =
    1. | Report_error
    2. | Report_warning of string
    3. | Report_warning_as_error of string
    4. | Report_alert of string
    5. | Report_alert_as_error of string
    type report = {
    1. kind : report_kind;
    2. main : msg;
    3. sub : msg list;
    }
    type report_printer = {
    1. pp : report_printer -> Stdlib.Format.formatter -> report -> unit;
    2. pp_report_kind : report_printer -> + report -> + Stdlib.Format.formatter -> + report_kind -> + unit;
    3. pp_main_loc : report_printer -> report -> Stdlib.Format.formatter -> t -> unit;
    4. pp_main_txt : report_printer -> + report -> + Stdlib.Format.formatter -> + (Stdlib.Format.formatter -> unit) -> + unit;
    5. pp_submsgs : report_printer -> + report -> + Stdlib.Format.formatter -> + msg list -> + unit;
    6. pp_submsg : report_printer -> report -> Stdlib.Format.formatter -> msg -> unit;
    7. pp_submsg_loc : report_printer -> + report -> + Stdlib.Format.formatter -> + t -> + unit;
    8. pp_submsg_txt : report_printer -> + report -> + Stdlib.Format.formatter -> + (Stdlib.Format.formatter -> unit) -> + unit;
    }

    A printer for reports, defined using open-recursion. The goal is to make it easy to define new printers by re-using code from existing ones.

    Report printers used in the compiler

    val batch_mode_printer : report_printer
    val terminfo_toplevel_printer : Stdlib.Lexing.lexbuf -> report_printer
    val best_toplevel_printer : unit -> report_printer

    Detects the terminal capabilities and selects an adequate printer

    Printing a report

    val print_report : Stdlib.Format.formatter -> report -> unit

    Display an error or warning report.

    val report_printer : (unit -> report_printer) ref

    Hook for redefining the printer of reports.

    The hook is a unit -> report_printer and not simply a report_printer: this is useful so that it can detect the type of the output (a file, a terminal, ...) and select a printer accordingly.

    val default_report_printer : unit -> report_printer

    Original report printer for use in hooks.

    Reporting warnings

    Converting a Warnings.t into a report

    val report_warning : t -> Warnings.t -> report option

    report_warning loc w produces a report for the given warning w, or None if the warning is not to be printed.

    val warning_reporter : (t -> Warnings.t -> report option) ref

    Hook for intercepting warnings.

    val default_warning_reporter : t -> Warnings.t -> report option

    Original warning reporter for use in hooks.

    Printing warnings

    val formatter_for_warnings : Stdlib.Format.formatter ref
    val print_warning : t -> Stdlib.Format.formatter -> Warnings.t -> unit

    Prints a warning. This is simply the composition of report_warning and print_report.

    val prerr_warning : t -> Warnings.t -> unit

    Same as print_warning, but uses !formatter_for_warnings as output formatter.

    Reporting alerts

    Converting an Alert.t into a report

    val report_alert : t -> Warnings.alert -> report option

    report_alert loc w produces a report for the given alert w, or None if the alert is not to be printed.

    val alert_reporter : (t -> Warnings.alert -> report option) ref

    Hook for intercepting alerts.

    val default_alert_reporter : t -> Warnings.alert -> report option

    Original alert reporter for use in hooks.

    Printing alerts

    val print_alert : t -> Stdlib.Format.formatter -> Warnings.alert -> unit

    Prints an alert. This is simply the composition of report_alert and print_report.

    val prerr_alert : t -> Warnings.alert -> unit

    Same as print_alert, but uses !formatter_for_warnings as output formatter.

    val deprecated : ?def:t -> ?use:t -> t -> string -> unit

    Prints a deprecation alert.

    val alert : ?def:t -> ?use:t -> kind:string -> t -> string -> unit

    Prints an arbitrary alert.

    val auto_include_alert : string -> unit

    Prints an alert that -I +lib has been automatically added to the load path

    val deprecated_script_alert : string -> unit

    deprecated_script_alert command prints an alert that command foo has been deprecated in favour of command ./foo

    Reporting errors

    type error = report

    An error is a report which report_kind must be Report_error.

    val error : ?loc:t -> ?sub:msg list -> string -> error
    val errorf : + ?loc:t -> + ?sub:msg list -> + ('a, Stdlib.Format.formatter, unit, error) format4 -> + 'a
    val error_of_printer : + ?loc:t -> + ?sub:msg list -> + (Stdlib.Format.formatter -> 'a -> unit) -> + 'a -> + error
    val error_of_printer_file : + (Stdlib.Format.formatter -> 'a -> unit) -> + 'a -> + error

    Automatically reporting errors for raised exceptions

    val register_error_of_exn : (exn -> error option) -> unit

    Each compiler module which defines a custom type of exception which can surface as a user-visible error should register a "printer" for this exception using register_error_of_exn. The result of the printer is an error value containing a location, a message, and optionally sub-messages (each of them being located as well).

    val error_of_exn : exn -> [ `Ok of error | `Already_displayed ] option
    exception Error of error

    Raising Error e signals an error e; the exception will be caught and the error will be printed.

    exception Already_displayed_error

    Raising Already_displayed_error signals an error which has already been printed. The exception will be caught, but nothing will be printed

    val raise_errorf : + ?loc:t -> + ?sub:msg list -> + ('a, Stdlib.Format.formatter, unit, 'b) format4 -> + 'a
    val report_exception : Stdlib.Format.formatter -> exn -> unit

    Reraise the exception if it is unknown.

    diff --git a/ocaml/Longident/index.html b/ocaml/Longident/index.html new file mode 100644 index 0000000..ed08484 --- /dev/null +++ b/ocaml/Longident/index.html @@ -0,0 +1,3 @@ + +Longident (ocaml.Longident)

    Module Longident

    Long identifiers, used in parsetree.

    Warning: this module is unstable and part of compiler-libs.

    To print a longident, see Pprintast.longident, using Format.asprintf to convert to a string.

    type t =
    1. | Lident of string
    2. | Ldot of t * string
    3. | Lapply of t * t
    val flatten : t -> string list
    val unflatten : string list -> t option

    For a non-empty list l, unflatten l is Some lid where lid is the long identifier created by concatenating the elements of l with Ldot. unflatten [] is None.

    val last : t -> string
    val parse : string -> t

    This function is broken on identifiers that are not just "Word.Word.word"; for example, it returns incorrect results on infix operators and extended module paths.

    If you want to generate long identifiers that are a list of dot-separated identifiers, the function unflatten is safer and faster. unflatten is available since OCaml 4.06.0.

    If you want to parse any identifier correctly, use the long-identifiers functions from the Parse module, in particular Parse.longident. They are available since OCaml 4.11, and also provide proper input-location support.

    • deprecated this function may misparse its input, +use "Parse.longident" or "Longident.unflatten"
    diff --git a/ocaml/Mach/index.html b/ocaml/Mach/index.html new file mode 100644 index 0000000..6addcd5 --- /dev/null +++ b/ocaml/Mach/index.html @@ -0,0 +1,13 @@ + +Mach (ocaml.Mach)

    Module Mach

    type integer_comparison =
    1. | Isigned of Cmm.integer_comparison
    2. | Iunsigned of Cmm.integer_comparison
    type integer_operation =
    1. | Iadd
    2. | Isub
    3. | Imul
    4. | Imulh
    5. | Idiv
    6. | Imod
    7. | Iand
    8. | Ior
    9. | Ixor
    10. | Ilsl
    11. | Ilsr
    12. | Iasr
    13. | Icomp of integer_comparison
    14. | Icheckbound
    type float_comparison = Cmm.float_comparison
    type test =
    1. | Itruetest
    2. | Ifalsetest
    3. | Iinttest of integer_comparison
    4. | Iinttest_imm of integer_comparison * int
    5. | Ifloattest of float_comparison
    6. | Ioddtest
    7. | Ieventest
    type operation =
    1. | Imove
    2. | Ispill
    3. | Ireload
    4. | Iconst_int of nativeint
    5. | Iconst_float of int64
    6. | Iconst_symbol of string
    7. | Icall_ind
    8. | Icall_imm of {
      1. func : string;
      }
    9. | Itailcall_ind
    10. | Itailcall_imm of {
      1. func : string;
      }
    11. | Iextcall of {
      1. func : string;
      2. ty_res : Cmm.machtype;
      3. ty_args : Cmm.exttype list;
      4. alloc : bool;
      5. stack_ofs : int;
      }
    12. | Istackoffset of int
    13. | Iload of {
      1. memory_chunk : Cmm.memory_chunk;
      2. addressing_mode : Arch.addressing_mode;
      3. mutability : Asttypes.mutable_flag;
      4. is_atomic : bool;
      }
    14. | Istore of Cmm.memory_chunk * Arch.addressing_mode * bool
    15. | Ialloc of {
      1. bytes : int;
      2. dbginfo : Debuginfo.alloc_dbginfo;
      }
    16. | Iintop of integer_operation
    17. | Iintop_imm of integer_operation * int
    18. | Icompf of float_comparison
    19. | Inegf
    20. | Iabsf
    21. | Iaddf
    22. | Isubf
    23. | Imulf
    24. | Idivf
    25. | Ifloatofint
    26. | Iintoffloat
    27. | Iopaque
    28. | Ispecific of Arch.specific_operation
    29. | Ipoll of {
      1. return_label : Cmm.label option;
      }
    30. | Idls_get
    31. | Ireturn_addr
      (*

      Retrieve the return address from the stack frame

      *)
    type instruction = {
    1. desc : instruction_desc;
    2. next : instruction;
    3. arg : Reg.t array;
    4. res : Reg.t array;
    5. dbg : Debuginfo.t;
    6. mutable live : Reg.Set.t;
    }
    and instruction_desc =
    1. | Iend
    2. | Iop of operation
    3. | Ireturn
    4. | Iifthenelse of test * instruction * instruction
    5. | Iswitch of int array * instruction array
    6. | Icatch of Cmm.rec_flag * (int * instruction) list * instruction
    7. | Iexit of int
    8. | Itrywith of instruction * instruction
    9. | Iraise of Lambda.raise_kind
    type fundecl = {
    1. fun_name : string;
    2. fun_args : Reg.t array;
    3. fun_body : instruction;
    4. fun_codegen_options : Cmm.codegen_option list;
    5. fun_dbg : Debuginfo.t;
    6. fun_poll : Lambda.poll_attribute;
    7. fun_num_stack_slots : int array;
    }
    val dummy_instr : instruction
    val end_instr : unit -> instruction
    val instr_cons : + instruction_desc -> + Reg.t array -> + Reg.t array -> + instruction -> + instruction
    val instr_cons_debug : + instruction_desc -> + Reg.t array -> + Reg.t array -> + Debuginfo.t -> + instruction -> + instruction
    val instr_iter : (instruction -> unit) -> instruction -> unit
    val operation_is_pure : operation -> bool

    Returns true if the given operation only produces a result in its destination registers, but has no side effects whatsoever: it doesn't raise exceptions, it doesn't modify already-allocated blocks, it doesn't adjust the stack frame, etc.

    val operation_can_raise : operation -> bool

    Returns true if the given operation can raise an exception.

    diff --git a/ocaml/Main/index.html b/ocaml/Main/index.html new file mode 100644 index 0000000..f6c6bba --- /dev/null +++ b/ocaml/Main/index.html @@ -0,0 +1,2 @@ + +Main (ocaml.Main)

    Module Main

    diff --git a/ocaml/Main_args/Default/Main/index.html b/ocaml/Main_args/Default/Main/index.html new file mode 100644 index 0000000..b63c527 --- /dev/null +++ b/ocaml/Main_args/Default/Main/index.html @@ -0,0 +1,2 @@ + +Main (ocaml.Main_args.Default.Main)

    Module Default.Main

    include Core_options
    include Common_options
    val _absname : unit -> unit
    val _no_absname : unit -> unit
    val _alert : string -> unit
    val _I : string -> unit
    val _H : string -> unit
    val _labels : unit -> unit
    val _alias_deps : unit -> unit
    val _no_alias_deps : unit -> unit
    val _app_funct : unit -> unit
    val _no_app_funct : unit -> unit
    val _noassert : unit -> unit
    val _nolabels : unit -> unit
    val _nostdlib : unit -> unit
    val _nocwd : unit -> unit
    val _open : string -> unit
    val _ppx : string -> unit
    val _no_rectypes : unit -> unit
    val _safer_matching : unit -> unit
    val _strict_sequence : unit -> unit
    val _no_strict_sequence : unit -> unit
    val _strict_formats : unit -> unit
    val _no_strict_formats : unit -> unit
    val _unboxed_types : unit -> unit
    val _no_unboxed_types : unit -> unit
    val _version : unit -> unit
    val _vnum : unit -> unit
    val _w : string -> unit
    val anonymous : string -> unit
    val _nopervasives : unit -> unit
    val _unsafe : unit -> unit
    val _warn_error : string -> unit
    val _warn_help : unit -> unit
    val _dno_unique_ids : unit -> unit
    val _dunique_ids : unit -> unit
    val _dno_locations : unit -> unit
    val _dlocations : unit -> unit
    val _dsource : unit -> unit
    val _dparsetree : unit -> unit
    val _dtypedtree : unit -> unit
    val _dshape : unit -> unit
    val _drawlambda : unit -> unit
    val _dlambda : unit -> unit
    include Compiler_options
    val _a : unit -> unit
    val _annot : unit -> unit
    val _binannot : unit -> unit
    val _binannot_occurrences : unit -> unit
    val _c : unit -> unit
    val _cc : string -> unit
    val _cclib : string -> unit
    val _ccopt : string -> unit
    val _cmi_file : string -> unit
    val _config : unit -> unit
    val _config_var : string -> unit
    val _for_pack : string -> unit
    val _g : unit -> unit
    val _no_g : unit -> unit
    val _stop_after : string -> unit
    val _i : unit -> unit
    val _impl : string -> unit
    val _intf : string -> unit
    val _intf_suffix : string -> unit
    val _keep_docs : unit -> unit
    val _no_keep_docs : unit -> unit
    val _keep_locs : unit -> unit
    val _no_keep_locs : unit -> unit
    val _linkall : unit -> unit
    val _noautolink : unit -> unit
    val _o : string -> unit
    val _opaque : unit -> unit
    val _output_obj : unit -> unit
    val _output_complete_obj : unit -> unit
    val _pack : unit -> unit
    val _plugin : string -> unit
    val _pp : string -> unit
    val _principal : unit -> unit
    val _no_principal : unit -> unit
    val _rectypes : unit -> unit
    val _runtime_variant : string -> unit
    val _with_runtime : unit -> unit
    val _without_runtime : unit -> unit
    val _short_paths : unit -> unit
    val _thread : unit -> unit
    val _v : unit -> unit
    val _verbose : unit -> unit
    val _where : unit -> unit
    val _color : string -> unit
    val _error_style : string -> unit
    val _match_context_rows : int -> unit
    val _dtimings : unit -> unit
    val _dprofile : unit -> unit
    val _dump_into_file : unit -> unit
    val _dump_dir : string -> unit
    val _args : string -> string array
    val _args0 : string -> string array
    val _compat_32 : unit -> unit
    val _custom : unit -> unit
    val _no_check_prims : unit -> unit
    val _dllib : string -> unit
    val _dllpath : string -> unit
    val _make_runtime : unit -> unit
    val _vmthread : unit -> unit
    val _use_runtime : string -> unit
    val _output_complete_exe : unit -> unit
    val _dinstr : unit -> unit
    val _dcamlprimc : unit -> unit
    val _use_prims : string -> unit
    diff --git a/ocaml/Main_args/Default/Odoc_args/index.html b/ocaml/Main_args/Default/Odoc_args/index.html new file mode 100644 index 0000000..9b94ddc --- /dev/null +++ b/ocaml/Main_args/Default/Odoc_args/index.html @@ -0,0 +1,2 @@ + +Odoc_args (ocaml.Main_args.Default.Odoc_args)

    Module Default.Odoc_args

    include Common_options
    val _absname : unit -> unit
    val _no_absname : unit -> unit
    val _alert : string -> unit
    val _I : string -> unit
    val _H : string -> unit
    val _labels : unit -> unit
    val _alias_deps : unit -> unit
    val _no_alias_deps : unit -> unit
    val _app_funct : unit -> unit
    val _no_app_funct : unit -> unit
    val _noassert : unit -> unit
    val _nolabels : unit -> unit
    val _nostdlib : unit -> unit
    val _nocwd : unit -> unit
    val _open : string -> unit
    val _ppx : string -> unit
    val _principal : unit -> unit
    val _no_principal : unit -> unit
    val _rectypes : unit -> unit
    val _no_rectypes : unit -> unit
    val _safer_matching : unit -> unit
    val _short_paths : unit -> unit
    val _strict_sequence : unit -> unit
    val _no_strict_sequence : unit -> unit
    val _strict_formats : unit -> unit
    val _no_strict_formats : unit -> unit
    val _unboxed_types : unit -> unit
    val _no_unboxed_types : unit -> unit
    val _version : unit -> unit
    val _vnum : unit -> unit
    val _w : string -> unit
    val anonymous : string -> unit
    val _impl : string -> unit
    val _intf : string -> unit
    val _intf_suffix : string -> unit
    val _pp : string -> unit
    val _thread : unit -> unit
    val _v : unit -> unit
    val _verbose : unit -> unit
    val _vmthread : unit -> unit
    diff --git a/ocaml/Main_args/Default/Optmain/index.html b/ocaml/Main_args/Default/Optmain/index.html new file mode 100644 index 0000000..39f3aad --- /dev/null +++ b/ocaml/Main_args/Default/Optmain/index.html @@ -0,0 +1,2 @@ + +Optmain (ocaml.Main_args.Default.Optmain)

    Module Default.Optmain

    include Core_options
    include Common_options
    val _absname : unit -> unit
    val _no_absname : unit -> unit
    val _alert : string -> unit
    val _I : string -> unit
    val _H : string -> unit
    val _labels : unit -> unit
    val _alias_deps : unit -> unit
    val _no_alias_deps : unit -> unit
    val _app_funct : unit -> unit
    val _no_app_funct : unit -> unit
    val _noassert : unit -> unit
    val _nolabels : unit -> unit
    val _nostdlib : unit -> unit
    val _nocwd : unit -> unit
    val _open : string -> unit
    val _ppx : string -> unit
    val _no_rectypes : unit -> unit
    val _safer_matching : unit -> unit
    val _strict_sequence : unit -> unit
    val _no_strict_sequence : unit -> unit
    val _strict_formats : unit -> unit
    val _no_strict_formats : unit -> unit
    val _unboxed_types : unit -> unit
    val _no_unboxed_types : unit -> unit
    val _version : unit -> unit
    val _vnum : unit -> unit
    val _w : string -> unit
    val anonymous : string -> unit
    val _nopervasives : unit -> unit
    val _unsafe : unit -> unit
    val _warn_error : string -> unit
    val _warn_help : unit -> unit
    val _dno_unique_ids : unit -> unit
    val _dunique_ids : unit -> unit
    val _dno_locations : unit -> unit
    val _dlocations : unit -> unit
    val _dsource : unit -> unit
    val _dparsetree : unit -> unit
    val _dtypedtree : unit -> unit
    val _dshape : unit -> unit
    val _drawlambda : unit -> unit
    val _dlambda : unit -> unit
    include Compiler_options
    val _a : unit -> unit
    val _annot : unit -> unit
    val _binannot : unit -> unit
    val _binannot_occurrences : unit -> unit
    val _c : unit -> unit
    val _cc : string -> unit
    val _cclib : string -> unit
    val _ccopt : string -> unit
    val _cmi_file : string -> unit
    val _config : unit -> unit
    val _config_var : string -> unit
    val _for_pack : string -> unit
    val _g : unit -> unit
    val _no_g : unit -> unit
    val _stop_after : string -> unit
    val _i : unit -> unit
    val _impl : string -> unit
    val _intf : string -> unit
    val _intf_suffix : string -> unit
    val _keep_docs : unit -> unit
    val _no_keep_docs : unit -> unit
    val _keep_locs : unit -> unit
    val _no_keep_locs : unit -> unit
    val _linkall : unit -> unit
    val _noautolink : unit -> unit
    val _o : string -> unit
    val _opaque : unit -> unit
    val _output_obj : unit -> unit
    val _output_complete_obj : unit -> unit
    val _pack : unit -> unit
    val _plugin : string -> unit
    val _principal : unit -> unit
    val _no_principal : unit -> unit
    val _rectypes : unit -> unit
    val _runtime_variant : string -> unit
    val _with_runtime : unit -> unit
    val _without_runtime : unit -> unit
    val _short_paths : unit -> unit
    val _thread : unit -> unit
    val _v : unit -> unit
    val _verbose : unit -> unit
    val _where : unit -> unit
    val _color : string -> unit
    val _error_style : string -> unit
    val _match_context_rows : int -> unit
    val _dtimings : unit -> unit
    val _dprofile : unit -> unit
    val _dump_into_file : unit -> unit
    val _dump_dir : string -> unit
    val _args : string -> string array
    val _args0 : string -> string array
    include Optcommon_options
    val _compact : unit -> unit
    val _inline : string -> unit
    val _inline_toplevel : string -> unit
    val _inlining_report : unit -> unit
    val _dump_pass : string -> unit
    val _inline_max_depth : string -> unit
    val _rounds : int -> unit
    val _inline_max_unroll : string -> unit
    val _classic_inlining : unit -> unit
    val _inline_call_cost : string -> unit
    val _inline_alloc_cost : string -> unit
    val _inline_prim_cost : string -> unit
    val _inline_branch_cost : string -> unit
    val _inline_indirect_cost : string -> unit
    val _inline_lifting_benefit : string -> unit
    val _unbox_closures : unit -> unit
    val _unbox_closures_factor : int -> unit
    val _inline_branch_factor : string -> unit
    val _remove_unused_arguments : unit -> unit
    val _no_unbox_free_vars_of_closures : unit -> unit
    val _no_unbox_specialised_args : unit -> unit
    val _o2 : unit -> unit
    val _o3 : unit -> unit
    val _insn_sched : unit -> unit
    val _no_insn_sched : unit -> unit
    val _linscan : unit -> unit
    val _no_float_const_prop : unit -> unit
    val _clambda_checks : unit -> unit
    val _dflambda : unit -> unit
    val _drawflambda : unit -> unit
    val _dflambda_invariants : unit -> unit
    val _dflambda_no_invariants : unit -> unit
    val _dflambda_let : int -> unit
    val _dflambda_verbose : unit -> unit
    val _drawclambda : unit -> unit
    val _dclambda : unit -> unit
    val _dcmm_invariants : unit -> unit
    val _dcmm : unit -> unit
    val _dsel : unit -> unit
    val _dcombine : unit -> unit
    val _dcse : unit -> unit
    val _dlive : unit -> unit
    val _dspill : unit -> unit
    val _dsplit : unit -> unit
    val _dinterf : unit -> unit
    val _dprefer : unit -> unit
    val _dalloc : unit -> unit
    val _dreload : unit -> unit
    val _dscheduling : unit -> unit
    val _dlinear : unit -> unit
    val _dinterval : unit -> unit
    val _dstartup : unit -> unit
    val _nodynlink : unit -> unit
    val _p : unit -> unit
    val _pp : string -> unit
    val _S : unit -> unit
    val _shared : unit -> unit
    val _afl_instrument : unit -> unit
    val _afl_inst_ratio : int -> unit
    val _function_sections : unit -> unit
    val _save_ir_after : string -> unit
    diff --git a/ocaml/Main_args/Default/Opttopmain/index.html b/ocaml/Main_args/Default/Opttopmain/index.html new file mode 100644 index 0000000..bd91136 --- /dev/null +++ b/ocaml/Main_args/Default/Opttopmain/index.html @@ -0,0 +1,2 @@ + +Opttopmain (ocaml.Main_args.Default.Opttopmain)

    Module Default.Opttopmain

    include Toplevel_options
    include Core_options
    include Common_options
    val _absname : unit -> unit
    val _no_absname : unit -> unit
    val _alert : string -> unit
    val _I : string -> unit
    val _H : string -> unit
    val _labels : unit -> unit
    val _alias_deps : unit -> unit
    val _no_alias_deps : unit -> unit
    val _app_funct : unit -> unit
    val _no_app_funct : unit -> unit
    val _noassert : unit -> unit
    val _nolabels : unit -> unit
    val _nostdlib : unit -> unit
    val _nocwd : unit -> unit
    val _open : string -> unit
    val _ppx : string -> unit
    val _principal : unit -> unit
    val _no_principal : unit -> unit
    val _rectypes : unit -> unit
    val _no_rectypes : unit -> unit
    val _safer_matching : unit -> unit
    val _short_paths : unit -> unit
    val _strict_sequence : unit -> unit
    val _no_strict_sequence : unit -> unit
    val _strict_formats : unit -> unit
    val _no_strict_formats : unit -> unit
    val _unboxed_types : unit -> unit
    val _no_unboxed_types : unit -> unit
    val _version : unit -> unit
    val _vnum : unit -> unit
    val _w : string -> unit
    val anonymous : string -> unit
    val _nopervasives : unit -> unit
    val _unsafe : unit -> unit
    val _warn_error : string -> unit
    val _warn_help : unit -> unit
    val _dno_unique_ids : unit -> unit
    val _dunique_ids : unit -> unit
    val _dno_locations : unit -> unit
    val _dlocations : unit -> unit
    val _dsource : unit -> unit
    val _dparsetree : unit -> unit
    val _dtypedtree : unit -> unit
    val _dshape : unit -> unit
    val _drawlambda : unit -> unit
    val _dlambda : unit -> unit
    val _init : string -> unit
    val _noinit : unit -> unit
    val _no_version : unit -> unit
    val _prompt : unit -> unit
    val _noprompt : unit -> unit
    val _nopromptcont : unit -> unit
    val _stdin : unit -> unit
    val _args : string -> string array
    val _args0 : string -> string array
    val _color : string -> unit
    val _error_style : string -> unit
    val _eval : string -> unit
    include Optcommon_options
    val _compact : unit -> unit
    val _inline : string -> unit
    val _inline_toplevel : string -> unit
    val _inlining_report : unit -> unit
    val _dump_pass : string -> unit
    val _inline_max_depth : string -> unit
    val _rounds : int -> unit
    val _inline_max_unroll : string -> unit
    val _classic_inlining : unit -> unit
    val _inline_call_cost : string -> unit
    val _inline_alloc_cost : string -> unit
    val _inline_prim_cost : string -> unit
    val _inline_branch_cost : string -> unit
    val _inline_indirect_cost : string -> unit
    val _inline_lifting_benefit : string -> unit
    val _unbox_closures : unit -> unit
    val _unbox_closures_factor : int -> unit
    val _inline_branch_factor : string -> unit
    val _remove_unused_arguments : unit -> unit
    val _no_unbox_free_vars_of_closures : unit -> unit
    val _no_unbox_specialised_args : unit -> unit
    val _o2 : unit -> unit
    val _o3 : unit -> unit
    val _insn_sched : unit -> unit
    val _no_insn_sched : unit -> unit
    val _linscan : unit -> unit
    val _no_float_const_prop : unit -> unit
    val _clambda_checks : unit -> unit
    val _dflambda : unit -> unit
    val _drawflambda : unit -> unit
    val _dflambda_invariants : unit -> unit
    val _dflambda_no_invariants : unit -> unit
    val _dflambda_let : int -> unit
    val _dflambda_verbose : unit -> unit
    val _drawclambda : unit -> unit
    val _dclambda : unit -> unit
    val _dcmm_invariants : unit -> unit
    val _dcmm : unit -> unit
    val _dsel : unit -> unit
    val _dcombine : unit -> unit
    val _dcse : unit -> unit
    val _dlive : unit -> unit
    val _dspill : unit -> unit
    val _dsplit : unit -> unit
    val _dinterf : unit -> unit
    val _dprefer : unit -> unit
    val _dalloc : unit -> unit
    val _dreload : unit -> unit
    val _dscheduling : unit -> unit
    val _dlinear : unit -> unit
    val _dinterval : unit -> unit
    val _dstartup : unit -> unit
    val _verbose : unit -> unit
    val _S : unit -> unit
    diff --git a/ocaml/Main_args/Default/Topmain/index.html b/ocaml/Main_args/Default/Topmain/index.html new file mode 100644 index 0000000..10237fa --- /dev/null +++ b/ocaml/Main_args/Default/Topmain/index.html @@ -0,0 +1,2 @@ + +Topmain (ocaml.Main_args.Default.Topmain)

    Module Default.Topmain

    include Toplevel_options
    include Core_options
    include Common_options
    val _absname : unit -> unit
    val _no_absname : unit -> unit
    val _alert : string -> unit
    val _I : string -> unit
    val _H : string -> unit
    val _labels : unit -> unit
    val _alias_deps : unit -> unit
    val _no_alias_deps : unit -> unit
    val _app_funct : unit -> unit
    val _no_app_funct : unit -> unit
    val _noassert : unit -> unit
    val _nolabels : unit -> unit
    val _nostdlib : unit -> unit
    val _nocwd : unit -> unit
    val _open : string -> unit
    val _ppx : string -> unit
    val _principal : unit -> unit
    val _no_principal : unit -> unit
    val _rectypes : unit -> unit
    val _no_rectypes : unit -> unit
    val _safer_matching : unit -> unit
    val _short_paths : unit -> unit
    val _strict_sequence : unit -> unit
    val _no_strict_sequence : unit -> unit
    val _strict_formats : unit -> unit
    val _no_strict_formats : unit -> unit
    val _unboxed_types : unit -> unit
    val _no_unboxed_types : unit -> unit
    val _version : unit -> unit
    val _vnum : unit -> unit
    val _w : string -> unit
    val anonymous : string -> unit
    val _nopervasives : unit -> unit
    val _unsafe : unit -> unit
    val _warn_error : string -> unit
    val _warn_help : unit -> unit
    val _dno_unique_ids : unit -> unit
    val _dunique_ids : unit -> unit
    val _dno_locations : unit -> unit
    val _dlocations : unit -> unit
    val _dsource : unit -> unit
    val _dparsetree : unit -> unit
    val _dtypedtree : unit -> unit
    val _dshape : unit -> unit
    val _drawlambda : unit -> unit
    val _dlambda : unit -> unit
    val _init : string -> unit
    val _noinit : unit -> unit
    val _no_version : unit -> unit
    val _prompt : unit -> unit
    val _noprompt : unit -> unit
    val _nopromptcont : unit -> unit
    val _stdin : unit -> unit
    val _args : string -> string array
    val _args0 : string -> string array
    val _color : string -> unit
    val _error_style : string -> unit
    val _eval : string -> unit
    val _dinstr : unit -> unit
    diff --git a/ocaml/Main_args/Default/index.html b/ocaml/Main_args/Default/index.html new file mode 100644 index 0000000..3a6f59f --- /dev/null +++ b/ocaml/Main_args/Default/index.html @@ -0,0 +1,2 @@ + +Default (ocaml.Main_args.Default)

    Module Main_args.Default

    diff --git a/ocaml/Main_args/Make_bytecomp_options/argument-1-_/index.html b/ocaml/Main_args/Make_bytecomp_options/argument-1-_/index.html new file mode 100644 index 0000000..d6b29cf --- /dev/null +++ b/ocaml/Main_args/Make_bytecomp_options/argument-1-_/index.html @@ -0,0 +1,2 @@ + +_ (ocaml.Main_args.Make_bytecomp_options._)

    Parameter Make_bytecomp_options._

    include Core_options
    include Common_options
    val _absname : unit -> unit
    val _no_absname : unit -> unit
    val _alert : string -> unit
    val _I : string -> unit
    val _H : string -> unit
    val _labels : unit -> unit
    val _alias_deps : unit -> unit
    val _no_alias_deps : unit -> unit
    val _app_funct : unit -> unit
    val _no_app_funct : unit -> unit
    val _noassert : unit -> unit
    val _nolabels : unit -> unit
    val _nostdlib : unit -> unit
    val _nocwd : unit -> unit
    val _open : string -> unit
    val _ppx : string -> unit
    val _no_rectypes : unit -> unit
    val _safer_matching : unit -> unit
    val _strict_sequence : unit -> unit
    val _no_strict_sequence : unit -> unit
    val _strict_formats : unit -> unit
    val _no_strict_formats : unit -> unit
    val _unboxed_types : unit -> unit
    val _no_unboxed_types : unit -> unit
    val _version : unit -> unit
    val _vnum : unit -> unit
    val _w : string -> unit
    val anonymous : string -> unit
    val _nopervasives : unit -> unit
    val _unsafe : unit -> unit
    val _warn_error : string -> unit
    val _warn_help : unit -> unit
    val _dno_unique_ids : unit -> unit
    val _dunique_ids : unit -> unit
    val _dno_locations : unit -> unit
    val _dlocations : unit -> unit
    val _dsource : unit -> unit
    val _dparsetree : unit -> unit
    val _dtypedtree : unit -> unit
    val _dshape : unit -> unit
    val _drawlambda : unit -> unit
    val _dlambda : unit -> unit
    include Compiler_options
    val _a : unit -> unit
    val _annot : unit -> unit
    val _binannot : unit -> unit
    val _binannot_occurrences : unit -> unit
    val _c : unit -> unit
    val _cc : string -> unit
    val _cclib : string -> unit
    val _ccopt : string -> unit
    val _cmi_file : string -> unit
    val _config : unit -> unit
    val _config_var : string -> unit
    val _for_pack : string -> unit
    val _g : unit -> unit
    val _no_g : unit -> unit
    val _stop_after : string -> unit
    val _i : unit -> unit
    val _impl : string -> unit
    val _intf : string -> unit
    val _intf_suffix : string -> unit
    val _keep_docs : unit -> unit
    val _no_keep_docs : unit -> unit
    val _keep_locs : unit -> unit
    val _no_keep_locs : unit -> unit
    val _linkall : unit -> unit
    val _noautolink : unit -> unit
    val _o : string -> unit
    val _opaque : unit -> unit
    val _output_obj : unit -> unit
    val _output_complete_obj : unit -> unit
    val _pack : unit -> unit
    val _plugin : string -> unit
    val _pp : string -> unit
    val _principal : unit -> unit
    val _no_principal : unit -> unit
    val _rectypes : unit -> unit
    val _runtime_variant : string -> unit
    val _with_runtime : unit -> unit
    val _without_runtime : unit -> unit
    val _short_paths : unit -> unit
    val _thread : unit -> unit
    val _v : unit -> unit
    val _verbose : unit -> unit
    val _where : unit -> unit
    val _color : string -> unit
    val _error_style : string -> unit
    val _match_context_rows : int -> unit
    val _dtimings : unit -> unit
    val _dprofile : unit -> unit
    val _dump_into_file : unit -> unit
    val _dump_dir : string -> unit
    val _args : string -> string array
    val _args0 : string -> string array
    val _compat_32 : unit -> unit
    val _custom : unit -> unit
    val _no_check_prims : unit -> unit
    val _dllib : string -> unit
    val _dllpath : string -> unit
    val _make_runtime : unit -> unit
    val _vmthread : unit -> unit
    val _use_runtime : string -> unit
    val _output_complete_exe : unit -> unit
    val _dinstr : unit -> unit
    val _dcamlprimc : unit -> unit
    val _use_prims : string -> unit
    diff --git a/ocaml/Main_args/Make_bytecomp_options/index.html b/ocaml/Main_args/Make_bytecomp_options/index.html new file mode 100644 index 0000000..c5ec074 --- /dev/null +++ b/ocaml/Main_args/Make_bytecomp_options/index.html @@ -0,0 +1,2 @@ + +Make_bytecomp_options (ocaml.Main_args.Make_bytecomp_options)

    Module Main_args.Make_bytecomp_options

    Parameters

    module _ : Bytecomp_options

    Signature

    val list : (string * Stdlib.Arg.spec * string) list
    diff --git a/ocaml/Main_args/Make_bytetop_options/argument-1-_/index.html b/ocaml/Main_args/Make_bytetop_options/argument-1-_/index.html new file mode 100644 index 0000000..817d995 --- /dev/null +++ b/ocaml/Main_args/Make_bytetop_options/argument-1-_/index.html @@ -0,0 +1,2 @@ + +_ (ocaml.Main_args.Make_bytetop_options._)

    Parameter Make_bytetop_options._

    include Toplevel_options
    include Core_options
    include Common_options
    val _absname : unit -> unit
    val _no_absname : unit -> unit
    val _alert : string -> unit
    val _I : string -> unit
    val _H : string -> unit
    val _labels : unit -> unit
    val _alias_deps : unit -> unit
    val _no_alias_deps : unit -> unit
    val _app_funct : unit -> unit
    val _no_app_funct : unit -> unit
    val _noassert : unit -> unit
    val _nolabels : unit -> unit
    val _nostdlib : unit -> unit
    val _nocwd : unit -> unit
    val _open : string -> unit
    val _ppx : string -> unit
    val _principal : unit -> unit
    val _no_principal : unit -> unit
    val _rectypes : unit -> unit
    val _no_rectypes : unit -> unit
    val _safer_matching : unit -> unit
    val _short_paths : unit -> unit
    val _strict_sequence : unit -> unit
    val _no_strict_sequence : unit -> unit
    val _strict_formats : unit -> unit
    val _no_strict_formats : unit -> unit
    val _unboxed_types : unit -> unit
    val _no_unboxed_types : unit -> unit
    val _version : unit -> unit
    val _vnum : unit -> unit
    val _w : string -> unit
    val anonymous : string -> unit
    val _nopervasives : unit -> unit
    val _unsafe : unit -> unit
    val _warn_error : string -> unit
    val _warn_help : unit -> unit
    val _dno_unique_ids : unit -> unit
    val _dunique_ids : unit -> unit
    val _dno_locations : unit -> unit
    val _dlocations : unit -> unit
    val _dsource : unit -> unit
    val _dparsetree : unit -> unit
    val _dtypedtree : unit -> unit
    val _dshape : unit -> unit
    val _drawlambda : unit -> unit
    val _dlambda : unit -> unit
    val _init : string -> unit
    val _noinit : unit -> unit
    val _no_version : unit -> unit
    val _prompt : unit -> unit
    val _noprompt : unit -> unit
    val _nopromptcont : unit -> unit
    val _stdin : unit -> unit
    val _args : string -> string array
    val _args0 : string -> string array
    val _color : string -> unit
    val _error_style : string -> unit
    val _eval : string -> unit
    val _dinstr : unit -> unit
    diff --git a/ocaml/Main_args/Make_bytetop_options/index.html b/ocaml/Main_args/Make_bytetop_options/index.html new file mode 100644 index 0000000..6e707c0 --- /dev/null +++ b/ocaml/Main_args/Make_bytetop_options/index.html @@ -0,0 +1,2 @@ + +Make_bytetop_options (ocaml.Main_args.Make_bytetop_options)

    Module Main_args.Make_bytetop_options

    Parameters

    module _ : Bytetop_options

    Signature

    val list : (string * Stdlib.Arg.spec * string) list
    diff --git a/ocaml/Main_args/Make_ocamldoc_options/argument-1-_/index.html b/ocaml/Main_args/Make_ocamldoc_options/argument-1-_/index.html new file mode 100644 index 0000000..5c23ee9 --- /dev/null +++ b/ocaml/Main_args/Make_ocamldoc_options/argument-1-_/index.html @@ -0,0 +1,2 @@ + +_ (ocaml.Main_args.Make_ocamldoc_options._)

    Parameter Make_ocamldoc_options._

    include Common_options
    val _absname : unit -> unit
    val _no_absname : unit -> unit
    val _alert : string -> unit
    val _I : string -> unit
    val _H : string -> unit
    val _labels : unit -> unit
    val _alias_deps : unit -> unit
    val _no_alias_deps : unit -> unit
    val _app_funct : unit -> unit
    val _no_app_funct : unit -> unit
    val _noassert : unit -> unit
    val _nolabels : unit -> unit
    val _nostdlib : unit -> unit
    val _nocwd : unit -> unit
    val _open : string -> unit
    val _ppx : string -> unit
    val _principal : unit -> unit
    val _no_principal : unit -> unit
    val _rectypes : unit -> unit
    val _no_rectypes : unit -> unit
    val _safer_matching : unit -> unit
    val _short_paths : unit -> unit
    val _strict_sequence : unit -> unit
    val _no_strict_sequence : unit -> unit
    val _strict_formats : unit -> unit
    val _no_strict_formats : unit -> unit
    val _unboxed_types : unit -> unit
    val _no_unboxed_types : unit -> unit
    val _version : unit -> unit
    val _vnum : unit -> unit
    val _w : string -> unit
    val anonymous : string -> unit
    val _impl : string -> unit
    val _intf : string -> unit
    val _intf_suffix : string -> unit
    val _pp : string -> unit
    val _thread : unit -> unit
    val _v : unit -> unit
    val _verbose : unit -> unit
    val _vmthread : unit -> unit
    diff --git a/ocaml/Main_args/Make_ocamldoc_options/index.html b/ocaml/Main_args/Make_ocamldoc_options/index.html new file mode 100644 index 0000000..c309a05 --- /dev/null +++ b/ocaml/Main_args/Make_ocamldoc_options/index.html @@ -0,0 +1,2 @@ + +Make_ocamldoc_options (ocaml.Main_args.Make_ocamldoc_options)

    Module Main_args.Make_ocamldoc_options

    Parameters

    module _ : Ocamldoc_options

    Signature

    val list : (string * Stdlib.Arg.spec * string) list
    diff --git a/ocaml/Main_args/Make_optcomp_options/argument-1-_/index.html b/ocaml/Main_args/Make_optcomp_options/argument-1-_/index.html new file mode 100644 index 0000000..46b07f4 --- /dev/null +++ b/ocaml/Main_args/Make_optcomp_options/argument-1-_/index.html @@ -0,0 +1,2 @@ + +_ (ocaml.Main_args.Make_optcomp_options._)

    Parameter Make_optcomp_options._

    include Core_options
    include Common_options
    val _absname : unit -> unit
    val _no_absname : unit -> unit
    val _alert : string -> unit
    val _I : string -> unit
    val _H : string -> unit
    val _labels : unit -> unit
    val _alias_deps : unit -> unit
    val _no_alias_deps : unit -> unit
    val _app_funct : unit -> unit
    val _no_app_funct : unit -> unit
    val _noassert : unit -> unit
    val _nolabels : unit -> unit
    val _nostdlib : unit -> unit
    val _nocwd : unit -> unit
    val _open : string -> unit
    val _ppx : string -> unit
    val _no_rectypes : unit -> unit
    val _safer_matching : unit -> unit
    val _strict_sequence : unit -> unit
    val _no_strict_sequence : unit -> unit
    val _strict_formats : unit -> unit
    val _no_strict_formats : unit -> unit
    val _unboxed_types : unit -> unit
    val _no_unboxed_types : unit -> unit
    val _version : unit -> unit
    val _vnum : unit -> unit
    val _w : string -> unit
    val anonymous : string -> unit
    val _nopervasives : unit -> unit
    val _unsafe : unit -> unit
    val _warn_error : string -> unit
    val _warn_help : unit -> unit
    val _dno_unique_ids : unit -> unit
    val _dunique_ids : unit -> unit
    val _dno_locations : unit -> unit
    val _dlocations : unit -> unit
    val _dsource : unit -> unit
    val _dparsetree : unit -> unit
    val _dtypedtree : unit -> unit
    val _dshape : unit -> unit
    val _drawlambda : unit -> unit
    val _dlambda : unit -> unit
    include Compiler_options
    val _a : unit -> unit
    val _annot : unit -> unit
    val _binannot : unit -> unit
    val _binannot_occurrences : unit -> unit
    val _c : unit -> unit
    val _cc : string -> unit
    val _cclib : string -> unit
    val _ccopt : string -> unit
    val _cmi_file : string -> unit
    val _config : unit -> unit
    val _config_var : string -> unit
    val _for_pack : string -> unit
    val _g : unit -> unit
    val _no_g : unit -> unit
    val _stop_after : string -> unit
    val _i : unit -> unit
    val _impl : string -> unit
    val _intf : string -> unit
    val _intf_suffix : string -> unit
    val _keep_docs : unit -> unit
    val _no_keep_docs : unit -> unit
    val _keep_locs : unit -> unit
    val _no_keep_locs : unit -> unit
    val _linkall : unit -> unit
    val _noautolink : unit -> unit
    val _o : string -> unit
    val _opaque : unit -> unit
    val _output_obj : unit -> unit
    val _output_complete_obj : unit -> unit
    val _pack : unit -> unit
    val _plugin : string -> unit
    val _principal : unit -> unit
    val _no_principal : unit -> unit
    val _rectypes : unit -> unit
    val _runtime_variant : string -> unit
    val _with_runtime : unit -> unit
    val _without_runtime : unit -> unit
    val _short_paths : unit -> unit
    val _thread : unit -> unit
    val _v : unit -> unit
    val _verbose : unit -> unit
    val _where : unit -> unit
    val _color : string -> unit
    val _error_style : string -> unit
    val _match_context_rows : int -> unit
    val _dtimings : unit -> unit
    val _dprofile : unit -> unit
    val _dump_into_file : unit -> unit
    val _dump_dir : string -> unit
    val _args : string -> string array
    val _args0 : string -> string array
    include Optcommon_options
    val _compact : unit -> unit
    val _inline : string -> unit
    val _inline_toplevel : string -> unit
    val _inlining_report : unit -> unit
    val _dump_pass : string -> unit
    val _inline_max_depth : string -> unit
    val _rounds : int -> unit
    val _inline_max_unroll : string -> unit
    val _classic_inlining : unit -> unit
    val _inline_call_cost : string -> unit
    val _inline_alloc_cost : string -> unit
    val _inline_prim_cost : string -> unit
    val _inline_branch_cost : string -> unit
    val _inline_indirect_cost : string -> unit
    val _inline_lifting_benefit : string -> unit
    val _unbox_closures : unit -> unit
    val _unbox_closures_factor : int -> unit
    val _inline_branch_factor : string -> unit
    val _remove_unused_arguments : unit -> unit
    val _no_unbox_free_vars_of_closures : unit -> unit
    val _no_unbox_specialised_args : unit -> unit
    val _o2 : unit -> unit
    val _o3 : unit -> unit
    val _insn_sched : unit -> unit
    val _no_insn_sched : unit -> unit
    val _linscan : unit -> unit
    val _no_float_const_prop : unit -> unit
    val _clambda_checks : unit -> unit
    val _dflambda : unit -> unit
    val _drawflambda : unit -> unit
    val _dflambda_invariants : unit -> unit
    val _dflambda_no_invariants : unit -> unit
    val _dflambda_let : int -> unit
    val _dflambda_verbose : unit -> unit
    val _drawclambda : unit -> unit
    val _dclambda : unit -> unit
    val _dcmm_invariants : unit -> unit
    val _dcmm : unit -> unit
    val _dsel : unit -> unit
    val _dcombine : unit -> unit
    val _dcse : unit -> unit
    val _dlive : unit -> unit
    val _dspill : unit -> unit
    val _dsplit : unit -> unit
    val _dinterf : unit -> unit
    val _dprefer : unit -> unit
    val _dalloc : unit -> unit
    val _dreload : unit -> unit
    val _dscheduling : unit -> unit
    val _dlinear : unit -> unit
    val _dinterval : unit -> unit
    val _dstartup : unit -> unit
    val _nodynlink : unit -> unit
    val _p : unit -> unit
    val _pp : string -> unit
    val _S : unit -> unit
    val _shared : unit -> unit
    val _afl_instrument : unit -> unit
    val _afl_inst_ratio : int -> unit
    val _function_sections : unit -> unit
    val _save_ir_after : string -> unit
    diff --git a/ocaml/Main_args/Make_optcomp_options/index.html b/ocaml/Main_args/Make_optcomp_options/index.html new file mode 100644 index 0000000..6014c41 --- /dev/null +++ b/ocaml/Main_args/Make_optcomp_options/index.html @@ -0,0 +1,2 @@ + +Make_optcomp_options (ocaml.Main_args.Make_optcomp_options)

    Module Main_args.Make_optcomp_options

    Parameters

    module _ : Optcomp_options

    Signature

    val list : (string * Stdlib.Arg.spec * string) list
    diff --git a/ocaml/Main_args/Make_opttop_options/argument-1-_/index.html b/ocaml/Main_args/Make_opttop_options/argument-1-_/index.html new file mode 100644 index 0000000..e497f4c --- /dev/null +++ b/ocaml/Main_args/Make_opttop_options/argument-1-_/index.html @@ -0,0 +1,2 @@ + +_ (ocaml.Main_args.Make_opttop_options._)

    Parameter Make_opttop_options._

    include Toplevel_options
    include Core_options
    include Common_options
    val _absname : unit -> unit
    val _no_absname : unit -> unit
    val _alert : string -> unit
    val _I : string -> unit
    val _H : string -> unit
    val _labels : unit -> unit
    val _alias_deps : unit -> unit
    val _no_alias_deps : unit -> unit
    val _app_funct : unit -> unit
    val _no_app_funct : unit -> unit
    val _noassert : unit -> unit
    val _nolabels : unit -> unit
    val _nostdlib : unit -> unit
    val _nocwd : unit -> unit
    val _open : string -> unit
    val _ppx : string -> unit
    val _principal : unit -> unit
    val _no_principal : unit -> unit
    val _rectypes : unit -> unit
    val _no_rectypes : unit -> unit
    val _safer_matching : unit -> unit
    val _short_paths : unit -> unit
    val _strict_sequence : unit -> unit
    val _no_strict_sequence : unit -> unit
    val _strict_formats : unit -> unit
    val _no_strict_formats : unit -> unit
    val _unboxed_types : unit -> unit
    val _no_unboxed_types : unit -> unit
    val _version : unit -> unit
    val _vnum : unit -> unit
    val _w : string -> unit
    val anonymous : string -> unit
    val _nopervasives : unit -> unit
    val _unsafe : unit -> unit
    val _warn_error : string -> unit
    val _warn_help : unit -> unit
    val _dno_unique_ids : unit -> unit
    val _dunique_ids : unit -> unit
    val _dno_locations : unit -> unit
    val _dlocations : unit -> unit
    val _dsource : unit -> unit
    val _dparsetree : unit -> unit
    val _dtypedtree : unit -> unit
    val _dshape : unit -> unit
    val _drawlambda : unit -> unit
    val _dlambda : unit -> unit
    val _init : string -> unit
    val _noinit : unit -> unit
    val _no_version : unit -> unit
    val _prompt : unit -> unit
    val _noprompt : unit -> unit
    val _nopromptcont : unit -> unit
    val _stdin : unit -> unit
    val _args : string -> string array
    val _args0 : string -> string array
    val _color : string -> unit
    val _error_style : string -> unit
    val _eval : string -> unit
    include Optcommon_options
    val _compact : unit -> unit
    val _inline : string -> unit
    val _inline_toplevel : string -> unit
    val _inlining_report : unit -> unit
    val _dump_pass : string -> unit
    val _inline_max_depth : string -> unit
    val _rounds : int -> unit
    val _inline_max_unroll : string -> unit
    val _classic_inlining : unit -> unit
    val _inline_call_cost : string -> unit
    val _inline_alloc_cost : string -> unit
    val _inline_prim_cost : string -> unit
    val _inline_branch_cost : string -> unit
    val _inline_indirect_cost : string -> unit
    val _inline_lifting_benefit : string -> unit
    val _unbox_closures : unit -> unit
    val _unbox_closures_factor : int -> unit
    val _inline_branch_factor : string -> unit
    val _remove_unused_arguments : unit -> unit
    val _no_unbox_free_vars_of_closures : unit -> unit
    val _no_unbox_specialised_args : unit -> unit
    val _o2 : unit -> unit
    val _o3 : unit -> unit
    val _insn_sched : unit -> unit
    val _no_insn_sched : unit -> unit
    val _linscan : unit -> unit
    val _no_float_const_prop : unit -> unit
    val _clambda_checks : unit -> unit
    val _dflambda : unit -> unit
    val _drawflambda : unit -> unit
    val _dflambda_invariants : unit -> unit
    val _dflambda_no_invariants : unit -> unit
    val _dflambda_let : int -> unit
    val _dflambda_verbose : unit -> unit
    val _drawclambda : unit -> unit
    val _dclambda : unit -> unit
    val _dcmm_invariants : unit -> unit
    val _dcmm : unit -> unit
    val _dsel : unit -> unit
    val _dcombine : unit -> unit
    val _dcse : unit -> unit
    val _dlive : unit -> unit
    val _dspill : unit -> unit
    val _dsplit : unit -> unit
    val _dinterf : unit -> unit
    val _dprefer : unit -> unit
    val _dalloc : unit -> unit
    val _dreload : unit -> unit
    val _dscheduling : unit -> unit
    val _dlinear : unit -> unit
    val _dinterval : unit -> unit
    val _dstartup : unit -> unit
    val _verbose : unit -> unit
    val _S : unit -> unit
    diff --git a/ocaml/Main_args/Make_opttop_options/index.html b/ocaml/Main_args/Make_opttop_options/index.html new file mode 100644 index 0000000..af20304 --- /dev/null +++ b/ocaml/Main_args/Make_opttop_options/index.html @@ -0,0 +1,2 @@ + +Make_opttop_options (ocaml.Main_args.Make_opttop_options)

    Module Main_args.Make_opttop_options

    Parameters

    module _ : Opttop_options

    Signature

    val list : (string * Stdlib.Arg.spec * string) list
    diff --git a/ocaml/Main_args/index.html b/ocaml/Main_args/index.html new file mode 100644 index 0000000..063b4a0 --- /dev/null +++ b/ocaml/Main_args/index.html @@ -0,0 +1,5 @@ + +Main_args (ocaml.Main_args)

    Module Main_args

    module type Common_options = sig ... end
    module type Core_options = sig ... end
    module type Compiler_options = sig ... end
    module type Toplevel_options = sig ... end
    module type Bytecomp_options = sig ... end
    module type Bytetop_options = sig ... end
    module type Optcommon_options = sig ... end
    module type Optcomp_options = sig ... end
    module type Opttop_options = sig ... end
    module type Ocamldoc_options = sig ... end
    module type Arg_list = sig ... end
    val options_with_command_line_syntax : + (string * Stdlib.Arg.spec * string) list -> + string list ref -> + (string * Stdlib.Arg.spec * string) list

    options_with_command_line_syntax options r returns options2 that behaves like options, but additionally pushes command line argument on r (quoted by Filename.quote when necessary). This is meant for ocamlc,optp, which use this to forward most of their arguments to ocamlc,opt.

    module Default : sig ... end
    diff --git a/ocaml/Main_args/module-type-Arg_list/index.html b/ocaml/Main_args/module-type-Arg_list/index.html new file mode 100644 index 0000000..2d2c28c --- /dev/null +++ b/ocaml/Main_args/module-type-Arg_list/index.html @@ -0,0 +1,2 @@ + +Arg_list (ocaml.Main_args.Arg_list)

    Module type Main_args.Arg_list

    val list : (string * Stdlib.Arg.spec * string) list
    diff --git a/ocaml/Main_args/module-type-Bytecomp_options/index.html b/ocaml/Main_args/module-type-Bytecomp_options/index.html new file mode 100644 index 0000000..5e10d52 --- /dev/null +++ b/ocaml/Main_args/module-type-Bytecomp_options/index.html @@ -0,0 +1,2 @@ + +Bytecomp_options (ocaml.Main_args.Bytecomp_options)

    Module type Main_args.Bytecomp_options

    include Core_options
    include Common_options
    val _absname : unit -> unit
    val _no_absname : unit -> unit
    val _alert : string -> unit
    val _I : string -> unit
    val _H : string -> unit
    val _labels : unit -> unit
    val _alias_deps : unit -> unit
    val _no_alias_deps : unit -> unit
    val _app_funct : unit -> unit
    val _no_app_funct : unit -> unit
    val _noassert : unit -> unit
    val _nolabels : unit -> unit
    val _nostdlib : unit -> unit
    val _nocwd : unit -> unit
    val _open : string -> unit
    val _ppx : string -> unit
    val _no_rectypes : unit -> unit
    val _safer_matching : unit -> unit
    val _strict_sequence : unit -> unit
    val _no_strict_sequence : unit -> unit
    val _strict_formats : unit -> unit
    val _no_strict_formats : unit -> unit
    val _unboxed_types : unit -> unit
    val _no_unboxed_types : unit -> unit
    val _version : unit -> unit
    val _vnum : unit -> unit
    val _w : string -> unit
    val anonymous : string -> unit
    val _nopervasives : unit -> unit
    val _unsafe : unit -> unit
    val _warn_error : string -> unit
    val _warn_help : unit -> unit
    val _dno_unique_ids : unit -> unit
    val _dunique_ids : unit -> unit
    val _dno_locations : unit -> unit
    val _dlocations : unit -> unit
    val _dsource : unit -> unit
    val _dparsetree : unit -> unit
    val _dtypedtree : unit -> unit
    val _dshape : unit -> unit
    val _drawlambda : unit -> unit
    val _dlambda : unit -> unit
    include Compiler_options
    val _a : unit -> unit
    val _annot : unit -> unit
    val _binannot : unit -> unit
    val _binannot_occurrences : unit -> unit
    val _c : unit -> unit
    val _cc : string -> unit
    val _cclib : string -> unit
    val _ccopt : string -> unit
    val _cmi_file : string -> unit
    val _config : unit -> unit
    val _config_var : string -> unit
    val _for_pack : string -> unit
    val _g : unit -> unit
    val _no_g : unit -> unit
    val _stop_after : string -> unit
    val _i : unit -> unit
    val _impl : string -> unit
    val _intf : string -> unit
    val _intf_suffix : string -> unit
    val _keep_docs : unit -> unit
    val _no_keep_docs : unit -> unit
    val _keep_locs : unit -> unit
    val _no_keep_locs : unit -> unit
    val _linkall : unit -> unit
    val _noautolink : unit -> unit
    val _o : string -> unit
    val _opaque : unit -> unit
    val _output_obj : unit -> unit
    val _output_complete_obj : unit -> unit
    val _pack : unit -> unit
    val _plugin : string -> unit
    val _pp : string -> unit
    val _principal : unit -> unit
    val _no_principal : unit -> unit
    val _rectypes : unit -> unit
    val _runtime_variant : string -> unit
    val _with_runtime : unit -> unit
    val _without_runtime : unit -> unit
    val _short_paths : unit -> unit
    val _thread : unit -> unit
    val _v : unit -> unit
    val _verbose : unit -> unit
    val _where : unit -> unit
    val _color : string -> unit
    val _error_style : string -> unit
    val _match_context_rows : int -> unit
    val _dtimings : unit -> unit
    val _dprofile : unit -> unit
    val _dump_into_file : unit -> unit
    val _dump_dir : string -> unit
    val _args : string -> string array
    val _args0 : string -> string array
    val _compat_32 : unit -> unit
    val _custom : unit -> unit
    val _no_check_prims : unit -> unit
    val _dllib : string -> unit
    val _dllpath : string -> unit
    val _make_runtime : unit -> unit
    val _vmthread : unit -> unit
    val _use_runtime : string -> unit
    val _output_complete_exe : unit -> unit
    val _dinstr : unit -> unit
    val _dcamlprimc : unit -> unit
    val _use_prims : string -> unit
    diff --git a/ocaml/Main_args/module-type-Bytetop_options/index.html b/ocaml/Main_args/module-type-Bytetop_options/index.html new file mode 100644 index 0000000..597c0d2 --- /dev/null +++ b/ocaml/Main_args/module-type-Bytetop_options/index.html @@ -0,0 +1,2 @@ + +Bytetop_options (ocaml.Main_args.Bytetop_options)

    Module type Main_args.Bytetop_options

    include Toplevel_options
    include Core_options
    include Common_options
    val _absname : unit -> unit
    val _no_absname : unit -> unit
    val _alert : string -> unit
    val _I : string -> unit
    val _H : string -> unit
    val _labels : unit -> unit
    val _alias_deps : unit -> unit
    val _no_alias_deps : unit -> unit
    val _app_funct : unit -> unit
    val _no_app_funct : unit -> unit
    val _noassert : unit -> unit
    val _nolabels : unit -> unit
    val _nostdlib : unit -> unit
    val _nocwd : unit -> unit
    val _open : string -> unit
    val _ppx : string -> unit
    val _principal : unit -> unit
    val _no_principal : unit -> unit
    val _rectypes : unit -> unit
    val _no_rectypes : unit -> unit
    val _safer_matching : unit -> unit
    val _short_paths : unit -> unit
    val _strict_sequence : unit -> unit
    val _no_strict_sequence : unit -> unit
    val _strict_formats : unit -> unit
    val _no_strict_formats : unit -> unit
    val _unboxed_types : unit -> unit
    val _no_unboxed_types : unit -> unit
    val _version : unit -> unit
    val _vnum : unit -> unit
    val _w : string -> unit
    val anonymous : string -> unit
    val _nopervasives : unit -> unit
    val _unsafe : unit -> unit
    val _warn_error : string -> unit
    val _warn_help : unit -> unit
    val _dno_unique_ids : unit -> unit
    val _dunique_ids : unit -> unit
    val _dno_locations : unit -> unit
    val _dlocations : unit -> unit
    val _dsource : unit -> unit
    val _dparsetree : unit -> unit
    val _dtypedtree : unit -> unit
    val _dshape : unit -> unit
    val _drawlambda : unit -> unit
    val _dlambda : unit -> unit
    val _init : string -> unit
    val _noinit : unit -> unit
    val _no_version : unit -> unit
    val _prompt : unit -> unit
    val _noprompt : unit -> unit
    val _nopromptcont : unit -> unit
    val _stdin : unit -> unit
    val _args : string -> string array
    val _args0 : string -> string array
    val _color : string -> unit
    val _error_style : string -> unit
    val _eval : string -> unit
    val _dinstr : unit -> unit
    diff --git a/ocaml/Main_args/module-type-Common_options/index.html b/ocaml/Main_args/module-type-Common_options/index.html new file mode 100644 index 0000000..6d535a9 --- /dev/null +++ b/ocaml/Main_args/module-type-Common_options/index.html @@ -0,0 +1,2 @@ + +Common_options (ocaml.Main_args.Common_options)

    Module type Main_args.Common_options

    val _absname : unit -> unit
    val _no_absname : unit -> unit
    val _alert : string -> unit
    val _I : string -> unit
    val _H : string -> unit
    val _labels : unit -> unit
    val _alias_deps : unit -> unit
    val _no_alias_deps : unit -> unit
    val _app_funct : unit -> unit
    val _no_app_funct : unit -> unit
    val _noassert : unit -> unit
    val _nolabels : unit -> unit
    val _nostdlib : unit -> unit
    val _nocwd : unit -> unit
    val _open : string -> unit
    val _ppx : string -> unit
    val _principal : unit -> unit
    val _no_principal : unit -> unit
    val _rectypes : unit -> unit
    val _no_rectypes : unit -> unit
    val _safer_matching : unit -> unit
    val _short_paths : unit -> unit
    val _strict_sequence : unit -> unit
    val _no_strict_sequence : unit -> unit
    val _strict_formats : unit -> unit
    val _no_strict_formats : unit -> unit
    val _unboxed_types : unit -> unit
    val _no_unboxed_types : unit -> unit
    val _version : unit -> unit
    val _vnum : unit -> unit
    val _w : string -> unit
    val anonymous : string -> unit
    diff --git a/ocaml/Main_args/module-type-Compiler_options/index.html b/ocaml/Main_args/module-type-Compiler_options/index.html new file mode 100644 index 0000000..919812b --- /dev/null +++ b/ocaml/Main_args/module-type-Compiler_options/index.html @@ -0,0 +1,2 @@ + +Compiler_options (ocaml.Main_args.Compiler_options)

    Module type Main_args.Compiler_options

    val _a : unit -> unit
    val _annot : unit -> unit
    val _binannot : unit -> unit
    val _binannot_occurrences : unit -> unit
    val _c : unit -> unit
    val _cc : string -> unit
    val _cclib : string -> unit
    val _ccopt : string -> unit
    val _cmi_file : string -> unit
    val _config : unit -> unit
    val _config_var : string -> unit
    val _for_pack : string -> unit
    val _g : unit -> unit
    val _no_g : unit -> unit
    val _stop_after : string -> unit
    val _i : unit -> unit
    val _impl : string -> unit
    val _intf : string -> unit
    val _intf_suffix : string -> unit
    val _keep_docs : unit -> unit
    val _no_keep_docs : unit -> unit
    val _keep_locs : unit -> unit
    val _no_keep_locs : unit -> unit
    val _linkall : unit -> unit
    val _noautolink : unit -> unit
    val _o : string -> unit
    val _opaque : unit -> unit
    val _output_obj : unit -> unit
    val _output_complete_obj : unit -> unit
    val _pack : unit -> unit
    val _plugin : string -> unit
    val _pp : string -> unit
    val _principal : unit -> unit
    val _no_principal : unit -> unit
    val _rectypes : unit -> unit
    val _runtime_variant : string -> unit
    val _with_runtime : unit -> unit
    val _without_runtime : unit -> unit
    val _short_paths : unit -> unit
    val _thread : unit -> unit
    val _v : unit -> unit
    val _verbose : unit -> unit
    val _where : unit -> unit
    val _color : string -> unit
    val _error_style : string -> unit
    val _match_context_rows : int -> unit
    val _dtimings : unit -> unit
    val _dprofile : unit -> unit
    val _dump_into_file : unit -> unit
    val _dump_dir : string -> unit
    val _args : string -> string array
    val _args0 : string -> string array
    diff --git a/ocaml/Main_args/module-type-Core_options/index.html b/ocaml/Main_args/module-type-Core_options/index.html new file mode 100644 index 0000000..b093896 --- /dev/null +++ b/ocaml/Main_args/module-type-Core_options/index.html @@ -0,0 +1,2 @@ + +Core_options (ocaml.Main_args.Core_options)

    Module type Main_args.Core_options

    include Common_options
    val _absname : unit -> unit
    val _no_absname : unit -> unit
    val _alert : string -> unit
    val _I : string -> unit
    val _H : string -> unit
    val _labels : unit -> unit
    val _alias_deps : unit -> unit
    val _no_alias_deps : unit -> unit
    val _app_funct : unit -> unit
    val _no_app_funct : unit -> unit
    val _noassert : unit -> unit
    val _nolabels : unit -> unit
    val _nostdlib : unit -> unit
    val _nocwd : unit -> unit
    val _open : string -> unit
    val _ppx : string -> unit
    val _principal : unit -> unit
    val _no_principal : unit -> unit
    val _rectypes : unit -> unit
    val _no_rectypes : unit -> unit
    val _safer_matching : unit -> unit
    val _short_paths : unit -> unit
    val _strict_sequence : unit -> unit
    val _no_strict_sequence : unit -> unit
    val _strict_formats : unit -> unit
    val _no_strict_formats : unit -> unit
    val _unboxed_types : unit -> unit
    val _no_unboxed_types : unit -> unit
    val _version : unit -> unit
    val _vnum : unit -> unit
    val _w : string -> unit
    val anonymous : string -> unit
    val _nopervasives : unit -> unit
    val _unsafe : unit -> unit
    val _warn_error : string -> unit
    val _warn_help : unit -> unit
    val _dno_unique_ids : unit -> unit
    val _dunique_ids : unit -> unit
    val _dno_locations : unit -> unit
    val _dlocations : unit -> unit
    val _dsource : unit -> unit
    val _dparsetree : unit -> unit
    val _dtypedtree : unit -> unit
    val _dshape : unit -> unit
    val _drawlambda : unit -> unit
    val _dlambda : unit -> unit
    diff --git a/ocaml/Main_args/module-type-Ocamldoc_options/index.html b/ocaml/Main_args/module-type-Ocamldoc_options/index.html new file mode 100644 index 0000000..c977114 --- /dev/null +++ b/ocaml/Main_args/module-type-Ocamldoc_options/index.html @@ -0,0 +1,2 @@ + +Ocamldoc_options (ocaml.Main_args.Ocamldoc_options)

    Module type Main_args.Ocamldoc_options

    include Common_options
    val _absname : unit -> unit
    val _no_absname : unit -> unit
    val _alert : string -> unit
    val _I : string -> unit
    val _H : string -> unit
    val _labels : unit -> unit
    val _alias_deps : unit -> unit
    val _no_alias_deps : unit -> unit
    val _app_funct : unit -> unit
    val _no_app_funct : unit -> unit
    val _noassert : unit -> unit
    val _nolabels : unit -> unit
    val _nostdlib : unit -> unit
    val _nocwd : unit -> unit
    val _open : string -> unit
    val _ppx : string -> unit
    val _principal : unit -> unit
    val _no_principal : unit -> unit
    val _rectypes : unit -> unit
    val _no_rectypes : unit -> unit
    val _safer_matching : unit -> unit
    val _short_paths : unit -> unit
    val _strict_sequence : unit -> unit
    val _no_strict_sequence : unit -> unit
    val _strict_formats : unit -> unit
    val _no_strict_formats : unit -> unit
    val _unboxed_types : unit -> unit
    val _no_unboxed_types : unit -> unit
    val _version : unit -> unit
    val _vnum : unit -> unit
    val _w : string -> unit
    val anonymous : string -> unit
    val _impl : string -> unit
    val _intf : string -> unit
    val _intf_suffix : string -> unit
    val _pp : string -> unit
    val _thread : unit -> unit
    val _v : unit -> unit
    val _verbose : unit -> unit
    val _vmthread : unit -> unit
    diff --git a/ocaml/Main_args/module-type-Optcommon_options/index.html b/ocaml/Main_args/module-type-Optcommon_options/index.html new file mode 100644 index 0000000..7b838a0 --- /dev/null +++ b/ocaml/Main_args/module-type-Optcommon_options/index.html @@ -0,0 +1,2 @@ + +Optcommon_options (ocaml.Main_args.Optcommon_options)

    Module type Main_args.Optcommon_options

    val _compact : unit -> unit
    val _inline : string -> unit
    val _inline_toplevel : string -> unit
    val _inlining_report : unit -> unit
    val _dump_pass : string -> unit
    val _inline_max_depth : string -> unit
    val _rounds : int -> unit
    val _inline_max_unroll : string -> unit
    val _classic_inlining : unit -> unit
    val _inline_call_cost : string -> unit
    val _inline_alloc_cost : string -> unit
    val _inline_prim_cost : string -> unit
    val _inline_branch_cost : string -> unit
    val _inline_indirect_cost : string -> unit
    val _inline_lifting_benefit : string -> unit
    val _unbox_closures : unit -> unit
    val _unbox_closures_factor : int -> unit
    val _inline_branch_factor : string -> unit
    val _remove_unused_arguments : unit -> unit
    val _no_unbox_free_vars_of_closures : unit -> unit
    val _no_unbox_specialised_args : unit -> unit
    val _o2 : unit -> unit
    val _o3 : unit -> unit
    val _insn_sched : unit -> unit
    val _no_insn_sched : unit -> unit
    val _linscan : unit -> unit
    val _no_float_const_prop : unit -> unit
    val _clambda_checks : unit -> unit
    val _dflambda : unit -> unit
    val _drawflambda : unit -> unit
    val _dflambda_invariants : unit -> unit
    val _dflambda_no_invariants : unit -> unit
    val _dflambda_let : int -> unit
    val _dflambda_verbose : unit -> unit
    val _drawclambda : unit -> unit
    val _dclambda : unit -> unit
    val _dcmm_invariants : unit -> unit
    val _dcmm : unit -> unit
    val _dsel : unit -> unit
    val _dcombine : unit -> unit
    val _dcse : unit -> unit
    val _dlive : unit -> unit
    val _dspill : unit -> unit
    val _dsplit : unit -> unit
    val _dinterf : unit -> unit
    val _dprefer : unit -> unit
    val _dalloc : unit -> unit
    val _dreload : unit -> unit
    val _dscheduling : unit -> unit
    val _dlinear : unit -> unit
    val _dinterval : unit -> unit
    val _dstartup : unit -> unit
    diff --git a/ocaml/Main_args/module-type-Optcomp_options/index.html b/ocaml/Main_args/module-type-Optcomp_options/index.html new file mode 100644 index 0000000..f78c5a7 --- /dev/null +++ b/ocaml/Main_args/module-type-Optcomp_options/index.html @@ -0,0 +1,2 @@ + +Optcomp_options (ocaml.Main_args.Optcomp_options)

    Module type Main_args.Optcomp_options

    include Core_options
    include Common_options
    val _absname : unit -> unit
    val _no_absname : unit -> unit
    val _alert : string -> unit
    val _I : string -> unit
    val _H : string -> unit
    val _labels : unit -> unit
    val _alias_deps : unit -> unit
    val _no_alias_deps : unit -> unit
    val _app_funct : unit -> unit
    val _no_app_funct : unit -> unit
    val _noassert : unit -> unit
    val _nolabels : unit -> unit
    val _nostdlib : unit -> unit
    val _nocwd : unit -> unit
    val _open : string -> unit
    val _ppx : string -> unit
    val _no_rectypes : unit -> unit
    val _safer_matching : unit -> unit
    val _strict_sequence : unit -> unit
    val _no_strict_sequence : unit -> unit
    val _strict_formats : unit -> unit
    val _no_strict_formats : unit -> unit
    val _unboxed_types : unit -> unit
    val _no_unboxed_types : unit -> unit
    val _version : unit -> unit
    val _vnum : unit -> unit
    val _w : string -> unit
    val anonymous : string -> unit
    val _nopervasives : unit -> unit
    val _unsafe : unit -> unit
    val _warn_error : string -> unit
    val _warn_help : unit -> unit
    val _dno_unique_ids : unit -> unit
    val _dunique_ids : unit -> unit
    val _dno_locations : unit -> unit
    val _dlocations : unit -> unit
    val _dsource : unit -> unit
    val _dparsetree : unit -> unit
    val _dtypedtree : unit -> unit
    val _dshape : unit -> unit
    val _drawlambda : unit -> unit
    val _dlambda : unit -> unit
    include Compiler_options
    val _a : unit -> unit
    val _annot : unit -> unit
    val _binannot : unit -> unit
    val _binannot_occurrences : unit -> unit
    val _c : unit -> unit
    val _cc : string -> unit
    val _cclib : string -> unit
    val _ccopt : string -> unit
    val _cmi_file : string -> unit
    val _config : unit -> unit
    val _config_var : string -> unit
    val _for_pack : string -> unit
    val _g : unit -> unit
    val _no_g : unit -> unit
    val _stop_after : string -> unit
    val _i : unit -> unit
    val _impl : string -> unit
    val _intf : string -> unit
    val _intf_suffix : string -> unit
    val _keep_docs : unit -> unit
    val _no_keep_docs : unit -> unit
    val _keep_locs : unit -> unit
    val _no_keep_locs : unit -> unit
    val _linkall : unit -> unit
    val _noautolink : unit -> unit
    val _o : string -> unit
    val _opaque : unit -> unit
    val _output_obj : unit -> unit
    val _output_complete_obj : unit -> unit
    val _pack : unit -> unit
    val _plugin : string -> unit
    val _principal : unit -> unit
    val _no_principal : unit -> unit
    val _rectypes : unit -> unit
    val _runtime_variant : string -> unit
    val _with_runtime : unit -> unit
    val _without_runtime : unit -> unit
    val _short_paths : unit -> unit
    val _thread : unit -> unit
    val _v : unit -> unit
    val _verbose : unit -> unit
    val _where : unit -> unit
    val _color : string -> unit
    val _error_style : string -> unit
    val _match_context_rows : int -> unit
    val _dtimings : unit -> unit
    val _dprofile : unit -> unit
    val _dump_into_file : unit -> unit
    val _dump_dir : string -> unit
    val _args : string -> string array
    val _args0 : string -> string array
    include Optcommon_options
    val _compact : unit -> unit
    val _inline : string -> unit
    val _inline_toplevel : string -> unit
    val _inlining_report : unit -> unit
    val _dump_pass : string -> unit
    val _inline_max_depth : string -> unit
    val _rounds : int -> unit
    val _inline_max_unroll : string -> unit
    val _classic_inlining : unit -> unit
    val _inline_call_cost : string -> unit
    val _inline_alloc_cost : string -> unit
    val _inline_prim_cost : string -> unit
    val _inline_branch_cost : string -> unit
    val _inline_indirect_cost : string -> unit
    val _inline_lifting_benefit : string -> unit
    val _unbox_closures : unit -> unit
    val _unbox_closures_factor : int -> unit
    val _inline_branch_factor : string -> unit
    val _remove_unused_arguments : unit -> unit
    val _no_unbox_free_vars_of_closures : unit -> unit
    val _no_unbox_specialised_args : unit -> unit
    val _o2 : unit -> unit
    val _o3 : unit -> unit
    val _insn_sched : unit -> unit
    val _no_insn_sched : unit -> unit
    val _linscan : unit -> unit
    val _no_float_const_prop : unit -> unit
    val _clambda_checks : unit -> unit
    val _dflambda : unit -> unit
    val _drawflambda : unit -> unit
    val _dflambda_invariants : unit -> unit
    val _dflambda_no_invariants : unit -> unit
    val _dflambda_let : int -> unit
    val _dflambda_verbose : unit -> unit
    val _drawclambda : unit -> unit
    val _dclambda : unit -> unit
    val _dcmm_invariants : unit -> unit
    val _dcmm : unit -> unit
    val _dsel : unit -> unit
    val _dcombine : unit -> unit
    val _dcse : unit -> unit
    val _dlive : unit -> unit
    val _dspill : unit -> unit
    val _dsplit : unit -> unit
    val _dinterf : unit -> unit
    val _dprefer : unit -> unit
    val _dalloc : unit -> unit
    val _dreload : unit -> unit
    val _dscheduling : unit -> unit
    val _dlinear : unit -> unit
    val _dinterval : unit -> unit
    val _dstartup : unit -> unit
    val _nodynlink : unit -> unit
    val _p : unit -> unit
    val _pp : string -> unit
    val _S : unit -> unit
    val _shared : unit -> unit
    val _afl_instrument : unit -> unit
    val _afl_inst_ratio : int -> unit
    val _function_sections : unit -> unit
    val _save_ir_after : string -> unit
    diff --git a/ocaml/Main_args/module-type-Opttop_options/index.html b/ocaml/Main_args/module-type-Opttop_options/index.html new file mode 100644 index 0000000..63b948d --- /dev/null +++ b/ocaml/Main_args/module-type-Opttop_options/index.html @@ -0,0 +1,2 @@ + +Opttop_options (ocaml.Main_args.Opttop_options)

    Module type Main_args.Opttop_options

    include Toplevel_options
    include Core_options
    include Common_options
    val _absname : unit -> unit
    val _no_absname : unit -> unit
    val _alert : string -> unit
    val _I : string -> unit
    val _H : string -> unit
    val _labels : unit -> unit
    val _alias_deps : unit -> unit
    val _no_alias_deps : unit -> unit
    val _app_funct : unit -> unit
    val _no_app_funct : unit -> unit
    val _noassert : unit -> unit
    val _nolabels : unit -> unit
    val _nostdlib : unit -> unit
    val _nocwd : unit -> unit
    val _open : string -> unit
    val _ppx : string -> unit
    val _principal : unit -> unit
    val _no_principal : unit -> unit
    val _rectypes : unit -> unit
    val _no_rectypes : unit -> unit
    val _safer_matching : unit -> unit
    val _short_paths : unit -> unit
    val _strict_sequence : unit -> unit
    val _no_strict_sequence : unit -> unit
    val _strict_formats : unit -> unit
    val _no_strict_formats : unit -> unit
    val _unboxed_types : unit -> unit
    val _no_unboxed_types : unit -> unit
    val _version : unit -> unit
    val _vnum : unit -> unit
    val _w : string -> unit
    val anonymous : string -> unit
    val _nopervasives : unit -> unit
    val _unsafe : unit -> unit
    val _warn_error : string -> unit
    val _warn_help : unit -> unit
    val _dno_unique_ids : unit -> unit
    val _dunique_ids : unit -> unit
    val _dno_locations : unit -> unit
    val _dlocations : unit -> unit
    val _dsource : unit -> unit
    val _dparsetree : unit -> unit
    val _dtypedtree : unit -> unit
    val _dshape : unit -> unit
    val _drawlambda : unit -> unit
    val _dlambda : unit -> unit
    val _init : string -> unit
    val _noinit : unit -> unit
    val _no_version : unit -> unit
    val _prompt : unit -> unit
    val _noprompt : unit -> unit
    val _nopromptcont : unit -> unit
    val _stdin : unit -> unit
    val _args : string -> string array
    val _args0 : string -> string array
    val _color : string -> unit
    val _error_style : string -> unit
    val _eval : string -> unit
    include Optcommon_options
    val _compact : unit -> unit
    val _inline : string -> unit
    val _inline_toplevel : string -> unit
    val _inlining_report : unit -> unit
    val _dump_pass : string -> unit
    val _inline_max_depth : string -> unit
    val _rounds : int -> unit
    val _inline_max_unroll : string -> unit
    val _classic_inlining : unit -> unit
    val _inline_call_cost : string -> unit
    val _inline_alloc_cost : string -> unit
    val _inline_prim_cost : string -> unit
    val _inline_branch_cost : string -> unit
    val _inline_indirect_cost : string -> unit
    val _inline_lifting_benefit : string -> unit
    val _unbox_closures : unit -> unit
    val _unbox_closures_factor : int -> unit
    val _inline_branch_factor : string -> unit
    val _remove_unused_arguments : unit -> unit
    val _no_unbox_free_vars_of_closures : unit -> unit
    val _no_unbox_specialised_args : unit -> unit
    val _o2 : unit -> unit
    val _o3 : unit -> unit
    val _insn_sched : unit -> unit
    val _no_insn_sched : unit -> unit
    val _linscan : unit -> unit
    val _no_float_const_prop : unit -> unit
    val _clambda_checks : unit -> unit
    val _dflambda : unit -> unit
    val _drawflambda : unit -> unit
    val _dflambda_invariants : unit -> unit
    val _dflambda_no_invariants : unit -> unit
    val _dflambda_let : int -> unit
    val _dflambda_verbose : unit -> unit
    val _drawclambda : unit -> unit
    val _dclambda : unit -> unit
    val _dcmm_invariants : unit -> unit
    val _dcmm : unit -> unit
    val _dsel : unit -> unit
    val _dcombine : unit -> unit
    val _dcse : unit -> unit
    val _dlive : unit -> unit
    val _dspill : unit -> unit
    val _dsplit : unit -> unit
    val _dinterf : unit -> unit
    val _dprefer : unit -> unit
    val _dalloc : unit -> unit
    val _dreload : unit -> unit
    val _dscheduling : unit -> unit
    val _dlinear : unit -> unit
    val _dinterval : unit -> unit
    val _dstartup : unit -> unit
    val _verbose : unit -> unit
    val _S : unit -> unit
    diff --git a/ocaml/Main_args/module-type-Toplevel_options/index.html b/ocaml/Main_args/module-type-Toplevel_options/index.html new file mode 100644 index 0000000..55d0bce --- /dev/null +++ b/ocaml/Main_args/module-type-Toplevel_options/index.html @@ -0,0 +1,2 @@ + +Toplevel_options (ocaml.Main_args.Toplevel_options)

    Module type Main_args.Toplevel_options

    include Core_options
    include Common_options
    val _absname : unit -> unit
    val _no_absname : unit -> unit
    val _alert : string -> unit
    val _I : string -> unit
    val _H : string -> unit
    val _labels : unit -> unit
    val _alias_deps : unit -> unit
    val _no_alias_deps : unit -> unit
    val _app_funct : unit -> unit
    val _no_app_funct : unit -> unit
    val _noassert : unit -> unit
    val _nolabels : unit -> unit
    val _nostdlib : unit -> unit
    val _nocwd : unit -> unit
    val _open : string -> unit
    val _ppx : string -> unit
    val _principal : unit -> unit
    val _no_principal : unit -> unit
    val _rectypes : unit -> unit
    val _no_rectypes : unit -> unit
    val _safer_matching : unit -> unit
    val _short_paths : unit -> unit
    val _strict_sequence : unit -> unit
    val _no_strict_sequence : unit -> unit
    val _strict_formats : unit -> unit
    val _no_strict_formats : unit -> unit
    val _unboxed_types : unit -> unit
    val _no_unboxed_types : unit -> unit
    val _version : unit -> unit
    val _vnum : unit -> unit
    val _w : string -> unit
    val anonymous : string -> unit
    val _nopervasives : unit -> unit
    val _unsafe : unit -> unit
    val _warn_error : string -> unit
    val _warn_help : unit -> unit
    val _dno_unique_ids : unit -> unit
    val _dunique_ids : unit -> unit
    val _dno_locations : unit -> unit
    val _dlocations : unit -> unit
    val _dsource : unit -> unit
    val _dparsetree : unit -> unit
    val _dtypedtree : unit -> unit
    val _dshape : unit -> unit
    val _drawlambda : unit -> unit
    val _dlambda : unit -> unit
    val _init : string -> unit
    val _noinit : unit -> unit
    val _no_version : unit -> unit
    val _prompt : unit -> unit
    val _noprompt : unit -> unit
    val _nopromptcont : unit -> unit
    val _stdin : unit -> unit
    val _args : string -> string array
    val _args0 : string -> string array
    val _color : string -> unit
    val _error_style : string -> unit
    val _eval : string -> unit
    diff --git a/ocaml/Maindriver/index.html b/ocaml/Maindriver/index.html new file mode 100644 index 0000000..551a51a --- /dev/null +++ b/ocaml/Maindriver/index.html @@ -0,0 +1,2 @@ + +Maindriver (ocaml.Maindriver)

    Module Maindriver

    val main : string array -> Stdlib.Format.formatter -> int
    diff --git a/ocaml/Makedepend/index.html b/ocaml/Makedepend/index.html new file mode 100644 index 0000000..99a8115 --- /dev/null +++ b/ocaml/Makedepend/index.html @@ -0,0 +1,2 @@ + +Makedepend (ocaml.Makedepend)

    Module Makedepend

    val main : unit -> unit
    val main_from_option : unit -> unit
    diff --git a/ocaml/Matching/index.html b/ocaml/Matching/index.html new file mode 100644 index 0000000..353710a --- /dev/null +++ b/ocaml/Matching/index.html @@ -0,0 +1,52 @@ + +Matching (ocaml.Matching)

    Module Matching

    val for_function : + scopes:Debuginfo.Scoped_location.scopes -> + Location.t -> + int ref option -> + Lambda.lambda -> + (Typedtree.pattern * Lambda.lambda) list -> + Typedtree.partial -> + Lambda.lambda
    val for_multiple_match : + scopes:Debuginfo.Scoped_location.scopes -> + Location.t -> + Lambda.lambda list -> + (Typedtree.pattern * Lambda.lambda) list -> + Typedtree.partial -> + Lambda.lambda
    val for_tupled_function : + scopes:Debuginfo.Scoped_location.scopes -> + Location.t -> + Ident.t list -> + (Typedtree.pattern list * Lambda.lambda) list -> + Typedtree.partial -> + Lambda.lambda
    val for_optional_arg_default : + scopes:Debuginfo.Scoped_location.scopes -> + Location.t -> + Typedtree.pattern -> + default_arg:Lambda.lambda -> + param:Ident.t -> + Lambda.lambda -> + Lambda.lambda

    for_optional_arg_default pat body ~default_arg ~param is:

      let $pat =
+    match $param with
+    | Some x -> x
+    | None -> $default_arg
+  in
+  $body
    exception Cannot_flatten
    val flatten_pattern : int -> Typedtree.pattern -> Typedtree.pattern list
    val expand_stringswitch : + Lambda.scoped_location -> + Lambda.lambda -> + (string * Lambda.lambda) list -> + Lambda.lambda option -> + Lambda.lambda
    val inline_lazy_force : + Lambda.lambda -> + Lambda.scoped_location -> + Lambda.lambda
    diff --git a/ocaml/Meta/index.html b/ocaml/Meta/index.html new file mode 100644 index 0000000..76296f7 --- /dev/null +++ b/ocaml/Meta/index.html @@ -0,0 +1,11 @@ + +Meta (ocaml.Meta)

    Module Meta

    val global_data : unit -> Stdlib.Obj.t array
    val realloc_global_data : int -> unit
    type closure = unit -> Stdlib.Obj.t
    type bytecode
    val reify_bytecode : + (char, Stdlib.Bigarray.int8_unsigned_elt, Stdlib.Bigarray.c_layout) + Stdlib.Bigarray.Array1.t -> + Instruct.debug_event list array -> + string option -> + bytecode * closure
    val release_bytecode : bytecode -> unit
    val invoke_traced_function : + Stdlib.Obj.raw_data -> + Stdlib.Obj.t -> + Stdlib.Obj.t -> + Stdlib.Obj.t
    diff --git a/ocaml/Misc/Color/index.html b/ocaml/Misc/Color/index.html new file mode 100644 index 0000000..6676cc0 --- /dev/null +++ b/ocaml/Misc/Color/index.html @@ -0,0 +1,2 @@ + +Color (ocaml.Misc.Color)

    Module Misc.Color

    Color support detection

    type setting =
    1. | Auto
    2. | Always
    3. | Never
    val default_setting : setting
    diff --git a/ocaml/Misc/Error_style/index.html b/ocaml/Misc/Error_style/index.html new file mode 100644 index 0000000..e6103c4 --- /dev/null +++ b/ocaml/Misc/Error_style/index.html @@ -0,0 +1,2 @@ + +Error_style (ocaml.Misc.Error_style)

    Module Misc.Error_style

    type setting =
    1. | Contextual
    2. | Short
    val default_setting : setting
    diff --git a/ocaml/Misc/Int_literal_converter/index.html b/ocaml/Misc/Int_literal_converter/index.html new file mode 100644 index 0000000..4e76091 --- /dev/null +++ b/ocaml/Misc/Int_literal_converter/index.html @@ -0,0 +1,2 @@ + +Int_literal_converter (ocaml.Misc.Int_literal_converter)

    Module Misc.Int_literal_converter

    val int : string -> int

    Convert a string to an integer. Unlike Stdlib.int_of_string, this function accepts the string representation of max_int + 1 and returns min_int in this case.

    val int32 : string -> int32

    Likewise, at type int32

    val int64 : string -> int64

    Likewise, at type int64

    val nativeint : string -> nativeint

    Likewise, at type nativeint

    diff --git a/ocaml/Misc/Magic_number/index.html b/ocaml/Misc/Magic_number/index.html new file mode 100644 index 0000000..9043dfb --- /dev/null +++ b/ocaml/Misc/Magic_number/index.html @@ -0,0 +1,17 @@ + +Magic_number (ocaml.Misc.Magic_number)

    Module Misc.Magic_number

    a typical magic number is "Caml1999I011"; it is formed of an alphanumeric prefix, here Caml1990I, followed by a version, here 011. The prefix identifies the kind of the versioned data: here the I indicates that it is the magic number for .cmi files.

    All magic numbers have the same byte length, magic_length, and this is important for users as it gives them the number of bytes to read to obtain the byte sequence that should be a magic number. Typical user code will look like:

      let ic = open_in_bin path in
+  let magic =
+    try really_input_string ic Magic_number.magic_length
+    with End_of_file -> ... in
+  match Magic_number.parse magic with
+  | Error parse_error -> ...
+  | Ok info -> ...

    A given compiler version expects one specific version for each kind of object file, and will fail if given an unsupported version. Because versions grow monotonically, you can compare the parsed version with the expected "current version" for a kind, to tell whether the wrong-magic object file comes from the past or from the future.

    An example of code block that expects the "currently supported version" of a given kind of magic numbers, here Cmxa, is as follows:

      let ic = open_in_bin path in
+  begin
+    try Magic_number.(expect_current Cmxa (get_info ic)) with
+    | Parse_error error -> ...
+    | Unexpected error -> ...
+  end;
+  ...

    Parse errors distinguish inputs that are Not_a_magic_number str, which are likely to come from the file being completely different, and Truncated str, raised by headers that are the (possibly empty) prefix of a valid magic number.

    Unexpected errors correspond to valid magic numbers that are not the one expected, either because it corresponds to a different kind, or to a newer or older version.

    The helper functions explain_parse_error and explain_unexpected_error will generate a textual explanation of each error, for use in error messages.

    • since 4.11
    type native_obj_config = {
    1. flambda : bool;
    }

    native object files have a format and magic number that depend on certain native-compiler configuration parameters. This configuration space is expressed by the native_obj_config type.

    val native_obj_config : native_obj_config

    the native object file configuration of the active/configured compiler.

    type version = int
    type kind =
    1. | Exec
    2. | Cmi
    3. | Cmo
    4. | Cma
    5. | Cmx of native_obj_config
    6. | Cmxa of native_obj_config
    7. | Cmxs
    8. | Cmt
    9. | Ast_impl
    10. | Ast_intf
    type info = {
    1. kind : kind;
    2. version : version;
      (*

      Note: some versions of the compiler use the same version suffix for all kinds, but others use different versions counters for different kinds. We may only assume that versions are growing monotonically (not necessarily always by one) between compiler versions.

      *)
    }
    type raw = string

    the type of raw magic numbers, such as "Caml1999A027" for the .cma files of OCaml 4.10

    Parsing magic numbers

    type parse_error =
    1. | Truncated of string
    2. | Not_a_magic_number of string
    val explain_parse_error : kind option -> parse_error -> string

    Produces an explanation for a parse error. If no kind is provided, we use an unspecific formulation suggesting that any compiler-produced object file would have been satisfying.

    val parse : raw -> (info, parse_error) result

    Parses a raw magic number

    val read_info : in_channel -> (info, parse_error) result

    Read a raw magic number from an input channel.

    If the data read str is not a valid magic number, it can be recovered from the Truncated str | Not_a_magic_number str payload of the Error parse_error case.

    If parsing succeeds with an Ok info result, we know that exactly magic_length bytes have been consumed from the input_channel.

    If you also wish to enforce that the magic number is at the current version, see read_current_info below.

    val magic_length : int

    all magic numbers take the same number of bytes

    Checking that magic numbers are current

    type 'a unexpected = {
    1. expected : 'a;
    2. actual : 'a;
    }
    type unexpected_error =
    1. | Kind of kind unexpected
    2. | Version of kind * version unexpected
    val check_current : kind -> info -> (unit, unexpected_error) result

    check_current kind info checks that the provided magic info is the current version of kind's magic header.

    val explain_unexpected_error : unexpected_error -> string

    Provides an explanation of the unexpected_error.

    type error =
    1. | Parse_error of parse_error
    2. | Unexpected_error of unexpected_error
    val read_current_info : + expected_kind:kind option -> + in_channel -> + (info, error) result

    Read a magic number as read_info, and check that it is the current version as its kind. If the expected_kind argument is None, any kind is accepted.

    Information on magic numbers

    val string_of_kind : kind -> string

    a user-printable string for a kind, eg. "exec" or "cmo", to use in error messages.

    val human_name_of_kind : kind -> string

    a user-meaningful name for a kind, eg. "executable file" or "bytecode object file", to use in error messages.

    val current_raw : kind -> raw

    the current magic number of each kind

    val current_version : kind -> version

    the current version of each kind

    Raw representations

    Mainly for internal usage and testing.

    type raw_kind = string

    the type of raw magic numbers kinds, such as "Caml1999A" for .cma files

    val parse_kind : raw_kind -> kind option

    parse a raw kind into a kind

    val raw_kind : kind -> raw_kind

    the current raw representation of a kind.

    In some cases the raw representation of a kind has changed over compiler versions, so other files of the same kind may have different raw kinds. Note that all currently known cases are parsed correctly by parse_kind.

    val raw : info -> raw

    A valid raw representation of the magic number.

    Due to past and future changes in the string representation of magic numbers, we cannot guarantee that the raw strings returned for past and future versions actually match the expectations of those compilers. The representation is accurate for current versions, and it is correctly parsed back into the desired version by the parsing functions above.

    val all_kinds : kind list
    diff --git a/ocaml/Misc/Stdlib/Array/index.html b/ocaml/Misc/Stdlib/Array/index.html new file mode 100644 index 0000000..7888574 --- /dev/null +++ b/ocaml/Misc/Stdlib/Array/index.html @@ -0,0 +1,2 @@ + +Array (ocaml.Misc.Stdlib.Array)

    Module Stdlib.Array

    Extensions to the Array module

    val exists2 : ('a -> 'b -> bool) -> 'a array -> 'b array -> bool

    Same as Array.exists2 from the standard library.

    val for_alli : (int -> 'a -> bool) -> 'a array -> bool

    Same as Array.for_all from the standard library, but the function is applied with the index of the element as first argument, and the element itself as second argument.

    val all_somes : 'a option array -> 'a array option
    diff --git a/ocaml/Misc/Stdlib/List/index.html b/ocaml/Misc/Stdlib/List/index.html new file mode 100644 index 0000000..f1942e7 --- /dev/null +++ b/ocaml/Misc/Stdlib/List/index.html @@ -0,0 +1,6 @@ + +List (ocaml.Misc.Stdlib.List)

    Module Stdlib.List

    Extensions to the List module

    type 'a t = 'a list
    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    The lexicographic order supported by the provided order. There is no constraint on the relative lengths of the lists.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    Returns true if and only if the given lists have the same length and content with respect to the given equality function.

    val some_if_all_elements_are_some : 'a option t -> 'a t option

    If all elements of the given list are Some _ then Some xs is returned with the xs being the contents of those Somes, with order preserved. Otherwise return None.

    val map2_prefix : ('a -> 'b -> 'c) -> 'a t -> 'b t -> 'c t * 'b t

    let r1, r2 = map2_prefix f l1 l2 If l1 is of length n and l2 = h2 @ t2 with h2 of length n, r1 is List.map2 f l1 h1 and r2 is t2.

    val iteri2 : (int -> 'a -> 'b -> unit) -> 'a list -> 'b list -> unit

    Same as List.iter2, but the function is applied to the index of the element as first argument (counting from 0)

    val split_at : int -> 'a t -> 'a t * 'a t

    split_at n l returns the pair before, after where before is the n first elements of l and after the remaining ones. If l has less than n elements, raises Invalid_argument.

    val chunks_of : int -> 'a t -> 'a t t

    chunks_of n t returns a list of nonempty lists whose concatenation is equal to the original list. Every list has n elements, except for possibly the last list, which may have fewer. chunks_of raises if n <= 0.

    val is_prefix : equal:('a -> 'a -> bool) -> 'a list -> of_:'a list -> bool

    Returns true if and only if the given list, with respect to the given equality function on list members, is a prefix of the list of_.

    type 'a longest_common_prefix_result = private {
    1. longest_common_prefix : 'a list;
    2. first_without_longest_common_prefix : 'a list;
    3. second_without_longest_common_prefix : 'a list;
    }
    val find_and_chop_longest_common_prefix : + equal:('a -> 'a -> bool) -> + first:'a list -> + second:'a list -> + 'a longest_common_prefix_result

    Returns the longest list that, with respect to the provided equality function, is a prefix of both of the given lists. The input lists, each with such longest common prefix removed, are also returned.

    diff --git a/ocaml/Misc/Stdlib/Option/index.html b/ocaml/Misc/Stdlib/Option/index.html new file mode 100644 index 0000000..ac6e767 --- /dev/null +++ b/ocaml/Misc/Stdlib/Option/index.html @@ -0,0 +1,6 @@ + +Option (ocaml.Misc.Stdlib.Option)

    Module Stdlib.Option

    Extensions to the Option module

    type 'a t = 'a option
    val print : + (Stdlib.Format.formatter -> 'a -> unit) -> + Stdlib.Format.formatter -> + 'a t -> + unit
    diff --git a/ocaml/Misc/Stdlib/String/Map/index.html b/ocaml/Misc/Stdlib/String/Map/index.html new file mode 100644 index 0000000..77df5fe --- /dev/null +++ b/ocaml/Misc/Stdlib/String/Map/index.html @@ -0,0 +1,8 @@ + +Map (ocaml.Misc.Stdlib.String.Map)

    Module String.Map

    Maps

    type key = string

    The type of the map keys.

    type !+'a t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key -> 'a -> 'a t -> 'a t

    add key data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key -> 'a -> 'a list t -> 'a list t

    add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

    update key f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : (key -> bool) -> 'a t -> key * 'a

    find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : (key -> bool) -> 'a t -> key * 'a

    find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : (key -> 'a -> unit) -> 'a t -> unit

    iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

    fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : (key -> 'a -> bool) -> 'a t -> 'a t

    filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : (key -> 'a -> bool) -> 'a t -> bool

    for_all f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : (key -> 'a -> bool) -> 'a t -> bool

    exists f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val of_list : (key * 'a) list -> 'a t

    of_list bs adds the bindings of bs to the empty map, in list order (if a key is bound twice in bs the last one takes over).

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    diff --git a/ocaml/Misc/Stdlib/String/Set/index.html b/ocaml/Misc/Stdlib/String/Set/index.html new file mode 100644 index 0000000..339b33b --- /dev/null +++ b/ocaml/Misc/Stdlib/String/Set/index.html @@ -0,0 +1,2 @@ + +Set (ocaml.Misc.Stdlib.String.Set)

    Module String.Set

    Sets

    type elt = string

    The type of the set elements.

    type t

    The type of sets.

    val empty : t

    The empty set.

    val add : elt -> t -> t

    add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val singleton : elt -> t

    singleton x returns the one-element set containing only x.

    val remove : elt -> t -> t

    remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val union : t -> t -> t

    Set union.

    val inter : t -> t -> t

    Set intersection.

    val disjoint : t -> t -> bool

    Test if two sets are disjoint.

    • since 4.08
    val diff : t -> t -> t

    Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

    val cardinal : t -> int

    Return the number of elements of a set.

    Elements

    val elements : t -> elt list

    Return the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Set.Make.

    val min_elt : t -> elt

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

    val min_elt_opt : t -> elt option

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

    • since 4.05
    val max_elt : t -> elt

    Same as min_elt, but returns the largest element of the given set.

    val max_elt_opt : t -> elt option

    Same as min_elt_opt, but returns the largest element of the given set.

    • since 4.05
    val choose : t -> elt

    Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    val choose_opt : t -> elt option

    Return one element of the given set, or None if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    • since 4.05

    Searching

    val find : elt -> t -> elt

    find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

    • since 4.01
    val find_opt : elt -> t -> elt option

    find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

    • since 4.05
    val find_first : (elt -> bool) -> t -> elt

    find_first f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

    For example, find_first (fun e -> Ord.compare e x >= 0) s will return the first element e of s where Ord.compare e x >= 0 (intuitively: e >= x), or raise Not_found if x is greater than any element of s.

    • since 4.05
    val find_first_opt : (elt -> bool) -> t -> elt option

    find_first_opt f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

    • since 4.05
    val find_last : (elt -> bool) -> t -> elt

    find_last f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

    • since 4.05
    val find_last_opt : (elt -> bool) -> t -> elt option

    find_last_opt f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

    • since 4.05

    Traversing

    val iter : (elt -> unit) -> t -> unit

    iter f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.

    val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc

    fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

    Transforming

    val map : (elt -> elt) -> t -> t

    map f s is the set whose elements are f a0,f a1... f aN, where a0,a1...aN are the elements of s.

    The elements are passed to f in increasing order with respect to the ordering over the type of the elements.

    If no element of s is changed by f, s is returned unchanged. (If each output of f is physically equal to its input, the returned set is physically equal to s.)

    • since 4.04
    val filter : (elt -> bool) -> t -> t

    filter f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val filter_map : (elt -> elt option) -> t -> t

    filter_map f s returns the set of all v such that f x = Some v for some element x of s.

    For example,

    filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) s

    is the set of halves of the even elements of s.

    If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned unchanged: the result of the function is then physically equal to s.

    • since 4.11
    val partition : (elt -> bool) -> t -> t * t

    partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

    val split : elt -> t -> t * bool * t

    split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.

    Predicates and comparisons

    val is_empty : t -> bool

    Test whether a set is empty or not.

    val mem : elt -> t -> bool

    mem x s tests whether x belongs to the set s.

    val equal : t -> t -> bool

    equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

    val compare : t -> t -> int

    Total ordering between sets. Can be used as the ordering function for doing sets of sets.

    val subset : t -> t -> bool

    subset s1 s2 tests whether the set s1 is a subset of the set s2.

    val for_all : (elt -> bool) -> t -> bool

    for_all f s checks if all elements of the set satisfy the predicate f.

    val exists : (elt -> bool) -> t -> bool

    exists f s checks if at least one element of the set satisfies the predicate f.

    Converting

    val to_list : t -> elt list

    to_list s is elements s.

    • since 5.1
    val of_list : elt list -> t

    of_list l creates a set from a list of elements. This is usually more efficient than folding add over the list, except perhaps for lists with many duplicated elements.

    • since 4.02
    val to_seq_from : elt -> t -> elt Seq.t

    to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

    • since 4.07
    val to_seq : t -> elt Seq.t

    Iterate on the whole set, in ascending order

    • since 4.07
    val to_rev_seq : t -> elt Seq.t

    Iterate on the whole set, in descending order

    • since 4.12
    val add_seq : elt Seq.t -> t -> t

    Add the given elements to the set, in order.

    • since 4.07
    val of_seq : elt Seq.t -> t

    Build a set from the given bindings

    • since 4.07
    diff --git a/ocaml/Misc/Stdlib/String/Tbl/index.html b/ocaml/Misc/Stdlib/String/Tbl/index.html new file mode 100644 index 0000000..3bc0378 --- /dev/null +++ b/ocaml/Misc/Stdlib/String/Tbl/index.html @@ -0,0 +1,2 @@ + +Tbl (ocaml.Misc.Stdlib.String.Tbl)

    Module String.Tbl

    type key = string
    type !'a t
    val create : int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    • since 4.00
    val copy : 'a t -> 'a t
    val add : 'a t -> key -> 'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    • since 4.05
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key -> 'a -> unit
    val mem : 'a t -> key -> bool
    val iter : (key -> 'a -> unit) -> 'a t -> unit
    val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
    • since 4.03
    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc
    val length : 'a t -> int
    val stats : 'a t -> Hashtbl.statistics
    • since 4.00
    val to_seq : 'a t -> (key * 'a) Seq.t
    • since 4.07
    val to_seq_keys : _ t -> key Seq.t
    • since 4.07
    val to_seq_values : 'a t -> 'a Seq.t
    • since 4.07
    val add_seq : 'a t -> (key * 'a) Seq.t -> unit
    • since 4.07
    val replace_seq : 'a t -> (key * 'a) Seq.t -> unit
    • since 4.07
    val of_seq : (key * 'a) Seq.t -> 'a t
    • since 4.07
    diff --git a/ocaml/Misc/Stdlib/String/index.html b/ocaml/Misc/Stdlib/String/index.html new file mode 100644 index 0000000..0072984 --- /dev/null +++ b/ocaml/Misc/Stdlib/String/index.html @@ -0,0 +1,2 @@ + +String (ocaml.Misc.Stdlib.String)

    Module Stdlib.String

    Extensions to the String module

    include module type of Stdlib.String

    Strings

    type t = string

    The type for strings.

    val make : int -> char -> string

    make n c is a string of length n with each index holding the character c.

    • raises Invalid_argument

      if n < 0 or n > Sys.max_string_length.

    val init : int -> (int -> char) -> string

    init n f is a string of length n with index i holding the character f i (called in increasing index order).

    • raises Invalid_argument

      if n < 0 or n > Sys.max_string_length.

    • since 4.02
    val empty : string

    The empty string.

    • since 4.13
    val length : string -> int

    length s is the length (number of bytes/characters) of s.

    val get : string -> int -> char

    get s i is the character at index i in s. This is the same as writing s.[i].

    • raises Invalid_argument

      if i not an index of s.

    val of_bytes : bytes -> string

    Return a new string that contains the same bytes as the given byte sequence.

    • since 4.13
    val to_bytes : string -> bytes

    Return a new byte sequence that contains the same bytes as the given string.

    • since 4.13
    val blit : string -> int -> bytes -> int -> int -> unit

    Same as Bytes.blit_string which should be preferred.

    Concatenating

    Note. The Stdlib.(^) binary operator concatenates two strings.

    val concat : string -> string list -> string

    concat sep ss concatenates the list of strings ss, inserting the separator string sep between each.

    • raises Invalid_argument

      if the result is longer than Sys.max_string_length bytes.

    val cat : string -> string -> string

    cat s1 s2 concatenates s1 and s2 (s1 ^ s2).

    • raises Invalid_argument

      if the result is longer than Sys.max_string_length bytes.

    • since 4.13

    Predicates and comparisons

    val equal : t -> t -> bool

    equal s0 s1 is true if and only if s0 and s1 are character-wise equal.

    • since 4.03 (4.05 in StringLabels)
    val compare : t -> t -> int

    compare s0 s1 sorts s0 and s1 in lexicographical order. compare behaves like Stdlib.compare on strings but may be more efficient.

    val starts_with : prefix:string -> string -> bool

    starts_with ~prefix s is true if and only if s starts with prefix.

    • since 4.13
    val ends_with : suffix:string -> string -> bool

    ends_with ~suffix s is true if and only if s ends with suffix.

    • since 4.13
    val contains_from : string -> int -> char -> bool

    contains_from s start c is true if and only if c appears in s after position start.

    • raises Invalid_argument

      if start is not a valid position in s.

    val rcontains_from : string -> int -> char -> bool

    rcontains_from s stop c is true if and only if c appears in s before position stop+1.

    • raises Invalid_argument

      if stop < 0 or stop+1 is not a valid position in s.

    val contains : string -> char -> bool

    contains s c is String.contains_from s 0 c.

    Extracting substrings

    val sub : string -> int -> int -> string

    sub s pos len is a string of length len, containing the substring of s that starts at position pos and has length len.

    • raises Invalid_argument

      if pos and len do not designate a valid substring of s.

    val split_on_char : char -> string -> string list

    split_on_char sep s is the list of all (possibly empty) substrings of s that are delimited by the character sep. If s is empty, the result is the singleton list [""].

    The function's result is specified by the following invariants:

    • The list is not empty.
    • Concatenating its elements using sep as a separator returns a string equal to the input (concat (make 1 sep) (split_on_char sep s) = s).
    • No string in the result contains the sep character.
    • since 4.04 (4.05 in StringLabels)

    Transforming

    val map : (char -> char) -> string -> string

    map f s is the string resulting from applying f to all the characters of s in increasing order.

    • since 4.00
    val mapi : (int -> char -> char) -> string -> string

    mapi f s is like map but the index of the character is also passed to f.

    • since 4.02
    val fold_left : ('acc -> char -> 'acc) -> 'acc -> string -> 'acc

    fold_left f x s computes f (... (f (f x s.[0]) s.[1]) ...) s.[n-1], where n is the length of the string s.

    • since 4.13
    val fold_right : (char -> 'acc -> 'acc) -> string -> 'acc -> 'acc

    fold_right f s x computes f s.[0] (f s.[1] ( ... (f s.[n-1] x) ...)), where n is the length of the string s.

    • since 4.13
    val exists : (char -> bool) -> string -> bool

    exists p s checks if at least one character of s satisfies the predicate p.

    • since 4.13
    val trim : string -> string

    trim s is s without leading and trailing whitespace. Whitespace characters are: ' ', '\x0C' (form feed), '\n', '\r', and '\t'.

    • since 4.00
    val escaped : string -> string

    escaped s is s with special characters represented by escape sequences, following the lexical conventions of OCaml.

    All characters outside the US-ASCII printable range [0x20;0x7E] are escaped, as well as backslash (0x2F) and double-quote (0x22).

    The function Scanf.unescaped is a left inverse of escaped, i.e. Scanf.unescaped (escaped s) = s for any string s (unless escaped s fails).

    • raises Invalid_argument

      if the result is longer than Sys.max_string_length bytes.

    val uppercase_ascii : string -> string

    uppercase_ascii s is s with all lowercase letters translated to uppercase, using the US-ASCII character set.

    • since 4.03 (4.05 in StringLabels)
    val lowercase_ascii : string -> string

    lowercase_ascii s is s with all uppercase letters translated to lowercase, using the US-ASCII character set.

    • since 4.03 (4.05 in StringLabels)
    val capitalize_ascii : string -> string

    capitalize_ascii s is s with the first character set to uppercase, using the US-ASCII character set.

    • since 4.03 (4.05 in StringLabels)
    val uncapitalize_ascii : string -> string

    uncapitalize_ascii s is s with the first character set to lowercase, using the US-ASCII character set.

    • since 4.03 (4.05 in StringLabels)

    Traversing

    val iter : (char -> unit) -> string -> unit

    iter f s applies function f in turn to all the characters of s. It is equivalent to f s.[0]; f s.[1]; ...; f s.[length s - 1]; ().

    val iteri : (int -> char -> unit) -> string -> unit

    iteri is like iter, but the function is also given the corresponding character index.

    • since 4.00

    Searching

    val index_from : string -> int -> char -> int

    index_from s i c is the index of the first occurrence of c in s after position i.

    • raises Not_found

      if c does not occur in s after position i.

    • raises Invalid_argument

      if i is not a valid position in s.

    val index_from_opt : string -> int -> char -> int option

    index_from_opt s i c is the index of the first occurrence of c in s after position i (if any).

    • raises Invalid_argument

      if i is not a valid position in s.

    • since 4.05
    val rindex_from : string -> int -> char -> int

    rindex_from s i c is the index of the last occurrence of c in s before position i+1.

    • raises Not_found

      if c does not occur in s before position i+1.

    • raises Invalid_argument

      if i+1 is not a valid position in s.

    val rindex_from_opt : string -> int -> char -> int option

    rindex_from_opt s i c is the index of the last occurrence of c in s before position i+1 (if any).

    • raises Invalid_argument

      if i+1 is not a valid position in s.

    • since 4.05
    val index : string -> char -> int

    index s c is String.index_from s 0 c.

    val index_opt : string -> char -> int option

    index_opt s c is String.index_from_opt s 0 c.

    • since 4.05
    val rindex : string -> char -> int

    rindex s c is String.rindex_from s (length s - 1) c.

    val rindex_opt : string -> char -> int option

    rindex_opt s c is String.rindex_from_opt s (length s - 1) c.

    • since 4.05

    Strings and Sequences

    val to_seq : t -> char Stdlib.Seq.t

    to_seq s is a sequence made of the string's characters in increasing order. In "unsafe-string" mode, modifications of the string during iteration will be reflected in the sequence.

    • since 4.07
    val to_seqi : t -> (int * char) Stdlib.Seq.t

    to_seqi s is like to_seq but also tuples the corresponding index.

    • since 4.07
    val of_seq : char Stdlib.Seq.t -> t

    of_seq s is a string made of the sequence's characters.

    • since 4.07

    UTF decoding and validations

    • since 4.14

    UTF-8

    val get_utf_8_uchar : t -> int -> Stdlib.Uchar.utf_decode

    get_utf_8_uchar b i decodes an UTF-8 character at index i in b.

    val is_valid_utf_8 : t -> bool

    is_valid_utf_8 b is true if and only if b contains valid UTF-8 data.

    UTF-16BE

    val get_utf_16be_uchar : t -> int -> Stdlib.Uchar.utf_decode

    get_utf_16be_uchar b i decodes an UTF-16BE character at index i in b.

    val is_valid_utf_16be : t -> bool

    is_valid_utf_16be b is true if and only if b contains valid UTF-16BE data.

    UTF-16LE

    val get_utf_16le_uchar : t -> int -> Stdlib.Uchar.utf_decode

    get_utf_16le_uchar b i decodes an UTF-16LE character at index i in b.

    val is_valid_utf_16le : t -> bool

    is_valid_utf_16le b is true if and only if b contains valid UTF-16LE data.

    Binary decoding of integers

    The functions in this section binary decode integers from strings.

    All following functions raise Invalid_argument if the characters needed at index i to decode the integer are not available.

    Little-endian (resp. big-endian) encoding means that least (resp. most) significant bytes are stored first. Big-endian is also known as network byte order. Native-endian encoding is either little-endian or big-endian depending on Sys.big_endian.

    32-bit and 64-bit integers are represented by the int32 and int64 types, which can be interpreted either as signed or unsigned numbers.

    8-bit and 16-bit integers are represented by the int type, which has more bits than the binary encoding. These extra bits are sign-extended (or zero-extended) for functions which decode 8-bit or 16-bit integers and represented them with int values.

    val get_uint8 : string -> int -> int

    get_uint8 b i is b's unsigned 8-bit integer starting at character index i.

    • since 4.13
    val get_int8 : string -> int -> int

    get_int8 b i is b's signed 8-bit integer starting at character index i.

    • since 4.13
    val get_uint16_ne : string -> int -> int

    get_uint16_ne b i is b's native-endian unsigned 16-bit integer starting at character index i.

    • since 4.13
    val get_uint16_be : string -> int -> int

    get_uint16_be b i is b's big-endian unsigned 16-bit integer starting at character index i.

    • since 4.13
    val get_uint16_le : string -> int -> int

    get_uint16_le b i is b's little-endian unsigned 16-bit integer starting at character index i.

    • since 4.13
    val get_int16_ne : string -> int -> int

    get_int16_ne b i is b's native-endian signed 16-bit integer starting at character index i.

    • since 4.13
    val get_int16_be : string -> int -> int

    get_int16_be b i is b's big-endian signed 16-bit integer starting at character index i.

    • since 4.13
    val get_int16_le : string -> int -> int

    get_int16_le b i is b's little-endian signed 16-bit integer starting at character index i.

    • since 4.13
    val get_int32_ne : string -> int -> int32

    get_int32_ne b i is b's native-endian 32-bit integer starting at character index i.

    • since 4.13
    val hash : t -> int

    An unseeded hash function for strings, with the same output value as Hashtbl.hash. This function allows this module to be passed as argument to the functor Hashtbl.Make.

    • since 5.0
    val seeded_hash : int -> t -> int

    A seeded hash function for strings, with the same output value as Hashtbl.seeded_hash. This function allows this module to be passed as argument to the functor Hashtbl.MakeSeeded.

    • since 5.0
    val get_int32_be : string -> int -> int32

    get_int32_be b i is b's big-endian 32-bit integer starting at character index i.

    • since 4.13
    val get_int32_le : string -> int -> int32

    get_int32_le b i is b's little-endian 32-bit integer starting at character index i.

    • since 4.13
    val get_int64_ne : string -> int -> int64

    get_int64_ne b i is b's native-endian 64-bit integer starting at character index i.

    • since 4.13
    val get_int64_be : string -> int -> int64

    get_int64_be b i is b's big-endian 64-bit integer starting at character index i.

    • since 4.13
    val get_int64_le : string -> int -> int64

    get_int64_le b i is b's little-endian 64-bit integer starting at character index i.

    • since 4.13
    module Set : Set.S with type elt = string
    module Map : Map.S with type key = string
    module Tbl : Hashtbl.S with type key = string
    val print : Stdlib.Format.formatter -> t -> unit
    val for_all : (char -> bool) -> t -> bool
    diff --git a/ocaml/Misc/Stdlib/index.html b/ocaml/Misc/Stdlib/index.html new file mode 100644 index 0000000..4ffe230 --- /dev/null +++ b/ocaml/Misc/Stdlib/index.html @@ -0,0 +1,2 @@ + +Stdlib (ocaml.Misc.Stdlib)

    Module Misc.Stdlib

    module List : sig ... end
    module Option : sig ... end
    module Array : sig ... end
    module String : sig ... end
    val compare : 'a -> 'a -> int
    diff --git a/ocaml/Misc/Style/index.html b/ocaml/Misc/Style/index.html new file mode 100644 index 0000000..f596dda --- /dev/null +++ b/ocaml/Misc/Style/index.html @@ -0,0 +1,4 @@ + +Style (ocaml.Misc.Style)

    Module Misc.Style

    type color =
    1. | Black
    2. | Red
    3. | Green
    4. | Yellow
    5. | Blue
    6. | Magenta
    7. | Cyan
    8. | White
    type style =
    1. | FG of color
    2. | BG of color
    3. | Bold
    4. | Reset
    type Stdlib.Format.stag +=
    1. | Style of style list
    val ansi_of_style_l : style list -> string
    type tag_style = {
    1. ansi : style list;
    2. text_open : string;
    3. text_close : string;
    }
    type styles = {
    1. error : tag_style;
    2. warning : tag_style;
    3. loc : tag_style;
    4. hint : tag_style;
    5. inline_code : tag_style;
    }
    val as_inline_code : + (Stdlib.Format.formatter -> 'a -> unit) as 'printer -> + 'printer
    val inline_code : Stdlib.Format.formatter -> string -> unit
    val default_styles : styles
    val get_styles : unit -> styles
    val set_styles : styles -> unit
    val setup : Color.setting option -> unit
    val set_tag_handling : Stdlib.Format.formatter -> unit
    diff --git a/ocaml/Misc/index.html b/ocaml/Misc/index.html new file mode 100644 index 0000000..ef96374 --- /dev/null +++ b/ocaml/Misc/index.html @@ -0,0 +1,36 @@ + +Misc (ocaml.Misc)

    Module Misc

    Miscellaneous useful types and functions

    Warning: this module is unstable and part of compiler-libs.

    Reporting fatal errors

    val fatal_error : string -> 'a

    Raise the Fatal_error exception with the given string.

    val fatal_errorf : ('a, Stdlib.Format.formatter, unit, 'b) format4 -> 'a

    Format the arguments according to the given format string and raise Fatal_error with the resulting string.

    exception Fatal_error

    Exceptions and finalization

    val try_finally : + ?always:(unit -> unit) -> + ?exceptionally:(unit -> unit) -> + (unit -> 'a) -> + 'a

    try_finally work ~always ~exceptionally is designed to run code in work that may fail with an exception, and has two kind of cleanup routines: always, that must be run after any execution of the function (typically, freeing system resources), and exceptionally, that should be run only if work or always failed with an exception (typically, undoing user-visible state changes that would only make sense if the function completes correctly). For example:

      let objfile = outputprefix ^ ".cmo" in
+  let oc = open_out_bin objfile in
+  Misc.try_finally
+    (fun () ->
+       bytecode
+       ++ Timings.(accumulate_time (Generate sourcefile))
+           (Emitcode.to_file oc modulename objfile);
+       Warnings.check_fatal ())
+    ~always:(fun () -> close_out oc)
+    ~exceptionally:(fun _exn -> remove_file objfile);

    If exceptionally fail with an exception, it is propagated as usual.

    If always or exceptionally use exceptions internally for control-flow but do not raise, then try_finally is careful to preserve any exception backtrace coming from work or always for easier debugging.

    val reraise_preserving_backtrace : exn -> (unit -> unit) -> 'a

    reraise_preserving_backtrace e f is (f (); raise e) except that the current backtrace is preserved, even if f uses exceptions internally.

    List operations

    val map_end : ('a -> 'b) -> 'a list -> 'b list -> 'b list

    map_end f l t is map f l @ t, just more efficient.

    val rev_map_end : ('a -> 'b) -> 'a list -> 'b list -> 'b list

    map_end f l t is map f (rev l) @ t, just more efficient.

    val map_left_right : ('a -> 'b) -> 'a list -> 'b list

    Like List.map, with guaranteed left-to-right evaluation order

    val for_all2 : ('a -> 'b -> bool) -> 'a list -> 'b list -> bool

    Same as List.for_all but for a binary predicate. In addition, this for_all2 never fails: given two lists with different lengths, it returns false.

    val replicate_list : 'a -> int -> 'a list

    replicate_list elem n is the list with n elements all identical to elem.

    val list_remove : 'a -> 'a list -> 'a list

    list_remove x l returns a copy of l with the first element equal to x removed.

    val split_last : 'a list -> 'a list * 'a

    Return the last element and the other elements of the given list.

    Hash table operations

    val create_hashtable : int -> ('a * 'b) list -> ('a, 'b) Stdlib.Hashtbl.t

    Create a hashtable with the given initial size and fills it with the given bindings.

    Extensions to the standard library

    module Stdlib : sig ... end

    Operations on files and file paths

    val find_in_path : string list -> string -> string

    Search a file in a list of directories.

    val find_in_path_rel : string list -> string -> string

    Search a relative file in a list of directories.

    val normalized_unit_filename : string -> string

    Normalize file name Foo.ml to foo.ml

    val find_in_path_normalized : string list -> string -> string

    Same as find_in_path_rel , but search also for normalized unit filename, i.e. if name is Foo.ml, allow /path/Foo.ml and /path/foo.ml to match.

    val remove_file : string -> unit

    Delete the given file if it exists and is a regular file. Does nothing for other kinds of files. Never raises an error.

    val expand_directory : string -> string -> string

    expand_directory alt file eventually expands a + at the beginning of file into alt (an alternate root directory)

    val split_path_contents : ?sep:char -> string -> string list

    split_path_contents ?sep s interprets s as the value of a "PATH"-like variable and returns the corresponding list of directories. s is split using the platform-specific delimiter, or ~sep if it is passed.

    Returns the empty list if s is empty.

    val copy_file : in_channel -> out_channel -> unit

    copy_file ic oc reads the contents of file ic and copies them to oc. It stops when encountering EOF on ic.

    val copy_file_chunk : in_channel -> out_channel -> int -> unit

    copy_file_chunk ic oc n reads n bytes from ic and copies them to oc. It raises End_of_file when encountering EOF on ic.

    val string_of_file : in_channel -> string

    string_of_file ic reads the contents of file ic and copies them to a string. It stops when encountering EOF on ic.

    val output_to_file_via_temporary : + ?mode:open_flag list -> + string -> + (string -> out_channel -> 'a) -> + 'a

    Produce output in temporary file, then rename it (as atomically as possible) to the desired output file name. output_to_file_via_temporary filename fn opens a temporary file which is passed to fn (name + output channel). When fn returns, the channel is closed and the temporary file is renamed to filename.

    val protect_writing_to_file : filename:string -> f:(out_channel -> 'a) -> 'a

    Open the given filename for writing (in binary mode), pass the out_channel to the given function, then close the channel. If the function raises an exception then filename will be removed.

    val concat_null_terminated : string list -> string

    concat_null_terminated [x1;x2; ... xn] is x1 ^ "\000" ^ x2 ^ "\000" ^ ... ^ xn ^ "\000"

    val split_null_terminated : string -> string list

    split_null_terminated s is similar String.split_on_char '\000' but ignores the trailing separator, if any

    val chop_extensions : string -> string

    Return the given file name without its extensions. The extensions is the longest suffix starting with a period and not including a directory separator, .xyz.uvw for instance.

    Return the given name if it does not contain an extension.

    Integer operations

    val log2 : int -> int

    log2 n returns s such that n = 1 lsl s if n is a power of 2

    val align : int -> int -> int

    align n a rounds n upwards to a multiple of a (a power of 2).

    val no_overflow_add : int -> int -> bool

    no_overflow_add n1 n2 returns true if the computation of n1 + n2 does not overflow.

    val no_overflow_sub : int -> int -> bool

    no_overflow_sub n1 n2 returns true if the computation of n1 - n2 does not overflow.

    val no_overflow_mul : int -> int -> bool

    no_overflow_mul n1 n2 returns true if the computation of n1 * n2 does not overflow.

    val no_overflow_lsl : int -> int -> bool

    no_overflow_lsl n k returns true if the computation of n lsl k does not overflow.

    val letter_of_int : int -> string
    module Int_literal_converter : sig ... end
    val find_first_mono : (int -> bool) -> int

    find_first_mono p takes an integer predicate p : int -> bool that we assume: 1. is monotonic on natural numbers: if a <= b then p a implies p b, 2. is satisfied for some natural numbers in range 0; max_int (this is equivalent to: p max_int = true).

    find_first_mono p is the smallest natural number N that satisfies p, computed in O(log(N)) calls to p.

    Our implementation supports two cases where the preconditions on p are not respected:

    • If p is always false, we silently return max_int instead of looping or crashing.
    • If p is non-monotonic but eventually true, we return some satisfying value.

    String operations

    val search_substring : string -> string -> int -> int

    search_substring pat str start returns the position of the first occurrence of string pat in string str. Search starts at offset start in str. Raise Not_found if pat does not occur.

    val replace_substring : before:string -> after:string -> string -> string

    replace_substring ~before ~after str replaces all occurrences of before with after in str and returns the resulting string.

    val rev_split_words : string -> string list

    rev_split_words s splits s in blank-separated words, and returns the list of words in reverse order.

    val cut_at : string -> char -> string * string

    String.cut_at s c returns a pair containing the sub-string before the first occurrence of c in s, and the sub-string after the first occurrence of c in s. let (before, after) = String.cut_at s c in before ^ String.make 1 c ^ after is the identity if s contains c.

    Raise Not_found if the character does not appear in the string

    • since 4.01
    val ordinal_suffix : int -> string

    ordinal_suffix n is the appropriate suffix to append to the numeral n as an ordinal number: 1 -> "st", 2 -> "nd", 3 -> "rd", 4 -> "th", and so on. Handles larger numbers (e.g., 42 -> "nd") and the numbers 11--13 (which all get "th") correctly.

    val normalise_eol : string -> string

    normalise_eol s returns a fresh copy of s with any '\r' characters removed. Intended for pre-processing text which will subsequently be printed on a channel which performs EOL transformations (i.e. Windows)

    val delete_eol_spaces : string -> string

    delete_eol_spaces s returns a fresh copy of s with any end of line spaces removed. Intended to normalize the output of the toplevel for tests.

    Operations on references

    type ref_and_value =
    1. | R : 'a ref * 'a -> ref_and_value
    val protect_refs : ref_and_value list -> (unit -> 'a) -> 'a

    protect_refs l f temporarily sets r to v for each R (r, v) in l while executing f. The previous contents of the references is restored even if f raises an exception, without altering the exception backtrace.

    val get_ref : 'a list ref -> 'a list

    get_ref lr returns the content of the list reference lr and reset its content to the empty list.

    val set_or_ignore : ('a -> 'b option) -> 'b option ref -> 'a -> unit

    set_or_ignore f opt x sets opt to f x if it returns Some _, or leaves it unmodified if it returns None.

    Operations on triples and quadruples

    val fst3 : ('a * 'b * 'c) -> 'a
    val snd3 : ('a * 'b * 'c) -> 'b
    val thd3 : ('a * 'b * 'c) -> 'c
    val fst4 : ('a * 'b * 'c * 'd) -> 'a
    val snd4 : ('a * 'b * 'c * 'd) -> 'b
    val thd4 : ('a * 'b * 'c * 'd) -> 'c
    val for4 : ('a * 'b * 'c * 'd) -> 'd

    Spell checking and ``did you mean'' suggestions

    val edit_distance : string -> string -> int -> int option

    edit_distance a b cutoff computes the edit distance between strings a and b. To help efficiency, it uses a cutoff: if the distance d is smaller than cutoff, it returns Some d, else None.

    The distance algorithm currently used is Damerau-Levenshtein: it computes the number of insertion, deletion, substitution of letters, or swapping of adjacent letters to go from one word to the other. The particular algorithm may change in the future.

    val spellcheck : string list -> string -> string list

    spellcheck env name takes a list of names env that exist in the current environment and an erroneous name, and returns a list of suggestions taken from env, that are close enough to name that it may be a typo for one of them.

    val did_you_mean : Stdlib.Format.formatter -> (unit -> string list) -> unit

    did_you_mean ppf get_choices hints that the user may have meant one of the option returned by calling get_choices. It does nothing if the returned list is empty.

    The unit -> ... thunking is meant to delay any potentially-slow computation (typically computing edit-distance with many things from the current environment) to when the hint message is to be printed. You should print an understandable error message before calling did_you_mean, so that users get a clear notification of the failure even if producing the hint is slow.

    module Color : sig ... end

    Styling handling for terminal output

    module Style : sig ... end
    module Error_style : sig ... end

    Formatted output

    val print_if : + Stdlib.Format.formatter -> + bool ref -> + (Stdlib.Format.formatter -> 'a -> unit) -> + 'a -> + 'a

    print_if ppf flag fmt x prints x with fmt on ppf if b is true.

    val pp_two_columns : + ?sep:string -> + ?max_lines:int -> + Stdlib.Format.formatter -> + (string * string) list -> + unit

    pp_two_columns ?sep ?max_lines ppf l prints the lines in l as two columns separated by sep ("|" by default). max_lines can be used to indicate a maximum number of lines to print -- an ellipsis gets inserted at the middle if the input has too many lines.

    Example:

    pp_two_columns ~max_lines:3 Format.std_formatter [
+  "abc", "hello";
+  "def", "zzz";
+  "a"  , "bllbl";
+  "bb" , "dddddd";
+]

    prints

    abc | hello
+...
+bb  | dddddd
    val print_see_manual : Stdlib.Format.formatter -> int list -> unit

    See manual section

    Displaying configuration variables

    val show_config_and_exit : unit -> unit

    Display the values of all compiler configuration variables from module Config, then exit the program with code 0.

    val show_config_variable_and_exit : string -> unit

    Display the value of the given configuration variable, then exit the program with code 0.

    Handling of build maps

    Build maps cause the compiler to normalize file names embedded in object files, thus leading to more reproducible builds.

    val get_build_path_prefix_map : unit -> Build_path_prefix_map.map option

    Returns the map encoded in the BUILD_PATH_PREFIX_MAP environment variable.

    val debug_prefix_map_flags : unit -> string list

    Returns the list of --debug-prefix-map flags to be passed to the assembler, built from the BUILD_PATH_PREFIX_MAP environment variable.

    Handling of magic numbers

    module Magic_number : sig ... end

    a typical magic number is "Caml1999I011"; it is formed of an alphanumeric prefix, here Caml1990I, followed by a version, here 011. The prefix identifies the kind of the versioned data: here the I indicates that it is the magic number for .cmi files.

    Miscellaneous type aliases

    type filepath = string
    type modname = string
    type crcs = (modname * Stdlib.Digest.t option) list
    type alerts = string Stdlib.String.Map.t
    diff --git a/ocaml/Mtype/index.html b/ocaml/Mtype/index.html new file mode 100644 index 0000000..196ea92 --- /dev/null +++ b/ocaml/Mtype/index.html @@ -0,0 +1,29 @@ + +Mtype (ocaml.Mtype)

    Module Mtype

    val scrape_for_functor_arg : Env.t -> Types.module_type -> Types.module_type
    val scrape_for_type_of : + remove_aliases:bool -> + Env.t -> + Types.module_type -> + Types.module_type
    val freshen : scope:int -> Types.module_type -> Types.module_type
    val strengthen : + aliasable:bool -> + Env.t -> + Types.module_type -> + Path.t -> + Types.module_type
    val strengthen_decl : + aliasable:bool -> + Env.t -> + Types.module_declaration -> + Path.t -> + Types.module_declaration
    val nondep_supertype : + Env.t -> + Ident.t list -> + Types.module_type -> + Types.module_type
    val nondep_sig_item : + Env.t -> + Ident.t list -> + Types.signature_item -> + Types.signature_item
    val no_code_needed : Env.t -> Types.module_type -> bool
    val no_code_needed_sig : Env.t -> Types.signature -> bool
    val enrich_modtype : Env.t -> Path.t -> Types.module_type -> Types.module_type
    val enrich_typedecl : + Env.t -> + Path.t -> + Ident.t -> + Types.type_declaration -> + Types.type_declaration
    val type_paths : Env.t -> Path.t -> Types.module_type -> Path.t list
    val contains_type : Env.t -> Types.module_type -> bool
    val lower_nongen : int -> Types.module_type -> unit
    diff --git a/ocaml/Mutable_variable/Map/index.html b/ocaml/Mutable_variable/Map/index.html new file mode 100644 index 0000000..5990119 --- /dev/null +++ b/ocaml/Mutable_variable/Map/index.html @@ -0,0 +1,17 @@ + +Map (ocaml.Mutable_variable.Map)

    Module Mutable_variable.Map

    include Map.S with type key = T.t and type 'a t = 'a Map.Make(T).t

    Maps

    type key = T.t

    The type of the map keys.

    type 'a t = 'a Stdlib.Map.Make(T).t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key -> 'a -> 'a t -> 'a t

    add key data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key -> 'a -> 'a list t -> 'a list t

    add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

    update key f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : (key -> bool) -> 'a t -> key * 'a

    find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : (key -> bool) -> 'a t -> key * 'a

    find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : (key -> 'a -> unit) -> 'a t -> unit

    iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

    fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : (key -> 'a -> bool) -> 'a t -> 'a t

    filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : (key -> 'a -> bool) -> 'a t -> bool

    for_all f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : (key -> 'a -> bool) -> 'a t -> bool

    exists f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Stdlib.Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Stdlib.Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    val of_list : (key * 'a) list -> 'a t
    val disjoint_union : + ?eq:('a -> 'a -> bool) -> + ?print:(Stdlib.Format.formatter -> 'a -> unit) -> + 'a t -> + 'a t -> + 'a t

    disjoint_union m1 m2 contains all bindings from m1 and m2. If some binding is present in both and the associated value is not equal, a Fatal_error is raised

    val union_right : 'a t -> 'a t -> 'a t

    union_right m1 m2 contains all bindings from m1 and m2. If some binding is present in both, the one from m2 is taken

    val union_left : 'a t -> 'a t -> 'a t

    union_left m1 m2 = union_right m2 m1

    val union_merge : ('a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
    val rename : key t -> key -> key
    val map_keys : (key -> key) -> 'a t -> 'a t
    val keys : 'a t -> Stdlib.Set.Make(T).t
    val data : 'a t -> 'a list
    val of_set : (key -> 'a) -> Stdlib.Set.Make(T).t -> 'a t
    val transpose_keys_and_data : key t -> key t
    val transpose_keys_and_data_set : key t -> Stdlib.Set.Make(T).t t
    val print : + (Stdlib.Format.formatter -> 'a -> unit) -> + Stdlib.Format.formatter -> + 'a t -> + unit
    diff --git a/ocaml/Mutable_variable/Set/index.html b/ocaml/Mutable_variable/Set/index.html new file mode 100644 index 0000000..b06ccbe --- /dev/null +++ b/ocaml/Mutable_variable/Set/index.html @@ -0,0 +1,2 @@ + +Set (ocaml.Mutable_variable.Set)

    Module Mutable_variable.Set

    include Set.S with type elt = T.t and type t = Set.Make(T).t

    Sets

    type elt = T.t

    The type of the set elements.

    The type of sets.

    val empty : t

    The empty set.

    val add : elt -> t -> t

    add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val singleton : elt -> t

    singleton x returns the one-element set containing only x.

    val remove : elt -> t -> t

    remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val union : t -> t -> t

    Set union.

    val inter : t -> t -> t

    Set intersection.

    val disjoint : t -> t -> bool

    Test if two sets are disjoint.

    • since 4.08
    val diff : t -> t -> t

    Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

    val cardinal : t -> int

    Return the number of elements of a set.

    Elements

    val elements : t -> elt list

    Return the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Set.Make.

    val min_elt : t -> elt

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

    val min_elt_opt : t -> elt option

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

    • since 4.05
    val max_elt : t -> elt

    Same as min_elt, but returns the largest element of the given set.

    val max_elt_opt : t -> elt option

    Same as min_elt_opt, but returns the largest element of the given set.

    • since 4.05
    val choose : t -> elt

    Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    val choose_opt : t -> elt option

    Return one element of the given set, or None if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    • since 4.05

    Searching

    val find : elt -> t -> elt

    find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

    • since 4.01
    val find_opt : elt -> t -> elt option

    find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

    • since 4.05
    val find_first : (elt -> bool) -> t -> elt

    find_first f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

    For example, find_first (fun e -> Ord.compare e x >= 0) s will return the first element e of s where Ord.compare e x >= 0 (intuitively: e >= x), or raise Not_found if x is greater than any element of s.

    • since 4.05
    val find_first_opt : (elt -> bool) -> t -> elt option

    find_first_opt f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

    • since 4.05
    val find_last : (elt -> bool) -> t -> elt

    find_last f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

    • since 4.05
    val find_last_opt : (elt -> bool) -> t -> elt option

    find_last_opt f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

    • since 4.05

    Traversing

    val iter : (elt -> unit) -> t -> unit

    iter f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.

    val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc

    fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

    Transforming

    val filter : (elt -> bool) -> t -> t

    filter f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val filter_map : (elt -> elt option) -> t -> t

    filter_map f s returns the set of all v such that f x = Some v for some element x of s.

    For example,

    filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) s

    is the set of halves of the even elements of s.

    If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned unchanged: the result of the function is then physically equal to s.

    • since 4.11
    val partition : (elt -> bool) -> t -> t * t

    partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

    val split : elt -> t -> t * bool * t

    split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.

    Predicates and comparisons

    val is_empty : t -> bool

    Test whether a set is empty or not.

    val mem : elt -> t -> bool

    mem x s tests whether x belongs to the set s.

    val equal : t -> t -> bool

    equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

    val compare : t -> t -> int

    Total ordering between sets. Can be used as the ordering function for doing sets of sets.

    val subset : t -> t -> bool

    subset s1 s2 tests whether the set s1 is a subset of the set s2.

    val for_all : (elt -> bool) -> t -> bool

    for_all f s checks if all elements of the set satisfy the predicate f.

    val exists : (elt -> bool) -> t -> bool

    exists f s checks if at least one element of the set satisfies the predicate f.

    Converting

    val to_list : t -> elt list

    to_list s is elements s.

    • since 5.1
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t

    to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

    • since 4.07
    val to_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in ascending order

    • since 4.07
    val to_rev_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in descending order

    • since 4.12
    val add_seq : elt Stdlib.Seq.t -> t -> t

    Add the given elements to the set, in order.

    • since 4.07
    val of_seq : elt Stdlib.Seq.t -> t

    Build a set from the given bindings

    • since 4.07
    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    val to_string : t -> string
    val of_list : elt list -> t
    val map : (elt -> elt) -> t -> t
    diff --git a/ocaml/Mutable_variable/T/index.html b/ocaml/Mutable_variable/T/index.html new file mode 100644 index 0000000..9c1548c --- /dev/null +++ b/ocaml/Mutable_variable/T/index.html @@ -0,0 +1,2 @@ + +T (ocaml.Mutable_variable.T)

    Module Mutable_variable.T

    type t = t
    include Hashtbl.HashedType with type t := t
    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val hash : t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := t
    val compare : t -> t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    diff --git a/ocaml/Mutable_variable/Tbl/index.html b/ocaml/Mutable_variable/Tbl/index.html new file mode 100644 index 0000000..ca7ce7f --- /dev/null +++ b/ocaml/Mutable_variable/Tbl/index.html @@ -0,0 +1,2 @@ + +Tbl (ocaml.Mutable_variable.Tbl)

    Module Mutable_variable.Tbl

    include Hashtbl.S with type key = T.t and type 'a t = 'a Hashtbl.Make(T).t
    type key = T.t
    val create : int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    • since 4.00
    val copy : 'a t -> 'a t
    val add : 'a t -> key -> 'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    • since 4.05
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key -> 'a -> unit
    val mem : 'a t -> key -> bool
    val iter : (key -> 'a -> unit) -> 'a t -> unit
    val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
    • since 4.03
    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc
    val length : 'a t -> int
    val stats : 'a t -> Stdlib.Hashtbl.statistics
    • since 4.00
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
    • since 4.07
    val to_seq_keys : _ t -> key Stdlib.Seq.t
    • since 4.07
    val to_seq_values : 'a t -> 'a Stdlib.Seq.t
    • since 4.07
    val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
    • since 4.07
    val to_list : 'a t -> (T.t * 'a) list
    val of_list : (T.t * 'a) list -> 'a t
    val to_map : 'a t -> 'a Stdlib.Map.Make(T).t
    val of_map : 'a Stdlib.Map.Make(T).t -> 'a t
    val memoize : 'a t -> (key -> 'a) -> key -> 'a
    val map : 'a t -> ('a -> 'b) -> 'b t
    diff --git a/ocaml/Mutable_variable/index.html b/ocaml/Mutable_variable/index.html new file mode 100644 index 0000000..3e0d8c0 --- /dev/null +++ b/ocaml/Mutable_variable/index.html @@ -0,0 +1,8 @@ + +Mutable_variable (ocaml.Mutable_variable)

    Module Mutable_variable

    include Identifiable.S
    type t
    module T : Identifiable.Thing with type t = t
    include Identifiable.Thing with type t := T.t
    include Hashtbl.HashedType with type t := T.t
    val equal : T.t -> T.t -> bool

    The equality predicate used to compare keys.

    val hash : T.t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := T.t
    val compare : T.t -> T.t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> T.t -> unit
    val print : Stdlib.Format.formatter -> T.t -> unit
    module Set : Identifiable.Set with module T := T
    module Map : Identifiable.Map with module T := T
    module Tbl : Identifiable.Tbl with module T := T
    val create : + ?current_compilation_unit:Compilation_unit.t -> + Internal_variable_names.t -> + t
    val create_with_same_name_as_ident : Ident.t -> t
    val create_from_variable : + ?current_compilation_unit:Compilation_unit.t -> + Variable.t -> + t
    val rename : ?current_compilation_unit:Compilation_unit.t -> t -> t
    val in_compilation_unit : t -> Compilation_unit.t -> bool
    val name : t -> string
    val unique_name : t -> string
    val print_list : Stdlib.Format.formatter -> t list -> unit
    val print_opt : Stdlib.Format.formatter -> t option -> unit
    val output_full : out_channel -> t -> unit
    diff --git a/ocaml/Numbers/Float/Map/index.html b/ocaml/Numbers/Float/Map/index.html new file mode 100644 index 0000000..7b80751 --- /dev/null +++ b/ocaml/Numbers/Float/Map/index.html @@ -0,0 +1,17 @@ + +Map (ocaml.Numbers.Float.Map)

    Module Float.Map

    include Map.S with type key = T.t and type 'a t = 'a Map.Make(T).t

    Maps

    type key = T.t

    The type of the map keys.

    type 'a t = 'a Stdlib.Map.Make(T).t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key -> 'a -> 'a t -> 'a t

    add key data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key -> 'a -> 'a list t -> 'a list t

    add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

    update key f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : (key -> bool) -> 'a t -> key * 'a

    find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : (key -> bool) -> 'a t -> key * 'a

    find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : (key -> 'a -> unit) -> 'a t -> unit

    iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

    fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : (key -> 'a -> bool) -> 'a t -> 'a t

    filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : (key -> 'a -> bool) -> 'a t -> bool

    for_all f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : (key -> 'a -> bool) -> 'a t -> bool

    exists f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Stdlib.Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Stdlib.Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    val of_list : (key * 'a) list -> 'a t
    val disjoint_union : + ?eq:('a -> 'a -> bool) -> + ?print:(Stdlib.Format.formatter -> 'a -> unit) -> + 'a t -> + 'a t -> + 'a t

    disjoint_union m1 m2 contains all bindings from m1 and m2. If some binding is present in both and the associated value is not equal, a Fatal_error is raised

    val union_right : 'a t -> 'a t -> 'a t

    union_right m1 m2 contains all bindings from m1 and m2. If some binding is present in both, the one from m2 is taken

    val union_left : 'a t -> 'a t -> 'a t

    union_left m1 m2 = union_right m2 m1

    val union_merge : ('a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
    val rename : key t -> key -> key
    val map_keys : (key -> key) -> 'a t -> 'a t
    val keys : 'a t -> Stdlib.Set.Make(T).t
    val data : 'a t -> 'a list
    val of_set : (key -> 'a) -> Stdlib.Set.Make(T).t -> 'a t
    val transpose_keys_and_data : key t -> key t
    val transpose_keys_and_data_set : key t -> Stdlib.Set.Make(T).t t
    val print : + (Stdlib.Format.formatter -> 'a -> unit) -> + Stdlib.Format.formatter -> + 'a t -> + unit
    diff --git a/ocaml/Numbers/Float/Set/index.html b/ocaml/Numbers/Float/Set/index.html new file mode 100644 index 0000000..9b7668f --- /dev/null +++ b/ocaml/Numbers/Float/Set/index.html @@ -0,0 +1,2 @@ + +Set (ocaml.Numbers.Float.Set)

    Module Float.Set

    include Set.S with type elt = T.t and type t = Set.Make(T).t

    Sets

    type elt = T.t

    The type of the set elements.

    The type of sets.

    val empty : t

    The empty set.

    val add : elt -> t -> t

    add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val singleton : elt -> t

    singleton x returns the one-element set containing only x.

    val remove : elt -> t -> t

    remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val union : t -> t -> t

    Set union.

    val inter : t -> t -> t

    Set intersection.

    val disjoint : t -> t -> bool

    Test if two sets are disjoint.

    • since 4.08
    val diff : t -> t -> t

    Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

    val cardinal : t -> int

    Return the number of elements of a set.

    Elements

    val elements : t -> elt list

    Return the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Set.Make.

    val min_elt : t -> elt

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

    val min_elt_opt : t -> elt option

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

    • since 4.05
    val max_elt : t -> elt

    Same as min_elt, but returns the largest element of the given set.

    val max_elt_opt : t -> elt option

    Same as min_elt_opt, but returns the largest element of the given set.

    • since 4.05
    val choose : t -> elt

    Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    val choose_opt : t -> elt option

    Return one element of the given set, or None if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    • since 4.05

    Searching

    val find : elt -> t -> elt

    find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

    • since 4.01
    val find_opt : elt -> t -> elt option

    find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

    • since 4.05
    val find_first : (elt -> bool) -> t -> elt

    find_first f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

    For example, find_first (fun e -> Ord.compare e x >= 0) s will return the first element e of s where Ord.compare e x >= 0 (intuitively: e >= x), or raise Not_found if x is greater than any element of s.

    • since 4.05
    val find_first_opt : (elt -> bool) -> t -> elt option

    find_first_opt f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

    • since 4.05
    val find_last : (elt -> bool) -> t -> elt

    find_last f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

    • since 4.05
    val find_last_opt : (elt -> bool) -> t -> elt option

    find_last_opt f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

    • since 4.05

    Traversing

    val iter : (elt -> unit) -> t -> unit

    iter f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.

    val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc

    fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

    Transforming

    val filter : (elt -> bool) -> t -> t

    filter f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val filter_map : (elt -> elt option) -> t -> t

    filter_map f s returns the set of all v such that f x = Some v for some element x of s.

    For example,

    filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) s

    is the set of halves of the even elements of s.

    If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned unchanged: the result of the function is then physically equal to s.

    • since 4.11
    val partition : (elt -> bool) -> t -> t * t

    partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

    val split : elt -> t -> t * bool * t

    split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.

    Predicates and comparisons

    val is_empty : t -> bool

    Test whether a set is empty or not.

    val mem : elt -> t -> bool

    mem x s tests whether x belongs to the set s.

    val equal : t -> t -> bool

    equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

    val compare : t -> t -> int

    Total ordering between sets. Can be used as the ordering function for doing sets of sets.

    val subset : t -> t -> bool

    subset s1 s2 tests whether the set s1 is a subset of the set s2.

    val for_all : (elt -> bool) -> t -> bool

    for_all f s checks if all elements of the set satisfy the predicate f.

    val exists : (elt -> bool) -> t -> bool

    exists f s checks if at least one element of the set satisfies the predicate f.

    Converting

    val to_list : t -> elt list

    to_list s is elements s.

    • since 5.1
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t

    to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

    • since 4.07
    val to_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in ascending order

    • since 4.07
    val to_rev_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in descending order

    • since 4.12
    val add_seq : elt Stdlib.Seq.t -> t -> t

    Add the given elements to the set, in order.

    • since 4.07
    val of_seq : elt Stdlib.Seq.t -> t

    Build a set from the given bindings

    • since 4.07
    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    val to_string : t -> string
    val of_list : elt list -> t
    val map : (elt -> elt) -> t -> t
    diff --git a/ocaml/Numbers/Float/T/index.html b/ocaml/Numbers/Float/T/index.html new file mode 100644 index 0000000..13483af --- /dev/null +++ b/ocaml/Numbers/Float/T/index.html @@ -0,0 +1,2 @@ + +T (ocaml.Numbers.Float.T)

    Module Float.T

    type t = t
    include Hashtbl.HashedType with type t := t
    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val hash : t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := t
    val compare : t -> t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    diff --git a/ocaml/Numbers/Float/Tbl/index.html b/ocaml/Numbers/Float/Tbl/index.html new file mode 100644 index 0000000..5abb669 --- /dev/null +++ b/ocaml/Numbers/Float/Tbl/index.html @@ -0,0 +1,2 @@ + +Tbl (ocaml.Numbers.Float.Tbl)

    Module Float.Tbl

    include Hashtbl.S with type key = T.t and type 'a t = 'a Hashtbl.Make(T).t
    type key = T.t
    val create : int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    • since 4.00
    val copy : 'a t -> 'a t
    val add : 'a t -> key -> 'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    • since 4.05
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key -> 'a -> unit
    val mem : 'a t -> key -> bool
    val iter : (key -> 'a -> unit) -> 'a t -> unit
    val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
    • since 4.03
    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc
    val length : 'a t -> int
    val stats : 'a t -> Stdlib.Hashtbl.statistics
    • since 4.00
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
    • since 4.07
    val to_seq_keys : _ t -> key Stdlib.Seq.t
    • since 4.07
    val to_seq_values : 'a t -> 'a Stdlib.Seq.t
    • since 4.07
    val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
    • since 4.07
    val to_list : 'a t -> (T.t * 'a) list
    val of_list : (T.t * 'a) list -> 'a t
    val to_map : 'a t -> 'a Stdlib.Map.Make(T).t
    val of_map : 'a Stdlib.Map.Make(T).t -> 'a t
    val memoize : 'a t -> (key -> 'a) -> key -> 'a
    val map : 'a t -> ('a -> 'b) -> 'b t
    diff --git a/ocaml/Numbers/Float/index.html b/ocaml/Numbers/Float/index.html new file mode 100644 index 0000000..ff82ec7 --- /dev/null +++ b/ocaml/Numbers/Float/index.html @@ -0,0 +1,2 @@ + +Float (ocaml.Numbers.Float)

    Module Numbers.Float

    type t = float
    module T : Identifiable.Thing with type t = t
    include Identifiable.Thing with type t := T.t
    include Hashtbl.HashedType with type t := T.t
    val equal : T.t -> T.t -> bool

    The equality predicate used to compare keys.

    val hash : T.t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := T.t
    val compare : T.t -> T.t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> T.t -> unit
    val print : Stdlib.Format.formatter -> T.t -> unit
    module Set : Identifiable.Set with module T := T
    module Map : Identifiable.Map with module T := T
    module Tbl : Identifiable.Tbl with module T := T
    diff --git a/ocaml/Numbers/Int/Map/index.html b/ocaml/Numbers/Int/Map/index.html new file mode 100644 index 0000000..08c3856 --- /dev/null +++ b/ocaml/Numbers/Int/Map/index.html @@ -0,0 +1,17 @@ + +Map (ocaml.Numbers.Int.Map)

    Module Int.Map

    include Map.S with type key = T.t and type 'a t = 'a Map.Make(T).t

    Maps

    type key = T.t

    The type of the map keys.

    type 'a t = 'a Stdlib.Map.Make(T).t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key -> 'a -> 'a t -> 'a t

    add key data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key -> 'a -> 'a list t -> 'a list t

    add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

    update key f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : (key -> bool) -> 'a t -> key * 'a

    find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : (key -> bool) -> 'a t -> key * 'a

    find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : (key -> 'a -> unit) -> 'a t -> unit

    iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

    fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : (key -> 'a -> bool) -> 'a t -> 'a t

    filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : (key -> 'a -> bool) -> 'a t -> bool

    for_all f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : (key -> 'a -> bool) -> 'a t -> bool

    exists f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Stdlib.Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Stdlib.Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    val of_list : (key * 'a) list -> 'a t
    val disjoint_union : + ?eq:('a -> 'a -> bool) -> + ?print:(Stdlib.Format.formatter -> 'a -> unit) -> + 'a t -> + 'a t -> + 'a t

    disjoint_union m1 m2 contains all bindings from m1 and m2. If some binding is present in both and the associated value is not equal, a Fatal_error is raised

    val union_right : 'a t -> 'a t -> 'a t

    union_right m1 m2 contains all bindings from m1 and m2. If some binding is present in both, the one from m2 is taken

    val union_left : 'a t -> 'a t -> 'a t

    union_left m1 m2 = union_right m2 m1

    val union_merge : ('a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
    val rename : key t -> key -> key
    val map_keys : (key -> key) -> 'a t -> 'a t
    val keys : 'a t -> Stdlib.Set.Make(T).t
    val data : 'a t -> 'a list
    val of_set : (key -> 'a) -> Stdlib.Set.Make(T).t -> 'a t
    val transpose_keys_and_data : key t -> key t
    val transpose_keys_and_data_set : key t -> Stdlib.Set.Make(T).t t
    val print : + (Stdlib.Format.formatter -> 'a -> unit) -> + Stdlib.Format.formatter -> + 'a t -> + unit
    diff --git a/ocaml/Numbers/Int/Set/index.html b/ocaml/Numbers/Int/Set/index.html new file mode 100644 index 0000000..faa7085 --- /dev/null +++ b/ocaml/Numbers/Int/Set/index.html @@ -0,0 +1,2 @@ + +Set (ocaml.Numbers.Int.Set)

    Module Int.Set

    include Set.S with type elt = T.t and type t = Set.Make(T).t

    Sets

    type elt = T.t

    The type of the set elements.

    The type of sets.

    val empty : t

    The empty set.

    val add : elt -> t -> t

    add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val singleton : elt -> t

    singleton x returns the one-element set containing only x.

    val remove : elt -> t -> t

    remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val union : t -> t -> t

    Set union.

    val inter : t -> t -> t

    Set intersection.

    val disjoint : t -> t -> bool

    Test if two sets are disjoint.

    • since 4.08
    val diff : t -> t -> t

    Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

    val cardinal : t -> int

    Return the number of elements of a set.

    Elements

    val elements : t -> elt list

    Return the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Set.Make.

    val min_elt : t -> elt

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

    val min_elt_opt : t -> elt option

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

    • since 4.05
    val max_elt : t -> elt

    Same as min_elt, but returns the largest element of the given set.

    val max_elt_opt : t -> elt option

    Same as min_elt_opt, but returns the largest element of the given set.

    • since 4.05
    val choose : t -> elt

    Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    val choose_opt : t -> elt option

    Return one element of the given set, or None if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    • since 4.05

    Searching

    val find : elt -> t -> elt

    find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

    • since 4.01
    val find_opt : elt -> t -> elt option

    find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

    • since 4.05
    val find_first : (elt -> bool) -> t -> elt

    find_first f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

    For example, find_first (fun e -> Ord.compare e x >= 0) s will return the first element e of s where Ord.compare e x >= 0 (intuitively: e >= x), or raise Not_found if x is greater than any element of s.

    • since 4.05
    val find_first_opt : (elt -> bool) -> t -> elt option

    find_first_opt f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

    • since 4.05
    val find_last : (elt -> bool) -> t -> elt

    find_last f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

    • since 4.05
    val find_last_opt : (elt -> bool) -> t -> elt option

    find_last_opt f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

    • since 4.05

    Traversing

    val iter : (elt -> unit) -> t -> unit

    iter f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.

    val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc

    fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

    Transforming

    val filter : (elt -> bool) -> t -> t

    filter f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val filter_map : (elt -> elt option) -> t -> t

    filter_map f s returns the set of all v such that f x = Some v for some element x of s.

    For example,

    filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) s

    is the set of halves of the even elements of s.

    If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned unchanged: the result of the function is then physically equal to s.

    • since 4.11
    val partition : (elt -> bool) -> t -> t * t

    partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

    val split : elt -> t -> t * bool * t

    split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.

    Predicates and comparisons

    val is_empty : t -> bool

    Test whether a set is empty or not.

    val mem : elt -> t -> bool

    mem x s tests whether x belongs to the set s.

    val equal : t -> t -> bool

    equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

    val compare : t -> t -> int

    Total ordering between sets. Can be used as the ordering function for doing sets of sets.

    val subset : t -> t -> bool

    subset s1 s2 tests whether the set s1 is a subset of the set s2.

    val for_all : (elt -> bool) -> t -> bool

    for_all f s checks if all elements of the set satisfy the predicate f.

    val exists : (elt -> bool) -> t -> bool

    exists f s checks if at least one element of the set satisfies the predicate f.

    Converting

    val to_list : t -> elt list

    to_list s is elements s.

    • since 5.1
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t

    to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

    • since 4.07
    val to_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in ascending order

    • since 4.07
    val to_rev_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in descending order

    • since 4.12
    val add_seq : elt Stdlib.Seq.t -> t -> t

    Add the given elements to the set, in order.

    • since 4.07
    val of_seq : elt Stdlib.Seq.t -> t

    Build a set from the given bindings

    • since 4.07
    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    val to_string : t -> string
    val of_list : elt list -> t
    val map : (elt -> elt) -> t -> t
    diff --git a/ocaml/Numbers/Int/T/index.html b/ocaml/Numbers/Int/T/index.html new file mode 100644 index 0000000..cfd9433 --- /dev/null +++ b/ocaml/Numbers/Int/T/index.html @@ -0,0 +1,2 @@ + +T (ocaml.Numbers.Int.T)

    Module Int.T

    type t = t
    include Hashtbl.HashedType with type t := t
    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val hash : t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := t
    val compare : t -> t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    diff --git a/ocaml/Numbers/Int/Tbl/index.html b/ocaml/Numbers/Int/Tbl/index.html new file mode 100644 index 0000000..5fbbde8 --- /dev/null +++ b/ocaml/Numbers/Int/Tbl/index.html @@ -0,0 +1,2 @@ + +Tbl (ocaml.Numbers.Int.Tbl)

    Module Int.Tbl

    include Hashtbl.S with type key = T.t and type 'a t = 'a Hashtbl.Make(T).t
    type key = T.t
    val create : int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    • since 4.00
    val copy : 'a t -> 'a t
    val add : 'a t -> key -> 'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    • since 4.05
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key -> 'a -> unit
    val mem : 'a t -> key -> bool
    val iter : (key -> 'a -> unit) -> 'a t -> unit
    val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
    • since 4.03
    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc
    val length : 'a t -> int
    val stats : 'a t -> Stdlib.Hashtbl.statistics
    • since 4.00
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
    • since 4.07
    val to_seq_keys : _ t -> key Stdlib.Seq.t
    • since 4.07
    val to_seq_values : 'a t -> 'a Stdlib.Seq.t
    • since 4.07
    val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
    • since 4.07
    val to_list : 'a t -> (T.t * 'a) list
    val of_list : (T.t * 'a) list -> 'a t
    val to_map : 'a t -> 'a Stdlib.Map.Make(T).t
    val of_map : 'a Stdlib.Map.Make(T).t -> 'a t
    val memoize : 'a t -> (key -> 'a) -> key -> 'a
    val map : 'a t -> ('a -> 'b) -> 'b t
    diff --git a/ocaml/Numbers/Int/index.html b/ocaml/Numbers/Int/index.html new file mode 100644 index 0000000..3dfe7fc --- /dev/null +++ b/ocaml/Numbers/Int/index.html @@ -0,0 +1,2 @@ + +Int (ocaml.Numbers.Int)

    Module Numbers.Int

    include Identifiable.S with type t = int
    type t = int
    module T : Identifiable.Thing with type t = t
    include Identifiable.Thing with type t := T.t
    include Hashtbl.HashedType with type t := T.t
    val equal : T.t -> T.t -> bool

    The equality predicate used to compare keys.

    val hash : T.t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := T.t
    val compare : T.t -> T.t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> T.t -> unit
    val print : Stdlib.Format.formatter -> T.t -> unit
    module Set : Identifiable.Set with module T := T
    module Map : Identifiable.Map with module T := T
    module Tbl : Identifiable.Tbl with module T := T
    val zero_to_n : int -> Set.t

    zero_to_n n is the set of numbers {0, ..., n} (inclusive).

    val to_string : int -> string
    diff --git a/ocaml/Numbers/Int16/index.html b/ocaml/Numbers/Int16/index.html new file mode 100644 index 0000000..4a575a6 --- /dev/null +++ b/ocaml/Numbers/Int16/index.html @@ -0,0 +1,2 @@ + +Int16 (ocaml.Numbers.Int16)

    Module Numbers.Int16

    type t
    val of_int_exn : int -> t
    val of_int64_exn : Stdlib.Int64.t -> t
    val to_int : t -> int
    diff --git a/ocaml/Numbers/Int8/index.html b/ocaml/Numbers/Int8/index.html new file mode 100644 index 0000000..01a66f8 --- /dev/null +++ b/ocaml/Numbers/Int8/index.html @@ -0,0 +1,2 @@ + +Int8 (ocaml.Numbers.Int8)

    Module Numbers.Int8

    type t
    val zero : t
    val one : t
    val of_int_exn : int -> t
    val to_int : t -> int
    diff --git a/ocaml/Numbers/index.html b/ocaml/Numbers/index.html new file mode 100644 index 0000000..0e215b7 --- /dev/null +++ b/ocaml/Numbers/index.html @@ -0,0 +1,2 @@ + +Numbers (ocaml.Numbers)

    Module Numbers

    Modules about numbers, some of which satisfy Identifiable.S.

    Warning: this module is unstable and part of compiler-libs.

    module Int : sig ... end
    module Int8 : sig ... end
    module Int16 : sig ... end
    module Float : Identifiable.S with type t = float
    diff --git a/ocaml/Odoc/index.html b/ocaml/Odoc/index.html new file mode 100644 index 0000000..815502e --- /dev/null +++ b/ocaml/Odoc/index.html @@ -0,0 +1,2 @@ + +Odoc (ocaml.Odoc)

    Module Odoc

    diff --git a/ocaml/Odoc_analyse/index.html b/ocaml/Odoc_analyse/index.html new file mode 100644 index 0000000..243d060 --- /dev/null +++ b/ocaml/Odoc_analyse/index.html @@ -0,0 +1,5 @@ + +Odoc_analyse (ocaml.Odoc_analyse)

    Module Odoc_analyse

    val analyse_files : + ?init:Odoc_module.t_module list -> + Odoc_global.source_file list -> + Odoc_module.t_module list
    val dump_modules : string -> Odoc_module.t_module list -> unit
    val load_modules : string -> Odoc_module.t_module list
    diff --git a/ocaml/Odoc_args/index.html b/ocaml/Odoc_args/index.html new file mode 100644 index 0000000..045f65a --- /dev/null +++ b/ocaml/Odoc_args/index.html @@ -0,0 +1,2 @@ + +Odoc_args (ocaml.Odoc_args)

    Module Odoc_args

    val current_generator : Odoc_gen.generator option ref
    val set_generator : Odoc_gen.generator -> unit
    val extend_html_generator : (module Odoc_gen.Html_functor) -> unit
    val extend_latex_generator : (module Odoc_gen.Latex_functor) -> unit
    val extend_texi_generator : (module Odoc_gen.Texi_functor) -> unit
    val extend_man_generator : (module Odoc_gen.Man_functor) -> unit
    val extend_dot_generator : (module Odoc_gen.Dot_functor) -> unit
    val extend_base_generator : (module Odoc_gen.Base_functor) -> unit
    val add_option : (string * Stdlib.Arg.spec * string) -> unit
    val parse : unit -> unit
    diff --git a/ocaml/Odoc_ast/Analyser/argument-1-_/index.html b/ocaml/Odoc_ast/Analyser/argument-1-_/index.html new file mode 100644 index 0000000..f5ec851 --- /dev/null +++ b/ocaml/Odoc_ast/Analyser/argument-1-_/index.html @@ -0,0 +1,6 @@ + +_ (ocaml.Odoc_ast.Analyser._)

    Parameter Analyser._

    val all_special : string -> string -> int * Odoc_types.info list
    val blank_line_outside_simple : string -> string -> bool
    val just_after_special : string -> string -> int * Odoc_types.info option
    val first_special : string -> string -> int * Odoc_types.info option
    val get_comments : + (Odoc_types.text -> 'a) -> + string -> + string -> + Odoc_types.info option * 'a list
    diff --git a/ocaml/Odoc_ast/Analyser/index.html b/ocaml/Odoc_ast/Analyser/index.html new file mode 100644 index 0000000..acfdc27 --- /dev/null +++ b/ocaml/Odoc_ast/Analyser/index.html @@ -0,0 +1,7 @@ + +Analyser (ocaml.Odoc_ast.Analyser)

    Module Odoc_ast.Analyser

    Parameters

    module _ : Odoc_sig.Info_retriever

    Signature

    val analyse_typed_tree : + string -> + string -> + Parsetree.structure -> + typedtree -> + Odoc_module.t_module
    diff --git a/ocaml/Odoc_ast/Typedtree_search/index.html b/ocaml/Odoc_ast/Typedtree_search/index.html new file mode 100644 index 0000000..2dcd2e5 --- /dev/null +++ b/ocaml/Odoc_ast/Typedtree_search/index.html @@ -0,0 +1,21 @@ + +Typedtree_search (ocaml.Odoc_ast.Typedtree_search)

    Module Odoc_ast.Typedtree_search

    type ele
    val tables : Typedtree.structure_item list -> tab * tab_values
    val search_module : tab -> string -> Typedtree.module_expr
    val search_module_type : tab -> string -> Typedtree.module_type_declaration
    val search_extension : tab -> string -> Typedtree.type_extension
    val search_type_declaration : tab -> string -> Typedtree.type_declaration
    val search_class_exp : + tab -> + string -> + Typedtree.class_expr * Types.type_expr list
    val search_class_type_declaration : + tab -> + string -> + Typedtree.class_type_declaration
    val search_value : + tab_values -> + string -> + Typedtree.pattern * Typedtree.expression
    val search_primitive : tab -> string -> Types.type_expr
    val get_nth_inherit_class_expr : + Typedtree.class_structure -> + int -> + Typedtree.class_expr
    val search_attribute_type : + Typedtree.class_structure -> + string -> + Types.type_expr
    val search_method_expression : + Typedtree.class_structure -> + string -> + Typedtree.expression
    diff --git a/ocaml/Odoc_ast/index.html b/ocaml/Odoc_ast/index.html new file mode 100644 index 0000000..0106b92 --- /dev/null +++ b/ocaml/Odoc_ast/index.html @@ -0,0 +1,2 @@ + +Odoc_ast (ocaml.Odoc_ast)

    Module Odoc_ast

    module Analyser (_ : Odoc_sig.Info_retriever) : sig ... end
    diff --git a/ocaml/Odoc_class/index.html b/ocaml/Odoc_class/index.html new file mode 100644 index 0000000..246dade --- /dev/null +++ b/ocaml/Odoc_class/index.html @@ -0,0 +1,11 @@ + +Odoc_class (ocaml.Odoc_class)

    Module Odoc_class

    module Name = Odoc_name
    type class_element =
    1. | Class_attribute of Odoc_value.t_attribute
    2. | Class_method of Odoc_value.t_method
    3. | Class_comment of Odoc_types.text
    type cct =
    1. | Cl of t_class
    2. | Cltype of t_class_type * Types.type_expr list
    and inherited_class = {
    1. ic_name : Name.t;
    2. mutable ic_class : cct option;
    3. ic_text : Odoc_types.text option;
    }
    and class_apply = {
    1. capp_name : Name.t;
    2. mutable capp_class : t_class option;
    3. capp_params : Types.type_expr list;
    4. capp_params_code : string list;
    }
    and class_constr = {
    1. cco_name : Name.t;
    2. mutable cco_class : cct option;
    3. cco_type_parameters : Types.type_expr list;
    }
    and class_kind =
    1. | Class_structure of inherited_class list * class_element list
    2. | Class_apply of class_apply
    3. | Class_constr of class_constr
    4. | Class_constraint of class_kind * class_type_kind
    and t_class = {
    1. cl_name : Name.t;
    2. mutable cl_info : Odoc_types.info option;
    3. cl_type : Types.class_type;
    4. cl_type_parameters : Types.type_expr list;
    5. cl_virtual : bool;
    6. mutable cl_kind : class_kind;
    7. mutable cl_parameters : Odoc_parameter.parameter list;
    8. mutable cl_loc : Odoc_types.location;
    }
    and class_type_alias = {
    1. cta_name : Name.t;
    2. mutable cta_class : cct option;
    3. cta_type_parameters : Types.type_expr list;
    }
    and class_type_kind =
    1. | Class_signature of inherited_class list * class_element list
    2. | Class_type of class_type_alias
    and t_class_type = {
    1. clt_name : Name.t;
    2. mutable clt_info : Odoc_types.info option;
    3. clt_type : Types.class_type;
    4. clt_type_parameters : Types.type_expr list;
    5. clt_virtual : bool;
    6. mutable clt_kind : class_type_kind;
    7. mutable clt_loc : Odoc_types.location;
    }
    val class_parameter_text_by_name : t_class -> string -> Odoc_types.text option
    val class_elements : ?trans:bool -> t_class -> class_element list
    val class_type_elements : ?trans:bool -> t_class_type -> class_element list
    val class_attributes : ?trans:bool -> t_class -> Odoc_value.t_attribute list
    val class_methods : ?trans:bool -> t_class -> Odoc_value.t_method list
    val class_comments : ?trans:bool -> t_class -> Odoc_types.text list
    val class_update_parameters_text : t_class -> unit
    val class_type_attributes : + ?trans:bool -> + t_class_type -> + Odoc_value.t_attribute list
    val class_type_methods : + ?trans:bool -> + t_class_type -> + Odoc_value.t_method list
    val class_type_comments : ?trans:bool -> t_class_type -> Odoc_types.text list
    val class_type_parameter_text_by_name : + t_class_type -> + string -> + Odoc_types.text option
    diff --git a/ocaml/Odoc_comments/Basic_info_retriever/index.html b/ocaml/Odoc_comments/Basic_info_retriever/index.html new file mode 100644 index 0000000..b4ea6a4 --- /dev/null +++ b/ocaml/Odoc_comments/Basic_info_retriever/index.html @@ -0,0 +1,6 @@ + +Basic_info_retriever (ocaml.Odoc_comments.Basic_info_retriever)

    Module Odoc_comments.Basic_info_retriever

    val blank_line_outside_simple : string -> string -> bool
    val all_special : string -> string -> int * Odoc_types.info list
    val just_after_special : string -> string -> int * Odoc_types.info option
    val first_special : string -> string -> int * Odoc_types.info option
    val get_comments : + (Odoc_types.text -> 'a) -> + string -> + string -> + Odoc_types.info option * 'a list
    diff --git a/ocaml/Odoc_comments/index.html b/ocaml/Odoc_comments/index.html new file mode 100644 index 0000000..9a576c3 --- /dev/null +++ b/ocaml/Odoc_comments/index.html @@ -0,0 +1,5 @@ + +Odoc_comments (ocaml.Odoc_comments)

    Module Odoc_comments

    val simple_blank : string
    module type Texter = sig ... end
    module Basic_info_retriever : sig ... end
    val info_of_string : string -> Odoc_types.info
    val info_of_comment_file : + Odoc_module.t_module list -> + string -> + Odoc_types.info
    diff --git a/ocaml/Odoc_comments/module-type-Texter/index.html b/ocaml/Odoc_comments/module-type-Texter/index.html new file mode 100644 index 0000000..3f5c14b --- /dev/null +++ b/ocaml/Odoc_comments/module-type-Texter/index.html @@ -0,0 +1,2 @@ + +Texter (ocaml.Odoc_comments.Texter)

    Module type Odoc_comments.Texter

    val text_of_string : string -> Odoc_types.text
    diff --git a/ocaml/Odoc_comments_global/index.html b/ocaml/Odoc_comments_global/index.html new file mode 100644 index 0000000..4bae46a --- /dev/null +++ b/ocaml/Odoc_comments_global/index.html @@ -0,0 +1,2 @@ + +Odoc_comments_global (ocaml.Odoc_comments_global)

    Module Odoc_comments_global

    val nb_chars : int ref
    val authors : string list ref
    val version : string option ref
    val sees : string list ref
    val since : string option ref
    val before : (string * string) list ref
    val deprecated : string option ref
    val params : (string * string) list ref
    val raised_exceptions : (string * string) list ref
    val return_value : string option ref
    val customs : (string * string) list ref
    val init : unit -> unit
    diff --git a/ocaml/Odoc_config/index.html b/ocaml/Odoc_config/index.html new file mode 100644 index 0000000..d46f79d --- /dev/null +++ b/ocaml/Odoc_config/index.html @@ -0,0 +1,2 @@ + +Odoc_config (ocaml.Odoc_config)

    Module Odoc_config

    val custom_generators_path : string
    val print_warnings : bool ref
    diff --git a/ocaml/Odoc_cross/index.html b/ocaml/Odoc_cross/index.html new file mode 100644 index 0000000..18ba4ad --- /dev/null +++ b/ocaml/Odoc_cross/index.html @@ -0,0 +1,6 @@ + +Odoc_cross (ocaml.Odoc_cross)

    Module Odoc_cross

    val associate : Odoc_module.t_module list -> unit
    val assoc_comments_info : + string -> + Odoc_module.t_module list -> + Odoc_types.info -> + Odoc_types.info
    diff --git a/ocaml/Odoc_dag2html/index.html b/ocaml/Odoc_dag2html/index.html new file mode 100644 index 0000000..4fff092 --- /dev/null +++ b/ocaml/Odoc_dag2html/index.html @@ -0,0 +1,5 @@ + +Odoc_dag2html (ocaml.Odoc_dag2html)

    Module Odoc_dag2html

    type !'a dag = {
    1. mutable dag : 'a node array;
    }
    and !'a node = {
    1. mutable pare : idag list;
    2. valu : 'a;
    3. mutable chil : idag list;
    }
    and idag = int
    val html_of_dag : string dag -> string
    val create_class_dag : + Odoc_info.Class.t_class list -> + Odoc_info.Class.t_class_type list -> + (Odoc_info.Name.t * Odoc_info.Class.cct option) dag
    diff --git a/ocaml/Odoc_dep/index.html b/ocaml/Odoc_dep/index.html new file mode 100644 index 0000000..5ac1a2d --- /dev/null +++ b/ocaml/Odoc_dep/index.html @@ -0,0 +1,5 @@ + +Odoc_dep (ocaml.Odoc_dep)

    Module Odoc_dep

    Top modules dependencies.

    val impl_dependencies : Parsetree.structure -> Misc.Stdlib.String.Set.elt list
    val intf_dependencies : Parsetree.signature -> Misc.Stdlib.String.Set.elt list
    val kernel_deps_of_modules : Odoc_module.t_module list -> unit
    val deps_of_types : + ?kernel:bool -> + Odoc_type.t_type list -> + (Odoc_type.t_type * Misc.Stdlib.String.Set.elt list) list
    diff --git a/ocaml/Odoc_dot/Generator/class-dot/index.html b/ocaml/Odoc_dot/Generator/class-dot/index.html new file mode 100644 index 0000000..494e2dd --- /dev/null +++ b/ocaml/Odoc_dot/Generator/class-dot/index.html @@ -0,0 +1,11 @@ + +dot (ocaml.Odoc_dot.Generator.dot)

    Class Generator.dot

    val mutable colors : string list
    val mutable loc_colors : (Odoc_info.Name.t * string) list
    val mutable modules : Odoc_info.Module.t_module list
    method generate : Odoc_info.Module.t_module list -> unit
    method generate_for_module : Format.formatter -> + Odoc_info.Module.t_module -> + unit
    method generate_for_type : Format.formatter -> + (Odoc_info.Type.t_type * Odoc_info.Name.t list) -> + unit
    method generate_modules : Odoc_info.Module.t_module list -> unit
    method generate_types : Odoc_info.Type.t_type list -> unit
    method get_one_color : string option
    method header : string
    method node_color : Odoc_info.Name.t -> string option
    method print_module_atts : Format.formatter -> + Odoc_info.Module.t_module -> + unit
    method print_one_dep : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.Name.t -> + unit
    method print_type_atts : Format.formatter -> Odoc_info.Type.t_type -> unit
    diff --git a/ocaml/Odoc_dot/Generator/index.html b/ocaml/Odoc_dot/Generator/index.html new file mode 100644 index 0000000..049290d --- /dev/null +++ b/ocaml/Odoc_dot/Generator/index.html @@ -0,0 +1,2 @@ + +Generator (ocaml.Odoc_dot.Generator)

    Module Odoc_dot.Generator

    class dot : object ... end
    diff --git a/ocaml/Odoc_dot/index.html b/ocaml/Odoc_dot/index.html new file mode 100644 index 0000000..74b2d42 --- /dev/null +++ b/ocaml/Odoc_dot/index.html @@ -0,0 +1,2 @@ + +Odoc_dot (ocaml.Odoc_dot)

    Module Odoc_dot

    Definition of a class which outputs a dot file showing top modules dependencies.

    val dot_include_all : bool ref
    val dot_types : bool ref
    val dot_reduce : bool ref
    val dot_colors : string list ref
    module Generator : sig ... end
    module type Dot_generator = sig ... end
    diff --git a/ocaml/Odoc_dot/module-type-Dot_generator/class-dot/index.html b/ocaml/Odoc_dot/module-type-Dot_generator/class-dot/index.html new file mode 100644 index 0000000..12b0dbe --- /dev/null +++ b/ocaml/Odoc_dot/module-type-Dot_generator/class-dot/index.html @@ -0,0 +1,11 @@ + +dot (ocaml.Odoc_dot.Dot_generator.dot)

    Class Dot_generator.dot

    val mutable colors : string list
    val mutable loc_colors : (Odoc_info.Name.t * string) list
    val mutable modules : Odoc_info.Module.t_module list
    method generate : Odoc_info.Module.t_module list -> unit
    method generate_for_module : Format.formatter -> + Odoc_info.Module.t_module -> + unit
    method generate_for_type : Format.formatter -> + (Odoc_info.Type.t_type * Odoc_info.Name.t list) -> + unit
    method generate_modules : Odoc_info.Module.t_module list -> unit
    method generate_types : Odoc_info.Type.t_type list -> unit
    method get_one_color : string option
    method header : string
    method node_color : Odoc_info.Name.t -> string option
    method print_module_atts : Format.formatter -> + Odoc_info.Module.t_module -> + unit
    method print_one_dep : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.Name.t -> + unit
    method print_type_atts : Format.formatter -> Odoc_info.Type.t_type -> unit
    diff --git a/ocaml/Odoc_dot/module-type-Dot_generator/index.html b/ocaml/Odoc_dot/module-type-Dot_generator/index.html new file mode 100644 index 0000000..e7203af --- /dev/null +++ b/ocaml/Odoc_dot/module-type-Dot_generator/index.html @@ -0,0 +1,2 @@ + +Dot_generator (ocaml.Odoc_dot.Dot_generator)

    Module type Odoc_dot.Dot_generator

    class dot : object ... end
    diff --git a/ocaml/Odoc_env/index.html b/ocaml/Odoc_env/index.html new file mode 100644 index 0000000..2016b11 --- /dev/null +++ b/ocaml/Odoc_env/index.html @@ -0,0 +1,2 @@ + +Odoc_env (ocaml.Odoc_env)

    Module Odoc_env

    type env
    val empty : env
    val add_signature : env -> string -> ?rel:string -> Types.signature -> env
    val add_extension : env -> Odoc_name.t -> env
    val add_type : env -> Odoc_name.t -> env
    val add_value : env -> Odoc_name.t -> env
    val add_module : env -> Odoc_name.t -> env
    val add_module_type : env -> Odoc_name.t -> env
    val add_class : env -> Odoc_name.t -> env
    val add_class_type : env -> Odoc_name.t -> env
    val full_module_name : env -> Odoc_name.t -> Odoc_name.t
    val full_module_type_name : env -> Odoc_name.t -> Odoc_name.t
    val full_module_or_module_type_name : env -> Odoc_name.t -> Odoc_name.t
    val full_type_name : env -> Odoc_name.t -> Odoc_name.t
    val full_value_name : env -> Odoc_name.t -> Odoc_name.t
    val full_extension_constructor_name : env -> Odoc_name.t -> Odoc_name.t
    val full_class_name : env -> Odoc_name.t -> Odoc_name.t
    val full_class_type_name : env -> Odoc_name.t -> Odoc_name.t
    val full_class_or_class_type_name : env -> Odoc_name.t -> Odoc_name.t
    val subst_type : env -> Types.type_expr -> Types.type_expr
    val subst_module_type : env -> Types.module_type -> Types.module_type
    val subst_class_type : env -> Types.class_type -> Types.class_type
    diff --git a/ocaml/Odoc_exception/index.html b/ocaml/Odoc_exception/index.html new file mode 100644 index 0000000..f995154 --- /dev/null +++ b/ocaml/Odoc_exception/index.html @@ -0,0 +1,2 @@ + +Odoc_exception (ocaml.Odoc_exception)

    Module Odoc_exception

    module Name = Odoc_name
    type exception_alias = {
    1. ea_name : Name.t;
    2. mutable ea_ex : t_exception option;
    }
    and t_exception = {
    1. ex_name : Name.t;
    2. mutable ex_info : Odoc_types.info option;
    3. ex_args : Odoc_type.constructor_args;
    4. ex_ret : Types.type_expr option;
    5. ex_alias : exception_alias option;
    6. mutable ex_loc : Odoc_types.location;
    7. mutable ex_code : string option;
    }
    diff --git a/ocaml/Odoc_extension/index.html b/ocaml/Odoc_extension/index.html new file mode 100644 index 0000000..242ea9b --- /dev/null +++ b/ocaml/Odoc_extension/index.html @@ -0,0 +1,2 @@ + +Odoc_extension (ocaml.Odoc_extension)

    Module Odoc_extension

    Representation and manipulation of type extensions.

    module Name = Odoc_name
    type private_flag = Asttypes.private_flag =
    1. | Private
    2. | Public
    type extension_alias = {
    1. xa_name : Name.t;
    2. mutable xa_xt : t_extension_constructor option;
    }
    and t_extension_constructor = {
    1. xt_name : Name.t;
    2. xt_args : Odoc_type.constructor_args;
    3. xt_ret : Types.type_expr option;
    4. xt_type_extension : t_type_extension;
    5. xt_alias : extension_alias option;
    6. mutable xt_loc : Odoc_types.location;
    7. mutable xt_text : Odoc_types.info option;
    }
    and t_type_extension = {
    1. mutable te_info : Odoc_types.info option;
    2. te_type_name : Name.t;
    3. te_type_parameters : Types.type_expr list;
    4. te_private : private_flag;
    5. mutable te_constructors : t_extension_constructor list;
    6. mutable te_loc : Odoc_types.location;
    7. mutable te_code : string option;
    }
    val extension_constructors : t_type_extension -> t_extension_constructor list
    diff --git a/ocaml/Odoc_gen/Base_generator/class-generator/index.html b/ocaml/Odoc_gen/Base_generator/class-generator/index.html new file mode 100644 index 0000000..e9faa19 --- /dev/null +++ b/ocaml/Odoc_gen/Base_generator/class-generator/index.html @@ -0,0 +1,2 @@ + +generator (ocaml.Odoc_gen.Base_generator.generator)

    Class Base_generator.generator

    method generate : Odoc_module.t_module list -> unit
    diff --git a/ocaml/Odoc_gen/Base_generator/index.html b/ocaml/Odoc_gen/Base_generator/index.html new file mode 100644 index 0000000..c972c05 --- /dev/null +++ b/ocaml/Odoc_gen/Base_generator/index.html @@ -0,0 +1,2 @@ + +Base_generator (ocaml.Odoc_gen.Base_generator)

    Module Odoc_gen.Base_generator

    diff --git a/ocaml/Odoc_gen/class-type-doc_generator/index.html b/ocaml/Odoc_gen/class-type-doc_generator/index.html new file mode 100644 index 0000000..b973eac --- /dev/null +++ b/ocaml/Odoc_gen/class-type-doc_generator/index.html @@ -0,0 +1,2 @@ + +doc_generator (ocaml.Odoc_gen.doc_generator)

    Class type Odoc_gen.doc_generator

    method generate : Odoc_module.t_module list -> unit
    diff --git a/ocaml/Odoc_gen/index.html b/ocaml/Odoc_gen/index.html new file mode 100644 index 0000000..738baac --- /dev/null +++ b/ocaml/Odoc_gen/index.html @@ -0,0 +1,12 @@ + +Odoc_gen (ocaml.Odoc_gen)

    Module Odoc_gen

    class type doc_generator = object ... end
    module type Base = sig ... end
    module type Base_functor = functor (_ : Base) -> Base
    type generator =
    1. | Html of (module Odoc_html.Html_generator)
    2. | Latex of (module Odoc_latex.Latex_generator)
    3. | Texi of (module Odoc_texi.Texi_generator)
    4. | Man of (module Odoc_man.Man_generator)
    5. | Dot of (module Odoc_dot.Dot_generator)
    6. | Base of (module Base)
    val get_minimal_generator : generator -> doc_generator
    diff --git a/ocaml/Odoc_gen/module-type-Base/class-generator/index.html b/ocaml/Odoc_gen/module-type-Base/class-generator/index.html new file mode 100644 index 0000000..d2e3c20 --- /dev/null +++ b/ocaml/Odoc_gen/module-type-Base/class-generator/index.html @@ -0,0 +1,2 @@ + +generator (ocaml.Odoc_gen.Base.generator)

    Class Base.generator

    method generate : Odoc_module.t_module list -> unit
    diff --git a/ocaml/Odoc_gen/module-type-Base/index.html b/ocaml/Odoc_gen/module-type-Base/index.html new file mode 100644 index 0000000..f3baf36 --- /dev/null +++ b/ocaml/Odoc_gen/module-type-Base/index.html @@ -0,0 +1,2 @@ + +Base (ocaml.Odoc_gen.Base)

    Module type Odoc_gen.Base

    diff --git a/ocaml/Odoc_gen/module-type-Base_functor/argument-1-_/class-generator/index.html b/ocaml/Odoc_gen/module-type-Base_functor/argument-1-_/class-generator/index.html new file mode 100644 index 0000000..178b194 --- /dev/null +++ b/ocaml/Odoc_gen/module-type-Base_functor/argument-1-_/class-generator/index.html @@ -0,0 +1,2 @@ + +generator (ocaml.Odoc_gen.Base_functor._.generator)

    Class _.generator

    method generate : Odoc_module.t_module list -> unit
    diff --git a/ocaml/Odoc_gen/module-type-Base_functor/argument-1-_/index.html b/ocaml/Odoc_gen/module-type-Base_functor/argument-1-_/index.html new file mode 100644 index 0000000..beecb48 --- /dev/null +++ b/ocaml/Odoc_gen/module-type-Base_functor/argument-1-_/index.html @@ -0,0 +1,2 @@ + +_ (ocaml.Odoc_gen.Base_functor._)

    Parameter Base_functor._

    diff --git a/ocaml/Odoc_gen/module-type-Base_functor/class-generator/index.html b/ocaml/Odoc_gen/module-type-Base_functor/class-generator/index.html new file mode 100644 index 0000000..97b54d3 --- /dev/null +++ b/ocaml/Odoc_gen/module-type-Base_functor/class-generator/index.html @@ -0,0 +1,2 @@ + +generator (ocaml.Odoc_gen.Base_functor.generator)

    Class Base_functor.generator

    method generate : Odoc_module.t_module list -> unit
    diff --git a/ocaml/Odoc_gen/module-type-Base_functor/index.html b/ocaml/Odoc_gen/module-type-Base_functor/index.html new file mode 100644 index 0000000..9de3a42 --- /dev/null +++ b/ocaml/Odoc_gen/module-type-Base_functor/index.html @@ -0,0 +1,2 @@ + +Base_functor (ocaml.Odoc_gen.Base_functor)

    Module type Odoc_gen.Base_functor

    Parameters

    module _ : Base

    Signature

    diff --git a/ocaml/Odoc_gen/module-type-Dot_functor/argument-1-_/class-dot/index.html b/ocaml/Odoc_gen/module-type-Dot_functor/argument-1-_/class-dot/index.html new file mode 100644 index 0000000..caea685 --- /dev/null +++ b/ocaml/Odoc_gen/module-type-Dot_functor/argument-1-_/class-dot/index.html @@ -0,0 +1,11 @@ + +dot (ocaml.Odoc_gen.Dot_functor._.dot)

    Class _.dot

    val mutable colors : string list
    val mutable loc_colors : (Odoc_info.Name.t * string) list
    val mutable modules : Odoc_info.Module.t_module list
    method generate : Odoc_info.Module.t_module list -> unit
    method generate_for_module : Format.formatter -> + Odoc_info.Module.t_module -> + unit
    method generate_for_type : Format.formatter -> + (Odoc_info.Type.t_type * Odoc_info.Name.t list) -> + unit
    method generate_modules : Odoc_info.Module.t_module list -> unit
    method generate_types : Odoc_info.Type.t_type list -> unit
    method get_one_color : string option
    method header : string
    method node_color : Odoc_info.Name.t -> string option
    method print_module_atts : Format.formatter -> + Odoc_info.Module.t_module -> + unit
    method print_one_dep : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.Name.t -> + unit
    method print_type_atts : Format.formatter -> Odoc_info.Type.t_type -> unit
    diff --git a/ocaml/Odoc_gen/module-type-Dot_functor/argument-1-_/index.html b/ocaml/Odoc_gen/module-type-Dot_functor/argument-1-_/index.html new file mode 100644 index 0000000..287fb77 --- /dev/null +++ b/ocaml/Odoc_gen/module-type-Dot_functor/argument-1-_/index.html @@ -0,0 +1,2 @@ + +_ (ocaml.Odoc_gen.Dot_functor._)

    Parameter Dot_functor._

    class dot : object ... end
    diff --git a/ocaml/Odoc_gen/module-type-Dot_functor/class-dot/index.html b/ocaml/Odoc_gen/module-type-Dot_functor/class-dot/index.html new file mode 100644 index 0000000..528076f --- /dev/null +++ b/ocaml/Odoc_gen/module-type-Dot_functor/class-dot/index.html @@ -0,0 +1,11 @@ + +dot (ocaml.Odoc_gen.Dot_functor.dot)

    Class Dot_functor.dot

    val mutable colors : string list
    val mutable loc_colors : (Odoc_info.Name.t * string) list
    val mutable modules : Odoc_info.Module.t_module list
    method generate : Odoc_info.Module.t_module list -> unit
    method generate_for_module : Format.formatter -> + Odoc_info.Module.t_module -> + unit
    method generate_for_type : Format.formatter -> + (Odoc_info.Type.t_type * Odoc_info.Name.t list) -> + unit
    method generate_modules : Odoc_info.Module.t_module list -> unit
    method generate_types : Odoc_info.Type.t_type list -> unit
    method get_one_color : string option
    method header : string
    method node_color : Odoc_info.Name.t -> string option
    method print_module_atts : Format.formatter -> + Odoc_info.Module.t_module -> + unit
    method print_one_dep : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.Name.t -> + unit
    method print_type_atts : Format.formatter -> Odoc_info.Type.t_type -> unit
    diff --git a/ocaml/Odoc_gen/module-type-Dot_functor/index.html b/ocaml/Odoc_gen/module-type-Dot_functor/index.html new file mode 100644 index 0000000..c22e649 --- /dev/null +++ b/ocaml/Odoc_gen/module-type-Dot_functor/index.html @@ -0,0 +1,2 @@ + +Dot_functor (ocaml.Odoc_gen.Dot_functor)

    Module type Odoc_gen.Dot_functor

    Parameters

    module _ : Odoc_dot.Dot_generator

    Signature

    class dot : object ... end
    diff --git a/ocaml/Odoc_gen/module-type-Html_functor/argument-1-_/class-html/index.html b/ocaml/Odoc_gen/module-type-Html_functor/argument-1-_/class-html/index.html new file mode 100644 index 0000000..3be913b --- /dev/null +++ b/ocaml/Odoc_gen/module-type-Html_functor/argument-1-_/class-html/index.html @@ -0,0 +1,166 @@ + +html (ocaml.Odoc_gen.Html_functor._.html)

    Class _.html

    val mutable default_style_options : string list
    val mutable doctype : string
    val mutable header : Buffer.t -> + ?nav: + (Odoc_info.Name.t option * Odoc_info.Name.t option * Odoc_info.Name.t) + option -> + ?comments:Odoc_info.text list -> + string -> + unit
    val mutable known_classes_names : Odoc_html.String.Set.t
    val mutable known_modules_names : Odoc_html.String.Set.t
    val mutable known_types_names : Odoc_html.String.Set.t
    val mutable list_attributes : Odoc_info.Value.t_attribute list
    val mutable list_class_types : Odoc_info.Class.t_class_type list
    val mutable list_classes : Odoc_info.Class.t_class list
    val mutable list_exceptions : Odoc_info.Exception.t_exception list
    val mutable list_extensions : Odoc_info.Extension.t_extension_constructor list
    val mutable list_methods : Odoc_info.Value.t_method list
    val mutable list_module_types : Odoc_info.Module.t_module_type list
    val mutable list_modules : Odoc_info.Module.t_module list
    val mutable list_types : Odoc_info.Type.t_type list
    val mutable list_values : Odoc_info.Value.t_value list
    val mutable style : string
    val mutable style_file : string
    val mutable tag_functions : (string * (Odoc_info.text -> string)) list
    method character_encoding : Buffer.t -> unit
    method constructor : string -> string
    method create_title_label : (int * string option * Odoc_info.text) -> string
    method escape : string -> string
    method generate : Odoc_info.Module.t_module list -> unit
    method generate_attributes_index : Odoc_info.Module.t_module list -> unit
    method generate_class_inheritance_info : Buffer.t -> + Odoc_info.Class.t_class -> + unit
    method generate_class_type_inheritance_info : Buffer.t -> + Odoc_info.Class.t_class_type -> + unit
    method generate_class_types_index : Odoc_info.Module.t_module list -> unit
    method generate_classes_index : Odoc_info.Module.t_module list -> unit
    method generate_elements : ('a option -> 'a option -> 'a -> unit) -> + 'a list -> + unit
    method generate_elements_index : ?strip_libname:bool -> + 'a list -> + ('a -> Odoc_info.Name.t) -> + ('a -> Odoc_info.info option) -> + ('a -> string) -> + string -> + string -> + unit
    method generate_exceptions_index : Odoc_info.Module.t_module list -> unit
    method generate_extensions_index : Odoc_info.Module.t_module list -> unit
    method generate_for_class : Odoc_info.Class.t_class option -> + Odoc_info.Class.t_class option -> + Odoc_info.Class.t_class -> + unit
    method generate_for_class_type : Odoc_info.Class.t_class_type option -> + Odoc_info.Class.t_class_type option -> + Odoc_info.Class.t_class_type -> + unit
    method generate_for_module : Odoc_info.Module.t_module option -> + Odoc_info.Module.t_module option -> + Odoc_info.Module.t_module -> + unit
    method generate_for_module_type : Odoc_info.Module.t_module_type option -> + Odoc_info.Module.t_module_type option -> + Odoc_info.Module.t_module_type -> + unit
    method generate_index : Odoc_info.Module.t_module list -> unit
    method generate_inheritance_info : Buffer.t -> + Odoc_info.Class.inherited_class list -> + unit
    method generate_methods_index : Odoc_info.Module.t_module list -> unit
    method generate_module_types_index : Odoc_info.Module.t_module list -> unit
    method generate_modules_index : Odoc_info.Module.t_module list -> unit
    method generate_types_index : Odoc_info.Module.t_module list -> unit
    method generate_values_index : Odoc_info.Module.t_module list -> unit
    method html_of_Block : Buffer.t -> Odoc_info.text -> unit
    method html_of_Bold : Buffer.t -> Odoc_info.text -> unit
    method html_of_Center : Buffer.t -> Odoc_info.text -> unit
    method html_of_Code : Buffer.t -> string -> unit
    method html_of_CodePre : Buffer.t -> string -> unit
    method html_of_Emphasize : Buffer.t -> Odoc_info.text -> unit
    method html_of_Enum : Buffer.t -> Odoc_info.text list -> unit
    method html_of_Index_list : Buffer.t -> unit
    method html_of_Italic : Buffer.t -> Odoc_info.text -> unit
    method html_of_Latex : Buffer.t -> string -> unit
    method html_of_Left : Buffer.t -> Odoc_info.text -> unit
    method html_of_List : Buffer.t -> Odoc_info.text list -> unit
    method html_of_Module_list : Buffer.t -> Odoc_info.Name.t list -> unit
    method html_of_Newline : Buffer.t -> unit
    method html_of_Raw : Buffer.t -> string -> unit
    method html_of_Ref : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.ref_kind option -> + Odoc_info.text option -> + unit
    method html_of_Right : Buffer.t -> Odoc_info.text -> unit
    method html_of_Subscript : Buffer.t -> Odoc_info.text -> unit
    method html_of_Superscript : Buffer.t -> Odoc_info.text -> unit
    method html_of_Target : Buffer.t -> target:string -> code:string -> unit
    method html_of_Title : Buffer.t -> + int -> + string option -> + Odoc_info.text -> + unit
    method html_of_Verbatim : Buffer.t -> string -> unit
    method html_of_alerts : Buffer.t -> Odoc_info.alert list -> unit
    method html_of_attribute : Buffer.t -> Odoc_info.Value.t_attribute -> unit
    method html_of_author_list : Buffer.t -> string list -> unit
    method html_of_before : Buffer.t -> (string * Odoc_info.text) list -> unit
    method html_of_class : Buffer.t -> + ?complete:bool -> + ?with_link:bool -> + Odoc_info.Class.t_class -> + unit
    method html_of_class_comment : Buffer.t -> Odoc_info.text -> unit
    method html_of_class_element : Buffer.t -> + Odoc_info.Class.class_element -> + unit
    method html_of_class_kind : Buffer.t -> + Odoc_info.Name.t -> + ?cl:Odoc_info.Class.t_class -> + Odoc_info.Class.class_kind -> + unit
    method html_of_class_parameter_list : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Class.t_class -> + unit
    method html_of_class_type : Buffer.t -> + ?complete:bool -> + ?with_link:bool -> + Odoc_info.Class.t_class_type -> + unit
    method html_of_class_type_kind : Buffer.t -> + Odoc_info.Name.t -> + ?ct:Odoc_info.Class.t_class_type -> + Odoc_info.Class.class_type_kind -> + unit
    method html_of_class_type_param_expr_list : Buffer.t -> + Odoc_info.Name.t -> + Types.type_expr list -> + unit
    method html_of_code : Buffer.t -> ?with_pre:bool -> string -> unit
    method html_of_cstr_args : ?par:bool -> + Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Name.t -> + string -> + Odoc_info.Type.constructor_args -> + unit
    method html_of_custom : Buffer.t -> (string * Odoc_info.text) list -> unit
    method html_of_custom_text : Buffer.t -> string -> Odoc_info.text -> unit
    method html_of_dag : (Odoc_info.Name.t * Odoc_info.Class.cct option) + Odoc_dag2html.dag -> + string
    method html_of_described_parameter_list : Buffer.t -> + Odoc_info.Name.t -> + Odoc_parameter.parameter list -> + unit
    method html_of_exception : Buffer.t -> Odoc_info.Exception.t_exception -> unit
    method html_of_included_module : Buffer.t -> + Odoc_info.Module.included_module -> + unit
    method html_of_info : ?cls:string -> + ?indent:bool -> + Buffer.t -> + Odoc_types.info option -> + unit
    method html_of_info_first_sentence : Buffer.t -> Odoc_info.info option -> unit
    method html_of_method : Buffer.t -> Odoc_info.Value.t_method -> unit
    method html_of_modtype : Buffer.t -> + ?info:bool -> + ?complete:bool -> + ?with_link:bool -> + Odoc_info.Module.t_module_type -> + unit
    method html_of_module : Buffer.t -> + ?info:bool -> + ?complete:bool -> + ?with_link:bool -> + Odoc_info.Module.t_module -> + unit
    method html_of_module_comment : Buffer.t -> Odoc_info.text -> unit
    method html_of_module_element : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Module.module_element -> + unit
    method html_of_module_kind : Buffer.t -> + Odoc_info.Name.t -> + ?modu:Odoc_info.Module.t_module -> + Odoc_info.Module.module_kind -> + unit
    method html_of_module_parameter : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Module.module_parameter -> + unit
    method html_of_module_parameter_list : Buffer.t -> + Odoc_info.Name.t -> + (Odoc_info.Module.module_parameter * Odoc_info.text option) list -> + unit
    method html_of_module_parameter_type : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Module.module_parameter -> + unit
    method html_of_module_type : Buffer.t -> + ?code:string -> + Odoc_info.Name.t -> + Types.module_type -> + unit
    method html_of_module_type_kind : Buffer.t -> + Odoc_info.Name.t -> + ?modu:Odoc_info.Module.t_module -> + ?mt:Odoc_info.Module.t_module_type -> + Odoc_info.Module.module_type_kind -> + unit
    method html_of_parameter_description : Buffer.t -> + Odoc_info.Parameter.parameter -> + unit
    method html_of_parameter_list : Buffer.t -> + Odoc_info.Name.t -> + Odoc_parameter.parameter list -> + unit
    method html_of_raised_exceptions : Buffer.t -> + (string * Odoc_info.text) list -> + unit
    method html_of_record : father:Odoc_info.Name.t -> + close_env:string -> + (Odoc_info.Type.record_field -> string) -> + Buffer.t -> + Odoc_info.Type.record_field list -> + unit
    method html_of_return_opt : Buffer.t -> Odoc_info.text option -> unit
    method html_of_see : Buffer.t -> (Odoc_info.see_ref * Odoc_info.text) -> unit
    method html_of_sees : Buffer.t -> + (Odoc_info.see_ref * Odoc_info.text) list -> + unit
    method html_of_since_opt : Buffer.t -> string option -> unit
    method html_of_text : ?with_p:bool -> Buffer.t -> Odoc_info.text -> unit
    method html_of_text_element : Buffer.t -> Odoc_info.text_element -> unit
    method html_of_text_with_p : Buffer.t -> Odoc_info.text -> unit
    method html_of_type : Buffer.t -> Odoc_info.Type.t_type -> unit
    method html_of_type_expr : Buffer.t -> + Odoc_info.Name.t -> + Types.type_expr -> + unit
    method html_of_type_expr_param_list : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Type.t_type -> + unit
    method html_of_type_extension : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Extension.t_type_extension -> + unit
    method html_of_value : Buffer.t -> Odoc_info.Value.t_value -> unit
    method html_of_version_opt : Buffer.t -> string option -> unit
    method index : string
    method index_attributes : string
    method index_class_types : string
    method index_classes : string
    method index_exceptions : string
    method index_extensions : string
    method index_methods : string
    method index_module_types : string
    method index_modules : string
    method index_prefix : string
    method index_types : string
    method index_values : string
    method init_style : unit
    method inner_title : Odoc_info.Name.t -> string
    method keep_alpha_num : string -> string
    method keyword : string -> string
    method label_of_text : Odoc_info.text -> string
    method list_attributes : Odoc_info.Value.t_attribute list
    method list_class_types : Odoc_info.Class.t_class_type list
    method list_classes : Odoc_info.Class.t_class list
    method list_exceptions : Odoc_info.Exception.t_exception list
    method list_extensions : Odoc_info.Extension.t_extension_constructor list
    method list_methods : Odoc_info.Value.t_method list
    method list_module_types : Odoc_info.Module.t_module_type list
    method list_modules : Odoc_info.Module.t_module list
    method list_types : Odoc_info.Type.t_type list
    method list_values : Odoc_info.Value.t_value list
    method meta : Buffer.t -> unit
    method output_class_type : Odoc_info.Name.t -> + string -> + Types.class_type -> + unit
    method private output_code : ?with_pre:bool -> + Odoc_info.Name.t -> + string -> + string -> + unit
    method output_module_type : Odoc_info.Name.t -> + string -> + Types.module_type -> + unit
    method prepare_header : Odoc_info.Module.t_module list -> unit
    method print_header : Buffer.t -> + ?nav: + (Odoc_info.Name.t option * Odoc_info.Name.t option * Odoc_info.Name.t) + option -> + ?comments:Odoc_info.text list -> + string -> + unit
    method print_navbar : Buffer.t -> + Odoc_info.Name.t option -> + Odoc_info.Name.t option -> + Odoc_info.Name.t -> + unit
    method title : string
    diff --git a/ocaml/Odoc_gen/module-type-Html_functor/argument-1-_/index.html b/ocaml/Odoc_gen/module-type-Html_functor/argument-1-_/index.html new file mode 100644 index 0000000..9d937ae --- /dev/null +++ b/ocaml/Odoc_gen/module-type-Html_functor/argument-1-_/index.html @@ -0,0 +1,2 @@ + +_ (ocaml.Odoc_gen.Html_functor._)

    Parameter Html_functor._

    class html : object ... end
    diff --git a/ocaml/Odoc_gen/module-type-Html_functor/class-html/index.html b/ocaml/Odoc_gen/module-type-Html_functor/class-html/index.html new file mode 100644 index 0000000..797168b --- /dev/null +++ b/ocaml/Odoc_gen/module-type-Html_functor/class-html/index.html @@ -0,0 +1,166 @@ + +html (ocaml.Odoc_gen.Html_functor.html)

    Class Html_functor.html

    val mutable default_style_options : string list
    val mutable doctype : string
    val mutable header : Buffer.t -> + ?nav: + (Odoc_info.Name.t option * Odoc_info.Name.t option * Odoc_info.Name.t) + option -> + ?comments:Odoc_info.text list -> + string -> + unit
    val mutable known_classes_names : Odoc_html.String.Set.t
    val mutable known_modules_names : Odoc_html.String.Set.t
    val mutable known_types_names : Odoc_html.String.Set.t
    val mutable list_attributes : Odoc_info.Value.t_attribute list
    val mutable list_class_types : Odoc_info.Class.t_class_type list
    val mutable list_classes : Odoc_info.Class.t_class list
    val mutable list_exceptions : Odoc_info.Exception.t_exception list
    val mutable list_extensions : Odoc_info.Extension.t_extension_constructor list
    val mutable list_methods : Odoc_info.Value.t_method list
    val mutable list_module_types : Odoc_info.Module.t_module_type list
    val mutable list_modules : Odoc_info.Module.t_module list
    val mutable list_types : Odoc_info.Type.t_type list
    val mutable list_values : Odoc_info.Value.t_value list
    val mutable style : string
    val mutable style_file : string
    val mutable tag_functions : (string * (Odoc_info.text -> string)) list
    method character_encoding : Buffer.t -> unit
    method constructor : string -> string
    method create_title_label : (int * string option * Odoc_info.text) -> string
    method escape : string -> string
    method generate : Odoc_info.Module.t_module list -> unit
    method generate_attributes_index : Odoc_info.Module.t_module list -> unit
    method generate_class_inheritance_info : Buffer.t -> + Odoc_info.Class.t_class -> + unit
    method generate_class_type_inheritance_info : Buffer.t -> + Odoc_info.Class.t_class_type -> + unit
    method generate_class_types_index : Odoc_info.Module.t_module list -> unit
    method generate_classes_index : Odoc_info.Module.t_module list -> unit
    method generate_elements : ('a option -> 'a option -> 'a -> unit) -> + 'a list -> + unit
    method generate_elements_index : ?strip_libname:bool -> + 'a list -> + ('a -> Odoc_info.Name.t) -> + ('a -> Odoc_info.info option) -> + ('a -> string) -> + string -> + string -> + unit
    method generate_exceptions_index : Odoc_info.Module.t_module list -> unit
    method generate_extensions_index : Odoc_info.Module.t_module list -> unit
    method generate_for_class : Odoc_info.Class.t_class option -> + Odoc_info.Class.t_class option -> + Odoc_info.Class.t_class -> + unit
    method generate_for_class_type : Odoc_info.Class.t_class_type option -> + Odoc_info.Class.t_class_type option -> + Odoc_info.Class.t_class_type -> + unit
    method generate_for_module : Odoc_info.Module.t_module option -> + Odoc_info.Module.t_module option -> + Odoc_info.Module.t_module -> + unit
    method generate_for_module_type : Odoc_info.Module.t_module_type option -> + Odoc_info.Module.t_module_type option -> + Odoc_info.Module.t_module_type -> + unit
    method generate_index : Odoc_info.Module.t_module list -> unit
    method generate_inheritance_info : Buffer.t -> + Odoc_info.Class.inherited_class list -> + unit
    method generate_methods_index : Odoc_info.Module.t_module list -> unit
    method generate_module_types_index : Odoc_info.Module.t_module list -> unit
    method generate_modules_index : Odoc_info.Module.t_module list -> unit
    method generate_types_index : Odoc_info.Module.t_module list -> unit
    method generate_values_index : Odoc_info.Module.t_module list -> unit
    method html_of_Block : Buffer.t -> Odoc_info.text -> unit
    method html_of_Bold : Buffer.t -> Odoc_info.text -> unit
    method html_of_Center : Buffer.t -> Odoc_info.text -> unit
    method html_of_Code : Buffer.t -> string -> unit
    method html_of_CodePre : Buffer.t -> string -> unit
    method html_of_Emphasize : Buffer.t -> Odoc_info.text -> unit
    method html_of_Enum : Buffer.t -> Odoc_info.text list -> unit
    method html_of_Index_list : Buffer.t -> unit
    method html_of_Italic : Buffer.t -> Odoc_info.text -> unit
    method html_of_Latex : Buffer.t -> string -> unit
    method html_of_Left : Buffer.t -> Odoc_info.text -> unit
    method html_of_List : Buffer.t -> Odoc_info.text list -> unit
    method html_of_Module_list : Buffer.t -> Odoc_info.Name.t list -> unit
    method html_of_Newline : Buffer.t -> unit
    method html_of_Raw : Buffer.t -> string -> unit
    method html_of_Ref : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.ref_kind option -> + Odoc_info.text option -> + unit
    method html_of_Right : Buffer.t -> Odoc_info.text -> unit
    method html_of_Subscript : Buffer.t -> Odoc_info.text -> unit
    method html_of_Superscript : Buffer.t -> Odoc_info.text -> unit
    method html_of_Target : Buffer.t -> target:string -> code:string -> unit
    method html_of_Title : Buffer.t -> + int -> + string option -> + Odoc_info.text -> + unit
    method html_of_Verbatim : Buffer.t -> string -> unit
    method html_of_alerts : Buffer.t -> Odoc_info.alert list -> unit
    method html_of_attribute : Buffer.t -> Odoc_info.Value.t_attribute -> unit
    method html_of_author_list : Buffer.t -> string list -> unit
    method html_of_before : Buffer.t -> (string * Odoc_info.text) list -> unit
    method html_of_class : Buffer.t -> + ?complete:bool -> + ?with_link:bool -> + Odoc_info.Class.t_class -> + unit
    method html_of_class_comment : Buffer.t -> Odoc_info.text -> unit
    method html_of_class_element : Buffer.t -> + Odoc_info.Class.class_element -> + unit
    method html_of_class_kind : Buffer.t -> + Odoc_info.Name.t -> + ?cl:Odoc_info.Class.t_class -> + Odoc_info.Class.class_kind -> + unit
    method html_of_class_parameter_list : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Class.t_class -> + unit
    method html_of_class_type : Buffer.t -> + ?complete:bool -> + ?with_link:bool -> + Odoc_info.Class.t_class_type -> + unit
    method html_of_class_type_kind : Buffer.t -> + Odoc_info.Name.t -> + ?ct:Odoc_info.Class.t_class_type -> + Odoc_info.Class.class_type_kind -> + unit
    method html_of_class_type_param_expr_list : Buffer.t -> + Odoc_info.Name.t -> + Types.type_expr list -> + unit
    method html_of_code : Buffer.t -> ?with_pre:bool -> string -> unit
    method html_of_cstr_args : ?par:bool -> + Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Name.t -> + string -> + Odoc_info.Type.constructor_args -> + unit
    method html_of_custom : Buffer.t -> (string * Odoc_info.text) list -> unit
    method html_of_custom_text : Buffer.t -> string -> Odoc_info.text -> unit
    method html_of_dag : (Odoc_info.Name.t * Odoc_info.Class.cct option) + Odoc_dag2html.dag -> + string
    method html_of_described_parameter_list : Buffer.t -> + Odoc_info.Name.t -> + Odoc_parameter.parameter list -> + unit
    method html_of_exception : Buffer.t -> Odoc_info.Exception.t_exception -> unit
    method html_of_included_module : Buffer.t -> + Odoc_info.Module.included_module -> + unit
    method html_of_info : ?cls:string -> + ?indent:bool -> + Buffer.t -> + Odoc_types.info option -> + unit
    method html_of_info_first_sentence : Buffer.t -> Odoc_info.info option -> unit
    method html_of_method : Buffer.t -> Odoc_info.Value.t_method -> unit
    method html_of_modtype : Buffer.t -> + ?info:bool -> + ?complete:bool -> + ?with_link:bool -> + Odoc_info.Module.t_module_type -> + unit
    method html_of_module : Buffer.t -> + ?info:bool -> + ?complete:bool -> + ?with_link:bool -> + Odoc_info.Module.t_module -> + unit
    method html_of_module_comment : Buffer.t -> Odoc_info.text -> unit
    method html_of_module_element : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Module.module_element -> + unit
    method html_of_module_kind : Buffer.t -> + Odoc_info.Name.t -> + ?modu:Odoc_info.Module.t_module -> + Odoc_info.Module.module_kind -> + unit
    method html_of_module_parameter : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Module.module_parameter -> + unit
    method html_of_module_parameter_list : Buffer.t -> + Odoc_info.Name.t -> + (Odoc_info.Module.module_parameter * Odoc_info.text option) list -> + unit
    method html_of_module_parameter_type : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Module.module_parameter -> + unit
    method html_of_module_type : Buffer.t -> + ?code:string -> + Odoc_info.Name.t -> + Types.module_type -> + unit
    method html_of_module_type_kind : Buffer.t -> + Odoc_info.Name.t -> + ?modu:Odoc_info.Module.t_module -> + ?mt:Odoc_info.Module.t_module_type -> + Odoc_info.Module.module_type_kind -> + unit
    method html_of_parameter_description : Buffer.t -> + Odoc_info.Parameter.parameter -> + unit
    method html_of_parameter_list : Buffer.t -> + Odoc_info.Name.t -> + Odoc_parameter.parameter list -> + unit
    method html_of_raised_exceptions : Buffer.t -> + (string * Odoc_info.text) list -> + unit
    method html_of_record : father:Odoc_info.Name.t -> + close_env:string -> + (Odoc_info.Type.record_field -> string) -> + Buffer.t -> + Odoc_info.Type.record_field list -> + unit
    method html_of_return_opt : Buffer.t -> Odoc_info.text option -> unit
    method html_of_see : Buffer.t -> (Odoc_info.see_ref * Odoc_info.text) -> unit
    method html_of_sees : Buffer.t -> + (Odoc_info.see_ref * Odoc_info.text) list -> + unit
    method html_of_since_opt : Buffer.t -> string option -> unit
    method html_of_text : ?with_p:bool -> Buffer.t -> Odoc_info.text -> unit
    method html_of_text_element : Buffer.t -> Odoc_info.text_element -> unit
    method html_of_text_with_p : Buffer.t -> Odoc_info.text -> unit
    method html_of_type : Buffer.t -> Odoc_info.Type.t_type -> unit
    method html_of_type_expr : Buffer.t -> + Odoc_info.Name.t -> + Types.type_expr -> + unit
    method html_of_type_expr_param_list : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Type.t_type -> + unit
    method html_of_type_extension : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Extension.t_type_extension -> + unit
    method html_of_value : Buffer.t -> Odoc_info.Value.t_value -> unit
    method html_of_version_opt : Buffer.t -> string option -> unit
    method index : string
    method index_attributes : string
    method index_class_types : string
    method index_classes : string
    method index_exceptions : string
    method index_extensions : string
    method index_methods : string
    method index_module_types : string
    method index_modules : string
    method index_prefix : string
    method index_types : string
    method index_values : string
    method init_style : unit
    method inner_title : Odoc_info.Name.t -> string
    method keep_alpha_num : string -> string
    method keyword : string -> string
    method label_of_text : Odoc_info.text -> string
    method list_attributes : Odoc_info.Value.t_attribute list
    method list_class_types : Odoc_info.Class.t_class_type list
    method list_classes : Odoc_info.Class.t_class list
    method list_exceptions : Odoc_info.Exception.t_exception list
    method list_extensions : Odoc_info.Extension.t_extension_constructor list
    method list_methods : Odoc_info.Value.t_method list
    method list_module_types : Odoc_info.Module.t_module_type list
    method list_modules : Odoc_info.Module.t_module list
    method list_types : Odoc_info.Type.t_type list
    method list_values : Odoc_info.Value.t_value list
    method meta : Buffer.t -> unit
    method output_class_type : Odoc_info.Name.t -> + string -> + Types.class_type -> + unit
    method private output_code : ?with_pre:bool -> + Odoc_info.Name.t -> + string -> + string -> + unit
    method output_module_type : Odoc_info.Name.t -> + string -> + Types.module_type -> + unit
    method prepare_header : Odoc_info.Module.t_module list -> unit
    method print_header : Buffer.t -> + ?nav: + (Odoc_info.Name.t option * Odoc_info.Name.t option * Odoc_info.Name.t) + option -> + ?comments:Odoc_info.text list -> + string -> + unit
    method print_navbar : Buffer.t -> + Odoc_info.Name.t option -> + Odoc_info.Name.t option -> + Odoc_info.Name.t -> + unit
    method title : string
    diff --git a/ocaml/Odoc_gen/module-type-Html_functor/index.html b/ocaml/Odoc_gen/module-type-Html_functor/index.html new file mode 100644 index 0000000..ba84715 --- /dev/null +++ b/ocaml/Odoc_gen/module-type-Html_functor/index.html @@ -0,0 +1,2 @@ + +Html_functor (ocaml.Odoc_gen.Html_functor)

    Module type Odoc_gen.Html_functor

    Parameters

    module _ : Odoc_html.Html_generator

    Signature

    class html : object ... end
    diff --git a/ocaml/Odoc_gen/module-type-Latex_functor/argument-1-_/class-latex/index.html b/ocaml/Odoc_gen/module-type-Latex_functor/argument-1-_/class-latex/index.html new file mode 100644 index 0000000..71fc46e --- /dev/null +++ b/ocaml/Odoc_gen/module-type-Latex_functor/argument-1-_/class-latex/index.html @@ -0,0 +1,140 @@ + +latex (ocaml.Odoc_gen.Latex_functor._.latex)

    Class _.latex

    val subst_strings : (Str.regexp * string) list
    val subst_strings_code : (Str.regexp * string) list
    val subst_strings_simple : (Str.regexp * string) list
    val mutable tag_functions : (string * (Odoc_info.text -> Odoc_info.text)) list
    method attribute_label : ?no_:bool -> Odoc_info.Name.t -> string
    method class_label : ?no_:bool -> Odoc_info.Name.t -> string
    method class_type_label : ?no_:bool -> Odoc_info.Name.t -> string
    method const_label : ?no_:bool -> Odoc_info.Name.t -> string
    method entry_comment : (Format.formatter * (unit -> string)) -> + Odoc_info.info option -> + Odoc_info.text_element list
    method escape : string -> string
    method escape_code : string -> string
    method escape_simple : string -> string
    method exception_label : ?no_:bool -> Odoc_info.Name.t -> string
    method extension_label : ?no_:bool -> Odoc_info.Name.t -> string
    method first_and_rest_of_info : Odoc_info.info option -> + Odoc_info.text * Odoc_info.text
    method generate : Odoc_info.Module.t_module list -> unit
    method generate_class_inheritance_info : Format.formatter -> + Odoc_info.Class.t_class -> + unit
    method generate_class_type_inheritance_info : Format.formatter -> + Odoc_info.Class.t_class_type -> + unit
    method generate_for_top_module : Format.formatter -> + Odoc_info.Module.t_module -> + unit
    method generate_inheritance_info : Format.formatter -> + Odoc_info.Class.inherited_class list -> + unit
    method generate_style_file : unit
    method label : ?no_:bool -> Odoc_info.Name.t -> string
    method latex_for_class_index : Format.formatter -> + Odoc_info.Class.t_class -> + unit
    method latex_for_class_label : Format.formatter -> + Odoc_info.Class.t_class -> + unit
    method latex_for_class_type_index : Format.formatter -> + Odoc_info.Class.t_class_type -> + unit
    method latex_for_class_type_label : Format.formatter -> + Odoc_info.Class.t_class_type -> + unit
    method latex_for_module_index : Format.formatter -> + Odoc_info.Module.t_module -> + unit
    method latex_for_module_label : Format.formatter -> + Odoc_info.Module.t_module -> + unit
    method latex_for_module_type_index : Format.formatter -> + Odoc_info.Module.t_module_type -> + unit
    method latex_for_module_type_label : Format.formatter -> + Odoc_info.Module.t_module_type -> + unit
    method latex_header : Format.formatter -> + Odoc_info.Module.t_module list -> + unit
    method latex_of_Block : Format.formatter -> Odoc_info.text -> unit
    method latex_of_Bold : Format.formatter -> Odoc_info.text -> unit
    method latex_of_Center : Format.formatter -> Odoc_info.text -> unit
    method latex_of_Code : Format.formatter -> string -> unit
    method latex_of_CodePre : Format.formatter -> string -> unit
    method latex_of_Emphasize : Format.formatter -> Odoc_info.text -> unit
    method latex_of_Enum : Format.formatter -> Odoc_info.text list -> unit
    method latex_of_Italic : Format.formatter -> Odoc_info.text -> unit
    method latex_of_Latex : Format.formatter -> string -> unit
    method latex_of_Left : Format.formatter -> Odoc_info.text -> unit
    method latex_of_List : Format.formatter -> Odoc_info.text list -> unit
    method latex_of_Newline : Format.formatter -> unit
    method latex_of_Raw : Format.formatter -> string -> unit
    method latex_of_Ref : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.ref_kind option -> + Odoc_info.text option -> + unit
    method latex_of_Right : Format.formatter -> Odoc_info.text -> unit
    method latex_of_Subscript : Format.formatter -> Odoc_info.text -> unit
    method latex_of_Superscript : Format.formatter -> Odoc_info.text -> unit
    method latex_of_Target : Format.formatter -> + target:string -> + code:string -> + unit
    method latex_of_Title : Format.formatter -> + int -> + Odoc_info.Name.t option -> + Odoc_info.text -> + unit
    method latex_of_Verbatim : Format.formatter -> string -> unit
    method latex_of_attribute : Format.formatter -> + Odoc_info.Value.t_attribute -> + unit
    method latex_of_class : Format.formatter -> Odoc_info.Class.t_class -> unit
    method latex_of_class_element : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.Class.class_element -> + unit
    method latex_of_class_kind : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.Class.class_kind -> + unit
    method latex_of_class_parameter_list : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.Class.t_class -> + unit
    method latex_of_class_type : Format.formatter -> + Odoc_info.Class.t_class_type -> + unit
    method latex_of_class_type_kind : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.Class.class_type_kind -> + unit
    method latex_of_cstr_args : (Format.formatter * (unit -> string)) -> + Odoc_info.Name.t -> + (Odoc_info.Type.constructor_args * Types.type_expr option) -> + Odoc_info.text_element list
    method latex_of_custom_text : Format.formatter -> + string -> + Odoc_info.text -> + unit
    method latex_of_exception : Format.formatter -> + Odoc_info.Exception.t_exception -> + unit
    method latex_of_included_module : Format.formatter -> + Odoc_info.Module.included_module -> + unit
    method latex_of_info : Format.formatter -> + ?block:bool -> + Odoc_info.info option -> + unit
    method latex_of_method : Format.formatter -> Odoc_info.Value.t_method -> unit
    method latex_of_module : Format.formatter -> Odoc_info.Module.t_module -> unit
    method latex_of_module_element : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.Module.module_element -> + unit
    method latex_of_module_kind : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.Module.module_kind -> + unit
    method latex_of_module_parameter : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.Module.module_parameter -> + unit
    method latex_of_module_type : Format.formatter -> + Odoc_info.Module.t_module_type -> + unit
    method latex_of_module_type_kind : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.Module.module_type_kind -> + unit
    method latex_of_record : (Format.formatter * (unit -> string)) -> + Odoc_info.Name.t -> + Odoc_info.Type.record_field list -> + Odoc_info.text_element list
    method latex_of_text : Format.formatter -> Odoc_info.text -> unit
    method latex_of_text_element : Format.formatter -> + Odoc_info.text_element -> + unit
    method latex_of_type : Format.formatter -> Odoc_info.Type.t_type -> unit
    method latex_of_type_extension : Odoc_info.Name.t -> + Format.formatter -> + Odoc_info.Extension.t_type_extension -> + unit
    method latex_of_type_params : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.Type.t_type -> + unit
    method latex_of_value : Format.formatter -> Odoc_info.Value.t_value -> unit
    method make_label : string -> string
    method make_ref : string -> string
    method method_label : ?no_:bool -> Odoc_info.Name.t -> string
    method module_label : ?no_:bool -> Odoc_info.Name.t -> string
    method module_type_label : ?no_:bool -> Odoc_info.Name.t -> string
    method normal_class_params : Odoc_info.Name.t -> + Odoc_info.Class.t_class -> + string
    method normal_class_type : Odoc_info.Name.t -> Types.class_type -> string
    method normal_class_type_param_list : Odoc_info.Name.t -> + Types.type_expr list -> + string
    method normal_cstr_args : ?par:bool -> + Odoc_info.Name.t -> + Odoc_info.Type.constructor_args -> + string
    method normal_module_type : ?code:string -> + Odoc_info.Name.t -> + Types.module_type -> + string
    method normal_type : Odoc_info.Name.t -> Types.type_expr -> string
    method normal_type_list : ?par:bool -> + Odoc_info.Name.t -> + string -> + Types.type_expr list -> + string
    method recfield_label : ?no_:bool -> Odoc_info.Name.t -> string
    method relative_idents : Odoc_info.Name.t -> string -> string
    method relative_module_idents : Odoc_info.Name.t -> string -> string
    method section_style : int -> string -> string
    method subst : (Str.regexp * string) list -> string -> string
    method text_of_alerts : Odoc_info.alert list -> Odoc_info.text_element list
    method text_of_attribute : Odoc_info.Value.t_attribute -> + Odoc_info.text_element list
    method text_of_author_list : string list -> Odoc_info.text_element list
    method text_of_before : (string * Odoc_info.text) list -> + Odoc_info.text_element list
    method text_of_class_kind : Odoc_info.Name.t -> + Odoc_info.Class.class_kind -> + Odoc_info.text_element list
    method text_of_class_params : Odoc_info.Name.t -> + Odoc_info.Class.t_class -> + Odoc_types.text
    method text_of_class_type_kind : Odoc_info.Name.t -> + Odoc_info.Class.class_type_kind -> + Odoc_info.text_element list
    method text_of_class_type_param_expr_list : Odoc_info.Name.t -> + Types.type_expr list -> + Odoc_info.text_element list
    method text_of_custom : (string * Odoc_info.text) list -> Odoc_info.text
    method text_of_exception : Odoc_info.Exception.t_exception -> + Odoc_info.text_element list
    method text_of_info : ?block:bool -> Odoc_info.info option -> Odoc_info.text
    method text_of_method : Odoc_info.Value.t_method -> Odoc_info.text_element list
    method text_of_module_kind : ?with_def_syntax:bool -> + Odoc_info.Module.module_kind -> + Odoc_info.text_element list
    method text_of_module_parameter_list : (Odoc_info.Module.module_parameter + * Odoc_info.text_element list option) + list -> + Odoc_info.text_element list
    method text_of_module_type : Types.module_type -> Odoc_info.text_element list
    method text_of_module_type_kind : ?with_def_syntax:bool -> + Odoc_info.Module.module_type_kind -> + Odoc_info.text_element list
    method text_of_parameter_description : Odoc_info.Parameter.parameter -> + Odoc_info.text
    method text_of_parameter_list : Odoc_info.Name.t -> + Odoc_info.Parameter.parameter list -> + Odoc_info.text_element list
    method text_of_raised_exceptions : Odoc_info.raised_exception list -> + Odoc_info.text_element list
    method text_of_return_opt : Odoc_info.text option -> + Odoc_info.text_element list
    method text_of_see : Odoc_info.see -> Odoc_info.text
    method text_of_sees : Odoc_info.see list -> Odoc_info.text_element list
    method text_of_short_type_expr : Odoc_info.Name.t -> + Types.type_expr -> + Odoc_info.text_element list
    method text_of_since_opt : string option -> Odoc_info.text_element list
    method text_of_type_expr : Odoc_info.Name.t -> + Types.type_expr -> + Odoc_info.text_element list
    method text_of_type_expr_list : Odoc_info.Name.t -> + string -> + Types.type_expr list -> + Odoc_info.text_element list
    method text_of_value : Odoc_info.Value.t_value -> Odoc_info.text_element list
    method text_of_version_opt : string option -> Odoc_info.text_element list
    method type_label : ?no_:bool -> Odoc_info.Name.t -> string
    method value_label : ?no_:bool -> Odoc_info.Name.t -> string
    diff --git a/ocaml/Odoc_gen/module-type-Latex_functor/argument-1-_/index.html b/ocaml/Odoc_gen/module-type-Latex_functor/argument-1-_/index.html new file mode 100644 index 0000000..edaf291 --- /dev/null +++ b/ocaml/Odoc_gen/module-type-Latex_functor/argument-1-_/index.html @@ -0,0 +1,2 @@ + +_ (ocaml.Odoc_gen.Latex_functor._)

    Parameter Latex_functor._

    class latex : object ... end
    diff --git a/ocaml/Odoc_gen/module-type-Latex_functor/class-latex/index.html b/ocaml/Odoc_gen/module-type-Latex_functor/class-latex/index.html new file mode 100644 index 0000000..ac5756a --- /dev/null +++ b/ocaml/Odoc_gen/module-type-Latex_functor/class-latex/index.html @@ -0,0 +1,140 @@ + +latex (ocaml.Odoc_gen.Latex_functor.latex)

    Class Latex_functor.latex

    val subst_strings : (Str.regexp * string) list
    val subst_strings_code : (Str.regexp * string) list
    val subst_strings_simple : (Str.regexp * string) list
    val mutable tag_functions : (string * (Odoc_info.text -> Odoc_info.text)) list
    method attribute_label : ?no_:bool -> Odoc_info.Name.t -> string
    method class_label : ?no_:bool -> Odoc_info.Name.t -> string
    method class_type_label : ?no_:bool -> Odoc_info.Name.t -> string
    method const_label : ?no_:bool -> Odoc_info.Name.t -> string
    method entry_comment : (Format.formatter * (unit -> string)) -> + Odoc_info.info option -> + Odoc_info.text_element list
    method escape : string -> string
    method escape_code : string -> string
    method escape_simple : string -> string
    method exception_label : ?no_:bool -> Odoc_info.Name.t -> string
    method extension_label : ?no_:bool -> Odoc_info.Name.t -> string
    method first_and_rest_of_info : Odoc_info.info option -> + Odoc_info.text * Odoc_info.text
    method generate : Odoc_info.Module.t_module list -> unit
    method generate_class_inheritance_info : Format.formatter -> + Odoc_info.Class.t_class -> + unit
    method generate_class_type_inheritance_info : Format.formatter -> + Odoc_info.Class.t_class_type -> + unit
    method generate_for_top_module : Format.formatter -> + Odoc_info.Module.t_module -> + unit
    method generate_inheritance_info : Format.formatter -> + Odoc_info.Class.inherited_class list -> + unit
    method generate_style_file : unit
    method label : ?no_:bool -> Odoc_info.Name.t -> string
    method latex_for_class_index : Format.formatter -> + Odoc_info.Class.t_class -> + unit
    method latex_for_class_label : Format.formatter -> + Odoc_info.Class.t_class -> + unit
    method latex_for_class_type_index : Format.formatter -> + Odoc_info.Class.t_class_type -> + unit
    method latex_for_class_type_label : Format.formatter -> + Odoc_info.Class.t_class_type -> + unit
    method latex_for_module_index : Format.formatter -> + Odoc_info.Module.t_module -> + unit
    method latex_for_module_label : Format.formatter -> + Odoc_info.Module.t_module -> + unit
    method latex_for_module_type_index : Format.formatter -> + Odoc_info.Module.t_module_type -> + unit
    method latex_for_module_type_label : Format.formatter -> + Odoc_info.Module.t_module_type -> + unit
    method latex_header : Format.formatter -> + Odoc_info.Module.t_module list -> + unit
    method latex_of_Block : Format.formatter -> Odoc_info.text -> unit
    method latex_of_Bold : Format.formatter -> Odoc_info.text -> unit
    method latex_of_Center : Format.formatter -> Odoc_info.text -> unit
    method latex_of_Code : Format.formatter -> string -> unit
    method latex_of_CodePre : Format.formatter -> string -> unit
    method latex_of_Emphasize : Format.formatter -> Odoc_info.text -> unit
    method latex_of_Enum : Format.formatter -> Odoc_info.text list -> unit
    method latex_of_Italic : Format.formatter -> Odoc_info.text -> unit
    method latex_of_Latex : Format.formatter -> string -> unit
    method latex_of_Left : Format.formatter -> Odoc_info.text -> unit
    method latex_of_List : Format.formatter -> Odoc_info.text list -> unit
    method latex_of_Newline : Format.formatter -> unit
    method latex_of_Raw : Format.formatter -> string -> unit
    method latex_of_Ref : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.ref_kind option -> + Odoc_info.text option -> + unit
    method latex_of_Right : Format.formatter -> Odoc_info.text -> unit
    method latex_of_Subscript : Format.formatter -> Odoc_info.text -> unit
    method latex_of_Superscript : Format.formatter -> Odoc_info.text -> unit
    method latex_of_Target : Format.formatter -> + target:string -> + code:string -> + unit
    method latex_of_Title : Format.formatter -> + int -> + Odoc_info.Name.t option -> + Odoc_info.text -> + unit
    method latex_of_Verbatim : Format.formatter -> string -> unit
    method latex_of_attribute : Format.formatter -> + Odoc_info.Value.t_attribute -> + unit
    method latex_of_class : Format.formatter -> Odoc_info.Class.t_class -> unit
    method latex_of_class_element : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.Class.class_element -> + unit
    method latex_of_class_kind : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.Class.class_kind -> + unit
    method latex_of_class_parameter_list : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.Class.t_class -> + unit
    method latex_of_class_type : Format.formatter -> + Odoc_info.Class.t_class_type -> + unit
    method latex_of_class_type_kind : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.Class.class_type_kind -> + unit
    method latex_of_cstr_args : (Format.formatter * (unit -> string)) -> + Odoc_info.Name.t -> + (Odoc_info.Type.constructor_args * Types.type_expr option) -> + Odoc_info.text_element list
    method latex_of_custom_text : Format.formatter -> + string -> + Odoc_info.text -> + unit
    method latex_of_exception : Format.formatter -> + Odoc_info.Exception.t_exception -> + unit
    method latex_of_included_module : Format.formatter -> + Odoc_info.Module.included_module -> + unit
    method latex_of_info : Format.formatter -> + ?block:bool -> + Odoc_info.info option -> + unit
    method latex_of_method : Format.formatter -> Odoc_info.Value.t_method -> unit
    method latex_of_module : Format.formatter -> Odoc_info.Module.t_module -> unit
    method latex_of_module_element : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.Module.module_element -> + unit
    method latex_of_module_kind : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.Module.module_kind -> + unit
    method latex_of_module_parameter : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.Module.module_parameter -> + unit
    method latex_of_module_type : Format.formatter -> + Odoc_info.Module.t_module_type -> + unit
    method latex_of_module_type_kind : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.Module.module_type_kind -> + unit
    method latex_of_record : (Format.formatter * (unit -> string)) -> + Odoc_info.Name.t -> + Odoc_info.Type.record_field list -> + Odoc_info.text_element list
    method latex_of_text : Format.formatter -> Odoc_info.text -> unit
    method latex_of_text_element : Format.formatter -> + Odoc_info.text_element -> + unit
    method latex_of_type : Format.formatter -> Odoc_info.Type.t_type -> unit
    method latex_of_type_extension : Odoc_info.Name.t -> + Format.formatter -> + Odoc_info.Extension.t_type_extension -> + unit
    method latex_of_type_params : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.Type.t_type -> + unit
    method latex_of_value : Format.formatter -> Odoc_info.Value.t_value -> unit
    method make_label : string -> string
    method make_ref : string -> string
    method method_label : ?no_:bool -> Odoc_info.Name.t -> string
    method module_label : ?no_:bool -> Odoc_info.Name.t -> string
    method module_type_label : ?no_:bool -> Odoc_info.Name.t -> string
    method normal_class_params : Odoc_info.Name.t -> + Odoc_info.Class.t_class -> + string
    method normal_class_type : Odoc_info.Name.t -> Types.class_type -> string
    method normal_class_type_param_list : Odoc_info.Name.t -> + Types.type_expr list -> + string
    method normal_cstr_args : ?par:bool -> + Odoc_info.Name.t -> + Odoc_info.Type.constructor_args -> + string
    method normal_module_type : ?code:string -> + Odoc_info.Name.t -> + Types.module_type -> + string
    method normal_type : Odoc_info.Name.t -> Types.type_expr -> string
    method normal_type_list : ?par:bool -> + Odoc_info.Name.t -> + string -> + Types.type_expr list -> + string
    method recfield_label : ?no_:bool -> Odoc_info.Name.t -> string
    method relative_idents : Odoc_info.Name.t -> string -> string
    method relative_module_idents : Odoc_info.Name.t -> string -> string
    method section_style : int -> string -> string
    method subst : (Str.regexp * string) list -> string -> string
    method text_of_alerts : Odoc_info.alert list -> Odoc_info.text_element list
    method text_of_attribute : Odoc_info.Value.t_attribute -> + Odoc_info.text_element list
    method text_of_author_list : string list -> Odoc_info.text_element list
    method text_of_before : (string * Odoc_info.text) list -> + Odoc_info.text_element list
    method text_of_class_kind : Odoc_info.Name.t -> + Odoc_info.Class.class_kind -> + Odoc_info.text_element list
    method text_of_class_params : Odoc_info.Name.t -> + Odoc_info.Class.t_class -> + Odoc_types.text
    method text_of_class_type_kind : Odoc_info.Name.t -> + Odoc_info.Class.class_type_kind -> + Odoc_info.text_element list
    method text_of_class_type_param_expr_list : Odoc_info.Name.t -> + Types.type_expr list -> + Odoc_info.text_element list
    method text_of_custom : (string * Odoc_info.text) list -> Odoc_info.text
    method text_of_exception : Odoc_info.Exception.t_exception -> + Odoc_info.text_element list
    method text_of_info : ?block:bool -> Odoc_info.info option -> Odoc_info.text
    method text_of_method : Odoc_info.Value.t_method -> Odoc_info.text_element list
    method text_of_module_kind : ?with_def_syntax:bool -> + Odoc_info.Module.module_kind -> + Odoc_info.text_element list
    method text_of_module_parameter_list : (Odoc_info.Module.module_parameter + * Odoc_info.text_element list option) + list -> + Odoc_info.text_element list
    method text_of_module_type : Types.module_type -> Odoc_info.text_element list
    method text_of_module_type_kind : ?with_def_syntax:bool -> + Odoc_info.Module.module_type_kind -> + Odoc_info.text_element list
    method text_of_parameter_description : Odoc_info.Parameter.parameter -> + Odoc_info.text
    method text_of_parameter_list : Odoc_info.Name.t -> + Odoc_info.Parameter.parameter list -> + Odoc_info.text_element list
    method text_of_raised_exceptions : Odoc_info.raised_exception list -> + Odoc_info.text_element list
    method text_of_return_opt : Odoc_info.text option -> + Odoc_info.text_element list
    method text_of_see : Odoc_info.see -> Odoc_info.text
    method text_of_sees : Odoc_info.see list -> Odoc_info.text_element list
    method text_of_short_type_expr : Odoc_info.Name.t -> + Types.type_expr -> + Odoc_info.text_element list
    method text_of_since_opt : string option -> Odoc_info.text_element list
    method text_of_type_expr : Odoc_info.Name.t -> + Types.type_expr -> + Odoc_info.text_element list
    method text_of_type_expr_list : Odoc_info.Name.t -> + string -> + Types.type_expr list -> + Odoc_info.text_element list
    method text_of_value : Odoc_info.Value.t_value -> Odoc_info.text_element list
    method text_of_version_opt : string option -> Odoc_info.text_element list
    method type_label : ?no_:bool -> Odoc_info.Name.t -> string
    method value_label : ?no_:bool -> Odoc_info.Name.t -> string
    diff --git a/ocaml/Odoc_gen/module-type-Latex_functor/index.html b/ocaml/Odoc_gen/module-type-Latex_functor/index.html new file mode 100644 index 0000000..76e7939 --- /dev/null +++ b/ocaml/Odoc_gen/module-type-Latex_functor/index.html @@ -0,0 +1,2 @@ + +Latex_functor (ocaml.Odoc_gen.Latex_functor)

    Module type Odoc_gen.Latex_functor

    Parameters

    module _ : Odoc_latex.Latex_generator

    Signature

    class latex : object ... end
    diff --git a/ocaml/Odoc_gen/module-type-Man_functor/argument-1-_/class-man/index.html b/ocaml/Odoc_gen/module-type-Man_functor/argument-1-_/class-man/index.html new file mode 100644 index 0000000..e949112 --- /dev/null +++ b/ocaml/Odoc_gen/module-type-Man_functor/argument-1-_/class-man/index.html @@ -0,0 +1,46 @@ + +man (ocaml.Odoc_gen.Man_functor._.man)

    Class _.man

    val mutable tag_functions : (string * (Odoc_info.text -> string)) list
    method create_groups : bool -> + Odoc_info.Module.t_module list -> + Odoc_info.Search.result_element list list
    method escape : string -> string
    method field_comment : Buffer.t -> Odoc_info.info option -> unit
    method file_name : Odoc_info.Name.t -> string
    method generate : Odoc_info.Module.t_module list -> unit
    method generate_for_class : Odoc_info.Class.t_class -> unit
    method generate_for_class_type : Odoc_info.Class.t_class_type -> unit
    method generate_for_group : Odoc_info.Search.result_element list -> unit
    method generate_for_module : Odoc_info.Module.t_module -> unit
    method generate_for_module_type : Odoc_info.Module.t_module_type -> unit
    method man_of_Target : Buffer.t -> target:string -> code:string -> unit
    method man_of_attribute : Buffer.t -> Odoc_info.Value.t_attribute -> unit
    method man_of_class : Buffer.t -> Odoc_info.Class.t_class -> unit
    method man_of_class_comment : Buffer.t -> Odoc_info.text -> unit
    method man_of_class_type : Buffer.t -> Odoc_info.Class.t_class_type -> unit
    method man_of_class_type_expr : Buffer.t -> + Odoc_info.Name.t -> + Types.class_type -> + unit
    method man_of_code : Buffer.t -> string -> unit
    method man_of_const : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Type.variant_constructor -> + unit
    method man_of_cstr_args : ?par:bool -> + Buffer.t -> + Odoc_info.Name.t -> + string -> + Odoc_info.Type.constructor_args -> + unit
    method man_of_custom_text : Buffer.t -> string -> Odoc_info.text -> unit
    method man_of_exception : Buffer.t -> Odoc_info.Exception.t_exception -> unit
    method man_of_included_module : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Module.included_module -> + unit
    method man_of_info : ?margin:int -> Buffer.t -> Odoc_types.info option -> unit
    method man_of_method : Buffer.t -> Odoc_info.Value.t_method -> unit
    method man_of_modtype : Buffer.t -> Odoc_info.Module.t_module_type -> unit
    method man_of_module : Buffer.t -> Odoc_info.Module.t_module -> unit
    method man_of_module_body : Buffer.t -> Odoc_info.Module.t_module -> unit
    method man_of_module_comment : Buffer.t -> Odoc_info.text -> unit
    method man_of_module_parameter_list : Buffer.t -> + Odoc_info.Name.t -> + (Odoc_info.Module.module_parameter * Odoc_info.text option) list -> + unit
    method man_of_module_type : Buffer.t -> + Odoc_info.Name.t -> + Types.module_type -> + unit
    method man_of_module_type_body : Buffer.t -> + Odoc_info.Module.t_module_type -> + unit
    method man_of_parameter_description : Buffer.t -> + Odoc_info.Parameter.parameter -> + unit
    method man_of_parameter_list : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Parameter.parameter list -> + unit
    method man_of_recfield : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Type.record_field -> + unit
    method man_of_record : Odoc_info.Name.t -> + Buffer.t -> + Odoc_info.Type.record_field list -> + unit
    method man_of_text : Buffer.t -> Odoc_info.text -> unit
    method private man_of_text2 : Buffer.t -> Odoc_info.text -> unit
    method man_of_text_element : Buffer.t -> Odoc_info.text_element -> unit
    method man_of_type : Buffer.t -> Odoc_info.Type.t_type -> unit
    method man_of_type_expr : Buffer.t -> + Odoc_info.Name.t -> + Types.type_expr -> + unit
    method man_of_type_expr_param_list : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Type.t_type -> + unit
    method man_of_type_extension : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Extension.t_type_extension -> + unit
    method man_of_value : Buffer.t -> Odoc_info.Value.t_value -> unit
    method open_out : string -> out_channel
    method relative_idents : Odoc_info.Name.t -> Odoc_info.Name.t -> string
    method remove_newlines : string -> string
    method str_man_of_alerts : Odoc_info.alert list -> string list
    method str_man_of_author_list : string list -> string
    method str_man_of_before : (string * Odoc_info.text) list -> string
    method str_man_of_custom : (string * Odoc_info.text) list -> string list
    method str_man_of_raised_exceptions : (string * Odoc_info.text) list -> string
    method str_man_of_return_opt : Odoc_info.text option -> string
    method str_man_of_see : (Odoc_info.see_ref * Odoc_info.text) -> string
    method str_man_of_sees : (Odoc_info.see_ref * Odoc_info.text) list -> string
    method str_man_of_since_opt : string option -> string
    method str_man_of_text : Odoc_info.text -> string
    method str_man_of_version_opt : string option -> string
    diff --git a/ocaml/Odoc_gen/module-type-Man_functor/argument-1-_/index.html b/ocaml/Odoc_gen/module-type-Man_functor/argument-1-_/index.html new file mode 100644 index 0000000..32aec14 --- /dev/null +++ b/ocaml/Odoc_gen/module-type-Man_functor/argument-1-_/index.html @@ -0,0 +1,2 @@ + +_ (ocaml.Odoc_gen.Man_functor._)

    Parameter Man_functor._

    class man : object ... end
    diff --git a/ocaml/Odoc_gen/module-type-Man_functor/class-man/index.html b/ocaml/Odoc_gen/module-type-Man_functor/class-man/index.html new file mode 100644 index 0000000..2c053b7 --- /dev/null +++ b/ocaml/Odoc_gen/module-type-Man_functor/class-man/index.html @@ -0,0 +1,46 @@ + +man (ocaml.Odoc_gen.Man_functor.man)

    Class Man_functor.man

    val mutable tag_functions : (string * (Odoc_info.text -> string)) list
    method create_groups : bool -> + Odoc_info.Module.t_module list -> + Odoc_info.Search.result_element list list
    method escape : string -> string
    method field_comment : Buffer.t -> Odoc_info.info option -> unit
    method file_name : Odoc_info.Name.t -> string
    method generate : Odoc_info.Module.t_module list -> unit
    method generate_for_class : Odoc_info.Class.t_class -> unit
    method generate_for_class_type : Odoc_info.Class.t_class_type -> unit
    method generate_for_group : Odoc_info.Search.result_element list -> unit
    method generate_for_module : Odoc_info.Module.t_module -> unit
    method generate_for_module_type : Odoc_info.Module.t_module_type -> unit
    method man_of_Target : Buffer.t -> target:string -> code:string -> unit
    method man_of_attribute : Buffer.t -> Odoc_info.Value.t_attribute -> unit
    method man_of_class : Buffer.t -> Odoc_info.Class.t_class -> unit
    method man_of_class_comment : Buffer.t -> Odoc_info.text -> unit
    method man_of_class_type : Buffer.t -> Odoc_info.Class.t_class_type -> unit
    method man_of_class_type_expr : Buffer.t -> + Odoc_info.Name.t -> + Types.class_type -> + unit
    method man_of_code : Buffer.t -> string -> unit
    method man_of_const : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Type.variant_constructor -> + unit
    method man_of_cstr_args : ?par:bool -> + Buffer.t -> + Odoc_info.Name.t -> + string -> + Odoc_info.Type.constructor_args -> + unit
    method man_of_custom_text : Buffer.t -> string -> Odoc_info.text -> unit
    method man_of_exception : Buffer.t -> Odoc_info.Exception.t_exception -> unit
    method man_of_included_module : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Module.included_module -> + unit
    method man_of_info : ?margin:int -> Buffer.t -> Odoc_types.info option -> unit
    method man_of_method : Buffer.t -> Odoc_info.Value.t_method -> unit
    method man_of_modtype : Buffer.t -> Odoc_info.Module.t_module_type -> unit
    method man_of_module : Buffer.t -> Odoc_info.Module.t_module -> unit
    method man_of_module_body : Buffer.t -> Odoc_info.Module.t_module -> unit
    method man_of_module_comment : Buffer.t -> Odoc_info.text -> unit
    method man_of_module_parameter_list : Buffer.t -> + Odoc_info.Name.t -> + (Odoc_info.Module.module_parameter * Odoc_info.text option) list -> + unit
    method man_of_module_type : Buffer.t -> + Odoc_info.Name.t -> + Types.module_type -> + unit
    method man_of_module_type_body : Buffer.t -> + Odoc_info.Module.t_module_type -> + unit
    method man_of_parameter_description : Buffer.t -> + Odoc_info.Parameter.parameter -> + unit
    method man_of_parameter_list : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Parameter.parameter list -> + unit
    method man_of_recfield : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Type.record_field -> + unit
    method man_of_record : Odoc_info.Name.t -> + Buffer.t -> + Odoc_info.Type.record_field list -> + unit
    method man_of_text : Buffer.t -> Odoc_info.text -> unit
    method private man_of_text2 : Buffer.t -> Odoc_info.text -> unit
    method man_of_text_element : Buffer.t -> Odoc_info.text_element -> unit
    method man_of_type : Buffer.t -> Odoc_info.Type.t_type -> unit
    method man_of_type_expr : Buffer.t -> + Odoc_info.Name.t -> + Types.type_expr -> + unit
    method man_of_type_expr_param_list : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Type.t_type -> + unit
    method man_of_type_extension : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Extension.t_type_extension -> + unit
    method man_of_value : Buffer.t -> Odoc_info.Value.t_value -> unit
    method open_out : string -> out_channel
    method relative_idents : Odoc_info.Name.t -> Odoc_info.Name.t -> string
    method remove_newlines : string -> string
    method str_man_of_alerts : Odoc_info.alert list -> string list
    method str_man_of_author_list : string list -> string
    method str_man_of_before : (string * Odoc_info.text) list -> string
    method str_man_of_custom : (string * Odoc_info.text) list -> string list
    method str_man_of_raised_exceptions : (string * Odoc_info.text) list -> string
    method str_man_of_return_opt : Odoc_info.text option -> string
    method str_man_of_see : (Odoc_info.see_ref * Odoc_info.text) -> string
    method str_man_of_sees : (Odoc_info.see_ref * Odoc_info.text) list -> string
    method str_man_of_since_opt : string option -> string
    method str_man_of_text : Odoc_info.text -> string
    method str_man_of_version_opt : string option -> string
    diff --git a/ocaml/Odoc_gen/module-type-Man_functor/index.html b/ocaml/Odoc_gen/module-type-Man_functor/index.html new file mode 100644 index 0000000..204a6c1 --- /dev/null +++ b/ocaml/Odoc_gen/module-type-Man_functor/index.html @@ -0,0 +1,2 @@ + +Man_functor (ocaml.Odoc_gen.Man_functor)

    Module type Odoc_gen.Man_functor

    Parameters

    module _ : Odoc_man.Man_generator

    Signature

    class man : object ... end
    diff --git a/ocaml/Odoc_gen/module-type-Texi_functor/argument-1-_/class-texi/index.html b/ocaml/Odoc_gen/module-type-Texi_functor/argument-1-_/class-texi/index.html new file mode 100644 index 0000000..eb563ee --- /dev/null +++ b/ocaml/Odoc_gen/module-type-Texi_functor/argument-1-_/class-texi/index.html @@ -0,0 +1,97 @@ + +texi (ocaml.Odoc_gen.Texi_functor._.texi)

    Class _.texi

    val mutable indices_to_build : [ `Class + | `Class_att + | `Class_type + | `Exception + | `Extension + | `Method + | `Module + | `Module_type + | `Type + | `Value ] + list
    val linebreak : Odoc_info.text_element
    val maxdepth : int
    val node_tbl : (Odoc_info.Name.t, unit) Hashtbl.t
    val mutable tag_functions : (string * (Odoc_info.text -> Odoc_info.text)) list
    method do_index : [ `Class + | `Class_att + | `Class_type + | `Exception + | `Extension + | `Method + | `Module + | `Module_type + | `Type + | `Value ] -> + unit
    method private fix_linebreaks : Odoc_info.text -> Odoc_info.text
    method generate : Odoc_info.Module.t_module list -> unit
    method generate_class_inheritance_info : out_channel -> + Odoc_info.Class.t_class -> + unit
    method generate_class_type_inheritance_info : out_channel -> + Odoc_info.Class.t_class_type -> + unit
    method generate_for_class : out_channel -> Odoc_info.Class.t_class -> unit
    method generate_for_class_type : out_channel -> + Odoc_info.Class.t_class_type -> + unit
    method generate_for_module : out_channel -> Odoc_info.Module.t_module -> unit
    method generate_for_module_type : out_channel -> + Odoc_info.Module.t_module_type -> + unit
    method generate_inheritance_info : out_channel -> + Odoc_info.Class.inherited_class list -> + unit
    method generate_texi_header : out_channel -> + string -> + Odoc_info.Module.t_module list -> + unit
    method generate_texi_trailer : out_channel -> unit
    method heading : int -> Odoc_info.text -> string
    method label : ?no_:bool -> string -> string
    method normal_class_params : Odoc_info.Name.t -> + Odoc_info.Class.t_class -> + string
    method normal_class_type : Odoc_info.Name.t -> Types.class_type -> string
    method normal_class_type_param_list : Odoc_info.Name.t -> + Types.type_expr list -> + string
    method normal_cstr_args : ?par:bool -> + Odoc_info.Name.t -> + Odoc_info.Type.constructor_args -> + string
    method normal_module_type : ?code:string -> + Odoc_info.Name.t -> + Types.module_type -> + string
    method normal_type : Odoc_info.Name.t -> Types.type_expr -> string
    method normal_type_list : ?par:bool -> + Odoc_info.Name.t -> + string -> + Types.type_expr list -> + string
    method relative_idents : Odoc_info.Name.t -> string -> string
    method relative_module_idents : Odoc_info.Name.t -> string -> string
    method scan_for_index : Odoc_texi.subparts -> unit
    method scan_for_index_in_class : Odoc_info.Class.class_element -> unit
    method scan_for_index_in_mod : Odoc_info.Module.module_element -> unit
    method private soft_fix_linebreaks : int -> + Odoc_info.text_element list -> + Odoc_info.text_element list
    method string_of_type_args : Odoc_info.Type.constructor_args -> + Types.type_expr option -> + string
    method string_of_type_parameters : Odoc_info.Type.t_type -> string
    method texi_of_Block : Odoc_info.text -> Odoc_info.Name.t
    method texi_of_Bold : Odoc_info.text -> Odoc_info.Name.t
    method texi_of_Center : Odoc_info.text -> Odoc_info.Name.t
    method texi_of_Code : Odoc_info.Name.t -> Odoc_info.Name.t
    method texi_of_CodePre : Odoc_info.Name.t -> Odoc_info.Name.t
    method texi_of_Emphasize : Odoc_info.text -> Odoc_info.Name.t
    method texi_of_Enum : Odoc_info.text list -> Odoc_info.Name.t
    method texi_of_Italic : Odoc_info.text -> Odoc_info.Name.t
    method texi_of_Left : Odoc_info.text -> Odoc_info.Name.t
    method texi_of_List : Odoc_info.text list -> Odoc_info.Name.t
    method texi_of_Newline : Odoc_info.Name.t
    method texi_of_Raw : Odoc_info.Name.t -> Odoc_info.Name.t
    method texi_of_Ref : Odoc_info.Name.t -> + Odoc_info.ref_kind option -> + Odoc_info.Name.t
    method texi_of_Right : Odoc_info.text -> Odoc_info.Name.t
    method texi_of_Subscript : Odoc_info.text -> Odoc_info.Name.t
    method texi_of_Superscript : Odoc_info.text -> Odoc_info.Name.t
    method texi_of_Target : target:string -> + code:Odoc_info.Name.t -> + Odoc_info.Name.t
    method texi_of_Title : int -> Odoc_info.text -> Odoc_info.Name.t
    method texi_of_Verbatim : Odoc_info.Name.t -> Odoc_info.Name.t
    method texi_of_attribute : Odoc_info.Value.t_attribute -> string
    method texi_of_class : Odoc_info.Class.t_class -> string
    method texi_of_class_element : Odoc_info.Name.t -> + Odoc_info.Class.class_element -> + string
    method texi_of_class_type : Odoc_info.Class.t_class_type -> string
    method texi_of_custom_text : string -> Odoc_info.text -> Odoc_info.Name.t
    method texi_of_exception : Odoc_info.Exception.t_exception -> string
    method texi_of_included_module : Odoc_info.Module.included_module -> string
    method texi_of_info : Odoc_info.info option -> string
    method texi_of_method : Odoc_info.Value.t_method -> string
    method texi_of_module : Odoc_info.Module.t_module -> string
    method texi_of_module_element : Odoc_info.Name.t -> + Odoc_info.Module.module_element -> + string
    method texi_of_module_type : Odoc_info.Module.t_module_type -> string
    method texi_of_text : Odoc_info.text -> string
    method texi_of_text_element : Odoc_info.text_element -> Odoc_info.Name.t
    method texi_of_type : Odoc_info.Type.t_type -> string
    method texi_of_type_extension : Odoc_info.Name.t -> + Odoc_info.Extension.t_type_extension -> + string
    method texi_of_value : Odoc_info.Value.t_value -> string
    method text_el_of_type_expr : Odoc_info.Name.t -> + Types.type_expr -> + Odoc_info.text_element
    method text_of_alerts : Odoc_info.alert list -> Odoc_info.text_element list
    method text_of_attribute : Odoc_info.Value.t_attribute -> + Odoc_info.text_element list
    method text_of_author_list : string list -> Odoc_info.text_element list
    method text_of_before : (string * Odoc_info.text) list -> + Odoc_info.text_element list
    method text_of_class_kind : Odoc_info.Name.t -> + Odoc_info.Class.class_kind -> + Odoc_info.text_element list
    method text_of_class_params : Odoc_info.Name.t -> + Odoc_info.Class.t_class -> + Odoc_types.text
    method text_of_class_type_kind : Odoc_info.Name.t -> + Odoc_info.Class.class_type_kind -> + Odoc_info.text_element list
    method text_of_class_type_param_expr_list : Odoc_info.Name.t -> + Types.type_expr list -> + Odoc_info.text_element list
    method text_of_custom : (string * Odoc_info.text) list -> Odoc_info.text
    method text_of_desc : Odoc_info.text option -> Odoc_info.text_element list
    method text_of_exception : Odoc_info.Exception.t_exception -> + Odoc_info.text_element list
    method text_of_info : ?block:bool -> + Odoc_info.info option -> + Odoc_info.text_element list
    method text_of_method : Odoc_info.Value.t_method -> Odoc_info.text_element list
    method text_of_module_kind : ?with_def_syntax:bool -> + Odoc_info.Module.module_kind -> + Odoc_info.text_element list
    method text_of_module_parameter_list : (Odoc_info.Module.module_parameter + * Odoc_info.text_element list option) + list -> + Odoc_info.text_element list
    method text_of_module_type : Types.module_type -> Odoc_info.text_element list
    method text_of_module_type_kind : ?with_def_syntax:bool -> + Odoc_info.Module.module_type_kind -> + Odoc_info.text_element list
    method text_of_parameter_description : Odoc_info.Parameter.parameter -> + Odoc_info.text
    method text_of_parameter_list : Odoc_info.Name.t -> + Odoc_info.Parameter.parameter list -> + Odoc_info.text_element list
    method text_of_params : Odoc_info.param list -> Odoc_info.text_element list
    method text_of_raised_exceptions : Odoc_info.raised_exception list -> + Odoc_info.text_element list
    method text_of_return_opt : Odoc_info.text option -> + Odoc_info.text_element list
    method text_of_see : Odoc_info.see -> Odoc_info.text
    method text_of_sees : Odoc_info.see list -> Odoc_info.text_element list
    method text_of_sees_opt : Odoc_info.see list -> Odoc_info.text_element list
    method text_of_short_type_expr : Odoc_info.Name.t -> + Types.type_expr -> + Odoc_info.text_element list
    method text_of_since_opt : string option -> Odoc_info.text_element list
    method text_of_type_expr : Odoc_info.Name.t -> + Types.type_expr -> + Odoc_info.text_element list
    method text_of_type_expr_list : Odoc_info.Name.t -> + string -> + Types.type_expr list -> + Odoc_info.text_element list
    method text_of_value : Odoc_info.Value.t_value -> Odoc_info.text_element list
    method text_of_version_opt : string option -> Odoc_info.text_element list
    diff --git a/ocaml/Odoc_gen/module-type-Texi_functor/argument-1-_/index.html b/ocaml/Odoc_gen/module-type-Texi_functor/argument-1-_/index.html new file mode 100644 index 0000000..9c8a4e2 --- /dev/null +++ b/ocaml/Odoc_gen/module-type-Texi_functor/argument-1-_/index.html @@ -0,0 +1,2 @@ + +_ (ocaml.Odoc_gen.Texi_functor._)

    Parameter Texi_functor._

    class texi : object ... end
    diff --git a/ocaml/Odoc_gen/module-type-Texi_functor/class-texi/index.html b/ocaml/Odoc_gen/module-type-Texi_functor/class-texi/index.html new file mode 100644 index 0000000..e305285 --- /dev/null +++ b/ocaml/Odoc_gen/module-type-Texi_functor/class-texi/index.html @@ -0,0 +1,97 @@ + +texi (ocaml.Odoc_gen.Texi_functor.texi)

    Class Texi_functor.texi

    val mutable indices_to_build : [ `Class + | `Class_att + | `Class_type + | `Exception + | `Extension + | `Method + | `Module + | `Module_type + | `Type + | `Value ] + list
    val linebreak : Odoc_info.text_element
    val maxdepth : int
    val node_tbl : (Odoc_info.Name.t, unit) Hashtbl.t
    val mutable tag_functions : (string * (Odoc_info.text -> Odoc_info.text)) list
    method do_index : [ `Class + | `Class_att + | `Class_type + | `Exception + | `Extension + | `Method + | `Module + | `Module_type + | `Type + | `Value ] -> + unit
    method private fix_linebreaks : Odoc_info.text -> Odoc_info.text
    method generate : Odoc_info.Module.t_module list -> unit
    method generate_class_inheritance_info : out_channel -> + Odoc_info.Class.t_class -> + unit
    method generate_class_type_inheritance_info : out_channel -> + Odoc_info.Class.t_class_type -> + unit
    method generate_for_class : out_channel -> Odoc_info.Class.t_class -> unit
    method generate_for_class_type : out_channel -> + Odoc_info.Class.t_class_type -> + unit
    method generate_for_module : out_channel -> Odoc_info.Module.t_module -> unit
    method generate_for_module_type : out_channel -> + Odoc_info.Module.t_module_type -> + unit
    method generate_inheritance_info : out_channel -> + Odoc_info.Class.inherited_class list -> + unit
    method generate_texi_header : out_channel -> + string -> + Odoc_info.Module.t_module list -> + unit
    method generate_texi_trailer : out_channel -> unit
    method heading : int -> Odoc_info.text -> string
    method label : ?no_:bool -> string -> string
    method normal_class_params : Odoc_info.Name.t -> + Odoc_info.Class.t_class -> + string
    method normal_class_type : Odoc_info.Name.t -> Types.class_type -> string
    method normal_class_type_param_list : Odoc_info.Name.t -> + Types.type_expr list -> + string
    method normal_cstr_args : ?par:bool -> + Odoc_info.Name.t -> + Odoc_info.Type.constructor_args -> + string
    method normal_module_type : ?code:string -> + Odoc_info.Name.t -> + Types.module_type -> + string
    method normal_type : Odoc_info.Name.t -> Types.type_expr -> string
    method normal_type_list : ?par:bool -> + Odoc_info.Name.t -> + string -> + Types.type_expr list -> + string
    method relative_idents : Odoc_info.Name.t -> string -> string
    method relative_module_idents : Odoc_info.Name.t -> string -> string
    method scan_for_index : Odoc_texi.subparts -> unit
    method scan_for_index_in_class : Odoc_info.Class.class_element -> unit
    method scan_for_index_in_mod : Odoc_info.Module.module_element -> unit
    method private soft_fix_linebreaks : int -> + Odoc_info.text_element list -> + Odoc_info.text_element list
    method string_of_type_args : Odoc_info.Type.constructor_args -> + Types.type_expr option -> + string
    method string_of_type_parameters : Odoc_info.Type.t_type -> string
    method texi_of_Block : Odoc_info.text -> Odoc_info.Name.t
    method texi_of_Bold : Odoc_info.text -> Odoc_info.Name.t
    method texi_of_Center : Odoc_info.text -> Odoc_info.Name.t
    method texi_of_Code : Odoc_info.Name.t -> Odoc_info.Name.t
    method texi_of_CodePre : Odoc_info.Name.t -> Odoc_info.Name.t
    method texi_of_Emphasize : Odoc_info.text -> Odoc_info.Name.t
    method texi_of_Enum : Odoc_info.text list -> Odoc_info.Name.t
    method texi_of_Italic : Odoc_info.text -> Odoc_info.Name.t
    method texi_of_Left : Odoc_info.text -> Odoc_info.Name.t
    method texi_of_List : Odoc_info.text list -> Odoc_info.Name.t
    method texi_of_Newline : Odoc_info.Name.t
    method texi_of_Raw : Odoc_info.Name.t -> Odoc_info.Name.t
    method texi_of_Ref : Odoc_info.Name.t -> + Odoc_info.ref_kind option -> + Odoc_info.Name.t
    method texi_of_Right : Odoc_info.text -> Odoc_info.Name.t
    method texi_of_Subscript : Odoc_info.text -> Odoc_info.Name.t
    method texi_of_Superscript : Odoc_info.text -> Odoc_info.Name.t
    method texi_of_Target : target:string -> + code:Odoc_info.Name.t -> + Odoc_info.Name.t
    method texi_of_Title : int -> Odoc_info.text -> Odoc_info.Name.t
    method texi_of_Verbatim : Odoc_info.Name.t -> Odoc_info.Name.t
    method texi_of_attribute : Odoc_info.Value.t_attribute -> string
    method texi_of_class : Odoc_info.Class.t_class -> string
    method texi_of_class_element : Odoc_info.Name.t -> + Odoc_info.Class.class_element -> + string
    method texi_of_class_type : Odoc_info.Class.t_class_type -> string
    method texi_of_custom_text : string -> Odoc_info.text -> Odoc_info.Name.t
    method texi_of_exception : Odoc_info.Exception.t_exception -> string
    method texi_of_included_module : Odoc_info.Module.included_module -> string
    method texi_of_info : Odoc_info.info option -> string
    method texi_of_method : Odoc_info.Value.t_method -> string
    method texi_of_module : Odoc_info.Module.t_module -> string
    method texi_of_module_element : Odoc_info.Name.t -> + Odoc_info.Module.module_element -> + string
    method texi_of_module_type : Odoc_info.Module.t_module_type -> string
    method texi_of_text : Odoc_info.text -> string
    method texi_of_text_element : Odoc_info.text_element -> Odoc_info.Name.t
    method texi_of_type : Odoc_info.Type.t_type -> string
    method texi_of_type_extension : Odoc_info.Name.t -> + Odoc_info.Extension.t_type_extension -> + string
    method texi_of_value : Odoc_info.Value.t_value -> string
    method text_el_of_type_expr : Odoc_info.Name.t -> + Types.type_expr -> + Odoc_info.text_element
    method text_of_alerts : Odoc_info.alert list -> Odoc_info.text_element list
    method text_of_attribute : Odoc_info.Value.t_attribute -> + Odoc_info.text_element list
    method text_of_author_list : string list -> Odoc_info.text_element list
    method text_of_before : (string * Odoc_info.text) list -> + Odoc_info.text_element list
    method text_of_class_kind : Odoc_info.Name.t -> + Odoc_info.Class.class_kind -> + Odoc_info.text_element list
    method text_of_class_params : Odoc_info.Name.t -> + Odoc_info.Class.t_class -> + Odoc_types.text
    method text_of_class_type_kind : Odoc_info.Name.t -> + Odoc_info.Class.class_type_kind -> + Odoc_info.text_element list
    method text_of_class_type_param_expr_list : Odoc_info.Name.t -> + Types.type_expr list -> + Odoc_info.text_element list
    method text_of_custom : (string * Odoc_info.text) list -> Odoc_info.text
    method text_of_desc : Odoc_info.text option -> Odoc_info.text_element list
    method text_of_exception : Odoc_info.Exception.t_exception -> + Odoc_info.text_element list
    method text_of_info : ?block:bool -> + Odoc_info.info option -> + Odoc_info.text_element list
    method text_of_method : Odoc_info.Value.t_method -> Odoc_info.text_element list
    method text_of_module_kind : ?with_def_syntax:bool -> + Odoc_info.Module.module_kind -> + Odoc_info.text_element list
    method text_of_module_parameter_list : (Odoc_info.Module.module_parameter + * Odoc_info.text_element list option) + list -> + Odoc_info.text_element list
    method text_of_module_type : Types.module_type -> Odoc_info.text_element list
    method text_of_module_type_kind : ?with_def_syntax:bool -> + Odoc_info.Module.module_type_kind -> + Odoc_info.text_element list
    method text_of_parameter_description : Odoc_info.Parameter.parameter -> + Odoc_info.text
    method text_of_parameter_list : Odoc_info.Name.t -> + Odoc_info.Parameter.parameter list -> + Odoc_info.text_element list
    method text_of_params : Odoc_info.param list -> Odoc_info.text_element list
    method text_of_raised_exceptions : Odoc_info.raised_exception list -> + Odoc_info.text_element list
    method text_of_return_opt : Odoc_info.text option -> + Odoc_info.text_element list
    method text_of_see : Odoc_info.see -> Odoc_info.text
    method text_of_sees : Odoc_info.see list -> Odoc_info.text_element list
    method text_of_sees_opt : Odoc_info.see list -> Odoc_info.text_element list
    method text_of_short_type_expr : Odoc_info.Name.t -> + Types.type_expr -> + Odoc_info.text_element list
    method text_of_since_opt : string option -> Odoc_info.text_element list
    method text_of_type_expr : Odoc_info.Name.t -> + Types.type_expr -> + Odoc_info.text_element list
    method text_of_type_expr_list : Odoc_info.Name.t -> + string -> + Types.type_expr list -> + Odoc_info.text_element list
    method text_of_value : Odoc_info.Value.t_value -> Odoc_info.text_element list
    method text_of_version_opt : string option -> Odoc_info.text_element list
    diff --git a/ocaml/Odoc_gen/module-type-Texi_functor/index.html b/ocaml/Odoc_gen/module-type-Texi_functor/index.html new file mode 100644 index 0000000..3fdda9d --- /dev/null +++ b/ocaml/Odoc_gen/module-type-Texi_functor/index.html @@ -0,0 +1,2 @@ + +Texi_functor (ocaml.Odoc_gen.Texi_functor)

    Module type Odoc_gen.Texi_functor

    Parameters

    module _ : Odoc_texi.Texi_generator

    Signature

    class texi : object ... end
    diff --git a/ocaml/Odoc_global/index.html b/ocaml/Odoc_global/index.html new file mode 100644 index 0000000..040316b --- /dev/null +++ b/ocaml/Odoc_global/index.html @@ -0,0 +1,2 @@ + +Odoc_global (ocaml.Odoc_global)

    Module Odoc_global

    type source_file =
    1. | Impl_file of string
    2. | Intf_file of string
    3. | Text_file of string
    val include_dirs : string list ref
    val hidden_include_dirs : string list ref
    val merge_options : Odoc_types.merge_option list ref
    val classic : bool ref
    val dump : string option ref
    val load : string list ref
    val sort_modules : bool ref
    val no_stop : bool ref
    val no_custom_tags : bool ref
    val remove_stars : bool ref
    val keep_code : bool ref
    val inverse_merge_ml_mli : bool ref
    val filter_with_module_constraints : bool ref
    val hidden_modules : string list ref
    val files : source_file list ref
    val errors : int ref
    val warn_error : bool ref
    val show_missed_crossref : bool ref
    val pwarning : string -> unit
    val out_file : string ref
    val verbose : bool ref
    val intro_file : string option ref
    val title : string option ref
    val target_dir : string ref
    val with_toc : bool ref
    val with_index : bool ref
    val with_header : bool ref
    val with_trailer : bool ref
    val initially_opened_module : string ref
    val library_namespace : string ref
    diff --git a/ocaml/Odoc_html/Generator/class-html/index.html b/ocaml/Odoc_html/Generator/class-html/index.html new file mode 100644 index 0000000..933a965 --- /dev/null +++ b/ocaml/Odoc_html/Generator/class-html/index.html @@ -0,0 +1,166 @@ + +html (ocaml.Odoc_html.Generator.html)

    Class Generator.html

    val mutable default_style_options : string list
    val mutable doctype : string
    val mutable header : Buffer.t -> + ?nav: + (Odoc_info.Name.t option * Odoc_info.Name.t option * Odoc_info.Name.t) + option -> + ?comments:Odoc_info.text list -> + string -> + unit
    val mutable known_classes_names : String.Set.t
    val mutable known_modules_names : String.Set.t
    val mutable known_types_names : String.Set.t
    val mutable list_attributes : Odoc_info.Value.t_attribute list
    val mutable list_class_types : Odoc_info.Class.t_class_type list
    val mutable list_classes : Odoc_info.Class.t_class list
    val mutable list_exceptions : Odoc_info.Exception.t_exception list
    val mutable list_extensions : Odoc_info.Extension.t_extension_constructor list
    val mutable list_methods : Odoc_info.Value.t_method list
    val mutable list_module_types : Odoc_info.Module.t_module_type list
    val mutable list_modules : Odoc_info.Module.t_module list
    val mutable list_types : Odoc_info.Type.t_type list
    val mutable list_values : Odoc_info.Value.t_value list
    val mutable style : string
    val mutable style_file : string
    val mutable tag_functions : (string * (Odoc_info.text -> string)) list
    method character_encoding : Buffer.t -> unit
    method constructor : string -> string
    method create_title_label : (int * string option * Odoc_info.text) -> string
    method escape : string -> string
    method generate : Odoc_info.Module.t_module list -> unit
    method generate_attributes_index : Odoc_info.Module.t_module list -> unit
    method generate_class_inheritance_info : Buffer.t -> + Odoc_info.Class.t_class -> + unit
    method generate_class_type_inheritance_info : Buffer.t -> + Odoc_info.Class.t_class_type -> + unit
    method generate_class_types_index : Odoc_info.Module.t_module list -> unit
    method generate_classes_index : Odoc_info.Module.t_module list -> unit
    method generate_elements : ('a option -> 'a option -> 'a -> unit) -> + 'a list -> + unit
    method generate_elements_index : ?strip_libname:bool -> + 'a list -> + ('a -> Odoc_info.Name.t) -> + ('a -> Odoc_info.info option) -> + ('a -> string) -> + string -> + string -> + unit
    method generate_exceptions_index : Odoc_info.Module.t_module list -> unit
    method generate_extensions_index : Odoc_info.Module.t_module list -> unit
    method generate_for_class : Odoc_info.Class.t_class option -> + Odoc_info.Class.t_class option -> + Odoc_info.Class.t_class -> + unit
    method generate_for_class_type : Odoc_info.Class.t_class_type option -> + Odoc_info.Class.t_class_type option -> + Odoc_info.Class.t_class_type -> + unit
    method generate_for_module : Odoc_info.Module.t_module option -> + Odoc_info.Module.t_module option -> + Odoc_info.Module.t_module -> + unit
    method generate_for_module_type : Odoc_info.Module.t_module_type option -> + Odoc_info.Module.t_module_type option -> + Odoc_info.Module.t_module_type -> + unit
    method generate_index : Odoc_info.Module.t_module list -> unit
    method generate_inheritance_info : Buffer.t -> + Odoc_info.Class.inherited_class list -> + unit
    method generate_methods_index : Odoc_info.Module.t_module list -> unit
    method generate_module_types_index : Odoc_info.Module.t_module list -> unit
    method generate_modules_index : Odoc_info.Module.t_module list -> unit
    method generate_types_index : Odoc_info.Module.t_module list -> unit
    method generate_values_index : Odoc_info.Module.t_module list -> unit
    method html_of_Block : Buffer.t -> Odoc_info.text -> unit
    method html_of_Bold : Buffer.t -> Odoc_info.text -> unit
    method html_of_Center : Buffer.t -> Odoc_info.text -> unit
    method html_of_Code : Buffer.t -> string -> unit
    method html_of_CodePre : Buffer.t -> string -> unit
    method html_of_Emphasize : Buffer.t -> Odoc_info.text -> unit
    method html_of_Enum : Buffer.t -> Odoc_info.text list -> unit
    method html_of_Index_list : Buffer.t -> unit
    method html_of_Italic : Buffer.t -> Odoc_info.text -> unit
    method html_of_Latex : Buffer.t -> string -> unit
    method html_of_Left : Buffer.t -> Odoc_info.text -> unit
    method html_of_List : Buffer.t -> Odoc_info.text list -> unit
    method html_of_Module_list : Buffer.t -> Odoc_info.Name.t list -> unit
    method html_of_Newline : Buffer.t -> unit
    method html_of_Raw : Buffer.t -> string -> unit
    method html_of_Ref : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.ref_kind option -> + Odoc_info.text option -> + unit
    method html_of_Right : Buffer.t -> Odoc_info.text -> unit
    method html_of_Subscript : Buffer.t -> Odoc_info.text -> unit
    method html_of_Superscript : Buffer.t -> Odoc_info.text -> unit
    method html_of_Target : Buffer.t -> target:string -> code:string -> unit
    method html_of_Title : Buffer.t -> + int -> + string option -> + Odoc_info.text -> + unit
    method html_of_Verbatim : Buffer.t -> string -> unit
    method html_of_alerts : Buffer.t -> Odoc_info.alert list -> unit
    method html_of_attribute : Buffer.t -> Odoc_info.Value.t_attribute -> unit
    method html_of_author_list : Buffer.t -> string list -> unit
    method html_of_before : Buffer.t -> (string * Odoc_info.text) list -> unit
    method html_of_class : Buffer.t -> + ?complete:bool -> + ?with_link:bool -> + Odoc_info.Class.t_class -> + unit
    method html_of_class_comment : Buffer.t -> Odoc_info.text -> unit
    method html_of_class_element : Buffer.t -> + Odoc_info.Class.class_element -> + unit
    method html_of_class_kind : Buffer.t -> + Odoc_info.Name.t -> + ?cl:Odoc_info.Class.t_class -> + Odoc_info.Class.class_kind -> + unit
    method html_of_class_parameter_list : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Class.t_class -> + unit
    method html_of_class_type : Buffer.t -> + ?complete:bool -> + ?with_link:bool -> + Odoc_info.Class.t_class_type -> + unit
    method html_of_class_type_kind : Buffer.t -> + Odoc_info.Name.t -> + ?ct:Odoc_info.Class.t_class_type -> + Odoc_info.Class.class_type_kind -> + unit
    method html_of_class_type_param_expr_list : Buffer.t -> + Odoc_info.Name.t -> + Types.type_expr list -> + unit
    method html_of_code : Buffer.t -> ?with_pre:bool -> string -> unit
    method html_of_cstr_args : ?par:bool -> + Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Name.t -> + string -> + Odoc_info.Type.constructor_args -> + unit
    method html_of_custom : Buffer.t -> (string * Odoc_info.text) list -> unit
    method html_of_custom_text : Buffer.t -> string -> Odoc_info.text -> unit
    method html_of_dag : (Odoc_info.Name.t * Odoc_info.Class.cct option) + Odoc_dag2html.dag -> + string
    method html_of_described_parameter_list : Buffer.t -> + Odoc_info.Name.t -> + Odoc_parameter.parameter list -> + unit
    method html_of_exception : Buffer.t -> Odoc_info.Exception.t_exception -> unit
    method html_of_included_module : Buffer.t -> + Odoc_info.Module.included_module -> + unit
    method html_of_info : ?cls:string -> + ?indent:bool -> + Buffer.t -> + Odoc_types.info option -> + unit
    method html_of_info_first_sentence : Buffer.t -> Odoc_info.info option -> unit
    method html_of_method : Buffer.t -> Odoc_info.Value.t_method -> unit
    method html_of_modtype : Buffer.t -> + ?info:bool -> + ?complete:bool -> + ?with_link:bool -> + Odoc_info.Module.t_module_type -> + unit
    method html_of_module : Buffer.t -> + ?info:bool -> + ?complete:bool -> + ?with_link:bool -> + Odoc_info.Module.t_module -> + unit
    method html_of_module_comment : Buffer.t -> Odoc_info.text -> unit
    method html_of_module_element : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Module.module_element -> + unit
    method html_of_module_kind : Buffer.t -> + Odoc_info.Name.t -> + ?modu:Odoc_info.Module.t_module -> + Odoc_info.Module.module_kind -> + unit
    method html_of_module_parameter : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Module.module_parameter -> + unit
    method html_of_module_parameter_list : Buffer.t -> + Odoc_info.Name.t -> + (Odoc_info.Module.module_parameter * Odoc_info.text option) list -> + unit
    method html_of_module_parameter_type : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Module.module_parameter -> + unit
    method html_of_module_type : Buffer.t -> + ?code:string -> + Odoc_info.Name.t -> + Types.module_type -> + unit
    method html_of_module_type_kind : Buffer.t -> + Odoc_info.Name.t -> + ?modu:Odoc_info.Module.t_module -> + ?mt:Odoc_info.Module.t_module_type -> + Odoc_info.Module.module_type_kind -> + unit
    method html_of_parameter_description : Buffer.t -> + Odoc_info.Parameter.parameter -> + unit
    method html_of_parameter_list : Buffer.t -> + Odoc_info.Name.t -> + Odoc_parameter.parameter list -> + unit
    method html_of_raised_exceptions : Buffer.t -> + (string * Odoc_info.text) list -> + unit
    method html_of_record : father:Odoc_info.Name.t -> + close_env:string -> + (Odoc_info.Type.record_field -> string) -> + Buffer.t -> + Odoc_info.Type.record_field list -> + unit
    method html_of_return_opt : Buffer.t -> Odoc_info.text option -> unit
    method html_of_see : Buffer.t -> (Odoc_info.see_ref * Odoc_info.text) -> unit
    method html_of_sees : Buffer.t -> + (Odoc_info.see_ref * Odoc_info.text) list -> + unit
    method html_of_since_opt : Buffer.t -> string option -> unit
    method html_of_text : ?with_p:bool -> Buffer.t -> Odoc_info.text -> unit
    method html_of_text_element : Buffer.t -> Odoc_info.text_element -> unit
    method html_of_text_with_p : Buffer.t -> Odoc_info.text -> unit
    method html_of_type : Buffer.t -> Odoc_info.Type.t_type -> unit
    method html_of_type_expr : Buffer.t -> + Odoc_info.Name.t -> + Types.type_expr -> + unit
    method html_of_type_expr_param_list : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Type.t_type -> + unit
    method html_of_type_extension : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Extension.t_type_extension -> + unit
    method html_of_value : Buffer.t -> Odoc_info.Value.t_value -> unit
    method html_of_version_opt : Buffer.t -> string option -> unit
    method index : string
    method index_attributes : string
    method index_class_types : string
    method index_classes : string
    method index_exceptions : string
    method index_extensions : string
    method index_methods : string
    method index_module_types : string
    method index_modules : string
    method index_prefix : string
    method index_types : string
    method index_values : string
    method init_style : unit
    method inner_title : Odoc_info.Name.t -> string
    method keep_alpha_num : string -> string
    method keyword : string -> string
    method label_of_text : Odoc_info.text -> string
    method list_attributes : Odoc_info.Value.t_attribute list
    method list_class_types : Odoc_info.Class.t_class_type list
    method list_classes : Odoc_info.Class.t_class list
    method list_exceptions : Odoc_info.Exception.t_exception list
    method list_extensions : Odoc_info.Extension.t_extension_constructor list
    method list_methods : Odoc_info.Value.t_method list
    method list_module_types : Odoc_info.Module.t_module_type list
    method list_modules : Odoc_info.Module.t_module list
    method list_types : Odoc_info.Type.t_type list
    method list_values : Odoc_info.Value.t_value list
    method meta : Buffer.t -> unit
    method output_class_type : Odoc_info.Name.t -> + string -> + Types.class_type -> + unit
    method private output_code : ?with_pre:bool -> + Odoc_info.Name.t -> + string -> + string -> + unit
    method output_module_type : Odoc_info.Name.t -> + string -> + Types.module_type -> + unit
    method prepare_header : Odoc_info.Module.t_module list -> unit
    method print_header : Buffer.t -> + ?nav: + (Odoc_info.Name.t option * Odoc_info.Name.t option * Odoc_info.Name.t) + option -> + ?comments:Odoc_info.text list -> + string -> + unit
    method print_navbar : Buffer.t -> + Odoc_info.Name.t option -> + Odoc_info.Name.t option -> + Odoc_info.Name.t -> + unit
    method title : string
    diff --git a/ocaml/Odoc_html/Generator/index.html b/ocaml/Odoc_html/Generator/index.html new file mode 100644 index 0000000..893f3f2 --- /dev/null +++ b/ocaml/Odoc_html/Generator/index.html @@ -0,0 +1,2 @@ + +Generator (ocaml.Odoc_html.Generator)

    Module Odoc_html.Generator

    class html : object ... end
    diff --git a/ocaml/Odoc_html/Naming/index.html b/ocaml/Odoc_html/Naming/index.html new file mode 100644 index 0000000..3fa6c97 --- /dev/null +++ b/ocaml/Odoc_html/Naming/index.html @@ -0,0 +1,17 @@ + +Naming (ocaml.Odoc_html.Naming)

    Module Odoc_html.Naming

    val mark_module : string
    val mark_module_type : string
    val mark_type : string
    val mark_type_elt : string
    val mark_function : string
    val mark_extension : string
    val mark_exception : string
    val mark_value : string
    val mark_attribute : string
    val mark_method : string
    val code_prefix : string
    val type_prefix : string
    val html_files : string -> string * string
    val target : string -> string -> string
    val complete_target : string -> Odoc_info.Name.t -> string
    val module_target : Odoc_info.Module.t_module -> string
    val module_type_target : Odoc_info.Module.t_module_type -> string
    val type_target : Odoc_info.Type.t_type -> string
    val const_target : + Odoc_info.Type.t_type -> + Odoc_info.Type.variant_constructor -> + string
    val recfield_target : + Odoc_info.Type.t_type -> + Odoc_info.Type.record_field -> + string
    val inline_recfield_target : + string -> + string -> + Odoc_info.Type.record_field -> + string
    val objfield_target : + Odoc_info.Type.t_type -> + Odoc_info.Type.object_field -> + string
    val complete_type_target : Odoc_info.Type.t_type -> string
    val complete_recfield_target : Odoc_info.Name.t -> string
    val complete_const_target : Odoc_info.Name.t -> string
    val extension_target : Odoc_info.Extension.t_extension_constructor -> string
    val complete_extension_target : + Odoc_info.Extension.t_extension_constructor -> + string
    val exception_target : Odoc_info.Exception.t_exception -> string
    val complete_exception_target : Odoc_info.Exception.t_exception -> string
    val value_target : Odoc_info.Value.t_value -> string
    val subst_infix_symbols : string -> string
    val complete_value_target : Odoc_info.Value.t_value -> string
    val file_code_value_complete_target : Odoc_info.Value.t_value -> string
    val attribute_target : Odoc_info.Value.t_attribute -> string
    val complete_attribute_target : Odoc_info.Value.t_attribute -> string
    val file_code_attribute_complete_target : Odoc_info.Value.t_attribute -> string
    val method_target : Odoc_info.Value.t_method -> string
    val complete_method_target : Odoc_info.Value.t_method -> string
    val file_code_method_complete_target : Odoc_info.Value.t_method -> string
    val label_target : string -> string
    val complete_label_target : Odoc_info.Name.t -> string
    val file_type_module_complete_target : string -> string
    val file_code_module_complete_target : string -> string
    val file_type_class_complete_target : string -> string
    diff --git a/ocaml/Odoc_html/index.html b/ocaml/Odoc_html/index.html new file mode 100644 index 0000000..b232c8f --- /dev/null +++ b/ocaml/Odoc_html/index.html @@ -0,0 +1,2 @@ + +Odoc_html (ocaml.Odoc_html)

    Module Odoc_html

    Generation of html documentation.

    module String = Misc.Stdlib.String
    val with_parameter_list : bool ref
    val css_style : string option ref
    val index_only : bool ref
    val colorize_code : bool ref
    val html_short_functors : bool ref
    val charset : string ref
    val show_navbar : bool ref
    module Naming : sig ... end
    module Generator : sig ... end
    module type Html_generator = sig ... end
    diff --git a/ocaml/Odoc_html/module-type-Html_generator/class-html/index.html b/ocaml/Odoc_html/module-type-Html_generator/class-html/index.html new file mode 100644 index 0000000..48b999d --- /dev/null +++ b/ocaml/Odoc_html/module-type-Html_generator/class-html/index.html @@ -0,0 +1,166 @@ + +html (ocaml.Odoc_html.Html_generator.html)

    Class Html_generator.html

    val mutable default_style_options : string list
    val mutable doctype : string
    val mutable header : Buffer.t -> + ?nav: + (Odoc_info.Name.t option * Odoc_info.Name.t option * Odoc_info.Name.t) + option -> + ?comments:Odoc_info.text list -> + string -> + unit
    val mutable known_classes_names : String.Set.t
    val mutable known_modules_names : String.Set.t
    val mutable known_types_names : String.Set.t
    val mutable list_attributes : Odoc_info.Value.t_attribute list
    val mutable list_class_types : Odoc_info.Class.t_class_type list
    val mutable list_classes : Odoc_info.Class.t_class list
    val mutable list_exceptions : Odoc_info.Exception.t_exception list
    val mutable list_extensions : Odoc_info.Extension.t_extension_constructor list
    val mutable list_methods : Odoc_info.Value.t_method list
    val mutable list_module_types : Odoc_info.Module.t_module_type list
    val mutable list_modules : Odoc_info.Module.t_module list
    val mutable list_types : Odoc_info.Type.t_type list
    val mutable list_values : Odoc_info.Value.t_value list
    val mutable style : string
    val mutable style_file : string
    val mutable tag_functions : (string * (Odoc_info.text -> string)) list
    method character_encoding : Buffer.t -> unit
    method constructor : string -> string
    method create_title_label : (int * string option * Odoc_info.text) -> string
    method escape : string -> string
    method generate : Odoc_info.Module.t_module list -> unit
    method generate_attributes_index : Odoc_info.Module.t_module list -> unit
    method generate_class_inheritance_info : Buffer.t -> + Odoc_info.Class.t_class -> + unit
    method generate_class_type_inheritance_info : Buffer.t -> + Odoc_info.Class.t_class_type -> + unit
    method generate_class_types_index : Odoc_info.Module.t_module list -> unit
    method generate_classes_index : Odoc_info.Module.t_module list -> unit
    method generate_elements : ('a option -> 'a option -> 'a -> unit) -> + 'a list -> + unit
    method generate_elements_index : ?strip_libname:bool -> + 'a list -> + ('a -> Odoc_info.Name.t) -> + ('a -> Odoc_info.info option) -> + ('a -> string) -> + string -> + string -> + unit
    method generate_exceptions_index : Odoc_info.Module.t_module list -> unit
    method generate_extensions_index : Odoc_info.Module.t_module list -> unit
    method generate_for_class : Odoc_info.Class.t_class option -> + Odoc_info.Class.t_class option -> + Odoc_info.Class.t_class -> + unit
    method generate_for_class_type : Odoc_info.Class.t_class_type option -> + Odoc_info.Class.t_class_type option -> + Odoc_info.Class.t_class_type -> + unit
    method generate_for_module : Odoc_info.Module.t_module option -> + Odoc_info.Module.t_module option -> + Odoc_info.Module.t_module -> + unit
    method generate_for_module_type : Odoc_info.Module.t_module_type option -> + Odoc_info.Module.t_module_type option -> + Odoc_info.Module.t_module_type -> + unit
    method generate_index : Odoc_info.Module.t_module list -> unit
    method generate_inheritance_info : Buffer.t -> + Odoc_info.Class.inherited_class list -> + unit
    method generate_methods_index : Odoc_info.Module.t_module list -> unit
    method generate_module_types_index : Odoc_info.Module.t_module list -> unit
    method generate_modules_index : Odoc_info.Module.t_module list -> unit
    method generate_types_index : Odoc_info.Module.t_module list -> unit
    method generate_values_index : Odoc_info.Module.t_module list -> unit
    method html_of_Block : Buffer.t -> Odoc_info.text -> unit
    method html_of_Bold : Buffer.t -> Odoc_info.text -> unit
    method html_of_Center : Buffer.t -> Odoc_info.text -> unit
    method html_of_Code : Buffer.t -> string -> unit
    method html_of_CodePre : Buffer.t -> string -> unit
    method html_of_Emphasize : Buffer.t -> Odoc_info.text -> unit
    method html_of_Enum : Buffer.t -> Odoc_info.text list -> unit
    method html_of_Index_list : Buffer.t -> unit
    method html_of_Italic : Buffer.t -> Odoc_info.text -> unit
    method html_of_Latex : Buffer.t -> string -> unit
    method html_of_Left : Buffer.t -> Odoc_info.text -> unit
    method html_of_List : Buffer.t -> Odoc_info.text list -> unit
    method html_of_Module_list : Buffer.t -> Odoc_info.Name.t list -> unit
    method html_of_Newline : Buffer.t -> unit
    method html_of_Raw : Buffer.t -> string -> unit
    method html_of_Ref : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.ref_kind option -> + Odoc_info.text option -> + unit
    method html_of_Right : Buffer.t -> Odoc_info.text -> unit
    method html_of_Subscript : Buffer.t -> Odoc_info.text -> unit
    method html_of_Superscript : Buffer.t -> Odoc_info.text -> unit
    method html_of_Target : Buffer.t -> target:string -> code:string -> unit
    method html_of_Title : Buffer.t -> + int -> + string option -> + Odoc_info.text -> + unit
    method html_of_Verbatim : Buffer.t -> string -> unit
    method html_of_alerts : Buffer.t -> Odoc_info.alert list -> unit
    method html_of_attribute : Buffer.t -> Odoc_info.Value.t_attribute -> unit
    method html_of_author_list : Buffer.t -> string list -> unit
    method html_of_before : Buffer.t -> (string * Odoc_info.text) list -> unit
    method html_of_class : Buffer.t -> + ?complete:bool -> + ?with_link:bool -> + Odoc_info.Class.t_class -> + unit
    method html_of_class_comment : Buffer.t -> Odoc_info.text -> unit
    method html_of_class_element : Buffer.t -> + Odoc_info.Class.class_element -> + unit
    method html_of_class_kind : Buffer.t -> + Odoc_info.Name.t -> + ?cl:Odoc_info.Class.t_class -> + Odoc_info.Class.class_kind -> + unit
    method html_of_class_parameter_list : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Class.t_class -> + unit
    method html_of_class_type : Buffer.t -> + ?complete:bool -> + ?with_link:bool -> + Odoc_info.Class.t_class_type -> + unit
    method html_of_class_type_kind : Buffer.t -> + Odoc_info.Name.t -> + ?ct:Odoc_info.Class.t_class_type -> + Odoc_info.Class.class_type_kind -> + unit
    method html_of_class_type_param_expr_list : Buffer.t -> + Odoc_info.Name.t -> + Types.type_expr list -> + unit
    method html_of_code : Buffer.t -> ?with_pre:bool -> string -> unit
    method html_of_cstr_args : ?par:bool -> + Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Name.t -> + string -> + Odoc_info.Type.constructor_args -> + unit
    method html_of_custom : Buffer.t -> (string * Odoc_info.text) list -> unit
    method html_of_custom_text : Buffer.t -> string -> Odoc_info.text -> unit
    method html_of_dag : (Odoc_info.Name.t * Odoc_info.Class.cct option) + Odoc_dag2html.dag -> + string
    method html_of_described_parameter_list : Buffer.t -> + Odoc_info.Name.t -> + Odoc_parameter.parameter list -> + unit
    method html_of_exception : Buffer.t -> Odoc_info.Exception.t_exception -> unit
    method html_of_included_module : Buffer.t -> + Odoc_info.Module.included_module -> + unit
    method html_of_info : ?cls:string -> + ?indent:bool -> + Buffer.t -> + Odoc_types.info option -> + unit
    method html_of_info_first_sentence : Buffer.t -> Odoc_info.info option -> unit
    method html_of_method : Buffer.t -> Odoc_info.Value.t_method -> unit
    method html_of_modtype : Buffer.t -> + ?info:bool -> + ?complete:bool -> + ?with_link:bool -> + Odoc_info.Module.t_module_type -> + unit
    method html_of_module : Buffer.t -> + ?info:bool -> + ?complete:bool -> + ?with_link:bool -> + Odoc_info.Module.t_module -> + unit
    method html_of_module_comment : Buffer.t -> Odoc_info.text -> unit
    method html_of_module_element : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Module.module_element -> + unit
    method html_of_module_kind : Buffer.t -> + Odoc_info.Name.t -> + ?modu:Odoc_info.Module.t_module -> + Odoc_info.Module.module_kind -> + unit
    method html_of_module_parameter : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Module.module_parameter -> + unit
    method html_of_module_parameter_list : Buffer.t -> + Odoc_info.Name.t -> + (Odoc_info.Module.module_parameter * Odoc_info.text option) list -> + unit
    method html_of_module_parameter_type : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Module.module_parameter -> + unit
    method html_of_module_type : Buffer.t -> + ?code:string -> + Odoc_info.Name.t -> + Types.module_type -> + unit
    method html_of_module_type_kind : Buffer.t -> + Odoc_info.Name.t -> + ?modu:Odoc_info.Module.t_module -> + ?mt:Odoc_info.Module.t_module_type -> + Odoc_info.Module.module_type_kind -> + unit
    method html_of_parameter_description : Buffer.t -> + Odoc_info.Parameter.parameter -> + unit
    method html_of_parameter_list : Buffer.t -> + Odoc_info.Name.t -> + Odoc_parameter.parameter list -> + unit
    method html_of_raised_exceptions : Buffer.t -> + (string * Odoc_info.text) list -> + unit
    method html_of_record : father:Odoc_info.Name.t -> + close_env:string -> + (Odoc_info.Type.record_field -> string) -> + Buffer.t -> + Odoc_info.Type.record_field list -> + unit
    method html_of_return_opt : Buffer.t -> Odoc_info.text option -> unit
    method html_of_see : Buffer.t -> (Odoc_info.see_ref * Odoc_info.text) -> unit
    method html_of_sees : Buffer.t -> + (Odoc_info.see_ref * Odoc_info.text) list -> + unit
    method html_of_since_opt : Buffer.t -> string option -> unit
    method html_of_text : ?with_p:bool -> Buffer.t -> Odoc_info.text -> unit
    method html_of_text_element : Buffer.t -> Odoc_info.text_element -> unit
    method html_of_text_with_p : Buffer.t -> Odoc_info.text -> unit
    method html_of_type : Buffer.t -> Odoc_info.Type.t_type -> unit
    method html_of_type_expr : Buffer.t -> + Odoc_info.Name.t -> + Types.type_expr -> + unit
    method html_of_type_expr_param_list : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Type.t_type -> + unit
    method html_of_type_extension : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Extension.t_type_extension -> + unit
    method html_of_value : Buffer.t -> Odoc_info.Value.t_value -> unit
    method html_of_version_opt : Buffer.t -> string option -> unit
    method index : string
    method index_attributes : string
    method index_class_types : string
    method index_classes : string
    method index_exceptions : string
    method index_extensions : string
    method index_methods : string
    method index_module_types : string
    method index_modules : string
    method index_prefix : string
    method index_types : string
    method index_values : string
    method init_style : unit
    method inner_title : Odoc_info.Name.t -> string
    method keep_alpha_num : string -> string
    method keyword : string -> string
    method label_of_text : Odoc_info.text -> string
    method list_attributes : Odoc_info.Value.t_attribute list
    method list_class_types : Odoc_info.Class.t_class_type list
    method list_classes : Odoc_info.Class.t_class list
    method list_exceptions : Odoc_info.Exception.t_exception list
    method list_extensions : Odoc_info.Extension.t_extension_constructor list
    method list_methods : Odoc_info.Value.t_method list
    method list_module_types : Odoc_info.Module.t_module_type list
    method list_modules : Odoc_info.Module.t_module list
    method list_types : Odoc_info.Type.t_type list
    method list_values : Odoc_info.Value.t_value list
    method meta : Buffer.t -> unit
    method output_class_type : Odoc_info.Name.t -> + string -> + Types.class_type -> + unit
    method private output_code : ?with_pre:bool -> + Odoc_info.Name.t -> + string -> + string -> + unit
    method output_module_type : Odoc_info.Name.t -> + string -> + Types.module_type -> + unit
    method prepare_header : Odoc_info.Module.t_module list -> unit
    method print_header : Buffer.t -> + ?nav: + (Odoc_info.Name.t option * Odoc_info.Name.t option * Odoc_info.Name.t) + option -> + ?comments:Odoc_info.text list -> + string -> + unit
    method print_navbar : Buffer.t -> + Odoc_info.Name.t option -> + Odoc_info.Name.t option -> + Odoc_info.Name.t -> + unit
    method title : string
    diff --git a/ocaml/Odoc_html/module-type-Html_generator/index.html b/ocaml/Odoc_html/module-type-Html_generator/index.html new file mode 100644 index 0000000..fa53dce --- /dev/null +++ b/ocaml/Odoc_html/module-type-Html_generator/index.html @@ -0,0 +1,2 @@ + +Html_generator (ocaml.Odoc_html.Html_generator)

    Module type Odoc_html.Html_generator

    class html : object ... end
    diff --git a/ocaml/Odoc_info/Class/index.html b/ocaml/Odoc_info/Class/index.html new file mode 100644 index 0000000..989bec7 --- /dev/null +++ b/ocaml/Odoc_info/Class/index.html @@ -0,0 +1,5 @@ + +Class (ocaml.Odoc_info.Class)

    Module Odoc_info.Class

    Representation and manipulation of classes and class types.

    Types

    type class_element = Odoc_class.class_element =
    1. | Class_attribute of Value.t_attribute
    2. | Class_method of Value.t_method
    3. | Class_comment of text

    To keep the order of elements in a class.

    type cct = Odoc_class.cct =
    1. | Cl of t_class
    2. | Cltype of t_class_type * Types.type_expr list
      (*

      Class type and type parameters.

      *)

    Used when we can reference a t_class or a t_class_type.

    and inherited_class = Odoc_class.inherited_class = {
    1. ic_name : Name.t;
      (*

      Complete name of the inherited class.

      *)
    2. mutable ic_class : cct option;
      (*

      The associated t_class or t_class_type.

      *)
    3. ic_text : text option;
      (*

      The inheritance description, if any.

      *)
    }
    and class_apply = Odoc_class.class_apply = {
    1. capp_name : Name.t;
      (*

      The complete name of the applied class.

      *)
    2. mutable capp_class : t_class option;
      (*

      The associated t_class if we found it.

      *)
    3. capp_params : Types.type_expr list;
      (*

      The type of expressions the class is applied to.

      *)
    4. capp_params_code : string list;
      (*

      The code of these expressions.

      *)
    }
    and class_constr = Odoc_class.class_constr = {
    1. cco_name : Name.t;
      (*

      The complete name of the applied class.

      *)
    2. mutable cco_class : cct option;
      (*

      The associated class or class type if we found it.

      *)
    3. cco_type_parameters : Types.type_expr list;
      (*

      The type parameters of the class, if needed.

      *)
    }
    and class_kind = Odoc_class.class_kind =
    1. | Class_structure of inherited_class list * class_element list
      (*

      An explicit class structure, used in implementation and interface.

      *)
    2. | Class_apply of class_apply
      (*

      Application/alias of a class, used in implementation only.

      *)
    3. | Class_constr of class_constr
      (*

      A class used to give the type of the defined class, instead of a structure, used in interface only. For example, it will be used with the name M1.M2....bar when the class foo is defined like this : class foo : int -> bar

      *)
    4. | Class_constraint of class_kind * class_type_kind
      (*

      A class definition with a constraint.

      *)
    and t_class = Odoc_class.t_class = {
    1. cl_name : Name.t;
      (*

      Complete name of the class.

      *)
    2. mutable cl_info : info option;
      (*

      Information found in the optional associated comment.

      *)
    3. cl_type : Types.class_type;
      (*

      Type of the class.

      *)
    4. cl_type_parameters : Types.type_expr list;
      (*

      Type parameters.

      *)
    5. cl_virtual : bool;
      (*

      true when the class is virtual.

      *)
    6. mutable cl_kind : class_kind;
      (*

      The way the class is defined.

      *)
    7. mutable cl_parameters : Parameter.parameter list;
      (*

      The parameters of the class.

      *)
    8. mutable cl_loc : location;
    }

    Representation of a class.

    and class_type_alias = Odoc_class.class_type_alias = {
    1. cta_name : Name.t;
      (*

      Complete name of the target class type.

      *)
    2. mutable cta_class : cct option;
      (*

      The target t_class or t_class_type, if we found it.

      *)
    3. cta_type_parameters : Types.type_expr list;
      (*

      The type parameters. FIXME : use strings?

      *)
    }
    and class_type_kind = Odoc_class.class_type_kind =
    1. | Class_signature of inherited_class list * class_element list
    2. | Class_type of class_type_alias
      (*

      A class type eventually applied to type args.

      *)
    and t_class_type = Odoc_class.t_class_type = {
    1. clt_name : Name.t;
      (*

      Complete name of the type.

      *)
    2. mutable clt_info : info option;
      (*

      Information found in the optional associated comment.

      *)
    3. clt_type : Types.class_type;
    4. clt_type_parameters : Types.type_expr list;
      (*

      Type parameters.

      *)
    5. clt_virtual : bool;
      (*

      true if the class type is virtual

      *)
    6. mutable clt_kind : class_type_kind;
      (*

      The way the class type is defined.

      *)
    7. mutable clt_loc : location;
    }

    Representation of a class type.

    Functions

    val class_elements : ?trans:bool -> t_class -> class_element list

    Access to the elements of a class.

    val class_attributes : ?trans:bool -> t_class -> Value.t_attribute list

    Access to the list of class attributes.

    val class_parameter_text_by_name : t_class -> string -> text option

    Access to the description associated to the given class parameter name.

    val class_methods : ?trans:bool -> t_class -> Value.t_method list

    Access to the methods of a class.

    val class_comments : ?trans:bool -> t_class -> text list

    Access to the comments of a class.

    val class_type_elements : ?trans:bool -> t_class_type -> class_element list

    Access to the elements of a class type.

    val class_type_attributes : + ?trans:bool -> + t_class_type -> + Value.t_attribute list

    Access to the list of class type attributes.

    val class_type_parameter_text_by_name : t_class_type -> string -> text option

    Access to the description associated to the given class type parameter name.

    val class_type_methods : ?trans:bool -> t_class_type -> Value.t_method list

    Access to the methods of a class type.

    val class_type_comments : ?trans:bool -> t_class_type -> text list

    Access to the comments of a class type.

    diff --git a/ocaml/Odoc_info/Dep/index.html b/ocaml/Odoc_info/Dep/index.html new file mode 100644 index 0000000..df35830 --- /dev/null +++ b/ocaml/Odoc_info/Dep/index.html @@ -0,0 +1,5 @@ + +Dep (ocaml.Odoc_info.Dep)

    Module Odoc_info.Dep

    Computation of dependencies.

    val kernel_deps_of_modules : Module.t_module list -> unit

    Modify the module dependencies of the given list of modules, to get the minimum transitivity kernel.

    val deps_of_types : + ?kernel:bool -> + Type.t_type list -> + (Type.t_type * Name.t list) list

    Return the list of dependencies between the given types, in the form of a list (type name, names of types it depends on).

    • parameter kernel

      indicates if we must keep only the transitivity kernel of the dependencies. Default is false.

    diff --git a/ocaml/Odoc_info/Exception/index.html b/ocaml/Odoc_info/Exception/index.html new file mode 100644 index 0000000..77e3fc6 --- /dev/null +++ b/ocaml/Odoc_info/Exception/index.html @@ -0,0 +1,2 @@ + +Exception (ocaml.Odoc_info.Exception)

    Module Odoc_info.Exception

    Representation and manipulation of exceptions.

    type exception_alias = Odoc_exception.exception_alias = {
    1. ea_name : Name.t;
      (*

      The complete name of the target exception.

      *)
    2. mutable ea_ex : t_exception option;
      (*

      The target exception, if we found it.

      *)
    }

    Used when the exception is a rebind of another exception, when we have exception Ex = Target_ex.

    and t_exception = Odoc_exception.t_exception = {
    1. ex_name : Name.t;
    2. mutable ex_info : info option;
      (*

      Information found in the optional associated comment.

      *)
    3. ex_args : Odoc_type.constructor_args;
    4. ex_ret : Types.type_expr option;
      (*

      The optional return type of the exception.

      *)
    5. ex_alias : exception_alias option;
      (*

      None when the exception is not a rebind.

      *)
    6. mutable ex_loc : location;
    7. mutable ex_code : string option;
    }
    diff --git a/ocaml/Odoc_info/Extension/index.html b/ocaml/Odoc_info/Extension/index.html new file mode 100644 index 0000000..a345725 --- /dev/null +++ b/ocaml/Odoc_info/Extension/index.html @@ -0,0 +1,2 @@ + +Extension (ocaml.Odoc_info.Extension)

    Module Odoc_info.Extension

    Representation and manipulation of extensions.

    type private_flag = Odoc_extension.private_flag =
    1. | Private
    2. | Public
    type extension_alias = Odoc_extension.extension_alias = {
    1. xa_name : Name.t;
      (*

      The complete name of the target extension.

      *)
    2. mutable xa_xt : t_extension_constructor option;
      (*

      The target extension, if we found it.

      *)
    }

    Used when the extension is a rebind of another extension, when we have extension Xt = Target_xt.

    and t_extension_constructor = Odoc_extension.t_extension_constructor = {
    1. xt_name : Name.t;
    2. xt_args : Odoc_type.constructor_args;
    3. xt_ret : Types.type_expr option;
      (*

      the optional return type of the extension

      *)
    4. xt_type_extension : t_type_extension;
      (*

      the type extension containing this constructor

      *)
    5. xt_alias : extension_alias option;
      (*

      None when the extension is not a rebind.

      *)
    6. mutable xt_loc : Odoc_types.location;
    7. mutable xt_text : Odoc_types.info option;
      (*

      optional user description

      *)
    }
    and t_type_extension = Odoc_extension.t_type_extension = {
    1. mutable te_info : info option;
      (*

      Information found in the optional associated comment.

      *)
    2. te_type_name : Name.t;
      (*

      The type of the extension

      *)
    3. te_type_parameters : Types.type_expr list;
    4. te_private : private_flag;
    5. mutable te_constructors : t_extension_constructor list;
    6. mutable te_loc : location;
    7. mutable te_code : string option;
    }
    val extension_constructors : t_type_extension -> t_extension_constructor list

    Access to the extensions in a group.

    diff --git a/ocaml/Odoc_info/Global/index.html b/ocaml/Odoc_info/Global/index.html new file mode 100644 index 0000000..ea8bbe3 --- /dev/null +++ b/ocaml/Odoc_info/Global/index.html @@ -0,0 +1,2 @@ + +Global (ocaml.Odoc_info.Global)

    Module Odoc_info.Global

    val errors : int ref
    val warn_error : bool ref
    val out_file : string ref

    The file used by the generators outputting only one file.

    val verbose : bool ref

    Verbose mode or not.

    val target_dir : string ref

    The directory where files have to be generated.

    val title : string option ref

    The optional title to use in the generated documentation.

    val intro_file : string option ref

    The optional file whose content can be used as intro text.

    val with_toc : bool ref

    The flag which indicates if we must generate a table of contents.

    val with_index : bool ref

    The flag which indicates if we must generate an index.

    val with_header : bool ref

    The flag which indicates if we must generate a header.

    val with_trailer : bool ref

    The flag which indicates if we must generate a trailer.

    diff --git a/ocaml/Odoc_info/Module/index.html b/ocaml/Odoc_info/Module/index.html new file mode 100644 index 0000000..3673381 --- /dev/null +++ b/ocaml/Odoc_info/Module/index.html @@ -0,0 +1,29 @@ + +Module (ocaml.Odoc_info.Module)

    Module Odoc_info.Module

    Representation and manipulation of modules and module types.

    Types

    type module_element = Odoc_module.module_element =
    1. | Element_module of t_module
    2. | Element_module_type of t_module_type
    3. | Element_included_module of included_module
    4. | Element_class of Class.t_class
    5. | Element_class_type of Class.t_class_type
    6. | Element_value of Value.t_value
    7. | Element_type_extension of Extension.t_type_extension
    8. | Element_exception of Exception.t_exception
    9. | Element_type of Type.t_type
    10. | Element_module_comment of text

    To keep the order of elements in a module.

    and mmt = Odoc_module.mmt =
    1. | Mod of t_module
    2. | Modtype of t_module_type

    Used where we can reference t_module or t_module_type.

    and included_module = Odoc_module.included_module = {
    1. im_name : Name.t;
      (*

      Complete name of the included module.

      *)
    2. mutable im_module : mmt option;
      (*

      The included module or module type, if we found it.

      *)
    3. mutable im_info : Odoc_types.info option;
      (*

      comment associated with the include directive

      *)
    }
    and module_alias = Odoc_module.module_alias = {
    1. ma_name : Name.t;
      (*

      Complete name of the target module.

      *)
    2. mutable ma_module : mmt option;
      (*

      The real module or module type if we could associate it.

      *)
    }
    and module_parameter = Odoc_module.module_parameter = {
    1. mp_name : string;
      (*

      the name

      *)
    2. mp_type : Types.module_type option;
      (*

      the type

      *)
    3. mp_type_code : string;
      (*

      the original code

      *)
    4. mp_kind : module_type_kind;
      (*

      the way the parameter was built

      *)
    }
    and module_kind = Odoc_module.module_kind =
    1. | Module_struct of module_element list
      (*

      A complete module structure.

      *)
    2. | Module_alias of module_alias
      (*

      Complete name and corresponding module if we found it

      *)
    3. | Module_functor of module_parameter * module_kind
      (*

      A functor, with its parameter and the rest of its definition

      *)
    4. | Module_apply of module_kind * module_kind
      (*

      A module defined by application of a functor.

      *)
    5. | Module_apply_unit of module_kind
      (*

      A generative application of a functor.

      *)
    6. | Module_with of module_type_kind * string
      (*

      A module whose type is a with ... constraint. Should appear in interface files only.

      *)
    7. | Module_constraint of module_kind * module_type_kind
      (*

      A module constraint by a module type.

      *)
    8. | Module_typeof of string
      (*

      by now only the code of the module expression

      *)
    9. | Module_unpack of string * module_type_alias
      (*

      code of the expression and module type alias

      *)

    Different kinds of a module.

    and t_module = Odoc_module.t_module = {
    1. m_name : Name.t;
      (*

      Complete name of the module.

      *)
    2. mutable m_type : Types.module_type;
      (*

      The type of the module.

      *)
    3. mutable m_info : info option;
      (*

      Information found in the optional associated comment.

      *)
    4. m_is_interface : bool;
      (*

      true for modules read from interface files

      *)
    5. m_file : string;
      (*

      The file the module is defined in.

      *)
    6. mutable m_kind : module_kind;
      (*

      The way the module is defined.

      *)
    7. mutable m_loc : location;
    8. mutable m_top_deps : Name.t list;
      (*

      The toplevels module names this module depends on.

      *)
    9. mutable m_code : string option;
      (*

      The whole code of the module

      *)
    10. mutable m_code_intf : string option;
      (*

      The whole code of the interface of the module

      *)
    11. m_text_only : bool;
      (*

      true if the module comes from a text file

      *)
    }

    Representation of a module.

    and module_type_alias = Odoc_module.module_type_alias = {
    1. mta_name : Name.t;
      (*

      Complete name of the target module type.

      *)
    2. mutable mta_module : t_module_type option;
      (*

      The real module type if we could associate it.

      *)
    }
    and module_type_kind = Odoc_module.module_type_kind =
    1. | Module_type_struct of module_element list
      (*

      A complete module signature.

      *)
    2. | Module_type_functor of module_parameter * module_type_kind
      (*

      A functor, with its parameter and the rest of its definition

      *)
    3. | Module_type_alias of module_type_alias
      (*

      Complete alias name and corresponding module type if we found it.

      *)
    4. | Module_type_with of module_type_kind * string
      (*

      The module type kind and the code of the with constraint.

      *)
    5. | Module_type_typeof of string
      (*

      by now only the code of the module expression

      *)

    Different kinds of module type.

    and t_module_type = Odoc_module.t_module_type = {
    1. mt_name : Name.t;
      (*

      Complete name of the module type.

      *)
    2. mutable mt_info : info option;
      (*

      Information found in the optional associated comment.

      *)
    3. mutable mt_type : Types.module_type option;
      (*

      None means that the module type is abstract.

      *)
    4. mt_is_interface : bool;
      (*

      true for modules read from interface files.

      *)
    5. mt_file : string;
      (*

      The file the module type is defined in.

      *)
    6. mutable mt_kind : module_type_kind option;
      (*

      The way the module is defined. None means that module type is abstract. It is always None when the module type was extracted from the implementation file. That means module types are only analysed in interface files.

      *)
    7. mutable mt_loc : location;
    }

    Representation of a module type.

    Functions for modules

    val module_elements : ?trans:bool -> t_module -> module_element list

    Access to the elements of a module.

    val module_modules : ?trans:bool -> t_module -> t_module list

    Access to the submodules of a module.

    val module_module_types : ?trans:bool -> t_module -> t_module_type list

    Access to the module types of a module.

    val module_included_modules : ?trans:bool -> t_module -> included_module list

    Access to the included modules of a module.

    val module_type_extensions : + ?trans:bool -> + t_module -> + Extension.t_type_extension list

    Access to the type extensions of a module.

    val module_exceptions : ?trans:bool -> t_module -> Exception.t_exception list

    Access to the exceptions of a module.

    val module_types : ?trans:bool -> t_module -> Type.t_type list

    Access to the types of a module.

    val module_values : ?trans:bool -> t_module -> Value.t_value list

    Access to the values of a module.

    val module_functions : ?trans:bool -> t_module -> Value.t_value list

    Access to functional values of a module.

    val module_simple_values : ?trans:bool -> t_module -> Value.t_value list

    Access to non-functional values of a module.

    val module_classes : ?trans:bool -> t_module -> Class.t_class list

    Access to the classes of a module.

    val module_class_types : ?trans:bool -> t_module -> Class.t_class_type list

    Access to the class types of a module.

    val module_all_classes : ?trans:bool -> t_module -> Class.t_class list

    The list of classes defined in this module and all its submodules and functors.

    val module_is_functor : t_module -> bool

    true if the module is functor.

    val module_parameters : + ?trans:bool -> + t_module -> + (module_parameter * text option) list

    The list of couples (module parameter, optional description).

    val module_comments : ?trans:bool -> t_module -> text list

    The list of module comments.

    Functions for module types

    val module_type_elements : ?trans:bool -> t_module_type -> module_element list

    Access to the elements of a module type.

    val module_type_modules : ?trans:bool -> t_module_type -> t_module list

    Access to the submodules of a module type.

    val module_type_module_types : + ?trans:bool -> + t_module_type -> + t_module_type list

    Access to the module types of a module type.

    val module_type_included_modules : + ?trans:bool -> + t_module_type -> + included_module list

    Access to the included modules of a module type.

    val module_type_exceptions : + ?trans:bool -> + t_module_type -> + Exception.t_exception list

    Access to the exceptions of a module type.

    val module_type_types : ?trans:bool -> t_module_type -> Type.t_type list

    Access to the types of a module type.

    val module_type_values : ?trans:bool -> t_module_type -> Value.t_value list

    Access to the values of a module type.

    val module_type_functions : ?trans:bool -> t_module_type -> Value.t_value list

    Access to functional values of a module type.

    val module_type_simple_values : + ?trans:bool -> + t_module_type -> + Value.t_value list

    Access to non-functional values of a module type.

    val module_type_classes : ?trans:bool -> t_module_type -> Class.t_class list

    Access to the classes of a module type.

    val module_type_class_types : + ?trans:bool -> + t_module_type -> + Class.t_class_type list

    Access to the class types of a module type.

    val module_type_all_classes : + ?trans:bool -> + t_module_type -> + Class.t_class list

    The list of classes defined in this module type and all its submodules and functors.

    val module_type_is_functor : t_module_type -> bool

    true if the module type is functor.

    val module_type_parameters : + ?trans:bool -> + t_module_type -> + (module_parameter * text option) list

    The list of couples (module parameter, optional description).

    val module_type_comments : ?trans:bool -> t_module_type -> text list

    The list of module comments.

    diff --git a/ocaml/Odoc_info/Name/index.html b/ocaml/Odoc_info/Name/index.html new file mode 100644 index 0000000..cbd47a9 --- /dev/null +++ b/ocaml/Odoc_info/Name/index.html @@ -0,0 +1,2 @@ + +Name (ocaml.Odoc_info.Name)

    Module Odoc_info.Name

    Representation of element names.

    type t = string
    val simple : t -> t

    Access to the simple name.

    val concat : t -> t -> t

    concat t1 t2 returns the concatenation of t1 and t2.

    val depth : t -> int

    Return the depth of the name, i.e. the number of levels to the root. Example : depth "Toto.Tutu.name" = 3.

    val get_relative : t -> t -> t

    Take two names n1 and n2 = n3.n4 and return n4 if n3=n1 or else n2.

    val get_relative_opt : t -> t -> t

    Take two names n1 and n2 = n3.n4 and return n4 if n3=n1 and n1<>"" or else n2.

    val father : t -> t

    Return the name of the 'father' (like dirname for a file name).

    diff --git a/ocaml/Odoc_info/Parameter/index.html b/ocaml/Odoc_info/Parameter/index.html new file mode 100644 index 0000000..a119686 --- /dev/null +++ b/ocaml/Odoc_info/Parameter/index.html @@ -0,0 +1,2 @@ + +Parameter (ocaml.Odoc_info.Parameter)

    Module Odoc_info.Parameter

    Representation and manipulation of method / function / class / module parameters.

    Types

    type simple_name = Odoc_parameter.simple_name = {
    1. sn_name : string;
    2. sn_type : Types.type_expr;
    3. mutable sn_text : text option;
    }

    Representation of a simple parameter name

    type param_info = Odoc_parameter.param_info =
    1. | Simple_name of simple_name
    2. | Tuple of param_info list * Types.type_expr

    Representation of parameter names. We need it to represent parameter names in tuples. The value Tuple ([], t) stands for an anonymous parameter.

    type parameter = param_info

    A parameter is just a param_info.

    Functions

    val complete_name : parameter -> string

    Access to the name as a string. For tuples, parentheses and commas are added.

    Access to the complete type.

    val names : parameter -> string list

    Access to the list of names ; only one for a simple parameter, or a list for a tuple.

    val desc_by_name : parameter -> string -> text option

    Access to the description of a specific name.

    • raises Not_found

      if no description is associated to the given name.

    val type_by_name : parameter -> string -> Types.type_expr

    Access to the type of a specific name.

    • raises Not_found

      if no type is associated to the given name.

    diff --git a/ocaml/Odoc_info/Scan/class-scanner/index.html b/ocaml/Odoc_info/Scan/class-scanner/index.html new file mode 100644 index 0000000..94f70a3 --- /dev/null +++ b/ocaml/Odoc_info/Scan/class-scanner/index.html @@ -0,0 +1,2 @@ + +scanner (ocaml.Odoc_info.Scan.scanner)

    Class Scan.scanner

    method scan_value : Value.t_value -> unit
    method scan_type_pre : Type.t_type -> bool
    method scan_type_const : Type.t_type -> Type.variant_constructor -> unit
    method scan_type_recfield : Type.t_type -> Type.record_field -> unit
    method scan_type : Type.t_type -> unit
    method scan_extension_constructor : Extension.t_extension_constructor -> unit
    method scan_exception : Exception.t_exception -> unit
    method scan_attribute : Value.t_attribute -> unit
    method scan_method : Value.t_method -> unit
    method scan_included_module : Module.included_module -> unit

    Scan of a type extension

    method scan_type_extension_pre : Extension.t_type_extension -> bool

    Override this method to perform controls on the extension's type, private and info. This method is called before scanning the extension's constructors.

    • returns

      true if the extension's constructors must be scanned.

    method scan_type_extension_constructors : Extension.t_type_extension -> unit

    This method scans the constructors of the given type extension.

    method scan_type_extension : Extension.t_type_extension -> unit

    Scan of a type extension. Should not be overridden. It calls scan_type_extension_pre and if scan_type_extension_pre returns true, then it calls scan_type_extension_constructors.

    Scan of a class.

    method scan_class_comment : text -> unit

    Scan of a comment inside a class.

    method scan_class_pre : Class.t_class -> bool

    Override this method to perform controls on the class comment and params. This method is called before scanning the class elements.

    • returns

      true if the class elements must be scanned.

    method scan_class_elements : Class.t_class -> unit

    This method scans the elements of the given class.

    method scan_class : Class.t_class -> unit

    Scan of a class. Should not be overridden. It calls scan_class_pre and if scan_class_pre returns true, then it calls scan_class_elements.

    Scan of a class type.

    method scan_class_type_comment : text -> unit

    Scan of a comment inside a class type.

    method scan_class_type_pre : Class.t_class_type -> bool

    Override this method to perform controls on the class type comment and form. This method is called before scanning the class type elements.

    • returns

      true if the class type elements must be scanned.

    method scan_class_type_elements : Class.t_class_type -> unit

    This method scans the elements of the given class type.

    method scan_class_type : Class.t_class_type -> unit

    Scan of a class type. Should not be overridden. It calls scan_class_type_pre and if scan_class_type_pre returns true, then it calls scan_class_type_elements.

    Scan of modules.

    method scan_module_comment : text -> unit

    Scan of a comment inside a module.

    method scan_module_pre : Module.t_module -> bool

    Override this method to perform controls on the module comment and form. This method is called before scanning the module elements.

    • returns

      true if the module elements must be scanned.

    method scan_module_elements : Module.t_module -> unit

    This method scans the elements of the given module.

    method scan_module : Module.t_module -> unit

    Scan of a module. Should not be overridden. It calls scan_module_pre and if scan_module_pre returns true, then it calls scan_module_elements.

    Scan of module types.

    method scan_module_type_comment : text -> unit

    Scan of a comment inside a module type.

    method scan_module_type_pre : Module.t_module_type -> bool

    Override this method to perform controls on the module type comment and form. This method is called before scanning the module type elements.

    • returns

      true if the module type elements must be scanned.

    method scan_module_type_elements : Module.t_module_type -> unit

    This method scans the elements of the given module type.

    method scan_module_type : Module.t_module_type -> unit

    Scan of a module type. Should not be overridden. It calls scan_module_type_pre and if scan_module_type_pre returns true, then it calls scan_module_type_elements.

    Main scanning method.

    method scan_module_list : Module.t_module list -> unit

    Scan a list of modules.

    diff --git a/ocaml/Odoc_info/Scan/index.html b/ocaml/Odoc_info/Scan/index.html new file mode 100644 index 0000000..ea2ca7e --- /dev/null +++ b/ocaml/Odoc_info/Scan/index.html @@ -0,0 +1,2 @@ + +Scan (ocaml.Odoc_info.Scan)

    Module Odoc_info.Scan

    Scanning of collected information

    class scanner : object ... end
    diff --git a/ocaml/Odoc_info/Search/index.html b/ocaml/Odoc_info/Search/index.html new file mode 100644 index 0000000..b405aa5 --- /dev/null +++ b/ocaml/Odoc_info/Search/index.html @@ -0,0 +1,2 @@ + +Search (ocaml.Odoc_info.Search)

    Module Odoc_info.Search

    Research in elements

    type result_element = Odoc_search.result_element =
    1. | Res_module of Module.t_module
    2. | Res_module_type of Module.t_module_type
    3. | Res_class of Class.t_class
    4. | Res_class_type of Class.t_class_type
    5. | Res_value of Value.t_value
    6. | Res_type of Type.t_type
    7. | Res_extension of Extension.t_extension_constructor
    8. | Res_exception of Exception.t_exception
    9. | Res_attribute of Value.t_attribute
    10. | Res_method of Value.t_method
    11. | Res_section of string * text
    12. | Res_recfield of Type.t_type * Type.record_field
    13. | Res_const of Type.t_type * Type.variant_constructor
    type search_result = result_element list

    The type representing a research result.

    val search_by_name : Module.t_module list -> Str.regexp -> search_result

    Research of the elements whose name matches the given regular expression.

    val values : Module.t_module list -> Value.t_value list

    A function to search all the values in a list of modules.

    A function to search all the extensions in a list of modules.

    val exceptions : Module.t_module list -> Exception.t_exception list

    A function to search all the exceptions in a list of modules.

    val types : Module.t_module list -> Type.t_type list

    A function to search all the types in a list of modules.

    val attributes : Module.t_module list -> Value.t_attribute list

    A function to search all the class attributes in a list of modules.

    val methods : Module.t_module list -> Value.t_method list

    A function to search all the class methods in a list of modules.

    val classes : Module.t_module list -> Class.t_class list

    A function to search all the classes in a list of modules.

    val class_types : Module.t_module list -> Class.t_class_type list

    A function to search all the class types in a list of modules.

    val modules : Module.t_module list -> Module.t_module list

    A function to search all the modules in a list of modules.

    val module_types : Module.t_module list -> Module.t_module_type list

    A function to search all the module types in a list of modules.

    diff --git a/ocaml/Odoc_info/Type/index.html b/ocaml/Odoc_info/Type/index.html new file mode 100644 index 0000000..6b21bac --- /dev/null +++ b/ocaml/Odoc_info/Type/index.html @@ -0,0 +1,2 @@ + +Type (ocaml.Odoc_info.Type)

    Module Odoc_info.Type

    Representation and manipulation of types.

    type private_flag = Odoc_type.private_flag =
    1. | Private
    2. | Public
    type record_field = Odoc_type.record_field = {
    1. rf_name : string;
      (*

      Name of the field.

      *)
    2. rf_mutable : bool;
      (*

      true if mutable.

      *)
    3. rf_type : Types.type_expr;
      (*

      Type of the field.

      *)
    4. mutable rf_text : info option;
      (*

      Optional description in the associated comment.

      *)
    }

    Description of a record type field.

    type constructor_args = Odoc_type.constructor_args =
    1. | Cstr_record of record_field list
    2. | Cstr_tuple of Types.type_expr list

    Description of a variant type constructor.

    type variant_constructor = Odoc_type.variant_constructor = {
    1. vc_name : string;
      (*

      Name of the constructor.

      *)
    2. vc_args : constructor_args;
    3. vc_ret : Types.type_expr option;
    4. mutable vc_text : info option;
      (*

      Optional description in the associated comment.

      *)
    }
    type type_kind = Odoc_type.type_kind =
    1. | Type_abstract
      (*

      Type is abstract, for example type t.

      *)
    2. | Type_variant of variant_constructor list
      (*

      constructors

      *)
    3. | Type_record of record_field list
      (*

      fields

      *)
    4. | Type_open
      (*

      Type is open

      *)

    The various kinds of a type.

    type object_field = Odoc_type.object_field = {
    1. of_name : string;
    2. of_type : Types.type_expr;
    3. mutable of_text : Odoc_types.info option;
      (*

      optional user description

      *)
    }
    type type_manifest = Odoc_type.type_manifest =
    1. | Other of Types.type_expr
      (*

      Type manifest directly taken from Typedtree.

      *)
    2. | Object_type of object_field list
    type t_type = Odoc_type.t_type = {
    1. ty_name : Name.t;
      (*

      Complete name of the type.

      *)
    2. mutable ty_info : info option;
      (*

      Information found in the optional associated comment.

      *)
    3. ty_parameters : (Types.type_expr * Types.Variance.t) list;
      (*

      type parameters: (type, variance)

      *)
    4. ty_kind : type_kind;
      (*

      Type kind.

      *)
    5. ty_private : private_flag;
      (*

      Private or public type.

      *)
    6. ty_manifest : type_manifest option;
    7. mutable ty_loc : location;
    8. mutable ty_code : string option;
    }

    Representation of a type.

    diff --git a/ocaml/Odoc_info/Value/index.html b/ocaml/Odoc_info/Value/index.html new file mode 100644 index 0000000..ce56989 --- /dev/null +++ b/ocaml/Odoc_info/Value/index.html @@ -0,0 +1,2 @@ + +Value (ocaml.Odoc_info.Value)

    Module Odoc_info.Value

    Representation and manipulation of values, class attributes and class methods.

    type t_value = Odoc_value.t_value = {
    1. val_name : Name.t;
      (*

      Complete name of the value.

      *)
    2. mutable val_info : info option;
      (*

      Information found in the optional associated comment.

      *)
    3. val_type : Types.type_expr;
      (*

      Type of the value.

      *)
    4. val_recursive : bool;
      (*

      true if the value is recursive.

      *)
    5. mutable val_parameters : Odoc_parameter.parameter list;
      (*

      The parameters, if any.

      *)
    6. mutable val_code : string option;
      (*

      The code of the value, if we had the only the implementation file.

      *)
    7. mutable val_loc : location;
    }

    Representation of a value.

    type t_attribute = Odoc_value.t_attribute = {
    1. att_value : t_value;
      (*

      an attribute has almost all the same information as a value

      *)
    2. att_mutable : bool;
      (*

      true if the attribute is mutable.

      *)
    3. att_virtual : bool;
      (*

      true if the attribute is virtual.

      *)
    }

    Representation of a class attribute.

    type t_method = Odoc_value.t_method = {
    1. met_value : t_value;
      (*

      a method has almost all the same information as a value

      *)
    2. met_private : bool;
      (*

      true if the method is private.

      *)
    3. met_virtual : bool;
      (*

      true if the method is virtual.

      *)
    }

    Representation of a class method.

    val is_function : t_value -> bool

    Return true if the value is a function, i.e. it has a functional type.

    val value_parameter_text_by_name : t_value -> string -> text option

    Access to the description associated to the given parameter name.

    diff --git a/ocaml/Odoc_info/index.html b/ocaml/Odoc_info/index.html new file mode 100644 index 0000000..236e18e --- /dev/null +++ b/ocaml/Odoc_info/index.html @@ -0,0 +1,15 @@ + +Odoc_info (ocaml.Odoc_info)

    Module Odoc_info

    Interface to the information collected in source files.

    type ref_kind = Odoc_types.ref_kind =
    1. | RK_module
    2. | RK_module_type
    3. | RK_class
    4. | RK_class_type
    5. | RK_value
    6. | RK_type
    7. | RK_extension
    8. | RK_exception
    9. | RK_attribute
    10. | RK_method
    11. | RK_section of text
    12. | RK_recfield
    13. | RK_const

    The different kinds of element references.

    and text_element = Odoc_types.text_element =
    1. | Raw of string
      (*

      Raw text.

      *)
    2. | Code of string
      (*

      The string is source code.

      *)
    3. | CodePre of string
      (*

      The string is pre-formatted source code.

      *)
    4. | Verbatim of string
      (*

      String 'as is'.

      *)
    5. | Bold of text
      (*

      Text in bold style.

      *)
    6. | Italic of text
      (*

      Text in italic.

      *)
    7. | Emphasize of text
      (*

      Emphasized text.

      *)
    8. | Center of text
      (*

      Centered text.

      *)
    9. | Left of text
      (*

      Left alignment.

      *)
    10. | Right of text
      (*

      Right alignment.

      *)
    11. | List of text list
      (*

      A list.

      *)
    12. | Enum of text list
      (*

      An enumerated list.

      *)
    13. | Newline
      (*

      To force a line break.

      *)
    14. | Block of text
      (*

      Like html's block quote.

      *)
    15. | Title of int * string option * text
      (*

      Style number, optional label, and text.

      *)
    16. | Latex of string
      (*

      A string for latex.

      *)
    17. | Link of string * text
      (*

      A reference string and the link text.

      *)
    18. | Ref of string * ref_kind option * text option
      (*

      A reference to an element. Complete name and kind. An optional text can be given to display this text instead of the element name.

      *)
    19. | Superscript of text
      (*

      Superscripts.

      *)
    20. | Subscript of text
      (*

      Subscripts.

      *)
    21. | Module_list of string list
      (*

      The table of the given modules with their abstract.

      *)
    22. | Index_list
      (*

      The links to the various indexes (values, types, ...)

      *)
    23. | Custom of string * text
      (*

      to extend {foo syntax

      *)
    24. | Target of string * string
      (*

      (target, code) : to specify code specific to a target format

      *)
    and text = text_element list

    A text is a list of text_element. The order matters.

    type see_ref = Odoc_types.see_ref =
    1. | See_url of string
    2. | See_file of string
    3. | See_doc of string

    The different forms of references in @see tags.

    exception Text_syntax of int * int * string

    Raised when parsing string to build a Odoc_info.text structure. (line, char, string)

    type see = see_ref * text

    The information in a @see tag.

    type param = string * text

    Parameter name and description.

    type raised_exception = string * text

    Raised exception name and description.

    type alert = Odoc_types.alert = {
    1. alert_name : string;
    2. alert_payload : string option;
    }
    type info = Odoc_types.info = {
    1. i_desc : text option;
      (*

      The description text.

      *)
    2. i_authors : string list;
      (*

      The list of authors in @author tags.

      *)
    3. i_version : string option;
      (*

      The string in the @version tag.

      *)
    4. i_sees : see list;
      (*

      The list of @see tags.

      *)
    5. i_since : string option;
      (*

      The string in the @since tag.

      *)
    6. i_before : (string * text) list;
      (*

      the version number and text in @before tag

      *)
    7. i_deprecated : text option;
      (*

      The description text of the @deprecated tag.

      *)
    8. i_params : param list;
      (*

      The list of parameter descriptions.

      *)
    9. i_raised_exceptions : raised_exception list;
      (*

      The list of raised exceptions.

      *)
    10. i_return_value : text option;
      (*

      The description text of the return value.

      *)
    11. i_custom : (string * text) list;
      (*

      A text associated to a custom @-tag.

      *)
    12. i_alerts : alert list;
      (*

      Alerts associated to the same item. Not from special comments.

      *)
    }

    Information in a special comment

    • before 3.12

      @before information was not present.

    type location = Odoc_types.location = {
    1. loc_impl : Location.t option;
      (*

      implementation location

      *)
    2. loc_inter : Location.t option;
      (*

      interface location

      *)
    }

    Location of elements in implementation and interface files.

    val dummy_loc : location

    A dummy location.

    module Name : sig ... end

    Representation of element names.

    module Parameter : sig ... end

    Representation and manipulation of method / function / class / module parameters.

    module Extension : sig ... end

    Representation and manipulation of extensions.

    module Exception : sig ... end

    Representation and manipulation of exceptions.

    module Type : sig ... end

    Representation and manipulation of types.

    module Value : sig ... end

    Representation and manipulation of values, class attributes and class methods.

    module Class : sig ... end

    Representation and manipulation of classes and class types.

    module Module : sig ... end

    Representation and manipulation of modules and module types.

    Getting strings from values

    val reset_type_names : unit -> unit

    This function is used to reset the names of type variables. It must be called when printing the whole type of a function, but not when printing the type of its parameters. Same for classes (call it) and methods and attributes (don't call it).

    val string_of_variance : Type.t_type -> Types.Variance.t -> string

    string_of_variance t variance returns the variance and injectivity annotation (e.g "+" for covariance, "-" for contravariance, "!-" for injectivity) if the type t is abstract.

    val string_of_type_expr : Types.type_expr -> string

    This function returns a string representing a Types.type_expr.

    val string_of_class_params : Class.t_class -> string
    • returns

      a string to display the parameters of the given class, in the same form as the compiler.

    val string_of_type_list : ?par:bool -> string -> Types.type_expr list -> string

    This function returns a string to represent the given list of types, with a given separator.

    val string_of_type_param_list : Type.t_type -> string

    This function returns a string to represent the list of type parameters for the given type.

    val string_of_type_extension_param_list : Extension.t_type_extension -> string

    This function returns a string to represent the list of type parameters for the given type extension.

    val string_of_class_type_param_list : Types.type_expr list -> string

    This function returns a string to represent the given list of type parameters of a class or class type, with a given separator.

    val string_of_module_type : + ?code:string -> + ?complete:bool -> + Types.module_type -> + string

    This function returns a string representing a Types.module_type.

    • parameter complete

      indicates if we must print complete signatures or just sig end. Default is false.

    • parameter code

      if complete = false and the type contains something else than identificators and functors, then the given code is used.

    val string_of_class_type : ?complete:bool -> Types.class_type -> string

    This function returns a string representing a Types.class_type.

    • parameter complete

      indicates if we must print complete signatures or just object end. Default is false.

    val string_of_text : text -> string

    Get a string from a text.

    val string_of_info : info -> string

    Get a string from an info structure.

    val string_of_type : Type.t_type -> string
    • returns

      a string to describe the given type.

    val string_of_record : Type.record_field list -> string
    val string_of_type_extension : Extension.t_type_extension -> string
    • returns

      a string to describe the given type extension.

    val string_of_exception : Exception.t_exception -> string
    • returns

      a string to describe the given exception.

    val string_of_value : Value.t_value -> string
    • returns

      a string to describe the given value.

    val string_of_attribute : Value.t_attribute -> string
    • returns

      a string to describe the given attribute.

    val string_of_method : Value.t_method -> string
    • returns

      a string to describe the given method.

    Miscellaneous functions

    val first_sentence_of_text : text -> text

    Return the first sentence (until the first dot followed by a blank or the first blank line) of a text. Don't stop in the middle of Code, CodePre, Verbatim, List, Enum, Latex, Link, Ref, Subscript or Superscript.

    val first_sentence_and_rest_of_text : text -> text * text

    Return the first sentence (until the first dot followed by a blank or the first blank line) of a text, and the remaining text after. Don't stop in the middle of Code, CodePre, Verbatim, List, Enum, Latex, Link, Ref, Subscript or Superscript.

    val text_no_title_no_list : text -> text

    Return the given text without any title or list.

    val text_concat : Odoc_types.text -> Odoc_types.text list -> Odoc_types.text

    concat sep l concats the given list of text l, each separated with the text sep.

    val get_titles_in_text : text -> (int * string option * text) list

    Return the list of titles in a text. A title is a title level, an optional label and a text.

    val create_index_lists : 'a list -> ('a -> string) -> 'a list list

    Take a sorted list of elements, a function to get the name of an element and return the list of list of elements, where each list group elements beginning by the same letter. Since the original list is sorted, elements whose name does not begin with a letter should be in the first returned list.

    val remove_option : Types.type_expr -> Types.type_expr

    Take a type and remove the option top constructor. This is useful when printing labels, we then remove the top option constructor for optional labels.

    val is_optional : Asttypes.arg_label -> bool

    Return true if the given label is optional.

    val label_name : Asttypes.arg_label -> string

    Return the label name for the given label, i.e. removes the beginning '?' if present.

    val use_hidden_modules : Name.t -> Name.t

    Return the given name where the module name or part of it was removed, according to the list of modules which must be hidden (cf Odoc_args.hidden_modules)

    val verbose : string -> unit

    Print the given string if the verbose mode is activated.

    val warning : string -> unit

    Print a warning message to stderr. If warnings must be treated as errors, then the error counter is incremented.

    val print_warnings : bool ref

    A flag to indicate whether ocamldoc warnings must be printed or not.

    val errors : int ref

    Increment this counter when an error is encountered. The ocamldoc tool will print the number of errors encountered exit with code 1 if this number is greater than 0.

    val apply_opt : ('a -> 'b) -> 'a option -> 'b option

    Apply a function to an optional value.

    val apply_if_equal : ('a -> 'a) -> 'a -> 'a -> 'a

    Apply a function to a first value if it is not different from a second value. If the two values are different, return the second one.

    val text_of_string : string -> text

    text_of_string s returns the text structure from the given string.

    val text_string_of_text : text -> string

    text_string_of_text text returns the string representing the given text. This string can then be parsed again by Odoc_info.text_of_string.

    val info_of_string : string -> info

    info_of_string s parses the given string like a regular ocamldoc comment and return an Odoc_info.info structure.

    • returns

      an empty structure if there was a syntax error. TODO: change this

    val info_of_comment_file : Module.t_module list -> string -> info

    info_of_comment_file file parses the given file and return an Odoc_info.info structure. The content of the file must have the same syntax as the content of a special comment. The given module list is used for cross reference.

    • raises Failure

      if the file could not be opened or there is a syntax error.

    val remove_ending_newline : string -> string

    remove_ending_newline s returns s without the optional ending newline.

    Research in elements

    module Scan : sig ... end

    Scanning of collected information

    module Dep : sig ... end

    Computation of dependencies.

    Some global variables

    module Global : sig ... end
    val analyse_files : + ?merge_options:Odoc_types.merge_option list -> + ?include_dirs:string list -> + ?hidden_include_dirs:string list -> + ?labels:bool -> + ?sort_modules:bool -> + ?no_stop:bool -> + ?init:Odoc_module.t_module list -> + Odoc_global.source_file list -> + Module.t_module list

    Analysis of the given source files.

    • parameter init

      is the list of modules already known from a previous analysis.

    • returns

      the list of analysed top modules.

    val dump_modules : string -> Odoc_module.t_module list -> unit

    Dump of a list of modules into a file.

    • raises Failure

      if an error occurs.

    val load_modules : string -> Odoc_module.t_module list

    Load of a list of modules from a file.

    • raises Failure

      if an error occurs.

    diff --git a/ocaml/Odoc_latex/Generator/class-latex/index.html b/ocaml/Odoc_latex/Generator/class-latex/index.html new file mode 100644 index 0000000..ceb1e2c --- /dev/null +++ b/ocaml/Odoc_latex/Generator/class-latex/index.html @@ -0,0 +1,140 @@ + +latex (ocaml.Odoc_latex.Generator.latex)

    Class Generator.latex

    val subst_strings : (Str.regexp * string) list
    val subst_strings_code : (Str.regexp * string) list
    val subst_strings_simple : (Str.regexp * string) list
    val mutable tag_functions : (string * (Odoc_info.text -> Odoc_info.text)) list
    method attribute_label : ?no_:bool -> Odoc_info.Name.t -> string
    method class_label : ?no_:bool -> Odoc_info.Name.t -> string
    method class_type_label : ?no_:bool -> Odoc_info.Name.t -> string
    method const_label : ?no_:bool -> Odoc_info.Name.t -> string
    method entry_comment : (Format.formatter * (unit -> string)) -> + Odoc_info.info option -> + Odoc_info.text_element list
    method escape : string -> string
    method escape_code : string -> string
    method escape_simple : string -> string
    method exception_label : ?no_:bool -> Odoc_info.Name.t -> string
    method extension_label : ?no_:bool -> Odoc_info.Name.t -> string
    method first_and_rest_of_info : Odoc_info.info option -> + Odoc_info.text * Odoc_info.text
    method generate : Odoc_info.Module.t_module list -> unit
    method generate_class_inheritance_info : Format.formatter -> + Odoc_info.Class.t_class -> + unit
    method generate_class_type_inheritance_info : Format.formatter -> + Odoc_info.Class.t_class_type -> + unit
    method generate_for_top_module : Format.formatter -> + Odoc_info.Module.t_module -> + unit
    method generate_inheritance_info : Format.formatter -> + Odoc_info.Class.inherited_class list -> + unit
    method generate_style_file : unit
    method label : ?no_:bool -> Odoc_info.Name.t -> string
    method latex_for_class_index : Format.formatter -> + Odoc_info.Class.t_class -> + unit
    method latex_for_class_label : Format.formatter -> + Odoc_info.Class.t_class -> + unit
    method latex_for_class_type_index : Format.formatter -> + Odoc_info.Class.t_class_type -> + unit
    method latex_for_class_type_label : Format.formatter -> + Odoc_info.Class.t_class_type -> + unit
    method latex_for_module_index : Format.formatter -> + Odoc_info.Module.t_module -> + unit
    method latex_for_module_label : Format.formatter -> + Odoc_info.Module.t_module -> + unit
    method latex_for_module_type_index : Format.formatter -> + Odoc_info.Module.t_module_type -> + unit
    method latex_for_module_type_label : Format.formatter -> + Odoc_info.Module.t_module_type -> + unit
    method latex_header : Format.formatter -> + Odoc_info.Module.t_module list -> + unit
    method latex_of_Block : Format.formatter -> Odoc_info.text -> unit
    method latex_of_Bold : Format.formatter -> Odoc_info.text -> unit
    method latex_of_Center : Format.formatter -> Odoc_info.text -> unit
    method latex_of_Code : Format.formatter -> string -> unit
    method latex_of_CodePre : Format.formatter -> string -> unit
    method latex_of_Emphasize : Format.formatter -> Odoc_info.text -> unit
    method latex_of_Enum : Format.formatter -> Odoc_info.text list -> unit
    method latex_of_Italic : Format.formatter -> Odoc_info.text -> unit
    method latex_of_Latex : Format.formatter -> string -> unit
    method latex_of_Left : Format.formatter -> Odoc_info.text -> unit
    method latex_of_List : Format.formatter -> Odoc_info.text list -> unit
    method latex_of_Newline : Format.formatter -> unit
    method latex_of_Raw : Format.formatter -> string -> unit
    method latex_of_Ref : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.ref_kind option -> + Odoc_info.text option -> + unit
    method latex_of_Right : Format.formatter -> Odoc_info.text -> unit
    method latex_of_Subscript : Format.formatter -> Odoc_info.text -> unit
    method latex_of_Superscript : Format.formatter -> Odoc_info.text -> unit
    method latex_of_Target : Format.formatter -> + target:string -> + code:string -> + unit
    method latex_of_Title : Format.formatter -> + int -> + Odoc_info.Name.t option -> + Odoc_info.text -> + unit
    method latex_of_Verbatim : Format.formatter -> string -> unit
    method latex_of_attribute : Format.formatter -> + Odoc_info.Value.t_attribute -> + unit
    method latex_of_class : Format.formatter -> Odoc_info.Class.t_class -> unit
    method latex_of_class_element : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.Class.class_element -> + unit
    method latex_of_class_kind : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.Class.class_kind -> + unit
    method latex_of_class_parameter_list : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.Class.t_class -> + unit
    method latex_of_class_type : Format.formatter -> + Odoc_info.Class.t_class_type -> + unit
    method latex_of_class_type_kind : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.Class.class_type_kind -> + unit
    method latex_of_cstr_args : (Format.formatter * (unit -> string)) -> + Odoc_info.Name.t -> + (Odoc_info.Type.constructor_args * Types.type_expr option) -> + Odoc_info.text_element list
    method latex_of_custom_text : Format.formatter -> + string -> + Odoc_info.text -> + unit
    method latex_of_exception : Format.formatter -> + Odoc_info.Exception.t_exception -> + unit
    method latex_of_included_module : Format.formatter -> + Odoc_info.Module.included_module -> + unit
    method latex_of_info : Format.formatter -> + ?block:bool -> + Odoc_info.info option -> + unit
    method latex_of_method : Format.formatter -> Odoc_info.Value.t_method -> unit
    method latex_of_module : Format.formatter -> Odoc_info.Module.t_module -> unit
    method latex_of_module_element : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.Module.module_element -> + unit
    method latex_of_module_kind : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.Module.module_kind -> + unit
    method latex_of_module_parameter : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.Module.module_parameter -> + unit
    method latex_of_module_type : Format.formatter -> + Odoc_info.Module.t_module_type -> + unit
    method latex_of_module_type_kind : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.Module.module_type_kind -> + unit
    method latex_of_record : (Format.formatter * (unit -> string)) -> + Odoc_info.Name.t -> + Odoc_info.Type.record_field list -> + Odoc_info.text_element list
    method latex_of_text : Format.formatter -> Odoc_info.text -> unit
    method latex_of_text_element : Format.formatter -> + Odoc_info.text_element -> + unit
    method latex_of_type : Format.formatter -> Odoc_info.Type.t_type -> unit
    method latex_of_type_extension : Odoc_info.Name.t -> + Format.formatter -> + Odoc_info.Extension.t_type_extension -> + unit
    method latex_of_type_params : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.Type.t_type -> + unit
    method latex_of_value : Format.formatter -> Odoc_info.Value.t_value -> unit
    method make_label : string -> string
    method make_ref : string -> string
    method method_label : ?no_:bool -> Odoc_info.Name.t -> string
    method module_label : ?no_:bool -> Odoc_info.Name.t -> string
    method module_type_label : ?no_:bool -> Odoc_info.Name.t -> string
    method normal_class_params : Odoc_info.Name.t -> + Odoc_info.Class.t_class -> + string
    method normal_class_type : Odoc_info.Name.t -> Types.class_type -> string
    method normal_class_type_param_list : Odoc_info.Name.t -> + Types.type_expr list -> + string
    method normal_cstr_args : ?par:bool -> + Odoc_info.Name.t -> + Odoc_info.Type.constructor_args -> + string
    method normal_module_type : ?code:string -> + Odoc_info.Name.t -> + Types.module_type -> + string
    method normal_type : Odoc_info.Name.t -> Types.type_expr -> string
    method normal_type_list : ?par:bool -> + Odoc_info.Name.t -> + string -> + Types.type_expr list -> + string
    method recfield_label : ?no_:bool -> Odoc_info.Name.t -> string
    method relative_idents : Odoc_info.Name.t -> string -> string
    method relative_module_idents : Odoc_info.Name.t -> string -> string
    method section_style : int -> string -> string
    method subst : (Str.regexp * string) list -> string -> string
    method text_of_alerts : Odoc_info.alert list -> Odoc_info.text_element list
    method text_of_attribute : Odoc_info.Value.t_attribute -> + Odoc_info.text_element list
    method text_of_author_list : string list -> Odoc_info.text_element list
    method text_of_before : (string * Odoc_info.text) list -> + Odoc_info.text_element list
    method text_of_class_kind : Odoc_info.Name.t -> + Odoc_info.Class.class_kind -> + Odoc_info.text_element list
    method text_of_class_params : Odoc_info.Name.t -> + Odoc_info.Class.t_class -> + Odoc_types.text
    method text_of_class_type_kind : Odoc_info.Name.t -> + Odoc_info.Class.class_type_kind -> + Odoc_info.text_element list
    method text_of_class_type_param_expr_list : Odoc_info.Name.t -> + Types.type_expr list -> + Odoc_info.text_element list
    method text_of_custom : (string * Odoc_info.text) list -> Odoc_info.text
    method text_of_exception : Odoc_info.Exception.t_exception -> + Odoc_info.text_element list
    method text_of_info : ?block:bool -> Odoc_info.info option -> Odoc_info.text
    method text_of_method : Odoc_info.Value.t_method -> Odoc_info.text_element list
    method text_of_module_kind : ?with_def_syntax:bool -> + Odoc_info.Module.module_kind -> + Odoc_info.text_element list
    method text_of_module_parameter_list : (Odoc_info.Module.module_parameter + * Odoc_info.text_element list option) + list -> + Odoc_info.text_element list
    method text_of_module_type : Types.module_type -> Odoc_info.text_element list
    method text_of_module_type_kind : ?with_def_syntax:bool -> + Odoc_info.Module.module_type_kind -> + Odoc_info.text_element list
    method text_of_parameter_description : Odoc_info.Parameter.parameter -> + Odoc_info.text
    method text_of_parameter_list : Odoc_info.Name.t -> + Odoc_info.Parameter.parameter list -> + Odoc_info.text_element list
    method text_of_raised_exceptions : Odoc_info.raised_exception list -> + Odoc_info.text_element list
    method text_of_return_opt : Odoc_info.text option -> + Odoc_info.text_element list
    method text_of_see : Odoc_info.see -> Odoc_info.text
    method text_of_sees : Odoc_info.see list -> Odoc_info.text_element list
    method text_of_short_type_expr : Odoc_info.Name.t -> + Types.type_expr -> + Odoc_info.text_element list
    method text_of_since_opt : string option -> Odoc_info.text_element list
    method text_of_type_expr : Odoc_info.Name.t -> + Types.type_expr -> + Odoc_info.text_element list
    method text_of_type_expr_list : Odoc_info.Name.t -> + string -> + Types.type_expr list -> + Odoc_info.text_element list
    method text_of_value : Odoc_info.Value.t_value -> Odoc_info.text_element list
    method text_of_version_opt : string option -> Odoc_info.text_element list
    method type_label : ?no_:bool -> Odoc_info.Name.t -> string
    method value_label : ?no_:bool -> Odoc_info.Name.t -> string
    diff --git a/ocaml/Odoc_latex/Generator/index.html b/ocaml/Odoc_latex/Generator/index.html new file mode 100644 index 0000000..c95cf98 --- /dev/null +++ b/ocaml/Odoc_latex/Generator/index.html @@ -0,0 +1,2 @@ + +Generator (ocaml.Odoc_latex.Generator)

    Module Odoc_latex.Generator

    class latex : object ... end
    diff --git a/ocaml/Odoc_latex/index.html b/ocaml/Odoc_latex/index.html new file mode 100644 index 0000000..fe83570 --- /dev/null +++ b/ocaml/Odoc_latex/index.html @@ -0,0 +1,2 @@ + +Odoc_latex (ocaml.Odoc_latex)

    Module Odoc_latex

    Generation of LaTeX documentation.

    val separate_files : bool ref
    val latex_titles : (int * string) list ref
    val latex_value_prefix : string ref
    val latex_type_prefix : string ref
    val latex_type_elt_prefix : string ref
    val latex_extension_prefix : string ref
    val latex_exception_prefix : string ref
    val latex_module_prefix : string ref
    val latex_module_type_prefix : string ref
    val latex_class_prefix : string ref
    val latex_class_type_prefix : string ref
    val latex_attribute_prefix : string ref
    val latex_method_prefix : string ref
    module Generator : sig ... end
    module type Latex_generator = sig ... end
    diff --git a/ocaml/Odoc_latex/module-type-Latex_generator/class-latex/index.html b/ocaml/Odoc_latex/module-type-Latex_generator/class-latex/index.html new file mode 100644 index 0000000..2a34e0b --- /dev/null +++ b/ocaml/Odoc_latex/module-type-Latex_generator/class-latex/index.html @@ -0,0 +1,140 @@ + +latex (ocaml.Odoc_latex.Latex_generator.latex)

    Class Latex_generator.latex

    val subst_strings : (Str.regexp * string) list
    val subst_strings_code : (Str.regexp * string) list
    val subst_strings_simple : (Str.regexp * string) list
    val mutable tag_functions : (string * (Odoc_info.text -> Odoc_info.text)) list
    method attribute_label : ?no_:bool -> Odoc_info.Name.t -> string
    method class_label : ?no_:bool -> Odoc_info.Name.t -> string
    method class_type_label : ?no_:bool -> Odoc_info.Name.t -> string
    method const_label : ?no_:bool -> Odoc_info.Name.t -> string
    method entry_comment : (Format.formatter * (unit -> string)) -> + Odoc_info.info option -> + Odoc_info.text_element list
    method escape : string -> string
    method escape_code : string -> string
    method escape_simple : string -> string
    method exception_label : ?no_:bool -> Odoc_info.Name.t -> string
    method extension_label : ?no_:bool -> Odoc_info.Name.t -> string
    method first_and_rest_of_info : Odoc_info.info option -> + Odoc_info.text * Odoc_info.text
    method generate : Odoc_info.Module.t_module list -> unit
    method generate_class_inheritance_info : Format.formatter -> + Odoc_info.Class.t_class -> + unit
    method generate_class_type_inheritance_info : Format.formatter -> + Odoc_info.Class.t_class_type -> + unit
    method generate_for_top_module : Format.formatter -> + Odoc_info.Module.t_module -> + unit
    method generate_inheritance_info : Format.formatter -> + Odoc_info.Class.inherited_class list -> + unit
    method generate_style_file : unit
    method label : ?no_:bool -> Odoc_info.Name.t -> string
    method latex_for_class_index : Format.formatter -> + Odoc_info.Class.t_class -> + unit
    method latex_for_class_label : Format.formatter -> + Odoc_info.Class.t_class -> + unit
    method latex_for_class_type_index : Format.formatter -> + Odoc_info.Class.t_class_type -> + unit
    method latex_for_class_type_label : Format.formatter -> + Odoc_info.Class.t_class_type -> + unit
    method latex_for_module_index : Format.formatter -> + Odoc_info.Module.t_module -> + unit
    method latex_for_module_label : Format.formatter -> + Odoc_info.Module.t_module -> + unit
    method latex_for_module_type_index : Format.formatter -> + Odoc_info.Module.t_module_type -> + unit
    method latex_for_module_type_label : Format.formatter -> + Odoc_info.Module.t_module_type -> + unit
    method latex_header : Format.formatter -> + Odoc_info.Module.t_module list -> + unit
    method latex_of_Block : Format.formatter -> Odoc_info.text -> unit
    method latex_of_Bold : Format.formatter -> Odoc_info.text -> unit
    method latex_of_Center : Format.formatter -> Odoc_info.text -> unit
    method latex_of_Code : Format.formatter -> string -> unit
    method latex_of_CodePre : Format.formatter -> string -> unit
    method latex_of_Emphasize : Format.formatter -> Odoc_info.text -> unit
    method latex_of_Enum : Format.formatter -> Odoc_info.text list -> unit
    method latex_of_Italic : Format.formatter -> Odoc_info.text -> unit
    method latex_of_Latex : Format.formatter -> string -> unit
    method latex_of_Left : Format.formatter -> Odoc_info.text -> unit
    method latex_of_List : Format.formatter -> Odoc_info.text list -> unit
    method latex_of_Newline : Format.formatter -> unit
    method latex_of_Raw : Format.formatter -> string -> unit
    method latex_of_Ref : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.ref_kind option -> + Odoc_info.text option -> + unit
    method latex_of_Right : Format.formatter -> Odoc_info.text -> unit
    method latex_of_Subscript : Format.formatter -> Odoc_info.text -> unit
    method latex_of_Superscript : Format.formatter -> Odoc_info.text -> unit
    method latex_of_Target : Format.formatter -> + target:string -> + code:string -> + unit
    method latex_of_Title : Format.formatter -> + int -> + Odoc_info.Name.t option -> + Odoc_info.text -> + unit
    method latex_of_Verbatim : Format.formatter -> string -> unit
    method latex_of_attribute : Format.formatter -> + Odoc_info.Value.t_attribute -> + unit
    method latex_of_class : Format.formatter -> Odoc_info.Class.t_class -> unit
    method latex_of_class_element : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.Class.class_element -> + unit
    method latex_of_class_kind : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.Class.class_kind -> + unit
    method latex_of_class_parameter_list : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.Class.t_class -> + unit
    method latex_of_class_type : Format.formatter -> + Odoc_info.Class.t_class_type -> + unit
    method latex_of_class_type_kind : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.Class.class_type_kind -> + unit
    method latex_of_cstr_args : (Format.formatter * (unit -> string)) -> + Odoc_info.Name.t -> + (Odoc_info.Type.constructor_args * Types.type_expr option) -> + Odoc_info.text_element list
    method latex_of_custom_text : Format.formatter -> + string -> + Odoc_info.text -> + unit
    method latex_of_exception : Format.formatter -> + Odoc_info.Exception.t_exception -> + unit
    method latex_of_included_module : Format.formatter -> + Odoc_info.Module.included_module -> + unit
    method latex_of_info : Format.formatter -> + ?block:bool -> + Odoc_info.info option -> + unit
    method latex_of_method : Format.formatter -> Odoc_info.Value.t_method -> unit
    method latex_of_module : Format.formatter -> Odoc_info.Module.t_module -> unit
    method latex_of_module_element : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.Module.module_element -> + unit
    method latex_of_module_kind : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.Module.module_kind -> + unit
    method latex_of_module_parameter : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.Module.module_parameter -> + unit
    method latex_of_module_type : Format.formatter -> + Odoc_info.Module.t_module_type -> + unit
    method latex_of_module_type_kind : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.Module.module_type_kind -> + unit
    method latex_of_record : (Format.formatter * (unit -> string)) -> + Odoc_info.Name.t -> + Odoc_info.Type.record_field list -> + Odoc_info.text_element list
    method latex_of_text : Format.formatter -> Odoc_info.text -> unit
    method latex_of_text_element : Format.formatter -> + Odoc_info.text_element -> + unit
    method latex_of_type : Format.formatter -> Odoc_info.Type.t_type -> unit
    method latex_of_type_extension : Odoc_info.Name.t -> + Format.formatter -> + Odoc_info.Extension.t_type_extension -> + unit
    method latex_of_type_params : Format.formatter -> + Odoc_info.Name.t -> + Odoc_info.Type.t_type -> + unit
    method latex_of_value : Format.formatter -> Odoc_info.Value.t_value -> unit
    method make_label : string -> string
    method make_ref : string -> string
    method method_label : ?no_:bool -> Odoc_info.Name.t -> string
    method module_label : ?no_:bool -> Odoc_info.Name.t -> string
    method module_type_label : ?no_:bool -> Odoc_info.Name.t -> string
    method normal_class_params : Odoc_info.Name.t -> + Odoc_info.Class.t_class -> + string
    method normal_class_type : Odoc_info.Name.t -> Types.class_type -> string
    method normal_class_type_param_list : Odoc_info.Name.t -> + Types.type_expr list -> + string
    method normal_cstr_args : ?par:bool -> + Odoc_info.Name.t -> + Odoc_info.Type.constructor_args -> + string
    method normal_module_type : ?code:string -> + Odoc_info.Name.t -> + Types.module_type -> + string
    method normal_type : Odoc_info.Name.t -> Types.type_expr -> string
    method normal_type_list : ?par:bool -> + Odoc_info.Name.t -> + string -> + Types.type_expr list -> + string
    method recfield_label : ?no_:bool -> Odoc_info.Name.t -> string
    method relative_idents : Odoc_info.Name.t -> string -> string
    method relative_module_idents : Odoc_info.Name.t -> string -> string
    method section_style : int -> string -> string
    method subst : (Str.regexp * string) list -> string -> string
    method text_of_alerts : Odoc_info.alert list -> Odoc_info.text_element list
    method text_of_attribute : Odoc_info.Value.t_attribute -> + Odoc_info.text_element list
    method text_of_author_list : string list -> Odoc_info.text_element list
    method text_of_before : (string * Odoc_info.text) list -> + Odoc_info.text_element list
    method text_of_class_kind : Odoc_info.Name.t -> + Odoc_info.Class.class_kind -> + Odoc_info.text_element list
    method text_of_class_params : Odoc_info.Name.t -> + Odoc_info.Class.t_class -> + Odoc_types.text
    method text_of_class_type_kind : Odoc_info.Name.t -> + Odoc_info.Class.class_type_kind -> + Odoc_info.text_element list
    method text_of_class_type_param_expr_list : Odoc_info.Name.t -> + Types.type_expr list -> + Odoc_info.text_element list
    method text_of_custom : (string * Odoc_info.text) list -> Odoc_info.text
    method text_of_exception : Odoc_info.Exception.t_exception -> + Odoc_info.text_element list
    method text_of_info : ?block:bool -> Odoc_info.info option -> Odoc_info.text
    method text_of_method : Odoc_info.Value.t_method -> Odoc_info.text_element list
    method text_of_module_kind : ?with_def_syntax:bool -> + Odoc_info.Module.module_kind -> + Odoc_info.text_element list
    method text_of_module_parameter_list : (Odoc_info.Module.module_parameter + * Odoc_info.text_element list option) + list -> + Odoc_info.text_element list
    method text_of_module_type : Types.module_type -> Odoc_info.text_element list
    method text_of_module_type_kind : ?with_def_syntax:bool -> + Odoc_info.Module.module_type_kind -> + Odoc_info.text_element list
    method text_of_parameter_description : Odoc_info.Parameter.parameter -> + Odoc_info.text
    method text_of_parameter_list : Odoc_info.Name.t -> + Odoc_info.Parameter.parameter list -> + Odoc_info.text_element list
    method text_of_raised_exceptions : Odoc_info.raised_exception list -> + Odoc_info.text_element list
    method text_of_return_opt : Odoc_info.text option -> + Odoc_info.text_element list
    method text_of_see : Odoc_info.see -> Odoc_info.text
    method text_of_sees : Odoc_info.see list -> Odoc_info.text_element list
    method text_of_short_type_expr : Odoc_info.Name.t -> + Types.type_expr -> + Odoc_info.text_element list
    method text_of_since_opt : string option -> Odoc_info.text_element list
    method text_of_type_expr : Odoc_info.Name.t -> + Types.type_expr -> + Odoc_info.text_element list
    method text_of_type_expr_list : Odoc_info.Name.t -> + string -> + Types.type_expr list -> + Odoc_info.text_element list
    method text_of_value : Odoc_info.Value.t_value -> Odoc_info.text_element list
    method text_of_version_opt : string option -> Odoc_info.text_element list
    method type_label : ?no_:bool -> Odoc_info.Name.t -> string
    method value_label : ?no_:bool -> Odoc_info.Name.t -> string
    diff --git a/ocaml/Odoc_latex/module-type-Latex_generator/index.html b/ocaml/Odoc_latex/module-type-Latex_generator/index.html new file mode 100644 index 0000000..a1d1164 --- /dev/null +++ b/ocaml/Odoc_latex/module-type-Latex_generator/index.html @@ -0,0 +1,2 @@ + +Latex_generator (ocaml.Odoc_latex.Latex_generator)

    Module type Odoc_latex.Latex_generator

    class latex : object ... end
    diff --git a/ocaml/Odoc_latex_style/index.html b/ocaml/Odoc_latex_style/index.html new file mode 100644 index 0000000..008264a --- /dev/null +++ b/ocaml/Odoc_latex_style/index.html @@ -0,0 +1,2 @@ + +Odoc_latex_style (ocaml.Odoc_latex_style)

    Module Odoc_latex_style

    The content of the LaTeX style to generate when generating LaTeX code.

    val content : string
    diff --git a/ocaml/Odoc_lexer/index.html b/ocaml/Odoc_lexer/index.html new file mode 100644 index 0000000..21d680b --- /dev/null +++ b/ocaml/Odoc_lexer/index.html @@ -0,0 +1,2 @@ + +Odoc_lexer (ocaml.Odoc_lexer)

    Module Odoc_lexer

    val line_number : int ref
    val comments_level : int ref
    diff --git a/ocaml/Odoc_man/Generator/class-man/index.html b/ocaml/Odoc_man/Generator/class-man/index.html new file mode 100644 index 0000000..56ffc71 --- /dev/null +++ b/ocaml/Odoc_man/Generator/class-man/index.html @@ -0,0 +1,46 @@ + +man (ocaml.Odoc_man.Generator.man)

    Class Generator.man

    val mutable tag_functions : (string * (Odoc_info.text -> string)) list
    method create_groups : bool -> + Odoc_info.Module.t_module list -> + Odoc_info.Search.result_element list list
    method escape : string -> string
    method field_comment : Buffer.t -> Odoc_info.info option -> unit
    method file_name : Odoc_info.Name.t -> string
    method generate : Odoc_info.Module.t_module list -> unit
    method generate_for_class : Odoc_info.Class.t_class -> unit
    method generate_for_class_type : Odoc_info.Class.t_class_type -> unit
    method generate_for_group : Odoc_info.Search.result_element list -> unit
    method generate_for_module : Odoc_info.Module.t_module -> unit
    method generate_for_module_type : Odoc_info.Module.t_module_type -> unit
    method man_of_Target : Buffer.t -> target:string -> code:string -> unit
    method man_of_attribute : Buffer.t -> Odoc_info.Value.t_attribute -> unit
    method man_of_class : Buffer.t -> Odoc_info.Class.t_class -> unit
    method man_of_class_comment : Buffer.t -> Odoc_info.text -> unit
    method man_of_class_type : Buffer.t -> Odoc_info.Class.t_class_type -> unit
    method man_of_class_type_expr : Buffer.t -> + Odoc_info.Name.t -> + Types.class_type -> + unit
    method man_of_code : Buffer.t -> string -> unit
    method man_of_const : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Type.variant_constructor -> + unit
    method man_of_cstr_args : ?par:bool -> + Buffer.t -> + Odoc_info.Name.t -> + string -> + Odoc_info.Type.constructor_args -> + unit
    method man_of_custom_text : Buffer.t -> string -> Odoc_info.text -> unit
    method man_of_exception : Buffer.t -> Odoc_info.Exception.t_exception -> unit
    method man_of_included_module : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Module.included_module -> + unit
    method man_of_info : ?margin:int -> Buffer.t -> Odoc_types.info option -> unit
    method man_of_method : Buffer.t -> Odoc_info.Value.t_method -> unit
    method man_of_modtype : Buffer.t -> Odoc_info.Module.t_module_type -> unit
    method man_of_module : Buffer.t -> Odoc_info.Module.t_module -> unit
    method man_of_module_body : Buffer.t -> Odoc_info.Module.t_module -> unit
    method man_of_module_comment : Buffer.t -> Odoc_info.text -> unit
    method man_of_module_parameter_list : Buffer.t -> + Odoc_info.Name.t -> + (Odoc_info.Module.module_parameter * Odoc_info.text option) list -> + unit
    method man_of_module_type : Buffer.t -> + Odoc_info.Name.t -> + Types.module_type -> + unit
    method man_of_module_type_body : Buffer.t -> + Odoc_info.Module.t_module_type -> + unit
    method man_of_parameter_description : Buffer.t -> + Odoc_info.Parameter.parameter -> + unit
    method man_of_parameter_list : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Parameter.parameter list -> + unit
    method man_of_recfield : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Type.record_field -> + unit
    method man_of_record : Odoc_info.Name.t -> + Buffer.t -> + Odoc_info.Type.record_field list -> + unit
    method man_of_text : Buffer.t -> Odoc_info.text -> unit
    method private man_of_text2 : Buffer.t -> Odoc_info.text -> unit
    method man_of_text_element : Buffer.t -> Odoc_info.text_element -> unit
    method man_of_type : Buffer.t -> Odoc_info.Type.t_type -> unit
    method man_of_type_expr : Buffer.t -> + Odoc_info.Name.t -> + Types.type_expr -> + unit
    method man_of_type_expr_param_list : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Type.t_type -> + unit
    method man_of_type_extension : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Extension.t_type_extension -> + unit
    method man_of_value : Buffer.t -> Odoc_info.Value.t_value -> unit
    method open_out : string -> out_channel
    method relative_idents : Odoc_info.Name.t -> Odoc_info.Name.t -> string
    method remove_newlines : string -> string
    method str_man_of_alerts : Odoc_info.alert list -> string list
    method str_man_of_author_list : string list -> string
    method str_man_of_before : (string * Odoc_info.text) list -> string
    method str_man_of_custom : (string * Odoc_info.text) list -> string list
    method str_man_of_raised_exceptions : (string * Odoc_info.text) list -> string
    method str_man_of_return_opt : Odoc_info.text option -> string
    method str_man_of_see : (Odoc_info.see_ref * Odoc_info.text) -> string
    method str_man_of_sees : (Odoc_info.see_ref * Odoc_info.text) list -> string
    method str_man_of_since_opt : string option -> string
    method str_man_of_text : Odoc_info.text -> string
    method str_man_of_version_opt : string option -> string
    diff --git a/ocaml/Odoc_man/Generator/index.html b/ocaml/Odoc_man/Generator/index.html new file mode 100644 index 0000000..40dfb08 --- /dev/null +++ b/ocaml/Odoc_man/Generator/index.html @@ -0,0 +1,2 @@ + +Generator (ocaml.Odoc_man.Generator)

    Module Odoc_man.Generator

    class man : object ... end
    diff --git a/ocaml/Odoc_man/index.html b/ocaml/Odoc_man/index.html new file mode 100644 index 0000000..df0ce4d --- /dev/null +++ b/ocaml/Odoc_man/index.html @@ -0,0 +1,2 @@ + +Odoc_man (ocaml.Odoc_man)

    Module Odoc_man

    The man pages generator.

    val man_suffix : string ref
    val man_section : string ref
    val man_mini : bool ref
    module Generator : sig ... end
    module type Man_generator = sig ... end
    diff --git a/ocaml/Odoc_man/module-type-Man_generator/class-man/index.html b/ocaml/Odoc_man/module-type-Man_generator/class-man/index.html new file mode 100644 index 0000000..5239382 --- /dev/null +++ b/ocaml/Odoc_man/module-type-Man_generator/class-man/index.html @@ -0,0 +1,46 @@ + +man (ocaml.Odoc_man.Man_generator.man)

    Class Man_generator.man

    val mutable tag_functions : (string * (Odoc_info.text -> string)) list
    method create_groups : bool -> + Odoc_info.Module.t_module list -> + Odoc_info.Search.result_element list list
    method escape : string -> string
    method field_comment : Buffer.t -> Odoc_info.info option -> unit
    method file_name : Odoc_info.Name.t -> string
    method generate : Odoc_info.Module.t_module list -> unit
    method generate_for_class : Odoc_info.Class.t_class -> unit
    method generate_for_class_type : Odoc_info.Class.t_class_type -> unit
    method generate_for_group : Odoc_info.Search.result_element list -> unit
    method generate_for_module : Odoc_info.Module.t_module -> unit
    method generate_for_module_type : Odoc_info.Module.t_module_type -> unit
    method man_of_Target : Buffer.t -> target:string -> code:string -> unit
    method man_of_attribute : Buffer.t -> Odoc_info.Value.t_attribute -> unit
    method man_of_class : Buffer.t -> Odoc_info.Class.t_class -> unit
    method man_of_class_comment : Buffer.t -> Odoc_info.text -> unit
    method man_of_class_type : Buffer.t -> Odoc_info.Class.t_class_type -> unit
    method man_of_class_type_expr : Buffer.t -> + Odoc_info.Name.t -> + Types.class_type -> + unit
    method man_of_code : Buffer.t -> string -> unit
    method man_of_const : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Type.variant_constructor -> + unit
    method man_of_cstr_args : ?par:bool -> + Buffer.t -> + Odoc_info.Name.t -> + string -> + Odoc_info.Type.constructor_args -> + unit
    method man_of_custom_text : Buffer.t -> string -> Odoc_info.text -> unit
    method man_of_exception : Buffer.t -> Odoc_info.Exception.t_exception -> unit
    method man_of_included_module : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Module.included_module -> + unit
    method man_of_info : ?margin:int -> Buffer.t -> Odoc_types.info option -> unit
    method man_of_method : Buffer.t -> Odoc_info.Value.t_method -> unit
    method man_of_modtype : Buffer.t -> Odoc_info.Module.t_module_type -> unit
    method man_of_module : Buffer.t -> Odoc_info.Module.t_module -> unit
    method man_of_module_body : Buffer.t -> Odoc_info.Module.t_module -> unit
    method man_of_module_comment : Buffer.t -> Odoc_info.text -> unit
    method man_of_module_parameter_list : Buffer.t -> + Odoc_info.Name.t -> + (Odoc_info.Module.module_parameter * Odoc_info.text option) list -> + unit
    method man_of_module_type : Buffer.t -> + Odoc_info.Name.t -> + Types.module_type -> + unit
    method man_of_module_type_body : Buffer.t -> + Odoc_info.Module.t_module_type -> + unit
    method man_of_parameter_description : Buffer.t -> + Odoc_info.Parameter.parameter -> + unit
    method man_of_parameter_list : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Parameter.parameter list -> + unit
    method man_of_recfield : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Type.record_field -> + unit
    method man_of_record : Odoc_info.Name.t -> + Buffer.t -> + Odoc_info.Type.record_field list -> + unit
    method man_of_text : Buffer.t -> Odoc_info.text -> unit
    method private man_of_text2 : Buffer.t -> Odoc_info.text -> unit
    method man_of_text_element : Buffer.t -> Odoc_info.text_element -> unit
    method man_of_type : Buffer.t -> Odoc_info.Type.t_type -> unit
    method man_of_type_expr : Buffer.t -> + Odoc_info.Name.t -> + Types.type_expr -> + unit
    method man_of_type_expr_param_list : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Type.t_type -> + unit
    method man_of_type_extension : Buffer.t -> + Odoc_info.Name.t -> + Odoc_info.Extension.t_type_extension -> + unit
    method man_of_value : Buffer.t -> Odoc_info.Value.t_value -> unit
    method open_out : string -> out_channel
    method relative_idents : Odoc_info.Name.t -> Odoc_info.Name.t -> string
    method remove_newlines : string -> string
    method str_man_of_alerts : Odoc_info.alert list -> string list
    method str_man_of_author_list : string list -> string
    method str_man_of_before : (string * Odoc_info.text) list -> string
    method str_man_of_custom : (string * Odoc_info.text) list -> string list
    method str_man_of_raised_exceptions : (string * Odoc_info.text) list -> string
    method str_man_of_return_opt : Odoc_info.text option -> string
    method str_man_of_see : (Odoc_info.see_ref * Odoc_info.text) -> string
    method str_man_of_sees : (Odoc_info.see_ref * Odoc_info.text) list -> string
    method str_man_of_since_opt : string option -> string
    method str_man_of_text : Odoc_info.text -> string
    method str_man_of_version_opt : string option -> string
    diff --git a/ocaml/Odoc_man/module-type-Man_generator/index.html b/ocaml/Odoc_man/module-type-Man_generator/index.html new file mode 100644 index 0000000..3aff2f3 --- /dev/null +++ b/ocaml/Odoc_man/module-type-Man_generator/index.html @@ -0,0 +1,2 @@ + +Man_generator (ocaml.Odoc_man.Man_generator)

    Module type Odoc_man.Man_generator

    class man : object ... end
    diff --git a/ocaml/Odoc_merge/index.html b/ocaml/Odoc_merge/index.html new file mode 100644 index 0000000..b2bebe0 --- /dev/null +++ b/ocaml/Odoc_merge/index.html @@ -0,0 +1,11 @@ + +Odoc_merge (ocaml.Odoc_merge)

    Module Odoc_merge

    val merge_before_tags : + (string * Odoc_types.text) list -> + (string * Odoc_types.text) list
    val merge_info_opt : + Odoc_types.merge_option list -> + Odoc_types.info option -> + Odoc_types.info option -> + Odoc_types.info option
    diff --git a/ocaml/Odoc_messages/index.html b/ocaml/Odoc_messages/index.html new file mode 100644 index 0000000..c9e76fd --- /dev/null +++ b/ocaml/Odoc_messages/index.html @@ -0,0 +1,2 @@ + +Odoc_messages (ocaml.Odoc_messages)

    Module Odoc_messages

    The messages of the application.

    val ok : string
    val software : string
    val config_version : string
    val magic : string
    val usage : string
    val options_are : string
    val latex_only : string
    val texi_only : string
    val latex_texi_only : string
    val html_only : string
    val html_latex_only : string
    val html_latex_texi_only : string
    val man_only : string
    val option_impl : string
    val option_intf : string
    val option_text : string
    val display_custom_generators_dir : string
    val add_load_dir : string
    val load_file : string
    val werr : string
    val show_missed_crossref : string
    val hide_warnings : string
    val target_dir : string
    val dump : string
    val load : string
    val css_style : string
    val index_only : string
    val colorize_code : string
    val html_short_functors : string
    val charset : string -> string
    val no_navbar : string
    val generate_html : string
    val generate_latex : string
    val generate_texinfo : string
    val generate_man : string
    val generate_dot : string
    val option_not_in_native_code : string -> string
    val default_out_file : string
    val out_file : string
    val dot_include_all : string
    val dot_types : string
    val default_dot_colors : string list list
    val dot_colors : string
    val dot_reduce : string
    val man_mini : string
    val default_man_section : string
    val man_section : string
    val default_man_suffix : string
    val man_suffix : string
    val option_title : string
    val option_intro : string
    val with_parameter_list : string
    val hide_modules : string
    val no_header : string
    val no_trailer : string
    val separate_files : string
    val latex_title : (int * string) list ref -> string
    val default_latex_value_prefix : string
    val latex_value_prefix : string
    val default_latex_type_prefix : string
    val latex_type_prefix : string
    val default_latex_type_elt_prefix : string
    val latex_type_elt_prefix : string
    val default_latex_extension_prefix : string
    val latex_extension_prefix : string
    val default_latex_exception_prefix : string
    val latex_exception_prefix : string
    val default_latex_module_prefix : string
    val latex_module_prefix : string
    val default_latex_module_type_prefix : string
    val latex_module_type_prefix : string
    val default_latex_class_prefix : string
    val latex_class_prefix : string
    val default_latex_class_type_prefix : string
    val latex_class_type_prefix : string
    val default_latex_attribute_prefix : string
    val latex_attribute_prefix : string
    val default_latex_method_prefix : string
    val latex_method_prefix : string
    val no_toc : string
    val sort_modules : string
    val no_stop : string
    val no_custom_tags : string
    val remove_stars : string
    val keep_code : string
    val inverse_merge_ml_mli : string
    val no_filter_with_module_constraints : string
    val merge_description : char * string
    val merge_author : char * string
    val merge_version : char * string
    val merge_see : char * string
    val merge_since : char * string
    val merge_before : char * string
    val merge_deprecated : char * string
    val merge_param : char * string
    val merge_raised_exception : char * string
    val merge_return_value : char * string
    val merge_custom : char * string
    val merge_all : char * string
    val no_index : string
    val esc_8bits : string
    val texinfo_title : (int * (string * string)) list ref -> string
    val info_section : string
    val info_entry : string
    val options_can_be : string
    val string_of_options_list : (char * string) list -> string
    val merge_options : string
    val initially_opened_module : string
    val library_namespace : string
    val help : string
    val warning : string
    val error_location : string -> int -> int -> string
    val bad_magic_number : string
    val not_a_module_name : string -> string
    val load_file_error : string -> string -> string
    val wrong_format : string -> string
    val errors_occured : int -> string
    val parse_error : string
    val text_parse_error : int -> int -> string -> string
    val file_not_found_in_paths : string list -> string -> string
    val tag_not_handled : string -> string
    val should_escape_at_sign : string
    val bad_tree : string
    val not_a_valid_tag : string -> string
    val fun_without_param : string -> string
    val method_without_param : string -> string
    val anonymous_parameters : string -> string
    val function_colon : string -> string
    val implicit_match_in_parameter : string
    val unknown_extension : string -> string
    val two_implementations : string -> string
    val two_interfaces : string -> string
    val too_many_module_objects : string -> string
    val extension_not_found_in_implementation : string -> string -> string
    val exception_not_found_in_implementation : string -> string -> string
    val type_not_found_in_implementation : string -> string -> string
    val module_not_found_in_implementation : string -> string -> string
    val value_not_found_in_implementation : string -> string -> string
    val class_not_found_in_implementation : string -> string -> string
    val attribute_not_found_in_implementation : string -> string -> string
    val method_not_found_in_implementation : string -> string -> string
    val different_types : string -> string
    val attribute_type_not_found : string -> string -> string
    val method_type_not_found : string -> string -> string
    val module_not_found : string -> string -> string
    val module_type_not_found : string -> string -> string
    val value_not_found : string -> string -> string
    val extension_not_found : string -> string -> string
    val exception_not_found : string -> string -> string
    val type_not_found : string -> string -> string
    val class_not_found : string -> string -> string
    val class_type_not_found : string -> string -> string
    val type_not_found_in_typedtree : string -> string
    val extension_not_found_in_typedtree : string -> string
    val exception_not_found_in_typedtree : string -> string
    val module_type_not_found_in_typedtree : string -> string
    val module_not_found_in_typedtree : string -> string
    val class_not_found_in_typedtree : string -> string
    val class_type_not_found_in_typedtree : string -> string
    val inherit_classexp_not_found_in_typedtree : int -> string
    val attribute_not_found_in_typedtree : string -> string
    val method_not_found_in_typedtree : string -> string
    val misplaced_comment : string -> int -> string
    val cross_module_not_found : string -> string
    val cross_module_type_not_found : string -> string
    val cross_module_or_module_type_not_found : string -> string
    val cross_class_not_found : string -> string
    val cross_class_type_not_found : string -> string
    val cross_class_or_class_type_not_found : string -> string
    val cross_extension_not_found : string -> string
    val cross_exception_not_found : string -> string
    val cross_element_not_found : string -> string
    val cross_method_not_found : string -> string
    val cross_attribute_not_found : string -> string
    val cross_section_not_found : string -> string
    val cross_value_not_found : string -> string
    val cross_type_not_found : string -> string
    val cross_recfield_not_found : string -> string
    val cross_const_not_found : string -> string
    val code_could_be_cross_reference : string -> string -> string
    val object_end : string
    val struct_end : string
    val sig_end : string
    val current_generator_is_not : string -> string
    val analysing : string -> string
    val merging : string
    val cross_referencing : string
    val generating_doc : string
    val loading : string -> string
    val file_generated : string -> string
    val file_exists_dont_generate : string -> string
    val modul : string
    val modules : string
    val functors : string
    val values : string
    val types : string
    val extensions : string
    val exceptions : string
    val record : string
    val variant : string
    val mutab : string
    val functions : string
    val parameters : string
    val abstract : string
    val functo : string
    val clas : string
    val classes : string
    val attributes : string
    val methods : string
    val authors : string
    val version : string
    val since : string
    val before : string
    val deprecated : string
    val alert : string
    val raises : string
    val returns : string
    val inherits : string
    val inheritance : string
    val privat : string
    val module_type : string
    val class_type : string
    val description : string
    val interface : string
    val type_parameters : string
    val class_types : string
    val module_types : string
    val see_also : string
    val documentation : string
    val index_of : string
    val top : string
    val index_of_values : string
    val index_of_extensions : string
    val index_of_exceptions : string
    val index_of_types : string
    val index_of_attributes : string
    val index_of_methods : string
    val index_of_classes : string
    val index_of_class_types : string
    val index_of_modules : string
    val index_of_module_types : string
    val previous : string
    val next : string
    val up : string
    diff --git a/ocaml/Odoc_misc/index.html b/ocaml/Odoc_misc/index.html new file mode 100644 index 0000000..668fa68 --- /dev/null +++ b/ocaml/Odoc_misc/index.html @@ -0,0 +1,6 @@ + +Odoc_misc (ocaml.Odoc_misc)

    Module Odoc_misc

    val no_blanks : string -> string
    val input_file_as_string : string -> string
    val split_with_blanks : string -> string list
    val string_of_longident : Longident.t -> string
    val string_of_text : Odoc_types.text -> string
    val string_of_author_list : string list -> string
    val string_of_version_opt : string option -> string
    val string_of_since_opt : string option -> string
    val string_of_raised_exceptions : (string * Odoc_types.text) list -> string
    val string_of_see : (Odoc_types.see_ref * Odoc_types.text) -> string
    val string_of_sees : (Odoc_types.see_ref * Odoc_types.text) list -> string
    val string_of_return_opt : Odoc_types.text option -> string
    val string_of_info : Odoc_types.info -> string
    val apply_opt : ('a -> 'b) -> 'a option -> 'b option
    val string_of_date : ?absolute:bool -> ?hour:bool -> float -> string
    val current_date : string
    val first_sentence_of_text : Odoc_types.text -> Odoc_types.text
    val first_sentence_and_rest_of_text : + Odoc_types.text -> + Odoc_types.text * Odoc_types.text
    val text_no_title_no_list : Odoc_types.text -> Odoc_types.text
    val text_concat : Odoc_types.text -> Odoc_types.text list -> Odoc_types.text
    val get_titles_in_text : + Odoc_types.text -> + (int * string option * Odoc_types.text) list
    val create_index_lists : 'a list -> ('a -> string) -> 'a list list
    val remove_duplicates : ('a -> 'a -> int) -> 'a list -> 'a list
    val remove_ending_newline : string -> string
    val search_string_backward : pat:string -> s:string -> int
    val remove_option : Types.type_expr -> Types.type_expr
    val is_optional : Asttypes.arg_label -> bool
    val label_name : Asttypes.arg_label -> string
    diff --git a/ocaml/Odoc_module/index.html b/ocaml/Odoc_module/index.html new file mode 100644 index 0000000..2caafc5 --- /dev/null +++ b/ocaml/Odoc_module/index.html @@ -0,0 +1,49 @@ + +Odoc_module (ocaml.Odoc_module)

    Module Odoc_module

    module String = Misc.Stdlib.String
    module Name = Odoc_name
    type module_element =
    1. | Element_module of t_module
    2. | Element_module_type of t_module_type
    3. | Element_included_module of included_module
    4. | Element_class of Odoc_class.t_class
    5. | Element_class_type of Odoc_class.t_class_type
    6. | Element_value of Odoc_value.t_value
    7. | Element_type_extension of Odoc_extension.t_type_extension
    8. | Element_exception of Odoc_exception.t_exception
    9. | Element_type of Odoc_type.t_type
    10. | Element_module_comment of Odoc_types.text
    and mmt =
    1. | Mod of t_module
    2. | Modtype of t_module_type
    and included_module = {
    1. im_name : Name.t;
    2. mutable im_module : mmt option;
    3. mutable im_info : Odoc_types.info option;
    }
    and module_alias = {
    1. ma_name : Name.t;
    2. mutable ma_module : mmt option;
    }
    and module_parameter = {
    1. mp_name : string;
    2. mp_type : Types.module_type option;
    3. mp_type_code : string;
    4. mp_kind : module_type_kind;
    }
    and module_kind =
    1. | Module_struct of module_element list
    2. | Module_alias of module_alias
    3. | Module_functor of module_parameter * module_kind
    4. | Module_apply of module_kind * module_kind
    5. | Module_apply_unit of module_kind
    6. | Module_with of module_type_kind * string
    7. | Module_constraint of module_kind * module_type_kind
    8. | Module_typeof of string
    9. | Module_unpack of string * module_type_alias
    and t_module = {
    1. m_name : Name.t;
    2. mutable m_type : Types.module_type;
    3. mutable m_info : Odoc_types.info option;
    4. m_is_interface : bool;
    5. m_file : string;
    6. mutable m_kind : module_kind;
    7. mutable m_loc : Odoc_types.location;
    8. mutable m_top_deps : Name.t list;
    9. mutable m_code : string option;
    10. mutable m_code_intf : string option;
    11. m_text_only : bool;
    }
    and module_type_alias = {
    1. mta_name : Name.t;
    2. mutable mta_module : t_module_type option;
    }
    and module_type_kind =
    1. | Module_type_struct of module_element list
    2. | Module_type_functor of module_parameter * module_type_kind
    3. | Module_type_alias of module_type_alias
    4. | Module_type_with of module_type_kind * string
    5. | Module_type_typeof of string
    and t_module_type = {
    1. mt_name : Name.t;
    2. mutable mt_info : Odoc_types.info option;
    3. mutable mt_type : Types.module_type option;
    4. mt_is_interface : bool;
    5. mt_file : string;
    6. mutable mt_kind : module_type_kind option;
    7. mutable mt_loc : Odoc_types.location;
    }
    val values : module_element list -> Odoc_value.t_value list
    val types : module_element list -> Odoc_type.t_type list
    val type_extensions : + module_element list -> + Odoc_extension.t_type_extension list
    val exceptions : module_element list -> Odoc_exception.t_exception list
    val classes : module_element list -> Odoc_class.t_class list
    val class_types : module_element list -> Odoc_class.t_class_type list
    val modules : module_element list -> t_module list
    val mod_types : module_element list -> t_module_type list
    val comments : module_element list -> Odoc_types.text list
    val included_modules : module_element list -> included_module list
    val module_type_elements : ?trans:bool -> t_module_type -> module_element list
    val module_elements : ?trans:bool -> t_module -> module_element list
    val module_values : ?trans:bool -> t_module -> Odoc_value.t_value list
    val module_functions : ?trans:bool -> t_module -> Odoc_value.t_value list
    val module_simple_values : ?trans:bool -> t_module -> Odoc_value.t_value list
    val module_types : ?trans:bool -> t_module -> Odoc_type.t_type list
    val module_type_extensions : + ?trans:bool -> + t_module -> + Odoc_extension.t_type_extension list
    val module_exceptions : + ?trans:bool -> + t_module -> + Odoc_exception.t_exception list
    val module_classes : ?trans:bool -> t_module -> Odoc_class.t_class list
    val module_class_types : + ?trans:bool -> + t_module -> + Odoc_class.t_class_type list
    val module_modules : ?trans:bool -> t_module -> t_module list
    val module_module_types : ?trans:bool -> t_module -> t_module_type list
    val module_included_modules : ?trans:bool -> t_module -> included_module list
    val module_comments : ?trans:bool -> t_module -> Odoc_types.text list
    val module_type_parameters : + ?trans:bool -> + t_module_type -> + (module_parameter * Odoc_types.text option) list
    val module_parameters : + ?trans:bool -> + t_module -> + (module_parameter * Odoc_types.text option) list
    val module_all_submodules : ?trans:bool -> t_module -> t_module list
    val module_type_is_functor : t_module_type -> bool
    val module_is_functor : t_module -> bool
    val module_type_values : + ?trans:bool -> + t_module_type -> + Odoc_value.t_value list
    val module_type_types : ?trans:bool -> t_module_type -> Odoc_type.t_type list
    val module_type_type_extensions : + ?trans:bool -> + t_module_type -> + Odoc_extension.t_type_extension list
    val module_type_exceptions : + ?trans:bool -> + t_module_type -> + Odoc_exception.t_exception list
    val module_type_classes : + ?trans:bool -> + t_module_type -> + Odoc_class.t_class list
    val module_type_class_types : + ?trans:bool -> + t_module_type -> + Odoc_class.t_class_type list
    val module_type_modules : ?trans:bool -> t_module_type -> t_module list
    val module_type_module_types : + ?trans:bool -> + t_module_type -> + t_module_type list
    val module_type_included_modules : + ?trans:bool -> + t_module_type -> + included_module list
    val module_type_comments : ?trans:bool -> t_module_type -> Odoc_types.text list
    val module_type_functions : + ?trans:bool -> + t_module_type -> + Odoc_value.t_value list
    val module_type_simple_values : + ?trans:bool -> + t_module_type -> + Odoc_value.t_value list
    val module_all_classes : ?trans:bool -> t_module -> Odoc_class.t_class list
    val module_type_all_classes : + ?trans:bool -> + t_module_type -> + Odoc_class.t_class list
    diff --git a/ocaml/Odoc_name/Map/index.html b/ocaml/Odoc_name/Map/index.html new file mode 100644 index 0000000..5a882bc --- /dev/null +++ b/ocaml/Odoc_name/Map/index.html @@ -0,0 +1,6 @@ + +Map (ocaml.Odoc_name.Map)

    Module Odoc_name.Map

    type key = t
    type !+'a t
    val empty : 'a t
    val add : key -> 'a -> 'a t -> 'a t
    val add_to_list : key -> 'a -> 'a list t -> 'a list t
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t
    val singleton : key -> 'a -> 'a t
    val remove : key -> 'a t -> 'a t
    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t
    val cardinal : 'a t -> int
    val bindings : 'a t -> (key * 'a) list
    val min_binding : 'a t -> key * 'a
    val min_binding_opt : 'a t -> (key * 'a) option
    val max_binding : 'a t -> key * 'a
    val max_binding_opt : 'a t -> (key * 'a) option
    val choose : 'a t -> key * 'a
    val choose_opt : 'a t -> (key * 'a) option
    val find : key -> 'a t -> 'a
    val find_opt : key -> 'a t -> 'a option
    val find_first : (key -> bool) -> 'a t -> key * 'a
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option
    val find_last : (key -> bool) -> 'a t -> key * 'a
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option
    val iter : (key -> 'a -> unit) -> 'a t -> unit
    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc
    val map : ('a -> 'b) -> 'a t -> 'b t
    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
    val filter : (key -> 'a -> bool) -> 'a t -> 'a t
    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t
    val split : key -> 'a t -> 'a t * 'a option * 'a t
    val is_empty : 'a t -> bool
    val mem : key -> 'a t -> bool
    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
    val for_all : (key -> 'a -> bool) -> 'a t -> bool
    val exists : (key -> 'a -> bool) -> 'a t -> bool
    val to_list : 'a t -> (key * 'a) list
    val of_list : (key * 'a) list -> 'a t
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
    val to_rev_seq : 'a t -> (key * 'a) Stdlib.Seq.t
    val to_seq_from : key -> 'a t -> (key * 'a) Stdlib.Seq.t
    val add_seq : (key * 'a) Stdlib.Seq.t -> 'a t -> 'a t
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
    diff --git a/ocaml/Odoc_name/index.html b/ocaml/Odoc_name/index.html new file mode 100644 index 0000000..8dfb2c5 --- /dev/null +++ b/ocaml/Odoc_name/index.html @@ -0,0 +1,2 @@ + +Odoc_name (ocaml.Odoc_name)

    Module Odoc_name

    type t = string
    val parens_if_infix : t -> t
    val simple : t -> t
    val father : t -> t
    val concat : t -> t -> t
    val normalize_name : t -> t
    val head : t -> t
    val depth : t -> int
    val prefix : t -> t -> bool
    val alias_unprefix : t -> t -> t
    val get_relative : t -> t -> t
    val get_relative_opt : t -> t -> t
    val get_relative_raw : t -> t -> t
    val hide_given_modules : t list -> t -> t
    val qualified : t -> bool
    val from_ident : Ident.t -> t
    val from_path : Path.t -> t
    val to_path : t -> Path.t
    val from_longident : Longident.t -> t
    module Map : sig ... end
    diff --git a/ocaml/Odoc_ocamlhtml/index.html b/ocaml/Odoc_ocamlhtml/index.html new file mode 100644 index 0000000..3d0e905 --- /dev/null +++ b/ocaml/Odoc_ocamlhtml/index.html @@ -0,0 +1,2 @@ + +Odoc_ocamlhtml (ocaml.Odoc_ocamlhtml)

    Module Odoc_ocamlhtml

    Generation of html code to display OCaml code.

    val escape_base : string -> string
    val html_of_comment : (string -> string) ref
    val code_class : string
    val html_of_code : Stdlib.Buffer.t -> ?with_pre:bool -> string -> unit
    diff --git a/ocaml/Odoc_parameter/index.html b/ocaml/Odoc_parameter/index.html new file mode 100644 index 0000000..bdd7c1a --- /dev/null +++ b/ocaml/Odoc_parameter/index.html @@ -0,0 +1,8 @@ + +Odoc_parameter (ocaml.Odoc_parameter)

    Module Odoc_parameter

    Representation and manipulation of method / function / class parameters.

    Types

    type simple_name = {
    1. sn_name : string;
    2. sn_type : Types.type_expr;
    3. mutable sn_text : Odoc_types.text option;
    }

    Representation of a simple parameter name

    type param_info =
    1. | Simple_name of simple_name
    2. | Tuple of param_info list * Types.type_expr
      (*

      Representation of parameter names. We need it to represent parameter names in tuples. The value Tuple ([], t) stands for an anonymous parameter.

      *)
    type parameter = param_info

    A parameter is just a param_info.

    Functions

    val complete_name : parameter -> string

    access to the name as a string. For tuples, parentheses and commas are added.

    access to the complete type

    val update_parameter_text : + (string -> Odoc_types.text option) -> + parameter -> + unit

    Update the text of a parameter using a function returning the optional text associated to a parameter name.

    val desc_by_name : parameter -> string -> Odoc_types.text option

    access to the description of a specific name.

    • raises Not_found

      if no description is associated to the given name.

    val names : parameter -> string list

    access to the list of names ; only one for a simple parameter, or a list for tuples.

    val type_by_name : parameter -> string -> Types.type_expr

    access to the type of a specific name.

    • raises Not_found

      if no type is associated to the given name.

    val desc_from_info_opt : + Odoc_types.info option -> + string -> + Odoc_types.text option

    access to the optional description of a parameter name from an optional info structure.

    diff --git a/ocaml/Odoc_parser/index.html b/ocaml/Odoc_parser/index.html new file mode 100644 index 0000000..f282b79 --- /dev/null +++ b/ocaml/Odoc_parser/index.html @@ -0,0 +1,11 @@ + +Odoc_parser (ocaml.Odoc_parser)

    Module Odoc_parser

    type token =
    1. | Description of string * string option
    2. | See_url of string
    3. | See_file of string
    4. | See_doc of string
    5. | T_PARAM of string
    6. | T_AUTHOR
    7. | T_VERSION
    8. | T_SEE
    9. | T_SINCE
    10. | T_BEFORE of string
    11. | T_DEPRECATED
    12. | T_RAISES of string
    13. | T_RETURN
    14. | T_CUSTOM of string
    15. | EOF
    16. | Desc of string
    val main : + (Stdlib.Lexing.lexbuf -> token) -> + Stdlib.Lexing.lexbuf -> + (string * string option) option
    val info_part2 : + (Stdlib.Lexing.lexbuf -> token) -> + Stdlib.Lexing.lexbuf -> + unit
    val see_info : + (Stdlib.Lexing.lexbuf -> token) -> + Stdlib.Lexing.lexbuf -> + Odoc_types.see_ref * string
    diff --git a/ocaml/Odoc_print/index.html b/ocaml/Odoc_print/index.html new file mode 100644 index 0000000..17c9b41 --- /dev/null +++ b/ocaml/Odoc_print/index.html @@ -0,0 +1,6 @@ + +Odoc_print (ocaml.Odoc_print)

    Module Odoc_print

    val string_of_type_expr : Types.type_expr -> string
    val string_of_module_type : + ?code:string -> + ?complete:bool -> + Types.module_type -> + string
    val string_of_class_type : ?complete:bool -> Types.class_type -> string
    diff --git a/ocaml/Odoc_scan/class-scanner/index.html b/ocaml/Odoc_scan/class-scanner/index.html new file mode 100644 index 0000000..8f8785e --- /dev/null +++ b/ocaml/Odoc_scan/class-scanner/index.html @@ -0,0 +1,6 @@ + +scanner (ocaml.Odoc_scan.scanner)

    Class Odoc_scan.scanner

    method scan_attribute : Odoc_value.t_attribute -> unit
    method scan_class : Odoc_class.t_class -> unit
    method scan_class_comment : Odoc_types.text -> unit
    method scan_class_elements : Odoc_class.t_class -> unit
    method scan_class_pre : Odoc_class.t_class -> bool
    method scan_class_type : Odoc_class.t_class_type -> unit
    method scan_class_type_comment : Odoc_types.text -> unit
    method scan_class_type_elements : Odoc_class.t_class_type -> unit
    method scan_class_type_pre : Odoc_class.t_class_type -> bool
    method scan_exception : Odoc_exception.t_exception -> unit
    method scan_extension_constructor : Odoc_extension.t_extension_constructor -> + unit
    method scan_included_module : Odoc_module.included_module -> unit
    method scan_method : Odoc_value.t_method -> unit
    method scan_module : Odoc_module.t_module -> unit
    method scan_module_comment : Odoc_types.text -> unit
    method scan_module_elements : Odoc_module.t_module -> unit
    method scan_module_list : Odoc_module.t_module list -> unit
    method scan_module_pre : Odoc_module.t_module -> bool
    method scan_module_type : Odoc_module.t_module_type -> unit
    method scan_module_type_comment : Odoc_types.text -> unit
    method scan_module_type_elements : Odoc_module.t_module_type -> unit
    method scan_module_type_pre : Odoc_module.t_module_type -> bool
    method scan_type : Odoc_type.t_type -> unit
    method scan_type_const : Odoc_type.t_type -> + Odoc_type.variant_constructor -> + unit
    method scan_type_extension : Odoc_extension.t_type_extension -> unit
    method scan_type_extension_constructors : Odoc_extension.t_type_extension -> + unit
    method scan_type_extension_pre : Odoc_extension.t_type_extension -> bool
    method scan_type_pre : Odoc_type.t_type -> bool
    method scan_type_recfield : Odoc_type.t_type -> Odoc_type.record_field -> unit
    method scan_value : Odoc_value.t_value -> unit
    diff --git a/ocaml/Odoc_scan/index.html b/ocaml/Odoc_scan/index.html new file mode 100644 index 0000000..e0ada99 --- /dev/null +++ b/ocaml/Odoc_scan/index.html @@ -0,0 +1,2 @@ + +Odoc_scan (ocaml.Odoc_scan)

    Module Odoc_scan

    class scanner : object ... end
    diff --git a/ocaml/Odoc_search/P_name/index.html b/ocaml/Odoc_search/P_name/index.html new file mode 100644 index 0000000..c61729d --- /dev/null +++ b/ocaml/Odoc_search/P_name/index.html @@ -0,0 +1,10 @@ + +P_name (ocaml.Odoc_search.P_name)

    Module Odoc_search.P_name

    type t = Str.regexp
    val (=~) : string -> Str.regexp -> bool
    val p_module : Odoc_module.t_module -> Str.regexp -> bool * bool
    val p_module_type : Odoc_module.t_module_type -> Str.regexp -> bool * bool
    val p_class : Odoc_class.t_class -> Str.regexp -> bool * bool
    val p_class_type : Odoc_class.t_class_type -> Str.regexp -> bool * bool
    val p_value : Odoc_value.t_value -> Str.regexp -> bool
    val p_recfield : + Odoc_type.t_type -> + Odoc_type.record_field -> + Str.regexp -> + bool
    val p_const : + Odoc_type.t_type -> + Odoc_type.variant_constructor -> + Str.regexp -> + bool
    val p_type : Odoc_type.t_type -> Str.regexp -> bool * bool
    val p_exception : Odoc_exception.t_exception -> Str.regexp -> bool
    val p_attribute : Odoc_value.t_attribute -> Str.regexp -> bool
    val p_method : Odoc_value.t_method -> Str.regexp -> bool
    diff --git a/ocaml/Odoc_search/Search/argument-1-P/index.html b/ocaml/Odoc_search/Search/argument-1-P/index.html new file mode 100644 index 0000000..a9122a1 --- /dev/null +++ b/ocaml/Odoc_search/Search/argument-1-P/index.html @@ -0,0 +1,2 @@ + +P (ocaml.Odoc_search.Search.P)

    Parameter Search.P

    type t
    val p_module : Odoc_module.t_module -> t -> bool * bool
    val p_module_type : Odoc_module.t_module_type -> t -> bool * bool
    val p_class : Odoc_class.t_class -> t -> bool * bool
    val p_class_type : Odoc_class.t_class_type -> t -> bool * bool
    val p_value : Odoc_value.t_value -> t -> bool
    val p_recfield : Odoc_type.t_type -> Odoc_type.record_field -> t -> bool
    val p_type : Odoc_type.t_type -> t -> bool * bool
    val p_extension : Odoc_extension.t_extension_constructor -> t -> bool
    val p_exception : Odoc_exception.t_exception -> t -> bool
    val p_attribute : Odoc_value.t_attribute -> t -> bool
    val p_method : Odoc_value.t_method -> t -> bool
    val p_section : string -> t -> bool
    diff --git a/ocaml/Odoc_search/Search/index.html b/ocaml/Odoc_search/Search/index.html new file mode 100644 index 0000000..8b195d5 --- /dev/null +++ b/ocaml/Odoc_search/Search/index.html @@ -0,0 +1,19 @@ + +Search (ocaml.Odoc_search.Search)

    Module Odoc_search.Search

    Parameters

    module P : Predicates

    Signature

    val search_section : Odoc_types.text -> string -> P.t -> result_element list
    val search_value : Odoc_value.t_value -> P.t -> result_element list
    val search_recfield : + Odoc_type.t_type -> + Odoc_type.record_field -> + P.t -> + result_element list
    val search_const : + Odoc_type.t_type -> + Odoc_type.variant_constructor -> + P.t -> + result_element list
    val search_type : Odoc_type.t_type -> P.t -> result_element list
    val search_extension_constructor : + Odoc_extension.t_extension_constructor -> + P.t -> + result_element list
    val search_type_extension : + Odoc_extension.t_type_extension -> + P.t -> + result_element list
    val search_exception : Odoc_exception.t_exception -> P.t -> result_element list
    val search_attribute : Odoc_value.t_attribute -> P.t -> result_element list
    val search_method : Odoc_value.t_method -> P.t -> result_element list
    val search_class : Odoc_class.t_class -> P.t -> result_element list
    val search_class_type : Odoc_class.t_class_type -> P.t -> result_element list
    val search_module_type : + Odoc_module.t_module_type -> + P.t -> + result_element list
    val search_module : Odoc_module.t_module -> P.t -> result_element list
    diff --git a/ocaml/Odoc_search/Search_by_name/index.html b/ocaml/Odoc_search/Search_by_name/index.html new file mode 100644 index 0000000..61c6664 --- /dev/null +++ b/ocaml/Odoc_search/Search_by_name/index.html @@ -0,0 +1,32 @@ + +Search_by_name (ocaml.Odoc_search.Search_by_name)

    Module Odoc_search.Search_by_name

    val search_section : + Odoc_types.text -> + string -> + P_name.t -> + result_element list
    val search_value : Odoc_value.t_value -> P_name.t -> result_element list
    val search_recfield : + Odoc_type.t_type -> + Odoc_type.record_field -> + P_name.t -> + result_element list
    val search_type : Odoc_type.t_type -> P_name.t -> result_element list
    val search_extension_constructor : + Odoc_extension.t_extension_constructor -> + P_name.t -> + result_element list
    val search_type_extension : + Odoc_extension.t_type_extension -> + P_name.t -> + result_element list
    val search_exception : + Odoc_exception.t_exception -> + P_name.t -> + result_element list
    val search_attribute : + Odoc_value.t_attribute -> + P_name.t -> + result_element list
    val search_method : Odoc_value.t_method -> P_name.t -> result_element list
    val search_class : Odoc_class.t_class -> P_name.t -> result_element list
    val search_class_type : + Odoc_class.t_class_type -> + P_name.t -> + result_element list
    val search_module_type : + Odoc_module.t_module_type -> + P_name.t -> + result_element list
    val search_module : Odoc_module.t_module -> P_name.t -> result_element list
    diff --git a/ocaml/Odoc_search/index.html b/ocaml/Odoc_search/index.html new file mode 100644 index 0000000..3039bfe --- /dev/null +++ b/ocaml/Odoc_search/index.html @@ -0,0 +1,4 @@ + +Odoc_search (ocaml.Odoc_search)

    Module Odoc_search

    type result_element =
    1. | Res_module of Odoc_module.t_module
    2. | Res_module_type of Odoc_module.t_module_type
    3. | Res_class of Odoc_class.t_class
    4. | Res_class_type of Odoc_class.t_class_type
    5. | Res_value of Odoc_value.t_value
    6. | Res_type of Odoc_type.t_type
    7. | Res_extension of Odoc_extension.t_extension_constructor
    8. | Res_exception of Odoc_exception.t_exception
    9. | Res_attribute of Odoc_value.t_attribute
    10. | Res_method of Odoc_value.t_method
    11. | Res_section of string * Odoc_types.text
    12. | Res_recfield of Odoc_type.t_type * Odoc_type.record_field
    13. | Res_const of Odoc_type.t_type * Odoc_type.variant_constructor
    type result = result_element list
    module type Predicates = sig ... end
    module P_name : sig ... end
    module Search_by_name : sig ... end
    val values : Odoc_module.t_module list -> Odoc_value.t_value list
    val exceptions : Odoc_module.t_module list -> Odoc_exception.t_exception list
    val types : Odoc_module.t_module list -> Odoc_type.t_type list
    val attributes : Odoc_module.t_module list -> Odoc_value.t_attribute list
    val methods : Odoc_module.t_module list -> Odoc_value.t_method list
    val classes : Odoc_module.t_module list -> Odoc_class.t_class list
    val class_types : Odoc_module.t_module list -> Odoc_class.t_class_type list
    val modules : Odoc_module.t_module list -> Odoc_module.t_module list
    val module_types : Odoc_module.t_module list -> Odoc_module.t_module_type list
    val type_exists : Odoc_module.t_module list -> Str.regexp -> bool
    val value_exists : Odoc_module.t_module list -> Str.regexp -> bool
    val module_exists : Odoc_module.t_module list -> Str.regexp -> bool
    val module_type_exists : Odoc_module.t_module list -> Str.regexp -> bool
    val class_exists : Odoc_module.t_module list -> Str.regexp -> bool
    val class_type_exists : Odoc_module.t_module list -> Str.regexp -> bool
    val extension_exists : Odoc_module.t_module list -> Str.regexp -> bool
    val exception_exists : Odoc_module.t_module list -> Str.regexp -> bool
    val attribute_exists : Odoc_module.t_module list -> Str.regexp -> bool
    val method_exists : Odoc_module.t_module list -> Str.regexp -> bool
    val find_section : Odoc_module.t_module list -> Str.regexp -> Odoc_types.text
    diff --git a/ocaml/Odoc_search/module-type-Predicates/index.html b/ocaml/Odoc_search/module-type-Predicates/index.html new file mode 100644 index 0000000..03c88f3 --- /dev/null +++ b/ocaml/Odoc_search/module-type-Predicates/index.html @@ -0,0 +1,2 @@ + +Predicates (ocaml.Odoc_search.Predicates)

    Module type Odoc_search.Predicates

    type t
    val p_module : Odoc_module.t_module -> t -> bool * bool
    val p_module_type : Odoc_module.t_module_type -> t -> bool * bool
    val p_class : Odoc_class.t_class -> t -> bool * bool
    val p_class_type : Odoc_class.t_class_type -> t -> bool * bool
    val p_value : Odoc_value.t_value -> t -> bool
    val p_recfield : Odoc_type.t_type -> Odoc_type.record_field -> t -> bool
    val p_type : Odoc_type.t_type -> t -> bool * bool
    val p_extension : Odoc_extension.t_extension_constructor -> t -> bool
    val p_exception : Odoc_exception.t_exception -> t -> bool
    val p_attribute : Odoc_value.t_attribute -> t -> bool
    val p_method : Odoc_value.t_method -> t -> bool
    val p_section : string -> t -> bool
    diff --git a/ocaml/Odoc_see_lexer/index.html b/ocaml/Odoc_see_lexer/index.html new file mode 100644 index 0000000..d6f007f --- /dev/null +++ b/ocaml/Odoc_see_lexer/index.html @@ -0,0 +1,2 @@ + +Odoc_see_lexer (ocaml.Odoc_see_lexer)

    Module Odoc_see_lexer

    diff --git a/ocaml/Odoc_sig/Analyser/argument-1-_/index.html b/ocaml/Odoc_sig/Analyser/argument-1-_/index.html new file mode 100644 index 0000000..4dcacae --- /dev/null +++ b/ocaml/Odoc_sig/Analyser/argument-1-_/index.html @@ -0,0 +1,6 @@ + +_ (ocaml.Odoc_sig.Analyser._)

    Parameter Analyser._

    val all_special : string -> string -> int * Odoc_types.info list
    val blank_line_outside_simple : string -> string -> bool
    val just_after_special : string -> string -> int * Odoc_types.info option
    val first_special : string -> string -> int * Odoc_types.info option
    val get_comments : + (Odoc_types.text -> 'a) -> + string -> + string -> + Odoc_types.info option * 'a list
    diff --git a/ocaml/Odoc_sig/Analyser/index.html b/ocaml/Odoc_sig/Analyser/index.html new file mode 100644 index 0000000..a0e8cfa --- /dev/null +++ b/ocaml/Odoc_sig/Analyser/index.html @@ -0,0 +1,51 @@ + +Analyser (ocaml.Odoc_sig.Analyser)

    Module Odoc_sig.Analyser

    Parameters

    module _ : Info_retriever

    Signature

    val file : string ref
    val file_name : string ref
    val get_string_of_file : int -> int -> string
    val prepare_file : string -> string -> unit
    val preamble : + string -> + string -> + ('a -> Location.t) -> + 'a list -> + int * Odoc_types.info option
    val get_comments_in_class : + int -> + int -> + Odoc_types.info option * Odoc_class.class_element list
    val get_comments_in_module : + int -> + int -> + Odoc_types.info option * Odoc_module.module_element list
    val name_comment_from_type_decl : + int -> + int -> + Parsetree.type_declaration -> + int * (string * Odoc_types.info option) list
    val manifest_structure : + Odoc_env.env -> + (string * Odoc_types.info option) list -> + Types.type_expr -> + Odoc_type.type_manifest
    val get_type_kind : + Odoc_env.env -> + (string * Odoc_types.info option) list -> + Types.type_decl_kind -> + Odoc_type.type_kind
    val merge_infos : + Odoc_types.info option -> + Odoc_types.info option -> + Odoc_types.info option
    val analyse_module_type_kind : + ?erased: + [ `Constrained of Parsetree.with_constraint list | `Removed ] + Odoc_name.Map.t -> + Odoc_env.env -> + Odoc_name.t -> + Parsetree.module_type -> + Types.module_type -> + Odoc_module.module_type_kind
    val analyse_class_type_kind : + Odoc_env.env -> + Odoc_name.t -> + int -> + Parsetree.class_type -> + Types.class_type -> + Odoc_class.class_type_kind
    val analyse_signature : + string -> + string -> + Parsetree.signature -> + Types.signature -> + Odoc_module.t_module
    diff --git a/ocaml/Odoc_sig/Signature_search/index.html b/ocaml/Odoc_sig/Signature_search/index.html new file mode 100644 index 0000000..22e4791 --- /dev/null +++ b/ocaml/Odoc_sig/Signature_search/index.html @@ -0,0 +1,5 @@ + +Signature_search (ocaml.Odoc_sig.Signature_search)

    Module Odoc_sig.Signature_search

    type ele
    val table : Types.signature -> tab
    val search_value : tab -> string -> Types.type_expr
    val search_extension : tab -> string -> Types.extension_constructor
    val search_type : tab -> string -> Types.type_declaration
    val search_class : tab -> string -> Types.class_declaration
    val search_class_type : tab -> string -> Types.class_type_declaration
    val search_module : tab -> string -> Types.module_type
    val search_module_type : tab -> string -> Types.module_type option
    val search_attribute_type : + Types.Vars.key -> + Types.class_signature -> + Types.type_expr
    val search_method_type : string -> Types.class_signature -> Types.type_expr
    diff --git a/ocaml/Odoc_sig/index.html b/ocaml/Odoc_sig/index.html new file mode 100644 index 0000000..cf9e3fe --- /dev/null +++ b/ocaml/Odoc_sig/index.html @@ -0,0 +1,5 @@ + +Odoc_sig (ocaml.Odoc_sig)

    Module Odoc_sig

    module type Info_retriever = sig ... end
    val analyze_alerts : + Odoc_types.info option -> + Parsetree.attributes -> + Odoc_types.info option
    module Analyser (_ : Info_retriever) : sig ... end
    diff --git a/ocaml/Odoc_sig/module-type-Info_retriever/index.html b/ocaml/Odoc_sig/module-type-Info_retriever/index.html new file mode 100644 index 0000000..925aabe --- /dev/null +++ b/ocaml/Odoc_sig/module-type-Info_retriever/index.html @@ -0,0 +1,6 @@ + +Info_retriever (ocaml.Odoc_sig.Info_retriever)

    Module type Odoc_sig.Info_retriever

    val all_special : string -> string -> int * Odoc_types.info list
    val blank_line_outside_simple : string -> string -> bool
    val just_after_special : string -> string -> int * Odoc_types.info option
    val first_special : string -> string -> int * Odoc_types.info option
    val get_comments : + (Odoc_types.text -> 'a) -> + string -> + string -> + Odoc_types.info option * 'a list
    diff --git a/ocaml/Odoc_str/index.html b/ocaml/Odoc_str/index.html new file mode 100644 index 0000000..c9882d8 --- /dev/null +++ b/ocaml/Odoc_str/index.html @@ -0,0 +1,4 @@ + +Odoc_str (ocaml.Odoc_str)

    Module Odoc_str

    val string_of_variance : Odoc_type.t_type -> Types.Variance.t -> string
    val string_of_type_list : ?par:bool -> string -> Types.type_expr list -> string
    val string_of_type_param_list : Odoc_type.t_type -> string
    val string_of_type_extension_param_list : + Odoc_extension.t_type_extension -> + string
    val string_of_class_type_param_list : Types.type_expr list -> string
    val string_of_type : Odoc_type.t_type -> string
    val string_of_record : Odoc_type.record_field list -> string
    val string_of_class_params : Odoc_class.t_class -> string
    val string_of_type_extension : Odoc_extension.t_type_extension -> string
    val string_of_exception : Odoc_exception.t_exception -> string
    val string_of_value : Odoc_value.t_value -> string
    val string_of_attribute : Odoc_value.t_attribute -> string
    val string_of_method : Odoc_value.t_method -> string
    diff --git a/ocaml/Odoc_test/index.html b/ocaml/Odoc_test/index.html new file mode 100644 index 0000000..7ec91d4 --- /dev/null +++ b/ocaml/Odoc_test/index.html @@ -0,0 +1,2 @@ + +Odoc_test (ocaml.Odoc_test)

    Module Odoc_test

    diff --git a/ocaml/Odoc_texi/Generator/class-texi/index.html b/ocaml/Odoc_texi/Generator/class-texi/index.html new file mode 100644 index 0000000..ccaa1fb --- /dev/null +++ b/ocaml/Odoc_texi/Generator/class-texi/index.html @@ -0,0 +1,97 @@ + +texi (ocaml.Odoc_texi.Generator.texi)

    Class Generator.texi

    val mutable indices_to_build : [ `Class + | `Class_att + | `Class_type + | `Exception + | `Extension + | `Method + | `Module + | `Module_type + | `Type + | `Value ] + list
    val linebreak : Odoc_info.text_element
    val maxdepth : int
    val node_tbl : (Odoc_info.Name.t, unit) Hashtbl.t
    val mutable tag_functions : (string * (Odoc_info.text -> Odoc_info.text)) list
    method do_index : [ `Class + | `Class_att + | `Class_type + | `Exception + | `Extension + | `Method + | `Module + | `Module_type + | `Type + | `Value ] -> + unit
    method private fix_linebreaks : Odoc_info.text -> Odoc_info.text
    method generate : Odoc_info.Module.t_module list -> unit
    method generate_class_inheritance_info : out_channel -> + Odoc_info.Class.t_class -> + unit
    method generate_class_type_inheritance_info : out_channel -> + Odoc_info.Class.t_class_type -> + unit
    method generate_for_class : out_channel -> Odoc_info.Class.t_class -> unit
    method generate_for_class_type : out_channel -> + Odoc_info.Class.t_class_type -> + unit
    method generate_for_module : out_channel -> Odoc_info.Module.t_module -> unit
    method generate_for_module_type : out_channel -> + Odoc_info.Module.t_module_type -> + unit
    method generate_inheritance_info : out_channel -> + Odoc_info.Class.inherited_class list -> + unit
    method generate_texi_header : out_channel -> + string -> + Odoc_info.Module.t_module list -> + unit
    method generate_texi_trailer : out_channel -> unit
    method heading : int -> Odoc_info.text -> string
    method label : ?no_:bool -> string -> string
    method normal_class_params : Odoc_info.Name.t -> + Odoc_info.Class.t_class -> + string
    method normal_class_type : Odoc_info.Name.t -> Types.class_type -> string
    method normal_class_type_param_list : Odoc_info.Name.t -> + Types.type_expr list -> + string
    method normal_cstr_args : ?par:bool -> + Odoc_info.Name.t -> + Odoc_info.Type.constructor_args -> + string
    method normal_module_type : ?code:string -> + Odoc_info.Name.t -> + Types.module_type -> + string
    method normal_type : Odoc_info.Name.t -> Types.type_expr -> string
    method normal_type_list : ?par:bool -> + Odoc_info.Name.t -> + string -> + Types.type_expr list -> + string
    method relative_idents : Odoc_info.Name.t -> string -> string
    method relative_module_idents : Odoc_info.Name.t -> string -> string
    method scan_for_index : subparts -> unit
    method scan_for_index_in_class : Odoc_info.Class.class_element -> unit
    method scan_for_index_in_mod : Odoc_info.Module.module_element -> unit
    method private soft_fix_linebreaks : int -> + Odoc_info.text_element list -> + Odoc_info.text_element list
    method string_of_type_args : Odoc_info.Type.constructor_args -> + Types.type_expr option -> + string
    method string_of_type_parameters : Odoc_info.Type.t_type -> string
    method texi_of_Block : Odoc_info.text -> Odoc_info.Name.t
    method texi_of_Bold : Odoc_info.text -> Odoc_info.Name.t
    method texi_of_Center : Odoc_info.text -> Odoc_info.Name.t
    method texi_of_Code : Odoc_info.Name.t -> Odoc_info.Name.t
    method texi_of_CodePre : Odoc_info.Name.t -> Odoc_info.Name.t
    method texi_of_Emphasize : Odoc_info.text -> Odoc_info.Name.t
    method texi_of_Enum : Odoc_info.text list -> Odoc_info.Name.t
    method texi_of_Italic : Odoc_info.text -> Odoc_info.Name.t
    method texi_of_Left : Odoc_info.text -> Odoc_info.Name.t
    method texi_of_List : Odoc_info.text list -> Odoc_info.Name.t
    method texi_of_Newline : Odoc_info.Name.t
    method texi_of_Raw : Odoc_info.Name.t -> Odoc_info.Name.t
    method texi_of_Ref : Odoc_info.Name.t -> + Odoc_info.ref_kind option -> + Odoc_info.Name.t
    method texi_of_Right : Odoc_info.text -> Odoc_info.Name.t
    method texi_of_Subscript : Odoc_info.text -> Odoc_info.Name.t
    method texi_of_Superscript : Odoc_info.text -> Odoc_info.Name.t
    method texi_of_Target : target:string -> + code:Odoc_info.Name.t -> + Odoc_info.Name.t
    method texi_of_Title : int -> Odoc_info.text -> Odoc_info.Name.t
    method texi_of_Verbatim : Odoc_info.Name.t -> Odoc_info.Name.t
    method texi_of_attribute : Odoc_info.Value.t_attribute -> string
    method texi_of_class : Odoc_info.Class.t_class -> string
    method texi_of_class_element : Odoc_info.Name.t -> + Odoc_info.Class.class_element -> + string
    method texi_of_class_type : Odoc_info.Class.t_class_type -> string
    method texi_of_custom_text : string -> Odoc_info.text -> Odoc_info.Name.t
    method texi_of_exception : Odoc_info.Exception.t_exception -> string
    method texi_of_included_module : Odoc_info.Module.included_module -> string
    method texi_of_info : Odoc_info.info option -> string
    method texi_of_method : Odoc_info.Value.t_method -> string
    method texi_of_module : Odoc_info.Module.t_module -> string
    method texi_of_module_element : Odoc_info.Name.t -> + Odoc_info.Module.module_element -> + string
    method texi_of_module_type : Odoc_info.Module.t_module_type -> string
    method texi_of_text : Odoc_info.text -> string
    method texi_of_text_element : Odoc_info.text_element -> Odoc_info.Name.t
    method texi_of_type : Odoc_info.Type.t_type -> string
    method texi_of_type_extension : Odoc_info.Name.t -> + Odoc_info.Extension.t_type_extension -> + string
    method texi_of_value : Odoc_info.Value.t_value -> string
    method text_el_of_type_expr : Odoc_info.Name.t -> + Types.type_expr -> + Odoc_info.text_element
    method text_of_alerts : Odoc_info.alert list -> Odoc_info.text_element list
    method text_of_attribute : Odoc_info.Value.t_attribute -> + Odoc_info.text_element list
    method text_of_author_list : string list -> Odoc_info.text_element list
    method text_of_before : (string * Odoc_info.text) list -> + Odoc_info.text_element list
    method text_of_class_kind : Odoc_info.Name.t -> + Odoc_info.Class.class_kind -> + Odoc_info.text_element list
    method text_of_class_params : Odoc_info.Name.t -> + Odoc_info.Class.t_class -> + Odoc_types.text
    method text_of_class_type_kind : Odoc_info.Name.t -> + Odoc_info.Class.class_type_kind -> + Odoc_info.text_element list
    method text_of_class_type_param_expr_list : Odoc_info.Name.t -> + Types.type_expr list -> + Odoc_info.text_element list
    method text_of_custom : (string * Odoc_info.text) list -> Odoc_info.text
    method text_of_desc : Odoc_info.text option -> Odoc_info.text_element list
    method text_of_exception : Odoc_info.Exception.t_exception -> + Odoc_info.text_element list
    method text_of_info : ?block:bool -> + Odoc_info.info option -> + Odoc_info.text_element list
    method text_of_method : Odoc_info.Value.t_method -> Odoc_info.text_element list
    method text_of_module_kind : ?with_def_syntax:bool -> + Odoc_info.Module.module_kind -> + Odoc_info.text_element list
    method text_of_module_parameter_list : (Odoc_info.Module.module_parameter + * Odoc_info.text_element list option) + list -> + Odoc_info.text_element list
    method text_of_module_type : Types.module_type -> Odoc_info.text_element list
    method text_of_module_type_kind : ?with_def_syntax:bool -> + Odoc_info.Module.module_type_kind -> + Odoc_info.text_element list
    method text_of_parameter_description : Odoc_info.Parameter.parameter -> + Odoc_info.text
    method text_of_parameter_list : Odoc_info.Name.t -> + Odoc_info.Parameter.parameter list -> + Odoc_info.text_element list
    method text_of_params : Odoc_info.param list -> Odoc_info.text_element list
    method text_of_raised_exceptions : Odoc_info.raised_exception list -> + Odoc_info.text_element list
    method text_of_return_opt : Odoc_info.text option -> + Odoc_info.text_element list
    method text_of_see : Odoc_info.see -> Odoc_info.text
    method text_of_sees : Odoc_info.see list -> Odoc_info.text_element list
    method text_of_sees_opt : Odoc_info.see list -> Odoc_info.text_element list
    method text_of_short_type_expr : Odoc_info.Name.t -> + Types.type_expr -> + Odoc_info.text_element list
    method text_of_since_opt : string option -> Odoc_info.text_element list
    method text_of_type_expr : Odoc_info.Name.t -> + Types.type_expr -> + Odoc_info.text_element list
    method text_of_type_expr_list : Odoc_info.Name.t -> + string -> + Types.type_expr list -> + Odoc_info.text_element list
    method text_of_value : Odoc_info.Value.t_value -> Odoc_info.text_element list
    method text_of_version_opt : string option -> Odoc_info.text_element list
    diff --git a/ocaml/Odoc_texi/Generator/index.html b/ocaml/Odoc_texi/Generator/index.html new file mode 100644 index 0000000..317ee2d --- /dev/null +++ b/ocaml/Odoc_texi/Generator/index.html @@ -0,0 +1,2 @@ + +Generator (ocaml.Odoc_texi.Generator)

    Module Odoc_texi.Generator

    class texi : object ... end
    diff --git a/ocaml/Odoc_texi/index.html b/ocaml/Odoc_texi/index.html new file mode 100644 index 0000000..a50205f --- /dev/null +++ b/ocaml/Odoc_texi/index.html @@ -0,0 +1,2 @@ + +Odoc_texi (ocaml.Odoc_texi)

    Module Odoc_texi

    Generation of Texinfo documentation.

    val esc_8bits : bool ref
    val info_section : string ref
    val info_entry : string list ref
    val titles_and_headings : (int * (string * string)) list ref
    type subparts = [
    1. | `Class of Odoc_info.Class.t_class
    2. | `Class_type of Odoc_info.Class.t_class_type
    3. | `Module of Odoc_info.Module.t_module
    4. | `Module_type of Odoc_info.Module.t_module_type
    ]
    type indices = [
    1. | `Class
    2. | `Class_att
    3. | `Class_type
    4. | `Exception
    5. | `Extension
    6. | `Method
    7. | `Module
    8. | `Module_type
    9. | `Type
    10. | `Value
    ]
    module Generator : sig ... end
    module type Texi_generator = sig ... end
    diff --git a/ocaml/Odoc_texi/module-type-Texi_generator/class-texi/index.html b/ocaml/Odoc_texi/module-type-Texi_generator/class-texi/index.html new file mode 100644 index 0000000..64f0346 --- /dev/null +++ b/ocaml/Odoc_texi/module-type-Texi_generator/class-texi/index.html @@ -0,0 +1,97 @@ + +texi (ocaml.Odoc_texi.Texi_generator.texi)

    Class Texi_generator.texi

    val mutable indices_to_build : [ `Class + | `Class_att + | `Class_type + | `Exception + | `Extension + | `Method + | `Module + | `Module_type + | `Type + | `Value ] + list
    val linebreak : Odoc_info.text_element
    val maxdepth : int
    val node_tbl : (Odoc_info.Name.t, unit) Hashtbl.t
    val mutable tag_functions : (string * (Odoc_info.text -> Odoc_info.text)) list
    method do_index : [ `Class + | `Class_att + | `Class_type + | `Exception + | `Extension + | `Method + | `Module + | `Module_type + | `Type + | `Value ] -> + unit
    method private fix_linebreaks : Odoc_info.text -> Odoc_info.text
    method generate : Odoc_info.Module.t_module list -> unit
    method generate_class_inheritance_info : out_channel -> + Odoc_info.Class.t_class -> + unit
    method generate_class_type_inheritance_info : out_channel -> + Odoc_info.Class.t_class_type -> + unit
    method generate_for_class : out_channel -> Odoc_info.Class.t_class -> unit
    method generate_for_class_type : out_channel -> + Odoc_info.Class.t_class_type -> + unit
    method generate_for_module : out_channel -> Odoc_info.Module.t_module -> unit
    method generate_for_module_type : out_channel -> + Odoc_info.Module.t_module_type -> + unit
    method generate_inheritance_info : out_channel -> + Odoc_info.Class.inherited_class list -> + unit
    method generate_texi_header : out_channel -> + string -> + Odoc_info.Module.t_module list -> + unit
    method generate_texi_trailer : out_channel -> unit
    method heading : int -> Odoc_info.text -> string
    method label : ?no_:bool -> string -> string
    method normal_class_params : Odoc_info.Name.t -> + Odoc_info.Class.t_class -> + string
    method normal_class_type : Odoc_info.Name.t -> Types.class_type -> string
    method normal_class_type_param_list : Odoc_info.Name.t -> + Types.type_expr list -> + string
    method normal_cstr_args : ?par:bool -> + Odoc_info.Name.t -> + Odoc_info.Type.constructor_args -> + string
    method normal_module_type : ?code:string -> + Odoc_info.Name.t -> + Types.module_type -> + string
    method normal_type : Odoc_info.Name.t -> Types.type_expr -> string
    method normal_type_list : ?par:bool -> + Odoc_info.Name.t -> + string -> + Types.type_expr list -> + string
    method relative_idents : Odoc_info.Name.t -> string -> string
    method relative_module_idents : Odoc_info.Name.t -> string -> string
    method scan_for_index : subparts -> unit
    method scan_for_index_in_class : Odoc_info.Class.class_element -> unit
    method scan_for_index_in_mod : Odoc_info.Module.module_element -> unit
    method private soft_fix_linebreaks : int -> + Odoc_info.text_element list -> + Odoc_info.text_element list
    method string_of_type_args : Odoc_info.Type.constructor_args -> + Types.type_expr option -> + string
    method string_of_type_parameters : Odoc_info.Type.t_type -> string
    method texi_of_Block : Odoc_info.text -> Odoc_info.Name.t
    method texi_of_Bold : Odoc_info.text -> Odoc_info.Name.t
    method texi_of_Center : Odoc_info.text -> Odoc_info.Name.t
    method texi_of_Code : Odoc_info.Name.t -> Odoc_info.Name.t
    method texi_of_CodePre : Odoc_info.Name.t -> Odoc_info.Name.t
    method texi_of_Emphasize : Odoc_info.text -> Odoc_info.Name.t
    method texi_of_Enum : Odoc_info.text list -> Odoc_info.Name.t
    method texi_of_Italic : Odoc_info.text -> Odoc_info.Name.t
    method texi_of_Left : Odoc_info.text -> Odoc_info.Name.t
    method texi_of_List : Odoc_info.text list -> Odoc_info.Name.t
    method texi_of_Newline : Odoc_info.Name.t
    method texi_of_Raw : Odoc_info.Name.t -> Odoc_info.Name.t
    method texi_of_Ref : Odoc_info.Name.t -> + Odoc_info.ref_kind option -> + Odoc_info.Name.t
    method texi_of_Right : Odoc_info.text -> Odoc_info.Name.t
    method texi_of_Subscript : Odoc_info.text -> Odoc_info.Name.t
    method texi_of_Superscript : Odoc_info.text -> Odoc_info.Name.t
    method texi_of_Target : target:string -> + code:Odoc_info.Name.t -> + Odoc_info.Name.t
    method texi_of_Title : int -> Odoc_info.text -> Odoc_info.Name.t
    method texi_of_Verbatim : Odoc_info.Name.t -> Odoc_info.Name.t
    method texi_of_attribute : Odoc_info.Value.t_attribute -> string
    method texi_of_class : Odoc_info.Class.t_class -> string
    method texi_of_class_element : Odoc_info.Name.t -> + Odoc_info.Class.class_element -> + string
    method texi_of_class_type : Odoc_info.Class.t_class_type -> string
    method texi_of_custom_text : string -> Odoc_info.text -> Odoc_info.Name.t
    method texi_of_exception : Odoc_info.Exception.t_exception -> string
    method texi_of_included_module : Odoc_info.Module.included_module -> string
    method texi_of_info : Odoc_info.info option -> string
    method texi_of_method : Odoc_info.Value.t_method -> string
    method texi_of_module : Odoc_info.Module.t_module -> string
    method texi_of_module_element : Odoc_info.Name.t -> + Odoc_info.Module.module_element -> + string
    method texi_of_module_type : Odoc_info.Module.t_module_type -> string
    method texi_of_text : Odoc_info.text -> string
    method texi_of_text_element : Odoc_info.text_element -> Odoc_info.Name.t
    method texi_of_type : Odoc_info.Type.t_type -> string
    method texi_of_type_extension : Odoc_info.Name.t -> + Odoc_info.Extension.t_type_extension -> + string
    method texi_of_value : Odoc_info.Value.t_value -> string
    method text_el_of_type_expr : Odoc_info.Name.t -> + Types.type_expr -> + Odoc_info.text_element
    method text_of_alerts : Odoc_info.alert list -> Odoc_info.text_element list
    method text_of_attribute : Odoc_info.Value.t_attribute -> + Odoc_info.text_element list
    method text_of_author_list : string list -> Odoc_info.text_element list
    method text_of_before : (string * Odoc_info.text) list -> + Odoc_info.text_element list
    method text_of_class_kind : Odoc_info.Name.t -> + Odoc_info.Class.class_kind -> + Odoc_info.text_element list
    method text_of_class_params : Odoc_info.Name.t -> + Odoc_info.Class.t_class -> + Odoc_types.text
    method text_of_class_type_kind : Odoc_info.Name.t -> + Odoc_info.Class.class_type_kind -> + Odoc_info.text_element list
    method text_of_class_type_param_expr_list : Odoc_info.Name.t -> + Types.type_expr list -> + Odoc_info.text_element list
    method text_of_custom : (string * Odoc_info.text) list -> Odoc_info.text
    method text_of_desc : Odoc_info.text option -> Odoc_info.text_element list
    method text_of_exception : Odoc_info.Exception.t_exception -> + Odoc_info.text_element list
    method text_of_info : ?block:bool -> + Odoc_info.info option -> + Odoc_info.text_element list
    method text_of_method : Odoc_info.Value.t_method -> Odoc_info.text_element list
    method text_of_module_kind : ?with_def_syntax:bool -> + Odoc_info.Module.module_kind -> + Odoc_info.text_element list
    method text_of_module_parameter_list : (Odoc_info.Module.module_parameter + * Odoc_info.text_element list option) + list -> + Odoc_info.text_element list
    method text_of_module_type : Types.module_type -> Odoc_info.text_element list
    method text_of_module_type_kind : ?with_def_syntax:bool -> + Odoc_info.Module.module_type_kind -> + Odoc_info.text_element list
    method text_of_parameter_description : Odoc_info.Parameter.parameter -> + Odoc_info.text
    method text_of_parameter_list : Odoc_info.Name.t -> + Odoc_info.Parameter.parameter list -> + Odoc_info.text_element list
    method text_of_params : Odoc_info.param list -> Odoc_info.text_element list
    method text_of_raised_exceptions : Odoc_info.raised_exception list -> + Odoc_info.text_element list
    method text_of_return_opt : Odoc_info.text option -> + Odoc_info.text_element list
    method text_of_see : Odoc_info.see -> Odoc_info.text
    method text_of_sees : Odoc_info.see list -> Odoc_info.text_element list
    method text_of_sees_opt : Odoc_info.see list -> Odoc_info.text_element list
    method text_of_short_type_expr : Odoc_info.Name.t -> + Types.type_expr -> + Odoc_info.text_element list
    method text_of_since_opt : string option -> Odoc_info.text_element list
    method text_of_type_expr : Odoc_info.Name.t -> + Types.type_expr -> + Odoc_info.text_element list
    method text_of_type_expr_list : Odoc_info.Name.t -> + string -> + Types.type_expr list -> + Odoc_info.text_element list
    method text_of_value : Odoc_info.Value.t_value -> Odoc_info.text_element list
    method text_of_version_opt : string option -> Odoc_info.text_element list
    diff --git a/ocaml/Odoc_texi/module-type-Texi_generator/index.html b/ocaml/Odoc_texi/module-type-Texi_generator/index.html new file mode 100644 index 0000000..08a5721 --- /dev/null +++ b/ocaml/Odoc_texi/module-type-Texi_generator/index.html @@ -0,0 +1,2 @@ + +Texi_generator (ocaml.Odoc_texi.Texi_generator)

    Module type Odoc_texi.Texi_generator

    class texi : object ... end
    diff --git a/ocaml/Odoc_text/Texter/index.html b/ocaml/Odoc_text/Texter/index.html new file mode 100644 index 0000000..e854cfd --- /dev/null +++ b/ocaml/Odoc_text/Texter/index.html @@ -0,0 +1,2 @@ + +Texter (ocaml.Odoc_text.Texter)

    Module Odoc_text.Texter

    val text_of_string : string -> Odoc_types.text
    val string_of_text : Odoc_types.text -> string
    diff --git a/ocaml/Odoc_text/index.html b/ocaml/Odoc_text/index.html new file mode 100644 index 0000000..feb69b9 --- /dev/null +++ b/ocaml/Odoc_text/index.html @@ -0,0 +1,2 @@ + +Odoc_text (ocaml.Odoc_text)

    Module Odoc_text

    exception Text_syntax of int * int * string
    module Texter : sig ... end
    diff --git a/ocaml/Odoc_text_lexer/index.html b/ocaml/Odoc_text_lexer/index.html new file mode 100644 index 0000000..e3d68f2 --- /dev/null +++ b/ocaml/Odoc_text_lexer/index.html @@ -0,0 +1,2 @@ + +Odoc_text_lexer (ocaml.Odoc_text_lexer)

    Module Odoc_text_lexer

    The lexer for string to build text structures.

    val line_number : int ref
    val char_number : int ref
    val init : unit -> unit
    diff --git a/ocaml/Odoc_text_parser/index.html b/ocaml/Odoc_text_parser/index.html new file mode 100644 index 0000000..4f4879f --- /dev/null +++ b/ocaml/Odoc_text_parser/index.html @@ -0,0 +1,8 @@ + +Odoc_text_parser (ocaml.Odoc_text_parser)

    Module Odoc_text_parser

    type token =
    1. | END
    2. | Title of int * string option
    3. | BOLD
    4. | EMP
    5. | CENTER
    6. | LEFT
    7. | RIGHT
    8. | ITALIC
    9. | CUSTOM of string
    10. | LIST
    11. | ENUM
    12. | ITEM
    13. | CODE
    14. | END_CODE
    15. | CODE_PRE
    16. | END_CODE_PRE
    17. | VERB
    18. | END_VERB
    19. | LATEX
    20. | Target of string
    21. | END_TARGET
    22. | LBRACE
    23. | ELE_REF
    24. | VAL_REF
    25. | TYP_REF
    26. | EXT_REF
    27. | EXC_REF
    28. | MOD_REF
    29. | MODT_REF
    30. | CLA_REF
    31. | CLT_REF
    32. | ATT_REF
    33. | MET_REF
    34. | SEC_REF
    35. | RECF_REF
    36. | CONST_REF
    37. | MOD_LIST_REF
    38. | INDEX_LIST
    39. | SUPERSCRIPT
    40. | SUBSCRIPT
    41. | BEGIN_SHORTCUT_LIST_ITEM
    42. | BEGIN_SHORTCUT_ENUM_ITEM
    43. | SHORTCUT_LIST_ITEM
    44. | SHORTCUT_ENUM_ITEM
    45. | END_SHORTCUT_LIST
    46. | BLANK_LINE
    47. | EOF
    48. | Char of string
    val located_element_list : + (Stdlib.Lexing.lexbuf -> token) -> + Stdlib.Lexing.lexbuf -> + (int * int * Odoc_types.text_element) list
    diff --git a/ocaml/Odoc_to_text/class-to_text/index.html b/ocaml/Odoc_to_text/class-to_text/index.html new file mode 100644 index 0000000..e0051b0 --- /dev/null +++ b/ocaml/Odoc_to_text/class-to_text/index.html @@ -0,0 +1,48 @@ + +to_text (ocaml.Odoc_to_text.to_text)

    Class Odoc_to_text.to_text

    val mutable tag_functions : (string * (Odoc_info.text -> Odoc_info.text)) list
    method virtual label : ?no_:bool -> string -> string
    method normal_class_params : Odoc_info.Name.t -> + Odoc_info.Class.t_class -> + string
    method normal_class_type : Odoc_info.Name.t -> Types.class_type -> string
    method normal_class_type_param_list : Odoc_info.Name.t -> + Types.type_expr list -> + string
    method normal_cstr_args : ?par:bool -> + Odoc_info.Name.t -> + Odoc_info.Type.constructor_args -> + string
    method normal_module_type : ?code:string -> + Odoc_info.Name.t -> + Types.module_type -> + string
    method normal_type : Odoc_info.Name.t -> Types.type_expr -> string
    method normal_type_list : ?par:bool -> + Odoc_info.Name.t -> + string -> + Types.type_expr list -> + string
    method relative_idents : Odoc_info.Name.t -> string -> string
    method relative_module_idents : Odoc_info.Name.t -> string -> string
    method text_of_alerts : Odoc_info.alert list -> Odoc_info.text_element list
    method text_of_attribute : Odoc_info.Value.t_attribute -> + Odoc_info.text_element list
    method text_of_author_list : string list -> Odoc_info.text_element list
    method text_of_before : (string * Odoc_info.text) list -> + Odoc_info.text_element list
    method text_of_class_kind : Odoc_info.Name.t -> + Odoc_info.Class.class_kind -> + Odoc_info.text_element list
    method text_of_class_params : Odoc_info.Name.t -> + Odoc_info.Class.t_class -> + Odoc_types.text
    method text_of_class_type_kind : Odoc_info.Name.t -> + Odoc_info.Class.class_type_kind -> + Odoc_info.text_element list
    method text_of_class_type_param_expr_list : Odoc_info.Name.t -> + Types.type_expr list -> + Odoc_info.text_element list
    method text_of_custom : (string * Odoc_info.text) list -> Odoc_info.text
    method text_of_exception : Odoc_info.Exception.t_exception -> + Odoc_info.text_element list
    method text_of_info : ?block:bool -> + Odoc_info.info option -> + Odoc_info.text_element list
    method text_of_method : Odoc_info.Value.t_method -> Odoc_info.text_element list
    method text_of_module_kind : ?with_def_syntax:bool -> + Odoc_info.Module.module_kind -> + Odoc_info.text_element list
    method text_of_module_parameter_list : (Odoc_info.Module.module_parameter + * Odoc_info.text_element list option) + list -> + Odoc_info.text_element list
    method text_of_module_type : Types.module_type -> Odoc_info.text_element list
    method text_of_module_type_kind : ?with_def_syntax:bool -> + Odoc_info.Module.module_type_kind -> + Odoc_info.text_element list
    method text_of_parameter_description : Odoc_info.Parameter.parameter -> + Odoc_info.text
    method text_of_parameter_list : Odoc_info.Name.t -> + Odoc_info.Parameter.parameter list -> + Odoc_info.text_element list
    method text_of_raised_exceptions : Odoc_info.raised_exception list -> + Odoc_info.text_element list
    method text_of_return_opt : Odoc_info.text option -> + Odoc_info.text_element list
    method text_of_see : Odoc_info.see -> Odoc_info.text
    method text_of_sees : Odoc_info.see list -> Odoc_info.text_element list
    method text_of_short_type_expr : Odoc_info.Name.t -> + Types.type_expr -> + Odoc_info.text_element list
    method text_of_since_opt : string option -> Odoc_info.text_element list
    method text_of_type_expr : Odoc_info.Name.t -> + Types.type_expr -> + Odoc_info.text_element list
    method text_of_type_expr_list : Odoc_info.Name.t -> + string -> + Types.type_expr list -> + Odoc_info.text_element list
    method text_of_value : Odoc_info.Value.t_value -> Odoc_info.text_element list
    method text_of_version_opt : string option -> Odoc_info.text_element list
    diff --git a/ocaml/Odoc_to_text/index.html b/ocaml/Odoc_to_text/index.html new file mode 100644 index 0000000..36334a9 --- /dev/null +++ b/ocaml/Odoc_to_text/index.html @@ -0,0 +1,2 @@ + +Odoc_to_text (ocaml.Odoc_to_text)

    Module Odoc_to_text

    Text generation.

    class virtual to_text : object ... end
    diff --git a/ocaml/Odoc_type/index.html b/ocaml/Odoc_type/index.html new file mode 100644 index 0000000..61a68fd --- /dev/null +++ b/ocaml/Odoc_type/index.html @@ -0,0 +1,2 @@ + +Odoc_type (ocaml.Odoc_type)

    Module Odoc_type

    Representation and manipulation of a type, but not class nor module type.

    This module has an implementation although it declares only types. This is because other modules use the let module construct or access it so it is needed as a real module.

    module Name = Odoc_name
    type private_flag = Asttypes.private_flag =
    1. | Private
    2. | Public
    type record_field = {
    1. rf_name : string;
    2. rf_mutable : bool;
    3. rf_type : Types.type_expr;
    4. mutable rf_text : Odoc_types.info option;
    }

    Description of a record type field.

    type constructor_args =
    1. | Cstr_record of record_field list
    2. | Cstr_tuple of Types.type_expr list
    type variant_constructor = {
    1. vc_name : string;
    2. vc_args : constructor_args;
    3. vc_ret : Types.type_expr option;
    4. mutable vc_text : Odoc_types.info option;
    }

    Description of a variant type constructor.

    type type_kind =
    1. | Type_abstract
    2. | Type_variant of variant_constructor list
    3. | Type_record of record_field list
    4. | Type_open
      (*

      The various kinds of type.

      *)
    type object_field = {
    1. of_name : string;
    2. of_type : Types.type_expr;
    3. mutable of_text : Odoc_types.info option;
    }
    type type_manifest =
    1. | Other of Types.type_expr
    2. | Object_type of object_field list
    type t_type = {
    1. ty_name : Name.t;
    2. mutable ty_info : Odoc_types.info option;
    3. ty_parameters : (Types.type_expr * Types.Variance.t) list;
    4. ty_kind : type_kind;
    5. ty_private : private_flag;
    6. ty_manifest : type_manifest option;
    7. mutable ty_loc : Odoc_types.location;
    8. mutable ty_code : string option;
    }

    Representation of a type.

    diff --git a/ocaml/Odoc_types/index.html b/ocaml/Odoc_types/index.html new file mode 100644 index 0000000..70755c2 --- /dev/null +++ b/ocaml/Odoc_types/index.html @@ -0,0 +1,2 @@ + +Odoc_types (ocaml.Odoc_types)

    Module Odoc_types

    type ref_kind =
    1. | RK_module
    2. | RK_module_type
    3. | RK_class
    4. | RK_class_type
    5. | RK_value
    6. | RK_type
    7. | RK_extension
    8. | RK_exception
    9. | RK_attribute
    10. | RK_method
    11. | RK_section of text
    12. | RK_recfield
    13. | RK_const
    and text_element =
    1. | Raw of string
    2. | Code of string
    3. | CodePre of string
    4. | Verbatim of string
    5. | Bold of text
    6. | Italic of text
    7. | Emphasize of text
    8. | Center of text
    9. | Left of text
    10. | Right of text
    11. | List of text list
    12. | Enum of text list
    13. | Newline
    14. | Block of text
    15. | Title of int * string option * text
    16. | Latex of string
    17. | Link of string * text
    18. | Ref of string * ref_kind option * text option
    19. | Superscript of text
    20. | Subscript of text
    21. | Module_list of string list
    22. | Index_list
    23. | Custom of string * text
    24. | Target of string * string
    and text = text_element list
    type see_ref =
    1. | See_url of string
    2. | See_file of string
    3. | See_doc of string
    type see = see_ref * text
    type param = string * text
    type raised_exception = string * text
    type alert = {
    1. alert_name : string;
    2. alert_payload : string option;
    }
    type info = {
    1. i_desc : text option;
    2. i_authors : string list;
    3. i_version : string option;
    4. i_sees : see list;
    5. i_since : string option;
    6. i_before : (string * text) list;
    7. i_deprecated : text option;
    8. i_params : param list;
    9. i_raised_exceptions : raised_exception list;
    10. i_return_value : text option;
    11. i_custom : (string * text) list;
    12. i_alerts : alert list;
    }
    val dummy_info : info
    type location = {
    1. loc_impl : Location.t option;
    2. loc_inter : Location.t option;
    }
    val dummy_loc : location
    type merge_option =
    1. | Merge_description
    2. | Merge_author
    3. | Merge_version
    4. | Merge_see
    5. | Merge_since
    6. | Merge_before
    7. | Merge_deprecated
    8. | Merge_param
    9. | Merge_raised_exception
    10. | Merge_return_value
    11. | Merge_custom
    val all_merge_options : merge_option list
    type magic
    val magic : magic
    type 'a dump
    val make_dump : 'a -> 'a dump
    val open_dump : 'a dump -> 'a
    diff --git a/ocaml/Odoc_value/index.html b/ocaml/Odoc_value/index.html new file mode 100644 index 0000000..7a54bc3 --- /dev/null +++ b/ocaml/Odoc_value/index.html @@ -0,0 +1,2 @@ + +Odoc_value (ocaml.Odoc_value)

    Module Odoc_value

    Representation and manipulation of values, class attributes and class methods.

    module Name = Odoc_name

    Types

    type t_value = {
    1. val_name : Name.t;
    2. mutable val_info : Odoc_types.info option;
    3. val_type : Types.type_expr;
    4. val_recursive : bool;
    5. mutable val_parameters : Odoc_parameter.parameter list;
    6. mutable val_code : string option;
    7. mutable val_loc : Odoc_types.location;
    }

    Representation of a value.

    type t_attribute = {
    1. att_value : t_value;
    2. att_mutable : bool;
    3. att_virtual : bool;
    }

    Representation of a class attribute.

    type t_method = {
    1. met_value : t_value;
    2. met_private : bool;
    3. met_virtual : bool;
    }

    Representation of a class method.

    Functions

    val value_parameter_text_by_name : t_value -> string -> Odoc_types.text option

    Returns the text associated to the given parameter name in the given value, or None.

    val update_value_parameters_text : t_value -> unit

    Update the parameters text of a t_value, according to the val_info field.

    val dummy_parameter_list : Types.type_expr -> Odoc_parameter.param_info list

    Create a list of parameters with dummy names "??" from a type list. Used when we want to merge the parameters of a value, from the .ml and the .mli file. In the .mli file we don't have parameter names so there is nothing to merge. With this dummy list we can merge the parameter names from the .ml and the type from the .mli file.

    val is_function : t_value -> bool

    Return true if the value is a function, i.e. has a functional type.

    diff --git a/ocaml/Opcodes/index.html b/ocaml/Opcodes/index.html new file mode 100644 index 0000000..9d2637a --- /dev/null +++ b/ocaml/Opcodes/index.html @@ -0,0 +1,2 @@ + +Opcodes (ocaml.Opcodes)

    Module Opcodes

    val opACC0 : int
    val opACC1 : int
    val opACC2 : int
    val opACC3 : int
    val opACC4 : int
    val opACC5 : int
    val opACC6 : int
    val opACC7 : int
    val opACC : int
    val opPUSH : int
    val opPUSHACC0 : int
    val opPUSHACC1 : int
    val opPUSHACC2 : int
    val opPUSHACC3 : int
    val opPUSHACC4 : int
    val opPUSHACC5 : int
    val opPUSHACC6 : int
    val opPUSHACC7 : int
    val opPUSHACC : int
    val opPOP : int
    val opASSIGN : int
    val opENVACC1 : int
    val opENVACC2 : int
    val opENVACC3 : int
    val opENVACC4 : int
    val opENVACC : int
    val opPUSHENVACC1 : int
    val opPUSHENVACC2 : int
    val opPUSHENVACC3 : int
    val opPUSHENVACC4 : int
    val opPUSHENVACC : int
    val opPUSH_RETADDR : int
    val opAPPLY : int
    val opAPPLY1 : int
    val opAPPLY2 : int
    val opAPPLY3 : int
    val opAPPTERM : int
    val opAPPTERM1 : int
    val opAPPTERM2 : int
    val opAPPTERM3 : int
    val opRETURN : int
    val opRESTART : int
    val opGRAB : int
    val opCLOSURE : int
    val opCLOSUREREC : int
    val opOFFSETCLOSUREM3 : int
    val opOFFSETCLOSURE0 : int
    val opOFFSETCLOSURE3 : int
    val opOFFSETCLOSURE : int
    val opPUSHOFFSETCLOSUREM3 : int
    val opPUSHOFFSETCLOSURE0 : int
    val opPUSHOFFSETCLOSURE3 : int
    val opPUSHOFFSETCLOSURE : int
    val opGETGLOBAL : int
    val opPUSHGETGLOBAL : int
    val opGETGLOBALFIELD : int
    val opPUSHGETGLOBALFIELD : int
    val opSETGLOBAL : int
    val opATOM0 : int
    val opATOM : int
    val opPUSHATOM0 : int
    val opPUSHATOM : int
    val opMAKEBLOCK : int
    val opMAKEBLOCK1 : int
    val opMAKEBLOCK2 : int
    val opMAKEBLOCK3 : int
    val opMAKEFLOATBLOCK : int
    val opGETFIELD0 : int
    val opGETFIELD1 : int
    val opGETFIELD2 : int
    val opGETFIELD3 : int
    val opGETFIELD : int
    val opGETFLOATFIELD : int
    val opSETFIELD0 : int
    val opSETFIELD1 : int
    val opSETFIELD2 : int
    val opSETFIELD3 : int
    val opSETFIELD : int
    val opSETFLOATFIELD : int
    val opVECTLENGTH : int
    val opGETVECTITEM : int
    val opSETVECTITEM : int
    val opGETBYTESCHAR : int
    val opSETBYTESCHAR : int
    val opBRANCH : int
    val opBRANCHIF : int
    val opBRANCHIFNOT : int
    val opSWITCH : int
    val opBOOLNOT : int
    val opPUSHTRAP : int
    val opPOPTRAP : int
    val opRAISE : int
    val opCHECK_SIGNALS : int
    val opC_CALL1 : int
    val opC_CALL2 : int
    val opC_CALL3 : int
    val opC_CALL4 : int
    val opC_CALL5 : int
    val opC_CALLN : int
    val opCONST0 : int
    val opCONST1 : int
    val opCONST2 : int
    val opCONST3 : int
    val opCONSTINT : int
    val opPUSHCONST0 : int
    val opPUSHCONST1 : int
    val opPUSHCONST2 : int
    val opPUSHCONST3 : int
    val opPUSHCONSTINT : int
    val opNEGINT : int
    val opADDINT : int
    val opSUBINT : int
    val opMULINT : int
    val opDIVINT : int
    val opMODINT : int
    val opANDINT : int
    val opORINT : int
    val opXORINT : int
    val opLSLINT : int
    val opLSRINT : int
    val opASRINT : int
    val opEQ : int
    val opNEQ : int
    val opLTINT : int
    val opLEINT : int
    val opGTINT : int
    val opGEINT : int
    val opOFFSETINT : int
    val opOFFSETREF : int
    val opISINT : int
    val opGETMETHOD : int
    val opBEQ : int
    val opBNEQ : int
    val opBLTINT : int
    val opBLEINT : int
    val opBGTINT : int
    val opBGEINT : int
    val opULTINT : int
    val opUGEINT : int
    val opBULTINT : int
    val opBUGEINT : int
    val opGETPUBMET : int
    val opGETDYNMET : int
    val opSTOP : int
    val opEVENT : int
    val opBREAK : int
    val opRERAISE : int
    val opRAISE_NOTRACE : int
    val opGETSTRINGCHAR : int
    val opPERFORM : int
    val opRESUME : int
    val opRESUMETERM : int
    val opREPERFORMTERM : int
    diff --git a/ocaml/Oprint/index.html b/ocaml/Oprint/index.html new file mode 100644 index 0000000..38a69af --- /dev/null +++ b/ocaml/Oprint/index.html @@ -0,0 +1,18 @@ + +Oprint (ocaml.Oprint)

    Module Oprint

    val out_label : + (Stdlib.Format.formatter -> + (string * bool * Outcometree.out_type) -> + unit) + ref
    val out_type_args : + (Stdlib.Format.formatter -> Outcometree.out_type list -> unit) ref
    val out_class_type : + (Stdlib.Format.formatter -> Outcometree.out_class_type -> unit) ref
    val out_module_type : + (Stdlib.Format.formatter -> Outcometree.out_module_type -> unit) ref
    val out_sig_item : + (Stdlib.Format.formatter -> Outcometree.out_sig_item -> unit) ref
    val out_signature : + (Stdlib.Format.formatter -> Outcometree.out_sig_item list -> unit) ref
    val out_functor_parameters : + (Stdlib.Format.formatter -> + (string option * Outcometree.out_module_type) option list -> + unit) + ref
    val out_type_extension : + (Stdlib.Format.formatter -> Outcometree.out_type_extension -> unit) ref
    val out_phrase : + (Stdlib.Format.formatter -> Outcometree.out_phrase -> unit) ref
    val parenthesized_ident : string -> bool
    diff --git a/ocaml/Optcompile/index.html b/ocaml/Optcompile/index.html new file mode 100644 index 0000000..6624fec --- /dev/null +++ b/ocaml/Optcompile/index.html @@ -0,0 +1,15 @@ + +Optcompile (ocaml.Optcompile)

    Module Optcompile

    Native compilation for .ml and .mli files.

    val interface : source_file:string -> output_prefix:string -> unit
    val implementation : + backend:(module Backend_intf.S) -> + start_from:Clflags.Compiler_pass.t -> + source_file:string -> + output_prefix:string -> + unit

    Internal functions

    *

    val clambda : + Compile_common.info -> + (module Backend_intf.S) -> + Typedtree.implementation -> + unit

    clambda info typed applies the regular compilation pipeline to the given typechecked implementation and outputs the resulting files.

    val flambda : + Compile_common.info -> + (module Backend_intf.S) -> + Typedtree.implementation -> + unit

    flambda info backend typed applies the Flambda compilation pipeline to the given typechecked implementation and outputs the resulting files.

    diff --git a/ocaml/Opterrors/index.html b/ocaml/Opterrors/index.html new file mode 100644 index 0000000..b85330c --- /dev/null +++ b/ocaml/Opterrors/index.html @@ -0,0 +1,2 @@ + +Opterrors (ocaml.Opterrors)

    Module Opterrors

    val report_error : Stdlib.Format.formatter -> exn -> unit
    diff --git a/ocaml/Optmain/index.html b/ocaml/Optmain/index.html new file mode 100644 index 0000000..f4dc7dc --- /dev/null +++ b/ocaml/Optmain/index.html @@ -0,0 +1,2 @@ + +Optmain (ocaml.Optmain)

    Module Optmain

    diff --git a/ocaml/Optmaindriver/index.html b/ocaml/Optmaindriver/index.html new file mode 100644 index 0000000..75803b0 --- /dev/null +++ b/ocaml/Optmaindriver/index.html @@ -0,0 +1,2 @@ + +Optmaindriver (ocaml.Optmaindriver)

    Module Optmaindriver

    val main : string array -> Stdlib.Format.formatter -> int
    diff --git a/ocaml/Outcometree/index.html b/ocaml/Outcometree/index.html new file mode 100644 index 0000000..893680d --- /dev/null +++ b/ocaml/Outcometree/index.html @@ -0,0 +1,10 @@ + +Outcometree (ocaml.Outcometree)

    Module Outcometree

    type out_name = {
    1. mutable printed_name : string;
    }

    An out_name is a string representation of an identifier which can be rewritten on the fly to avoid name collisions

    type out_ident =
    1. | Oide_apply of out_ident * out_ident
    2. | Oide_dot of out_ident * string
    3. | Oide_ident of out_name
    type out_string =
    1. | Ostr_string
    2. | Ostr_bytes
    type out_attribute = {
    1. oattr_name : string;
    }
    type out_value =
    1. | Oval_array of out_value list
    2. | Oval_char of char
    3. | Oval_constr of out_ident * out_value list
    4. | Oval_ellipsis
    5. | Oval_float of float
    6. | Oval_int of int
    7. | Oval_int32 of int32
    8. | Oval_int64 of int64
    9. | Oval_nativeint of nativeint
    10. | Oval_list of out_value list
    11. | Oval_printer of Stdlib.Format.formatter -> unit
    12. | Oval_record of (out_ident * out_value) list
    13. | Oval_string of string * int * out_string
    14. | Oval_stuff of string
    15. | Oval_tuple of out_value list
    16. | Oval_variant of string * out_value option
    17. | Oval_lazy of out_value
    type out_type_param = {
    1. ot_non_gen : bool;
    2. ot_name : string;
    3. ot_variance : Asttypes.variance * Asttypes.injectivity;
    }
    type out_type =
    1. | Otyp_abstract
    2. | Otyp_open
    3. | Otyp_alias of {
      1. non_gen : bool;
      2. aliased : out_type;
      3. alias : string;
      }
    4. | Otyp_arrow of Asttypes.arg_label * out_type * out_type
    5. | Otyp_class of out_ident * out_type list
    6. | Otyp_constr of out_ident * out_type list
    7. | Otyp_manifest of out_type * out_type
    8. | Otyp_object of {
      1. fields : (string * out_type) list;
      2. open_row : bool;
      }
    9. | Otyp_record of (string * bool * out_type) list
    10. | Otyp_stuff of string
    11. | Otyp_sum of out_constructor list
    12. | Otyp_tuple of out_type list
    13. | Otyp_var of bool * string
    14. | Otyp_variant of out_variant * bool * string list option
    15. | Otyp_poly of string list * out_type
    16. | Otyp_module of out_ident * (string * out_type) list
    17. | Otyp_attribute of out_type * out_attribute
    and out_constructor = {
    1. ocstr_name : string;
    2. ocstr_args : out_type list;
    3. ocstr_return_type : out_type option;
    }
    and out_variant =
    1. | Ovar_fields of (string * bool * out_type list) list
    2. | Ovar_typ of out_type
    type out_class_type =
    1. | Octy_constr of out_ident * out_type list
    2. | Octy_arrow of Asttypes.arg_label * out_type * out_class_type
    3. | Octy_signature of out_type option * out_class_sig_item list
    and out_class_sig_item =
    1. | Ocsg_constraint of out_type * out_type
    2. | Ocsg_method of string * bool * bool * out_type
    3. | Ocsg_value of string * bool * bool * out_type
    type out_module_type =
    1. | Omty_abstract
    2. | Omty_functor of (string option * out_module_type) option * out_module_type
    3. | Omty_ident of out_ident
    4. | Omty_signature of out_sig_item list
    5. | Omty_alias of out_ident
    and out_sig_item =
    1. | Osig_class of bool + * string + * out_type_param list + * out_class_type + * out_rec_status
    2. | Osig_class_type of bool + * string + * out_type_param list + * out_class_type + * out_rec_status
    3. | Osig_typext of out_extension_constructor * out_ext_status
    4. | Osig_modtype of string * out_module_type
    5. | Osig_module of string * out_module_type * out_rec_status
    6. | Osig_type of out_type_decl * out_rec_status
    7. | Osig_value of out_val_decl
    8. | Osig_ellipsis
    and out_type_decl = {
    1. otype_name : string;
    2. otype_params : out_type_param list;
    3. otype_type : out_type;
    4. otype_private : Asttypes.private_flag;
    5. otype_immediate : Type_immediacy.t;
    6. otype_unboxed : bool;
    7. otype_cstrs : (out_type * out_type) list;
    }
    and out_extension_constructor = {
    1. oext_name : string;
    2. oext_type_name : string;
    3. oext_type_params : string list;
    4. oext_args : out_type list;
    5. oext_ret_type : out_type option;
    6. oext_private : Asttypes.private_flag;
    }
    and out_type_extension = {
    1. otyext_name : string;
    2. otyext_params : string list;
    3. otyext_constructors : out_constructor list;
    4. otyext_private : Asttypes.private_flag;
    }
    and out_val_decl = {
    1. oval_name : string;
    2. oval_type : out_type;
    3. oval_prims : string list;
    4. oval_attributes : out_attribute list;
    }
    and out_rec_status =
    1. | Orec_not
    2. | Orec_first
    3. | Orec_next
    and out_ext_status =
    1. | Oext_first
    2. | Oext_next
    3. | Oext_exception
    type out_phrase =
    1. | Ophr_eval of out_value * out_type
    2. | Ophr_signature of (out_sig_item * out_value option) list
    3. | Ophr_exception of exn * out_value
    diff --git a/ocaml/Parameter/List/index.html b/ocaml/Parameter/List/index.html new file mode 100644 index 0000000..e6c859d --- /dev/null +++ b/ocaml/Parameter/List/index.html @@ -0,0 +1,2 @@ + +List (ocaml.Parameter.List)

    Module Parameter.List

    val vars : t list -> Variable.t list

    extract variables from a list of parameters, preserving the order

    diff --git a/ocaml/Parameter/Map/index.html b/ocaml/Parameter/Map/index.html new file mode 100644 index 0000000..c0ec6bc --- /dev/null +++ b/ocaml/Parameter/Map/index.html @@ -0,0 +1,17 @@ + +Map (ocaml.Parameter.Map)

    Module Parameter.Map

    include Map.S with type key = T.t and type 'a t = 'a Map.Make(T).t

    Maps

    type key = T.t

    The type of the map keys.

    type 'a t = 'a Stdlib.Map.Make(T).t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key -> 'a -> 'a t -> 'a t

    add key data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key -> 'a -> 'a list t -> 'a list t

    add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

    update key f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : (key -> bool) -> 'a t -> key * 'a

    find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : (key -> bool) -> 'a t -> key * 'a

    find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : (key -> 'a -> unit) -> 'a t -> unit

    iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

    fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : (key -> 'a -> bool) -> 'a t -> 'a t

    filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : (key -> 'a -> bool) -> 'a t -> bool

    for_all f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : (key -> 'a -> bool) -> 'a t -> bool

    exists f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Stdlib.Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Stdlib.Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    val of_list : (key * 'a) list -> 'a t
    val disjoint_union : + ?eq:('a -> 'a -> bool) -> + ?print:(Stdlib.Format.formatter -> 'a -> unit) -> + 'a t -> + 'a t -> + 'a t

    disjoint_union m1 m2 contains all bindings from m1 and m2. If some binding is present in both and the associated value is not equal, a Fatal_error is raised

    val union_right : 'a t -> 'a t -> 'a t

    union_right m1 m2 contains all bindings from m1 and m2. If some binding is present in both, the one from m2 is taken

    val union_left : 'a t -> 'a t -> 'a t

    union_left m1 m2 = union_right m2 m1

    val union_merge : ('a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
    val rename : key t -> key -> key
    val map_keys : (key -> key) -> 'a t -> 'a t
    val keys : 'a t -> Stdlib.Set.Make(T).t
    val data : 'a t -> 'a list
    val of_set : (key -> 'a) -> Stdlib.Set.Make(T).t -> 'a t
    val transpose_keys_and_data : key t -> key t
    val transpose_keys_and_data_set : key t -> Stdlib.Set.Make(T).t t
    val print : + (Stdlib.Format.formatter -> 'a -> unit) -> + Stdlib.Format.formatter -> + 'a t -> + unit
    diff --git a/ocaml/Parameter/Set/index.html b/ocaml/Parameter/Set/index.html new file mode 100644 index 0000000..6f0afc6 --- /dev/null +++ b/ocaml/Parameter/Set/index.html @@ -0,0 +1,2 @@ + +Set (ocaml.Parameter.Set)

    Module Parameter.Set

    include Identifiable.Set with module T := T
    include Set.S with type elt = T.t and type t = Set.Make(T).t

    Sets

    type elt = T.t

    The type of the set elements.

    The type of sets.

    val empty : t

    The empty set.

    val add : elt -> t -> t

    add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val singleton : elt -> t

    singleton x returns the one-element set containing only x.

    val remove : elt -> t -> t

    remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val union : t -> t -> t

    Set union.

    val inter : t -> t -> t

    Set intersection.

    val disjoint : t -> t -> bool

    Test if two sets are disjoint.

    • since 4.08
    val diff : t -> t -> t

    Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

    val cardinal : t -> int

    Return the number of elements of a set.

    Elements

    val elements : t -> elt list

    Return the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Set.Make.

    val min_elt : t -> elt

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

    val min_elt_opt : t -> elt option

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

    • since 4.05
    val max_elt : t -> elt

    Same as min_elt, but returns the largest element of the given set.

    val max_elt_opt : t -> elt option

    Same as min_elt_opt, but returns the largest element of the given set.

    • since 4.05
    val choose : t -> elt

    Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    val choose_opt : t -> elt option

    Return one element of the given set, or None if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    • since 4.05

    Searching

    val find : elt -> t -> elt

    find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

    • since 4.01
    val find_opt : elt -> t -> elt option

    find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

    • since 4.05
    val find_first : (elt -> bool) -> t -> elt

    find_first f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

    For example, find_first (fun e -> Ord.compare e x >= 0) s will return the first element e of s where Ord.compare e x >= 0 (intuitively: e >= x), or raise Not_found if x is greater than any element of s.

    • since 4.05
    val find_first_opt : (elt -> bool) -> t -> elt option

    find_first_opt f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

    • since 4.05
    val find_last : (elt -> bool) -> t -> elt

    find_last f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

    • since 4.05
    val find_last_opt : (elt -> bool) -> t -> elt option

    find_last_opt f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

    • since 4.05

    Traversing

    val iter : (elt -> unit) -> t -> unit

    iter f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.

    val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc

    fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

    Transforming

    val filter : (elt -> bool) -> t -> t

    filter f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val filter_map : (elt -> elt option) -> t -> t

    filter_map f s returns the set of all v such that f x = Some v for some element x of s.

    For example,

    filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) s

    is the set of halves of the even elements of s.

    If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned unchanged: the result of the function is then physically equal to s.

    • since 4.11
    val partition : (elt -> bool) -> t -> t * t

    partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

    val split : elt -> t -> t * bool * t

    split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.

    Predicates and comparisons

    val is_empty : t -> bool

    Test whether a set is empty or not.

    val mem : elt -> t -> bool

    mem x s tests whether x belongs to the set s.

    val equal : t -> t -> bool

    equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

    val compare : t -> t -> int

    Total ordering between sets. Can be used as the ordering function for doing sets of sets.

    val subset : t -> t -> bool

    subset s1 s2 tests whether the set s1 is a subset of the set s2.

    val for_all : (elt -> bool) -> t -> bool

    for_all f s checks if all elements of the set satisfy the predicate f.

    val exists : (elt -> bool) -> t -> bool

    exists f s checks if at least one element of the set satisfies the predicate f.

    Converting

    val to_list : t -> elt list

    to_list s is elements s.

    • since 5.1
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t

    to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

    • since 4.07
    val to_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in ascending order

    • since 4.07
    val to_rev_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in descending order

    • since 4.12
    val add_seq : elt Stdlib.Seq.t -> t -> t

    Add the given elements to the set, in order.

    • since 4.07
    val of_seq : elt Stdlib.Seq.t -> t

    Build a set from the given bindings

    • since 4.07
    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    val to_string : t -> string
    val of_list : elt list -> t
    val map : (elt -> elt) -> t -> t
    val vars : parameter list -> Variable.Set.t
    diff --git a/ocaml/Parameter/T/index.html b/ocaml/Parameter/T/index.html new file mode 100644 index 0000000..ae535af --- /dev/null +++ b/ocaml/Parameter/T/index.html @@ -0,0 +1,2 @@ + +T (ocaml.Parameter.T)

    Module Parameter.T

    type t = t
    include Hashtbl.HashedType with type t := t
    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val hash : t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := t
    val compare : t -> t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    diff --git a/ocaml/Parameter/Tbl/index.html b/ocaml/Parameter/Tbl/index.html new file mode 100644 index 0000000..7801b57 --- /dev/null +++ b/ocaml/Parameter/Tbl/index.html @@ -0,0 +1,2 @@ + +Tbl (ocaml.Parameter.Tbl)

    Module Parameter.Tbl

    include Hashtbl.S with type key = T.t and type 'a t = 'a Hashtbl.Make(T).t
    type key = T.t
    val create : int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    • since 4.00
    val copy : 'a t -> 'a t
    val add : 'a t -> key -> 'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    • since 4.05
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key -> 'a -> unit
    val mem : 'a t -> key -> bool
    val iter : (key -> 'a -> unit) -> 'a t -> unit
    val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
    • since 4.03
    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc
    val length : 'a t -> int
    val stats : 'a t -> Stdlib.Hashtbl.statistics
    • since 4.00
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
    • since 4.07
    val to_seq_keys : _ t -> key Stdlib.Seq.t
    • since 4.07
    val to_seq_values : 'a t -> 'a Stdlib.Seq.t
    • since 4.07
    val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
    • since 4.07
    val to_list : 'a t -> (T.t * 'a) list
    val of_list : (T.t * 'a) list -> 'a t
    val to_map : 'a t -> 'a Stdlib.Map.Make(T).t
    val of_map : 'a Stdlib.Map.Make(T).t -> 'a t
    val memoize : 'a t -> (key -> 'a) -> key -> 'a
    val map : 'a t -> ('a -> 'b) -> 'b t
    diff --git a/ocaml/Parameter/index.html b/ocaml/Parameter/index.html new file mode 100644 index 0000000..668776e --- /dev/null +++ b/ocaml/Parameter/index.html @@ -0,0 +1,2 @@ + +Parameter (ocaml.Parameter)

    Module Parameter

    Parameter.t carries a unique Variable.t used as function parameter. It can also carry annotations about the usage of the variable.

    type t
    type parameter = t
    val wrap : Variable.t -> t

    Make a parameter from a variable with default attributes

    val var : t -> Variable.t
    val rename : ?current_compilation_unit:Compilation_unit.t -> t -> t

    Rename the inner variable of the parameter

    val map_var : (Variable.t -> Variable.t) -> t -> t
    module T : Identifiable.Thing with type t = t
    module Set : sig ... end
    include Identifiable.S with type t := t and module T := T and module Set := Set
    include Identifiable.Thing with type t := T.t
    include Hashtbl.HashedType with type t := T.t
    val equal : T.t -> T.t -> bool

    The equality predicate used to compare keys.

    val hash : T.t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := T.t
    val compare : T.t -> T.t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> T.t -> unit
    val print : Stdlib.Format.formatter -> T.t -> unit
    module Map : Identifiable.Map with module T := T
    module Tbl : Identifiable.Tbl with module T := T
    module List : sig ... end
    diff --git a/ocaml/Parmatch/Compat/argument-1-_/index.html b/ocaml/Parmatch/Compat/argument-1-_/index.html new file mode 100644 index 0000000..d26854a --- /dev/null +++ b/ocaml/Parmatch/Compat/argument-1-_/index.html @@ -0,0 +1,5 @@ + +_ (ocaml.Parmatch.Compat._)

    Parameter Compat._

    diff --git a/ocaml/Parmatch/Compat/index.html b/ocaml/Parmatch/Compat/index.html new file mode 100644 index 0000000..b13f293 --- /dev/null +++ b/ocaml/Parmatch/Compat/index.html @@ -0,0 +1,2 @@ + +Compat (ocaml.Parmatch.Compat)

    Module Parmatch.Compat

    Exported compatibility functor, abstracted over constructor equality

    Parameters

    module _ : sig ... end

    Signature

    val compat : Typedtree.pattern -> Typedtree.pattern -> bool
    val compats : Typedtree.pattern list -> Typedtree.pattern list -> bool
    diff --git a/ocaml/Parmatch/index.html b/ocaml/Parmatch/index.html new file mode 100644 index 0000000..5264c68 --- /dev/null +++ b/ocaml/Parmatch/index.html @@ -0,0 +1,27 @@ + +Parmatch (ocaml.Parmatch)

    Module Parmatch

    Detection of partial matches and unused match cases.

    type 'pattern parmatch_case = {
    1. pattern : 'pattern;
    2. has_guard : bool;
    3. needs_refute : bool;
      (*

      true if the program text claims the case is unreachable, a la function _ -> .

      *)
    }

    Most checks in this file need not access all information about a case, and just need a few pieces of information. parmatch_case is those few pieces of information.

    type 'category typed_case := 'category Typedtree.general_pattern parmatch_case
    val typed_case : 'category Typedtree.case -> 'category typed_case
    val const_compare : Asttypes.constant -> Asttypes.constant -> int

    const_compare c1 c2 compares the actual values represented by c1 and c2, while simply using Stdlib.compare would compare the representations.

    cf. MPR#5758

    val le_pat : Typedtree.pattern -> Typedtree.pattern -> bool

    le_pat p q means: forall V, V matches q implies V matches p

    val le_pats : Typedtree.pattern list -> Typedtree.pattern list -> bool

    le_pats (p1 .. pm) (q1 .. qn) means: forall i <= m, le_pat pi qi

    module Compat (_ : sig ... end) : sig ... end

    Exported compatibility functor, abstracted over constructor equality

    exception Empty

    lub p q is a pattern that matches all values matched by p and q. May raise Empty, when p and q are not compatible.

    val lubs : + Typedtree.pattern list -> + Typedtree.pattern list -> + Typedtree.pattern list

    lubs [p1; ...; pn] [q1; ...; qk], where n < k, is [lub p1 q1; ...; lub pk qk].

    val get_mins : ('a -> 'a -> bool) -> 'a list -> 'a list
    val set_args : + Typedtree.pattern -> + Typedtree.pattern list -> + Typedtree.pattern list

    Those two functions recombine one pattern and its arguments: For instance: (_,_)::p1::p2::rem -> (p1, p2)::rem The second one will replace mutable arguments by '_'

    val set_args_erase_mutable : + Typedtree.pattern -> + Typedtree.pattern list -> + Typedtree.pattern list
    val pats_of_type : Env.t -> Types.type_expr -> Typedtree.pattern list

    pats_of_type builds a list of patterns from a given expected type, for explosion of wildcard patterns in Typecore.type_pat.

    There are four interesting cases:

    • the type is empty ()
    • no further explosion is necessary (Pat_any)
    • a single pattern is generated, from a record or tuple type or a single-variant type (tp)
    • a list of patterns, in the case that all branches are GADT constructors (tp1; ..; tpn).
    val pressure_variants : Env.t -> Typedtree.pattern list -> unit
    val pressure_variants_in_computation_pattern : + Env.t -> + Typedtree.computation Typedtree.general_pattern list -> + unit
    val check_partial : + (Typedtree.pattern -> Typedtree.pattern option) -> + Location.t -> + Typedtree.value typed_case list -> + Typedtree.partial

    check_partial pred loc caselist and check_unused refute pred caselist are called with a function pred which will be given counter-example candidates: they may be partially ill-typed, and have to be type-checked to extract a valid counter-example. pred returns a valid counter-example or None. refute indicates that check_unused was called on a refutation clause.

    val check_unused : + (bool -> Typedtree.pattern -> Typedtree.pattern option) -> + Typedtree.value typed_case list -> + unit
    val irrefutable : Typedtree.pattern -> bool
    val inactive : partial:Typedtree.partial -> Typedtree.pattern -> bool

    An inactive pattern is a pattern, matching against which can be duplicated, erased or delayed without change in observable behavior of the program. Patterns containing (lazy _) subpatterns or reads of mutable fields are active.

    val check_ambiguous_bindings : Typedtree.value Typedtree.case list -> unit
    val some_private_tag : Asttypes.label
    diff --git a/ocaml/Parse/index.html b/ocaml/Parse/index.html new file mode 100644 index 0000000..7ee915a --- /dev/null +++ b/ocaml/Parse/index.html @@ -0,0 +1,2 @@ + +Parse (ocaml.Parse)

    Module Parse

    Entry points in the parser

    Warning: this module is unstable and part of compiler-libs.

    The functions below can be used to parse Longident safely.

    The function longident is guaranteed to parse all subclasses of Longident.t used in OCaml: values, constructors, simple or extended module paths, and types or module types.

    However, this function accepts inputs which are not accepted by the compiler, because they combine functor applications and infix operators. In valid OCaml syntax, only value-level identifiers may end with infix operators Foo.( + ). Moreover, in value-level identifiers the module path Foo must be simple (M.N rather than F(X)): functor applications may only appear in type-level identifiers. As a consequence, a path such as F(X).( + ) is not a valid OCaml identifier; but it is accepted by this function.

    The next functions are specialized to a subclass of Longident.t

    This function parses a syntactically valid path for a value. For instance, x, M.x, and (+.) are valid. Contrarily, M.A, F(X).x, and true are rejected.

    Longident for OCaml's value cannot contain functor application. The last component of the Longident.t is not capitalized, but can be an operator A.Path.To.(.%.%.(;..)<-)

    val constr_ident : Stdlib.Lexing.lexbuf -> Longident.t

    This function parses a syntactically valid path for a variant constructor. For instance, A, M.A and M.(::) are valid, but both M.a and F(X).A are rejected.

    Longident for OCaml's variant constructors cannot contain functor application. The last component of the Longident.t is capitalized, or it may be one the special constructors: true,false,(),[],(::). Among those special constructors, only (::) can be prefixed by a module path (A.B.C.(::)).

    val simple_module_path : Stdlib.Lexing.lexbuf -> Longident.t

    This function parses a syntactically valid path for a module. For instance, A, and M.A are valid, but both M.a and F(X).A are rejected.

    Longident for OCaml's module cannot contain functor application. The last component of the Longident.t is capitalized.

    val extended_module_path : Stdlib.Lexing.lexbuf -> Longident.t

    This function parse syntactically valid path for an extended module. For instance, A.B and F(A).B are valid. Contrarily, (.%()) or [] are both rejected.

    The last component of the Longident.t is capitalized.

    val type_ident : Stdlib.Lexing.lexbuf -> Longident.t

    This function parse syntactically valid path for a type or a module type. For instance, A, t, M.t and F(X).t are valid. Contrarily, (.%()) or [] are both rejected.

    In path for type and module types, only operators and special constructors are rejected.

    diff --git a/ocaml/Parser/Incremental/index.html b/ocaml/Parser/Incremental/index.html new file mode 100644 index 0000000..2bf2eaa --- /dev/null +++ b/ocaml/Parser/Incremental/index.html @@ -0,0 +1,32 @@ + +Incremental (ocaml.Parser.Incremental)

    Module Parser.Incremental

    diff --git a/ocaml/Parser/MenhirInterpreter/index.html b/ocaml/Parser/MenhirInterpreter/index.html new file mode 100644 index 0000000..1bf85f0 --- /dev/null +++ b/ocaml/Parser/MenhirInterpreter/index.html @@ -0,0 +1,35 @@ + +MenhirInterpreter (ocaml.Parser.MenhirInterpreter)

    Module Parser.MenhirInterpreter

    include CamlinternalMenhirLib.IncrementalEngine.INCREMENTAL_ENGINE + with type token = token
    type token = token
    type production
    type 'a env
    type 'a checkpoint = private
    1. | InputNeeded of 'a env
    2. | Shifting of 'a env * 'a env * bool
    3. | AboutToReduce of 'a env * production
    4. | HandlingError of 'a env
    5. | Accepted of 'a
    6. | Rejected
    type strategy = [
    1. | `Legacy
    2. | `Simplified
    ]
    val resume : ?strategy:strategy -> 'a checkpoint -> 'a checkpoint
    val lexer_lexbuf_to_supplier : + (Stdlib.Lexing.lexbuf -> token) -> + Stdlib.Lexing.lexbuf -> + supplier
    val loop : ?strategy:strategy -> supplier -> 'a checkpoint -> 'a
    val loop_handle : + ('a -> 'answer) -> + ('a checkpoint -> 'answer) -> + supplier -> + 'a checkpoint -> + 'answer
    val loop_handle_undo : + ('a -> 'answer) -> + ('a checkpoint -> 'a checkpoint -> 'answer) -> + supplier -> + 'a checkpoint -> + 'answer
    val shifts : 'a checkpoint -> 'a env option
    val acceptable : + 'a checkpoint -> + token -> + CamlinternalMenhirLib.IncrementalEngine.position -> + bool
    type 'a lr1state
    val number : _ lr1state -> int
    val production_index : production -> int
    val find_production : int -> production
    val stack : 'a env -> stack
    val top : 'a env -> element option
    val pop_many : int -> 'a env -> 'a env option
    val get : int -> 'a env -> element option
    val current_state_number : 'a env -> int
    val equal : 'a env -> 'a env -> bool
    val env_has_default_reduction : 'a env -> bool
    val state_has_default_reduction : _ lr1state -> bool
    val pop : 'a env -> 'a env option
    val force_reduction : production -> 'a env -> 'a env
    val input_needed : 'a env -> 'a checkpoint
    diff --git a/ocaml/Parser/index.html b/ocaml/Parser/index.html new file mode 100644 index 0000000..84307ca --- /dev/null +++ b/ocaml/Parser/index.html @@ -0,0 +1,47 @@ + +Parser (ocaml.Parser)

    Module Parser

    type token =
    1. | WITH
    2. | WHILE
    3. | WHEN
    4. | VIRTUAL
    5. | VAL
    6. | UNDERSCORE
    7. | UIDENT of string
    8. | TYPE
    9. | TRY
    10. | TRUE
    11. | TO
    12. | TILDE
    13. | THEN
    14. | STRUCT
    15. | STRING of string * Location.t * string option
    16. | STAR
    17. | SIG
    18. | SEMISEMI
    19. | SEMI
    20. | RPAREN
    21. | REC
    22. | RBRACKET
    23. | RBRACE
    24. | QUOTED_STRING_ITEM of string * Location.t * string * Location.t * string option
    25. | QUOTED_STRING_EXPR of string * Location.t * string * Location.t * string option
    26. | QUOTE
    27. | QUESTION
    28. | PRIVATE
    29. | PREFIXOP of string
    30. | PLUSEQ
    31. | PLUSDOT
    32. | PLUS
    33. | PERCENT
    34. | OR
    35. | OPTLABEL of string
    36. | OPEN
    37. | OF
    38. | OBJECT
    39. | NONREC
    40. | NEW
    41. | MUTABLE
    42. | MODULE
    43. | MINUSGREATER
    44. | MINUSDOT
    45. | MINUS
    46. | METHOD
    47. | MATCH
    48. | LPAREN
    49. | LIDENT of string
    50. | LETOP of string
    51. | LET
    52. | LESSMINUS
    53. | LESS
    54. | LBRACKETPERCENTPERCENT
    55. | LBRACKETPERCENT
    56. | LBRACKETLESS
    57. | LBRACKETGREATER
    58. | LBRACKETBAR
    59. | LBRACKETATATAT
    60. | LBRACKETATAT
    61. | LBRACKETAT
    62. | LBRACKET
    63. | LBRACELESS
    64. | LBRACE
    65. | LAZY
    66. | LABEL of string
    67. | INT of string * char option
    68. | INITIALIZER
    69. | INHERIT
    70. | INFIXOP4 of string
    71. | INFIXOP3 of string
    72. | INFIXOP2 of string
    73. | INFIXOP1 of string
    74. | INFIXOP0 of string
    75. | INCLUDE
    76. | IN
    77. | IF
    78. | HASHOP of string
    79. | HASH
    80. | GREATERRBRACKET
    81. | GREATERRBRACE
    82. | GREATER
    83. | FUNCTOR
    84. | FUNCTION
    85. | FUN
    86. | FOR
    87. | FLOAT of string * char option
    88. | FALSE
    89. | EXTERNAL
    90. | EXCEPTION
    91. | EQUAL
    92. | EOL
    93. | EOF
    94. | END
    95. | ELSE
    96. | DOWNTO
    97. | DOTOP of string
    98. | DOTDOT
    99. | DOT
    100. | DONE
    101. | DOCSTRING of Docstrings.docstring
    102. | DO
    103. | CONSTRAINT
    104. | COMMENT of string * Location.t
    105. | COMMA
    106. | COLONGREATER
    107. | COLONEQUAL
    108. | COLONCOLON
    109. | COLON
    110. | CLASS
    111. | CHAR of char
    112. | BEGIN
    113. | BARRBRACKET
    114. | BARBAR
    115. | BAR
    116. | BANG
    117. | BACKQUOTE
    118. | ASSERT
    119. | AS
    120. | ANDOP of string
    121. | AND
    122. | AMPERSAND
    123. | AMPERAMPER
    exception Error
    val parse_val_longident : + (Stdlib.Lexing.lexbuf -> token) -> + Stdlib.Lexing.lexbuf -> + Longident.t
    val parse_mty_longident : + (Stdlib.Lexing.lexbuf -> token) -> + Stdlib.Lexing.lexbuf -> + Longident.t
    val parse_module_type : + (Stdlib.Lexing.lexbuf -> token) -> + Stdlib.Lexing.lexbuf -> + Parsetree.module_type
    val parse_module_expr : + (Stdlib.Lexing.lexbuf -> token) -> + Stdlib.Lexing.lexbuf -> + Parsetree.module_expr
    val parse_mod_longident : + (Stdlib.Lexing.lexbuf -> token) -> + Stdlib.Lexing.lexbuf -> + Longident.t
    val parse_mod_ext_longident : + (Stdlib.Lexing.lexbuf -> token) -> + Stdlib.Lexing.lexbuf -> + Longident.t
    val parse_constr_longident : + (Stdlib.Lexing.lexbuf -> token) -> + Stdlib.Lexing.lexbuf -> + Longident.t
    val parse_any_longident : + (Stdlib.Lexing.lexbuf -> token) -> + Stdlib.Lexing.lexbuf -> + Longident.t
    module MenhirInterpreter : sig ... end
    module Incremental : sig ... end
    diff --git a/ocaml/Parsetree/index.html b/ocaml/Parsetree/index.html new file mode 100644 index 0000000..e36c857 --- /dev/null +++ b/ocaml/Parsetree/index.html @@ -0,0 +1,25 @@ + +Parsetree (ocaml.Parsetree)

    Module Parsetree

    Abstract syntax tree produced by parsing

    Warning: this module is unstable and part of compiler-libs.

    type constant =
    1. | Pconst_integer of string * char option
      (*

      Integer constants such as 3 3l 3L 3n.

      Suffixes [g-z][G-Z] are accepted by the parser. Suffixes except 'l', 'L' and 'n' are rejected by the typechecker

      *)
    2. | Pconst_char of char
      (*

      Character such as 'c'.

      *)
    3. | Pconst_string of string * Location.t * string option
      (*

      Constant string such as "constant" or {delim|other constant|delim}.

      The location span the content of the string, without the delimiters.

      *)
    4. | Pconst_float of string * char option
      (*

      Float constant such as 3.4, 2e5 or 1.4e-4.

      Suffixes g-zG-Z are accepted by the parser. Suffixes are rejected by the typechecker.

      *)
    type location_stack = Location.t list

    Extension points

    type attribute = {
    1. attr_name : string Asttypes.loc;
    2. attr_payload : payload;
    3. attr_loc : Location.t;
    }

    Attributes such as [\@id ARG] and [\@\@id ARG].

    Metadata containers passed around within the AST. The compiler ignores unknown attributes.

    and extension = string Asttypes.loc * payload

    Extension points such as [%id ARG] and [%%id ARG].

    Sub-language placeholder -- rejected by the typechecker.

    and attributes = attribute list
    and payload =
    1. | PStr of structure
    2. | PSig of signature
      (*

      : SIG in an attribute or an extension point

      *)
    3. | PTyp of core_type
      (*

      : T in an attribute or an extension point

      *)
    4. | PPat of pattern * expression option
      (*

      ? P or ? P when E, in an attribute or an extension point

      *)

    Core language

    Type expressions

    and core_type = {
    1. ptyp_desc : core_type_desc;
    2. ptyp_loc : Location.t;
    3. ptyp_loc_stack : location_stack;
    4. ptyp_attributes : attributes;
      (*

      ... [\@id1] [\@id2]

      *)
    }
    and core_type_desc =
    1. | Ptyp_any
      (*

      _

      *)
    2. | Ptyp_var of string
      (*

      A type variable such as 'a

      *)
    3. | Ptyp_arrow of Asttypes.arg_label * core_type * core_type
      (*

      Ptyp_arrow(lbl, T1, T2) represents:

      *)
    4. | Ptyp_tuple of core_type list
      (*

      Ptyp_tuple([T1 ; ... ; Tn]) represents a product type T1 * ... * Tn.

      Invariant: n >= 2.

      *)
    5. | Ptyp_constr of Longident.t Asttypes.loc * core_type list
      (*

      Ptyp_constr(lident, l) represents:

      • tconstr when l=[],
      • T tconstr when l=[T],
      • (T1, ..., Tn) tconstr when l=[T1 ; ... ; Tn].
      *)
    6. | Ptyp_object of object_field list * Asttypes.closed_flag
      (*

      Ptyp_object([ l1:T1; ...; ln:Tn ], flag) represents:

      • < l1:T1; ...; ln:Tn > when flag is Closed,
      • < l1:T1; ...; ln:Tn; .. > when flag is Open.
      *)
    7. | Ptyp_class of Longident.t Asttypes.loc * core_type list
      (*

      Ptyp_class(tconstr, l) represents:

      • #tconstr when l=[],
      • T #tconstr when l=[T],
      • (T1, ..., Tn) #tconstr when l=[T1 ; ... ; Tn].
      *)
    8. | Ptyp_alias of core_type * string Asttypes.loc
      (*

      T as 'a.

      *)
    9. | Ptyp_variant of row_field list + * Asttypes.closed_flag + * Asttypes.label list option
      (*

      Ptyp_variant([`A;`B], flag, labels) represents:

      • [ `A|`B ] when flag is Closed, and labels is None,
      • [> `A|`B ] when flag is Open, and labels is None,
      • [< `A|`B ] when flag is Closed, and labels is Some [],
      • [< `A|`B > `X `Y ] when flag is Closed, and labels is Some ["X";"Y"].
      *)
    10. | Ptyp_poly of string Asttypes.loc list * core_type
      (*

      'a1 ... 'an. T

      Can only appear in the following context:

      • As the core_type of a Ppat_constraint node corresponding to a constraint on a let-binding:

        let x : 'a1 ... 'an. T = e ...
      *)
    11. | Ptyp_package of package_type
      (*

      (module S).

      *)
    12. | Ptyp_open of Longident.t Asttypes.loc * core_type
      (*

      M.(T)

      *)
    13. | Ptyp_extension of extension
      (*

      [%id].

      *)

    As package_type typed values:

    • (S, []) represents (module S),
    • (S, [(t1, T1) ; ... ; (tn, Tn)]) represents (module S with type t1 = T1 and ... and tn = Tn).
    and row_field = {
    1. prf_desc : row_field_desc;
    2. prf_loc : Location.t;
    3. prf_attributes : attributes;
    }
    and row_field_desc =
    1. | Rtag of Asttypes.label Asttypes.loc * bool * core_type list
      (*

      Rtag(`A, b, l) represents:

      • `A when b is true and l is [],
      • `A of T when b is false and l is [T],
      • `A of T1 & .. & Tn when b is false and l is [T1;...Tn],
      • `A of & T1 & .. & Tn when b is true and l is [T1;...Tn].
      • The bool field is true if the tag contains a constant (empty) constructor.
      • & occurs when several types are used for the same constructor (see 4.2 in the manual)
      *)
    2. | Rinherit of core_type
      (*

      [ | t ]

      *)
    and object_field = {
    1. pof_desc : object_field_desc;
    2. pof_loc : Location.t;
    3. pof_attributes : attributes;
    }
    and object_field_desc =
    1. | Otag of Asttypes.label Asttypes.loc * core_type
    2. | Oinherit of core_type

    Patterns

    and pattern = {
    1. ppat_desc : pattern_desc;
    2. ppat_loc : Location.t;
    3. ppat_loc_stack : location_stack;
    4. ppat_attributes : attributes;
      (*

      ... [\@id1] [\@id2]

      *)
    }
    and pattern_desc =
    1. | Ppat_any
      (*

      The pattern _.

      *)
    2. | Ppat_var of string Asttypes.loc
      (*

      A variable pattern such as x

      *)
    3. | Ppat_alias of pattern * string Asttypes.loc
      (*

      An alias pattern such as P as 'a

      *)
    4. | Ppat_constant of constant
      (*

      Patterns such as 1, 'a', "true", 1.0, 1l, 1L, 1n

      *)
    5. | Ppat_interval of constant * constant
      (*

      Patterns such as 'a'..'z'.

      Other forms of interval are recognized by the parser but rejected by the type-checker.

      *)
    6. | Ppat_tuple of pattern list
      (*

      Patterns (P1, ..., Pn).

      Invariant: n >= 2

      *)
    7. | Ppat_construct of Longident.t Asttypes.loc + * (string Asttypes.loc list * pattern) option
      (*

      Ppat_construct(C, args) represents:

      • C when args is None,
      • C P when args is Some ([], P)
      • C (P1, ..., Pn) when args is Some ([], Ppat_tuple [P1; ...; Pn])
      • C (type a b) P when args is Some ([a; b], P)
      *)
    8. | Ppat_variant of Asttypes.label * pattern option
      (*

      Ppat_variant(`A, pat) represents:

      • `A when pat is None,
      • `A P when pat is Some P
      *)
    9. | Ppat_record of (Longident.t Asttypes.loc * pattern) list * Asttypes.closed_flag
      (*

      Ppat_record([(l1, P1) ; ... ; (ln, Pn)], flag) represents:

      • { l1=P1; ...; ln=Pn } when flag is Closed
      • { l1=P1; ...; ln=Pn; _} when flag is Open

      Invariant: n > 0

      *)
    10. | Ppat_array of pattern list
      (*

      Pattern [| P1; ...; Pn |]

      *)
    11. | Ppat_or of pattern * pattern
      (*

      Pattern P1 | P2

      *)
    12. | Ppat_constraint of pattern * core_type
      (*

      Pattern (P : T)

      *)
    13. | Ppat_type of Longident.t Asttypes.loc
      (*

      Pattern #tconst

      *)
    14. | Ppat_lazy of pattern
      (*

      Pattern lazy P

      *)
    15. | Ppat_unpack of string option Asttypes.loc
      (*

      Ppat_unpack(s) represents:

      • (module P) when s is Some "P"
      • (module _) when s is None

      Note: (module P : S) is represented as Ppat_constraint(Ppat_unpack(Some "P"), Ptyp_package S)

      *)
    16. | Ppat_exception of pattern
      (*

      Pattern exception P

      *)
    17. | Ppat_extension of extension
      (*

      Pattern [%id]

      *)
    18. | Ppat_open of Longident.t Asttypes.loc * pattern
      (*

      Pattern M.(P)

      *)

    Value expressions

    and expression = {
    1. pexp_desc : expression_desc;
    2. pexp_loc : Location.t;
    3. pexp_loc_stack : location_stack;
    4. pexp_attributes : attributes;
      (*

      ... [\@id1] [\@id2]

      *)
    }
    and expression_desc =
    1. | Pexp_ident of Longident.t Asttypes.loc
      (*

      Identifiers such as x and M.x

      *)
    2. | Pexp_constant of constant
      (*

      Expressions constant such as 1, 'a', "true", 1.0, 1l, 1L, 1n

      *)
    3. | Pexp_let of Asttypes.rec_flag * value_binding list * expression
      (*

      Pexp_let(flag, [(P1,E1) ; ... ; (Pn,En)], E) represents:

      • let P1 = E1 and ... and Pn = EN in E when flag is Nonrecursive,
      • let rec P1 = E1 and ... and Pn = EN in E when flag is Recursive.
      *)
    4. | Pexp_function of function_param list * type_constraint option * function_body
      (*

      Pexp_function ([P1; ...; Pn], C, body) represents any construct involving fun or function, including:

      • fun P1 ... Pn -> E when body = Pfunction_body E
      • fun P1 ... Pn -> function p1 -> e1 | ... | pm -> em when body = Pfunction_cases [ p1 -> e1; ...; pm -> em ]

      C represents a type constraint or coercion placed immediately before the arrow, e.g. fun P1 ... Pn : ty -> ... when C = Some (Pconstraint ty).

      A function must have parameters. Pexp_function (params, _, body) must have non-empty params or a Pfunction_cases _ body.

      *)
    5. | Pexp_apply of expression * (Asttypes.arg_label * expression) list
      (*

      Pexp_apply(E0, [(l1, E1) ; ... ; (ln, En)]) represents E0 ~l1:E1 ... ~ln:En

      li can be Nolabel (non labeled argument), Labelled (labelled arguments) or Optional (optional argument).

      Invariant: n > 0

      *)
    6. | Pexp_match of expression * case list
      (*

      match E0 with P1 -> E1 | ... | Pn -> En

      *)
    7. | Pexp_try of expression * case list
      (*

      try E0 with P1 -> E1 | ... | Pn -> En

      *)
    8. | Pexp_tuple of expression list
      (*

      Expressions (E1, ..., En)

      Invariant: n >= 2

      *)
    9. | Pexp_construct of Longident.t Asttypes.loc * expression option
      (*

      Pexp_construct(C, exp) represents:

      • C when exp is None,
      • C E when exp is Some E,
      • C (E1, ..., En) when exp is Some (Pexp_tuple[E1;...;En])
      *)
    10. | Pexp_variant of Asttypes.label * expression option
      (*

      Pexp_variant(`A, exp) represents

      • `A when exp is None
      • `A E when exp is Some E
      *)
    11. | Pexp_record of (Longident.t Asttypes.loc * expression) list * expression option
      (*

      Pexp_record([(l1,P1) ; ... ; (ln,Pn)], exp0) represents

      • { l1=P1; ...; ln=Pn } when exp0 is None
      • { E0 with l1=P1; ...; ln=Pn } when exp0 is Some E0

      Invariant: n > 0

      *)
    12. | Pexp_field of expression * Longident.t Asttypes.loc
      (*

      E.l

      *)
    13. | Pexp_setfield of expression * Longident.t Asttypes.loc * expression
      (*

      E1.l <- E2

      *)
    14. | Pexp_array of expression list
      (*

      [| E1; ...; En |]

      *)
    15. | Pexp_ifthenelse of expression * expression * expression option
      (*

      if E1 then E2 else E3

      *)
    16. | Pexp_sequence of expression * expression
      (*

      E1; E2

      *)
    17. | Pexp_while of expression * expression
      (*

      while E1 do E2 done

      *)
    18. | Pexp_for of pattern + * expression + * expression + * Asttypes.direction_flag + * expression
      (*

      Pexp_for(i, E1, E2, direction, E3) represents:

      • for i = E1 to E2 do E3 done when direction is Upto
      • for i = E1 downto E2 do E3 done when direction is Downto
      *)
    19. | Pexp_constraint of expression * core_type
      (*

      (E : T)

      *)
    20. | Pexp_coerce of expression * core_type option * core_type
      (*

      Pexp_coerce(E, from, T) represents

      • (E :> T) when from is None,
      • (E : T0 :> T) when from is Some T0.
      *)
    21. | Pexp_send of expression * Asttypes.label Asttypes.loc
      (*

      E # m

      *)
    22. | Pexp_new of Longident.t Asttypes.loc
      (*

      new M.c

      *)
    23. | Pexp_setinstvar of Asttypes.label Asttypes.loc * expression
      (*

      x <- 2

      *)
    24. | Pexp_override of (Asttypes.label Asttypes.loc * expression) list
      (*

      {< x1 = E1; ...; xn = En >}

      *)
    25. | Pexp_letmodule of string option Asttypes.loc * module_expr * expression
      (*

      let module M = ME in E

      *)
    26. | Pexp_letexception of extension_constructor * expression
      (*

      let exception C in E

      *)
    27. | Pexp_assert of expression
      (*

      assert E.

      Note: assert false is treated in a special way by the type-checker.

      *)
    28. | Pexp_lazy of expression
      (*

      lazy E

      *)
    29. | Pexp_poly of expression * core_type option
      (*

      Used for method bodies.

      Can only be used as the expression under Cfk_concrete for methods (not values).

      *)
    30. | Pexp_object of class_structure
      (*

      object ... end

      *)
    31. | Pexp_newtype of string Asttypes.loc * expression
      (*

      fun (type t) -> E

      *)
    32. | Pexp_pack of module_expr
      (*

      (module ME).

      (module ME : S) is represented as Pexp_constraint(Pexp_pack ME, Ptyp_package S)

      *)
    33. | Pexp_open of open_declaration * expression
      (*
      • M.(E)
      • let open M in E
      • let open! M in E
      *)
    34. | Pexp_letop of letop
      (*
      • let* P = E0 in E1
      • let* P0 = E00 and* P1 = E01 in E1
      *)
    35. | Pexp_extension of extension
      (*

      [%id]

      *)
    36. | Pexp_unreachable
      (*

      .

      *)
    and case = {
    1. pc_lhs : pattern;
    2. pc_guard : expression option;
    3. pc_rhs : expression;
    }

    Values of type case represents (P -> E) or (P when E0 -> E)

    and letop = {
    1. let_ : binding_op;
    2. ands : binding_op list;
    3. body : expression;
    }
    and binding_op = {
    1. pbop_op : string Asttypes.loc;
    2. pbop_pat : pattern;
    3. pbop_exp : expression;
    4. pbop_loc : Location.t;
    }
    and function_param_desc =
    1. | Pparam_val of Asttypes.arg_label * expression option * pattern
      (*

      Pparam_val (lbl, exp0, P) represents the parameter:

      Note: If E0 is provided, only Optional is allowed.

      *)
    2. | Pparam_newtype of string Asttypes.loc
      (*

      Pparam_newtype x represents the parameter (type x). x carries the location of the identifier, whereas the pparam_loc on the enclosing function_param node is the location of the (type x) as a whole.

      Multiple parameters (type a b c) are represented as multiple Pparam_newtype nodes, let's say:

       [ { pparam_kind = Pparam_newtype a; pparam_loc = loc1 };
+     { pparam_kind = Pparam_newtype b; pparam_loc = loc2 };
+     { pparam_kind = Pparam_newtype c; pparam_loc = loc3 };
+   ]

      Here, the first loc loc1 is the location of (type a b c), and the subsequent locs loc2 and loc3 are the same as loc1, except marked as ghost locations. The locations on a, b, c, correspond to the variables a, b, and c in the source code.

      *)
    and function_param = {
    1. pparam_loc : Location.t;
    2. pparam_desc : function_param_desc;
    }
    and function_body =
    1. | Pfunction_body of expression
    2. | Pfunction_cases of case list * Location.t * attributes
      (*

      In Pfunction_cases (_, loc, attrs), the location extends from the start of the function keyword to the end of the last case. The compiler will only use typechecking-related attributes from attrs, e.g. enabling or disabling a warning.

      *)

    See the comment on Pexp_function.

    and type_constraint =
    1. | Pconstraint of core_type
    2. | Pcoerce of core_type option * core_type
      (*

      See the comment on Pexp_function.

      *)

    Value descriptions

    and value_description = {
    1. pval_name : string Asttypes.loc;
    2. pval_type : core_type;
    3. pval_prim : string list;
    4. pval_attributes : attributes;
      (*

      ... [\@\@id1] [\@\@id2]

      *)
    5. pval_loc : Location.t;
    }

    Values of type value_description represents:

    • val x: T, when pval_prim is []
    • external x: T = "s1" ... "sn" when pval_prim is ["s1";..."sn"]

    Type declarations

    and type_declaration = {
    1. ptype_name : string Asttypes.loc;
    2. ptype_params : (core_type * (Asttypes.variance * Asttypes.injectivity)) list;
      (*

      ('a1,...'an) t

      *)
    3. ptype_cstrs : (core_type * core_type * Location.t) list;
      (*

      ... constraint T1=T1' ... constraint Tn=Tn'

      *)
    4. ptype_kind : type_kind;
    5. ptype_private : Asttypes.private_flag;
      (*

      for = private ...

      *)
    6. ptype_manifest : core_type option;
      (*

      represents = T

      *)
    7. ptype_attributes : attributes;
      (*

      ... [\@\@id1] [\@\@id2]

      *)
    8. ptype_loc : Location.t;
    }

    Here are type declarations and their representation, for various ptype_kind and ptype_manifest values:

    • type t when type_kind is Ptype_abstract, and manifest is None,
    • type t = T0 when type_kind is Ptype_abstract, and manifest is Some T0,
    • type t = C of T | ... when type_kind is Ptype_variant, and manifest is None,
    • type t = T0 = C of T | ... when type_kind is Ptype_variant, and manifest is Some T0,
    • type t = {l: T; ...} when type_kind is Ptype_record, and manifest is None,
    • type t = T0 = {l : T; ...} when type_kind is Ptype_record, and manifest is Some T0,
    • type t = .. when type_kind is Ptype_open, and manifest is None.
    and type_kind =
    1. | Ptype_abstract
    2. | Ptype_variant of constructor_declaration list
    3. | Ptype_record of label_declaration list
      (*

      Invariant: non-empty list

      *)
    4. | Ptype_open
    and label_declaration = {
    1. pld_name : string Asttypes.loc;
    2. pld_mutable : Asttypes.mutable_flag;
    3. pld_type : core_type;
    4. pld_loc : Location.t;
    5. pld_attributes : attributes;
      (*

      l : T [\@id1] [\@id2]

      *)
    }

    Note: T can be a Ptyp_poly.

    and constructor_declaration = {
    1. pcd_name : string Asttypes.loc;
    2. pcd_vars : string Asttypes.loc list;
    3. pcd_args : constructor_arguments;
    4. pcd_res : core_type option;
    5. pcd_loc : Location.t;
    6. pcd_attributes : attributes;
      (*

      C of ... [\@id1] [\@id2]

      *)
    }
    and constructor_arguments =
    1. | Pcstr_tuple of core_type list
    2. | Pcstr_record of label_declaration list
      (*

      Values of type constructor_declaration represents the constructor arguments of:

      • C of T1 * ... * Tn when res = None, and args = Pcstr_tuple [T1; ... ; Tn],
      • C: T0 when res = Some T0, and args = Pcstr_tuple [],
      • C: T1 * ... * Tn -> T0 when res = Some T0, and args = Pcstr_tuple [T1; ... ; Tn],
      • C of {...} when res = None, and args = Pcstr_record [...],
      • C: {...} -> T0 when res = Some T0, and args = Pcstr_record [...].
      *)
    and type_extension = {
    1. ptyext_path : Longident.t Asttypes.loc;
    2. ptyext_params : (core_type * (Asttypes.variance * Asttypes.injectivity)) list;
    3. ptyext_constructors : extension_constructor list;
    4. ptyext_private : Asttypes.private_flag;
    5. ptyext_loc : Location.t;
    6. ptyext_attributes : attributes;
      (*

      ... \@\@id1 \@\@id2

      *)
    }

    Definition of new extensions constructors for the extensive sum type t (type t += ...).

    and extension_constructor = {
    1. pext_name : string Asttypes.loc;
    2. pext_kind : extension_constructor_kind;
    3. pext_loc : Location.t;
    4. pext_attributes : attributes;
      (*

      C of ... [\@id1] [\@id2]

      *)
    }
    and type_exception = {
    1. ptyexn_constructor : extension_constructor;
    2. ptyexn_loc : Location.t;
    3. ptyexn_attributes : attributes;
      (*

      ... [\@\@id1] [\@\@id2]

      *)
    }

    Definition of a new exception (exception E).

    and extension_constructor_kind =
    1. | Pext_decl of string Asttypes.loc list + * constructor_arguments + * core_type option
      (*

      Pext_decl(existentials, c_args, t_opt) describes a new extension constructor. It can be:

      • C of T1 * ... * Tn when:

        • existentials is [],
        • c_args is [T1; ...; Tn],
        • t_opt is None

      • C: T0 when

        • existentials is [],
        • c_args is [],
        • t_opt is Some T0.

      • C: T1 * ... * Tn -> T0 when

        • existentials is [],
        • c_args is [T1; ...; Tn],
        • t_opt is Some T0.

      • C: 'a... . T1 * ... * Tn -> T0 when

        • existentials is ['a;...],
        • c_args is [T1; ... ; Tn],
        • t_opt is Some T0.
      *)
    2. | Pext_rebind of Longident.t Asttypes.loc
      (*

      Pext_rebind(D) re-export the constructor D with the new name C

      *)

    Class language

    Type expressions for the class language

    and class_type = {
    1. pcty_desc : class_type_desc;
    2. pcty_loc : Location.t;
    3. pcty_attributes : attributes;
      (*

      ... [\@id1] [\@id2]

      *)
    }
    and class_type_desc =
    1. | Pcty_constr of Longident.t Asttypes.loc * core_type list
      (*
      • c
      • ['a1, ..., 'an] c
      *)
    2. | Pcty_signature of class_signature
      (*

      object ... end

      *)
    3. | Pcty_arrow of Asttypes.arg_label * core_type * class_type
      (*

      Pcty_arrow(lbl, T, CT) represents:

      *)
    4. | Pcty_extension of extension
      (*

      %id

      *)
    5. | Pcty_open of open_description * class_type
      (*

      let open M in CT

      *)
    and class_signature = {
    1. pcsig_self : core_type;
    2. pcsig_fields : class_type_field list;
    }

    Values of type class_signature represents:

    and class_type_field = {
    1. pctf_desc : class_type_field_desc;
    2. pctf_loc : Location.t;
    3. pctf_attributes : attributes;
      (*

      ... [\@\@id1] [\@\@id2]

      *)
    }
    and class_type_field_desc =
    1. | Pctf_inherit of class_type
      (*

      inherit CT

      *)
    2. | Pctf_val of Asttypes.label Asttypes.loc + * Asttypes.mutable_flag + * Asttypes.virtual_flag + * core_type
      (*

      val x: T

      *)
    3. | Pctf_method of Asttypes.label Asttypes.loc + * Asttypes.private_flag + * Asttypes.virtual_flag + * core_type
      (*

      method x: T

      Note: T can be a Ptyp_poly.

      *)
    4. | Pctf_constraint of core_type * core_type
      (*

      constraint T1 = T2

      *)
    5. | Pctf_attribute of attribute
      (*

      [\@\@\@id]

      *)
    6. | Pctf_extension of extension
      (*

      [%%id]

      *)
    and 'a class_infos = {
    1. pci_virt : Asttypes.virtual_flag;
    2. pci_params : (core_type * (Asttypes.variance * Asttypes.injectivity)) list;
    3. pci_name : string Asttypes.loc;
    4. pci_expr : 'a;
    5. pci_loc : Location.t;
    6. pci_attributes : attributes;
      (*

      ... [\@\@id1] [\@\@id2]

      *)
    }

    Values of type class_expr class_infos represents:

    • class c = ...
    • class ['a1,...,'an] c = ...
    • class virtual c = ...

    They are also used for "class type" declaration.

    and class_description = class_type class_infos
    and class_type_declaration = class_type class_infos

    Value expressions for the class language

    and class_expr = {
    1. pcl_desc : class_expr_desc;
    2. pcl_loc : Location.t;
    3. pcl_attributes : attributes;
      (*

      ... [\@id1] [\@id2]

      *)
    }
    and class_expr_desc =
    1. | Pcl_constr of Longident.t Asttypes.loc * core_type list
      (*

      c and ['a1, ..., 'an] c

      *)
    2. | Pcl_structure of class_structure
      (*

      object ... end

      *)
    3. | Pcl_fun of Asttypes.arg_label * expression option * pattern * class_expr
      (*

      Pcl_fun(lbl, exp0, P, CE) represents:

      • fun P -> CE when lbl is Nolabel and exp0 is None,
      • fun ~l:P -> CE when lbl is Labelled l and exp0 is None,
      • fun ?l:P -> CE when lbl is Optional l and exp0 is None,
      • fun ?l:(P = E0) -> CE when lbl is Optional l and exp0 is Some E0.
      *)
    4. | Pcl_apply of class_expr * (Asttypes.arg_label * expression) list
      (*

      Pcl_apply(CE, [(l1,E1) ; ... ; (ln,En)]) represents CE ~l1:E1 ... ~ln:En. li can be empty (non labeled argument) or start with ? (optional argument).

      Invariant: n > 0

      *)
    5. | Pcl_let of Asttypes.rec_flag * value_binding list * class_expr
      (*

      Pcl_let(rec, [(P1, E1); ... ; (Pn, En)], CE) represents:

      • let P1 = E1 and ... and Pn = EN in CE when rec is Nonrecursive,
      • let rec P1 = E1 and ... and Pn = EN in CE when rec is Recursive.
      *)
    6. | Pcl_constraint of class_expr * class_type
      (*

      (CE : CT)

      *)
    7. | Pcl_extension of extension
      (*

      [%id]

      *)
    8. | Pcl_open of open_description * class_expr
      (*

      let open M in CE

      *)
    and class_structure = {
    1. pcstr_self : pattern;
    2. pcstr_fields : class_field list;
    }

    Values of type class_structure represents:

    and class_field = {
    1. pcf_desc : class_field_desc;
    2. pcf_loc : Location.t;
    3. pcf_attributes : attributes;
      (*

      ... [\@\@id1] [\@\@id2]

      *)
    }
    and class_field_desc =
    1. | Pcf_inherit of Asttypes.override_flag * class_expr * string Asttypes.loc option
      (*

      Pcf_inherit(flag, CE, s) represents:

      • inherit CE when flag is Fresh and s is None,
      • inherit CE as x when flag is Fresh and s is Some x,
      • inherit! CE when flag is Override and s is None,
      • inherit! CE as x when flag is Override and s is Some x
      *)
    2. | Pcf_val of Asttypes.label Asttypes.loc + * Asttypes.mutable_flag + * class_field_kind
      (*

      Pcf_val(x,flag, kind) represents:

      *)
    3. | Pcf_method of Asttypes.label Asttypes.loc + * Asttypes.private_flag + * class_field_kind
      (**)
    4. | Pcf_constraint of core_type * core_type
      (*

      constraint T1 = T2

      *)
    5. | Pcf_initializer of expression
      (*

      initializer E

      *)
    6. | Pcf_attribute of attribute
      (*

      [\@\@\@id]

      *)
    7. | Pcf_extension of extension
      (*

      [%%id]

      *)
    and class_field_kind =
    1. | Cfk_virtual of core_type
    2. | Cfk_concrete of Asttypes.override_flag * expression
    and class_declaration = class_expr class_infos

    Module language

    Type expressions for the module language

    and module_type = {
    1. pmty_desc : module_type_desc;
    2. pmty_loc : Location.t;
    3. pmty_attributes : attributes;
      (*

      ... [\@id1] [\@id2]

      *)
    }
    and module_type_desc =
    1. | Pmty_ident of Longident.t Asttypes.loc
      (*

      Pmty_ident(S) represents S

      *)
    2. | Pmty_signature of signature
      (*

      sig ... end

      *)
    3. | Pmty_functor of functor_parameter * module_type
      (*

      functor(X : MT1) -> MT2

      *)
    4. | Pmty_with of module_type * with_constraint list
      (*

      MT with ...

      *)
    5. | Pmty_typeof of module_expr
      (*

      module type of ME

      *)
    6. | Pmty_extension of extension
      (*

      [%id]

      *)
    7. | Pmty_alias of Longident.t Asttypes.loc
      (*

      (module M)

      *)
    and functor_parameter =
    1. | Unit
      (*

      ()

      *)
    2. | Named of string option Asttypes.loc * module_type
      (*

      Named(name, MT) represents:

      • (X : MT) when name is Some X,
      • (_ : MT) when name is None
      *)
    and signature = signature_item list
    and signature_item = {
    1. psig_desc : signature_item_desc;
    2. psig_loc : Location.t;
    }
    and signature_item_desc =
    1. | Psig_value of value_description
      (*
      • val x: T
      • external x: T = "s1" ... "sn"
      *)
    2. | Psig_type of Asttypes.rec_flag * type_declaration list
      (*

      type t1 = ... and ... and tn = ...

      *)
    3. | Psig_typesubst of type_declaration list
      (*

      type t1 := ... and ... and tn := ...

      *)
    4. | Psig_typext of type_extension
      (*

      type t1 += ...

      *)
    5. | Psig_exception of type_exception
      (*

      exception C of T

      *)
    6. | Psig_module of module_declaration
      (*

      module X = M and module X : MT

      *)
    7. | Psig_modsubst of module_substitution
      (*

      module X := M

      *)
    8. | Psig_recmodule of module_declaration list
      (*

      module rec X1 : MT1 and ... and Xn : MTn

      *)
    9. | Psig_modtype of module_type_declaration
      (*

      module type S = MT and module type S

      *)
    10. | Psig_modtypesubst of module_type_declaration
      (*

      module type S := ...

      *)
    11. | Psig_open of open_description
      (*

      open X

      *)
    12. | Psig_include of include_description
      (*

      include MT

      *)
    13. | Psig_class of class_description list
      (*

      class c1 : ... and ... and cn : ...

      *)
    14. | Psig_class_type of class_type_declaration list
      (*

      class type ct1 = ... and ... and ctn = ...

      *)
    15. | Psig_attribute of attribute
      (*

      [\@\@\@id]

      *)
    16. | Psig_extension of extension * attributes
      (*

      [%%id]

      *)
    and module_declaration = {
    1. pmd_name : string option Asttypes.loc;
    2. pmd_type : module_type;
    3. pmd_attributes : attributes;
      (*

      ... [\@\@id1] [\@\@id2]

      *)
    4. pmd_loc : Location.t;
    }

    Values of type module_declaration represents S : MT

    and module_substitution = {
    1. pms_name : string Asttypes.loc;
    2. pms_manifest : Longident.t Asttypes.loc;
    3. pms_attributes : attributes;
      (*

      ... [\@\@id1] [\@\@id2]

      *)
    4. pms_loc : Location.t;
    }

    Values of type module_substitution represents S := M

    and module_type_declaration = {
    1. pmtd_name : string Asttypes.loc;
    2. pmtd_type : module_type option;
    3. pmtd_attributes : attributes;
      (*

      ... [\@\@id1] [\@\@id2]

      *)
    4. pmtd_loc : Location.t;
    }

    Values of type module_type_declaration represents:

    • S = MT,
    • S for abstract module type declaration, when pmtd_type is None.
    and 'a open_infos = {
    1. popen_expr : 'a;
    2. popen_override : Asttypes.override_flag;
    3. popen_loc : Location.t;
    4. popen_attributes : attributes;
    }

    Values of type 'a open_infos represents:

    and open_description = Longident.t Asttypes.loc open_infos

    Values of type open_description represents:

    • open M.N
    • open M(N).O
    and open_declaration = module_expr open_infos

    Values of type open_declaration represents:

    • open M.N
    • open M(N).O
    • open struct ... end
    and 'a include_infos = {
    1. pincl_mod : 'a;
    2. pincl_loc : Location.t;
    3. pincl_attributes : attributes;
    }
    and include_description = module_type include_infos

    Values of type include_description represents include MT

    and include_declaration = module_expr include_infos

    Values of type include_declaration represents include ME

    and with_constraint =
    1. | Pwith_type of Longident.t Asttypes.loc * type_declaration
      (*

      with type X.t = ...

      Note: the last component of the longident must match the name of the type_declaration.

      *)
    2. | Pwith_module of Longident.t Asttypes.loc * Longident.t Asttypes.loc
      (*

      with module X.Y = Z

      *)
    3. | Pwith_modtype of Longident.t Asttypes.loc * module_type
      (*

      with module type X.Y = Z

      *)
    4. | Pwith_modtypesubst of Longident.t Asttypes.loc * module_type
      (*

      with module type X.Y := sig end

      *)
    5. | Pwith_typesubst of Longident.t Asttypes.loc * type_declaration
      (*

      with type X.t := ..., same format as [Pwith_type]

      *)
    6. | Pwith_modsubst of Longident.t Asttypes.loc * Longident.t Asttypes.loc
      (*

      with module X.Y := Z

      *)

    Value expressions for the module language

    and module_expr = {
    1. pmod_desc : module_expr_desc;
    2. pmod_loc : Location.t;
    3. pmod_attributes : attributes;
      (*

      ... [\@id1] [\@id2]

      *)
    }
    and module_expr_desc =
    1. | Pmod_ident of Longident.t Asttypes.loc
      (*

      X

      *)
    2. | Pmod_structure of structure
      (*

      struct ... end

      *)
    3. | Pmod_functor of functor_parameter * module_expr
      (*

      functor(X : MT1) -> ME

      *)
    4. | Pmod_apply of module_expr * module_expr
      (*

      ME1(ME2)

      *)
    5. | Pmod_apply_unit of module_expr
      (*

      ME1()

      *)
    6. | Pmod_constraint of module_expr * module_type
      (*

      (ME : MT)

      *)
    7. | Pmod_unpack of expression
      (*

      (val E)

      *)
    8. | Pmod_extension of extension
      (*

      [%id]

      *)
    and structure = structure_item list
    and structure_item = {
    1. pstr_desc : structure_item_desc;
    2. pstr_loc : Location.t;
    }
    and structure_item_desc =
    1. | Pstr_eval of expression * attributes
      (*

      E

      *)
    2. | Pstr_value of Asttypes.rec_flag * value_binding list
      (*

      Pstr_value(rec, [(P1, E1 ; ... ; (Pn, En))]) represents:

      • let P1 = E1 and ... and Pn = EN when rec is Nonrecursive,
      • let rec P1 = E1 and ... and Pn = EN when rec is Recursive.
      *)
    3. | Pstr_primitive of value_description
      (*
      • val x: T
      • external x: T = "s1" ... "sn"
      *)
    4. | Pstr_type of Asttypes.rec_flag * type_declaration list
      (*

      type t1 = ... and ... and tn = ...

      *)
    5. | Pstr_typext of type_extension
      (*

      type t1 += ...

      *)
    6. | Pstr_exception of type_exception
      (*
      • exception C of T
      • exception C = M.X
      *)
    7. | Pstr_module of module_binding
      (*

      module X = ME

      *)
    8. | Pstr_recmodule of module_binding list
      (*

      module rec X1 = ME1 and ... and Xn = MEn

      *)
    9. | Pstr_modtype of module_type_declaration
      (*

      module type S = MT

      *)
    10. | Pstr_open of open_declaration
      (*

      open X

      *)
    11. | Pstr_class of class_declaration list
      (*

      class c1 = ... and ... and cn = ...

      *)
    12. | Pstr_class_type of class_type_declaration list
      (*

      class type ct1 = ... and ... and ctn = ...

      *)
    13. | Pstr_include of include_declaration
      (*

      include ME

      *)
    14. | Pstr_attribute of attribute
      (*

      [\@\@\@id]

      *)
    15. | Pstr_extension of extension * attributes
      (*

      [%%id]

      *)
    and value_constraint =
    1. | Pvc_constraint of {
      1. locally_abstract_univars : string Asttypes.loc list;
      2. typ : core_type;
      }
    2. | Pvc_coercion of {
      1. ground : core_type option;
      2. coercion : core_type;
      }
      (*
      • Pvc_constraint { locally_abstract_univars=[]; typ} is a simple type constraint on a value binding: let x : typ
      • More generally, in Pvc_constraint { locally_abstract_univars; typ} locally_abstract_univars is the list of locally abstract type variables in let x: type a ... . typ
      • Pvc_coercion { ground=None; coercion } represents let x :> typ
      • Pvc_coercion { ground=Some g; coercion } represents let x : g :> typ
      *)
    and value_binding = {
    1. pvb_pat : pattern;
    2. pvb_expr : expression;
    3. pvb_constraint : value_constraint option;
    4. pvb_attributes : attributes;
    5. pvb_loc : Location.t;
    }

    let pat : type_constraint = exp

    and module_binding = {
    1. pmb_name : string option Asttypes.loc;
    2. pmb_expr : module_expr;
    3. pmb_attributes : attributes;
    4. pmb_loc : Location.t;
    }

    Values of type module_binding represents module X = ME

    Toplevel

    Toplevel phrases

    type toplevel_phrase =
    1. | Ptop_def of structure
    2. | Ptop_dir of toplevel_directive
      (*

      #use, #load ...

      *)
    and toplevel_directive = {
    1. pdir_name : string Asttypes.loc;
    2. pdir_arg : directive_argument option;
    3. pdir_loc : Location.t;
    }
    and directive_argument = {
    1. pdira_desc : directive_argument_desc;
    2. pdira_loc : Location.t;
    }
    and directive_argument_desc =
    1. | Pdir_string of string
    2. | Pdir_int of string * char option
    3. | Pdir_ident of Longident.t
    4. | Pdir_bool of bool
    diff --git a/ocaml/Pass_wrapper/index.html b/ocaml/Pass_wrapper/index.html new file mode 100644 index 0000000..5da5804 --- /dev/null +++ b/ocaml/Pass_wrapper/index.html @@ -0,0 +1,9 @@ + +Pass_wrapper (ocaml.Pass_wrapper)

    Module Pass_wrapper

    val register : pass_name:string -> unit
    val with_dump : + ppf_dump:Stdlib.Format.formatter -> + pass_name:string -> + f:(unit -> 'b option) -> + input:'a -> + print_input:(Stdlib.Format.formatter -> 'a -> unit) -> + print_output:(Stdlib.Format.formatter -> 'b -> unit) -> + 'b option
    diff --git a/ocaml/Path/Map/index.html b/ocaml/Path/Map/index.html new file mode 100644 index 0000000..c7484a2 --- /dev/null +++ b/ocaml/Path/Map/index.html @@ -0,0 +1,8 @@ + +Map (ocaml.Path.Map)

    Module Path.Map

    Maps

    type key = t

    The type of the map keys.

    type !+'a t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key -> 'a -> 'a t -> 'a t

    add key data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key -> 'a -> 'a list t -> 'a list t

    add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

    update key f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : (key -> bool) -> 'a t -> key * 'a

    find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : (key -> bool) -> 'a t -> key * 'a

    find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : (key -> 'a -> unit) -> 'a t -> unit

    iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

    fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : (key -> 'a -> bool) -> 'a t -> 'a t

    filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : (key -> 'a -> bool) -> 'a t -> bool

    for_all f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : (key -> 'a -> bool) -> 'a t -> bool

    exists f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val of_list : (key * 'a) list -> 'a t

    of_list bs adds the bindings of bs to the empty map, in list order (if a key is bound twice in bs the last one takes over).

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    diff --git a/ocaml/Path/Set/index.html b/ocaml/Path/Set/index.html new file mode 100644 index 0000000..8a3322d --- /dev/null +++ b/ocaml/Path/Set/index.html @@ -0,0 +1,2 @@ + +Set (ocaml.Path.Set)

    Module Path.Set

    Sets

    type elt = t

    The type of the set elements.

    type t

    The type of sets.

    val empty : t

    The empty set.

    val add : elt -> t -> t

    add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val singleton : elt -> t

    singleton x returns the one-element set containing only x.

    val remove : elt -> t -> t

    remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val union : t -> t -> t

    Set union.

    val inter : t -> t -> t

    Set intersection.

    val disjoint : t -> t -> bool

    Test if two sets are disjoint.

    • since 4.08
    val diff : t -> t -> t

    Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

    val cardinal : t -> int

    Return the number of elements of a set.

    Elements

    val elements : t -> elt list

    Return the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Set.Make.

    val min_elt : t -> elt

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

    val min_elt_opt : t -> elt option

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

    • since 4.05
    val max_elt : t -> elt

    Same as min_elt, but returns the largest element of the given set.

    val max_elt_opt : t -> elt option

    Same as min_elt_opt, but returns the largest element of the given set.

    • since 4.05
    val choose : t -> elt

    Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    val choose_opt : t -> elt option

    Return one element of the given set, or None if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    • since 4.05

    Searching

    val find : elt -> t -> elt

    find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

    • since 4.01
    val find_opt : elt -> t -> elt option

    find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

    • since 4.05
    val find_first : (elt -> bool) -> t -> elt

    find_first f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

    For example, find_first (fun e -> Ord.compare e x >= 0) s will return the first element e of s where Ord.compare e x >= 0 (intuitively: e >= x), or raise Not_found if x is greater than any element of s.

    • since 4.05
    val find_first_opt : (elt -> bool) -> t -> elt option

    find_first_opt f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

    • since 4.05
    val find_last : (elt -> bool) -> t -> elt

    find_last f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

    • since 4.05
    val find_last_opt : (elt -> bool) -> t -> elt option

    find_last_opt f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

    • since 4.05

    Traversing

    val iter : (elt -> unit) -> t -> unit

    iter f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.

    val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc

    fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

    Transforming

    val map : (elt -> elt) -> t -> t

    map f s is the set whose elements are f a0,f a1... f aN, where a0,a1...aN are the elements of s.

    The elements are passed to f in increasing order with respect to the ordering over the type of the elements.

    If no element of s is changed by f, s is returned unchanged. (If each output of f is physically equal to its input, the returned set is physically equal to s.)

    • since 4.04
    val filter : (elt -> bool) -> t -> t

    filter f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val filter_map : (elt -> elt option) -> t -> t

    filter_map f s returns the set of all v such that f x = Some v for some element x of s.

    For example,

    filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) s

    is the set of halves of the even elements of s.

    If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned unchanged: the result of the function is then physically equal to s.

    • since 4.11
    val partition : (elt -> bool) -> t -> t * t

    partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

    val split : elt -> t -> t * bool * t

    split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.

    Predicates and comparisons

    val is_empty : t -> bool

    Test whether a set is empty or not.

    val mem : elt -> t -> bool

    mem x s tests whether x belongs to the set s.

    val equal : t -> t -> bool

    equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

    val compare : t -> t -> int

    Total ordering between sets. Can be used as the ordering function for doing sets of sets.

    val subset : t -> t -> bool

    subset s1 s2 tests whether the set s1 is a subset of the set s2.

    val for_all : (elt -> bool) -> t -> bool

    for_all f s checks if all elements of the set satisfy the predicate f.

    val exists : (elt -> bool) -> t -> bool

    exists f s checks if at least one element of the set satisfies the predicate f.

    Converting

    val to_list : t -> elt list

    to_list s is elements s.

    • since 5.1
    val of_list : elt list -> t

    of_list l creates a set from a list of elements. This is usually more efficient than folding add over the list, except perhaps for lists with many duplicated elements.

    • since 4.02
    val to_seq_from : elt -> t -> elt Seq.t

    to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

    • since 4.07
    val to_seq : t -> elt Seq.t

    Iterate on the whole set, in ascending order

    • since 4.07
    val to_rev_seq : t -> elt Seq.t

    Iterate on the whole set, in descending order

    • since 4.12
    val add_seq : elt Seq.t -> t -> t

    Add the given elements to the set, in order.

    • since 4.07
    val of_seq : elt Seq.t -> t

    Build a set from the given bindings

    • since 4.07
    diff --git a/ocaml/Path/index.html b/ocaml/Path/index.html new file mode 100644 index 0000000..1d098f1 --- /dev/null +++ b/ocaml/Path/index.html @@ -0,0 +1,2 @@ + +Path (ocaml.Path)

    Module Path

    type t =
    1. | Pident of Ident.t
      (*

      Examples: x, List, int

      *)
    2. | Pdot of t * string
      (*

      Examples: List.map, Float.Array

      *)
    3. | Papply of t * t
      (*

      Examples: Set.Make(Int), Map.Make(Set.Make(Int))

      *)
    4. | Pextra_ty of t * extra_ty
      (*

      Pextra_ty (p, extra) are additional paths of types introduced by specific OCaml constructs. See below.

      *)
    and extra_ty =
    1. | Pcstr_ty of string
      (*

      Pextra_ty (p, Pcstr_ty c) is the type of the inline record for constructor c inside type p.

      For example, in

        type 'a t = Nil | Cons of {hd : 'a; tl : 'a t}

      The inline record type {hd : 'a; tl : 'a t} cannot be named by the user in the surface syntax, but internally it has the path Pextra_ty (Pident `t`, Pcstr_ty "Cons").

      *)
    2. | Pext_ty
      (*

      Pextra_ty (p, Pext_ty) is the type of the inline record for the extension constructor p.

      For example, in

        type exn += Error of {loc : loc; msg : string}

      The inline record type {loc : loc; msg : string} cannot be named by the user in the surface syntax, but internally it has the path Pextra_ty (Pident `Error`, Pext_ty).

      *)
    val same : t -> t -> bool
    val compare : t -> t -> int
    val compare_extra : extra_ty -> extra_ty -> int
    val find_free_opt : Ident.t list -> t -> Ident.t option
    val exists_free : Ident.t list -> t -> bool
    val scope : t -> int
    val flatten : t -> [ `Contains_apply | `Ok of Ident.t * string list ]
    val name : ?paren:(string -> bool) -> t -> string
    val head : t -> Ident.t
    val print : Stdlib.Format.formatter -> t -> unit
    val heads : t -> Ident.t list
    val last : t -> string
    val is_constructor_typath : t -> bool
    module Map : Map.S with type key = t
    module Set : Set.S with type elt = t
    diff --git a/ocaml/Patterns/General/index.html b/ocaml/Patterns/General/index.html new file mode 100644 index 0000000..441a3b0 --- /dev/null +++ b/ocaml/Patterns/General/index.html @@ -0,0 +1,2 @@ + +General (ocaml.Patterns.General)

    Module Patterns.General

    type view = [
    1. | Half_simple.view
    2. | `Var of Ident.t * string Asttypes.loc * Types.Uid.t
    3. | `Alias of Typedtree.pattern * Ident.t * string Asttypes.loc * Types.Uid.t
    ]
    val strip_vars : pattern -> Half_simple.pattern
    diff --git a/ocaml/Patterns/Half_simple/index.html b/ocaml/Patterns/Half_simple/index.html new file mode 100644 index 0000000..e810442 --- /dev/null +++ b/ocaml/Patterns/Half_simple/index.html @@ -0,0 +1,2 @@ + +Half_simple (ocaml.Patterns.Half_simple)

    Module Patterns.Half_simple

    type view = [
    1. | Simple.view
    2. | `Or of Typedtree.pattern * Typedtree.pattern * Types.row_desc option
    ]
    diff --git a/ocaml/Patterns/Head/index.html b/ocaml/Patterns/Head/index.html new file mode 100644 index 0000000..5be0807 --- /dev/null +++ b/ocaml/Patterns/Head/index.html @@ -0,0 +1,2 @@ + +Head (ocaml.Patterns.Head)

    Module Patterns.Head

    type desc =
    1. | Any
    2. | Construct of Types.constructor_description
    3. | Constant of Asttypes.constant
    4. | Tuple of int
    5. | Record of Types.label_description list
    6. | Variant of {
      1. tag : Asttypes.label;
      2. has_arg : bool;
      3. cstr_row : Types.row_desc ref;
      4. type_row : unit -> Types.row_desc;
      }
    7. | Array of int
    8. | Lazy
    val arity : t -> int
    val deconstruct : Simple.pattern -> t * Typedtree.pattern list

    deconstruct p returns the head of p and the list of sub patterns.

    • raises [Invalid_arg

      _] if p is an or- or an exception-pattern.

    val to_omega_pattern : t -> Typedtree.pattern

    reconstructs a pattern, putting wildcards as sub-patterns.

    val omega : t
    diff --git a/ocaml/Patterns/Non_empty_row/index.html b/ocaml/Patterns/Non_empty_row/index.html new file mode 100644 index 0000000..3283ce5 --- /dev/null +++ b/ocaml/Patterns/Non_empty_row/index.html @@ -0,0 +1,2 @@ + +Non_empty_row (ocaml.Patterns.Non_empty_row)

    Module Patterns.Non_empty_row

    type 'a t = 'a * Typedtree.pattern list
    val of_initial : Typedtree.pattern list -> Typedtree.pattern t

    'assert false' on empty rows

    val map_first : ('a -> 'b) -> 'a t -> 'b t
    diff --git a/ocaml/Patterns/Simple/index.html b/ocaml/Patterns/Simple/index.html new file mode 100644 index 0000000..3d3a0db --- /dev/null +++ b/ocaml/Patterns/Simple/index.html @@ -0,0 +1,7 @@ + +Simple (ocaml.Patterns.Simple)

    Module Patterns.Simple

    val omega : [> view ] Typedtree.pattern_data
    diff --git a/ocaml/Patterns/index.html b/ocaml/Patterns/index.html new file mode 100644 index 0000000..dcaef59 --- /dev/null +++ b/ocaml/Patterns/index.html @@ -0,0 +1,2 @@ + +Patterns (ocaml.Patterns)

    Module Patterns

    val omega : Typedtree.pattern

    aka. "Tpat_any" or "_"

    val omegas : int -> Typedtree.pattern list

    List.init (fun _ -> omega)

    val omega_list : 'a list -> Typedtree.pattern list

    List.map (fun _ -> omega)

    module Non_empty_row : sig ... end
    module Simple : sig ... end
    module Half_simple : sig ... end
    module General : sig ... end
    module Head : sig ... end
    diff --git a/ocaml/Persistent_env/Consistbl/index.html b/ocaml/Persistent_env/Consistbl/index.html new file mode 100644 index 0000000..881df70 --- /dev/null +++ b/ocaml/Persistent_env/Consistbl/index.html @@ -0,0 +1,18 @@ + +Consistbl (ocaml.Persistent_env.Consistbl)

    Module Persistent_env.Consistbl

    val create : unit -> t
    val clear : t -> unit
    val check : + t -> + Misc.Stdlib.String.t -> + Stdlib.Digest.t -> + Misc.filepath -> + unit
    val check_noadd : + t -> + Misc.Stdlib.String.t -> + Stdlib.Digest.t -> + Misc.filepath -> + unit
    val extract : + Misc.Stdlib.String.t list -> + t -> + (Misc.Stdlib.String.t * Stdlib.Digest.t option) list
    val filter : (Misc.Stdlib.String.t -> bool) -> t -> unit
    exception Inconsistency of {
    1. unit_name : Misc.Stdlib.String.t;
    2. inconsistent_source : string;
    3. original_source : string;
    }
    exception Not_available of Misc.Stdlib.String.t
    diff --git a/ocaml/Persistent_env/Persistent_signature/index.html b/ocaml/Persistent_env/Persistent_signature/index.html new file mode 100644 index 0000000..2d4bfda --- /dev/null +++ b/ocaml/Persistent_env/Persistent_signature/index.html @@ -0,0 +1,2 @@ + +Persistent_signature (ocaml.Persistent_env.Persistent_signature)

    Module Persistent_env.Persistent_signature

    type t = {
    1. filename : string;
      (*

      Name of the file containing the signature.

      *)
    2. cmi : Cmi_format.cmi_infos;
    3. visibility : Load_path.visibility;
    }
    val load : (allow_hidden:bool -> unit_name:string -> t option) ref

    Function used to load a persistent signature. The default is to look for the .cmi file in the load path. This function can be overridden to load it from memory, for instance to build a self-contained toplevel.

    diff --git a/ocaml/Persistent_env/index.html b/ocaml/Persistent_env/index.html new file mode 100644 index 0000000..64e59d5 --- /dev/null +++ b/ocaml/Persistent_env/index.html @@ -0,0 +1,23 @@ + +Persistent_env (ocaml.Persistent_env)

    Module Persistent_env

    module Consistbl : + module type of struct include Consistbl.Make(Misc.Stdlib.String) end
    type error =
    1. | Illegal_renaming of Misc.modname * Misc.modname * Misc.filepath
    2. | Inconsistent_import of Misc.modname * Misc.filepath * Misc.filepath
    3. | Need_recursive_types of Misc.modname
    exception Error of error
    val report_error : Stdlib.Format.formatter -> error -> unit
    module Persistent_signature : sig ... end
    type can_load_cmis =
    1. | Can_load_cmis
    2. | Cannot_load_cmis of Lazy_backtrack.log
    type 'a t
    val empty : unit -> 'a t
    val clear : 'a t -> unit
    val clear_missing : 'a t -> unit
    val fold : 'a t -> (Misc.modname -> 'a -> 'b -> 'b) -> 'b -> 'b
    val read : 'a t -> (Persistent_signature.t -> 'a) -> Unit_info.Artifact.t -> 'a
    val find : + allow_hidden:bool -> + 'a t -> + (Persistent_signature.t -> 'a) -> + Misc.modname -> + 'a
    val find_in_cache : 'a t -> Misc.modname -> 'a option
    val check : + allow_hidden:bool -> + 'a t -> + (Persistent_signature.t -> 'a) -> + loc:Location.t -> + Misc.modname -> + unit
    val looked_up : 'a t -> Misc.modname -> bool
    val is_imported : 'a t -> Misc.modname -> bool
    val is_imported_opaque : 'a t -> Misc.modname -> bool
    val register_import_as_opaque : 'a t -> Misc.modname -> unit
    val make_cmi : + 'a t -> + Misc.modname -> + Types.signature -> + Misc.alerts -> + Cmi_format.cmi_infos
    val save_cmi : 'a t -> Persistent_signature.t -> 'a -> unit
    val can_load_cmis : 'a t -> can_load_cmis
    val set_can_load_cmis : 'a t -> can_load_cmis -> unit
    val without_cmis : 'a t -> ('b -> 'c) -> 'b -> 'c
    val import_crcs : 'a t -> source:Misc.filepath -> Misc.crcs -> unit
    val imports : 'a t -> Misc.crcs
    val crc_of_unit : + 'a t -> + (Persistent_signature.t -> 'a) -> + Misc.modname -> + Stdlib.Digest.t
    val add_delayed_check_forward : ((unit -> unit) -> unit) ref
    diff --git a/ocaml/Polling/index.html b/ocaml/Polling/index.html new file mode 100644 index 0000000..51e6a0d --- /dev/null +++ b/ocaml/Polling/index.html @@ -0,0 +1,9 @@ + +Polling (ocaml.Polling)

    Module Polling

    Analyses related to the insertion of Ipoll operations.

    val instrument_fundecl : + future_funcnames:Misc.Stdlib.String.Set.t -> + Mach.fundecl -> + Mach.fundecl
    val requires_prologue_poll : + future_funcnames:Misc.Stdlib.String.Set.t -> + fun_name:string -> + Mach.instruction -> + bool
    diff --git a/ocaml/Pparse/index.html b/ocaml/Pparse/index.html new file mode 100644 index 0000000..b72e955 --- /dev/null +++ b/ocaml/Pparse/index.html @@ -0,0 +1,20 @@ + +Pparse (ocaml.Pparse)

    Module Pparse

    Driver for the parser and external preprocessors.

    Warning: this module is unstable and part of compiler-libs.

    type error =
    1. | CannotRun of string
    2. | WrongMagic of string
    exception Error of error
    val preprocess : string -> string
    val remove_preprocessed : string -> unit
    type 'a ast_kind =
    1. | Structure : Parsetree.structure ast_kind
    2. | Signature : Parsetree.signature ast_kind
    val read_ast : 'a ast_kind -> string -> 'a
    val write_ast : 'a ast_kind -> string -> 'a -> unit
    val file : + tool_name:string -> + string -> + (Stdlib.Lexing.lexbuf -> 'a) -> + 'a ast_kind -> + 'a
    val apply_rewriters : + ?restore:bool -> + tool_name:string -> + 'a ast_kind -> + 'a -> + 'a

    If restore = true (the default), cookies set by external rewriters will be kept for later calls.

    val apply_rewriters_str : + ?restore:bool -> + tool_name:string -> + Parsetree.structure -> + Parsetree.structure
    val apply_rewriters_sig : + ?restore:bool -> + tool_name:string -> + Parsetree.signature -> + Parsetree.signature
    val report_error : Stdlib.Format.formatter -> error -> unit
    val parse_implementation : tool_name:string -> string -> Parsetree.structure
    val parse_interface : tool_name:string -> string -> Parsetree.signature
    val call_external_preprocessor : string -> string -> string
    val open_and_check_magic : string -> string -> in_channel * bool
    diff --git a/ocaml/Pprintast/index.html b/ocaml/Pprintast/index.html new file mode 100644 index 0000000..6f443a0 --- /dev/null +++ b/ocaml/Pprintast/index.html @@ -0,0 +1,14 @@ + +Pprintast (ocaml.Pprintast)

    Module Pprintast

    Pretty-printers for Parsetree

    Warning: this module is unstable and part of compiler-libs.

    type space_formatter = (unit, Stdlib.Format.formatter, unit) format
    val longident : Stdlib.Format.formatter -> Longident.t -> unit
    val expression : Stdlib.Format.formatter -> Parsetree.expression -> unit
    val string_of_expression : Parsetree.expression -> string
    val core_type : Stdlib.Format.formatter -> Parsetree.core_type -> unit
    val signature : Stdlib.Format.formatter -> Parsetree.signature -> unit
    val structure : Stdlib.Format.formatter -> Parsetree.structure -> unit
    val string_of_structure : Parsetree.structure -> string
    val module_expr : Stdlib.Format.formatter -> Parsetree.module_expr -> unit
    val toplevel_phrase : + Stdlib.Format.formatter -> + Parsetree.toplevel_phrase -> + unit
    val class_field : Stdlib.Format.formatter -> Parsetree.class_field -> unit
    val class_type_field : + Stdlib.Format.formatter -> + Parsetree.class_type_field -> + unit
    val class_expr : Stdlib.Format.formatter -> Parsetree.class_expr -> unit
    val class_type : Stdlib.Format.formatter -> Parsetree.class_type -> unit
    val module_type : Stdlib.Format.formatter -> Parsetree.module_type -> unit
    val structure_item : + Stdlib.Format.formatter -> + Parsetree.structure_item -> + unit
    val signature_item : + Stdlib.Format.formatter -> + Parsetree.signature_item -> + unit
    val tyvar_of_name : string -> string

    Turn a type variable name into a valid identifier, taking care of the special treatment required for the single quote character in second position, or for keywords by escaping them with \#. No-op on "_".

    val tyvar : Stdlib.Format.formatter -> string -> unit

    Print a type variable name as a valid identifier, taking care of the special treatment required for the single quote character in second position, or for keywords by escaping them with \#. No-op on "_".

    diff --git a/ocaml/Predef/index.html b/ocaml/Predef/index.html new file mode 100644 index 0000000..4173712 --- /dev/null +++ b/ocaml/Predef/index.html @@ -0,0 +1,6 @@ + +Predef (ocaml.Predef)

    Module Predef

    val type_int : Types.type_expr
    val type_char : Types.type_expr
    val type_string : Types.type_expr
    val type_bytes : Types.type_expr
    val type_float : Types.type_expr
    val type_bool : Types.type_expr
    val type_unit : Types.type_expr
    val type_exn : Types.type_expr
    val type_array : Types.type_expr -> Types.type_expr
    val type_list : Types.type_expr -> Types.type_expr
    val type_option : Types.type_expr -> Types.type_expr
    val type_nativeint : Types.type_expr
    val type_int32 : Types.type_expr
    val type_int64 : Types.type_expr
    val type_lazy_t : Types.type_expr -> Types.type_expr
    val type_extension_constructor : Types.type_expr
    val type_floatarray : Types.type_expr
    val path_int : Path.t
    val path_char : Path.t
    val path_string : Path.t
    val path_bytes : Path.t
    val path_float : Path.t
    val path_bool : Path.t
    val path_unit : Path.t
    val path_exn : Path.t
    val path_array : Path.t
    val path_list : Path.t
    val path_option : Path.t
    val path_nativeint : Path.t
    val path_int32 : Path.t
    val path_int64 : Path.t
    val path_lazy_t : Path.t
    val path_extension_constructor : Path.t
    val path_floatarray : Path.t
    val path_match_failure : Path.t
    val path_assert_failure : Path.t
    val path_undefined_recursive_module : Path.t
    val ident_false : Ident.t
    val ident_true : Ident.t
    val ident_void : Ident.t
    val ident_nil : Ident.t
    val ident_cons : Ident.t
    val ident_none : Ident.t
    val ident_some : Ident.t
    val build_initial_env : + (Ident.t -> Types.type_declaration -> 'a -> 'a) -> + (Ident.t -> Types.extension_constructor -> 'a -> 'a) -> + 'a -> + 'a
    val builtin_values : (string * Ident.t) list
    val builtin_idents : (string * Ident.t) list
    val ident_division_by_zero : Ident.t

    All predefined exceptions, exposed as Ident.t for flambda (for building value approximations). The Ident.t for division by zero is also exported explicitly so flambda can generate code to raise it.

    val all_predef_exns : Ident.t list
    diff --git a/ocaml/Primitive/index.html b/ocaml/Primitive/index.html new file mode 100644 index 0000000..b3e1ecf --- /dev/null +++ b/ocaml/Primitive/index.html @@ -0,0 +1,12 @@ + +Primitive (ocaml.Primitive)

    Module Primitive

    type boxed_integer =
    1. | Pnativeint
    2. | Pint32
    3. | Pint64
    type native_repr =
    1. | Same_as_ocaml_repr
    2. | Unboxed_float
    3. | Unboxed_integer of boxed_integer
    4. | Untagged_immediate
    type description = private {
    1. prim_name : string;
    2. prim_arity : int;
    3. prim_alloc : bool;
    4. prim_native_name : string;
    5. prim_native_repr_args : native_repr list;
    6. prim_native_repr_res : native_repr;
    }
    val simple : name:string -> arity:int -> alloc:bool -> description
    val make : + name:string -> + alloc:bool -> + native_name:string -> + native_repr_args:native_repr list -> + native_repr_res:native_repr -> + description
    val parse_declaration : + Parsetree.value_description -> + native_repr_args:native_repr list -> + native_repr_res:native_repr -> + description
    val native_name : description -> string
    val byte_name : description -> string
    val equal_boxed_integer : boxed_integer -> boxed_integer -> bool
    val equal_native_repr : native_repr -> native_repr -> bool
    val native_name_is_external : description -> bool

    native_name_is_externa returns true iff the native_name for the given primitive identifies that the primitive is not implemented in the compiler itself.

    type error =
    1. | Old_style_float_with_native_repr_attribute
    2. | Old_style_noalloc_with_noalloc_attribute
    3. | No_native_primitive_with_repr_attribute
    exception Error of Location.t * error
    diff --git a/ocaml/Printast/index.html b/ocaml/Printast/index.html new file mode 100644 index 0000000..fa35c60 --- /dev/null +++ b/ocaml/Printast/index.html @@ -0,0 +1,8 @@ + +Printast (ocaml.Printast)

    Module Printast

    Raw printer for Parsetree

    Warning: this module is unstable and part of compiler-libs.

    val interface : + Stdlib.Format.formatter -> + Parsetree.signature_item list -> + unit
    val implementation : + Stdlib.Format.formatter -> + Parsetree.structure_item list -> + unit
    val expression : int -> Stdlib.Format.formatter -> Parsetree.expression -> unit
    val structure : int -> Stdlib.Format.formatter -> Parsetree.structure -> unit
    val payload : int -> Stdlib.Format.formatter -> Parsetree.payload -> unit
    diff --git a/ocaml/Printclambda/index.html b/ocaml/Printclambda/index.html new file mode 100644 index 0000000..b169adc --- /dev/null +++ b/ocaml/Printclambda/index.html @@ -0,0 +1,8 @@ + +Printclambda (ocaml.Printclambda)

    Module Printclambda

    val clambda : Stdlib.Format.formatter -> Clambda.ulambda -> unit
    val structured_constant : + Stdlib.Format.formatter -> + Clambda.ustructured_constant -> + unit
    val phantom_defining_expr_opt : + Stdlib.Format.formatter -> + Clambda.uphantom_defining_expr option -> + unit
    diff --git a/ocaml/Printclambda_primitives/index.html b/ocaml/Printclambda_primitives/index.html new file mode 100644 index 0000000..1b64927 --- /dev/null +++ b/ocaml/Printclambda_primitives/index.html @@ -0,0 +1,2 @@ + +Printclambda_primitives (ocaml.Printclambda_primitives)

    Module Printclambda_primitives

    diff --git a/ocaml/Printcmm/index.html b/ocaml/Printcmm/index.html new file mode 100644 index 0000000..a9879aa --- /dev/null +++ b/ocaml/Printcmm/index.html @@ -0,0 +1,8 @@ + +Printcmm (ocaml.Printcmm)

    Module Printcmm

    val rec_flag : Stdlib.Format.formatter -> Cmm.rec_flag -> unit
    val machtype_component : + Stdlib.Format.formatter -> + Cmm.machtype_component -> + unit
    val machtype : Stdlib.Format.formatter -> Cmm.machtype -> unit
    val exttype : Stdlib.Format.formatter -> Cmm.exttype -> unit
    val extcall_signature : + Stdlib.Format.formatter -> + (Cmm.machtype * Cmm.exttype list) -> + unit
    val integer_comparison : Cmm.integer_comparison -> string
    val float_comparison : Cmm.float_comparison -> string
    val chunk : Cmm.memory_chunk -> string
    val operation : Debuginfo.t -> Cmm.operation -> string
    val expression : Stdlib.Format.formatter -> Cmm.expression -> unit
    val fundecl : Stdlib.Format.formatter -> Cmm.fundecl -> unit
    val data : Stdlib.Format.formatter -> Cmm.data_item list -> unit
    val phrase : Stdlib.Format.formatter -> Cmm.phrase -> unit
    diff --git a/ocaml/Printinstr/index.html b/ocaml/Printinstr/index.html new file mode 100644 index 0000000..44343bc --- /dev/null +++ b/ocaml/Printinstr/index.html @@ -0,0 +1,2 @@ + +Printinstr (ocaml.Printinstr)

    Module Printinstr

    val instruction : Stdlib.Format.formatter -> Instruct.instruction -> unit
    val instrlist : Stdlib.Format.formatter -> Instruct.instruction list -> unit
    diff --git a/ocaml/Printlambda/index.html b/ocaml/Printlambda/index.html new file mode 100644 index 0000000..30a380f --- /dev/null +++ b/ocaml/Printlambda/index.html @@ -0,0 +1,20 @@ + +Printlambda (ocaml.Printlambda)

    Module Printlambda

    val integer_comparison : + Stdlib.Format.formatter -> + Lambda.integer_comparison -> + unit
    val float_comparison : + Stdlib.Format.formatter -> + Lambda.float_comparison -> + unit
    val structured_constant : + Stdlib.Format.formatter -> + Lambda.structured_constant -> + unit
    val lambda : Stdlib.Format.formatter -> Lambda.lambda -> unit
    val program : Stdlib.Format.formatter -> Lambda.program -> unit
    val primitive : Stdlib.Format.formatter -> Lambda.primitive -> unit
    val name_of_primitive : Lambda.primitive -> string
    val value_kind : Stdlib.Format.formatter -> Lambda.value_kind -> unit
    val block_shape : + Stdlib.Format.formatter -> + Lambda.value_kind list option -> + unit
    val print_bigarray : + string -> + bool -> + Lambda.bigarray_kind -> + Stdlib.Format.formatter -> + Lambda.bigarray_layout -> + unit
    diff --git a/ocaml/Printlinear/index.html b/ocaml/Printlinear/index.html new file mode 100644 index 0000000..81814eb --- /dev/null +++ b/ocaml/Printlinear/index.html @@ -0,0 +1,2 @@ + +Printlinear (ocaml.Printlinear)

    Module Printlinear

    val fundecl : Stdlib.Format.formatter -> Linear.fundecl -> unit
    diff --git a/ocaml/Printmach/index.html b/ocaml/Printmach/index.html new file mode 100644 index 0000000..a54c134 --- /dev/null +++ b/ocaml/Printmach/index.html @@ -0,0 +1,7 @@ + +Printmach (ocaml.Printmach)

    Module Printmach

    val reg : Stdlib.Format.formatter -> Reg.t -> unit
    val regs : Stdlib.Format.formatter -> Reg.t array -> unit
    val regset : Stdlib.Format.formatter -> Reg.Set.t -> unit
    val regsetaddr : Stdlib.Format.formatter -> Reg.Set.t -> unit
    val operation : + Mach.operation -> + Reg.t array -> + Stdlib.Format.formatter -> + Reg.t array -> + unit
    val test : Mach.test -> Stdlib.Format.formatter -> Reg.t array -> unit
    val fundecl : Stdlib.Format.formatter -> Mach.fundecl -> unit
    val phase : string -> Stdlib.Format.formatter -> Mach.fundecl -> unit
    val interferences : Stdlib.Format.formatter -> unit -> unit
    val intervals : Stdlib.Format.formatter -> Interval.result -> unit
    val preferences : Stdlib.Format.formatter -> unit -> unit
    diff --git a/ocaml/Printpat/index.html b/ocaml/Printpat/index.html new file mode 100644 index 0000000..bf8e0e5 --- /dev/null +++ b/ocaml/Printpat/index.html @@ -0,0 +1,14 @@ + +Printpat (ocaml.Printpat)

    Module Printpat

    val pretty_const : Asttypes.constant -> string
    val pretty_val : + Stdlib.Format.formatter -> + 'k Typedtree.general_pattern -> + unit
    val pretty_pat : + Stdlib.Format.formatter -> + 'k Typedtree.general_pattern -> + unit
    val pretty_line : + Stdlib.Format.formatter -> + 'k Typedtree.general_pattern list -> + unit
    val pretty_matrix : + Stdlib.Format.formatter -> + 'k Typedtree.general_pattern list list -> + unit
    diff --git a/ocaml/Printtyp/Conflicts/index.html b/ocaml/Printtyp/Conflicts/index.html new file mode 100644 index 0000000..b225340 --- /dev/null +++ b/ocaml/Printtyp/Conflicts/index.html @@ -0,0 +1,5 @@ + +Conflicts (ocaml.Printtyp.Conflicts)

    Module Printtyp.Conflicts

    The Conflicts module keeps track of conflicts arising when attributing names to identifiers and provides functions that can print explanations for these conflict in error messages

    val exists : unit -> bool

    exists() returns true if the current naming context renamed an identifier to avoid a name collision

    type explanation = {
    1. kind : Shape.Sig_component_kind.t;
    2. name : string;
    3. root_name : string;
    4. location : Location.t;
    }
    val list_explanations : unit -> explanation list

    list_explanations() return the list of conflict explanations collected up to this point, and reset the list of collected explanations

    val print_located_explanations : + Stdlib.Format.formatter -> + explanation list -> + unit
    val print_explanations : Stdlib.Format.formatter -> unit

    Print all conflict explanations collected up to this point

    val reset : unit -> unit
    diff --git a/ocaml/Printtyp/Naming_context/index.html b/ocaml/Printtyp/Naming_context/index.html new file mode 100644 index 0000000..580ed84 --- /dev/null +++ b/ocaml/Printtyp/Naming_context/index.html @@ -0,0 +1,2 @@ + +Naming_context (ocaml.Printtyp.Naming_context)

    Module Printtyp.Naming_context

    val enable : bool -> unit

    When contextual names are enabled, the mapping between identifiers and names is ensured to be one-to-one.

    diff --git a/ocaml/Printtyp/Out_name/index.html b/ocaml/Printtyp/Out_name/index.html new file mode 100644 index 0000000..9685dc7 --- /dev/null +++ b/ocaml/Printtyp/Out_name/index.html @@ -0,0 +1,2 @@ + +Out_name (ocaml.Printtyp.Out_name)

    Module Printtyp.Out_name

    val create : string -> Outcometree.out_name
    val print : Outcometree.out_name -> string
    diff --git a/ocaml/Printtyp/Subtype/index.html b/ocaml/Printtyp/Subtype/index.html new file mode 100644 index 0000000..e522d31 --- /dev/null +++ b/ocaml/Printtyp/Subtype/index.html @@ -0,0 +1,7 @@ + +Subtype (ocaml.Printtyp.Subtype)

    Module Printtyp.Subtype

    val report_error : + Stdlib.Format.formatter -> + Env.t -> + Errortrace.Subtype.error -> + string -> + unit
    diff --git a/ocaml/Printtyp/index.html b/ocaml/Printtyp/index.html new file mode 100644 index 0000000..f8ca4f6 --- /dev/null +++ b/ocaml/Printtyp/index.html @@ -0,0 +1,132 @@ + +Printtyp (ocaml.Printtyp)

    Module Printtyp

    val longident : Stdlib.Format.formatter -> Longident.t -> unit
    val ident : Stdlib.Format.formatter -> Ident.t -> unit
    val namespaced_ident : Shape.Sig_component_kind.t -> Ident.t -> string
    val tree_of_path : Path.t -> Outcometree.out_ident
    val path : Stdlib.Format.formatter -> Path.t -> unit
    val string_of_path : Path.t -> string
    val type_path : Stdlib.Format.formatter -> Path.t -> unit

    Print a type path taking account of -short-paths. Calls should be within wrap_printing_env.

    module Out_name : sig ... end
    type namespace := Shape.Sig_component_kind.t option
    val strings_of_paths : namespace -> Path.t list -> string list

    Print a list of paths, using the same naming context to avoid name collisions

    val raw_type_expr : Stdlib.Format.formatter -> Types.type_expr -> unit
    val string_of_label : Asttypes.arg_label -> string
    val wrap_printing_env : error:bool -> Env.t -> (unit -> 'a) -> 'a
    module Naming_context : sig ... end
    module Conflicts : sig ... end

    The Conflicts module keeps track of conflicts arising when attributing names to identifiers and provides functions that can print explanations for these conflict in error messages

    val reset : unit -> unit
    val type_expr : Stdlib.Format.formatter -> Types.type_expr -> unit

    Print out a type. This will pick names for type variables, and will not reuse names for common type variables shared across multiple type expressions. (It will also reset the printing state, which matters for other type formatters such as prepared_type_expr.) If you want multiple types to use common names for type variables, see prepare_for_printing and prepared_type_expr.

    val prepare_for_printing : Types.type_expr list -> unit

    prepare_for_printing resets the global printing environment, a la reset, and prepares the types for printing by reserving names and marking loops. Any type variables that are shared between multiple types in the input list will be given the same name when printed with prepared_type_expr.

    val add_type_to_preparation : Types.type_expr -> unit

    add_type_to_preparation ty extend a previous type expression preparation to the type expression ty

    val prepared_type_expr : Stdlib.Format.formatter -> Types.type_expr -> unit

    The function prepared_type_expr is a less-safe but more-flexible version of type_expr that should only be called on type_exprs that have been passed to prepare_for_printing. Unlike type_expr, this function does no extra work before printing a type; in particular, this means that any loops in the type expression may cause a stack overflow (see #8860) since this function does not mark any loops. The benefit of this is that if multiple type expressions are prepared simultaneously and then printed with prepared_type_expr, they will use the same names for the same type variables.

    val constructor_arguments : + Stdlib.Format.formatter -> + Types.constructor_arguments -> + unit
    val tree_of_type_scheme : Types.type_expr -> Outcometree.out_type
    val type_scheme : Stdlib.Format.formatter -> Types.type_expr -> unit
    val prepared_type_scheme : Stdlib.Format.formatter -> Types.type_expr -> unit
    val shared_type_scheme : Stdlib.Format.formatter -> Types.type_expr -> unit

    shared_type_scheme is very similar to type_scheme, but does not reset the printing context first. This is intended to be used in cases where the printing should have a particularly wide context, such as documentation generators; most use cases, such as error messages, have narrower contexts for which type_scheme is better suited.

    val tree_of_value_description : + Ident.t -> + Types.value_description -> + Outcometree.out_sig_item
    val value_description : + Ident.t -> + Stdlib.Format.formatter -> + Types.value_description -> + unit
    val add_constructor_to_preparation : Types.constructor_declaration -> unit
    val prepared_constructor : + Stdlib.Format.formatter -> + Types.constructor_declaration -> + unit
    val constructor : + Stdlib.Format.formatter -> + Types.constructor_declaration -> + unit
    val tree_of_type_declaration : + Ident.t -> + Types.type_declaration -> + Types.rec_status -> + Outcometree.out_sig_item
    val add_type_declaration_to_preparation : + Ident.t -> + Types.type_declaration -> + unit
    val prepared_type_declaration : + Ident.t -> + Stdlib.Format.formatter -> + Types.type_declaration -> + unit
    val type_declaration : + Ident.t -> + Stdlib.Format.formatter -> + Types.type_declaration -> + unit
    val tree_of_extension_constructor : + Ident.t -> + Types.extension_constructor -> + Types.ext_status -> + Outcometree.out_sig_item
    val add_extension_constructor_to_preparation : + Types.extension_constructor -> + unit
    val prepared_extension_constructor : + Ident.t -> + Stdlib.Format.formatter -> + Types.extension_constructor -> + unit
    val extension_constructor : + Ident.t -> + Stdlib.Format.formatter -> + Types.extension_constructor -> + unit
    val extension_only_constructor : + Ident.t -> + Stdlib.Format.formatter -> + Types.extension_constructor -> + unit
    val tree_of_module : + Ident.t -> + ?ellipsis:bool -> + Types.module_type -> + Types.rec_status -> + Outcometree.out_sig_item
    val signature : Stdlib.Format.formatter -> Types.signature -> unit
    val tree_of_modtype_declaration : + Ident.t -> + Types.modtype_declaration -> + Outcometree.out_sig_item
    val functor_parameters : + sep:(Stdlib.Format.formatter -> unit -> unit) -> + ('b -> Stdlib.Format.formatter -> unit) -> + (Ident.t option * 'b) list -> + Stdlib.Format.formatter -> + unit

    Print a list of functor parameters while adjusting the printing environment for each functor argument.

    Currently, we are disabling disambiguation for functor argument name to avoid the need to track the moving association between identifiers and syntactic names in situation like:

    got: (X: sig module type T end) (Y:X.T) (X:sig module type T end) (Z:X.T) expect: (_: sig end) (Y:X.T) (_:sig end) (Z:X.T)

    type type_or_scheme =
    1. | Type
    2. | Type_scheme
    val tree_of_signature : Types.signature -> Outcometree.out_sig_item list
    val modtype_declaration : + Ident.t -> + Stdlib.Format.formatter -> + Types.modtype_declaration -> + unit
    val class_type : Stdlib.Format.formatter -> Types.class_type -> unit
    val tree_of_class_declaration : + Ident.t -> + Types.class_declaration -> + Types.rec_status -> + Outcometree.out_sig_item
    val class_declaration : + Ident.t -> + Stdlib.Format.formatter -> + Types.class_declaration -> + unit
    val tree_of_cltype_declaration : + Ident.t -> + Types.class_type_declaration -> + Types.rec_status -> + Outcometree.out_sig_item
    val cltype_declaration : + Ident.t -> + Stdlib.Format.formatter -> + Types.class_type_declaration -> + unit
    val type_expansion : + type_or_scheme -> + Stdlib.Format.formatter -> + Errortrace.expanded_type -> + unit
    val report_ambiguous_type_error : + Stdlib.Format.formatter -> + Env.t -> + (Path.t * Path.t) -> + (Path.t * Path.t) list -> + (Stdlib.Format.formatter -> unit) -> + (Stdlib.Format.formatter -> unit) -> + (Stdlib.Format.formatter -> unit) -> + unit
    val report_unification_error : + Stdlib.Format.formatter -> + Env.t -> + Errortrace.unification_error -> + ?type_expected_explanation:(Stdlib.Format.formatter -> unit) -> + (Stdlib.Format.formatter -> unit) -> + (Stdlib.Format.formatter -> unit) -> + unit
    val report_equality_error : + Stdlib.Format.formatter -> + type_or_scheme -> + Env.t -> + Errortrace.equality_error -> + (Stdlib.Format.formatter -> unit) -> + (Stdlib.Format.formatter -> unit) -> + unit
    val report_moregen_error : + Stdlib.Format.formatter -> + type_or_scheme -> + Env.t -> + Errortrace.moregen_error -> + (Stdlib.Format.formatter -> unit) -> + (Stdlib.Format.formatter -> unit) -> + unit
    val report_comparison_error : + Stdlib.Format.formatter -> + type_or_scheme -> + Env.t -> + Errortrace.comparison_error -> + (Stdlib.Format.formatter -> unit) -> + (Stdlib.Format.formatter -> unit) -> + unit
    module Subtype : sig ... end
    val print_items : + (Env.t -> Types.signature_item -> 'a option) -> + Env.t -> + Types.signature_item list -> + (Outcometree.out_sig_item * 'a option) list
    val rewrite_double_underscore_paths : Env.t -> Path.t -> Path.t
    val printed_signature : + string -> + Stdlib.Format.formatter -> + Types.signature -> + unit

    printed_signature sourcefile ppf sg print the signature sg of sourcefile with potential warnings for name collisions

    diff --git a/ocaml/Printtyped/index.html b/ocaml/Printtyped/index.html new file mode 100644 index 0000000..ff25a3d --- /dev/null +++ b/ocaml/Printtyped/index.html @@ -0,0 +1,5 @@ + +Printtyped (ocaml.Printtyped)

    Module Printtyped

    val interface : Stdlib.Format.formatter -> Typedtree.signature -> unit
    val implementation : Stdlib.Format.formatter -> Typedtree.structure -> unit
    val implementation_with_coercion : + Stdlib.Format.formatter -> + Typedtree.implementation -> + unit
    diff --git a/ocaml/Proc/index.html b/ocaml/Proc/index.html new file mode 100644 index 0000000..f0cd200 --- /dev/null +++ b/ocaml/Proc/index.html @@ -0,0 +1,2 @@ + +Proc (ocaml.Proc)

    Module Proc

    val word_addressed : bool
    val num_register_classes : int
    val register_class : Reg.t -> int
    val num_available_registers : int array
    val first_available_register : int array
    val register_name : int -> string
    val phys_reg : int -> Reg.t
    val rotate_registers : bool
    val loc_arguments : Cmm.machtype -> Reg.t array * int
    val loc_results : Cmm.machtype -> Reg.t array
    val loc_parameters : Cmm.machtype -> Reg.t array
    val loc_external_arguments : Cmm.exttype list -> Reg.t array array * int
    val loc_external_results : Cmm.machtype -> Reg.t array
    val loc_exn_bucket : Reg.t
    val max_arguments_for_tailcalls : int
    val safe_register_pressure : Mach.operation -> int
    val max_register_pressure : Mach.operation -> int array
    val destroyed_at_oper : Mach.instruction_desc -> Reg.t array
    val destroyed_at_raise : Reg.t array
    val destroyed_at_reloadretaddr : Reg.t array
    val dwarf_register_numbers : reg_class:int -> int array

    For a given register class, the DWARF register numbering for that class. Given an allocated register with location Reg n and class reg_class, the returned array contains the corresponding DWARF register number at index n - first_available_register.(reg_class).

    val stack_ptr_dwarf_register_number : int

    The DWARF register number corresponding to the stack pointer.

    val assemble_file : string -> string -> int
    val init : unit -> unit
    diff --git a/ocaml/Profile/index.html b/ocaml/Profile/index.html new file mode 100644 index 0000000..88fcf5f --- /dev/null +++ b/ocaml/Profile/index.html @@ -0,0 +1,2 @@ + +Profile (ocaml.Profile)

    Module Profile

    Compiler performance recording

    Warning: this module is unstable and part of compiler-libs.

    type file = string
    val reset : unit -> unit

    erase all recorded profile information

    val record_call : ?accumulate:bool -> string -> (unit -> 'a) -> 'a

    record_call pass f calls f and records its profile information.

    val record : ?accumulate:bool -> string -> ('a -> 'b) -> 'a -> 'b

    record pass f arg records the profile information of f arg

    type column = [
    1. | `Time
    2. | `Alloc
    3. | `Top_heap
    4. | `Abs_top_heap
    ]
    val print : Stdlib.Format.formatter -> column list -> unit

    Prints the selected recorded profiling information to the formatter.

    Command line flags

    val options_doc : string
    val all_columns : column list

    A few pass names that are needed in several places, and shared to avoid typos.

    val generate : string
    val transl : string
    val typing : string
    diff --git a/ocaml/Profiling/index.html b/ocaml/Profiling/index.html new file mode 100644 index 0000000..47b45b8 --- /dev/null +++ b/ocaml/Profiling/index.html @@ -0,0 +1,2 @@ + +Profiling (ocaml.Profiling)

    Module Profiling

    val counters : (string * (string * int array)) list ref
    val incr : int array -> int -> unit
    diff --git a/ocaml/Projection/Map/index.html b/ocaml/Projection/Map/index.html new file mode 100644 index 0000000..b35c901 --- /dev/null +++ b/ocaml/Projection/Map/index.html @@ -0,0 +1,17 @@ + +Map (ocaml.Projection.Map)

    Module Projection.Map

    include Map.S with type key = T.t and type 'a t = 'a Map.Make(T).t

    Maps

    type key = T.t

    The type of the map keys.

    type 'a t = 'a Stdlib.Map.Make(T).t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key -> 'a -> 'a t -> 'a t

    add key data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key -> 'a -> 'a list t -> 'a list t

    add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

    update key f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : (key -> bool) -> 'a t -> key * 'a

    find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : (key -> bool) -> 'a t -> key * 'a

    find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : (key -> 'a -> unit) -> 'a t -> unit

    iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

    fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : (key -> 'a -> bool) -> 'a t -> 'a t

    filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : (key -> 'a -> bool) -> 'a t -> bool

    for_all f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : (key -> 'a -> bool) -> 'a t -> bool

    exists f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Stdlib.Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Stdlib.Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    val of_list : (key * 'a) list -> 'a t
    val disjoint_union : + ?eq:('a -> 'a -> bool) -> + ?print:(Stdlib.Format.formatter -> 'a -> unit) -> + 'a t -> + 'a t -> + 'a t

    disjoint_union m1 m2 contains all bindings from m1 and m2. If some binding is present in both and the associated value is not equal, a Fatal_error is raised

    val union_right : 'a t -> 'a t -> 'a t

    union_right m1 m2 contains all bindings from m1 and m2. If some binding is present in both, the one from m2 is taken

    val union_left : 'a t -> 'a t -> 'a t

    union_left m1 m2 = union_right m2 m1

    val union_merge : ('a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
    val rename : key t -> key -> key
    val map_keys : (key -> key) -> 'a t -> 'a t
    val keys : 'a t -> Stdlib.Set.Make(T).t
    val data : 'a t -> 'a list
    val of_set : (key -> 'a) -> Stdlib.Set.Make(T).t -> 'a t
    val transpose_keys_and_data : key t -> key t
    val transpose_keys_and_data_set : key t -> Stdlib.Set.Make(T).t t
    val print : + (Stdlib.Format.formatter -> 'a -> unit) -> + Stdlib.Format.formatter -> + 'a t -> + unit
    diff --git a/ocaml/Projection/Set/index.html b/ocaml/Projection/Set/index.html new file mode 100644 index 0000000..b26c9e4 --- /dev/null +++ b/ocaml/Projection/Set/index.html @@ -0,0 +1,2 @@ + +Set (ocaml.Projection.Set)

    Module Projection.Set

    include Set.S with type elt = T.t and type t = Set.Make(T).t

    Sets

    type elt = T.t

    The type of the set elements.

    The type of sets.

    val empty : t

    The empty set.

    val add : elt -> t -> t

    add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val singleton : elt -> t

    singleton x returns the one-element set containing only x.

    val remove : elt -> t -> t

    remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val union : t -> t -> t

    Set union.

    val inter : t -> t -> t

    Set intersection.

    val disjoint : t -> t -> bool

    Test if two sets are disjoint.

    • since 4.08
    val diff : t -> t -> t

    Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

    val cardinal : t -> int

    Return the number of elements of a set.

    Elements

    val elements : t -> elt list

    Return the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Set.Make.

    val min_elt : t -> elt

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

    val min_elt_opt : t -> elt option

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

    • since 4.05
    val max_elt : t -> elt

    Same as min_elt, but returns the largest element of the given set.

    val max_elt_opt : t -> elt option

    Same as min_elt_opt, but returns the largest element of the given set.

    • since 4.05
    val choose : t -> elt

    Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    val choose_opt : t -> elt option

    Return one element of the given set, or None if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    • since 4.05

    Searching

    val find : elt -> t -> elt

    find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

    • since 4.01
    val find_opt : elt -> t -> elt option

    find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

    • since 4.05
    val find_first : (elt -> bool) -> t -> elt

    find_first f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

    For example, find_first (fun e -> Ord.compare e x >= 0) s will return the first element e of s where Ord.compare e x >= 0 (intuitively: e >= x), or raise Not_found if x is greater than any element of s.

    • since 4.05
    val find_first_opt : (elt -> bool) -> t -> elt option

    find_first_opt f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

    • since 4.05
    val find_last : (elt -> bool) -> t -> elt

    find_last f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

    • since 4.05
    val find_last_opt : (elt -> bool) -> t -> elt option

    find_last_opt f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

    • since 4.05

    Traversing

    val iter : (elt -> unit) -> t -> unit

    iter f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.

    val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc

    fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

    Transforming

    val filter : (elt -> bool) -> t -> t

    filter f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val filter_map : (elt -> elt option) -> t -> t

    filter_map f s returns the set of all v such that f x = Some v for some element x of s.

    For example,

    filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) s

    is the set of halves of the even elements of s.

    If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned unchanged: the result of the function is then physically equal to s.

    • since 4.11
    val partition : (elt -> bool) -> t -> t * t

    partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

    val split : elt -> t -> t * bool * t

    split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.

    Predicates and comparisons

    val is_empty : t -> bool

    Test whether a set is empty or not.

    val mem : elt -> t -> bool

    mem x s tests whether x belongs to the set s.

    val equal : t -> t -> bool

    equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

    val compare : t -> t -> int

    Total ordering between sets. Can be used as the ordering function for doing sets of sets.

    val subset : t -> t -> bool

    subset s1 s2 tests whether the set s1 is a subset of the set s2.

    val for_all : (elt -> bool) -> t -> bool

    for_all f s checks if all elements of the set satisfy the predicate f.

    val exists : (elt -> bool) -> t -> bool

    exists f s checks if at least one element of the set satisfies the predicate f.

    Converting

    val to_list : t -> elt list

    to_list s is elements s.

    • since 5.1
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t

    to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

    • since 4.07
    val to_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in ascending order

    • since 4.07
    val to_rev_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in descending order

    • since 4.12
    val add_seq : elt Stdlib.Seq.t -> t -> t

    Add the given elements to the set, in order.

    • since 4.07
    val of_seq : elt Stdlib.Seq.t -> t

    Build a set from the given bindings

    • since 4.07
    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    val to_string : t -> string
    val of_list : elt list -> t
    val map : (elt -> elt) -> t -> t
    diff --git a/ocaml/Projection/T/index.html b/ocaml/Projection/T/index.html new file mode 100644 index 0000000..20ce673 --- /dev/null +++ b/ocaml/Projection/T/index.html @@ -0,0 +1,2 @@ + +T (ocaml.Projection.T)

    Module Projection.T

    type t = t
    include Hashtbl.HashedType with type t := t
    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val hash : t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := t
    val compare : t -> t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    diff --git a/ocaml/Projection/Tbl/index.html b/ocaml/Projection/Tbl/index.html new file mode 100644 index 0000000..691ce87 --- /dev/null +++ b/ocaml/Projection/Tbl/index.html @@ -0,0 +1,2 @@ + +Tbl (ocaml.Projection.Tbl)

    Module Projection.Tbl

    include Hashtbl.S with type key = T.t and type 'a t = 'a Hashtbl.Make(T).t
    type key = T.t
    val create : int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    • since 4.00
    val copy : 'a t -> 'a t
    val add : 'a t -> key -> 'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    • since 4.05
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key -> 'a -> unit
    val mem : 'a t -> key -> bool
    val iter : (key -> 'a -> unit) -> 'a t -> unit
    val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
    • since 4.03
    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc
    val length : 'a t -> int
    val stats : 'a t -> Stdlib.Hashtbl.statistics
    • since 4.00
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
    • since 4.07
    val to_seq_keys : _ t -> key Stdlib.Seq.t
    • since 4.07
    val to_seq_values : 'a t -> 'a Stdlib.Seq.t
    • since 4.07
    val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
    • since 4.07
    val to_list : 'a t -> (T.t * 'a) list
    val of_list : (T.t * 'a) list -> 'a t
    val to_map : 'a t -> 'a Stdlib.Map.Make(T).t
    val of_map : 'a Stdlib.Map.Make(T).t -> 'a t
    val memoize : 'a t -> (key -> 'a) -> key -> 'a
    val map : 'a t -> ('a -> 'b) -> 'b t
    diff --git a/ocaml/Projection/index.html b/ocaml/Projection/index.html new file mode 100644 index 0000000..57b77fd --- /dev/null +++ b/ocaml/Projection/index.html @@ -0,0 +1,8 @@ + +Projection (ocaml.Projection)

    Module Projection

    Representation of projections from closures and blocks.

    type project_closure = {
    1. set_of_closures : Variable.t;
      (*

      must yield a set of closures

      *)
    2. closure_id : Closure_id.t;
    }

    The selection of one closure given a set of closures, required before a function defined by said set of closures can be applied. See more detailed documentation below on set_of_closures.

    type move_within_set_of_closures = {
    1. closure : Variable.t;
      (*

      must yield a closure

      *)
    2. start_from : Closure_id.t;
    3. move_to : Closure_id.t;
    }

    The selection of one closure given another closure in the same set of closures. See more detailed documentation below on set_of_closures. The move_to closure must be part of the free variables of start_from.

    type project_var = {
    1. closure : Variable.t;
      (*

      must yield a closure

      *)
    2. closure_id : Closure_id.t;
    3. var : Var_within_closure.t;
    }

    The selection from a closure of a variable bound by said closure. In other words, access to a function's environment. Also see more detailed documentation below on set_of_closures.

    val print_project_closure : Stdlib.Format.formatter -> project_closure -> unit
    val print_move_within_set_of_closures : + Stdlib.Format.formatter -> + move_within_set_of_closures -> + unit
    val print_project_var : Stdlib.Format.formatter -> project_var -> unit
    val compare_project_var : project_var -> project_var -> int
    val compare_project_closure : project_closure -> project_closure -> int
    val compare_move_within_set_of_closures : + move_within_set_of_closures -> + move_within_set_of_closures -> + int
    type t =
    1. | Project_var of project_var
    2. | Project_closure of project_closure
    3. | Move_within_set_of_closures of move_within_set_of_closures
    4. | Field of int * Variable.t
    include Identifiable.S with type t := t
    module T : Identifiable.Thing with type t = t
    include Identifiable.Thing with type t := T.t
    include Hashtbl.HashedType with type t := T.t
    val equal : T.t -> T.t -> bool

    The equality predicate used to compare keys.

    val hash : T.t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := T.t
    val compare : T.t -> T.t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> T.t -> unit
    val print : Stdlib.Format.formatter -> T.t -> unit
    module Set : Identifiable.Set with module T := T
    module Map : Identifiable.Map with module T := T
    module Tbl : Identifiable.Tbl with module T := T
    val projecting_from : t -> Variable.t

    Return which variable the given projection projects from.

    val map_projecting_from : t -> f:(Variable.t -> Variable.t) -> t

    Change the variable that the given projection projects from.

    diff --git a/ocaml/Ref_to_variables/index.html b/ocaml/Ref_to_variables/index.html new file mode 100644 index 0000000..968d699 --- /dev/null +++ b/ocaml/Ref_to_variables/index.html @@ -0,0 +1,2 @@ + +Ref_to_variables (ocaml.Ref_to_variables)

    Module Ref_to_variables

    Transform let-bound references into variables.

    val eliminate_ref : Flambda.program -> Flambda.program
    diff --git a/ocaml/Reg/Map/index.html b/ocaml/Reg/Map/index.html new file mode 100644 index 0000000..1ad3b79 --- /dev/null +++ b/ocaml/Reg/Map/index.html @@ -0,0 +1,8 @@ + +Map (ocaml.Reg.Map)

    Module Reg.Map

    Maps

    type key = t

    The type of the map keys.

    type !+'a t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key -> 'a -> 'a t -> 'a t

    add key data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key -> 'a -> 'a list t -> 'a list t

    add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

    update key f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : (key -> bool) -> 'a t -> key * 'a

    find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : (key -> bool) -> 'a t -> key * 'a

    find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : (key -> 'a -> unit) -> 'a t -> unit

    iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

    fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : (key -> 'a -> bool) -> 'a t -> 'a t

    filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : (key -> 'a -> bool) -> 'a t -> bool

    for_all f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : (key -> 'a -> bool) -> 'a t -> bool

    exists f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val of_list : (key * 'a) list -> 'a t

    of_list bs adds the bindings of bs to the empty map, in list order (if a key is bound twice in bs the last one takes over).

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    diff --git a/ocaml/Reg/Raw_name/index.html b/ocaml/Reg/Raw_name/index.html new file mode 100644 index 0000000..a8f37ed --- /dev/null +++ b/ocaml/Reg/Raw_name/index.html @@ -0,0 +1,2 @@ + +Raw_name (ocaml.Reg.Raw_name)

    Module Reg.Raw_name

    type t
    val create_from_var : Backend_var.t -> t
    diff --git a/ocaml/Reg/Set/index.html b/ocaml/Reg/Set/index.html new file mode 100644 index 0000000..4701859 --- /dev/null +++ b/ocaml/Reg/Set/index.html @@ -0,0 +1,2 @@ + +Set (ocaml.Reg.Set)

    Module Reg.Set

    Sets

    type elt = t

    The type of the set elements.

    type t

    The type of sets.

    val empty : t

    The empty set.

    val add : elt -> t -> t

    add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val singleton : elt -> t

    singleton x returns the one-element set containing only x.

    val remove : elt -> t -> t

    remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val union : t -> t -> t

    Set union.

    val inter : t -> t -> t

    Set intersection.

    val disjoint : t -> t -> bool

    Test if two sets are disjoint.

    • since 4.08
    val diff : t -> t -> t

    Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

    val cardinal : t -> int

    Return the number of elements of a set.

    Elements

    val elements : t -> elt list

    Return the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Set.Make.

    val min_elt : t -> elt

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

    val min_elt_opt : t -> elt option

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

    • since 4.05
    val max_elt : t -> elt

    Same as min_elt, but returns the largest element of the given set.

    val max_elt_opt : t -> elt option

    Same as min_elt_opt, but returns the largest element of the given set.

    • since 4.05
    val choose : t -> elt

    Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    val choose_opt : t -> elt option

    Return one element of the given set, or None if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    • since 4.05

    Searching

    val find : elt -> t -> elt

    find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

    • since 4.01
    val find_opt : elt -> t -> elt option

    find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

    • since 4.05
    val find_first : (elt -> bool) -> t -> elt

    find_first f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

    For example, find_first (fun e -> Ord.compare e x >= 0) s will return the first element e of s where Ord.compare e x >= 0 (intuitively: e >= x), or raise Not_found if x is greater than any element of s.

    • since 4.05
    val find_first_opt : (elt -> bool) -> t -> elt option

    find_first_opt f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

    • since 4.05
    val find_last : (elt -> bool) -> t -> elt

    find_last f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

    • since 4.05
    val find_last_opt : (elt -> bool) -> t -> elt option

    find_last_opt f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

    • since 4.05

    Traversing

    val iter : (elt -> unit) -> t -> unit

    iter f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.

    val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc

    fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

    Transforming

    val map : (elt -> elt) -> t -> t

    map f s is the set whose elements are f a0,f a1... f aN, where a0,a1...aN are the elements of s.

    The elements are passed to f in increasing order with respect to the ordering over the type of the elements.

    If no element of s is changed by f, s is returned unchanged. (If each output of f is physically equal to its input, the returned set is physically equal to s.)

    • since 4.04
    val filter : (elt -> bool) -> t -> t

    filter f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val filter_map : (elt -> elt option) -> t -> t

    filter_map f s returns the set of all v such that f x = Some v for some element x of s.

    For example,

    filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) s

    is the set of halves of the even elements of s.

    If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned unchanged: the result of the function is then physically equal to s.

    • since 4.11
    val partition : (elt -> bool) -> t -> t * t

    partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

    val split : elt -> t -> t * bool * t

    split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.

    Predicates and comparisons

    val is_empty : t -> bool

    Test whether a set is empty or not.

    val mem : elt -> t -> bool

    mem x s tests whether x belongs to the set s.

    val equal : t -> t -> bool

    equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

    val compare : t -> t -> int

    Total ordering between sets. Can be used as the ordering function for doing sets of sets.

    val subset : t -> t -> bool

    subset s1 s2 tests whether the set s1 is a subset of the set s2.

    val for_all : (elt -> bool) -> t -> bool

    for_all f s checks if all elements of the set satisfy the predicate f.

    val exists : (elt -> bool) -> t -> bool

    exists f s checks if at least one element of the set satisfies the predicate f.

    Converting

    val to_list : t -> elt list

    to_list s is elements s.

    • since 5.1
    val of_list : elt list -> t

    of_list l creates a set from a list of elements. This is usually more efficient than folding add over the list, except perhaps for lists with many duplicated elements.

    • since 4.02
    val to_seq_from : elt -> t -> elt Seq.t

    to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

    • since 4.07
    val to_seq : t -> elt Seq.t

    Iterate on the whole set, in ascending order

    • since 4.07
    val to_rev_seq : t -> elt Seq.t

    Iterate on the whole set, in descending order

    • since 4.12
    val add_seq : elt Seq.t -> t -> t

    Add the given elements to the set, in order.

    • since 4.07
    val of_seq : elt Seq.t -> t

    Build a set from the given bindings

    • since 4.07
    diff --git a/ocaml/Reg/index.html b/ocaml/Reg/index.html new file mode 100644 index 0000000..5efd1fe --- /dev/null +++ b/ocaml/Reg/index.html @@ -0,0 +1,2 @@ + +Reg (ocaml.Reg)

    Module Reg

    module Raw_name : sig ... end
    type t = {
    1. mutable raw_name : Raw_name.t;
    2. stamp : int;
    3. typ : Cmm.machtype_component;
    4. mutable loc : location;
    5. mutable spill : bool;
    6. mutable part : int option;
    7. mutable interf : t list;
    8. mutable prefer : (t * int) list;
    9. mutable degree : int;
    10. mutable spill_cost : int;
    11. mutable visited : int;
    }
    and location =
    1. | Unknown
    2. | Reg of int
    3. | Stack of stack_location
    and stack_location =
    1. | Local of int
    2. | Incoming of int
    3. | Outgoing of int
    4. | Domainstate of int
    val dummy : t
    val create : Cmm.machtype_component -> t
    val createv : Cmm.machtype -> t array
    val createv_like : t array -> t array
    val clone : t -> t
    val at_location : Cmm.machtype_component -> location -> t
    val typv : t array -> Cmm.machtype
    val anonymous : t -> bool
    val name : t -> string
    module Set : Set.S with type elt = t
    module Map : Map.S with type key = t
    val add_set_array : Set.t -> t array -> Set.t
    val diff_set_array : Set.t -> t array -> Set.t
    val inter_set_array : Set.t -> t array -> Set.t
    val disjoint_set_array : Set.t -> t array -> bool
    val set_of_array : t array -> Set.t
    val reset : unit -> unit
    val all_registers : unit -> t list
    val num_registers : unit -> int
    val reinit : unit -> unit
    val mark_visited : t -> unit
    val is_visited : t -> bool
    val clear_visited_marks : unit -> unit
    diff --git a/ocaml/Reload/index.html b/ocaml/Reload/index.html new file mode 100644 index 0000000..0454c93 --- /dev/null +++ b/ocaml/Reload/index.html @@ -0,0 +1,2 @@ + +Reload (ocaml.Reload)

    Module Reload

    val fundecl : Mach.fundecl -> int array -> Mach.fundecl * bool
    diff --git a/ocaml/Reloadgen/class-reload_generic/index.html b/ocaml/Reloadgen/class-reload_generic/index.html new file mode 100644 index 0000000..ac21509 --- /dev/null +++ b/ocaml/Reloadgen/class-reload_generic/index.html @@ -0,0 +1,5 @@ + +reload_generic (ocaml.Reloadgen.reload_generic)

    Class Reloadgen.reload_generic

    method reload_operation : Mach.operation -> + Reg.t array -> + Reg.t array -> + Reg.t array * Reg.t array
    method reload_test : Mach.test -> Reg.t array -> Reg.t array
    method makereg : Reg.t -> Reg.t
    method makeregs : Reg.t array -> Reg.t array
    method fundecl : Mach.fundecl -> int array -> Mach.fundecl * bool
    diff --git a/ocaml/Reloadgen/index.html b/ocaml/Reloadgen/index.html new file mode 100644 index 0000000..c78b356 --- /dev/null +++ b/ocaml/Reloadgen/index.html @@ -0,0 +1,2 @@ + +Reloadgen (ocaml.Reloadgen)

    Module Reloadgen

    class reload_generic : object ... end
    diff --git a/ocaml/Remove_free_vars_equal_to_args/index.html b/ocaml/Remove_free_vars_equal_to_args/index.html new file mode 100644 index 0000000..affd73d --- /dev/null +++ b/ocaml/Remove_free_vars_equal_to_args/index.html @@ -0,0 +1,5 @@ + +Remove_free_vars_equal_to_args (ocaml.Remove_free_vars_equal_to_args)

    Module Remove_free_vars_equal_to_args

    Replace free variables in closures known to be equal to specialised arguments of such closures with those specialised arguments.

    diff --git a/ocaml/Remove_unused_arguments/index.html b/ocaml/Remove_unused_arguments/index.html new file mode 100644 index 0000000..0303ca0 --- /dev/null +++ b/ocaml/Remove_unused_arguments/index.html @@ -0,0 +1,8 @@ + +Remove_unused_arguments (ocaml.Remove_unused_arguments)

    Module Remove_unused_arguments

    val separate_unused_arguments_in_closures : + Flambda.program -> + backend:(module Backend_intf.S) -> + Flambda.program

    Introduce a stub function to avoid depending on unused arguments.

    For instance, it turns let rec fact n unused = if n = 0 then 1 else n * fact (n-1) unused into let rec fact' n = if n = 0 then 1 else n * fact' (n-1) and fact n unused = fact' n

    val separate_unused_arguments_in_set_of_closures : + Flambda.set_of_closures -> + backend:(module Backend_intf.S) -> + Flambda.set_of_closures option
    diff --git a/ocaml/Remove_unused_closure_vars/index.html b/ocaml/Remove_unused_closure_vars/index.html new file mode 100644 index 0000000..b6a03df --- /dev/null +++ b/ocaml/Remove_unused_closure_vars/index.html @@ -0,0 +1,5 @@ + +Remove_unused_closure_vars (ocaml.Remove_unused_closure_vars)

    Module Remove_unused_closure_vars

    val remove_unused_closure_variables : + remove_direct_call_surrogates:bool -> + Flambda.program -> + Flambda.program

    Eliminate variables bound by sets of closures that are not required. Also eliminate functions within sets of closures that are not required.

    diff --git a/ocaml/Remove_unused_program_constructs/index.html b/ocaml/Remove_unused_program_constructs/index.html new file mode 100644 index 0000000..257b55f --- /dev/null +++ b/ocaml/Remove_unused_program_constructs/index.html @@ -0,0 +1,2 @@ + +Remove_unused_program_constructs (ocaml.Remove_unused_program_constructs)

    Module Remove_unused_program_constructs

    val remove_unused_program_constructs : Flambda.program -> Flambda.program
    diff --git a/ocaml/Runtime_events/Callbacks/index.html b/ocaml/Runtime_events/Callbacks/index.html new file mode 100644 index 0000000..7bc78e2 --- /dev/null +++ b/ocaml/Runtime_events/Callbacks/index.html @@ -0,0 +1,14 @@ + +Callbacks (ocaml.Runtime_events.Callbacks)

    Module Runtime_events.Callbacks

    type t

    Type of callbacks.

    val create : + ?runtime_begin:(int -> Timestamp.t -> runtime_phase -> unit) -> + ?runtime_end:(int -> Timestamp.t -> runtime_phase -> unit) -> + ?runtime_counter:(int -> Timestamp.t -> runtime_counter -> int -> unit) -> + ?alloc:(int -> Timestamp.t -> int array -> unit) -> + ?lifecycle:(int -> Timestamp.t -> lifecycle -> int option -> unit) -> + ?lost_events:(int -> int -> unit) -> + unit -> + t

    Create a Callback that optionally subscribes to one or more runtime events. The first int supplied to callbacks is the ring buffer index. Each domain owns a single ring buffer for the duration of the domain's existence. After a domain terminates, a newly spawned domain may take ownership of the ring buffer. A runtime_begin callback is called when the runtime enters a new phase (e.g a runtime_begin with EV_MINOR is called at the start of a minor GC). A runtime_end callback is called when the runtime leaves a certain phase. The runtime_counter callback is called when a counter is emitted by the runtime. lifecycle callbacks are called when the ring undergoes a change in lifecycle and a consumer may need to respond. alloc callbacks are currently only called on the instrumented runtime. lost_events callbacks are called if the consumer code detects some unconsumed events have been overwritten.

    val add_user_event : + 'a Type.t -> + (int -> Timestamp.t -> 'a User.t -> 'a -> unit) -> + t -> + t

    add_user_event ty callback t extends t to additionally subscribe to user events of type ty. When such an event happens, callback is called with the corresponding event and payload.

    diff --git a/ocaml/Runtime_events/Timestamp/index.html b/ocaml/Runtime_events/Timestamp/index.html new file mode 100644 index 0000000..51e07d2 --- /dev/null +++ b/ocaml/Runtime_events/Timestamp/index.html @@ -0,0 +1,2 @@ + +Timestamp (ocaml.Runtime_events.Timestamp)

    Module Runtime_events.Timestamp

    type t

    Type for the int64 timestamp to allow for future changes.

    val to_int64 : t -> int64
    diff --git a/ocaml/Runtime_events/Type/index.html b/ocaml/Runtime_events/Type/index.html new file mode 100644 index 0000000..e37b39e --- /dev/null +++ b/ocaml/Runtime_events/Type/index.html @@ -0,0 +1,5 @@ + +Type (ocaml.Runtime_events.Type)

    Module Runtime_events.Type

    type 'a t

    The type for a user event content type.

    val unit : unit t

    An event that has no data associated with it.

    type span =
    1. | Begin
    2. | End
    val span : span t

    An event that has a beginning and an end.

    val int : int t

    An event containing an integer value.

    val register : + encode:(bytes -> 'a -> int) -> + decode:(bytes -> int -> 'a) -> + 'a t

    Registers a custom type by providing an encoder and a decoder. The encoder writes the value in the provided buffer and returns the number of bytes written. The decoder gets a slice of the buffer of specified length, and returns the decoded value.

    The maximum value length is 1024 bytes.

    diff --git a/ocaml/Runtime_events/User/index.html b/ocaml/Runtime_events/User/index.html new file mode 100644 index 0000000..013cdfd --- /dev/null +++ b/ocaml/Runtime_events/User/index.html @@ -0,0 +1,2 @@ + +User (ocaml.Runtime_events.User)

    Module Runtime_events.User

    User events is a way for libraries to provide runtime events that can be consumed by other tools. These events can carry known data types or custom values. The current maximum number of user events is 8192.

    type tag = ..

    The type for a user event tag. Tags are used to discriminate between user events of the same type.

    type 'value t

    The type for a user event. User events describe their tag, carried data type and an unique string-based name.

    val register : string -> tag -> 'value Type.t -> 'value t

    register name tag ty registers a new event with an unique name, carrying a tag and values of type ty.

    val write : 'value t -> 'value -> unit

    write t v emits value v for event t.

    val name : _ t -> string

    name t is the unique identifying name of event t.

    val tag : 'a t -> tag

    tag t is the associated tag of event t, when it is known. An event can be unknown if it was not registered in the consumer program.

    diff --git a/ocaml/Runtime_events/index.html b/ocaml/Runtime_events/index.html new file mode 100644 index 0000000..fc78814 --- /dev/null +++ b/ocaml/Runtime_events/index.html @@ -0,0 +1,2 @@ + +Runtime_events (ocaml.Runtime_events)

    Module Runtime_events

    Runtime events - ring buffer-based runtime tracing

    This module enables users to enable and subscribe to tracing events from the Garbage Collector and other parts of the OCaml runtime. This can be useful for diagnostic or performance monitoring purposes. This module can be used to subscribe to events for the current process or external processes asynchronously.

    When enabled (either via setting the OCAML_RUNTIME_EVENTS_START environment variable or calling Runtime_events.start) a file with the pid of the process and extension .events will be created. By default this is in the current directory but can be over-ridden by the OCAML_RUNTIME_EVENTS_DIR environment variable. Each domain maintains its own ring buffer in a section of the larger file into which it emits events.

    There is additionally a set of C APIs in runtime_events.h that can enable zero-impact monitoring of the current process or bindings for other languages.

    The runtime events system's behaviour can be controlled by the following environment variables:

    • OCAML_RUNTIME_EVENTS_START if set will cause the runtime events system to be started as part of the OCaml runtime initialization.
    • OCAML_RUNTIME_EVENTS_DIR sets the directory where the runtime events ring buffers will be located. If not present the program's working directory will be used.
    • OCAML_RUNTIME_EVENTS_PRESERVE if set will prevent the OCaml runtime from removing its ring buffers when it terminates. This can help if monitoring very short running programs.
    type runtime_counter =
    1. | EV_C_FORCE_MINOR_ALLOC_SMALL
    2. | EV_C_FORCE_MINOR_MAKE_VECT
    3. | EV_C_FORCE_MINOR_SET_MINOR_HEAP_SIZE
    4. | EV_C_FORCE_MINOR_MEMPROF
    5. | EV_C_MINOR_PROMOTED
    6. | EV_C_MINOR_ALLOCATED
    7. | EV_C_REQUEST_MAJOR_ALLOC_SHR
    8. | EV_C_REQUEST_MAJOR_ADJUST_GC_SPEED
    9. | EV_C_REQUEST_MINOR_REALLOC_REF_TABLE
    10. | EV_C_REQUEST_MINOR_REALLOC_EPHE_REF_TABLE
    11. | EV_C_REQUEST_MINOR_REALLOC_CUSTOM_TABLE
    12. | EV_C_MAJOR_HEAP_POOL_WORDS
      (*

      Total words in a Domain's major heap pools. This is the sum of unallocated and live words in each pool.

      • since 5.1
      *)
    13. | EV_C_MAJOR_HEAP_POOL_LIVE_WORDS
      (*

      Current live words in a Domain's major heap pools.

      • since 5.1
      *)
    14. | EV_C_MAJOR_HEAP_LARGE_WORDS
      (*

      Total words of a Domain's major heap large allocations. A large allocation is an allocation larger than the largest sized pool.

      • since 5.1
      *)
    15. | EV_C_MAJOR_HEAP_POOL_FRAG_WORDS
      (*

      Words in a Domain's major heap pools lost to fragmentation. This is due to there not being a pool with the exact size of an allocation and a larger sized pool needing to be used.

      • since 5.1
      *)
    16. | EV_C_MAJOR_HEAP_POOL_LIVE_BLOCKS
      (*

      Live blocks of a Domain's major heap pools.

      • since 5.1
      *)
    17. | EV_C_MAJOR_HEAP_LARGE_BLOCKS
      (*

      Live blocks of a Domain's major heap large allocations.

      • since 5.1
      *)

    The type for counter events emitted by the runtime.

    type runtime_phase =
    1. | EV_EXPLICIT_GC_SET
    2. | EV_EXPLICIT_GC_STAT
    3. | EV_EXPLICIT_GC_MINOR
    4. | EV_EXPLICIT_GC_MAJOR
    5. | EV_EXPLICIT_GC_FULL_MAJOR
    6. | EV_EXPLICIT_GC_COMPACT
    7. | EV_MAJOR
    8. | EV_MAJOR_SWEEP
    9. | EV_MAJOR_MARK_ROOTS
    10. | EV_MAJOR_MARK
    11. | EV_MINOR
    12. | EV_MINOR_LOCAL_ROOTS
    13. | EV_MINOR_FINALIZED
    14. | EV_EXPLICIT_GC_MAJOR_SLICE
    15. | EV_FINALISE_UPDATE_FIRST
    16. | EV_FINALISE_UPDATE_LAST
    17. | EV_INTERRUPT_REMOTE
    18. | EV_MAJOR_EPHE_MARK
    19. | EV_MAJOR_EPHE_SWEEP
    20. | EV_MAJOR_FINISH_MARKING
    21. | EV_MAJOR_GC_CYCLE_DOMAINS
    22. | EV_MAJOR_GC_PHASE_CHANGE
    23. | EV_MAJOR_GC_STW
    24. | EV_MAJOR_MARK_OPPORTUNISTIC
    25. | EV_MAJOR_SLICE
    26. | EV_MAJOR_FINISH_CYCLE
    27. | EV_MINOR_CLEAR
    28. | EV_MINOR_FINALIZERS_OLDIFY
    29. | EV_MINOR_GLOBAL_ROOTS
    30. | EV_MINOR_LEAVE_BARRIER
    31. | EV_STW_API_BARRIER
    32. | EV_STW_HANDLER
    33. | EV_STW_LEADER
    34. | EV_MAJOR_FINISH_SWEEPING
    35. | EV_MINOR_FINALIZERS_ADMIN
    36. | EV_MINOR_REMEMBERED_SET
    37. | EV_MINOR_REMEMBERED_SET_PROMOTE
    38. | EV_MINOR_LOCAL_ROOTS_PROMOTE
    39. | EV_DOMAIN_CONDITION_WAIT
    40. | EV_DOMAIN_RESIZE_HEAP_RESERVATION
    41. | EV_COMPACT
    42. | EV_COMPACT_EVACUATE
    43. | EV_COMPACT_FORWARD
    44. | EV_COMPACT_RELEASE

    The type for span events emitted by the runtime.

    type lifecycle =
    1. | EV_RING_START
    2. | EV_RING_STOP
    3. | EV_RING_PAUSE
    4. | EV_RING_RESUME
    5. | EV_FORK_PARENT
    6. | EV_FORK_CHILD
    7. | EV_DOMAIN_SPAWN
    8. | EV_DOMAIN_TERMINATE

    Lifecycle events for the ring itself.

    val lifecycle_name : lifecycle -> string

    Return a string representation of a given lifecycle event type.

    val runtime_phase_name : runtime_phase -> string

    Return a string representation of a given runtime phase event type.

    val runtime_counter_name : runtime_counter -> string

    Return a string representation of a given runtime counter type.

    type cursor

    Type of the cursor used when consuming.

    module Timestamp : sig ... end
    module Type : sig ... end
    module User : sig ... end

    User events is a way for libraries to provide runtime events that can be consumed by other tools. These events can carry known data types or custom values. The current maximum number of user events is 8192.

    module Callbacks : sig ... end
    val start : unit -> unit

    start () will start the collection of events in the runtime if not already started.

    Events can be consumed by creating a cursor with create_cursor and providing a set of callbacks to be called for each type of event.

    val pause : unit -> unit

    pause () will pause the collection of events in the runtime. Traces are collected if the program has called Runtime_events.start () or the OCAML_RUNTIME_EVENTS_START environment variable has been set.

    val resume : unit -> unit

    resume () will resume the collection of events in the runtime. Traces are collected if the program has called Runtime_events.start () or the OCAML_RUNTIME_EVENTS_START environment variable has been set.

    val create_cursor : (string * int) option -> cursor

    create_cursor path_pid creates a cursor to read from an runtime_events. Cursors can be created for runtime_events in and out of process. A runtime_events ring-buffer may have multiple cursors reading from it at any point in time and a program may have multiple cursors open concurrently (for example if multiple consumers want different sets of events). If path_pid is None then a cursor is created for the current process. Otherwise the pair contains a string path to the directory that contains the pid.events file and int pid for the runtime_events of an external process to monitor.

    val free_cursor : cursor -> unit

    Free a previously created runtime_events cursor.

    val read_poll : cursor -> Callbacks.t -> int option -> int

    read_poll cursor callbacks max_option calls the corresponding functions on callbacks for up to max_option events read off cursor's runtime_events and returns the number of events read.

    diff --git a/ocaml/Runtimedef/index.html b/ocaml/Runtimedef/index.html new file mode 100644 index 0000000..f82d575 --- /dev/null +++ b/ocaml/Runtimedef/index.html @@ -0,0 +1,2 @@ + +Runtimedef (ocaml.Runtimedef)

    Module Runtimedef

    val builtin_exceptions : string array
    val builtin_primitives : string array
    diff --git a/ocaml/Schedgen/class-scheduler_generic/index.html b/ocaml/Schedgen/class-scheduler_generic/index.html new file mode 100644 index 0000000..af0338f --- /dev/null +++ b/ocaml/Schedgen/class-scheduler_generic/index.html @@ -0,0 +1,2 @@ + +scheduler_generic (ocaml.Schedgen.scheduler_generic)

    Class Schedgen.scheduler_generic

    method virtual oper_issue_cycles : Mach.operation -> int
    method virtual oper_latency : Mach.operation -> int
    method reload_retaddr_issue_cycles : int
    method reload_retaddr_latency : int
    method oper_in_basic_block : Mach.operation -> bool
    method is_store : Mach.operation -> bool
    method is_load : Mach.operation -> bool
    method is_checkbound : Mach.operation -> bool
    method schedule_fundecl : Linear.fundecl -> Linear.fundecl
    diff --git a/ocaml/Schedgen/index.html b/ocaml/Schedgen/index.html new file mode 100644 index 0000000..a1be059 --- /dev/null +++ b/ocaml/Schedgen/index.html @@ -0,0 +1,2 @@ + +Schedgen (ocaml.Schedgen)

    Module Schedgen

    type code_dag_node = {
    1. instr : Linear.instruction;
    2. delay : int;
    3. mutable sons : (code_dag_node * int) list;
    4. mutable date : int;
    5. mutable length : int;
    6. mutable ancestors : int;
    7. mutable emitted_ancestors : int;
    }
    class virtual scheduler_generic : object ... end
    diff --git a/ocaml/Scheduling/index.html b/ocaml/Scheduling/index.html new file mode 100644 index 0000000..12a4908 --- /dev/null +++ b/ocaml/Scheduling/index.html @@ -0,0 +1,2 @@ + +Scheduling (ocaml.Scheduling)

    Module Scheduling

    diff --git a/ocaml/Selectgen/Coeffect/index.html b/ocaml/Selectgen/Coeffect/index.html new file mode 100644 index 0000000..4585a24 --- /dev/null +++ b/ocaml/Selectgen/Coeffect/index.html @@ -0,0 +1,2 @@ + +Coeffect (ocaml.Selectgen.Coeffect)

    Module Selectgen.Coeffect

    type t =
    1. | None
    2. | Read_mutable
    3. | Arbitrary
    diff --git a/ocaml/Selectgen/Effect/index.html b/ocaml/Selectgen/Effect/index.html new file mode 100644 index 0000000..541a4e7 --- /dev/null +++ b/ocaml/Selectgen/Effect/index.html @@ -0,0 +1,2 @@ + +Effect (ocaml.Selectgen.Effect)

    Module Selectgen.Effect

    type t =
    1. | None
    2. | Raise
    3. | Arbitrary
    diff --git a/ocaml/Selectgen/Effect_and_coeffect/index.html b/ocaml/Selectgen/Effect_and_coeffect/index.html new file mode 100644 index 0000000..db96054 --- /dev/null +++ b/ocaml/Selectgen/Effect_and_coeffect/index.html @@ -0,0 +1,2 @@ + +Effect_and_coeffect (ocaml.Selectgen.Effect_and_coeffect)

    Module Selectgen.Effect_and_coeffect

    type t
    val none : t
    val arbitrary : t
    val effect : t -> Effect.t
    val coeffect : t -> Coeffect.t
    val effect_only : Effect.t -> t
    val coeffect_only : Coeffect.t -> t
    val join : t -> t -> t
    val join_list_map : 'a list -> ('a -> t) -> t
    diff --git a/ocaml/Selectgen/class-selector_generic/index.html b/ocaml/Selectgen/class-selector_generic/index.html new file mode 100644 index 0000000..3eb49ac --- /dev/null +++ b/ocaml/Selectgen/class-selector_generic/index.html @@ -0,0 +1,45 @@ + +selector_generic (ocaml.Selectgen.selector_generic)

    Class Selectgen.selector_generic

    method is_immediate : Mach.integer_operation -> int -> bool
    method virtual is_immediate_test : Mach.integer_comparison -> int -> bool
    method virtual select_addressing : Cmm.memory_chunk -> + Cmm.expression -> + Arch.addressing_mode * Cmm.expression
    method is_simple_expr : Cmm.expression -> bool
    method effects_of : Cmm.expression -> Effect_and_coeffect.t
    method select_operation : Cmm.operation -> + Cmm.expression list -> + Debuginfo.t -> + Mach.operation * Cmm.expression list
    method select_condition : Cmm.expression -> Mach.test * Cmm.expression
    method select_store : bool -> + Arch.addressing_mode -> + Cmm.expression -> + Mach.operation * Cmm.expression
    method regs_for : Cmm.machtype -> Reg.t array
    method insert_op : environment -> + Mach.operation -> + Reg.t array -> + Reg.t array -> + Reg.t array
    method insert_op_debug : environment -> + Mach.operation -> + Debuginfo.t -> + Reg.t array -> + Reg.t array -> + Reg.t array
    method insert_move_extcall_arg : environment -> + Cmm.exttype -> + Reg.t array -> + Reg.t array -> + unit
    method emit_extcall_args : environment -> + Cmm.exttype list -> + Cmm.expression list -> + Reg.t array * int
    method emit_stores : environment -> Cmm.expression list -> Reg.t array -> unit
    method emit_fundecl : future_funcnames:Misc.Stdlib.String.Set.t -> + Cmm.fundecl -> + Mach.fundecl
    method extract_onto : Mach.instruction -> Mach.instruction
    method extract : Mach.instruction
    method insert : environment -> + Mach.instruction_desc -> + Reg.t array -> + Reg.t array -> + unit
    method insert_debug : environment -> + Mach.instruction_desc -> + Debuginfo.t -> + Reg.t array -> + Reg.t array -> + unit
    method insert_move : environment -> Reg.t -> Reg.t -> unit
    method insert_move_args : environment -> + Reg.t array -> + Reg.t array -> + int -> + unit
    method insert_move_results : environment -> + Reg.t array -> + Reg.t array -> + int -> + unit
    method insert_moves : environment -> Reg.t array -> Reg.t array -> unit
    method emit_expr : environment -> Cmm.expression -> Reg.t array option
    method emit_tail : environment -> Cmm.expression -> unit
    diff --git a/ocaml/Selectgen/index.html b/ocaml/Selectgen/index.html new file mode 100644 index 0000000..251b14e --- /dev/null +++ b/ocaml/Selectgen/index.html @@ -0,0 +1,7 @@ + +Selectgen (ocaml.Selectgen)

    Module Selectgen

    type environment
    val env_find : Backend_var.t -> environment -> Reg.t array
    val size_expr : environment -> Cmm.expression -> int
    module Effect : sig ... end
    module Coeffect : sig ... end
    module Effect_and_coeffect : sig ... end
    class virtual selector_generic : object ... end
    val reset : unit -> unit
    diff --git a/ocaml/Selection/index.html b/ocaml/Selection/index.html new file mode 100644 index 0000000..763e06d --- /dev/null +++ b/ocaml/Selection/index.html @@ -0,0 +1,5 @@ + +Selection (ocaml.Selection)

    Module Selection

    val fundecl : + future_funcnames:Misc.Stdlib.String.Set.t -> + Cmm.fundecl -> + Mach.fundecl
    diff --git a/ocaml/Semantics_of_primitives/index.html b/ocaml/Semantics_of_primitives/index.html new file mode 100644 index 0000000..881f7ea --- /dev/null +++ b/ocaml/Semantics_of_primitives/index.html @@ -0,0 +1,2 @@ + +Semantics_of_primitives (ocaml.Semantics_of_primitives)

    Module Semantics_of_primitives

    Description of the semantics of primitives, to be used for optimization purposes.

    "No effects" means that the primitive does not change the observable state of the world. For example, it must not write to any mutable storage, call arbitrary external functions or change control flow (e.g. by raising an exception). Note that allocation is not "No effects" (see below).

    It is assumed in the compiler that applications of primitives with no effects, whose results are not used, may be eliminated. It is further assumed that applications of primitives with no effects may be duplicated (and thus possibly executed more than once).

    (Exceptions arising from allocation points, for example "out of memory" or exceptions propagated from finalizers or signal handlers, are treated as "effects out of the ether" and thus ignored for our determination here of effectfulness. The same goes for floating point operations that may cause hardware traps on some platforms.)

    "Only generative effects" means that a primitive does not change the observable state of the world save for possibly affecting the state of the garbage collector by performing an allocation. Applications of primitives that only have generative effects and whose results are unused may be eliminated by the compiler. However, unlike "No effects" primitives, such applications will never be eligible for duplication.

    "Arbitrary effects" covers all other primitives.

    "No coeffects" means that the primitive does not observe the effects (in the sense described above) of other expressions. For example, it must not read from any mutable storage or call arbitrary external functions.

    It is assumed in the compiler that, subject to data dependencies, expressions with neither effects nor coeffects may be reordered with respect to other expressions.

    type effects =
    1. | No_effects
    2. | Only_generative_effects
    3. | Arbitrary_effects
    type coeffects =
    1. | No_coeffects
    2. | Has_coeffects

    Describe the semantics of a primitive. This does not take into account of the (non-)(co)effectfulness of the arguments in a primitive application. To determine whether such an application is (co)effectful, the arguments must also be analysed.

    type return_type =
    1. | Float
    2. | Other
    val return_type_of_primitive : Clambda_primitives.primitive -> return_type
    diff --git a/ocaml/Set_of_closures_id/Map/index.html b/ocaml/Set_of_closures_id/Map/index.html new file mode 100644 index 0000000..87ef674 --- /dev/null +++ b/ocaml/Set_of_closures_id/Map/index.html @@ -0,0 +1,17 @@ + +Map (ocaml.Set_of_closures_id.Map)

    Module Set_of_closures_id.Map

    include Map.S with type key = T.t and type 'a t = 'a Map.Make(T).t

    Maps

    type key = T.t

    The type of the map keys.

    type 'a t = 'a Stdlib.Map.Make(T).t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key -> 'a -> 'a t -> 'a t

    add key data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key -> 'a -> 'a list t -> 'a list t

    add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

    update key f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : (key -> bool) -> 'a t -> key * 'a

    find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : (key -> bool) -> 'a t -> key * 'a

    find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : (key -> 'a -> unit) -> 'a t -> unit

    iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

    fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : (key -> 'a -> bool) -> 'a t -> 'a t

    filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : (key -> 'a -> bool) -> 'a t -> bool

    for_all f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : (key -> 'a -> bool) -> 'a t -> bool

    exists f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Stdlib.Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Stdlib.Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    val of_list : (key * 'a) list -> 'a t
    val disjoint_union : + ?eq:('a -> 'a -> bool) -> + ?print:(Stdlib.Format.formatter -> 'a -> unit) -> + 'a t -> + 'a t -> + 'a t

    disjoint_union m1 m2 contains all bindings from m1 and m2. If some binding is present in both and the associated value is not equal, a Fatal_error is raised

    val union_right : 'a t -> 'a t -> 'a t

    union_right m1 m2 contains all bindings from m1 and m2. If some binding is present in both, the one from m2 is taken

    val union_left : 'a t -> 'a t -> 'a t

    union_left m1 m2 = union_right m2 m1

    val union_merge : ('a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
    val rename : key t -> key -> key
    val map_keys : (key -> key) -> 'a t -> 'a t
    val keys : 'a t -> Stdlib.Set.Make(T).t
    val data : 'a t -> 'a list
    val of_set : (key -> 'a) -> Stdlib.Set.Make(T).t -> 'a t
    val transpose_keys_and_data : key t -> key t
    val transpose_keys_and_data_set : key t -> Stdlib.Set.Make(T).t t
    val print : + (Stdlib.Format.formatter -> 'a -> unit) -> + Stdlib.Format.formatter -> + 'a t -> + unit
    diff --git a/ocaml/Set_of_closures_id/Set/index.html b/ocaml/Set_of_closures_id/Set/index.html new file mode 100644 index 0000000..58a33b4 --- /dev/null +++ b/ocaml/Set_of_closures_id/Set/index.html @@ -0,0 +1,2 @@ + +Set (ocaml.Set_of_closures_id.Set)

    Module Set_of_closures_id.Set

    include Set.S with type elt = T.t and type t = Set.Make(T).t

    Sets

    type elt = T.t

    The type of the set elements.

    The type of sets.

    val empty : t

    The empty set.

    val add : elt -> t -> t

    add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val singleton : elt -> t

    singleton x returns the one-element set containing only x.

    val remove : elt -> t -> t

    remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val union : t -> t -> t

    Set union.

    val inter : t -> t -> t

    Set intersection.

    val disjoint : t -> t -> bool

    Test if two sets are disjoint.

    • since 4.08
    val diff : t -> t -> t

    Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

    val cardinal : t -> int

    Return the number of elements of a set.

    Elements

    val elements : t -> elt list

    Return the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Set.Make.

    val min_elt : t -> elt

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

    val min_elt_opt : t -> elt option

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

    • since 4.05
    val max_elt : t -> elt

    Same as min_elt, but returns the largest element of the given set.

    val max_elt_opt : t -> elt option

    Same as min_elt_opt, but returns the largest element of the given set.

    • since 4.05
    val choose : t -> elt

    Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    val choose_opt : t -> elt option

    Return one element of the given set, or None if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    • since 4.05

    Searching

    val find : elt -> t -> elt

    find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

    • since 4.01
    val find_opt : elt -> t -> elt option

    find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

    • since 4.05
    val find_first : (elt -> bool) -> t -> elt

    find_first f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

    For example, find_first (fun e -> Ord.compare e x >= 0) s will return the first element e of s where Ord.compare e x >= 0 (intuitively: e >= x), or raise Not_found if x is greater than any element of s.

    • since 4.05
    val find_first_opt : (elt -> bool) -> t -> elt option

    find_first_opt f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

    • since 4.05
    val find_last : (elt -> bool) -> t -> elt

    find_last f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

    • since 4.05
    val find_last_opt : (elt -> bool) -> t -> elt option

    find_last_opt f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

    • since 4.05

    Traversing

    val iter : (elt -> unit) -> t -> unit

    iter f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.

    val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc

    fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

    Transforming

    val filter : (elt -> bool) -> t -> t

    filter f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val filter_map : (elt -> elt option) -> t -> t

    filter_map f s returns the set of all v such that f x = Some v for some element x of s.

    For example,

    filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) s

    is the set of halves of the even elements of s.

    If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned unchanged: the result of the function is then physically equal to s.

    • since 4.11
    val partition : (elt -> bool) -> t -> t * t

    partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

    val split : elt -> t -> t * bool * t

    split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.

    Predicates and comparisons

    val is_empty : t -> bool

    Test whether a set is empty or not.

    val mem : elt -> t -> bool

    mem x s tests whether x belongs to the set s.

    val equal : t -> t -> bool

    equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

    val compare : t -> t -> int

    Total ordering between sets. Can be used as the ordering function for doing sets of sets.

    val subset : t -> t -> bool

    subset s1 s2 tests whether the set s1 is a subset of the set s2.

    val for_all : (elt -> bool) -> t -> bool

    for_all f s checks if all elements of the set satisfy the predicate f.

    val exists : (elt -> bool) -> t -> bool

    exists f s checks if at least one element of the set satisfies the predicate f.

    Converting

    val to_list : t -> elt list

    to_list s is elements s.

    • since 5.1
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t

    to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

    • since 4.07
    val to_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in ascending order

    • since 4.07
    val to_rev_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in descending order

    • since 4.12
    val add_seq : elt Stdlib.Seq.t -> t -> t

    Add the given elements to the set, in order.

    • since 4.07
    val of_seq : elt Stdlib.Seq.t -> t

    Build a set from the given bindings

    • since 4.07
    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    val to_string : t -> string
    val of_list : elt list -> t
    val map : (elt -> elt) -> t -> t
    diff --git a/ocaml/Set_of_closures_id/T/index.html b/ocaml/Set_of_closures_id/T/index.html new file mode 100644 index 0000000..2c47114 --- /dev/null +++ b/ocaml/Set_of_closures_id/T/index.html @@ -0,0 +1,2 @@ + +T (ocaml.Set_of_closures_id.T)

    Module Set_of_closures_id.T

    type t = t
    include Hashtbl.HashedType with type t := t
    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val hash : t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := t
    val compare : t -> t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    diff --git a/ocaml/Set_of_closures_id/Tbl/index.html b/ocaml/Set_of_closures_id/Tbl/index.html new file mode 100644 index 0000000..260aff6 --- /dev/null +++ b/ocaml/Set_of_closures_id/Tbl/index.html @@ -0,0 +1,2 @@ + +Tbl (ocaml.Set_of_closures_id.Tbl)

    Module Set_of_closures_id.Tbl

    include Hashtbl.S with type key = T.t and type 'a t = 'a Hashtbl.Make(T).t
    type key = T.t
    val create : int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    • since 4.00
    val copy : 'a t -> 'a t
    val add : 'a t -> key -> 'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    • since 4.05
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key -> 'a -> unit
    val mem : 'a t -> key -> bool
    val iter : (key -> 'a -> unit) -> 'a t -> unit
    val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
    • since 4.03
    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc
    val length : 'a t -> int
    val stats : 'a t -> Stdlib.Hashtbl.statistics
    • since 4.00
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
    • since 4.07
    val to_seq_keys : _ t -> key Stdlib.Seq.t
    • since 4.07
    val to_seq_values : 'a t -> 'a Stdlib.Seq.t
    • since 4.07
    val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
    • since 4.07
    val to_list : 'a t -> (T.t * 'a) list
    val of_list : (T.t * 'a) list -> 'a t
    val to_map : 'a t -> 'a Stdlib.Map.Make(T).t
    val of_map : 'a Stdlib.Map.Make(T).t -> 'a t
    val memoize : 'a t -> (key -> 'a) -> key -> 'a
    val map : 'a t -> ('a -> 'b) -> 'b t
    diff --git a/ocaml/Set_of_closures_id/index.html b/ocaml/Set_of_closures_id/index.html new file mode 100644 index 0000000..d6d3395 --- /dev/null +++ b/ocaml/Set_of_closures_id/index.html @@ -0,0 +1,2 @@ + +Set_of_closures_id (ocaml.Set_of_closures_id)

    Module Set_of_closures_id

    An identifier, unique across the whole program, that identifies a set of closures (viz. Set_of_closures).

    include Identifiable.S
    type t
    module T : Identifiable.Thing with type t = t
    include Identifiable.Thing with type t := T.t
    include Hashtbl.HashedType with type t := T.t
    val equal : T.t -> T.t -> bool

    The equality predicate used to compare keys.

    val hash : T.t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := T.t
    val compare : T.t -> T.t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> T.t -> unit
    val print : Stdlib.Format.formatter -> T.t -> unit
    module Set : Identifiable.Set with module T := T
    module Map : Identifiable.Map with module T := T
    module Tbl : Identifiable.Tbl with module T := T
    val create : ?name:string -> Compilation_unit.t -> t
    val name : t -> string option
    val get_compilation_unit : t -> Compilation_unit.t
    diff --git a/ocaml/Set_of_closures_origin/Map/index.html b/ocaml/Set_of_closures_origin/Map/index.html new file mode 100644 index 0000000..4e761f4 --- /dev/null +++ b/ocaml/Set_of_closures_origin/Map/index.html @@ -0,0 +1,17 @@ + +Map (ocaml.Set_of_closures_origin.Map)

    Module Set_of_closures_origin.Map

    include Map.S with type key = T.t and type 'a t = 'a Map.Make(T).t

    Maps

    type key = T.t

    The type of the map keys.

    type 'a t = 'a Stdlib.Map.Make(T).t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key -> 'a -> 'a t -> 'a t

    add key data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key -> 'a -> 'a list t -> 'a list t

    add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

    update key f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : (key -> bool) -> 'a t -> key * 'a

    find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : (key -> bool) -> 'a t -> key * 'a

    find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : (key -> 'a -> unit) -> 'a t -> unit

    iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

    fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : (key -> 'a -> bool) -> 'a t -> 'a t

    filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : (key -> 'a -> bool) -> 'a t -> bool

    for_all f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : (key -> 'a -> bool) -> 'a t -> bool

    exists f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Stdlib.Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Stdlib.Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    val of_list : (key * 'a) list -> 'a t
    val disjoint_union : + ?eq:('a -> 'a -> bool) -> + ?print:(Stdlib.Format.formatter -> 'a -> unit) -> + 'a t -> + 'a t -> + 'a t

    disjoint_union m1 m2 contains all bindings from m1 and m2. If some binding is present in both and the associated value is not equal, a Fatal_error is raised

    val union_right : 'a t -> 'a t -> 'a t

    union_right m1 m2 contains all bindings from m1 and m2. If some binding is present in both, the one from m2 is taken

    val union_left : 'a t -> 'a t -> 'a t

    union_left m1 m2 = union_right m2 m1

    val union_merge : ('a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
    val rename : key t -> key -> key
    val map_keys : (key -> key) -> 'a t -> 'a t
    val keys : 'a t -> Stdlib.Set.Make(T).t
    val data : 'a t -> 'a list
    val of_set : (key -> 'a) -> Stdlib.Set.Make(T).t -> 'a t
    val transpose_keys_and_data : key t -> key t
    val transpose_keys_and_data_set : key t -> Stdlib.Set.Make(T).t t
    val print : + (Stdlib.Format.formatter -> 'a -> unit) -> + Stdlib.Format.formatter -> + 'a t -> + unit
    diff --git a/ocaml/Set_of_closures_origin/Set/index.html b/ocaml/Set_of_closures_origin/Set/index.html new file mode 100644 index 0000000..b9a060e --- /dev/null +++ b/ocaml/Set_of_closures_origin/Set/index.html @@ -0,0 +1,2 @@ + +Set (ocaml.Set_of_closures_origin.Set)

    Module Set_of_closures_origin.Set

    include Set.S with type elt = T.t and type t = Set.Make(T).t

    Sets

    type elt = T.t

    The type of the set elements.

    The type of sets.

    val empty : t

    The empty set.

    val add : elt -> t -> t

    add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val singleton : elt -> t

    singleton x returns the one-element set containing only x.

    val remove : elt -> t -> t

    remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val union : t -> t -> t

    Set union.

    val inter : t -> t -> t

    Set intersection.

    val disjoint : t -> t -> bool

    Test if two sets are disjoint.

    • since 4.08
    val diff : t -> t -> t

    Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

    val cardinal : t -> int

    Return the number of elements of a set.

    Elements

    val elements : t -> elt list

    Return the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Set.Make.

    val min_elt : t -> elt

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

    val min_elt_opt : t -> elt option

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

    • since 4.05
    val max_elt : t -> elt

    Same as min_elt, but returns the largest element of the given set.

    val max_elt_opt : t -> elt option

    Same as min_elt_opt, but returns the largest element of the given set.

    • since 4.05
    val choose : t -> elt

    Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    val choose_opt : t -> elt option

    Return one element of the given set, or None if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    • since 4.05

    Searching

    val find : elt -> t -> elt

    find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

    • since 4.01
    val find_opt : elt -> t -> elt option

    find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

    • since 4.05
    val find_first : (elt -> bool) -> t -> elt

    find_first f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

    For example, find_first (fun e -> Ord.compare e x >= 0) s will return the first element e of s where Ord.compare e x >= 0 (intuitively: e >= x), or raise Not_found if x is greater than any element of s.

    • since 4.05
    val find_first_opt : (elt -> bool) -> t -> elt option

    find_first_opt f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

    • since 4.05
    val find_last : (elt -> bool) -> t -> elt

    find_last f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

    • since 4.05
    val find_last_opt : (elt -> bool) -> t -> elt option

    find_last_opt f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

    • since 4.05

    Traversing

    val iter : (elt -> unit) -> t -> unit

    iter f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.

    val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc

    fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

    Transforming

    val filter : (elt -> bool) -> t -> t

    filter f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val filter_map : (elt -> elt option) -> t -> t

    filter_map f s returns the set of all v such that f x = Some v for some element x of s.

    For example,

    filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) s

    is the set of halves of the even elements of s.

    If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned unchanged: the result of the function is then physically equal to s.

    • since 4.11
    val partition : (elt -> bool) -> t -> t * t

    partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

    val split : elt -> t -> t * bool * t

    split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.

    Predicates and comparisons

    val is_empty : t -> bool

    Test whether a set is empty or not.

    val mem : elt -> t -> bool

    mem x s tests whether x belongs to the set s.

    val equal : t -> t -> bool

    equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

    val compare : t -> t -> int

    Total ordering between sets. Can be used as the ordering function for doing sets of sets.

    val subset : t -> t -> bool

    subset s1 s2 tests whether the set s1 is a subset of the set s2.

    val for_all : (elt -> bool) -> t -> bool

    for_all f s checks if all elements of the set satisfy the predicate f.

    val exists : (elt -> bool) -> t -> bool

    exists f s checks if at least one element of the set satisfies the predicate f.

    Converting

    val to_list : t -> elt list

    to_list s is elements s.

    • since 5.1
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t

    to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

    • since 4.07
    val to_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in ascending order

    • since 4.07
    val to_rev_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in descending order

    • since 4.12
    val add_seq : elt Stdlib.Seq.t -> t -> t

    Add the given elements to the set, in order.

    • since 4.07
    val of_seq : elt Stdlib.Seq.t -> t

    Build a set from the given bindings

    • since 4.07
    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    val to_string : t -> string
    val of_list : elt list -> t
    val map : (elt -> elt) -> t -> t
    diff --git a/ocaml/Set_of_closures_origin/T/index.html b/ocaml/Set_of_closures_origin/T/index.html new file mode 100644 index 0000000..0ae09d9 --- /dev/null +++ b/ocaml/Set_of_closures_origin/T/index.html @@ -0,0 +1,2 @@ + +T (ocaml.Set_of_closures_origin.T)

    Module Set_of_closures_origin.T

    type t = t
    include Hashtbl.HashedType with type t := t
    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val hash : t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := t
    val compare : t -> t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    diff --git a/ocaml/Set_of_closures_origin/Tbl/index.html b/ocaml/Set_of_closures_origin/Tbl/index.html new file mode 100644 index 0000000..d111609 --- /dev/null +++ b/ocaml/Set_of_closures_origin/Tbl/index.html @@ -0,0 +1,2 @@ + +Tbl (ocaml.Set_of_closures_origin.Tbl)

    Module Set_of_closures_origin.Tbl

    include Hashtbl.S with type key = T.t and type 'a t = 'a Hashtbl.Make(T).t
    type key = T.t
    val create : int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    • since 4.00
    val copy : 'a t -> 'a t
    val add : 'a t -> key -> 'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    • since 4.05
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key -> 'a -> unit
    val mem : 'a t -> key -> bool
    val iter : (key -> 'a -> unit) -> 'a t -> unit
    val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
    • since 4.03
    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc
    val length : 'a t -> int
    val stats : 'a t -> Stdlib.Hashtbl.statistics
    • since 4.00
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
    • since 4.07
    val to_seq_keys : _ t -> key Stdlib.Seq.t
    • since 4.07
    val to_seq_values : 'a t -> 'a Stdlib.Seq.t
    • since 4.07
    val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
    • since 4.07
    val to_list : 'a t -> (T.t * 'a) list
    val of_list : (T.t * 'a) list -> 'a t
    val to_map : 'a t -> 'a Stdlib.Map.Make(T).t
    val of_map : 'a Stdlib.Map.Make(T).t -> 'a t
    val memoize : 'a t -> (key -> 'a) -> key -> 'a
    val map : 'a t -> ('a -> 'b) -> 'b t
    diff --git a/ocaml/Set_of_closures_origin/index.html b/ocaml/Set_of_closures_origin/index.html new file mode 100644 index 0000000..0df2a99 --- /dev/null +++ b/ocaml/Set_of_closures_origin/index.html @@ -0,0 +1,2 @@ + +Set_of_closures_origin (ocaml.Set_of_closures_origin)

    Module Set_of_closures_origin

    include Identifiable.S
    type t
    module T : Identifiable.Thing with type t = t
    include Identifiable.Thing with type t := T.t
    include Hashtbl.HashedType with type t := T.t
    val equal : T.t -> T.t -> bool

    The equality predicate used to compare keys.

    val hash : T.t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := T.t
    val compare : T.t -> T.t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> T.t -> unit
    val print : Stdlib.Format.formatter -> T.t -> unit
    module Set : Identifiable.Set with module T := T
    module Map : Identifiable.Map with module T := T
    module Tbl : Identifiable.Tbl with module T := T
    val create : Set_of_closures_id.t -> t
    val get_compilation_unit : t -> Compilation_unit.t
    diff --git a/ocaml/Shape/Item/Map/index.html b/ocaml/Shape/Item/Map/index.html new file mode 100644 index 0000000..9ae7e73 --- /dev/null +++ b/ocaml/Shape/Item/Map/index.html @@ -0,0 +1,8 @@ + +Map (ocaml.Shape.Item.Map)

    Module Item.Map

    Maps

    type key = t

    The type of the map keys.

    type !+'a t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key -> 'a -> 'a t -> 'a t

    add key data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key -> 'a -> 'a list t -> 'a list t

    add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

    update key f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : (key -> bool) -> 'a t -> key * 'a

    find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : (key -> bool) -> 'a t -> key * 'a

    find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : (key -> 'a -> unit) -> 'a t -> unit

    iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

    fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : (key -> 'a -> bool) -> 'a t -> 'a t

    filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : (key -> 'a -> bool) -> 'a t -> bool

    for_all f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : (key -> 'a -> bool) -> 'a t -> bool

    exists f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val of_list : (key * 'a) list -> 'a t

    of_list bs adds the bindings of bs to the empty map, in list order (if a key is bound twice in bs the last one takes over).

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    diff --git a/ocaml/Shape/Item/index.html b/ocaml/Shape/Item/index.html new file mode 100644 index 0000000..4b56a63 --- /dev/null +++ b/ocaml/Shape/Item/index.html @@ -0,0 +1,2 @@ + +Item (ocaml.Shape.Item)

    Module Shape.Item

    Shape's items are elements of a structure or, in the case of constructors and labels, elements of a record or variants definition seen as a structure. These structures model module components and nested types' constructors and labels.

    type t = string * Sig_component_kind.t
    val name : t -> string
    val kind : t -> Sig_component_kind.t
    val make : string -> Sig_component_kind.t -> t
    val value : Ident.t -> t
    val type_ : Ident.t -> t
    val constr : Ident.t -> t
    val label : Ident.t -> t
    val module_ : Ident.t -> t
    val module_type : Ident.t -> t
    val extension_constructor : Ident.t -> t
    val class_ : Ident.t -> t
    val class_type : Ident.t -> t
    val print : Stdlib.Format.formatter -> t -> unit
    module Map : Map.S with type key = t
    diff --git a/ocaml/Shape/Map/index.html b/ocaml/Shape/Map/index.html new file mode 100644 index 0000000..fcc24ed --- /dev/null +++ b/ocaml/Shape/Map/index.html @@ -0,0 +1,2 @@ + +Map (ocaml.Shape.Map)

    Module Shape.Map

    type shape = t
    type nonrec t = t Item.Map.t
    val empty : t
    val add : t -> Item.t -> shape -> t
    val add_value : t -> Ident.t -> Uid.t -> t
    val add_value_proj : t -> Ident.t -> shape -> t
    val add_type : t -> Ident.t -> shape -> t
    val add_type_proj : t -> Ident.t -> shape -> t
    val add_constr : t -> Ident.t -> shape -> t
    val add_constr_proj : t -> Ident.t -> shape -> t
    val add_label : t -> Ident.t -> Uid.t -> t
    val add_label_proj : t -> Ident.t -> shape -> t
    val add_module : t -> Ident.t -> shape -> t
    val add_module_proj : t -> Ident.t -> shape -> t
    val add_module_type : t -> Ident.t -> Uid.t -> t
    val add_module_type_proj : t -> Ident.t -> shape -> t
    val add_extcons : t -> Ident.t -> shape -> t
    val add_extcons_proj : t -> Ident.t -> shape -> t
    val add_class : t -> Ident.t -> Uid.t -> t
    val add_class_proj : t -> Ident.t -> shape -> t
    val add_class_type : t -> Ident.t -> Uid.t -> t
    val add_class_type_proj : t -> Ident.t -> shape -> t
    diff --git a/ocaml/Shape/Sig_component_kind/index.html b/ocaml/Shape/Sig_component_kind/index.html new file mode 100644 index 0000000..016a60a --- /dev/null +++ b/ocaml/Shape/Sig_component_kind/index.html @@ -0,0 +1,2 @@ + +Sig_component_kind (ocaml.Shape.Sig_component_kind)

    Module Shape.Sig_component_kind

    type t =
    1. | Value
    2. | Type
    3. | Constructor
    4. | Label
    5. | Module
    6. | Module_type
    7. | Extension_constructor
    8. | Class
    9. | Class_type
    val to_string : t -> string
    val can_appear_in_types : t -> bool

    Whether the name of a component of that kind can appear in a type.

    diff --git a/ocaml/Shape/Uid/Map/index.html b/ocaml/Shape/Uid/Map/index.html new file mode 100644 index 0000000..ac866f4 --- /dev/null +++ b/ocaml/Shape/Uid/Map/index.html @@ -0,0 +1,17 @@ + +Map (ocaml.Shape.Uid.Map)

    Module Uid.Map

    include Map.S with type key = T.t and type 'a t = 'a Map.Make(T).t

    Maps

    type key = T.t

    The type of the map keys.

    type 'a t = 'a Stdlib.Map.Make(T).t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key -> 'a -> 'a t -> 'a t

    add key data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key -> 'a -> 'a list t -> 'a list t

    add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

    update key f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : (key -> bool) -> 'a t -> key * 'a

    find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : (key -> bool) -> 'a t -> key * 'a

    find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : (key -> 'a -> unit) -> 'a t -> unit

    iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

    fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : (key -> 'a -> bool) -> 'a t -> 'a t

    filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : (key -> 'a -> bool) -> 'a t -> bool

    for_all f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : (key -> 'a -> bool) -> 'a t -> bool

    exists f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Stdlib.Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Stdlib.Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    val of_list : (key * 'a) list -> 'a t
    val disjoint_union : + ?eq:('a -> 'a -> bool) -> + ?print:(Stdlib.Format.formatter -> 'a -> unit) -> + 'a t -> + 'a t -> + 'a t

    disjoint_union m1 m2 contains all bindings from m1 and m2. If some binding is present in both and the associated value is not equal, a Fatal_error is raised

    val union_right : 'a t -> 'a t -> 'a t

    union_right m1 m2 contains all bindings from m1 and m2. If some binding is present in both, the one from m2 is taken

    val union_left : 'a t -> 'a t -> 'a t

    union_left m1 m2 = union_right m2 m1

    val union_merge : ('a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
    val rename : key t -> key -> key
    val map_keys : (key -> key) -> 'a t -> 'a t
    val keys : 'a t -> Stdlib.Set.Make(T).t
    val data : 'a t -> 'a list
    val of_set : (key -> 'a) -> Stdlib.Set.Make(T).t -> 'a t
    val transpose_keys_and_data : key t -> key t
    val transpose_keys_and_data_set : key t -> Stdlib.Set.Make(T).t t
    val print : + (Stdlib.Format.formatter -> 'a -> unit) -> + Stdlib.Format.formatter -> + 'a t -> + unit
    diff --git a/ocaml/Shape/Uid/Set/index.html b/ocaml/Shape/Uid/Set/index.html new file mode 100644 index 0000000..7379637 --- /dev/null +++ b/ocaml/Shape/Uid/Set/index.html @@ -0,0 +1,2 @@ + +Set (ocaml.Shape.Uid.Set)

    Module Uid.Set

    include Set.S with type elt = T.t and type t = Set.Make(T).t

    Sets

    type elt = T.t

    The type of the set elements.

    The type of sets.

    val empty : t

    The empty set.

    val add : elt -> t -> t

    add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val singleton : elt -> t

    singleton x returns the one-element set containing only x.

    val remove : elt -> t -> t

    remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val union : t -> t -> t

    Set union.

    val inter : t -> t -> t

    Set intersection.

    val disjoint : t -> t -> bool

    Test if two sets are disjoint.

    • since 4.08
    val diff : t -> t -> t

    Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

    val cardinal : t -> int

    Return the number of elements of a set.

    Elements

    val elements : t -> elt list

    Return the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Set.Make.

    val min_elt : t -> elt

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

    val min_elt_opt : t -> elt option

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

    • since 4.05
    val max_elt : t -> elt

    Same as min_elt, but returns the largest element of the given set.

    val max_elt_opt : t -> elt option

    Same as min_elt_opt, but returns the largest element of the given set.

    • since 4.05
    val choose : t -> elt

    Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    val choose_opt : t -> elt option

    Return one element of the given set, or None if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    • since 4.05

    Searching

    val find : elt -> t -> elt

    find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

    • since 4.01
    val find_opt : elt -> t -> elt option

    find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

    • since 4.05
    val find_first : (elt -> bool) -> t -> elt

    find_first f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

    For example, find_first (fun e -> Ord.compare e x >= 0) s will return the first element e of s where Ord.compare e x >= 0 (intuitively: e >= x), or raise Not_found if x is greater than any element of s.

    • since 4.05
    val find_first_opt : (elt -> bool) -> t -> elt option

    find_first_opt f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

    • since 4.05
    val find_last : (elt -> bool) -> t -> elt

    find_last f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

    • since 4.05
    val find_last_opt : (elt -> bool) -> t -> elt option

    find_last_opt f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

    • since 4.05

    Traversing

    val iter : (elt -> unit) -> t -> unit

    iter f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.

    val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc

    fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

    Transforming

    val filter : (elt -> bool) -> t -> t

    filter f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val filter_map : (elt -> elt option) -> t -> t

    filter_map f s returns the set of all v such that f x = Some v for some element x of s.

    For example,

    filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) s

    is the set of halves of the even elements of s.

    If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned unchanged: the result of the function is then physically equal to s.

    • since 4.11
    val partition : (elt -> bool) -> t -> t * t

    partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

    val split : elt -> t -> t * bool * t

    split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.

    Predicates and comparisons

    val is_empty : t -> bool

    Test whether a set is empty or not.

    val mem : elt -> t -> bool

    mem x s tests whether x belongs to the set s.

    val equal : t -> t -> bool

    equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

    val compare : t -> t -> int

    Total ordering between sets. Can be used as the ordering function for doing sets of sets.

    val subset : t -> t -> bool

    subset s1 s2 tests whether the set s1 is a subset of the set s2.

    val for_all : (elt -> bool) -> t -> bool

    for_all f s checks if all elements of the set satisfy the predicate f.

    val exists : (elt -> bool) -> t -> bool

    exists f s checks if at least one element of the set satisfies the predicate f.

    Converting

    val to_list : t -> elt list

    to_list s is elements s.

    • since 5.1
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t

    to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

    • since 4.07
    val to_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in ascending order

    • since 4.07
    val to_rev_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in descending order

    • since 4.12
    val add_seq : elt Stdlib.Seq.t -> t -> t

    Add the given elements to the set, in order.

    • since 4.07
    val of_seq : elt Stdlib.Seq.t -> t

    Build a set from the given bindings

    • since 4.07
    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    val to_string : t -> string
    val of_list : elt list -> t
    val map : (elt -> elt) -> t -> t
    diff --git a/ocaml/Shape/Uid/T/index.html b/ocaml/Shape/Uid/T/index.html new file mode 100644 index 0000000..ff10b78 --- /dev/null +++ b/ocaml/Shape/Uid/T/index.html @@ -0,0 +1,2 @@ + +T (ocaml.Shape.Uid.T)

    Module Uid.T

    type t = t
    include Hashtbl.HashedType with type t := t
    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val hash : t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := t
    val compare : t -> t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    diff --git a/ocaml/Shape/Uid/Tbl/index.html b/ocaml/Shape/Uid/Tbl/index.html new file mode 100644 index 0000000..a3f617c --- /dev/null +++ b/ocaml/Shape/Uid/Tbl/index.html @@ -0,0 +1,2 @@ + +Tbl (ocaml.Shape.Uid.Tbl)

    Module Uid.Tbl

    include Hashtbl.S with type key = T.t and type 'a t = 'a Hashtbl.Make(T).t
    type key = T.t
    val create : int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    • since 4.00
    val copy : 'a t -> 'a t
    val add : 'a t -> key -> 'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    • since 4.05
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key -> 'a -> unit
    val mem : 'a t -> key -> bool
    val iter : (key -> 'a -> unit) -> 'a t -> unit
    val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
    • since 4.03
    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc
    val length : 'a t -> int
    val stats : 'a t -> Stdlib.Hashtbl.statistics
    • since 4.00
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
    • since 4.07
    val to_seq_keys : _ t -> key Stdlib.Seq.t
    • since 4.07
    val to_seq_values : 'a t -> 'a Stdlib.Seq.t
    • since 4.07
    val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
    • since 4.07
    val to_list : 'a t -> (T.t * 'a) list
    val of_list : (T.t * 'a) list -> 'a t
    val to_map : 'a t -> 'a Stdlib.Map.Make(T).t
    val of_map : 'a Stdlib.Map.Make(T).t -> 'a t
    val memoize : 'a t -> (key -> 'a) -> key -> 'a
    val map : 'a t -> ('a -> 'b) -> 'b t
    diff --git a/ocaml/Shape/Uid/index.html b/ocaml/Shape/Uid/index.html new file mode 100644 index 0000000..3c70c6f --- /dev/null +++ b/ocaml/Shape/Uid/index.html @@ -0,0 +1,2 @@ + +Uid (ocaml.Shape.Uid)

    Module Shape.Uid

    A Uid.t is associated to every declaration in signatures and implementations. They uniquely identify bindings in the program. When associated with these bindings' locations they are useful to external tools when trying to jump to an identifier's declaration or definition. They are stored to that effect in the uid_to_decl table of cmt files.

    type t = private
    1. | Compilation_unit of string
    2. | Item of {
      1. comp_unit : string;
      2. id : int;
      }
    3. | Internal
    4. | Predef of string
    val reinit : unit -> unit
    val mk : current_unit:string -> t
    val of_compilation_unit_id : Ident.t -> t
    val of_predef_id : Ident.t -> t
    val internal_not_actually_unique : t
    val for_actual_declaration : t -> bool
    include Identifiable.S with type t := t
    module T : Identifiable.Thing with type t = t
    include Identifiable.Thing with type t := T.t
    include Hashtbl.HashedType with type t := T.t
    val equal : T.t -> T.t -> bool

    The equality predicate used to compare keys.

    val hash : T.t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := T.t
    val compare : T.t -> T.t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> T.t -> unit
    val print : Stdlib.Format.formatter -> T.t -> unit
    module Set : Identifiable.Set with module T := T
    module Map : Identifiable.Map with module T := T
    module Tbl : Identifiable.Tbl with module T := T
    diff --git a/ocaml/Shape/index.html b/ocaml/Shape/index.html new file mode 100644 index 0000000..dab2b29 --- /dev/null +++ b/ocaml/Shape/index.html @@ -0,0 +1,6 @@ + +Shape (ocaml.Shape)

    Module Shape

    Shapes are an abstract representation of modules' implementations which allow the tracking of definitions through functor applications and other module-level operations.

    The Shape of a compilation unit is elaborated during typing, partially reduced (without loading external shapes) and written to the cmt file.

    External tools can retrieve the definition of any value (or type, or module, etc) by following this procedure:

    • Build the Shape corresponding to the value's path: let shape = Env.shape_of_path ~namespace env path
    • Instantiate the Shape_reduce.Make functor with a way to load shapes from external units and to looks for shapes in the environment (usually using Env.shape_of_path).
    • Completely reduce the shape: let shape = My_reduce.(weak_)reduce env shape
    • The Uid.t stored in the reduced shape should be the one of the definition. However, if the approximate field of the reduced shape is true then the Uid.t will not correspond to the definition, but to the closest parent module's uid. This happens when Shape reduction gets stuck, for example when hitting first-class modules.
    • The location of the definition can be easily found with the cmt_format.cmt_uid_to_decl table of the corresponding compilation unit.

    See:

    module Uid : sig ... end

    A Uid.t is associated to every declaration in signatures and implementations. They uniquely identify bindings in the program. When associated with these bindings' locations they are useful to external tools when trying to jump to an identifier's declaration or definition. They are stored to that effect in the uid_to_decl table of cmt files.

    module Sig_component_kind : sig ... end
    module Item : sig ... end

    Shape's items are elements of a structure or, in the case of constructors and labels, elements of a record or variants definition seen as a structure. These structures model module components and nested types' constructors and labels.

    type var = Ident.t
    type t = {
    1. uid : Uid.t option;
    2. desc : desc;
    3. approximated : bool;
    }
    and desc =
    1. | Var of var
    2. | Abs of var * t
    3. | App of t * t
    4. | Struct of t Item.Map.t
    5. | Alias of t
    6. | Leaf
    7. | Proj of t * Item.t
    8. | Comp_unit of string
    9. | Error of string
    val print : Stdlib.Format.formatter -> t -> unit
    val strip_head_aliases : t -> t
    val for_unnamed_functor_param : var
    val fresh_var : ?name:string -> Uid.t -> var * t
    val var : Uid.t -> Ident.t -> t
    val abs : ?uid:Uid.t -> var -> t -> t
    val app : ?uid:Uid.t -> t -> arg:t -> t
    val str : ?uid:Uid.t -> t Item.Map.t -> t
    val alias : ?uid:Uid.t -> t -> t
    val proj : ?uid:Uid.t -> t -> Item.t -> t
    val leaf : Uid.t -> t
    val decompose_abs : t -> (var * t) option
    val for_persistent_unit : string -> t
    val leaf_for_unpack : t
    module Map : sig ... end
    val dummy_mod : t
    val of_path : + find_shape:(Sig_component_kind.t -> Ident.t -> t) -> + namespace:Sig_component_kind.t -> + Path.t -> + t

    This function returns the shape corresponding to a given path. It requires a callback to find shapes in the environment. It is generally more useful to rely directly on the Env.shape_of_path function to get the shape associated with a given path.

    val set_uid_if_none : t -> Uid.t -> t
    diff --git a/ocaml/Shape_reduce/Make/argument-1-_/index.html b/ocaml/Shape_reduce/Make/argument-1-_/index.html new file mode 100644 index 0000000..f93108e --- /dev/null +++ b/ocaml/Shape_reduce/Make/argument-1-_/index.html @@ -0,0 +1,2 @@ + +_ (ocaml.Shape_reduce.Make._)

    Parameter Make._

    val fuel : int
    val read_unit_shape : unit_name:string -> Shape.t option
    diff --git a/ocaml/Shape_reduce/Make/index.html b/ocaml/Shape_reduce/Make/index.html new file mode 100644 index 0000000..da2fe50 --- /dev/null +++ b/ocaml/Shape_reduce/Make/index.html @@ -0,0 +1,2 @@ + +Make (ocaml.Shape_reduce.Make)

    Module Shape_reduce.Make

    The Make functor is used to generate a reduction function for shapes.

    It is parametrized by:

    • a function to load the shape of an external compilation unit
    • some fuel, which is used to bound recursion when dealing with recursive shapes introduced by recursive modules. (FTR: merlin currently uses a fuel of 10, which seems to be enough for most practical examples)

    Usage warning: To ensure good performances, every reduction made with the same instance of that functor share the same ident-based memoization tables. Such an instance should only be used to perform reduction inside a unique compilation unit to prevent conflicting entries in these memoization tables.

    Parameters

    module _ : sig ... end

    Signature

    val reduce : Env.t -> Shape.t -> Shape.t
    val reduce_for_uid : Env.t -> Shape.t -> result

    Perform weak reduction and return the head's uid if any. If reduction was incomplete the partially reduced shape is returned.

    diff --git a/ocaml/Shape_reduce/index.html b/ocaml/Shape_reduce/index.html new file mode 100644 index 0000000..463c8d1 --- /dev/null +++ b/ocaml/Shape_reduce/index.html @@ -0,0 +1,2 @@ + +Shape_reduce (ocaml.Shape_reduce)

    Module Shape_reduce

    type result =
    1. | Resolved of Shape.Uid.t
      (*

      Shape reduction succeeded and a uid was found

      *)
    2. | Resolved_alias of Shape.Uid.t * result
      (*

      Reduction led to an alias

      *)
    3. | Unresolved of Shape.t
      (*

      Result still contains Comp_unit terms

      *)
    4. | Approximated of Shape.Uid.t option
      (*

      Reduction failed: it can arrive with first-class modules for example

      *)
    5. | Internal_error_missing_uid
      (*

      Reduction succeeded but no uid was found, this should never happen

      *)

    The result of reducing a shape and looking for its uid

    val print_result : Stdlib.Format.formatter -> result -> unit
    module Make (_ : sig ... end) : sig ... end

    The Make functor is used to generate a reduction function for shapes.

    val local_reduce : Env.t -> Shape.t -> Shape.t

    local_reduce will not reduce shapes that require loading external compilation units.

    val local_reduce_for_uid : Env.t -> Shape.t -> result

    local_reduce_for_uid will not reduce shapes that require loading external compilation units.

    diff --git a/ocaml/Share_constants/index.html b/ocaml/Share_constants/index.html new file mode 100644 index 0000000..385a67e --- /dev/null +++ b/ocaml/Share_constants/index.html @@ -0,0 +1,2 @@ + +Share_constants (ocaml.Share_constants)

    Module Share_constants

    Share lifted constants that are eligible for sharing (e.g. not strings) and have equal definitions.

    val share_constants : Flambda.program -> Flambda.program
    diff --git a/ocaml/Signature_group/index.html b/ocaml/Signature_group/index.html new file mode 100644 index 0000000..e343cce --- /dev/null +++ b/ocaml/Signature_group/index.html @@ -0,0 +1,7 @@ + +Signature_group (ocaml.Signature_group)

    Module Signature_group

    Iterate on signature by syntactic group of items

    Classes, class types and private row types adds ghost components to the signature where they are defined.

    When editing or printing a signature it is therefore important to identify those ghost components.

    This module provides type grouping together ghost components with the corresponding core item (or recursive group) and the corresponding iterators.

    type sig_item = {
    1. src : Types.signature_item;
      (*

      the syntactic item

      *)
    2. post_ghosts : Types.signature_item list;
      (*

      ghost classes types are post-declared

      *)
    }

    Classes and class types generate ghosts signature items, we group them together before printing

    val flatten : sig_item -> Types.signature

    flatten sig_item is x.src :: x.post_ghosts

    type core_rec_group =
    1. | Not_rec of sig_item
    2. | Rec_group of sig_item list

    A group of mutually recursive definition

    val rec_items : core_rec_group -> sig_item list

    rec_items group is the list of sig_items in the group

    type rec_group = {
    1. pre_ghosts : Types.signature_item list;
    2. group : core_rec_group;
    }

    Private #row types are manifested as a sequence of definitions preceding a recursive group, we collect them and separate them from the syntactic recursive group.

    val next : Types.signature -> (rec_group * Types.signature) option

    The sequence seq signature iterates over signature rec_group by rec_group. The second element of the tuple in the full_seq case is the not-yet traversed part of the signature.

    val iter : (rec_group -> unit) -> Types.signature -> unit
    val fold : ('acc -> rec_group -> 'acc) -> 'acc -> Types.signature -> 'acc
    type in_place_patch = {
    1. ghosts : Types.signature;
      (*

      updated list of ghost items

      *)
    2. replace_by : Types.signature_item option;
      (*

      replacement for the selected item

      *)
    }

    Describe how to amend one element of a signature

    val replace_in_place : + (ghosts:Types.signature -> + Types.signature_item -> + ('a * in_place_patch) option) -> + Types.signature -> + ('a * Types.signature) option

    !replace_in_place patch sg replaces the first element of the signature for which patch ~ghosts component returns Some (value,patch). The ghosts list is the current prefix of ghost components associated to component

    diff --git a/ocaml/Simple_value_approx/index.html b/ocaml/Simple_value_approx/index.html new file mode 100644 index 0000000..f511c87 --- /dev/null +++ b/ocaml/Simple_value_approx/index.html @@ -0,0 +1,68 @@ + +Simple_value_approx (ocaml.Simple_value_approx)

    Module Simple_value_approx

    Simple approximations to the runtime results of computations. This pass is designed for speed rather than accuracy; the performance is important since it is used heavily during inlining.

    type 'a boxed_int =
    1. | Int32 : int32 boxed_int
    2. | Int64 : int64 boxed_int
    3. | Nativeint : nativeint boxed_int
    type value_string = {
    1. contents : string option;
    2. size : int;
    }
    type unresolved_value =
    1. | Set_of_closures_id of Set_of_closures_id.t
    2. | Symbol of Symbol.t
    type unknown_because_of =
    1. | Unresolved_value of unresolved_value
    2. | Other
    type t = private {
    1. descr : descr;
    2. var : Variable.t option;
    3. symbol : (Symbol.t * int option) option;
    }

    A value of type t corresponds to an "approximation" of the result of a computation in the program being compiled. That is to say, it represents what knowledge we have about such a result at compile time. The simplification pass exploits this information to partially evaluate computations.

    At a high level, an approximation for a value v has three parts:

    • the "description" (for example, "the constant integer 42");
    • an optional variable;
    • an optional symbol or symbol field. If the variable (resp. symbol) is present then that variable (resp. symbol) may be used to obtain the value v.

    The exact semantics of the variable and symbol fields follows.

    Approximations are deduced at particular points in an expression tree, but may subsequently be propagated to other locations.

    At the point at which an approximation is built for some value v, we can construct a set of variables (call the set S) that are known to alias the same value v. Each member of S will have the same or a more precise descr field in its approximation relative to the approximation for v. (An increase in precision may currently be introduced for pattern matches.) If S is non-empty then it is guaranteed that there is a unique member of S that was declared in a scope further out ("earlier") than all other members of S. If such a member exists then it is recorded in the var field. Otherwise var is None.

    Analogous to the construction of the set S, we can construct a set T consisting of all symbols that are known to alias the value whose approximation is being constructed. If T is non-empty then the symbol field is set to some member of T; it does not matter which one. (There is no notion of scope for symbols.)

    Note about mutable blocks:

    Mutable blocks are always represented by Value_unknown or Value_bottom. Any other approximation could leave the door open to a miscompilation. Such bad scenarios are most likely a user using Obj.magic or Obj.set_field in an inappropriate situation. Such a situation might be: let x = (1, 1) in Obj.set_field (Obj.repr x) 0 (Obj.repr 2); assert(fst x = 2) The user would probably expect the assertion to be true, but the compiler could in fact propagate the value of x across the Obj.set_field.

    Insisting that mutable blocks have Value_unknown or Value_bottom approximations certainly won't always prevent this kind of error, but should help catch many of them.

    It is possible that there may be some false positives, with correct but unreachable code causing this check to fail. However the likelihood of this seems sufficiently low, especially compared to the advantages gained by performing the check, that we include it.

    An example of a pattern that might trigger a false positive is: type a = { a : int } type b = { mutable b : int } type _ t = | A : a t | B : b t let f (type x) (v:x t) (r:x) = match v with | A -> r.a | B -> r.b <- 2; 3 let v = let r = ref A in r := A; (* Some pattern that the compiler can't understand *) f !r { a = 1 } When inlining f, the B branch is unreachable, yet the compiler cannot prove it and must therefore keep it.

    and descr = private
    1. | Value_block of Tag.t * t array
    2. | Value_int of int
    3. | Value_char of char
    4. | Value_float of float option
    5. | Value_boxed_int : 'a boxed_int * 'a -> descr
    6. | Value_set_of_closures of value_set_of_closures
    7. | Value_closure of value_closure
    8. | Value_string of value_string
    9. | Value_float_array of value_float_array
    10. | Value_unknown of unknown_because_of
    11. | Value_bottom
    12. | Value_extern of Export_id.t
    13. | Value_symbol of Symbol.t
    14. | Value_unresolved of unresolved_value
    and value_closure = {
    1. set_of_closures : t;
    2. closure_id : Closure_id.t;
    }
    and function_declarations = private {
    1. is_classic_mode : bool;
    2. set_of_closures_id : Set_of_closures_id.t;
    3. set_of_closures_origin : Set_of_closures_origin.t;
    4. funs : function_declaration Variable.Map.t;
    }
    and function_body = private {
    1. free_variables : Variable.Set.t;
    2. free_symbols : Symbol.Set.t;
    3. stub : bool;
    4. dbg : Debuginfo.t;
    5. inline : Lambda.inline_attribute;
    6. specialise : Lambda.specialise_attribute;
    7. is_a_functor : bool;
    8. body : Flambda.t;
    9. poll : Lambda.poll_attribute;
    }
    and function_declaration = private {
    1. closure_origin : Closure_origin.t;
    2. params : Parameter.t list;
    3. function_body : function_body option;
    }
    and value_set_of_closures = private {
    1. function_decls : function_declarations;
    2. bound_vars : t Var_within_closure.Map.t;
    3. free_vars : Flambda.specialised_to Variable.Map.t;
    4. invariant_params : Variable.Set.t Variable.Map.t Stdlib.Lazy.t;
    5. recursive : Variable.Set.t Stdlib.Lazy.t;
    6. size : int option Variable.Map.t Stdlib.Lazy.t;
      (*

      For functions that are very likely to be inlined, the size of the function's body.

      *)
    7. specialised_args : Flambda.specialised_to Variable.Map.t;
    8. freshening : Freshening.Project_var.t;
    9. direct_call_surrogates : Closure_id.t Closure_id.Map.t;
    }
    and value_float_array_contents =
    1. | Contents of t array
    2. | Unknown_or_mutable
    and value_float_array = {
    1. contents : value_float_array_contents;
    2. size : int;
    }
    val descr : t -> descr

    Extraction of the description of approximation(s).

    val descrs : t list -> descr list
    val print : Stdlib.Format.formatter -> t -> unit

    Pretty-printing of approximations to a formatter.

    val print_descr : Stdlib.Format.formatter -> descr -> unit
    val print_value_set_of_closures : + Stdlib.Format.formatter -> + value_set_of_closures -> + unit
    val print_function_declarations : + Stdlib.Format.formatter -> + function_declarations -> + unit
    val function_declarations_approx : + keep_body:(Variable.t -> Flambda.function_declaration -> bool) -> + Flambda.function_declarations -> + function_declarations
    val create_value_set_of_closures : + function_decls:function_declarations -> + bound_vars:t Var_within_closure.Map.t -> + free_vars:Flambda.specialised_to Variable.Map.t -> + invariant_params:Variable.Set.t Variable.Map.t lazy_t -> + recursive:Variable.Set.t Stdlib.Lazy.t -> + specialised_args:Flambda.specialised_to Variable.Map.t -> + freshening:Freshening.Project_var.t -> + direct_call_surrogates:Closure_id.t Closure_id.Map.t -> + value_set_of_closures
    val update_freshening_of_value_set_of_closures : + value_set_of_closures -> + freshening:Freshening.Project_var.t -> + value_set_of_closures
    val value_unknown : unknown_because_of -> t

    Basic construction of approximations.

    val value_int : int -> t
    val value_char : char -> t
    val value_float : float -> t
    val value_any_float : t
    val value_mutable_float_array : size:int -> t
    val value_immutable_float_array : t array -> t
    val value_string : int -> string option -> t
    val value_boxed_int : 'i boxed_int -> 'i -> t
    val value_block : Tag.t -> t array -> t
    val value_extern : Export_id.t -> t
    val value_symbol : Symbol.t -> t
    val value_bottom : t
    val value_unresolved : unresolved_value -> t
    val value_closure : + ?closure_var:Variable.t -> + ?set_of_closures_var:Variable.t -> + ?set_of_closures_symbol:Symbol.t -> + value_set_of_closures -> + Closure_id.t -> + t

    Construct a closure approximation given the approximation of the corresponding set of closures and the closure ID of the closure to be projected from such set. closure_var and/or set_of_closures_var may be specified to augment the approximation with variables that may be used to access the closure value itself, so long as they are in scope at the proposed point of use.

    val value_set_of_closures : + ?set_of_closures_var:Variable.t -> + value_set_of_closures -> + t

    Construct a set of closures approximation. set_of_closures_var is as for the parameter of the same name in value_closure, above.

    val make_const_int : int -> Flambda.t * t

    Take the given constant and produce an appropriate approximation for it together with an Flambda expression representing it.

    val make_const_char : char -> Flambda.t * t
    val make_const_bool : bool -> Flambda.t * t
    val make_const_float : float -> Flambda.t * t
    val make_const_boxed_int : 'i boxed_int -> 'i -> Flambda.t * t
    val make_const_int_named : int -> Flambda.named * t
    val make_const_char_named : char -> Flambda.named * t
    val make_const_bool_named : bool -> Flambda.named * t
    val make_const_float_named : float -> Flambda.named * t
    val make_const_boxed_int_named : 'i boxed_int -> 'i -> Flambda.named * t
    val augment_with_variable : t -> Variable.t -> t

    Augment an approximation with a given variable (see comment above). If the approximation was already augmented with a variable, the one passed to this function replaces it within the approximation.

    val augment_with_symbol : t -> Symbol.t -> t

    Like augment_with_variable, but for symbol information.

    val augment_with_symbol_field : t -> Symbol.t -> int -> t

    Like augment_with_symbol, but for symbol field information.

    val replace_description : t -> descr -> t

    Replace the description within an approximation.

    val augment_with_kind : t -> Lambda.value_kind -> t

    Improve the description by taking the kind into account

    val augment_kind_with_approx : t -> Lambda.value_kind -> Lambda.value_kind

    Improve the kind by taking the description into account

    val equal_boxed_int : 'a boxed_int -> 'a -> 'b boxed_int -> 'b -> bool
    val meet : really_import_approx:(t -> t) -> t -> t -> t
    val known : t -> bool

    An approximation is "known" iff it is not Value_unknown.

    val useful : t -> bool

    An approximation is "useful" iff it is neither unknown nor bottom.

    val all_not_useful : t list -> bool

    Whether all approximations in the given list do *not* satisfy useful.

    val warn_on_mutation : t -> bool

    Whether to warn on attempts to mutate a value. It must have been resolved (it cannot be Value_extern or Value_symbol). (See comment above for further explanation.)

    type simplification_summary =
    1. | Nothing_done
    2. | Replaced_term
    type simplification_result = Flambda.t * simplification_summary * t
    type simplification_result_named = Flambda.named * simplification_summary * t
    val simplify : t -> Flambda.t -> simplification_result

    Given an expression and its approximation, attempt to simplify the expression to a constant (with associated approximation), taking into account whether the expression has any side effects.

    val simplify_using_env : + t -> + is_present_in_env:(Variable.t -> bool) -> + Flambda.t -> + simplification_result

    As for simplify, but also enables us to simplify based on equalities between variables. The caller must provide a function that tells us whether, if we simplify to a given variable, the value of that variable will be accessible in the current environment.

    val simplify_named : t -> Flambda.named -> simplification_result_named
    val simplify_named_using_env : + t -> + is_present_in_env:(Variable.t -> bool) -> + Flambda.named -> + simplification_result_named
    val simplify_var_to_var_using_env : + t -> + is_present_in_env:(Variable.t -> bool) -> + Variable.t option

    If the given approximation identifies another variable and is_present_in_env deems it to be in scope, return that variable (wrapped in a Some), otherwise return None.

    val simplify_var : t -> (Flambda.named * t) option
    type get_field_result =
    1. | Ok of t
    2. | Unreachable
    val get_field : t -> field_index:int -> get_field_result

    Given the approximation t of a value, expected to correspond to a block (in the Pmakeblock sense of the word), and a field index then return an appropriate approximation for that field of the block (or Unreachable if the code with the approximation t is unreachable). N.B. Not all cases of unreachable code are returned as Unreachable.

    type checked_approx_for_block =
    1. | Wrong
    2. | Ok of Tag.t * t array
    val check_approx_for_block : t -> checked_approx_for_block

    Try to prove that a value with the given approximation may be used as a block.

    val approx_for_bound_var : value_set_of_closures -> Var_within_closure.t -> t

    Find the approximation for a bound variable in a set-of-closures approximation. A fatal error is produced if the variable is not bound in the given approximation.

    val freshen_and_check_closure_id : + value_set_of_closures -> + Closure_id.t -> + Closure_id.t

    Given a set-of-closures approximation and a closure ID, apply any freshening specified by the approximation to the closure ID, and return the resulting ID. Causes a fatal error if the resulting closure ID does not correspond to any function declaration in the approximation.

    type strict_checked_approx_for_set_of_closures =
    1. | Wrong
    2. | Ok of Variable.t option * value_set_of_closures
    val strict_check_approx_for_set_of_closures : + t -> + strict_checked_approx_for_set_of_closures
    type checked_approx_for_set_of_closures =
    1. | Wrong
    2. | Unresolved of unresolved_value
    3. | Unknown
    4. | Unknown_because_of_unresolved_value of unresolved_value
    5. | Ok of Variable.t option * value_set_of_closures
    val check_approx_for_set_of_closures : t -> checked_approx_for_set_of_closures

    Try to prove that a value with the given approximation may be used as a set of closures. Values coming from external compilation units with unresolved approximations are permitted.

    type checked_approx_for_closure =
    1. | Wrong
    2. | Ok of value_closure + * Variable.t option + * Symbol.t option + * value_set_of_closures
    val check_approx_for_closure : t -> checked_approx_for_closure

    Try to prove that a value with the given approximation may be used as a closure. Values coming from external compilation units with unresolved approximations are not permitted.

    type checked_approx_for_closure_allowing_unresolved =
    1. | Wrong
    2. | Unresolved of unresolved_value
    3. | Unknown
    4. | Unknown_because_of_unresolved_value of unresolved_value
    5. | Ok of value_closure + * Variable.t option + * Symbol.t option + * value_set_of_closures
    val check_approx_for_closure_allowing_unresolved : + t -> + checked_approx_for_closure_allowing_unresolved

    As for check_approx_for_closure, but values coming from external compilation units with unresolved approximations are permitted.

    val check_approx_for_float : t -> float option

    Returns the value if it can be proved to be a constant float

    val float_array_as_constant : value_float_array -> float list option

    Returns the value if it can be proved to be a constant float array

    val check_approx_for_string : t -> string option

    Returns the value if it can be proved to be a constant string

    type switch_branch_selection =
    1. | Cannot_be_taken
    2. | Can_be_taken
    3. | Must_be_taken
    val potentially_taken_const_switch_branch : t -> int -> switch_branch_selection

    Check that the branch is compatible with the approximation

    val potentially_taken_block_switch_branch : t -> int -> switch_branch_selection
    val function_arity : function_declaration -> int
    val update_function_declarations : + function_declarations -> + funs:function_declaration Variable.Map.t -> + function_declarations

    Create a set of function declarations based on another set of function declarations.

    val update_function_declaration_body : + function_declaration -> + (Flambda.t -> Flambda.t) -> + function_declaration

    Creates a map from closure IDs to function declarations by iterating over all sets of closures in the given map.

    val clear_function_bodies : function_declarations -> function_declarations
    diff --git a/ocaml/Simplif/index.html b/ocaml/Simplif/index.html new file mode 100644 index 0000000..82d9f91 --- /dev/null +++ b/ocaml/Simplif/index.html @@ -0,0 +1,10 @@ + +Simplif (ocaml.Simplif)

    Module Simplif

    Lambda simplification.

    Warning: this module is unstable and part of compiler-libs.

    val simplify_lambda : Lambda.lambda -> Lambda.lambda
    val split_default_wrapper : + id:Ident.t -> + kind:Lambda.function_kind -> + params:(Ident.t * Lambda.value_kind) list -> + return:Lambda.value_kind -> + body:Lambda.lambda -> + attr:Lambda.function_attribute -> + loc:Lambda.scoped_location -> + Lambda.rec_binding list
    diff --git a/ocaml/Simplify_boxed_integer_ops/Simplify_boxed_int32/index.html b/ocaml/Simplify_boxed_integer_ops/Simplify_boxed_int32/index.html new file mode 100644 index 0000000..a7f85a0 --- /dev/null +++ b/ocaml/Simplify_boxed_integer_ops/Simplify_boxed_int32/index.html @@ -0,0 +1,20 @@ + +Simplify_boxed_int32 (ocaml.Simplify_boxed_integer_ops.Simplify_boxed_int32)

    Module Simplify_boxed_integer_ops.Simplify_boxed_int32

    diff --git a/ocaml/Simplify_boxed_integer_ops/Simplify_boxed_int64/index.html b/ocaml/Simplify_boxed_integer_ops/Simplify_boxed_int64/index.html new file mode 100644 index 0000000..4ff8532 --- /dev/null +++ b/ocaml/Simplify_boxed_integer_ops/Simplify_boxed_int64/index.html @@ -0,0 +1,20 @@ + +Simplify_boxed_int64 (ocaml.Simplify_boxed_integer_ops.Simplify_boxed_int64)

    Module Simplify_boxed_integer_ops.Simplify_boxed_int64

    diff --git a/ocaml/Simplify_boxed_integer_ops/Simplify_boxed_nativeint/index.html b/ocaml/Simplify_boxed_integer_ops/Simplify_boxed_nativeint/index.html new file mode 100644 index 0000000..add1f0f --- /dev/null +++ b/ocaml/Simplify_boxed_integer_ops/Simplify_boxed_nativeint/index.html @@ -0,0 +1,20 @@ + +Simplify_boxed_nativeint (ocaml.Simplify_boxed_integer_ops.Simplify_boxed_nativeint)

    Module Simplify_boxed_integer_ops.Simplify_boxed_nativeint

    diff --git a/ocaml/Simplify_boxed_integer_ops/index.html b/ocaml/Simplify_boxed_integer_ops/index.html new file mode 100644 index 0000000..91fc819 --- /dev/null +++ b/ocaml/Simplify_boxed_integer_ops/index.html @@ -0,0 +1,5 @@ + +Simplify_boxed_integer_ops (ocaml.Simplify_boxed_integer_ops)

    Module Simplify_boxed_integer_ops

    diff --git a/ocaml/Simplify_boxed_integer_ops_intf/index.html b/ocaml/Simplify_boxed_integer_ops_intf/index.html new file mode 100644 index 0000000..547d6b5 --- /dev/null +++ b/ocaml/Simplify_boxed_integer_ops_intf/index.html @@ -0,0 +1,2 @@ + +Simplify_boxed_integer_ops_intf (ocaml.Simplify_boxed_integer_ops_intf)

    Module Simplify_boxed_integer_ops_intf

    module type S = sig ... end
    diff --git a/ocaml/Simplify_boxed_integer_ops_intf/module-type-S/index.html b/ocaml/Simplify_boxed_integer_ops_intf/module-type-S/index.html new file mode 100644 index 0000000..59d981b --- /dev/null +++ b/ocaml/Simplify_boxed_integer_ops_intf/module-type-S/index.html @@ -0,0 +1,20 @@ + +S (ocaml.Simplify_boxed_integer_ops_intf.S)

    Module type Simplify_boxed_integer_ops_intf.S

    type t
    diff --git a/ocaml/Simplify_common/index.html b/ocaml/Simplify_common/index.html new file mode 100644 index 0000000..5744398 --- /dev/null +++ b/ocaml/Simplify_common/index.html @@ -0,0 +1,28 @@ + +Simplify_common (ocaml.Simplify_common)

    Module Simplify_common

    const_*_expr expr v annot, where the expression expr is known to evaluate to the value v, attempt to produce a more simple expression together with its approximation and the benefit gained by replacing expr with this new expression. This simplification is only performed if expr is known to have no side effects. Otherwise, expr itself is returned, with an appropriate approximation but zero benefit.

    const_boxed_int_expr takes an additional argument specifying the kind of boxed integer to which the given expression evaluates.

    val const_float_expr : + Flambda.named -> + float -> + Flambda.named * Simple_value_approx.t * Inlining_cost.Benefit.t
    val const_integer_comparison_expr : + Flambda.named -> + Lambda.integer_comparison -> + 'a -> + 'a -> + Flambda.named * Simple_value_approx.t * Inlining_cost.Benefit.t
    val const_float_comparison_expr : + Flambda.named -> + Lambda.float_comparison -> + float -> + float -> + Flambda.named * Simple_value_approx.t * Inlining_cost.Benefit.t
    val swap16 : int -> int

    Functions for transposing the order of bytes within words of various sizes.

    val swap32 : int32 -> int32
    val swap64 : int64 -> int64
    val swapnative : nativeint -> nativeint
    diff --git a/ocaml/Simplify_primitives/index.html b/ocaml/Simplify_primitives/index.html new file mode 100644 index 0000000..cbeb53e --- /dev/null +++ b/ocaml/Simplify_primitives/index.html @@ -0,0 +1,8 @@ + +Simplify_primitives (ocaml.Simplify_primitives)

    Module Simplify_primitives

    Simplifies an application of a primitive based on approximation information.

    diff --git a/ocaml/Spill/index.html b/ocaml/Spill/index.html new file mode 100644 index 0000000..be92dbb --- /dev/null +++ b/ocaml/Spill/index.html @@ -0,0 +1,2 @@ + +Spill (ocaml.Spill)

    Module Spill

    val fundecl : Mach.fundecl -> Mach.fundecl
    diff --git a/ocaml/Split/index.html b/ocaml/Split/index.html new file mode 100644 index 0000000..a7ecf8b --- /dev/null +++ b/ocaml/Split/index.html @@ -0,0 +1,2 @@ + +Split (ocaml.Split)

    Module Split

    val fundecl : Mach.fundecl -> Mach.fundecl
    val reset : unit -> unit
    diff --git a/ocaml/Stackframe/index.html b/ocaml/Stackframe/index.html new file mode 100644 index 0000000..59db17e --- /dev/null +++ b/ocaml/Stackframe/index.html @@ -0,0 +1,2 @@ + +Stackframe (ocaml.Stackframe)

    Module Stackframe

    val trap_handler_size : int
    diff --git a/ocaml/Stackframegen/class-stackframe_generic/index.html b/ocaml/Stackframegen/class-stackframe_generic/index.html new file mode 100644 index 0000000..3a030ef --- /dev/null +++ b/ocaml/Stackframegen/class-stackframe_generic/index.html @@ -0,0 +1,2 @@ + +stackframe_generic (ocaml.Stackframegen.stackframe_generic)

    Class Stackframegen.stackframe_generic

    method virtual trap_handler_size : int
    method is_call : Mach.instruction_desc -> bool
    method frame_required : Mach.fundecl -> bool -> bool
    method analyze : Mach.fundecl -> analysis_result
    diff --git a/ocaml/Stackframegen/index.html b/ocaml/Stackframegen/index.html new file mode 100644 index 0000000..e47a427 --- /dev/null +++ b/ocaml/Stackframegen/index.html @@ -0,0 +1,2 @@ + +Stackframegen (ocaml.Stackframegen)

    Module Stackframegen

    type analysis_result = {
    1. contains_nontail_calls : bool;
      (*

      Whether the function contains non-tail calls to OCaml functions. Calls to C functions don't count.

      *)
    2. frame_required : bool;
      (*

      Whether the function must allocate a stack frame on entry, for one of the following reasons:

      • some local variables are stack-allocated
      • the function needs to save its return address on the stack, e.g.: -- it contains a non-tail call to an OCaml function -- it calls a C function -- it contains an allocation or a poll point -- it performs an array bound check (on some ports)
      *)
    3. extra_stack_used : int;
      (*

      Amount of stack space used, in bytes, in addition to the initial stack frame. This counts trap handlers and "outgoing" stack slots used for parameter passing.

      *)
    }
    class virtual stackframe_generic : object ... end
    diff --git a/ocaml/Static_exception/Map/index.html b/ocaml/Static_exception/Map/index.html new file mode 100644 index 0000000..8f0cd15 --- /dev/null +++ b/ocaml/Static_exception/Map/index.html @@ -0,0 +1,17 @@ + +Map (ocaml.Static_exception.Map)

    Module Static_exception.Map

    include Map.S with type key = T.t and type 'a t = 'a Map.Make(T).t

    Maps

    type key = T.t

    The type of the map keys.

    type 'a t = 'a Stdlib.Map.Make(T).t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key -> 'a -> 'a t -> 'a t

    add key data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key -> 'a -> 'a list t -> 'a list t

    add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

    update key f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : (key -> bool) -> 'a t -> key * 'a

    find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : (key -> bool) -> 'a t -> key * 'a

    find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : (key -> 'a -> unit) -> 'a t -> unit

    iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

    fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : (key -> 'a -> bool) -> 'a t -> 'a t

    filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : (key -> 'a -> bool) -> 'a t -> bool

    for_all f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : (key -> 'a -> bool) -> 'a t -> bool

    exists f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Stdlib.Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Stdlib.Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    val of_list : (key * 'a) list -> 'a t
    val disjoint_union : + ?eq:('a -> 'a -> bool) -> + ?print:(Stdlib.Format.formatter -> 'a -> unit) -> + 'a t -> + 'a t -> + 'a t

    disjoint_union m1 m2 contains all bindings from m1 and m2. If some binding is present in both and the associated value is not equal, a Fatal_error is raised

    val union_right : 'a t -> 'a t -> 'a t

    union_right m1 m2 contains all bindings from m1 and m2. If some binding is present in both, the one from m2 is taken

    val union_left : 'a t -> 'a t -> 'a t

    union_left m1 m2 = union_right m2 m1

    val union_merge : ('a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
    val rename : key t -> key -> key
    val map_keys : (key -> key) -> 'a t -> 'a t
    val keys : 'a t -> Stdlib.Set.Make(T).t
    val data : 'a t -> 'a list
    val of_set : (key -> 'a) -> Stdlib.Set.Make(T).t -> 'a t
    val transpose_keys_and_data : key t -> key t
    val transpose_keys_and_data_set : key t -> Stdlib.Set.Make(T).t t
    val print : + (Stdlib.Format.formatter -> 'a -> unit) -> + Stdlib.Format.formatter -> + 'a t -> + unit
    diff --git a/ocaml/Static_exception/Set/index.html b/ocaml/Static_exception/Set/index.html new file mode 100644 index 0000000..b828587 --- /dev/null +++ b/ocaml/Static_exception/Set/index.html @@ -0,0 +1,2 @@ + +Set (ocaml.Static_exception.Set)

    Module Static_exception.Set

    include Set.S with type elt = T.t and type t = Set.Make(T).t

    Sets

    type elt = T.t

    The type of the set elements.

    The type of sets.

    val empty : t

    The empty set.

    val add : elt -> t -> t

    add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val singleton : elt -> t

    singleton x returns the one-element set containing only x.

    val remove : elt -> t -> t

    remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val union : t -> t -> t

    Set union.

    val inter : t -> t -> t

    Set intersection.

    val disjoint : t -> t -> bool

    Test if two sets are disjoint.

    • since 4.08
    val diff : t -> t -> t

    Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

    val cardinal : t -> int

    Return the number of elements of a set.

    Elements

    val elements : t -> elt list

    Return the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Set.Make.

    val min_elt : t -> elt

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

    val min_elt_opt : t -> elt option

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

    • since 4.05
    val max_elt : t -> elt

    Same as min_elt, but returns the largest element of the given set.

    val max_elt_opt : t -> elt option

    Same as min_elt_opt, but returns the largest element of the given set.

    • since 4.05
    val choose : t -> elt

    Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    val choose_opt : t -> elt option

    Return one element of the given set, or None if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    • since 4.05

    Searching

    val find : elt -> t -> elt

    find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

    • since 4.01
    val find_opt : elt -> t -> elt option

    find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

    • since 4.05
    val find_first : (elt -> bool) -> t -> elt

    find_first f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

    For example, find_first (fun e -> Ord.compare e x >= 0) s will return the first element e of s where Ord.compare e x >= 0 (intuitively: e >= x), or raise Not_found if x is greater than any element of s.

    • since 4.05
    val find_first_opt : (elt -> bool) -> t -> elt option

    find_first_opt f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

    • since 4.05
    val find_last : (elt -> bool) -> t -> elt

    find_last f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

    • since 4.05
    val find_last_opt : (elt -> bool) -> t -> elt option

    find_last_opt f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

    • since 4.05

    Traversing

    val iter : (elt -> unit) -> t -> unit

    iter f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.

    val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc

    fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

    Transforming

    val filter : (elt -> bool) -> t -> t

    filter f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val filter_map : (elt -> elt option) -> t -> t

    filter_map f s returns the set of all v such that f x = Some v for some element x of s.

    For example,

    filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) s

    is the set of halves of the even elements of s.

    If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned unchanged: the result of the function is then physically equal to s.

    • since 4.11
    val partition : (elt -> bool) -> t -> t * t

    partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

    val split : elt -> t -> t * bool * t

    split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.

    Predicates and comparisons

    val is_empty : t -> bool

    Test whether a set is empty or not.

    val mem : elt -> t -> bool

    mem x s tests whether x belongs to the set s.

    val equal : t -> t -> bool

    equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

    val compare : t -> t -> int

    Total ordering between sets. Can be used as the ordering function for doing sets of sets.

    val subset : t -> t -> bool

    subset s1 s2 tests whether the set s1 is a subset of the set s2.

    val for_all : (elt -> bool) -> t -> bool

    for_all f s checks if all elements of the set satisfy the predicate f.

    val exists : (elt -> bool) -> t -> bool

    exists f s checks if at least one element of the set satisfies the predicate f.

    Converting

    val to_list : t -> elt list

    to_list s is elements s.

    • since 5.1
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t

    to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

    • since 4.07
    val to_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in ascending order

    • since 4.07
    val to_rev_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in descending order

    • since 4.12
    val add_seq : elt Stdlib.Seq.t -> t -> t

    Add the given elements to the set, in order.

    • since 4.07
    val of_seq : elt Stdlib.Seq.t -> t

    Build a set from the given bindings

    • since 4.07
    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    val to_string : t -> string
    val of_list : elt list -> t
    val map : (elt -> elt) -> t -> t
    diff --git a/ocaml/Static_exception/T/index.html b/ocaml/Static_exception/T/index.html new file mode 100644 index 0000000..a3d01a2 --- /dev/null +++ b/ocaml/Static_exception/T/index.html @@ -0,0 +1,2 @@ + +T (ocaml.Static_exception.T)

    Module Static_exception.T

    type t = t
    include Hashtbl.HashedType with type t := t
    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val hash : t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := t
    val compare : t -> t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    diff --git a/ocaml/Static_exception/Tbl/index.html b/ocaml/Static_exception/Tbl/index.html new file mode 100644 index 0000000..50e9d7b --- /dev/null +++ b/ocaml/Static_exception/Tbl/index.html @@ -0,0 +1,2 @@ + +Tbl (ocaml.Static_exception.Tbl)

    Module Static_exception.Tbl

    include Hashtbl.S with type key = T.t and type 'a t = 'a Hashtbl.Make(T).t
    type key = T.t
    val create : int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    • since 4.00
    val copy : 'a t -> 'a t
    val add : 'a t -> key -> 'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    • since 4.05
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key -> 'a -> unit
    val mem : 'a t -> key -> bool
    val iter : (key -> 'a -> unit) -> 'a t -> unit
    val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
    • since 4.03
    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc
    val length : 'a t -> int
    val stats : 'a t -> Stdlib.Hashtbl.statistics
    • since 4.00
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
    • since 4.07
    val to_seq_keys : _ t -> key Stdlib.Seq.t
    • since 4.07
    val to_seq_values : 'a t -> 'a Stdlib.Seq.t
    • since 4.07
    val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
    • since 4.07
    val to_list : 'a t -> (T.t * 'a) list
    val of_list : (T.t * 'a) list -> 'a t
    val to_map : 'a t -> 'a Stdlib.Map.Make(T).t
    val of_map : 'a Stdlib.Map.Make(T).t -> 'a t
    val memoize : 'a t -> (key -> 'a) -> key -> 'a
    val map : 'a t -> ('a -> 'b) -> 'b t
    diff --git a/ocaml/Static_exception/index.html b/ocaml/Static_exception/index.html new file mode 100644 index 0000000..774d04b --- /dev/null +++ b/ocaml/Static_exception/index.html @@ -0,0 +1,2 @@ + +Static_exception (ocaml.Static_exception)

    Module Static_exception

    An identifier that is used to label static exceptions. Its uniqueness properties are unspecified.

    include Identifiable.S
    type t
    module T : Identifiable.Thing with type t = t
    include Identifiable.Thing with type t := T.t
    include Hashtbl.HashedType with type t := T.t
    val equal : T.t -> T.t -> bool

    The equality predicate used to compare keys.

    val hash : T.t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := T.t
    val compare : T.t -> T.t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> T.t -> unit
    val print : Stdlib.Format.formatter -> T.t -> unit
    module Set : Identifiable.Set with module T := T
    module Map : Identifiable.Map with module T := T
    module Tbl : Identifiable.Tbl with module T := T
    val create : unit -> t
    val to_int : t -> int
    diff --git a/ocaml/Std_exit/index.html b/ocaml/Std_exit/index.html new file mode 100644 index 0000000..1f29d8f --- /dev/null +++ b/ocaml/Std_exit/index.html @@ -0,0 +1,2 @@ + +Std_exit (ocaml.Std_exit)

    Module Std_exit

    diff --git a/ocaml/Stdlib/Arg/index.html b/ocaml/Stdlib/Arg/index.html new file mode 100644 index 0000000..a65d101 --- /dev/null +++ b/ocaml/Stdlib/Arg/index.html @@ -0,0 +1,38 @@ + +Arg (ocaml.Stdlib.Arg)

    Module Stdlib.Arg

    Parsing of command line arguments.

    This module provides a general mechanism for extracting options and arguments from the command line to the program. For example:

         let usage_msg = "append [-verbose] <file1> [<file2>] ... -o <output>"
+     let verbose = ref false
+     let input_files = ref []
+     let output_file = ref ""
+
+     let anon_fun filename =
+       input_files := filename::!input_files
+
+     let speclist =
+       [("-verbose", Arg.Set verbose, "Output debug information");
+        ("-o", Arg.Set_string output_file, "Set output file name")]
+
+     let () =
+       Arg.parse speclist anon_fun usage_msg;
+       (* Main functionality here *)

    Syntax of command lines: A keyword is a character string starting with a -. An option is a keyword alone or followed by an argument. The types of keywords are: Unit, Bool, Set, Clear, String, Set_string, Int, Set_int, Float, Set_float, Tuple, Symbol, Rest, Rest_all and Expand.

    Unit, Set and Clear keywords take no argument.

    A Rest or Rest_all keyword takes the remainder of the command line as arguments. (More explanations below.)

    Every other keyword takes the following word on the command line as argument. For compatibility with GNU getopt_long, keyword=arg is also allowed. Arguments not preceded by a keyword are called anonymous arguments.

    Examples (cmd is assumed to be the command name):

    • cmd -flag (a unit option)
    • cmd -int 1 (an int option with argument 1)
    • cmd -string foobar (a string option with argument "foobar")
    • cmd -float 12.34 (a float option with argument 12.34)
    • cmd a b c (three anonymous arguments: "a", "b", and "c")
    • cmd a b -- c d (two anonymous arguments and a rest option with two arguments)

    Rest takes a function that is called repeatedly for each remaining command line argument. Rest_all takes a function that is called once, with the list of all remaining arguments.

    Note that if no arguments follow a Rest keyword then the function is not called at all whereas the function for a Rest_all keyword is called with an empty list.

    • alert unsynchronized_access The Arg module relies on a mutable global state, parsing functions should only be called from a single domain.
    type spec =
    1. | Unit of unit -> unit
      (*

      Call the function with unit argument

      *)
    2. | Bool of bool -> unit
      (*

      Call the function with a bool argument

      *)
    3. | Set of bool ref
      (*

      Set the reference to true

      *)
    4. | Clear of bool ref
      (*

      Set the reference to false

      *)
    5. | String of string -> unit
      (*

      Call the function with a string argument

      *)
    6. | Set_string of string ref
      (*

      Set the reference to the string argument

      *)
    7. | Int of int -> unit
      (*

      Call the function with an int argument

      *)
    8. | Set_int of int ref
      (*

      Set the reference to the int argument

      *)
    9. | Float of float -> unit
      (*

      Call the function with a float argument

      *)
    10. | Set_float of float ref
      (*

      Set the reference to the float argument

      *)
    11. | Tuple of spec list
      (*

      Take several arguments according to the spec list

      *)
    12. | Symbol of string list * string -> unit
      (*

      Take one of the symbols as argument and call the function with the symbol

      *)
    13. | Rest of string -> unit
      (*

      Stop interpreting keywords and call the function with each remaining argument

      *)
    14. | Rest_all of string list -> unit
      (*

      Stop interpreting keywords and call the function with all remaining arguments

      *)
    15. | Expand of string -> string array
      (*

      If the remaining arguments to process are of the form ["-foo"; "arg"] @ rest where "foo" is registered as Expand f, then the arguments f "arg" @ rest are processed. Only allowed in parse_and_expand_argv_dynamic.

      *)

    The concrete type describing the behavior associated with a keyword.

    type key = string
    type doc = string
    type usage_msg = string
    type anon_fun = string -> unit
    val parse : (key * spec * doc) list -> anon_fun -> usage_msg -> unit

    Arg.parse speclist anon_fun usage_msg parses the command line. speclist is a list of triples (key, spec, doc). key is the option keyword, it must start with a '-' character. spec gives the option type and the function to call when this option is found on the command line. doc is a one-line description of this option. anon_fun is called on anonymous arguments. The functions in spec and anon_fun are called in the same order as their arguments appear on the command line.

    If an error occurs, Arg.parse exits the program, after printing to standard error an error message as follows:

    • The reason for the error: unknown option, invalid or missing argument, etc.
    • usage_msg
    • The list of options, each followed by the corresponding doc string. Beware: options that have an empty doc string will not be included in the list.

    For the user to be able to specify anonymous arguments starting with a -, include for example ("-", String anon_fun, doc) in speclist.

    By default, parse recognizes two unit options, -help and --help, which will print to standard output usage_msg and the list of options, and exit the program. You can override this behaviour by specifying your own -help and --help options in speclist.

    val parse_dynamic : + (key * spec * doc) list ref -> + anon_fun -> + usage_msg -> + unit

    Same as Arg.parse, except that the speclist argument is a reference and may be updated during the parsing. A typical use for this feature is to parse command lines of the form:

    • command subcommand options where the list of options depends on the value of the subcommand argument.
    • since 4.01
    val parse_argv : + ?current:int ref -> + string array -> + (key * spec * doc) list -> + anon_fun -> + usage_msg -> + unit

    Arg.parse_argv ~current args speclist anon_fun usage_msg parses the array args as if it were the command line. It uses and updates the value of ~current (if given), or Arg.current. You must set it before calling parse_argv. The initial value of current is the index of the program name (argument 0) in the array. If an error occurs, Arg.parse_argv raises Arg.Bad with the error message as argument. If option -help or --help is given, Arg.parse_argv raises Arg.Help with the help message as argument.

    val parse_argv_dynamic : + ?current:int ref -> + string array -> + (key * spec * doc) list ref -> + anon_fun -> + string -> + unit

    Same as Arg.parse_argv, except that the speclist argument is a reference and may be updated during the parsing. See Arg.parse_dynamic.

    • since 4.01
    val parse_and_expand_argv_dynamic : + int ref -> + string array ref -> + (key * spec * doc) list ref -> + anon_fun -> + string -> + unit

    Same as Arg.parse_argv_dynamic, except that the argv argument is a reference and may be updated during the parsing of Expand arguments. See Arg.parse_argv_dynamic.

    • since 4.05
    val parse_expand : (key * spec * doc) list -> anon_fun -> usage_msg -> unit

    Same as Arg.parse, except that the Expand arguments are allowed and the current reference is not updated.

    • since 4.05
    exception Help of string

    Raised by Arg.parse_argv when the user asks for help.

    exception Bad of string

    Functions in spec or anon_fun can raise Arg.Bad with an error message to reject invalid arguments. Arg.Bad is also raised by Arg.parse_argv in case of an error.

    val usage : (key * spec * doc) list -> usage_msg -> unit

    Arg.usage speclist usage_msg prints to standard error an error message that includes the list of valid options. This is the same message that Arg.parse prints in case of error. speclist and usage_msg are the same as for Arg.parse.

    val usage_string : (key * spec * doc) list -> usage_msg -> string

    Returns the message that would have been printed by Arg.usage, if provided with the same parameters.

    val align : ?limit:int -> (key * spec * doc) list -> (key * spec * doc) list

    Align the documentation strings by inserting spaces at the first alignment separator (tab or, if tab is not found, space), according to the length of the keyword. Use a alignment separator as the first character in a doc string if you want to align the whole string. The doc strings corresponding to Symbol arguments are aligned on the next line.

    • parameter limit

      options with keyword and message longer than limit will not be used to compute the alignment.

    val current : int ref

    Position (in Sys.argv) of the argument being processed. You can change this value, e.g. to force Arg.parse to skip some arguments. Arg.parse uses the initial value of Arg.current as the index of argument 0 (the program name) and starts parsing arguments at the next element.

    val read_arg : string -> string array

    Arg.read_arg file reads newline-terminated command line arguments from file file.

    • since 4.05
    val read_arg0 : string -> string array

    Identical to Arg.read_arg but assumes null character terminated command line arguments.

    • since 4.05
    val write_arg : string -> string array -> unit

    Arg.write_arg file args writes the arguments args newline-terminated into the file file. If any of the arguments in args contains a newline, use Arg.write_arg0 instead.

    • since 4.05
    val write_arg0 : string -> string array -> unit

    Identical to Arg.write_arg but uses the null character for terminator instead of newline.

    • since 4.05
    diff --git a/ocaml/Stdlib/Array/index.html b/ocaml/Stdlib/Array/index.html new file mode 100644 index 0000000..eff0904 --- /dev/null +++ b/ocaml/Stdlib/Array/index.html @@ -0,0 +1,19 @@ + +Array (ocaml.Stdlib.Array)

    Module Stdlib.Array

    Array operations.

    The labeled version of this module can be used as described in the StdLabels module.

    type 'a t = 'a array

    An alias for the type of arrays.

    val length : 'a array -> int

    Return the length (number of elements) of the given array.

    val get : 'a array -> int -> 'a

    get a n returns the element number n of array a. The first element has number 0. The last element has number length a - 1. You can also write a.(n) instead of get a n.

    val set : 'a array -> int -> 'a -> unit

    set a n x modifies array a in place, replacing element number n with x. You can also write a.(n) <- x instead of set a n x.

    val make : int -> 'a -> 'a array

    make n x returns a fresh array of length n, initialized with x. All the elements of this new array are initially physically equal to x (in the sense of the == predicate). Consequently, if x is mutable, it is shared among all elements of the array, and modifying x through one of the array entries will modify all other entries at the same time.

    • raises Invalid_argument

      if n < 0 or n > Sys.max_array_length. If the value of x is a floating-point number, then the maximum size is only Sys.max_array_length / 2.

    val create_float : int -> float array

    create_float n returns a fresh float array of length n, with uninitialized data.

    • since 4.03
    val init : int -> (int -> 'a) -> 'a array

    init n f returns a fresh array of length n, with element number i initialized to the result of f i. In other terms, init n f tabulates the results of f applied in order to the integers 0 to n-1.

    • raises Invalid_argument

      if n < 0 or n > Sys.max_array_length. If the return type of f is float, then the maximum size is only Sys.max_array_length / 2.

    val make_matrix : int -> int -> 'a -> 'a array array

    make_matrix dimx dimy e returns a two-dimensional array (an array of arrays) with first dimension dimx and second dimension dimy. All the elements of this new matrix are initially physically equal to e. The element (x,y) of a matrix m is accessed with the notation m.(x).(y).

    • raises Invalid_argument

      if dimx or dimy is negative or greater than Sys.max_array_length. If the value of e is a floating-point number, then the maximum size is only Sys.max_array_length / 2.

    val init_matrix : int -> int -> (int -> int -> 'a) -> 'a array array

    init_matrix dimx dimy f returns a two-dimensional array (an array of arrays) with first dimension dimx and second dimension dimy, where the element at index (x,y) is initialized with f x y. The element (x,y) of a matrix m is accessed with the notation m.(x).(y).

    • since 5.2
    val append : 'a array -> 'a array -> 'a array

    append v1 v2 returns a fresh array containing the concatenation of the arrays v1 and v2.

    val concat : 'a array list -> 'a array

    Same as append, but concatenates a list of arrays.

    val sub : 'a array -> int -> int -> 'a array

    sub a pos len returns a fresh array of length len, containing the elements number pos to pos + len - 1 of array a.

    • raises Invalid_argument

      if pos and len do not designate a valid subarray of a; that is, if pos < 0, or len < 0, or pos + len > length a.

    val copy : 'a array -> 'a array

    copy a returns a copy of a, that is, a fresh array containing the same elements as a.

    val fill : 'a array -> int -> int -> 'a -> unit

    fill a pos len x modifies the array a in place, storing x in elements number pos to pos + len - 1.

    val blit : 'a array -> int -> 'a array -> int -> int -> unit

    blit src src_pos dst dst_pos len copies len elements from array src, starting at element number src_pos, to array dst, starting at element number dst_pos. It works correctly even if src and dst are the same array, and the source and destination chunks overlap.

    • raises Invalid_argument

      if src_pos and len do not designate a valid subarray of src, or if dst_pos and len do not designate a valid subarray of dst.

    val to_list : 'a array -> 'a list

    to_list a returns the list of all the elements of a.

    val of_list : 'a list -> 'a array

    of_list l returns a fresh array containing the elements of l.

    • raises Invalid_argument

      if the length of l is greater than Sys.max_array_length.

    Iterators

    val iter : ('a -> unit) -> 'a array -> unit

    iter f a applies function f in turn to all the elements of a. It is equivalent to f a.(0); f a.(1); ...; f a.(length a - 1); ().

    val iteri : (int -> 'a -> unit) -> 'a array -> unit

    Same as iter, but the function is applied to the index of the element as first argument, and the element itself as second argument.

    val map : ('a -> 'b) -> 'a array -> 'b array

    map f a applies function f to all the elements of a, and builds an array with the results returned by f: [| f a.(0); f a.(1); ...; f a.(length a - 1) |].

    val map_inplace : ('a -> 'a) -> 'a array -> unit

    map_inplace f a applies function f to all elements of a, and updates their values in place.

    • since 5.1
    val mapi : (int -> 'a -> 'b) -> 'a array -> 'b array

    Same as map, but the function is applied to the index of the element as first argument, and the element itself as second argument.

    val mapi_inplace : (int -> 'a -> 'a) -> 'a array -> unit

    Same as map_inplace, but the function is applied to the index of the element as first argument, and the element itself as second argument.

    • since 5.1
    val fold_left : ('acc -> 'a -> 'acc) -> 'acc -> 'a array -> 'acc

    fold_left f init a computes f (... (f (f init a.(0)) a.(1)) ...) a.(n-1), where n is the length of the array a.

    val fold_left_map : + ('acc -> 'a -> 'acc * 'b) -> + 'acc -> + 'a array -> + 'acc * 'b array

    fold_left_map is a combination of fold_left and map that threads an accumulator through calls to f.

    • since 4.13
    val fold_right : ('a -> 'acc -> 'acc) -> 'a array -> 'acc -> 'acc

    fold_right f a init computes f a.(0) (f a.(1) ( ... (f a.(n-1) init) ...)), where n is the length of the array a.

    Iterators on two arrays

    val iter2 : ('a -> 'b -> unit) -> 'a array -> 'b array -> unit

    iter2 f a b applies function f to all the elements of a and b.

    • since 4.03 (4.05 in ArrayLabels)
    val map2 : ('a -> 'b -> 'c) -> 'a array -> 'b array -> 'c array

    map2 f a b applies function f to all the elements of a and b, and builds an array with the results returned by f: [| f a.(0) b.(0); ...; f a.(length a - 1) b.(length b - 1)|].

    • since 4.03 (4.05 in ArrayLabels)

    Array scanning

    val for_all : ('a -> bool) -> 'a array -> bool

    for_all f [|a1; ...; an|] checks if all elements of the array satisfy the predicate f. That is, it returns (f a1) && (f a2) && ... && (f an).

    • since 4.03
    val exists : ('a -> bool) -> 'a array -> bool

    exists f [|a1; ...; an|] checks if at least one element of the array satisfies the predicate f. That is, it returns (f a1) || (f a2) || ... || (f an).

    • since 4.03
    val for_all2 : ('a -> 'b -> bool) -> 'a array -> 'b array -> bool

    Same as for_all, but for a two-argument predicate.

    • since 4.11
    val exists2 : ('a -> 'b -> bool) -> 'a array -> 'b array -> bool

    Same as exists, but for a two-argument predicate.

    • since 4.11
    val mem : 'a -> 'a array -> bool

    mem a set is true if and only if a is structurally equal to an element of set (i.e. there is an x in set such that compare a x = 0).

    • since 4.03
    val memq : 'a -> 'a array -> bool

    Same as mem, but uses physical equality instead of structural equality to compare array elements.

    • since 4.03
    val find_opt : ('a -> bool) -> 'a array -> 'a option

    find_opt f a returns the first element of the array a that satisfies the predicate f, or None if there is no value that satisfies f in the array a.

    • since 4.13
    val find_index : ('a -> bool) -> 'a array -> int option

    find_index f a returns Some i, where i is the index of the first element of the array a that satisfies f x, if there is such an element.

    It returns None if there is no such element.

    • since 5.1
    val find_map : ('a -> 'b option) -> 'a array -> 'b option

    find_map f a applies f to the elements of a in order, and returns the first result of the form Some v, or None if none exist.

    • since 4.13
    val find_mapi : (int -> 'a -> 'b option) -> 'a array -> 'b option

    Same as find_map, but the predicate is applied to the index of the element as first argument (counting from 0), and the element itself as second argument.

    • since 5.1

    Arrays of pairs

    val split : ('a * 'b) array -> 'a array * 'b array

    split [|(a1,b1); ...; (an,bn)|] is ([|a1; ...; an|], [|b1; ...; bn|]).

    • since 4.13
    val combine : 'a array -> 'b array -> ('a * 'b) array

    combine [|a1; ...; an|] [|b1; ...; bn|] is [|(a1,b1); ...; (an,bn)|]. Raise Invalid_argument if the two arrays have different lengths.

    • since 4.13

    Sorting and shuffling

    val sort : ('a -> 'a -> int) -> 'a array -> unit

    Sort an array in increasing order according to a comparison function. The comparison function must return 0 if its arguments compare as equal, a positive integer if the first is greater, and a negative integer if the first is smaller (see below for a complete specification). For example, Stdlib.compare is a suitable comparison function. After calling sort, the array is sorted in place in increasing order. sort is guaranteed to run in constant heap space and (at most) logarithmic stack space.

    The current implementation uses Heap Sort. It runs in constant stack space.

    Specification of the comparison function: Let a be the array and cmp the comparison function. The following must be true for all x, y, z in a :

    • cmp x y > 0 if and only if cmp y x < 0
    • if cmp x y >= 0 and cmp y z >= 0 then cmp x z >= 0

    When sort returns, a contains the same elements as before, reordered in such a way that for all i and j valid indices of a :

    • cmp a.(i) a.(j) >= 0 if and only if i >= j
    val stable_sort : ('a -> 'a -> int) -> 'a array -> unit

    Same as sort, but the sorting algorithm is stable (i.e. elements that compare equal are kept in their original order) and not guaranteed to run in constant heap space.

    The current implementation uses Merge Sort. It uses a temporary array of length n/2, where n is the length of the array. It is usually faster than the current implementation of sort.

    val fast_sort : ('a -> 'a -> int) -> 'a array -> unit

    Same as sort or stable_sort, whichever is faster on typical input.

    val shuffle : rand:(int -> int) -> 'a array -> unit

    shuffle rand a randomly permutes a's element using rand for randomness. The distribution of permutations is uniform.

    rand must be such that a call to rand n returns a uniformly distributed random number in the range [0;n-1]. Random.int can be used for this (do not forget to initialize the generator).

    • since 5.2

    Arrays and Sequences

    val to_seq : 'a array -> 'a Seq.t

    Iterate on the array, in increasing order. Modifications of the array during iteration will be reflected in the sequence.

    • since 4.07
    val to_seqi : 'a array -> (int * 'a) Seq.t

    Iterate on the array, in increasing order, yielding indices along elements. Modifications of the array during iteration will be reflected in the sequence.

    • since 4.07
    val of_seq : 'a Seq.t -> 'a array

    Create an array from the generator

    • since 4.07

    Arrays and concurrency safety

    Care must be taken when concurrently accessing arrays from multiple domains: accessing an array will never crash a program, but unsynchronized accesses might yield surprising (non-sequentially-consistent) results.

    Atomicity

    Every array operation that accesses more than one array element is not atomic. This includes iteration, scanning, sorting, splitting and combining arrays.

    For example, consider the following program:

    let size = 100_000_000
+let a = Array.make size 1
+let d1 = Domain.spawn (fun () ->
+   Array.iteri (fun i x -> a.(i) <- x + 1) a
+)
+let d2 = Domain.spawn (fun () ->
+  Array.iteri (fun i x -> a.(i) <- 2 * x + 1) a
+)
+let () = Domain.join d1; Domain.join d2

    After executing this code, each field of the array a is either 2, 3, 4 or 5. If atomicity is required, then the user must implement their own synchronization (for example, using Mutex.t).

    Data races

    If two domains only access disjoint parts of the array, then the observed behaviour is the equivalent to some sequential interleaving of the operations from the two domains.

    A data race is said to occur when two domains access the same array element without synchronization and at least one of the accesses is a write. In the absence of data races, the observed behaviour is equivalent to some sequential interleaving of the operations from different domains.

    Whenever possible, data races should be avoided by using synchronization to mediate the accesses to the array elements.

    Indeed, in the presence of data races, programs will not crash but the observed behaviour may not be equivalent to any sequential interleaving of operations from different domains. Nevertheless, even in the presence of data races, a read operation will return the value of some prior write to that location (with a few exceptions for float arrays).

    Float arrays

    Float arrays have two supplementary caveats in the presence of data races.

    First, the blit operation might copy an array byte-by-byte. Data races between such a blit operation and another operation might produce surprising values due to tearing: partial writes interleaved with other operations can create float values that would not exist with a sequential execution.

    For instance, at the end of

     let zeros = Array.make size 0.
+let max_floats = Array.make size Float.max_float
+let res = Array.copy zeros
+let d1 = Domain.spawn (fun () -> Array.blit zeros 0 res 0 size)
+let d2 = Domain.spawn (fun () -> Array.blit max_floats 0 res 0 size)
+let () = Domain.join d1; Domain.join d2

    the res array might contain values that are neither 0. nor max_float.

    Second, on 32-bit architectures, getting or setting a field involves two separate memory accesses. In the presence of data races, the user may observe tearing on any operation.

    diff --git a/ocaml/Stdlib/ArrayLabels/index.html b/ocaml/Stdlib/ArrayLabels/index.html new file mode 100644 index 0000000..52fc06b --- /dev/null +++ b/ocaml/Stdlib/ArrayLabels/index.html @@ -0,0 +1,29 @@ + +ArrayLabels (ocaml.Stdlib.ArrayLabels)

    Module Stdlib.ArrayLabels

    Array operations.

    The labeled version of this module can be used as described in the StdLabels module.

    type 'a t = 'a array

    An alias for the type of arrays.

    val length : 'a array -> int

    Return the length (number of elements) of the given array.

    val get : 'a array -> int -> 'a

    get a n returns the element number n of array a. The first element has number 0. The last element has number length a - 1. You can also write a.(n) instead of get a n.

    val set : 'a array -> int -> 'a -> unit

    set a n x modifies array a in place, replacing element number n with x. You can also write a.(n) <- x instead of set a n x.

    val make : int -> 'a -> 'a array

    make n x returns a fresh array of length n, initialized with x. All the elements of this new array are initially physically equal to x (in the sense of the == predicate). Consequently, if x is mutable, it is shared among all elements of the array, and modifying x through one of the array entries will modify all other entries at the same time.

    • raises Invalid_argument

      if n < 0 or n > Sys.max_array_length. If the value of x is a floating-point number, then the maximum size is only Sys.max_array_length / 2.

    val create_float : int -> float array

    create_float n returns a fresh float array of length n, with uninitialized data.

    • since 4.03
    val init : int -> f:(int -> 'a) -> 'a array

    init n ~f returns a fresh array of length n, with element number i initialized to the result of f i. In other terms, init n ~f tabulates the results of f applied in order to the integers 0 to n-1.

    • raises Invalid_argument

      if n < 0 or n > Sys.max_array_length. If the return type of f is float, then the maximum size is only Sys.max_array_length / 2.

    val make_matrix : dimx:int -> dimy:int -> 'a -> 'a array array

    make_matrix ~dimx ~dimy e returns a two-dimensional array (an array of arrays) with first dimension dimx and second dimension dimy. All the elements of this new matrix are initially physically equal to e. The element (x,y) of a matrix m is accessed with the notation m.(x).(y).

    • raises Invalid_argument

      if dimx or dimy is negative or greater than Sys.max_array_length. If the value of e is a floating-point number, then the maximum size is only Sys.max_array_length / 2.

    val init_matrix : + dimx:int -> + dimy:int -> + f:(int -> int -> 'a) -> + 'a array array

    init_matrix ~dimx ~dimy ~f returns a two-dimensional array (an array of arrays) with first dimension dimx and second dimension dimy, where the element at index (x,y) is initialized with f x y. The element (x,y) of a matrix m is accessed with the notation m.(x).(y).

    • since 5.2
    val append : 'a array -> 'a array -> 'a array

    append v1 v2 returns a fresh array containing the concatenation of the arrays v1 and v2.

    val concat : 'a array list -> 'a array

    Same as append, but concatenates a list of arrays.

    val sub : 'a array -> pos:int -> len:int -> 'a array

    sub a ~pos ~len returns a fresh array of length len, containing the elements number pos to pos + len - 1 of array a.

    • raises Invalid_argument

      if pos and len do not designate a valid subarray of a; that is, if pos < 0, or len < 0, or pos + len > length a.

    val copy : 'a array -> 'a array

    copy a returns a copy of a, that is, a fresh array containing the same elements as a.

    val fill : 'a array -> pos:int -> len:int -> 'a -> unit

    fill a ~pos ~len x modifies the array a in place, storing x in elements number pos to pos + len - 1.

    val blit : + src:'a array -> + src_pos:int -> + dst:'a array -> + dst_pos:int -> + len:int -> + unit

    blit ~src ~src_pos ~dst ~dst_pos ~len copies len elements from array src, starting at element number src_pos, to array dst, starting at element number dst_pos. It works correctly even if src and dst are the same array, and the source and destination chunks overlap.

    • raises Invalid_argument

      if src_pos and len do not designate a valid subarray of src, or if dst_pos and len do not designate a valid subarray of dst.

    val to_list : 'a array -> 'a list

    to_list a returns the list of all the elements of a.

    val of_list : 'a list -> 'a array

    of_list l returns a fresh array containing the elements of l.

    • raises Invalid_argument

      if the length of l is greater than Sys.max_array_length.

    Iterators

    val iter : f:('a -> unit) -> 'a array -> unit

    iter ~f a applies function f in turn to all the elements of a. It is equivalent to f a.(0); f a.(1); ...; f a.(length a - 1); ().

    val iteri : f:(int -> 'a -> unit) -> 'a array -> unit

    Same as iter, but the function is applied to the index of the element as first argument, and the element itself as second argument.

    val map : f:('a -> 'b) -> 'a array -> 'b array

    map ~f a applies function f to all the elements of a, and builds an array with the results returned by f: [| f a.(0); f a.(1); ...; f a.(length a - 1) |].

    val map_inplace : f:('a -> 'a) -> 'a array -> unit

    map_inplace ~f a applies function f to all elements of a, and updates their values in place.

    • since 5.1
    val mapi : f:(int -> 'a -> 'b) -> 'a array -> 'b array

    Same as map, but the function is applied to the index of the element as first argument, and the element itself as second argument.

    val mapi_inplace : f:(int -> 'a -> 'a) -> 'a array -> unit

    Same as map_inplace, but the function is applied to the index of the element as first argument, and the element itself as second argument.

    • since 5.1
    val fold_left : f:('acc -> 'a -> 'acc) -> init:'acc -> 'a array -> 'acc

    fold_left ~f ~init a computes f (... (f (f init a.(0)) a.(1)) ...) a.(n-1), where n is the length of the array a.

    val fold_left_map : + f:('acc -> 'a -> 'acc * 'b) -> + init:'acc -> + 'a array -> + 'acc * 'b array

    fold_left_map is a combination of fold_left and map that threads an accumulator through calls to f.

    • since 4.13
    val fold_right : f:('a -> 'acc -> 'acc) -> 'a array -> init:'acc -> 'acc

    fold_right ~f a ~init computes f a.(0) (f a.(1) ( ... (f a.(n-1) init) ...)), where n is the length of the array a.

    Iterators on two arrays

    val iter2 : f:('a -> 'b -> unit) -> 'a array -> 'b array -> unit

    iter2 ~f a b applies function f to all the elements of a and b.

    • since 4.05
    val map2 : f:('a -> 'b -> 'c) -> 'a array -> 'b array -> 'c array

    map2 ~f a b applies function f to all the elements of a and b, and builds an array with the results returned by f: [| f a.(0) b.(0); ...; f a.(length a - 1) b.(length b - 1)|].

    • since 4.05

    Array scanning

    val for_all : f:('a -> bool) -> 'a array -> bool

    for_all ~f [|a1; ...; an|] checks if all elements of the array satisfy the predicate f. That is, it returns (f a1) && (f a2) && ... && (f an).

    • since 4.03
    val exists : f:('a -> bool) -> 'a array -> bool

    exists ~f [|a1; ...; an|] checks if at least one element of the array satisfies the predicate f. That is, it returns (f a1) || (f a2) || ... || (f an).

    • since 4.03
    val for_all2 : f:('a -> 'b -> bool) -> 'a array -> 'b array -> bool

    Same as for_all, but for a two-argument predicate.

    • since 4.11
    val exists2 : f:('a -> 'b -> bool) -> 'a array -> 'b array -> bool

    Same as exists, but for a two-argument predicate.

    • since 4.11
    val mem : 'a -> set:'a array -> bool

    mem a ~set is true if and only if a is structurally equal to an element of set (i.e. there is an x in set such that compare a x = 0).

    • since 4.03
    val memq : 'a -> set:'a array -> bool

    Same as mem, but uses physical equality instead of structural equality to compare array elements.

    • since 4.03
    val find_opt : f:('a -> bool) -> 'a array -> 'a option

    find_opt ~f a returns the first element of the array a that satisfies the predicate f, or None if there is no value that satisfies f in the array a.

    • since 4.13
    val find_index : f:('a -> bool) -> 'a array -> int option

    find_index ~f a returns Some i, where i is the index of the first element of the array a that satisfies f x, if there is such an element.

    It returns None if there is no such element.

    • since 5.1
    val find_map : f:('a -> 'b option) -> 'a array -> 'b option

    find_map ~f a applies f to the elements of a in order, and returns the first result of the form Some v, or None if none exist.

    • since 4.13
    val find_mapi : f:(int -> 'a -> 'b option) -> 'a array -> 'b option

    Same as find_map, but the predicate is applied to the index of the element as first argument (counting from 0), and the element itself as second argument.

    • since 5.1

    Arrays of pairs

    val split : ('a * 'b) array -> 'a array * 'b array

    split [|(a1,b1); ...; (an,bn)|] is ([|a1; ...; an|], [|b1; ...; bn|]).

    • since 4.13
    val combine : 'a array -> 'b array -> ('a * 'b) array

    combine [|a1; ...; an|] [|b1; ...; bn|] is [|(a1,b1); ...; (an,bn)|]. Raise Invalid_argument if the two arrays have different lengths.

    • since 4.13

    Sorting and shuffling

    val sort : cmp:('a -> 'a -> int) -> 'a array -> unit

    Sort an array in increasing order according to a comparison function. The comparison function must return 0 if its arguments compare as equal, a positive integer if the first is greater, and a negative integer if the first is smaller (see below for a complete specification). For example, Stdlib.compare is a suitable comparison function. After calling sort, the array is sorted in place in increasing order. sort is guaranteed to run in constant heap space and (at most) logarithmic stack space.

    The current implementation uses Heap Sort. It runs in constant stack space.

    Specification of the comparison function: Let a be the array and cmp the comparison function. The following must be true for all x, y, z in a :

    • cmp x y > 0 if and only if cmp y x < 0
    • if cmp x y >= 0 and cmp y z >= 0 then cmp x z >= 0

    When sort returns, a contains the same elements as before, reordered in such a way that for all i and j valid indices of a :

    • cmp a.(i) a.(j) >= 0 if and only if i >= j
    val stable_sort : cmp:('a -> 'a -> int) -> 'a array -> unit

    Same as sort, but the sorting algorithm is stable (i.e. elements that compare equal are kept in their original order) and not guaranteed to run in constant heap space.

    The current implementation uses Merge Sort. It uses a temporary array of length n/2, where n is the length of the array. It is usually faster than the current implementation of sort.

    val fast_sort : cmp:('a -> 'a -> int) -> 'a array -> unit

    Same as sort or stable_sort, whichever is faster on typical input.

    val shuffle : rand:(int -> int) -> 'a array -> unit

    shuffle ~rand a randomly permutes a's element using rand for randomness. The distribution of permutations is uniform.

    rand must be such that a call to rand n returns a uniformly distributed random number in the range [0;n-1]. Random.int can be used for this (do not forget to initialize the generator).

    • since 5.2

    Arrays and Sequences

    val to_seq : 'a array -> 'a Seq.t

    Iterate on the array, in increasing order. Modifications of the array during iteration will be reflected in the sequence.

    • since 4.07
    val to_seqi : 'a array -> (int * 'a) Seq.t

    Iterate on the array, in increasing order, yielding indices along elements. Modifications of the array during iteration will be reflected in the sequence.

    • since 4.07
    val of_seq : 'a Seq.t -> 'a array

    Create an array from the generator

    • since 4.07

    Arrays and concurrency safety

    Care must be taken when concurrently accessing arrays from multiple domains: accessing an array will never crash a program, but unsynchronized accesses might yield surprising (non-sequentially-consistent) results.

    Atomicity

    Every array operation that accesses more than one array element is not atomic. This includes iteration, scanning, sorting, splitting and combining arrays.

    For example, consider the following program:

    let size = 100_000_000
+let a = ArrayLabels.make size 1
+let d1 = Domain.spawn (fun () ->
+   ArrayLabels.iteri ~f:(fun i x -> a.(i) <- x + 1) a
+)
+let d2 = Domain.spawn (fun () ->
+  ArrayLabels.iteri ~f:(fun i x -> a.(i) <- 2 * x + 1) a
+)
+let () = Domain.join d1; Domain.join d2

    After executing this code, each field of the array a is either 2, 3, 4 or 5. If atomicity is required, then the user must implement their own synchronization (for example, using Mutex.t).

    Data races

    If two domains only access disjoint parts of the array, then the observed behaviour is the equivalent to some sequential interleaving of the operations from the two domains.

    A data race is said to occur when two domains access the same array element without synchronization and at least one of the accesses is a write. In the absence of data races, the observed behaviour is equivalent to some sequential interleaving of the operations from different domains.

    Whenever possible, data races should be avoided by using synchronization to mediate the accesses to the array elements.

    Indeed, in the presence of data races, programs will not crash but the observed behaviour may not be equivalent to any sequential interleaving of operations from different domains. Nevertheless, even in the presence of data races, a read operation will return the value of some prior write to that location (with a few exceptions for float arrays).

    Float arrays

    Float arrays have two supplementary caveats in the presence of data races.

    First, the blit operation might copy an array byte-by-byte. Data races between such a blit operation and another operation might produce surprising values due to tearing: partial writes interleaved with other operations can create float values that would not exist with a sequential execution.

    For instance, at the end of

     let zeros = Array.make size 0.
+let max_floats = Array.make size Float.max_float
+let res = Array.copy zeros
+let d1 = Domain.spawn (fun () -> Array.blit zeros 0 res 0 size)
+let d2 = Domain.spawn (fun () -> Array.blit max_floats 0 res 0 size)
+let () = Domain.join d1; Domain.join d2

    the res array might contain values that are neither 0. nor max_float.

    Second, on 32-bit architectures, getting or setting a field involves two separate memory accesses. In the presence of data races, the user may observe tearing on any operation.

    diff --git a/ocaml/Stdlib/Atomic/index.html b/ocaml/Stdlib/Atomic/index.html new file mode 100644 index 0000000..ecbb77b --- /dev/null +++ b/ocaml/Stdlib/Atomic/index.html @@ -0,0 +1,64 @@ + +Atomic (ocaml.Stdlib.Atomic)

    Module Stdlib.Atomic

    Atomic references.

    See the examples below. See 'Memory model: The hard bits' chapter in the manual.

    • since 4.12
    type !'a t

    An atomic (mutable) reference to a value of type 'a.

    val make : 'a -> 'a t

    Create an atomic reference.

    val make_contended : 'a -> 'a t

    Create an atomic reference that is alone on a cache line. It occupies 4-16x the memory of one allocated with make v.

    The primary purpose is to prevent false-sharing and the resulting performance degradation. When a CPU performs an atomic operation, it temporarily takes ownership of an entire cache line that contains the atomic reference. If multiple atomic references share the same cache line, modifying these disjoint memory regions simultaneously becomes impossible, which can create a bottleneck. Hence, as a general guideline, if an atomic reference is experiencing contention, assigning it its own cache line may enhance performance.

    val get : 'a t -> 'a

    Get the current value of the atomic reference.

    val set : 'a t -> 'a -> unit

    Set a new value for the atomic reference.

    val exchange : 'a t -> 'a -> 'a

    Set a new value for the atomic reference, and return the current value.

    val compare_and_set : 'a t -> 'a -> 'a -> bool

    compare_and_set r seen v sets the new value of r to v only if its current value is physically equal to seen -- the comparison and the set occur atomically. Returns true if the comparison succeeded (so the set happened) and false otherwise.

    val fetch_and_add : int t -> int -> int

    fetch_and_add r n atomically increments the value of r by n, and returns the current value (before the increment).

    val incr : int t -> unit

    incr r atomically increments the value of r by 1.

    val decr : int t -> unit

    decr r atomically decrements the value of r by 1.

    Examples

    Basic Thread Coordination

    A basic use case is to have global counters that are updated in a thread-safe way, for example to keep some sorts of metrics over IOs performed by the program. Another basic use case is to coordinate the termination of threads in a given program, for example when one thread finds an answer, or when the program is shut down by the user.

    Here, for example, we're going to try to find a number whose hash satisfies a basic property. To do that, we'll run multiple threads which will try random numbers until they find one that works.

    Of course the output below is a sample run and will change every time the program is run.

    (* use for termination *)
+let stop_all_threads = Atomic.make false
+
+(* total number of individual attempts to find a number *)
+let num_attempts = Atomic.make 0
+
+(* find a number that satisfies [p], by... trying random numbers
+   until one fits. *)
+let find_number_where (p:int -> bool) =
+  let rand = Random.State.make_self_init() in
+  while not (Atomic.get stop_all_threads) do
+
+    let n = Random.State.full_int rand max_int in
+    ignore (Atomic.fetch_and_add num_attempts 1 : int);
+
+    if p (Hashtbl.hash n) then (
+      Printf.printf "found %d (hash=%d)\n%!" n (Hashtbl.hash n);
+      Atomic.set stop_all_threads true; (* signal all threads to stop *)
+    )
+  done;;
+
+
+(* run multiple domains to search for a [n] where [hash n <= 100] *)
+let () =
+  let criterion n = n <= 100 in
+  let threads =
+    Array.init 8
+      (fun _ -> Domain.spawn (fun () -> find_number_where criterion))
+  in
+  Array.iter Domain.join threads;
+  Printf.printf "total number of attempts: %d\n%!"
+    (Atomic.get num_attempts) ;;
+
+- : unit = ()
+found 1651745641680046833 (hash=33)
+total number of attempts: 30230350

    Treiber Stack

    Another example is a basic Treiber stack (a thread-safe stack) that can be safely shared between threads.

    Note how both push and pop are recursive, because they attempt to swap the new stack (with one more, or one fewer, element) with the old stack. This is optimistic concurrency: each iteration of, say, push stack x gets the old stack l, and hopes that by the time it tries to replace l with x::l, nobody else has had time to modify the list. If the compare_and_set fails it means we were too optimistic, and must try again.

    type 'a stack = 'a list Atomic.t
+
+let rec push (stack: _ stack) elt : unit =
+  let cur = Atomic.get stack in
+  let success = Atomic.compare_and_set stack cur (elt :: cur) in
+  if not success then
+    push stack elt
+
+let rec pop (stack: _ stack) : _ option =
+  let cur = Atomic.get stack in
+  match cur with
+  | [] -> None
+  | x :: tail ->
+    let success = Atomic.compare_and_set stack cur tail in
+    if success then Some x
+    else pop stack
+
+# let st = Atomic.make []
+# push st 1
+- : unit = ()
+# push st 2
+- : unit = ()
+# pop st
+- : int option = Some 2
+# pop st
+- : int option = Some 1
+# pop st
+- : int option = None
    diff --git a/ocaml/Stdlib/Bigarray/Array0/index.html b/ocaml/Stdlib/Bigarray/Array0/index.html new file mode 100644 index 0000000..2322319 --- /dev/null +++ b/ocaml/Stdlib/Bigarray/Array0/index.html @@ -0,0 +1,2 @@ + +Array0 (ocaml.Stdlib.Bigarray.Array0)

    Module Bigarray.Array0

    Zero-dimensional arrays. The Array0 structure provides operations similar to those of Bigarray.Genarray, but specialized to the case of zero-dimensional arrays that only contain a single scalar value. Statically knowing the number of dimensions of the array allows faster operations, and more precise static type-checking.

    • since 4.05
    type (!'a, !'b, !'c) t

    The type of zero-dimensional Bigarrays whose elements have OCaml type 'a, representation kind 'b, and memory layout 'c.

    val create : ('a, 'b) kind -> 'c layout -> ('a, 'b, 'c) t

    Array0.create kind layout returns a new Bigarray of zero dimension. kind and layout determine the array element kind and the array layout as described for Genarray.create.

    val init : ('a, 'b) kind -> 'c layout -> 'a -> ('a, 'b, 'c) t

    Array0.init kind layout v behaves like Array0.create kind layout except that the element is additionally initialized to the value v.

    • since 4.12
    val kind : ('a, 'b, 'c) t -> ('a, 'b) kind

    Return the kind of the given Bigarray.

    val layout : ('a, 'b, 'c) t -> 'c layout

    Return the layout of the given Bigarray.

    val change_layout : ('a, 'b, 'c) t -> 'd layout -> ('a, 'b, 'd) t

    Array0.change_layout a layout returns a Bigarray with the specified layout, sharing the data with a. No copying of elements is involved: the new array and the original array share the same storage space.

    • since 4.06
    val size_in_bytes : ('a, 'b, 'c) t -> int

    size_in_bytes a is a's kind_size_in_bytes.

    val get : ('a, 'b, 'c) t -> 'a

    Array0.get a returns the only element in a.

    val set : ('a, 'b, 'c) t -> 'a -> unit

    Array0.set a x v stores the value v in a.

    val blit : ('a, 'b, 'c) t -> ('a, 'b, 'c) t -> unit

    Copy the first Bigarray to the second Bigarray. See Genarray.blit for more details.

    val fill : ('a, 'b, 'c) t -> 'a -> unit

    Fill the given Bigarray with the given value. See Genarray.fill for more details.

    val of_value : ('a, 'b) kind -> 'c layout -> 'a -> ('a, 'b, 'c) t

    Build a zero-dimensional Bigarray initialized from the given value.

    diff --git a/ocaml/Stdlib/Bigarray/Array1/index.html b/ocaml/Stdlib/Bigarray/Array1/index.html new file mode 100644 index 0000000..006197d --- /dev/null +++ b/ocaml/Stdlib/Bigarray/Array1/index.html @@ -0,0 +1,2 @@ + +Array1 (ocaml.Stdlib.Bigarray.Array1)

    Module Bigarray.Array1

    One-dimensional arrays. The Array1 structure provides operations similar to those of Bigarray.Genarray, but specialized to the case of one-dimensional arrays. (The Array2 and Array3 structures below provide operations specialized for two- and three-dimensional arrays.) Statically knowing the number of dimensions of the array allows faster operations, and more precise static type-checking.

    type (!'a, !'b, !'c) t

    The type of one-dimensional Bigarrays whose elements have OCaml type 'a, representation kind 'b, and memory layout 'c.

    val create : ('a, 'b) kind -> 'c layout -> int -> ('a, 'b, 'c) t

    Array1.create kind layout dim returns a new Bigarray of one dimension, whose size is dim. kind and layout determine the array element kind and the array layout as described for Genarray.create.

    val init : ('a, 'b) kind -> 'c layout -> int -> (int -> 'a) -> ('a, 'b, 'c) t

    Array1.init kind layout dim f returns a new Bigarray b of one dimension, whose size is dim. kind and layout determine the array element kind and the array layout as described for Genarray.create.

    Each element Array1.get b i of the array is initialized to the result of f i.

    In other words, Array1.init kind layout dimensions f tabulates the results of f applied to the indices of a new Bigarray whose layout is described by kind, layout and dim.

    • since 4.12
    val dim : ('a, 'b, 'c) t -> int

    Return the size (dimension) of the given one-dimensional Bigarray.

    val kind : ('a, 'b, 'c) t -> ('a, 'b) kind

    Return the kind of the given Bigarray.

    val layout : ('a, 'b, 'c) t -> 'c layout

    Return the layout of the given Bigarray.

    val change_layout : ('a, 'b, 'c) t -> 'd layout -> ('a, 'b, 'd) t

    Array1.change_layout a layout returns a Bigarray with the specified layout, sharing the data with a (and hence having the same dimension as a). No copying of elements is involved: the new array and the original array share the same storage space.

    • since 4.06
    val size_in_bytes : ('a, 'b, 'c) t -> int

    size_in_bytes a is the number of elements in a multiplied by a's kind_size_in_bytes.

    • since 4.03
    val get : ('a, 'b, 'c) t -> int -> 'a

    Array1.get a x, or alternatively a.{x}, returns the element of a at index x. x must be greater or equal than 0 and strictly less than Array1.dim a if a has C layout. If a has Fortran layout, x must be greater or equal than 1 and less or equal than Array1.dim a. Otherwise, Invalid_argument is raised.

    val set : ('a, 'b, 'c) t -> int -> 'a -> unit

    Array1.set a x v, also written a.{x} <- v, stores the value v at index x in a. x must be inside the bounds of a as described in Bigarray.Array1.get; otherwise, Invalid_argument is raised.

    val sub : ('a, 'b, 'c) t -> int -> int -> ('a, 'b, 'c) t

    Extract a sub-array of the given one-dimensional Bigarray. See Genarray.sub_left for more details.

    val slice : ('a, 'b, 'c) t -> int -> ('a, 'b, 'c) Array0.t

    Extract a scalar (zero-dimensional slice) of the given one-dimensional Bigarray. The integer parameter is the index of the scalar to extract. See Bigarray.Genarray.slice_left and Bigarray.Genarray.slice_right for more details.

    • since 4.05
    val blit : ('a, 'b, 'c) t -> ('a, 'b, 'c) t -> unit

    Copy the first Bigarray to the second Bigarray. See Genarray.blit for more details.

    val fill : ('a, 'b, 'c) t -> 'a -> unit

    Fill the given Bigarray with the given value. See Genarray.fill for more details.

    val of_array : ('a, 'b) kind -> 'c layout -> 'a array -> ('a, 'b, 'c) t

    Build a one-dimensional Bigarray initialized from the given array.

    val unsafe_get : ('a, 'b, 'c) t -> int -> 'a

    Like Bigarray.Array1.get, but bounds checking is not always performed. Use with caution and only when the program logic guarantees that the access is within bounds.

    val unsafe_set : ('a, 'b, 'c) t -> int -> 'a -> unit

    Like Bigarray.Array1.set, but bounds checking is not always performed. Use with caution and only when the program logic guarantees that the access is within bounds.

    diff --git a/ocaml/Stdlib/Bigarray/Array2/index.html b/ocaml/Stdlib/Bigarray/Array2/index.html new file mode 100644 index 0000000..36c4e4a --- /dev/null +++ b/ocaml/Stdlib/Bigarray/Array2/index.html @@ -0,0 +1,15 @@ + +Array2 (ocaml.Stdlib.Bigarray.Array2)

    Module Bigarray.Array2

    Two-dimensional arrays. The Array2 structure provides operations similar to those of Bigarray.Genarray, but specialized to the case of two-dimensional arrays.

    type (!'a, !'b, !'c) t

    The type of two-dimensional Bigarrays whose elements have OCaml type 'a, representation kind 'b, and memory layout 'c.

    val create : ('a, 'b) kind -> 'c layout -> int -> int -> ('a, 'b, 'c) t

    Array2.create kind layout dim1 dim2 returns a new Bigarray of two dimensions, whose size is dim1 in the first dimension and dim2 in the second dimension. kind and layout determine the array element kind and the array layout as described for Bigarray.Genarray.create.

    val init : + ('a, 'b) kind -> + 'c layout -> + int -> + int -> + (int -> int -> 'a) -> + ('a, 'b, 'c) t

    Array2.init kind layout dim1 dim2 f returns a new Bigarray b of two dimensions, whose size is dim2 in the first dimension and dim2 in the second dimension. kind and layout determine the array element kind and the array layout as described for Bigarray.Genarray.create.

    Each element Array2.get b i j of the array is initialized to the result of f i j.

    In other words, Array2.init kind layout dim1 dim2 f tabulates the results of f applied to the indices of a new Bigarray whose layout is described by kind, layout, dim1 and dim2.

    • since 4.12
    val dim1 : ('a, 'b, 'c) t -> int

    Return the first dimension of the given two-dimensional Bigarray.

    val dim2 : ('a, 'b, 'c) t -> int

    Return the second dimension of the given two-dimensional Bigarray.

    val kind : ('a, 'b, 'c) t -> ('a, 'b) kind

    Return the kind of the given Bigarray.

    val layout : ('a, 'b, 'c) t -> 'c layout

    Return the layout of the given Bigarray.

    val change_layout : ('a, 'b, 'c) t -> 'd layout -> ('a, 'b, 'd) t

    Array2.change_layout a layout returns a Bigarray with the specified layout, sharing the data with a (and hence having the same dimensions as a). No copying of elements is involved: the new array and the original array share the same storage space. The dimensions are reversed, such that get v [| a; b |] in C layout becomes get v [| b+1; a+1 |] in Fortran layout.

    • since 4.06
    val size_in_bytes : ('a, 'b, 'c) t -> int

    size_in_bytes a is the number of elements in a multiplied by a's kind_size_in_bytes.

    • since 4.03
    val get : ('a, 'b, 'c) t -> int -> int -> 'a

    Array2.get a x y, also written a.{x,y}, returns the element of a at coordinates (x, y). x and y must be within the bounds of a, as described for Bigarray.Genarray.get; otherwise, Invalid_argument is raised.

    val set : ('a, 'b, 'c) t -> int -> int -> 'a -> unit

    Array2.set a x y v, or alternatively a.{x,y} <- v, stores the value v at coordinates (x, y) in a. x and y must be within the bounds of a, as described for Bigarray.Genarray.set; otherwise, Invalid_argument is raised.

    val sub_left : ('a, 'b, c_layout) t -> int -> int -> ('a, 'b, c_layout) t

    Extract a two-dimensional sub-array of the given two-dimensional Bigarray by restricting the first dimension. See Bigarray.Genarray.sub_left for more details. Array2.sub_left applies only to arrays with C layout.

    val sub_right : + ('a, 'b, fortran_layout) t -> + int -> + int -> + ('a, 'b, fortran_layout) t

    Extract a two-dimensional sub-array of the given two-dimensional Bigarray by restricting the second dimension. See Bigarray.Genarray.sub_right for more details. Array2.sub_right applies only to arrays with Fortran layout.

    val slice_left : ('a, 'b, c_layout) t -> int -> ('a, 'b, c_layout) Array1.t

    Extract a row (one-dimensional slice) of the given two-dimensional Bigarray. The integer parameter is the index of the row to extract. See Bigarray.Genarray.slice_left for more details. Array2.slice_left applies only to arrays with C layout.

    val slice_right : + ('a, 'b, fortran_layout) t -> + int -> + ('a, 'b, fortran_layout) Array1.t

    Extract a column (one-dimensional slice) of the given two-dimensional Bigarray. The integer parameter is the index of the column to extract. See Bigarray.Genarray.slice_right for more details. Array2.slice_right applies only to arrays with Fortran layout.

    val blit : ('a, 'b, 'c) t -> ('a, 'b, 'c) t -> unit

    Copy the first Bigarray to the second Bigarray. See Bigarray.Genarray.blit for more details.

    val fill : ('a, 'b, 'c) t -> 'a -> unit

    Fill the given Bigarray with the given value. See Bigarray.Genarray.fill for more details.

    val of_array : ('a, 'b) kind -> 'c layout -> 'a array array -> ('a, 'b, 'c) t

    Build a two-dimensional Bigarray initialized from the given array of arrays.

    val unsafe_get : ('a, 'b, 'c) t -> int -> int -> 'a

    Like Bigarray.Array2.get, but bounds checking is not always performed.

    val unsafe_set : ('a, 'b, 'c) t -> int -> int -> 'a -> unit

    Like Bigarray.Array2.set, but bounds checking is not always performed.

    diff --git a/ocaml/Stdlib/Bigarray/Array3/index.html b/ocaml/Stdlib/Bigarray/Array3/index.html new file mode 100644 index 0000000..5afd75c --- /dev/null +++ b/ocaml/Stdlib/Bigarray/Array3/index.html @@ -0,0 +1,28 @@ + +Array3 (ocaml.Stdlib.Bigarray.Array3)

    Module Bigarray.Array3

    Three-dimensional arrays. The Array3 structure provides operations similar to those of Bigarray.Genarray, but specialized to the case of three-dimensional arrays.

    type (!'a, !'b, !'c) t

    The type of three-dimensional Bigarrays whose elements have OCaml type 'a, representation kind 'b, and memory layout 'c.

    val create : ('a, 'b) kind -> 'c layout -> int -> int -> int -> ('a, 'b, 'c) t

    Array3.create kind layout dim1 dim2 dim3 returns a new Bigarray of three dimensions, whose size is dim1 in the first dimension, dim2 in the second dimension, and dim3 in the third. kind and layout determine the array element kind and the array layout as described for Bigarray.Genarray.create.

    val init : + ('a, 'b) kind -> + 'c layout -> + int -> + int -> + int -> + (int -> int -> int -> 'a) -> + ('a, 'b, 'c) t

    Array3.init kind layout dim1 dim2 dim3 f returns a new Bigarray b of three dimensions, whose size is dim1 in the first dimension, dim2 in the second dimension, and dim3 in the third. kind and layout determine the array element kind and the array layout as described for Bigarray.Genarray.create.

    Each element Array3.get b i j k of the array is initialized to the result of f i j k.

    In other words, Array3.init kind layout dim1 dim2 dim3 f tabulates the results of f applied to the indices of a new Bigarray whose layout is described by kind, layout, dim1, dim2 and dim3.

    • since 4.12
    val dim1 : ('a, 'b, 'c) t -> int

    Return the first dimension of the given three-dimensional Bigarray.

    val dim2 : ('a, 'b, 'c) t -> int

    Return the second dimension of the given three-dimensional Bigarray.

    val dim3 : ('a, 'b, 'c) t -> int

    Return the third dimension of the given three-dimensional Bigarray.

    val kind : ('a, 'b, 'c) t -> ('a, 'b) kind

    Return the kind of the given Bigarray.

    val layout : ('a, 'b, 'c) t -> 'c layout

    Return the layout of the given Bigarray.

    val change_layout : ('a, 'b, 'c) t -> 'd layout -> ('a, 'b, 'd) t

    Array3.change_layout a layout returns a Bigarray with the specified layout, sharing the data with a (and hence having the same dimensions as a). No copying of elements is involved: the new array and the original array share the same storage space. The dimensions are reversed, such that get v [| a; b; c |] in C layout becomes get v [| c+1; b+1; a+1 |] in Fortran layout.

    • since 4.06
    val size_in_bytes : ('a, 'b, 'c) t -> int

    size_in_bytes a is the number of elements in a multiplied by a's kind_size_in_bytes.

    • since 4.03
    val get : ('a, 'b, 'c) t -> int -> int -> int -> 'a

    Array3.get a x y z, also written a.{x,y,z}, returns the element of a at coordinates (x, y, z). x, y and z must be within the bounds of a, as described for Bigarray.Genarray.get; otherwise, Invalid_argument is raised.

    val set : ('a, 'b, 'c) t -> int -> int -> int -> 'a -> unit

    Array3.set a x y v, or alternatively a.{x,y,z} <- v, stores the value v at coordinates (x, y, z) in a. x, y and z must be within the bounds of a, as described for Bigarray.Genarray.set; otherwise, Invalid_argument is raised.

    val sub_left : ('a, 'b, c_layout) t -> int -> int -> ('a, 'b, c_layout) t

    Extract a three-dimensional sub-array of the given three-dimensional Bigarray by restricting the first dimension. See Bigarray.Genarray.sub_left for more details. Array3.sub_left applies only to arrays with C layout.

    val sub_right : + ('a, 'b, fortran_layout) t -> + int -> + int -> + ('a, 'b, fortran_layout) t

    Extract a three-dimensional sub-array of the given three-dimensional Bigarray by restricting the second dimension. See Bigarray.Genarray.sub_right for more details. Array3.sub_right applies only to arrays with Fortran layout.

    val slice_left_1 : + ('a, 'b, c_layout) t -> + int -> + int -> + ('a, 'b, c_layout) Array1.t

    Extract a one-dimensional slice of the given three-dimensional Bigarray by fixing the first two coordinates. The integer parameters are the coordinates of the slice to extract. See Bigarray.Genarray.slice_left for more details. Array3.slice_left_1 applies only to arrays with C layout.

    val slice_right_1 : + ('a, 'b, fortran_layout) t -> + int -> + int -> + ('a, 'b, fortran_layout) Array1.t

    Extract a one-dimensional slice of the given three-dimensional Bigarray by fixing the last two coordinates. The integer parameters are the coordinates of the slice to extract. See Bigarray.Genarray.slice_right for more details. Array3.slice_right_1 applies only to arrays with Fortran layout.

    val slice_left_2 : ('a, 'b, c_layout) t -> int -> ('a, 'b, c_layout) Array2.t

    Extract a two-dimensional slice of the given three-dimensional Bigarray by fixing the first coordinate. The integer parameter is the first coordinate of the slice to extract. See Bigarray.Genarray.slice_left for more details. Array3.slice_left_2 applies only to arrays with C layout.

    val slice_right_2 : + ('a, 'b, fortran_layout) t -> + int -> + ('a, 'b, fortran_layout) Array2.t

    Extract a two-dimensional slice of the given three-dimensional Bigarray by fixing the last coordinate. The integer parameter is the coordinate of the slice to extract. See Bigarray.Genarray.slice_right for more details. Array3.slice_right_2 applies only to arrays with Fortran layout.

    val blit : ('a, 'b, 'c) t -> ('a, 'b, 'c) t -> unit

    Copy the first Bigarray to the second Bigarray. See Bigarray.Genarray.blit for more details.

    val fill : ('a, 'b, 'c) t -> 'a -> unit

    Fill the given Bigarray with the given value. See Bigarray.Genarray.fill for more details.

    val of_array : + ('a, 'b) kind -> + 'c layout -> + 'a array array array -> + ('a, 'b, 'c) t

    Build a three-dimensional Bigarray initialized from the given array of arrays of arrays.

    val unsafe_get : ('a, 'b, 'c) t -> int -> int -> int -> 'a

    Like Bigarray.Array3.get, but bounds checking is not always performed.

    val unsafe_set : ('a, 'b, 'c) t -> int -> int -> int -> 'a -> unit

    Like Bigarray.Array3.set, but bounds checking is not always performed.

    diff --git a/ocaml/Stdlib/Bigarray/Genarray/index.html b/ocaml/Stdlib/Bigarray/Genarray/index.html new file mode 100644 index 0000000..e01b360 --- /dev/null +++ b/ocaml/Stdlib/Bigarray/Genarray/index.html @@ -0,0 +1,14 @@ + +Genarray (ocaml.Stdlib.Bigarray.Genarray)

    Module Bigarray.Genarray

    type (!'a, !'b, !'c) t

    The type Genarray.t is the type of Bigarrays with variable numbers of dimensions. Any number of dimensions between 0 and 16 is supported.

    The three type parameters to Genarray.t identify the array element kind and layout, as follows:

    • the first parameter, 'a, is the OCaml type for accessing array elements (float, int, int32, int64, nativeint);
    • the second parameter, 'b, is the actual kind of array elements (float32_elt, float64_elt, int8_signed_elt, int8_unsigned_elt, etc);
    • the third parameter, 'c, identifies the array layout (c_layout or fortran_layout).

    For instance, (float, float32_elt, fortran_layout) Genarray.t is the type of generic Bigarrays containing 32-bit floats in Fortran layout; reads and writes in this array use the OCaml type float.

    val create : ('a, 'b) kind -> 'c layout -> int array -> ('a, 'b, 'c) t

    Genarray.create kind layout dimensions returns a new Bigarray whose element kind is determined by the parameter kind (one of float32, float64, int8_signed, etc) and whose layout is determined by the parameter layout (one of c_layout or fortran_layout). The dimensions parameter is an array of integers that indicate the size of the Bigarray in each dimension. The length of dimensions determines the number of dimensions of the Bigarray.

    For instance, Genarray.create int32 c_layout [|4;6;8|] returns a fresh Bigarray of 32-bit integers, in C layout, having three dimensions, the three dimensions being 4, 6 and 8 respectively.

    Bigarrays returned by Genarray.create are not initialized: the initial values of array elements is unspecified.

    Genarray.create raises Invalid_argument if the number of dimensions is not in the range 0 to 16 inclusive, or if one of the dimensions is negative.

    val init : + ('a, 'b) kind -> + 'c layout -> + int array -> + (int array -> 'a) -> + ('a, 'b, 'c) t

    Genarray.init kind layout dimensions f returns a new Bigarray b whose element kind is determined by the parameter kind (one of float32, float64, int8_signed, etc) and whose layout is determined by the parameter layout (one of c_layout or fortran_layout). The dimensions parameter is an array of integers that indicate the size of the Bigarray in each dimension. The length of dimensions determines the number of dimensions of the Bigarray.

    Each element Genarray.get b i is initialized to the result of f i. In other words, Genarray.init kind layout dimensions f tabulates the results of f applied to the indices of a new Bigarray whose layout is described by kind, layout and dimensions. The index array i may be shared and mutated between calls to f.

    For instance, Genarray.init int c_layout [|2; 1; 3|] (Array.fold_left (+) 0) returns a fresh Bigarray of integers, in C layout, having three dimensions (2, 1, 3, respectively), with the element values 0, 1, 2, 1, 2, 3.

    Genarray.init raises Invalid_argument if the number of dimensions is not in the range 0 to 16 inclusive, or if one of the dimensions is negative.

    • since 4.12
    val num_dims : ('a, 'b, 'c) t -> int

    Return the number of dimensions of the given Bigarray.

    val dims : ('a, 'b, 'c) t -> int array

    Genarray.dims a returns all dimensions of the Bigarray a, as an array of integers of length Genarray.num_dims a.

    val nth_dim : ('a, 'b, 'c) t -> int -> int

    Genarray.nth_dim a n returns the n-th dimension of the Bigarray a. The first dimension corresponds to n = 0; the second dimension corresponds to n = 1; the last dimension, to n = Genarray.num_dims a - 1.

    • raises Invalid_argument

      if n is less than 0 or greater or equal than Genarray.num_dims a.

    val kind : ('a, 'b, 'c) t -> ('a, 'b) kind

    Return the kind of the given Bigarray.

    val layout : ('a, 'b, 'c) t -> 'c layout

    Return the layout of the given Bigarray.

    val change_layout : ('a, 'b, 'c) t -> 'd layout -> ('a, 'b, 'd) t

    Genarray.change_layout a layout returns a Bigarray with the specified layout, sharing the data with a (and hence having the same dimensions as a). No copying of elements is involved: the new array and the original array share the same storage space. The dimensions are reversed, such that get v [| a; b |] in C layout becomes get v [| b+1; a+1 |] in Fortran layout.

    • since 4.04
    val size_in_bytes : ('a, 'b, 'c) t -> int

    size_in_bytes a is the number of elements in a multiplied by a's kind_size_in_bytes.

    • since 4.03
    val get : ('a, 'b, 'c) t -> int array -> 'a

    Read an element of a generic Bigarray. Genarray.get a [|i1; ...; iN|] returns the element of a whose coordinates are i1 in the first dimension, i2 in the second dimension, ..., iN in the N-th dimension.

    If a has C layout, the coordinates must be greater or equal than 0 and strictly less than the corresponding dimensions of a. If a has Fortran layout, the coordinates must be greater or equal than 1 and less or equal than the corresponding dimensions of a.

    If N > 3, alternate syntax is provided: you can write a.{i1, i2, ..., iN} instead of Genarray.get a [|i1; ...; iN|]. (The syntax a.{...} with one, two or three coordinates is reserved for accessing one-, two- and three-dimensional arrays as described below.)

    • raises Invalid_argument

      if the array a does not have exactly N dimensions, or if the coordinates are outside the array bounds.

    val set : ('a, 'b, 'c) t -> int array -> 'a -> unit

    Assign an element of a generic Bigarray. Genarray.set a [|i1; ...; iN|] v stores the value v in the element of a whose coordinates are i1 in the first dimension, i2 in the second dimension, ..., iN in the N-th dimension.

    The array a must have exactly N dimensions, and all coordinates must lie inside the array bounds, as described for Genarray.get; otherwise, Invalid_argument is raised.

    If N > 3, alternate syntax is provided: you can write a.{i1, i2, ..., iN} <- v instead of Genarray.set a [|i1; ...; iN|] v. (The syntax a.{...} <- v with one, two or three coordinates is reserved for updating one-, two- and three-dimensional arrays as described below.)

    val sub_left : ('a, 'b, c_layout) t -> int -> int -> ('a, 'b, c_layout) t

    Extract a sub-array of the given Bigarray by restricting the first (left-most) dimension. Genarray.sub_left a ofs len returns a Bigarray with the same number of dimensions as a, and the same dimensions as a, except the first dimension, which corresponds to the interval [ofs ... ofs + len - 1] of the first dimension of a. No copying of elements is involved: the sub-array and the original array share the same storage space. In other terms, the element at coordinates [|i1; ...; iN|] of the sub-array is identical to the element at coordinates [|i1+ofs; ...; iN|] of the original array a.

    Genarray.sub_left applies only to Bigarrays in C layout.

    • raises Invalid_argument

      if ofs and len do not designate a valid sub-array of a, that is, if ofs < 0, or len < 0, or ofs + len > Genarray.nth_dim a 0.

    val sub_right : + ('a, 'b, fortran_layout) t -> + int -> + int -> + ('a, 'b, fortran_layout) t

    Extract a sub-array of the given Bigarray by restricting the last (right-most) dimension. Genarray.sub_right a ofs len returns a Bigarray with the same number of dimensions as a, and the same dimensions as a, except the last dimension, which corresponds to the interval [ofs ... ofs + len - 1] of the last dimension of a. No copying of elements is involved: the sub-array and the original array share the same storage space. In other terms, the element at coordinates [|i1; ...; iN|] of the sub-array is identical to the element at coordinates [|i1; ...; iN+ofs|] of the original array a.

    Genarray.sub_right applies only to Bigarrays in Fortran layout.

    • raises Invalid_argument

      if ofs and len do not designate a valid sub-array of a, that is, if ofs < 1, or len < 0, or ofs + len > Genarray.nth_dim a (Genarray.num_dims a - 1).

    val slice_left : ('a, 'b, c_layout) t -> int array -> ('a, 'b, c_layout) t

    Extract a sub-array of lower dimension from the given Bigarray by fixing one or several of the first (left-most) coordinates. Genarray.slice_left a [|i1; ... ; iM|] returns the 'slice' of a obtained by setting the first M coordinates to i1, ..., iM. If a has N dimensions, the slice has dimension N - M, and the element at coordinates [|j1; ...; j(N-M)|] in the slice is identical to the element at coordinates [|i1; ...; iM; j1; ...; j(N-M)|] in the original array a. No copying of elements is involved: the slice and the original array share the same storage space.

    Genarray.slice_left applies only to Bigarrays in C layout.

    • raises Invalid_argument

      if M >= N, or if [|i1; ... ; iM|] is outside the bounds of a.

    val slice_right : + ('a, 'b, fortran_layout) t -> + int array -> + ('a, 'b, fortran_layout) t

    Extract a sub-array of lower dimension from the given Bigarray by fixing one or several of the last (right-most) coordinates. Genarray.slice_right a [|i1; ... ; iM|] returns the 'slice' of a obtained by setting the last M coordinates to i1, ..., iM. If a has N dimensions, the slice has dimension N - M, and the element at coordinates [|j1; ...; j(N-M)|] in the slice is identical to the element at coordinates [|j1; ...; j(N-M); i1; ...; iM|] in the original array a. No copying of elements is involved: the slice and the original array share the same storage space.

    Genarray.slice_right applies only to Bigarrays in Fortran layout.

    • raises Invalid_argument

      if M >= N, or if [|i1; ... ; iM|] is outside the bounds of a.

    val blit : ('a, 'b, 'c) t -> ('a, 'b, 'c) t -> unit

    Copy all elements of a Bigarray in another Bigarray. Genarray.blit src dst copies all elements of src into dst. Both arrays src and dst must have the same number of dimensions and equal dimensions. Copying a sub-array of src to a sub-array of dst can be achieved by applying Genarray.blit to sub-array or slices of src and dst.

    val fill : ('a, 'b, 'c) t -> 'a -> unit

    Set all elements of a Bigarray to a given value. Genarray.fill a v stores the value v in all elements of the Bigarray a. Setting only some elements of a to v can be achieved by applying Genarray.fill to a sub-array or a slice of a.

    diff --git a/ocaml/Stdlib/Bigarray/index.html b/ocaml/Stdlib/Bigarray/index.html new file mode 100644 index 0000000..d49ece9 --- /dev/null +++ b/ocaml/Stdlib/Bigarray/index.html @@ -0,0 +1,25 @@ + +Bigarray (ocaml.Stdlib.Bigarray)

    Module Stdlib.Bigarray

    Large, multi-dimensional, numerical arrays.

    This module implements multi-dimensional arrays of integers and floating-point numbers, thereafter referred to as 'Bigarrays', to distinguish them from the standard OCaml arrays described in Array.

    The implementation allows efficient sharing of large numerical arrays between OCaml code and C or Fortran numerical libraries.

    The main differences between 'Bigarrays' and standard OCaml arrays are as follows:

    • Bigarrays are not limited in size, unlike OCaml arrays. (Normal float arrays are limited to 2,097,151 elements on a 32-bit platform, and normal arrays of other types to 4,194,303 elements.)
    • Bigarrays are multi-dimensional. Any number of dimensions between 0 and 16 is supported. In contrast, OCaml arrays are mono-dimensional and require encoding multi-dimensional arrays as arrays of arrays.
    • Bigarrays can only contain integers and floating-point numbers, while OCaml arrays can contain arbitrary OCaml data types.
    • Bigarrays provide more space-efficient storage of integer and floating-point elements than normal OCaml arrays, in particular because they support 'small' types such as single-precision floats and 8 and 16-bit integers, in addition to the standard OCaml types of double-precision floats and 32 and 64-bit integers.
    • The memory layout of Bigarrays is entirely compatible with that of arrays in C and Fortran, allowing large arrays to be passed back and forth between OCaml code and C / Fortran code with no data copying at all.
    • Bigarrays support interesting high-level operations that normal arrays do not provide efficiently, such as extracting sub-arrays and 'slicing' a multi-dimensional array along certain dimensions, all without any copying.

    Users of this module are encouraged to do open Bigarray in their source, then refer to array types and operations via short dot notation, e.g. Array1.t or Array2.sub.

    Bigarrays support all the OCaml ad-hoc polymorphic operations:

    Element kinds

    Bigarrays can contain elements of the following kinds:

    Each element kind is represented at the type level by one of the *_elt types defined below (defined with a single constructor instead of abstract types for technical injectivity reasons).

    • since 4.07 Moved from otherlibs to stdlib.
    • since 5.2 Added float16_elt element kind.
    type float16_elt =
    1. | Float16_elt
    type float32_elt =
    1. | Float32_elt
    type float64_elt =
    1. | Float64_elt
    type int8_signed_elt =
    1. | Int8_signed_elt
    type int8_unsigned_elt =
    1. | Int8_unsigned_elt
    type int16_signed_elt =
    1. | Int16_signed_elt
    type int16_unsigned_elt =
    1. | Int16_unsigned_elt
    type int32_elt =
    1. | Int32_elt
    type int64_elt =
    1. | Int64_elt
    type int_elt =
    1. | Int_elt
    type nativeint_elt =
    1. | Nativeint_elt
    type complex32_elt =
    1. | Complex32_elt
    type complex64_elt =
    1. | Complex64_elt
    type ('a, 'b) kind =
    1. | Float32 : (float, float32_elt) kind
    2. | Float64 : (float, float64_elt) kind
    3. | Int8_signed : (int, int8_signed_elt) kind
    4. | Int8_unsigned : (int, int8_unsigned_elt) kind
    5. | Int16_signed : (int, int16_signed_elt) kind
    6. | Int16_unsigned : (int, int16_unsigned_elt) kind
    7. | Int32 : (int32, int32_elt) kind
    8. | Int64 : (int64, int64_elt) kind
    9. | Int : (int, int_elt) kind
    10. | Nativeint : (nativeint, nativeint_elt) kind
    11. | Complex32 : (Complex.t, complex32_elt) kind
    12. | Complex64 : (Complex.t, complex64_elt) kind
    13. | Char : (char, int8_unsigned_elt) kind
    14. | Float16 : (float, float16_elt) kind

    To each element kind is associated an OCaml type, which is the type of OCaml values that can be stored in the Bigarray or read back from it. This type is not necessarily the same as the type of the array elements proper: for instance, a Bigarray whose elements are of kind float32_elt contains 32-bit single precision floats, but reading or writing one of its elements from OCaml uses the OCaml type float, which is 64-bit double precision floats.

    The GADT type ('a, 'b) kind captures this association of an OCaml type 'a for values read or written in the Bigarray, and of an element kind 'b which represents the actual contents of the Bigarray. Its constructors list all possible associations of OCaml types with element kinds, and are re-exported below for backward-compatibility reasons.

    Using a generalized algebraic datatype (GADT) here allows writing well-typed polymorphic functions whose return type depend on the argument type, such as:

      let zero : type a b. (a, b) kind -> a = function
+    | Float32 -> 0.0 | Complex32 -> Complex.zero
+    | Float64 -> 0.0 | Complex64 -> Complex.zero
+    | Float16 -> 0.0
+    | Int8_signed -> 0 | Int8_unsigned -> 0
+    | Int16_signed -> 0 | Int16_unsigned -> 0
+    | Int32 -> 0l | Int64 -> 0L
+    | Int -> 0 | Nativeint -> 0n
+    | Char -> '\000'
    • since 5.2 Constructor Float16 for the GADT.
    val float16 : (float, float16_elt) kind

    See Bigarray.char.

    • since 5.2
    val float32 : (float, float32_elt) kind

    See Bigarray.char.

    val float64 : (float, float64_elt) kind

    See Bigarray.char.

    val complex32 : (Complex.t, complex32_elt) kind

    See Bigarray.char.

    val complex64 : (Complex.t, complex64_elt) kind

    See Bigarray.char.

    val int8_signed : (int, int8_signed_elt) kind

    See Bigarray.char.

    val int8_unsigned : (int, int8_unsigned_elt) kind

    See Bigarray.char.

    val int16_signed : (int, int16_signed_elt) kind

    See Bigarray.char.

    val int16_unsigned : (int, int16_unsigned_elt) kind

    See Bigarray.char.

    val int : (int, int_elt) kind

    See Bigarray.char.

    val int32 : (int32, int32_elt) kind

    See Bigarray.char.

    val int64 : (int64, int64_elt) kind

    See Bigarray.char.

    val nativeint : (nativeint, nativeint_elt) kind

    See Bigarray.char.

    val char : (char, int8_unsigned_elt) kind

    As shown by the types of the values above, Bigarrays of kind float16_elt, float32_elt and float64_elt are accessed using the OCaml type float. Bigarrays of complex kinds complex32_elt, complex64_elt are accessed with the OCaml type Complex.t. Bigarrays of integer kinds are accessed using the smallest OCaml integer type large enough to represent the array elements: int for 8- and 16-bit integer Bigarrays, as well as OCaml-integer Bigarrays; int32 for 32-bit integer Bigarrays; int64 for 64-bit integer Bigarrays; and nativeint for platform-native integer Bigarrays. Finally, Bigarrays of kind int8_unsigned_elt can also be accessed as arrays of characters instead of arrays of small integers, by using the kind value char instead of int8_unsigned.

    val kind_size_in_bytes : ('a, 'b) kind -> int

    kind_size_in_bytes k is the number of bytes used to store an element of type k.

    • since 4.03

    Array layouts

    type c_layout =
    1. | C_layout_typ

    See Bigarray.fortran_layout.

    type fortran_layout =
    1. | Fortran_layout_typ

    To facilitate interoperability with existing C and Fortran code, this library supports two different memory layouts for Bigarrays, one compatible with the C conventions, the other compatible with the Fortran conventions.

    In the C-style layout, array indices start at 0, and multi-dimensional arrays are laid out in row-major format. That is, for a two-dimensional array, all elements of row 0 are contiguous in memory, followed by all elements of row 1, etc. In other terms, the array elements at (x,y) and (x, y+1) are adjacent in memory.

    In the Fortran-style layout, array indices start at 1, and multi-dimensional arrays are laid out in column-major format. That is, for a two-dimensional array, all elements of column 0 are contiguous in memory, followed by all elements of column 1, etc. In other terms, the array elements at (x,y) and (x+1, y) are adjacent in memory.

    Each layout style is identified at the type level by the phantom types Bigarray.c_layout and Bigarray.fortran_layout respectively.

    Supported layouts

    The GADT type 'a layout represents one of the two supported memory layouts: C-style or Fortran-style. Its constructors are re-exported as values below for backward-compatibility reasons.

    type 'a layout =
    1. | C_layout : c_layout layout
    2. | Fortran_layout : fortran_layout layout
    val c_layout : c_layout layout
    val fortran_layout : fortran_layout layout

    Generic arrays (of arbitrarily many dimensions)

    module Genarray : sig ... end

    Zero-dimensional arrays

    module Array0 : sig ... end

    Zero-dimensional arrays. The Array0 structure provides operations similar to those of Bigarray.Genarray, but specialized to the case of zero-dimensional arrays that only contain a single scalar value. Statically knowing the number of dimensions of the array allows faster operations, and more precise static type-checking.

    One-dimensional arrays

    module Array1 : sig ... end

    One-dimensional arrays. The Array1 structure provides operations similar to those of Bigarray.Genarray, but specialized to the case of one-dimensional arrays. (The Array2 and Array3 structures below provide operations specialized for two- and three-dimensional arrays.) Statically knowing the number of dimensions of the array allows faster operations, and more precise static type-checking.

    Two-dimensional arrays

    module Array2 : sig ... end

    Two-dimensional arrays. The Array2 structure provides operations similar to those of Bigarray.Genarray, but specialized to the case of two-dimensional arrays.

    Three-dimensional arrays

    module Array3 : sig ... end

    Three-dimensional arrays. The Array3 structure provides operations similar to those of Bigarray.Genarray, but specialized to the case of three-dimensional arrays.

    Coercions between generic Bigarrays and fixed-dimension Bigarrays

    val genarray_of_array0 : ('a, 'b, 'c) Array0.t -> ('a, 'b, 'c) Genarray.t

    Return the generic Bigarray corresponding to the given zero-dimensional Bigarray.

    • since 4.05
    val genarray_of_array1 : ('a, 'b, 'c) Array1.t -> ('a, 'b, 'c) Genarray.t

    Return the generic Bigarray corresponding to the given one-dimensional Bigarray.

    val genarray_of_array2 : ('a, 'b, 'c) Array2.t -> ('a, 'b, 'c) Genarray.t

    Return the generic Bigarray corresponding to the given two-dimensional Bigarray.

    val genarray_of_array3 : ('a, 'b, 'c) Array3.t -> ('a, 'b, 'c) Genarray.t

    Return the generic Bigarray corresponding to the given three-dimensional Bigarray.

    val array0_of_genarray : ('a, 'b, 'c) Genarray.t -> ('a, 'b, 'c) Array0.t

    Return the zero-dimensional Bigarray corresponding to the given generic Bigarray.

    • raises Invalid_argument

      if the generic Bigarray does not have exactly zero dimension.

    • since 4.05
    val array1_of_genarray : ('a, 'b, 'c) Genarray.t -> ('a, 'b, 'c) Array1.t

    Return the one-dimensional Bigarray corresponding to the given generic Bigarray.

    • raises Invalid_argument

      if the generic Bigarray does not have exactly one dimension.

    val array2_of_genarray : ('a, 'b, 'c) Genarray.t -> ('a, 'b, 'c) Array2.t

    Return the two-dimensional Bigarray corresponding to the given generic Bigarray.

    • raises Invalid_argument

      if the generic Bigarray does not have exactly two dimensions.

    val array3_of_genarray : ('a, 'b, 'c) Genarray.t -> ('a, 'b, 'c) Array3.t

    Return the three-dimensional Bigarray corresponding to the given generic Bigarray.

    • raises Invalid_argument

      if the generic Bigarray does not have exactly three dimensions.

    Re-shaping Bigarrays

    val reshape : ('a, 'b, 'c) Genarray.t -> int array -> ('a, 'b, 'c) Genarray.t

    reshape b [|d1;...;dN|] converts the Bigarray b to a N-dimensional array of dimensions d1...dN. The returned array and the original array b share their data and have the same layout. For instance, assuming that b is a one-dimensional array of dimension 12, reshape b [|3;4|] returns a two-dimensional array b' of dimensions 3 and 4. If b has C layout, the element (x,y) of b' corresponds to the element x * 3 + y of b. If b has Fortran layout, the element (x,y) of b' corresponds to the element x + (y - 1) * 4 of b. The returned Bigarray must have exactly the same number of elements as the original Bigarray b. That is, the product of the dimensions of b must be equal to i1 * ... * iN. Otherwise, Invalid_argument is raised.

    val reshape_0 : ('a, 'b, 'c) Genarray.t -> ('a, 'b, 'c) Array0.t

    Specialized version of Bigarray.reshape for reshaping to zero-dimensional arrays.

    • since 4.05
    val reshape_1 : ('a, 'b, 'c) Genarray.t -> int -> ('a, 'b, 'c) Array1.t

    Specialized version of Bigarray.reshape for reshaping to one-dimensional arrays.

    val reshape_2 : ('a, 'b, 'c) Genarray.t -> int -> int -> ('a, 'b, 'c) Array2.t

    Specialized version of Bigarray.reshape for reshaping to two-dimensional arrays.

    val reshape_3 : + ('a, 'b, 'c) Genarray.t -> + int -> + int -> + int -> + ('a, 'b, 'c) Array3.t

    Specialized version of Bigarray.reshape for reshaping to three-dimensional arrays.

    Bigarrays and concurrency safety

    Care must be taken when concurrently accessing bigarrays from multiple domains: accessing a bigarray will never crash a program, but unsynchronized accesses might yield surprising (non-sequentially-consistent) results.

    Atomicity

    Every bigarray operation that accesses more than one array element is not atomic. This includes slicing, bliting, and filling bigarrays.

    For example, consider the following program:

    open Bigarray
+let size = 100_000_000
+let a = Array1.init Int C_layout size (fun _ -> 1)
+let update f a () =
+  for i = 0 to size - 1 do a.{i} <- f a.{i} done
+let d1 = Domain.spawn (update (fun x -> x + 1) a)
+let d2 = Domain.spawn (update (fun x -> 2 * x + 1) a)
+let () = Domain.join d1; Domain.join d2

    After executing this code, each field of the bigarray a is either 2, 3, 4 or 5. If atomicity is required, then the user must implement their own synchronization (for example, using Mutex.t).

    Data races

    If two domains only access disjoint parts of the bigarray, then the observed behaviour is the equivalent to some sequential interleaving of the operations from the two domains.

    A data race is said to occur when two domains access the same bigarray element without synchronization and at least one of the accesses is a write. In the absence of data races, the observed behaviour is equivalent to some sequential interleaving of the operations from different domains.

    Whenever possible, data races should be avoided by using synchronization to mediate the accesses to the bigarray elements.

    Indeed, in the presence of data races, programs will not crash but the observed behaviour may not be equivalent to any sequential interleaving of operations from different domains.

    Tearing

    Bigarrays have a distinct caveat in the presence of data races: concurrent bigarray operations might produce surprising values due to tearing. More precisely, the interleaving of partial writes and reads might create values that would not exist with a sequential execution. For instance, at the end of

    let res = Array1.init Complex64 c_layout size (fun _ -> Complex.zero)
+let d1 = Domain.spawn (fun () -> Array1.fill res Complex.one)
+let d2 = Domain.spawn (fun () -> Array1.fill res Complex.i)
+let () = Domain.join d1; Domain.join d2

    the res bigarray might contain values that are neither Complex.i nor Complex.one (for instance 1 + i).

    diff --git a/ocaml/Stdlib/Bool/index.html b/ocaml/Stdlib/Bool/index.html new file mode 100644 index 0000000..cd4f6ca --- /dev/null +++ b/ocaml/Stdlib/Bool/index.html @@ -0,0 +1,2 @@ + +Bool (ocaml.Stdlib.Bool)

    Module Stdlib.Bool

    Boolean values.

    • since 4.08

    Booleans

    type t = bool =
    1. | false
    2. | true

    The type of booleans (truth values).

    The constructors false and true are included here so that they have paths, but they are not intended to be used in user-defined data types.

    val not : bool -> bool

    not b is the boolean negation of b.

    val (&&) : bool -> bool -> bool

    e0 && e1 is the lazy boolean conjunction of expressions e0 and e1. If e0 evaluates to false, e1 is not evaluated. Right-associative operator at precedence level 3/11.

    val (||) : bool -> bool -> bool

    e0 || e1 is the lazy boolean disjunction of expressions e0 and e1. If e0 evaluates to true, e1 is not evaluated. Right-associative operator at precedence level 2/11.

    Predicates and comparisons

    val equal : bool -> bool -> bool

    equal b0 b1 is true if and only if b0 and b1 are both true or both false.

    val compare : bool -> bool -> int

    compare b0 b1 is a total order on boolean values. false is smaller than true.

    Converting

    val to_int : bool -> int

    to_int b is 0 if b is false and 1 if b is true.

    val to_float : bool -> float

    to_float b is 0. if b is false and 1. if b is true.

    val to_string : bool -> string

    to_string b is "true" if b is true and "false" if b is false.

    val seeded_hash : int -> bool -> int

    A seeded hash function for booleans, with the same output value as Hashtbl.seeded_hash. This function allows this module to be passed as argument to the functor Hashtbl.MakeSeeded.

    • since 5.1
    val hash : bool -> int

    An unseeded hash function for booleans, with the same output value as Hashtbl.hash. This function allows this module to be passed as argument to the functor Hashtbl.Make.

    • since 5.1
    diff --git a/ocaml/Stdlib/Buffer/index.html b/ocaml/Stdlib/Buffer/index.html new file mode 100644 index 0000000..81b01de --- /dev/null +++ b/ocaml/Stdlib/Buffer/index.html @@ -0,0 +1,6 @@ + +Buffer (ocaml.Stdlib.Buffer)

    Module Stdlib.Buffer

    Extensible buffers.

    This module implements buffers that automatically expand as necessary. It provides accumulative concatenation of strings in linear time (instead of quadratic time when strings are concatenated pairwise). For example:

         let concat_strings ss =
+       let b = Buffer.create 16 in
+         List.iter (Buffer.add_string b) ss;
+         Buffer.contents b
+

    Unsynchronized accesses

    Unsynchronized accesses to a buffer may lead to an invalid buffer state. Thus, concurrent accesses to a buffer must be synchronized (for instance with a Mutex.t).

    type t

    The abstract type of buffers.

    val create : int -> t

    create n returns a fresh buffer, initially empty. The n parameter is the initial size of the internal byte sequence that holds the buffer contents. That byte sequence is automatically reallocated when more than n characters are stored in the buffer, but shrinks back to n characters when reset is called. For best performance, n should be of the same order of magnitude as the number of characters that are expected to be stored in the buffer (for instance, 80 for a buffer that holds one output line). Nothing bad will happen if the buffer grows beyond that limit, however. In doubt, take n = 16 for instance. If n is not between 1 and Sys.max_string_length, it will be clipped to that interval.

    val contents : t -> string

    Return a copy of the current contents of the buffer. The buffer itself is unchanged.

    val to_bytes : t -> bytes

    Return a copy of the current contents of the buffer. The buffer itself is unchanged.

    • since 4.02
    val sub : t -> int -> int -> string

    Buffer.sub b off len returns a copy of len bytes from the current contents of the buffer b, starting at offset off.

    val blit : t -> int -> bytes -> int -> int -> unit

    Buffer.blit src srcoff dst dstoff len copies len characters from the current contents of the buffer src, starting at offset srcoff to dst, starting at character dstoff.

    • raises Invalid_argument

      if srcoff and len do not designate a valid range of src, or if dstoff and len do not designate a valid range of dst.

    • since 3.11.2
    val nth : t -> int -> char

    Get the n-th character of the buffer.

    val length : t -> int

    Return the number of characters currently contained in the buffer.

    val clear : t -> unit

    Empty the buffer.

    val reset : t -> unit

    Empty the buffer and deallocate the internal byte sequence holding the buffer contents, replacing it with the initial internal byte sequence of length n that was allocated by Buffer.create n. For long-lived buffers that may have grown a lot, reset allows faster reclamation of the space used by the buffer.

    val output_buffer : out_channel -> t -> unit

    output_buffer oc b writes the current contents of buffer b on the output channel oc.

    val truncate : t -> int -> unit

    truncate b len truncates the length of b to len Note: the internal byte sequence is not shortened.

    • since 4.05

    Appending

    Note: all add_* operations can raise Failure if the internal byte sequence of the buffer would need to grow beyond Sys.max_string_length.

    val add_char : t -> char -> unit

    add_char b c appends the character c at the end of buffer b.

    val add_utf_8_uchar : t -> Uchar.t -> unit

    add_utf_8_uchar b u appends the UTF-8 encoding of u at the end of buffer b.

    • since 4.06
    val add_utf_16le_uchar : t -> Uchar.t -> unit

    add_utf_16le_uchar b u appends the UTF-16LE encoding of u at the end of buffer b.

    • since 4.06
    val add_utf_16be_uchar : t -> Uchar.t -> unit

    add_utf_16be_uchar b u appends the UTF-16BE encoding of u at the end of buffer b.

    • since 4.06
    val add_string : t -> string -> unit

    add_string b s appends the string s at the end of buffer b.

    val add_bytes : t -> bytes -> unit

    add_bytes b s appends the byte sequence s at the end of buffer b.

    • since 4.02
    val add_substring : t -> string -> int -> int -> unit

    add_substring b s ofs len takes len characters from offset ofs in string s and appends them at the end of buffer b.

    val add_subbytes : t -> bytes -> int -> int -> unit

    add_subbytes b s ofs len takes len characters from offset ofs in byte sequence s and appends them at the end of buffer b.

    • since 4.02
    val add_substitute : t -> (string -> string) -> string -> unit

    add_substitute b f s appends the string pattern s at the end of buffer b with substitution. The substitution process looks for variable references in the pattern and substitutes each variable reference with its value, as obtained by applying the mapping f to the variable name. Inside the string pattern, a variable reference is a non-escaped $ immediately followed by a variable name, which is one of the following:

    • a non empty sequence of alphanumeric or _ characters,
    • an arbitrary sequence of characters enclosed by a pair of matching parentheses or curly brackets. An escaped $ character is a $ that immediately follows a backslash character; the two characters together stand for a plain $.
    val add_buffer : t -> t -> unit

    add_buffer b1 b2 appends the current contents of buffer b2 at the end of buffer b1. b2 is not modified.

    val add_channel : t -> in_channel -> int -> unit

    add_channel b ic n reads at most n characters from the input channel ic and stores them at the end of buffer b.

    • raises End_of_file

      if the channel contains fewer than n characters. In this case, the characters are still added to the buffer, so as to avoid loss of data.

    Buffers and Sequences

    val to_seq : t -> char Seq.t

    Iterate on the buffer, in increasing order.

    The behavior is not specified if the buffer is modified during iteration.

    • since 4.07
    val to_seqi : t -> (int * char) Seq.t

    Iterate on the buffer, in increasing order, yielding indices along chars.

    The behavior is not specified if the buffer is modified during iteration.

    • since 4.07
    val add_seq : t -> char Seq.t -> unit

    Add chars to the buffer

    • since 4.07
    val of_seq : char Seq.t -> t

    Create a buffer from the generator

    • since 4.07

    Binary encoding of integers

    The functions in this section append binary encodings of integers to buffers.

    Little-endian (resp. big-endian) encoding means that least (resp. most) significant bytes are stored first. Big-endian is also known as network byte order. Native-endian encoding is either little-endian or big-endian depending on Sys.big_endian.

    32-bit and 64-bit integers are represented by the int32 and int64 types, which can be interpreted either as signed or unsigned numbers.

    8-bit and 16-bit integers are represented by the int type, which has more bits than the binary encoding. Functions that encode these values truncate their inputs to their least significant bytes.

    val add_uint8 : t -> int -> unit

    add_uint8 b i appends a binary unsigned 8-bit integer i to b.

    • since 4.08
    val add_int8 : t -> int -> unit

    add_int8 b i appends a binary signed 8-bit integer i to b.

    • since 4.08
    val add_uint16_ne : t -> int -> unit

    add_uint16_ne b i appends a binary native-endian unsigned 16-bit integer i to b.

    • since 4.08
    val add_uint16_be : t -> int -> unit

    add_uint16_be b i appends a binary big-endian unsigned 16-bit integer i to b.

    • since 4.08
    val add_uint16_le : t -> int -> unit

    add_uint16_le b i appends a binary little-endian unsigned 16-bit integer i to b.

    • since 4.08
    val add_int16_ne : t -> int -> unit

    add_int16_ne b i appends a binary native-endian signed 16-bit integer i to b.

    • since 4.08
    val add_int16_be : t -> int -> unit

    add_int16_be b i appends a binary big-endian signed 16-bit integer i to b.

    • since 4.08
    val add_int16_le : t -> int -> unit

    add_int16_le b i appends a binary little-endian signed 16-bit integer i to b.

    • since 4.08
    val add_int32_ne : t -> int32 -> unit

    add_int32_ne b i appends a binary native-endian 32-bit integer i to b.

    • since 4.08
    val add_int32_be : t -> int32 -> unit

    add_int32_be b i appends a binary big-endian 32-bit integer i to b.

    • since 4.08
    val add_int32_le : t -> int32 -> unit

    add_int32_le b i appends a binary little-endian 32-bit integer i to b.

    • since 4.08
    val add_int64_ne : t -> int64 -> unit

    add_int64_ne b i appends a binary native-endian 64-bit integer i to b.

    • since 4.08
    val add_int64_be : t -> int64 -> unit

    add_int64_be b i appends a binary big-endian 64-bit integer i to b.

    • since 4.08
    val add_int64_le : t -> int64 -> unit

    add_int64_ne b i appends a binary little-endian 64-bit integer i to b.

    • since 4.08
    diff --git a/ocaml/Stdlib/Bytes/index.html b/ocaml/Stdlib/Bytes/index.html new file mode 100644 index 0000000..1119c1f --- /dev/null +++ b/ocaml/Stdlib/Bytes/index.html @@ -0,0 +1,14 @@ + +Bytes (ocaml.Stdlib.Bytes)

    Module Stdlib.Bytes

    Byte sequence operations.

    A byte sequence is a mutable data structure that contains a fixed-length sequence of bytes. Each byte can be indexed in constant time for reading or writing.

    Given a byte sequence s of length l, we can access each of the l bytes of s via its index in the sequence. Indexes start at 0, and we will call an index valid in s if it falls within the range [0...l-1] (inclusive). A position is the point between two bytes or at the beginning or end of the sequence. We call a position valid in s if it falls within the range [0...l] (inclusive). Note that the byte at index n is between positions n and n+1.

    Two parameters start and len are said to designate a valid range of s if len >= 0 and start and start+len are valid positions in s.

    Byte sequences can be modified in place, for instance via the set and blit functions described below. See also strings (module String), which are almost the same data structure, but cannot be modified in place.

    Bytes are represented by the OCaml type char.

    The labeled version of this module can be used as described in the StdLabels module.

    • since 4.02
    val length : bytes -> int

    Return the length (number of bytes) of the argument.

    val get : bytes -> int -> char

    get s n returns the byte at index n in argument s.

    val set : bytes -> int -> char -> unit

    set s n c modifies s in place, replacing the byte at index n with c.

    val create : int -> bytes

    create n returns a new byte sequence of length n. The sequence is uninitialized and contains arbitrary bytes.

    val make : int -> char -> bytes

    make n c returns a new byte sequence of length n, filled with the byte c.

    val init : int -> (int -> char) -> bytes

    init n f returns a fresh byte sequence of length n, with character i initialized to the result of f i (in increasing index order).

    val empty : bytes

    A byte sequence of size 0.

    val copy : bytes -> bytes

    Return a new byte sequence that contains the same bytes as the argument.

    val of_string : string -> bytes

    Return a new byte sequence that contains the same bytes as the given string.

    val to_string : bytes -> string

    Return a new string that contains the same bytes as the given byte sequence.

    val sub : bytes -> int -> int -> bytes

    sub s pos len returns a new byte sequence of length len, containing the subsequence of s that starts at position pos and has length len.

    val sub_string : bytes -> int -> int -> string

    Same as sub but return a string instead of a byte sequence.

    val extend : bytes -> int -> int -> bytes

    extend s left right returns a new byte sequence that contains the bytes of s, with left uninitialized bytes prepended and right uninitialized bytes appended to it. If left or right is negative, then bytes are removed (instead of appended) from the corresponding side of s.

    • since 4.05 in BytesLabels
    val fill : bytes -> int -> int -> char -> unit

    fill s pos len c modifies s in place, replacing len characters with c, starting at pos.

    val blit : bytes -> int -> bytes -> int -> int -> unit

    blit src src_pos dst dst_pos len copies len bytes from byte sequence src, starting at index src_pos, to byte sequence dst, starting at index dst_pos. It works correctly even if src and dst are the same byte sequence, and the source and destination intervals overlap.

    • raises Invalid_argument

      if src_pos and len do not designate a valid range of src, or if dst_pos and len do not designate a valid range of dst.

    val blit_string : string -> int -> bytes -> int -> int -> unit

    blit_string src src_pos dst dst_pos len copies len bytes from string src, starting at index src_pos, to byte sequence dst, starting at index dst_pos.

    • raises Invalid_argument

      if src_pos and len do not designate a valid range of src, or if dst_pos and len do not designate a valid range of dst.

    • since 4.05 in BytesLabels
    val concat : bytes -> bytes list -> bytes

    concat sep sl concatenates the list of byte sequences sl, inserting the separator byte sequence sep between each, and returns the result as a new byte sequence.

    val cat : bytes -> bytes -> bytes

    cat s1 s2 concatenates s1 and s2 and returns the result as a new byte sequence.

    • since 4.05 in BytesLabels
    val iter : (char -> unit) -> bytes -> unit

    iter f s applies function f in turn to all the bytes of s. It is equivalent to f (get s 0); f (get s 1); ...; f (get s (length s - 1)); ().

    val iteri : (int -> char -> unit) -> bytes -> unit

    Same as iter, but the function is applied to the index of the byte as first argument and the byte itself as second argument.

    val map : (char -> char) -> bytes -> bytes

    map f s applies function f in turn to all the bytes of s (in increasing index order) and stores the resulting bytes in a new sequence that is returned as the result.

    val mapi : (int -> char -> char) -> bytes -> bytes

    mapi f s calls f with each character of s and its index (in increasing index order) and stores the resulting bytes in a new sequence that is returned as the result.

    val fold_left : ('acc -> char -> 'acc) -> 'acc -> bytes -> 'acc

    fold_left f x s computes f (... (f (f x (get s 0)) (get s 1)) ...) (get s (n-1)), where n is the length of s.

    • since 4.13
    val fold_right : (char -> 'acc -> 'acc) -> bytes -> 'acc -> 'acc

    fold_right f s x computes f (get s 0) (f (get s 1) ( ... (f (get s (n-1)) x) ...)), where n is the length of s.

    • since 4.13
    val for_all : (char -> bool) -> bytes -> bool

    for_all p s checks if all characters in s satisfy the predicate p.

    • since 4.13
    val exists : (char -> bool) -> bytes -> bool

    exists p s checks if at least one character of s satisfies the predicate p.

    • since 4.13
    val trim : bytes -> bytes

    Return a copy of the argument, without leading and trailing whitespace. The bytes regarded as whitespace are the ASCII characters ' ', '\012', '\n', '\r', and '\t'.

    val escaped : bytes -> bytes

    Return a copy of the argument, with special characters represented by escape sequences, following the lexical conventions of OCaml. All characters outside the ASCII printable range (32..126) are escaped, as well as backslash and double-quote.

    val index : bytes -> char -> int

    index s c returns the index of the first occurrence of byte c in s.

    val index_opt : bytes -> char -> int option

    index_opt s c returns the index of the first occurrence of byte c in s or None if c does not occur in s.

    • since 4.05
    val rindex : bytes -> char -> int

    rindex s c returns the index of the last occurrence of byte c in s.

    val rindex_opt : bytes -> char -> int option

    rindex_opt s c returns the index of the last occurrence of byte c in s or None if c does not occur in s.

    • since 4.05
    val index_from : bytes -> int -> char -> int

    index_from s i c returns the index of the first occurrence of byte c in s after position i. index s c is equivalent to index_from s 0 c.

    • raises Not_found

      if c does not occur in s after position i.

    val index_from_opt : bytes -> int -> char -> int option

    index_from_opt s i c returns the index of the first occurrence of byte c in s after position i or None if c does not occur in s after position i. index_opt s c is equivalent to index_from_opt s 0 c.

    • since 4.05
    val rindex_from : bytes -> int -> char -> int

    rindex_from s i c returns the index of the last occurrence of byte c in s before position i+1. rindex s c is equivalent to rindex_from s (length s - 1) c.

    • raises Not_found

      if c does not occur in s before position i+1.

    val rindex_from_opt : bytes -> int -> char -> int option

    rindex_from_opt s i c returns the index of the last occurrence of byte c in s before position i+1 or None if c does not occur in s before position i+1. rindex_opt s c is equivalent to rindex_from s (length s - 1) c.

    • since 4.05
    val contains : bytes -> char -> bool

    contains s c tests if byte c appears in s.

    val contains_from : bytes -> int -> char -> bool

    contains_from s start c tests if byte c appears in s after position start. contains s c is equivalent to contains_from s 0 c.

    val rcontains_from : bytes -> int -> char -> bool

    rcontains_from s stop c tests if byte c appears in s before position stop+1.

    val uppercase_ascii : bytes -> bytes

    Return a copy of the argument, with all lowercase letters translated to uppercase, using the US-ASCII character set.

    • since 4.03 (4.05 in BytesLabels)
    val lowercase_ascii : bytes -> bytes

    Return a copy of the argument, with all uppercase letters translated to lowercase, using the US-ASCII character set.

    • since 4.03 (4.05 in BytesLabels)
    val capitalize_ascii : bytes -> bytes

    Return a copy of the argument, with the first character set to uppercase, using the US-ASCII character set.

    • since 4.03 (4.05 in BytesLabels)
    val uncapitalize_ascii : bytes -> bytes

    Return a copy of the argument, with the first character set to lowercase, using the US-ASCII character set.

    • since 4.03 (4.05 in BytesLabels)
    type t = bytes

    An alias for the type of byte sequences.

    val compare : t -> t -> int

    The comparison function for byte sequences, with the same specification as Stdlib.compare. Along with the type t, this function compare allows the module Bytes to be passed as argument to the functors Set.Make and Map.Make.

    val equal : t -> t -> bool

    The equality function for byte sequences.

    • since 4.03 (4.05 in BytesLabels)
    val starts_with : prefix:bytes -> bytes -> bool

    starts_with ~prefix s is true if and only if s starts with prefix.

    • since 4.13
    val ends_with : suffix:bytes -> bytes -> bool

    ends_with ~suffix s is true if and only if s ends with suffix.

    • since 4.13

    Unsafe conversions (for advanced users)

    This section describes unsafe, low-level conversion functions between bytes and string. They do not copy the internal data; used improperly, they can break the immutability invariant on strings provided by the -safe-string option. They are available for expert library authors, but for most purposes you should use the always-correct to_string and of_string instead.

    val unsafe_to_string : bytes -> string

    Unsafely convert a byte sequence into a string.

    To reason about the use of unsafe_to_string, it is convenient to consider an "ownership" discipline. A piece of code that manipulates some data "owns" it; there are several disjoint ownership modes, including:

    • Unique ownership: the data may be accessed and mutated
    • Shared ownership: the data has several owners, that may only access it, not mutate it.

    Unique ownership is linear: passing the data to another piece of code means giving up ownership (we cannot write the data again). A unique owner may decide to make the data shared (giving up mutation rights on it), but shared data may not become uniquely-owned again.

    unsafe_to_string s can only be used when the caller owns the byte sequence s -- either uniquely or as shared immutable data. The caller gives up ownership of s, and gains ownership of the returned string.

    There are two valid use-cases that respect this ownership discipline:

    1. Creating a string by initializing and mutating a byte sequence that is never changed after initialization is performed.

    let string_init len f : string =
+  let s = Bytes.create len in
+  for i = 0 to len - 1 do Bytes.set s i (f i) done;
+  Bytes.unsafe_to_string s

    This function is safe because the byte sequence s will never be accessed or mutated after unsafe_to_string is called. The string_init code gives up ownership of s, and returns the ownership of the resulting string to its caller.

    Note that it would be unsafe if s was passed as an additional parameter to the function f as it could escape this way and be mutated in the future -- string_init would give up ownership of s to pass it to f, and could not call unsafe_to_string safely.

    We have provided the String.init, String.map and String.mapi functions to cover most cases of building new strings. You should prefer those over to_string or unsafe_to_string whenever applicable.

    2. Temporarily giving ownership of a byte sequence to a function that expects a uniquely owned string and returns ownership back, so that we can mutate the sequence again after the call ended.

    let bytes_length (s : bytes) =
+  String.length (Bytes.unsafe_to_string s)

    In this use-case, we do not promise that s will never be mutated after the call to bytes_length s. The String.length function temporarily borrows unique ownership of the byte sequence (and sees it as a string), but returns this ownership back to the caller, which may assume that s is still a valid byte sequence after the call. Note that this is only correct because we know that String.length does not capture its argument -- it could escape by a side-channel such as a memoization combinator.

    The caller may not mutate s while the string is borrowed (it has temporarily given up ownership). This affects concurrent programs, but also higher-order functions: if String.length returned a closure to be called later, s should not be mutated until this closure is fully applied and returns ownership.

    val unsafe_of_string : string -> bytes

    Unsafely convert a shared string to a byte sequence that should not be mutated.

    The same ownership discipline that makes unsafe_to_string correct applies to unsafe_of_string: you may use it if you were the owner of the string value, and you will own the return bytes in the same mode.

    In practice, unique ownership of string values is extremely difficult to reason about correctly. You should always assume strings are shared, never uniquely owned.

    For example, string literals are implicitly shared by the compiler, so you never uniquely own them.

    let incorrect = Bytes.unsafe_of_string "hello"
+let s = Bytes.of_string "hello"

    The first declaration is incorrect, because the string literal "hello" could be shared by the compiler with other parts of the program, and mutating incorrect is a bug. You must always use the second version, which performs a copy and is thus correct.

    Assuming unique ownership of strings that are not string literals, but are (partly) built from string literals, is also incorrect. For example, mutating unsafe_of_string ("foo" ^ s) could mutate the shared string "foo" -- assuming a rope-like representation of strings. More generally, functions operating on strings will assume shared ownership, they do not preserve unique ownership. It is thus incorrect to assume unique ownership of the result of unsafe_of_string.

    The only case we have reasonable confidence is safe is if the produced bytes is shared -- used as an immutable byte sequence. This is possibly useful for incremental migration of low-level programs that manipulate immutable sequences of bytes (for example Marshal.from_bytes) and previously used the string type for this purpose.

    val split_on_char : char -> bytes -> bytes list

    split_on_char sep s returns the list of all (possibly empty) subsequences of s that are delimited by the sep character. If s is empty, the result is the singleton list [empty].

    The function's output is specified by the following invariants:

    • The list is not empty.
    • Concatenating its elements using sep as a separator returns a byte sequence equal to the input (Bytes.concat (Bytes.make 1 sep) (Bytes.split_on_char sep s) = s).
    • No byte sequence in the result contains the sep character.
    • since 4.13

    Iterators

    val to_seq : t -> char Seq.t

    Iterate on the string, in increasing index order. Modifications of the string during iteration will be reflected in the sequence.

    • since 4.07
    val to_seqi : t -> (int * char) Seq.t

    Iterate on the string, in increasing order, yielding indices along chars

    • since 4.07
    val of_seq : char Seq.t -> t

    Create a string from the generator

    • since 4.07

    UTF codecs and validations

    • since 4.14

    UTF-8

    val get_utf_8_uchar : t -> int -> Uchar.utf_decode

    get_utf_8_uchar b i decodes an UTF-8 character at index i in b.

    val set_utf_8_uchar : t -> int -> Uchar.t -> int

    set_utf_8_uchar b i u UTF-8 encodes u at index i in b and returns the number of bytes n that were written starting at i. If n is 0 there was not enough space to encode u at i and b was left untouched. Otherwise a new character can be encoded at i + n.

    val is_valid_utf_8 : t -> bool

    is_valid_utf_8 b is true if and only if b contains valid UTF-8 data.

    UTF-16BE

    val get_utf_16be_uchar : t -> int -> Uchar.utf_decode

    get_utf_16be_uchar b i decodes an UTF-16BE character at index i in b.

    val set_utf_16be_uchar : t -> int -> Uchar.t -> int

    set_utf_16be_uchar b i u UTF-16BE encodes u at index i in b and returns the number of bytes n that were written starting at i. If n is 0 there was not enough space to encode u at i and b was left untouched. Otherwise a new character can be encoded at i + n.

    val is_valid_utf_16be : t -> bool

    is_valid_utf_16be b is true if and only if b contains valid UTF-16BE data.

    UTF-16LE

    val get_utf_16le_uchar : t -> int -> Uchar.utf_decode

    get_utf_16le_uchar b i decodes an UTF-16LE character at index i in b.

    val set_utf_16le_uchar : t -> int -> Uchar.t -> int

    set_utf_16le_uchar b i u UTF-16LE encodes u at index i in b and returns the number of bytes n that were written starting at i. If n is 0 there was not enough space to encode u at i and b was left untouched. Otherwise a new character can be encoded at i + n.

    val is_valid_utf_16le : t -> bool

    is_valid_utf_16le b is true if and only if b contains valid UTF-16LE data.

    Binary encoding/decoding of integers

    The functions in this section binary encode and decode integers to and from byte sequences.

    All following functions raise Invalid_argument if the space needed at index i to decode or encode the integer is not available.

    Little-endian (resp. big-endian) encoding means that least (resp. most) significant bytes are stored first. Big-endian is also known as network byte order. Native-endian encoding is either little-endian or big-endian depending on Sys.big_endian.

    32-bit and 64-bit integers are represented by the int32 and int64 types, which can be interpreted either as signed or unsigned numbers.

    8-bit and 16-bit integers are represented by the int type, which has more bits than the binary encoding. These extra bits are handled as follows:

    • Functions that decode signed (resp. unsigned) 8-bit or 16-bit integers represented by int values sign-extend (resp. zero-extend) their result.
    • Functions that encode 8-bit or 16-bit integers represented by int values truncate their input to their least significant bytes.
    val get_uint8 : bytes -> int -> int

    get_uint8 b i is b's unsigned 8-bit integer starting at byte index i.

    • since 4.08
    val get_int8 : bytes -> int -> int

    get_int8 b i is b's signed 8-bit integer starting at byte index i.

    • since 4.08
    val get_uint16_ne : bytes -> int -> int

    get_uint16_ne b i is b's native-endian unsigned 16-bit integer starting at byte index i.

    • since 4.08
    val get_uint16_be : bytes -> int -> int

    get_uint16_be b i is b's big-endian unsigned 16-bit integer starting at byte index i.

    • since 4.08
    val get_uint16_le : bytes -> int -> int

    get_uint16_le b i is b's little-endian unsigned 16-bit integer starting at byte index i.

    • since 4.08
    val get_int16_ne : bytes -> int -> int

    get_int16_ne b i is b's native-endian signed 16-bit integer starting at byte index i.

    • since 4.08
    val get_int16_be : bytes -> int -> int

    get_int16_be b i is b's big-endian signed 16-bit integer starting at byte index i.

    • since 4.08
    val get_int16_le : bytes -> int -> int

    get_int16_le b i is b's little-endian signed 16-bit integer starting at byte index i.

    • since 4.08
    val get_int32_ne : bytes -> int -> int32

    get_int32_ne b i is b's native-endian 32-bit integer starting at byte index i.

    • since 4.08
    val get_int32_be : bytes -> int -> int32

    get_int32_be b i is b's big-endian 32-bit integer starting at byte index i.

    • since 4.08
    val get_int32_le : bytes -> int -> int32

    get_int32_le b i is b's little-endian 32-bit integer starting at byte index i.

    • since 4.08
    val get_int64_ne : bytes -> int -> int64

    get_int64_ne b i is b's native-endian 64-bit integer starting at byte index i.

    • since 4.08
    val get_int64_be : bytes -> int -> int64

    get_int64_be b i is b's big-endian 64-bit integer starting at byte index i.

    • since 4.08
    val get_int64_le : bytes -> int -> int64

    get_int64_le b i is b's little-endian 64-bit integer starting at byte index i.

    • since 4.08
    val set_uint8 : bytes -> int -> int -> unit

    set_uint8 b i v sets b's unsigned 8-bit integer starting at byte index i to v.

    • since 4.08
    val set_int8 : bytes -> int -> int -> unit

    set_int8 b i v sets b's signed 8-bit integer starting at byte index i to v.

    • since 4.08
    val set_uint16_ne : bytes -> int -> int -> unit

    set_uint16_ne b i v sets b's native-endian unsigned 16-bit integer starting at byte index i to v.

    • since 4.08
    val set_uint16_be : bytes -> int -> int -> unit

    set_uint16_be b i v sets b's big-endian unsigned 16-bit integer starting at byte index i to v.

    • since 4.08
    val set_uint16_le : bytes -> int -> int -> unit

    set_uint16_le b i v sets b's little-endian unsigned 16-bit integer starting at byte index i to v.

    • since 4.08
    val set_int16_ne : bytes -> int -> int -> unit

    set_int16_ne b i v sets b's native-endian signed 16-bit integer starting at byte index i to v.

    • since 4.08
    val set_int16_be : bytes -> int -> int -> unit

    set_int16_be b i v sets b's big-endian signed 16-bit integer starting at byte index i to v.

    • since 4.08
    val set_int16_le : bytes -> int -> int -> unit

    set_int16_le b i v sets b's little-endian signed 16-bit integer starting at byte index i to v.

    • since 4.08
    val set_int32_ne : bytes -> int -> int32 -> unit

    set_int32_ne b i v sets b's native-endian 32-bit integer starting at byte index i to v.

    • since 4.08
    val set_int32_be : bytes -> int -> int32 -> unit

    set_int32_be b i v sets b's big-endian 32-bit integer starting at byte index i to v.

    • since 4.08
    val set_int32_le : bytes -> int -> int32 -> unit

    set_int32_le b i v sets b's little-endian 32-bit integer starting at byte index i to v.

    • since 4.08
    val set_int64_ne : bytes -> int -> int64 -> unit

    set_int64_ne b i v sets b's native-endian 64-bit integer starting at byte index i to v.

    • since 4.08
    val set_int64_be : bytes -> int -> int64 -> unit

    set_int64_be b i v sets b's big-endian 64-bit integer starting at byte index i to v.

    • since 4.08
    val set_int64_le : bytes -> int -> int64 -> unit

    set_int64_le b i v sets b's little-endian 64-bit integer starting at byte index i to v.

    • since 4.08

    Byte sequences and concurrency safety

    Care must be taken when concurrently accessing byte sequences from multiple domains: accessing a byte sequence will never crash a program, but unsynchronized accesses might yield surprising (non-sequentially-consistent) results.

    Atomicity

    Every byte sequence operation that accesses more than one byte is not atomic. This includes iteration and scanning.

    For example, consider the following program:

    let size = 100_000_000
+let b = Bytes.make size  ' '
+let update b f ()  =
+  Bytes.iteri (fun i x -> Bytes.set b i (Char.chr (f (Char.code x)))) b
+let d1 = Domain.spawn (update b (fun x -> x + 1))
+let d2 = Domain.spawn (update b (fun x -> 2 * x + 1))
+let () = Domain.join d1; Domain.join d2

    the bytes sequence b may contain a non-deterministic mixture of '!', 'A', 'B', and 'C' values.

    After executing this code, each byte of the sequence b is either '!', 'A', 'B', or 'C'. If atomicity is required, then the user must implement their own synchronization (for example, using Mutex.t).

    Data races

    If two domains only access disjoint parts of a byte sequence, then the observed behaviour is the equivalent to some sequential interleaving of the operations from the two domains.

    A data race is said to occur when two domains access the same byte without synchronization and at least one of the accesses is a write. In the absence of data races, the observed behaviour is equivalent to some sequential interleaving of the operations from different domains.

    Whenever possible, data races should be avoided by using synchronization to mediate the accesses to the elements of the sequence.

    Indeed, in the presence of data races, programs will not crash but the observed behaviour may not be equivalent to any sequential interleaving of operations from different domains. Nevertheless, even in the presence of data races, a read operation will return the value of some prior write to that location.

    Mixed-size accesses

    Another subtle point is that if a data race involves mixed-size writes and reads to the same location, the order in which those writes and reads are observed by domains is not specified. For instance, the following code write sequentially a 32-bit integer and a char to the same index

    let b = Bytes.make 10 '\000'
+let d1 = Domain.spawn (fun () -> Bytes.set_int32_ne b 0 100; b.[0] <- 'd' )

    In this situation, a domain that observes the write of 'd' to b.0 is not guaranteed to also observe the write to indices 1, 2, or 3.

    diff --git a/ocaml/Stdlib/BytesLabels/index.html b/ocaml/Stdlib/BytesLabels/index.html new file mode 100644 index 0000000..5857ea3 --- /dev/null +++ b/ocaml/Stdlib/BytesLabels/index.html @@ -0,0 +1,26 @@ + +BytesLabels (ocaml.Stdlib.BytesLabels)

    Module Stdlib.BytesLabels

    Byte sequence operations.

    A byte sequence is a mutable data structure that contains a fixed-length sequence of bytes. Each byte can be indexed in constant time for reading or writing.

    Given a byte sequence s of length l, we can access each of the l bytes of s via its index in the sequence. Indexes start at 0, and we will call an index valid in s if it falls within the range [0...l-1] (inclusive). A position is the point between two bytes or at the beginning or end of the sequence. We call a position valid in s if it falls within the range [0...l] (inclusive). Note that the byte at index n is between positions n and n+1.

    Two parameters start and len are said to designate a valid range of s if len >= 0 and start and start+len are valid positions in s.

    Byte sequences can be modified in place, for instance via the set and blit functions described below. See also strings (module String), which are almost the same data structure, but cannot be modified in place.

    Bytes are represented by the OCaml type char.

    The labeled version of this module can be used as described in the StdLabels module.

    • since 4.02
    val length : bytes -> int

    Return the length (number of bytes) of the argument.

    val get : bytes -> int -> char

    get s n returns the byte at index n in argument s.

    val set : bytes -> int -> char -> unit

    set s n c modifies s in place, replacing the byte at index n with c.

    val create : int -> bytes

    create n returns a new byte sequence of length n. The sequence is uninitialized and contains arbitrary bytes.

    val make : int -> char -> bytes

    make n c returns a new byte sequence of length n, filled with the byte c.

    val init : int -> f:(int -> char) -> bytes

    init n f returns a fresh byte sequence of length n, with character i initialized to the result of f i (in increasing index order).

    val empty : bytes

    A byte sequence of size 0.

    val copy : bytes -> bytes

    Return a new byte sequence that contains the same bytes as the argument.

    val of_string : string -> bytes

    Return a new byte sequence that contains the same bytes as the given string.

    val to_string : bytes -> string

    Return a new string that contains the same bytes as the given byte sequence.

    val sub : bytes -> pos:int -> len:int -> bytes

    sub s ~pos ~len returns a new byte sequence of length len, containing the subsequence of s that starts at position pos and has length len.

    val sub_string : bytes -> pos:int -> len:int -> string

    Same as sub but return a string instead of a byte sequence.

    val extend : bytes -> left:int -> right:int -> bytes

    extend s ~left ~right returns a new byte sequence that contains the bytes of s, with left uninitialized bytes prepended and right uninitialized bytes appended to it. If left or right is negative, then bytes are removed (instead of appended) from the corresponding side of s.

    • since 4.05 in BytesLabels
    val fill : bytes -> pos:int -> len:int -> char -> unit

    fill s ~pos ~len c modifies s in place, replacing len characters with c, starting at pos.

    val blit : + src:bytes -> + src_pos:int -> + dst:bytes -> + dst_pos:int -> + len:int -> + unit

    blit ~src ~src_pos ~dst ~dst_pos ~len copies len bytes from byte sequence src, starting at index src_pos, to byte sequence dst, starting at index dst_pos. It works correctly even if src and dst are the same byte sequence, and the source and destination intervals overlap.

    • raises Invalid_argument

      if src_pos and len do not designate a valid range of src, or if dst_pos and len do not designate a valid range of dst.

    val blit_string : + src:string -> + src_pos:int -> + dst:bytes -> + dst_pos:int -> + len:int -> + unit

    blit_string ~src ~src_pos ~dst ~dst_pos ~len copies len bytes from string src, starting at index src_pos, to byte sequence dst, starting at index dst_pos.

    • raises Invalid_argument

      if src_pos and len do not designate a valid range of src, or if dst_pos and len do not designate a valid range of dst.

    • since 4.05 in BytesLabels
    val concat : sep:bytes -> bytes list -> bytes

    concat ~sep sl concatenates the list of byte sequences sl, inserting the separator byte sequence sep between each, and returns the result as a new byte sequence.

    val cat : bytes -> bytes -> bytes

    cat s1 s2 concatenates s1 and s2 and returns the result as a new byte sequence.

    • since 4.05 in BytesLabels
    val iter : f:(char -> unit) -> bytes -> unit

    iter ~f s applies function f in turn to all the bytes of s. It is equivalent to f (get s 0); f (get s 1); ...; f (get s (length s - 1)); ().

    val iteri : f:(int -> char -> unit) -> bytes -> unit

    Same as iter, but the function is applied to the index of the byte as first argument and the byte itself as second argument.

    val map : f:(char -> char) -> bytes -> bytes

    map ~f s applies function f in turn to all the bytes of s (in increasing index order) and stores the resulting bytes in a new sequence that is returned as the result.

    val mapi : f:(int -> char -> char) -> bytes -> bytes

    mapi ~f s calls f with each character of s and its index (in increasing index order) and stores the resulting bytes in a new sequence that is returned as the result.

    val fold_left : f:('acc -> char -> 'acc) -> init:'acc -> bytes -> 'acc

    fold_left f x s computes f (... (f (f x (get s 0)) (get s 1)) ...) (get s (n-1)), where n is the length of s.

    • since 4.13
    val fold_right : f:(char -> 'acc -> 'acc) -> bytes -> init:'acc -> 'acc

    fold_right f s x computes f (get s 0) (f (get s 1) ( ... (f (get s (n-1)) x) ...)), where n is the length of s.

    • since 4.13
    val for_all : f:(char -> bool) -> bytes -> bool

    for_all p s checks if all characters in s satisfy the predicate p.

    • since 4.13
    val exists : f:(char -> bool) -> bytes -> bool

    exists p s checks if at least one character of s satisfies the predicate p.

    • since 4.13
    val trim : bytes -> bytes

    Return a copy of the argument, without leading and trailing whitespace. The bytes regarded as whitespace are the ASCII characters ' ', '\012', '\n', '\r', and '\t'.

    val escaped : bytes -> bytes

    Return a copy of the argument, with special characters represented by escape sequences, following the lexical conventions of OCaml. All characters outside the ASCII printable range (32..126) are escaped, as well as backslash and double-quote.

    val index : bytes -> char -> int

    index s c returns the index of the first occurrence of byte c in s.

    val index_opt : bytes -> char -> int option

    index_opt s c returns the index of the first occurrence of byte c in s or None if c does not occur in s.

    • since 4.05
    val rindex : bytes -> char -> int

    rindex s c returns the index of the last occurrence of byte c in s.

    val rindex_opt : bytes -> char -> int option

    rindex_opt s c returns the index of the last occurrence of byte c in s or None if c does not occur in s.

    • since 4.05
    val index_from : bytes -> int -> char -> int

    index_from s i c returns the index of the first occurrence of byte c in s after position i. index s c is equivalent to index_from s 0 c.

    • raises Not_found

      if c does not occur in s after position i.

    val index_from_opt : bytes -> int -> char -> int option

    index_from_opt s i c returns the index of the first occurrence of byte c in s after position i or None if c does not occur in s after position i. index_opt s c is equivalent to index_from_opt s 0 c.

    • since 4.05
    val rindex_from : bytes -> int -> char -> int

    rindex_from s i c returns the index of the last occurrence of byte c in s before position i+1. rindex s c is equivalent to rindex_from s (length s - 1) c.

    • raises Not_found

      if c does not occur in s before position i+1.

    val rindex_from_opt : bytes -> int -> char -> int option

    rindex_from_opt s i c returns the index of the last occurrence of byte c in s before position i+1 or None if c does not occur in s before position i+1. rindex_opt s c is equivalent to rindex_from s (length s - 1) c.

    • since 4.05
    val contains : bytes -> char -> bool

    contains s c tests if byte c appears in s.

    val contains_from : bytes -> int -> char -> bool

    contains_from s start c tests if byte c appears in s after position start. contains s c is equivalent to contains_from s 0 c.

    val rcontains_from : bytes -> int -> char -> bool

    rcontains_from s stop c tests if byte c appears in s before position stop+1.

    val uppercase_ascii : bytes -> bytes

    Return a copy of the argument, with all lowercase letters translated to uppercase, using the US-ASCII character set.

    • since 4.05
    val lowercase_ascii : bytes -> bytes

    Return a copy of the argument, with all uppercase letters translated to lowercase, using the US-ASCII character set.

    • since 4.05
    val capitalize_ascii : bytes -> bytes

    Return a copy of the argument, with the first character set to uppercase, using the US-ASCII character set.

    • since 4.05
    val uncapitalize_ascii : bytes -> bytes

    Return a copy of the argument, with the first character set to lowercase, using the US-ASCII character set.

    • since 4.05
    type t = bytes

    An alias for the type of byte sequences.

    val compare : t -> t -> int

    The comparison function for byte sequences, with the same specification as Stdlib.compare. Along with the type t, this function compare allows the module Bytes to be passed as argument to the functors Set.Make and Map.Make.

    val equal : t -> t -> bool

    The equality function for byte sequences.

    • since 4.05
    val starts_with : prefix:bytes -> bytes -> bool

    starts_with ~prefix s is true if and only if s starts with prefix.

    • since 4.13
    val ends_with : suffix:bytes -> bytes -> bool

    ends_with ~suffix s is true if and only if s ends with suffix.

    • since 4.13

    Unsafe conversions (for advanced users)

    This section describes unsafe, low-level conversion functions between bytes and string. They do not copy the internal data; used improperly, they can break the immutability invariant on strings provided by the -safe-string option. They are available for expert library authors, but for most purposes you should use the always-correct to_string and of_string instead.

    val unsafe_to_string : bytes -> string

    Unsafely convert a byte sequence into a string.

    To reason about the use of unsafe_to_string, it is convenient to consider an "ownership" discipline. A piece of code that manipulates some data "owns" it; there are several disjoint ownership modes, including:

    • Unique ownership: the data may be accessed and mutated
    • Shared ownership: the data has several owners, that may only access it, not mutate it.

    Unique ownership is linear: passing the data to another piece of code means giving up ownership (we cannot write the data again). A unique owner may decide to make the data shared (giving up mutation rights on it), but shared data may not become uniquely-owned again.

    unsafe_to_string s can only be used when the caller owns the byte sequence s -- either uniquely or as shared immutable data. The caller gives up ownership of s, and gains ownership of the returned string.

    There are two valid use-cases that respect this ownership discipline:

    1. Creating a string by initializing and mutating a byte sequence that is never changed after initialization is performed.

    let string_init len f : string =
+  let s = Bytes.create len in
+  for i = 0 to len - 1 do Bytes.set s i (f i) done;
+  Bytes.unsafe_to_string s

    This function is safe because the byte sequence s will never be accessed or mutated after unsafe_to_string is called. The string_init code gives up ownership of s, and returns the ownership of the resulting string to its caller.

    Note that it would be unsafe if s was passed as an additional parameter to the function f as it could escape this way and be mutated in the future -- string_init would give up ownership of s to pass it to f, and could not call unsafe_to_string safely.

    We have provided the String.init, String.map and String.mapi functions to cover most cases of building new strings. You should prefer those over to_string or unsafe_to_string whenever applicable.

    2. Temporarily giving ownership of a byte sequence to a function that expects a uniquely owned string and returns ownership back, so that we can mutate the sequence again after the call ended.

    let bytes_length (s : bytes) =
+  String.length (Bytes.unsafe_to_string s)

    In this use-case, we do not promise that s will never be mutated after the call to bytes_length s. The String.length function temporarily borrows unique ownership of the byte sequence (and sees it as a string), but returns this ownership back to the caller, which may assume that s is still a valid byte sequence after the call. Note that this is only correct because we know that String.length does not capture its argument -- it could escape by a side-channel such as a memoization combinator.

    The caller may not mutate s while the string is borrowed (it has temporarily given up ownership). This affects concurrent programs, but also higher-order functions: if String.length returned a closure to be called later, s should not be mutated until this closure is fully applied and returns ownership.

    val unsafe_of_string : string -> bytes

    Unsafely convert a shared string to a byte sequence that should not be mutated.

    The same ownership discipline that makes unsafe_to_string correct applies to unsafe_of_string: you may use it if you were the owner of the string value, and you will own the return bytes in the same mode.

    In practice, unique ownership of string values is extremely difficult to reason about correctly. You should always assume strings are shared, never uniquely owned.

    For example, string literals are implicitly shared by the compiler, so you never uniquely own them.

    let incorrect = Bytes.unsafe_of_string "hello"
+let s = Bytes.of_string "hello"

    The first declaration is incorrect, because the string literal "hello" could be shared by the compiler with other parts of the program, and mutating incorrect is a bug. You must always use the second version, which performs a copy and is thus correct.

    Assuming unique ownership of strings that are not string literals, but are (partly) built from string literals, is also incorrect. For example, mutating unsafe_of_string ("foo" ^ s) could mutate the shared string "foo" -- assuming a rope-like representation of strings. More generally, functions operating on strings will assume shared ownership, they do not preserve unique ownership. It is thus incorrect to assume unique ownership of the result of unsafe_of_string.

    The only case we have reasonable confidence is safe is if the produced bytes is shared -- used as an immutable byte sequence. This is possibly useful for incremental migration of low-level programs that manipulate immutable sequences of bytes (for example Marshal.from_bytes) and previously used the string type for this purpose.

    val split_on_char : sep:char -> bytes -> bytes list

    split_on_char sep s returns the list of all (possibly empty) subsequences of s that are delimited by the sep character. If s is empty, the result is the singleton list [empty].

    The function's output is specified by the following invariants:

    • The list is not empty.
    • Concatenating its elements using sep as a separator returns a byte sequence equal to the input (Bytes.concat (Bytes.make 1 sep) (Bytes.split_on_char sep s) = s).
    • No byte sequence in the result contains the sep character.
    • since 4.13

    Iterators

    val to_seq : t -> char Seq.t

    Iterate on the string, in increasing index order. Modifications of the string during iteration will be reflected in the sequence.

    • since 4.07
    val to_seqi : t -> (int * char) Seq.t

    Iterate on the string, in increasing order, yielding indices along chars

    • since 4.07
    val of_seq : char Seq.t -> t

    Create a string from the generator

    • since 4.07

    UTF codecs and validations

    • since 4.14

    UTF-8

    val get_utf_8_uchar : t -> int -> Uchar.utf_decode

    get_utf_8_uchar b i decodes an UTF-8 character at index i in b.

    val set_utf_8_uchar : t -> int -> Uchar.t -> int

    set_utf_8_uchar b i u UTF-8 encodes u at index i in b and returns the number of bytes n that were written starting at i. If n is 0 there was not enough space to encode u at i and b was left untouched. Otherwise a new character can be encoded at i + n.

    val is_valid_utf_8 : t -> bool

    is_valid_utf_8 b is true if and only if b contains valid UTF-8 data.

    UTF-16BE

    val get_utf_16be_uchar : t -> int -> Uchar.utf_decode

    get_utf_16be_uchar b i decodes an UTF-16BE character at index i in b.

    val set_utf_16be_uchar : t -> int -> Uchar.t -> int

    set_utf_16be_uchar b i u UTF-16BE encodes u at index i in b and returns the number of bytes n that were written starting at i. If n is 0 there was not enough space to encode u at i and b was left untouched. Otherwise a new character can be encoded at i + n.

    val is_valid_utf_16be : t -> bool

    is_valid_utf_16be b is true if and only if b contains valid UTF-16BE data.

    UTF-16LE

    val get_utf_16le_uchar : t -> int -> Uchar.utf_decode

    get_utf_16le_uchar b i decodes an UTF-16LE character at index i in b.

    val set_utf_16le_uchar : t -> int -> Uchar.t -> int

    set_utf_16le_uchar b i u UTF-16LE encodes u at index i in b and returns the number of bytes n that were written starting at i. If n is 0 there was not enough space to encode u at i and b was left untouched. Otherwise a new character can be encoded at i + n.

    val is_valid_utf_16le : t -> bool

    is_valid_utf_16le b is true if and only if b contains valid UTF-16LE data.

    Binary encoding/decoding of integers

    The functions in this section binary encode and decode integers to and from byte sequences.

    All following functions raise Invalid_argument if the space needed at index i to decode or encode the integer is not available.

    Little-endian (resp. big-endian) encoding means that least (resp. most) significant bytes are stored first. Big-endian is also known as network byte order. Native-endian encoding is either little-endian or big-endian depending on Sys.big_endian.

    32-bit and 64-bit integers are represented by the int32 and int64 types, which can be interpreted either as signed or unsigned numbers.

    8-bit and 16-bit integers are represented by the int type, which has more bits than the binary encoding. These extra bits are handled as follows:

    • Functions that decode signed (resp. unsigned) 8-bit or 16-bit integers represented by int values sign-extend (resp. zero-extend) their result.
    • Functions that encode 8-bit or 16-bit integers represented by int values truncate their input to their least significant bytes.
    val get_uint8 : bytes -> int -> int

    get_uint8 b i is b's unsigned 8-bit integer starting at byte index i.

    • since 4.08
    val get_int8 : bytes -> int -> int

    get_int8 b i is b's signed 8-bit integer starting at byte index i.

    • since 4.08
    val get_uint16_ne : bytes -> int -> int

    get_uint16_ne b i is b's native-endian unsigned 16-bit integer starting at byte index i.

    • since 4.08
    val get_uint16_be : bytes -> int -> int

    get_uint16_be b i is b's big-endian unsigned 16-bit integer starting at byte index i.

    • since 4.08
    val get_uint16_le : bytes -> int -> int

    get_uint16_le b i is b's little-endian unsigned 16-bit integer starting at byte index i.

    • since 4.08
    val get_int16_ne : bytes -> int -> int

    get_int16_ne b i is b's native-endian signed 16-bit integer starting at byte index i.

    • since 4.08
    val get_int16_be : bytes -> int -> int

    get_int16_be b i is b's big-endian signed 16-bit integer starting at byte index i.

    • since 4.08
    val get_int16_le : bytes -> int -> int

    get_int16_le b i is b's little-endian signed 16-bit integer starting at byte index i.

    • since 4.08
    val get_int32_ne : bytes -> int -> int32

    get_int32_ne b i is b's native-endian 32-bit integer starting at byte index i.

    • since 4.08
    val get_int32_be : bytes -> int -> int32

    get_int32_be b i is b's big-endian 32-bit integer starting at byte index i.

    • since 4.08
    val get_int32_le : bytes -> int -> int32

    get_int32_le b i is b's little-endian 32-bit integer starting at byte index i.

    • since 4.08
    val get_int64_ne : bytes -> int -> int64

    get_int64_ne b i is b's native-endian 64-bit integer starting at byte index i.

    • since 4.08
    val get_int64_be : bytes -> int -> int64

    get_int64_be b i is b's big-endian 64-bit integer starting at byte index i.

    • since 4.08
    val get_int64_le : bytes -> int -> int64

    get_int64_le b i is b's little-endian 64-bit integer starting at byte index i.

    • since 4.08
    val set_uint8 : bytes -> int -> int -> unit

    set_uint8 b i v sets b's unsigned 8-bit integer starting at byte index i to v.

    • since 4.08
    val set_int8 : bytes -> int -> int -> unit

    set_int8 b i v sets b's signed 8-bit integer starting at byte index i to v.

    • since 4.08
    val set_uint16_ne : bytes -> int -> int -> unit

    set_uint16_ne b i v sets b's native-endian unsigned 16-bit integer starting at byte index i to v.

    • since 4.08
    val set_uint16_be : bytes -> int -> int -> unit

    set_uint16_be b i v sets b's big-endian unsigned 16-bit integer starting at byte index i to v.

    • since 4.08
    val set_uint16_le : bytes -> int -> int -> unit

    set_uint16_le b i v sets b's little-endian unsigned 16-bit integer starting at byte index i to v.

    • since 4.08
    val set_int16_ne : bytes -> int -> int -> unit

    set_int16_ne b i v sets b's native-endian signed 16-bit integer starting at byte index i to v.

    • since 4.08
    val set_int16_be : bytes -> int -> int -> unit

    set_int16_be b i v sets b's big-endian signed 16-bit integer starting at byte index i to v.

    • since 4.08
    val set_int16_le : bytes -> int -> int -> unit

    set_int16_le b i v sets b's little-endian signed 16-bit integer starting at byte index i to v.

    • since 4.08
    val set_int32_ne : bytes -> int -> int32 -> unit

    set_int32_ne b i v sets b's native-endian 32-bit integer starting at byte index i to v.

    • since 4.08
    val set_int32_be : bytes -> int -> int32 -> unit

    set_int32_be b i v sets b's big-endian 32-bit integer starting at byte index i to v.

    • since 4.08
    val set_int32_le : bytes -> int -> int32 -> unit

    set_int32_le b i v sets b's little-endian 32-bit integer starting at byte index i to v.

    • since 4.08
    val set_int64_ne : bytes -> int -> int64 -> unit

    set_int64_ne b i v sets b's native-endian 64-bit integer starting at byte index i to v.

    • since 4.08
    val set_int64_be : bytes -> int -> int64 -> unit

    set_int64_be b i v sets b's big-endian 64-bit integer starting at byte index i to v.

    • since 4.08
    val set_int64_le : bytes -> int -> int64 -> unit

    set_int64_le b i v sets b's little-endian 64-bit integer starting at byte index i to v.

    • since 4.08

    Byte sequences and concurrency safety

    Care must be taken when concurrently accessing byte sequences from multiple domains: accessing a byte sequence will never crash a program, but unsynchronized accesses might yield surprising (non-sequentially-consistent) results.

    Atomicity

    Every byte sequence operation that accesses more than one byte is not atomic. This includes iteration and scanning.

    For example, consider the following program:

    let size = 100_000_000
+let b = Bytes.make size  ' '
+let update b f ()  =
+  Bytes.iteri (fun i x -> Bytes.set b i (Char.chr (f (Char.code x)))) b
+let d1 = Domain.spawn (update b (fun x -> x + 1))
+let d2 = Domain.spawn (update b (fun x -> 2 * x + 1))
+let () = Domain.join d1; Domain.join d2

    the bytes sequence b may contain a non-deterministic mixture of '!', 'A', 'B', and 'C' values.

    After executing this code, each byte of the sequence b is either '!', 'A', 'B', or 'C'. If atomicity is required, then the user must implement their own synchronization (for example, using Mutex.t).

    Data races

    If two domains only access disjoint parts of a byte sequence, then the observed behaviour is the equivalent to some sequential interleaving of the operations from the two domains.

    A data race is said to occur when two domains access the same byte without synchronization and at least one of the accesses is a write. In the absence of data races, the observed behaviour is equivalent to some sequential interleaving of the operations from different domains.

    Whenever possible, data races should be avoided by using synchronization to mediate the accesses to the elements of the sequence.

    Indeed, in the presence of data races, programs will not crash but the observed behaviour may not be equivalent to any sequential interleaving of operations from different domains. Nevertheless, even in the presence of data races, a read operation will return the value of some prior write to that location.

    Mixed-size accesses

    Another subtle point is that if a data race involves mixed-size writes and reads to the same location, the order in which those writes and reads are observed by domains is not specified. For instance, the following code write sequentially a 32-bit integer and a char to the same index

    let b = Bytes.make 10 '\000'
+let d1 = Domain.spawn (fun () -> Bytes.set_int32_ne b 0 100; b.[0] <- 'd' )

    In this situation, a domain that observes the write of 'd' to b.0 is not guaranteed to also observe the write to indices 1, 2, or 3.

    diff --git a/ocaml/Stdlib/Callback/index.html b/ocaml/Stdlib/Callback/index.html new file mode 100644 index 0000000..096b4db --- /dev/null +++ b/ocaml/Stdlib/Callback/index.html @@ -0,0 +1,2 @@ + +Callback (ocaml.Stdlib.Callback)

    Module Stdlib.Callback

    Registering OCaml values with the C runtime.

    This module allows OCaml values to be registered with the C runtime under a symbolic name, so that C code can later call back registered OCaml functions, or raise registered OCaml exceptions.

    val register : string -> 'a -> unit

    Callback.register n v registers the value v under the name n. C code can later retrieve a handle to v by calling caml_named_value(n).

    val register_exception : string -> exn -> unit

    Callback.register_exception n exn registers the exception contained in the exception value exn under the name n. C code can later retrieve a handle to the exception by calling caml_named_value(n). The exception value thus obtained is suitable for passing as first argument to raise_constant or raise_with_arg.

    diff --git a/ocaml/Stdlib/Char/index.html b/ocaml/Stdlib/Char/index.html new file mode 100644 index 0000000..dc55f25 --- /dev/null +++ b/ocaml/Stdlib/Char/index.html @@ -0,0 +1,2 @@ + +Char (ocaml.Stdlib.Char)

    Module Stdlib.Char

    Character operations.

    val code : char -> int

    Return the ASCII code of the argument.

    val chr : int -> char

    Return the character with the given ASCII code.

    val escaped : char -> string

    Return a string representing the given character, with special characters escaped following the lexical conventions of OCaml. All characters outside the ASCII printable range (32..126) are escaped, as well as backslash, double-quote, and single-quote.

    val lowercase_ascii : char -> char

    Convert the given character to its equivalent lowercase character, using the US-ASCII character set.

    • since 4.03
    val uppercase_ascii : char -> char

    Convert the given character to its equivalent uppercase character, using the US-ASCII character set.

    • since 4.03
    type t = char

    An alias for the type of characters.

    val compare : t -> t -> int

    The comparison function for characters, with the same specification as Stdlib.compare. Along with the type t, this function compare allows the module Char to be passed as argument to the functors Set.Make and Map.Make.

    val equal : t -> t -> bool

    The equal function for chars.

    • since 4.03
    val seeded_hash : int -> t -> int

    A seeded hash function for characters, with the same output value as Hashtbl.seeded_hash. This function allows this module to be passed as argument to the functor Hashtbl.MakeSeeded.

    • since 5.1
    val hash : t -> int

    An unseeded hash function for characters, with the same output value as Hashtbl.hash. This function allows this module to be passed as argument to the functor Hashtbl.Make.

    • since 5.1
    diff --git a/ocaml/Stdlib/Complex/index.html b/ocaml/Stdlib/Complex/index.html new file mode 100644 index 0000000..9af1dc0 --- /dev/null +++ b/ocaml/Stdlib/Complex/index.html @@ -0,0 +1,2 @@ + +Complex (ocaml.Stdlib.Complex)

    Module Stdlib.Complex

    Complex numbers.

    This module provides arithmetic operations on complex numbers. Complex numbers are represented by their real and imaginary parts (cartesian representation). Each part is represented by a double-precision floating-point number (type float).

    type t = {
    1. re : float;
    2. im : float;
    }

    The type of complex numbers. re is the real part and im the imaginary part.

    val zero : t

    The complex number 0.

    val one : t

    The complex number 1.

    val i : t

    The complex number i.

    val neg : t -> t

    Unary negation.

    val conj : t -> t

    Conjugate: given the complex x + i.y, returns x - i.y.

    val add : t -> t -> t

    Addition

    val sub : t -> t -> t

    Subtraction

    val mul : t -> t -> t

    Multiplication

    val inv : t -> t

    Multiplicative inverse (1/z).

    val div : t -> t -> t

    Division

    val sqrt : t -> t

    Square root. The result x + i.y is such that x > 0 or x = 0 and y >= 0. This function has a discontinuity along the negative real axis.

    val norm2 : t -> float

    Norm squared: given x + i.y, returns x^2 + y^2.

    val norm : t -> float

    Norm: given x + i.y, returns sqrt(x^2 + y^2).

    val arg : t -> float

    Argument. The argument of a complex number is the angle in the complex plane between the positive real axis and a line passing through zero and the number. This angle ranges from -pi to pi. This function has a discontinuity along the negative real axis.

    val polar : float -> float -> t

    polar norm arg returns the complex having norm norm and argument arg.

    val exp : t -> t

    Exponentiation. exp z returns e to the z power.

    val log : t -> t

    Natural logarithm (in base e).

    val pow : t -> t -> t

    Power function. pow z1 z2 returns z1 to the z2 power.

    diff --git a/ocaml/Stdlib/Condition/index.html b/ocaml/Stdlib/Condition/index.html new file mode 100644 index 0000000..058291d --- /dev/null +++ b/ocaml/Stdlib/Condition/index.html @@ -0,0 +1,31 @@ + +Condition (ocaml.Stdlib.Condition)

    Module Stdlib.Condition

    Condition variables.

    Condition variables are useful when several threads wish to access a shared data structure that is protected by a mutex (a mutual exclusion lock).

    A condition variable is a communication channel. On the receiver side, one or more threads can indicate that they wish to wait for a certain property to become true. On the sender side, a thread can signal that this property has become true, causing one (or more) waiting threads to be woken up.

    For instance, in the implementation of a queue data structure, if a thread that wishes to extract an element finds that the queue is currently empty, then this thread waits for the queue to become nonempty. A thread that inserts an element into the queue signals that the queue has become nonempty. A condition variable is used for this purpose. This communication channel conveys the information that the property "the queue is nonempty" is true, or more accurately, may be true. (We explain below why the receiver of a signal cannot be certain that the property holds.)

    To continue the example of the queue, assuming that the queue has a fixed maximum capacity, then a thread that wishes to insert an element may find that the queue is full. Then, this thread must wait for the queue to become not full, and a thread that extracts an element of the queue signals that the queue has become not full. Another condition variable is used for this purpose.

    In short, a condition variable c is used to convey the information that a certain property P about a shared data structure D, protected by a mutex m, may be true.

    Condition variables provide an efficient alternative to busy-waiting. When one wishes to wait for the property P to be true, instead of writing a busy-waiting loop:

      Mutex.lock m;
+  while not P do
+    Mutex.unlock m; Mutex.lock m
+  done;
+  <update the data structure>;
+  Mutex.unlock m

    one uses wait in the body of the loop, as follows:

      Mutex.lock m;
+  while not P do
+    Condition.wait c m
+  done;
+  <update the data structure>;
+  Mutex.unlock m

    The busy-waiting loop is inefficient because the waiting thread consumes processing time and creates contention of the mutex m. Calling wait allows the waiting thread to be suspended, so it does not consume any computing resources while waiting.

    With a condition variable c, exactly one mutex m is associated. This association is implicit: the mutex m is not explicitly passed as an argument to create. It is up to the programmer to know, for each condition variable c, which is the associated mutex m.

    With a mutex m, several condition variables can be associated. In the example of the bounded queue, one condition variable is used to indicate that the queue is nonempty, and another condition variable is used to indicate that the queue is not full.

    With a condition variable c, exactly one logical property P should be associated. Examples of such properties include "the queue is nonempty" and "the queue is not full". It is up to the programmer to keep track, for each condition variable, of the corresponding property P. A signal is sent on the condition variable c as an indication that the property P is true, or may be true. On the receiving end, however, a thread that is woken up cannot assume that P is true; after a call to wait terminates, one must explicitly test whether P is true. There are several reasons why this is so. One reason is that, between the moment when the signal is sent and the moment when a waiting thread receives the signal and is scheduled, the property P may be falsified by some other thread that is able to acquire the mutex m and alter the data structure D. Another reason is that spurious wakeups may occur: a waiting thread can be woken up even if no signal was sent.

    Here is a complete example, where a mutex protects a sequential unbounded queue, and where a condition variable is used to signal that the queue is nonempty.

      type 'a safe_queue =
+    { queue : 'a Queue.t; mutex : Mutex.t; nonempty : Condition.t }
+
+  let create () =
+    { queue = Queue.create(); mutex = Mutex.create();
+      nonempty = Condition.create() }
+
+  let add v q =
+    Mutex.lock q.mutex;
+    let was_empty = Queue.is_empty q.queue in
+    Queue.add v q.queue;
+    if was_empty then Condition.broadcast q.nonempty;
+    Mutex.unlock q.mutex
+
+  let take q =
+    Mutex.lock q.mutex;
+    while Queue.is_empty q.queue do Condition.wait q.nonempty q.mutex done;
+    let v = Queue.take q.queue in (* cannot fail since queue is nonempty *)
+    Mutex.unlock q.mutex;
+    v

    Because the call to broadcast takes place inside the critical section, the following property holds whenever the mutex is unlocked: if the queue is nonempty, then no thread is waiting, or, in other words, if some thread is waiting, then the queue must be empty. This is a desirable property: if a thread that attempts to execute a take operation could remain suspended even though the queue is nonempty, that would be a problematic situation, known as a deadlock.

    type t

    The type of condition variables.

    val create : unit -> t

    create() creates and returns a new condition variable. This condition variable should be associated (in the programmer's mind) with a certain mutex m and with a certain property P of the data structure that is protected by the mutex m.

    val wait : t -> Mutex.t -> unit

    The call wait c m is permitted only if m is the mutex associated with the condition variable c, and only if m is currently locked. This call atomically unlocks the mutex m and suspends the current thread on the condition variable c. This thread can later be woken up after the condition variable c has been signaled via signal or broadcast; however, it can also be woken up for no reason. The mutex m is locked again before wait returns. One cannot assume that the property P associated with the condition variable c holds when wait returns; one must explicitly test whether P holds after calling wait.

    val signal : t -> unit

    signal c wakes up one of the threads waiting on the condition variable c, if there is one. If there is none, this call has no effect.

    It is recommended to call signal c inside a critical section, that is, while the mutex m associated with c is locked.

    val broadcast : t -> unit

    broadcast c wakes up all threads waiting on the condition variable c. If there are none, this call has no effect.

    It is recommended to call broadcast c inside a critical section, that is, while the mutex m associated with c is locked.

    diff --git a/ocaml/Stdlib/Digest/BLAKE128/index.html b/ocaml/Stdlib/Digest/BLAKE128/index.html new file mode 100644 index 0000000..e9ea94b --- /dev/null +++ b/ocaml/Stdlib/Digest/BLAKE128/index.html @@ -0,0 +1,2 @@ + +BLAKE128 (ocaml.Stdlib.Digest.BLAKE128)

    Module Digest.BLAKE128

    BLAKE128 is the BLAKE2b hash function producing 128-bit (16-byte) digests. It is cryptographically secure. However, the small size of the digests enables brute-force attacks in 2{^64} attempts.

    • since 5.2
    type t = string

    The type of digests.

    val hash_length : int

    The length of digests, in bytes.

    val compare : t -> t -> int

    Compare two digests, with the same specification as Stdlib.compare.

    val equal : t -> t -> bool

    Test two digests for equality.

    val string : string -> t

    Return the digest of the given string.

    val bytes : bytes -> t

    Return the digest of the given byte sequence.

    val substring : string -> int -> int -> t

    substring s ofs len returns the digest of the substring of s starting at index ofs and containing len characters.

    val subbytes : bytes -> int -> int -> t

    subbytes s ofs len returns the digest of the subsequence of s starting at index ofs and containing len bytes.

    val channel : in_channel -> int -> t

    Read characters from the channel and return their digest. See Digest.channel for the full specification.

    val file : string -> t

    Return the digest of the file whose name is given.

    val output : out_channel -> t -> unit

    Write a digest on the given output channel.

    val input : in_channel -> t

    Read a digest from the given input channel.

    val to_hex : t -> string

    Return the printable hexadecimal representation of the given digest.

    val of_hex : string -> t

    Convert a hexadecimal representation back into the corresponding digest.

    • raises Invalid_argument

      if the length of the argument is not 2 * hash_length, or if the arguments contains non-hexadecimal characters.

    diff --git a/ocaml/Stdlib/Digest/BLAKE256/index.html b/ocaml/Stdlib/Digest/BLAKE256/index.html new file mode 100644 index 0000000..341cce8 --- /dev/null +++ b/ocaml/Stdlib/Digest/BLAKE256/index.html @@ -0,0 +1,2 @@ + +BLAKE256 (ocaml.Stdlib.Digest.BLAKE256)

    Module Digest.BLAKE256

    BLAKE256 is the BLAKE2b hash function producing 256-bit (32-byte) digests. It is cryptographically secure, and the digests are large enough to thwart brute-force attacks.

    • since 5.2
    type t = string

    The type of digests.

    val hash_length : int

    The length of digests, in bytes.

    val compare : t -> t -> int

    Compare two digests, with the same specification as Stdlib.compare.

    val equal : t -> t -> bool

    Test two digests for equality.

    val string : string -> t

    Return the digest of the given string.

    val bytes : bytes -> t

    Return the digest of the given byte sequence.

    val substring : string -> int -> int -> t

    substring s ofs len returns the digest of the substring of s starting at index ofs and containing len characters.

    val subbytes : bytes -> int -> int -> t

    subbytes s ofs len returns the digest of the subsequence of s starting at index ofs and containing len bytes.

    val channel : in_channel -> int -> t

    Read characters from the channel and return their digest. See Digest.channel for the full specification.

    val file : string -> t

    Return the digest of the file whose name is given.

    val output : out_channel -> t -> unit

    Write a digest on the given output channel.

    val input : in_channel -> t

    Read a digest from the given input channel.

    val to_hex : t -> string

    Return the printable hexadecimal representation of the given digest.

    val of_hex : string -> t

    Convert a hexadecimal representation back into the corresponding digest.

    • raises Invalid_argument

      if the length of the argument is not 2 * hash_length, or if the arguments contains non-hexadecimal characters.

    diff --git a/ocaml/Stdlib/Digest/BLAKE512/index.html b/ocaml/Stdlib/Digest/BLAKE512/index.html new file mode 100644 index 0000000..b1204a2 --- /dev/null +++ b/ocaml/Stdlib/Digest/BLAKE512/index.html @@ -0,0 +1,2 @@ + +BLAKE512 (ocaml.Stdlib.Digest.BLAKE512)

    Module Digest.BLAKE512

    BLAKE512 is the BLAKE2b hash function producing 512-bit (64-byte) digests. It is cryptographically secure, and the digests are large enough to thwart brute-force attacks.

    • since 5.2
    type t = string

    The type of digests.

    val hash_length : int

    The length of digests, in bytes.

    val compare : t -> t -> int

    Compare two digests, with the same specification as Stdlib.compare.

    val equal : t -> t -> bool

    Test two digests for equality.

    val string : string -> t

    Return the digest of the given string.

    val bytes : bytes -> t

    Return the digest of the given byte sequence.

    val substring : string -> int -> int -> t

    substring s ofs len returns the digest of the substring of s starting at index ofs and containing len characters.

    val subbytes : bytes -> int -> int -> t

    subbytes s ofs len returns the digest of the subsequence of s starting at index ofs and containing len bytes.

    val channel : in_channel -> int -> t

    Read characters from the channel and return their digest. See Digest.channel for the full specification.

    val file : string -> t

    Return the digest of the file whose name is given.

    val output : out_channel -> t -> unit

    Write a digest on the given output channel.

    val input : in_channel -> t

    Read a digest from the given input channel.

    val to_hex : t -> string

    Return the printable hexadecimal representation of the given digest.

    val of_hex : string -> t

    Convert a hexadecimal representation back into the corresponding digest.

    • raises Invalid_argument

      if the length of the argument is not 2 * hash_length, or if the arguments contains non-hexadecimal characters.

    diff --git a/ocaml/Stdlib/Digest/MD5/index.html b/ocaml/Stdlib/Digest/MD5/index.html new file mode 100644 index 0000000..511c7dc --- /dev/null +++ b/ocaml/Stdlib/Digest/MD5/index.html @@ -0,0 +1,2 @@ + +MD5 (ocaml.Stdlib.Digest.MD5)

    Module Digest.MD5

    MD5 is the MD5 hash function. It produces 128-bit (16-byte) digests and is not cryptographically secure at all. It should be used only for compatibility with earlier designs that mandate the use of MD5.

    • since 5.2
    type t = string

    The type of digests.

    val hash_length : int

    The length of digests, in bytes.

    val compare : t -> t -> int

    Compare two digests, with the same specification as Stdlib.compare.

    val equal : t -> t -> bool

    Test two digests for equality.

    val string : string -> t

    Return the digest of the given string.

    val bytes : bytes -> t

    Return the digest of the given byte sequence.

    val substring : string -> int -> int -> t

    substring s ofs len returns the digest of the substring of s starting at index ofs and containing len characters.

    val subbytes : bytes -> int -> int -> t

    subbytes s ofs len returns the digest of the subsequence of s starting at index ofs and containing len bytes.

    val channel : in_channel -> int -> t

    Read characters from the channel and return their digest. See Digest.channel for the full specification.

    val file : string -> t

    Return the digest of the file whose name is given.

    val output : out_channel -> t -> unit

    Write a digest on the given output channel.

    val input : in_channel -> t

    Read a digest from the given input channel.

    val to_hex : t -> string

    Return the printable hexadecimal representation of the given digest.

    val of_hex : string -> t

    Convert a hexadecimal representation back into the corresponding digest.

    • raises Invalid_argument

      if the length of the argument is not 2 * hash_length, or if the arguments contains non-hexadecimal characters.

    diff --git a/ocaml/Stdlib/Digest/index.html b/ocaml/Stdlib/Digest/index.html new file mode 100644 index 0000000..6282671 --- /dev/null +++ b/ocaml/Stdlib/Digest/index.html @@ -0,0 +1,2 @@ + +Digest (ocaml.Stdlib.Digest)

    Module Stdlib.Digest

    Message digest.

    This module provides functions to compute 'digests', also known as 'hashes', of arbitrary-length strings or files. The supported hashing algorithms are BLAKE2 and MD5.

    Basic functions

    The functions in this section use the MD5 hash function to produce 128-bit digests (16 bytes). MD5 is not cryptographically secure. Hence, these functions should not be used for security-sensitive applications. The BLAKE2 functions below are cryptographically secure.

    type t = string

    The type of digests: 16-byte strings.

    val compare : t -> t -> int

    The comparison function for 16-byte digests, with the same specification as Stdlib.compare and the implementation shared with String.compare. Along with the type t, this function compare allows the module Digest to be passed as argument to the functors Set.Make and Map.Make.

    • since 4.00
    val equal : t -> t -> bool

    The equal function for 16-byte digests.

    • since 4.03
    val string : string -> t

    Return the digest of the given string.

    val bytes : bytes -> t

    Return the digest of the given byte sequence.

    • since 4.02
    val substring : string -> int -> int -> t

    Digest.substring s ofs len returns the digest of the substring of s starting at index ofs and containing len characters.

    val subbytes : bytes -> int -> int -> t

    Digest.subbytes s ofs len returns the digest of the subsequence of s starting at index ofs and containing len bytes.

    • since 4.02
    val channel : in_channel -> int -> t

    If len is nonnegative, Digest.channel ic len reads len characters from channel ic and returns their digest, or raises End_of_file if end-of-file is reached before len characters are read. If len is negative, Digest.channel ic len reads all characters from ic until end-of-file is reached and return their digest.

    val file : string -> t

    Return the digest of the file whose name is given.

    val output : out_channel -> t -> unit

    Write a digest on the given output channel.

    val input : in_channel -> t

    Read a digest from the given input channel.

    val to_hex : t -> string

    Return the printable hexadecimal representation of the given digest.

    val of_hex : string -> t

    Convert a hexadecimal representation back into the corresponding digest.

    • raises Invalid_argument

      if the argument is not exactly 32 hexadecimal characters.

    • since 5.2
    val from_hex : string -> t

    Same function as Digest.of_hex.

    • since 4.00

    Generic interface

    module type S = sig ... end

    The signature for a hash function that produces digests of length hash_length from character strings, byte arrays, and files.

    Specific hash functions

    module BLAKE128 : S

    BLAKE128 is the BLAKE2b hash function producing 128-bit (16-byte) digests. It is cryptographically secure. However, the small size of the digests enables brute-force attacks in 2{^64} attempts.

    module BLAKE256 : S

    BLAKE256 is the BLAKE2b hash function producing 256-bit (32-byte) digests. It is cryptographically secure, and the digests are large enough to thwart brute-force attacks.

    module BLAKE512 : S

    BLAKE512 is the BLAKE2b hash function producing 512-bit (64-byte) digests. It is cryptographically secure, and the digests are large enough to thwart brute-force attacks.

    module MD5 : S

    MD5 is the MD5 hash function. It produces 128-bit (16-byte) digests and is not cryptographically secure at all. It should be used only for compatibility with earlier designs that mandate the use of MD5.

    diff --git a/ocaml/Stdlib/Digest/module-type-S/index.html b/ocaml/Stdlib/Digest/module-type-S/index.html new file mode 100644 index 0000000..9b89efa --- /dev/null +++ b/ocaml/Stdlib/Digest/module-type-S/index.html @@ -0,0 +1,2 @@ + +S (ocaml.Stdlib.Digest.S)

    Module type Digest.S

    The signature for a hash function that produces digests of length hash_length from character strings, byte arrays, and files.

    • since 5.2
    type t = string

    The type of digests.

    val hash_length : int

    The length of digests, in bytes.

    val compare : t -> t -> int

    Compare two digests, with the same specification as Stdlib.compare.

    val equal : t -> t -> bool

    Test two digests for equality.

    val string : string -> t

    Return the digest of the given string.

    val bytes : bytes -> t

    Return the digest of the given byte sequence.

    val substring : string -> int -> int -> t

    substring s ofs len returns the digest of the substring of s starting at index ofs and containing len characters.

    val subbytes : bytes -> int -> int -> t

    subbytes s ofs len returns the digest of the subsequence of s starting at index ofs and containing len bytes.

    val channel : in_channel -> int -> t

    Read characters from the channel and return their digest. See Digest.channel for the full specification.

    val file : string -> t

    Return the digest of the file whose name is given.

    val output : out_channel -> t -> unit

    Write a digest on the given output channel.

    val input : in_channel -> t

    Read a digest from the given input channel.

    val to_hex : t -> string

    Return the printable hexadecimal representation of the given digest.

    val of_hex : string -> t

    Convert a hexadecimal representation back into the corresponding digest.

    • raises Invalid_argument

      if the length of the argument is not 2 * hash_length, or if the arguments contains non-hexadecimal characters.

    diff --git a/ocaml/Stdlib/Domain/DLS/index.html b/ocaml/Stdlib/Domain/DLS/index.html new file mode 100644 index 0000000..413e37b --- /dev/null +++ b/ocaml/Stdlib/Domain/DLS/index.html @@ -0,0 +1,12 @@ + +DLS (ocaml.Stdlib.Domain.DLS)

    Module Domain.DLS

    Domain-local Storage

    type 'a key

    Type of a DLS key

    val new_key : ?split_from_parent:('a -> 'a) -> (unit -> 'a) -> 'a key

    new_key f returns a new key bound to initialiser f for accessing , domain-local variables.

    If split_from_parent is not provided, the value for a new domain will be computed on-demand by the new domain: the first get call will call the initializer f and store that value.

    Warning. f may be called several times if another call to get occurs during initialization on the same domain. Only the 'first' value computed will be used, the other now-useless values will be discarded. Your initialization function should support this situation, or contain logic to detect this case and fail.

    If split_from_parent is provided, spawning a domain will derive the child value (for this key) from the parent value. This computation happens in the parent domain and it always happens, regardless of whether the child domain will use it. If the splitting function is expensive or requires child-side computation, consider using 'a Lazy.t key:

    let init () = ...
+
+let split_from_parent parent_value =
+  ... parent-side computation ...;
+  lazy (
+    ... child-side computation ...
+  )
+
+let key = Domain.DLS.new_key ~split_from_parent init
+
+let get () = Lazy.force (Domain.DLS.get key)

    In this case a part of the computation happens on the child domain; in particular, it can access parent_value concurrently with the parent domain, which may require explicit synchronization to avoid data races.

    val get : 'a key -> 'a

    get k returns v if a value v is associated to the key k on the calling domain's domain-local state. Sets k's value with its initialiser and returns it otherwise.

    val set : 'a key -> 'a -> unit

    set k v updates the calling domain's domain-local state to associate the key k with value v. It overwrites any previous values associated to k, which cannot be restored later.

    diff --git a/ocaml/Stdlib/Domain/index.html b/ocaml/Stdlib/Domain/index.html new file mode 100644 index 0000000..77a97e1 --- /dev/null +++ b/ocaml/Stdlib/Domain/index.html @@ -0,0 +1,5 @@ + +Domain (ocaml.Stdlib.Domain)

    Module Stdlib.Domain

    • alert unstable The Domain interface may change in incompatible ways in the future.

    Domains.

    See 'Parallel programming' chapter in the manual.

    • since 5.0
    • alert unstable The Domain interface may change in incompatible ways in the future.
    type !'a t

    A domain of type 'a t runs independently, eventually producing a result of type 'a, or an exception

    val spawn : (unit -> 'a) -> 'a t

    spawn f creates a new domain that runs in parallel with the current domain.

    • raises Failure

      if the program has insufficient resources to create another domain.

    val join : 'a t -> 'a

    join d blocks until domain d runs to completion. If d results in a value, then that is returned by join d. If d raises an uncaught exception, then that is re-raised by join d.

    type id = private int

    Domains have unique integer identifiers

    val get_id : 'a t -> id

    get_id d returns the identifier of the domain d

    val self : unit -> id

    self () is the identifier of the currently running domain

    val before_first_spawn : (unit -> unit) -> unit

    before_first_spawn f registers f to be called before the first domain is spawned by the program. The functions registered with before_first_spawn are called on the main (initial) domain. The functions registered with before_first_spawn are called in 'first in, first out' order: the oldest function added with before_first_spawn is called first.

    val at_exit : (unit -> unit) -> unit

    at_exit f registers f to be called when the current domain exits. Note that at_exit callbacks are domain-local and only apply to the calling domain. The registered functions are called in 'last in, first out' order: the function most recently added with at_exit is called first. An example:

    let temp_file_key = Domain.DLS.new_key (fun _ ->
+  let tmp = snd (Filename.open_temp_file "" "") in
+  Domain.at_exit (fun () -> close_out_noerr tmp);
+  tmp)

    The snippet above creates a key that when retrieved for the first time will open a temporary file and register an at_exit callback to close it, thus guaranteeing the descriptor is not leaked in case the current domain exits.

    val cpu_relax : unit -> unit

    If busy-waiting, calling cpu_relax () between iterations will improve performance on some CPU architectures

    val is_main_domain : unit -> bool

    is_main_domain () returns true if called from the initial domain.

    The recommended maximum number of domains which should be running simultaneously (including domains already running).

    The value returned is at least 1.

    module DLS : sig ... end

    Domain-local Storage

    diff --git a/ocaml/Stdlib/Dynarray/index.html b/ocaml/Stdlib/Dynarray/index.html new file mode 100644 index 0000000..256fc5f --- /dev/null +++ b/ocaml/Stdlib/Dynarray/index.html @@ -0,0 +1,102 @@ + +Dynarray (ocaml.Stdlib.Dynarray)

    Module Stdlib.Dynarray

    Dynamic arrays.

    The Array module provide arrays of fixed length. Dynarray provides arrays whose length can change over time, by adding or removing elements at the end of the array.

    This is typically used to accumulate elements whose number is not known in advance or changes during computation, while also providing fast access to elements at arbitrary positions.

        let dynarray_of_list li =
+      let arr = Dynarray.create () in
+      List.iter (fun v -> Dynarray.add_last arr v) li;
+      arr

    The Buffer module provides similar features, but it is specialized for accumulating characters into a dynamically-resized string.

    The Stack module provides a last-in first-out data structure that can be easily implemented on top of dynamic arrays.

    Warning. In their current implementation, the memory layout of dynamic arrays differs from the one of Arrays. See the Memory Layout section for more information.

    • since 5.2

    Unsynchronized accesses

    Concurrent accesses to dynamic arrays must be synchronized (for instance with a Mutex.t). Unsynchronized accesses to a dynamic array are a programming error that may lead to an invalid dynamic array state, on which some operations would fail with an Invalid_argument exception.

    Dynamic arrays

    type !'a t

    A dynamic array containing values of type 'a.

    A dynamic array a provides constant-time get and set operations on indices between 0 and Dynarray.length a - 1 included. Its length may change over time by adding or removing elements to the end of the array.

    We say that an index into a dynarray a is valid if it is in 0 .. length a - 1 and invalid otherwise.

    val create : unit -> 'a t

    create () is a new, empty array.

    val make : int -> 'a -> 'a t

    make n x is a new array of length n, filled with x.

    val init : int -> (int -> 'a) -> 'a t

    init n f is a new array a of length n, such that get a i is f i. In other words, the elements of a are f 0, then f 1, then f 2... and f (n - 1) last, evaluated in that order.

    This is similar to Array.init.

    val get : 'a t -> int -> 'a

    get a i is the i-th element of a, starting with index 0.

    val set : 'a t -> int -> 'a -> unit

    set a i x sets the i-th element of a to be x.

    i must be a valid index. set does not add new elements to the array -- see add_last to add an element.

    val length : 'a t -> int

    length a is the number of elements in the array.

    val is_empty : 'a t -> bool

    is_empty a is true if a is empty, that is, if length a = 0.

    val get_last : 'a t -> 'a

    get_last a is the element of a at index length a - 1.

    val find_last : 'a t -> 'a option

    find_last a is None if a is empty and Some (get_last a) otherwise.

    val copy : 'a t -> 'a t

    copy a is a shallow copy of a, a new array containing the same elements as a.

    Adding elements

    Note: all operations adding elements raise Invalid_argument if the length needs to grow beyond Sys.max_array_length.

    val add_last : 'a t -> 'a -> unit

    add_last a x adds the element x at the end of the array a.

    val append_array : 'a t -> 'a array -> unit

    append_array a b adds all elements of b at the end of a, in the order they appear in b.

    For example:

      let a = Dynarray.of_list [1;2] in
+  Dynarray.append_array a [|3; 4|];
+  assert (Dynarray.to_list a = [1; 2; 3; 4])
    val append_list : 'a t -> 'a list -> unit

    Like append_array but with a list.

    val append : 'a t -> 'a t -> unit

    append a b is like append_array a b, but b is itself a dynamic array instead of a fixed-size array.

    Warning: append a a is a programming error because it iterates on a and adds elements to it at the same time -- see the Iteration section below. It fails with Invalid_argument. If you really want to append a copy of a to itself, you can use Dynarray.append_array a (Dynarray.to_array a) which copies a into a temporary array.

    val append_seq : 'a t -> 'a Seq.t -> unit

    Like append_array but with a sequence.

    Warning: append_seq a (to_seq_reentrant a) simultaneously traverses a and adds element to it; the ordering of those operations is unspecified, and may result in an infinite loop -- the new elements may in turn be produced by to_seq_reentrant a and get added again and again.

    val append_iter : 'a t -> (('a -> unit) -> 'x -> unit) -> 'x -> unit

    append_iter a iter x adds each element of x to the end of a. This is iter (add_last a) x.

    For example, append_iter a List.iter [1;2;3] would add elements 1, 2, and then 3 at the end of a. append_iter a Queue.iter q adds elements from the queue q.

    Removing elements

    val pop_last_opt : 'a t -> 'a option

    pop_last_opt a removes and returns the last element of a, or None if the array is empty.

    val pop_last : 'a t -> 'a

    pop_last a removes and returns the last element of a.

    val remove_last : 'a t -> unit

    remove_last a removes the last element of a, if any. It does nothing if a is empty.

    val truncate : 'a t -> int -> unit

    truncate a n truncates a to have at most n elements.

    It removes elements whose index is greater or equal to n. It does nothing if n >= length a.

    truncate a n is equivalent to:

      if n < 0 then invalid_argument "...";
+  while length a > n do
+    remove_last a
+  done
    val clear : 'a t -> unit

    clear a is truncate a 0, it removes all the elements of a.

    Iteration

    The iteration functions traverse the elements of a dynamic array. Traversals of a are computed in increasing index order: from the element of index 0 to the element of index length a - 1.

    It is a programming error to change the length of an array (by adding or removing elements) during an iteration on the array. Any iteration function will fail with Invalid_argument if it detects such a length change.

    val iter : ('a -> unit) -> 'a t -> unit

    iter f a calls f on each element of a.

    val iteri : (int -> 'a -> unit) -> 'a t -> unit

    iteri f a calls f i x for each x at index i in a.

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f a is a new array of elements of the form f x for each element x of a.

    For example, if the elements of a are x0, x1, x2, then the elements of b are f x0, f x1, f x2.

    val mapi : (int -> 'a -> 'b) -> 'a t -> 'b t

    mapi f a is a new array of elements of the form f i x for each element x of a at index i.

    For example, if the elements of a are x0, x1, x2, then the elements of b are f 0 x0, f 1 x1, f 2 x2.

    val fold_left : ('acc -> 'a -> 'acc) -> 'acc -> 'a t -> 'acc

    fold_left f acc a folds f over a in order, starting with accumulator acc.

    For example, if the elements of a are x0, x1, then fold f acc a is

      let acc = f acc x0 in
+  let acc = f acc x1 in
+  acc
    val fold_right : ('a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

    fold_right f a acc computes f x0 (f x1 (... (f xn acc) ...)) where x0, x1, ..., xn are the elements of a.

    val exists : ('a -> bool) -> 'a t -> bool

    exists f a is true if some element of a satisfies f.

    For example, if the elements of a are x0, x1, x2, then exists f a is f x0 || f x1 || f x2.

    val for_all : ('a -> bool) -> 'a t -> bool

    for_all f a is true if all elements of a satisfy f. This includes the case where a is empty.

    For example, if the elements of a are x0, x1, then exists f a is f x0 && f x1 && f x2.

    val filter : ('a -> bool) -> 'a t -> 'a t

    filter f a is a new array of all the elements of a that satisfy f. In other words, it is an array b such that, for each element x in a in order, x is added to b if f x is true.

    For example, filter (fun x -> x >= 0) a is a new array of all non-negative elements of a, in order.

    val filter_map : ('a -> 'b option) -> 'a t -> 'b t

    filter_map f a is a new array of elements y such that f x is Some y for an element x of a. In others words, it is an array b such that, for each element x of a in order:

    • if f x = Some y, then y is added to b,
    • if f x = None, then no element is added to b.

    For example, filter_map int_of_string_opt inputs returns a new array of integers read from the strings in inputs, ignoring strings that cannot be converted to integers.

    Conversions to other data structures

    Note: the of_* functions raise Invalid_argument if the length needs to grow beyond Sys.max_array_length.

    The to_* functions, except those specifically marked "reentrant", iterate on their dynarray argument. In particular it is a programming error if the length of the dynarray changes during their execution, and the conversion functions raise Invalid_argument if they observe such a change.

    val of_array : 'a array -> 'a t

    of_array arr returns a dynamic array corresponding to the fixed-sized array a. Operates in O(n) time by making a copy.

    val to_array : 'a t -> 'a array

    to_array a returns a fixed-sized array corresponding to the dynamic array a. This always allocate a new array and copies elements into it.

    val of_list : 'a list -> 'a t

    of_list l is the array containing the elements of l in the same order.

    val to_list : 'a t -> 'a list

    to_list a is a list with the elements contained in the array a.

    val of_seq : 'a Seq.t -> 'a t

    of_seq seq is an array containing the same elements as seq.

    It traverses seq once and will terminate only if seq is finite.

    val to_seq : 'a t -> 'a Seq.t

    to_seq a is the sequence of elements get a 0, get a 1... get a (length a - 1).

    val to_seq_reentrant : 'a t -> 'a Seq.t

    to_seq_reentrant a is a reentrant variant of to_seq, in the sense that one may still access its elements after the length of a has changed.

    Demanding the i-th element of the resulting sequence (which can happen zero, one or several times) will access the i-th element of a at the time of the demand. The sequence stops if a has less than i elements at this point.

    val to_seq_rev : 'a t -> 'a Seq.t

    to_seq_rev a is the sequence of elements get a (l - 1), get a (l - 2)... get a 0, where l is length a at the time to_seq_rev is invoked.

    val to_seq_rev_reentrant : 'a t -> 'a Seq.t

    to_seq_rev_reentrant a is a reentrant variant of to_seq_rev, in the sense that one may still access its elements after the length of a has changed.

    Elements that have been removed from the array by the time they are demanded in the sequence are skipped.

    Advanced topics for performance

    Backing array, capacity

    Internally, a dynamic array uses a backing array (a fixed-size array as provided by the Array module) whose length is greater or equal to the length of the dynamic array. We define the capacity of a dynamic array as the length of its backing array.

    The capacity of a dynamic array is relevant in advanced scenarios, when reasoning about the performance of dynamic array programs:

    • The memory usage of a dynamic array is proportional to its capacity, rather than its length.
    • When there is no empty space left at the end of the backing array, adding elements requires allocating a new, larger backing array.

    The implementation uses a standard exponential reallocation strategy which guarantees amortized constant-time operation; in particular, the total capacity of all backing arrays allocated over the lifetime of a dynamic array is at worst proportional to the total number of elements added.

    In other words, users need not care about capacity and reallocations, and they will get reasonable behavior by default. However, in some performance-sensitive scenarios the functions below can help control memory usage or guarantee an optimal number of reallocations.

    val capacity : 'a t -> int

    capacity a is the length of a's backing array.

    val ensure_capacity : 'a t -> int -> unit

    ensure_capacity a n makes sure that the capacity of a is at least n.

    • raises Invalid_argument

      if the requested capacity is outside the range 0 .. Sys.max_array_length.

    An example would be to reimplement of_array without using init:

    let of_array arr =
+  let a = Dynarray.create () in
+  Dynarray.ensure_capacity a (Array.length arr);
+  Array.iter (fun v -> add_last a v) arr

    Using ensure_capacity guarantees that at most one reallocation will take place, instead of possibly several.

    Without this ensure_capacity hint, the number of resizes would be logarithmic in the length of arr, creating a constant-factor slowdown noticeable when arr is large.

    val ensure_extra_capacity : 'a t -> int -> unit

    ensure_extra_capacity a n is ensure_capacity a (length a + n), it makes sure that a has room for n extra items.

    • raises Invalid_argument

      if the total requested capacity is outside the range 0 .. Sys.max_array_length.

    A use case would be to implement append_array:

    let append_array a arr =
+  ensure_extra_capacity a (Array.length arr);
+  Array.iter (fun v -> add_last a v) arr
    val fit_capacity : 'a t -> unit

    fit_capacity a reallocates a backing array if necessary, so that the resulting capacity is exactly length a, with no additional empty space at the end. This can be useful to make sure there is no memory wasted on a long-lived array.

    Note that calling fit_capacity breaks the amortized complexity guarantees provided by the default reallocation strategy. Calling it repeatedly on an array may have quadratic complexity, both in time and in total number of words allocated.

    If you know that a dynamic array has reached its final length, which will remain fixed in the future, it is sufficient to call to_array and only keep the resulting fixed-size array. fit_capacity is useful when you need to keep a dynamic array for eventual future resizes.

    val set_capacity : 'a t -> int -> unit

    set_capacity a n reallocates a backing array if necessary, so that the resulting capacity is exactly n. In particular, all elements of index n or greater are removed.

    Like fit_capacity, this function breaks the amortized complexity guarantees provided by the reallocation strategy. Calling it repeatedly on an array may have quadratic complexity, both in time and in total number of words allocated.

    This is an advanced function; in particular, ensure_capacity should be preferred to increase the capacity, as it preserves those amortized guarantees.

    val reset : 'a t -> unit

    reset a clears a and replaces its backing array by an empty array.

    It is equivalent to set_capacity a 0 or clear a; fit_capacity a.

    No leaks: preservation of memory liveness

    The user-provided values reachable from a dynamic array a are exactly the elements in the positions 0 to length a - 1. In particular, no user-provided values are "leaked" by being present in the backing array in position length a or later.

    Memory layout of dynarrays

    In the current implementation, the backing array of an 'a Dynarray.t is not an 'a array, but something with the same representation as an 'a option array or 'a ref array. Each element is in a "box", allocated when the element is first added to the array -- see the implementation for more details.

    Using an 'a array would be delicate, as there is no obvious type-correct way to represent the empty space at the end of the backing array -- using user-provided values would either complicate the API or violate the no leaks guarantee. The constraint of remaining memory-safe under unsynchronized concurrent usage makes it even more difficult. Various unsafe ways to do this have been discussed, with no consensus on a standard implementation so far.

    On a realistic automated-theorem-proving program that relies heavily on dynamic arrays, we measured the overhead of this extra "boxing" as at most 25%. We believe that the overhead for most uses of dynarray is much smaller, negligible in many cases, but you may still prefer to use your own specialized implementation for performance. (If you know that you do not need the no leaks guarantee, you can also speed up deleting elements.)

    Code examples

    Min-heaps for mutable priority queues

    We can use dynamic arrays to implement a mutable priority queue. A priority queue provides a function to add elements, and a function to extract the minimum element -- according to some comparison function.

    (* We present our priority queues as a functor
+   parametrized on the comparison function. *)
+module Heap (Elem : Map.OrderedType) : sig
+  type t
+  val create : unit -> t
+  val add : t -> Elem.t -> unit
+  val pop_min : t -> Elem.t option
+end = struct
+
+  (* Our priority queues are implemented using the standard "min heap"
+     data structure, a dynamic array representing a binary tree. *)
+  type t = Elem.t Dynarray.t
+  let create = Dynarray.create
+
+ (* The node of index [i] has as children the nodes of index [2 * i + 1]
+    and [2 * i + 2] -- if they are valid indices in the dynarray. *)
+  let left_child i = 2 * i + 1
+  let right_child i = 2 * i + 2
+  let parent_node i = (i - 1) / 2
+
+  (* We use indexing operators for convenient notations. *)
+  let ( .!() ) = Dynarray.get
+  let ( .!()<- ) = Dynarray.set
+
+  (* Auxiliary functions to compare and swap two elements
+     in the dynamic array. *)
+  let order h i j =
+    Elem.compare h.!(i) h.!(j)
+
+  let swap h i j =
+    let v = h.!(i) in
+    h.!(i) <- h.!(j);
+    h.!(j) <- v
+
+  (* We say that a heap respects the "heap ordering" if the value of
+     each node is smaller than the value of its children. The
+     algorithm manipulates arrays that respect the heap algorithm,
+     except for one node whose value may be too small or too large.
+
+     The auxiliary functions [heap_up] and [heap_down] take
+     such a misplaced value, and move it "up" (respectively: "down")
+     the tree by permuting it with its parent value (respectively:
+     a child value) until the heap ordering is restored. *)
+
+  let rec heap_up h i =
+    if i = 0 then () else
+    let parent = parent_node i in
+    if order h i parent < 0 then
+      (swap h i parent; heap_up h parent)
+
+  and heap_down h ~len i =
+    let left, right = left_child i, right_child i in
+    if left >= len then () (* no child, stop *) else
+    let smallest =
+      if right >= len then left (* no right child *) else
+      if order h left right < 0 then left else right
+    in
+    if order h i smallest > 0 then
+      (swap h i smallest; heap_down h ~len smallest)
+
+  let add h s =
+    let i = Dynarray.length h in
+    Dynarray.add_last h s;
+    heap_up h i
+
+  let pop_min h =
+    if Dynarray.is_empty h then None
+    else begin
+      (* Standard trick: swap the 'best' value at index 0
+         with the last value of the array. *)
+      let last = Dynarray.length h - 1 in
+      swap h 0 last;
+      (* At this point [pop_last] returns the 'best' value,
+         and leaves a heap with one misplaced element at position 0. *)
+      let best = Dynarray.pop_last h in
+      (* Restore the heap ordering -- does nothing if the heap is empty. *)
+      heap_down h ~len:last 0;
+      Some best
+    end
+end

    The production code from which this example was inspired includes logic to free the backing array when the heap becomes empty, only in the case where the capacity is above a certain threshold. This can be done by calling the following function from pop:

    let shrink h =
+  if Dynarray.length h = 0 && Dynarray.capacity h > 1 lsl 18 then
+    Dynarray.reset h

    The Heap functor can be used to implement a sorting function, by adding all elements into a priority queue and then extracting them in order.

    let heap_sort (type a) cmp li =
+  let module Heap = Heap(struct type t = a let compare = cmp end) in
+  let heap = Heap.create () in
+  List.iter (Heap.add heap) li;
+  List.map (fun _ -> Heap.pop_min heap |> Option.get) li
    diff --git a/ocaml/Stdlib/Effect/Deep/index.html b/ocaml/Stdlib/Effect/Deep/index.html new file mode 100644 index 0000000..fd1c9c5 --- /dev/null +++ b/ocaml/Stdlib/Effect/Deep/index.html @@ -0,0 +1,6 @@ + +Deep (ocaml.Stdlib.Effect.Deep)

    Module Effect.Deep

    Deep handlers

    type ('a, 'b) continuation

    ('a,'b) continuation is a delimited continuation that expects a 'a value and returns a 'b value.

    val continue : ('a, 'b) continuation -> 'a -> 'b

    continue k x resumes the continuation k by passing x to k.

    val discontinue : ('a, 'b) continuation -> exn -> 'b

    discontinue k e resumes the continuation k by raising the exception e in k.

    val discontinue_with_backtrace : + ('a, 'b) continuation -> + exn -> + Printexc.raw_backtrace -> + 'b

    discontinue_with_backtrace k e bt resumes the continuation k by raising the exception e in k using bt as the origin for the exception.

    type ('a, 'b) handler = {
    1. retc : 'a -> 'b;
    2. exnc : exn -> 'b;
    3. effc : 'c. 'c t -> (('c, 'b) continuation -> 'b) option;
    }

    ('a,'b) handler is a handler record with three fields -- retc is the value handler, exnc handles exceptions, and effc handles the effects performed by the computation enclosed by the handler.

    val match_with : ('c -> 'a) -> 'c -> ('a, 'b) handler -> 'b

    match_with f v h runs the computation f v in the handler h.

    type 'a effect_handler = {
    1. effc : 'b. 'b t -> (('b, 'a) continuation -> 'a) option;
    }

    'a effect_handler is a deep handler with an identity value handler fun x -> x and an exception handler that raises any exception fun e -> raise e.

    val try_with : ('b -> 'a) -> 'b -> 'a effect_handler -> 'a

    try_with f v h runs the computation f v under the handler h.

    val get_callstack : ('a, 'b) continuation -> int -> Printexc.raw_backtrace

    get_callstack c n returns a description of the top of the call stack on the continuation c, with at most n entries.

    diff --git a/ocaml/Stdlib/Effect/Shallow/index.html b/ocaml/Stdlib/Effect/Shallow/index.html new file mode 100644 index 0000000..eecf2dc --- /dev/null +++ b/ocaml/Stdlib/Effect/Shallow/index.html @@ -0,0 +1,7 @@ + +Shallow (ocaml.Stdlib.Effect.Shallow)

    Module Effect.Shallow

    type ('a, 'b) continuation

    ('a,'b) continuation is a delimited continuation that expects a 'a value and returns a 'b value.

    val fiber : ('a -> 'b) -> ('a, 'b) continuation

    fiber f constructs a continuation that runs the computation f.

    type ('a, 'b) handler = {
    1. retc : 'a -> 'b;
    2. exnc : exn -> 'b;
    3. effc : 'c. 'c t -> (('c, 'a) continuation -> 'b) option;
    }

    ('a,'b) handler is a handler record with three fields -- retc is the value handler, exnc handles exceptions, and effc handles the effects performed by the computation enclosed by the handler.

    val continue_with : ('c, 'a) continuation -> 'c -> ('a, 'b) handler -> 'b

    continue_with k v h resumes the continuation k with value v with the handler h.

    val discontinue_with : ('c, 'a) continuation -> exn -> ('a, 'b) handler -> 'b

    discontinue_with k e h resumes the continuation k by raising the exception e with the handler h.

    val discontinue_with_backtrace : + ('a, 'b) continuation -> + exn -> + Printexc.raw_backtrace -> + ('b, 'c) handler -> + 'c

    discontinue_with k e bt h resumes the continuation k by raising the exception e with the handler h using the raw backtrace bt as the origin of the exception.

    val get_callstack : ('a, 'b) continuation -> int -> Printexc.raw_backtrace

    get_callstack c n returns a description of the top of the call stack on the continuation c, with at most n entries.

    diff --git a/ocaml/Stdlib/Effect/index.html b/ocaml/Stdlib/Effect/index.html new file mode 100644 index 0000000..26c789f --- /dev/null +++ b/ocaml/Stdlib/Effect/index.html @@ -0,0 +1,2 @@ + +Effect (ocaml.Stdlib.Effect)

    Module Stdlib.Effect

    • alert unstable The Effect interface may change in incompatible ways in the future.

    Effects.

    See 'Language extensions/Effect handlers' section in the manual.

    • since 5.0
    • alert unstable The Effect interface may change in incompatible ways in the future.
    type _ t = ..

    The type of effects.

    exception Unhandled : 'a t -> exn

    Unhandled e is raised when effect e is performed and there is no handler for it.

    exception Continuation_already_resumed

    Exception raised when a continuation is continued or discontinued more than once.

    val perform : 'a t -> 'a

    perform e performs an effect e.

    • raises Unhandled

      if there is no handler for e.

    module Deep : sig ... end

    Deep handlers

    module Shallow : sig ... end
    diff --git a/ocaml/Stdlib/Either/index.html b/ocaml/Stdlib/Either/index.html new file mode 100644 index 0000000..6afec08 --- /dev/null +++ b/ocaml/Stdlib/Either/index.html @@ -0,0 +1,17 @@ + +Either (ocaml.Stdlib.Either)

    Module Stdlib.Either

    Either type.

    Either is the simplest and most generic sum/variant type: a value of ('a, 'b) Either.t is either a Left (v : 'a) or a Right (v : 'b).

    It is a natural choice in the API of generic functions where values could fall in two different cases, possibly at different types, without assigning a specific meaning to what each case should be.

    For example:

    List.partition_map:
+    ('a -> ('b, 'c) Either.t) -> 'a list -> 'b list * 'c list

    If you are looking for a parametrized type where one alternative means success and the other means failure, you should use the more specific type Result.t.

    • since 4.12
    type ('a, 'b) t =
    1. | Left of 'a
    2. | Right of 'b

    A value of ('a, 'b) Either.t contains either a value of 'a or a value of 'b

    val left : 'a -> ('a, 'b) t

    left v is Left v.

    val right : 'b -> ('a, 'b) t

    right v is Right v.

    val is_left : ('a, 'b) t -> bool

    is_left (Left v) is true, is_left (Right v) is false.

    val is_right : ('a, 'b) t -> bool

    is_right (Left v) is false, is_right (Right v) is true.

    val find_left : ('a, 'b) t -> 'a option

    find_left (Left v) is Some v, find_left (Right _) is None

    val find_right : ('a, 'b) t -> 'b option

    find_right (Right v) is Some v, find_right (Left _) is None

    val map_left : ('a1 -> 'a2) -> ('a1, 'b) t -> ('a2, 'b) t

    map_left f e is Left (f v) if e is Left v and e if e is Right _.

    val map_right : ('b1 -> 'b2) -> ('a, 'b1) t -> ('a, 'b2) t

    map_right f e is Right (f v) if e is Right v and e if e is Left _.

    val map : + left:('a1 -> 'a2) -> + right:('b1 -> 'b2) -> + ('a1, 'b1) t -> + ('a2, 'b2) t

    map ~left ~right (Left v) is Left (left v), map ~left ~right (Right v) is Right (right v).

    val fold : left:('a -> 'c) -> right:('b -> 'c) -> ('a, 'b) t -> 'c

    fold ~left ~right (Left v) is left v, and fold ~left ~right (Right v) is right v.

    val iter : left:('a -> unit) -> right:('b -> unit) -> ('a, 'b) t -> unit

    iter ~left ~right (Left v) is left v, and iter ~left ~right (Right v) is right v.

    val for_all : left:('a -> bool) -> right:('b -> bool) -> ('a, 'b) t -> bool

    for_all ~left ~right (Left v) is left v, and for_all ~left ~right (Right v) is right v.

    val equal : + left:('a -> 'a -> bool) -> + right:('b -> 'b -> bool) -> + ('a, 'b) t -> + ('a, 'b) t -> + bool

    equal ~left ~right e0 e1 tests equality of e0 and e1 using left and right to respectively compare values wrapped by Left _ and Right _.

    val compare : + left:('a -> 'a -> int) -> + right:('b -> 'b -> int) -> + ('a, 'b) t -> + ('a, 'b) t -> + int

    compare ~left ~right e0 e1 totally orders e0 and e1 using left and right to respectively compare values wrapped by Left _ and Right _. Left _ values are smaller than Right _ values.

    diff --git a/ocaml/Stdlib/Ephemeron/K1/Bucket/index.html b/ocaml/Stdlib/Ephemeron/K1/Bucket/index.html new file mode 100644 index 0000000..6df5463 --- /dev/null +++ b/ocaml/Stdlib/Ephemeron/K1/Bucket/index.html @@ -0,0 +1,2 @@ + +Bucket (ocaml.Stdlib.Ephemeron.K1.Bucket)

    Module K1.Bucket

    type ('k, 'd) t

    A bucket is a mutable "list" of ephemerons.

    val make : unit -> ('k, 'd) t

    Create a new bucket.

    val add : ('k, 'd) t -> 'k -> 'd -> unit

    Add an ephemeron to the bucket.

    val remove : ('k, 'd) t -> 'k -> unit

    remove b k removes from b the most-recently added ephemeron with key k, or does nothing if there is no such ephemeron.

    val find : ('k, 'd) t -> 'k -> 'd option

    Returns the data of the most-recently added ephemeron with the given key, or None if there is no such ephemeron.

    val length : ('k, 'd) t -> int

    Returns an upper bound on the length of the bucket.

    val clear : ('k, 'd) t -> unit

    Remove all ephemerons from the bucket.

    diff --git a/ocaml/Stdlib/Ephemeron/K1/Make/argument-1-H/index.html b/ocaml/Stdlib/Ephemeron/K1/Make/argument-1-H/index.html new file mode 100644 index 0000000..c3056e3 --- /dev/null +++ b/ocaml/Stdlib/Ephemeron/K1/Make/argument-1-H/index.html @@ -0,0 +1,2 @@ + +H (ocaml.Stdlib.Ephemeron.K1.Make.H)

    Parameter Make.H

    type t

    The type of the hashtable keys.

    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val hash : t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    diff --git a/ocaml/Stdlib/Ephemeron/K1/Make/index.html b/ocaml/Stdlib/Ephemeron/K1/Make/index.html new file mode 100644 index 0000000..155581f --- /dev/null +++ b/ocaml/Stdlib/Ephemeron/K1/Make/index.html @@ -0,0 +1,2 @@ + +Make (ocaml.Stdlib.Ephemeron.K1.Make)

    Module K1.Make

    Functor building an implementation of a weak hash table

    Propose the same interface as usual hash table. However since the bindings are weak, even if mem h k is true, a subsequent find h k may raise Not_found because the garbage collector can run between the two.

    Parameters

    Signature

    type key = H.t
    type !'a t
    val create : int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    val copy : 'a t -> 'a t
    val add : 'a t -> key -> 'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key -> 'a -> unit
    val mem : 'a t -> key -> bool
    val length : 'a t -> int
    val stats : 'a t -> Hashtbl.statistics
    val add_seq : 'a t -> (key * 'a) Seq.t -> unit
    val replace_seq : 'a t -> (key * 'a) Seq.t -> unit
    val of_seq : (key * 'a) Seq.t -> 'a t
    val clean : 'a t -> unit

    remove all dead bindings. Done automatically during automatic resizing.

    val stats_alive : 'a t -> Hashtbl.statistics

    same as Hashtbl.SeededS.stats but only count the alive bindings

    diff --git a/ocaml/Stdlib/Ephemeron/K1/MakeSeeded/argument-1-H/index.html b/ocaml/Stdlib/Ephemeron/K1/MakeSeeded/argument-1-H/index.html new file mode 100644 index 0000000..b3e43ea --- /dev/null +++ b/ocaml/Stdlib/Ephemeron/K1/MakeSeeded/argument-1-H/index.html @@ -0,0 +1,2 @@ + +H (ocaml.Stdlib.Ephemeron.K1.MakeSeeded.H)

    Parameter MakeSeeded.H

    type t

    The type of the hashtable keys.

    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val seeded_hash : int -> t -> int

    A seeded hashing function on keys. The first argument is the seed. It must be the case that if equal x y is true, then seeded_hash seed x = seeded_hash seed y for any value of seed. A suitable choice for seeded_hash is the function Hashtbl.seeded_hash below.

    diff --git a/ocaml/Stdlib/Ephemeron/K1/MakeSeeded/index.html b/ocaml/Stdlib/Ephemeron/K1/MakeSeeded/index.html new file mode 100644 index 0000000..b1215e0 --- /dev/null +++ b/ocaml/Stdlib/Ephemeron/K1/MakeSeeded/index.html @@ -0,0 +1,2 @@ + +MakeSeeded (ocaml.Stdlib.Ephemeron.K1.MakeSeeded)

    Module K1.MakeSeeded

    Functor building an implementation of a weak hash table. The seed is similar to the one of Hashtbl.MakeSeeded.

    Parameters

    Signature

    type key = H.t
    type !'a t
    val create : ?random:bool -> int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    val copy : 'a t -> 'a t
    val add : 'a t -> key -> 'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key -> 'a -> unit
    val mem : 'a t -> key -> bool
    val length : 'a t -> int
    val stats : 'a t -> Hashtbl.statistics
    val add_seq : 'a t -> (key * 'a) Seq.t -> unit
    val replace_seq : 'a t -> (key * 'a) Seq.t -> unit
    val of_seq : (key * 'a) Seq.t -> 'a t
    val clean : 'a t -> unit

    remove all dead bindings. Done automatically during automatic resizing.

    val stats_alive : 'a t -> Hashtbl.statistics

    same as Hashtbl.SeededS.stats but only count the alive bindings

    diff --git a/ocaml/Stdlib/Ephemeron/K1/index.html b/ocaml/Stdlib/Ephemeron/K1/index.html new file mode 100644 index 0000000..6661bc8 --- /dev/null +++ b/ocaml/Stdlib/Ephemeron/K1/index.html @@ -0,0 +1,2 @@ + +K1 (ocaml.Stdlib.Ephemeron.K1)

    Module Ephemeron.K1

    Ephemerons with one key.

    type ('k, 'd) t

    an ephemeron with one key

    val make : 'k -> 'd -> ('k, 'd) t

    Ephemeron.K1.make k d creates an ephemeron with key k and data d.

    val query : ('k, 'd) t -> 'k -> 'd option

    Ephemeron.K1.query eph key returns Some x (where x is the ephemeron's data) if key is physically equal to eph's key, and None if eph is empty or key is not equal to eph's key.

    module Make (H : Hashtbl.HashedType) : S with type key = H.t

    Functor building an implementation of a weak hash table

    Functor building an implementation of a weak hash table. The seed is similar to the one of Hashtbl.MakeSeeded.

    module Bucket : sig ... end
    diff --git a/ocaml/Stdlib/Ephemeron/K2/Bucket/index.html b/ocaml/Stdlib/Ephemeron/K2/Bucket/index.html new file mode 100644 index 0000000..27a4c0e --- /dev/null +++ b/ocaml/Stdlib/Ephemeron/K2/Bucket/index.html @@ -0,0 +1,2 @@ + +Bucket (ocaml.Stdlib.Ephemeron.K2.Bucket)

    Module K2.Bucket

    type ('k1, 'k2, 'd) t

    A bucket is a mutable "list" of ephemerons.

    val make : unit -> ('k1, 'k2, 'd) t

    Create a new bucket.

    val add : ('k1, 'k2, 'd) t -> 'k1 -> 'k2 -> 'd -> unit

    Add an ephemeron to the bucket.

    val remove : ('k1, 'k2, 'd) t -> 'k1 -> 'k2 -> unit

    remove b k1 k2 removes from b the most-recently added ephemeron with keys k1 and k2, or does nothing if there is no such ephemeron.

    val find : ('k1, 'k2, 'd) t -> 'k1 -> 'k2 -> 'd option

    Returns the data of the most-recently added ephemeron with the given keys, or None if there is no such ephemeron.

    val length : ('k1, 'k2, 'd) t -> int

    Returns an upper bound on the length of the bucket.

    val clear : ('k1, 'k2, 'd) t -> unit

    Remove all ephemerons from the bucket.

    diff --git a/ocaml/Stdlib/Ephemeron/K2/Make/argument-1-H1/index.html b/ocaml/Stdlib/Ephemeron/K2/Make/argument-1-H1/index.html new file mode 100644 index 0000000..d0ce954 --- /dev/null +++ b/ocaml/Stdlib/Ephemeron/K2/Make/argument-1-H1/index.html @@ -0,0 +1,2 @@ + +H1 (ocaml.Stdlib.Ephemeron.K2.Make.H1)

    Parameter Make.H1

    type t

    The type of the hashtable keys.

    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val hash : t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    diff --git a/ocaml/Stdlib/Ephemeron/K2/Make/argument-2-H2/index.html b/ocaml/Stdlib/Ephemeron/K2/Make/argument-2-H2/index.html new file mode 100644 index 0000000..93c1684 --- /dev/null +++ b/ocaml/Stdlib/Ephemeron/K2/Make/argument-2-H2/index.html @@ -0,0 +1,2 @@ + +H2 (ocaml.Stdlib.Ephemeron.K2.Make.H2)

    Parameter Make.H2

    type t

    The type of the hashtable keys.

    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val hash : t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    diff --git a/ocaml/Stdlib/Ephemeron/K2/Make/index.html b/ocaml/Stdlib/Ephemeron/K2/Make/index.html new file mode 100644 index 0000000..325e3f3 --- /dev/null +++ b/ocaml/Stdlib/Ephemeron/K2/Make/index.html @@ -0,0 +1,2 @@ + +Make (ocaml.Stdlib.Ephemeron.K2.Make)

    Module K2.Make

    Functor building an implementation of a weak hash table

    Propose the same interface as usual hash table. However since the bindings are weak, even if mem h k is true, a subsequent find h k may raise Not_found because the garbage collector can run between the two.

    Parameters

    Signature

    type key = H1.t * H2.t
    type !'a t
    val create : int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    val copy : 'a t -> 'a t
    val add : 'a t -> key -> 'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key -> 'a -> unit
    val mem : 'a t -> key -> bool
    val length : 'a t -> int
    val stats : 'a t -> Hashtbl.statistics
    val add_seq : 'a t -> (key * 'a) Seq.t -> unit
    val replace_seq : 'a t -> (key * 'a) Seq.t -> unit
    val of_seq : (key * 'a) Seq.t -> 'a t
    val clean : 'a t -> unit

    remove all dead bindings. Done automatically during automatic resizing.

    val stats_alive : 'a t -> Hashtbl.statistics

    same as Hashtbl.SeededS.stats but only count the alive bindings

    diff --git a/ocaml/Stdlib/Ephemeron/K2/MakeSeeded/argument-1-H1/index.html b/ocaml/Stdlib/Ephemeron/K2/MakeSeeded/argument-1-H1/index.html new file mode 100644 index 0000000..d939f41 --- /dev/null +++ b/ocaml/Stdlib/Ephemeron/K2/MakeSeeded/argument-1-H1/index.html @@ -0,0 +1,2 @@ + +H1 (ocaml.Stdlib.Ephemeron.K2.MakeSeeded.H1)

    Parameter MakeSeeded.H1

    type t

    The type of the hashtable keys.

    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val seeded_hash : int -> t -> int

    A seeded hashing function on keys. The first argument is the seed. It must be the case that if equal x y is true, then seeded_hash seed x = seeded_hash seed y for any value of seed. A suitable choice for seeded_hash is the function Hashtbl.seeded_hash below.

    diff --git a/ocaml/Stdlib/Ephemeron/K2/MakeSeeded/argument-2-H2/index.html b/ocaml/Stdlib/Ephemeron/K2/MakeSeeded/argument-2-H2/index.html new file mode 100644 index 0000000..8d5adb7 --- /dev/null +++ b/ocaml/Stdlib/Ephemeron/K2/MakeSeeded/argument-2-H2/index.html @@ -0,0 +1,2 @@ + +H2 (ocaml.Stdlib.Ephemeron.K2.MakeSeeded.H2)

    Parameter MakeSeeded.H2

    type t

    The type of the hashtable keys.

    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val seeded_hash : int -> t -> int

    A seeded hashing function on keys. The first argument is the seed. It must be the case that if equal x y is true, then seeded_hash seed x = seeded_hash seed y for any value of seed. A suitable choice for seeded_hash is the function Hashtbl.seeded_hash below.

    diff --git a/ocaml/Stdlib/Ephemeron/K2/MakeSeeded/index.html b/ocaml/Stdlib/Ephemeron/K2/MakeSeeded/index.html new file mode 100644 index 0000000..76cc149 --- /dev/null +++ b/ocaml/Stdlib/Ephemeron/K2/MakeSeeded/index.html @@ -0,0 +1,2 @@ + +MakeSeeded (ocaml.Stdlib.Ephemeron.K2.MakeSeeded)

    Module K2.MakeSeeded

    Functor building an implementation of a weak hash table. The seed is similar to the one of Hashtbl.MakeSeeded.

    Parameters

    Signature

    type key = H1.t * H2.t
    type !'a t
    val create : ?random:bool -> int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    val copy : 'a t -> 'a t
    val add : 'a t -> key -> 'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key -> 'a -> unit
    val mem : 'a t -> key -> bool
    val length : 'a t -> int
    val stats : 'a t -> Hashtbl.statistics
    val add_seq : 'a t -> (key * 'a) Seq.t -> unit
    val replace_seq : 'a t -> (key * 'a) Seq.t -> unit
    val of_seq : (key * 'a) Seq.t -> 'a t
    val clean : 'a t -> unit

    remove all dead bindings. Done automatically during automatic resizing.

    val stats_alive : 'a t -> Hashtbl.statistics

    same as Hashtbl.SeededS.stats but only count the alive bindings

    diff --git a/ocaml/Stdlib/Ephemeron/K2/index.html b/ocaml/Stdlib/Ephemeron/K2/index.html new file mode 100644 index 0000000..8f2efc0 --- /dev/null +++ b/ocaml/Stdlib/Ephemeron/K2/index.html @@ -0,0 +1,8 @@ + +K2 (ocaml.Stdlib.Ephemeron.K2)

    Module Ephemeron.K2

    Ephemerons with two keys.

    type ('k1, 'k2, 'd) t

    an ephemeron with two keys

    val make : 'k1 -> 'k2 -> 'd -> ('k1, 'k2, 'd) t

    Same as Ephemeron.K1.make

    val query : ('k1, 'k2, 'd) t -> 'k1 -> 'k2 -> 'd option

    Same as Ephemeron.K1.query

    module Make + (H1 : Hashtbl.HashedType) + (H2 : Hashtbl.HashedType) : + S with type key = H1.t * H2.t

    Functor building an implementation of a weak hash table

    Functor building an implementation of a weak hash table. The seed is similar to the one of Hashtbl.MakeSeeded.

    module Bucket : sig ... end
    diff --git a/ocaml/Stdlib/Ephemeron/Kn/Bucket/index.html b/ocaml/Stdlib/Ephemeron/Kn/Bucket/index.html new file mode 100644 index 0000000..36a5445 --- /dev/null +++ b/ocaml/Stdlib/Ephemeron/Kn/Bucket/index.html @@ -0,0 +1,2 @@ + +Bucket (ocaml.Stdlib.Ephemeron.Kn.Bucket)

    Module Kn.Bucket

    type ('k, 'd) t

    A bucket is a mutable "list" of ephemerons.

    val make : unit -> ('k, 'd) t

    Create a new bucket.

    val add : ('k, 'd) t -> 'k array -> 'd -> unit

    Add an ephemeron to the bucket.

    val remove : ('k, 'd) t -> 'k array -> unit

    remove b k removes from b the most-recently added ephemeron with keys k, or does nothing if there is no such ephemeron.

    val find : ('k, 'd) t -> 'k array -> 'd option

    Returns the data of the most-recently added ephemeron with the given keys, or None if there is no such ephemeron.

    val length : ('k, 'd) t -> int

    Returns an upper bound on the length of the bucket.

    val clear : ('k, 'd) t -> unit

    Remove all ephemerons from the bucket.

    diff --git a/ocaml/Stdlib/Ephemeron/Kn/Make/argument-1-H/index.html b/ocaml/Stdlib/Ephemeron/Kn/Make/argument-1-H/index.html new file mode 100644 index 0000000..a94f1aa --- /dev/null +++ b/ocaml/Stdlib/Ephemeron/Kn/Make/argument-1-H/index.html @@ -0,0 +1,2 @@ + +H (ocaml.Stdlib.Ephemeron.Kn.Make.H)

    Parameter Make.H

    type t

    The type of the hashtable keys.

    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val hash : t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    diff --git a/ocaml/Stdlib/Ephemeron/Kn/Make/index.html b/ocaml/Stdlib/Ephemeron/Kn/Make/index.html new file mode 100644 index 0000000..6dd7bd2 --- /dev/null +++ b/ocaml/Stdlib/Ephemeron/Kn/Make/index.html @@ -0,0 +1,2 @@ + +Make (ocaml.Stdlib.Ephemeron.Kn.Make)

    Module Kn.Make

    Functor building an implementation of a weak hash table

    Propose the same interface as usual hash table. However since the bindings are weak, even if mem h k is true, a subsequent find h k may raise Not_found because the garbage collector can run between the two.

    Parameters

    Signature

    type key = H.t array
    type !'a t
    val create : int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    val copy : 'a t -> 'a t
    val add : 'a t -> key -> 'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key -> 'a -> unit
    val mem : 'a t -> key -> bool
    val length : 'a t -> int
    val stats : 'a t -> Hashtbl.statistics
    val add_seq : 'a t -> (key * 'a) Seq.t -> unit
    val replace_seq : 'a t -> (key * 'a) Seq.t -> unit
    val of_seq : (key * 'a) Seq.t -> 'a t
    val clean : 'a t -> unit

    remove all dead bindings. Done automatically during automatic resizing.

    val stats_alive : 'a t -> Hashtbl.statistics

    same as Hashtbl.SeededS.stats but only count the alive bindings

    diff --git a/ocaml/Stdlib/Ephemeron/Kn/MakeSeeded/argument-1-H/index.html b/ocaml/Stdlib/Ephemeron/Kn/MakeSeeded/argument-1-H/index.html new file mode 100644 index 0000000..52a045f --- /dev/null +++ b/ocaml/Stdlib/Ephemeron/Kn/MakeSeeded/argument-1-H/index.html @@ -0,0 +1,2 @@ + +H (ocaml.Stdlib.Ephemeron.Kn.MakeSeeded.H)

    Parameter MakeSeeded.H

    type t

    The type of the hashtable keys.

    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val seeded_hash : int -> t -> int

    A seeded hashing function on keys. The first argument is the seed. It must be the case that if equal x y is true, then seeded_hash seed x = seeded_hash seed y for any value of seed. A suitable choice for seeded_hash is the function Hashtbl.seeded_hash below.

    diff --git a/ocaml/Stdlib/Ephemeron/Kn/MakeSeeded/index.html b/ocaml/Stdlib/Ephemeron/Kn/MakeSeeded/index.html new file mode 100644 index 0000000..d62c867 --- /dev/null +++ b/ocaml/Stdlib/Ephemeron/Kn/MakeSeeded/index.html @@ -0,0 +1,2 @@ + +MakeSeeded (ocaml.Stdlib.Ephemeron.Kn.MakeSeeded)

    Module Kn.MakeSeeded

    Functor building an implementation of a weak hash table. The seed is similar to the one of Hashtbl.MakeSeeded.

    Parameters

    Signature

    type key = H.t array
    type !'a t
    val create : ?random:bool -> int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    val copy : 'a t -> 'a t
    val add : 'a t -> key -> 'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key -> 'a -> unit
    val mem : 'a t -> key -> bool
    val length : 'a t -> int
    val stats : 'a t -> Hashtbl.statistics
    val add_seq : 'a t -> (key * 'a) Seq.t -> unit
    val replace_seq : 'a t -> (key * 'a) Seq.t -> unit
    val of_seq : (key * 'a) Seq.t -> 'a t
    val clean : 'a t -> unit

    remove all dead bindings. Done automatically during automatic resizing.

    val stats_alive : 'a t -> Hashtbl.statistics

    same as Hashtbl.SeededS.stats but only count the alive bindings

    diff --git a/ocaml/Stdlib/Ephemeron/Kn/index.html b/ocaml/Stdlib/Ephemeron/Kn/index.html new file mode 100644 index 0000000..b294d42 --- /dev/null +++ b/ocaml/Stdlib/Ephemeron/Kn/index.html @@ -0,0 +1,4 @@ + +Kn (ocaml.Stdlib.Ephemeron.Kn)

    Module Ephemeron.Kn

    Ephemerons with arbitrary number of keys of the same type.

    type ('k, 'd) t

    an ephemeron with an arbitrary number of keys of the same type

    val make : 'k array -> 'd -> ('k, 'd) t

    Same as Ephemeron.K1.make

    val query : ('k, 'd) t -> 'k array -> 'd option

    Same as Ephemeron.K1.query

    module Make (H : Hashtbl.HashedType) : S with type key = H.t array

    Functor building an implementation of a weak hash table

    module MakeSeeded + (H : Hashtbl.SeededHashedType) : + SeededS with type key = H.t array

    Functor building an implementation of a weak hash table. The seed is similar to the one of Hashtbl.MakeSeeded.

    module Bucket : sig ... end
    diff --git a/ocaml/Stdlib/Ephemeron/index.html b/ocaml/Stdlib/Ephemeron/index.html new file mode 100644 index 0000000..45c7437 --- /dev/null +++ b/ocaml/Stdlib/Ephemeron/index.html @@ -0,0 +1,2 @@ + +Ephemeron (ocaml.Stdlib.Ephemeron)

    Module Stdlib.Ephemeron

    Ephemerons and weak hash tables.

    Ephemerons and weak hash tables are useful when one wants to cache or memorize the computation of a function, as long as the arguments and the function are used, without creating memory leaks by continuously keeping old computation results that are not useful anymore because one argument or the function is freed. An implementation using Hashtbl.t is not suitable because all associations would keep the arguments and the result in memory.

    Ephemerons can also be used for "adding" a field to an arbitrary boxed OCaml value: you can attach some information to a value created by an external library without memory leaks.

    Ephemerons hold some keys and one or no data. They are all boxed OCaml values. The keys of an ephemeron have the same behavior as weak pointers according to the garbage collector. In fact OCaml weak pointers are implemented as ephemerons without data.

    The keys and data of an ephemeron are said to be full if they point to a value, or empty if the value has never been set, has been unset, or was erased by the GC. In the function that accesses the keys or data these two states are represented by the option type.

    The data is considered by the garbage collector alive if all the full keys are alive and if the ephemeron is alive. When one of the keys is not considered alive anymore by the GC, the data is emptied from the ephemeron. The data could be alive for another reason and in that case the GC will not free it, but the ephemeron will not hold the data anymore.

    The ephemerons complicate the notion of liveness of values, because it is not anymore an equivalence with the reachability from root value by usual pointers (not weak and not ephemerons). With ephemerons the notion of liveness is constructed by the least fixpoint of: A value is alive if:

    • it is a root value
    • it is reachable from alive value by usual pointers
    • it is the data of an alive ephemeron with all its full keys alive

    Notes:

    Ephemerons are defined in a language agnostic way in this paper: B. Hayes, Ephemerons: A New Finalization Mechanism, OOPSLA'97

    • since 4.03

    Unsynchronized accesses

    Unsynchronized accesses to a weak hash table may lead to an invalid weak hash table state. Thus, concurrent accesses to a buffer must be synchronized (for instance with a Mutex.t).

    module type S = sig ... end

    The output signature of the functors K1.Make and K2.Make. These hash tables are weak in the keys. If all the keys of a binding are alive the binding is kept, but if one of the keys of the binding is dead then the binding is removed.

    module type SeededS = sig ... end

    The output signature of the functors K1.MakeSeeded and K2.MakeSeeded.

    module K1 : sig ... end

    Ephemerons with one key.

    module K2 : sig ... end

    Ephemerons with two keys.

    module Kn : sig ... end

    Ephemerons with arbitrary number of keys of the same type.

    diff --git a/ocaml/Stdlib/Ephemeron/module-type-S/index.html b/ocaml/Stdlib/Ephemeron/module-type-S/index.html new file mode 100644 index 0000000..86f4756 --- /dev/null +++ b/ocaml/Stdlib/Ephemeron/module-type-S/index.html @@ -0,0 +1,2 @@ + +S (ocaml.Stdlib.Ephemeron.S)

    Module type Ephemeron.S

    The output signature of the functors K1.Make and K2.Make. These hash tables are weak in the keys. If all the keys of a binding are alive the binding is kept, but if one of the keys of the binding is dead then the binding is removed.

    Propose the same interface as usual hash table. However since the bindings are weak, even if mem h k is true, a subsequent find h k may raise Not_found because the garbage collector can run between the two.

    type key
    type !'a t
    val create : int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    val copy : 'a t -> 'a t
    val add : 'a t -> key -> 'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key -> 'a -> unit
    val mem : 'a t -> key -> bool
    val length : 'a t -> int
    val stats : 'a t -> Hashtbl.statistics
    val add_seq : 'a t -> (key * 'a) Seq.t -> unit
    val replace_seq : 'a t -> (key * 'a) Seq.t -> unit
    val of_seq : (key * 'a) Seq.t -> 'a t
    val clean : 'a t -> unit

    remove all dead bindings. Done automatically during automatic resizing.

    val stats_alive : 'a t -> Hashtbl.statistics

    same as Hashtbl.SeededS.stats but only count the alive bindings

    diff --git a/ocaml/Stdlib/Ephemeron/module-type-SeededS/index.html b/ocaml/Stdlib/Ephemeron/module-type-SeededS/index.html new file mode 100644 index 0000000..9faf223 --- /dev/null +++ b/ocaml/Stdlib/Ephemeron/module-type-SeededS/index.html @@ -0,0 +1,2 @@ + +SeededS (ocaml.Stdlib.Ephemeron.SeededS)

    Module type Ephemeron.SeededS

    The output signature of the functors K1.MakeSeeded and K2.MakeSeeded.

    type key
    type !'a t
    val create : ?random:bool -> int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    val copy : 'a t -> 'a t
    val add : 'a t -> key -> 'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key -> 'a -> unit
    val mem : 'a t -> key -> bool
    val length : 'a t -> int
    val stats : 'a t -> Hashtbl.statistics
    val add_seq : 'a t -> (key * 'a) Seq.t -> unit
    val replace_seq : 'a t -> (key * 'a) Seq.t -> unit
    val of_seq : (key * 'a) Seq.t -> 'a t
    val clean : 'a t -> unit

    remove all dead bindings. Done automatically during automatic resizing.

    val stats_alive : 'a t -> Hashtbl.statistics

    same as Hashtbl.SeededS.stats but only count the alive bindings

    diff --git a/ocaml/Stdlib/Filename/index.html b/ocaml/Stdlib/Filename/index.html new file mode 100644 index 0000000..d97b2cc --- /dev/null +++ b/ocaml/Stdlib/Filename/index.html @@ -0,0 +1,14 @@ + +Filename (ocaml.Stdlib.Filename)

    Module Stdlib.Filename

    Operations on file names.

    val current_dir_name : string

    The conventional name for the current directory (e.g. . in Unix).

    val parent_dir_name : string

    The conventional name for the parent of the current directory (e.g. .. in Unix).

    val dir_sep : string

    The directory separator (e.g. / in Unix).

    • since 3.11.2
    val concat : string -> string -> string

    concat dir file returns a file name that designates file file in directory dir.

    val is_relative : string -> bool

    Return true if the file name is relative to the current directory, false if it is absolute (i.e. in Unix, starts with /).

    val is_implicit : string -> bool

    Return true if the file name is relative and does not start with an explicit reference to the current directory (./ or ../ in Unix), false if it starts with an explicit reference to the root directory or the current directory.

    val check_suffix : string -> string -> bool

    check_suffix name suff returns true if the filename name ends with the suffix suff.

    Under Windows ports (including Cygwin), comparison is case-insensitive, relying on String.lowercase_ascii. Note that this does not match exactly the interpretation of case-insensitive filename equivalence from Windows.

    val chop_suffix : string -> string -> string

    chop_suffix name suff removes the suffix suff from the filename name.

    val chop_suffix_opt : suffix:string -> string -> string option

    chop_suffix_opt ~suffix filename removes the suffix from the filename if possible, or returns None if the filename does not end with the suffix.

    Under Windows ports (including Cygwin), comparison is case-insensitive, relying on String.lowercase_ascii. Note that this does not match exactly the interpretation of case-insensitive filename equivalence from Windows.

    • since 4.08
    val extension : string -> string

    extension name is the shortest suffix ext of name0 where:

    • name0 is the longest suffix of name that does not contain a directory separator;
    • ext starts with a period;
    • ext is preceded by at least one non-period character in name0.

    If such a suffix does not exist, extension name is the empty string.

    • since 4.04
    val remove_extension : string -> string

    Return the given file name without its extension, as defined in Filename.extension. If the extension is empty, the function returns the given file name.

    The following invariant holds for any file name s:

    remove_extension s ^ extension s = s

    • since 4.04
    val chop_extension : string -> string

    Same as Filename.remove_extension, but raise Invalid_argument if the given name has an empty extension.

    val basename : string -> string

    Split a file name into directory name / base file name. If name is a valid file name, then concat (dirname name) (basename name) returns a file name which is equivalent to name. Moreover, after setting the current directory to dirname name (with Sys.chdir), references to basename name (which is a relative file name) designate the same file as name before the call to Sys.chdir.

    This function conforms to the specification of POSIX.1-2008 for the basename utility.

    val dirname : string -> string

    See Filename.basename. This function conforms to the specification of POSIX.1-2008 for the dirname utility.

    val null : string

    null is "/dev/null" on POSIX and "NUL" on Windows. It represents a file on the OS that discards all writes and returns end of file on reads.

    • since 4.10
    val temp_file : ?temp_dir:string -> string -> string -> string

    temp_file prefix suffix returns the name of a fresh temporary file in the temporary directory. The base name of the temporary file is formed by concatenating prefix, then a suitably chosen integer number, then suffix. The optional argument temp_dir indicates the temporary directory to use, defaulting to the current result of Filename.get_temp_dir_name. The temporary file is created empty, with permissions 0o600 (readable and writable only by the file owner). The file is guaranteed to be different from any other file that existed when temp_file was called.

    • raises Sys_error

      if the file could not be created.

    • before 3.11.2

      no ?temp_dir optional argument

    val open_temp_file : + ?mode:open_flag list -> + ?perms:int -> + ?temp_dir:string -> + string -> + string -> + string * out_channel

    Same as Filename.temp_file, but returns both the name of a fresh temporary file, and an output channel opened (atomically) on this file. This function is more secure than temp_file: there is no risk that the temporary file will be modified (e.g. replaced by a symbolic link) before the program opens it. The optional argument mode is a list of additional flags to control the opening of the file. It can contain one or several of Open_append, Open_binary, and Open_text. The default is [Open_text] (open in text mode). The file is created with permissions perms (defaults to readable and writable only by the file owner, 0o600).

    • raises Sys_error

      if the file could not be opened.

    • before 4.03

      no ?perms optional argument

    • before 3.11.2

      no ?temp_dir optional argument

    val temp_dir : ?temp_dir:string -> ?perms:int -> string -> string -> string

    temp_dir prefix suffix creates and returns the name of a fresh temporary directory with permissions perms (defaults to 0o700) inside temp_dir. The base name of the temporary directory is formed by concatenating prefix, then a suitably chosen integer number, then suffix. The optional argument temp_dir indicates the temporary directory to use, defaulting to the current result of Filename.get_temp_dir_name. The temporary directory is created empty, with permissions 0o700 (readable, writable, and searchable only by the file owner). The directory is guaranteed to be different from any other directory that existed when temp_dir was called.

    If temp_dir does not exist, this function does not create it. Instead, it raises Sys_error.

    • raises Sys_error

      if the directory could not be created.

    • since 5.1
    val get_temp_dir_name : unit -> string

    The name of the temporary directory: Under Unix, the value of the TMPDIR environment variable, or "/tmp" if the variable is not set. Under Windows, the value of the TEMP environment variable, or "." if the variable is not set. The temporary directory can be changed with Filename.set_temp_dir_name.

    • since 4.00
    val set_temp_dir_name : string -> unit

    Change the temporary directory returned by Filename.get_temp_dir_name and used by Filename.temp_file and Filename.open_temp_file. The temporary directory is a domain-local value which is inherited by child domains.

    • since 4.00
    val quote : string -> string

    Return a quoted version of a file name, suitable for use as one argument in a command line, escaping all meta-characters. Warning: under Windows, the output is only suitable for use with programs that follow the standard Windows quoting conventions.

    val quote_command : + string -> + ?stdin:string -> + ?stdout:string -> + ?stderr:string -> + string list -> + string

    quote_command cmd args returns a quoted command line, suitable for use as an argument to Sys.command, Unix.system, and the Unix.open_process functions.

    The string cmd is the command to call. The list args is the list of arguments to pass to this command. It can be empty.

    The optional arguments ?stdin and ?stdout and ?stderr are file names used to redirect the standard input, the standard output, or the standard error of the command. If ~stdin:f is given, a redirection < f is performed and the standard input of the command reads from file f. If ~stdout:f is given, a redirection > f is performed and the standard output of the command is written to file f. If ~stderr:f is given, a redirection 2> f is performed and the standard error of the command is written to file f. If both ~stdout:f and ~stderr:f are given, with the exact same file name f, a 2>&1 redirection is performed so that the standard output and the standard error of the command are interleaved and redirected to the same file f.

    Under Unix and Cygwin, the command, the arguments, and the redirections if any are quoted using Filename.quote, then concatenated. Under Win32, additional quoting is performed as required by the cmd.exe shell that is called by Sys.command.

    • raises Failure

      if the command cannot be escaped on the current platform.

    • since 4.10
    diff --git a/ocaml/Stdlib/Float/Array/index.html b/ocaml/Stdlib/Float/Array/index.html new file mode 100644 index 0000000..9fbf9bc --- /dev/null +++ b/ocaml/Stdlib/Float/Array/index.html @@ -0,0 +1,13 @@ + +Array (ocaml.Stdlib.Float.Array)

    Module Float.Array

    Float arrays with packed representation.

    type t = floatarray

    The type of float arrays with packed representation.

    • since 4.08
    val length : t -> int

    Return the length (number of elements) of the given floatarray.

    val get : t -> int -> float

    get a n returns the element number n of floatarray a.

    val set : t -> int -> float -> unit

    set a n x modifies floatarray a in place, replacing element number n with x.

    val make : int -> float -> t

    make n x returns a fresh floatarray of length n, initialized with x.

    val create : int -> t

    create n returns a fresh floatarray of length n, with uninitialized data.

    val init : int -> (int -> float) -> t

    init n f returns a fresh floatarray of length n, with element number i initialized to the result of f i. In other terms, init n f tabulates the results of f applied to the integers 0 to n-1.

    val make_matrix : int -> int -> float -> t array

    make_matrix dimx dimy e returns a two-dimensional array (an array of arrays) with first dimension dimx and second dimension dimy, where all elements are initialized with e.

    • since 5.2
    val init_matrix : int -> int -> (int -> int -> float) -> t array

    init_matrix dimx dimy f returns a two-dimensional array (an array of arrays) with first dimension dimx and second dimension dimy, where the element at index (x,y) is initialized with f x y.

    • since 5.2
    val append : t -> t -> t

    append v1 v2 returns a fresh floatarray containing the concatenation of the floatarrays v1 and v2.

    val concat : t list -> t

    Same as append, but concatenates a list of floatarrays.

    val sub : t -> int -> int -> t

    sub a pos len returns a fresh floatarray of length len, containing the elements number pos to pos + len - 1 of floatarray a.

    • raises Invalid_argument

      if pos and len do not designate a valid subarray of a; that is, if pos < 0, or len < 0, or pos + len > length a.

    val copy : t -> t

    copy a returns a copy of a, that is, a fresh floatarray containing the same elements as a.

    val fill : t -> int -> int -> float -> unit

    fill a pos len x modifies the floatarray a in place, storing x in elements number pos to pos + len - 1.

    val blit : t -> int -> t -> int -> int -> unit

    blit src src_pos dst dst_pos len copies len elements from floatarray src, starting at element number src_pos, to floatarray dst, starting at element number dst_pos. It works correctly even if src and dst are the same floatarray, and the source and destination chunks overlap.

    • raises Invalid_argument

      if src_pos and len do not designate a valid subarray of src, or if dst_pos and len do not designate a valid subarray of dst.

    val to_list : t -> float list

    to_list a returns the list of all the elements of a.

    val of_list : float list -> t

    of_list l returns a fresh floatarray containing the elements of l.

    • raises Invalid_argument

      if the length of l is greater than Sys.max_floatarray_length.

    Iterators

    val iter : (float -> unit) -> t -> unit

    iter f a applies function f in turn to all the elements of a. It is equivalent to f a.(0); f a.(1); ...; f a.(length a - 1); ().

    val iteri : (int -> float -> unit) -> t -> unit

    Same as iter, but the function is applied with the index of the element as first argument, and the element itself as second argument.

    val map : (float -> float) -> t -> t

    map f a applies function f to all the elements of a, and builds a floatarray with the results returned by f.

    val map_inplace : (float -> float) -> t -> unit

    map_inplace f a applies function f to all elements of a, and updates their values in place.

    • since 5.1
    val mapi : (int -> float -> float) -> t -> t

    Same as map, but the function is applied to the index of the element as first argument, and the element itself as second argument.

    val mapi_inplace : (int -> float -> float) -> t -> unit

    Same as map_inplace, but the function is applied to the index of the element as first argument, and the element itself as second argument.

    • since 5.1
    val fold_left : ('acc -> float -> 'acc) -> 'acc -> t -> 'acc

    fold_left f x init computes f (... (f (f x init.(0)) init.(1)) ...) init.(n-1), where n is the length of the floatarray init.

    val fold_right : (float -> 'acc -> 'acc) -> t -> 'acc -> 'acc

    fold_right f a init computes f a.(0) (f a.(1) ( ... (f a.(n-1) init) ...)), where n is the length of the floatarray a.

    Iterators on two arrays

    val iter2 : (float -> float -> unit) -> t -> t -> unit

    Array.iter2 f a b applies function f to all the elements of a and b.

    val map2 : (float -> float -> float) -> t -> t -> t

    map2 f a b applies function f to all the elements of a and b, and builds a floatarray with the results returned by f: [| f a.(0) b.(0); ...; f a.(length a - 1) b.(length b - 1)|].

    Array scanning

    val for_all : (float -> bool) -> t -> bool

    for_all f [|a1; ...; an|] checks if all elements of the floatarray satisfy the predicate f. That is, it returns (f a1) && (f a2) && ... && (f an).

    val exists : (float -> bool) -> t -> bool

    exists f [|a1; ...; an|] checks if at least one element of the floatarray satisfies the predicate f. That is, it returns (f a1) || (f a2) || ... || (f an).

    val mem : float -> t -> bool

    mem a set is true if and only if there is an element of set that is structurally equal to a, i.e. there is an x in set such that compare a x = 0.

    val mem_ieee : float -> t -> bool

    Same as mem, but uses IEEE equality instead of structural equality.

    Array searching

    val find_opt : (float -> bool) -> t -> float option
    val find_index : (float -> bool) -> t -> int option

    find_index f a returns Some i, where i is the index of the first element of the array a that satisfies f x, if there is such an element.

    It returns None if there is no such element.

    • since 5.1
    val find_map : (float -> 'a option) -> t -> 'a option
    val find_mapi : (int -> float -> 'a option) -> t -> 'a option

    Same as find_map, but the predicate is applied to the index of the element as first argument (counting from 0), and the element itself as second argument.

    • since 5.1

    Sorting and shuffling

    val sort : (float -> float -> int) -> t -> unit

    Sort a floatarray in increasing order according to a comparison function. The comparison function must return 0 if its arguments compare as equal, a positive integer if the first is greater, and a negative integer if the first is smaller (see below for a complete specification). For example, Stdlib.compare is a suitable comparison function. After calling sort, the array is sorted in place in increasing order. sort is guaranteed to run in constant heap space and (at most) logarithmic stack space.

    The current implementation uses Heap Sort. It runs in constant stack space.

    Specification of the comparison function: Let a be the floatarray and cmp the comparison function. The following must be true for all x, y, z in a :

    • cmp x y > 0 if and only if cmp y x < 0
    • if cmp x y >= 0 and cmp y z >= 0 then cmp x z >= 0

    When sort returns, a contains the same elements as before, reordered in such a way that for all i and j valid indices of a :

    • cmp a.(i) a.(j) >= 0 if and only if i >= j
    val stable_sort : (float -> float -> int) -> t -> unit

    Same as sort, but the sorting algorithm is stable (i.e. elements that compare equal are kept in their original order) and not guaranteed to run in constant heap space.

    The current implementation uses Merge Sort. It uses a temporary floatarray of length n/2, where n is the length of the floatarray. It is usually faster than the current implementation of sort.

    val fast_sort : (float -> float -> int) -> t -> unit

    Same as sort or stable_sort, whichever is faster on typical input.

    val shuffle : rand:(int -> int) -> t -> unit

    shuffle rand a randomly permutes a's elements using rand for randomness. The distribution of permutations is uniform.

    rand must be such that a call to rand n returns a uniformly distributed random number in the range [0;n-1]. Random.int can be used for this (do not forget to initialize the generator).

    • since 5.2

    Float arrays and Sequences

    val to_seq : t -> float Seq.t

    Iterate on the floatarray, in increasing order. Modifications of the floatarray during iteration will be reflected in the sequence.

    val to_seqi : t -> (int * float) Seq.t

    Iterate on the floatarray, in increasing order, yielding indices along elements. Modifications of the floatarray during iteration will be reflected in the sequence.

    val of_seq : float Seq.t -> t

    Create an array from the generator.

    val map_to_array : (float -> 'a) -> t -> 'a array

    map_to_array f a applies function f to all the elements of a, and builds an array with the results returned by f: [| f a.(0); f a.(1); ...; f a.(length a - 1) |].

    val map_from_array : ('a -> float) -> 'a array -> t

    map_from_array f a applies function f to all the elements of a, and builds a floatarray with the results returned by f.

    Arrays and concurrency safety

    Care must be taken when concurrently accessing float arrays from multiple domains: accessing an array will never crash a program, but unsynchronized accesses might yield surprising (non-sequentially-consistent) results.

    Atomicity

    Every float array operation that accesses more than one array element is not atomic. This includes iteration, scanning, sorting, splitting and combining arrays.

    For example, consider the following program:

    let size = 100_000_000
+let a = Float.Array.make size 1.
+let update a f () =
+   Float.Array.iteri (fun i x -> Float.Array.set a i (f x)) a
+let d1 = Domain.spawn (update a (fun x -> x +. 1.))
+let d2 = Domain.spawn (update a (fun x ->  2. *. x +. 1.))
+let () = Domain.join d1; Domain.join d2

    After executing this code, each field of the float array a is either 2., 3., 4. or 5.. If atomicity is required, then the user must implement their own synchronization (for example, using Mutex.t).

    Data races

    If two domains only access disjoint parts of the array, then the observed behaviour is the equivalent to some sequential interleaving of the operations from the two domains.

    A data race is said to occur when two domains access the same array element without synchronization and at least one of the accesses is a write. In the absence of data races, the observed behaviour is equivalent to some sequential interleaving of the operations from different domains.

    Whenever possible, data races should be avoided by using synchronization to mediate the accesses to the array elements.

    Indeed, in the presence of data races, programs will not crash but the observed behaviour may not be equivalent to any sequential interleaving of operations from different domains. Nevertheless, even in the presence of data races, a read operation will return the value of some prior write to that location with a few exceptions.

    Tearing

    Float arrays have two supplementary caveats in the presence of data races.

    First, the blit operation might copy an array byte-by-byte. Data races between such a blit operation and another operation might produce surprising values due to tearing: partial writes interleaved with other operations can create float values that would not exist with a sequential execution.

    For instance, at the end of

    let zeros = Float.Array.make size 0.
+let max_floats = Float.Array.make size Float.max_float
+let res = Float.Array.copy zeros
+let d1 = Domain.spawn (fun () -> Float.Array.blit zeros 0 res 0 size)
+let d2 = Domain.spawn (fun () -> Float.Array.blit max_floats 0 res 0 size)
+let () = Domain.join d1; Domain.join d2

    the res float array might contain values that are neither 0. nor max_float.

    Second, on 32-bit architectures, getting or setting a field involves two separate memory accesses. In the presence of data races, the user may observe tearing on any operation.

    diff --git a/ocaml/Stdlib/Float/ArrayLabels/index.html b/ocaml/Stdlib/Float/ArrayLabels/index.html new file mode 100644 index 0000000..f287a30 --- /dev/null +++ b/ocaml/Stdlib/Float/ArrayLabels/index.html @@ -0,0 +1,13 @@ + +ArrayLabels (ocaml.Stdlib.Float.ArrayLabels)

    Module Float.ArrayLabels

    Float arrays with packed representation (labeled functions).

    type t = floatarray

    The type of float arrays with packed representation.

    • since 4.08
    val length : t -> int

    Return the length (number of elements) of the given floatarray.

    val get : t -> int -> float

    get a n returns the element number n of floatarray a.

    val set : t -> int -> float -> unit

    set a n x modifies floatarray a in place, replacing element number n with x.

    val make : int -> float -> t

    make n x returns a fresh floatarray of length n, initialized with x.

    val create : int -> t

    create n returns a fresh floatarray of length n, with uninitialized data.

    val init : int -> f:(int -> float) -> t

    init n ~f returns a fresh floatarray of length n, with element number i initialized to the result of f i. In other terms, init n ~f tabulates the results of f applied to the integers 0 to n-1.

    val make_matrix : dimx:int -> dimy:int -> float -> t array

    make_matrix ~dimx ~dimy e returns a two-dimensional array (an array of arrays) with first dimension dimx and second dimension dimy, where all elements are initialized with e.

    • since 5.2
    val init_matrix : dimx:int -> dimy:int -> f:(int -> int -> float) -> t array

    init_matrix ~dimx ~dimy ~f returns a two-dimensional array (an array of arrays) with first dimension dimx and second dimension dimy, where the element at index (x,y) is initialized with f x y.

    • since 5.2
    val append : t -> t -> t

    append v1 v2 returns a fresh floatarray containing the concatenation of the floatarrays v1 and v2.

    val concat : t list -> t

    Same as append, but concatenates a list of floatarrays.

    val sub : t -> pos:int -> len:int -> t

    sub a ~pos ~len returns a fresh floatarray of length len, containing the elements number pos to pos + len - 1 of floatarray a.

    • raises Invalid_argument

      if pos and len do not designate a valid subarray of a; that is, if pos < 0, or len < 0, or pos + len > length a.

    val copy : t -> t

    copy a returns a copy of a, that is, a fresh floatarray containing the same elements as a.

    val fill : t -> pos:int -> len:int -> float -> unit

    fill a ~pos ~len x modifies the floatarray a in place, storing x in elements number pos to pos + len - 1.

    val blit : src:t -> src_pos:int -> dst:t -> dst_pos:int -> len:int -> unit

    blit ~src ~src_pos ~dst ~dst_pos ~len copies len elements from floatarray src, starting at element number src_pos, to floatarray dst, starting at element number dst_pos. It works correctly even if src and dst are the same floatarray, and the source and destination chunks overlap.

    • raises Invalid_argument

      if src_pos and len do not designate a valid subarray of src, or if dst_pos and len do not designate a valid subarray of dst.

    val to_list : t -> float list

    to_list a returns the list of all the elements of a.

    val of_list : float list -> t

    of_list l returns a fresh floatarray containing the elements of l.

    • raises Invalid_argument

      if the length of l is greater than Sys.max_floatarray_length.

    Iterators

    val iter : f:(float -> unit) -> t -> unit

    iter ~f a applies function f in turn to all the elements of a. It is equivalent to f a.(0); f a.(1); ...; f a.(length a - 1); ().

    val iteri : f:(int -> float -> unit) -> t -> unit

    Same as iter, but the function is applied with the index of the element as first argument, and the element itself as second argument.

    val map : f:(float -> float) -> t -> t

    map ~f a applies function f to all the elements of a, and builds a floatarray with the results returned by f.

    val map_inplace : f:(float -> float) -> t -> unit

    map_inplace f a applies function f to all elements of a, and updates their values in place.

    • since 5.1
    val mapi : f:(int -> float -> float) -> t -> t

    Same as map, but the function is applied to the index of the element as first argument, and the element itself as second argument.

    val mapi_inplace : f:(int -> float -> float) -> t -> unit

    Same as map_inplace, but the function is applied to the index of the element as first argument, and the element itself as second argument.

    • since 5.1
    val fold_left : f:('acc -> float -> 'acc) -> init:'acc -> t -> 'acc

    fold_left ~f x ~init computes f (... (f (f x init.(0)) init.(1)) ...) init.(n-1), where n is the length of the floatarray init.

    val fold_right : f:(float -> 'acc -> 'acc) -> t -> init:'acc -> 'acc

    fold_right f a init computes f a.(0) (f a.(1) ( ... (f a.(n-1) init) ...)), where n is the length of the floatarray a.

    Iterators on two arrays

    val iter2 : f:(float -> float -> unit) -> t -> t -> unit

    Array.iter2 ~f a b applies function f to all the elements of a and b.

    val map2 : f:(float -> float -> float) -> t -> t -> t

    map2 ~f a b applies function f to all the elements of a and b, and builds a floatarray with the results returned by f: [| f a.(0) b.(0); ...; f a.(length a - 1) b.(length b - 1)|].

    Array scanning

    val for_all : f:(float -> bool) -> t -> bool

    for_all ~f [|a1; ...; an|] checks if all elements of the floatarray satisfy the predicate f. That is, it returns (f a1) && (f a2) && ... && (f an).

    val exists : f:(float -> bool) -> t -> bool

    exists f [|a1; ...; an|] checks if at least one element of the floatarray satisfies the predicate f. That is, it returns (f a1) || (f a2) || ... || (f an).

    val mem : float -> set:t -> bool

    mem a ~set is true if and only if there is an element of set that is structurally equal to a, i.e. there is an x in set such that compare a x = 0.

    val mem_ieee : float -> set:t -> bool

    Same as mem, but uses IEEE equality instead of structural equality.

    Array searching

    val find_opt : f:(float -> bool) -> t -> float option
    val find_index : f:(float -> bool) -> t -> int option

    find_index ~f a returns Some i, where i is the index of the first element of the array a that satisfies f x, if there is such an element.

    It returns None if there is no such element.

    • since 5.1
    val find_map : f:(float -> 'a option) -> t -> 'a option
    val find_mapi : f:(int -> float -> 'a option) -> t -> 'a option

    Same as find_map, but the predicate is applied to the index of the element as first argument (counting from 0), and the element itself as second argument.

    • since 5.1

    Sorting and shuffling

    val sort : cmp:(float -> float -> int) -> t -> unit

    Sort a floatarray in increasing order according to a comparison function. The comparison function must return 0 if its arguments compare as equal, a positive integer if the first is greater, and a negative integer if the first is smaller (see below for a complete specification). For example, Stdlib.compare is a suitable comparison function. After calling sort, the array is sorted in place in increasing order. sort is guaranteed to run in constant heap space and (at most) logarithmic stack space.

    The current implementation uses Heap Sort. It runs in constant stack space.

    Specification of the comparison function: Let a be the floatarray and cmp the comparison function. The following must be true for all x, y, z in a :

    • cmp x y > 0 if and only if cmp y x < 0
    • if cmp x y >= 0 and cmp y z >= 0 then cmp x z >= 0

    When sort returns, a contains the same elements as before, reordered in such a way that for all i and j valid indices of a :

    • cmp a.(i) a.(j) >= 0 if and only if i >= j
    val stable_sort : cmp:(float -> float -> int) -> t -> unit

    Same as sort, but the sorting algorithm is stable (i.e. elements that compare equal are kept in their original order) and not guaranteed to run in constant heap space.

    The current implementation uses Merge Sort. It uses a temporary floatarray of length n/2, where n is the length of the floatarray. It is usually faster than the current implementation of sort.

    val fast_sort : cmp:(float -> float -> int) -> t -> unit

    Same as sort or stable_sort, whichever is faster on typical input.

    val shuffle : rand:(int -> int) -> t -> unit

    shuffle ~rand a randomly permutes a's elements using rand for randomness. The distribution of permutations is uniform.

    rand must be such that a call to rand n returns a uniformly distributed random number in the range [0;n-1]. Random.int can be used for this (do not forget to initialize the generator).

    • since 5.2

    Float arrays and Sequences

    val to_seq : t -> float Seq.t

    Iterate on the floatarray, in increasing order. Modifications of the floatarray during iteration will be reflected in the sequence.

    val to_seqi : t -> (int * float) Seq.t

    Iterate on the floatarray, in increasing order, yielding indices along elements. Modifications of the floatarray during iteration will be reflected in the sequence.

    val of_seq : float Seq.t -> t

    Create an array from the generator.

    val map_to_array : f:(float -> 'a) -> t -> 'a array

    map_to_array ~f a applies function f to all the elements of a, and builds an array with the results returned by f: [| f a.(0); f a.(1); ...; f a.(length a - 1) |].

    val map_from_array : f:('a -> float) -> 'a array -> t

    map_from_array ~f a applies function f to all the elements of a, and builds a floatarray with the results returned by f.

    Arrays and concurrency safety

    Care must be taken when concurrently accessing float arrays from multiple domains: accessing an array will never crash a program, but unsynchronized accesses might yield surprising (non-sequentially-consistent) results.

    Atomicity

    Every float array operation that accesses more than one array element is not atomic. This includes iteration, scanning, sorting, splitting and combining arrays.

    For example, consider the following program:

    let size = 100_000_000
+let a = Float.ArrayLabels.make size 1.
+let update a f () =
+   Float.ArrayLabels.iteri ~f:(fun i x -> Float.Array.set a i (f x)) a
+let d1 = Domain.spawn (update a (fun x -> x +. 1.))
+let d2 = Domain.spawn (update a (fun x ->  2. *. x +. 1.))
+let () = Domain.join d1; Domain.join d2

    After executing this code, each field of the float array a is either 2., 3., 4. or 5.. If atomicity is required, then the user must implement their own synchronization (for example, using Mutex.t).

    Data races

    If two domains only access disjoint parts of the array, then the observed behaviour is the equivalent to some sequential interleaving of the operations from the two domains.

    A data race is said to occur when two domains access the same array element without synchronization and at least one of the accesses is a write. In the absence of data races, the observed behaviour is equivalent to some sequential interleaving of the operations from different domains.

    Whenever possible, data races should be avoided by using synchronization to mediate the accesses to the array elements.

    Indeed, in the presence of data races, programs will not crash but the observed behaviour may not be equivalent to any sequential interleaving of operations from different domains. Nevertheless, even in the presence of data races, a read operation will return the value of some prior write to that location with a few exceptions.

    Tearing

    Float arrays have two supplementary caveats in the presence of data races.

    First, the blit operation might copy an array byte-by-byte. Data races between such a blit operation and another operation might produce surprising values due to tearing: partial writes interleaved with other operations can create float values that would not exist with a sequential execution.

    For instance, at the end of

    let zeros = Float.Array.make size 0.
+let max_floats = Float.Array.make size Float.max_float
+let res = Float.Array.copy zeros
+let d1 = Domain.spawn (fun () -> Float.Array.blit zeros 0 res 0 size)
+let d2 = Domain.spawn (fun () -> Float.Array.blit max_floats 0 res 0 size)
+let () = Domain.join d1; Domain.join d2

    the res float array might contain values that are neither 0. nor max_float.

    Second, on 32-bit architectures, getting or setting a field involves two separate memory accesses. In the presence of data races, the user may observe tearing on any operation.

    diff --git a/ocaml/Stdlib/Float/index.html b/ocaml/Stdlib/Float/index.html new file mode 100644 index 0000000..9a65bf5 --- /dev/null +++ b/ocaml/Stdlib/Float/index.html @@ -0,0 +1,2 @@ + +Float (ocaml.Stdlib.Float)

    Module Stdlib.Float

    Floating-point arithmetic.

    OCaml's floating-point numbers follow the IEEE 754 standard, using double precision (64 bits) numbers. Floating-point operations never raise an exception on overflow, underflow, division by zero, etc. Instead, special IEEE numbers are returned as appropriate, such as infinity for 1.0 /. 0.0, neg_infinity for -1.0 /. 0.0, and nan ('not a number') for 0.0 /. 0.0. These special numbers then propagate through floating-point computations as expected: for instance, 1.0 /. infinity is 0.0, basic arithmetic operations (+., -., *., /.) with nan as an argument return nan, ...

    • since 4.07
    val zero : float

    The floating point 0.

    • since 4.08
    val one : float

    The floating-point 1.

    • since 4.08
    val minus_one : float

    The floating-point -1.

    • since 4.08
    val neg : float -> float

    Unary negation.

    val add : float -> float -> float

    Floating-point addition.

    val sub : float -> float -> float

    Floating-point subtraction.

    val mul : float -> float -> float

    Floating-point multiplication.

    val div : float -> float -> float

    Floating-point division.

    val fma : float -> float -> float -> float

    fma x y z returns x * y + z, with a best effort for computing this expression with a single rounding, using either hardware instructions (providing full IEEE compliance) or a software emulation.

    On 64-bit Cygwin, 64-bit mingw-w64 and MSVC 2017 and earlier, this function may be emulated owing to known bugs on limitations on these platforms. Note: since software emulation of the fma is costly, make sure that you are using hardware fma support if performance matters.

    • since 4.08
    val rem : float -> float -> float

    rem a b returns the remainder of a with respect to b. The returned value is a -. n *. b, where n is the quotient a /. b rounded towards zero to an integer.

    val succ : float -> float

    succ x returns the floating point number right after x i.e., the smallest floating-point number greater than x. See also next_after.

    • since 4.08
    val pred : float -> float

    pred x returns the floating-point number right before x i.e., the greatest floating-point number smaller than x. See also next_after.

    • since 4.08
    val abs : float -> float

    abs f returns the absolute value of f.

    val infinity : float

    Positive infinity.

    val neg_infinity : float

    Negative infinity.

    val nan : float

    A special floating-point value denoting the result of an undefined operation such as 0.0 /. 0.0. Stands for 'not a number'. Any floating-point operation with nan as argument returns nan as result, unless otherwise specified in IEEE 754 standard. As for floating-point comparisons, =, <, <=, > and >= return false and <> returns true if one or both of their arguments is nan.

    nan is quiet_nan since 5.1; it was a signaling NaN before.

    val signaling_nan : float

    Signaling NaN. The corresponding signals do not raise OCaml exception, but the value can be useful for interoperability with C libraries.

    • since 5.1
    val quiet_nan : float

    Quiet NaN.

    • since 5.1
    val pi : float

    The constant pi.

    val max_float : float

    The largest positive finite value of type float.

    val min_float : float

    The smallest positive, non-zero, non-denormalized value of type float.

    val epsilon : float

    The difference between 1.0 and the smallest exactly representable floating-point number greater than 1.0.

    val is_finite : float -> bool

    is_finite x is true if and only if x is finite i.e., not infinite and not nan.

    • since 4.08
    val is_infinite : float -> bool

    is_infinite x is true if and only if x is infinity or neg_infinity.

    • since 4.08
    val is_nan : float -> bool

    is_nan x is true if and only if x is not a number (see nan).

    • since 4.08
    val is_integer : float -> bool

    is_integer x is true if and only if x is an integer.

    • since 4.08
    val of_int : int -> float

    Convert an integer to floating-point.

    val to_int : float -> int

    Truncate the given floating-point number to an integer. The result is unspecified if the argument is nan or falls outside the range of representable integers.

    val of_string : string -> float

    Convert the given string to a float. The string is read in decimal (by default) or in hexadecimal (marked by 0x or 0X). The format of decimal floating-point numbers is [-] dd.ddd (e|E) [+|-] dd , where d stands for a decimal digit. The format of hexadecimal floating-point numbers is [-] 0(x|X) hh.hhh (p|P) [+|-] dd , where h stands for an hexadecimal digit and d for a decimal digit. In both cases, at least one of the integer and fractional parts must be given; the exponent part is optional. The _ (underscore) character can appear anywhere in the string and is ignored. Depending on the execution platforms, other representations of floating-point numbers can be accepted, but should not be relied upon.

    • raises Failure

      if the given string is not a valid representation of a float.

    val of_string_opt : string -> float option

    Same as of_string, but returns None instead of raising.

    val to_string : float -> string

    Return a string representation of a floating-point number.

    This conversion can involve a loss of precision. For greater control over the manner in which the number is printed, see Printf.

    This function is an alias for Stdlib.string_of_float.

    type fpclass = fpclass =
    1. | FP_normal
      (*

      Normal number, none of the below

      *)
    2. | FP_subnormal
      (*

      Number very close to 0.0, has reduced precision

      *)
    3. | FP_zero
      (*

      Number is 0.0 or -0.0

      *)
    4. | FP_infinite
      (*

      Number is positive or negative infinity

      *)
    5. | FP_nan
      (*

      Not a number: result of an undefined operation

      *)

    The five classes of floating-point numbers, as determined by the classify_float function.

    val classify_float : float -> fpclass

    Return the class of the given floating-point number: normal, subnormal, zero, infinite, or not a number.

    val pow : float -> float -> float

    Exponentiation.

    val sqrt : float -> float

    Square root.

    val cbrt : float -> float

    Cube root.

    • since 4.13
    val exp : float -> float

    Exponential.

    val exp2 : float -> float

    Base 2 exponential function.

    • since 4.13
    val log : float -> float

    Natural logarithm.

    val log10 : float -> float

    Base 10 logarithm.

    val log2 : float -> float

    Base 2 logarithm.

    • since 4.13
    val expm1 : float -> float

    expm1 x computes exp x -. 1.0, giving numerically-accurate results even if x is close to 0.0.

    val log1p : float -> float

    log1p x computes log(1.0 +. x) (natural logarithm), giving numerically-accurate results even if x is close to 0.0.

    val cos : float -> float

    Cosine. Argument is in radians.

    val sin : float -> float

    Sine. Argument is in radians.

    val tan : float -> float

    Tangent. Argument is in radians.

    val acos : float -> float

    Arc cosine. The argument must fall within the range [-1.0, 1.0]. Result is in radians and is between 0.0 and pi.

    val asin : float -> float

    Arc sine. The argument must fall within the range [-1.0, 1.0]. Result is in radians and is between -pi/2 and pi/2.

    val atan : float -> float

    Arc tangent. Result is in radians and is between -pi/2 and pi/2.

    val atan2 : float -> float -> float

    atan2 y x returns the arc tangent of y /. x. The signs of x and y are used to determine the quadrant of the result. Result is in radians and is between -pi and pi.

    val hypot : float -> float -> float

    hypot x y returns sqrt(x *. x +. y *. y), that is, the length of the hypotenuse of a right-angled triangle with sides of length x and y, or, equivalently, the distance of the point (x,y) to origin. If one of x or y is infinite, returns infinity even if the other is nan.

    val cosh : float -> float

    Hyperbolic cosine. Argument is in radians.

    val sinh : float -> float

    Hyperbolic sine. Argument is in radians.

    val tanh : float -> float

    Hyperbolic tangent. Argument is in radians.

    val acosh : float -> float

    Hyperbolic arc cosine. The argument must fall within the range [1.0, inf]. Result is in radians and is between 0.0 and inf.

    • since 4.13
    val asinh : float -> float

    Hyperbolic arc sine. The argument and result range over the entire real line. Result is in radians.

    • since 4.13
    val atanh : float -> float

    Hyperbolic arc tangent. The argument must fall within the range [-1.0, 1.0]. Result is in radians and ranges over the entire real line.

    • since 4.13
    val erf : float -> float

    Error function. The argument ranges over the entire real line. The result is always within [-1.0, 1.0].

    • since 4.13
    val erfc : float -> float

    Complementary error function (erfc x = 1 - erf x). The argument ranges over the entire real line. The result is always within [-1.0, 1.0].

    • since 4.13
    val trunc : float -> float

    trunc x rounds x to the nearest integer whose absolute value is less than or equal to x.

    • since 4.08
    val round : float -> float

    round x rounds x to the nearest integer with ties (fractional values of 0.5) rounded away from zero, regardless of the current rounding direction. If x is an integer, +0., -0., nan, or infinite, x itself is returned.

    On 64-bit mingw-w64, this function may be emulated owing to a bug in the C runtime library (CRT) on this platform.

    • since 4.08
    val ceil : float -> float

    Round above to an integer value. ceil f returns the least integer value greater than or equal to f. The result is returned as a float.

    val floor : float -> float

    Round below to an integer value. floor f returns the greatest integer value less than or equal to f. The result is returned as a float.

    val next_after : float -> float -> float

    next_after x y returns the next representable floating-point value following x in the direction of y. More precisely, if y is greater (resp. less) than x, it returns the smallest (resp. largest) representable number greater (resp. less) than x. If x equals y, the function returns y. If x or y is nan, a nan is returned. Note that next_after max_float infinity = infinity and that next_after 0. infinity is the smallest denormalized positive number. If x is the smallest denormalized positive number, next_after x 0. = 0.

    • since 4.08
    val copy_sign : float -> float -> float

    copy_sign x y returns a float whose absolute value is that of x and whose sign is that of y. If x is nan, returns nan. If y is nan, returns either x or -. x, but it is not specified which.

    val sign_bit : float -> bool

    sign_bit x is true if and only if the sign bit of x is set. For example sign_bit 1. and signbit 0. are false while sign_bit (-1.) and sign_bit (-0.) are true.

    • since 4.08
    val frexp : float -> float * int

    frexp f returns the pair of the significant and the exponent of f. When f is zero, the significant x and the exponent n of f are equal to zero. When f is non-zero, they are defined by f = x *. 2 ** n and 0.5 <= x < 1.0.

    val ldexp : float -> int -> float

    ldexp x n returns x *. 2 ** n.

    val modf : float -> float * float

    modf f returns the pair of the fractional and integral part of f.

    type t = float

    An alias for the type of floating-point numbers.

    val compare : t -> t -> int

    compare x y returns 0 if x is equal to y, a negative integer if x is less than y, and a positive integer if x is greater than y. compare treats nan as equal to itself and less than any other float value. This treatment of nan ensures that compare defines a total ordering relation.

    val equal : t -> t -> bool

    The equal function for floating-point numbers, compared using compare.

    val min : t -> t -> t

    min x y returns the minimum of x and y. It returns nan when x or y is nan. Moreover min (-0.) (+0.) = -0.

    • since 4.08
    val max : float -> float -> float

    max x y returns the maximum of x and y. It returns nan when x or y is nan. Moreover max (-0.) (+0.) = +0.

    • since 4.08
    val min_max : float -> float -> float * float

    min_max x y is (min x y, max x y), just more efficient.

    • since 4.08
    val min_num : t -> t -> t

    min_num x y returns the minimum of x and y treating nan as missing values. If both x and y are nan, nan is returned. Moreover min_num (-0.) (+0.) = -0.

    • since 4.08
    val max_num : t -> t -> t

    max_num x y returns the maximum of x and y treating nan as missing values. If both x and y are nan nan is returned. Moreover max_num (-0.) (+0.) = +0.

    • since 4.08
    val min_max_num : float -> float -> float * float

    min_max_num x y is (min_num x y, max_num x y), just more efficient. Note that in particular min_max_num x nan = (x, x) and min_max_num nan y = (y, y).

    • since 4.08
    val seeded_hash : int -> t -> int

    A seeded hash function for floats, with the same output value as Hashtbl.seeded_hash. This function allows this module to be passed as argument to the functor Hashtbl.MakeSeeded.

    • since 5.1
    val hash : t -> int

    An unseeded hash function for floats, with the same output value as Hashtbl.hash. This function allows this module to be passed as argument to the functor Hashtbl.Make.

    module Array : sig ... end

    Float arrays with packed representation.

    module ArrayLabels : sig ... end

    Float arrays with packed representation (labeled functions).

    diff --git a/ocaml/Stdlib/Format/index.html b/ocaml/Stdlib/Format/index.html new file mode 100644 index 0000000..cac205e --- /dev/null +++ b/ocaml/Stdlib/Format/index.html @@ -0,0 +1,141 @@ + +Format (ocaml.Stdlib.Format)

    Module Stdlib.Format

    Pretty-printing.

    If you are new to this module, see the examples below.

    This module implements a pretty-printing facility to format values within 'pretty-printing boxes' and 'semantic tags' combined with a set of printf-like functions. The pretty-printer splits lines at specified break hints, and indents lines according to the box structure. Similarly, semantic tags can be used to decouple text presentation from its contents.

    This pretty-printing facility is implemented as an overlay on top of abstract formatters which provide basic output functions. Some formatters are predefined, notably:

    Most functions in the Format module come in two variants: a short version that operates on the current domain's standard formatter as obtained using get_std_formatter and the generic version prefixed by pp_ that takes a formatter as its first argument. For the version that operates on the current domain's standard formatter, the call to get_std_formatter is delayed until the last argument is received.

    More formatters can be created with formatter_of_out_channel, formatter_of_buffer, formatter_of_symbolic_output_buffer or using custom formatters.

    Warning: Since formatters contain mutable state, it is not thread-safe to use the same formatter on multiple domains in parallel without synchronization.

    If multiple domains write to the same output channel using the predefined formatters (as obtained by get_std_formatter or get_err_formatter), the output from the domains will be interleaved with each other at points where the formatters are flushed, such as with print_flush. This synchronization is not performed by formatters obtained from formatter_of_out_channel (on the standard out channels or others).

    Introduction

    You may consider this module as providing an extension to the printf facility to provide automatic line splitting. The addition of pretty-printing annotations to your regular printf format strings gives you fancy indentation and line breaks. Pretty-printing annotations are described below in the documentation of the function Format.fprintf.

    You may also use the explicit pretty-printing box management and printing functions provided by this module. This style is more basic but more verbose than the concise fprintf format strings.

    For instance, the sequence open_box 0; print_string "x ="; print_space (); print_int 1; close_box (); print_newline () that prints x = 1 within a pretty-printing box, can be abbreviated as printf "@[%s@ %i@]@." "x =" 1, or even shorter printf "@[x =@ %i@]@." 1.

    Rule of thumb for casual users of this library:

    • use simple pretty-printing boxes (as obtained by open_box 0);
    • use simple break hints as obtained by print_cut () that outputs a simple break hint, or by print_space () that outputs a space indicating a break hint;
    • once a pretty-printing box is open, display its material with basic printing functions (e. g. print_int and print_string);
    • when the material for a pretty-printing box has been printed, call close_box () to close the box;
    • at the end of pretty-printing, flush the pretty-printer to display all the remaining material, e.g. evaluate print_newline ().

    The behavior of pretty-printing commands is unspecified if there is no open pretty-printing box. Each box opened by one of the open_ functions below must be closed using close_box for proper formatting. Otherwise, some of the material printed in the boxes may not be output, or may be formatted incorrectly.

    In case of interactive use, each phrase is executed in the initial state of the standard pretty-printer: after each phrase execution, the interactive system closes all open pretty-printing boxes, flushes all pending text, and resets the standard pretty-printer.

    Warning: mixing calls to pretty-printing functions of this module with calls to Stdlib low level output functions is error prone.

    The pretty-printing functions output material that is delayed in the pretty-printer queue and stacks in order to compute proper line splitting. In contrast, basic I/O output functions write directly in their output device. As a consequence, the output of a basic I/O function may appear before the output of a pretty-printing function that has been called before. For instance, Stdlib.print_string "<"; Format.print_string "PRETTY"; Stdlib.print_string ">"; Format.print_string "TEXT"; leads to output <>PRETTYTEXT.

    Formatters

    type formatter

    Abstract data corresponding to a pretty-printer (also called a formatter) and all its machinery. See also Defining formatters.

    Pretty-printing boxes

    The pretty-printing engine uses the concepts of pretty-printing box and break hint to drive indentation and line splitting behavior of the pretty-printer.

    Each different pretty-printing box kind introduces a specific line splitting policy:

    • within an horizontal box, break hints never split the line (but the line may be split in a box nested deeper),
    • within a vertical box, break hints always split the line,
    • within an horizontal/vertical box, if the box fits on the current line then break hints never split the line, otherwise break hint always split the line,
    • within a compacting box, a break hint never splits the line, unless there is no more room on the current line.

    Note that line splitting policy is box specific: the policy of a box does not rule the policy of inner boxes. For instance, if a vertical box is nested in an horizontal box, all break hints within the vertical box will split the line.

    Moreover, opening a box after the maximum indentation limit splits the line whether or not the box would end up fitting on the line.

    val pp_open_box : formatter -> int -> unit
    val open_box : int -> unit

    pp_open_box ppf d opens a new compacting pretty-printing box with offset d in the formatter ppf.

    Within this box, the pretty-printer prints as much as possible material on every line.

    A break hint splits the line if there is no more room on the line to print the remainder of the box.

    Within this box, the pretty-printer emphasizes the box structure: if a structural box does not fit fully on a simple line, a break hint also splits the line if the splitting ``moves to the left'' (i.e. the new line gets an indentation smaller than the one of the current line).

    This box is the general purpose pretty-printing box.

    If the pretty-printer splits the line in the box, offset d is added to the current indentation.

    val pp_close_box : formatter -> unit -> unit
    val close_box : unit -> unit

    Closes the most recently open pretty-printing box.

    val pp_open_hbox : formatter -> unit -> unit
    val open_hbox : unit -> unit

    pp_open_hbox ppf () opens a new 'horizontal' pretty-printing box.

    This box prints material on a single line.

    Break hints in a horizontal box never split the line. (Line splitting may still occur inside boxes nested deeper).

    val pp_open_vbox : formatter -> int -> unit
    val open_vbox : int -> unit

    pp_open_vbox ppf d opens a new 'vertical' pretty-printing box with offset d.

    This box prints material on as many lines as break hints in the box.

    Every break hint in a vertical box splits the line.

    If the pretty-printer splits the line in the box, d is added to the current indentation.

    val pp_open_hvbox : formatter -> int -> unit
    val open_hvbox : int -> unit

    pp_open_hvbox ppf d opens a new 'horizontal/vertical' pretty-printing box with offset d.

    This box behaves as an horizontal box if it fits on a single line, otherwise it behaves as a vertical box.

    If the pretty-printer splits the line in the box, d is added to the current indentation.

    val pp_open_hovbox : formatter -> int -> unit
    val open_hovbox : int -> unit

    pp_open_hovbox ppf d opens a new 'horizontal-or-vertical' pretty-printing box with offset d.

    This box prints material as much as possible on every line.

    A break hint splits the line if there is no more room on the line to print the remainder of the box.

    If the pretty-printer splits the line in the box, d is added to the current indentation.

    Formatting functions

    val pp_print_string : formatter -> string -> unit
    val print_string : string -> unit

    pp_print_string ppf s prints s in the current pretty-printing box.

    val pp_print_bytes : formatter -> bytes -> unit
    val print_bytes : bytes -> unit

    pp_print_bytes ppf b prints b in the current pretty-printing box.

    • since 4.13
    val pp_print_as : formatter -> int -> string -> unit
    val print_as : int -> string -> unit

    pp_print_as ppf len s prints s in the current pretty-printing box. The pretty-printer formats s as if it were of length len.

    val pp_print_int : formatter -> int -> unit
    val print_int : int -> unit

    Print an integer in the current pretty-printing box.

    val pp_print_float : formatter -> float -> unit
    val print_float : float -> unit

    Print a floating point number in the current pretty-printing box.

    val pp_print_char : formatter -> char -> unit
    val print_char : char -> unit

    Print a character in the current pretty-printing box.

    val pp_print_bool : formatter -> bool -> unit
    val print_bool : bool -> unit

    Print a boolean in the current pretty-printing box.

    val pp_print_nothing : formatter -> unit -> unit

    Print nothing.

    • since 5.2

    Break hints

    A 'break hint' tells the pretty-printer to output some space or split the line whichever way is more appropriate to the current pretty-printing box splitting rules.

    Break hints are used to separate printing items and are mandatory to let the pretty-printer correctly split lines and indent items.

    Simple break hints are:

    • the 'space': output a space or split the line if appropriate,
    • the 'cut': split the line if appropriate.

    Note: the notions of space and line splitting are abstract for the pretty-printing engine, since those notions can be completely redefined by the programmer. However, in the pretty-printer default setting, ``output a space'' simply means printing a space character (ASCII code 32) and ``split the line'' means printing a newline character (ASCII code 10).

    val pp_print_space : formatter -> unit -> unit
    val print_space : unit -> unit

    pp_print_space ppf () emits a 'space' break hint: the pretty-printer may split the line at this point, otherwise it prints one space.

    pp_print_space ppf () is equivalent to pp_print_break ppf 1 0.

    val pp_print_cut : formatter -> unit -> unit
    val print_cut : unit -> unit

    pp_print_cut ppf () emits a 'cut' break hint: the pretty-printer may split the line at this point, otherwise it prints nothing.

    pp_print_cut ppf () is equivalent to pp_print_break ppf 0 0.

    val pp_print_break : formatter -> int -> int -> unit
    val print_break : int -> int -> unit

    pp_print_break ppf nspaces offset emits a 'full' break hint: the pretty-printer may split the line at this point, otherwise it prints nspaces spaces.

    If the pretty-printer splits the line, offset is added to the current indentation.

    val pp_print_custom_break : + formatter -> + fits:(string * int * string) -> + breaks:(string * int * string) -> + unit

    pp_print_custom_break ppf ~fits:(s1, n, s2) ~breaks:(s3, m, s4) emits a custom break hint: the pretty-printer may split the line at this point.

    If it does not split the line, then the s1 is emitted, then n spaces, then s2.

    If it splits the line, then it emits the s3 string, then an indent (according to the box rules), then an offset of m spaces, then the s4 string.

    While n and m are handled by formatter_out_functions.out_indent, the strings will be handled by formatter_out_functions.out_string. This allows for a custom formatter that handles indentation distinctly, for example, outputs <br/> tags or &nbsp; entities.

    The custom break is useful if you want to change which visible (non-whitespace) characters are printed in case of break or no break. For example, when printing a list [a; b; c] , you might want to add a trailing semicolon when it is printed vertically:

    [
+  a;
+  b;
+  c;
+]

    You can do this as follows:

    printf "@[<v 0>[@;<0 2>@[<v 0>a;@,b;@,c@]%t]@]@\n"
+  (pp_print_custom_break ~fits:("", 0, "") ~breaks:(";", 0, ""))
    • since 4.08
    val pp_force_newline : formatter -> unit -> unit
    val force_newline : unit -> unit

    Force a new line in the current pretty-printing box.

    The pretty-printer must split the line at this point,

    Not the normal way of pretty-printing, since imperative line splitting may interfere with current line counters and box size calculation. Using break hints within an enclosing vertical box is a better alternative.

    val pp_print_if_newline : formatter -> unit -> unit
    val print_if_newline : unit -> unit

    Execute the next formatting command if the preceding line has just been split. Otherwise, ignore the next formatting command.

    Pretty-printing termination

    val pp_print_flush : formatter -> unit -> unit
    val print_flush : unit -> unit

    End of pretty-printing: resets the pretty-printer to initial state.

    All open pretty-printing boxes are closed, all pending text is printed. In addition, the pretty-printer low level output device is flushed to ensure that all pending text is really displayed.

    Note: never use print_flush in the normal course of a pretty-printing routine, since the pretty-printer uses a complex buffering machinery to properly indent the output; manually flushing those buffers at random would conflict with the pretty-printer strategy and result to poor rendering.

    Only consider using print_flush when displaying all pending material is mandatory (for instance in case of interactive use when you want the user to read some text) and when resetting the pretty-printer state will not disturb further pretty-printing.

    Warning: If the output device of the pretty-printer is an output channel, repeated calls to print_flush means repeated calls to Stdlib.flush to flush the out channel; these explicit flush calls could foil the buffering strategy of output channels and could dramatically impact efficiency.

    val pp_print_newline : formatter -> unit -> unit
    val print_newline : unit -> unit

    End of pretty-printing: resets the pretty-printer to initial state.

    All open pretty-printing boxes are closed, all pending text is printed.

    Equivalent to print_flush with a new line emitted on the pretty-printer low-level output device immediately before the device is flushed. See corresponding words of caution for print_flush.

    Note: this is not the normal way to output a new line; the preferred method is using break hints within a vertical pretty-printing box.

    Margin

    val pp_infinity : int

    pp_infinity is the maximal size of the margin. Its exact value is implementation dependent but is guaranteed to be greater than 109.

    • since 5.2
    val pp_set_margin : formatter -> int -> unit
    val set_margin : int -> unit

    pp_set_margin ppf d sets the right margin to d (in characters): the pretty-printer splits lines that overflow the right margin according to the break hints given. Setting the margin to d means that the formatting engine aims at printing at most d-1 characters per line. Nothing happens if d is smaller than 2. If d >= pp_infinity, the right margin is set to pp_infinity - 1. If d is less than the current maximum indentation limit, the maximum indentation limit is decreased while trying to preserve a minimal ratio max_indent/margin>=50% and if possible the current difference margin - max_indent.

    See also pp_set_geometry.

    val pp_get_margin : formatter -> unit -> int
    val get_margin : unit -> int

    Returns the position of the right margin.

    Maximum indentation limit

    val pp_set_max_indent : formatter -> int -> unit
    val set_max_indent : int -> unit

    pp_set_max_indent ppf d sets the maximum indentation limit of lines to d (in characters): once this limit is reached, new pretty-printing boxes are rejected to the left, unless the enclosing box fully fits on the current line. As an illustration,

     set_margin 10; set_max_indent 5; printf "@[123456@[7@]89A@]@."

    yields

      123456
+  789A

    because the nested box "@[7@]" is opened after the maximum indentation limit (7>5) and its parent box does not fit on the current line. Either decreasing the length of the parent box to make it fit on a line:

     printf "@[123456@[7@]89@]@."

    or opening an intermediary box before the maximum indentation limit which fits on the current line

     printf "@[123@[456@[7@]89@]A@]@."

    avoids the rejection to the left of the inner boxes and print respectively "123456789" and "123456789A" . Note also that vertical boxes never fit on a line whereas horizontal boxes always fully fit on the current line. Opening a box may split a line whereas the contents may have fit. If this behavior is problematic, it can be curtailed by setting the maximum indentation limit to margin - 1. Note that setting the maximum indentation limit to margin is invalid.

    Nothing happens if d is smaller than 2.

    If d is greater than the current margin, it is ignored, and the current maximum indentation limit is kept.

    See also pp_set_geometry.

    val pp_get_max_indent : formatter -> unit -> int
    val get_max_indent : unit -> int

    Return the maximum indentation limit (in characters).

    Geometry

    Geometric functions can be used to manipulate simultaneously the coupled variables, margin and maximum indentation limit.

    type geometry = {
    1. max_indent : int;
    2. margin : int;
    }
    • since 4.08
    val check_geometry : geometry -> bool

    Check if the formatter geometry is valid: 1 < max_indent < margin < pp_infinity

    • since 4.08
    val pp_set_geometry : formatter -> max_indent:int -> margin:int -> unit
    val set_geometry : max_indent:int -> margin:int -> unit
    val pp_safe_set_geometry : formatter -> max_indent:int -> margin:int -> unit
    val safe_set_geometry : max_indent:int -> margin:int -> unit

    pp_set_geometry ppf ~max_indent ~margin sets both the margin and maximum indentation limit for ppf.

    When 1 < max_indent < margin < pp_infinity, pp_set_geometry ppf ~max_indent ~margin is equivalent to pp_set_margin ppf margin; pp_set_max_indent ppf max_indent; and avoids the subtly incorrect pp_set_max_indent ppf max_indent; pp_set_margin ppf margin;

    Outside of this domain, pp_set_geometry raises an invalid argument exception whereas pp_safe_set_geometry does nothing.

    • since 4.08
    val pp_update_geometry : formatter -> (geometry -> geometry) -> unit

    pp_update_geometry ppf (fun geo -> { geo with ... }) lets you update a formatter's geometry in a way that is robust to extension of the geometry record with new fields.

    Raises an invalid argument exception if the returned geometry does not satisfy check_geometry.

    • since 4.11
    val update_geometry : (geometry -> geometry) -> unit
    val pp_get_geometry : formatter -> unit -> geometry
    val get_geometry : unit -> geometry

    Return the current geometry of the formatter

    • since 4.08

    Maximum formatting depth

    The maximum formatting depth is the maximum number of pretty-printing boxes simultaneously open.

    Material inside boxes nested deeper is printed as an ellipsis (more precisely as the text returned by get_ellipsis_text ()).

    val pp_set_max_boxes : formatter -> int -> unit
    val set_max_boxes : int -> unit

    pp_set_max_boxes ppf max sets the maximum number of pretty-printing boxes simultaneously open.

    Material inside boxes nested deeper is printed as an ellipsis (more precisely as the text returned by get_ellipsis_text ()).

    Nothing happens if max is smaller than 2.

    val pp_get_max_boxes : formatter -> unit -> int
    val get_max_boxes : unit -> int

    Returns the maximum number of pretty-printing boxes allowed before ellipsis.

    val pp_over_max_boxes : formatter -> unit -> bool
    val over_max_boxes : unit -> bool

    Tests if the maximum number of pretty-printing boxes allowed have already been opened.

    Tabulation boxes

    A tabulation box prints material on lines divided into cells of fixed length. A tabulation box provides a simple way to display vertical columns of left adjusted text.

    This box features command set_tab to define cell boundaries, and command print_tab to move from cell to cell and split the line when there is no more cells to print on the line.

    Note: printing within tabulation box is line directed, so arbitrary line splitting inside a tabulation box leads to poor rendering. Yet, controlled use of tabulation boxes allows simple printing of columns within module Format.

    val pp_open_tbox : formatter -> unit -> unit
    val open_tbox : unit -> unit

    open_tbox () opens a new tabulation box.

    This box prints lines separated into cells of fixed width.

    Inside a tabulation box, special tabulation markers defines points of interest on the line (for instance to delimit cell boundaries). Function Format.set_tab sets a tabulation marker at insertion point.

    A tabulation box features specific tabulation breaks to move to next tabulation marker or split the line. Function Format.print_tbreak prints a tabulation break.

    val pp_close_tbox : formatter -> unit -> unit
    val close_tbox : unit -> unit

    Closes the most recently opened tabulation box.

    val pp_set_tab : formatter -> unit -> unit
    val set_tab : unit -> unit

    Sets a tabulation marker at current insertion point.

    val pp_print_tab : formatter -> unit -> unit
    val print_tab : unit -> unit

    print_tab () emits a 'next' tabulation break hint: if not already set on a tabulation marker, the insertion point moves to the first tabulation marker on the right, or the pretty-printer splits the line and insertion point moves to the leftmost tabulation marker.

    It is equivalent to print_tbreak 0 0.

    val pp_print_tbreak : formatter -> int -> int -> unit
    val print_tbreak : int -> int -> unit

    print_tbreak nspaces offset emits a 'full' tabulation break hint.

    If not already set on a tabulation marker, the insertion point moves to the first tabulation marker on the right and the pretty-printer prints nspaces spaces.

    If there is no next tabulation marker on the right, the pretty-printer splits the line at this point, then insertion point moves to the leftmost tabulation marker of the box.

    If the pretty-printer splits the line, offset is added to the current indentation.

    Ellipsis

    val pp_set_ellipsis_text : formatter -> string -> unit
    val set_ellipsis_text : string -> unit

    Set the text of the ellipsis printed when too many pretty-printing boxes are open (a single dot, ., by default).

    val pp_get_ellipsis_text : formatter -> unit -> string
    val get_ellipsis_text : unit -> string

    Return the text of the ellipsis.

    Semantic tags

    type stag = ..

    Semantic tags (or simply tags) are user's defined annotations to associate user's specific operations to printed entities.

    Common usage of semantic tags is text decoration to get specific font or text size rendering for a display device, or marking delimitation of entities (e.g. HTML or TeX elements or terminal escape sequences). More sophisticated usage of semantic tags could handle dynamic modification of the pretty-printer behavior to properly print the material within some specific tags. For instance, we can define an RGB tag like so:

    type stag += RGB of {r:int;g:int;b:int}

    In order to properly delimit printed entities, a semantic tag must be opened before and closed after the entity. Semantic tags must be properly nested like parentheses using pp_open_stag and pp_close_stag.

    Tag specific operations occur any time a tag is opened or closed, At each occurrence, two kinds of operations are performed tag-marking and tag-printing:

    • The tag-marking operation is the simpler tag specific operation: it simply writes a tag specific string into the output device of the formatter. Tag-marking does not interfere with line-splitting computation.
    • The tag-printing operation is the more involved tag specific operation: it can print arbitrary material to the formatter. Tag-printing is tightly linked to the current pretty-printer operations.

    Roughly speaking, tag-marking is commonly used to get a better rendering of texts in the rendering device, while tag-printing allows fine tuning of printing routines to print the same entity differently according to the semantic tags (i.e. print additional material or even omit parts of the output).

    More precisely: when a semantic tag is opened or closed then both and successive 'tag-printing' and 'tag-marking' operations occur:

    • Tag-printing a semantic tag means calling the formatter specific function print_open_stag (resp. print_close_stag) with the name of the tag as argument: that tag-printing function can then print any regular material to the formatter (so that this material is enqueued as usual in the formatter queue for further line splitting computation).
    • Tag-marking a semantic tag means calling the formatter specific function mark_open_stag (resp. mark_close_stag) with the name of the tag as argument: that tag-marking function can then return the 'tag-opening marker' (resp. `tag-closing marker') for direct output into the output device of the formatter.

    Being written directly into the output device of the formatter, semantic tag marker strings are not considered as part of the printing material that drives line splitting (in other words, the length of the strings corresponding to tag markers is considered as zero for line splitting).

    Thus, semantic tag handling is in some sense transparent to pretty-printing and does not interfere with usual indentation. Hence, a single pretty-printing routine can output both simple 'verbatim' material or richer decorated output depending on the treatment of tags. By default, tags are not active, hence the output is not decorated with tag information. Once set_tags is set to true, the pretty-printer engine honors tags and decorates the output accordingly.

    Default tag-marking functions behave the HTML way: string tags are enclosed in "<" and ">" while other tags are ignored; hence, opening marker for tag string "t" is "<t>" and closing marker is "</t>".

    Default tag-printing functions just do nothing.

    Tag-marking and tag-printing functions are user definable and can be set by calling set_formatter_stag_functions.

    Semantic tag operations may be set on or off with set_tags. Tag-marking operations may be set on or off with set_mark_tags. Tag-printing operations may be set on or off with set_print_tags.

    • since 4.08
    type tag = string
    type stag +=
    1. | String_tag of tag
      (*

      String_tag s is a string tag s. String tags can be inserted either by explicitly using the constructor String_tag or by using the dedicated format syntax "@{<s> ... @}".

      • since 4.08
      *)
    val pp_open_stag : formatter -> stag -> unit
    val open_stag : stag -> unit

    pp_open_stag ppf t opens the semantic tag named t.

    The print_open_stag tag-printing function of the formatter is called with t as argument; then the opening tag marker for t, as given by mark_open_stag t, is written into the output device of the formatter.

    • since 4.08
    val pp_close_stag : formatter -> unit -> unit
    val close_stag : unit -> unit

    pp_close_stag ppf () closes the most recently opened semantic tag t.

    The closing tag marker, as given by mark_close_stag t, is written into the output device of the formatter; then the print_close_stag tag-printing function of the formatter is called with t as argument.

    • since 4.08
    val pp_set_tags : formatter -> bool -> unit
    val set_tags : bool -> unit

    pp_set_tags ppf b turns on or off the treatment of semantic tags (default is off).

    val pp_set_print_tags : formatter -> bool -> unit
    val set_print_tags : bool -> unit

    pp_set_print_tags ppf b turns on or off the tag-printing operations.

    val pp_set_mark_tags : formatter -> bool -> unit
    val set_mark_tags : bool -> unit

    pp_set_mark_tags ppf b turns on or off the tag-marking operations.

    val pp_get_print_tags : formatter -> unit -> bool
    val get_print_tags : unit -> bool

    Return the current status of tag-printing operations.

    val pp_get_mark_tags : formatter -> unit -> bool
    val get_mark_tags : unit -> bool

    Return the current status of tag-marking operations.

    val pp_set_formatter_out_channel : formatter -> out_channel -> unit

    Redirecting the standard formatter output

    val set_formatter_out_channel : out_channel -> unit

    Redirect the standard pretty-printer output to the given channel. (All the output functions of the standard formatter are set to the default output functions printing to the given channel.)

    set_formatter_out_channel is equivalent to pp_set_formatter_out_channel std_formatter.

    val pp_set_formatter_output_functions : + formatter -> + (string -> int -> int -> unit) -> + (unit -> unit) -> + unit
    val set_formatter_output_functions : + (string -> int -> int -> unit) -> + (unit -> unit) -> + unit

    pp_set_formatter_output_functions ppf out flush redirects the standard pretty-printer output functions to the functions out and flush.

    The out function performs all the pretty-printer string output. It is called with a string s, a start position p, and a number of characters n; it is supposed to output characters p to p + n - 1 of s.

    The flush function is called whenever the pretty-printer is flushed (via conversion %!, or pretty-printing indications @? or @., or using low level functions print_flush or print_newline).

    val pp_get_formatter_output_functions : + formatter -> + unit -> + (string -> int -> int -> unit) * (unit -> unit)
    val get_formatter_output_functions : + unit -> + (string -> int -> int -> unit) * (unit -> unit)

    Return the current output functions of the standard pretty-printer.

    Redefining formatter output

    The Format module is versatile enough to let you completely redefine the meaning of pretty-printing output: you may provide your own functions to define how to handle indentation, line splitting, and even printing of all the characters that have to be printed!

    Redefining output functions

    type formatter_out_functions = {
    1. out_string : string -> int -> int -> unit;
    2. out_flush : unit -> unit;
    3. out_newline : unit -> unit;
    4. out_spaces : int -> unit;
    5. out_indent : int -> unit;
      (*
      • since 4.06
      *)
    }

    The set of output functions specific to a formatter:

    • the out_string function performs all the pretty-printer string output. It is called with a string s, a start position p, and a number of characters n; it is supposed to output characters p to p + n - 1 of s.
    • the out_flush function flushes the pretty-printer output device.
    • out_newline is called to open a new line when the pretty-printer splits the line.
    • the out_spaces function outputs spaces when a break hint leads to spaces instead of a line split. It is called with the number of spaces to output.
    • the out_indent function performs new line indentation when the pretty-printer splits the line. It is called with the indentation value of the new line.

    By default:

    • fields out_string and out_flush are output device specific; (e.g. Stdlib.output_string and Stdlib.flush for a Stdlib.out_channel device, or Buffer.add_substring and Stdlib.ignore for a Buffer.t output device),
    • field out_newline is equivalent to out_string "\n" 0 1;
    • fields out_spaces and out_indent are equivalent to out_string (String.make n ' ') 0 n.
    • since 4.01
    val pp_set_formatter_out_functions : + formatter -> + formatter_out_functions -> + unit
    val set_formatter_out_functions : formatter_out_functions -> unit

    pp_set_formatter_out_functions ppf out_funs Set all the pretty-printer output functions of ppf to those of argument out_funs,

    This way, you can change the meaning of indentation (which can be something else than just printing space characters) and the meaning of new lines opening (which can be connected to any other action needed by the application at hand).

    Reasonable defaults for functions out_spaces and out_newline are respectively out_funs.out_string (String.make n ' ') 0 n and out_funs.out_string "\n" 0 1.

    • since 4.01
    val pp_get_formatter_out_functions : + formatter -> + unit -> + formatter_out_functions
    val get_formatter_out_functions : unit -> formatter_out_functions

    Return the current output functions of the pretty-printer, including line splitting and indentation functions. Useful to record the current setting and restore it afterwards.

    • since 4.01

    Redefining semantic tag operations

    type formatter_stag_functions = {
    1. mark_open_stag : stag -> string;
    2. mark_close_stag : stag -> string;
    3. print_open_stag : stag -> unit;
    4. print_close_stag : stag -> unit;
    }

    The semantic tag handling functions specific to a formatter: mark versions are the 'tag-marking' functions that associate a string marker to a tag in order for the pretty-printing engine to write those markers as 0 length tokens in the output device of the formatter. print versions are the 'tag-printing' functions that can perform regular printing when a tag is closed or opened.

    • since 4.08
    val pp_set_formatter_stag_functions : + formatter -> + formatter_stag_functions -> + unit
    val set_formatter_stag_functions : formatter_stag_functions -> unit

    pp_set_formatter_stag_functions ppf tag_funs changes the meaning of opening and closing semantic tag operations to use the functions in tag_funs when printing on ppf.

    When opening a semantic tag with name t, the string t is passed to the opening tag-marking function (the mark_open_stag field of the record tag_funs), that must return the opening tag marker for that name. When the next call to close_stag () happens, the semantic tag name t is sent back to the closing tag-marking function (the mark_close_stag field of record tag_funs), that must return a closing tag marker for that name.

    The print_ field of the record contains the tag-printing functions that are called at tag opening and tag closing time, to output regular material in the pretty-printer queue.

    • since 4.08
    val pp_get_formatter_stag_functions : + formatter -> + unit -> + formatter_stag_functions
    val get_formatter_stag_functions : unit -> formatter_stag_functions

    Return the current semantic tag operation functions of the standard pretty-printer.

    • since 4.08

    Defining formatters

    Defining new formatters permits unrelated output of material in parallel on several output devices. All the parameters of a formatter are local to the formatter: right margin, maximum indentation limit, maximum number of pretty-printing boxes simultaneously open, ellipsis, and so on, are specific to each formatter and may be fixed independently.

    For instance, given a Buffer.t buffer b, formatter_of_buffer b returns a new formatter using buffer b as its output device. Similarly, given a Stdlib.out_channel output channel oc, formatter_of_out_channel oc returns a new formatter using channel oc as its output device.

    Alternatively, given out_funs, a complete set of output functions for a formatter, then formatter_of_out_functions out_funs computes a new formatter using those functions for output.

    val formatter_of_out_channel : out_channel -> formatter

    formatter_of_out_channel oc returns a new formatter writing to the corresponding output channel oc.

    val synchronized_formatter_of_out_channel : + out_channel -> + formatter Domain.DLS.key

    synchronized_formatter_of_out_channel oc returns the key to the domain-local state that holds the domain-local formatter for writing to the corresponding output channel oc.

    When the formatter is used with multiple domains, the output from the domains will be interleaved with each other at points where the formatter is flushed, such as with print_flush.

    • alert unstable
    val std_formatter : formatter

    The initial domain's standard formatter to write to standard output.

    It is defined as formatter_of_out_channel Stdlib.stdout.

    val get_std_formatter : unit -> formatter

    get_std_formatter () returns the current domain's standard formatter used to write to standard output.

    • since 5.0
    val err_formatter : formatter

    The initial domain's formatter to write to standard error.

    It is defined as formatter_of_out_channel Stdlib.stderr.

    val get_err_formatter : unit -> formatter

    get_err_formatter () returns the current domain's formatter used to write to standard error.

    • since 5.0
    val formatter_of_buffer : Buffer.t -> formatter

    formatter_of_buffer b returns a new formatter writing to buffer b. At the end of pretty-printing, the formatter must be flushed using pp_print_flush or pp_print_newline, to print all the pending material into the buffer.

    val stdbuf : Buffer.t

    The initial domain's string buffer in which str_formatter writes.

    val get_stdbuf : unit -> Buffer.t

    get_stdbuf () returns the current domain's string buffer in which the current domain's string formatter writes.

    • since 5.0
    val str_formatter : formatter

    The initial domain's formatter to output to the stdbuf string buffer.

    str_formatter is defined as formatter_of_buffer stdbuf.

    val get_str_formatter : unit -> formatter

    The current domain's formatter to output to the current domains string buffer.

    • since 5.0
    val flush_str_formatter : unit -> string

    Returns the material printed with str_formatter of the current domain, flushes the formatter and resets the corresponding buffer.

    val make_formatter : + (string -> int -> int -> unit) -> + (unit -> unit) -> + formatter

    make_formatter out flush returns a new formatter that outputs with function out, and flushes with function flush.

    For instance,

      make_formatter
+    (Stdlib.output_substring oc)
+    (fun () -> Stdlib.flush oc)

    returns a formatter to the Stdlib.out_channel oc.

    val make_synchronized_formatter : + (string -> int -> int -> unit) -> + (unit -> unit) -> + formatter Domain.DLS.key

    make_synchronized_formatter out flush returns the key to the domain-local state that holds the domain-local formatter that outputs with function out, and flushes with function flush.

    When the formatter is used with multiple domains, the output from the domains will be interleaved with each other at points where the formatter is flushed, such as with print_flush.

    • since 5.0
    • alert unstable
    val formatter_of_out_functions : formatter_out_functions -> formatter

    formatter_of_out_functions out_funs returns a new formatter that writes with the set of output functions out_funs.

    See definition of type formatter_out_functions for the meaning of argument out_funs.

    • since 4.06

    Symbolic pretty-printing

    Symbolic pretty-printing is pretty-printing using a symbolic formatter, i.e. a formatter that outputs symbolic pretty-printing items.

    When using a symbolic formatter, all regular pretty-printing activities occur but output material is symbolic and stored in a buffer of output items. At the end of pretty-printing, flushing the output buffer allows post-processing of symbolic output before performing low level output operations.

    In practice, first define a symbolic output buffer b using:

    • let sob = make_symbolic_output_buffer (). Then define a symbolic formatter with:
    • let ppf = formatter_of_symbolic_output_buffer sob

    Use symbolic formatter ppf as usual, and retrieve symbolic items at end of pretty-printing by flushing symbolic output buffer sob with:

    • flush_symbolic_output_buffer sob.
    type symbolic_output_item =
    1. | Output_flush
      (*

      symbolic flush command

      *)
    2. | Output_newline
      (*

      symbolic newline command

      *)
    3. | Output_string of string
      (*

      Output_string s: symbolic output for string s

      *)
    4. | Output_spaces of int
      (*

      Output_spaces n: symbolic command to output n spaces

      *)
    5. | Output_indent of int
      (*

      Output_indent i: symbolic indentation of size i

      *)

    Items produced by symbolic pretty-printers

    • since 4.06
    type symbolic_output_buffer

    The output buffer of a symbolic pretty-printer.

    • since 4.06
    val make_symbolic_output_buffer : unit -> symbolic_output_buffer

    make_symbolic_output_buffer () returns a fresh buffer for symbolic output.

    • since 4.06
    val clear_symbolic_output_buffer : symbolic_output_buffer -> unit

    clear_symbolic_output_buffer sob resets buffer sob.

    • since 4.06
    val get_symbolic_output_buffer : + symbolic_output_buffer -> + symbolic_output_item list

    get_symbolic_output_buffer sob returns the contents of buffer sob.

    • since 4.06
    val flush_symbolic_output_buffer : + symbolic_output_buffer -> + symbolic_output_item list

    flush_symbolic_output_buffer sob returns the contents of buffer sob and resets buffer sob. flush_symbolic_output_buffer sob is equivalent to let items = get_symbolic_output_buffer sob in clear_symbolic_output_buffer sob; items

    • since 4.06
    val add_symbolic_output_item : + symbolic_output_buffer -> + symbolic_output_item -> + unit

    add_symbolic_output_item sob itm adds item itm to buffer sob.

    • since 4.06
    val formatter_of_symbolic_output_buffer : symbolic_output_buffer -> formatter

    formatter_of_symbolic_output_buffer sob returns a symbolic formatter that outputs to symbolic_output_buffer sob.

    • since 4.06

    Convenience formatting functions.

    val pp_print_iter : + ?pp_sep:(formatter -> unit -> unit) -> + (('a -> unit) -> 'b -> unit) -> + (formatter -> 'a -> unit) -> + formatter -> + 'b -> + unit

    pp_print_iter ~pp_sep iter pp_v ppf v formats on ppf the iterations of iter over a collection v of values using pp_v. Iterations are separated by pp_sep (defaults to pp_print_cut).

    • since 5.1
    val pp_print_list : + ?pp_sep:(formatter -> unit -> unit) -> + (formatter -> 'a -> unit) -> + formatter -> + 'a list -> + unit

    pp_print_list ?pp_sep pp_v ppf l prints items of list l, using pp_v to print each item, and calling pp_sep between items (pp_sep defaults to pp_print_cut). Does nothing on empty lists.

    • since 4.02
    val pp_print_array : + ?pp_sep:(formatter -> unit -> unit) -> + (formatter -> 'a -> unit) -> + formatter -> + 'a array -> + unit

    pp_print_array ?pp_sep pp_v ppf a prints items of array a, using pp_v to print each item, and calling pp_sep between items (pp_sep defaults to pp_print_cut). Does nothing on empty arrays.

    If a is mutated after pp_print_array is called, the printed values may not be what is expected because Format can delay the printing. This can be avoided by flushing ppf.

    • since 5.1
    val pp_print_seq : + ?pp_sep:(formatter -> unit -> unit) -> + (formatter -> 'a -> unit) -> + formatter -> + 'a Seq.t -> + unit

    pp_print_seq ?pp_sep pp_v ppf s prints items of sequence s, using pp_v to print each item, and calling pp_sep between items (pp_sep defaults to pp_print_cut. Does nothing on empty sequences.

    This function does not terminate on infinite sequences.

    • since 4.12
    val pp_print_text : formatter -> string -> unit

    pp_print_text ppf s prints s with spaces and newlines respectively printed using pp_print_space and pp_force_newline.

    • since 4.02
    val pp_print_option : + ?none:(formatter -> unit -> unit) -> + (formatter -> 'a -> unit) -> + formatter -> + 'a option -> + unit

    pp_print_option ?none pp_v ppf o prints o on ppf using pp_v if o is Some v and none if it is None. none prints nothing by default.

    • since 4.08
    val pp_print_result : + ok:(formatter -> 'a -> unit) -> + error:(formatter -> 'e -> unit) -> + formatter -> + ('a, 'e) result -> + unit

    pp_print_result ~ok ~error ppf r prints r on ppf using ok if r is Ok _ and error if r is Error _.

    • since 4.08
    val pp_print_either : + left:(formatter -> 'a -> unit) -> + right:(formatter -> 'b -> unit) -> + formatter -> + ('a, 'b) Either.t -> + unit

    pp_print_either ~left ~right ppf e prints e on ppf using left if e is Either.Left _ and right if e is Either.Right _.

    • since 4.13

    Formatted pretty-printing

    Module Format provides a complete set of printf like functions for pretty-printing using format string specifications.

    Specific annotations may be added in the format strings to give pretty-printing commands to the pretty-printing engine.

    Those annotations are introduced in the format strings using the @ character. For instance, @ means a space break, @, means a cut, @[ opens a new box, and @] closes the last open box.

    val fprintf : formatter -> ('a, formatter, unit) format -> 'a

    fprintf ff fmt arg1 ... argN formats the arguments arg1 to argN according to the format string fmt, and outputs the resulting string on the formatter ff.

    The format string fmt is a character string which contains three types of objects: plain characters and conversion specifications as specified in the Printf module, and pretty-printing indications specific to the Format module.

    The pretty-printing indication characters are introduced by a @ character, and their meanings are:

    • @[: open a pretty-printing box. The type and offset of the box may be optionally specified with the following syntax: the < character, followed by an optional box type indication, then an optional integer offset, and the closing > character. Pretty-printing box type is one of h, v, hv, b, or hov. 'h' stands for an 'horizontal' pretty-printing box, 'v' stands for a 'vertical' pretty-printing box, 'hv' stands for an 'horizontal/vertical' pretty-printing box, 'b' stands for an 'horizontal-or-vertical' pretty-printing box demonstrating indentation, 'hov' stands a simple 'horizontal-or-vertical' pretty-printing box. For instance, @[<hov 2> opens an 'horizontal-or-vertical' pretty-printing box with indentation 2 as obtained with open_hovbox 2. For more details about pretty-printing boxes, see the various box opening functions open_*box.
    • @]: close the most recently opened pretty-printing box.
    • @,: output a 'cut' break hint, as with print_cut ().
    • @ : output a 'space' break hint, as with print_space ().
    • @;: output a 'full' break hint as with print_break. The nspaces and offset parameters of the break hint may be optionally specified with the following syntax: the < character, followed by an integer nspaces value, then an integer offset, and a closing > character. If no parameters are provided, the full break defaults to a 'space' break hint.
    • @.: flush the pretty-printer and split the line, as with print_newline ().
    • @<n>: print the following item as if it were of length n. Hence, printf "@<0>%s" arg prints arg as a zero length string. If @<n> is not followed by a conversion specification, then the following character of the format is printed as if it were of length n.
    • @\{: open a semantic tag. The name of the tag may be optionally specified with the following syntax: the < character, followed by an optional string specification, and the closing > character. The string specification is any character string that does not contain the closing character '>'. If omitted, the tag name defaults to the empty string. For more details about semantic tags, see the functions open_stag and close_stag.
    • @\}: close the most recently opened semantic tag.
    • @?: flush the pretty-printer as with print_flush (). This is equivalent to the conversion %!.
    • @\n: force a newline, as with force_newline (), not the normal way of pretty-printing, you should prefer using break hints inside a vertical pretty-printing box.

    Note: To prevent the interpretation of a @ character as a pretty-printing indication, escape it with a % character. Old quotation mode @@ is deprecated since it is not compatible with formatted input interpretation of character '@'.

    Example: printf "@[%s@ %d@]@." "x =" 1 is equivalent to open_box (); print_string "x ="; print_space (); print_int 1; close_box (); print_newline (). It prints x = 1 within a pretty-printing 'horizontal-or-vertical' box.

    val printf : ('a, formatter, unit) format -> 'a

    Same as fprintf above, but output on get_std_formatter ().

    It is defined similarly to fun fmt -> fprintf (get_std_formatter ()) fmt but delays calling get_std_formatter until after the final argument required by the format is received. When used with multiple domains, the output from the domains will be interleaved with each other at points where the formatter is flushed, such as with print_flush.

    val eprintf : ('a, formatter, unit) format -> 'a

    Same as fprintf above, but output on get_err_formatter ().

    It is defined similarly to fun fmt -> fprintf (get_err_formatter ()) fmt but delays calling get_err_formatter until after the final argument required by the format is received. When used with multiple domains, the output from the domains will be interleaved with each other at points where the formatter is flushed, such as with print_flush.

    val sprintf : ('a, unit, string) format -> 'a

    Same as printf above, but instead of printing on a formatter, returns a string containing the result of formatting the arguments. Note that the pretty-printer queue is flushed at the end of each call to sprintf. Note that if your format string contains a %a, you should use asprintf.

    In case of multiple and related calls to sprintf to output material on a single string, you should consider using fprintf with the predefined formatter str_formatter and call flush_str_formatter () to get the final result.

    Alternatively, you can use Format.fprintf with a formatter writing to a buffer of your own: flushing the formatter and the buffer at the end of pretty-printing returns the desired string.

    val asprintf : ('a, formatter, unit, string) format4 -> 'a

    Same as printf above, but instead of printing on a formatter, returns a string containing the result of formatting the arguments. The type of asprintf is general enough to interact nicely with %a conversions.

    • since 4.01
    val dprintf : ('a, formatter, unit, formatter -> unit) format4 -> 'a

    Same as fprintf, except the formatter is the last argument. dprintf "..." a b c is a function of type formatter -> unit which can be given to a format specifier %t.

    This can be used as a replacement for asprintf to delay formatting decisions. Using the string returned by asprintf in a formatting context forces formatting decisions to be taken in isolation, and the final string may be created prematurely. dprintf allows delay of formatting decisions until the final formatting context is known. For example:

      let t = Format.dprintf "%i@ %i@ %i" 1 2 3 in
+  ...
+  Format.printf "@[<v>%t@]" t
    • since 4.08
    val ifprintf : formatter -> ('a, formatter, unit) format -> 'a

    Same as fprintf above, but does not print anything. Useful to ignore some material when conditionally printing.

    • since 3.10

    Formatted Pretty-Printing with continuations.

    val kfprintf : + (formatter -> 'a) -> + formatter -> + ('b, formatter, unit, 'a) format4 -> + 'b

    Same as fprintf above, but instead of returning immediately, passes the formatter to its first argument at the end of printing.

    val kdprintf : + ((formatter -> unit) -> 'a) -> + ('b, formatter, unit, 'a) format4 -> + 'b

    Same as dprintf above, but instead of returning immediately, passes the suspended printer to its first argument at the end of printing.

    • since 4.08
    val ikfprintf : + (formatter -> 'a) -> + formatter -> + ('b, formatter, unit, 'a) format4 -> + 'b

    Same as kfprintf above, but does not print anything. Useful to ignore some material when conditionally printing.

    • since 3.12
    val ksprintf : (string -> 'a) -> ('b, unit, string, 'a) format4 -> 'b

    Same as sprintf above, but instead of returning the string, passes it to the first argument.

    val kasprintf : (string -> 'a) -> ('b, formatter, unit, 'a) format4 -> 'b

    Same as asprintf above, but instead of returning the string, passes it to the first argument.

    • since 4.03

    Examples

    A few warmup examples to get an idea of how Format is used.

    We have a list l of pairs (int * bool), which the toplevel prints for us:

    # let l = List.init 20 (fun n -> n, n mod 2 = 0)
+val l : (int * bool) list =
+[(0, true); (1, false); (2, true); (3, false); (4, true); (5, false);
+ (6, true); (7, false); (8, true); (9, false); (10, true); (11, false);
+ (12, true); (13, false); (14, true); (15, false); (16, true); (17, false);
+ (18, true); (19, false)]

    If we want to print it ourself without the toplevel magic, we can try this:

    # let pp_pair out (x,y) = Format.fprintf out "(%d, %b)" x y
+val pp_pair : Format.formatter -> int * bool -> unit = <fun>
+# Format.printf "l: [@[<hov>%a@]]@."
+  Format.(pp_print_list ~pp_sep:(fun out () -> fprintf out ";@ ") pp_pair) l
+  l: [(0, true); (1, false); (2, true); (3, false); (4, true); (5, false);
+      (6, true); (7, false); (8, true); (9, false); (10, true); (11, false);
+      (12, true); (13, false); (14, true); (15, false); (16, true);
+      (17, false); (18, true); (19, false)]
+

    What this does, briefly, is:

    • pp_pair prints a pair bool*int surrounded in "(" ")". It takes a formatter (into which formatting happens), and the pair itself. When printing is done it returns ().
    • Format.printf "l = [@[<hov>%a@]]@." ... l is like printf, but with additional formatting instructions (denoted with "@"). The pair "@[<hov>" and "@]" is a "horizontal-or-vertical box".
    • "@." ends formatting with a newline. It is similar to "\n" but is also aware of the Format.formatter's state. Do not use "\n" with Format.
    • "%a" is a formatting instruction, like "%d" or "%s" for printf. However, where "%d" prints an integer and "%s" prints a string, "%a" takes a printer (of type Format.formatter -> 'a -> unit) and a value (of type 'a) and applies the printer to the value. This is key to compositionality of printers.
    • We build a list printer using Format.pp_print_list ~pp_sep:(...) pp_pair. pp_print_list takes an element printer and returns a list printer. The ?pp_sep optional argument, if provided, is called in between each element to print a separator.
    • Here, for a separator, we use (fun out () -> Format.fprintf out ";@ "). It prints ";", and then "@ " which is a breaking space (either it prints " ", or it prints a newline if the box is about to overflow). This "@ " is responsible for the list printing splitting into several lines.

    If we omit "@ ", we get an ugly single-line print:

      # Format.printf "l: [@[<hov>%a@]]@."
+      Format.(pp_print_list ~pp_sep:(fun out () -> fprintf out "; ") pp_pair) l
+  l: [(0, true); (1, false); (2, true); (* ... *); (18, true); (19, false)]
+- : unit = ()

    Generally, it is good practice to define custom printers for important types in your program. If, for example, you were to define basic geometry types like so:

    type point = {
+  x: float;
+  y: float;
+}
+
+type rectangle = {
+  ll: point; (* lower left *)
+  ur: point; (* upper right *)
+}

    For debugging purpose, or to display information in logs, or on the console, it would be convenient to define printers for these types. Here is an example of to do it. Note that "%.3f" is a float printer up to 3 digits of precision after the dot; "%f" would print as many digits as required, which is somewhat verbose; "%h" is an hexadecimal float printer.

    let pp_point out (p:point) =
+  Format.fprintf out "{ @[x=%.3f;@ y=%.3f@] }" p.x p.y
+
+let pp_rectangle out (r:rectangle) =
+  Format.fprintf out "{ @[ll=%a;@ ur=%a@] }"
+    pp_point r.ll pp_point r.ur

    In the .mli file, we could have:

      val pp_point : Format.formatter -> point -> unit
+
+  val pp_rectangle : Format.formatter -> rectangle -> unit

    These printers can now be used with "%a" inside other printers.

     # Format.printf "some rectangle: %a@."
+      (Format.pp_print_option pp_rectangle)
+      (Some {ll={x=1.; y=2.}; ur={x=42.; y=500.12345}})
+some rectangle: { l={ x=1.000; y=2.000 }; ur={ x=42.000; y=500.123 } }
+
+# Format.printf "no rectangle: %a@."
+      (Format.pp_option pp_rectangle)
+      None
+no rectangle:

    See how we combine pp_print_option (option printer) and our newly defined rectangle printer, like we did with pp_print_list earlier.

    For a more extensive tutorial, see "Using the Format module".

    A final note: the Format module is a starting point. The OCaml ecosystem has libraries that makes formatting easier and more expressive, with more combinators, more concise names, etc. An example of such a library is Fmt.

    Automatic deriving of pretty-printers from type definitions is also possible, using https://github.com/ocaml-ppx/ppx_deriving or similar ppx derivers.

    diff --git a/ocaml/Stdlib/Fun/index.html b/ocaml/Stdlib/Fun/index.html new file mode 100644 index 0000000..dd00c65 --- /dev/null +++ b/ocaml/Stdlib/Fun/index.html @@ -0,0 +1,2 @@ + +Fun (ocaml.Stdlib.Fun)

    Module Stdlib.Fun

    Function manipulation.

    • since 4.08

    Combinators

    val id : 'a -> 'a

    id is the identity function. For any argument x, id x is x.

    val const : 'a -> _ -> 'a

    const c is a function that always returns the value c. For any argument x, (const c) x is c.

    val compose : ('b -> 'c) -> ('a -> 'b) -> 'a -> 'c

    compose f g is a function composition of applying g then f. For any arguments f, g, and x, compose f g x is f (g x).

    • since 5.2
    val flip : ('a -> 'b -> 'c) -> 'b -> 'a -> 'c

    flip f reverses the argument order of the binary function f. For any arguments x and y, (flip f) x y is f y x.

    val negate : ('a -> bool) -> 'a -> bool

    negate p is the negation of the predicate function p. For any argument x, (negate p) x is not (p x).

    Exception handling

    val protect : finally:(unit -> unit) -> (unit -> 'a) -> 'a

    protect ~finally work invokes work () and then finally () before work () returns with its value or an exception. In the latter case the exception is re-raised after finally (). If finally () raises an exception, then the exception Finally_raised is raised instead.

    protect can be used to enforce local invariants whether work () returns normally or raises an exception. However, it does not protect against unexpected exceptions raised inside finally () such as Stdlib.Out_of_memory, Stdlib.Stack_overflow, or asynchronous exceptions raised by signal handlers (e.g. Sys.Break).

    Note: It is a programming error if other kinds of exceptions are raised by finally, as any exception raised in work () will be lost in the event of a Finally_raised exception. Therefore, one should make sure to handle those inside the finally.

    exception Finally_raised of exn

    Finally_raised exn is raised by protect ~finally work when finally raises an exception exn. This exception denotes either an unexpected exception or a programming error. As a general rule, one should not catch a Finally_raised exception except as part of a catch-all handler.

    diff --git a/ocaml/Stdlib/Gc/Memprof/index.html b/ocaml/Stdlib/Gc/Memprof/index.html new file mode 100644 index 0000000..f2823d9 --- /dev/null +++ b/ocaml/Stdlib/Gc/Memprof/index.html @@ -0,0 +1,6 @@ + +Memprof (ocaml.Stdlib.Gc.Memprof)

    Module Gc.Memprof

    Memprof is a profiling engine which randomly samples allocated memory words. Every allocated word has a probability of being sampled equal to a configurable sampling rate. Once a block is sampled, it becomes tracked. A tracked block triggers a user-defined callback as soon as it is allocated, promoted or deallocated.

    Since blocks are composed of several words, a block can potentially be sampled several times. If a block is sampled several times, then each of the callbacks is called once for each event of this block: the multiplicity is given in the n_samples field of the allocation structure.

    This engine makes it possible to implement a low-overhead memory profiler as an OCaml library.

    Note: this API is EXPERIMENTAL. It may change without prior notice.

    type t

    the type of a profile

    type allocation_source =
    1. | Normal
    2. | Marshal
    3. | Custom
    type allocation = private {
    1. n_samples : int;
      (*

      The number of samples in this block (>= 1).

      *)
    2. size : int;
      (*

      The size of the block, in words, excluding the header.

      *)
    3. source : allocation_source;
      (*

      The cause of the allocation; Marshal cannot be produced since OCaml 5.

      *)
    4. callstack : Printexc.raw_backtrace;
      (*

      The callstack for the allocation.

      *)
    }

    The type of metadata associated with allocations. This is the type of records passed to the callback triggered by the sampling of an allocation.

    type ('minor, 'major) tracker = {
    1. alloc_minor : allocation -> 'minor option;
    2. alloc_major : allocation -> 'major option;
    3. promote : 'minor -> 'major option;
    4. dealloc_minor : 'minor -> unit;
    5. dealloc_major : 'major -> unit;
    }

    A ('minor, 'major) tracker describes how memprof should track sampled blocks over their lifetime, keeping a user-defined piece of metadata for each of them: 'minor is the type of metadata to keep for minor blocks, and 'major the type of metadata for major blocks.

    The member functions in a tracker are called callbacks.

    If an allocation or promotion callback raises an exception or returns None, memprof stops tracking the corresponding block.

    val null_tracker : ('minor, 'major) tracker

    Default callbacks simply return None or ()

    val start : + sampling_rate:float -> + ?callstack_size:int -> + ('minor, 'major) tracker -> + t

    Start a profile with the given parameters. Raises an exception if a profile is already sampling in the current domain.

    Sampling begins immediately. The parameter sampling_rate is the sampling rate in samples per word (including headers). Usually, with cheap callbacks, a rate of 1e-4 has no visible effect on performance, and 1e-3 causes the program to run a few percent slower.

    The parameter callstack_size is the length of the callstack recorded at every sample. Its default is max_int.

    The parameter tracker determines how to track sampled blocks over their lifetime in the minor and major heap.

    Sampling is temporarily disabled on the current thread when calling a callback, so callbacks do not need to be re-entrant if the program is single-threaded and single-domain. However, if threads or multiple domains are used, it is possible that several callbacks will run in parallel. In this case, callback functions must be re-entrant.

    Note that a callback may be postponed slightly after the actual event. The callstack passed to an allocation callback always accurately reflects the allocation, but the program state may have evolved between the allocation and the call to the callback.

    If a new thread or domain is created when profiling is active, the child thread or domain joins that profile (using the same sampling_rate, callstack_size, and tracker callbacks).

    An allocation callback is generally run by the thread which allocated the block. If the thread exits or the profile is stopped before the callback is called, the callback may be run by a different thread.

    Each callback is generally run by the domain which allocated the block. If the domain terminates or the profile is stopped before the callback is called, the callback may be run by a different domain.

    Different domains may run different profiles simultaneously.

    val stop : unit -> unit

    Stop sampling for the current profile. Fails if no profile is sampling in the current domain. Stops sampling in all threads and domains sharing the profile.

    Callbacks from a profile may run after stop is called, until discard is applied to the profile.

    A profile is implicitly stopped (but not discarded) if all domains and threads sampling for it are terminated.

    val discard : t -> unit

    Discards all profiling state for a stopped profile, which prevents any more callbacks for it. Raises an exception if called on a profile which has not been stopped.

    diff --git a/ocaml/Stdlib/Gc/index.html b/ocaml/Stdlib/Gc/index.html new file mode 100644 index 0000000..bb31596 --- /dev/null +++ b/ocaml/Stdlib/Gc/index.html @@ -0,0 +1,9 @@ + +Gc (ocaml.Stdlib.Gc)

    Module Stdlib.Gc

    Memory management control and statistics; finalised values.

    type stat = {
    1. minor_words : float;
      (*

      Number of words allocated in the minor heap since the program was started.

      *)
    2. promoted_words : float;
      (*

      Number of words allocated in the minor heap that survived a minor collection and were moved to the major heap since the program was started.

      *)
    3. major_words : float;
      (*

      Number of words allocated in the major heap, including the promoted words, since the program was started.

      *)
    4. minor_collections : int;
      (*

      Number of minor collections since the program was started.

      *)
    5. major_collections : int;
      (*

      Number of major collection cycles completed since the program was started.

      *)
    6. heap_words : int;
      (*

      Total size of the major heap, in words.

      *)
    7. heap_chunks : int;
      (*

      Number of contiguous pieces of memory that make up the major heap. This metrics is currently not available in OCaml 5: the field value is always 0.

      *)
    8. live_words : int;
      (*

      Number of words of live data in the major heap, including the header words.

      Note that "live" words refers to every word in the major heap that isn't currently known to be collectable, which includes words that have become unreachable by the program after the start of the previous gc cycle. It is typically much simpler and more predictable to call Gc.full_major (or Gc.compact) then computing gc stats, as then "live" words has the simple meaning of "reachable by the program". One caveat is that a single call to Gc.full_major will not reclaim values that have a finaliser from Gc.finalise (this does not apply to Gc.finalise_last). If this caveat matters, simply call Gc.full_major twice instead of once.

      *)
    9. live_blocks : int;
      (*

      Number of live blocks in the major heap.

      See live_words for a caveat about what "live" means.

      *)
    10. free_words : int;
      (*

      Number of words in the free list.

      *)
    11. free_blocks : int;
      (*

      Number of blocks in the free list. This metrics is currently not available in OCaml 5: the field value is always 0.

      *)
    12. largest_free : int;
      (*

      Size (in words) of the largest block in the free list. This metrics is currently not available in OCaml 5: the field value is always 0.

      *)
    13. fragments : int;
      (*

      Number of wasted words due to fragmentation. These are 1-words free blocks placed between two live blocks. They are not available for allocation.

      *)
    14. compactions : int;
      (*

      Number of heap compactions since the program was started.

      *)
    15. top_heap_words : int;
      (*

      Maximum size reached by the major heap, in words.

      *)
    16. stack_size : int;
      (*

      Current size of the stack, in words. This metrics is currently not available in OCaml 5: the field value is always 0.

      • since 3.12
      *)
    17. forced_major_collections : int;
      (*

      Number of forced full major collections completed since the program was started.

      • since 4.12
      *)
    }

    The memory management counters are returned in a stat record. These counters give values for the whole program.

    The total amount of memory allocated by the program since it was started is (in words) minor_words + major_words - promoted_words. Multiply by the word size (4 on a 32-bit machine, 8 on a 64-bit machine) to get the number of bytes.

    type control = {
    1. minor_heap_size : int;
      (*

      The size (in words) of the minor heap. Changing this parameter will trigger a minor collection. The total size of the minor heap used by this program is the sum of the heap sizes of the active domains. Default: 256k.

      *)
    2. major_heap_increment : int;
      (*

      How much to add to the major heap when increasing it. If this number is less than or equal to 1000, it is a percentage of the current heap size (i.e. setting it to 100 will double the heap size at each increase). If it is more than 1000, it is a fixed number of words that will be added to the heap. Default: 15.

      *)
    3. space_overhead : int;
      (*

      The major GC speed is computed from this parameter. This is the memory that will be "wasted" because the GC does not immediately collect unreachable blocks. It is expressed as a percentage of the memory used for live data. The GC will work more (use more CPU time and collect blocks more eagerly) if space_overhead is smaller. Default: 120.

      *)
    4. verbose : int;
      (*

      This value controls the GC messages on standard error output. It is a sum of some of the following flags, to print messages on the corresponding events:

      • 0x001 Start and end of major GC cycle.
      • 0x002 Minor collection and major GC slice.
      • 0x004 Growing and shrinking of the heap.
      • 0x008 Resizing of stacks and memory manager tables.
      • 0x010 Heap compaction.
      • 0x020 Change of GC parameters.
      • 0x040 Computation of major GC slice size.
      • 0x080 Calling of finalisation functions.
      • 0x100 Bytecode executable and shared library search at start-up.
      • 0x200 Computation of compaction-triggering condition.
      • 0x400 Output GC statistics at program exit. Default: 0.
      *)
    5. max_overhead : int;
      (*

      Heap compaction is triggered when the estimated amount of "wasted" memory is more than max_overhead percent of the amount of live data. If max_overhead is set to 0, heap compaction is triggered at the end of each major GC cycle (this setting is intended for testing purposes only). If max_overhead >= 1000000, compaction is never triggered. Default: 500.

      *)
    6. stack_limit : int;
      (*

      The maximum size of the fiber stacks (in words). Default: 1024k.

      *)
    7. allocation_policy : int;
      (*

      The policy used for allocating in the major heap.

      This option is ignored in OCaml 5.x.

      Prior to OCaml 5.0, possible values were 0, 1 and 2.

      • 0 was the next-fit policy
      • 1 was the first-fit policy (since OCaml 3.11)
      • 2 was the best-fit policy (since OCaml 4.10)
      • since 3.11
      *)
    8. window_size : int;
      (*

      The size of the window used by the major GC for smoothing out variations in its workload. This is an integer between 1 and 50. Default: 1.

      • since 4.03
      *)
    9. custom_major_ratio : int;
      (*

      Target ratio of floating garbage to major heap size for out-of-heap memory held by custom values located in the major heap. The GC speed is adjusted to try to use this much memory for dead values that are not yet collected. Expressed as a percentage of major heap size. The default value keeps the out-of-heap floating garbage about the same size as the in-heap overhead. Note: this only applies to values allocated with caml_alloc_custom_mem (e.g. bigarrays). Default: 44.

      • since 4.08
      *)
    10. custom_minor_ratio : int;
      (*

      Bound on floating garbage for out-of-heap memory held by custom values in the minor heap. A minor GC is triggered when this much memory is held by custom values located in the minor heap. Expressed as a percentage of minor heap size. Note: this only applies to values allocated with caml_alloc_custom_mem (e.g. bigarrays). Default: 100.

      • since 4.08
      *)
    11. custom_minor_max_size : int;
      (*

      Maximum amount of out-of-heap memory for each custom value allocated in the minor heap. Custom values that hold more than this many bytes are allocated on the major heap. Note: this only applies to values allocated with caml_alloc_custom_mem (e.g. bigarrays). Default: 70000 bytes.

      • since 4.08
      *)
    }

    The GC parameters are given as a control record. Note that these parameters can also be initialised by setting the OCAMLRUNPARAM environment variable. See the documentation of ocamlrun.

    val stat : unit -> stat

    Return the current values of the memory management counters in a stat record that represent the program's total memory stats. This function causes a full major collection.

    val quick_stat : unit -> stat

    Same as stat except that live_words, live_blocks, free_words, free_blocks, largest_free, and fragments are set to 0. Due to per-domain buffers it may only represent the state of the program's total memory usage since the last minor collection or major cycle. This function is much faster than stat because it does not need to trigger a full major collection.

    val counters : unit -> float * float * float

    Return (minor_words, promoted_words, major_words) for the current domain or potentially previous domains. This function is as fast as quick_stat.

    val minor_words : unit -> float

    Number of words allocated in the minor heap by this domain or potentially previous domains. This number is accurate in byte-code programs, but only an approximation in programs compiled to native code.

    In native code this function does not allocate.

    • since 4.04
    val get : unit -> control

    Return the current values of the GC parameters in a control record.

    • alert unsynchronized_access GC parameters are a mutable global state.
    val set : control -> unit

    set r changes the GC parameters according to the control record r. The normal usage is: Gc.set { (Gc.get()) with Gc.verbose = 0x00d }

    • alert unsynchronized_access GC parameters are a mutable global state.
    val minor : unit -> unit

    Trigger a minor collection.

    val major_slice : int -> int

    major_slice n Do a minor collection and a slice of major collection. n is the size of the slice: the GC will do enough work to free (on average) n words of memory. If n = 0, the GC will try to do enough work to ensure that the next automatic slice has no work to do. This function returns an unspecified integer (currently: 0).

    val major : unit -> unit

    Do a minor collection and finish the current major collection cycle.

    val full_major : unit -> unit

    Do a minor collection, finish the current major collection cycle, and perform a complete new cycle. This will collect all currently unreachable blocks.

    val compact : unit -> unit

    Perform a full major collection and compact the heap. Note that heap compaction is a lengthy operation.

    val print_stat : out_channel -> unit

    Print the current values of the memory management counters (in human-readable form) of the total program into the channel argument.

    val allocated_bytes : unit -> float

    Return the number of bytes allocated by this domain and potentially a previous domain. It is returned as a float to avoid overflow problems with int on 32-bit machines.

    val get_minor_free : unit -> int

    Return the current size of the free space inside the minor heap of this domain.

    • since 4.03
    val finalise : ('a -> unit) -> 'a -> unit

    finalise f v registers f as a finalisation function for v. v must be heap-allocated. f will be called with v as argument at some point between the first time v becomes unreachable (including through weak pointers) and the time v is collected by the GC. Several functions can be registered for the same value, or even several instances of the same function. Each instance will be called once (or never, if the program terminates before v becomes unreachable).

    The GC will call the finalisation functions in the order of deallocation. When several values become unreachable at the same time (i.e. during the same GC cycle), the finalisation functions will be called in the reverse order of the corresponding calls to finalise. If finalise is called in the same order as the values are allocated, that means each value is finalised before the values it depends upon. Of course, this becomes false if additional dependencies are introduced by assignments.

    In the presence of multiple OCaml threads it should be assumed that any particular finaliser may be executed in any of the threads.

    Anything reachable from the closure of finalisation functions is considered reachable, so the following code will not work as expected:

    • let v = ... in Gc.finalise (fun _ -> ...v...) v

    Instead you should make sure that v is not in the closure of the finalisation function by writing:

    • let f = fun x -> ... let v = ... in Gc.finalise f v

    The f function can use all features of OCaml, including assignments that make the value reachable again. It can also loop forever (in this case, the other finalisation functions will not be called during the execution of f, unless it calls finalise_release). It can call finalise on v or other values to register other functions or even itself. It can raise an exception; in this case the exception will interrupt whatever the program was doing when the function was called.

    finalise will raise Invalid_argument if v is not guaranteed to be heap-allocated. Some examples of values that are not heap-allocated are integers, constant constructors, booleans, the empty array, the empty list, the unit value. The exact list of what is heap-allocated or not is implementation-dependent. Some constant values can be heap-allocated but never deallocated during the lifetime of the program, for example a list of integer constants; this is also implementation-dependent. Note that values of types float are sometimes allocated and sometimes not, so finalising them is unsafe, and finalise will also raise Invalid_argument for them. Values of type 'a Lazy.t (for any 'a) are like float in this respect, except that the compiler sometimes optimizes them in a way that prevents finalise from detecting them. In this case, it will not raise Invalid_argument, but you should still avoid calling finalise on lazy values.

    The results of calling String.make, Bytes.make, Bytes.create, Array.make, and Stdlib.ref are guaranteed to be heap-allocated and non-constant except when the length argument is 0.

    val finalise_last : (unit -> unit) -> 'a -> unit

    same as finalise except the value is not given as argument. So you can't use the given value for the computation of the finalisation function. The benefit is that the function is called after the value is unreachable for the last time instead of the first time. So contrary to finalise the value will never be reachable again or used again. In particular every weak pointer and ephemeron that contained this value as key or data is unset before running the finalisation function. Moreover the finalisation functions attached with finalise are always called before the finalisation functions attached with finalise_last.

    • since 4.04
    val finalise_release : unit -> unit

    A finalisation function may call finalise_release to tell the GC that it can launch the next finalisation function without waiting for the current one to return.

    type alarm

    An alarm is a piece of data that calls a user function at the end of major GC cycle. The following functions are provided to create and delete alarms.

    val create_alarm : (unit -> unit) -> alarm

    create_alarm f will arrange for f to be called at the end of major GC cycles, not caused by f itself, starting with the current cycle or the next one. f will run on the same domain that created the alarm, until the domain exits or delete_alarm is called. A value of type alarm is returned that you can use to call delete_alarm.

    It is not guaranteed that the Gc alarm runs at the end of every major GC cycle, but it is guaranteed that it will run eventually.

    As an example, here is a crude way to interrupt a function if the memory consumption of the program exceeds a given limit in MB, suitable for use in the toplevel:

    let run_with_memory_limit (limit : int) (f : unit -> 'a) : 'a =
+  let limit_memory () =
+    let mem = Gc.(quick_stat ()).heap_words in
+    if mem / (1024 * 1024) > limit / (Sys.word_size / 8) then
+      raise Out_of_memory
+  in
+  let alarm = Gc.create_alarm limit_memory in
+  Fun.protect f ~finally:(fun () -> Gc.delete_alarm alarm ; Gc.compact ())
    val delete_alarm : alarm -> unit

    delete_alarm a will stop the calls to the function associated to a. Calling delete_alarm a again has no effect.

    val eventlog_pause : unit -> unit
    • deprecated Use Runtime_events.pause instead.
    val eventlog_resume : unit -> unit
    • deprecated Use Runtime_events.resume instead.
    module Memprof : sig ... end

    Memprof is a profiling engine which randomly samples allocated memory words. Every allocated word has a probability of being sampled equal to a configurable sampling rate. Once a block is sampled, it becomes tracked. A tracked block triggers a user-defined callback as soon as it is allocated, promoted or deallocated.

    diff --git a/ocaml/Stdlib/Hashtbl/Make/argument-1-H/index.html b/ocaml/Stdlib/Hashtbl/Make/argument-1-H/index.html new file mode 100644 index 0000000..c59ed0f --- /dev/null +++ b/ocaml/Stdlib/Hashtbl/Make/argument-1-H/index.html @@ -0,0 +1,2 @@ + +H (ocaml.Stdlib.Hashtbl.Make.H)

    Parameter Make.H

    type t

    The type of the hashtable keys.

    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val hash : t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    diff --git a/ocaml/Stdlib/Hashtbl/Make/index.html b/ocaml/Stdlib/Hashtbl/Make/index.html new file mode 100644 index 0000000..d48930b --- /dev/null +++ b/ocaml/Stdlib/Hashtbl/Make/index.html @@ -0,0 +1,2 @@ + +Make (ocaml.Stdlib.Hashtbl.Make)

    Module Hashtbl.Make

    Functor building an implementation of the hashtable structure. The functor Hashtbl.Make returns a structure containing a type key of keys and a type 'a t of hash tables associating data of type 'a to keys of type key. The operations perform similarly to those of the generic interface, but use the hashing and equality functions specified in the functor argument H instead of generic equality and hashing. Since the hash function is not seeded, the create operation of the result structure always returns non-randomized hash tables.

    Parameters

    module H : HashedType

    Signature

    type key = H.t
    type !'a t
    val create : int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    • since 4.00
    val copy : 'a t -> 'a t
    val add : 'a t -> key -> 'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    • since 4.05
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key -> 'a -> unit
    val mem : 'a t -> key -> bool
    val iter : (key -> 'a -> unit) -> 'a t -> unit
    val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
    • since 4.03
    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc
    val length : 'a t -> int
    val stats : 'a t -> statistics
    • since 4.00
    val to_seq : 'a t -> (key * 'a) Seq.t
    • since 4.07
    val to_seq_keys : _ t -> key Seq.t
    • since 4.07
    val to_seq_values : 'a t -> 'a Seq.t
    • since 4.07
    val add_seq : 'a t -> (key * 'a) Seq.t -> unit
    • since 4.07
    val replace_seq : 'a t -> (key * 'a) Seq.t -> unit
    • since 4.07
    val of_seq : (key * 'a) Seq.t -> 'a t
    • since 4.07
    diff --git a/ocaml/Stdlib/Hashtbl/MakeSeeded/argument-1-H/index.html b/ocaml/Stdlib/Hashtbl/MakeSeeded/argument-1-H/index.html new file mode 100644 index 0000000..147facf --- /dev/null +++ b/ocaml/Stdlib/Hashtbl/MakeSeeded/argument-1-H/index.html @@ -0,0 +1,2 @@ + +H (ocaml.Stdlib.Hashtbl.MakeSeeded.H)

    Parameter MakeSeeded.H

    type t

    The type of the hashtable keys.

    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val seeded_hash : int -> t -> int

    A seeded hashing function on keys. The first argument is the seed. It must be the case that if equal x y is true, then seeded_hash seed x = seeded_hash seed y for any value of seed. A suitable choice for seeded_hash is the function Hashtbl.seeded_hash below.

    diff --git a/ocaml/Stdlib/Hashtbl/MakeSeeded/index.html b/ocaml/Stdlib/Hashtbl/MakeSeeded/index.html new file mode 100644 index 0000000..b2aaf50 --- /dev/null +++ b/ocaml/Stdlib/Hashtbl/MakeSeeded/index.html @@ -0,0 +1,2 @@ + +MakeSeeded (ocaml.Stdlib.Hashtbl.MakeSeeded)

    Module Hashtbl.MakeSeeded

    Functor building an implementation of the hashtable structure. The functor Hashtbl.MakeSeeded returns a structure containing a type key of keys and a type 'a t of hash tables associating data of type 'a to keys of type key. The operations perform similarly to those of the generic interface, but use the seeded hashing and equality functions specified in the functor argument H instead of generic equality and hashing. The create operation of the result structure supports the ~random optional parameter and returns randomized hash tables if ~random:true is passed or if randomization is globally on (see Hashtbl.randomize).

    • since 4.00

    Parameters

    Signature

    type key = H.t
    type !'a t
    val create : ?random:bool -> int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    val copy : 'a t -> 'a t
    val add : 'a t -> key -> 'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    • since 4.05
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key -> 'a -> unit
    val mem : 'a t -> key -> bool
    val iter : (key -> 'a -> unit) -> 'a t -> unit
    val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
    • since 4.03
    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc
    val length : 'a t -> int
    val stats : 'a t -> statistics
    val to_seq : 'a t -> (key * 'a) Seq.t
    • since 4.07
    val to_seq_keys : _ t -> key Seq.t
    • since 4.07
    val to_seq_values : 'a t -> 'a Seq.t
    • since 4.07
    val add_seq : 'a t -> (key * 'a) Seq.t -> unit
    • since 4.07
    val replace_seq : 'a t -> (key * 'a) Seq.t -> unit
    • since 4.07
    val of_seq : (key * 'a) Seq.t -> 'a t
    • since 4.07
    diff --git a/ocaml/Stdlib/Hashtbl/index.html b/ocaml/Stdlib/Hashtbl/index.html new file mode 100644 index 0000000..03e7430 --- /dev/null +++ b/ocaml/Stdlib/Hashtbl/index.html @@ -0,0 +1,80 @@ + +Hashtbl (ocaml.Stdlib.Hashtbl)

    Module Stdlib.Hashtbl

    Hash tables and hash functions.

    Hash tables are hashed association tables, with in-place modification. Because most operations on a hash table modify their input, they're more commonly used in imperative code. The lookup of the value associated with a key (see find, find_opt) is normally very fast, often faster than the equivalent lookup in Map.

    The functors Make and MakeSeeded can be used when performance or flexibility are key. The user provides custom equality and hash functions for the key type, and obtains a custom hash table type for this particular type of key.

    Warning a hash table is only as good as the hash function. A bad hash function will turn the table into a degenerate association list, with linear time lookup instead of constant time lookup.

    The polymorphic t hash table is useful in simpler cases or in interactive environments. It uses the polymorphic hash function defined in the OCaml runtime (at the time of writing, it's SipHash), as well as the polymorphic equality (=).

    See the examples section.

    Unsynchronized accesses

    Unsynchronized accesses to a hash table may lead to an invalid hash table state. Thus, concurrent accesses to a hash tables must be synchronized (for instance with a Mutex.t).

    Generic interface

    type (!'a, !'b) t

    The type of hash tables from type 'a to type 'b.

    val create : ?random:bool -> int -> ('a, 'b) t

    Hashtbl.create n creates a new, empty hash table, with initial size n. For best results, n should be on the order of the expected number of elements that will be in the table. The table grows as needed, so n is just an initial guess.

    The optional ~random parameter (a boolean) controls whether the internal organization of the hash table is randomized at each execution of Hashtbl.create or deterministic over all executions.

    A hash table that is created with ~random set to false uses a fixed hash function (hash) to distribute keys among buckets. As a consequence, collisions between keys happen deterministically. In Web-facing applications or other security-sensitive applications, the deterministic collision patterns can be exploited by a malicious user to create a denial-of-service attack: the attacker sends input crafted to create many collisions in the table, slowing the application down.

    A hash table that is created with ~random set to true uses the seeded hash function seeded_hash with a seed that is randomly chosen at hash table creation time. In effect, the hash function used is randomly selected among 2^{30} different hash functions. All these hash functions have different collision patterns, rendering ineffective the denial-of-service attack described above. However, because of randomization, enumerating all elements of the hash table using fold or iter is no longer deterministic: elements are enumerated in different orders at different runs of the program.

    If no ~random parameter is given, hash tables are created in non-random mode by default. This default can be changed either programmatically by calling randomize or by setting the R flag in the OCAMLRUNPARAM environment variable.

    • before 4.00

      the ~random parameter was not present and all hash tables were created in non-randomized mode.

    val clear : ('a, 'b) t -> unit

    Empty a hash table. Use reset instead of clear to shrink the size of the bucket table to its initial size.

    val reset : ('a, 'b) t -> unit

    Empty a hash table and shrink the size of the bucket table to its initial size.

    • since 4.00
    val copy : ('a, 'b) t -> ('a, 'b) t

    Return a copy of the given hashtable.

    val add : ('a, 'b) t -> 'a -> 'b -> unit

    Hashtbl.add tbl key data adds a binding of key to data in table tbl.

    Warning: Previous bindings for key are not removed, but simply hidden. That is, after performing remove tbl key, the previous binding for key, if any, is restored. (Same behavior as with association lists.)

    If you desire the classic behavior of replacing elements, see replace.

    val find : ('a, 'b) t -> 'a -> 'b

    Hashtbl.find tbl x returns the current binding of x in tbl, or raises Not_found if no such binding exists.

    val find_opt : ('a, 'b) t -> 'a -> 'b option

    Hashtbl.find_opt tbl x returns the current binding of x in tbl, or None if no such binding exists.

    • since 4.05
    val find_all : ('a, 'b) t -> 'a -> 'b list

    Hashtbl.find_all tbl x returns the list of all data associated with x in tbl. The current binding is returned first, then the previous bindings, in reverse order of introduction in the table.

    val mem : ('a, 'b) t -> 'a -> bool

    Hashtbl.mem tbl x checks if x is bound in tbl.

    val remove : ('a, 'b) t -> 'a -> unit

    Hashtbl.remove tbl x removes the current binding of x in tbl, restoring the previous binding if it exists. It does nothing if x is not bound in tbl.

    val replace : ('a, 'b) t -> 'a -> 'b -> unit

    Hashtbl.replace tbl key data replaces the current binding of key in tbl by a binding of key to data. If key is unbound in tbl, a binding of key to data is added to tbl. This is functionally equivalent to remove tbl key followed by add tbl key data.

    val iter : ('a -> 'b -> unit) -> ('a, 'b) t -> unit

    Hashtbl.iter f tbl applies f to all bindings in table tbl. f receives the key as first argument, and the associated value as second argument. Each binding is presented exactly once to f.

    The order in which the bindings are passed to f is unspecified. However, if the table contains several bindings for the same key, they are passed to f in reverse order of introduction, that is, the most recent binding is passed first.

    If the hash table was created in non-randomized mode, the order in which the bindings are enumerated is reproducible between successive runs of the program, and even between minor versions of OCaml. For randomized hash tables, the order of enumeration is entirely random.

    The behavior is not specified if the hash table is modified by f during the iteration.

    val filter_map_inplace : ('a -> 'b -> 'b option) -> ('a, 'b) t -> unit

    Hashtbl.filter_map_inplace f tbl applies f to all bindings in table tbl and update each binding depending on the result of f. If f returns None, the binding is discarded. If it returns Some new_val, the binding is update to associate the key to new_val.

    Other comments for iter apply as well.

    • since 4.03
    val fold : ('a -> 'b -> 'acc -> 'acc) -> ('a, 'b) t -> 'acc -> 'acc

    Hashtbl.fold f tbl init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in tbl, and d1 ... dN are the associated values. Each binding is presented exactly once to f.

    The order in which the bindings are passed to f is unspecified. However, if the table contains several bindings for the same key, they are passed to f in reverse order of introduction, that is, the most recent binding is passed first.

    If the hash table was created in non-randomized mode, the order in which the bindings are enumerated is reproducible between successive runs of the program, and even between minor versions of OCaml. For randomized hash tables, the order of enumeration is entirely random.

    The behavior is not specified if the hash table is modified by f during the iteration.

    val length : ('a, 'b) t -> int

    Hashtbl.length tbl returns the number of bindings in tbl. It takes constant time. Multiple bindings are counted once each, so Hashtbl.length gives the number of times Hashtbl.iter calls its first argument.

    val randomize : unit -> unit

    After a call to Hashtbl.randomize(), hash tables are created in randomized mode by default: create returns randomized hash tables, unless the ~random:false optional parameter is given. The same effect can be achieved by setting the R parameter in the OCAMLRUNPARAM environment variable.

    It is recommended that applications or Web frameworks that need to protect themselves against the denial-of-service attack described in create call Hashtbl.randomize() at initialization time before any domains are created.

    Note that once Hashtbl.randomize() was called, there is no way to revert to the non-randomized default behavior of create. This is intentional. Non-randomized hash tables can still be created using Hashtbl.create ~random:false.

    • since 4.00
    val is_randomized : unit -> bool

    Return true if the tables are currently created in randomized mode by default, false otherwise.

    • since 4.03
    val rebuild : ?random:bool -> ('a, 'b) t -> ('a, 'b) t

    Return a copy of the given hashtable. Unlike copy, rebuild h re-hashes all the (key, value) entries of the original table h. The returned hash table is randomized if h was randomized, or the optional random parameter is true, or if the default is to create randomized hash tables; see create for more information.

    rebuild can safely be used to import a hash table built by an old version of the Hashtbl module, then marshaled to persistent storage. After unmarshaling, apply rebuild to produce a hash table for the current version of the Hashtbl module.

    • since 4.12
    type statistics = {
    1. num_bindings : int;
      (*

      Number of bindings present in the table. Same value as returned by length.

      *)
    2. num_buckets : int;
      (*

      Number of buckets in the table.

      *)
    3. max_bucket_length : int;
      (*

      Maximal number of bindings per bucket.

      *)
    4. bucket_histogram : int array;
      (*

      Histogram of bucket sizes. This array histo has length max_bucket_length + 1. The value of histo.(i) is the number of buckets whose size is i.

      *)
    }
    • since 4.00
    val stats : ('a, 'b) t -> statistics

    Hashtbl.stats tbl returns statistics about the table tbl: number of buckets, size of the biggest bucket, distribution of buckets by size.

    • since 4.00

    Hash tables and Sequences

    val to_seq : ('a, 'b) t -> ('a * 'b) Seq.t

    Iterate on the whole table. The order in which the bindings appear in the sequence is unspecified. However, if the table contains several bindings for the same key, they appear in reversed order of introduction, that is, the most recent binding appears first.

    The behavior is not specified if the hash table is modified during the iteration.

    • since 4.07
    val to_seq_keys : ('a, _) t -> 'a Seq.t

    Same as Seq.map fst (to_seq m)

    • since 4.07
    val to_seq_values : (_, 'b) t -> 'b Seq.t

    Same as Seq.map snd (to_seq m)

    • since 4.07
    val add_seq : ('a, 'b) t -> ('a * 'b) Seq.t -> unit

    Add the given bindings to the table, using add

    • since 4.07
    val replace_seq : ('a, 'b) t -> ('a * 'b) Seq.t -> unit

    Add the given bindings to the table, using replace

    • since 4.07
    val of_seq : ('a * 'b) Seq.t -> ('a, 'b) t

    Build a table from the given bindings. The bindings are added in the same order they appear in the sequence, using replace_seq, which means that if two pairs have the same key, only the latest one will appear in the table.

    • since 4.07

    Functorial interface

    The functorial interface allows the use of specific comparison and hash functions, either for performance/security concerns, or because keys are not hashable/comparable with the polymorphic builtins.

    For instance, one might want to specialize a table for integer keys:

      module IntHash =
+    struct
+      type t = int
+      let equal i j = i=j
+      let hash i = i land max_int
+    end
+
+  module IntHashtbl = Hashtbl.Make(IntHash)
+
+  let h = IntHashtbl.create 17 in
+  IntHashtbl.add h 12 "hello"

    This creates a new module IntHashtbl, with a new type 'a IntHashtbl.t of tables from int to 'a. In this example, h contains string values so its type is string IntHashtbl.t.

    Note that the new type 'a IntHashtbl.t is not compatible with the type ('a,'b) Hashtbl.t of the generic interface. For example, Hashtbl.length h would not type-check, you must use IntHashtbl.length.

    module type HashedType = sig ... end

    The input signature of the functor Make.

    module type S = sig ... end

    The output signature of the functor Make.

    module Make (H : HashedType) : S with type key = H.t

    Functor building an implementation of the hashtable structure. The functor Hashtbl.Make returns a structure containing a type key of keys and a type 'a t of hash tables associating data of type 'a to keys of type key. The operations perform similarly to those of the generic interface, but use the hashing and equality functions specified in the functor argument H instead of generic equality and hashing. Since the hash function is not seeded, the create operation of the result structure always returns non-randomized hash tables.

    module type SeededHashedType = sig ... end

    The input signature of the functor MakeSeeded.

    module type SeededS = sig ... end

    The output signature of the functor MakeSeeded.

    module MakeSeeded (H : SeededHashedType) : SeededS with type key = H.t

    Functor building an implementation of the hashtable structure. The functor Hashtbl.MakeSeeded returns a structure containing a type key of keys and a type 'a t of hash tables associating data of type 'a to keys of type key. The operations perform similarly to those of the generic interface, but use the seeded hashing and equality functions specified in the functor argument H instead of generic equality and hashing. The create operation of the result structure supports the ~random optional parameter and returns randomized hash tables if ~random:true is passed or if randomization is globally on (see Hashtbl.randomize).

    The polymorphic hash functions

    val hash : 'a -> int

    Hashtbl.hash x associates a nonnegative integer to any value of any type. It is guaranteed that if x = y or Stdlib.compare x y = 0, then hash x = hash y. Moreover, hash always terminates, even on cyclic structures.

    val seeded_hash : int -> 'a -> int

    A variant of hash that is further parameterized by an integer seed.

    • since 4.00
    val hash_param : int -> int -> 'a -> int

    Hashtbl.hash_param meaningful total x computes a hash value for x, with the same properties as for hash. The two extra integer parameters meaningful and total give more precise control over hashing. Hashing performs a breadth-first, left-to-right traversal of the structure x, stopping after meaningful meaningful nodes were encountered, or total nodes (meaningful or not) were encountered. If total as specified by the user exceeds a certain value, currently 256, then it is capped to that value. Meaningful nodes are: integers; floating-point numbers; strings; characters; booleans; and constant constructors. Larger values of meaningful and total means that more nodes are taken into account to compute the final hash value, and therefore collisions are less likely to happen. However, hashing takes longer. The parameters meaningful and total govern the tradeoff between accuracy and speed. As default choices, hash and seeded_hash take meaningful = 10 and total = 100.

    val seeded_hash_param : int -> int -> int -> 'a -> int

    A variant of hash_param that is further parameterized by an integer seed. Usage: Hashtbl.seeded_hash_param meaningful total seed x.

    • since 4.00

    Examples

    Basic Example

      (* 0...99 *)
+  let seq = Seq.ints 0 |> Seq.take 100
+
+  (* build from Seq.t *)
+  # let tbl =
+      seq
+      |> Seq.map (fun x -> x, string_of_int x)
+      |> Hashtbl.of_seq
+  val tbl : (int, string) Hashtbl.t = <abstr>
+
+  # Hashtbl.length tbl
+  - : int = 100
+
+  # Hashtbl.find_opt tbl 32
+  - : string option = Some "32"
+
+  # Hashtbl.find_opt tbl 166
+  - : string option = None
+
+  # Hashtbl.replace tbl 166 "one six six"
+  - : unit = ()
+
+  # Hashtbl.find_opt tbl 166
+  - : string option = Some "one six six"
+
+  # Hashtbl.length tbl
+  - : int = 101

    Counting Elements

    Given a sequence of elements (here, a Seq.t), we want to count how many times each distinct element occurs in the sequence. A simple way to do this, assuming the elements are comparable and hashable, is to use a hash table that maps elements to their number of occurrences.

    Here we illustrate that principle using a sequence of (ascii) characters (type char). We use a custom Char_tbl specialized for char.

      # module Char_tbl = Hashtbl.Make(struct
+      type t = char
+      let equal = Char.equal
+      let hash = Hashtbl.hash
+    end)
+
+  (*  count distinct occurrences of chars in [seq] *)
+  # let count_chars (seq : char Seq.t) : _ list =
+      let counts = Char_tbl.create 16 in
+      Seq.iter
+        (fun c ->
+          let count_c =
+            Char_tbl.find_opt counts c
+            |> Option.value ~default:0
+          in
+          Char_tbl.replace counts c (count_c + 1))
+        seq;
+      (* turn into a list *)
+      Char_tbl.fold (fun c n l -> (c,n) :: l) counts []
+        |> List.sort (fun (c1,_)(c2,_) -> Char.compare c1 c2)
+  val count_chars : Char_tbl.key Seq.t -> (Char.t * int) list = <fun>
+
+  (* basic seq from a string *)
+  # let seq = String.to_seq "hello world, and all the camels in it!"
+  val seq : char Seq.t = <fun>
+
+  # count_chars seq
+  - : (Char.t * int) list =
+  [(' ', 7); ('!', 1); (',', 1); ('a', 3); ('c', 1); ('d', 2); ('e', 3);
+   ('h', 2); ('i', 2); ('l', 6); ('m', 1); ('n', 2); ('o', 2); ('r', 1);
+   ('s', 1); ('t', 2); ('w', 1)]
+
+  (* "abcabcabc..." *)
+  # let seq2 =
+      Seq.cycle (String.to_seq "abc") |> Seq.take 31
+  val seq2 : char Seq.t = <fun>
+
+  # String.of_seq seq2
+  - : String.t = "abcabcabcabcabcabcabcabcabcabca"
+
+  # count_chars seq2
+  - : (Char.t * int) list = [('a', 11); ('b', 10); ('c', 10)]
+
    diff --git a/ocaml/Stdlib/Hashtbl/module-type-HashedType/index.html b/ocaml/Stdlib/Hashtbl/module-type-HashedType/index.html new file mode 100644 index 0000000..d695185 --- /dev/null +++ b/ocaml/Stdlib/Hashtbl/module-type-HashedType/index.html @@ -0,0 +1,2 @@ + +HashedType (ocaml.Stdlib.Hashtbl.HashedType)

    Module type Hashtbl.HashedType

    The input signature of the functor Make.

    type t

    The type of the hashtable keys.

    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val hash : t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    diff --git a/ocaml/Stdlib/Hashtbl/module-type-S/index.html b/ocaml/Stdlib/Hashtbl/module-type-S/index.html new file mode 100644 index 0000000..9e3f207 --- /dev/null +++ b/ocaml/Stdlib/Hashtbl/module-type-S/index.html @@ -0,0 +1,2 @@ + +S (ocaml.Stdlib.Hashtbl.S)

    Module type Hashtbl.S

    The output signature of the functor Make.

    type key
    type !'a t
    val create : int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    • since 4.00
    val copy : 'a t -> 'a t
    val add : 'a t -> key -> 'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    • since 4.05
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key -> 'a -> unit
    val mem : 'a t -> key -> bool
    val iter : (key -> 'a -> unit) -> 'a t -> unit
    val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
    • since 4.03
    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc
    val length : 'a t -> int
    val stats : 'a t -> statistics
    • since 4.00
    val to_seq : 'a t -> (key * 'a) Seq.t
    • since 4.07
    val to_seq_keys : _ t -> key Seq.t
    • since 4.07
    val to_seq_values : 'a t -> 'a Seq.t
    • since 4.07
    val add_seq : 'a t -> (key * 'a) Seq.t -> unit
    • since 4.07
    val replace_seq : 'a t -> (key * 'a) Seq.t -> unit
    • since 4.07
    val of_seq : (key * 'a) Seq.t -> 'a t
    • since 4.07
    diff --git a/ocaml/Stdlib/Hashtbl/module-type-SeededHashedType/index.html b/ocaml/Stdlib/Hashtbl/module-type-SeededHashedType/index.html new file mode 100644 index 0000000..dfcc2c8 --- /dev/null +++ b/ocaml/Stdlib/Hashtbl/module-type-SeededHashedType/index.html @@ -0,0 +1,2 @@ + +SeededHashedType (ocaml.Stdlib.Hashtbl.SeededHashedType)

    Module type Hashtbl.SeededHashedType

    The input signature of the functor MakeSeeded.

    • since 4.00
    type t

    The type of the hashtable keys.

    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val seeded_hash : int -> t -> int

    A seeded hashing function on keys. The first argument is the seed. It must be the case that if equal x y is true, then seeded_hash seed x = seeded_hash seed y for any value of seed. A suitable choice for seeded_hash is the function Hashtbl.seeded_hash below.

    diff --git a/ocaml/Stdlib/Hashtbl/module-type-SeededS/index.html b/ocaml/Stdlib/Hashtbl/module-type-SeededS/index.html new file mode 100644 index 0000000..58fc8bd --- /dev/null +++ b/ocaml/Stdlib/Hashtbl/module-type-SeededS/index.html @@ -0,0 +1,2 @@ + +SeededS (ocaml.Stdlib.Hashtbl.SeededS)

    Module type Hashtbl.SeededS

    The output signature of the functor MakeSeeded.

    • since 4.00
    type key
    type !'a t
    val create : ?random:bool -> int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    val copy : 'a t -> 'a t
    val add : 'a t -> key -> 'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    • since 4.05
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key -> 'a -> unit
    val mem : 'a t -> key -> bool
    val iter : (key -> 'a -> unit) -> 'a t -> unit
    val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
    • since 4.03
    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc
    val length : 'a t -> int
    val stats : 'a t -> statistics
    val to_seq : 'a t -> (key * 'a) Seq.t
    • since 4.07
    val to_seq_keys : _ t -> key Seq.t
    • since 4.07
    val to_seq_values : 'a t -> 'a Seq.t
    • since 4.07
    val add_seq : 'a t -> (key * 'a) Seq.t -> unit
    • since 4.07
    val replace_seq : 'a t -> (key * 'a) Seq.t -> unit
    • since 4.07
    val of_seq : (key * 'a) Seq.t -> 'a t
    • since 4.07
    diff --git a/ocaml/Stdlib/In_channel/index.html b/ocaml/Stdlib/In_channel/index.html new file mode 100644 index 0000000..6be3f6b --- /dev/null +++ b/ocaml/Stdlib/In_channel/index.html @@ -0,0 +1,12 @@ + +In_channel (ocaml.Stdlib.In_channel)

    Module Stdlib.In_channel

    Input channels.

    This module provides functions for working with input channels.

    See the example section below.

    • since 4.14

    Channels

    type t = in_channel

    The type of input channel.

    type open_flag = open_flag =
    1. | Open_rdonly
      (*

      open for reading.

      *)
    2. | Open_wronly
      (*

      open for writing.

      *)
    3. | Open_append
      (*

      open for appending: always write at end of file.

      *)
    4. | Open_creat
      (*

      create the file if it does not exist.

      *)
    5. | Open_trunc
      (*

      empty the file if it already exists.

      *)
    6. | Open_excl
      (*

      fail if Open_creat and the file already exists.

      *)
    7. | Open_binary
      (*

      open in binary mode (no conversion).

      *)
    8. | Open_text
      (*

      open in text mode (may perform conversions).

      *)
    9. | Open_nonblock
      (*

      open in non-blocking mode.

      *)

    Opening modes for open_gen.

    val stdin : t

    The standard input for the process.

    val open_bin : string -> t

    Open the named file for reading, and return a new input channel on that file, positioned at the beginning of the file.

    val open_text : string -> t

    Same as open_bin, but the file is opened in text mode, so that newline translation takes place during reads. On operating systems that do not distinguish between text mode and binary mode, this function behaves like open_bin.

    val open_gen : open_flag list -> int -> string -> t

    open_gen mode perm filename opens the named file for reading, as described above. The extra arguments mode and perm specify the opening mode and file permissions. open_text and open_bin are special cases of this function.

    val with_open_bin : string -> (t -> 'a) -> 'a

    with_open_bin fn f opens a channel ic on file fn and returns f ic. After f returns, either with a value or by raising an exception, ic is guaranteed to be closed.

    val with_open_text : string -> (t -> 'a) -> 'a

    Like with_open_bin, but the channel is opened in text mode (see open_text).

    val with_open_gen : open_flag list -> int -> string -> (t -> 'a) -> 'a

    Like with_open_bin, but can specify the opening mode and file permission, in case the file must be created (see open_gen).

    val close : t -> unit

    Close the given channel. Input functions raise a Sys_error exception when they are applied to a closed input channel, except close, which does nothing when applied to an already closed channel.

    val close_noerr : t -> unit

    Same as close, but ignore all errors.

    Input

    val input_char : t -> char option

    Read one character from the given input channel. Returns None if there are no more characters to read.

    val input_byte : t -> int option

    Same as input_char, but return the 8-bit integer representing the character. Returns None if the end of file was reached.

    val input_line : t -> string option

    input_line ic reads characters from ic until a newline or the end of file is reached. Returns the string of all characters read, without the newline (if any). Returns None if the end of the file has been reached. In particular, this will be the case if the last line of input is empty.

    A newline is the character \n unless the file is open in text mode and Sys.win32 is true in which case it is the sequence of characters \r\n.

    val really_input_string : t -> int -> string option

    really_input_string ic len reads len characters from channel ic and returns them in a new string. Returns None if the end of file is reached before len characters have been read.

    If the same channel is read concurrently by multiple threads, the returned string is not guaranteed to contain contiguous characters from the input.

    val input_all : t -> string

    input_all ic reads all remaining data from ic.

    If the same channel is read concurrently by multiple threads, the returned string is not guaranteed to contain contiguous characters from the input.

    val input_lines : t -> string list

    input_lines ic reads lines using input_line until the end of file is reached. It returns the list of all lines read, in the order they were read. The newline characters that terminate lines are not included in the returned strings. Empty lines produce empty strings.

    • since 5.1

    Advanced input

    val input : t -> bytes -> int -> int -> int

    input ic buf pos len reads up to len characters from the given channel ic, storing them in byte sequence buf, starting at character number pos. It returns the actual number of characters read, between 0 and len (inclusive). A return value of 0 means that the end of file was reached.

    Use really_input to read exactly len characters.

    val input_bigarray : + t -> + (_, Bigarray.int8_unsigned_elt, Bigarray.c_layout) Bigarray.Array1.t -> + int -> + int -> + int

    Same as input, but read the data into a bigarray.

    • since 5.2
    val really_input : t -> bytes -> int -> int -> unit option

    really_input ic buf pos len reads len characters from channel ic, storing them in byte sequence buf, starting at character number pos.

    Returns None if the end of file is reached before len characters have been read.

    If the same channel is read concurrently by multiple threads, the bytes read by really_input are not guaranteed to be contiguous.

    val really_input_bigarray : + t -> + (_, Bigarray.int8_unsigned_elt, Bigarray.c_layout) Bigarray.Array1.t -> + int -> + int -> + unit option

    Same as really_input, but read the data into a bigarray.

    • since 5.2
    val fold_lines : ('acc -> string -> 'acc) -> 'acc -> t -> 'acc

    fold_lines f init ic reads lines from ic using input_line until the end of file is reached, and successively passes each line to function f in the style of a fold. More precisely, if lines l1, ..., lN are read, fold_lines f init ic computes f (... (f (f init l1) l2) ...) lN. If f has no side effects, this is equivalent to List.fold_left f init (In_channel.input_lines ic), but is more efficient since it does not construct the list of all lines read.

    • since 5.1

    Seeking

    val seek : t -> int64 -> unit

    seek chan pos sets the current reading position to pos for channel chan. This works only for regular files. On files of other kinds, the behavior is unspecified.

    val pos : t -> int64

    Return the current reading position for the given channel. For files opened in text mode under Windows, the returned position is approximate (owing to end-of-line conversion); in particular, saving the current position with pos, then going back to this position using seek will not work. For this programming idiom to work reliably and portably, the file must be opened in binary mode.

    Attributes

    val length : t -> int64

    Return the size (number of characters) of the regular file on which the given channel is opened. If the channel is opened on a file that is not a regular file, the result is meaningless. The returned size does not take into account the end-of-line translations that can be performed when reading from a channel opened in text mode.

    val set_binary_mode : t -> bool -> unit

    set_binary_mode ic true sets the channel ic to binary mode: no translations take place during input.

    set_binary_mode ic false sets the channel ic to text mode: depending on the operating system, some translations may take place during input. For instance, under Windows, end-of-lines will be translated from \r\n to \n.

    This function has no effect under operating systems that do not distinguish between text mode and binary mode.

    val is_binary_mode : t -> bool

    is_binary_mode ic returns whether the channel ic is in binary mode (see set_binary_mode).

    • since 5.2
    val isatty : t -> bool

    isatty ic is true if ic refers to a terminal or console window, false otherwise.

    • since 5.1

    Examples

    Reading the contents of a file:

      let read_file file = In_channel.with_open_bin file In_channel.input_all

    Reading a line from stdin:

      let user_input () = In_channel.input_line In_channel.stdin
    diff --git a/ocaml/Stdlib/Int/index.html b/ocaml/Stdlib/Int/index.html new file mode 100644 index 0000000..e830b05 --- /dev/null +++ b/ocaml/Stdlib/Int/index.html @@ -0,0 +1,2 @@ + +Int (ocaml.Stdlib.Int)

    Module Stdlib.Int

    Integer values.

    Integers are Sys.int_size bits wide and use two's complement representation. All operations are taken modulo 2Sys.int_size. They do not fail on overflow.

    • since 4.08

    Integers

    type t = int

    The type for integer values.

    val zero : int

    zero is the integer 0.

    val one : int

    one is the integer 1.

    val minus_one : int

    minus_one is the integer -1.

    val neg : int -> int

    neg x is ~-x.

    val add : int -> int -> int

    add x y is the addition x + y.

    val sub : int -> int -> int

    sub x y is the subtraction x - y.

    val mul : int -> int -> int

    mul x y is the multiplication x * y.

    val div : int -> int -> int

    div x y is the division x / y. See Stdlib.(/) for details.

    val rem : int -> int -> int

    rem x y is the remainder x mod y. See Stdlib.(mod) for details.

    val succ : int -> int

    succ x is add x 1.

    val pred : int -> int

    pred x is sub x 1.

    val abs : int -> int

    abs x is the absolute value of x. That is x if x is positive and neg x if x is negative. Warning. This may be negative if the argument is min_int.

    val max_int : int

    max_int is the greatest representable integer, 2Sys.int_size - 1-1.

    val min_int : int

    min_int is the smallest representable integer, -2Sys.int_size - 1.

    val logand : int -> int -> int

    logand x y is the bitwise logical and of x and y.

    val logor : int -> int -> int

    logor x y is the bitwise logical or of x and y.

    val logxor : int -> int -> int

    logxor x y is the bitwise logical exclusive or of x and y.

    val lognot : int -> int

    lognot x is the bitwise logical negation of x.

    val shift_left : int -> int -> int

    shift_left x n shifts x to the left by n bits. The result is unspecified if n < 0 or n > Sys.int_size.

    val shift_right : int -> int -> int

    shift_right x n shifts x to the right by n bits. This is an arithmetic shift: the sign bit of x is replicated and inserted in the vacated bits. The result is unspecified if n < 0 or n > Sys.int_size.

    val shift_right_logical : int -> int -> int

    shift_right x n shifts x to the right by n bits. This is a logical shift: zeroes are inserted in the vacated bits regardless of the sign of x. The result is unspecified if n < 0 or n > Sys.int_size.

    Predicates and comparisons

    val equal : int -> int -> bool

    equal x y is true if and only if x = y.

    val compare : int -> int -> int

    compare x y is Stdlib.compare x y but more efficient.

    val min : int -> int -> int

    Return the smaller of the two arguments.

    • since 4.13
    val max : int -> int -> int

    Return the greater of the two arguments.

    • since 4.13

    Converting

    val to_float : int -> float

    to_float x is x as a floating point number.

    val of_float : float -> int

    of_float x truncates x to an integer. The result is unspecified if the argument is nan or falls outside the range of representable integers.

    val to_string : int -> string

    to_string x is the written representation of x in decimal.

    val seeded_hash : int -> int -> int

    A seeded hash function for ints, with the same output value as Hashtbl.seeded_hash. This function allows this module to be passed as argument to the functor Hashtbl.MakeSeeded.

    • since 5.1
    val hash : int -> int

    An unseeded hash function for ints, with the same output value as Hashtbl.hash. This function allows this module to be passed as argument to the functor Hashtbl.Make.

    • since 5.1
    diff --git a/ocaml/Stdlib/Int32/index.html b/ocaml/Stdlib/Int32/index.html new file mode 100644 index 0000000..4248534 --- /dev/null +++ b/ocaml/Stdlib/Int32/index.html @@ -0,0 +1,4 @@ + +Int32 (ocaml.Stdlib.Int32)

    Module Stdlib.Int32

    32-bit integers.

    This module provides operations on the type int32 of signed 32-bit integers. Unlike the built-in int type, the type int32 is guaranteed to be exactly 32-bit wide on all platforms. All arithmetic operations over int32 are taken modulo 232.

    Performance notice: values of type int32 occupy more memory space than values of type int, and arithmetic operations on int32 are generally slower than those on int. Use int32 only when the application requires exact 32-bit arithmetic.

    Literals for 32-bit integers are suffixed by l:

      let zero: int32 = 0l
+  let one: int32 = 1l
+  let m_one: int32 = -1l
    val zero : int32

    The 32-bit integer 0.

    val one : int32

    The 32-bit integer 1.

    val minus_one : int32

    The 32-bit integer -1.

    val neg : int32 -> int32

    Unary negation.

    val add : int32 -> int32 -> int32

    Addition.

    val sub : int32 -> int32 -> int32

    Subtraction.

    val mul : int32 -> int32 -> int32

    Multiplication.

    val div : int32 -> int32 -> int32

    Integer division. This division rounds the real quotient of its arguments towards zero, as specified for Stdlib.(/).

    val unsigned_div : int32 -> int32 -> int32

    Same as div, except that arguments and result are interpreted as unsigned 32-bit integers.

    • since 4.08
    val rem : int32 -> int32 -> int32

    Integer remainder. If y is not zero, the result of Int32.rem x y satisfies the following property: x = Int32.add (Int32.mul (Int32.div x y) y) (Int32.rem x y). If y = 0, Int32.rem x y raises Division_by_zero.

    val unsigned_rem : int32 -> int32 -> int32

    Same as rem, except that arguments and result are interpreted as unsigned 32-bit integers.

    • since 4.08
    val succ : int32 -> int32

    Successor. Int32.succ x is Int32.add x Int32.one.

    val pred : int32 -> int32

    Predecessor. Int32.pred x is Int32.sub x Int32.one.

    val abs : int32 -> int32

    abs x is the absolute value of x. On min_int this is min_int itself and thus remains negative.

    val max_int : int32

    The greatest representable 32-bit integer, 231 - 1.

    val min_int : int32

    The smallest representable 32-bit integer, -231.

    val logand : int32 -> int32 -> int32

    Bitwise logical and.

    val logor : int32 -> int32 -> int32

    Bitwise logical or.

    val logxor : int32 -> int32 -> int32

    Bitwise logical exclusive or.

    val lognot : int32 -> int32

    Bitwise logical negation.

    val shift_left : int32 -> int -> int32

    Int32.shift_left x y shifts x to the left by y bits. The result is unspecified if y < 0 or y >= 32.

    val shift_right : int32 -> int -> int32

    Int32.shift_right x y shifts x to the right by y bits. This is an arithmetic shift: the sign bit of x is replicated and inserted in the vacated bits. The result is unspecified if y < 0 or y >= 32.

    val shift_right_logical : int32 -> int -> int32

    Int32.shift_right_logical x y shifts x to the right by y bits. This is a logical shift: zeroes are inserted in the vacated bits regardless of the sign of x. The result is unspecified if y < 0 or y >= 32.

    val of_int : int -> int32

    Convert the given integer (type int) to a 32-bit integer (type int32). On 64-bit platforms, the argument is taken modulo 232.

    val to_int : int32 -> int

    Convert the given 32-bit integer (type int32) to an integer (type int). On 32-bit platforms, the 32-bit integer is taken modulo 231, i.e. the high-order bit is lost during the conversion. On 64-bit platforms, the conversion is exact.

    val unsigned_to_int : int32 -> int option

    Same as to_int, but interprets the argument as an unsigned integer. Returns None if the unsigned value of the argument cannot fit into an int.

    • since 4.08
    val of_float : float -> int32

    Convert the given floating-point number to a 32-bit integer, discarding the fractional part (truncate towards 0). If the truncated floating-point number is outside the range [Int32.min_int, Int32.max_int], no exception is raised, and an unspecified, platform-dependent integer is returned.

    val to_float : int32 -> float

    Convert the given 32-bit integer to a floating-point number.

    val of_string : string -> int32

    Convert the given string to a 32-bit integer. The string is read in decimal (by default, or if the string begins with 0u) or in hexadecimal, octal or binary if the string begins with 0x, 0o or 0b respectively.

    The 0u prefix reads the input as an unsigned integer in the range [0, 2*Int32.max_int+1]. If the input exceeds Int32.max_int it is converted to the signed integer Int32.min_int + input - Int32.max_int - 1.

    The _ (underscore) character can appear anywhere in the string and is ignored.

    • raises Failure

      if the given string is not a valid representation of an integer, or if the integer represented exceeds the range of integers representable in type int32.

    val of_string_opt : string -> int32 option

    Same as of_string, but return None instead of raising.

    • since 4.05
    val to_string : int32 -> string

    Return the string representation of its argument, in signed decimal.

    val bits_of_float : float -> int32

    Return the internal representation of the given float according to the IEEE 754 floating-point 'single format' bit layout. Bit 31 of the result represents the sign of the float; bits 30 to 23 represent the (biased) exponent; bits 22 to 0 represent the mantissa.

    val float_of_bits : int32 -> float

    Return the floating-point number whose internal representation, according to the IEEE 754 floating-point 'single format' bit layout, is the given int32.

    type t = int32

    An alias for the type of 32-bit integers.

    val compare : t -> t -> int

    The comparison function for 32-bit integers, with the same specification as Stdlib.compare. Along with the type t, this function compare allows the module Int32 to be passed as argument to the functors Set.Make and Map.Make.

    val unsigned_compare : t -> t -> int

    Same as compare, except that arguments are interpreted as unsigned 32-bit integers.

    • since 4.08
    val equal : t -> t -> bool

    The equal function for int32s.

    • since 4.03
    val min : t -> t -> t

    Return the smaller of the two arguments.

    • since 4.13
    val max : t -> t -> t

    Return the greater of the two arguments.

    • since 4.13
    val seeded_hash : int -> t -> int

    A seeded hash function for 32-bit ints, with the same output value as Hashtbl.seeded_hash. This function allows this module to be passed as argument to the functor Hashtbl.MakeSeeded.

    • since 5.1
    val hash : t -> int

    An unseeded hash function for 32-bit ints, with the same output value as Hashtbl.hash. This function allows this module to be passed as argument to the functor Hashtbl.Make.

    • since 5.1
    diff --git a/ocaml/Stdlib/Int64/index.html b/ocaml/Stdlib/Int64/index.html new file mode 100644 index 0000000..7d9f6b5 --- /dev/null +++ b/ocaml/Stdlib/Int64/index.html @@ -0,0 +1,4 @@ + +Int64 (ocaml.Stdlib.Int64)

    Module Stdlib.Int64

    64-bit integers.

    This module provides operations on the type int64 of signed 64-bit integers. Unlike the built-in int type, the type int64 is guaranteed to be exactly 64-bit wide on all platforms. All arithmetic operations over int64 are taken modulo 264

    Performance notice: values of type int64 occupy more memory space than values of type int, and arithmetic operations on int64 are generally slower than those on int. Use int64 only when the application requires exact 64-bit arithmetic.

    Literals for 64-bit integers are suffixed by L:

      let zero: int64 = 0L
+  let one: int64 = 1L
+  let m_one: int64 = -1L
    val zero : int64

    The 64-bit integer 0.

    val one : int64

    The 64-bit integer 1.

    val minus_one : int64

    The 64-bit integer -1.

    val neg : int64 -> int64

    Unary negation.

    val add : int64 -> int64 -> int64

    Addition.

    val sub : int64 -> int64 -> int64

    Subtraction.

    val mul : int64 -> int64 -> int64

    Multiplication.

    val div : int64 -> int64 -> int64

    Integer division.

    • raises Division_by_zero

      if the second argument is zero. This division rounds the real quotient of its arguments towards zero, as specified for Stdlib.(/).

    val unsigned_div : int64 -> int64 -> int64

    Same as div, except that arguments and result are interpreted as unsigned 64-bit integers.

    • since 4.08
    val rem : int64 -> int64 -> int64

    Integer remainder. If y is not zero, the result of Int64.rem x y satisfies the following property: x = Int64.add (Int64.mul (Int64.div x y) y) (Int64.rem x y). If y = 0, Int64.rem x y raises Division_by_zero.

    val unsigned_rem : int64 -> int64 -> int64

    Same as rem, except that arguments and result are interpreted as unsigned 64-bit integers.

    • since 4.08
    val succ : int64 -> int64

    Successor. Int64.succ x is Int64.add x Int64.one.

    val pred : int64 -> int64

    Predecessor. Int64.pred x is Int64.sub x Int64.one.

    val abs : int64 -> int64

    abs x is the absolute value of x. On min_int this is min_int itself and thus remains negative.

    val max_int : int64

    The greatest representable 64-bit integer, 263 - 1.

    val min_int : int64

    The smallest representable 64-bit integer, -263.

    val logand : int64 -> int64 -> int64

    Bitwise logical and.

    val logor : int64 -> int64 -> int64

    Bitwise logical or.

    val logxor : int64 -> int64 -> int64

    Bitwise logical exclusive or.

    val lognot : int64 -> int64

    Bitwise logical negation.

    val shift_left : int64 -> int -> int64

    Int64.shift_left x y shifts x to the left by y bits. The result is unspecified if y < 0 or y >= 64.

    val shift_right : int64 -> int -> int64

    Int64.shift_right x y shifts x to the right by y bits. This is an arithmetic shift: the sign bit of x is replicated and inserted in the vacated bits. The result is unspecified if y < 0 or y >= 64.

    val shift_right_logical : int64 -> int -> int64

    Int64.shift_right_logical x y shifts x to the right by y bits. This is a logical shift: zeroes are inserted in the vacated bits regardless of the sign of x. The result is unspecified if y < 0 or y >= 64.

    val of_int : int -> int64

    Convert the given integer (type int) to a 64-bit integer (type int64).

    val to_int : int64 -> int

    Convert the given 64-bit integer (type int64) to an integer (type int). On 64-bit platforms, the 64-bit integer is taken modulo 263, i.e. the high-order bit is lost during the conversion. On 32-bit platforms, the 64-bit integer is taken modulo 231, i.e. the top 33 bits are lost during the conversion.

    val unsigned_to_int : int64 -> int option

    Same as to_int, but interprets the argument as an unsigned integer. Returns None if the unsigned value of the argument cannot fit into an int.

    • since 4.08
    val of_float : float -> int64

    Convert the given floating-point number to a 64-bit integer, discarding the fractional part (truncate towards 0). If the truncated floating-point number is outside the range [Int64.min_int, Int64.max_int], no exception is raised, and an unspecified, platform-dependent integer is returned.

    val to_float : int64 -> float

    Convert the given 64-bit integer to a floating-point number.

    val of_int32 : int32 -> int64

    Convert the given 32-bit integer (type int32) to a 64-bit integer (type int64).

    val to_int32 : int64 -> int32

    Convert the given 64-bit integer (type int64) to a 32-bit integer (type int32). The 64-bit integer is taken modulo 232, i.e. the top 32 bits are lost during the conversion.

    val of_nativeint : nativeint -> int64

    Convert the given native integer (type nativeint) to a 64-bit integer (type int64).

    val to_nativeint : int64 -> nativeint

    Convert the given 64-bit integer (type int64) to a native integer. On 32-bit platforms, the 64-bit integer is taken modulo 232. On 64-bit platforms, the conversion is exact.

    val of_string : string -> int64

    Convert the given string to a 64-bit integer. The string is read in decimal (by default, or if the string begins with 0u) or in hexadecimal, octal or binary if the string begins with 0x, 0o or 0b respectively.

    The 0u prefix reads the input as an unsigned integer in the range [0, 2*Int64.max_int+1]. If the input exceeds Int64.max_int it is converted to the signed integer Int64.min_int + input - Int64.max_int - 1.

    The _ (underscore) character can appear anywhere in the string and is ignored.

    • raises Failure

      if the given string is not a valid representation of an integer, or if the integer represented exceeds the range of integers representable in type int64.

    val of_string_opt : string -> int64 option

    Same as of_string, but return None instead of raising.

    • since 4.05
    val to_string : int64 -> string

    Return the string representation of its argument, in decimal.

    val bits_of_float : float -> int64

    Return the internal representation of the given float according to the IEEE 754 floating-point 'double format' bit layout. Bit 63 of the result represents the sign of the float; bits 62 to 52 represent the (biased) exponent; bits 51 to 0 represent the mantissa.

    val float_of_bits : int64 -> float

    Return the floating-point number whose internal representation, according to the IEEE 754 floating-point 'double format' bit layout, is the given int64.

    type t = int64

    An alias for the type of 64-bit integers.

    val compare : t -> t -> int

    The comparison function for 64-bit integers, with the same specification as Stdlib.compare. Along with the type t, this function compare allows the module Int64 to be passed as argument to the functors Set.Make and Map.Make.

    val unsigned_compare : t -> t -> int

    Same as compare, except that arguments are interpreted as unsigned 64-bit integers.

    • since 4.08
    val equal : t -> t -> bool

    The equal function for int64s.

    • since 4.03
    val min : t -> t -> t

    Return the smaller of the two arguments.

    • since 4.13
    val max : t -> t -> t

    Return the greater of the two arguments.

    • since 4.13
    val seeded_hash : int -> t -> int

    A seeded hash function for 64-bit ints, with the same output value as Hashtbl.seeded_hash. This function allows this module to be passed as argument to the functor Hashtbl.MakeSeeded.

    • since 5.1
    val hash : t -> int

    An unseeded hash function for 64-bit ints, with the same output value as Hashtbl.hash. This function allows this module to be passed as argument to the functor Hashtbl.Make.

    • since 5.1
    diff --git a/ocaml/Stdlib/LargeFile/index.html b/ocaml/Stdlib/LargeFile/index.html new file mode 100644 index 0000000..07cda65 --- /dev/null +++ b/ocaml/Stdlib/LargeFile/index.html @@ -0,0 +1,2 @@ + +LargeFile (ocaml.Stdlib.LargeFile)

    Module Stdlib.LargeFile

    Operations on large files. This sub-module provides 64-bit variants of the channel functions that manipulate file positions and file sizes. By representing positions and sizes by 64-bit integers (type int64) instead of regular integers (type int), these alternate functions allow operating on files whose sizes are greater than max_int.

    val seek_out : out_channel -> int64 -> unit
    val pos_out : out_channel -> int64
    val out_channel_length : out_channel -> int64
    val seek_in : in_channel -> int64 -> unit
    val pos_in : in_channel -> int64
    val in_channel_length : in_channel -> int64
    diff --git a/ocaml/Stdlib/Lazy/index.html b/ocaml/Stdlib/Lazy/index.html new file mode 100644 index 0000000..84509f6 --- /dev/null +++ b/ocaml/Stdlib/Lazy/index.html @@ -0,0 +1,5 @@ + +Lazy (ocaml.Stdlib.Lazy)

    Module Stdlib.Lazy

    Deferred computations.

    type 'a t = 'a CamlinternalLazy.t

    A value of type 'a Lazy.t is a deferred computation, called a suspension, that has a result of type 'a. The special expression syntax lazy (expr) makes a suspension of the computation of expr, without computing expr itself yet. "Forcing" the suspension will then compute expr and return its result. Matching a suspension with the special pattern syntax lazy(pattern) also computes the underlying expression and tries to bind it to pattern:

      let lazy_option_map f x =
+  match x with
+  | lazy (Some x) -> Some (Lazy.force f x)
+  | _ -> None

    Note: If lazy patterns appear in multiple cases in a pattern-matching, lazy expressions may be forced even outside of the case ultimately selected by the pattern matching. In the example above, the suspension x is always computed.

    Note: lazy_t is the built-in type constructor used by the compiler for the lazy keyword. You should not use it directly. Always use Lazy.t instead.

    Note: Lazy.force is not concurrency-safe. If you use this module with multiple fibers, systhreads or domains, then you will need to add some locks. The module however ensures memory-safety, and hence, concurrently accessing this module will not lead to a crash but the behaviour is unspecified.

    Note: if the program is compiled with the -rectypes option, ill-founded recursive definitions of the form let rec x = lazy x or let rec x = lazy(lazy(...(lazy x))) are accepted by the type-checker and lead, when forced, to ill-formed values that trigger infinite loops in the garbage collector and other parts of the run-time system. Without the -rectypes option, such ill-founded recursive definitions are rejected by the type-checker.

    exception Undefined

    Raised when forcing a suspension concurrently from multiple fibers, systhreads or domains, or when the suspension tries to force itself recursively.

    val force : 'a t -> 'a

    force x forces the suspension x and returns its result. If x has already been forced, Lazy.force x returns the same value again without recomputing it. If it raised an exception, the same exception is raised again.

    Iterators

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f x returns a suspension that, when forced, forces x and applies f to its value.

    It is equivalent to lazy (f (Lazy.force x)).

    • since 4.13

    Reasoning on already-forced suspensions

    val is_val : 'a t -> bool

    is_val x returns true if x has already been forced and did not raise an exception.

    • since 4.00
    val from_val : 'a -> 'a t

    from_val v evaluates v first (as any function would) and returns an already-forced suspension of its result. It is the same as let x = v in lazy x, but uses dynamic tests to optimize suspension creation in some cases.

    • since 4.00
    val map_val : ('a -> 'b) -> 'a t -> 'b t

    map_val f x applies f directly if x is already forced, otherwise it behaves as map f x.

    When x is already forced, this behavior saves the construction of a suspension, but on the other hand it performs more work eagerly that may not be useful if you never force the function result.

    If f raises an exception, it will be raised immediately when is_val x, or raised only when forcing the thunk otherwise.

    If map_val f x does not raise an exception, then is_val (map_val f x) is equal to is_val x.

    • since 4.13

    Advanced

    The following definitions are for advanced uses only; they require familiarity with the lazy compilation scheme to be used appropriately.

    val from_fun : (unit -> 'a) -> 'a t

    from_fun f is the same as lazy (f ()) but slightly more efficient.

    It should only be used if the function f is already defined. In particular it is always less efficient to write from_fun (fun () -> expr) than lazy expr.

    • since 4.00
    val force_val : 'a t -> 'a

    force_val x forces the suspension x and returns its result. If x has already been forced, force_val x returns the same value again without recomputing it.

    If the computation of x raises an exception, it is unspecified whether force_val x raises the same exception or Undefined.

    • raises Undefined

      if the forcing of x tries to force x itself recursively.

    diff --git a/ocaml/Stdlib/Lexing/index.html b/ocaml/Stdlib/Lexing/index.html new file mode 100644 index 0000000..f081a89 --- /dev/null +++ b/ocaml/Stdlib/Lexing/index.html @@ -0,0 +1,2 @@ + +Lexing (ocaml.Stdlib.Lexing)

    Module Stdlib.Lexing

    The run-time library for lexers generated by ocamllex.

    Positions

    type position = {
    1. pos_fname : string;
    2. pos_lnum : int;
    3. pos_bol : int;
    4. pos_cnum : int;
    }

    A value of type position describes a point in a source file. pos_fname is the file name; pos_lnum is the line number; pos_bol is the offset of the beginning of the line (number of characters between the beginning of the lexbuf and the beginning of the line); pos_cnum is the offset of the position (number of characters between the beginning of the lexbuf and the position). The difference between pos_cnum and pos_bol is the character offset within the line (i.e. the column number, assuming each character is one column wide).

    See the documentation of type lexbuf for information about how the lexing engine will manage positions.

    val dummy_pos : position

    A value of type position, guaranteed to be different from any valid position.

    Lexer buffers

    type lexbuf = {
    1. refill_buff : lexbuf -> unit;
    2. mutable lex_buffer : bytes;
    3. mutable lex_buffer_len : int;
    4. mutable lex_abs_pos : int;
    5. mutable lex_start_pos : int;
    6. mutable lex_curr_pos : int;
    7. mutable lex_last_pos : int;
    8. mutable lex_last_action : int;
    9. mutable lex_eof_reached : bool;
    10. mutable lex_mem : int array;
    11. mutable lex_start_p : position;
    12. mutable lex_curr_p : position;
    }

    The type of lexer buffers. A lexer buffer is the argument passed to the scanning functions defined by the generated scanners. The lexer buffer holds the current state of the scanner, plus a function to refill the buffer from the input.

    Lexers can optionally maintain the lex_curr_p and lex_start_p position fields. This "position tracking" mode is the default, and it corresponds to passing ~with_position:true to functions that create lexer buffers. In this mode, the lexing engine and lexer actions are co-responsible for properly updating the position fields, as described in the next paragraph. When the mode is explicitly disabled (with ~with_position:false), the lexing engine will not touch the position fields and the lexer actions should be careful not to do it either; the lex_curr_p and lex_start_p field will then always hold the dummy_pos invalid position. Not tracking positions avoids allocations and memory writes and can significantly improve the performance of the lexer in contexts where lex_start_p and lex_curr_p are not needed.

    Position tracking mode works as follows. At each token, the lexing engine will copy lex_curr_p to lex_start_p, then change the pos_cnum field of lex_curr_p by updating it with the number of characters read since the start of the lexbuf. The other fields are left unchanged by the lexing engine. In order to keep them accurate, they must be initialised before the first use of the lexbuf, and updated by the relevant lexer actions (i.e. at each end of line -- see also new_line).

    val from_channel : ?with_positions:bool -> in_channel -> lexbuf

    Create a lexer buffer on the given input channel. Lexing.from_channel inchan returns a lexer buffer which reads from the input channel inchan, at the current reading position.

    val from_string : ?with_positions:bool -> string -> lexbuf

    Create a lexer buffer which reads from the given string. Reading starts from the first character in the string. An end-of-input condition is generated when the end of the string is reached.

    val from_function : ?with_positions:bool -> (bytes -> int -> int) -> lexbuf

    Create a lexer buffer with the given function as its reading method. When the scanner needs more characters, it will call the given function, giving it a byte sequence s and a byte count n. The function should put n bytes or fewer in s, starting at index 0, and return the number of bytes provided. A return value of 0 means end of input.

    val set_position : lexbuf -> position -> unit

    Set the initial tracked input position for lexbuf to a custom value. Ignores pos_fname. See set_filename for changing this field.

    • since 4.11
    val set_filename : lexbuf -> string -> unit

    Set filename in the initial tracked position to file in lexbuf.

    • since 4.11
    val with_positions : lexbuf -> bool

    Tell whether the lexer buffer keeps track of position fields lex_curr_p / lex_start_p, as determined by the corresponding optional argument for functions that create lexer buffers (whose default value is true).

    When with_positions is false, lexer actions should not modify position fields. Doing it nevertheless could re-enable the with_position mode and degrade performances.

    Functions for lexer semantic actions

    The following functions can be called from the semantic actions of lexer definitions (the ML code enclosed in braces that computes the value returned by lexing functions). They give access to the character string matched by the regular expression associated with the semantic action. These functions must be applied to the argument lexbuf, which, in the code generated by ocamllex, is bound to the lexer buffer passed to the parsing function.

    val lexeme : lexbuf -> string

    Lexing.lexeme lexbuf returns the string matched by the regular expression.

    val lexeme_char : lexbuf -> int -> char

    Lexing.lexeme_char lexbuf i returns character number i in the matched string.

    val lexeme_start : lexbuf -> int

    Lexing.lexeme_start lexbuf returns the offset in the input stream of the first character of the matched string. The first character of the stream has offset 0.

    val lexeme_end : lexbuf -> int

    Lexing.lexeme_end lexbuf returns the offset in the input stream of the character following the last character of the matched string. The first character of the stream has offset 0.

    val lexeme_start_p : lexbuf -> position

    Like lexeme_start, but return a complete position instead of an offset. When position tracking is disabled, the function returns dummy_pos.

    val lexeme_end_p : lexbuf -> position

    Like lexeme_end, but return a complete position instead of an offset. When position tracking is disabled, the function returns dummy_pos.

    val new_line : lexbuf -> unit

    Update the lex_curr_p field of the lexbuf to reflect the start of a new line. You can call this function in the semantic action of the rule that matches the end-of-line character. The function does nothing when position tracking is disabled.

    • since 3.11

    Miscellaneous functions

    val flush_input : lexbuf -> unit

    Discard the contents of the buffer and reset the current position to 0. The next use of the lexbuf will trigger a refill.

    diff --git a/ocaml/Stdlib/List/index.html b/ocaml/Stdlib/List/index.html new file mode 100644 index 0000000..47598c2 --- /dev/null +++ b/ocaml/Stdlib/List/index.html @@ -0,0 +1,16 @@ + +List (ocaml.Stdlib.List)

    Module Stdlib.List

    List operations.

    Some functions are flagged as not tail-recursive. A tail-recursive function uses constant stack space, while a non-tail-recursive function uses stack space proportional to the length of its list argument, which can be a problem with very long lists. When the function takes several list arguments, an approximate formula giving stack usage (in some unspecified constant unit) is shown in parentheses.

    The above considerations can usually be ignored if your lists are not longer than about 10000 elements.

    The labeled version of this module can be used as described in the StdLabels module.

    type 'a t = 'a list =
    1. | []
    2. | :: of 'a * 'a list

    An alias for the type of lists.

    val length : 'a list -> int

    Return the length (number of elements) of the given list.

    val compare_lengths : 'a list -> 'b list -> int

    Compare the lengths of two lists. compare_lengths l1 l2 is equivalent to compare (length l1) (length l2), except that the computation stops after reaching the end of the shortest list.

    • since 4.05
    val compare_length_with : 'a list -> int -> int

    Compare the length of a list to an integer. compare_length_with l len is equivalent to compare (length l) len, except that the computation stops after at most len iterations on the list.

    • since 4.05
    val is_empty : 'a list -> bool

    is_empty l is true if and only if l has no elements. It is equivalent to compare_length_with l 0 = 0.

    • since 5.1
    val cons : 'a -> 'a list -> 'a list

    cons x xs is x :: xs

    • since 4.03 (4.05 in ListLabels)
    val hd : 'a list -> 'a

    Return the first element of the given list.

    • raises Failure

      if the list is empty.

    val tl : 'a list -> 'a list

    Return the given list without its first element.

    • raises Failure

      if the list is empty.

    val nth : 'a list -> int -> 'a

    Return the n-th element of the given list. The first element (head of the list) is at position 0.

    • raises Failure

      if the list is too short.

    val nth_opt : 'a list -> int -> 'a option

    Return the n-th element of the given list. The first element (head of the list) is at position 0. Return None if the list is too short.

    • since 4.05
    val rev : 'a list -> 'a list

    List reversal.

    val init : int -> (int -> 'a) -> 'a list

    init len f is [f 0; f 1; ...; f (len-1)], evaluated left to right.

    • since 4.06
    val append : 'a list -> 'a list -> 'a list

    append l0 l1 appends l1 to l0. Same function as the infix operator @.

    • since 5.1 this function is tail-recursive.
    val rev_append : 'a list -> 'a list -> 'a list

    rev_append l1 l2 reverses l1 and concatenates it with l2. This is equivalent to (rev l1) @ l2.

    val concat : 'a list list -> 'a list

    Concatenate a list of lists. The elements of the argument are all concatenated together (in the same order) to give the result. Not tail-recursive (length of the argument + length of the longest sub-list).

    val flatten : 'a list list -> 'a list

    Same as concat. Not tail-recursive (length of the argument + length of the longest sub-list).

    Comparison

    val equal : ('a -> 'a -> bool) -> 'a list -> 'a list -> bool

    equal eq [a1; ...; an] [b1; ..; bm] holds when the two input lists have the same length, and for each pair of elements ai, bi at the same position we have eq ai bi.

    Note: the eq function may be called even if the lists have different length. If you know your equality function is costly, you may want to check compare_lengths first.

    • since 4.12
    val compare : ('a -> 'a -> int) -> 'a list -> 'a list -> int

    compare cmp [a1; ...; an] [b1; ...; bm] performs a lexicographic comparison of the two input lists, using the same 'a -> 'a -> int interface as Stdlib.compare:

    • a1 :: l1 is smaller than a2 :: l2 (negative result) if a1 is smaller than a2, or if they are equal (0 result) and l1 is smaller than l2
    • the empty list [] is strictly smaller than non-empty lists

    Note: the cmp function will be called even if the lists have different lengths.

    • since 4.12

    Iterators

    val iter : ('a -> unit) -> 'a list -> unit

    iter f [a1; ...; an] applies function f in turn to [a1; ...; an]. It is equivalent to f a1; f a2; ...; f an.

    val iteri : (int -> 'a -> unit) -> 'a list -> unit

    Same as iter, but the function is applied to the index of the element as first argument (counting from 0), and the element itself as second argument.

    • since 4.00
    val map : ('a -> 'b) -> 'a list -> 'b list

    map f [a1; ...; an] applies function f to a1, ..., an, and builds the list [f a1; ...; f an] with the results returned by f.

    val mapi : (int -> 'a -> 'b) -> 'a list -> 'b list

    Same as map, but the function is applied to the index of the element as first argument (counting from 0), and the element itself as second argument.

    • since 4.00
    val rev_map : ('a -> 'b) -> 'a list -> 'b list

    rev_map f l gives the same result as rev (map f l), but is more efficient.

    val filter_map : ('a -> 'b option) -> 'a list -> 'b list

    filter_map f l applies f to every element of l, filters out the None elements and returns the list of the arguments of the Some elements.

    • since 4.08
    val concat_map : ('a -> 'b list) -> 'a list -> 'b list

    concat_map f l gives the same result as concat (map f l). Tail-recursive.

    • since 4.10
    val fold_left_map : + ('acc -> 'a -> 'acc * 'b) -> + 'acc -> + 'a list -> + 'acc * 'b list

    fold_left_map is a combination of fold_left and map that threads an accumulator through calls to f.

    • since 4.11
    val fold_left : ('acc -> 'a -> 'acc) -> 'acc -> 'a list -> 'acc

    fold_left f init [b1; ...; bn] is f (... (f (f init b1) b2) ...) bn.

    val fold_right : ('a -> 'acc -> 'acc) -> 'a list -> 'acc -> 'acc

    fold_right f [a1; ...; an] init is f a1 (f a2 (... (f an init) ...)). Not tail-recursive.

    Iterators on two lists

    val iter2 : ('a -> 'b -> unit) -> 'a list -> 'b list -> unit

    iter2 f [a1; ...; an] [b1; ...; bn] calls in turn f a1 b1; ...; f an bn.

    • raises Invalid_argument

      if the two lists are determined to have different lengths.

    val map2 : ('a -> 'b -> 'c) -> 'a list -> 'b list -> 'c list

    map2 f [a1; ...; an] [b1; ...; bn] is [f a1 b1; ...; f an bn].

    • raises Invalid_argument

      if the two lists are determined to have different lengths.

    val rev_map2 : ('a -> 'b -> 'c) -> 'a list -> 'b list -> 'c list

    rev_map2 f l1 l2 gives the same result as rev (map2 f l1 l2), but is more efficient.

    val fold_left2 : + ('acc -> 'a -> 'b -> 'acc) -> + 'acc -> + 'a list -> + 'b list -> + 'acc

    fold_left2 f init [a1; ...; an] [b1; ...; bn] is f (... (f (f init a1 b1) a2 b2) ...) an bn.

    • raises Invalid_argument

      if the two lists are determined to have different lengths.

    val fold_right2 : + ('a -> 'b -> 'acc -> 'acc) -> + 'a list -> + 'b list -> + 'acc -> + 'acc

    fold_right2 f [a1; ...; an] [b1; ...; bn] init is f a1 b1 (f a2 b2 (... (f an bn init) ...)).

    • raises Invalid_argument

      if the two lists are determined to have different lengths. Not tail-recursive.

    List scanning

    val for_all : ('a -> bool) -> 'a list -> bool

    for_all f [a1; ...; an] checks if all elements of the list satisfy the predicate f. That is, it returns (f a1) && (f a2) && ... && (f an) for a non-empty list and true if the list is empty.

    val exists : ('a -> bool) -> 'a list -> bool

    exists f [a1; ...; an] checks if at least one element of the list satisfies the predicate f. That is, it returns (f a1) || (f a2) || ... || (f an) for a non-empty list and false if the list is empty.

    val for_all2 : ('a -> 'b -> bool) -> 'a list -> 'b list -> bool

    Same as for_all, but for a two-argument predicate.

    • raises Invalid_argument

      if the two lists are determined to have different lengths.

    val exists2 : ('a -> 'b -> bool) -> 'a list -> 'b list -> bool

    Same as exists, but for a two-argument predicate.

    • raises Invalid_argument

      if the two lists are determined to have different lengths.

    val mem : 'a -> 'a list -> bool

    mem a set is true if and only if a is equal to an element of set.

    val memq : 'a -> 'a list -> bool

    Same as mem, but uses physical equality instead of structural equality to compare list elements.

    List searching

    val find : ('a -> bool) -> 'a list -> 'a

    find f l returns the first element of the list l that satisfies the predicate f.

    • raises Not_found

      if there is no value that satisfies f in the list l.

    val find_opt : ('a -> bool) -> 'a list -> 'a option

    find f l returns the first element of the list l that satisfies the predicate f. Returns None if there is no value that satisfies f in the list l.

    • since 4.05
    val find_index : ('a -> bool) -> 'a list -> int option

    find_index f xs returns Some i, where i is the index of the first element of the list xs that satisfies f x, if there is such an element.

    It returns None if there is no such element.

    • since 5.1
    val find_map : ('a -> 'b option) -> 'a list -> 'b option

    find_map f l applies f to the elements of l in order, and returns the first result of the form Some v, or None if none exist.

    • since 4.10
    val find_mapi : (int -> 'a -> 'b option) -> 'a list -> 'b option

    Same as find_map, but the predicate is applied to the index of the element as first argument (counting from 0), and the element itself as second argument.

    • since 5.1
    val filter : ('a -> bool) -> 'a list -> 'a list

    filter f l returns all the elements of the list l that satisfy the predicate f. The order of the elements in the input list is preserved.

    val find_all : ('a -> bool) -> 'a list -> 'a list

    find_all is another name for filter.

    val filteri : (int -> 'a -> bool) -> 'a list -> 'a list

    Same as filter, but the predicate is applied to the index of the element as first argument (counting from 0), and the element itself as second argument.

    • since 4.11
    val partition : ('a -> bool) -> 'a list -> 'a list * 'a list

    partition f l returns a pair of lists (l1, l2), where l1 is the list of all the elements of l that satisfy the predicate f, and l2 is the list of all the elements of l that do not satisfy f. The order of the elements in the input list is preserved.

    val partition_map : ('a -> ('b, 'c) Either.t) -> 'a list -> 'b list * 'c list

    partition_map f l returns a pair of lists (l1, l2) such that, for each element x of the input list l:

    • if f x is Left y1, then y1 is in l1, and
    • if f x is Right y2, then y2 is in l2.

    The output elements are included in l1 and l2 in the same relative order as the corresponding input elements in l.

    In particular, partition_map (fun x -> if f x then Left x else Right x) l is equivalent to partition f l.

    • since 4.12

    Association lists

    val assoc : 'a -> ('a * 'b) list -> 'b

    assoc a l returns the value associated with key a in the list of pairs l. That is, assoc a [ ...; (a,b); ...] = b if (a,b) is the leftmost binding of a in list l.

    • raises Not_found

      if there is no value associated with a in the list l.

    val assoc_opt : 'a -> ('a * 'b) list -> 'b option

    assoc_opt a l returns the value associated with key a in the list of pairs l. That is, assoc_opt a [ ...; (a,b); ...] = Some b if (a,b) is the leftmost binding of a in list l. Returns None if there is no value associated with a in the list l.

    • since 4.05
    val assq : 'a -> ('a * 'b) list -> 'b

    Same as assoc, but uses physical equality instead of structural equality to compare keys.

    val assq_opt : 'a -> ('a * 'b) list -> 'b option

    Same as assoc_opt, but uses physical equality instead of structural equality to compare keys.

    • since 4.05
    val mem_assoc : 'a -> ('a * 'b) list -> bool

    Same as assoc, but simply return true if a binding exists, and false if no bindings exist for the given key.

    val mem_assq : 'a -> ('a * 'b) list -> bool

    Same as mem_assoc, but uses physical equality instead of structural equality to compare keys.

    val remove_assoc : 'a -> ('a * 'b) list -> ('a * 'b) list

    remove_assoc a l returns the list of pairs l without the first pair with key a, if any. Not tail-recursive.

    val remove_assq : 'a -> ('a * 'b) list -> ('a * 'b) list

    Same as remove_assoc, but uses physical equality instead of structural equality to compare keys. Not tail-recursive.

    Lists of pairs

    val split : ('a * 'b) list -> 'a list * 'b list

    Transform a list of pairs into a pair of lists: split [(a1,b1); ...; (an,bn)] is ([a1; ...; an], [b1; ...; bn]). Not tail-recursive.

    val combine : 'a list -> 'b list -> ('a * 'b) list

    Transform a pair of lists into a list of pairs: combine [a1; ...; an] [b1; ...; bn] is [(a1,b1); ...; (an,bn)].

    • raises Invalid_argument

      if the two lists have different lengths. Not tail-recursive.

    Sorting

    val sort : ('a -> 'a -> int) -> 'a list -> 'a list

    Sort a list in increasing order according to a comparison function. The comparison function must return 0 if its arguments compare as equal, a positive integer if the first is greater, and a negative integer if the first is smaller (see Array.sort for a complete specification). For example, Stdlib.compare is a suitable comparison function. The resulting list is sorted in increasing order. sort is guaranteed to run in constant heap space (in addition to the size of the result list) and logarithmic stack space.

    The current implementation uses Merge Sort. It runs in constant heap space and logarithmic stack space.

    val stable_sort : ('a -> 'a -> int) -> 'a list -> 'a list

    Same as sort, but the sorting algorithm is guaranteed to be stable (i.e. elements that compare equal are kept in their original order).

    The current implementation uses Merge Sort. It runs in constant heap space and logarithmic stack space.

    val fast_sort : ('a -> 'a -> int) -> 'a list -> 'a list

    Same as sort or stable_sort, whichever is faster on typical input.

    val sort_uniq : ('a -> 'a -> int) -> 'a list -> 'a list

    Same as sort, but also remove duplicates.

    • since 4.02 (4.03 in ListLabels)
    val merge : ('a -> 'a -> int) -> 'a list -> 'a list -> 'a list

    Merge two lists: Assuming that l1 and l2 are sorted according to the comparison function cmp, merge cmp l1 l2 will return a sorted list containing all the elements of l1 and l2. If several elements compare equal, the elements of l1 will be before the elements of l2. Not tail-recursive (sum of the lengths of the arguments).

    Lists and Sequences

    val to_seq : 'a list -> 'a Seq.t

    Iterate on the list.

    • since 4.07
    val of_seq : 'a Seq.t -> 'a list

    Create a list from a sequence.

    • since 4.07
    diff --git a/ocaml/Stdlib/ListLabels/index.html b/ocaml/Stdlib/ListLabels/index.html new file mode 100644 index 0000000..80f4e92 --- /dev/null +++ b/ocaml/Stdlib/ListLabels/index.html @@ -0,0 +1,16 @@ + +ListLabels (ocaml.Stdlib.ListLabels)

    Module Stdlib.ListLabels

    List operations.

    Some functions are flagged as not tail-recursive. A tail-recursive function uses constant stack space, while a non-tail-recursive function uses stack space proportional to the length of its list argument, which can be a problem with very long lists. When the function takes several list arguments, an approximate formula giving stack usage (in some unspecified constant unit) is shown in parentheses.

    The above considerations can usually be ignored if your lists are not longer than about 10000 elements.

    The labeled version of this module can be used as described in the StdLabels module.

    type 'a t = 'a list =
    1. | []
    2. | :: of 'a * 'a list

    An alias for the type of lists.

    val length : 'a list -> int

    Return the length (number of elements) of the given list.

    val compare_lengths : 'a list -> 'b list -> int

    Compare the lengths of two lists. compare_lengths l1 l2 is equivalent to compare (length l1) (length l2), except that the computation stops after reaching the end of the shortest list.

    • since 4.05
    val compare_length_with : 'a list -> len:int -> int

    Compare the length of a list to an integer. compare_length_with l len is equivalent to compare (length l) len, except that the computation stops after at most len iterations on the list.

    • since 4.05
    val is_empty : 'a list -> bool

    is_empty l is true if and only if l has no elements. It is equivalent to compare_length_with l 0 = 0.

    • since 5.1
    val cons : 'a -> 'a list -> 'a list

    cons x xs is x :: xs

    • since 4.05
    val hd : 'a list -> 'a

    Return the first element of the given list.

    • raises Failure

      if the list is empty.

    val tl : 'a list -> 'a list

    Return the given list without its first element.

    • raises Failure

      if the list is empty.

    val nth : 'a list -> int -> 'a

    Return the n-th element of the given list. The first element (head of the list) is at position 0.

    • raises Failure

      if the list is too short.

    val nth_opt : 'a list -> int -> 'a option

    Return the n-th element of the given list. The first element (head of the list) is at position 0. Return None if the list is too short.

    • since 4.05
    val rev : 'a list -> 'a list

    List reversal.

    val init : len:int -> f:(int -> 'a) -> 'a list

    init ~len ~f is [f 0; f 1; ...; f (len-1)], evaluated left to right.

    • since 4.06
    val append : 'a list -> 'a list -> 'a list

    append l0 l1 appends l1 to l0. Same function as the infix operator @.

    • since 5.1 this function is tail-recursive.
    val rev_append : 'a list -> 'a list -> 'a list

    rev_append l1 l2 reverses l1 and concatenates it with l2. This is equivalent to (rev l1) @ l2.

    val concat : 'a list list -> 'a list

    Concatenate a list of lists. The elements of the argument are all concatenated together (in the same order) to give the result. Not tail-recursive (length of the argument + length of the longest sub-list).

    val flatten : 'a list list -> 'a list

    Same as concat. Not tail-recursive (length of the argument + length of the longest sub-list).

    Comparison

    val equal : eq:('a -> 'a -> bool) -> 'a list -> 'a list -> bool

    equal eq [a1; ...; an] [b1; ..; bm] holds when the two input lists have the same length, and for each pair of elements ai, bi at the same position we have eq ai bi.

    Note: the eq function may be called even if the lists have different length. If you know your equality function is costly, you may want to check compare_lengths first.

    • since 4.12
    val compare : cmp:('a -> 'a -> int) -> 'a list -> 'a list -> int

    compare cmp [a1; ...; an] [b1; ...; bm] performs a lexicographic comparison of the two input lists, using the same 'a -> 'a -> int interface as Stdlib.compare:

    • a1 :: l1 is smaller than a2 :: l2 (negative result) if a1 is smaller than a2, or if they are equal (0 result) and l1 is smaller than l2
    • the empty list [] is strictly smaller than non-empty lists

    Note: the cmp function will be called even if the lists have different lengths.

    • since 4.12

    Iterators

    val iter : f:('a -> unit) -> 'a list -> unit

    iter ~f [a1; ...; an] applies function f in turn to [a1; ...; an]. It is equivalent to f a1; f a2; ...; f an.

    val iteri : f:(int -> 'a -> unit) -> 'a list -> unit

    Same as iter, but the function is applied to the index of the element as first argument (counting from 0), and the element itself as second argument.

    • since 4.00
    val map : f:('a -> 'b) -> 'a list -> 'b list

    map ~f [a1; ...; an] applies function f to a1, ..., an, and builds the list [f a1; ...; f an] with the results returned by f.

    val mapi : f:(int -> 'a -> 'b) -> 'a list -> 'b list

    Same as map, but the function is applied to the index of the element as first argument (counting from 0), and the element itself as second argument.

    • since 4.00
    val rev_map : f:('a -> 'b) -> 'a list -> 'b list

    rev_map ~f l gives the same result as rev (map f l), but is more efficient.

    val filter_map : f:('a -> 'b option) -> 'a list -> 'b list

    filter_map ~f l applies f to every element of l, filters out the None elements and returns the list of the arguments of the Some elements.

    • since 4.08
    val concat_map : f:('a -> 'b list) -> 'a list -> 'b list

    concat_map ~f l gives the same result as concat (map f l). Tail-recursive.

    • since 4.10
    val fold_left_map : + f:('acc -> 'a -> 'acc * 'b) -> + init:'acc -> + 'a list -> + 'acc * 'b list

    fold_left_map is a combination of fold_left and map that threads an accumulator through calls to f.

    • since 4.11
    val fold_left : f:('acc -> 'a -> 'acc) -> init:'acc -> 'a list -> 'acc

    fold_left ~f ~init [b1; ...; bn] is f (... (f (f init b1) b2) ...) bn.

    val fold_right : f:('a -> 'acc -> 'acc) -> 'a list -> init:'acc -> 'acc

    fold_right ~f [a1; ...; an] ~init is f a1 (f a2 (... (f an init) ...)). Not tail-recursive.

    Iterators on two lists

    val iter2 : f:('a -> 'b -> unit) -> 'a list -> 'b list -> unit

    iter2 ~f [a1; ...; an] [b1; ...; bn] calls in turn f a1 b1; ...; f an bn.

    • raises Invalid_argument

      if the two lists are determined to have different lengths.

    val map2 : f:('a -> 'b -> 'c) -> 'a list -> 'b list -> 'c list

    map2 ~f [a1; ...; an] [b1; ...; bn] is [f a1 b1; ...; f an bn].

    • raises Invalid_argument

      if the two lists are determined to have different lengths.

    val rev_map2 : f:('a -> 'b -> 'c) -> 'a list -> 'b list -> 'c list

    rev_map2 ~f l1 l2 gives the same result as rev (map2 f l1 l2), but is more efficient.

    val fold_left2 : + f:('acc -> 'a -> 'b -> 'acc) -> + init:'acc -> + 'a list -> + 'b list -> + 'acc

    fold_left2 ~f ~init [a1; ...; an] [b1; ...; bn] is f (... (f (f init a1 b1) a2 b2) ...) an bn.

    • raises Invalid_argument

      if the two lists are determined to have different lengths.

    val fold_right2 : + f:('a -> 'b -> 'acc -> 'acc) -> + 'a list -> + 'b list -> + init:'acc -> + 'acc

    fold_right2 ~f [a1; ...; an] [b1; ...; bn] ~init is f a1 b1 (f a2 b2 (... (f an bn init) ...)).

    • raises Invalid_argument

      if the two lists are determined to have different lengths. Not tail-recursive.

    List scanning

    val for_all : f:('a -> bool) -> 'a list -> bool

    for_all ~f [a1; ...; an] checks if all elements of the list satisfy the predicate f. That is, it returns (f a1) && (f a2) && ... && (f an) for a non-empty list and true if the list is empty.

    val exists : f:('a -> bool) -> 'a list -> bool

    exists ~f [a1; ...; an] checks if at least one element of the list satisfies the predicate f. That is, it returns (f a1) || (f a2) || ... || (f an) for a non-empty list and false if the list is empty.

    val for_all2 : f:('a -> 'b -> bool) -> 'a list -> 'b list -> bool

    Same as for_all, but for a two-argument predicate.

    • raises Invalid_argument

      if the two lists are determined to have different lengths.

    val exists2 : f:('a -> 'b -> bool) -> 'a list -> 'b list -> bool

    Same as exists, but for a two-argument predicate.

    • raises Invalid_argument

      if the two lists are determined to have different lengths.

    val mem : 'a -> set:'a list -> bool

    mem a ~set is true if and only if a is equal to an element of set.

    val memq : 'a -> set:'a list -> bool

    Same as mem, but uses physical equality instead of structural equality to compare list elements.

    List searching

    val find : f:('a -> bool) -> 'a list -> 'a

    find ~f l returns the first element of the list l that satisfies the predicate f.

    • raises Not_found

      if there is no value that satisfies f in the list l.

    val find_opt : f:('a -> bool) -> 'a list -> 'a option

    find ~f l returns the first element of the list l that satisfies the predicate f. Returns None if there is no value that satisfies f in the list l.

    • since 4.05
    val find_index : f:('a -> bool) -> 'a list -> int option

    find_index ~f xs returns Some i, where i is the index of the first element of the list xs that satisfies f x, if there is such an element.

    It returns None if there is no such element.

    • since 5.1
    val find_map : f:('a -> 'b option) -> 'a list -> 'b option

    find_map ~f l applies f to the elements of l in order, and returns the first result of the form Some v, or None if none exist.

    • since 4.10
    val find_mapi : f:(int -> 'a -> 'b option) -> 'a list -> 'b option

    Same as find_map, but the predicate is applied to the index of the element as first argument (counting from 0), and the element itself as second argument.

    • since 5.1
    val filter : f:('a -> bool) -> 'a list -> 'a list

    filter ~f l returns all the elements of the list l that satisfy the predicate f. The order of the elements in the input list is preserved.

    val find_all : f:('a -> bool) -> 'a list -> 'a list

    find_all is another name for filter.

    val filteri : f:(int -> 'a -> bool) -> 'a list -> 'a list

    Same as filter, but the predicate is applied to the index of the element as first argument (counting from 0), and the element itself as second argument.

    • since 4.11
    val partition : f:('a -> bool) -> 'a list -> 'a list * 'a list

    partition ~f l returns a pair of lists (l1, l2), where l1 is the list of all the elements of l that satisfy the predicate f, and l2 is the list of all the elements of l that do not satisfy f. The order of the elements in the input list is preserved.

    val partition_map : f:('a -> ('b, 'c) Either.t) -> 'a list -> 'b list * 'c list

    partition_map f l returns a pair of lists (l1, l2) such that, for each element x of the input list l:

    • if f x is Left y1, then y1 is in l1, and
    • if f x is Right y2, then y2 is in l2.

    The output elements are included in l1 and l2 in the same relative order as the corresponding input elements in l.

    In particular, partition_map (fun x -> if f x then Left x else Right x) l is equivalent to partition f l.

    • since 4.12

    Association lists

    val assoc : 'a -> ('a * 'b) list -> 'b

    assoc a l returns the value associated with key a in the list of pairs l. That is, assoc a [ ...; (a,b); ...] = b if (a,b) is the leftmost binding of a in list l.

    • raises Not_found

      if there is no value associated with a in the list l.

    val assoc_opt : 'a -> ('a * 'b) list -> 'b option

    assoc_opt a l returns the value associated with key a in the list of pairs l. That is, assoc_opt a [ ...; (a,b); ...] = Some b if (a,b) is the leftmost binding of a in list l. Returns None if there is no value associated with a in the list l.

    • since 4.05
    val assq : 'a -> ('a * 'b) list -> 'b

    Same as assoc, but uses physical equality instead of structural equality to compare keys.

    val assq_opt : 'a -> ('a * 'b) list -> 'b option

    Same as assoc_opt, but uses physical equality instead of structural equality to compare keys.

    • since 4.05
    val mem_assoc : 'a -> map:('a * 'b) list -> bool

    Same as assoc, but simply return true if a binding exists, and false if no bindings exist for the given key.

    val mem_assq : 'a -> map:('a * 'b) list -> bool

    Same as mem_assoc, but uses physical equality instead of structural equality to compare keys.

    val remove_assoc : 'a -> ('a * 'b) list -> ('a * 'b) list

    remove_assoc a l returns the list of pairs l without the first pair with key a, if any. Not tail-recursive.

    val remove_assq : 'a -> ('a * 'b) list -> ('a * 'b) list

    Same as remove_assoc, but uses physical equality instead of structural equality to compare keys. Not tail-recursive.

    Lists of pairs

    val split : ('a * 'b) list -> 'a list * 'b list

    Transform a list of pairs into a pair of lists: split [(a1,b1); ...; (an,bn)] is ([a1; ...; an], [b1; ...; bn]). Not tail-recursive.

    val combine : 'a list -> 'b list -> ('a * 'b) list

    Transform a pair of lists into a list of pairs: combine [a1; ...; an] [b1; ...; bn] is [(a1,b1); ...; (an,bn)].

    • raises Invalid_argument

      if the two lists have different lengths. Not tail-recursive.

    Sorting

    val sort : cmp:('a -> 'a -> int) -> 'a list -> 'a list

    Sort a list in increasing order according to a comparison function. The comparison function must return 0 if its arguments compare as equal, a positive integer if the first is greater, and a negative integer if the first is smaller (see Array.sort for a complete specification). For example, Stdlib.compare is a suitable comparison function. The resulting list is sorted in increasing order. sort is guaranteed to run in constant heap space (in addition to the size of the result list) and logarithmic stack space.

    The current implementation uses Merge Sort. It runs in constant heap space and logarithmic stack space.

    val stable_sort : cmp:('a -> 'a -> int) -> 'a list -> 'a list

    Same as sort, but the sorting algorithm is guaranteed to be stable (i.e. elements that compare equal are kept in their original order).

    The current implementation uses Merge Sort. It runs in constant heap space and logarithmic stack space.

    val fast_sort : cmp:('a -> 'a -> int) -> 'a list -> 'a list

    Same as sort or stable_sort, whichever is faster on typical input.

    val sort_uniq : cmp:('a -> 'a -> int) -> 'a list -> 'a list

    Same as sort, but also remove duplicates.

    • since 4.03
    val merge : cmp:('a -> 'a -> int) -> 'a list -> 'a list -> 'a list

    Merge two lists: Assuming that l1 and l2 are sorted according to the comparison function cmp, merge ~cmp l1 l2 will return a sorted list containing all the elements of l1 and l2. If several elements compare equal, the elements of l1 will be before the elements of l2. Not tail-recursive (sum of the lengths of the arguments).

    Lists and Sequences

    val to_seq : 'a list -> 'a Seq.t

    Iterate on the list.

    • since 4.07
    val of_seq : 'a Seq.t -> 'a list

    Create a list from a sequence.

    • since 4.07
    diff --git a/ocaml/Stdlib/Map/Make/argument-1-Ord/index.html b/ocaml/Stdlib/Map/Make/argument-1-Ord/index.html new file mode 100644 index 0000000..60e406f --- /dev/null +++ b/ocaml/Stdlib/Map/Make/argument-1-Ord/index.html @@ -0,0 +1,2 @@ + +Ord (ocaml.Stdlib.Map.Make.Ord)

    Parameter Make.Ord

    type t

    The type of the map keys.

    val compare : t -> t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    diff --git a/ocaml/Stdlib/Map/Make/index.html b/ocaml/Stdlib/Map/Make/index.html new file mode 100644 index 0000000..abb0c64 --- /dev/null +++ b/ocaml/Stdlib/Map/Make/index.html @@ -0,0 +1,8 @@ + +Make (ocaml.Stdlib.Map.Make)

    Module Map.Make

    Functor building an implementation of the map structure given a totally ordered type.

    Parameters

    module Ord : OrderedType

    Signature

    Maps

    type key = Ord.t

    The type of the map keys.

    type !+'a t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key -> 'a -> 'a t -> 'a t

    add key data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key -> 'a -> 'a list t -> 'a list t

    add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

    update key f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : (key -> bool) -> 'a t -> key * 'a

    find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : (key -> bool) -> 'a t -> key * 'a

    find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : (key -> 'a -> unit) -> 'a t -> unit

    iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

    fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : (key -> 'a -> bool) -> 'a t -> 'a t

    filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : (key -> 'a -> bool) -> 'a t -> bool

    for_all f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : (key -> 'a -> bool) -> 'a t -> bool

    exists f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val of_list : (key * 'a) list -> 'a t

    of_list bs adds the bindings of bs to the empty map, in list order (if a key is bound twice in bs the last one takes over).

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    diff --git a/ocaml/Stdlib/Map/index.html b/ocaml/Stdlib/Map/index.html new file mode 100644 index 0000000..9a7917a --- /dev/null +++ b/ocaml/Stdlib/Map/index.html @@ -0,0 +1,13 @@ + +Map (ocaml.Stdlib.Map)

    Module Stdlib.Map

    Association tables over ordered types.

    This module implements applicative association tables, also known as finite maps or dictionaries, given a total ordering function over the keys. All operations over maps are purely applicative (no side-effects). The implementation uses balanced binary trees, and therefore searching and insertion take time logarithmic in the size of the map.

    For instance:

      module IntPairs =
+    struct
+      type t = int * int
+      let compare (x0,y0) (x1,y1) =
+        match Stdlib.compare x0 x1 with
+            0 -> Stdlib.compare y0 y1
+          | c -> c
+    end
+
+  module PairsMap = Map.Make(IntPairs)
+
+  let m = PairsMap.(empty |> add (0,1) "hello" |> add (1,0) "world")

    This creates a new module PairsMap, with a new type 'a PairsMap.t of maps from int * int to 'a. In this example, m contains string values so its type is string PairsMap.t.

    module type OrderedType = sig ... end

    Input signature of the functor Make.

    module type S = sig ... end

    Output signature of the functor Make.

    module Make (Ord : OrderedType) : S with type key = Ord.t

    Functor building an implementation of the map structure given a totally ordered type.

    diff --git a/ocaml/Stdlib/Map/module-type-OrderedType/index.html b/ocaml/Stdlib/Map/module-type-OrderedType/index.html new file mode 100644 index 0000000..4d9dafc --- /dev/null +++ b/ocaml/Stdlib/Map/module-type-OrderedType/index.html @@ -0,0 +1,2 @@ + +OrderedType (ocaml.Stdlib.Map.OrderedType)

    Module type Map.OrderedType

    Input signature of the functor Make.

    type t

    The type of the map keys.

    val compare : t -> t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    diff --git a/ocaml/Stdlib/Map/module-type-S/index.html b/ocaml/Stdlib/Map/module-type-S/index.html new file mode 100644 index 0000000..90fffe3 --- /dev/null +++ b/ocaml/Stdlib/Map/module-type-S/index.html @@ -0,0 +1,8 @@ + +S (ocaml.Stdlib.Map.S)

    Module type Map.S

    Output signature of the functor Make.

    Maps

    type key

    The type of the map keys.

    type !+'a t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key -> 'a -> 'a t -> 'a t

    add key data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key -> 'a -> 'a list t -> 'a list t

    add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

    update key f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : (key -> bool) -> 'a t -> key * 'a

    find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : (key -> bool) -> 'a t -> key * 'a

    find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : (key -> 'a -> unit) -> 'a t -> unit

    iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

    fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : (key -> 'a -> bool) -> 'a t -> 'a t

    filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : (key -> 'a -> bool) -> 'a t -> bool

    for_all f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : (key -> 'a -> bool) -> 'a t -> bool

    exists f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val of_list : (key * 'a) list -> 'a t

    of_list bs adds the bindings of bs to the empty map, in list order (if a key is bound twice in bs the last one takes over).

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    diff --git a/ocaml/Stdlib/Marshal/index.html b/ocaml/Stdlib/Marshal/index.html new file mode 100644 index 0000000..a847303 --- /dev/null +++ b/ocaml/Stdlib/Marshal/index.html @@ -0,0 +1,2 @@ + +Marshal (ocaml.Stdlib.Marshal)

    Module Stdlib.Marshal

    Marshaling of data structures.

    This module provides functions to encode arbitrary data structures as sequences of bytes, which can then be written on a file or sent over a pipe or network connection. The bytes can then be read back later, possibly in another process, and decoded back into a data structure. The format for the byte sequences is compatible across all machines for a given version of OCaml.

    Warning: marshaling is currently not type-safe. The type of marshaled data is not transmitted along the value of the data, making it impossible to check that the data read back possesses the type expected by the context. In particular, the result type of the Marshal.from_* functions is given as 'a, but this is misleading: the returned OCaml value does not possess type 'a for all 'a; it has one, unique type which cannot be determined at compile-time. The programmer should explicitly give the expected type of the returned value, using the following syntax:

    • (Marshal.from_channel chan : type). Anything can happen at run-time if the object in the file does not belong to the given type.

    Values of extensible variant types, for example exceptions (of extensible type exn), returned by the unmarshaller should not be pattern-matched over through match ... with or try ... with, because unmarshalling does not preserve the information required for matching their constructors. Structural equalities with other extensible variant values does not work either. Most other uses such as Printexc.to_string, will still work as expected.

    The representation of marshaled values is not human-readable, and uses bytes that are not printable characters. Therefore, input and output channels used in conjunction with Marshal.to_channel and Marshal.from_channel must be opened in binary mode, using e.g. open_out_bin or open_in_bin; channels opened in text mode will cause unmarshaling errors on platforms where text channels behave differently than binary channels, e.g. Windows.

    type extern_flags =
    1. | No_sharing
      (*

      Don't preserve sharing

      *)
    2. | Closures
      (*

      Send function closures

      *)
    3. | Compat_32
      (*

      Ensure 32-bit compatibility

      *)

    The flags to the Marshal.to_* functions below.

    val to_channel : out_channel -> 'a -> extern_flags list -> unit

    Marshal.to_channel chan v flags writes the representation of v on channel chan. The flags argument is a possibly empty list of flags that governs the marshaling behavior with respect to sharing, functional values, and compatibility between 32- and 64-bit platforms.

    If flags does not contain Marshal.No_sharing, circularities and sharing inside the value v are detected and preserved in the sequence of bytes produced. In particular, this guarantees that marshaling always terminates. Sharing between values marshaled by successive calls to Marshal.to_channel is neither detected nor preserved, though. If flags contains Marshal.No_sharing, sharing is ignored. This results in faster marshaling if v contains no shared substructures, but may cause slower marshaling and larger byte representations if v actually contains sharing, or even non-termination if v contains cycles.

    If flags does not contain Marshal.Closures, marshaling fails when it encounters a functional value inside v: only 'pure' data structures, containing neither functions nor objects, can safely be transmitted between different programs. If flags contains Marshal.Closures, functional values will be marshaled as a the position in the code of the program together with the values corresponding to the free variables captured in the closure. In this case, the output of marshaling can only be read back in processes that run exactly the same program, with exactly the same compiled code. (This is checked at un-marshaling time, using an MD5 digest of the code transmitted along with the code position.)

    The exact definition of which free variables are captured in a closure is not specified and can vary between bytecode and native code (and according to optimization flags). In particular, a function value accessing a global reference may or may not include the reference in its closure. If it does, unmarshaling the corresponding closure will create a new reference, different from the global one.

    If flags contains Marshal.Compat_32, marshaling fails when it encounters an integer value outside the range -230, 230-1 of integers that are representable on a 32-bit platform. This ensures that marshaled data generated on a 64-bit platform can be safely read back on a 32-bit platform. If flags does not contain Marshal.Compat_32, integer values outside the range -230, 230-1 are marshaled, and can be read back on a 64-bit platform, but will cause an error at un-marshaling time when read back on a 32-bit platform. The Mashal.Compat_32 flag only matters when marshaling is performed on a 64-bit platform; it has no effect if marshaling is performed on a 32-bit platform.

    • raises Failure

      if chan is not in binary mode.

    val to_bytes : 'a -> extern_flags list -> bytes

    Marshal.to_bytes v flags returns a byte sequence containing the representation of v. The flags argument has the same meaning as for Marshal.to_channel.

    • since 4.02
    val to_string : 'a -> extern_flags list -> string

    Same as to_bytes but return the result as a string instead of a byte sequence.

    val to_buffer : bytes -> int -> int -> 'a -> extern_flags list -> int

    Marshal.to_buffer buff ofs len v flags marshals the value v, storing its byte representation in the sequence buff, starting at index ofs, and writing at most len bytes. It returns the number of bytes actually written to the sequence. If the byte representation of v does not fit in len characters, the exception Failure is raised.

    val from_channel : in_channel -> 'a

    Marshal.from_channel chan reads from channel chan the byte representation of a structured value, as produced by one of the Marshal.to_* functions, and reconstructs and returns the corresponding value.

    • raises End_of_file

      if chan is already at the end of the file.

    • raises Failure

      if the end of the file is reached during unmarshalling itself or if chan is not in binary mode.

    val from_bytes : bytes -> int -> 'a

    Marshal.from_bytes buff ofs unmarshals a structured value like Marshal.from_channel does, except that the byte representation is not read from a channel, but taken from the byte sequence buff, starting at position ofs. The byte sequence is not mutated.

    • since 4.02
    val from_string : string -> int -> 'a

    Same as from_bytes but take a string as argument instead of a byte sequence.

    val header_size : int

    The bytes representing a marshaled value are composed of a fixed-size header and a variable-sized data part, whose size can be determined from the header. Marshal.header_size is the size, in bytes, of the header. Marshal.data_size buff ofs is the size, in bytes, of the data part, assuming a valid header is stored in buff starting at position ofs. Finally, Marshal.total_size buff ofs is the total size, in bytes, of the marshaled value. Both Marshal.data_size and Marshal.total_size raise Failure if buff, ofs does not contain a valid header.

    To read the byte representation of a marshaled value into a byte sequence, the program needs to read first Marshal.header_size bytes into the sequence, then determine the length of the remainder of the representation using Marshal.data_size, make sure the sequence is large enough to hold the remaining data, then read it, and finally call Marshal.from_bytes to unmarshal the value.

    val data_size : bytes -> int -> int

    See Marshal.header_size.

    val total_size : bytes -> int -> int

    See Marshal.header_size.

    Marshal and domain safety

    Care must be taken when marshaling a mutable value that may be modified by a different domain. Mutating a value that is being marshaled (i.e., turned into a sequence of bytes) is a programming error and might result in suprising values (when unmarshaling) due to tearing, since marshaling involves byte-per-byte copy.

    diff --git a/ocaml/Stdlib/MoreLabels/Hashtbl/Make/argument-1-H/index.html b/ocaml/Stdlib/MoreLabels/Hashtbl/Make/argument-1-H/index.html new file mode 100644 index 0000000..8b5798a --- /dev/null +++ b/ocaml/Stdlib/MoreLabels/Hashtbl/Make/argument-1-H/index.html @@ -0,0 +1,2 @@ + +H (ocaml.Stdlib.MoreLabels.Hashtbl.Make.H)

    Parameter Make.H

    type t

    The type of the hashtable keys.

    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val hash : t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    diff --git a/ocaml/Stdlib/MoreLabels/Hashtbl/Make/index.html b/ocaml/Stdlib/MoreLabels/Hashtbl/Make/index.html new file mode 100644 index 0000000..a34aa09 --- /dev/null +++ b/ocaml/Stdlib/MoreLabels/Hashtbl/Make/index.html @@ -0,0 +1,2 @@ + +Make (ocaml.Stdlib.MoreLabels.Hashtbl.Make)

    Module Hashtbl.Make

    Functor building an implementation of the hashtable structure. The functor Hashtbl.Make returns a structure containing a type key of keys and a type 'a t of hash tables associating data of type 'a to keys of type key. The operations perform similarly to those of the generic interface, but use the hashing and equality functions specified in the functor argument H instead of generic equality and hashing. Since the hash function is not seeded, the create operation of the result structure always returns non-randomized hash tables.

    Parameters

    module H : HashedType

    Signature

    type key = H.t
    type 'a t = 'a Hashtbl.Make(H).t
    val create : int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    • since 4.00
    val copy : 'a t -> 'a t
    val add : 'a t -> key:key -> data:'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    • since 4.05
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key:key -> data:'a -> unit
    val mem : 'a t -> key -> bool
    val iter : f:(key:key -> data:'a -> unit) -> 'a t -> unit
    val filter_map_inplace : f:(key:key -> data:'a -> 'a option) -> 'a t -> unit
    • since 4.03
    val fold : f:(key:key -> data:'a -> 'acc -> 'acc) -> 'a t -> init:'acc -> 'acc
    val length : 'a t -> int
    val stats : 'a t -> statistics
    • since 4.00
    val to_seq : 'a t -> (key * 'a) Seq.t
    • since 4.07
    val to_seq_keys : _ t -> key Seq.t
    • since 4.07
    val to_seq_values : 'a t -> 'a Seq.t
    • since 4.07
    val add_seq : 'a t -> (key * 'a) Seq.t -> unit
    • since 4.07
    val replace_seq : 'a t -> (key * 'a) Seq.t -> unit
    • since 4.07
    val of_seq : (key * 'a) Seq.t -> 'a t
    • since 4.07
    diff --git a/ocaml/Stdlib/MoreLabels/Hashtbl/MakeSeeded/argument-1-H/index.html b/ocaml/Stdlib/MoreLabels/Hashtbl/MakeSeeded/argument-1-H/index.html new file mode 100644 index 0000000..14f3288 --- /dev/null +++ b/ocaml/Stdlib/MoreLabels/Hashtbl/MakeSeeded/argument-1-H/index.html @@ -0,0 +1,2 @@ + +H (ocaml.Stdlib.MoreLabels.Hashtbl.MakeSeeded.H)

    Parameter MakeSeeded.H

    type t

    The type of the hashtable keys.

    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val seeded_hash : int -> t -> int

    A seeded hashing function on keys. The first argument is the seed. It must be the case that if equal x y is true, then seeded_hash seed x = seeded_hash seed y for any value of seed. A suitable choice for seeded_hash is the function Hashtbl.seeded_hash below.

    diff --git a/ocaml/Stdlib/MoreLabels/Hashtbl/MakeSeeded/index.html b/ocaml/Stdlib/MoreLabels/Hashtbl/MakeSeeded/index.html new file mode 100644 index 0000000..88a342c --- /dev/null +++ b/ocaml/Stdlib/MoreLabels/Hashtbl/MakeSeeded/index.html @@ -0,0 +1,2 @@ + +MakeSeeded (ocaml.Stdlib.MoreLabels.Hashtbl.MakeSeeded)

    Module Hashtbl.MakeSeeded

    Functor building an implementation of the hashtable structure. The functor Hashtbl.MakeSeeded returns a structure containing a type key of keys and a type 'a t of hash tables associating data of type 'a to keys of type key. The operations perform similarly to those of the generic interface, but use the seeded hashing and equality functions specified in the functor argument H instead of generic equality and hashing. The create operation of the result structure supports the ~random optional parameter and returns randomized hash tables if ~random:true is passed or if randomization is globally on (see Hashtbl.randomize).

    • since 4.00

    Parameters

    Signature

    type key = H.t
    val create : ?random:bool -> int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    val copy : 'a t -> 'a t
    val add : 'a t -> key:key -> data:'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    • since 4.05
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key:key -> data:'a -> unit
    val mem : 'a t -> key -> bool
    val iter : f:(key:key -> data:'a -> unit) -> 'a t -> unit
    val filter_map_inplace : f:(key:key -> data:'a -> 'a option) -> 'a t -> unit
    • since 4.03
    val fold : f:(key:key -> data:'a -> 'acc -> 'acc) -> 'a t -> init:'acc -> 'acc
    val length : 'a t -> int
    val stats : 'a t -> statistics
    val to_seq : 'a t -> (key * 'a) Seq.t
    • since 4.07
    val to_seq_keys : _ t -> key Seq.t
    • since 4.07
    val to_seq_values : 'a t -> 'a Seq.t
    • since 4.07
    val add_seq : 'a t -> (key * 'a) Seq.t -> unit
    • since 4.07
    val replace_seq : 'a t -> (key * 'a) Seq.t -> unit
    • since 4.07
    val of_seq : (key * 'a) Seq.t -> 'a t
    • since 4.07
    diff --git a/ocaml/Stdlib/MoreLabels/Hashtbl/index.html b/ocaml/Stdlib/MoreLabels/Hashtbl/index.html new file mode 100644 index 0000000..e59b415 --- /dev/null +++ b/ocaml/Stdlib/MoreLabels/Hashtbl/index.html @@ -0,0 +1,91 @@ + +Hashtbl (ocaml.Stdlib.MoreLabels.Hashtbl)

    Module MoreLabels.Hashtbl

    Hash tables and hash functions.

    Hash tables are hashed association tables, with in-place modification. Because most operations on a hash table modify their input, they're more commonly used in imperative code. The lookup of the value associated with a key (see find, find_opt) is normally very fast, often faster than the equivalent lookup in Map.

    The functors Make and MakeSeeded can be used when performance or flexibility are key. The user provides custom equality and hash functions for the key type, and obtains a custom hash table type for this particular type of key.

    Warning a hash table is only as good as the hash function. A bad hash function will turn the table into a degenerate association list, with linear time lookup instead of constant time lookup.

    The polymorphic t hash table is useful in simpler cases or in interactive environments. It uses the polymorphic hash function defined in the OCaml runtime (at the time of writing, it's SipHash), as well as the polymorphic equality (=).

    See the examples section.

    Unsynchronized accesses

    Unsynchronized accesses to a hash table may lead to an invalid hash table state. Thus, concurrent accesses to a hash tables must be synchronized (for instance with a Mutex.t).

    Generic interface

    type (!'a, !'b) t = ('a, 'b) Hashtbl.t

    The type of hash tables from type 'a to type 'b.

    val create : ?random:bool -> int -> ('a, 'b) t

    Hashtbl.create n creates a new, empty hash table, with initial size n. For best results, n should be on the order of the expected number of elements that will be in the table. The table grows as needed, so n is just an initial guess.

    The optional ~random parameter (a boolean) controls whether the internal organization of the hash table is randomized at each execution of Hashtbl.create or deterministic over all executions.

    A hash table that is created with ~random set to false uses a fixed hash function (hash) to distribute keys among buckets. As a consequence, collisions between keys happen deterministically. In Web-facing applications or other security-sensitive applications, the deterministic collision patterns can be exploited by a malicious user to create a denial-of-service attack: the attacker sends input crafted to create many collisions in the table, slowing the application down.

    A hash table that is created with ~random set to true uses the seeded hash function seeded_hash with a seed that is randomly chosen at hash table creation time. In effect, the hash function used is randomly selected among 2^{30} different hash functions. All these hash functions have different collision patterns, rendering ineffective the denial-of-service attack described above. However, because of randomization, enumerating all elements of the hash table using fold or iter is no longer deterministic: elements are enumerated in different orders at different runs of the program.

    If no ~random parameter is given, hash tables are created in non-random mode by default. This default can be changed either programmatically by calling randomize or by setting the R flag in the OCAMLRUNPARAM environment variable.

    • before 4.00

      the ~random parameter was not present and all hash tables were created in non-randomized mode.

    val clear : ('a, 'b) t -> unit

    Empty a hash table. Use reset instead of clear to shrink the size of the bucket table to its initial size.

    val reset : ('a, 'b) t -> unit

    Empty a hash table and shrink the size of the bucket table to its initial size.

    • since 4.00
    val copy : ('a, 'b) t -> ('a, 'b) t

    Return a copy of the given hashtable.

    val add : ('a, 'b) t -> key:'a -> data:'b -> unit

    Hashtbl.add tbl ~key ~data adds a binding of key to data in table tbl.

    Warning: Previous bindings for key are not removed, but simply hidden. That is, after performing remove tbl key, the previous binding for key, if any, is restored. (Same behavior as with association lists.)

    If you desire the classic behavior of replacing elements, see replace.

    val find : ('a, 'b) t -> 'a -> 'b

    Hashtbl.find tbl x returns the current binding of x in tbl, or raises Not_found if no such binding exists.

    val find_opt : ('a, 'b) t -> 'a -> 'b option

    Hashtbl.find_opt tbl x returns the current binding of x in tbl, or None if no such binding exists.

    • since 4.05
    val find_all : ('a, 'b) t -> 'a -> 'b list

    Hashtbl.find_all tbl x returns the list of all data associated with x in tbl. The current binding is returned first, then the previous bindings, in reverse order of introduction in the table.

    val mem : ('a, 'b) t -> 'a -> bool

    Hashtbl.mem tbl x checks if x is bound in tbl.

    val remove : ('a, 'b) t -> 'a -> unit

    Hashtbl.remove tbl x removes the current binding of x in tbl, restoring the previous binding if it exists. It does nothing if x is not bound in tbl.

    val replace : ('a, 'b) t -> key:'a -> data:'b -> unit

    Hashtbl.replace tbl ~key ~data replaces the current binding of key in tbl by a binding of key to data. If key is unbound in tbl, a binding of key to data is added to tbl. This is functionally equivalent to remove tbl key followed by add tbl key data.

    val iter : f:(key:'a -> data:'b -> unit) -> ('a, 'b) t -> unit

    Hashtbl.iter ~f tbl applies f to all bindings in table tbl. f receives the key as first argument, and the associated value as second argument. Each binding is presented exactly once to f.

    The order in which the bindings are passed to f is unspecified. However, if the table contains several bindings for the same key, they are passed to f in reverse order of introduction, that is, the most recent binding is passed first.

    If the hash table was created in non-randomized mode, the order in which the bindings are enumerated is reproducible between successive runs of the program, and even between minor versions of OCaml. For randomized hash tables, the order of enumeration is entirely random.

    The behavior is not specified if the hash table is modified by f during the iteration.

    val filter_map_inplace : + f:(key:'a -> data:'b -> 'b option) -> + ('a, 'b) t -> + unit

    Hashtbl.filter_map_inplace ~f tbl applies f to all bindings in table tbl and update each binding depending on the result of f. If f returns None, the binding is discarded. If it returns Some new_val, the binding is update to associate the key to new_val.

    Other comments for iter apply as well.

    • since 4.03
    val fold : + f:(key:'a -> data:'b -> 'acc -> 'acc) -> + ('a, 'b) t -> + init:'acc -> + 'acc

    Hashtbl.fold ~f tbl ~init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in tbl, and d1 ... dN are the associated values. Each binding is presented exactly once to f.

    The order in which the bindings are passed to f is unspecified. However, if the table contains several bindings for the same key, they are passed to f in reverse order of introduction, that is, the most recent binding is passed first.

    If the hash table was created in non-randomized mode, the order in which the bindings are enumerated is reproducible between successive runs of the program, and even between minor versions of OCaml. For randomized hash tables, the order of enumeration is entirely random.

    The behavior is not specified if the hash table is modified by f during the iteration.

    val length : ('a, 'b) t -> int

    Hashtbl.length tbl returns the number of bindings in tbl. It takes constant time. Multiple bindings are counted once each, so Hashtbl.length gives the number of times Hashtbl.iter calls its first argument.

    val randomize : unit -> unit

    After a call to Hashtbl.randomize(), hash tables are created in randomized mode by default: create returns randomized hash tables, unless the ~random:false optional parameter is given. The same effect can be achieved by setting the R parameter in the OCAMLRUNPARAM environment variable.

    It is recommended that applications or Web frameworks that need to protect themselves against the denial-of-service attack described in create call Hashtbl.randomize() at initialization time before any domains are created.

    Note that once Hashtbl.randomize() was called, there is no way to revert to the non-randomized default behavior of create. This is intentional. Non-randomized hash tables can still be created using Hashtbl.create ~random:false.

    • since 4.00
    val is_randomized : unit -> bool

    Return true if the tables are currently created in randomized mode by default, false otherwise.

    • since 4.03
    val rebuild : ?random:bool -> ('a, 'b) t -> ('a, 'b) t

    Return a copy of the given hashtable. Unlike copy, rebuild h re-hashes all the (key, value) entries of the original table h. The returned hash table is randomized if h was randomized, or the optional random parameter is true, or if the default is to create randomized hash tables; see create for more information.

    rebuild can safely be used to import a hash table built by an old version of the Hashtbl module, then marshaled to persistent storage. After unmarshaling, apply rebuild to produce a hash table for the current version of the Hashtbl module.

    • since 4.12
    type statistics = Hashtbl.statistics = {
    1. num_bindings : int;
      (*

      Number of bindings present in the table. Same value as returned by length.

      *)
    2. num_buckets : int;
      (*

      Number of buckets in the table.

      *)
    3. max_bucket_length : int;
      (*

      Maximal number of bindings per bucket.

      *)
    4. bucket_histogram : int array;
      (*

      Histogram of bucket sizes. This array histo has length max_bucket_length + 1. The value of histo.(i) is the number of buckets whose size is i.

      *)
    }
    • since 4.00
    val stats : ('a, 'b) t -> statistics

    Hashtbl.stats tbl returns statistics about the table tbl: number of buckets, size of the biggest bucket, distribution of buckets by size.

    • since 4.00

    Hash tables and Sequences

    val to_seq : ('a, 'b) t -> ('a * 'b) Seq.t

    Iterate on the whole table. The order in which the bindings appear in the sequence is unspecified. However, if the table contains several bindings for the same key, they appear in reversed order of introduction, that is, the most recent binding appears first.

    The behavior is not specified if the hash table is modified during the iteration.

    • since 4.07
    val to_seq_keys : ('a, _) t -> 'a Seq.t

    Same as Seq.map fst (to_seq m)

    • since 4.07
    val to_seq_values : (_, 'b) t -> 'b Seq.t

    Same as Seq.map snd (to_seq m)

    • since 4.07
    val add_seq : ('a, 'b) t -> ('a * 'b) Seq.t -> unit

    Add the given bindings to the table, using add

    • since 4.07
    val replace_seq : ('a, 'b) t -> ('a * 'b) Seq.t -> unit

    Add the given bindings to the table, using replace

    • since 4.07
    val of_seq : ('a * 'b) Seq.t -> ('a, 'b) t

    Build a table from the given bindings. The bindings are added in the same order they appear in the sequence, using replace_seq, which means that if two pairs have the same key, only the latest one will appear in the table.

    • since 4.07

    Functorial interface

    The functorial interface allows the use of specific comparison and hash functions, either for performance/security concerns, or because keys are not hashable/comparable with the polymorphic builtins.

    For instance, one might want to specialize a table for integer keys:

      module IntHash =
+    struct
+      type t = int
+      let equal i j = i=j
+      let hash i = i land max_int
+    end
+
+  module IntHashtbl = Hashtbl.Make(IntHash)
+
+  let h = IntHashtbl.create 17 in
+  IntHashtbl.add h 12 "hello"

    This creates a new module IntHashtbl, with a new type 'a IntHashtbl.t of tables from int to 'a. In this example, h contains string values so its type is string IntHashtbl.t.

    Note that the new type 'a IntHashtbl.t is not compatible with the type ('a,'b) Hashtbl.t of the generic interface. For example, Hashtbl.length h would not type-check, you must use IntHashtbl.length.

    module type HashedType = sig ... end

    The input signature of the functor Make.

    module type S = sig ... end

    The output signature of the functor Make.

    module Make + (H : HashedType) : + S with type key = H.t and type 'a t = 'a Hashtbl.Make(H).t

    Functor building an implementation of the hashtable structure. The functor Hashtbl.Make returns a structure containing a type key of keys and a type 'a t of hash tables associating data of type 'a to keys of type key. The operations perform similarly to those of the generic interface, but use the hashing and equality functions specified in the functor argument H instead of generic equality and hashing. Since the hash function is not seeded, the create operation of the result structure always returns non-randomized hash tables.

    module type SeededHashedType = sig ... end

    The input signature of the functor MakeSeeded.

    module type SeededS = sig ... end

    The output signature of the functor MakeSeeded.

    module MakeSeeded + (H : SeededHashedType) : + SeededS with type key = H.t and type 'a t = 'a Hashtbl.MakeSeeded(H).t

    Functor building an implementation of the hashtable structure. The functor Hashtbl.MakeSeeded returns a structure containing a type key of keys and a type 'a t of hash tables associating data of type 'a to keys of type key. The operations perform similarly to those of the generic interface, but use the seeded hashing and equality functions specified in the functor argument H instead of generic equality and hashing. The create operation of the result structure supports the ~random optional parameter and returns randomized hash tables if ~random:true is passed or if randomization is globally on (see Hashtbl.randomize).

    The polymorphic hash functions

    val hash : 'a -> int

    Hashtbl.hash x associates a nonnegative integer to any value of any type. It is guaranteed that if x = y or Stdlib.compare x y = 0, then hash x = hash y. Moreover, hash always terminates, even on cyclic structures.

    val seeded_hash : int -> 'a -> int

    A variant of hash that is further parameterized by an integer seed.

    • since 4.00
    val hash_param : int -> int -> 'a -> int

    Hashtbl.hash_param meaningful total x computes a hash value for x, with the same properties as for hash. The two extra integer parameters meaningful and total give more precise control over hashing. Hashing performs a breadth-first, left-to-right traversal of the structure x, stopping after meaningful meaningful nodes were encountered, or total nodes (meaningful or not) were encountered. If total as specified by the user exceeds a certain value, currently 256, then it is capped to that value. Meaningful nodes are: integers; floating-point numbers; strings; characters; booleans; and constant constructors. Larger values of meaningful and total means that more nodes are taken into account to compute the final hash value, and therefore collisions are less likely to happen. However, hashing takes longer. The parameters meaningful and total govern the tradeoff between accuracy and speed. As default choices, hash and seeded_hash take meaningful = 10 and total = 100.

    val seeded_hash_param : int -> int -> int -> 'a -> int

    A variant of hash_param that is further parameterized by an integer seed. Usage: Hashtbl.seeded_hash_param meaningful total seed x.

    • since 4.00

    Examples

    Basic Example

      (* 0...99 *)
+  let seq = Seq.ints 0 |> Seq.take 100
+
+  (* build from Seq.t *)
+  # let tbl =
+      seq
+      |> Seq.map (fun x -> x, string_of_int x)
+      |> Hashtbl.of_seq
+  val tbl : (int, string) Hashtbl.t = <abstr>
+
+  # Hashtbl.length tbl
+  - : int = 100
+
+  # Hashtbl.find_opt tbl 32
+  - : string option = Some "32"
+
+  # Hashtbl.find_opt tbl 166
+  - : string option = None
+
+  # Hashtbl.replace tbl 166 "one six six"
+  - : unit = ()
+
+  # Hashtbl.find_opt tbl 166
+  - : string option = Some "one six six"
+
+  # Hashtbl.length tbl
+  - : int = 101

    Counting Elements

    Given a sequence of elements (here, a Seq.t), we want to count how many times each distinct element occurs in the sequence. A simple way to do this, assuming the elements are comparable and hashable, is to use a hash table that maps elements to their number of occurrences.

    Here we illustrate that principle using a sequence of (ascii) characters (type char). We use a custom Char_tbl specialized for char.

      # module Char_tbl = Hashtbl.Make(struct
+      type t = char
+      let equal = Char.equal
+      let hash = Hashtbl.hash
+    end)
+
+  (*  count distinct occurrences of chars in [seq] *)
+  # let count_chars (seq : char Seq.t) : _ list =
+      let counts = Char_tbl.create 16 in
+      Seq.iter
+        (fun c ->
+          let count_c =
+            Char_tbl.find_opt counts c
+            |> Option.value ~default:0
+          in
+          Char_tbl.replace counts c (count_c + 1))
+        seq;
+      (* turn into a list *)
+      Char_tbl.fold (fun c n l -> (c,n) :: l) counts []
+        |> List.sort (fun (c1,_)(c2,_) -> Char.compare c1 c2)
+  val count_chars : Char_tbl.key Seq.t -> (Char.t * int) list = <fun>
+
+  (* basic seq from a string *)
+  # let seq = String.to_seq "hello world, and all the camels in it!"
+  val seq : char Seq.t = <fun>
+
+  # count_chars seq
+  - : (Char.t * int) list =
+  [(' ', 7); ('!', 1); (',', 1); ('a', 3); ('c', 1); ('d', 2); ('e', 3);
+   ('h', 2); ('i', 2); ('l', 6); ('m', 1); ('n', 2); ('o', 2); ('r', 1);
+   ('s', 1); ('t', 2); ('w', 1)]
+
+  (* "abcabcabc..." *)
+  # let seq2 =
+      Seq.cycle (String.to_seq "abc") |> Seq.take 31
+  val seq2 : char Seq.t = <fun>
+
+  # String.of_seq seq2
+  - : String.t = "abcabcabcabcabcabcabcabcabcabca"
+
+  # count_chars seq2
+  - : (Char.t * int) list = [('a', 11); ('b', 10); ('c', 10)]
+
    diff --git a/ocaml/Stdlib/MoreLabels/Hashtbl/module-type-HashedType/index.html b/ocaml/Stdlib/MoreLabels/Hashtbl/module-type-HashedType/index.html new file mode 100644 index 0000000..1d2a454 --- /dev/null +++ b/ocaml/Stdlib/MoreLabels/Hashtbl/module-type-HashedType/index.html @@ -0,0 +1,2 @@ + +HashedType (ocaml.Stdlib.MoreLabels.Hashtbl.HashedType)

    Module type Hashtbl.HashedType

    The input signature of the functor Make.

    type t

    The type of the hashtable keys.

    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val hash : t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    diff --git a/ocaml/Stdlib/MoreLabels/Hashtbl/module-type-S/index.html b/ocaml/Stdlib/MoreLabels/Hashtbl/module-type-S/index.html new file mode 100644 index 0000000..3af59de --- /dev/null +++ b/ocaml/Stdlib/MoreLabels/Hashtbl/module-type-S/index.html @@ -0,0 +1,2 @@ + +S (ocaml.Stdlib.MoreLabels.Hashtbl.S)

    Module type Hashtbl.S

    The output signature of the functor Make.

    type key
    type !'a t
    val create : int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    • since 4.00
    val copy : 'a t -> 'a t
    val add : 'a t -> key:key -> data:'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    • since 4.05
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key:key -> data:'a -> unit
    val mem : 'a t -> key -> bool
    val iter : f:(key:key -> data:'a -> unit) -> 'a t -> unit
    val filter_map_inplace : f:(key:key -> data:'a -> 'a option) -> 'a t -> unit
    • since 4.03
    val fold : f:(key:key -> data:'a -> 'acc -> 'acc) -> 'a t -> init:'acc -> 'acc
    val length : 'a t -> int
    val stats : 'a t -> statistics
    • since 4.00
    val to_seq : 'a t -> (key * 'a) Seq.t
    • since 4.07
    val to_seq_keys : _ t -> key Seq.t
    • since 4.07
    val to_seq_values : 'a t -> 'a Seq.t
    • since 4.07
    val add_seq : 'a t -> (key * 'a) Seq.t -> unit
    • since 4.07
    val replace_seq : 'a t -> (key * 'a) Seq.t -> unit
    • since 4.07
    val of_seq : (key * 'a) Seq.t -> 'a t
    • since 4.07
    diff --git a/ocaml/Stdlib/MoreLabels/Hashtbl/module-type-SeededHashedType/index.html b/ocaml/Stdlib/MoreLabels/Hashtbl/module-type-SeededHashedType/index.html new file mode 100644 index 0000000..867d9d1 --- /dev/null +++ b/ocaml/Stdlib/MoreLabels/Hashtbl/module-type-SeededHashedType/index.html @@ -0,0 +1,2 @@ + +SeededHashedType (ocaml.Stdlib.MoreLabels.Hashtbl.SeededHashedType)

    Module type Hashtbl.SeededHashedType

    The input signature of the functor MakeSeeded.

    • since 4.00
    type t

    The type of the hashtable keys.

    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val seeded_hash : int -> t -> int

    A seeded hashing function on keys. The first argument is the seed. It must be the case that if equal x y is true, then seeded_hash seed x = seeded_hash seed y for any value of seed. A suitable choice for seeded_hash is the function Hashtbl.seeded_hash below.

    diff --git a/ocaml/Stdlib/MoreLabels/Hashtbl/module-type-SeededS/index.html b/ocaml/Stdlib/MoreLabels/Hashtbl/module-type-SeededS/index.html new file mode 100644 index 0000000..08c4e4f --- /dev/null +++ b/ocaml/Stdlib/MoreLabels/Hashtbl/module-type-SeededS/index.html @@ -0,0 +1,2 @@ + +SeededS (ocaml.Stdlib.MoreLabels.Hashtbl.SeededS)

    Module type Hashtbl.SeededS

    The output signature of the functor MakeSeeded.

    • since 4.00
    type key
    type !'a t
    val create : ?random:bool -> int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    val copy : 'a t -> 'a t
    val add : 'a t -> key:key -> data:'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    • since 4.05
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key:key -> data:'a -> unit
    val mem : 'a t -> key -> bool
    val iter : f:(key:key -> data:'a -> unit) -> 'a t -> unit
    val filter_map_inplace : f:(key:key -> data:'a -> 'a option) -> 'a t -> unit
    • since 4.03
    val fold : f:(key:key -> data:'a -> 'acc -> 'acc) -> 'a t -> init:'acc -> 'acc
    val length : 'a t -> int
    val stats : 'a t -> statistics
    val to_seq : 'a t -> (key * 'a) Seq.t
    • since 4.07
    val to_seq_keys : _ t -> key Seq.t
    • since 4.07
    val to_seq_values : 'a t -> 'a Seq.t
    • since 4.07
    val add_seq : 'a t -> (key * 'a) Seq.t -> unit
    • since 4.07
    val replace_seq : 'a t -> (key * 'a) Seq.t -> unit
    • since 4.07
    val of_seq : (key * 'a) Seq.t -> 'a t
    • since 4.07
    diff --git a/ocaml/Stdlib/MoreLabels/Map/Make/argument-1-Ord/index.html b/ocaml/Stdlib/MoreLabels/Map/Make/argument-1-Ord/index.html new file mode 100644 index 0000000..0330886 --- /dev/null +++ b/ocaml/Stdlib/MoreLabels/Map/Make/argument-1-Ord/index.html @@ -0,0 +1,2 @@ + +Ord (ocaml.Stdlib.MoreLabels.Map.Make.Ord)

    Parameter Make.Ord

    type t

    The type of the map keys.

    val compare : t -> t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    diff --git a/ocaml/Stdlib/MoreLabels/Map/Make/index.html b/ocaml/Stdlib/MoreLabels/Map/Make/index.html new file mode 100644 index 0000000..95185ca --- /dev/null +++ b/ocaml/Stdlib/MoreLabels/Map/Make/index.html @@ -0,0 +1,8 @@ + +Make (ocaml.Stdlib.MoreLabels.Map.Make)

    Module Map.Make

    Functor building an implementation of the map structure given a totally ordered type.

    Parameters

    module Ord : OrderedType

    Signature

    Maps

    type key = Ord.t

    The type of the map keys.

    type 'a t = 'a Map.Make(Ord).t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key:key -> data:'a -> 'a t -> 'a t

    add ~key ~data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key:key -> data:'a -> 'a list t -> 'a list t

    add_to_list ~key ~data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key:key -> f:('a option -> 'a option) -> 'a t -> 'a t

    update ~key ~f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + f:(key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge ~f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : f:(key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union ~f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : f:(key -> bool) -> 'a t -> key * 'a

    find_first ~f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : f:(key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt ~f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : f:(key -> bool) -> 'a t -> key * 'a

    find_last ~f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : f:(key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt ~f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : f:(key:key -> data:'a -> unit) -> 'a t -> unit

    iter ~f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : f:(key:key -> data:'a -> 'acc -> 'acc) -> 'a t -> init:'acc -> 'acc

    fold ~f m ~init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : f:('a -> 'b) -> 'a t -> 'b t

    map ~f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : f:(key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : f:(key -> 'a -> bool) -> 'a t -> 'a t

    filter ~f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : f:(key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map ~f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : f:(key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition ~f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : cmp:('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal ~cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : cmp:('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : f:(key -> 'a -> bool) -> 'a t -> bool

    for_all ~f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : f:(key -> 'a -> bool) -> 'a t -> bool

    exists ~f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val of_list : (key * 'a) list -> 'a t

    of_list bs adds the bindings of bs to the empty map, in list order (if a key is bound twice in bs the last one takes over).

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    diff --git a/ocaml/Stdlib/MoreLabels/Map/index.html b/ocaml/Stdlib/MoreLabels/Map/index.html new file mode 100644 index 0000000..b5ab25b --- /dev/null +++ b/ocaml/Stdlib/MoreLabels/Map/index.html @@ -0,0 +1,15 @@ + +Map (ocaml.Stdlib.MoreLabels.Map)

    Module MoreLabels.Map

    Association tables over ordered types.

    This module implements applicative association tables, also known as finite maps or dictionaries, given a total ordering function over the keys. All operations over maps are purely applicative (no side-effects). The implementation uses balanced binary trees, and therefore searching and insertion take time logarithmic in the size of the map.

    For instance:

      module IntPairs =
+    struct
+      type t = int * int
+      let compare (x0,y0) (x1,y1) =
+        match Stdlib.compare x0 x1 with
+            0 -> Stdlib.compare y0 y1
+          | c -> c
+    end
+
+  module PairsMap = Map.Make(IntPairs)
+
+  let m = PairsMap.(empty |> add (0,1) "hello" |> add (1,0) "world")

    This creates a new module PairsMap, with a new type 'a PairsMap.t of maps from int * int to 'a. In this example, m contains string values so its type is string PairsMap.t.

    module type OrderedType = sig ... end

    Input signature of the functor Make.

    module type S = sig ... end

    Output signature of the functor Make.

    module Make + (Ord : OrderedType) : + S with type key = Ord.t and type 'a t = 'a Map.Make(Ord).t

    Functor building an implementation of the map structure given a totally ordered type.

    diff --git a/ocaml/Stdlib/MoreLabels/Map/module-type-OrderedType/index.html b/ocaml/Stdlib/MoreLabels/Map/module-type-OrderedType/index.html new file mode 100644 index 0000000..1a18968 --- /dev/null +++ b/ocaml/Stdlib/MoreLabels/Map/module-type-OrderedType/index.html @@ -0,0 +1,2 @@ + +OrderedType (ocaml.Stdlib.MoreLabels.Map.OrderedType)

    Module type Map.OrderedType

    Input signature of the functor Make.

    type t

    The type of the map keys.

    val compare : t -> t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    diff --git a/ocaml/Stdlib/MoreLabels/Map/module-type-S/index.html b/ocaml/Stdlib/MoreLabels/Map/module-type-S/index.html new file mode 100644 index 0000000..477ecc5 --- /dev/null +++ b/ocaml/Stdlib/MoreLabels/Map/module-type-S/index.html @@ -0,0 +1,8 @@ + +S (ocaml.Stdlib.MoreLabels.Map.S)

    Module type Map.S

    Output signature of the functor Make.

    Maps

    type key

    The type of the map keys.

    type !+'a t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key:key -> data:'a -> 'a t -> 'a t

    add ~key ~data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key:key -> data:'a -> 'a list t -> 'a list t

    add_to_list ~key ~data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key:key -> f:('a option -> 'a option) -> 'a t -> 'a t

    update ~key ~f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + f:(key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge ~f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : f:(key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union ~f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : f:(key -> bool) -> 'a t -> key * 'a

    find_first ~f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : f:(key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt ~f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : f:(key -> bool) -> 'a t -> key * 'a

    find_last ~f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : f:(key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt ~f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : f:(key:key -> data:'a -> unit) -> 'a t -> unit

    iter ~f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : f:(key:key -> data:'a -> 'acc -> 'acc) -> 'a t -> init:'acc -> 'acc

    fold ~f m ~init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : f:('a -> 'b) -> 'a t -> 'b t

    map ~f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : f:(key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : f:(key -> 'a -> bool) -> 'a t -> 'a t

    filter ~f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : f:(key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map ~f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : f:(key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition ~f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : cmp:('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal ~cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : cmp:('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : f:(key -> 'a -> bool) -> 'a t -> bool

    for_all ~f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : f:(key -> 'a -> bool) -> 'a t -> bool

    exists ~f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val of_list : (key * 'a) list -> 'a t

    of_list bs adds the bindings of bs to the empty map, in list order (if a key is bound twice in bs the last one takes over).

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    diff --git a/ocaml/Stdlib/MoreLabels/Set/Make/argument-1-Ord/index.html b/ocaml/Stdlib/MoreLabels/Set/Make/argument-1-Ord/index.html new file mode 100644 index 0000000..47c4331 --- /dev/null +++ b/ocaml/Stdlib/MoreLabels/Set/Make/argument-1-Ord/index.html @@ -0,0 +1,2 @@ + +Ord (ocaml.Stdlib.MoreLabels.Set.Make.Ord)

    Parameter Make.Ord

    type t

    The type of the set elements.

    val compare : t -> t -> int

    A total ordering function over the set elements. This is a two-argument function f such that f e1 e2 is zero if the elements e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    diff --git a/ocaml/Stdlib/MoreLabels/Set/Make/index.html b/ocaml/Stdlib/MoreLabels/Set/Make/index.html new file mode 100644 index 0000000..da0920c --- /dev/null +++ b/ocaml/Stdlib/MoreLabels/Set/Make/index.html @@ -0,0 +1,2 @@ + +Make (ocaml.Stdlib.MoreLabels.Set.Make)

    Module Set.Make

    Functor building an implementation of the set structure given a totally ordered type.

    Parameters

    module Ord : OrderedType

    Signature

    Sets

    type elt = Ord.t

    The type of the set elements.

    The type of sets.

    val empty : t

    The empty set.

    val add : elt -> t -> t

    add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val singleton : elt -> t

    singleton x returns the one-element set containing only x.

    val remove : elt -> t -> t

    remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val union : t -> t -> t

    Set union.

    val inter : t -> t -> t

    Set intersection.

    val disjoint : t -> t -> bool

    Test if two sets are disjoint.

    • since 4.08
    val diff : t -> t -> t

    Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

    val cardinal : t -> int

    Return the number of elements of a set.

    Elements

    val elements : t -> elt list

    Return the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Set.Make.

    val min_elt : t -> elt

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

    val min_elt_opt : t -> elt option

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

    • since 4.05
    val max_elt : t -> elt

    Same as min_elt, but returns the largest element of the given set.

    val max_elt_opt : t -> elt option

    Same as min_elt_opt, but returns the largest element of the given set.

    • since 4.05
    val choose : t -> elt

    Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    val choose_opt : t -> elt option

    Return one element of the given set, or None if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    • since 4.05

    Searching

    val find : elt -> t -> elt

    find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

    • since 4.01
    val find_opt : elt -> t -> elt option

    find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

    • since 4.05
    val find_first : f:(elt -> bool) -> t -> elt

    find_first ~f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

    For example, find_first (fun e -> Ord.compare e x >= 0) s will return the first element e of s where Ord.compare e x >= 0 (intuitively: e >= x), or raise Not_found if x is greater than any element of s.

    • since 4.05
    val find_first_opt : f:(elt -> bool) -> t -> elt option

    find_first_opt ~f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

    • since 4.05
    val find_last : f:(elt -> bool) -> t -> elt

    find_last ~f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

    • since 4.05
    val find_last_opt : f:(elt -> bool) -> t -> elt option

    find_last_opt ~f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

    • since 4.05

    Traversing

    val iter : f:(elt -> unit) -> t -> unit

    iter ~f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.

    val fold : f:(elt -> 'acc -> 'acc) -> t -> init:'acc -> 'acc

    fold ~f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

    Transforming

    val map : f:(elt -> elt) -> t -> t

    map ~f s is the set whose elements are f a0,f a1... f aN, where a0,a1...aN are the elements of s.

    The elements are passed to f in increasing order with respect to the ordering over the type of the elements.

    If no element of s is changed by f, s is returned unchanged. (If each output of f is physically equal to its input, the returned set is physically equal to s.)

    • since 4.04
    val filter : f:(elt -> bool) -> t -> t

    filter ~f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val filter_map : f:(elt -> elt option) -> t -> t

    filter_map ~f s returns the set of all v such that f x = Some v for some element x of s.

    For example,

    filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) s

    is the set of halves of the even elements of s.

    If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned unchanged: the result of the function is then physically equal to s.

    • since 4.11
    val partition : f:(elt -> bool) -> t -> t * t

    partition ~f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

    val split : elt -> t -> t * bool * t

    split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.

    Predicates and comparisons

    val is_empty : t -> bool

    Test whether a set is empty or not.

    val mem : elt -> t -> bool

    mem x s tests whether x belongs to the set s.

    val equal : t -> t -> bool

    equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

    val compare : t -> t -> int

    Total ordering between sets. Can be used as the ordering function for doing sets of sets.

    val subset : t -> t -> bool

    subset s1 s2 tests whether the set s1 is a subset of the set s2.

    val for_all : f:(elt -> bool) -> t -> bool

    for_all ~f s checks if all elements of the set satisfy the predicate f.

    val exists : f:(elt -> bool) -> t -> bool

    exists ~f s checks if at least one element of the set satisfies the predicate f.

    Converting

    val to_list : t -> elt list

    to_list s is elements s.

    • since 5.1
    val of_list : elt list -> t

    of_list l creates a set from a list of elements. This is usually more efficient than folding add over the list, except perhaps for lists with many duplicated elements.

    • since 4.02
    val to_seq_from : elt -> t -> elt Seq.t

    to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

    • since 4.07
    val to_seq : t -> elt Seq.t

    Iterate on the whole set, in ascending order

    • since 4.07
    val to_rev_seq : t -> elt Seq.t

    Iterate on the whole set, in descending order

    • since 4.12
    val add_seq : elt Seq.t -> t -> t

    Add the given elements to the set, in order.

    • since 4.07
    val of_seq : elt Seq.t -> t

    Build a set from the given bindings

    • since 4.07
    diff --git a/ocaml/Stdlib/MoreLabels/Set/index.html b/ocaml/Stdlib/MoreLabels/Set/index.html new file mode 100644 index 0000000..524c0da --- /dev/null +++ b/ocaml/Stdlib/MoreLabels/Set/index.html @@ -0,0 +1,15 @@ + +Set (ocaml.Stdlib.MoreLabels.Set)

    Module MoreLabels.Set

    Sets over ordered types.

    This module implements the set data structure, given a total ordering function over the set elements. All operations over sets are purely applicative (no side-effects). The implementation uses balanced binary trees, and is therefore reasonably efficient: insertion and membership take time logarithmic in the size of the set, for instance.

    The Make functor constructs implementations for any type, given a compare function. For instance:

      module IntPairs =
+    struct
+      type t = int * int
+      let compare (x0,y0) (x1,y1) =
+        match Stdlib.compare x0 x1 with
+            0 -> Stdlib.compare y0 y1
+          | c -> c
+    end
+
+  module PairsSet = Set.Make(IntPairs)
+
+  let m = PairsSet.(empty |> add (2,3) |> add (5,7) |> add (11,13))

    This creates a new module PairsSet, with a new type PairsSet.t of sets of int * int.

    module type OrderedType = sig ... end

    Input signature of the functor Make.

    module type S = sig ... end

    Output signature of the functor Make.

    module Make + (Ord : OrderedType) : + S with type elt = Ord.t and type t = Set.Make(Ord).t

    Functor building an implementation of the set structure given a totally ordered type.

    diff --git a/ocaml/Stdlib/MoreLabels/Set/module-type-OrderedType/index.html b/ocaml/Stdlib/MoreLabels/Set/module-type-OrderedType/index.html new file mode 100644 index 0000000..921b5ba --- /dev/null +++ b/ocaml/Stdlib/MoreLabels/Set/module-type-OrderedType/index.html @@ -0,0 +1,2 @@ + +OrderedType (ocaml.Stdlib.MoreLabels.Set.OrderedType)

    Module type Set.OrderedType

    Input signature of the functor Make.

    type t

    The type of the set elements.

    val compare : t -> t -> int

    A total ordering function over the set elements. This is a two-argument function f such that f e1 e2 is zero if the elements e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    diff --git a/ocaml/Stdlib/MoreLabels/Set/module-type-S/index.html b/ocaml/Stdlib/MoreLabels/Set/module-type-S/index.html new file mode 100644 index 0000000..7fa6249 --- /dev/null +++ b/ocaml/Stdlib/MoreLabels/Set/module-type-S/index.html @@ -0,0 +1,2 @@ + +S (ocaml.Stdlib.MoreLabels.Set.S)

    Module type Set.S

    Output signature of the functor Make.

    Sets

    type elt

    The type of the set elements.

    type t

    The type of sets.

    val empty : t

    The empty set.

    val add : elt -> t -> t

    add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val singleton : elt -> t

    singleton x returns the one-element set containing only x.

    val remove : elt -> t -> t

    remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val union : t -> t -> t

    Set union.

    val inter : t -> t -> t

    Set intersection.

    val disjoint : t -> t -> bool

    Test if two sets are disjoint.

    • since 4.08
    val diff : t -> t -> t

    Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

    val cardinal : t -> int

    Return the number of elements of a set.

    Elements

    val elements : t -> elt list

    Return the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Set.Make.

    val min_elt : t -> elt

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

    val min_elt_opt : t -> elt option

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

    • since 4.05
    val max_elt : t -> elt

    Same as min_elt, but returns the largest element of the given set.

    val max_elt_opt : t -> elt option

    Same as min_elt_opt, but returns the largest element of the given set.

    • since 4.05
    val choose : t -> elt

    Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    val choose_opt : t -> elt option

    Return one element of the given set, or None if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    • since 4.05

    Searching

    val find : elt -> t -> elt

    find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

    • since 4.01
    val find_opt : elt -> t -> elt option

    find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

    • since 4.05
    val find_first : f:(elt -> bool) -> t -> elt

    find_first ~f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

    For example, find_first (fun e -> Ord.compare e x >= 0) s will return the first element e of s where Ord.compare e x >= 0 (intuitively: e >= x), or raise Not_found if x is greater than any element of s.

    • since 4.05
    val find_first_opt : f:(elt -> bool) -> t -> elt option

    find_first_opt ~f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

    • since 4.05
    val find_last : f:(elt -> bool) -> t -> elt

    find_last ~f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

    • since 4.05
    val find_last_opt : f:(elt -> bool) -> t -> elt option

    find_last_opt ~f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

    • since 4.05

    Traversing

    val iter : f:(elt -> unit) -> t -> unit

    iter ~f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.

    val fold : f:(elt -> 'acc -> 'acc) -> t -> init:'acc -> 'acc

    fold ~f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

    Transforming

    val map : f:(elt -> elt) -> t -> t

    map ~f s is the set whose elements are f a0,f a1... f aN, where a0,a1...aN are the elements of s.

    The elements are passed to f in increasing order with respect to the ordering over the type of the elements.

    If no element of s is changed by f, s is returned unchanged. (If each output of f is physically equal to its input, the returned set is physically equal to s.)

    • since 4.04
    val filter : f:(elt -> bool) -> t -> t

    filter ~f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val filter_map : f:(elt -> elt option) -> t -> t

    filter_map ~f s returns the set of all v such that f x = Some v for some element x of s.

    For example,

    filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) s

    is the set of halves of the even elements of s.

    If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned unchanged: the result of the function is then physically equal to s.

    • since 4.11
    val partition : f:(elt -> bool) -> t -> t * t

    partition ~f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

    val split : elt -> t -> t * bool * t

    split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.

    Predicates and comparisons

    val is_empty : t -> bool

    Test whether a set is empty or not.

    val mem : elt -> t -> bool

    mem x s tests whether x belongs to the set s.

    val equal : t -> t -> bool

    equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

    val compare : t -> t -> int

    Total ordering between sets. Can be used as the ordering function for doing sets of sets.

    val subset : t -> t -> bool

    subset s1 s2 tests whether the set s1 is a subset of the set s2.

    val for_all : f:(elt -> bool) -> t -> bool

    for_all ~f s checks if all elements of the set satisfy the predicate f.

    val exists : f:(elt -> bool) -> t -> bool

    exists ~f s checks if at least one element of the set satisfies the predicate f.

    Converting

    val to_list : t -> elt list

    to_list s is elements s.

    • since 5.1
    val of_list : elt list -> t

    of_list l creates a set from a list of elements. This is usually more efficient than folding add over the list, except perhaps for lists with many duplicated elements.

    • since 4.02
    val to_seq_from : elt -> t -> elt Seq.t

    to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

    • since 4.07
    val to_seq : t -> elt Seq.t

    Iterate on the whole set, in ascending order

    • since 4.07
    val to_rev_seq : t -> elt Seq.t

    Iterate on the whole set, in descending order

    • since 4.12
    val add_seq : elt Seq.t -> t -> t

    Add the given elements to the set, in order.

    • since 4.07
    val of_seq : elt Seq.t -> t

    Build a set from the given bindings

    • since 4.07
    diff --git a/ocaml/Stdlib/MoreLabels/index.html b/ocaml/Stdlib/MoreLabels/index.html new file mode 100644 index 0000000..c5988f7 --- /dev/null +++ b/ocaml/Stdlib/MoreLabels/index.html @@ -0,0 +1,4 @@ + +MoreLabels (ocaml.Stdlib.MoreLabels)

    Module Stdlib.MoreLabels

    Extra labeled libraries.

    This meta-module provides labelized versions of the Hashtbl, Map and Set modules.

    This module is intended to be used through open MoreLabels which replaces Hashtbl, Map, and Set with their labeled counterparts.

    For example:

      open MoreLabels
+
+  Hashtbl.iter ~f:(fun ~key ~data -> g key data) table
    module Hashtbl : sig ... end

    Hash tables and hash functions.

    module Map : sig ... end

    Association tables over ordered types.

    module Set : sig ... end

    Sets over ordered types.

    diff --git a/ocaml/Stdlib/Mutex/index.html b/ocaml/Stdlib/Mutex/index.html new file mode 100644 index 0000000..d4cce81 --- /dev/null +++ b/ocaml/Stdlib/Mutex/index.html @@ -0,0 +1,4 @@ + +Mutex (ocaml.Stdlib.Mutex)

    Module Stdlib.Mutex

    Locks for mutual exclusion.

    Mutexes (mutual-exclusion locks) are used to implement critical sections and protect shared mutable data structures against concurrent accesses. The typical use is (if m is the mutex associated with the data structure D):

      Mutex.lock m;
+  (* Critical section that operates over D *);
+  Mutex.unlock m
    type t

    The type of mutexes.

    val create : unit -> t

    Return a new mutex.

    val lock : t -> unit

    Lock the given mutex. Only one thread can have the mutex locked at any time. A thread that attempts to lock a mutex already locked by another thread will suspend until the other thread unlocks the mutex.

    • before 4.12

      Sys_error was not raised for recursive locking (platform-dependent behaviour)

    val try_lock : t -> bool

    Same as Mutex.lock, but does not suspend the calling thread if the mutex is already locked: just return false immediately in that case. If the mutex is unlocked, lock it and return true.

    val unlock : t -> unit

    Unlock the given mutex. Other threads suspended trying to lock the mutex will restart. The mutex must have been previously locked by the thread that calls Mutex.unlock.

    • raises Sys_error

      if the mutex is unlocked or was locked by another thread.

    • before 4.12

      Sys_error was not raised when unlocking an unlocked mutex or when unlocking a mutex from a different thread.

    val protect : t -> (unit -> 'a) -> 'a

    protect mutex f runs f() in a critical section where mutex is locked (using lock); it then takes care of releasing mutex, whether f() returned a value or raised an exception.

    The unlocking operation is guaranteed to always takes place, even in the event an asynchronous exception (e.g. Sys.Break) is raised in some signal handler.

    • since 5.1
    diff --git a/ocaml/Stdlib/Nativeint/index.html b/ocaml/Stdlib/Nativeint/index.html new file mode 100644 index 0000000..bf77e28 --- /dev/null +++ b/ocaml/Stdlib/Nativeint/index.html @@ -0,0 +1,4 @@ + +Nativeint (ocaml.Stdlib.Nativeint)

    Module Stdlib.Nativeint

    Processor-native integers.

    This module provides operations on the type nativeint of signed 32-bit integers (on 32-bit platforms) or signed 64-bit integers (on 64-bit platforms). This integer type has exactly the same width as that of a pointer type in the C compiler. All arithmetic operations over nativeint are taken modulo 232 or 264 depending on the word size of the architecture.

    Performance notice: values of type nativeint occupy more memory space than values of type int, and arithmetic operations on nativeint are generally slower than those on int. Use nativeint only when the application requires the extra bit of precision over the int type.

    Literals for native integers are suffixed by n:

     let zero: nativeint = 0n
+ let one: nativeint = 1n
+ let m_one: nativeint = -1n
    val zero : nativeint

    The native integer 0.

    val one : nativeint

    The native integer 1.

    val minus_one : nativeint

    The native integer -1.

    val neg : nativeint -> nativeint

    Unary negation.

    val add : nativeint -> nativeint -> nativeint

    Addition.

    val sub : nativeint -> nativeint -> nativeint

    Subtraction.

    val mul : nativeint -> nativeint -> nativeint

    Multiplication.

    val div : nativeint -> nativeint -> nativeint

    Integer division. This division rounds the real quotient of its arguments towards zero, as specified for Stdlib.(/).

    val unsigned_div : nativeint -> nativeint -> nativeint

    Same as div, except that arguments and result are interpreted as unsigned native integers.

    • since 4.08
    val rem : nativeint -> nativeint -> nativeint

    Integer remainder. If y is not zero, the result of Nativeint.rem x y satisfies the following properties: Nativeint.zero <= Nativeint.rem x y < Nativeint.abs y and x = Nativeint.add (Nativeint.mul (Nativeint.div x y) y) (Nativeint.rem x y). If y = 0, Nativeint.rem x y raises Division_by_zero.

    val unsigned_rem : nativeint -> nativeint -> nativeint

    Same as rem, except that arguments and result are interpreted as unsigned native integers.

    • since 4.08
    val succ : nativeint -> nativeint

    Successor. Nativeint.succ x is Nativeint.add x Nativeint.one.

    val pred : nativeint -> nativeint

    Predecessor. Nativeint.pred x is Nativeint.sub x Nativeint.one.

    val abs : nativeint -> nativeint

    abs x is the absolute value of x. On min_int this is min_int itself and thus remains negative.

    val size : int

    The size in bits of a native integer. This is equal to 32 on a 32-bit platform and to 64 on a 64-bit platform.

    val max_int : nativeint

    The greatest representable native integer, either 231 - 1 on a 32-bit platform, or 263 - 1 on a 64-bit platform.

    val min_int : nativeint

    The smallest representable native integer, either -231 on a 32-bit platform, or -263 on a 64-bit platform.

    val logand : nativeint -> nativeint -> nativeint

    Bitwise logical and.

    val logor : nativeint -> nativeint -> nativeint

    Bitwise logical or.

    val logxor : nativeint -> nativeint -> nativeint

    Bitwise logical exclusive or.

    val lognot : nativeint -> nativeint

    Bitwise logical negation.

    val shift_left : nativeint -> int -> nativeint

    Nativeint.shift_left x y shifts x to the left by y bits. The result is unspecified if y < 0 or y >= bitsize, where bitsize is 32 on a 32-bit platform and 64 on a 64-bit platform.

    val shift_right : nativeint -> int -> nativeint

    Nativeint.shift_right x y shifts x to the right by y bits. This is an arithmetic shift: the sign bit of x is replicated and inserted in the vacated bits. The result is unspecified if y < 0 or y >= bitsize.

    val shift_right_logical : nativeint -> int -> nativeint

    Nativeint.shift_right_logical x y shifts x to the right by y bits. This is a logical shift: zeroes are inserted in the vacated bits regardless of the sign of x. The result is unspecified if y < 0 or y >= bitsize.

    val of_int : int -> nativeint

    Convert the given integer (type int) to a native integer (type nativeint).

    val to_int : nativeint -> int

    Convert the given native integer (type nativeint) to an integer (type int). The high-order bit is lost during the conversion.

    val unsigned_to_int : nativeint -> int option

    Same as to_int, but interprets the argument as an unsigned integer. Returns None if the unsigned value of the argument cannot fit into an int.

    • since 4.08
    val of_float : float -> nativeint

    Convert the given floating-point number to a native integer, discarding the fractional part (truncate towards 0). If the truncated floating-point number is outside the range [Nativeint.min_int, Nativeint.max_int], no exception is raised, and an unspecified, platform-dependent integer is returned.

    val to_float : nativeint -> float

    Convert the given native integer to a floating-point number.

    val of_int32 : int32 -> nativeint

    Convert the given 32-bit integer (type int32) to a native integer.

    val to_int32 : nativeint -> int32

    Convert the given native integer to a 32-bit integer (type int32). On 64-bit platforms, the 64-bit native integer is taken modulo 232, i.e. the top 32 bits are lost. On 32-bit platforms, the conversion is exact.

    val of_string : string -> nativeint

    Convert the given string to a native integer. The string is read in decimal (by default, or if the string begins with 0u) or in hexadecimal, octal or binary if the string begins with 0x, 0o or 0b respectively.

    The 0u prefix reads the input as an unsigned integer in the range [0, 2*Nativeint.max_int+1]. If the input exceeds Nativeint.max_int it is converted to the signed integer Int64.min_int + input - Nativeint.max_int - 1.

    • raises Failure

      if the given string is not a valid representation of an integer, or if the integer represented exceeds the range of integers representable in type nativeint.

    val of_string_opt : string -> nativeint option

    Same as of_string, but return None instead of raising.

    • since 4.05
    val to_string : nativeint -> string

    Return the string representation of its argument, in decimal.

    type t = nativeint

    An alias for the type of native integers.

    val compare : t -> t -> int

    The comparison function for native integers, with the same specification as Stdlib.compare. Along with the type t, this function compare allows the module Nativeint to be passed as argument to the functors Set.Make and Map.Make.

    val unsigned_compare : t -> t -> int

    Same as compare, except that arguments are interpreted as unsigned native integers.

    • since 4.08
    val equal : t -> t -> bool

    The equal function for native ints.

    • since 4.03
    val min : t -> t -> t

    Return the smaller of the two arguments.

    • since 4.13
    val max : t -> t -> t

    Return the greater of the two arguments.

    • since 4.13
    val seeded_hash : int -> t -> int

    A seeded hash function for native ints, with the same output value as Hashtbl.seeded_hash. This function allows this module to be passed as argument to the functor Hashtbl.MakeSeeded.

    • since 5.1
    val hash : t -> int

    An unseeded hash function for native ints, with the same output value as Hashtbl.hash. This function allows this module to be passed as argument to the functor Hashtbl.Make.

    • since 5.1
    diff --git a/ocaml/Stdlib/Obj/Ephemeron/index.html b/ocaml/Stdlib/Obj/Ephemeron/index.html new file mode 100644 index 0000000..5ff7e11 --- /dev/null +++ b/ocaml/Stdlib/Obj/Ephemeron/index.html @@ -0,0 +1,2 @@ + +Ephemeron (ocaml.Stdlib.Obj.Ephemeron)

    Module Obj.Ephemeron

    Ephemeron with arbitrary arity and untyped

    type obj_t = t

    alias for Obj.t

    type t

    an ephemeron cf Ephemeron

    val create : int -> t

    create n returns an ephemeron with n keys. All the keys and the data are initially empty. The argument n must be between zero and max_ephe_length (limits included).

    val length : t -> int

    return the number of keys

    val get_key : t -> int -> obj_t option
    val get_key_copy : t -> int -> obj_t option
    val set_key : t -> int -> obj_t -> unit
    val unset_key : t -> int -> unit
    val check_key : t -> int -> bool
    val blit_key : t -> int -> t -> int -> int -> unit
    val get_data : t -> obj_t option
    val get_data_copy : t -> obj_t option
    val set_data : t -> obj_t -> unit
    val unset_data : t -> unit
    val check_data : t -> bool
    val blit_data : t -> t -> unit
    val max_ephe_length : int

    Maximum length of an ephemeron, ie the maximum number of keys an ephemeron could contain

    diff --git a/ocaml/Stdlib/Obj/Extension_constructor/index.html b/ocaml/Stdlib/Obj/Extension_constructor/index.html new file mode 100644 index 0000000..5c933a8 --- /dev/null +++ b/ocaml/Stdlib/Obj/Extension_constructor/index.html @@ -0,0 +1,2 @@ + +Extension_constructor (ocaml.Stdlib.Obj.Extension_constructor)

    Module Obj.Extension_constructor

    type t = extension_constructor
    val of_val : 'a -> t
    val name : t -> string
    val id : t -> int
    diff --git a/ocaml/Stdlib/Obj/index.html b/ocaml/Stdlib/Obj/index.html new file mode 100644 index 0000000..28f1a21 --- /dev/null +++ b/ocaml/Stdlib/Obj/index.html @@ -0,0 +1,2 @@ + +Obj (ocaml.Stdlib.Obj)

    Module Stdlib.Obj

    Operations on internal representations of values.

    Not for the casual user.

    type t
    type raw_data = nativeint
    val repr : 'a -> t
    val obj : t -> 'a
    val magic : 'a -> 'b
    val is_block : t -> bool
    val is_int : t -> bool
    val tag : t -> int
    val size : t -> int
    val reachable_words : t -> int

    Computes the total size (in words, including the headers) of all heap blocks accessible from the argument. Statically allocated blocks are included.

    • since 4.04
    val field : t -> int -> t
    val set_field : t -> int -> t -> unit

    When using flambda:

    set_field MUST NOT be called on immutable blocks. (Blocks allocated in C stubs, or with new_block below, are always considered mutable.)

    The same goes for set_double_field.

    For experts only: set_field et al can be made safe by first wrapping the block in Sys.opaque_identity, so any information about its contents will not be propagated.

    val double_field : t -> int -> float
    val set_double_field : t -> int -> float -> unit
    val raw_field : t -> int -> raw_data
    val set_raw_field : t -> int -> raw_data -> unit
    val new_block : int -> int -> t
    val dup : t -> t
    val add_offset : t -> Int32.t -> t
    val with_tag : int -> t -> t
    val first_non_constant_constructor_tag : int
    val last_non_constant_constructor_tag : int
    val forcing_tag : int
    val cont_tag : int
    val lazy_tag : int
    val closure_tag : int
    val object_tag : int
    val infix_tag : int
    val forward_tag : int
    val no_scan_tag : int
    val abstract_tag : int
    val string_tag : int
    val double_tag : int
    val double_array_tag : int
    val custom_tag : int
    val int_tag : int
    val out_of_heap_tag : int
    val unaligned_tag : int
    module Extension_constructor : sig ... end
    module Ephemeron : sig ... end

    Ephemeron with arbitrary arity and untyped

    diff --git a/ocaml/Stdlib/Oo/index.html b/ocaml/Stdlib/Oo/index.html new file mode 100644 index 0000000..929785f --- /dev/null +++ b/ocaml/Stdlib/Oo/index.html @@ -0,0 +1,2 @@ + +Oo (ocaml.Stdlib.Oo)

    Module Stdlib.Oo

    Operations on objects

    val copy : < .. > as 'a -> 'a

    Oo.copy o returns a copy of object o, that is a fresh object with the same methods and instance variables as o.

    • alert unsynchronized_access Unsynchronized accesses to mutable objects are a programming error.
    val id : < .. > -> int

    Return an integer identifying this object, unique for the current execution of the program. The generic comparison and hashing functions are based on this integer. When an object is obtained by unmarshaling, the id is refreshed, and thus different from the original object. As a consequence, the internal invariants of data structures such as hash table or sets containing objects are broken after unmarshaling the data structures.

    diff --git a/ocaml/Stdlib/Option/index.html b/ocaml/Stdlib/Option/index.html new file mode 100644 index 0000000..0c68993 --- /dev/null +++ b/ocaml/Stdlib/Option/index.html @@ -0,0 +1,2 @@ + +Option (ocaml.Stdlib.Option)

    Module Stdlib.Option

    Option values.

    Option values explicitly indicate the presence or absence of a value.

    • since 4.08

    Options

    type 'a t = 'a option =
    1. | None
    2. | Some of 'a

    The type for option values. Either None or a value Some v.

    val none : 'a option

    none is None.

    val some : 'a -> 'a option

    some v is Some v.

    val value : 'a option -> default:'a -> 'a

    value o ~default is v if o is Some v and default otherwise.

    val get : 'a option -> 'a

    get o is v if o is Some v and raise otherwise.

    val bind : 'a option -> ('a -> 'b option) -> 'b option

    bind o f is f v if o is Some v and None if o is None.

    val join : 'a option option -> 'a option

    join oo is Some v if oo is Some (Some v) and None otherwise.

    val map : ('a -> 'b) -> 'a option -> 'b option

    map f o is None if o is None and Some (f v) if o is Some v.

    val fold : none:'a -> some:('b -> 'a) -> 'b option -> 'a

    fold ~none ~some o is none if o is None and some v if o is Some v.

    val iter : ('a -> unit) -> 'a option -> unit

    iter f o is f v if o is Some v and () otherwise.

    Predicates and comparisons

    val is_none : 'a option -> bool

    is_none o is true if and only if o is None.

    val is_some : 'a option -> bool

    is_some o is true if and only if o is Some o.

    val equal : ('a -> 'a -> bool) -> 'a option -> 'a option -> bool

    equal eq o0 o1 is true if and only if o0 and o1 are both None or if they are Some v0 and Some v1 and eq v0 v1 is true.

    val compare : ('a -> 'a -> int) -> 'a option -> 'a option -> int

    compare cmp o0 o1 is a total order on options using cmp to compare values wrapped by Some _. None is smaller than Some _ values.

    Converting

    val to_result : none:'e -> 'a option -> ('a, 'e) result

    to_result ~none o is Ok v if o is Some v and Error none otherwise.

    val to_list : 'a option -> 'a list

    to_list o is [] if o is None and [v] if o is Some v.

    val to_seq : 'a option -> 'a Seq.t

    to_seq o is o as a sequence. None is the empty sequence and Some v is the singleton sequence containing v.

    diff --git a/ocaml/Stdlib/Out_channel/index.html b/ocaml/Stdlib/Out_channel/index.html new file mode 100644 index 0000000..ee7e990 --- /dev/null +++ b/ocaml/Stdlib/Out_channel/index.html @@ -0,0 +1,9 @@ + +Out_channel (ocaml.Stdlib.Out_channel)

    Module Stdlib.Out_channel

    Output channels.

    This module provides functions for working with output channels.

    See the example section below.

    • since 4.14

    Channels

    type t = out_channel

    The type of output channel.

    type open_flag = open_flag =
    1. | Open_rdonly
      (*

      open for reading.

      *)
    2. | Open_wronly
      (*

      open for writing.

      *)
    3. | Open_append
      (*

      open for appending: always write at end of file.

      *)
    4. | Open_creat
      (*

      create the file if it does not exist.

      *)
    5. | Open_trunc
      (*

      empty the file if it already exists.

      *)
    6. | Open_excl
      (*

      fail if Open_creat and the file already exists.

      *)
    7. | Open_binary
      (*

      open in binary mode (no conversion).

      *)
    8. | Open_text
      (*

      open in text mode (may perform conversions).

      *)
    9. | Open_nonblock
      (*

      open in non-blocking mode.

      *)

    Opening modes for open_gen.

    val stdout : t

    The standard output for the process.

    val stderr : t

    The standard error output for the process.

    val open_bin : string -> t

    Open the named file for writing, and return a new output channel on that file, positioned at the beginning of the file. The file is truncated to zero length if it already exists. It is created if it does not already exists.

    val open_text : string -> t

    Same as open_bin, but the file is opened in text mode, so that newline translation takes place during writes. On operating systems that do not distinguish between text mode and binary mode, this function behaves like open_bin.

    val open_gen : open_flag list -> int -> string -> t

    open_gen mode perm filename opens the named file for writing, as described above. The extra argument mode specifies the opening mode. The extra argument perm specifies the file permissions, in case the file must be created. open_text and open_bin are special cases of this function.

    val with_open_bin : string -> (t -> 'a) -> 'a

    with_open_bin fn f opens a channel oc on file fn and returns f oc. After f returns, either with a value or by raising an exception, oc is guaranteed to be closed.

    val with_open_text : string -> (t -> 'a) -> 'a

    Like with_open_bin, but the channel is opened in text mode (see open_text).

    val with_open_gen : open_flag list -> int -> string -> (t -> 'a) -> 'a

    Like with_open_bin, but can specify the opening mode and file permission, in case the file must be created (see open_gen).

    val close : t -> unit

    Close the given channel, flushing all buffered write operations. Output functions raise a Sys_error exception when they are applied to a closed output channel, except close and flush, which do nothing when applied to an already closed channel. Note that close may raise Sys_error if the operating system signals an error when flushing or closing.

    val close_noerr : t -> unit

    Same as close, but ignore all errors.

    Output

    val output_char : t -> char -> unit

    Write the character on the given output channel.

    val output_byte : t -> int -> unit

    Write one 8-bit integer (as the single character with that code) on the given output channel. The given integer is taken modulo 256.

    val output_string : t -> string -> unit

    Write the string on the given output channel.

    val output_bytes : t -> bytes -> unit

    Write the byte sequence on the given output channel.

    Advanced output

    val output : t -> bytes -> int -> int -> unit

    output oc buf pos len writes len characters from byte sequence buf, starting at offset pos, to the given output channel oc.

    val output_substring : t -> string -> int -> int -> unit

    Same as output but take a string as argument instead of a byte sequence.

    val output_bigarray : + t -> + (_, Bigarray.int8_unsigned_elt, Bigarray.c_layout) Bigarray.Array1.t -> + int -> + int -> + unit

    Same as output but take the data from a bigarray.

    • since 5.2

    Flushing

    val flush : t -> unit

    Flush the buffer associated with the given output channel, performing all pending writes on that channel. Interactive programs must be careful about flushing standard output and standard error at the right time.

    val flush_all : unit -> unit

    Flush all open output channels; ignore errors.

    Seeking

    val seek : t -> int64 -> unit

    seek chan pos sets the current writing position to pos for channel chan. This works only for regular files. On files of other kinds (such as terminals, pipes and sockets), the behavior is unspecified.

    val pos : t -> int64

    Return the current writing position for the given channel. Does not work on channels opened with the Open_append flag (returns unspecified results).

    For files opened in text mode under Windows, the returned position is approximate (owing to end-of-line conversion); in particular, saving the current position with pos, then going back to this position using seek will not work. For this programming idiom to work reliably and portably, the file must be opened in binary mode.

    Attributes

    val length : t -> int64

    Return the size (number of characters) of the regular file on which the given channel is opened. If the channel is opened on a file that is not a regular file, the result is meaningless.

    val set_binary_mode : t -> bool -> unit

    set_binary_mode oc true sets the channel oc to binary mode: no translations take place during output.

    set_binary_mode oc false sets the channel oc to text mode: depending on the operating system, some translations may take place during output. For instance, under Windows, end-of-lines will be translated from \n to \r\n.

    This function has no effect under operating systems that do not distinguish between text mode and binary mode.

    val is_binary_mode : t -> bool

    is_binary_mode oc returns whether the channel oc is in binary mode (see set_binary_mode).

    • since 5.2
    val set_buffered : t -> bool -> unit

    set_buffered oc true sets the channel oc to buffered mode. In this mode, data output on oc will be buffered until either the internal buffer is full or the function flush or flush_all is called, at which point it will be sent to the output device.

    set_buffered oc false sets the channel oc to unbuffered mode. In this mode, data output on oc will be sent to the output device immediately.

    All channels are open in buffered mode by default.

    val is_buffered : t -> bool

    is_buffered oc returns whether the channel oc is buffered (see set_buffered).

    val isatty : t -> bool

    isatty oc is true if oc refers to a terminal or console window, false otherwise.

    • since 5.1

    Examples

    Writing the contents of a file:

      let write_file file s =
+    Out_channel.with_open_bin file
+      (fun oc -> Out_channel.output_string oc s))
    diff --git a/ocaml/Stdlib/Parsing/index.html b/ocaml/Stdlib/Parsing/index.html new file mode 100644 index 0000000..adffe17 --- /dev/null +++ b/ocaml/Stdlib/Parsing/index.html @@ -0,0 +1,2 @@ + +Parsing (ocaml.Stdlib.Parsing)

    Module Stdlib.Parsing

    The run-time library for parsers generated by ocamlyacc.

    val symbol_start : unit -> int

    symbol_start and Parsing.symbol_end are to be called in the action part of a grammar rule only. They return the offset of the string that matches the left-hand side of the rule: symbol_start() returns the offset of the first character; symbol_end() returns the offset after the last character. The first character in a file is at offset 0.

    val symbol_end : unit -> int

    See Parsing.symbol_start.

    val rhs_start : int -> int

    Same as Parsing.symbol_start and Parsing.symbol_end, but return the offset of the string matching the nth item on the right-hand side of the rule, where n is the integer parameter to rhs_start and rhs_end. n is 1 for the leftmost item.

    val rhs_end : int -> int

    See Parsing.rhs_start.

    val symbol_start_pos : unit -> Lexing.position

    Same as symbol_start, but return a position instead of an offset.

    val symbol_end_pos : unit -> Lexing.position

    Same as symbol_end, but return a position instead of an offset.

    val rhs_start_pos : int -> Lexing.position

    Same as rhs_start, but return a position instead of an offset.

    val rhs_end_pos : int -> Lexing.position

    Same as rhs_end, but return a position instead of an offset.

    val clear_parser : unit -> unit

    Empty the parser stack. Call it just after a parsing function has returned, to remove all pointers from the parser stack to structures that were built by semantic actions during parsing. This is optional, but lowers the memory requirements of the programs.

    exception Parse_error

    Raised when a parser encounters a syntax error. Can also be raised from the action part of a grammar rule, to initiate error recovery.

    val set_trace : bool -> bool

    Control debugging support for ocamlyacc-generated parsers. After Parsing.set_trace true, the pushdown automaton that executes the parsers prints a trace of its actions (reading a token, shifting a state, reducing by a rule) on standard output. Parsing.set_trace false turns this debugging trace off. The boolean returned is the previous state of the trace flag.

    • since 3.11
    diff --git a/ocaml/Stdlib/Printexc/Slot/index.html b/ocaml/Stdlib/Printexc/Slot/index.html new file mode 100644 index 0000000..4286cc7 --- /dev/null +++ b/ocaml/Stdlib/Printexc/Slot/index.html @@ -0,0 +1,2 @@ + +Slot (ocaml.Stdlib.Printexc.Slot)

    Module Printexc.Slot

    • since 4.02
    val is_raise : t -> bool

    is_raise slot is true when slot refers to a raising point in the code, and false when it comes from a simple function call.

    • since 4.02
    val is_inline : t -> bool

    is_inline slot is true when slot refers to a call that got inlined by the compiler, and false when it comes from any other context.

    • since 4.04
    val location : t -> location option

    location slot returns the location information of the slot, if available, and None otherwise.

    Some possible reasons for failing to return a location are as follow:

    • the slot corresponds to a compiler-inserted raise
    • the slot corresponds to a part of the program that has not been compiled with debug information (-g)
    • since 4.02
    val name : t -> string option

    name slot returns the name of the function or definition enclosing the location referred to by the slot.

    name slot returns None if the name is unavailable, which may happen for the same reasons as location returning None.

    • since 4.11
    val format : int -> t -> string option

    format pos slot returns the string representation of slot as raw_backtrace_to_string would format it, assuming it is the pos-th element of the backtrace: the 0-th element is pretty-printed differently than the others.

    Whole-backtrace printing functions also skip some uninformative slots; in that case, format pos slot returns None.

    • since 4.02
    diff --git a/ocaml/Stdlib/Printexc/index.html b/ocaml/Stdlib/Printexc/index.html new file mode 100644 index 0000000..39f861c --- /dev/null +++ b/ocaml/Stdlib/Printexc/index.html @@ -0,0 +1,17 @@ + +Printexc (ocaml.Stdlib.Printexc)

    Module Stdlib.Printexc

    Facilities for printing exceptions and inspecting current call stack.

    type t = exn = ..

    The type of exception values.

    val to_string : exn -> string

    Printexc.to_string e returns a string representation of the exception e.

    val to_string_default : exn -> string

    Printexc.to_string_default e returns a string representation of the exception e, ignoring all registered exception printers.

    • since 4.09
    val print : ('a -> 'b) -> 'a -> 'b

    Printexc.print fn x applies fn to x and returns the result. If the evaluation of fn x raises any exception, the name of the exception is printed on standard error output, and the exception is raised again. The typical use is to catch and report exceptions that escape a function application.

    val catch : ('a -> 'b) -> 'a -> 'b

    Printexc.catch fn x is similar to Printexc.print, but aborts the program with exit code 2 after printing the uncaught exception. This function is deprecated: the runtime system is now able to print uncaught exceptions as precisely as Printexc.catch does. Moreover, calling Printexc.catch makes it harder to track the location of the exception using the debugger or the stack backtrace facility. So, do not use Printexc.catch in new code.

    • deprecated This function is no longer needed.
    val print_backtrace : out_channel -> unit

    Printexc.print_backtrace oc prints an exception backtrace on the output channel oc. The backtrace lists the program locations where the most-recently raised exception was raised and where it was propagated through function calls.

    If the call is not inside an exception handler, the returned backtrace is unspecified. If the call is after some exception-catching code (before in the handler, or in a when-guard during the matching of the exception handler), the backtrace may correspond to a later exception than the handled one.

    • since 3.11
    val get_backtrace : unit -> string

    Printexc.get_backtrace () returns a string containing the same exception backtrace that Printexc.print_backtrace would print. Same restriction usage than print_backtrace.

    • since 3.11
    val record_backtrace : bool -> unit

    Printexc.record_backtrace b turns recording of exception backtraces on (if b = true) or off (if b = false). Initially, backtraces are not recorded, unless the b flag is given to the program through the OCAMLRUNPARAM variable.

    • since 3.11
    val backtrace_status : unit -> bool

    Printexc.backtrace_status() returns true if exception backtraces are currently recorded, false if not.

    • since 3.11
    val register_printer : (exn -> string option) -> unit

    Printexc.register_printer fn registers fn as an exception printer. The printer should return None or raise an exception if it does not know how to convert the passed exception, and Some s with s the resulting string if it can convert the passed exception. Exceptions raised by the printer are ignored.

    When converting an exception into a string, the printers will be invoked in the reverse order of their registrations, until a printer returns a Some s value (if no such printer exists, the runtime will use a generic printer).

    When using this mechanism, one should be aware that an exception backtrace is attached to the thread that saw it raised, rather than to the exception itself. Practically, it means that the code related to fn should not use the backtrace if it has itself raised an exception before.

    • since 3.11.2
    val use_printers : exn -> string option

    Printexc.use_printers e returns None if there are no registered printers and Some s with else as the resulting string otherwise.

    • since 4.09

    Raw backtraces

    type raw_backtrace

    The type raw_backtrace stores a backtrace in a low-level format, which can be converted to usable form using raw_backtrace_entries and backtrace_slots_of_raw_entry below.

    Converting backtraces to backtrace_slots is slower than capturing the backtraces. If an application processes many backtraces, it can be useful to use raw_backtrace to avoid or delay conversion.

    Raw backtraces cannot be marshalled. If you need marshalling, you should use the array returned by the backtrace_slots function of the next section.

    • since 4.01
    type raw_backtrace_entry = private int

    A raw_backtrace_entry is an element of a raw_backtrace.

    Each raw_backtrace_entry is an opaque integer, whose value is not stable between different programs, or even between different runs of the same binary.

    A raw_backtrace_entry can be converted to a usable form using backtrace_slots_of_raw_entry below. Note that, due to inlining, a single raw_backtrace_entry may convert to several backtrace_slots. Since the values of a raw_backtrace_entry are not stable, they cannot be marshalled. If they are to be converted, the conversion must be done by the process that generated them.

    Again due to inlining, there may be multiple distinct raw_backtrace_entry values that convert to equal backtrace_slots. However, if two raw_backtrace_entrys are equal as integers, then they represent the same backtrace_slots.

    • since 4.12
    val raw_backtrace_entries : raw_backtrace -> raw_backtrace_entry array
    • since 4.12
    val get_raw_backtrace : unit -> raw_backtrace

    Printexc.get_raw_backtrace () returns the same exception backtrace that Printexc.print_backtrace would print, but in a raw format. Same restriction usage than print_backtrace.

    • since 4.01
    val print_raw_backtrace : out_channel -> raw_backtrace -> unit

    Print a raw backtrace in the same format Printexc.print_backtrace uses.

    • since 4.01
    val raw_backtrace_to_string : raw_backtrace -> string

    Return a string from a raw backtrace, in the same format Printexc.get_backtrace uses.

    • since 4.01
    val raise_with_backtrace : exn -> raw_backtrace -> 'a

    Reraise the exception using the given raw_backtrace for the origin of the exception

    • since 4.05

    Current call stack

    val get_callstack : int -> raw_backtrace

    Printexc.get_callstack n returns a description of the top of the call stack on the current program point (for the current thread), with at most n entries. (Note: this function is not related to exceptions at all, despite being part of the Printexc module.)

    • since 4.01

    Uncaught exceptions

    val default_uncaught_exception_handler : exn -> raw_backtrace -> unit

    Printexc.default_uncaught_exception_handler prints the exception and backtrace on standard error output.

    • since 4.11
    val set_uncaught_exception_handler : (exn -> raw_backtrace -> unit) -> unit

    Printexc.set_uncaught_exception_handler fn registers fn as the handler for uncaught exceptions. The default handler is Printexc.default_uncaught_exception_handler.

    Note that when fn is called all the functions registered with Stdlib.at_exit have already been called. Because of this you must make sure any output channel fn writes on is flushed.

    Also note that exceptions raised by user code in the interactive toplevel are not passed to this function as they are caught by the toplevel itself.

    If fn raises an exception, both the exceptions passed to fn and raised by fn will be printed with their respective backtrace.

    • since 4.02

    Manipulation of backtrace information

    These functions are used to traverse the slots of a raw backtrace and extract information from them in a programmer-friendly format.

    type backtrace_slot

    The abstract type backtrace_slot represents a single slot of a backtrace.

    • since 4.02
    val backtrace_slots : raw_backtrace -> backtrace_slot array option

    Returns the slots of a raw backtrace, or None if none of them contain useful information.

    In the return array, the slot at index 0 corresponds to the most recent function call, raise, or primitive get_backtrace call in the trace.

    Some possible reasons for returning None are as follow:

    • none of the slots in the trace come from modules compiled with debug information (-g)
    • the program is a bytecode program that has not been linked with debug information enabled (ocamlc -g)
    • since 4.02
    val backtrace_slots_of_raw_entry : + raw_backtrace_entry -> + backtrace_slot array option

    Returns the slots of a single raw backtrace entry, or None if this entry lacks debug information.

    Slots are returned in the same order as backtrace_slots: the slot at index 0 is the most recent call, raise, or primitive, and subsequent slots represent callers.

    • since 4.12
    type location = {
    1. filename : string;
    2. line_number : int;
    3. start_char : int;
    4. end_char : int;
    5. end_line : int;
      (*
      • since 5.2
      *)
    6. end_col : int;
      (*
      • since 5.2
      *)
    }

    The type of location information found in backtraces. start_char and end_char are positions relative to the beginning of line_number. end_col is relative to the beginning of end_line.

    • since 4.02
    module Slot : sig ... end

    Raw backtrace slots

    type raw_backtrace_slot

    This type is used to iterate over the slots of a raw_backtrace. For most purposes, backtrace_slots_of_raw_entry is easier to use.

    Like raw_backtrace_entry, values of this type are process-specific and must absolutely not be marshalled, and are unsafe to use for this reason (marshalling them may not fail, but un-marshalling and using the result will result in undefined behavior).

    Elements of this type can still be compared and hashed: when two elements are equal, then they represent the same source location (the converse is not necessarily true in presence of inlining, for example).

    • since 4.02
    val raw_backtrace_length : raw_backtrace -> int

    raw_backtrace_length bckt returns the number of slots in the backtrace bckt.

    • since 4.02
    val get_raw_backtrace_slot : raw_backtrace -> int -> raw_backtrace_slot

    get_raw_backtrace_slot bckt pos returns the slot in position pos in the backtrace bckt.

    • since 4.02
    val convert_raw_backtrace_slot : raw_backtrace_slot -> backtrace_slot

    Extracts the user-friendly backtrace_slot from a low-level raw_backtrace_slot.

    • since 4.02
    val get_raw_backtrace_next_slot : + raw_backtrace_slot -> + raw_backtrace_slot option

    get_raw_backtrace_next_slot slot returns the next slot inlined, if any.

    Sample code to iterate over all frames (inlined and non-inlined):

      (* Iterate over inlined frames *)
+  let rec iter_raw_backtrace_slot f slot =
+    f slot;
+    match get_raw_backtrace_next_slot slot with
+    | None -> ()
+    | Some slot' -> iter_raw_backtrace_slot f slot'
+
+  (* Iterate over stack frames *)
+  let iter_raw_backtrace f bt =
+    for i = 0 to raw_backtrace_length bt - 1 do
+      iter_raw_backtrace_slot f (get_raw_backtrace_slot bt i)
+    done
    • since 4.04

    Exception slots

    val exn_slot_id : exn -> int

    Printexc.exn_slot_id returns an integer which uniquely identifies the constructor used to create the exception value exn (in the current runtime).

    • since 4.02
    val exn_slot_name : exn -> string

    Printexc.exn_slot_name exn returns the internal name of the constructor used to create the exception value exn.

    • since 4.02
    diff --git a/ocaml/Stdlib/Printf/index.html b/ocaml/Stdlib/Printf/index.html new file mode 100644 index 0000000..3207e27 --- /dev/null +++ b/ocaml/Stdlib/Printf/index.html @@ -0,0 +1,14 @@ + +Printf (ocaml.Stdlib.Printf)

    Module Stdlib.Printf

    Formatted output functions.

    val fprintf : out_channel -> ('a, out_channel, unit) format -> 'a

    fprintf outchan format arg1 ... argN formats the arguments arg1 to argN according to the format string format, and outputs the resulting string on the channel outchan.

    The format string is a character string which contains two types of objects: plain characters, which are simply copied to the output channel, and conversion specifications, each of which causes conversion and printing of arguments.

    Conversion specifications have the following form:

    % [flags] [width] [.precision] type

    In short, a conversion specification consists in the % character, followed by optional modifiers and a type which is made of one or two characters.

    The types and their meanings are:

    • d, i: convert an integer argument to signed decimal. The flag # adds underscores to large values for readability.
    • u, n, l, L, or N: convert an integer argument to unsigned decimal. Warning: n, l, L, and N are used for scanf, and should not be used for printf. The flag # adds underscores to large values for readability.
    • x: convert an integer argument to unsigned hexadecimal, using lowercase letters. The flag # adds a 0x prefix to non zero values.
    • X: convert an integer argument to unsigned hexadecimal, using uppercase letters. The flag # adds a 0X prefix to non zero values.
    • o: convert an integer argument to unsigned octal. The flag # adds a 0 prefix to non zero values.
    • s: insert a string argument.
    • S: convert a string argument to OCaml syntax (double quotes, escapes).
    • c: insert a character argument.
    • C: convert a character argument to OCaml syntax (single quotes, escapes).
    • f: convert a floating-point argument to decimal notation, in the style dddd.ddd.
    • F: convert a floating-point argument to OCaml syntax (dddd. or dddd.ddd or d.ddd e+-dd). Converts to hexadecimal with the # flag (see h).
    • e or E: convert a floating-point argument to decimal notation, in the style d.ddd e+-dd (mantissa and exponent).
    • g or G: convert a floating-point argument to decimal notation, in style f or e, E (whichever is more compact). Moreover, any trailing zeros are removed from the fractional part of the result and the decimal-point character is removed if there is no fractional part remaining.
    • h or H: convert a floating-point argument to hexadecimal notation, in the style 0xh.hhhh p+-dd (hexadecimal mantissa, exponent in decimal and denotes a power of 2).
    • B: convert a boolean argument to the string true or false
    • b: convert a boolean argument (deprecated; do not use in new programs).
    • ld, li, lu, lx, lX, lo: convert an int32 argument to the format specified by the second letter (decimal, hexadecimal, etc).
    • nd, ni, nu, nx, nX, no: convert a nativeint argument to the format specified by the second letter.
    • Ld, Li, Lu, Lx, LX, Lo: convert an int64 argument to the format specified by the second letter.
    • a: user-defined printer. Take two arguments and apply the first one to outchan (the current output channel) and to the second argument. The first argument must therefore have type out_channel -> 'b -> unit and the second 'b. The output produced by the function is inserted in the output of fprintf at the current point.
    • t: same as %a, but take only one argument (with type out_channel -> unit) and apply it to outchan.
    • \{ fmt %\}: convert a format string argument to its type digest. The argument must have the same type as the internal format string fmt.
    • ( fmt %): format string substitution. Take a format string argument and substitute it to the internal format string fmt to print following arguments. The argument must have the same type as the internal format string fmt.
    • !: take no argument and flush the output.
    • %: take no argument and output one % character.
    • \@: take no argument and output one \@ character.
    • ,: take no argument and output nothing: a no-op delimiter for conversion specifications.

    The optional flags are:

    • -: left-justify the output (default is right justification).
    • 0: for numerical conversions, pad with zeroes instead of spaces.
    • +: for signed numerical conversions, prefix number with a + sign if positive.
    • space: for signed numerical conversions, prefix number with a space if positive.
    • #: request an alternate formatting style for the integer types and the floating-point type F.

    The optional width is an integer indicating the minimal width of the result. For instance, %6d prints an integer, prefixing it with spaces to fill at least 6 characters.

    The optional precision is a dot . followed by an integer indicating how many digits follow the decimal point in the %f, %e, %E, %h, and %H conversions or the maximum number of significant digits to appear for the %F, %g and %G conversions. For instance, %.4f prints a float with 4 fractional digits.

    The integer in a width or precision can also be specified as *, in which case an extra integer argument is taken to specify the corresponding width or precision. This integer argument precedes immediately the argument to print. For instance, %.*f prints a float with as many fractional digits as the value of the argument given before the float.

    val printf : ('a, out_channel, unit) format -> 'a

    Same as Printf.fprintf, but output on stdout.

    val eprintf : ('a, out_channel, unit) format -> 'a

    Same as Printf.fprintf, but output on stderr.

    val sprintf : ('a, unit, string) format -> 'a

    Same as Printf.fprintf, but instead of printing on an output channel, return a string containing the result of formatting the arguments.

    val bprintf : Buffer.t -> ('a, Buffer.t, unit) format -> 'a

    Same as Printf.fprintf, but instead of printing on an output channel, append the formatted arguments to the given extensible buffer (see module Buffer).

    val ifprintf : 'b -> ('a, 'b, 'c, unit) format4 -> 'a

    Same as Printf.fprintf, but does not print anything. Useful to ignore some material when conditionally printing.

    • since 3.10
    val ibprintf : Buffer.t -> ('a, Buffer.t, unit) format -> 'a

    Same as Printf.bprintf, but does not print anything. Useful to ignore some material when conditionally printing.

    • since 4.11

    Formatted output functions with continuations.

    val kfprintf : + (out_channel -> 'd) -> + out_channel -> + ('a, out_channel, unit, 'd) format4 -> + 'a

    Same as fprintf, but instead of returning immediately, passes the out channel to its first argument at the end of printing.

    • since 3.09
    val ikfprintf : ('b -> 'd) -> 'b -> ('a, 'b, 'c, 'd) format4 -> 'a

    Same as kfprintf above, but does not print anything. Useful to ignore some material when conditionally printing.

    • since 4.01
    val ksprintf : (string -> 'd) -> ('a, unit, string, 'd) format4 -> 'a

    Same as sprintf above, but instead of returning the string, passes it to the first argument.

    • since 3.09
    val kbprintf : + (Buffer.t -> 'd) -> + Buffer.t -> + ('a, Buffer.t, unit, 'd) format4 -> + 'a

    Same as bprintf, but instead of returning immediately, passes the buffer to its first argument at the end of printing.

    • since 3.10
    val ikbprintf : + (Buffer.t -> 'd) -> + Buffer.t -> + ('a, Buffer.t, unit, 'd) format4 -> + 'a

    Same as kbprintf above, but does not print anything. Useful to ignore some material when conditionally printing.

    • since 4.11

    Deprecated

    val kprintf : (string -> 'b) -> ('a, unit, string, 'b) format4 -> 'a

    A deprecated synonym for ksprintf.

    • deprecated Use Printf.ksprintf instead.
    diff --git a/ocaml/Stdlib/Queue/index.html b/ocaml/Stdlib/Queue/index.html new file mode 100644 index 0000000..0ae991d --- /dev/null +++ b/ocaml/Stdlib/Queue/index.html @@ -0,0 +1,78 @@ + +Queue (ocaml.Stdlib.Queue)

    Module Stdlib.Queue

    First-in first-out queues.

    This module implements queues (FIFOs), with in-place modification. See the example section below.

    Unsynchronized accesses

    Unsynchronized accesses to a queue may lead to an invalid queue state. Thus, concurrent accesses to queues must be synchronized (for instance with a Mutex.t).

    type !'a t

    The type of queues containing elements of type 'a.

    exception Empty

    Raised when Queue.take or Queue.peek is applied to an empty queue.

    val create : unit -> 'a t

    Return a new queue, initially empty.

    val add : 'a -> 'a t -> unit

    add x q adds the element x at the end of the queue q.

    val push : 'a -> 'a t -> unit

    push is a synonym for add.

    val take : 'a t -> 'a

    take q removes and returns the first element in queue q, or raises Empty if the queue is empty.

    val take_opt : 'a t -> 'a option

    take_opt q removes and returns the first element in queue q, or returns None if the queue is empty.

    • since 4.08
    val pop : 'a t -> 'a

    pop is a synonym for take.

    val peek : 'a t -> 'a

    peek q returns the first element in queue q, without removing it from the queue, or raises Empty if the queue is empty.

    val peek_opt : 'a t -> 'a option

    peek_opt q returns the first element in queue q, without removing it from the queue, or returns None if the queue is empty.

    • since 4.08
    val top : 'a t -> 'a

    top is a synonym for peek.

    val clear : 'a t -> unit

    Discard all elements from a queue.

    val copy : 'a t -> 'a t

    Return a copy of the given queue.

    val is_empty : 'a t -> bool

    Return true if the given queue is empty, false otherwise.

    val length : 'a t -> int

    Return the number of elements in a queue.

    val iter : ('a -> unit) -> 'a t -> unit

    iter f q applies f in turn to all elements of q, from the least recently entered to the most recently entered. The queue itself is unchanged.

    val fold : ('acc -> 'a -> 'acc) -> 'acc -> 'a t -> 'acc

    fold f accu q is equivalent to List.fold_left f accu l, where l is the list of q's elements. The queue remains unchanged.

    val transfer : 'a t -> 'a t -> unit

    transfer q1 q2 adds all of q1's elements at the end of the queue q2, then clears q1. It is equivalent to the sequence iter (fun x -> add x q2) q1; clear q1, but runs in constant time.

    Iterators

    val to_seq : 'a t -> 'a Seq.t

    Iterate on the queue, in front-to-back order. The behavior is not specified if the queue is modified during the iteration.

    • since 4.07
    val add_seq : 'a t -> 'a Seq.t -> unit

    Add the elements from a sequence to the end of the queue.

    • since 4.07
    val of_seq : 'a Seq.t -> 'a t

    Create a queue from a sequence.

    • since 4.07

    Examples

    Basic Example

    A basic example:

    # let q = Queue.create ()
+val q : '_weak1 Queue.t = <abstr>
+
+
+# Queue.push 1 q; Queue.push 2 q; Queue.push 3 q
+- : unit = ()
+
+# Queue.length q
+- : int = 3
+
+# Queue.pop q
+- : int = 1
+
+# Queue.pop q
+- : int = 2
+
+# Queue.pop q
+- : int = 3
+
+# Queue.pop q
+Exception: Stdlib.Queue.Empty.

    Search Through a Graph

    For a more elaborate example, a classic algorithmic use of queues is to implement a BFS (breadth-first search) through a graph.

      type graph = {
+    edges: (int, int list) Hashtbl.t
+  }
+
+ (* Search in graph [g] using BFS, starting from node [start].
+    It returns the first node that satisfies [p], or [None] if
+    no node reachable from [start] satisfies [p].
+ *)
+ let search_for ~(g:graph) ~(start:int) (p:int -> bool) : int option =
+   let to_explore = Queue.create() in
+   let explored = Hashtbl.create 16 in
+
+   Queue.push start to_explore;
+   let rec loop () =
+     if Queue.is_empty to_explore then None
+     else
+       (* node to explore *)
+       let node = Queue.pop to_explore in
+       explore_node node
+
+   and explore_node node =
+     if not (Hashtbl.mem explored node) then (
+       if p node then Some node (* found *)
+       else (
+         Hashtbl.add explored node ();
+         let children =
+           Hashtbl.find_opt g.edges node
+           |> Option.value ~default:[]
+         in
+         List.iter (fun child -> Queue.push child to_explore) children;
+         loop()
+       )
+     ) else loop()
+   in
+   loop()
+
+ (* a sample graph *)
+ let my_graph: graph =
+   let edges =
+     List.to_seq [
+       1, [2;3];
+       2, [10; 11];
+       3, [4;5];
+       5, [100];
+       11, [0; 20];
+     ]
+     |> Hashtbl.of_seq
+   in {edges}
+
+ # search_for ~g:my_graph ~start:1 (fun x -> x = 30)
+ - : int option = None
+
+ # search_for ~g:my_graph ~start:1 (fun x -> x >= 15)
+ - : int option = Some 20
+
+ # search_for ~g:my_graph ~start:1 (fun x -> x >= 50)
+ - : int option = Some 100
    diff --git a/ocaml/Stdlib/Random/State/index.html b/ocaml/Stdlib/Random/State/index.html new file mode 100644 index 0000000..4e49445 --- /dev/null +++ b/ocaml/Stdlib/Random/State/index.html @@ -0,0 +1,2 @@ + +State (ocaml.Stdlib.Random.State)

    Module Random.State

    type t

    The type of PRNG states.

    val make : int array -> t

    Create a new state and initialize it with the given seed.

    val make_self_init : unit -> t

    Create a new state and initialize it with a random seed chosen in a system-dependent way. The seed is obtained as described in Random.self_init.

    val copy : t -> t

    Return a copy of the given state.

    val bits : t -> int
    val int : t -> int -> int
    val full_int : t -> int -> int
    val int_in_range : t -> min:int -> max:int -> int
    val int32 : t -> Int32.t -> Int32.t
    val int32_in_range : t -> min:int32 -> max:int32 -> int32
    val nativeint : t -> Nativeint.t -> Nativeint.t
    val nativeint_in_range : t -> min:nativeint -> max:nativeint -> nativeint
    val int64 : t -> Int64.t -> Int64.t
    val int64_in_range : t -> min:int64 -> max:int64 -> int64
    val float : t -> float -> float
    val bool : t -> bool
    val bits32 : t -> Int32.t
    val bits64 : t -> Int64.t
    val nativebits : t -> Nativeint.t

    These functions are the same as the basic functions, except that they use (and update) the given PRNG state instead of the default one.

    val split : t -> t

    Draw a fresh PRNG state from the given PRNG state. (The given PRNG state is modified.) The new PRNG is statistically independent from the given PRNG. Data can be drawn from both PRNGs, in any order, without risk of correlation. Both PRNGs can be split later, arbitrarily many times.

    • since 5.0
    val to_binary_string : t -> string

    Serializes the PRNG state into an immutable sequence of bytes. See of_binary_string for deserialization.

    The string type is intended here for serialization only, the encoding is not human-readable and may not be printable.

    Note that the serialization format may differ across OCaml versions.

    • since 5.1
    val of_binary_string : string -> t

    Deserializes a byte sequence obtained by calling to_binary_string. The resulting PRNG state will produce the same random numbers as the state that was passed as input to to_binary_string.

    • raises Failure

      if the input is not in the expected format.

    Note that the serialization format may differ across OCaml versions.

    Unlike the functions provided by the Marshal module, this function either produces a valid state or fails cleanly with a Failure exception. It can be safely used on user-provided, untrusted inputs.

    • since 5.1
    diff --git a/ocaml/Stdlib/Random/index.html b/ocaml/Stdlib/Random/index.html new file mode 100644 index 0000000..84cc1f1 --- /dev/null +++ b/ocaml/Stdlib/Random/index.html @@ -0,0 +1,2 @@ + +Random (ocaml.Stdlib.Random)

    Module Stdlib.Random

    Pseudo-random number generators (PRNG).

    With multiple domains, each domain has its own generator that evolves independently of the generators of other domains. When a domain is created, its generator is initialized by splitting the state of the generator associated with the parent domain.

    In contrast, all threads within a domain share the same domain-local generator. Independent generators can be created with the Random.split function and used with the functions from the Random.State module.

    • before 5.0

      Random value generation used a different algorithm. This affects all the functions in this module which return random values.

    Basic functions

    val init : int -> unit

    Initialize the domain-local generator, using the argument as a seed. The same seed will always yield the same sequence of numbers.

    val full_init : int array -> unit

    Same as Random.init but takes more data as seed.

    val self_init : unit -> unit

    Initialize the domain-local generator with a random seed chosen in a system-dependent way. If /dev/urandom is available on the host machine, it is used to provide a highly random initial seed. Otherwise, a less random seed is computed from system parameters (current time, process IDs, domain-local state).

    val bits : unit -> int

    Return 30 random bits in a nonnegative integer.

    val int : int -> int

    Random.int bound returns a random integer between 0 (inclusive) and bound (exclusive). bound must be greater than 0 and less than 230.

    val full_int : int -> int

    Random.full_int bound returns a random integer between 0 (inclusive) and bound (exclusive). bound may be any positive integer.

    If bound is less than 231, then Random.full_int bound yields identical output across systems with varying int sizes.

    If bound is less than 230, then Random.full_int bound is equal to Random.int bound.

    If bound is at least 230 (on 64-bit systems, or non-standard environments such as JavaScript), then Random.full_int returns a value whereas Random.int raises Stdlib.Invalid_argument.

    • since 4.13
    val int_in_range : min:int -> max:int -> int

    Random.int_in_range ~min ~max returns a random integer between min (inclusive) and max (inclusive). Both min and max are allowed to be negative; min must be less than or equal to max.

    If both bounds fit in 32-bit signed integers (that is, if -231 <= min and max < 231), then int_in_range yields identical output across systems with varying int sizes.

    • since 5.2
    val int32 : Int32.t -> Int32.t

    Random.int32 bound returns a random integer between 0 (inclusive) and bound (exclusive). bound must be greater than 0.

    val int32_in_range : min:int32 -> max:int32 -> int32

    Random.int32_in_range ~min ~max returns a random integer between min (inclusive) and max (inclusive). Both min and max are allowed to be negative; min must be less than or equal to max.

    • since 5.2
    val nativeint : Nativeint.t -> Nativeint.t

    Random.nativeint bound returns a random integer between 0 (inclusive) and bound (exclusive). bound must be greater than 0.

    val nativeint_in_range : min:nativeint -> max:nativeint -> nativeint

    Random.nativeint_in_range ~min ~max returns a random integer between min (inclusive) and max (inclusive). Both min and max are allowed to be negative; min must be less than or equal to max.

    • since 5.2
    val int64 : Int64.t -> Int64.t

    Random.int64 bound returns a random integer between 0 (inclusive) and bound (exclusive). bound must be greater than 0.

    val int64_in_range : min:int64 -> max:int64 -> int64

    Random.int64_in_range ~min ~max returns a random integer between min (inclusive) and max (inclusive). Both min and max are allowed to be negative; min must be less than or equal to max.

    • since 5.2
    val float : float -> float

    Random.float bound returns a random floating-point number between 0 and bound (inclusive). If bound is negative, the result is negative or zero. If bound is 0, the result is 0.

    val bool : unit -> bool

    Random.bool () returns true or false with probability 0.5 each.

    val bits32 : unit -> Int32.t

    Random.bits32 () returns 32 random bits as an integer between Int32.min_int and Int32.max_int.

    • since 4.14
    val bits64 : unit -> Int64.t

    Random.bits64 () returns 64 random bits as an integer between Int64.min_int and Int64.max_int.

    • since 4.14
    val nativebits : unit -> Nativeint.t

    Random.nativebits () returns 32 or 64 random bits (depending on the bit width of the platform) as an integer between Nativeint.min_int and Nativeint.max_int.

    • since 4.14

    Advanced functions

    The functions from module State manipulate the current state of the random generator explicitly. This allows using one or several deterministic PRNGs, even in a multi-threaded program, without interference from other parts of the program.

    module State : sig ... end
    val get_state : unit -> State.t

    get_state() returns a fresh copy of the current state of the domain-local generator (which is used by the basic functions).

    val set_state : State.t -> unit

    set_state s updates the current state of the domain-local generator (which is used by the basic functions) by copying the state s into it.

    val split : unit -> State.t

    Draw a fresh PRNG state from the current state of the domain-local generator used by the default functions. (The state of the domain-local generator is modified.) See Random.State.split.

    • since 5.0
    diff --git a/ocaml/Stdlib/Result/index.html b/ocaml/Stdlib/Result/index.html new file mode 100644 index 0000000..6b9842d --- /dev/null +++ b/ocaml/Stdlib/Result/index.html @@ -0,0 +1,12 @@ + +Result (ocaml.Stdlib.Result)

    Module Stdlib.Result

    Result values.

    Result values handle computation results and errors in an explicit and declarative manner without resorting to exceptions.

    • since 4.08

    Results

    type ('a, 'e) t = ('a, 'e) result =
    1. | Ok of 'a
    2. | Error of 'e

    The type for result values. Either a value Ok v or an error Error e.

    val ok : 'a -> ('a, 'e) result

    ok v is Ok v.

    val error : 'e -> ('a, 'e) result

    error e is Error e.

    val value : ('a, 'e) result -> default:'a -> 'a

    value r ~default is v if r is Ok v and default otherwise.

    val get_ok : ('a, 'e) result -> 'a

    get_ok r is v if r is Ok v and raise otherwise.

    val get_error : ('a, 'e) result -> 'e

    get_error r is e if r is Error e and raise otherwise.

    val bind : ('a, 'e) result -> ('a -> ('b, 'e) result) -> ('b, 'e) result

    bind r f is f v if r is Ok v and r if r is Error _.

    val join : (('a, 'e) result, 'e) result -> ('a, 'e) result

    join rr is r if rr is Ok r and rr if rr is Error _.

    val map : ('a -> 'b) -> ('a, 'e) result -> ('b, 'e) result

    map f r is Ok (f v) if r is Ok v and r if r is Error _.

    val map_error : ('e -> 'f) -> ('a, 'e) result -> ('a, 'f) result

    map_error f r is Error (f e) if r is Error e and r if r is Ok _.

    val fold : ok:('a -> 'c) -> error:('e -> 'c) -> ('a, 'e) result -> 'c

    fold ~ok ~error r is ok v if r is Ok v and error e if r is Error e.

    val iter : ('a -> unit) -> ('a, 'e) result -> unit

    iter f r is f v if r is Ok v and () otherwise.

    val iter_error : ('e -> unit) -> ('a, 'e) result -> unit

    iter_error f r is f e if r is Error e and () otherwise.

    Predicates and comparisons

    val is_ok : ('a, 'e) result -> bool

    is_ok r is true if and only if r is Ok _.

    val is_error : ('a, 'e) result -> bool

    is_error r is true if and only if r is Error _.

    val equal : + ok:('a -> 'a -> bool) -> + error:('e -> 'e -> bool) -> + ('a, 'e) result -> + ('a, 'e) result -> + bool

    equal ~ok ~error r0 r1 tests equality of r0 and r1 using ok and error to respectively compare values wrapped by Ok _ and Error _.

    val compare : + ok:('a -> 'a -> int) -> + error:('e -> 'e -> int) -> + ('a, 'e) result -> + ('a, 'e) result -> + int

    compare ~ok ~error r0 r1 totally orders r0 and r1 using ok and error to respectively compare values wrapped by Ok _ and Error _. Ok _ values are smaller than Error _ values.

    Converting

    val to_option : ('a, 'e) result -> 'a option

    to_option r is r as an option, mapping Ok v to Some v and Error _ to None.

    val to_list : ('a, 'e) result -> 'a list

    to_list r is [v] if r is Ok v and [] otherwise.

    val to_seq : ('a, 'e) result -> 'a Seq.t

    to_seq r is r as a sequence. Ok v is the singleton sequence containing v and Error _ is the empty sequence.

    diff --git a/ocaml/Stdlib/Scanf/Scanning/index.html b/ocaml/Stdlib/Scanf/Scanning/index.html new file mode 100644 index 0000000..665c5ee --- /dev/null +++ b/ocaml/Stdlib/Scanf/Scanning/index.html @@ -0,0 +1,2 @@ + +Scanning (ocaml.Stdlib.Scanf.Scanning)

    Module Scanf.Scanning

    type in_channel

    The notion of input channel for the Scanf module: those channels provide all the machinery necessary to read from any source of characters, including a Stdlib.in_channel value. A Scanf.Scanning.in_channel value is also called a formatted input channel or equivalently a scanning buffer. The type Scanning.scanbuf below is an alias for Scanning.in_channel. Note that a Scanning.in_channel is not concurrency-safe: concurrent use may produce arbitrary values or exceptions.

    • since 3.12
    type scanbuf = in_channel

    The type of scanning buffers. A scanning buffer is the source from which a formatted input function gets characters. The scanning buffer holds the current state of the scan, plus a function to get the next char from the input, and a token buffer to store the string matched so far.

    Note: a scanning action may often require to examine one character in advance; when this 'lookahead' character does not belong to the token read, it is stored back in the scanning buffer and becomes the next character yet to be read.

    val stdin : in_channel

    The standard input notion for the Scanf module. Scanning.stdin is the Scanning.in_channel formatted input channel attached to Stdlib.stdin.

    Note: in the interactive system, when input is read from Stdlib.stdin, the newline character that triggers evaluation is part of the input; thus, the scanning specifications must properly skip this additional newline character (for instance, simply add a '\n' as the last character of the format string).

    • since 3.12
    type file_name = string

    A convenient alias to designate a file name.

    • since 4.00
    val open_in : file_name -> in_channel

    Scanning.open_in fname returns a Scanning.in_channel formatted input channel for bufferized reading in text mode from file fname.

    Note: open_in returns a formatted input channel that efficiently reads characters in large chunks; in contrast, from_channel below returns formatted input channels that must read one character at a time, leading to a much slower scanning rate.

    • since 3.12
    val open_in_bin : file_name -> in_channel

    Scanning.open_in_bin fname returns a Scanning.in_channel formatted input channel for bufferized reading in binary mode from file fname.

    • since 3.12
    val close_in : in_channel -> unit

    Closes the Stdlib.in_channel associated with the given Scanning.in_channel formatted input channel.

    • since 3.12
    val from_file : file_name -> in_channel

    An alias for Scanning.open_in above.

    val from_file_bin : string -> in_channel

    An alias for Scanning.open_in_bin above.

    val from_string : string -> in_channel

    Scanning.from_string s returns a Scanning.in_channel formatted input channel which reads from the given string. Reading starts from the first character in the string. The end-of-input condition is set when the end of the string is reached.

    val from_function : (unit -> char) -> in_channel

    Scanning.from_function f returns a Scanning.in_channel formatted input channel with the given function as its reading method.

    When scanning needs one more character, the given function is called.

    When the function has no more character to provide, it must signal an end-of-input condition by raising the exception End_of_file.

    val from_channel : in_channel -> in_channel

    Scanning.from_channel ic returns a Scanning.in_channel formatted input channel which reads from the regular Stdlib.in_channel input channel ic argument. Reading starts at current reading position of ic.

    val end_of_input : in_channel -> bool

    Scanning.end_of_input ic tests the end-of-input condition of the given Scanning.in_channel formatted input channel.

    val beginning_of_input : in_channel -> bool

    Scanning.beginning_of_input ic tests the beginning of input condition of the given Scanning.in_channel formatted input channel.

    val name_of_input : in_channel -> string

    Scanning.name_of_input ic returns the name of the character source for the given Scanning.in_channel formatted input channel.

    • since 3.09
    diff --git a/ocaml/Stdlib/Scanf/index.html b/ocaml/Stdlib/Scanf/index.html new file mode 100644 index 0000000..4e0c571 --- /dev/null +++ b/ocaml/Stdlib/Scanf/index.html @@ -0,0 +1,23 @@ + +Scanf (ocaml.Stdlib.Scanf)

    Module Stdlib.Scanf

    Formatted input functions.

    Introduction

    Functional input with format strings

    The module Scanf provides formatted input functions or scanners.

    The formatted input functions can read from any kind of input, including strings, files, or anything that can return characters. The more general source of characters is named a formatted input channel (or scanning buffer) and has type Scanning.in_channel. The more general formatted input function reads from any scanning buffer and is named bscanf.

    Generally speaking, the formatted input functions have 3 arguments:

    • the first argument is a source of characters for the input,
    • the second argument is a format string that specifies the values to read,
    • the third argument is a receiver function that is applied to the values read.

    Hence, a typical call to the formatted input function Scanf.bscanf is bscanf ic fmt f, where:

    • ic is a source of characters (typically a formatted input channel with type Scanning.in_channel),
    • fmt is a format string (the same format strings as those used to print material with module Printf or Format),
    • f is a function that has as many arguments as the number of values to read in the input according to fmt.

    A simple example

    As suggested above, the expression bscanf ic "%d" f reads a decimal integer n from the source of characters ic and returns f n.

    For instance,

    • if we use stdin as the source of characters (Scanning.stdin is the predefined formatted input channel that reads from standard input),
    • if we define the receiver f as let f x = x + 1,

    then bscanf Scanning.stdin "%d" f reads an integer n from the standard input and returns f n (that is n + 1). Thus, if we evaluate bscanf stdin "%d" f, and then enter 41 at the keyboard, the result we get is 42.

    Formatted input as a functional feature

    The OCaml scanning facility is reminiscent of the corresponding C feature. However, it is also largely different, simpler, and yet more powerful: the formatted input functions are higher-order functionals and the parameter passing mechanism is just the regular function application not the variable assignment based mechanism which is typical for formatted input in imperative languages; the OCaml format strings also feature useful additions to easily define complex tokens; as expected within a functional programming language, the formatted input functions also support polymorphism, in particular arbitrary interaction with polymorphic user-defined scanners. Furthermore, the OCaml formatted input facility is fully type-checked at compile time.

    Unsynchronized accesses

    Unsynchronized accesses to a Scanning.in_channel may lead to an invalid Scanning.in_channel state. Thus, concurrent accesses to Scanning.in_channels must be synchronized (for instance with a Mutex.t).

    Formatted input channel

    module Scanning : sig ... end

    Type of formatted input functions

    type ('a, 'b, 'c, 'd) scanner = + ('a, Scanning.in_channel, 'b, 'c, 'a -> 'd, 'd) format6 -> + 'c

    The type of formatted input scanners: ('a, 'b, 'c, 'd) scanner is the type of a formatted input function that reads from some formatted input channel according to some format string; more precisely, if scan is some formatted input function, then scan ic fmt f applies f to all the arguments specified by format string fmt, when scan has read those arguments from the Scanning.in_channel formatted input channel ic.

    For instance, the Scanf.scanf function below has type ('a, 'b, 'c, 'd) scanner, since it is a formatted input function that reads from Scanning.stdin: scanf fmt f applies f to the arguments specified by fmt, reading those arguments from Stdlib.stdin as expected.

    If the format fmt has some %r indications, the corresponding formatted input functions must be provided before receiver function f. For instance, if read_elem is an input function for values of type t, then bscanf ic "%r;" read_elem f reads a value v of type t followed by a ';' character, and returns f v.

    • since 3.10
    type ('a, 'b, 'c, 'd) scanner_opt = + ('a, Scanning.in_channel, 'b, 'c, 'a -> 'd option, 'd) format6 -> + 'c
    exception Scan_failure of string

    When the input can not be read according to the format string specification, formatted input functions typically raise exception Scan_failure.

    The general formatted input function

    val bscanf : Scanning.in_channel -> ('a, 'b, 'c, 'd) scanner

    bscanf ic fmt r1 ... rN f reads characters from the Scanning.in_channel formatted input channel ic and converts them to values according to format string fmt. As a final step, receiver function f is applied to the values read and gives the result of the bscanf call.

    For instance, if f is the function fun s i -> i + 1, then Scanf.sscanf "x = 1" "%s = %i" f returns 2.

    Arguments r1 to rN are user-defined input functions that read the argument corresponding to the %r conversions specified in the format string.

    val bscanf_opt : Scanning.in_channel -> ('a, 'b, 'c, 'd) scanner_opt

    Same as Scanf.bscanf, but returns None in case of scanning failure.

    • since 5.0

    Format string description

    The format string is a character string which contains three types of objects:

    The space character in format strings

    As mentioned above, a plain character in the format string is just matched with the next character of the input; however, two characters are special exceptions to this rule: the space character (' ' or ASCII code 32) and the line feed character ('\n' or ASCII code 10). A space does not match a single space character, but any amount of 'whitespace' in the input. More precisely, a space inside the format string matches any number of tab, space, line feed and carriage return characters. Similarly, a line feed character in the format string matches either a single line feed or a carriage return followed by a line feed.

    Matching any amount of whitespace, a space in the format string also matches no amount of whitespace at all; hence, the call bscanf ib "Price = %d $" (fun p -> p) succeeds and returns 1 when reading an input with various whitespace in it, such as Price = 1 $, Price = 1 $, or even Price=1$.

    Conversion specifications in format strings

    Conversion specifications consist in the % character, followed by an optional flag, an optional field width, and followed by one or two conversion characters.

    The conversion characters and their meanings are:

    • d: reads an optionally signed decimal integer (0-9+).
    • i: reads an optionally signed integer (usual input conventions for decimal (0-9+), hexadecimal (0x[0-9a-f]+ and 0X[0-9A-F]+), octal (0o[0-7]+), and binary (0b[0-1]+) notations are understood).
    • u: reads an unsigned decimal integer.
    • x or X: reads an unsigned hexadecimal integer ([0-9a-fA-F]+).
    • o: reads an unsigned octal integer ([0-7]+).

    • s: reads a string argument that spreads as much as possible, until the following bounding condition holds:

      Hence, this conversion always succeeds: it returns an empty string if the bounding condition holds when the scan begins.

    • S: reads a delimited string argument (delimiters and special escaped characters follow the lexical conventions of OCaml).
    • c: reads a single character. To test the current input character without reading it, specify a null field width, i.e. use specification %0c. Raise Invalid_argument, if the field width specification is greater than 1.
    • C: reads a single delimited character (delimiters and special escaped characters follow the lexical conventions of OCaml).
    • f, e, E, g, G: reads an optionally signed floating-point number in decimal notation, in the style dddd.ddd e/E+-dd.
    • h, H: reads an optionally signed floating-point number in hexadecimal notation.
    • F: reads a floating point number according to the lexical conventions of OCaml (hence the decimal point is mandatory if the exponent part is not mentioned).
    • B: reads a boolean argument (true or false).
    • b: reads a boolean argument (for backward compatibility; do not use in new programs).
    • ld, li, lu, lx, lX, lo: reads an int32 argument to the format specified by the second letter for regular integers.
    • nd, ni, nu, nx, nX, no: reads a nativeint argument to the format specified by the second letter for regular integers.
    • Ld, Li, Lu, Lx, LX, Lo: reads an int64 argument to the format specified by the second letter for regular integers.
    • [ range ]: reads characters that matches one of the characters mentioned in the range of characters range (or not mentioned in it, if the range starts with ^). Reads a string that can be empty, if the next input character does not match the range. The set of characters from c1 to c2 (inclusively) is denoted by c1-c2. Hence, %[0-9] returns a string representing a decimal number or an empty string if no decimal digit is found; similarly, %[0-9a-f] returns a string of hexadecimal digits. If a closing bracket appears in a range, it must occur as the first character of the range (or just after the ^ in case of range negation); hence []] matches a ] character and [^]] matches any character that is not ]. Use %% and %@ to include a % or a @ in a range.
    • r: user-defined reader. Takes the next ri formatted input function and applies it to the scanning buffer ib to read the next argument. The input function ri must therefore have type Scanning.in_channel -> 'a and the argument read has type 'a.
    • { fmt %}: reads a format string argument. The format string read must have the same type as the format string specification fmt. For instance, "%{ %i %}" reads any format string that can read a value of type int; hence, if s is the string "fmt:\"number is %u\"", then Scanf.sscanf s "fmt: %{%i%}" succeeds and returns the format string "number is %u".
    • ( fmt %): scanning sub-format substitution. Reads a format string rf in the input, then goes on scanning with rf instead of scanning with fmt. The format string rf must have the same type as the format string specification fmt that it replaces. For instance, "%( %i %)" reads any format string that can read a value of type int. The conversion returns the format string read rf, and then a value read using rf. Hence, if s is the string "\"%4d\"1234.00", then Scanf.sscanf s "%(%i%)" (fun fmt i -> fmt, i) evaluates to ("%4d", 1234). This behaviour is not mere format substitution, since the conversion returns the format string read as additional argument. If you need pure format substitution, use special flag _ to discard the extraneous argument: conversion %_( fmt %) reads a format string rf and then behaves the same as format string rf. Hence, if s is the string "\"%4d\"1234.00", then Scanf.sscanf s "%_(%i%)" is simply equivalent to Scanf.sscanf "1234.00" "%4d".
    • l: returns the number of lines read so far.
    • n: returns the number of characters read so far.
    • N or L: returns the number of tokens read so far.
    • !: matches the end of input condition.
    • %: matches one % character in the input.
    • @: matches one @ character in the input.
    • ,: does nothing.

    Following the % character that introduces a conversion, there may be the special flag _: the conversion that follows occurs as usual, but the resulting value is discarded. For instance, if f is the function fun i -> i + 1, and s is the string "x = 1", then Scanf.sscanf s "%_s = %i" f returns 2.

    The field width is composed of an optional integer literal indicating the maximal width of the token to read. For instance, %6d reads an integer, having at most 6 decimal digits; %4f reads a float with at most 4 characters; and %8[\000-\255] returns the next 8 characters (or all the characters still available, if fewer than 8 characters are available in the input).

    Notes:

    • as mentioned above, a %s conversion always succeeds, even if there is nothing to read in the input: in this case, it simply returns "".
    • in addition to the relevant digits, '_' characters may appear inside numbers (this is reminiscent to the usual OCaml lexical conventions). If stricter scanning is desired, use the range conversion facility instead of the number conversions.
    • the scanf facility is not intended for heavy duty lexical analysis and parsing. If it appears not expressive enough for your needs, several alternative exists: regular expressions (module Str), stream parsers, ocamllex-generated lexers, ocamlyacc-generated parsers.

    Scanning indications in format strings

    Scanning indications appear just after the string conversions %s and %[ range ] to delimit the end of the token. A scanning indication is introduced by a @ character, followed by some plain character c. It means that the string token should end just before the next matching c (which is skipped). If no c character is encountered, the string token spreads as much as possible. For instance, "%s@\t" reads a string up to the next tab character or to the end of input. If a @ character appears anywhere else in the format string, it is treated as a plain character.

    Note:

    • As usual in format strings, % and @ characters must be escaped using %% and %@; this rule still holds within range specifications and scanning indications. For instance, format "%s@%%" reads a string up to the next % character, and format "%s@%@" reads a string up to the next @.
    • The scanning indications introduce slight differences in the syntax of Scanf format strings, compared to those used for the Printf module. However, the scanning indications are similar to those used in the Format module; hence, when producing formatted text to be scanned by Scanf.bscanf, it is wise to use printing functions from the Format module (or, if you need to use functions from Printf, banish or carefully double check the format strings that contain '@' characters).

    Exceptions during scanning

    Scanners may raise the following exceptions when the input cannot be read according to the format string:

    • Raise Failure if a conversion to a number is not possible.
    • Raise End_of_file if the end of input is encountered while some more characters are needed to read the current conversion specification.
    • Raise Invalid_argument if the format string is invalid.

    Note:

    • as a consequence, scanning a %s conversion never raises exception End_of_file: if the end of input is reached the conversion succeeds and simply returns the characters read so far, or "" if none were ever read.

    Specialised formatted input functions

    val sscanf : string -> ('a, 'b, 'c, 'd) scanner

    Same as Scanf.bscanf, but reads from the given string.

    val sscanf_opt : string -> ('a, 'b, 'c, 'd) scanner_opt

    Same as Scanf.sscanf, but returns None in case of scanning failure.

    • since 5.0
    val scanf : ('a, 'b, 'c, 'd) scanner

    Same as Scanf.bscanf, but reads from the predefined formatted input channel Scanf.Scanning.stdin that is connected to Stdlib.stdin.

    val scanf_opt : ('a, 'b, 'c, 'd) scanner_opt

    Same as Scanf.scanf, but returns None in case of scanning failure.

    • since 5.0
    val kscanf : + Scanning.in_channel -> + (Scanning.in_channel -> exn -> 'd) -> + ('a, 'b, 'c, 'd) scanner

    Same as Scanf.bscanf, but takes an additional function argument ef that is called in case of error: if the scanning process or some conversion fails, the scanning function aborts and calls the error handling function ef with the formatted input channel and the exception that aborted the scanning process as arguments.

    val ksscanf : + string -> + (Scanning.in_channel -> exn -> 'd) -> + ('a, 'b, 'c, 'd) scanner

    Same as Scanf.kscanf but reads from the given string.

    • since 4.02

    Reading format strings from input

    val bscanf_format : + Scanning.in_channel -> + ('a, 'b, 'c, 'd, 'e, 'f) format6 -> + (('a, 'b, 'c, 'd, 'e, 'f) format6 -> 'g) -> + 'g

    bscanf_format ic fmt f reads a format string token from the formatted input channel ic, according to the given format string fmt, and applies f to the resulting format string value.

    • raises Scan_failure

      if the format string value read does not have the same type as fmt.

    • since 3.09
    val sscanf_format : + string -> + ('a, 'b, 'c, 'd, 'e, 'f) format6 -> + (('a, 'b, 'c, 'd, 'e, 'f) format6 -> 'g) -> + 'g

    Same as Scanf.bscanf_format, but reads from the given string.

    • since 3.09
    val format_from_string : + string -> + ('a, 'b, 'c, 'd, 'e, 'f) format6 -> + ('a, 'b, 'c, 'd, 'e, 'f) format6

    format_from_string s fmt converts a string argument to a format string, according to the given format string fmt.

    • raises Scan_failure

      if s, considered as a format string, does not have the same type as fmt.

    • since 3.10
    val unescaped : string -> string

    unescaped s return a copy of s with escape sequences (according to the lexical conventions of OCaml) replaced by their corresponding special characters. More precisely, Scanf.unescaped has the following property: for all string s, Scanf.unescaped (String.escaped s) = s.

    Always return a copy of the argument, even if there is no escape sequence in the argument.

    • raises Scan_failure

      if s is not properly escaped (i.e. s has invalid escape sequences or special characters that are not properly escaped). For instance, Scanf.unescaped "\"" will fail.

    • since 4.00
    diff --git a/ocaml/Stdlib/Semaphore/Binary/index.html b/ocaml/Stdlib/Semaphore/Binary/index.html new file mode 100644 index 0000000..ebf17a3 --- /dev/null +++ b/ocaml/Stdlib/Semaphore/Binary/index.html @@ -0,0 +1,2 @@ + +Binary (ocaml.Stdlib.Semaphore.Binary)

    Module Semaphore.Binary

    type t

    The type of binary semaphores.

    val make : bool -> t

    make b returns a new binary semaphore. If b is true, the initial value of the semaphore is 1, meaning "available". If b is false, the initial value of the semaphore is 0, meaning "unavailable".

    val release : t -> unit

    release s sets the value of semaphore s to 1, putting it in the "available" state. If other threads are waiting on s, one of them is restarted.

    val acquire : t -> unit

    acquire s blocks the calling thread until the semaphore s has value 1 (is available), then atomically sets it to 0 and returns.

    val try_acquire : t -> bool

    try_acquire s immediately returns false if the semaphore s has value 0. If s has value 1, its value is atomically set to 0 and try_acquire s returns true.

    diff --git a/ocaml/Stdlib/Semaphore/Counting/index.html b/ocaml/Stdlib/Semaphore/Counting/index.html new file mode 100644 index 0000000..2d46db5 --- /dev/null +++ b/ocaml/Stdlib/Semaphore/Counting/index.html @@ -0,0 +1,2 @@ + +Counting (ocaml.Stdlib.Semaphore.Counting)

    Module Semaphore.Counting

    type t

    The type of counting semaphores.

    val make : int -> t

    make n returns a new counting semaphore, with initial value n. The initial value n must be nonnegative.

    val release : t -> unit

    release s increments the value of semaphore s. If other threads are waiting on s, one of them is restarted. If the current value of s is equal to max_int, the value of the semaphore is unchanged and a Sys_error exception is raised to signal overflow.

    • raises Sys_error

      if the value of the semaphore would overflow max_int

    val acquire : t -> unit

    acquire s blocks the calling thread until the value of semaphore s is not zero, then atomically decrements the value of s and returns.

    val try_acquire : t -> bool

    try_acquire s immediately returns false if the value of semaphore s is zero. Otherwise, the value of s is atomically decremented and try_acquire s returns true.

    val get_value : t -> int

    get_value s returns the current value of semaphore s. The current value can be modified at any time by concurrent release and acquire operations. Hence, the get_value operation is racy, and its result should only be used for debugging or informational messages.

    diff --git a/ocaml/Stdlib/Semaphore/index.html b/ocaml/Stdlib/Semaphore/index.html new file mode 100644 index 0000000..9463f1a --- /dev/null +++ b/ocaml/Stdlib/Semaphore/index.html @@ -0,0 +1,2 @@ + +Semaphore (ocaml.Stdlib.Semaphore)

    Module Stdlib.Semaphore

    Semaphores

    A semaphore is a thread synchronization device that can be used to control access to a shared resource.

    Two flavors of semaphores are provided: counting semaphores and binary semaphores.

    • since 4.12

    Counting semaphores

    A counting semaphore is a counter that can be accessed concurrently by several threads. The typical use is to synchronize producers and consumers of a resource by counting how many units of the resource are available.

    The two basic operations on semaphores are:

    • "release" (also called "V", "post", "up", and "signal"), which increments the value of the counter. This corresponds to producing one more unit of the shared resource and making it available to others.
    • "acquire" (also called "P", "wait", "down", and "pend"), which waits until the counter is greater than zero and decrements it. This corresponds to consuming one unit of the shared resource.
    • since 4.12
    module Counting : sig ... end

    Binary semaphores

    Binary semaphores are a variant of counting semaphores where semaphores can only take two values, 0 and 1.

    A binary semaphore can be used to control access to a single shared resource, with value 1 meaning "resource is available" and value 0 meaning "resource is unavailable".

    The "release" operation of a binary semaphore sets its value to 1, and "acquire" waits until the value is 1 and sets it to 0.

    A binary semaphore can be used instead of a mutex (see module Mutex) when the mutex discipline (of unlocking the mutex from the thread that locked it) is too restrictive. The "acquire" operation corresponds to locking the mutex, and the "release" operation to unlocking it, but "release" can be performed in a thread different than the one that performed the "acquire". Likewise, it is safe to release a binary semaphore that is already available.

    • since 4.12
    module Binary : sig ... end
    diff --git a/ocaml/Stdlib/Seq/index.html b/ocaml/Stdlib/Seq/index.html new file mode 100644 index 0000000..34a1f47 --- /dev/null +++ b/ocaml/Stdlib/Seq/index.html @@ -0,0 +1,2 @@ + +Seq (ocaml.Stdlib.Seq)

    Module Stdlib.Seq

    Sequences.

    A sequence of type 'a Seq.t can be thought of as a delayed list, that is, a list whose elements are computed only when they are demanded by a consumer. This allows sequences to be produced and transformed lazily (one element at a time) rather than eagerly (all elements at once). This also allows constructing conceptually infinite sequences.

    The type 'a Seq.t is defined as a synonym for unit -> 'a Seq.node. This is a function type: therefore, it is opaque. The consumer can query a sequence in order to request the next element (if there is one), but cannot otherwise inspect the sequence in any way.

    Because it is opaque, the type 'a Seq.t does not reveal whether a sequence is:

    • persistent, which means that the sequence can be used as many times as desired, producing the same elements every time, just like an immutable list; or
    • ephemeral, which means that the sequence is not persistent. Querying an ephemeral sequence might have an observable side effect, such as incrementing a mutable counter. As a common special case, an ephemeral sequence can be affine, which means that it must be queried at most once.

    It also does not reveal whether the elements of the sequence are:

    • pre-computed and stored in memory, which means that querying the sequence is cheap;
    • computed when first demanded and then stored in memory, which means that querying the sequence once can be expensive, but querying the same sequence again is cheap; or
    • re-computed every time they are demanded, which may or may not be cheap.

    It is up to the programmer to keep these distinctions in mind so as to understand the time and space requirements of sequences.

    For the sake of simplicity, most of the documentation that follows is written under the implicit assumption that the sequences at hand are persistent. We normally do not point out when or how many times each function is invoked, because that would be too verbose. For instance, in the description of map, we write: "if xs is the sequence x0; x1; ... then map f xs is the sequence f x0; f x1; ...". If we wished to be more explicit, we could point out that the transformation takes place on demand: that is, the elements of map f xs are computed only when they are demanded. In other words, the definition let ys = map f xs terminates immediately and does not invoke f. The function call f x0 takes place only when the first element of ys is demanded, via the function call ys(). Furthermore, calling ys() twice causes f x0 to be called twice as well. If one wishes for f to be applied at most once to each element of xs, even in scenarios where ys is queried more than once, then one should use let ys = memoize (map f xs).

    As a general rule, the functions that build sequences, such as map, filter, scan, take, etc., produce sequences whose elements are computed only on demand. The functions that eagerly consume sequences, such as is_empty, find, length, iter, fold_left, etc., are the functions that force computation to take place.

    When possible, we recommend using sequences rather than dispensers (functions of type unit -> 'a option that produce elements upon demand). Whereas sequences can be persistent or ephemeral, dispensers are always ephemeral, and are typically more difficult to work with than sequences. Two conversion functions, to_dispenser and of_dispenser, are provided.

    • since 4.07
    type 'a t = unit -> 'a node

    A sequence xs of type 'a t is a delayed list of elements of type 'a. Such a sequence is queried by performing a function application xs(). This function application returns a node, allowing the caller to determine whether the sequence is empty or nonempty, and in the latter case, to obtain its head and tail.

    and +'a node =
    1. | Nil
    2. | Cons of 'a * 'a t

    A node is either Nil, which means that the sequence is empty, or Cons (x, xs), which means that x is the first element of the sequence and that xs is the remainder of the sequence.

    Consuming sequences

    The functions in this section consume their argument, a sequence, either partially or completely:

    • is_empty and uncons consume the sequence down to depth 1. That is, they demand the first argument of the sequence, if there is one.
    • iter, fold_left, length, etc., consume the sequence all the way to its end. They terminate only if the sequence is finite.
    • for_all, exists, find, etc. consume the sequence down to a certain depth, which is a priori unpredictable.

    Similarly, among the functions that consume two sequences, one can distinguish two groups:

    • iter2 and fold_left2 consume both sequences all the way to the end, provided the sequences have the same length.
    • for_all2, exists2, equal, compare consume the sequences down to a certain depth, which is a priori unpredictable.

    The functions that consume two sequences can be applied to two sequences of distinct lengths: in that case, the excess elements in the longer sequence are ignored. (It may be the case that one excess element is demanded, even though this element is not used.)

    None of the functions in this section is lazy. These functions are consumers: they force some computation to take place.

    val is_empty : 'a t -> bool

    is_empty xs determines whether the sequence xs is empty.

    It is recommended that the sequence xs be persistent. Indeed, is_empty xs demands the head of the sequence xs, so, if xs is ephemeral, it may be the case that xs cannot be used any more after this call has taken place.

    • since 4.14
    val uncons : 'a t -> ('a * 'a t) option

    If xs is empty, then uncons xs is None.

    If xs is nonempty, then uncons xs is Some (x, ys) where x is the head of the sequence and ys its tail.

    • since 4.14
    val length : 'a t -> int

    length xs is the length of the sequence xs.

    The sequence xs must be finite.

    • since 4.14
    val iter : ('a -> unit) -> 'a t -> unit

    iter f xs invokes f x successively for every element x of the sequence xs, from left to right.

    It terminates only if the sequence xs is finite.

    val fold_left : ('acc -> 'a -> 'acc) -> 'acc -> 'a t -> 'acc

    fold_left f _ xs invokes f _ x successively for every element x of the sequence xs, from left to right.

    An accumulator of type 'a is threaded through the calls to f.

    It terminates only if the sequence xs is finite.

    val iteri : (int -> 'a -> unit) -> 'a t -> unit

    iteri f xs invokes f i x successively for every element x located at index i in the sequence xs.

    It terminates only if the sequence xs is finite.

    iteri f xs is equivalent to iter (fun (i, x) -> f i x) (zip (ints 0) xs).

    • since 4.14
    val fold_lefti : ('acc -> int -> 'a -> 'acc) -> 'acc -> 'a t -> 'acc

    fold_lefti f _ xs invokes f _ i x successively for every element x located at index i of the sequence xs.

    An accumulator of type 'b is threaded through the calls to f.

    It terminates only if the sequence xs is finite.

    fold_lefti f accu xs is equivalent to fold_left (fun accu (i, x) -> f accu i x) accu (zip (ints 0) xs).

    • since 4.14
    val for_all : ('a -> bool) -> 'a t -> bool

    for_all p xs determines whether all elements x of the sequence xs satisfy p x.

    The sequence xs must be finite.

    • since 4.14
    val exists : ('a -> bool) -> 'a t -> bool

    exists xs p determines whether at least one element x of the sequence xs satisfies p x.

    The sequence xs must be finite.

    • since 4.14
    val find : ('a -> bool) -> 'a t -> 'a option

    find p xs returns Some x, where x is the first element of the sequence xs that satisfies p x, if there is such an element.

    It returns None if there is no such element.

    The sequence xs must be finite.

    • since 4.14
    val find_index : ('a -> bool) -> 'a t -> int option

    find_index p xs returns Some i, where i is the index of the first element of the sequence xs that satisfies p x, if there is such an element.

    It returns None if there is no such element.

    The sequence xs must be finite.

    • since 5.1
    val find_map : ('a -> 'b option) -> 'a t -> 'b option

    find_map f xs returns Some y, where x is the first element of the sequence xs such that f x = Some _, if there is such an element, and where y is defined by f x = Some y.

    It returns None if there is no such element.

    The sequence xs must be finite.

    • since 4.14
    val find_mapi : (int -> 'a -> 'b option) -> 'a t -> 'b option

    Same as find_map, but the predicate is applied to the index of the element as first argument (counting from 0), and the element itself as second argument.

    The sequence xs must be finite.

    • since 5.1
    val iter2 : ('a -> 'b -> unit) -> 'a t -> 'b t -> unit

    iter2 f xs ys invokes f x y successively for every pair (x, y) of elements drawn synchronously from the sequences xs and ys.

    If the sequences xs and ys have different lengths, then iteration stops as soon as one sequence is exhausted; the excess elements in the other sequence are ignored.

    Iteration terminates only if at least one of the sequences xs and ys is finite.

    iter2 f xs ys is equivalent to iter (fun (x, y) -> f x y) (zip xs ys).

    • since 4.14
    val fold_left2 : ('acc -> 'a -> 'b -> 'acc) -> 'acc -> 'a t -> 'b t -> 'acc

    fold_left2 f _ xs ys invokes f _ x y successively for every pair (x, y) of elements drawn synchronously from the sequences xs and ys.

    An accumulator of type 'a is threaded through the calls to f.

    If the sequences xs and ys have different lengths, then iteration stops as soon as one sequence is exhausted; the excess elements in the other sequence are ignored.

    Iteration terminates only if at least one of the sequences xs and ys is finite.

    fold_left2 f accu xs ys is equivalent to fold_left (fun accu (x, y) -> f accu x y) (zip xs ys).

    • since 4.14
    val for_all2 : ('a -> 'b -> bool) -> 'a t -> 'b t -> bool

    for_all2 p xs ys determines whether all pairs (x, y) of elements drawn synchronously from the sequences xs and ys satisfy p x y.

    If the sequences xs and ys have different lengths, then iteration stops as soon as one sequence is exhausted; the excess elements in the other sequence are ignored. In particular, if xs or ys is empty, then for_all2 p xs ys is true. This is where for_all2 and equal differ: equal eq xs ys can be true only if xs and ys have the same length.

    At least one of the sequences xs and ys must be finite.

    for_all2 p xs ys is equivalent to for_all (fun b -> b) (map2 p xs ys).

    • since 4.14
    val exists2 : ('a -> 'b -> bool) -> 'a t -> 'b t -> bool

    exists2 p xs ys determines whether some pair (x, y) of elements drawn synchronously from the sequences xs and ys satisfies p x y.

    If the sequences xs and ys have different lengths, then iteration must stop as soon as one sequence is exhausted; the excess elements in the other sequence are ignored.

    At least one of the sequences xs and ys must be finite.

    exists2 p xs ys is equivalent to exists (fun b -> b) (map2 p xs ys).

    • since 4.14
    val equal : ('a -> 'b -> bool) -> 'a t -> 'b t -> bool

    Provided the function eq defines an equality on elements, equal eq xs ys determines whether the sequences xs and ys are pointwise equal.

    At least one of the sequences xs and ys must be finite.

    • since 4.14
    val compare : ('a -> 'b -> int) -> 'a t -> 'b t -> int

    Provided the function cmp defines a preorder on elements, compare cmp xs ys compares the sequences xs and ys according to the lexicographic preorder.

    For more details on comparison functions, see Array.sort.

    At least one of the sequences xs and ys must be finite.

    • since 4.14

    Constructing sequences

    The functions in this section are lazy: that is, they return sequences whose elements are computed only when demanded.

    val empty : 'a t

    empty is the empty sequence. It has no elements. Its length is 0.

    val return : 'a -> 'a t

    return x is the sequence whose sole element is x. Its length is 1.

    val cons : 'a -> 'a t -> 'a t

    cons x xs is the sequence that begins with the element x, followed with the sequence xs.

    Writing cons (f()) xs causes the function call f() to take place immediately. For this call to be delayed until the sequence is queried, one must instead write (fun () -> Cons(f(), xs)).

    • since 4.11
    val init : int -> (int -> 'a) -> 'a t

    init n f is the sequence f 0; f 1; ...; f (n-1).

    n must be nonnegative.

    If desired, the infinite sequence f 0; f 1; ... can be defined as map f (ints 0).

    • since 4.14
    val unfold : ('b -> ('a * 'b) option) -> 'b -> 'a t

    unfold constructs a sequence out of a step function and an initial state.

    If f u is None then unfold f u is the empty sequence. If f u is Some (x, u') then unfold f u is the nonempty sequence cons x (unfold f u').

    For example, unfold (function [] -> None | h :: t -> Some (h, t)) l is equivalent to List.to_seq l.

    • since 4.11
    val repeat : 'a -> 'a t

    repeat x is the infinite sequence where the element x is repeated indefinitely.

    repeat x is equivalent to cycle (return x).

    • since 4.14
    val forever : (unit -> 'a) -> 'a t

    forever f is an infinite sequence where every element is produced (on demand) by the function call f().

    For instance, forever Random.bool is an infinite sequence of random bits.

    forever f is equivalent to map f (repeat ()).

    • since 4.14
    val cycle : 'a t -> 'a t

    cycle xs is the infinite sequence that consists of an infinite number of repetitions of the sequence xs.

    If xs is an empty sequence, then cycle xs is empty as well.

    Consuming (a prefix of) the sequence cycle xs once can cause the sequence xs to be consumed more than once. Therefore, xs must be persistent.

    • since 4.14
    val iterate : ('a -> 'a) -> 'a -> 'a t

    iterate f x is the infinite sequence whose elements are x, f x, f (f x), and so on.

    In other words, it is the orbit of the function f, starting at x.

    • since 4.14

    Transforming sequences

    The functions in this section are lazy: that is, they return sequences whose elements are computed only when demanded.

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f xs is the image of the sequence xs through the transformation f.

    If xs is the sequence x0; x1; ... then map f xs is the sequence f x0; f x1; ....

    val mapi : (int -> 'a -> 'b) -> 'a t -> 'b t

    mapi is analogous to map, but applies the function f to an index and an element.

    mapi f xs is equivalent to map2 f (ints 0) xs.

    • since 4.14
    val filter : ('a -> bool) -> 'a t -> 'a t

    filter p xs is the sequence of the elements x of xs that satisfy p x.

    In other words, filter p xs is the sequence xs, deprived of the elements x such that p x is false.

    val filter_map : ('a -> 'b option) -> 'a t -> 'b t

    filter_map f xs is the sequence of the elements y such that f x = Some y, where x ranges over xs.

    filter_map f xs is equivalent to map Option.get (filter Option.is_some (map f xs)).

    val scan : ('b -> 'a -> 'b) -> 'b -> 'a t -> 'b t

    If xs is a sequence [x0; x1; x2; ...], then scan f a0 xs is a sequence of accumulators [a0; a1; a2; ...] where a1 is f a0 x0, a2 is f a1 x1, and so on.

    Thus, scan f a0 xs is conceptually related to fold_left f a0 xs. However, instead of performing an eager iteration and immediately returning the final accumulator, it returns a sequence of accumulators.

    For instance, scan (+) 0 transforms a sequence of integers into the sequence of its partial sums.

    If xs has length n then scan f a0 xs has length n+1.

    • since 4.14
    val take : int -> 'a t -> 'a t

    take n xs is the sequence of the first n elements of xs.

    If xs has fewer than n elements, then take n xs is equivalent to xs.

    n must be nonnegative.

    • since 4.14
    val drop : int -> 'a t -> 'a t

    drop n xs is the sequence xs, deprived of its first n elements.

    If xs has fewer than n elements, then drop n xs is empty.

    n must be nonnegative.

    drop is lazy: the first n+1 elements of the sequence xs are demanded only when the first element of drop n xs is demanded. For this reason, drop 1 xs is not equivalent to tail xs, which queries xs immediately.

    • since 4.14
    val take_while : ('a -> bool) -> 'a t -> 'a t

    take_while p xs is the longest prefix of the sequence xs where every element x satisfies p x.

    • since 4.14
    val drop_while : ('a -> bool) -> 'a t -> 'a t

    drop_while p xs is the sequence xs, deprived of the prefix take_while p xs.

    • since 4.14
    val group : ('a -> 'a -> bool) -> 'a t -> 'a t t

    Provided the function eq defines an equality on elements, group eq xs is the sequence of the maximal runs of adjacent duplicate elements of the sequence xs.

    Every element of group eq xs is a nonempty sequence of equal elements.

    The concatenation concat (group eq xs) is equal to xs.

    Consuming group eq xs, and consuming the sequences that it contains, can cause xs to be consumed more than once. Therefore, xs must be persistent.

    • since 4.14
    val memoize : 'a t -> 'a t

    The sequence memoize xs has the same elements as the sequence xs.

    Regardless of whether xs is ephemeral or persistent, memoize xs is persistent: even if it is queried several times, xs is queried at most once.

    The construction of the sequence memoize xs internally relies on suspensions provided by the module Lazy. These suspensions are not thread-safe. Therefore, the sequence memoize xs must not be queried by multiple threads concurrently.

    • since 4.14
    exception Forced_twice

    This exception is raised when a sequence returned by once (or a suffix of it) is queried more than once.

    • since 4.14
    val once : 'a t -> 'a t

    The sequence once xs has the same elements as the sequence xs.

    Regardless of whether xs is ephemeral or persistent, once xs is an ephemeral sequence: it can be queried at most once. If it (or a suffix of it) is queried more than once, then the exception Forced_twice is raised. This can be useful, while debugging or testing, to ensure that a sequence is consumed at most once.

    • raises Forced_twice

      if once xs, or a suffix of it, is queried more than once.

    • since 4.14
    val transpose : 'a t t -> 'a t t

    If xss is a matrix (a sequence of rows), then transpose xss is the sequence of the columns of the matrix xss.

    The rows of the matrix xss are not required to have the same length.

    The matrix xss is not required to be finite (in either direction).

    The matrix xss must be persistent.

    • since 4.14

    Combining sequences

    val append : 'a t -> 'a t -> 'a t

    append xs ys is the concatenation of the sequences xs and ys.

    Its elements are the elements of xs, followed by the elements of ys.

    • since 4.11
    val concat : 'a t t -> 'a t

    If xss is a sequence of sequences, then concat xss is its concatenation.

    If xss is the sequence xs0; xs1; ... then concat xss is the sequence xs0 @ xs1 @ ....

    • since 4.13
    val flat_map : ('a -> 'b t) -> 'a t -> 'b t

    flat_map f xs is equivalent to concat (map f xs).

    val concat_map : ('a -> 'b t) -> 'a t -> 'b t

    concat_map f xs is equivalent to concat (map f xs).

    concat_map is an alias for flat_map.

    • since 4.13
    val zip : 'a t -> 'b t -> ('a * 'b) t

    zip xs ys is the sequence of pairs (x, y) drawn synchronously from the sequences xs and ys.

    If the sequences xs and ys have different lengths, then the sequence ends as soon as one sequence is exhausted; the excess elements in the other sequence are ignored.

    zip xs ys is equivalent to map2 (fun a b -> (a, b)) xs ys.

    • since 4.14
    val map2 : ('a -> 'b -> 'c) -> 'a t -> 'b t -> 'c t

    map2 f xs ys is the sequence of the elements f x y, where the pairs (x, y) are drawn synchronously from the sequences xs and ys.

    If the sequences xs and ys have different lengths, then the sequence ends as soon as one sequence is exhausted; the excess elements in the other sequence are ignored.

    map2 f xs ys is equivalent to map (fun (x, y) -> f x y) (zip xs ys).

    • since 4.14
    val interleave : 'a t -> 'a t -> 'a t

    interleave xs ys is the sequence that begins with the first element of xs, continues with the first element of ys, and so on.

    When one of the sequences xs and ys is exhausted, interleave xs ys continues with the rest of the other sequence.

    • since 4.14
    val sorted_merge : ('a -> 'a -> int) -> 'a t -> 'a t -> 'a t

    If the sequences xs and ys are sorted according to the total preorder cmp, then sorted_merge cmp xs ys is the sorted sequence obtained by merging the sequences xs and ys.

    For more details on comparison functions, see Array.sort.

    • since 4.14
    val product : 'a t -> 'b t -> ('a * 'b) t

    product xs ys is the Cartesian product of the sequences xs and ys.

    For every element x of xs and for every element y of ys, the pair (x, y) appears once as an element of product xs ys.

    The order in which the pairs appear is unspecified.

    The sequences xs and ys are not required to be finite.

    The sequences xs and ys must be persistent.

    • since 4.14
    val map_product : ('a -> 'b -> 'c) -> 'a t -> 'b t -> 'c t

    The sequence map_product f xs ys is the image through f of the Cartesian product of the sequences xs and ys.

    For every element x of xs and for every element y of ys, the element f x y appears once as an element of map_product f xs ys.

    The order in which these elements appear is unspecified.

    The sequences xs and ys are not required to be finite.

    The sequences xs and ys must be persistent.

    map_product f xs ys is equivalent to map (fun (x, y) -> f x y) (product xs ys).

    • since 4.14

    Splitting a sequence into two sequences

    val unzip : ('a * 'b) t -> 'a t * 'b t

    unzip transforms a sequence of pairs into a pair of sequences.

    unzip xs is equivalent to (map fst xs, map snd xs).

    Querying either of the sequences returned by unzip xs causes xs to be queried. Therefore, querying both of them causes xs to be queried twice. Thus, xs must be persistent and cheap. If that is not the case, use unzip (memoize xs).

    • since 4.14
    val split : ('a * 'b) t -> 'a t * 'b t

    split is an alias for unzip.

    • since 4.14
    val partition_map : ('a -> ('b, 'c) Either.t) -> 'a t -> 'b t * 'c t

    partition_map f xs returns a pair of sequences (ys, zs), where:

    • ys is the sequence of the elements y such that f x = Left y, where x ranges over xs;
    • zs is the sequence of the elements z such that f x = Right z, where x ranges over xs.

    partition_map f xs is equivalent to a pair of filter_map Either.find_left (map f xs) and filter_map Either.find_right (map f xs).

    Querying either of the sequences returned by partition_map f xs causes xs to be queried. Therefore, querying both of them causes xs to be queried twice. Thus, xs must be persistent and cheap. If that is not the case, use partition_map f (memoize xs).

    • since 4.14
    val partition : ('a -> bool) -> 'a t -> 'a t * 'a t

    partition p xs returns a pair of the subsequence of the elements of xs that satisfy p and the subsequence of the elements of xs that do not satisfy p.

    partition p xs is equivalent to filter p xs, filter (fun x -> not (p x)) xs.

    Consuming both of the sequences returned by partition p xs causes xs to be consumed twice and causes the function f to be applied twice to each element of the list. Therefore, f should be pure and cheap. Furthermore, xs should be persistent and cheap. If that is not the case, use partition p (memoize xs).

    • since 4.14

    Converting between sequences and dispensers

    A dispenser is a representation of a sequence as a function of type unit -> 'a option. Every time this function is invoked, it returns the next element of the sequence. When there are no more elements, it returns None. A dispenser has mutable internal state, therefore is ephemeral: the sequence that it represents can be consumed at most once.

    val of_dispenser : (unit -> 'a option) -> 'a t

    of_dispenser it is the sequence of the elements produced by the dispenser it. It is an ephemeral sequence: it can be consumed at most once. If a persistent sequence is needed, use memoize (of_dispenser it).

    • since 4.14
    val to_dispenser : 'a t -> unit -> 'a option

    to_dispenser xs is a fresh dispenser on the sequence xs.

    This dispenser has mutable internal state, which is not protected by a lock; so, it must not be used by several threads concurrently.

    • since 4.14

    Sequences of integers

    val ints : int -> int t

    ints i is the infinite sequence of the integers beginning at i and counting up.

    • since 4.14
    diff --git a/ocaml/Stdlib/Set/Make/argument-1-Ord/index.html b/ocaml/Stdlib/Set/Make/argument-1-Ord/index.html new file mode 100644 index 0000000..c826b62 --- /dev/null +++ b/ocaml/Stdlib/Set/Make/argument-1-Ord/index.html @@ -0,0 +1,2 @@ + +Ord (ocaml.Stdlib.Set.Make.Ord)

    Parameter Make.Ord

    type t

    The type of the set elements.

    val compare : t -> t -> int

    A total ordering function over the set elements. This is a two-argument function f such that f e1 e2 is zero if the elements e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    diff --git a/ocaml/Stdlib/Set/Make/index.html b/ocaml/Stdlib/Set/Make/index.html new file mode 100644 index 0000000..9db7e7a --- /dev/null +++ b/ocaml/Stdlib/Set/Make/index.html @@ -0,0 +1,2 @@ + +Make (ocaml.Stdlib.Set.Make)

    Module Set.Make

    Functor building an implementation of the set structure given a totally ordered type.

    Parameters

    module Ord : OrderedType

    Signature

    Sets

    type elt = Ord.t

    The type of the set elements.

    type t

    The type of sets.

    val empty : t

    The empty set.

    val add : elt -> t -> t

    add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val singleton : elt -> t

    singleton x returns the one-element set containing only x.

    val remove : elt -> t -> t

    remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val union : t -> t -> t

    Set union.

    val inter : t -> t -> t

    Set intersection.

    val disjoint : t -> t -> bool

    Test if two sets are disjoint.

    • since 4.08
    val diff : t -> t -> t

    Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

    val cardinal : t -> int

    Return the number of elements of a set.

    Elements

    val elements : t -> elt list

    Return the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Set.Make.

    val min_elt : t -> elt

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

    val min_elt_opt : t -> elt option

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

    • since 4.05
    val max_elt : t -> elt

    Same as min_elt, but returns the largest element of the given set.

    val max_elt_opt : t -> elt option

    Same as min_elt_opt, but returns the largest element of the given set.

    • since 4.05
    val choose : t -> elt

    Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    val choose_opt : t -> elt option

    Return one element of the given set, or None if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    • since 4.05

    Searching

    val find : elt -> t -> elt

    find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

    • since 4.01
    val find_opt : elt -> t -> elt option

    find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

    • since 4.05
    val find_first : (elt -> bool) -> t -> elt

    find_first f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

    For example, find_first (fun e -> Ord.compare e x >= 0) s will return the first element e of s where Ord.compare e x >= 0 (intuitively: e >= x), or raise Not_found if x is greater than any element of s.

    • since 4.05
    val find_first_opt : (elt -> bool) -> t -> elt option

    find_first_opt f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

    • since 4.05
    val find_last : (elt -> bool) -> t -> elt

    find_last f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

    • since 4.05
    val find_last_opt : (elt -> bool) -> t -> elt option

    find_last_opt f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

    • since 4.05

    Traversing

    val iter : (elt -> unit) -> t -> unit

    iter f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.

    val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc

    fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

    Transforming

    val map : (elt -> elt) -> t -> t

    map f s is the set whose elements are f a0,f a1... f aN, where a0,a1...aN are the elements of s.

    The elements are passed to f in increasing order with respect to the ordering over the type of the elements.

    If no element of s is changed by f, s is returned unchanged. (If each output of f is physically equal to its input, the returned set is physically equal to s.)

    • since 4.04
    val filter : (elt -> bool) -> t -> t

    filter f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val filter_map : (elt -> elt option) -> t -> t

    filter_map f s returns the set of all v such that f x = Some v for some element x of s.

    For example,

    filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) s

    is the set of halves of the even elements of s.

    If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned unchanged: the result of the function is then physically equal to s.

    • since 4.11
    val partition : (elt -> bool) -> t -> t * t

    partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

    val split : elt -> t -> t * bool * t

    split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.

    Predicates and comparisons

    val is_empty : t -> bool

    Test whether a set is empty or not.

    val mem : elt -> t -> bool

    mem x s tests whether x belongs to the set s.

    val equal : t -> t -> bool

    equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

    val compare : t -> t -> int

    Total ordering between sets. Can be used as the ordering function for doing sets of sets.

    val subset : t -> t -> bool

    subset s1 s2 tests whether the set s1 is a subset of the set s2.

    val for_all : (elt -> bool) -> t -> bool

    for_all f s checks if all elements of the set satisfy the predicate f.

    val exists : (elt -> bool) -> t -> bool

    exists f s checks if at least one element of the set satisfies the predicate f.

    Converting

    val to_list : t -> elt list

    to_list s is elements s.

    • since 5.1
    val of_list : elt list -> t

    of_list l creates a set from a list of elements. This is usually more efficient than folding add over the list, except perhaps for lists with many duplicated elements.

    • since 4.02
    val to_seq_from : elt -> t -> elt Seq.t

    to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

    • since 4.07
    val to_seq : t -> elt Seq.t

    Iterate on the whole set, in ascending order

    • since 4.07
    val to_rev_seq : t -> elt Seq.t

    Iterate on the whole set, in descending order

    • since 4.12
    val add_seq : elt Seq.t -> t -> t

    Add the given elements to the set, in order.

    • since 4.07
    val of_seq : elt Seq.t -> t

    Build a set from the given bindings

    • since 4.07
    diff --git a/ocaml/Stdlib/Set/index.html b/ocaml/Stdlib/Set/index.html new file mode 100644 index 0000000..83ac4ec --- /dev/null +++ b/ocaml/Stdlib/Set/index.html @@ -0,0 +1,13 @@ + +Set (ocaml.Stdlib.Set)

    Module Stdlib.Set

    Sets over ordered types.

    This module implements the set data structure, given a total ordering function over the set elements. All operations over sets are purely applicative (no side-effects). The implementation uses balanced binary trees, and is therefore reasonably efficient: insertion and membership take time logarithmic in the size of the set, for instance.

    The Make functor constructs implementations for any type, given a compare function. For instance:

      module IntPairs =
+    struct
+      type t = int * int
+      let compare (x0,y0) (x1,y1) =
+        match Stdlib.compare x0 x1 with
+            0 -> Stdlib.compare y0 y1
+          | c -> c
+    end
+
+  module PairsSet = Set.Make(IntPairs)
+
+  let m = PairsSet.(empty |> add (2,3) |> add (5,7) |> add (11,13))

    This creates a new module PairsSet, with a new type PairsSet.t of sets of int * int.

    module type OrderedType = sig ... end

    Input signature of the functor Make.

    module type S = sig ... end

    Output signature of the functor Make.

    module Make (Ord : OrderedType) : S with type elt = Ord.t

    Functor building an implementation of the set structure given a totally ordered type.

    diff --git a/ocaml/Stdlib/Set/module-type-OrderedType/index.html b/ocaml/Stdlib/Set/module-type-OrderedType/index.html new file mode 100644 index 0000000..88758bb --- /dev/null +++ b/ocaml/Stdlib/Set/module-type-OrderedType/index.html @@ -0,0 +1,2 @@ + +OrderedType (ocaml.Stdlib.Set.OrderedType)

    Module type Set.OrderedType

    Input signature of the functor Make.

    type t

    The type of the set elements.

    val compare : t -> t -> int

    A total ordering function over the set elements. This is a two-argument function f such that f e1 e2 is zero if the elements e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    diff --git a/ocaml/Stdlib/Set/module-type-S/index.html b/ocaml/Stdlib/Set/module-type-S/index.html new file mode 100644 index 0000000..e216e99 --- /dev/null +++ b/ocaml/Stdlib/Set/module-type-S/index.html @@ -0,0 +1,2 @@ + +S (ocaml.Stdlib.Set.S)

    Module type Set.S

    Output signature of the functor Make.

    Sets

    type elt

    The type of the set elements.

    type t

    The type of sets.

    val empty : t

    The empty set.

    val add : elt -> t -> t

    add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val singleton : elt -> t

    singleton x returns the one-element set containing only x.

    val remove : elt -> t -> t

    remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val union : t -> t -> t

    Set union.

    val inter : t -> t -> t

    Set intersection.

    val disjoint : t -> t -> bool

    Test if two sets are disjoint.

    • since 4.08
    val diff : t -> t -> t

    Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

    val cardinal : t -> int

    Return the number of elements of a set.

    Elements

    val elements : t -> elt list

    Return the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Set.Make.

    val min_elt : t -> elt

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

    val min_elt_opt : t -> elt option

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

    • since 4.05
    val max_elt : t -> elt

    Same as min_elt, but returns the largest element of the given set.

    val max_elt_opt : t -> elt option

    Same as min_elt_opt, but returns the largest element of the given set.

    • since 4.05
    val choose : t -> elt

    Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    val choose_opt : t -> elt option

    Return one element of the given set, or None if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    • since 4.05

    Searching

    val find : elt -> t -> elt

    find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

    • since 4.01
    val find_opt : elt -> t -> elt option

    find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

    • since 4.05
    val find_first : (elt -> bool) -> t -> elt

    find_first f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

    For example, find_first (fun e -> Ord.compare e x >= 0) s will return the first element e of s where Ord.compare e x >= 0 (intuitively: e >= x), or raise Not_found if x is greater than any element of s.

    • since 4.05
    val find_first_opt : (elt -> bool) -> t -> elt option

    find_first_opt f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

    • since 4.05
    val find_last : (elt -> bool) -> t -> elt

    find_last f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

    • since 4.05
    val find_last_opt : (elt -> bool) -> t -> elt option

    find_last_opt f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

    • since 4.05

    Traversing

    val iter : (elt -> unit) -> t -> unit

    iter f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.

    val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc

    fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

    Transforming

    val map : (elt -> elt) -> t -> t

    map f s is the set whose elements are f a0,f a1... f aN, where a0,a1...aN are the elements of s.

    The elements are passed to f in increasing order with respect to the ordering over the type of the elements.

    If no element of s is changed by f, s is returned unchanged. (If each output of f is physically equal to its input, the returned set is physically equal to s.)

    • since 4.04
    val filter : (elt -> bool) -> t -> t

    filter f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val filter_map : (elt -> elt option) -> t -> t

    filter_map f s returns the set of all v such that f x = Some v for some element x of s.

    For example,

    filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) s

    is the set of halves of the even elements of s.

    If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned unchanged: the result of the function is then physically equal to s.

    • since 4.11
    val partition : (elt -> bool) -> t -> t * t

    partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

    val split : elt -> t -> t * bool * t

    split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.

    Predicates and comparisons

    val is_empty : t -> bool

    Test whether a set is empty or not.

    val mem : elt -> t -> bool

    mem x s tests whether x belongs to the set s.

    val equal : t -> t -> bool

    equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

    val compare : t -> t -> int

    Total ordering between sets. Can be used as the ordering function for doing sets of sets.

    val subset : t -> t -> bool

    subset s1 s2 tests whether the set s1 is a subset of the set s2.

    val for_all : (elt -> bool) -> t -> bool

    for_all f s checks if all elements of the set satisfy the predicate f.

    val exists : (elt -> bool) -> t -> bool

    exists f s checks if at least one element of the set satisfies the predicate f.

    Converting

    val to_list : t -> elt list

    to_list s is elements s.

    • since 5.1
    val of_list : elt list -> t

    of_list l creates a set from a list of elements. This is usually more efficient than folding add over the list, except perhaps for lists with many duplicated elements.

    • since 4.02
    val to_seq_from : elt -> t -> elt Seq.t

    to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

    • since 4.07
    val to_seq : t -> elt Seq.t

    Iterate on the whole set, in ascending order

    • since 4.07
    val to_rev_seq : t -> elt Seq.t

    Iterate on the whole set, in descending order

    • since 4.12
    val add_seq : elt Seq.t -> t -> t

    Add the given elements to the set, in order.

    • since 4.07
    val of_seq : elt Seq.t -> t

    Build a set from the given bindings

    • since 4.07
    diff --git a/ocaml/Stdlib/Stack/index.html b/ocaml/Stdlib/Stack/index.html new file mode 100644 index 0000000..c64a29b --- /dev/null +++ b/ocaml/Stdlib/Stack/index.html @@ -0,0 +1,2 @@ + +Stack (ocaml.Stdlib.Stack)

    Module Stdlib.Stack

    Last-in first-out stacks.

    This module implements stacks (LIFOs), with in-place modification.

    Unsynchronized accesses

    Unsynchronized accesses to a stack may lead to an invalid queue state. Thus, concurrent accesses to stacks must be synchronized (for instance with a Mutex.t).

    type !'a t

    The type of stacks containing elements of type 'a.

    exception Empty

    Raised when Stack.pop or Stack.top is applied to an empty stack.

    val create : unit -> 'a t

    Return a new stack, initially empty.

    val push : 'a -> 'a t -> unit

    push x s adds the element x at the top of stack s.

    val pop : 'a t -> 'a

    pop s removes and returns the topmost element in stack s, or raises Empty if the stack is empty.

    val pop_opt : 'a t -> 'a option

    pop_opt s removes and returns the topmost element in stack s, or returns None if the stack is empty.

    • since 4.08
    val drop : 'a t -> unit

    drop s removes the topmost element in stack s, or raises Empty if the stack is empty.

    • since 5.1
    val top : 'a t -> 'a

    top s returns the topmost element in stack s, or raises Empty if the stack is empty.

    val top_opt : 'a t -> 'a option

    top_opt s returns the topmost element in stack s, or None if the stack is empty.

    • since 4.08
    val clear : 'a t -> unit

    Discard all elements from a stack.

    val copy : 'a t -> 'a t

    Return a copy of the given stack.

    val is_empty : 'a t -> bool

    Return true if the given stack is empty, false otherwise.

    val length : 'a t -> int

    Return the number of elements in a stack. Time complexity O(1)

    val iter : ('a -> unit) -> 'a t -> unit

    iter f s applies f in turn to all elements of s, from the element at the top of the stack to the element at the bottom of the stack. The stack itself is unchanged.

    val fold : ('acc -> 'a -> 'acc) -> 'acc -> 'a t -> 'acc

    fold f accu s is (f (... (f (f accu x1) x2) ...) xn) where x1 is the top of the stack, x2 the second element, and xn the bottom element. The stack is unchanged.

    • since 4.03

    Stacks and Sequences

    val to_seq : 'a t -> 'a Seq.t

    Iterate on the stack, top to bottom. It is safe to modify the stack during iteration.

    • since 4.07
    val add_seq : 'a t -> 'a Seq.t -> unit

    Add the elements from the sequence on the top of the stack.

    • since 4.07
    val of_seq : 'a Seq.t -> 'a t

    Create a stack from the sequence.

    • since 4.07
    diff --git a/ocaml/Stdlib/StdLabels/index.html b/ocaml/Stdlib/StdLabels/index.html new file mode 100644 index 0000000..1ee2e17 --- /dev/null +++ b/ocaml/Stdlib/StdLabels/index.html @@ -0,0 +1,6 @@ + +StdLabels (ocaml.Stdlib.StdLabels)

    Module Stdlib.StdLabels

    Standard labeled libraries.

    This meta-module provides versions of the Array, Bytes, List and String modules where function arguments are systematically labeled. It is intended to be opened at the top of source files, as shown below.

      open StdLabels
+
+  let to_upper = String.map ~f:Char.uppercase_ascii
+  let seq len = List.init ~f:(fun i -> i) ~len
+  let everything = Array.create_matrix ~dimx:42 ~dimy:42 42
    module Array = ArrayLabels
    module Bytes = BytesLabels
    module List = ListLabels
    module String = StringLabels
    diff --git a/ocaml/Stdlib/String/index.html b/ocaml/Stdlib/String/index.html new file mode 100644 index 0000000..64ea611 --- /dev/null +++ b/ocaml/Stdlib/String/index.html @@ -0,0 +1,5 @@ + +String (ocaml.Stdlib.String)

    Module Stdlib.String

    Strings.

    A string s of length n is an indexable and immutable sequence of n bytes. For historical reasons these bytes are referred to as characters.

    The semantics of string functions is defined in terms of indices and positions. These are depicted and described as follows.

    positions  0   1   2   3   4    n-1    n
+           +---+---+---+---+     +-----+
+  indices  | 0 | 1 | 2 | 3 | ... | n-1 |
+           +---+---+---+---+     +-----+
    • An index i of s is an integer in the range [0;n-1]. It represents the ith byte (character) of s which can be accessed using the constant time string indexing operator s.[i].
    • A position i of s is an integer in the range [0;n]. It represents either the point at the beginning of the string, or the point between two indices, or the point at the end of the string. The ith byte index is between position i and i+1.

    Two integers start and len are said to define a valid substring of s if len >= 0 and start, start+len are positions of s.

    Unicode text. Strings being arbitrary sequences of bytes, they can hold any kind of textual encoding. However the recommended encoding for storing Unicode text in OCaml strings is UTF-8. This is the encoding used by Unicode escapes in string literals. For example the string "\u{1F42B}" is the UTF-8 encoding of the Unicode character U+1F42B.

    Past mutability. Before OCaml 4.02, strings used to be modifiable in place like Bytes.t mutable sequences of bytes. OCaml 4 had various compiler flags and configuration options to support the transition period from mutable to immutable strings. Those options are no longer available, and strings are now always immutable.

    The labeled version of this module can be used as described in the StdLabels module.

    Strings

    type t = string

    The type for strings.

    val make : int -> char -> string

    make n c is a string of length n with each index holding the character c.

    val init : int -> (int -> char) -> string

    init n f is a string of length n with index i holding the character f i (called in increasing index order).

    • since 4.02
    val empty : string

    The empty string.

    • since 4.13
    val length : string -> int

    length s is the length (number of bytes/characters) of s.

    val get : string -> int -> char

    get s i is the character at index i in s. This is the same as writing s.[i].

    val of_bytes : bytes -> string

    Return a new string that contains the same bytes as the given byte sequence.

    • since 4.13
    val to_bytes : string -> bytes

    Return a new byte sequence that contains the same bytes as the given string.

    • since 4.13
    val blit : string -> int -> bytes -> int -> int -> unit

    Same as Bytes.blit_string which should be preferred.

    Concatenating

    Note. The Stdlib.(^) binary operator concatenates two strings.

    val concat : string -> string list -> string

    concat sep ss concatenates the list of strings ss, inserting the separator string sep between each.

    val cat : string -> string -> string

    cat s1 s2 concatenates s1 and s2 (s1 ^ s2).

    • since 4.13

    Predicates and comparisons

    val equal : t -> t -> bool

    equal s0 s1 is true if and only if s0 and s1 are character-wise equal.

    • since 4.03 (4.05 in StringLabels)
    val compare : t -> t -> int

    compare s0 s1 sorts s0 and s1 in lexicographical order. compare behaves like Stdlib.compare on strings but may be more efficient.

    val starts_with : prefix:string -> string -> bool

    starts_with ~prefix s is true if and only if s starts with prefix.

    • since 4.13
    val ends_with : suffix:string -> string -> bool

    ends_with ~suffix s is true if and only if s ends with suffix.

    • since 4.13
    val contains_from : string -> int -> char -> bool

    contains_from s start c is true if and only if c appears in s after position start.

    val rcontains_from : string -> int -> char -> bool

    rcontains_from s stop c is true if and only if c appears in s before position stop+1.

    val contains : string -> char -> bool

    contains s c is String.contains_from s 0 c.

    Extracting substrings

    val sub : string -> int -> int -> string

    sub s pos len is a string of length len, containing the substring of s that starts at position pos and has length len.

    val split_on_char : char -> string -> string list

    split_on_char sep s is the list of all (possibly empty) substrings of s that are delimited by the character sep. If s is empty, the result is the singleton list [""].

    The function's result is specified by the following invariants:

    • The list is not empty.
    • Concatenating its elements using sep as a separator returns a string equal to the input (concat (make 1 sep) (split_on_char sep s) = s).
    • No string in the result contains the sep character.
    • since 4.04 (4.05 in StringLabels)

    Transforming

    val map : (char -> char) -> string -> string

    map f s is the string resulting from applying f to all the characters of s in increasing order.

    • since 4.00
    val mapi : (int -> char -> char) -> string -> string

    mapi f s is like map but the index of the character is also passed to f.

    • since 4.02
    val fold_left : ('acc -> char -> 'acc) -> 'acc -> string -> 'acc

    fold_left f x s computes f (... (f (f x s.[0]) s.[1]) ...) s.[n-1], where n is the length of the string s.

    • since 4.13
    val fold_right : (char -> 'acc -> 'acc) -> string -> 'acc -> 'acc

    fold_right f s x computes f s.[0] (f s.[1] ( ... (f s.[n-1] x) ...)), where n is the length of the string s.

    • since 4.13
    val for_all : (char -> bool) -> string -> bool

    for_all p s checks if all characters in s satisfy the predicate p.

    • since 4.13
    val exists : (char -> bool) -> string -> bool

    exists p s checks if at least one character of s satisfies the predicate p.

    • since 4.13
    val trim : string -> string

    trim s is s without leading and trailing whitespace. Whitespace characters are: ' ', '\x0C' (form feed), '\n', '\r', and '\t'.

    • since 4.00
    val escaped : string -> string

    escaped s is s with special characters represented by escape sequences, following the lexical conventions of OCaml.

    All characters outside the US-ASCII printable range [0x20;0x7E] are escaped, as well as backslash (0x2F) and double-quote (0x22).

    The function Scanf.unescaped is a left inverse of escaped, i.e. Scanf.unescaped (escaped s) = s for any string s (unless escaped s fails).

    val uppercase_ascii : string -> string

    uppercase_ascii s is s with all lowercase letters translated to uppercase, using the US-ASCII character set.

    • since 4.03 (4.05 in StringLabels)
    val lowercase_ascii : string -> string

    lowercase_ascii s is s with all uppercase letters translated to lowercase, using the US-ASCII character set.

    • since 4.03 (4.05 in StringLabels)
    val capitalize_ascii : string -> string

    capitalize_ascii s is s with the first character set to uppercase, using the US-ASCII character set.

    • since 4.03 (4.05 in StringLabels)
    val uncapitalize_ascii : string -> string

    uncapitalize_ascii s is s with the first character set to lowercase, using the US-ASCII character set.

    • since 4.03 (4.05 in StringLabels)

    Traversing

    val iter : (char -> unit) -> string -> unit

    iter f s applies function f in turn to all the characters of s. It is equivalent to f s.[0]; f s.[1]; ...; f s.[length s - 1]; ().

    val iteri : (int -> char -> unit) -> string -> unit

    iteri is like iter, but the function is also given the corresponding character index.

    • since 4.00

    Searching

    val index_from : string -> int -> char -> int

    index_from s i c is the index of the first occurrence of c in s after position i.

    • raises Not_found

      if c does not occur in s after position i.

    val index_from_opt : string -> int -> char -> int option

    index_from_opt s i c is the index of the first occurrence of c in s after position i (if any).

    • since 4.05
    val rindex_from : string -> int -> char -> int

    rindex_from s i c is the index of the last occurrence of c in s before position i+1.

    • raises Not_found

      if c does not occur in s before position i+1.

    val rindex_from_opt : string -> int -> char -> int option

    rindex_from_opt s i c is the index of the last occurrence of c in s before position i+1 (if any).

    • since 4.05
    val index : string -> char -> int

    index s c is String.index_from s 0 c.

    val index_opt : string -> char -> int option

    index_opt s c is String.index_from_opt s 0 c.

    • since 4.05
    val rindex : string -> char -> int

    rindex s c is String.rindex_from s (length s - 1) c.

    val rindex_opt : string -> char -> int option

    rindex_opt s c is String.rindex_from_opt s (length s - 1) c.

    • since 4.05

    Strings and Sequences

    val to_seq : t -> char Seq.t

    to_seq s is a sequence made of the string's characters in increasing order. In "unsafe-string" mode, modifications of the string during iteration will be reflected in the sequence.

    • since 4.07
    val to_seqi : t -> (int * char) Seq.t

    to_seqi s is like to_seq but also tuples the corresponding index.

    • since 4.07
    val of_seq : char Seq.t -> t

    of_seq s is a string made of the sequence's characters.

    • since 4.07

    UTF decoding and validations

    • since 4.14

    UTF-8

    val get_utf_8_uchar : t -> int -> Uchar.utf_decode

    get_utf_8_uchar b i decodes an UTF-8 character at index i in b.

    val is_valid_utf_8 : t -> bool

    is_valid_utf_8 b is true if and only if b contains valid UTF-8 data.

    UTF-16BE

    val get_utf_16be_uchar : t -> int -> Uchar.utf_decode

    get_utf_16be_uchar b i decodes an UTF-16BE character at index i in b.

    val is_valid_utf_16be : t -> bool

    is_valid_utf_16be b is true if and only if b contains valid UTF-16BE data.

    UTF-16LE

    val get_utf_16le_uchar : t -> int -> Uchar.utf_decode

    get_utf_16le_uchar b i decodes an UTF-16LE character at index i in b.

    val is_valid_utf_16le : t -> bool

    is_valid_utf_16le b is true if and only if b contains valid UTF-16LE data.

    Binary decoding of integers

    The functions in this section binary decode integers from strings.

    All following functions raise Invalid_argument if the characters needed at index i to decode the integer are not available.

    Little-endian (resp. big-endian) encoding means that least (resp. most) significant bytes are stored first. Big-endian is also known as network byte order. Native-endian encoding is either little-endian or big-endian depending on Sys.big_endian.

    32-bit and 64-bit integers are represented by the int32 and int64 types, which can be interpreted either as signed or unsigned numbers.

    8-bit and 16-bit integers are represented by the int type, which has more bits than the binary encoding. These extra bits are sign-extended (or zero-extended) for functions which decode 8-bit or 16-bit integers and represented them with int values.

    val get_uint8 : string -> int -> int

    get_uint8 b i is b's unsigned 8-bit integer starting at character index i.

    • since 4.13
    val get_int8 : string -> int -> int

    get_int8 b i is b's signed 8-bit integer starting at character index i.

    • since 4.13
    val get_uint16_ne : string -> int -> int

    get_uint16_ne b i is b's native-endian unsigned 16-bit integer starting at character index i.

    • since 4.13
    val get_uint16_be : string -> int -> int

    get_uint16_be b i is b's big-endian unsigned 16-bit integer starting at character index i.

    • since 4.13
    val get_uint16_le : string -> int -> int

    get_uint16_le b i is b's little-endian unsigned 16-bit integer starting at character index i.

    • since 4.13
    val get_int16_ne : string -> int -> int

    get_int16_ne b i is b's native-endian signed 16-bit integer starting at character index i.

    • since 4.13
    val get_int16_be : string -> int -> int

    get_int16_be b i is b's big-endian signed 16-bit integer starting at character index i.

    • since 4.13
    val get_int16_le : string -> int -> int

    get_int16_le b i is b's little-endian signed 16-bit integer starting at character index i.

    • since 4.13
    val get_int32_ne : string -> int -> int32

    get_int32_ne b i is b's native-endian 32-bit integer starting at character index i.

    • since 4.13
    val hash : t -> int

    An unseeded hash function for strings, with the same output value as Hashtbl.hash. This function allows this module to be passed as argument to the functor Hashtbl.Make.

    • since 5.0
    val seeded_hash : int -> t -> int

    A seeded hash function for strings, with the same output value as Hashtbl.seeded_hash. This function allows this module to be passed as argument to the functor Hashtbl.MakeSeeded.

    • since 5.0
    val get_int32_be : string -> int -> int32

    get_int32_be b i is b's big-endian 32-bit integer starting at character index i.

    • since 4.13
    val get_int32_le : string -> int -> int32

    get_int32_le b i is b's little-endian 32-bit integer starting at character index i.

    • since 4.13
    val get_int64_ne : string -> int -> int64

    get_int64_ne b i is b's native-endian 64-bit integer starting at character index i.

    • since 4.13
    val get_int64_be : string -> int -> int64

    get_int64_be b i is b's big-endian 64-bit integer starting at character index i.

    • since 4.13
    val get_int64_le : string -> int -> int64

    get_int64_le b i is b's little-endian 64-bit integer starting at character index i.

    • since 4.13
    diff --git a/ocaml/Stdlib/StringLabels/index.html b/ocaml/Stdlib/StringLabels/index.html new file mode 100644 index 0000000..499660c --- /dev/null +++ b/ocaml/Stdlib/StringLabels/index.html @@ -0,0 +1,11 @@ + +StringLabels (ocaml.Stdlib.StringLabels)

    Module Stdlib.StringLabels

    Strings.

    A string s of length n is an indexable and immutable sequence of n bytes. For historical reasons these bytes are referred to as characters.

    The semantics of string functions is defined in terms of indices and positions. These are depicted and described as follows.

    positions  0   1   2   3   4    n-1    n
+           +---+---+---+---+     +-----+
+  indices  | 0 | 1 | 2 | 3 | ... | n-1 |
+           +---+---+---+---+     +-----+
    • An index i of s is an integer in the range [0;n-1]. It represents the ith byte (character) of s which can be accessed using the constant time string indexing operator s.[i].
    • A position i of s is an integer in the range [0;n]. It represents either the point at the beginning of the string, or the point between two indices, or the point at the end of the string. The ith byte index is between position i and i+1.

    Two integers start and len are said to define a valid substring of s if len >= 0 and start, start+len are positions of s.

    Unicode text. Strings being arbitrary sequences of bytes, they can hold any kind of textual encoding. However the recommended encoding for storing Unicode text in OCaml strings is UTF-8. This is the encoding used by Unicode escapes in string literals. For example the string "\u{1F42B}" is the UTF-8 encoding of the Unicode character U+1F42B.

    Past mutability. Before OCaml 4.02, strings used to be modifiable in place like Bytes.t mutable sequences of bytes. OCaml 4 had various compiler flags and configuration options to support the transition period from mutable to immutable strings. Those options are no longer available, and strings are now always immutable.

    The labeled version of this module can be used as described in the StdLabels module.

    Strings

    type t = string

    The type for strings.

    val make : int -> char -> string

    make n c is a string of length n with each index holding the character c.

    val init : int -> f:(int -> char) -> string

    init n ~f is a string of length n with index i holding the character f i (called in increasing index order).

    • since 4.02
    val empty : string

    The empty string.

    • since 4.13
    val length : string -> int

    length s is the length (number of bytes/characters) of s.

    val get : string -> int -> char

    get s i is the character at index i in s. This is the same as writing s.[i].

    val of_bytes : bytes -> string

    Return a new string that contains the same bytes as the given byte sequence.

    • since 4.13
    val to_bytes : string -> bytes

    Return a new byte sequence that contains the same bytes as the given string.

    • since 4.13
    val blit : + src:string -> + src_pos:int -> + dst:bytes -> + dst_pos:int -> + len:int -> + unit

    Same as Bytes.blit_string which should be preferred.

    Concatenating

    Note. The Stdlib.(^) binary operator concatenates two strings.

    val concat : sep:string -> string list -> string

    concat ~sep ss concatenates the list of strings ss, inserting the separator string sep between each.

    val cat : string -> string -> string

    cat s1 s2 concatenates s1 and s2 (s1 ^ s2).

    • since 4.13

    Predicates and comparisons

    val equal : t -> t -> bool

    equal s0 s1 is true if and only if s0 and s1 are character-wise equal.

    • since 4.05
    val compare : t -> t -> int

    compare s0 s1 sorts s0 and s1 in lexicographical order. compare behaves like Stdlib.compare on strings but may be more efficient.

    val starts_with : prefix:string -> string -> bool

    starts_with ~prefix s is true if and only if s starts with prefix.

    • since 4.13
    val ends_with : suffix:string -> string -> bool

    ends_with ~suffix s is true if and only if s ends with suffix.

    • since 4.13
    val contains_from : string -> int -> char -> bool

    contains_from s start c is true if and only if c appears in s after position start.

    val rcontains_from : string -> int -> char -> bool

    rcontains_from s stop c is true if and only if c appears in s before position stop+1.

    val contains : string -> char -> bool

    contains s c is String.contains_from s 0 c.

    Extracting substrings

    val sub : string -> pos:int -> len:int -> string

    sub s ~pos ~len is a string of length len, containing the substring of s that starts at position pos and has length len.

    val split_on_char : sep:char -> string -> string list

    split_on_char ~sep s is the list of all (possibly empty) substrings of s that are delimited by the character sep. If s is empty, the result is the singleton list [""].

    The function's result is specified by the following invariants:

    • The list is not empty.
    • Concatenating its elements using sep as a separator returns a string equal to the input (concat (make 1 sep) (split_on_char sep s) = s).
    • No string in the result contains the sep character.
    • since 4.05

    Transforming

    val map : f:(char -> char) -> string -> string

    map f s is the string resulting from applying f to all the characters of s in increasing order.

    • since 4.00
    val mapi : f:(int -> char -> char) -> string -> string

    mapi ~f s is like map but the index of the character is also passed to f.

    • since 4.02
    val fold_left : f:('acc -> char -> 'acc) -> init:'acc -> string -> 'acc

    fold_left f x s computes f (... (f (f x s.[0]) s.[1]) ...) s.[n-1], where n is the length of the string s.

    • since 4.13
    val fold_right : f:(char -> 'acc -> 'acc) -> string -> init:'acc -> 'acc

    fold_right f s x computes f s.[0] (f s.[1] ( ... (f s.[n-1] x) ...)), where n is the length of the string s.

    • since 4.13
    val for_all : f:(char -> bool) -> string -> bool

    for_all p s checks if all characters in s satisfy the predicate p.

    • since 4.13
    val exists : f:(char -> bool) -> string -> bool

    exists p s checks if at least one character of s satisfies the predicate p.

    • since 4.13
    val trim : string -> string

    trim s is s without leading and trailing whitespace. Whitespace characters are: ' ', '\x0C' (form feed), '\n', '\r', and '\t'.

    • since 4.00
    val escaped : string -> string

    escaped s is s with special characters represented by escape sequences, following the lexical conventions of OCaml.

    All characters outside the US-ASCII printable range [0x20;0x7E] are escaped, as well as backslash (0x2F) and double-quote (0x22).

    The function Scanf.unescaped is a left inverse of escaped, i.e. Scanf.unescaped (escaped s) = s for any string s (unless escaped s fails).

    val uppercase_ascii : string -> string

    uppercase_ascii s is s with all lowercase letters translated to uppercase, using the US-ASCII character set.

    • since 4.05
    val lowercase_ascii : string -> string

    lowercase_ascii s is s with all uppercase letters translated to lowercase, using the US-ASCII character set.

    • since 4.05
    val capitalize_ascii : string -> string

    capitalize_ascii s is s with the first character set to uppercase, using the US-ASCII character set.

    • since 4.05
    val uncapitalize_ascii : string -> string

    uncapitalize_ascii s is s with the first character set to lowercase, using the US-ASCII character set.

    • since 4.05

    Traversing

    val iter : f:(char -> unit) -> string -> unit

    iter ~f s applies function f in turn to all the characters of s. It is equivalent to f s.[0]; f s.[1]; ...; f s.[length s - 1]; ().

    val iteri : f:(int -> char -> unit) -> string -> unit

    iteri is like iter, but the function is also given the corresponding character index.

    • since 4.00

    Searching

    val index_from : string -> int -> char -> int

    index_from s i c is the index of the first occurrence of c in s after position i.

    • raises Not_found

      if c does not occur in s after position i.

    val index_from_opt : string -> int -> char -> int option

    index_from_opt s i c is the index of the first occurrence of c in s after position i (if any).

    • since 4.05
    val rindex_from : string -> int -> char -> int

    rindex_from s i c is the index of the last occurrence of c in s before position i+1.

    • raises Not_found

      if c does not occur in s before position i+1.

    val rindex_from_opt : string -> int -> char -> int option

    rindex_from_opt s i c is the index of the last occurrence of c in s before position i+1 (if any).

    • since 4.05
    val index : string -> char -> int

    index s c is String.index_from s 0 c.

    val index_opt : string -> char -> int option

    index_opt s c is String.index_from_opt s 0 c.

    • since 4.05
    val rindex : string -> char -> int

    rindex s c is String.rindex_from s (length s - 1) c.

    val rindex_opt : string -> char -> int option

    rindex_opt s c is String.rindex_from_opt s (length s - 1) c.

    • since 4.05

    Strings and Sequences

    val to_seq : t -> char Seq.t

    to_seq s is a sequence made of the string's characters in increasing order. In "unsafe-string" mode, modifications of the string during iteration will be reflected in the sequence.

    • since 4.07
    val to_seqi : t -> (int * char) Seq.t

    to_seqi s is like to_seq but also tuples the corresponding index.

    • since 4.07
    val of_seq : char Seq.t -> t

    of_seq s is a string made of the sequence's characters.

    • since 4.07

    UTF decoding and validations

    • since 4.14

    UTF-8

    val get_utf_8_uchar : t -> int -> Uchar.utf_decode

    get_utf_8_uchar b i decodes an UTF-8 character at index i in b.

    val is_valid_utf_8 : t -> bool

    is_valid_utf_8 b is true if and only if b contains valid UTF-8 data.

    UTF-16BE

    val get_utf_16be_uchar : t -> int -> Uchar.utf_decode

    get_utf_16be_uchar b i decodes an UTF-16BE character at index i in b.

    val is_valid_utf_16be : t -> bool

    is_valid_utf_16be b is true if and only if b contains valid UTF-16BE data.

    UTF-16LE

    val get_utf_16le_uchar : t -> int -> Uchar.utf_decode

    get_utf_16le_uchar b i decodes an UTF-16LE character at index i in b.

    val is_valid_utf_16le : t -> bool

    is_valid_utf_16le b is true if and only if b contains valid UTF-16LE data.

    Binary decoding of integers

    The functions in this section binary decode integers from strings.

    All following functions raise Invalid_argument if the characters needed at index i to decode the integer are not available.

    Little-endian (resp. big-endian) encoding means that least (resp. most) significant bytes are stored first. Big-endian is also known as network byte order. Native-endian encoding is either little-endian or big-endian depending on Sys.big_endian.

    32-bit and 64-bit integers are represented by the int32 and int64 types, which can be interpreted either as signed or unsigned numbers.

    8-bit and 16-bit integers are represented by the int type, which has more bits than the binary encoding. These extra bits are sign-extended (or zero-extended) for functions which decode 8-bit or 16-bit integers and represented them with int values.

    val get_uint8 : string -> int -> int

    get_uint8 b i is b's unsigned 8-bit integer starting at character index i.

    • since 4.13
    val get_int8 : string -> int -> int

    get_int8 b i is b's signed 8-bit integer starting at character index i.

    • since 4.13
    val get_uint16_ne : string -> int -> int

    get_uint16_ne b i is b's native-endian unsigned 16-bit integer starting at character index i.

    • since 4.13
    val get_uint16_be : string -> int -> int

    get_uint16_be b i is b's big-endian unsigned 16-bit integer starting at character index i.

    • since 4.13
    val get_uint16_le : string -> int -> int

    get_uint16_le b i is b's little-endian unsigned 16-bit integer starting at character index i.

    • since 4.13
    val get_int16_ne : string -> int -> int

    get_int16_ne b i is b's native-endian signed 16-bit integer starting at character index i.

    • since 4.13
    val get_int16_be : string -> int -> int

    get_int16_be b i is b's big-endian signed 16-bit integer starting at character index i.

    • since 4.13
    val get_int16_le : string -> int -> int

    get_int16_le b i is b's little-endian signed 16-bit integer starting at character index i.

    • since 4.13
    val get_int32_ne : string -> int -> int32

    get_int32_ne b i is b's native-endian 32-bit integer starting at character index i.

    • since 4.13
    val hash : t -> int

    An unseeded hash function for strings, with the same output value as Hashtbl.hash. This function allows this module to be passed as argument to the functor Hashtbl.Make.

    • since 5.0
    val seeded_hash : int -> t -> int

    A seeded hash function for strings, with the same output value as Hashtbl.seeded_hash. This function allows this module to be passed as argument to the functor Hashtbl.MakeSeeded.

    • since 5.0
    val get_int32_be : string -> int -> int32

    get_int32_be b i is b's big-endian 32-bit integer starting at character index i.

    • since 4.13
    val get_int32_le : string -> int -> int32

    get_int32_le b i is b's little-endian 32-bit integer starting at character index i.

    • since 4.13
    val get_int64_ne : string -> int -> int64

    get_int64_ne b i is b's native-endian 64-bit integer starting at character index i.

    • since 4.13
    val get_int64_be : string -> int -> int64

    get_int64_be b i is b's big-endian 64-bit integer starting at character index i.

    • since 4.13
    val get_int64_le : string -> int -> int64

    get_int64_le b i is b's little-endian 64-bit integer starting at character index i.

    • since 4.13
    diff --git a/ocaml/Stdlib/Sys/Immediate64/Make/argument-1-Immediate/index.html b/ocaml/Stdlib/Sys/Immediate64/Make/argument-1-Immediate/index.html new file mode 100644 index 0000000..5ae5b86 --- /dev/null +++ b/ocaml/Stdlib/Sys/Immediate64/Make/argument-1-Immediate/index.html @@ -0,0 +1,2 @@ + +Immediate (ocaml.Stdlib.Sys.Immediate64.Make.Immediate)

    Parameter Make.Immediate

    type t
    diff --git a/ocaml/Stdlib/Sys/Immediate64/Make/argument-2-Non_immediate/index.html b/ocaml/Stdlib/Sys/Immediate64/Make/argument-2-Non_immediate/index.html new file mode 100644 index 0000000..3118ea6 --- /dev/null +++ b/ocaml/Stdlib/Sys/Immediate64/Make/argument-2-Non_immediate/index.html @@ -0,0 +1,2 @@ + +Non_immediate (ocaml.Stdlib.Sys.Immediate64.Make.Non_immediate)

    Parameter Make.Non_immediate

    type t
    diff --git a/ocaml/Stdlib/Sys/Immediate64/Make/index.html b/ocaml/Stdlib/Sys/Immediate64/Make/index.html new file mode 100644 index 0000000..74ad9e4 --- /dev/null +++ b/ocaml/Stdlib/Sys/Immediate64/Make/index.html @@ -0,0 +1,2 @@ + +Make (ocaml.Stdlib.Sys.Immediate64.Make)

    Module Immediate64.Make

    Parameters

    Signature

    type t
    type 'a repr =
    1. | Immediate : Immediate.t repr
    2. | Non_immediate : Non_immediate.t repr
    val repr : t repr
    diff --git a/ocaml/Stdlib/Sys/Immediate64/index.html b/ocaml/Stdlib/Sys/Immediate64/index.html new file mode 100644 index 0000000..21d0381 --- /dev/null +++ b/ocaml/Stdlib/Sys/Immediate64/index.html @@ -0,0 +1,5 @@ + +Immediate64 (ocaml.Stdlib.Sys.Immediate64)

    Module Sys.Immediate64

    This module allows to define a type t with the immediate64 attribute. This attribute means that the type is immediate on 64 bit architectures. On other architectures, it might or might not be immediate.

    • since 4.10
    module type Non_immediate = sig ... end
    module type Immediate = sig ... end
    module Make + (Immediate : Immediate) + (Non_immediate : Non_immediate) : + sig ... end
    diff --git a/ocaml/Stdlib/Sys/Immediate64/module-type-Immediate/index.html b/ocaml/Stdlib/Sys/Immediate64/module-type-Immediate/index.html new file mode 100644 index 0000000..4e84f88 --- /dev/null +++ b/ocaml/Stdlib/Sys/Immediate64/module-type-Immediate/index.html @@ -0,0 +1,2 @@ + +Immediate (ocaml.Stdlib.Sys.Immediate64.Immediate)

    Module type Immediate64.Immediate

    type t
    diff --git a/ocaml/Stdlib/Sys/Immediate64/module-type-Non_immediate/index.html b/ocaml/Stdlib/Sys/Immediate64/module-type-Non_immediate/index.html new file mode 100644 index 0000000..3c11382 --- /dev/null +++ b/ocaml/Stdlib/Sys/Immediate64/module-type-Non_immediate/index.html @@ -0,0 +1,2 @@ + +Non_immediate (ocaml.Stdlib.Sys.Immediate64.Non_immediate)

    Module type Immediate64.Non_immediate

    type t
    diff --git a/ocaml/Stdlib/Sys/index.html b/ocaml/Stdlib/Sys/index.html new file mode 100644 index 0000000..7f66a54 --- /dev/null +++ b/ocaml/Stdlib/Sys/index.html @@ -0,0 +1,4 @@ + +Sys (ocaml.Stdlib.Sys)

    Module Stdlib.Sys

    System interface.

    Every function in this module raises Sys_error with an informative message when the underlying system call signal an error.

    val argv : string array

    The command line arguments given to the process. The first element is the command name used to invoke the program. The following elements are the command-line arguments given to the program.

    val executable_name : string

    The name of the file containing the executable currently running. This name may be absolute or relative to the current directory, depending on the platform and whether the program was compiled to bytecode or a native executable.

    val file_exists : string -> bool

    Test if a file with the given name exists.

    val is_directory : string -> bool

    Returns true if the given name refers to a directory, false if it refers to another kind of file.

    • raises Sys_error

      if no file exists with the given name.

    • since 3.10
    val is_regular_file : string -> bool

    Returns true if the given name refers to a regular file, false if it refers to another kind of file.

    • raises Sys_error

      if no file exists with the given name.

    • since 5.1
    val remove : string -> unit

    Remove the given file name from the file system.

    val rename : string -> string -> unit

    Rename a file or directory. rename oldpath newpath renames the file or directory called oldpath, giving it newpath as its new name, moving it between (parent) directories if needed. If a file named newpath already exists, its contents will be replaced with those of oldpath. Depending on the operating system, the metadata (permissions, owner, etc) of newpath can either be preserved or be replaced by those of oldpath.

    • since 4.06 concerning the "replace existing file" behavior
    val getenv : string -> string

    Return the value associated to a variable in the process environment.

    val getenv_opt : string -> string option

    Return the value associated to a variable in the process environment or None if the variable is unbound.

    • since 4.05
    val command : string -> int

    Execute the given shell command and return its exit code.

    The argument of Sys.command is generally the name of a command followed by zero, one or several arguments, separated by whitespace. The given argument is interpreted by a shell: either the Windows shell cmd.exe for the Win32 ports of OCaml, or the POSIX shell sh for other ports. It can contain shell builtin commands such as echo, and also special characters such as file redirections > and <, which will be honored by the shell.

    Conversely, whitespace or special shell characters occurring in command names or in their arguments must be quoted or escaped so that the shell does not interpret them. The quoting rules vary between the POSIX shell and the Windows shell. The Filename.quote_command performs the appropriate quoting given a command name, a list of arguments, and optional file redirections.

    val time : unit -> float

    Return the processor time, in seconds, used by the program since the beginning of execution.

    val chdir : string -> unit

    Change the current working directory of the process.

    val mkdir : string -> int -> unit

    Create a directory with the given permissions.

    • since 4.12
    val rmdir : string -> unit

    Remove an empty directory.

    • since 4.12
    val getcwd : unit -> string

    Return the current working directory of the process.

    val readdir : string -> string array

    Return the names of all files present in the given directory. Names denoting the current directory and the parent directory ("." and ".." in Unix) are not returned. Each string in the result is a file name rather than a complete path. There is no guarantee that the name strings in the resulting array will appear in any specific order; they are not, in particular, guaranteed to appear in alphabetical order.

    val interactive : bool ref

    This reference is initially set to false in standalone programs and to true if the code is being executed under the interactive toplevel system ocaml.

    • alert unsynchronized_access The interactive status is a mutable global state.
    val os_type : string

    Operating system currently executing the OCaml program. One of

    • "Unix" (for all Unix versions, including Linux and Mac OS X),
    • "Win32" (for MS-Windows, OCaml compiled with MSVC++ or MinGW-w64),
    • "Cygwin" (for MS-Windows, OCaml compiled with Cygwin).
    type backend_type =
    1. | Native
    2. | Bytecode
    3. | Other of string

    Currently, the official distribution only supports Native and Bytecode, but it can be other backends with alternative compilers, for example, javascript.

    • since 4.04
    val backend_type : backend_type

    Backend type currently executing the OCaml program.

    • since 4.04
    val unix : bool

    True if Sys.os_type = "Unix".

    • since 4.01
    val win32 : bool

    True if Sys.os_type = "Win32".

    • since 4.01
    val cygwin : bool

    True if Sys.os_type = "Cygwin".

    • since 4.01
    val word_size : int

    Size of one word on the machine currently executing the OCaml program, in bits: 32 or 64.

    val int_size : int

    Size of int, in bits. It is 31 (resp. 63) when using OCaml on a 32-bit (resp. 64-bit) platform. It may differ for other implementations, e.g. it can be 32 bits when compiling to JavaScript.

    • since 4.03
    val big_endian : bool

    Whether the machine currently executing the Caml program is big-endian.

    • since 4.00
    val max_string_length : int

    Maximum length of strings and byte sequences.

    val max_array_length : int

    Maximum length of a normal array (i.e. any array whose elements are not of type float). The maximum length of a float array is max_floatarray_length if OCaml was configured with --enable-flat-float-array and max_array_length if configured with --disable-flat-float-array.

    val max_floatarray_length : int

    Maximum length of a floatarray. This is also the maximum length of a float array when OCaml is configured with --enable-flat-float-array.

    val runtime_variant : unit -> string

    Return the name of the runtime variant the program is running on. This is normally the argument given to -runtime-variant at compile time, but for byte-code it can be changed after compilation.

    • since 4.03
    val runtime_parameters : unit -> string

    Return the value of the runtime parameters, in the same format as the contents of the OCAMLRUNPARAM environment variable.

    • since 4.03

    Signal handling

    type signal_behavior =
    1. | Signal_default
    2. | Signal_ignore
    3. | Signal_handle of int -> unit

    What to do when receiving a signal:

    • Signal_default: take the default behavior (usually: abort the program)
    • Signal_ignore: ignore the signal
    • Signal_handle f: call function f, giving it the signal number as argument.
    val signal : int -> signal_behavior -> signal_behavior

    Set the behavior of the system on receipt of a given signal. The first argument is the signal number. Return the behavior previously associated with the signal. If the signal number is invalid (or not available on your system), an Invalid_argument exception is raised.

    val set_signal : int -> signal_behavior -> unit

    Same as Sys.signal but return value is ignored.

    Signal numbers for the standard POSIX signals.

    val sigabrt : int

    Abnormal termination

    val sigalrm : int

    Timeout

    val sigfpe : int

    Arithmetic exception

    val sighup : int

    Hangup on controlling terminal

    val sigill : int

    Invalid hardware instruction

    val sigint : int

    Interactive interrupt (ctrl-C)

    val sigkill : int

    Termination (cannot be ignored)

    val sigpipe : int

    Broken pipe

    val sigquit : int

    Interactive termination

    val sigsegv : int

    Invalid memory reference

    val sigterm : int

    Termination

    val sigusr1 : int

    Application-defined signal 1

    val sigusr2 : int

    Application-defined signal 2

    val sigchld : int

    Child process terminated

    val sigcont : int

    Continue

    val sigstop : int

    Stop

    val sigtstp : int

    Interactive stop

    val sigttin : int

    Terminal read from background process

    val sigttou : int

    Terminal write from background process

    val sigvtalrm : int

    Timeout in virtual time

    val sigprof : int

    Profiling interrupt

    val sigbus : int

    Bus error

    • since 4.03
    val sigpoll : int

    Pollable event

    • since 4.03
    val sigsys : int

    Bad argument to routine

    • since 4.03
    val sigtrap : int

    Trace/breakpoint trap

    • since 4.03
    val sigurg : int

    Urgent condition on socket

    • since 4.03
    val sigxcpu : int

    Timeout in cpu time

    • since 4.03
    val sigxfsz : int

    File size limit exceeded

    • since 4.03
    exception Break

    Exception raised on interactive interrupt if Sys.catch_break is enabled.

    val catch_break : bool -> unit

    catch_break governs whether interactive interrupt (ctrl-C) terminates the program or raises the Break exception. Call catch_break true to enable raising Break, and catch_break false to let the system terminate the program on user interrupt.

    Inside multi-threaded programs, the Break exception will arise in any one of the active threads, and will keep arising on further interactive interrupt until all threads are terminated. Use signal masks from Thread.sigmask to direct the interrupt towards a specific thread.

    val ocaml_version : string

    ocaml_version is the version of OCaml. It is a string of the form "major.minor[.patchlevel][(+|~)additional-info]", where major, minor, and patchlevel are integers, and additional-info is an arbitrary string. The [.patchlevel] part was absent before version 3.08.0 and became mandatory from 3.08.0 onwards. The [(+|~)additional-info] part may be absent.

    val development_version : bool

    true if this is a development version, false otherwise.

    • since 4.14
    type extra_prefix =
    1. | Plus
    2. | Tilde
      (*
      • since 4.14
      *)
    type extra_info = extra_prefix * string
    • since 4.14
    type ocaml_release_info = {
    1. major : int;
    2. minor : int;
    3. patchlevel : int;
    4. extra : extra_info option;
    }
    • since 4.14
    val ocaml_release : ocaml_release_info

    ocaml_release is the version of OCaml.

    • since 4.14
    val enable_runtime_warnings : bool -> unit

    Control whether the OCaml runtime system can emit warnings on stderr. Currently, the only supported warning is triggered when a channel created by open_* functions is finalized without being closed. Runtime warnings are disabled by default.

    • since 4.03
    • alert unsynchronized_access The status of runtime warnings is a mutable global state.
    val runtime_warnings_enabled : unit -> bool

    Return whether runtime warnings are currently enabled.

    • since 4.03
    • alert unsynchronized_access The status of runtime warnings is a mutable global state.

    Optimization

    val opaque_identity : 'a -> 'a

    For the purposes of optimization, opaque_identity behaves like an unknown (and thus possibly side-effecting) function.

    At runtime, opaque_identity disappears altogether.

    A typical use of this function is to prevent pure computations from being optimized away in benchmarking loops. For example:

      for _round = 1 to 100_000 do
+    ignore (Sys.opaque_identity (my_pure_computation ()))
+  done
    • since 4.03
    module Immediate64 : sig ... end

    This module allows to define a type t with the immediate64 attribute. This attribute means that the type is immediate on 64 bit architectures. On other architectures, it might or might not be immediate.

    diff --git a/ocaml/Stdlib/Type/Id/index.html b/ocaml/Stdlib/Type/Id/index.html new file mode 100644 index 0000000..98b03d4 --- /dev/null +++ b/ocaml/Stdlib/Type/Id/index.html @@ -0,0 +1,40 @@ + +Id (ocaml.Stdlib.Type.Id)

    Module Type.Id

    Type identifiers.

    A type identifier is a value that denotes a type. Given two type identifiers, they can be tested for equality to prove they denote the same type. Note that:

    • Unequal identifiers do not imply unequal types: a given type can be denoted by more than one identifier.
    • Type identifiers can be marshalled, but they get a new, distinct, identity on unmarshalling, so the equalities are lost.

    See an example of use.

    Type identifiers

    type !'a t

    The type for identifiers for type 'a.

    val make : unit -> 'a t

    make () is a new type identifier.

    val uid : 'a t -> int

    uid id is a runtime unique identifier for id.

    val provably_equal : 'a t -> 'b t -> ('a, 'b) eq option

    provably_equal i0 i1 is Some Equal if identifier i0 is equal to i1 and None otherwise.

    Example

    The following shows how type identifiers can be used to implement a simple heterogeneous key-value dictionary. In contrast to Stdlib.Map values whose keys map to a single, homogeneous type of values, this dictionary can associate a different type of value to each key.

    (** Heterogeneous dictionaries. *)
+module Dict : sig
+  type t
+  (** The type for dictionaries. *)
+
+  type 'a key
+  (** The type for keys binding values of type ['a]. *)
+
+  val key : unit -> 'a key
+  (** [key ()] is a new dictionary key. *)
+
+  val empty : t
+  (** [empty] is the empty dictionary. *)
+
+  val add : 'a key -> 'a -> t -> t
+  (** [add k v d] is [d] with [k] bound to [v]. *)
+
+  val remove : 'a key -> t -> t
+  (** [remove k d] is [d] with the last binding of [k] removed. *)
+
+  val find : 'a key -> t -> 'a option
+  (** [find k d] is the binding of [k] in [d], if any. *)
+end = struct
+  type 'a key = 'a Type.Id.t
+  type binding = B : 'a key * 'a -> binding
+  type t = (int * binding) list
+
+  let key () = Type.Id.make ()
+  let empty = []
+  let add k v d = (Type.Id.uid k, B (k, v)) :: d
+  let remove k d = List.remove_assoc (Type.Id.uid k) d
+  let find : type a. a key -> t -> a option = fun k d ->
+    match List.assoc_opt (Type.Id.uid k) d with
+    | None -> None
+    | Some (B (k', v)) ->
+        match Type.Id.provably_equal k k' with
+        | Some Type.Equal -> Some v
+        | None -> assert false
+end
    diff --git a/ocaml/Stdlib/Type/index.html b/ocaml/Stdlib/Type/index.html new file mode 100644 index 0000000..43b9d23 --- /dev/null +++ b/ocaml/Stdlib/Type/index.html @@ -0,0 +1,2 @@ + +Type (ocaml.Stdlib.Type)

    Module Stdlib.Type

    Type introspection.

    • since 5.1

    Type equality witness

    type (_, _) eq =
    1. | Equal : ('a, 'a) eq

    The purpose of eq is to represent type equalities that may not otherwise be known by the type checker (e.g. because they may depend on dynamic data).

    A value of type (a, b) eq represents the fact that types a and b are equal.

    If one has a value eq : (a, b) eq that proves types a and b are equal, one can use it to convert a value of type a to a value of type b by pattern matching on Equal:

      let cast (type a) (type b) (Equal : (a, b) Type.eq) (a : a) : b = a

    At runtime, this function simply returns its second argument unchanged.

    Type identifiers

    module Id : sig ... end

    Type identifiers.

    diff --git a/ocaml/Stdlib/Uchar/index.html b/ocaml/Stdlib/Uchar/index.html new file mode 100644 index 0000000..4bf56db --- /dev/null +++ b/ocaml/Stdlib/Uchar/index.html @@ -0,0 +1,2 @@ + +Uchar (ocaml.Stdlib.Uchar)

    Module Stdlib.Uchar

    Unicode characters.

    • since 4.03
    type t

    The type for Unicode characters.

    A value of this type represents a Unicode scalar value which is an integer in the ranges 0x0000...0xD7FF or 0xE000...0x10FFFF.

    val min : t

    min is U+0000.

    val max : t

    max is U+10FFFF.

    val bom : t

    bom is U+FEFF, the byte order mark (BOM) character.

    • since 4.06
    val rep : t

    rep is U+FFFD, the replacement character.

    • since 4.06
    val succ : t -> t

    succ u is the scalar value after u in the set of Unicode scalar values.

    val pred : t -> t

    pred u is the scalar value before u in the set of Unicode scalar values.

    val is_valid : int -> bool

    is_valid n is true if and only if n is a Unicode scalar value (i.e. in the ranges 0x0000...0xD7FF or 0xE000...0x10FFFF).

    val of_int : int -> t

    of_int i is i as a Unicode character.

    val to_int : t -> int

    to_int u is u as an integer.

    val is_char : t -> bool

    is_char u is true if and only if u is a latin1 OCaml character.

    val of_char : char -> t

    of_char c is c as a Unicode character.

    val to_char : t -> char

    to_char u is u as an OCaml latin1 character.

    val equal : t -> t -> bool

    equal u u' is u = u'.

    val compare : t -> t -> int

    compare u u' is Stdlib.compare u u'.

    val hash : t -> int

    hash u associates a non-negative integer to u.

    UTF codecs tools

    • since 4.14
    type utf_decode

    The type for UTF decode results. Values of this type represent the result of a Unicode Transformation Format decoding attempt.

    val utf_decode_is_valid : utf_decode -> bool

    utf_decode_is_valid d is true if and only if d holds a valid decode.

    val utf_decode_uchar : utf_decode -> t

    utf_decode_uchar d is the Unicode character decoded by d if utf_decode_is_valid d is true and Uchar.rep otherwise.

    val utf_decode_length : utf_decode -> int

    utf_decode_length d is the number of elements from the source that were consumed by the decode d. This is always strictly positive and smaller or equal to 4. The kind of source elements depends on the actual decoder; for the decoders of the standard library this function always returns a length in bytes.

    val utf_decode : int -> t -> utf_decode

    utf_decode n u is a valid UTF decode for u that consumed n elements from the source for decoding. n must be positive and smaller or equal to 4 (this is not checked by the module).

    val utf_decode_invalid : int -> utf_decode

    utf_decode_invalid n is an invalid UTF decode that consumed n elements from the source to error. n must be positive and smaller or equal to 4 (this is not checked by the module). The resulting decode has rep as the decoded Unicode character.

    val utf_8_byte_length : t -> int

    utf_8_byte_length u is the number of bytes needed to encode u in UTF-8.

    val utf_16_byte_length : t -> int

    utf_16_byte_length u is the number of bytes needed to encode u in UTF-16.

    diff --git a/ocaml/Stdlib/Unit/index.html b/ocaml/Stdlib/Unit/index.html new file mode 100644 index 0000000..437789d --- /dev/null +++ b/ocaml/Stdlib/Unit/index.html @@ -0,0 +1,2 @@ + +Unit (ocaml.Stdlib.Unit)

    Module Stdlib.Unit

    Unit values.

    • since 4.08

    The unit type

    type t = unit =
    1. | ()

    The unit type.

    The constructor () is included here so that it has a path, but it is not intended to be used in user-defined data types.

    val equal : t -> t -> bool

    equal u1 u2 is true.

    val compare : t -> t -> int

    compare u1 u2 is 0.

    val to_string : t -> string

    to_string b is "()".

    diff --git a/ocaml/Stdlib/Weak/Make/argument-1-H/index.html b/ocaml/Stdlib/Weak/Make/argument-1-H/index.html new file mode 100644 index 0000000..a8cc3fd --- /dev/null +++ b/ocaml/Stdlib/Weak/Make/argument-1-H/index.html @@ -0,0 +1,2 @@ + +H (ocaml.Stdlib.Weak.Make.H)

    Parameter Make.H

    type t

    The type of the hashtable keys.

    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val hash : t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    diff --git a/ocaml/Stdlib/Weak/Make/index.html b/ocaml/Stdlib/Weak/Make/index.html new file mode 100644 index 0000000..ec20f44 --- /dev/null +++ b/ocaml/Stdlib/Weak/Make/index.html @@ -0,0 +1,2 @@ + +Make (ocaml.Stdlib.Weak.Make)

    Module Weak.Make

    Functor building an implementation of the weak hash set structure. H.equal can't be the physical equality, since only shallow copies of the elements in the set are given to it.

    Parameters

    Signature

    type data = H.t

    The type of the elements stored in the table.

    type t

    The type of tables that contain elements of type data. Note that weak hash sets cannot be marshaled using Stdlib.output_value or the functions of the Marshal module.

    val create : int -> t

    create n creates a new empty weak hash set, of initial size n. The table will grow as needed.

    val clear : t -> unit

    Remove all elements from the table.

    val merge : t -> data -> data

    merge t x returns an instance of x found in t if any, or else adds x to t and return x.

    val add : t -> data -> unit

    add t x adds x to t. If there is already an instance of x in t, it is unspecified which one will be returned by subsequent calls to find and merge.

    val remove : t -> data -> unit

    remove t x removes from t one instance of x. Does nothing if there is no instance of x in t.

    val find : t -> data -> data

    find t x returns an instance of x found in t.

    • raises Not_found

      if there is no such element.

    val find_opt : t -> data -> data option

    find_opt t x returns an instance of x found in t or None if there is no such element.

    • since 4.05
    val find_all : t -> data -> data list

    find_all t x returns a list of all the instances of x found in t.

    val mem : t -> data -> bool

    mem t x returns true if there is at least one instance of x in t, false otherwise.

    val iter : (data -> unit) -> t -> unit

    iter f t calls f on each element of t, in some unspecified order. It is not specified what happens if f tries to change t itself.

    val fold : (data -> 'acc -> 'acc) -> t -> 'acc -> 'acc

    fold f t init computes (f d1 (... (f dN init))) where d1 ... dN are the elements of t in some unspecified order. It is not specified what happens if f tries to change t itself.

    val count : t -> int

    Count the number of elements in the table. count t gives the same result as fold (fun _ n -> n+1) t 0 but does not delay the deallocation of the dead elements.

    val stats : t -> int * int * int * int * int * int

    Return statistics on the table. The numbers are, in order: table length, number of entries, sum of bucket lengths, smallest bucket length, median bucket length, biggest bucket length.

    diff --git a/ocaml/Stdlib/Weak/index.html b/ocaml/Stdlib/Weak/index.html new file mode 100644 index 0000000..da4db1a --- /dev/null +++ b/ocaml/Stdlib/Weak/index.html @@ -0,0 +1,2 @@ + +Weak (ocaml.Stdlib.Weak)

    Module Stdlib.Weak

    Arrays of weak pointers and hash sets of weak pointers.

    Low-level functions

    type !'a t

    The type of arrays of weak pointers (weak arrays). A weak pointer is a value that the garbage collector may erase whenever the value is not used any more (through normal pointers) by the program. Note that finalisation functions are run before the weak pointers are erased, because the finalisation functions can make values alive again (before 4.03 the finalisation functions were run after).

    A weak pointer is said to be full if it points to a value, empty if the value was erased by the GC.

    Notes:

    • Integers are not allocated and cannot be stored in weak arrays.
    • Weak arrays cannot be marshaled using Stdlib.output_value nor the functions of the Marshal module.
    val create : int -> 'a t

    Weak.create n returns a new weak array of length n. All the pointers are initially empty.

    val length : 'a t -> int

    Weak.length ar returns the length (number of elements) of ar.

    val set : 'a t -> int -> 'a option -> unit

    Weak.set ar n (Some el) sets the nth cell of ar to be a (full) pointer to el; Weak.set ar n None sets the nth cell of ar to empty.

    val get : 'a t -> int -> 'a option

    Weak.get ar n returns None if the nth cell of ar is empty, Some x (where x is the value) if it is full.

    val get_copy : 'a t -> int -> 'a option

    Weak.get_copy ar n returns None if the nth cell of ar is empty, Some x (where x is a (shallow) copy of the value) if it is full. In addition to pitfalls with mutable values, the interesting difference with get is that get_copy does not prevent the incremental GC from erasing the value in its current cycle (get may delay the erasure to the next GC cycle).

    If the element is a custom block it is not copied.

    val check : 'a t -> int -> bool

    Weak.check ar n returns true if the nth cell of ar is full, false if it is empty. Note that even if Weak.check ar n returns true, a subsequent Weak.get ar n can return None.

    val fill : 'a t -> int -> int -> 'a option -> unit

    Weak.fill ar ofs len el sets to el all pointers of ar from ofs to ofs + len - 1.

    val blit : 'a t -> int -> 'a t -> int -> int -> unit

    Weak.blit ar1 off1 ar2 off2 len copies len weak pointers from ar1 (starting at off1) to ar2 (starting at off2). It works correctly even if ar1 and ar2 are the same.

    • raises Invalid_argument

      if off1 and len do not designate a valid subarray of ar1, or if off2 and len do not designate a valid subarray of ar2.

    Weak hash sets

    A weak hash set is a hashed set of values. Each value may magically disappear from the set when it is not used by the rest of the program any more. This is normally used to share data structures without inducing memory leaks. Weak hash sets are defined on values from a Hashtbl.HashedType module; the equal relation and hash function are taken from that module. We will say that v is an instance of x if equal x v is true.

    The equal relation must be able to work on a shallow copy of the values and give the same result as with the values themselves.

    Unsynchronized accesses

    Unsynchronized accesses to weak hash sets are a programming error. Unsynchronized accesses to a weak hash set may lead to an invalid weak hash set state. Thus, concurrent accesses to weak hash sets must be synchronized (for instance with a Mutex.t).

    module type S = sig ... end

    The output signature of the functor Weak.Make.

    module Make (H : Hashtbl.HashedType) : S with type data = H.t

    Functor building an implementation of the weak hash set structure. H.equal can't be the physical equality, since only shallow copies of the elements in the set are given to it.

    diff --git a/ocaml/Stdlib/Weak/module-type-S/index.html b/ocaml/Stdlib/Weak/module-type-S/index.html new file mode 100644 index 0000000..8bcf5e5 --- /dev/null +++ b/ocaml/Stdlib/Weak/module-type-S/index.html @@ -0,0 +1,2 @@ + +S (ocaml.Stdlib.Weak.S)

    Module type Weak.S

    The output signature of the functor Weak.Make.

    type data

    The type of the elements stored in the table.

    type t

    The type of tables that contain elements of type data. Note that weak hash sets cannot be marshaled using Stdlib.output_value or the functions of the Marshal module.

    val create : int -> t

    create n creates a new empty weak hash set, of initial size n. The table will grow as needed.

    val clear : t -> unit

    Remove all elements from the table.

    val merge : t -> data -> data

    merge t x returns an instance of x found in t if any, or else adds x to t and return x.

    val add : t -> data -> unit

    add t x adds x to t. If there is already an instance of x in t, it is unspecified which one will be returned by subsequent calls to find and merge.

    val remove : t -> data -> unit

    remove t x removes from t one instance of x. Does nothing if there is no instance of x in t.

    val find : t -> data -> data

    find t x returns an instance of x found in t.

    • raises Not_found

      if there is no such element.

    val find_opt : t -> data -> data option

    find_opt t x returns an instance of x found in t or None if there is no such element.

    • since 4.05
    val find_all : t -> data -> data list

    find_all t x returns a list of all the instances of x found in t.

    val mem : t -> data -> bool

    mem t x returns true if there is at least one instance of x in t, false otherwise.

    val iter : (data -> unit) -> t -> unit

    iter f t calls f on each element of t, in some unspecified order. It is not specified what happens if f tries to change t itself.

    val fold : (data -> 'acc -> 'acc) -> t -> 'acc -> 'acc

    fold f t init computes (f d1 (... (f dN init))) where d1 ... dN are the elements of t in some unspecified order. It is not specified what happens if f tries to change t itself.

    val count : t -> int

    Count the number of elements in the table. count t gives the same result as fold (fun _ n -> n+1) t 0 but does not delay the deallocation of the dead elements.

    val stats : t -> int * int * int * int * int * int

    Return statistics on the table. The numbers are, in order: table length, number of entries, sum of bucket lengths, smallest bucket length, median bucket length, biggest bucket length.

    diff --git a/ocaml/Stdlib/index.html b/ocaml/Stdlib/index.html new file mode 100644 index 0000000..cc4cf2c --- /dev/null +++ b/ocaml/Stdlib/index.html @@ -0,0 +1,8 @@ + +Stdlib (ocaml.Stdlib)

    Module Stdlib

    The OCaml Standard library.

    This module is automatically opened at the beginning of each compilation. All components of this module can therefore be referred by their short name, without prefixing them by Stdlib.

    In particular, it provides the basic operations over the built-in types (numbers, booleans, byte sequences, strings, exceptions, references, lists, arrays, input-output channels, ...) and the standard library modules.

    Exceptions

    val raise : exn -> 'a

    Raise the given exception value

    val raise_notrace : exn -> 'a

    A faster version raise which does not record the backtrace.

    • since 4.02
    val invalid_arg : string -> 'a

    Raise exception Invalid_argument with the given string.

    val failwith : string -> 'a

    Raise exception Failure with the given string.

    exception Exit

    The Exit exception is not raised by any library function. It is provided for use in your programs.

    exception Match_failure of string * int * int

    Exception raised when none of the cases of a pattern-matching apply. The arguments are the location of the match keyword in the source code (file name, line number, column number).

    exception Assert_failure of string * int * int

    Exception raised when an assertion fails. The arguments are the location of the assert keyword in the source code (file name, line number, column number).

    exception Invalid_argument of string

    Exception raised by library functions to signal that the given arguments do not make sense. The string gives some information to the programmer. As a general rule, this exception should not be caught, it denotes a programming error and the code should be modified not to trigger it.

    exception Failure of string

    Exception raised by library functions to signal that they are undefined on the given arguments. The string is meant to give some information to the programmer; you must not pattern match on the string literal because it may change in future versions (use Failure _ instead).

    exception Not_found

    Exception raised by search functions when the desired object could not be found.

    exception Out_of_memory

    Exception raised by the garbage collector when there is insufficient memory to complete the computation. (Not reliable for allocations on the minor heap.)

    exception Stack_overflow

    Exception raised by the bytecode interpreter when the evaluation stack reaches its maximal size. This often indicates infinite or excessively deep recursion in the user's program.

    Before 4.10, it was not fully implemented by the native-code compiler.

    exception Sys_error of string

    Exception raised by the input/output functions to report an operating system error. The string is meant to give some information to the programmer; you must not pattern match on the string literal because it may change in future versions (use Sys_error _ instead).

    exception End_of_file

    Exception raised by input functions to signal that the end of file has been reached.

    exception Division_by_zero

    Exception raised by integer division and remainder operations when their second argument is zero.

    exception Sys_blocked_io

    A special case of Sys_error raised when no I/O is possible on a non-blocking I/O channel.

    exception Undefined_recursive_module of string * int * int

    Exception raised when an ill-founded recursive module definition is evaluated. The arguments are the location of the definition in the source code (file name, line number, column number).

    Comparisons

    val (=) : 'a -> 'a -> bool

    e1 = e2 tests for structural equality of e1 and e2. Mutable structures (e.g. references and arrays) are equal if and only if their current contents are structurally equal, even if the two mutable objects are not the same physical object. Equality between functional values raises Invalid_argument. Equality between cyclic data structures may not terminate. Left-associative operator, see Ocaml_operators for more information.

    val (<>) : 'a -> 'a -> bool

    Negation of Stdlib.(=). Left-associative operator, see Ocaml_operators for more information.

    val (<) : 'a -> 'a -> bool

    See Stdlib.(>=). Left-associative operator, see Ocaml_operators for more information.

    val (>) : 'a -> 'a -> bool

    See Stdlib.(>=). Left-associative operator, see Ocaml_operators for more information.

    val (<=) : 'a -> 'a -> bool

    See Stdlib.(>=). Left-associative operator, see Ocaml_operators for more information.

    val (>=) : 'a -> 'a -> bool

    Structural ordering functions. These functions coincide with the usual orderings over integers, characters, strings, byte sequences and floating-point numbers, and extend them to a total ordering over all types. The ordering is compatible with ( = ). As in the case of ( = ), mutable structures are compared by contents. Comparison between functional values raises Invalid_argument. Comparison between cyclic structures may not terminate. Left-associative operator, see Ocaml_operators for more information.

    val compare : 'a -> 'a -> int

    compare x y returns 0 if x is equal to y, a negative integer if x is less than y, and a positive integer if x is greater than y. The ordering implemented by compare is compatible with the comparison predicates =, < and > defined above, with one difference on the treatment of the float value Stdlib.nan. Namely, the comparison predicates treat nan as different from any other float value, including itself; while compare treats nan as equal to itself and less than any other float value. This treatment of nan ensures that compare defines a total ordering relation.

    compare applied to functional values may raise Invalid_argument. compare applied to cyclic structures may not terminate.

    The compare function can be used as the comparison function required by the Set.Make and Map.Make functors, as well as the List.sort and Array.sort functions.

    val min : 'a -> 'a -> 'a

    Return the smaller of the two arguments. The result is unspecified if one of the arguments contains the float value nan.

    val max : 'a -> 'a -> 'a

    Return the greater of the two arguments. The result is unspecified if one of the arguments contains the float value nan.

    val (==) : 'a -> 'a -> bool

    e1 == e2 tests for physical equality of e1 and e2. On mutable types such as references, arrays, byte sequences, records with mutable fields and objects with mutable instance variables, e1 == e2 is true if and only if physical modification of e1 also affects e2. On non-mutable types, the behavior of ( == ) is implementation-dependent; however, it is guaranteed that e1 == e2 implies compare e1 e2 = 0. Left-associative operator, see Ocaml_operators for more information.

    val (!=) : 'a -> 'a -> bool

    Negation of Stdlib.(==). Left-associative operator, see Ocaml_operators for more information.

    Boolean operations

    val not : bool -> bool

    The boolean negation.

    val (&&) : bool -> bool -> bool

    The boolean 'and'. Evaluation is sequential, left-to-right: in e1 && e2, e1 is evaluated first, and if it returns false, e2 is not evaluated at all. Right-associative operator, see Ocaml_operators for more information.

    val (||) : bool -> bool -> bool

    The boolean 'or'. Evaluation is sequential, left-to-right: in e1 || e2, e1 is evaluated first, and if it returns true, e2 is not evaluated at all. Right-associative operator, see Ocaml_operators for more information.

    Debugging

    val __LOC__ : string

    __LOC__ returns the location at which this expression appears in the file currently being parsed by the compiler, with the standard error format of OCaml: "File %S, line %d, characters %d-%d".

    • since 4.02
    val __FILE__ : string

    __FILE__ returns the name of the file currently being parsed by the compiler.

    • since 4.02
    val __LINE__ : int

    __LINE__ returns the line number at which this expression appears in the file currently being parsed by the compiler.

    • since 4.02
    val __MODULE__ : string

    __MODULE__ returns the module name of the file being parsed by the compiler.

    • since 4.02
    val __POS__ : string * int * int * int

    __POS__ returns a tuple (file,lnum,cnum,enum), corresponding to the location at which this expression appears in the file currently being parsed by the compiler. file is the current filename, lnum the line number, cnum the character position in the line and enum the last character position in the line.

    • since 4.02
    val __FUNCTION__ : string

    __FUNCTION__ returns the name of the current function or method, including any enclosing modules or classes.

    • since 4.12
    val __LOC_OF__ : 'a -> string * 'a

    __LOC_OF__ expr returns a pair (loc, expr) where loc is the location of expr in the file currently being parsed by the compiler, with the standard error format of OCaml: "File %S, line %d, characters %d-%d".

    • since 4.02
    val __LINE_OF__ : 'a -> int * 'a

    __LINE_OF__ expr returns a pair (line, expr), where line is the line number at which the expression expr appears in the file currently being parsed by the compiler.

    • since 4.02
    val __POS_OF__ : 'a -> (string * int * int * int) * 'a

    __POS_OF__ expr returns a pair (loc,expr), where loc is a tuple (file,lnum,cnum,enum) corresponding to the location at which the expression expr appears in the file currently being parsed by the compiler. file is the current filename, lnum the line number, cnum the character position in the line and enum the last character position in the line.

    • since 4.02

    Composition operators

    val (|>) : 'a -> ('a -> 'b) -> 'b

    Reverse-application operator: x |> f |> g is exactly equivalent to g (f (x)). Left-associative operator, see Ocaml_operators for more information.

    • since 4.01
    val (@@) : ('a -> 'b) -> 'a -> 'b

    Application operator: g @@ f @@ x is exactly equivalent to g (f (x)). Right-associative operator, see Ocaml_operators for more information.

    • since 4.01

    Integer arithmetic

    Integers are Sys.int_size bits wide. All operations are taken modulo 2Sys.int_size. They do not fail on overflow.

    val (~-) : int -> int

    Unary negation. You can also write - e instead of ~- e. Unary operator, see Ocaml_operators for more information.

    val (~+) : int -> int

    Unary addition. You can also write + e instead of ~+ e. Unary operator, see Ocaml_operators for more information.

    • since 3.12
    val succ : int -> int

    succ x is x + 1.

    val pred : int -> int

    pred x is x - 1.

    val (+) : int -> int -> int

    Integer addition. Left-associative operator, see Ocaml_operators for more information.

    val (-) : int -> int -> int

    Integer subtraction. Left-associative operator, , see Ocaml_operators for more information.

    val (*) : int -> int -> int

    Integer multiplication. Left-associative operator, see Ocaml_operators for more information.

    val (/) : int -> int -> int

    Integer division. Integer division rounds the real quotient of its arguments towards zero. More precisely, if x >= 0 and y > 0, x / y is the greatest integer less than or equal to the real quotient of x by y. Moreover, (- x) / y = x / (- y) = - (x / y). Left-associative operator, see Ocaml_operators for more information.

    val (mod) : int -> int -> int

    Integer remainder. If y is not zero, the result of x mod y satisfies the following properties: x = (x / y) * y + x mod y and abs(x mod y) <= abs(y) - 1. If y = 0, x mod y raises Division_by_zero. Note that x mod y is negative only if x < 0. Left-associative operator, see Ocaml_operators for more information.

    val abs : int -> int

    abs x is the absolute value of x. On min_int this is min_int itself and thus remains negative.

    val max_int : int

    The greatest representable integer.

    val min_int : int

    The smallest representable integer.

    Bitwise operations

    val (land) : int -> int -> int

    Bitwise logical and. Left-associative operator, see Ocaml_operators for more information.

    val (lor) : int -> int -> int

    Bitwise logical or. Left-associative operator, see Ocaml_operators for more information.

    val (lxor) : int -> int -> int

    Bitwise logical exclusive or. Left-associative operator, see Ocaml_operators for more information.

    val lnot : int -> int

    Bitwise logical negation.

    val (lsl) : int -> int -> int

    n lsl m shifts n to the left by m bits. The result is unspecified if m < 0 or m > Sys.int_size. Right-associative operator, see Ocaml_operators for more information.

    val (lsr) : int -> int -> int

    n lsr m shifts n to the right by m bits. This is a logical shift: zeroes are inserted regardless of the sign of n. The result is unspecified if m < 0 or m > Sys.int_size. Right-associative operator, see Ocaml_operators for more information.

    val (asr) : int -> int -> int

    n asr m shifts n to the right by m bits. This is an arithmetic shift: the sign bit of n is replicated. The result is unspecified if m < 0 or m > Sys.int_size. Right-associative operator, see Ocaml_operators for more information.

    Floating-point arithmetic

    OCaml's floating-point numbers follow the IEEE 754 standard, using double precision (64 bits) numbers. Floating-point operations never raise an exception on overflow, underflow, division by zero, etc. Instead, special IEEE numbers are returned as appropriate, such as infinity for 1.0 /. 0.0, neg_infinity for -1.0 /. 0.0, and nan ('not a number') for 0.0 /. 0.0. These special numbers then propagate through floating-point computations as expected: for instance, 1.0 /. infinity is 0.0, basic arithmetic operations (+., -., *., /.) with nan as an argument return nan, ...

    val (~-.) : float -> float

    Unary negation. You can also write -. e instead of ~-. e. Unary operator, see Ocaml_operators for more information.

    val (~+.) : float -> float

    Unary addition. You can also write +. e instead of ~+. e. Unary operator, see Ocaml_operators for more information.

    • since 3.12
    val (+.) : float -> float -> float

    Floating-point addition. Left-associative operator, see Ocaml_operators for more information.

    val (-.) : float -> float -> float

    Floating-point subtraction. Left-associative operator, see Ocaml_operators for more information.

    val (*.) : float -> float -> float

    Floating-point multiplication. Left-associative operator, see Ocaml_operators for more information.

    val (/.) : float -> float -> float

    Floating-point division. Left-associative operator, see Ocaml_operators for more information.

    val (**) : float -> float -> float

    Exponentiation. Right-associative operator, see Ocaml_operators for more information.

    val sqrt : float -> float

    Square root.

    val exp : float -> float

    Exponential.

    val log : float -> float

    Natural logarithm.

    val log10 : float -> float

    Base 10 logarithm.

    val expm1 : float -> float

    expm1 x computes exp x -. 1.0, giving numerically-accurate results even if x is close to 0.0.

    • since 3.12
    val log1p : float -> float

    log1p x computes log(1.0 +. x) (natural logarithm), giving numerically-accurate results even if x is close to 0.0.

    • since 3.12
    val cos : float -> float

    Cosine. Argument is in radians.

    val sin : float -> float

    Sine. Argument is in radians.

    val tan : float -> float

    Tangent. Argument is in radians.

    val acos : float -> float

    Arc cosine. The argument must fall within the range [-1.0, 1.0]. Result is in radians and is between 0.0 and pi.

    val asin : float -> float

    Arc sine. The argument must fall within the range [-1.0, 1.0]. Result is in radians and is between -pi/2 and pi/2.

    val atan : float -> float

    Arc tangent. Result is in radians and is between -pi/2 and pi/2.

    val atan2 : float -> float -> float

    atan2 y x returns the arc tangent of y /. x. The signs of x and y are used to determine the quadrant of the result. Result is in radians and is between -pi and pi.

    val hypot : float -> float -> float

    hypot x y returns sqrt(x *. x + y *. y), that is, the length of the hypotenuse of a right-angled triangle with sides of length x and y, or, equivalently, the distance of the point (x,y) to origin. If one of x or y is infinite, returns infinity even if the other is nan.

    • since 4.00
    val cosh : float -> float

    Hyperbolic cosine. Argument is in radians.

    val sinh : float -> float

    Hyperbolic sine. Argument is in radians.

    val tanh : float -> float

    Hyperbolic tangent. Argument is in radians.

    val acosh : float -> float

    Hyperbolic arc cosine. The argument must fall within the range [1.0, inf]. Result is in radians and is between 0.0 and inf.

    • since 4.13
    val asinh : float -> float

    Hyperbolic arc sine. The argument and result range over the entire real line. Result is in radians.

    • since 4.13
    val atanh : float -> float

    Hyperbolic arc tangent. The argument must fall within the range [-1.0, 1.0]. Result is in radians and ranges over the entire real line.

    • since 4.13
    val ceil : float -> float

    Round above to an integer value. ceil f returns the least integer value greater than or equal to f. The result is returned as a float.

    val floor : float -> float

    Round below to an integer value. floor f returns the greatest integer value less than or equal to f. The result is returned as a float.

    val abs_float : float -> float

    abs_float f returns the absolute value of f.

    val copysign : float -> float -> float

    copysign x y returns a float whose absolute value is that of x and whose sign is that of y. If x is nan, returns nan. If y is nan, returns either x or -. x, but it is not specified which.

    • since 4.00
    val mod_float : float -> float -> float

    mod_float a b returns the remainder of a with respect to b. The returned value is a -. n *. b, where n is the quotient a /. b rounded towards zero to an integer.

    val frexp : float -> float * int

    frexp f returns the pair of the significant and the exponent of f. When f is zero, the significant x and the exponent n of f are equal to zero. When f is non-zero, they are defined by f = x *. 2 ** n and 0.5 <= x < 1.0.

    val ldexp : float -> int -> float

    ldexp x n returns x *. 2 ** n.

    val modf : float -> float * float

    modf f returns the pair of the fractional and integral part of f.

    val float : int -> float

    Same as Stdlib.float_of_int.

    val float_of_int : int -> float

    Convert an integer to floating-point.

    val truncate : float -> int

    Same as Stdlib.int_of_float.

    val int_of_float : float -> int

    Truncate the given floating-point number to an integer. The result is unspecified if the argument is nan or falls outside the range of representable integers.

    val infinity : float

    Positive infinity.

    val neg_infinity : float

    Negative infinity.

    val nan : float

    A special floating-point value denoting the result of an undefined operation such as 0.0 /. 0.0. Stands for 'not a number'. Any floating-point operation with nan as argument returns nan as result, unless otherwise specified in IEEE 754 standard. As for floating-point comparisons, =, <, <=, > and >= return false and <> returns true if one or both of their arguments is nan.

    nan is a quiet NaN since 5.1; it was a signaling NaN before.

    val max_float : float

    The largest positive finite value of type float.

    val min_float : float

    The smallest positive, non-zero, non-denormalized value of type float.

    val epsilon_float : float

    The difference between 1.0 and the smallest exactly representable floating-point number greater than 1.0.

    type fpclass =
    1. | FP_normal
      (*

      Normal number, none of the below

      *)
    2. | FP_subnormal
      (*

      Number very close to 0.0, has reduced precision

      *)
    3. | FP_zero
      (*

      Number is 0.0 or -0.0

      *)
    4. | FP_infinite
      (*

      Number is positive or negative infinity

      *)
    5. | FP_nan
      (*

      Not a number: result of an undefined operation

      *)

    The five classes of floating-point numbers, as determined by the Stdlib.classify_float function.

    val classify_float : float -> fpclass

    Return the class of the given floating-point number: normal, subnormal, zero, infinite, or not a number.

    String operations

    More string operations are provided in module String.

    val (^) : string -> string -> string

    String concatenation. Right-associative operator, see Ocaml_operators for more information.

    Character operations

    More character operations are provided in module Char.

    val int_of_char : char -> int

    Return the ASCII code of the argument.

    val char_of_int : int -> char

    Return the character with the given ASCII code.

    Unit operations

    val ignore : 'a -> unit

    Discard the value of its argument and return (). For instance, ignore(f x) discards the result of the side-effecting function f. It is equivalent to f x; (), except that the latter may generate a compiler warning; writing ignore(f x) instead avoids the warning.

    String conversion functions

    val string_of_bool : bool -> string

    Return the string representation of a boolean. As the returned values may be shared, the user should not modify them directly.

    val bool_of_string_opt : string -> bool option

    Convert the given string to a boolean.

    Return None if the string is not "true" or "false".

    • since 4.05
    val bool_of_string : string -> bool

    Same as Stdlib.bool_of_string_opt, but raise Invalid_argument "bool_of_string" instead of returning None.

    val string_of_int : int -> string

    Return the string representation of an integer, in decimal.

    val int_of_string_opt : string -> int option

    Convert the given string to an integer. The string is read in decimal (by default, or if the string begins with 0u), in hexadecimal (if it begins with 0x or 0X), in octal (if it begins with 0o or 0O), or in binary (if it begins with 0b or 0B).

    The 0u prefix reads the input as an unsigned integer in the range [0, 2*max_int+1]. If the input exceeds max_int it is converted to the signed integer min_int + input - max_int - 1.

    The _ (underscore) character can appear anywhere in the string and is ignored.

    Return None if the given string is not a valid representation of an integer, or if the integer represented exceeds the range of integers representable in type int.

    • since 4.05
    val int_of_string : string -> int

    Same as Stdlib.int_of_string_opt, but raise Failure "int_of_string" instead of returning None.

    val string_of_float : float -> string

    Return a string representation of a floating-point number.

    This conversion can involve a loss of precision. For greater control over the manner in which the number is printed, see Printf.

    val float_of_string_opt : string -> float option

    Convert the given string to a float. The string is read in decimal (by default) or in hexadecimal (marked by 0x or 0X).

    The format of decimal floating-point numbers is [-] dd.ddd (e|E) [+|-] dd , where d stands for a decimal digit.

    The format of hexadecimal floating-point numbers is [-] 0(x|X) hh.hhh (p|P) [+|-] dd , where h stands for an hexadecimal digit and d for a decimal digit.

    In both cases, at least one of the integer and fractional parts must be given; the exponent part is optional.

    The _ (underscore) character can appear anywhere in the string and is ignored.

    Depending on the execution platforms, other representations of floating-point numbers can be accepted, but should not be relied upon.

    Return None if the given string is not a valid representation of a float.

    • since 4.05
    val float_of_string : string -> float

    Same as Stdlib.float_of_string_opt, but raise Failure "float_of_string" instead of returning None.

    Pair operations

    val fst : ('a * 'b) -> 'a

    Return the first component of a pair.

    val snd : ('a * 'b) -> 'b

    Return the second component of a pair.

    List operations

    More list operations are provided in module List.

    val (@) : 'a list -> 'a list -> 'a list

    l0 @ l1 appends l1 to l0. Same function as List.append. Right-associative operator, see Ocaml_operators for more information.

    • since 5.1 this function is tail-recursive.

    Input/output

    Note: all input/output functions can raise Sys_error when the system calls they invoke fail.

    type in_channel

    The type of input channel.

    type out_channel

    The type of output channel.

    val stdin : in_channel

    The standard input for the process.

    val stdout : out_channel

    The standard output for the process.

    val stderr : out_channel

    The standard error output for the process.

    Output functions on standard output

    val print_char : char -> unit

    Print a character on standard output.

    val print_string : string -> unit

    Print a string on standard output.

    val print_bytes : bytes -> unit

    Print a byte sequence on standard output.

    • since 4.02
    val print_int : int -> unit

    Print an integer, in decimal, on standard output.

    val print_float : float -> unit

    Print a floating-point number, in decimal, on standard output.

    The conversion of the number to a string uses string_of_float and can involve a loss of precision.

    val print_endline : string -> unit

    Print a string, followed by a newline character, on standard output and flush standard output.

    val print_newline : unit -> unit

    Print a newline character on standard output, and flush standard output. This can be used to simulate line buffering of standard output.

    Output functions on standard error

    val prerr_char : char -> unit

    Print a character on standard error.

    val prerr_string : string -> unit

    Print a string on standard error.

    val prerr_bytes : bytes -> unit

    Print a byte sequence on standard error.

    • since 4.02
    val prerr_int : int -> unit

    Print an integer, in decimal, on standard error.

    val prerr_float : float -> unit

    Print a floating-point number, in decimal, on standard error.

    The conversion of the number to a string uses string_of_float and can involve a loss of precision.

    val prerr_endline : string -> unit

    Print a string, followed by a newline character on standard error and flush standard error.

    val prerr_newline : unit -> unit

    Print a newline character on standard error, and flush standard error.

    Input functions on standard input

    val read_line : unit -> string

    Flush standard output, then read characters from standard input until a newline character is encountered.

    Return the string of all characters read, without the newline character at the end.

    • raises End_of_file

      if the end of the file is reached at the beginning of line.

    val read_int_opt : unit -> int option

    Flush standard output, then read one line from standard input and convert it to an integer.

    Return None if the line read is not a valid representation of an integer.

    • since 4.05
    val read_int : unit -> int

    Same as Stdlib.read_int_opt, but raise Failure "int_of_string" instead of returning None.

    val read_float_opt : unit -> float option

    Flush standard output, then read one line from standard input and convert it to a floating-point number.

    Return None if the line read is not a valid representation of a floating-point number.

    • since 4.05
    val read_float : unit -> float

    Same as Stdlib.read_float_opt, but raise Failure "float_of_string" instead of returning None.

    General output functions

    type open_flag =
    1. | Open_rdonly
      (*

      open for reading.

      *)
    2. | Open_wronly
      (*

      open for writing.

      *)
    3. | Open_append
      (*

      open for appending: always write at end of file.

      *)
    4. | Open_creat
      (*

      create the file if it does not exist.

      *)
    5. | Open_trunc
      (*

      empty the file if it already exists.

      *)
    6. | Open_excl
      (*

      fail if Open_creat and the file already exists.

      *)
    7. | Open_binary
      (*

      open in binary mode (no conversion).

      *)
    8. | Open_text
      (*

      open in text mode (may perform conversions).

      *)
    9. | Open_nonblock
      (*

      open in non-blocking mode.

      *)

    Opening modes for Stdlib.open_out_gen and Stdlib.open_in_gen.

    val open_out : string -> out_channel

    Open the named file for writing, and return a new output channel on that file, positioned at the beginning of the file. The file is truncated to zero length if it already exists. It is created if it does not already exists.

    val open_out_bin : string -> out_channel

    Same as Stdlib.open_out, but the file is opened in binary mode, so that no translation takes place during writes. On operating systems that do not distinguish between text mode and binary mode, this function behaves like Stdlib.open_out.

    val open_out_gen : open_flag list -> int -> string -> out_channel

    open_out_gen mode perm filename opens the named file for writing, as described above. The extra argument mode specifies the opening mode. The extra argument perm specifies the file permissions, in case the file must be created. Stdlib.open_out and Stdlib.open_out_bin are special cases of this function.

    val flush : out_channel -> unit

    Flush the buffer associated with the given output channel, performing all pending writes on that channel. Interactive programs must be careful about flushing standard output and standard error at the right time.

    val flush_all : unit -> unit

    Flush all open output channels; ignore errors.

    val output_char : out_channel -> char -> unit

    Write the character on the given output channel.

    val output_string : out_channel -> string -> unit

    Write the string on the given output channel.

    val output_bytes : out_channel -> bytes -> unit

    Write the byte sequence on the given output channel.

    • since 4.02
    val output : out_channel -> bytes -> int -> int -> unit

    output oc buf pos len writes len characters from byte sequence buf, starting at offset pos, to the given output channel oc.

    val output_substring : out_channel -> string -> int -> int -> unit

    Same as output but take a string as argument instead of a byte sequence.

    • since 4.02
    val output_byte : out_channel -> int -> unit

    Write one 8-bit integer (as the single character with that code) on the given output channel. The given integer is taken modulo 256.

    val output_binary_int : out_channel -> int -> unit

    Write one integer in binary format (4 bytes, big-endian) on the given output channel. The given integer is taken modulo 232. The only reliable way to read it back is through the Stdlib.input_binary_int function. The format is compatible across all machines for a given version of OCaml.

    val output_value : out_channel -> 'a -> unit

    Write the representation of a structured value of any type to a channel. Circularities and sharing inside the value are detected and preserved. The object can be read back, by the function Stdlib.input_value. See the description of module Marshal for more information. Stdlib.output_value is equivalent to Marshal.to_channel with an empty list of flags.

    val seek_out : out_channel -> int -> unit

    seek_out chan pos sets the current writing position to pos for channel chan. This works only for regular files. On files of other kinds (such as terminals, pipes and sockets), the behavior is unspecified.

    val pos_out : out_channel -> int

    Return the current writing position for the given channel. Does not work on channels opened with the Open_append flag (returns unspecified results). For files opened in text mode under Windows, the returned position is approximate (owing to end-of-line conversion); in particular, saving the current position with pos_out, then going back to this position using seek_out will not work. For this programming idiom to work reliably and portably, the file must be opened in binary mode.

    val out_channel_length : out_channel -> int

    Return the size (number of characters) of the regular file on which the given channel is opened. If the channel is opened on a file that is not a regular file, the result is meaningless.

    val close_out : out_channel -> unit

    Close the given channel, flushing all buffered write operations. Output functions raise a Sys_error exception when they are applied to a closed output channel, except close_out and flush, which do nothing when applied to an already closed channel. Note that close_out may raise Sys_error if the operating system signals an error when flushing or closing.

    val close_out_noerr : out_channel -> unit

    Same as close_out, but ignore all errors.

    val set_binary_mode_out : out_channel -> bool -> unit

    set_binary_mode_out oc true sets the channel oc to binary mode: no translations take place during output. set_binary_mode_out oc false sets the channel oc to text mode: depending on the operating system, some translations may take place during output. For instance, under Windows, end-of-lines will be translated from \n to \r\n. This function has no effect under operating systems that do not distinguish between text mode and binary mode.

    General input functions

    val open_in : string -> in_channel

    Open the named file for reading, and return a new input channel on that file, positioned at the beginning of the file.

    val open_in_bin : string -> in_channel

    Same as Stdlib.open_in, but the file is opened in binary mode, so that no translation takes place during reads. On operating systems that do not distinguish between text mode and binary mode, this function behaves like Stdlib.open_in.

    val open_in_gen : open_flag list -> int -> string -> in_channel

    open_in_gen mode perm filename opens the named file for reading, as described above. The extra arguments mode and perm specify the opening mode and file permissions. Stdlib.open_in and Stdlib.open_in_bin are special cases of this function.

    val input_char : in_channel -> char

    Read one character from the given input channel.

    • raises End_of_file

      if there are no more characters to read.

    val input_line : in_channel -> string

    Read characters from the given input channel, until a newline character is encountered. Return the string of all characters read, without the newline character at the end.

    • raises End_of_file

      if the end of the file is reached at the beginning of line.

    val input : in_channel -> bytes -> int -> int -> int

    input ic buf pos len reads up to len characters from the given channel ic, storing them in byte sequence buf, starting at character number pos. It returns the actual number of characters read, between 0 and len (inclusive). A return value of 0 means that the end of file was reached. A return value between 0 and len exclusive means that not all requested len characters were read, either because no more characters were available at that time, or because the implementation found it convenient to do a partial read; input must be called again to read the remaining characters, if desired. (See also Stdlib.really_input for reading exactly len characters.) Exception Invalid_argument "input" is raised if pos and len do not designate a valid range of buf.

    val really_input : in_channel -> bytes -> int -> int -> unit

    really_input ic buf pos len reads len characters from channel ic, storing them in byte sequence buf, starting at character number pos.

    • raises End_of_file

      if the end of file is reached before len characters have been read.

    val really_input_string : in_channel -> int -> string

    really_input_string ic len reads len characters from channel ic and returns them in a new string.

    • raises End_of_file

      if the end of file is reached before len characters have been read.

    • since 4.02
    val input_byte : in_channel -> int

    Same as Stdlib.input_char, but return the 8-bit integer representing the character.

    val input_binary_int : in_channel -> int

    Read an integer encoded in binary format (4 bytes, big-endian) from the given input channel. See Stdlib.output_binary_int.

    • raises End_of_file

      if the end of file was reached while reading the integer.

    val input_value : in_channel -> 'a

    Read the representation of a structured value, as produced by Stdlib.output_value, and return the corresponding value. This function is identical to Marshal.from_channel; see the description of module Marshal for more information, in particular concerning the lack of type safety.

    val seek_in : in_channel -> int -> unit

    seek_in chan pos sets the current reading position to pos for channel chan. This works only for regular files. On files of other kinds, the behavior is unspecified.

    val pos_in : in_channel -> int

    Return the current reading position for the given channel. For files opened in text mode under Windows, the returned position is approximate (owing to end-of-line conversion); in particular, saving the current position with pos_in, then going back to this position using seek_in will not work. For this programming idiom to work reliably and portably, the file must be opened in binary mode.

    val in_channel_length : in_channel -> int

    Return the size (number of characters) of the regular file on which the given channel is opened. If the channel is opened on a file that is not a regular file, the result is meaningless. The returned size does not take into account the end-of-line translations that can be performed when reading from a channel opened in text mode.

    val close_in : in_channel -> unit

    Close the given channel. Input functions raise a Sys_error exception when they are applied to a closed input channel, except close_in, which does nothing when applied to an already closed channel.

    val close_in_noerr : in_channel -> unit

    Same as close_in, but ignore all errors.

    val set_binary_mode_in : in_channel -> bool -> unit

    set_binary_mode_in ic true sets the channel ic to binary mode: no translations take place during input. set_binary_mode_out ic false sets the channel ic to text mode: depending on the operating system, some translations may take place during input. For instance, under Windows, end-of-lines will be translated from \r\n to \n. This function has no effect under operating systems that do not distinguish between text mode and binary mode.

    Operations on large files

    module LargeFile : sig ... end

    Operations on large files. This sub-module provides 64-bit variants of the channel functions that manipulate file positions and file sizes. By representing positions and sizes by 64-bit integers (type int64) instead of regular integers (type int), these alternate functions allow operating on files whose sizes are greater than max_int.

    References

    type 'a ref = {
    1. mutable contents : 'a;
    }

    The type of references (mutable indirection cells) containing a value of type 'a.

    val ref : 'a -> 'a ref

    Return a fresh reference containing the given value.

    val (!) : 'a ref -> 'a

    !r returns the current contents of reference r. Equivalent to fun r -> r.contents. Unary operator, see Ocaml_operators for more information.

    val (:=) : 'a ref -> 'a -> unit

    r := a stores the value of a in reference r. Equivalent to fun r v -> r.contents <- v. Right-associative operator, see Ocaml_operators for more information.

    val incr : int ref -> unit

    Increment the integer contained in the given reference. Equivalent to fun r -> r := succ !r.

    val decr : int ref -> unit

    Decrement the integer contained in the given reference. Equivalent to fun r -> r := pred !r.

    Result type

    type ('a, 'b) result =
    1. | Ok of 'a
    2. | Error of 'b
    • since 4.03

    Operations on format strings

    Format strings are character strings with special lexical conventions that defines the functionality of formatted input/output functions. Format strings are used to read data with formatted input functions from module Scanf and to print data with formatted output functions from modules Printf and Format.

    Format strings are made of three kinds of entities:

    • conversions specifications, introduced by the special character '%' followed by one or more characters specifying what kind of argument to read or print,
    • formatting indications, introduced by the special character '@' followed by one or more characters specifying how to read or print the argument,
    • plain characters that are regular characters with usual lexical conventions. Plain characters specify string literals to be read in the input or printed in the output.

    There is an additional lexical rule to escape the special characters '%' and '@' in format strings: if a special character follows a '%' character, it is treated as a plain character. In other words, "%%" is considered as a plain '%' and "%@" as a plain '@'.

    For more information about conversion specifications and formatting indications available, read the documentation of modules Scanf, Printf and Format.

    Format strings have a general and highly polymorphic type ('a, 'b, 'c, 'd, 'e, 'f) format6. The two simplified types, format and format4 below are included for backward compatibility with earlier releases of OCaml.

    The meaning of format string type parameters is as follows:

    • 'a is the type of the parameters of the format for formatted output functions (printf-style functions); 'a is the type of the values read by the format for formatted input functions (scanf-style functions).
    • 'b is the type of input source for formatted input functions and the type of output target for formatted output functions. For printf-style functions from module Printf, 'b is typically out_channel; for printf-style functions from module Format, 'b is typically Format.formatter; for scanf-style functions from module Scanf, 'b is typically Scanf.Scanning.in_channel.

    Type argument 'b is also the type of the first argument given to user's defined printing functions for %a and %t conversions, and user's defined reading functions for %r conversion.

    • 'c is the type of the result of the %a and %t printing functions, and also the type of the argument transmitted to the first argument of kprintf-style functions or to the kscanf-style functions.
    • 'd is the type of parameters for the scanf-style functions.
    • 'e is the type of the receiver function for the scanf-style functions.
    • 'f is the final result type of a formatted input/output function invocation: for the printf-style functions, it is typically unit; for the scanf-style functions, it is typically the result type of the receiver function.
    type ('a, 'b, 'c, 'd, 'e, 'f) format6 = + ('a, 'b, 'c, 'd, 'e, 'f) CamlinternalFormatBasics.format6
    type ('a, 'b, 'c, 'd) format4 = ('a, 'b, 'c, 'c, 'c, 'd) format6
    type ('a, 'b, 'c) format = ('a, 'b, 'c, 'c) format4
    val string_of_format : ('a, 'b, 'c, 'd, 'e, 'f) format6 -> string

    Converts a format string into a string.

    val format_of_string : + ('a, 'b, 'c, 'd, 'e, 'f) format6 -> + ('a, 'b, 'c, 'd, 'e, 'f) format6

    format_of_string s returns a format string read from the string literal s. Note: format_of_string can not convert a string argument that is not a literal. If you need this functionality, use the more general Scanf.format_from_string function.

    val (^^) : + ('a, 'b, 'c, 'd, 'e, 'f) format6 -> + ('f, 'b, 'c, 'e, 'g, 'h) format6 -> + ('a, 'b, 'c, 'd, 'g, 'h) format6

    f1 ^^ f2 catenates format strings f1 and f2. The result is a format string that behaves as the concatenation of format strings f1 and f2: in case of formatted output, it accepts arguments from f1, then arguments from f2; in case of formatted input, it returns results from f1, then results from f2. Right-associative operator, see Ocaml_operators for more information.

    Program termination

    val exit : int -> 'a

    Terminate the process, returning the given status code to the operating system: usually 0 to indicate no errors, and a small positive integer to indicate failure. All open output channels are flushed with flush_all. The callbacks registered with Domain.at_exit are called followed by those registered with Stdlib.at_exit.

    An implicit exit 0 is performed each time a program terminates normally. An implicit exit 2 is performed if the program terminates early because of an uncaught exception.

    val at_exit : (unit -> unit) -> unit

    Register the given function to be called at program termination time. The functions registered with at_exit will be called when the program does any of the following:

    • executes Stdlib.exit
    • terminates, either normally or because of an uncaught exception
    • executes the C function caml_shutdown. The functions are called in 'last in, first out' order: the function most recently added with at_exit is called first.

    Standard library modules

    module Arg : sig ... end

    Parsing of command line arguments.

    module Array : sig ... end

    Array operations.

    module ArrayLabels : sig ... end

    Array operations.

    module Atomic : sig ... end

    Atomic references.

    module Bigarray : sig ... end

    Large, multi-dimensional, numerical arrays.

    module Bool : sig ... end

    Boolean values.

    module Buffer : sig ... end

    Extensible buffers.

    module Bytes : sig ... end

    Byte sequence operations.

    module BytesLabels : sig ... end

    Byte sequence operations.

    module Callback : sig ... end

    Registering OCaml values with the C runtime.

    module Char : sig ... end

    Character operations.

    module Complex : sig ... end

    Complex numbers.

    module Condition : sig ... end

    Condition variables.

    module Digest : sig ... end

    Message digest.

    module Domain : sig ... end
    module Dynarray : sig ... end

    Dynamic arrays.

    module Effect : sig ... end
    module Either : sig ... end

    Either type.

    module Ephemeron : sig ... end

    Ephemerons and weak hash tables.

    module Filename : sig ... end

    Operations on file names.

    module Float : sig ... end

    Floating-point arithmetic.

    module Format : sig ... end

    Pretty-printing.

    module Fun : sig ... end

    Function manipulation.

    module Gc : sig ... end

    Memory management control and statistics; finalised values.

    module Hashtbl : sig ... end

    Hash tables and hash functions.

    module In_channel : sig ... end

    Input channels.

    module Int : sig ... end

    Integer values.

    module Int32 : sig ... end

    32-bit integers.

    module Int64 : sig ... end

    64-bit integers.

    module Lazy : sig ... end

    Deferred computations.

    module Lexing : sig ... end

    The run-time library for lexers generated by ocamllex.

    module List : sig ... end

    List operations.

    module ListLabels : sig ... end

    List operations.

    module Map : sig ... end

    Association tables over ordered types.

    module Marshal : sig ... end

    Marshaling of data structures.

    module MoreLabels : sig ... end

    Extra labeled libraries.

    module Mutex : sig ... end

    Locks for mutual exclusion.

    module Nativeint : sig ... end

    Processor-native integers.

    module Obj : sig ... end

    Operations on internal representations of values.

    module Oo : sig ... end

    Operations on objects

    module Option : sig ... end

    Option values.

    module Out_channel : sig ... end

    Output channels.

    module Parsing : sig ... end

    The run-time library for parsers generated by ocamlyacc.

    module Printexc : sig ... end

    Facilities for printing exceptions and inspecting current call stack.

    module Printf : sig ... end

    Formatted output functions.

    module Queue : sig ... end

    First-in first-out queues.

    module Random : sig ... end

    Pseudo-random number generators (PRNG).

    module Result : sig ... end

    Result values.

    module Scanf : sig ... end

    Formatted input functions.

    module Semaphore : sig ... end

    Semaphores

    module Seq : sig ... end

    Sequences.

    module Set : sig ... end

    Sets over ordered types.

    module Stack : sig ... end

    Last-in first-out stacks.

    module StdLabels : sig ... end

    Standard labeled libraries.

    module String : sig ... end

    Strings.

    module StringLabels : sig ... end

    Strings.

    module Sys : sig ... end

    System interface.

    module Type : sig ... end

    Type introspection.

    module Uchar : sig ... end

    Unicode characters.

    module Unit : sig ... end

    Unit values.

    module Weak : sig ... end

    Arrays of weak pointers and hash sets of weak pointers.

    diff --git a/ocaml/Stdlib__Arg/index.html b/ocaml/Stdlib__Arg/index.html new file mode 100644 index 0000000..fdaf2a2 --- /dev/null +++ b/ocaml/Stdlib__Arg/index.html @@ -0,0 +1,2 @@ + +Stdlib__Arg (ocaml.Stdlib__Arg)

    Module Stdlib__Arg

    This module is hidden.

    diff --git a/ocaml/Stdlib__Array/index.html b/ocaml/Stdlib__Array/index.html new file mode 100644 index 0000000..9e93e62 --- /dev/null +++ b/ocaml/Stdlib__Array/index.html @@ -0,0 +1,2 @@ + +Stdlib__Array (ocaml.Stdlib__Array)

    Module Stdlib__Array

    This module is hidden.

    diff --git a/ocaml/Stdlib__ArrayLabels/index.html b/ocaml/Stdlib__ArrayLabels/index.html new file mode 100644 index 0000000..8875862 --- /dev/null +++ b/ocaml/Stdlib__ArrayLabels/index.html @@ -0,0 +1,2 @@ + +Stdlib__ArrayLabels (ocaml.Stdlib__ArrayLabels)

    Module Stdlib__ArrayLabels

    This module is hidden.

    diff --git a/ocaml/Stdlib__Atomic/index.html b/ocaml/Stdlib__Atomic/index.html new file mode 100644 index 0000000..d0cf155 --- /dev/null +++ b/ocaml/Stdlib__Atomic/index.html @@ -0,0 +1,2 @@ + +Stdlib__Atomic (ocaml.Stdlib__Atomic)

    Module Stdlib__Atomic

    This module is hidden.

    diff --git a/ocaml/Stdlib__Bigarray/index.html b/ocaml/Stdlib__Bigarray/index.html new file mode 100644 index 0000000..5341406 --- /dev/null +++ b/ocaml/Stdlib__Bigarray/index.html @@ -0,0 +1,2 @@ + +Stdlib__Bigarray (ocaml.Stdlib__Bigarray)

    Module Stdlib__Bigarray

    This module is hidden.

    diff --git a/ocaml/Stdlib__Bool/index.html b/ocaml/Stdlib__Bool/index.html new file mode 100644 index 0000000..36611c1 --- /dev/null +++ b/ocaml/Stdlib__Bool/index.html @@ -0,0 +1,2 @@ + +Stdlib__Bool (ocaml.Stdlib__Bool)

    Module Stdlib__Bool

    This module is hidden.

    diff --git a/ocaml/Stdlib__Buffer/index.html b/ocaml/Stdlib__Buffer/index.html new file mode 100644 index 0000000..3fae8ea --- /dev/null +++ b/ocaml/Stdlib__Buffer/index.html @@ -0,0 +1,2 @@ + +Stdlib__Buffer (ocaml.Stdlib__Buffer)

    Module Stdlib__Buffer

    This module is hidden.

    diff --git a/ocaml/Stdlib__Bytes/index.html b/ocaml/Stdlib__Bytes/index.html new file mode 100644 index 0000000..79922ca --- /dev/null +++ b/ocaml/Stdlib__Bytes/index.html @@ -0,0 +1,2 @@ + +Stdlib__Bytes (ocaml.Stdlib__Bytes)

    Module Stdlib__Bytes

    This module is hidden.

    diff --git a/ocaml/Stdlib__BytesLabels/index.html b/ocaml/Stdlib__BytesLabels/index.html new file mode 100644 index 0000000..1f28f8a --- /dev/null +++ b/ocaml/Stdlib__BytesLabels/index.html @@ -0,0 +1,2 @@ + +Stdlib__BytesLabels (ocaml.Stdlib__BytesLabels)

    Module Stdlib__BytesLabels

    This module is hidden.

    diff --git a/ocaml/Stdlib__Callback/index.html b/ocaml/Stdlib__Callback/index.html new file mode 100644 index 0000000..b2f84de --- /dev/null +++ b/ocaml/Stdlib__Callback/index.html @@ -0,0 +1,2 @@ + +Stdlib__Callback (ocaml.Stdlib__Callback)

    Module Stdlib__Callback

    This module is hidden.

    diff --git a/ocaml/Stdlib__Char/index.html b/ocaml/Stdlib__Char/index.html new file mode 100644 index 0000000..397cf36 --- /dev/null +++ b/ocaml/Stdlib__Char/index.html @@ -0,0 +1,2 @@ + +Stdlib__Char (ocaml.Stdlib__Char)

    Module Stdlib__Char

    This module is hidden.

    diff --git a/ocaml/Stdlib__Complex/index.html b/ocaml/Stdlib__Complex/index.html new file mode 100644 index 0000000..f391250 --- /dev/null +++ b/ocaml/Stdlib__Complex/index.html @@ -0,0 +1,2 @@ + +Stdlib__Complex (ocaml.Stdlib__Complex)

    Module Stdlib__Complex

    This module is hidden.

    diff --git a/ocaml/Stdlib__Condition/index.html b/ocaml/Stdlib__Condition/index.html new file mode 100644 index 0000000..eba0915 --- /dev/null +++ b/ocaml/Stdlib__Condition/index.html @@ -0,0 +1,2 @@ + +Stdlib__Condition (ocaml.Stdlib__Condition)

    Module Stdlib__Condition

    This module is hidden.

    diff --git a/ocaml/Stdlib__Digest/index.html b/ocaml/Stdlib__Digest/index.html new file mode 100644 index 0000000..ba68dad --- /dev/null +++ b/ocaml/Stdlib__Digest/index.html @@ -0,0 +1,2 @@ + +Stdlib__Digest (ocaml.Stdlib__Digest)

    Module Stdlib__Digest

    This module is hidden.

    diff --git a/ocaml/Stdlib__Domain/index.html b/ocaml/Stdlib__Domain/index.html new file mode 100644 index 0000000..45dceb8 --- /dev/null +++ b/ocaml/Stdlib__Domain/index.html @@ -0,0 +1,2 @@ + +Stdlib__Domain (ocaml.Stdlib__Domain)

    Module Stdlib__Domain

    This module is hidden.

    diff --git a/ocaml/Stdlib__Dynarray/index.html b/ocaml/Stdlib__Dynarray/index.html new file mode 100644 index 0000000..a58eb21 --- /dev/null +++ b/ocaml/Stdlib__Dynarray/index.html @@ -0,0 +1,2 @@ + +Stdlib__Dynarray (ocaml.Stdlib__Dynarray)

    Module Stdlib__Dynarray

    This module is hidden.

    diff --git a/ocaml/Stdlib__Effect/index.html b/ocaml/Stdlib__Effect/index.html new file mode 100644 index 0000000..5031953 --- /dev/null +++ b/ocaml/Stdlib__Effect/index.html @@ -0,0 +1,2 @@ + +Stdlib__Effect (ocaml.Stdlib__Effect)

    Module Stdlib__Effect

    This module is hidden.

    diff --git a/ocaml/Stdlib__Either/index.html b/ocaml/Stdlib__Either/index.html new file mode 100644 index 0000000..993f5bc --- /dev/null +++ b/ocaml/Stdlib__Either/index.html @@ -0,0 +1,2 @@ + +Stdlib__Either (ocaml.Stdlib__Either)

    Module Stdlib__Either

    This module is hidden.

    diff --git a/ocaml/Stdlib__Ephemeron/index.html b/ocaml/Stdlib__Ephemeron/index.html new file mode 100644 index 0000000..e71858b --- /dev/null +++ b/ocaml/Stdlib__Ephemeron/index.html @@ -0,0 +1,2 @@ + +Stdlib__Ephemeron (ocaml.Stdlib__Ephemeron)

    Module Stdlib__Ephemeron

    This module is hidden.

    diff --git a/ocaml/Stdlib__Filename/index.html b/ocaml/Stdlib__Filename/index.html new file mode 100644 index 0000000..f4159c5 --- /dev/null +++ b/ocaml/Stdlib__Filename/index.html @@ -0,0 +1,2 @@ + +Stdlib__Filename (ocaml.Stdlib__Filename)

    Module Stdlib__Filename

    This module is hidden.

    diff --git a/ocaml/Stdlib__Float/index.html b/ocaml/Stdlib__Float/index.html new file mode 100644 index 0000000..ba36a25 --- /dev/null +++ b/ocaml/Stdlib__Float/index.html @@ -0,0 +1,2 @@ + +Stdlib__Float (ocaml.Stdlib__Float)

    Module Stdlib__Float

    This module is hidden.

    diff --git a/ocaml/Stdlib__Format/index.html b/ocaml/Stdlib__Format/index.html new file mode 100644 index 0000000..edd168f --- /dev/null +++ b/ocaml/Stdlib__Format/index.html @@ -0,0 +1,2 @@ + +Stdlib__Format (ocaml.Stdlib__Format)

    Module Stdlib__Format

    This module is hidden.

    diff --git a/ocaml/Stdlib__Fun/index.html b/ocaml/Stdlib__Fun/index.html new file mode 100644 index 0000000..82ec8e9 --- /dev/null +++ b/ocaml/Stdlib__Fun/index.html @@ -0,0 +1,2 @@ + +Stdlib__Fun (ocaml.Stdlib__Fun)

    Module Stdlib__Fun

    This module is hidden.

    diff --git a/ocaml/Stdlib__Gc/index.html b/ocaml/Stdlib__Gc/index.html new file mode 100644 index 0000000..2a5510f --- /dev/null +++ b/ocaml/Stdlib__Gc/index.html @@ -0,0 +1,2 @@ + +Stdlib__Gc (ocaml.Stdlib__Gc)

    Module Stdlib__Gc

    This module is hidden.

    diff --git a/ocaml/Stdlib__Hashtbl/index.html b/ocaml/Stdlib__Hashtbl/index.html new file mode 100644 index 0000000..be2bcbb --- /dev/null +++ b/ocaml/Stdlib__Hashtbl/index.html @@ -0,0 +1,2 @@ + +Stdlib__Hashtbl (ocaml.Stdlib__Hashtbl)

    Module Stdlib__Hashtbl

    This module is hidden.

    diff --git a/ocaml/Stdlib__In_channel/index.html b/ocaml/Stdlib__In_channel/index.html new file mode 100644 index 0000000..4045165 --- /dev/null +++ b/ocaml/Stdlib__In_channel/index.html @@ -0,0 +1,2 @@ + +Stdlib__In_channel (ocaml.Stdlib__In_channel)

    Module Stdlib__In_channel

    This module is hidden.

    diff --git a/ocaml/Stdlib__Int/index.html b/ocaml/Stdlib__Int/index.html new file mode 100644 index 0000000..613c2ca --- /dev/null +++ b/ocaml/Stdlib__Int/index.html @@ -0,0 +1,2 @@ + +Stdlib__Int (ocaml.Stdlib__Int)

    Module Stdlib__Int

    This module is hidden.

    diff --git a/ocaml/Stdlib__Int32/index.html b/ocaml/Stdlib__Int32/index.html new file mode 100644 index 0000000..1ffa09a --- /dev/null +++ b/ocaml/Stdlib__Int32/index.html @@ -0,0 +1,2 @@ + +Stdlib__Int32 (ocaml.Stdlib__Int32)

    Module Stdlib__Int32

    This module is hidden.

    diff --git a/ocaml/Stdlib__Int64/index.html b/ocaml/Stdlib__Int64/index.html new file mode 100644 index 0000000..c435d2b --- /dev/null +++ b/ocaml/Stdlib__Int64/index.html @@ -0,0 +1,2 @@ + +Stdlib__Int64 (ocaml.Stdlib__Int64)

    Module Stdlib__Int64

    This module is hidden.

    diff --git a/ocaml/Stdlib__Lazy/index.html b/ocaml/Stdlib__Lazy/index.html new file mode 100644 index 0000000..b3db510 --- /dev/null +++ b/ocaml/Stdlib__Lazy/index.html @@ -0,0 +1,2 @@ + +Stdlib__Lazy (ocaml.Stdlib__Lazy)

    Module Stdlib__Lazy

    This module is hidden.

    diff --git a/ocaml/Stdlib__Lexing/index.html b/ocaml/Stdlib__Lexing/index.html new file mode 100644 index 0000000..aa073ad --- /dev/null +++ b/ocaml/Stdlib__Lexing/index.html @@ -0,0 +1,2 @@ + +Stdlib__Lexing (ocaml.Stdlib__Lexing)

    Module Stdlib__Lexing

    This module is hidden.

    diff --git a/ocaml/Stdlib__List/index.html b/ocaml/Stdlib__List/index.html new file mode 100644 index 0000000..920e7a3 --- /dev/null +++ b/ocaml/Stdlib__List/index.html @@ -0,0 +1,2 @@ + +Stdlib__List (ocaml.Stdlib__List)

    Module Stdlib__List

    This module is hidden.

    diff --git a/ocaml/Stdlib__ListLabels/index.html b/ocaml/Stdlib__ListLabels/index.html new file mode 100644 index 0000000..d2b9f42 --- /dev/null +++ b/ocaml/Stdlib__ListLabels/index.html @@ -0,0 +1,2 @@ + +Stdlib__ListLabels (ocaml.Stdlib__ListLabels)

    Module Stdlib__ListLabels

    This module is hidden.

    diff --git a/ocaml/Stdlib__Map/index.html b/ocaml/Stdlib__Map/index.html new file mode 100644 index 0000000..946d016 --- /dev/null +++ b/ocaml/Stdlib__Map/index.html @@ -0,0 +1,2 @@ + +Stdlib__Map (ocaml.Stdlib__Map)

    Module Stdlib__Map

    This module is hidden.

    diff --git a/ocaml/Stdlib__Marshal/index.html b/ocaml/Stdlib__Marshal/index.html new file mode 100644 index 0000000..4afebc1 --- /dev/null +++ b/ocaml/Stdlib__Marshal/index.html @@ -0,0 +1,2 @@ + +Stdlib__Marshal (ocaml.Stdlib__Marshal)

    Module Stdlib__Marshal

    This module is hidden.

    diff --git a/ocaml/Stdlib__MoreLabels/index.html b/ocaml/Stdlib__MoreLabels/index.html new file mode 100644 index 0000000..1ae323b --- /dev/null +++ b/ocaml/Stdlib__MoreLabels/index.html @@ -0,0 +1,2 @@ + +Stdlib__MoreLabels (ocaml.Stdlib__MoreLabels)

    Module Stdlib__MoreLabels

    This module is hidden.

    diff --git a/ocaml/Stdlib__Mutex/index.html b/ocaml/Stdlib__Mutex/index.html new file mode 100644 index 0000000..f512ff1 --- /dev/null +++ b/ocaml/Stdlib__Mutex/index.html @@ -0,0 +1,2 @@ + +Stdlib__Mutex (ocaml.Stdlib__Mutex)

    Module Stdlib__Mutex

    This module is hidden.

    diff --git a/ocaml/Stdlib__Nativeint/index.html b/ocaml/Stdlib__Nativeint/index.html new file mode 100644 index 0000000..be7ca4d --- /dev/null +++ b/ocaml/Stdlib__Nativeint/index.html @@ -0,0 +1,2 @@ + +Stdlib__Nativeint (ocaml.Stdlib__Nativeint)

    Module Stdlib__Nativeint

    This module is hidden.

    diff --git a/ocaml/Stdlib__Obj/index.html b/ocaml/Stdlib__Obj/index.html new file mode 100644 index 0000000..58cc3fc --- /dev/null +++ b/ocaml/Stdlib__Obj/index.html @@ -0,0 +1,2 @@ + +Stdlib__Obj (ocaml.Stdlib__Obj)

    Module Stdlib__Obj

    This module is hidden.

    diff --git a/ocaml/Stdlib__Oo/index.html b/ocaml/Stdlib__Oo/index.html new file mode 100644 index 0000000..6949e1f --- /dev/null +++ b/ocaml/Stdlib__Oo/index.html @@ -0,0 +1,2 @@ + +Stdlib__Oo (ocaml.Stdlib__Oo)

    Module Stdlib__Oo

    This module is hidden.

    diff --git a/ocaml/Stdlib__Option/index.html b/ocaml/Stdlib__Option/index.html new file mode 100644 index 0000000..334f98b --- /dev/null +++ b/ocaml/Stdlib__Option/index.html @@ -0,0 +1,2 @@ + +Stdlib__Option (ocaml.Stdlib__Option)

    Module Stdlib__Option

    This module is hidden.

    diff --git a/ocaml/Stdlib__Out_channel/index.html b/ocaml/Stdlib__Out_channel/index.html new file mode 100644 index 0000000..e7f0c6b --- /dev/null +++ b/ocaml/Stdlib__Out_channel/index.html @@ -0,0 +1,2 @@ + +Stdlib__Out_channel (ocaml.Stdlib__Out_channel)

    Module Stdlib__Out_channel

    This module is hidden.

    diff --git a/ocaml/Stdlib__Parsing/index.html b/ocaml/Stdlib__Parsing/index.html new file mode 100644 index 0000000..eae9678 --- /dev/null +++ b/ocaml/Stdlib__Parsing/index.html @@ -0,0 +1,2 @@ + +Stdlib__Parsing (ocaml.Stdlib__Parsing)

    Module Stdlib__Parsing

    This module is hidden.

    diff --git a/ocaml/Stdlib__Printexc/index.html b/ocaml/Stdlib__Printexc/index.html new file mode 100644 index 0000000..c8ef351 --- /dev/null +++ b/ocaml/Stdlib__Printexc/index.html @@ -0,0 +1,2 @@ + +Stdlib__Printexc (ocaml.Stdlib__Printexc)

    Module Stdlib__Printexc

    This module is hidden.

    diff --git a/ocaml/Stdlib__Printf/index.html b/ocaml/Stdlib__Printf/index.html new file mode 100644 index 0000000..2d8100d --- /dev/null +++ b/ocaml/Stdlib__Printf/index.html @@ -0,0 +1,2 @@ + +Stdlib__Printf (ocaml.Stdlib__Printf)

    Module Stdlib__Printf

    This module is hidden.

    diff --git a/ocaml/Stdlib__Queue/index.html b/ocaml/Stdlib__Queue/index.html new file mode 100644 index 0000000..24bf26c --- /dev/null +++ b/ocaml/Stdlib__Queue/index.html @@ -0,0 +1,2 @@ + +Stdlib__Queue (ocaml.Stdlib__Queue)

    Module Stdlib__Queue

    This module is hidden.

    diff --git a/ocaml/Stdlib__Random/index.html b/ocaml/Stdlib__Random/index.html new file mode 100644 index 0000000..dd0b6f8 --- /dev/null +++ b/ocaml/Stdlib__Random/index.html @@ -0,0 +1,2 @@ + +Stdlib__Random (ocaml.Stdlib__Random)

    Module Stdlib__Random

    This module is hidden.

    diff --git a/ocaml/Stdlib__Result/index.html b/ocaml/Stdlib__Result/index.html new file mode 100644 index 0000000..8c8e820 --- /dev/null +++ b/ocaml/Stdlib__Result/index.html @@ -0,0 +1,2 @@ + +Stdlib__Result (ocaml.Stdlib__Result)

    Module Stdlib__Result

    This module is hidden.

    diff --git a/ocaml/Stdlib__Scanf/index.html b/ocaml/Stdlib__Scanf/index.html new file mode 100644 index 0000000..ba990d7 --- /dev/null +++ b/ocaml/Stdlib__Scanf/index.html @@ -0,0 +1,2 @@ + +Stdlib__Scanf (ocaml.Stdlib__Scanf)

    Module Stdlib__Scanf

    This module is hidden.

    diff --git a/ocaml/Stdlib__Semaphore/index.html b/ocaml/Stdlib__Semaphore/index.html new file mode 100644 index 0000000..cb2418e --- /dev/null +++ b/ocaml/Stdlib__Semaphore/index.html @@ -0,0 +1,2 @@ + +Stdlib__Semaphore (ocaml.Stdlib__Semaphore)

    Module Stdlib__Semaphore

    This module is hidden.

    diff --git a/ocaml/Stdlib__Seq/index.html b/ocaml/Stdlib__Seq/index.html new file mode 100644 index 0000000..59c8e97 --- /dev/null +++ b/ocaml/Stdlib__Seq/index.html @@ -0,0 +1,2 @@ + +Stdlib__Seq (ocaml.Stdlib__Seq)

    Module Stdlib__Seq

    This module is hidden.

    diff --git a/ocaml/Stdlib__Set/index.html b/ocaml/Stdlib__Set/index.html new file mode 100644 index 0000000..11b43b2 --- /dev/null +++ b/ocaml/Stdlib__Set/index.html @@ -0,0 +1,2 @@ + +Stdlib__Set (ocaml.Stdlib__Set)

    Module Stdlib__Set

    This module is hidden.

    diff --git a/ocaml/Stdlib__Stack/index.html b/ocaml/Stdlib__Stack/index.html new file mode 100644 index 0000000..5644aa4 --- /dev/null +++ b/ocaml/Stdlib__Stack/index.html @@ -0,0 +1,2 @@ + +Stdlib__Stack (ocaml.Stdlib__Stack)

    Module Stdlib__Stack

    This module is hidden.

    diff --git a/ocaml/Stdlib__StdLabels/index.html b/ocaml/Stdlib__StdLabels/index.html new file mode 100644 index 0000000..d475672 --- /dev/null +++ b/ocaml/Stdlib__StdLabels/index.html @@ -0,0 +1,2 @@ + +Stdlib__StdLabels (ocaml.Stdlib__StdLabels)

    Module Stdlib__StdLabels

    This module is hidden.

    diff --git a/ocaml/Stdlib__String/index.html b/ocaml/Stdlib__String/index.html new file mode 100644 index 0000000..e4d97da --- /dev/null +++ b/ocaml/Stdlib__String/index.html @@ -0,0 +1,2 @@ + +Stdlib__String (ocaml.Stdlib__String)

    Module Stdlib__String

    This module is hidden.

    diff --git a/ocaml/Stdlib__StringLabels/index.html b/ocaml/Stdlib__StringLabels/index.html new file mode 100644 index 0000000..d454649 --- /dev/null +++ b/ocaml/Stdlib__StringLabels/index.html @@ -0,0 +1,2 @@ + +Stdlib__StringLabels (ocaml.Stdlib__StringLabels)

    Module Stdlib__StringLabels

    This module is hidden.

    diff --git a/ocaml/Stdlib__Sys/index.html b/ocaml/Stdlib__Sys/index.html new file mode 100644 index 0000000..9e86b73 --- /dev/null +++ b/ocaml/Stdlib__Sys/index.html @@ -0,0 +1,2 @@ + +Stdlib__Sys (ocaml.Stdlib__Sys)

    Module Stdlib__Sys

    This module is hidden.

    diff --git a/ocaml/Stdlib__Type/index.html b/ocaml/Stdlib__Type/index.html new file mode 100644 index 0000000..539ea27 --- /dev/null +++ b/ocaml/Stdlib__Type/index.html @@ -0,0 +1,2 @@ + +Stdlib__Type (ocaml.Stdlib__Type)

    Module Stdlib__Type

    This module is hidden.

    diff --git a/ocaml/Stdlib__Uchar/index.html b/ocaml/Stdlib__Uchar/index.html new file mode 100644 index 0000000..586f4a9 --- /dev/null +++ b/ocaml/Stdlib__Uchar/index.html @@ -0,0 +1,2 @@ + +Stdlib__Uchar (ocaml.Stdlib__Uchar)

    Module Stdlib__Uchar

    This module is hidden.

    diff --git a/ocaml/Stdlib__Unit/index.html b/ocaml/Stdlib__Unit/index.html new file mode 100644 index 0000000..da10598 --- /dev/null +++ b/ocaml/Stdlib__Unit/index.html @@ -0,0 +1,2 @@ + +Stdlib__Unit (ocaml.Stdlib__Unit)

    Module Stdlib__Unit

    This module is hidden.

    diff --git a/ocaml/Stdlib__Weak/index.html b/ocaml/Stdlib__Weak/index.html new file mode 100644 index 0000000..f8aac8d --- /dev/null +++ b/ocaml/Stdlib__Weak/index.html @@ -0,0 +1,2 @@ + +Stdlib__Weak (ocaml.Stdlib__Weak)

    Module Stdlib__Weak

    This module is hidden.

    diff --git a/ocaml/Str/index.html b/ocaml/Str/index.html new file mode 100644 index 0000000..27fa4a8 --- /dev/null +++ b/ocaml/Str/index.html @@ -0,0 +1,4 @@ + +Str (ocaml.Str)

    Module Str

    Regular expressions and high-level string processing

    Regular expressions

    The Str library provides regular expressions on sequences of bytes. It is, in general, unsuitable to match Unicode characters.

    type regexp

    The type of compiled regular expressions.

    val regexp : string -> regexp

    Compile a regular expression. The following constructs are recognized:

    • . Matches any character except newline.
    • * (postfix) Matches the preceding expression zero, one or several times
    • + (postfix) Matches the preceding expression one or several times
    • ? (postfix) Matches the preceding expression once or not at all
    • [..] Character set. Ranges are denoted with -, as in [a-z]. An initial ^, as in [^0-9], complements the set. To include a ] character in a set, make it the first character of the set. To include a - character in a set, make it the first or the last character of the set.
    • ^ Matches at beginning of line: either at the beginning of the matched string, or just after a '\n' character.
    • $ Matches at end of line: either at the end of the matched string, or just before a '\n' character.
    • \| (infix) Alternative between two expressions.
    • \(..\) Grouping and naming of the enclosed expression.
    • \1 The text matched by the first \(...\) expression (\2 for the second expression, and so on up to \9).
    • \b Matches word boundaries.
    • \ Quotes special characters. The special characters are $^\.*+?[].

    In regular expressions you will often use backslash characters; it's easier to use a quoted string literal {|...|} to avoid having to escape backslashes.

    For example, the following expression:

     let r = Str.regexp {|hello \([A-Za-z]+\)|} in
+   Str.replace_first r {|\1|} "hello world"

    returns the string "world".

    If you want a regular expression that matches a literal backslash character, you need to double it: Str.regexp {|\\|}.

    You can use regular string literals "..." too, however you will have to escape backslashes. The example above can be rewritten with a regular string literal as:

     let r = Str.regexp "hello \\([A-Za-z]+\\)" in
+   Str.replace_first r "\\1" "hello world"

    And the regular expression for matching a backslash becomes a quadruple backslash: Str.regexp "\\\\".

    val regexp_case_fold : string -> regexp

    Same as regexp, but the compiled expression will match text in a case-insensitive way: uppercase and lowercase letters will be considered equivalent.

    val quote : string -> string

    Str.quote s returns a regexp string that matches exactly s and nothing else.

    val regexp_string : string -> regexp

    Str.regexp_string s returns a regular expression that matches exactly s and nothing else.

    val regexp_string_case_fold : string -> regexp

    Str.regexp_string_case_fold is similar to Str.regexp_string, but the regexp matches in a case-insensitive way.

    String matching and searching

    val string_match : regexp -> string -> int -> bool

    string_match r s start tests whether a substring of s that starts at position start matches the regular expression r. The first character of a string has position 0, as usual.

    val search_forward : regexp -> string -> int -> int

    search_forward r s start searches the string s for a substring matching the regular expression r. The search starts at position start and proceeds towards the end of the string. Return the position of the first character of the matched substring.

    • raises Not_found

      if no substring matches.

    val search_backward : regexp -> string -> int -> int

    search_backward r s last searches the string s for a substring matching the regular expression r. The search first considers substrings that start at position last and proceeds towards the beginning of string. Return the position of the first character of the matched substring.

    • raises Not_found

      if no substring matches.

    val string_partial_match : regexp -> string -> int -> bool

    Similar to Str.string_match, but also returns true if the argument string is a prefix of a string that matches. This includes the case of a true complete match.

    val matched_string : string -> string

    matched_string s returns the substring of s that was matched by the last call to one of the following matching or searching functions:

    provided that none of the following functions was called in between:

    Note: in the case of global_substitute and substitute_first, a call to matched_string is only valid within the subst argument, not after global_substitute or substitute_first returns.

    The user must make sure that the parameter s is the same string that was passed to the matching or searching function.

    val match_beginning : unit -> int

    match_beginning() returns the position of the first character of the substring that was matched by the last call to a matching or searching function (see Str.matched_string for details).

    val match_end : unit -> int

    match_end() returns the position of the character following the last character of the substring that was matched by the last call to a matching or searching function (see Str.matched_string for details).

    val matched_group : int -> string -> string

    matched_group n s returns the substring of s that was matched by the nth group \(...\) of the regular expression that was matched by the last call to a matching or searching function (see Str.matched_string for details). When n is 0, it returns the substring matched by the whole regular expression. The user must make sure that the parameter s is the same string that was passed to the matching or searching function.

    • raises Not_found

      if the nth group of the regular expression was not matched. This can happen with groups inside alternatives \|, options ? or repetitions *. For instance, the empty string will match \(a\)*, but matched_group 1 "" will raise Not_found because the first group itself was not matched.

    val group_beginning : int -> int

    group_beginning n returns the position of the first character of the substring that was matched by the nth group of the regular expression that was matched by the last call to a matching or searching function (see Str.matched_string for details).

    • raises Not_found

      if the nth group of the regular expression was not matched.

    • raises Invalid_argument

      if there are fewer than n groups in the regular expression.

    val group_end : int -> int

    group_end n returns the position of the character following the last character of substring that was matched by the nth group of the regular expression that was matched by the last call to a matching or searching function (see Str.matched_string for details).

    • raises Not_found

      if the nth group of the regular expression was not matched.

    • raises Invalid_argument

      if there are fewer than n groups in the regular expression.

    Replacement

    val global_replace : regexp -> string -> string -> string

    global_replace regexp templ s returns a string identical to s, except that all substrings of s that match regexp have been replaced by templ. The replacement template templ can contain \1, \2, etc; these sequences will be replaced by the text matched by the corresponding group in the regular expression. \0 stands for the text matched by the whole regular expression.

    val replace_first : regexp -> string -> string -> string

    Same as Str.global_replace, except that only the first substring matching the regular expression is replaced.

    val global_substitute : regexp -> (string -> string) -> string -> string

    global_substitute regexp subst s returns a string identical to s, except that all substrings of s that match regexp have been replaced by the result of function subst. The function subst is called once for each matching substring, and receives s (the whole text) as argument.

    val substitute_first : regexp -> (string -> string) -> string -> string

    Same as Str.global_substitute, except that only the first substring matching the regular expression is replaced.

    val replace_matched : string -> string -> string

    replace_matched repl s returns the replacement text repl in which \1, \2, etc. have been replaced by the text matched by the corresponding groups in the regular expression that was matched by the last call to a matching or searching function (see Str.matched_string for details). s must be the same string that was passed to the matching or searching function.

    Splitting

    val split : regexp -> string -> string list

    split r s splits s into substrings, taking as delimiters the substrings that match r, and returns the list of substrings. For instance, split (regexp "[ \t]+") s splits s into blank-separated words. An occurrence of the delimiter at the beginning or at the end of the string is ignored.

    val bounded_split : regexp -> string -> int -> string list

    Same as Str.split, but splits into at most n substrings, where n is the extra integer parameter.

    val split_delim : regexp -> string -> string list

    Same as Str.split but occurrences of the delimiter at the beginning and at the end of the string are recognized and returned as empty strings in the result. For instance, split_delim (regexp " ") " abc " returns [""; "abc"; ""], while split with the same arguments returns ["abc"].

    val bounded_split_delim : regexp -> string -> int -> string list

    Same as Str.bounded_split, but occurrences of the delimiter at the beginning and at the end of the string are recognized and returned as empty strings in the result.

    type split_result =
    1. | Text of string
    2. | Delim of string
    val full_split : regexp -> string -> split_result list

    Same as Str.split_delim, but returns the delimiters as well as the substrings contained between delimiters. The former are tagged Delim in the result list; the latter are tagged Text. For instance, full_split (regexp "[{}]") "{ab}" returns [Delim "{"; Text "ab"; Delim "}"].

    val bounded_full_split : regexp -> string -> int -> split_result list

    Same as Str.bounded_split_delim, but returns the delimiters as well as the substrings contained between delimiters. The former are tagged Delim in the result list; the latter are tagged Text.

    Extracting substrings

    val string_before : string -> int -> string

    string_before s n returns the substring of all characters of s that precede position n (excluding the character at position n).

    val string_after : string -> int -> string

    string_after s n returns the substring of all characters of s that follow position n (including the character at position n).

    val first_chars : string -> int -> string

    first_chars s n returns the first n characters of s. This is the same function as Str.string_before.

    val last_chars : string -> int -> string

    last_chars s n returns the last n characters of s.

    diff --git a/ocaml/Strmatch/Make/argument-1-_/index.html b/ocaml/Strmatch/Make/argument-1-_/index.html new file mode 100644 index 0000000..0ae55b8 --- /dev/null +++ b/ocaml/Strmatch/Make/argument-1-_/index.html @@ -0,0 +1,9 @@ + +_ (ocaml.Strmatch.Make._)

    Parameter Make._

    val string_block_length : Cmm.expression -> Cmm.expression
    val transl_switch : + Debuginfo.t -> + Cmm.expression -> + int -> + int -> + (int * Cmm.expression) list -> + Cmm.expression -> + Cmm.expression
    diff --git a/ocaml/Strmatch/Make/index.html b/ocaml/Strmatch/Make/index.html new file mode 100644 index 0000000..bef3516 --- /dev/null +++ b/ocaml/Strmatch/Make/index.html @@ -0,0 +1,7 @@ + +Make (ocaml.Strmatch.Make)

    Module Strmatch.Make

    Parameters

    module _ : I

    Signature

    val compile : + Debuginfo.t -> + Cmm.expression -> + Cmm.expression option -> + (string * Cmm.expression) list -> + Cmm.expression
    diff --git a/ocaml/Strmatch/index.html b/ocaml/Strmatch/index.html new file mode 100644 index 0000000..6adcd92 --- /dev/null +++ b/ocaml/Strmatch/index.html @@ -0,0 +1,2 @@ + +Strmatch (ocaml.Strmatch)

    Module Strmatch

    module type I = sig ... end
    module Make (_ : I) : sig ... end
    diff --git a/ocaml/Strmatch/module-type-I/index.html b/ocaml/Strmatch/module-type-I/index.html new file mode 100644 index 0000000..623864f --- /dev/null +++ b/ocaml/Strmatch/module-type-I/index.html @@ -0,0 +1,9 @@ + +I (ocaml.Strmatch.I)

    Module type Strmatch.I

    val string_block_length : Cmm.expression -> Cmm.expression
    val transl_switch : + Debuginfo.t -> + Cmm.expression -> + int -> + int -> + (int * Cmm.expression) list -> + Cmm.expression -> + Cmm.expression
    diff --git a/ocaml/Strongly_connected_components/Make/argument-1-Id/Map/index.html b/ocaml/Strongly_connected_components/Make/argument-1-Id/Map/index.html new file mode 100644 index 0000000..0054724 --- /dev/null +++ b/ocaml/Strongly_connected_components/Make/argument-1-Id/Map/index.html @@ -0,0 +1,17 @@ + +Map (ocaml.Strongly_connected_components.Make.Id.Map)

    Module Id.Map

    include Map.S with type key = T.t and type 'a t = 'a Map.Make(T).t

    Maps

    type key = T.t

    The type of the map keys.

    type 'a t = 'a Stdlib.Map.Make(T).t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key -> 'a -> 'a t -> 'a t

    add key data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key -> 'a -> 'a list t -> 'a list t

    add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

    update key f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : (key -> bool) -> 'a t -> key * 'a

    find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : (key -> bool) -> 'a t -> key * 'a

    find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : (key -> 'a -> unit) -> 'a t -> unit

    iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

    fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : (key -> 'a -> bool) -> 'a t -> 'a t

    filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : (key -> 'a -> bool) -> 'a t -> bool

    for_all f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : (key -> 'a -> bool) -> 'a t -> bool

    exists f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Stdlib.Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Stdlib.Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    val of_list : (key * 'a) list -> 'a t
    val disjoint_union : + ?eq:('a -> 'a -> bool) -> + ?print:(Stdlib.Format.formatter -> 'a -> unit) -> + 'a t -> + 'a t -> + 'a t

    disjoint_union m1 m2 contains all bindings from m1 and m2. If some binding is present in both and the associated value is not equal, a Fatal_error is raised

    val union_right : 'a t -> 'a t -> 'a t

    union_right m1 m2 contains all bindings from m1 and m2. If some binding is present in both, the one from m2 is taken

    val union_left : 'a t -> 'a t -> 'a t

    union_left m1 m2 = union_right m2 m1

    val union_merge : ('a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
    val rename : key t -> key -> key
    val map_keys : (key -> key) -> 'a t -> 'a t
    val keys : 'a t -> Stdlib.Set.Make(T).t
    val data : 'a t -> 'a list
    val of_set : (key -> 'a) -> Stdlib.Set.Make(T).t -> 'a t
    val transpose_keys_and_data : key t -> key t
    val transpose_keys_and_data_set : key t -> Stdlib.Set.Make(T).t t
    val print : + (Stdlib.Format.formatter -> 'a -> unit) -> + Stdlib.Format.formatter -> + 'a t -> + unit
    diff --git a/ocaml/Strongly_connected_components/Make/argument-1-Id/Set/index.html b/ocaml/Strongly_connected_components/Make/argument-1-Id/Set/index.html new file mode 100644 index 0000000..2e525a6 --- /dev/null +++ b/ocaml/Strongly_connected_components/Make/argument-1-Id/Set/index.html @@ -0,0 +1,2 @@ + +Set (ocaml.Strongly_connected_components.Make.Id.Set)

    Module Id.Set

    include Set.S with type elt = T.t and type t = Set.Make(T).t

    Sets

    type elt = T.t

    The type of the set elements.

    The type of sets.

    val empty : t

    The empty set.

    val add : elt -> t -> t

    add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val singleton : elt -> t

    singleton x returns the one-element set containing only x.

    val remove : elt -> t -> t

    remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val union : t -> t -> t

    Set union.

    val inter : t -> t -> t

    Set intersection.

    val disjoint : t -> t -> bool

    Test if two sets are disjoint.

    • since 4.08
    val diff : t -> t -> t

    Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

    val cardinal : t -> int

    Return the number of elements of a set.

    Elements

    val elements : t -> elt list

    Return the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Set.Make.

    val min_elt : t -> elt

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

    val min_elt_opt : t -> elt option

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

    • since 4.05
    val max_elt : t -> elt

    Same as min_elt, but returns the largest element of the given set.

    val max_elt_opt : t -> elt option

    Same as min_elt_opt, but returns the largest element of the given set.

    • since 4.05
    val choose : t -> elt

    Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    val choose_opt : t -> elt option

    Return one element of the given set, or None if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    • since 4.05

    Searching

    val find : elt -> t -> elt

    find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

    • since 4.01
    val find_opt : elt -> t -> elt option

    find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

    • since 4.05
    val find_first : (elt -> bool) -> t -> elt

    find_first f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

    For example, find_first (fun e -> Ord.compare e x >= 0) s will return the first element e of s where Ord.compare e x >= 0 (intuitively: e >= x), or raise Not_found if x is greater than any element of s.

    • since 4.05
    val find_first_opt : (elt -> bool) -> t -> elt option

    find_first_opt f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

    • since 4.05
    val find_last : (elt -> bool) -> t -> elt

    find_last f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

    • since 4.05
    val find_last_opt : (elt -> bool) -> t -> elt option

    find_last_opt f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

    • since 4.05

    Traversing

    val iter : (elt -> unit) -> t -> unit

    iter f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.

    val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc

    fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

    Transforming

    val filter : (elt -> bool) -> t -> t

    filter f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val filter_map : (elt -> elt option) -> t -> t

    filter_map f s returns the set of all v such that f x = Some v for some element x of s.

    For example,

    filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) s

    is the set of halves of the even elements of s.

    If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned unchanged: the result of the function is then physically equal to s.

    • since 4.11
    val partition : (elt -> bool) -> t -> t * t

    partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

    val split : elt -> t -> t * bool * t

    split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.

    Predicates and comparisons

    val is_empty : t -> bool

    Test whether a set is empty or not.

    val mem : elt -> t -> bool

    mem x s tests whether x belongs to the set s.

    val equal : t -> t -> bool

    equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

    val compare : t -> t -> int

    Total ordering between sets. Can be used as the ordering function for doing sets of sets.

    val subset : t -> t -> bool

    subset s1 s2 tests whether the set s1 is a subset of the set s2.

    val for_all : (elt -> bool) -> t -> bool

    for_all f s checks if all elements of the set satisfy the predicate f.

    val exists : (elt -> bool) -> t -> bool

    exists f s checks if at least one element of the set satisfies the predicate f.

    Converting

    val to_list : t -> elt list

    to_list s is elements s.

    • since 5.1
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t

    to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

    • since 4.07
    val to_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in ascending order

    • since 4.07
    val to_rev_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in descending order

    • since 4.12
    val add_seq : elt Stdlib.Seq.t -> t -> t

    Add the given elements to the set, in order.

    • since 4.07
    val of_seq : elt Stdlib.Seq.t -> t

    Build a set from the given bindings

    • since 4.07
    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    val to_string : t -> string
    val of_list : elt list -> t
    val map : (elt -> elt) -> t -> t
    diff --git a/ocaml/Strongly_connected_components/Make/argument-1-Id/T/index.html b/ocaml/Strongly_connected_components/Make/argument-1-Id/T/index.html new file mode 100644 index 0000000..f47800b --- /dev/null +++ b/ocaml/Strongly_connected_components/Make/argument-1-Id/T/index.html @@ -0,0 +1,2 @@ + +T (ocaml.Strongly_connected_components.Make.Id.T)

    Module Id.T

    type t = t
    include Hashtbl.HashedType with type t := t
    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val hash : t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := t
    val compare : t -> t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    diff --git a/ocaml/Strongly_connected_components/Make/argument-1-Id/Tbl/index.html b/ocaml/Strongly_connected_components/Make/argument-1-Id/Tbl/index.html new file mode 100644 index 0000000..cdbe5af --- /dev/null +++ b/ocaml/Strongly_connected_components/Make/argument-1-Id/Tbl/index.html @@ -0,0 +1,2 @@ + +Tbl (ocaml.Strongly_connected_components.Make.Id.Tbl)

    Module Id.Tbl

    include Hashtbl.S with type key = T.t and type 'a t = 'a Hashtbl.Make(T).t
    type key = T.t
    val create : int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    • since 4.00
    val copy : 'a t -> 'a t
    val add : 'a t -> key -> 'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    • since 4.05
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key -> 'a -> unit
    val mem : 'a t -> key -> bool
    val iter : (key -> 'a -> unit) -> 'a t -> unit
    val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
    • since 4.03
    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc
    val length : 'a t -> int
    val stats : 'a t -> Stdlib.Hashtbl.statistics
    • since 4.00
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
    • since 4.07
    val to_seq_keys : _ t -> key Stdlib.Seq.t
    • since 4.07
    val to_seq_values : 'a t -> 'a Stdlib.Seq.t
    • since 4.07
    val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
    • since 4.07
    val to_list : 'a t -> (T.t * 'a) list
    val of_list : (T.t * 'a) list -> 'a t
    val to_map : 'a t -> 'a Stdlib.Map.Make(T).t
    val of_map : 'a Stdlib.Map.Make(T).t -> 'a t
    val memoize : 'a t -> (key -> 'a) -> key -> 'a
    val map : 'a t -> ('a -> 'b) -> 'b t
    diff --git a/ocaml/Strongly_connected_components/Make/argument-1-Id/index.html b/ocaml/Strongly_connected_components/Make/argument-1-Id/index.html new file mode 100644 index 0000000..ae74902 --- /dev/null +++ b/ocaml/Strongly_connected_components/Make/argument-1-Id/index.html @@ -0,0 +1,2 @@ + +Id (ocaml.Strongly_connected_components.Make.Id)

    Parameter Make.Id

    type t
    module T : Identifiable.Thing with type t = t
    include Identifiable.Thing with type t := T.t
    include Hashtbl.HashedType with type t := T.t
    val equal : T.t -> T.t -> bool

    The equality predicate used to compare keys.

    val hash : T.t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := T.t
    val compare : T.t -> T.t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> T.t -> unit
    val print : Stdlib.Format.formatter -> T.t -> unit
    module Set : Identifiable.Set with module T := T
    module Map : Identifiable.Map with module T := T
    module Tbl : Identifiable.Tbl with module T := T
    diff --git a/ocaml/Strongly_connected_components/Make/index.html b/ocaml/Strongly_connected_components/Make/index.html new file mode 100644 index 0000000..3fb833d --- /dev/null +++ b/ocaml/Strongly_connected_components/Make/index.html @@ -0,0 +1,4 @@ + +Make (ocaml.Strongly_connected_components.Make)

    Module Strongly_connected_components.Make

    Parameters

    Signature

    type directed_graph = Id.Set.t Id.Map.t

    If (a -> set) belongs to the map, it means that there are edges from a to every element of set. It is assumed that no edge points to a vertex not represented in the map.

    type component =
    1. | Has_loop of Id.t list
    2. | No_loop of Id.t
    val connected_components_sorted_from_roots_to_leaf : + directed_graph -> + component array
    val component_graph : directed_graph -> (component * int list) array
    diff --git a/ocaml/Strongly_connected_components/index.html b/ocaml/Strongly_connected_components/index.html new file mode 100644 index 0000000..ec780ba --- /dev/null +++ b/ocaml/Strongly_connected_components/index.html @@ -0,0 +1,2 @@ + +Strongly_connected_components (ocaml.Strongly_connected_components)

    Module Strongly_connected_components

    Kosaraju's algorithm for strongly connected components.

    Warning: this module is unstable and part of compiler-libs.

    module type S = sig ... end
    module Make (Id : Identifiable.S) : S with module Id := Id
    diff --git a/ocaml/Strongly_connected_components/module-type-S/Id/Map/index.html b/ocaml/Strongly_connected_components/module-type-S/Id/Map/index.html new file mode 100644 index 0000000..e840884 --- /dev/null +++ b/ocaml/Strongly_connected_components/module-type-S/Id/Map/index.html @@ -0,0 +1,17 @@ + +Map (ocaml.Strongly_connected_components.S.Id.Map)

    Module Id.Map

    include Map.S with type key = T.t and type 'a t = 'a Map.Make(T).t

    Maps

    type key = T.t

    The type of the map keys.

    type 'a t = 'a Stdlib.Map.Make(T).t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key -> 'a -> 'a t -> 'a t

    add key data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key -> 'a -> 'a list t -> 'a list t

    add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

    update key f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : (key -> bool) -> 'a t -> key * 'a

    find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : (key -> bool) -> 'a t -> key * 'a

    find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : (key -> 'a -> unit) -> 'a t -> unit

    iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

    fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : (key -> 'a -> bool) -> 'a t -> 'a t

    filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : (key -> 'a -> bool) -> 'a t -> bool

    for_all f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : (key -> 'a -> bool) -> 'a t -> bool

    exists f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Stdlib.Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Stdlib.Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    val of_list : (key * 'a) list -> 'a t
    val disjoint_union : + ?eq:('a -> 'a -> bool) -> + ?print:(Stdlib.Format.formatter -> 'a -> unit) -> + 'a t -> + 'a t -> + 'a t

    disjoint_union m1 m2 contains all bindings from m1 and m2. If some binding is present in both and the associated value is not equal, a Fatal_error is raised

    val union_right : 'a t -> 'a t -> 'a t

    union_right m1 m2 contains all bindings from m1 and m2. If some binding is present in both, the one from m2 is taken

    val union_left : 'a t -> 'a t -> 'a t

    union_left m1 m2 = union_right m2 m1

    val union_merge : ('a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
    val rename : key t -> key -> key
    val map_keys : (key -> key) -> 'a t -> 'a t
    val keys : 'a t -> Stdlib.Set.Make(T).t
    val data : 'a t -> 'a list
    val of_set : (key -> 'a) -> Stdlib.Set.Make(T).t -> 'a t
    val transpose_keys_and_data : key t -> key t
    val transpose_keys_and_data_set : key t -> Stdlib.Set.Make(T).t t
    val print : + (Stdlib.Format.formatter -> 'a -> unit) -> + Stdlib.Format.formatter -> + 'a t -> + unit
    diff --git a/ocaml/Strongly_connected_components/module-type-S/Id/Set/index.html b/ocaml/Strongly_connected_components/module-type-S/Id/Set/index.html new file mode 100644 index 0000000..17dfde4 --- /dev/null +++ b/ocaml/Strongly_connected_components/module-type-S/Id/Set/index.html @@ -0,0 +1,2 @@ + +Set (ocaml.Strongly_connected_components.S.Id.Set)

    Module Id.Set

    include Set.S with type elt = T.t and type t = Set.Make(T).t

    Sets

    type elt = T.t

    The type of the set elements.

    The type of sets.

    val empty : t

    The empty set.

    val add : elt -> t -> t

    add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val singleton : elt -> t

    singleton x returns the one-element set containing only x.

    val remove : elt -> t -> t

    remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val union : t -> t -> t

    Set union.

    val inter : t -> t -> t

    Set intersection.

    val disjoint : t -> t -> bool

    Test if two sets are disjoint.

    • since 4.08
    val diff : t -> t -> t

    Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

    val cardinal : t -> int

    Return the number of elements of a set.

    Elements

    val elements : t -> elt list

    Return the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Set.Make.

    val min_elt : t -> elt

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

    val min_elt_opt : t -> elt option

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

    • since 4.05
    val max_elt : t -> elt

    Same as min_elt, but returns the largest element of the given set.

    val max_elt_opt : t -> elt option

    Same as min_elt_opt, but returns the largest element of the given set.

    • since 4.05
    val choose : t -> elt

    Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    val choose_opt : t -> elt option

    Return one element of the given set, or None if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    • since 4.05

    Searching

    val find : elt -> t -> elt

    find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

    • since 4.01
    val find_opt : elt -> t -> elt option

    find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

    • since 4.05
    val find_first : (elt -> bool) -> t -> elt

    find_first f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

    For example, find_first (fun e -> Ord.compare e x >= 0) s will return the first element e of s where Ord.compare e x >= 0 (intuitively: e >= x), or raise Not_found if x is greater than any element of s.

    • since 4.05
    val find_first_opt : (elt -> bool) -> t -> elt option

    find_first_opt f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

    • since 4.05
    val find_last : (elt -> bool) -> t -> elt

    find_last f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

    • since 4.05
    val find_last_opt : (elt -> bool) -> t -> elt option

    find_last_opt f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

    • since 4.05

    Traversing

    val iter : (elt -> unit) -> t -> unit

    iter f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.

    val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc

    fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

    Transforming

    val filter : (elt -> bool) -> t -> t

    filter f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val filter_map : (elt -> elt option) -> t -> t

    filter_map f s returns the set of all v such that f x = Some v for some element x of s.

    For example,

    filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) s

    is the set of halves of the even elements of s.

    If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned unchanged: the result of the function is then physically equal to s.

    • since 4.11
    val partition : (elt -> bool) -> t -> t * t

    partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

    val split : elt -> t -> t * bool * t

    split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.

    Predicates and comparisons

    val is_empty : t -> bool

    Test whether a set is empty or not.

    val mem : elt -> t -> bool

    mem x s tests whether x belongs to the set s.

    val equal : t -> t -> bool

    equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

    val compare : t -> t -> int

    Total ordering between sets. Can be used as the ordering function for doing sets of sets.

    val subset : t -> t -> bool

    subset s1 s2 tests whether the set s1 is a subset of the set s2.

    val for_all : (elt -> bool) -> t -> bool

    for_all f s checks if all elements of the set satisfy the predicate f.

    val exists : (elt -> bool) -> t -> bool

    exists f s checks if at least one element of the set satisfies the predicate f.

    Converting

    val to_list : t -> elt list

    to_list s is elements s.

    • since 5.1
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t

    to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

    • since 4.07
    val to_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in ascending order

    • since 4.07
    val to_rev_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in descending order

    • since 4.12
    val add_seq : elt Stdlib.Seq.t -> t -> t

    Add the given elements to the set, in order.

    • since 4.07
    val of_seq : elt Stdlib.Seq.t -> t

    Build a set from the given bindings

    • since 4.07
    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    val to_string : t -> string
    val of_list : elt list -> t
    val map : (elt -> elt) -> t -> t
    diff --git a/ocaml/Strongly_connected_components/module-type-S/Id/T/index.html b/ocaml/Strongly_connected_components/module-type-S/Id/T/index.html new file mode 100644 index 0000000..e7d0c06 --- /dev/null +++ b/ocaml/Strongly_connected_components/module-type-S/Id/T/index.html @@ -0,0 +1,2 @@ + +T (ocaml.Strongly_connected_components.S.Id.T)

    Module Id.T

    type t = t
    include Hashtbl.HashedType with type t := t
    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val hash : t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := t
    val compare : t -> t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    diff --git a/ocaml/Strongly_connected_components/module-type-S/Id/Tbl/index.html b/ocaml/Strongly_connected_components/module-type-S/Id/Tbl/index.html new file mode 100644 index 0000000..07b084c --- /dev/null +++ b/ocaml/Strongly_connected_components/module-type-S/Id/Tbl/index.html @@ -0,0 +1,2 @@ + +Tbl (ocaml.Strongly_connected_components.S.Id.Tbl)

    Module Id.Tbl

    include Hashtbl.S with type key = T.t and type 'a t = 'a Hashtbl.Make(T).t
    type key = T.t
    val create : int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    • since 4.00
    val copy : 'a t -> 'a t
    val add : 'a t -> key -> 'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    • since 4.05
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key -> 'a -> unit
    val mem : 'a t -> key -> bool
    val iter : (key -> 'a -> unit) -> 'a t -> unit
    val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
    • since 4.03
    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc
    val length : 'a t -> int
    val stats : 'a t -> Stdlib.Hashtbl.statistics
    • since 4.00
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
    • since 4.07
    val to_seq_keys : _ t -> key Stdlib.Seq.t
    • since 4.07
    val to_seq_values : 'a t -> 'a Stdlib.Seq.t
    • since 4.07
    val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
    • since 4.07
    val to_list : 'a t -> (T.t * 'a) list
    val of_list : (T.t * 'a) list -> 'a t
    val to_map : 'a t -> 'a Stdlib.Map.Make(T).t
    val of_map : 'a Stdlib.Map.Make(T).t -> 'a t
    val memoize : 'a t -> (key -> 'a) -> key -> 'a
    val map : 'a t -> ('a -> 'b) -> 'b t
    diff --git a/ocaml/Strongly_connected_components/module-type-S/Id/index.html b/ocaml/Strongly_connected_components/module-type-S/Id/index.html new file mode 100644 index 0000000..d51a0ea --- /dev/null +++ b/ocaml/Strongly_connected_components/module-type-S/Id/index.html @@ -0,0 +1,2 @@ + +Id (ocaml.Strongly_connected_components.S.Id)

    Module S.Id

    type t
    module T : Identifiable.Thing with type t = t
    include Identifiable.Thing with type t := T.t
    include Hashtbl.HashedType with type t := T.t
    val equal : T.t -> T.t -> bool

    The equality predicate used to compare keys.

    val hash : T.t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := T.t
    val compare : T.t -> T.t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> T.t -> unit
    val print : Stdlib.Format.formatter -> T.t -> unit
    module Set : Identifiable.Set with module T := T
    module Map : Identifiable.Map with module T := T
    module Tbl : Identifiable.Tbl with module T := T
    diff --git a/ocaml/Strongly_connected_components/module-type-S/index.html b/ocaml/Strongly_connected_components/module-type-S/index.html new file mode 100644 index 0000000..35f103c --- /dev/null +++ b/ocaml/Strongly_connected_components/module-type-S/index.html @@ -0,0 +1,4 @@ + +S (ocaml.Strongly_connected_components.S)

    Module type Strongly_connected_components.S

    type directed_graph = Id.Set.t Id.Map.t

    If (a -> set) belongs to the map, it means that there are edges from a to every element of set. It is assumed that no edge points to a vertex not represented in the map.

    type component =
    1. | Has_loop of Id.t list
    2. | No_loop of Id.t
    val connected_components_sorted_from_roots_to_leaf : + directed_graph -> + component array
    val component_graph : directed_graph -> (component * int list) array
    diff --git a/ocaml/Stypes/index.html b/ocaml/Stypes/index.html new file mode 100644 index 0000000..c2ba509 --- /dev/null +++ b/ocaml/Stypes/index.html @@ -0,0 +1,3 @@ + +Stypes (ocaml.Stypes)

    Module Stypes

    type annotation =
    1. | Ti_pat : 'k Typedtree.pattern_category + * 'k Typedtree.general_pattern -> annotation
    2. | Ti_expr of Typedtree.expression
    3. | Ti_class of Typedtree.class_expr
    4. | Ti_mod of Typedtree.module_expr
    5. | An_call of Location.t * Annot.call
    6. | An_ident of Location.t * string * Annot.ident
    val record : annotation -> unit
    val record_phrase : Location.t -> unit
    val dump : string option -> unit
    val get_location : annotation -> Location.t
    val get_info : unit -> annotation list
    diff --git a/ocaml/Subst/Lazy/index.html b/ocaml/Subst/Lazy/index.html new file mode 100644 index 0000000..2da9093 --- /dev/null +++ b/ocaml/Subst/Lazy/index.html @@ -0,0 +1,18 @@ + +Lazy (ocaml.Subst.Lazy)

    Module Subst.Lazy

    type module_decl = {
    1. mdl_type : modtype;
    2. mdl_attributes : Parsetree.attributes;
    3. mdl_loc : Location.t;
    4. mdl_uid : Types.Uid.t;
    }
    and modtype =
    1. | MtyL_ident of Path.t
    2. | MtyL_signature of signature
    3. | MtyL_functor of functor_parameter * modtype
    4. | MtyL_alias of Path.t
    and modtype_declaration = {
    1. mtdl_type : modtype option;
    2. mtdl_attributes : Parsetree.attributes;
    3. mtdl_loc : Location.t;
    4. mtdl_uid : Types.Uid.t;
    }
    and signature
    and functor_parameter =
    1. | Unit
    2. | Named of Ident.t option * modtype
    val of_module_decl : Types.module_declaration -> module_decl
    val of_modtype : Types.module_type -> modtype
    val of_signature : Types.signature -> signature
    val of_signature_items : signature_item list -> signature
    val of_signature_item : Types.signature_item -> signature_item
    val module_decl : scoping -> t -> module_decl -> module_decl
    val modtype : scoping -> t -> modtype -> modtype
    val modtype_decl : scoping -> t -> modtype_declaration -> modtype_declaration
    val signature : scoping -> t -> signature -> signature
    val signature_item : scoping -> t -> signature_item -> signature_item
    val force_module_decl : module_decl -> Types.module_declaration
    val force_modtype : modtype -> Types.module_type
    val force_signature : signature -> Types.signature
    val force_signature_once : signature -> signature_item list
    val force_signature_item : signature_item -> Types.signature_item
    diff --git a/ocaml/Subst/index.html b/ocaml/Subst/index.html new file mode 100644 index 0000000..961e693 --- /dev/null +++ b/ocaml/Subst/index.html @@ -0,0 +1,25 @@ + +Subst (ocaml.Subst)

    Module Subst

    type t
    val identity : t
    val add_type : Ident.t -> Path.t -> t -> t
    val add_type_path : Path.t -> Path.t -> t -> t
    val add_type_function : + Path.t -> + params:Types.type_expr list -> + body:Types.type_expr -> + t -> + t
    val add_module : Ident.t -> Path.t -> t -> t
    val add_module_path : Path.t -> Path.t -> t -> t
    val add_modtype : Ident.t -> Types.module_type -> t -> t
    val add_modtype_path : Path.t -> Types.module_type -> t -> t
    val for_saving : t -> t
    val reset_for_saving : unit -> unit
    val change_locs : t -> Location.t -> t
    val module_path : t -> Path.t -> Path.t
    val type_path : t -> Path.t -> Path.t
    val modtype_path : t -> Path.t -> Path.t
    val type_expr : t -> Types.type_expr -> Types.type_expr
    val class_type : t -> Types.class_type -> Types.class_type
    val value_description : t -> Types.value_description -> Types.value_description
    val type_declaration : t -> Types.type_declaration -> Types.type_declaration
    val extension_constructor : + t -> + Types.extension_constructor -> + Types.extension_constructor
    val class_declaration : t -> Types.class_declaration -> Types.class_declaration
    val cltype_declaration : + t -> + Types.class_type_declaration -> + Types.class_type_declaration
    type scoping =
    1. | Keep
    2. | Make_local
    3. | Rescope of int
    val signature : scoping -> t -> Types.signature -> Types.signature
    val signature_item : + scoping -> + t -> + Types.signature_item -> + Types.signature_item
    val modtype_declaration : + scoping -> + t -> + Types.modtype_declaration -> + Types.modtype_declaration
    val module_declaration : + scoping -> + t -> + Types.module_declaration -> + Types.module_declaration
    val compose : t -> t -> t
    module Lazy : sig ... end
    diff --git a/ocaml/Switch/CtxStore/argument-1-A/index.html b/ocaml/Switch/CtxStore/argument-1-A/index.html new file mode 100644 index 0000000..1e3f79f --- /dev/null +++ b/ocaml/Switch/CtxStore/argument-1-A/index.html @@ -0,0 +1,2 @@ + +A (ocaml.Switch.CtxStore.A)

    Parameter CtxStore.A

    include Stored
    type t
    type key
    val compare_key : key -> key -> int
    type context
    val make_key : context -> t -> key option
    diff --git a/ocaml/Switch/CtxStore/index.html b/ocaml/Switch/CtxStore/index.html new file mode 100644 index 0000000..6af156a --- /dev/null +++ b/ocaml/Switch/CtxStore/index.html @@ -0,0 +1,2 @@ + +CtxStore (ocaml.Switch.CtxStore)

    Module Switch.CtxStore

    Parameters

    module A : CtxStored

    Signature

    val mk_store : unit -> (A.t, A.context) t_store
    diff --git a/ocaml/Switch/Make/argument-1-Arg/index.html b/ocaml/Switch/Make/argument-1-Arg/index.html new file mode 100644 index 0000000..4d9db2f --- /dev/null +++ b/ocaml/Switch/Make/argument-1-Arg/index.html @@ -0,0 +1,2 @@ + +Arg (ocaml.Switch.Make.Arg)

    Parameter Make.Arg

    type primitive
    val eqint : primitive
    val neint : primitive
    val leint : primitive
    val ltint : primitive
    val geint : primitive
    val gtint : primitive
    type loc
    type arg
    type test
    type act
    val bind : arg -> (arg -> act) -> act
    val make_const : int -> arg
    val make_offset : arg -> int -> arg
    val make_prim : primitive -> arg list -> test
    val make_isout : arg -> arg -> test
    val make_isin : arg -> arg -> test
    val make_is_nonzero : arg -> test
    val arg_as_test : arg -> test
    val make_if : test -> act -> act -> act
    val make_switch : loc -> arg -> int array -> act array -> act
    val make_catch : act -> int * (act -> act)
    val make_exit : int -> act
    diff --git a/ocaml/Switch/Make/index.html b/ocaml/Switch/Make/index.html new file mode 100644 index 0000000..420cd28 --- /dev/null +++ b/ocaml/Switch/Make/index.html @@ -0,0 +1,12 @@ + +Make (ocaml.Switch.Make)

    Module Switch.Make

    Parameters

    module Arg : S

    Signature

    val zyva : + Arg.loc -> + (int * int) -> + Arg.arg -> + (int * int * int) array -> + (Arg.act, _) t_store -> + Arg.act
    val test_sequence : + Arg.arg -> + (int * int * int) array -> + (Arg.act, _) t_store -> + Arg.act
    diff --git a/ocaml/Switch/Store/argument-1-A/index.html b/ocaml/Switch/Store/argument-1-A/index.html new file mode 100644 index 0000000..65cabf1 --- /dev/null +++ b/ocaml/Switch/Store/argument-1-A/index.html @@ -0,0 +1,2 @@ + +A (ocaml.Switch.Store.A)

    Parameter Store.A

    type t
    type key
    val compare_key : key -> key -> int
    val make_key : t -> key option
    diff --git a/ocaml/Switch/Store/index.html b/ocaml/Switch/Store/index.html new file mode 100644 index 0000000..7893746 --- /dev/null +++ b/ocaml/Switch/Store/index.html @@ -0,0 +1,2 @@ + +Store (ocaml.Switch.Store)

    Module Switch.Store

    Parameters

    module A : Stored

    Signature

    val mk_store : unit -> (A.t, unit) t_store
    diff --git a/ocaml/Switch/index.html b/ocaml/Switch/index.html new file mode 100644 index 0000000..1b40809 --- /dev/null +++ b/ocaml/Switch/index.html @@ -0,0 +1,2 @@ + +Switch (ocaml.Switch)

    Module Switch

    type 'a shared =
    1. | Shared of 'a
    2. | Single of 'a
    type ('a, 'ctx) t_store = {
    1. act_get : unit -> 'a array;
    2. act_get_shared : unit -> 'a shared array;
    3. act_store : 'ctx -> 'a -> int;
    4. act_store_shared : 'ctx -> 'a -> int;
    }
    module type Stored = sig ... end
    module type CtxStored = sig ... end
    module CtxStore (A : CtxStored) : sig ... end
    module Store (A : Stored) : sig ... end
    module type S = sig ... end
    module Make (Arg : S) : sig ... end
    diff --git a/ocaml/Switch/module-type-CtxStored/index.html b/ocaml/Switch/module-type-CtxStored/index.html new file mode 100644 index 0000000..76c7e18 --- /dev/null +++ b/ocaml/Switch/module-type-CtxStored/index.html @@ -0,0 +1,2 @@ + +CtxStored (ocaml.Switch.CtxStored)

    Module type Switch.CtxStored

    include Stored
    type t
    type key
    val compare_key : key -> key -> int
    type context
    val make_key : context -> t -> key option
    diff --git a/ocaml/Switch/module-type-S/index.html b/ocaml/Switch/module-type-S/index.html new file mode 100644 index 0000000..cafc567 --- /dev/null +++ b/ocaml/Switch/module-type-S/index.html @@ -0,0 +1,2 @@ + +S (ocaml.Switch.S)

    Module type Switch.S

    type primitive
    val eqint : primitive
    val neint : primitive
    val leint : primitive
    val ltint : primitive
    val geint : primitive
    val gtint : primitive
    type loc
    type arg
    type test
    type act
    val bind : arg -> (arg -> act) -> act
    val make_const : int -> arg
    val make_offset : arg -> int -> arg
    val make_prim : primitive -> arg list -> test
    val make_isout : arg -> arg -> test
    val make_isin : arg -> arg -> test
    val make_is_nonzero : arg -> test
    val arg_as_test : arg -> test
    val make_if : test -> act -> act -> act
    val make_switch : loc -> arg -> int array -> act array -> act
    val make_catch : act -> int * (act -> act)
    val make_exit : int -> act
    diff --git a/ocaml/Switch/module-type-Stored/index.html b/ocaml/Switch/module-type-Stored/index.html new file mode 100644 index 0000000..5b58d68 --- /dev/null +++ b/ocaml/Switch/module-type-Stored/index.html @@ -0,0 +1,2 @@ + +Stored (ocaml.Switch.Stored)

    Module type Switch.Stored

    type t
    type key
    val compare_key : key -> key -> int
    val make_key : t -> key option
    diff --git a/ocaml/Symbol/Map/index.html b/ocaml/Symbol/Map/index.html new file mode 100644 index 0000000..b8ead14 --- /dev/null +++ b/ocaml/Symbol/Map/index.html @@ -0,0 +1,17 @@ + +Map (ocaml.Symbol.Map)

    Module Symbol.Map

    include Map.S with type key = T.t and type 'a t = 'a Map.Make(T).t

    Maps

    type key = T.t

    The type of the map keys.

    type 'a t = 'a Stdlib.Map.Make(T).t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key -> 'a -> 'a t -> 'a t

    add key data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key -> 'a -> 'a list t -> 'a list t

    add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

    update key f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : (key -> bool) -> 'a t -> key * 'a

    find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : (key -> bool) -> 'a t -> key * 'a

    find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : (key -> 'a -> unit) -> 'a t -> unit

    iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

    fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : (key -> 'a -> bool) -> 'a t -> 'a t

    filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : (key -> 'a -> bool) -> 'a t -> bool

    for_all f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : (key -> 'a -> bool) -> 'a t -> bool

    exists f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Stdlib.Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Stdlib.Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    val of_list : (key * 'a) list -> 'a t
    val disjoint_union : + ?eq:('a -> 'a -> bool) -> + ?print:(Stdlib.Format.formatter -> 'a -> unit) -> + 'a t -> + 'a t -> + 'a t

    disjoint_union m1 m2 contains all bindings from m1 and m2. If some binding is present in both and the associated value is not equal, a Fatal_error is raised

    val union_right : 'a t -> 'a t -> 'a t

    union_right m1 m2 contains all bindings from m1 and m2. If some binding is present in both, the one from m2 is taken

    val union_left : 'a t -> 'a t -> 'a t

    union_left m1 m2 = union_right m2 m1

    val union_merge : ('a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
    val rename : key t -> key -> key
    val map_keys : (key -> key) -> 'a t -> 'a t
    val keys : 'a t -> Stdlib.Set.Make(T).t
    val data : 'a t -> 'a list
    val of_set : (key -> 'a) -> Stdlib.Set.Make(T).t -> 'a t
    val transpose_keys_and_data : key t -> key t
    val transpose_keys_and_data_set : key t -> Stdlib.Set.Make(T).t t
    val print : + (Stdlib.Format.formatter -> 'a -> unit) -> + Stdlib.Format.formatter -> + 'a t -> + unit
    diff --git a/ocaml/Symbol/Set/index.html b/ocaml/Symbol/Set/index.html new file mode 100644 index 0000000..b51d1e8 --- /dev/null +++ b/ocaml/Symbol/Set/index.html @@ -0,0 +1,2 @@ + +Set (ocaml.Symbol.Set)

    Module Symbol.Set

    include Set.S with type elt = T.t and type t = Set.Make(T).t

    Sets

    type elt = T.t

    The type of the set elements.

    The type of sets.

    val empty : t

    The empty set.

    val add : elt -> t -> t

    add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val singleton : elt -> t

    singleton x returns the one-element set containing only x.

    val remove : elt -> t -> t

    remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val union : t -> t -> t

    Set union.

    val inter : t -> t -> t

    Set intersection.

    val disjoint : t -> t -> bool

    Test if two sets are disjoint.

    • since 4.08
    val diff : t -> t -> t

    Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

    val cardinal : t -> int

    Return the number of elements of a set.

    Elements

    val elements : t -> elt list

    Return the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Set.Make.

    val min_elt : t -> elt

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

    val min_elt_opt : t -> elt option

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

    • since 4.05
    val max_elt : t -> elt

    Same as min_elt, but returns the largest element of the given set.

    val max_elt_opt : t -> elt option

    Same as min_elt_opt, but returns the largest element of the given set.

    • since 4.05
    val choose : t -> elt

    Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    val choose_opt : t -> elt option

    Return one element of the given set, or None if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    • since 4.05

    Searching

    val find : elt -> t -> elt

    find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

    • since 4.01
    val find_opt : elt -> t -> elt option

    find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

    • since 4.05
    val find_first : (elt -> bool) -> t -> elt

    find_first f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

    For example, find_first (fun e -> Ord.compare e x >= 0) s will return the first element e of s where Ord.compare e x >= 0 (intuitively: e >= x), or raise Not_found if x is greater than any element of s.

    • since 4.05
    val find_first_opt : (elt -> bool) -> t -> elt option

    find_first_opt f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

    • since 4.05
    val find_last : (elt -> bool) -> t -> elt

    find_last f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

    • since 4.05
    val find_last_opt : (elt -> bool) -> t -> elt option

    find_last_opt f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

    • since 4.05

    Traversing

    val iter : (elt -> unit) -> t -> unit

    iter f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.

    val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc

    fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

    Transforming

    val filter : (elt -> bool) -> t -> t

    filter f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val filter_map : (elt -> elt option) -> t -> t

    filter_map f s returns the set of all v such that f x = Some v for some element x of s.

    For example,

    filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) s

    is the set of halves of the even elements of s.

    If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned unchanged: the result of the function is then physically equal to s.

    • since 4.11
    val partition : (elt -> bool) -> t -> t * t

    partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

    val split : elt -> t -> t * bool * t

    split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.

    Predicates and comparisons

    val is_empty : t -> bool

    Test whether a set is empty or not.

    val mem : elt -> t -> bool

    mem x s tests whether x belongs to the set s.

    val equal : t -> t -> bool

    equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

    val compare : t -> t -> int

    Total ordering between sets. Can be used as the ordering function for doing sets of sets.

    val subset : t -> t -> bool

    subset s1 s2 tests whether the set s1 is a subset of the set s2.

    val for_all : (elt -> bool) -> t -> bool

    for_all f s checks if all elements of the set satisfy the predicate f.

    val exists : (elt -> bool) -> t -> bool

    exists f s checks if at least one element of the set satisfies the predicate f.

    Converting

    val to_list : t -> elt list

    to_list s is elements s.

    • since 5.1
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t

    to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

    • since 4.07
    val to_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in ascending order

    • since 4.07
    val to_rev_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in descending order

    • since 4.12
    val add_seq : elt Stdlib.Seq.t -> t -> t

    Add the given elements to the set, in order.

    • since 4.07
    val of_seq : elt Stdlib.Seq.t -> t

    Build a set from the given bindings

    • since 4.07
    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    val to_string : t -> string
    val of_list : elt list -> t
    val map : (elt -> elt) -> t -> t
    diff --git a/ocaml/Symbol/T/index.html b/ocaml/Symbol/T/index.html new file mode 100644 index 0000000..98e287b --- /dev/null +++ b/ocaml/Symbol/T/index.html @@ -0,0 +1,2 @@ + +T (ocaml.Symbol.T)

    Module Symbol.T

    type t = t
    include Hashtbl.HashedType with type t := t
    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val hash : t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := t
    val compare : t -> t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    diff --git a/ocaml/Symbol/Tbl/index.html b/ocaml/Symbol/Tbl/index.html new file mode 100644 index 0000000..e740c06 --- /dev/null +++ b/ocaml/Symbol/Tbl/index.html @@ -0,0 +1,2 @@ + +Tbl (ocaml.Symbol.Tbl)

    Module Symbol.Tbl

    include Hashtbl.S with type key = T.t and type 'a t = 'a Hashtbl.Make(T).t
    type key = T.t
    val create : int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    • since 4.00
    val copy : 'a t -> 'a t
    val add : 'a t -> key -> 'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    • since 4.05
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key -> 'a -> unit
    val mem : 'a t -> key -> bool
    val iter : (key -> 'a -> unit) -> 'a t -> unit
    val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
    • since 4.03
    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc
    val length : 'a t -> int
    val stats : 'a t -> Stdlib.Hashtbl.statistics
    • since 4.00
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
    • since 4.07
    val to_seq_keys : _ t -> key Stdlib.Seq.t
    • since 4.07
    val to_seq_values : 'a t -> 'a Stdlib.Seq.t
    • since 4.07
    val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
    • since 4.07
    val to_list : 'a t -> (T.t * 'a) list
    val of_list : (T.t * 'a) list -> 'a t
    val to_map : 'a t -> 'a Stdlib.Map.Make(T).t
    val of_map : 'a Stdlib.Map.Make(T).t -> 'a t
    val memoize : 'a t -> (key -> 'a) -> key -> 'a
    val map : 'a t -> ('a -> 'b) -> 'b t
    diff --git a/ocaml/Symbol/index.html b/ocaml/Symbol/index.html new file mode 100644 index 0000000..4459c7e --- /dev/null +++ b/ocaml/Symbol/index.html @@ -0,0 +1,2 @@ + +Symbol (ocaml.Symbol)

    Module Symbol

    A symbol identifies a constant provided by either:

    • another compilation unit; or
    • a top-level module.

    * sym_unit is the compilation unit containing the value. * sym_label is the linkage name of the variable.

    The label must be globally unique: two compilation units linked in the same program must not share labels.

    include Identifiable.S
    type t
    module T : Identifiable.Thing with type t = t
    include Identifiable.Thing with type t := T.t
    include Hashtbl.HashedType with type t := T.t
    val equal : T.t -> T.t -> bool

    The equality predicate used to compare keys.

    val hash : T.t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := T.t
    val compare : T.t -> T.t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> T.t -> unit
    val print : Stdlib.Format.formatter -> T.t -> unit
    module Set : Identifiable.Set with module T := T
    module Map : Identifiable.Map with module T := T
    module Tbl : Identifiable.Tbl with module T := T
    val of_variable : Variable.t -> t
    val of_global_linkage : Compilation_unit.t -> Linkage_name.t -> t
    val import_for_pack : pack:Compilation_unit.t -> t -> t
    val compilation_unit : t -> Compilation_unit.t
    val label : t -> Linkage_name.t
    val print_opt : Stdlib.Format.formatter -> t option -> unit
    val compare_lists : t list -> t list -> int
    diff --git a/ocaml/Symtable/Compunit/Map/index.html b/ocaml/Symtable/Compunit/Map/index.html new file mode 100644 index 0000000..63e3362 --- /dev/null +++ b/ocaml/Symtable/Compunit/Map/index.html @@ -0,0 +1,8 @@ + +Map (ocaml.Symtable.Compunit.Map)

    Module Compunit.Map

    Maps

    type key = t

    The type of the map keys.

    type !+'a t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key -> 'a -> 'a t -> 'a t

    add key data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key -> 'a -> 'a list t -> 'a list t

    add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

    update key f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : (key -> bool) -> 'a t -> key * 'a

    find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : (key -> bool) -> 'a t -> key * 'a

    find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : (key -> 'a -> unit) -> 'a t -> unit

    iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

    fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : (key -> 'a -> bool) -> 'a t -> 'a t

    filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : (key -> 'a -> bool) -> 'a t -> bool

    for_all f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : (key -> 'a -> bool) -> 'a t -> bool

    exists f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val of_list : (key * 'a) list -> 'a t

    of_list bs adds the bindings of bs to the empty map, in list order (if a key is bound twice in bs the last one takes over).

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    diff --git a/ocaml/Symtable/Compunit/Set/index.html b/ocaml/Symtable/Compunit/Set/index.html new file mode 100644 index 0000000..ea3ad1d --- /dev/null +++ b/ocaml/Symtable/Compunit/Set/index.html @@ -0,0 +1,2 @@ + +Set (ocaml.Symtable.Compunit.Set)

    Module Compunit.Set

    Sets

    type elt = t

    The type of the set elements.

    type t

    The type of sets.

    val empty : t

    The empty set.

    val add : elt -> t -> t

    add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val singleton : elt -> t

    singleton x returns the one-element set containing only x.

    val remove : elt -> t -> t

    remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val union : t -> t -> t

    Set union.

    val inter : t -> t -> t

    Set intersection.

    val disjoint : t -> t -> bool

    Test if two sets are disjoint.

    • since 4.08
    val diff : t -> t -> t

    Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

    val cardinal : t -> int

    Return the number of elements of a set.

    Elements

    val elements : t -> elt list

    Return the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Set.Make.

    val min_elt : t -> elt

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

    val min_elt_opt : t -> elt option

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

    • since 4.05
    val max_elt : t -> elt

    Same as min_elt, but returns the largest element of the given set.

    val max_elt_opt : t -> elt option

    Same as min_elt_opt, but returns the largest element of the given set.

    • since 4.05
    val choose : t -> elt

    Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    val choose_opt : t -> elt option

    Return one element of the given set, or None if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    • since 4.05

    Searching

    val find : elt -> t -> elt

    find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

    • since 4.01
    val find_opt : elt -> t -> elt option

    find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

    • since 4.05
    val find_first : (elt -> bool) -> t -> elt

    find_first f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

    For example, find_first (fun e -> Ord.compare e x >= 0) s will return the first element e of s where Ord.compare e x >= 0 (intuitively: e >= x), or raise Not_found if x is greater than any element of s.

    • since 4.05
    val find_first_opt : (elt -> bool) -> t -> elt option

    find_first_opt f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

    • since 4.05
    val find_last : (elt -> bool) -> t -> elt

    find_last f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

    • since 4.05
    val find_last_opt : (elt -> bool) -> t -> elt option

    find_last_opt f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

    • since 4.05

    Traversing

    val iter : (elt -> unit) -> t -> unit

    iter f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.

    val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc

    fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

    Transforming

    val map : (elt -> elt) -> t -> t

    map f s is the set whose elements are f a0,f a1... f aN, where a0,a1...aN are the elements of s.

    The elements are passed to f in increasing order with respect to the ordering over the type of the elements.

    If no element of s is changed by f, s is returned unchanged. (If each output of f is physically equal to its input, the returned set is physically equal to s.)

    • since 4.04
    val filter : (elt -> bool) -> t -> t

    filter f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val filter_map : (elt -> elt option) -> t -> t

    filter_map f s returns the set of all v such that f x = Some v for some element x of s.

    For example,

    filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) s

    is the set of halves of the even elements of s.

    If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned unchanged: the result of the function is then physically equal to s.

    • since 4.11
    val partition : (elt -> bool) -> t -> t * t

    partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

    val split : elt -> t -> t * bool * t

    split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.

    Predicates and comparisons

    val is_empty : t -> bool

    Test whether a set is empty or not.

    val mem : elt -> t -> bool

    mem x s tests whether x belongs to the set s.

    val equal : t -> t -> bool

    equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

    val compare : t -> t -> int

    Total ordering between sets. Can be used as the ordering function for doing sets of sets.

    val subset : t -> t -> bool

    subset s1 s2 tests whether the set s1 is a subset of the set s2.

    val for_all : (elt -> bool) -> t -> bool

    for_all f s checks if all elements of the set satisfy the predicate f.

    val exists : (elt -> bool) -> t -> bool

    exists f s checks if at least one element of the set satisfies the predicate f.

    Converting

    val to_list : t -> elt list

    to_list s is elements s.

    • since 5.1
    val of_list : elt list -> t

    of_list l creates a set from a list of elements. This is usually more efficient than folding add over the list, except perhaps for lists with many duplicated elements.

    • since 4.02
    val to_seq_from : elt -> t -> elt Seq.t

    to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

    • since 4.07
    val to_seq : t -> elt Seq.t

    Iterate on the whole set, in ascending order

    • since 4.07
    val to_rev_seq : t -> elt Seq.t

    Iterate on the whole set, in descending order

    • since 4.12
    val add_seq : elt Seq.t -> t -> t

    Add the given elements to the set, in order.

    • since 4.07
    val of_seq : elt Seq.t -> t

    Build a set from the given bindings

    • since 4.07
    diff --git a/ocaml/Symtable/Compunit/index.html b/ocaml/Symtable/Compunit/index.html new file mode 100644 index 0000000..5261826 --- /dev/null +++ b/ocaml/Symtable/Compunit/index.html @@ -0,0 +1,2 @@ + +Compunit (ocaml.Symtable.Compunit)

    Module Symtable.Compunit

    val name : t -> string
    val is_packed : Cmo_format.compunit -> bool
    val to_ident : Cmo_format.compunit -> Ident.t
    module Set : Set.S with type elt = t
    module Map : Map.S with type key = t
    diff --git a/ocaml/Symtable/Global/Map/index.html b/ocaml/Symtable/Global/Map/index.html new file mode 100644 index 0000000..2f0abde --- /dev/null +++ b/ocaml/Symtable/Global/Map/index.html @@ -0,0 +1,8 @@ + +Map (ocaml.Symtable.Global.Map)

    Module Global.Map

    Maps

    type key = t

    The type of the map keys.

    type !+'a t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key -> 'a -> 'a t -> 'a t

    add key data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key -> 'a -> 'a list t -> 'a list t

    add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

    update key f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : (key -> bool) -> 'a t -> key * 'a

    find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : (key -> bool) -> 'a t -> key * 'a

    find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : (key -> 'a -> unit) -> 'a t -> unit

    iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

    fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : (key -> 'a -> bool) -> 'a t -> 'a t

    filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : (key -> 'a -> bool) -> 'a t -> bool

    for_all f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : (key -> 'a -> bool) -> 'a t -> bool

    exists f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val of_list : (key * 'a) list -> 'a t

    of_list bs adds the bindings of bs to the empty map, in list order (if a key is bound twice in bs the last one takes over).

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    diff --git a/ocaml/Symtable/Global/Set/index.html b/ocaml/Symtable/Global/Set/index.html new file mode 100644 index 0000000..d82345b --- /dev/null +++ b/ocaml/Symtable/Global/Set/index.html @@ -0,0 +1,2 @@ + +Set (ocaml.Symtable.Global.Set)

    Module Global.Set

    Sets

    type elt = t

    The type of the set elements.

    type t

    The type of sets.

    val empty : t

    The empty set.

    val add : elt -> t -> t

    add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val singleton : elt -> t

    singleton x returns the one-element set containing only x.

    val remove : elt -> t -> t

    remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val union : t -> t -> t

    Set union.

    val inter : t -> t -> t

    Set intersection.

    val disjoint : t -> t -> bool

    Test if two sets are disjoint.

    • since 4.08
    val diff : t -> t -> t

    Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

    val cardinal : t -> int

    Return the number of elements of a set.

    Elements

    val elements : t -> elt list

    Return the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Set.Make.

    val min_elt : t -> elt

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

    val min_elt_opt : t -> elt option

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

    • since 4.05
    val max_elt : t -> elt

    Same as min_elt, but returns the largest element of the given set.

    val max_elt_opt : t -> elt option

    Same as min_elt_opt, but returns the largest element of the given set.

    • since 4.05
    val choose : t -> elt

    Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    val choose_opt : t -> elt option

    Return one element of the given set, or None if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    • since 4.05

    Searching

    val find : elt -> t -> elt

    find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

    • since 4.01
    val find_opt : elt -> t -> elt option

    find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

    • since 4.05
    val find_first : (elt -> bool) -> t -> elt

    find_first f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

    For example, find_first (fun e -> Ord.compare e x >= 0) s will return the first element e of s where Ord.compare e x >= 0 (intuitively: e >= x), or raise Not_found if x is greater than any element of s.

    • since 4.05
    val find_first_opt : (elt -> bool) -> t -> elt option

    find_first_opt f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

    • since 4.05
    val find_last : (elt -> bool) -> t -> elt

    find_last f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

    • since 4.05
    val find_last_opt : (elt -> bool) -> t -> elt option

    find_last_opt f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

    • since 4.05

    Traversing

    val iter : (elt -> unit) -> t -> unit

    iter f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.

    val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc

    fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

    Transforming

    val map : (elt -> elt) -> t -> t

    map f s is the set whose elements are f a0,f a1... f aN, where a0,a1...aN are the elements of s.

    The elements are passed to f in increasing order with respect to the ordering over the type of the elements.

    If no element of s is changed by f, s is returned unchanged. (If each output of f is physically equal to its input, the returned set is physically equal to s.)

    • since 4.04
    val filter : (elt -> bool) -> t -> t

    filter f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val filter_map : (elt -> elt option) -> t -> t

    filter_map f s returns the set of all v such that f x = Some v for some element x of s.

    For example,

    filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) s

    is the set of halves of the even elements of s.

    If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned unchanged: the result of the function is then physically equal to s.

    • since 4.11
    val partition : (elt -> bool) -> t -> t * t

    partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

    val split : elt -> t -> t * bool * t

    split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.

    Predicates and comparisons

    val is_empty : t -> bool

    Test whether a set is empty or not.

    val mem : elt -> t -> bool

    mem x s tests whether x belongs to the set s.

    val equal : t -> t -> bool

    equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

    val compare : t -> t -> int

    Total ordering between sets. Can be used as the ordering function for doing sets of sets.

    val subset : t -> t -> bool

    subset s1 s2 tests whether the set s1 is a subset of the set s2.

    val for_all : (elt -> bool) -> t -> bool

    for_all f s checks if all elements of the set satisfy the predicate f.

    val exists : (elt -> bool) -> t -> bool

    exists f s checks if at least one element of the set satisfies the predicate f.

    Converting

    val to_list : t -> elt list

    to_list s is elements s.

    • since 5.1
    val of_list : elt list -> t

    of_list l creates a set from a list of elements. This is usually more efficient than folding add over the list, except perhaps for lists with many duplicated elements.

    • since 4.02
    val to_seq_from : elt -> t -> elt Seq.t

    to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

    • since 4.07
    val to_seq : t -> elt Seq.t

    Iterate on the whole set, in ascending order

    • since 4.07
    val to_rev_seq : t -> elt Seq.t

    Iterate on the whole set, in descending order

    • since 4.12
    val add_seq : elt Seq.t -> t -> t

    Add the given elements to the set, in order.

    • since 4.07
    val of_seq : elt Seq.t -> t

    Build a set from the given bindings

    • since 4.07
    diff --git a/ocaml/Symtable/Global/index.html b/ocaml/Symtable/Global/index.html new file mode 100644 index 0000000..44e8fce --- /dev/null +++ b/ocaml/Symtable/Global/index.html @@ -0,0 +1,2 @@ + +Global (ocaml.Symtable.Global)

    Module Symtable.Global

    type t =
    1. | Glob_compunit of Cmo_format.compunit
    2. | Glob_predef of Cmo_format.predef
    val name : t -> string
    val description : Stdlib.Format.formatter -> t -> unit
    val of_ident : Ident.t -> t option
    module Set : Set.S with type elt = t
    module Map : Map.S with type key = t
    diff --git a/ocaml/Symtable/Predef/Map/index.html b/ocaml/Symtable/Predef/Map/index.html new file mode 100644 index 0000000..8257507 --- /dev/null +++ b/ocaml/Symtable/Predef/Map/index.html @@ -0,0 +1,8 @@ + +Map (ocaml.Symtable.Predef.Map)

    Module Predef.Map

    Maps

    type key = t

    The type of the map keys.

    type !+'a t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key -> 'a -> 'a t -> 'a t

    add key data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key -> 'a -> 'a list t -> 'a list t

    add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

    update key f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : (key -> bool) -> 'a t -> key * 'a

    find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : (key -> bool) -> 'a t -> key * 'a

    find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : (key -> 'a -> unit) -> 'a t -> unit

    iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

    fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : (key -> 'a -> bool) -> 'a t -> 'a t

    filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : (key -> 'a -> bool) -> 'a t -> bool

    for_all f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : (key -> 'a -> bool) -> 'a t -> bool

    exists f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val of_list : (key * 'a) list -> 'a t

    of_list bs adds the bindings of bs to the empty map, in list order (if a key is bound twice in bs the last one takes over).

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    diff --git a/ocaml/Symtable/Predef/Set/index.html b/ocaml/Symtable/Predef/Set/index.html new file mode 100644 index 0000000..26d7926 --- /dev/null +++ b/ocaml/Symtable/Predef/Set/index.html @@ -0,0 +1,2 @@ + +Set (ocaml.Symtable.Predef.Set)

    Module Predef.Set

    Sets

    type elt = t

    The type of the set elements.

    type t

    The type of sets.

    val empty : t

    The empty set.

    val add : elt -> t -> t

    add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val singleton : elt -> t

    singleton x returns the one-element set containing only x.

    val remove : elt -> t -> t

    remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val union : t -> t -> t

    Set union.

    val inter : t -> t -> t

    Set intersection.

    val disjoint : t -> t -> bool

    Test if two sets are disjoint.

    • since 4.08
    val diff : t -> t -> t

    Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

    val cardinal : t -> int

    Return the number of elements of a set.

    Elements

    val elements : t -> elt list

    Return the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Set.Make.

    val min_elt : t -> elt

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

    val min_elt_opt : t -> elt option

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

    • since 4.05
    val max_elt : t -> elt

    Same as min_elt, but returns the largest element of the given set.

    val max_elt_opt : t -> elt option

    Same as min_elt_opt, but returns the largest element of the given set.

    • since 4.05
    val choose : t -> elt

    Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    val choose_opt : t -> elt option

    Return one element of the given set, or None if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    • since 4.05

    Searching

    val find : elt -> t -> elt

    find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

    • since 4.01
    val find_opt : elt -> t -> elt option

    find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

    • since 4.05
    val find_first : (elt -> bool) -> t -> elt

    find_first f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

    For example, find_first (fun e -> Ord.compare e x >= 0) s will return the first element e of s where Ord.compare e x >= 0 (intuitively: e >= x), or raise Not_found if x is greater than any element of s.

    • since 4.05
    val find_first_opt : (elt -> bool) -> t -> elt option

    find_first_opt f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

    • since 4.05
    val find_last : (elt -> bool) -> t -> elt

    find_last f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

    • since 4.05
    val find_last_opt : (elt -> bool) -> t -> elt option

    find_last_opt f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

    • since 4.05

    Traversing

    val iter : (elt -> unit) -> t -> unit

    iter f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.

    val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc

    fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

    Transforming

    val map : (elt -> elt) -> t -> t

    map f s is the set whose elements are f a0,f a1... f aN, where a0,a1...aN are the elements of s.

    The elements are passed to f in increasing order with respect to the ordering over the type of the elements.

    If no element of s is changed by f, s is returned unchanged. (If each output of f is physically equal to its input, the returned set is physically equal to s.)

    • since 4.04
    val filter : (elt -> bool) -> t -> t

    filter f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val filter_map : (elt -> elt option) -> t -> t

    filter_map f s returns the set of all v such that f x = Some v for some element x of s.

    For example,

    filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) s

    is the set of halves of the even elements of s.

    If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned unchanged: the result of the function is then physically equal to s.

    • since 4.11
    val partition : (elt -> bool) -> t -> t * t

    partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

    val split : elt -> t -> t * bool * t

    split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.

    Predicates and comparisons

    val is_empty : t -> bool

    Test whether a set is empty or not.

    val mem : elt -> t -> bool

    mem x s tests whether x belongs to the set s.

    val equal : t -> t -> bool

    equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

    val compare : t -> t -> int

    Total ordering between sets. Can be used as the ordering function for doing sets of sets.

    val subset : t -> t -> bool

    subset s1 s2 tests whether the set s1 is a subset of the set s2.

    val for_all : (elt -> bool) -> t -> bool

    for_all f s checks if all elements of the set satisfy the predicate f.

    val exists : (elt -> bool) -> t -> bool

    exists f s checks if at least one element of the set satisfies the predicate f.

    Converting

    val to_list : t -> elt list

    to_list s is elements s.

    • since 5.1
    val of_list : elt list -> t

    of_list l creates a set from a list of elements. This is usually more efficient than folding add over the list, except perhaps for lists with many duplicated elements.

    • since 4.02
    val to_seq_from : elt -> t -> elt Seq.t

    to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

    • since 4.07
    val to_seq : t -> elt Seq.t

    Iterate on the whole set, in ascending order

    • since 4.07
    val to_rev_seq : t -> elt Seq.t

    Iterate on the whole set, in descending order

    • since 4.12
    val add_seq : elt Seq.t -> t -> t

    Add the given elements to the set, in order.

    • since 4.07
    val of_seq : elt Seq.t -> t

    Build a set from the given bindings

    • since 4.07
    diff --git a/ocaml/Symtable/Predef/index.html b/ocaml/Symtable/Predef/index.html new file mode 100644 index 0000000..ad1219d --- /dev/null +++ b/ocaml/Symtable/Predef/index.html @@ -0,0 +1,2 @@ + +Predef (ocaml.Symtable.Predef)

    Module Symtable.Predef

    module Set : Set.S with type elt = t
    module Map : Map.S with type key = t
    diff --git a/ocaml/Symtable/index.html b/ocaml/Symtable/index.html new file mode 100644 index 0000000..23d71b1 --- /dev/null +++ b/ocaml/Symtable/index.html @@ -0,0 +1,10 @@ + +Symtable (ocaml.Symtable)

    Module Symtable

    module Compunit : sig ... end
    module Predef : sig ... end
    module Global : sig ... end
    val init : unit -> unit
    val require_primitive : string -> unit
    val initial_global_table : unit -> Stdlib.Obj.t array
    val output_global_map : out_channel -> unit
    val output_primitive_names : out_channel -> unit
    val output_primitive_table : out_channel -> unit
    val data_global_map : unit -> Stdlib.Obj.t
    val data_primitive_names : unit -> string list
    val init_toplevel : unit -> (string * Stdlib.Digest.t option) list
    val update_global_table : unit -> unit
    val get_global_value : Global.t -> Stdlib.Obj.t
    val is_global_defined : Global.t -> bool
    val assign_global_value : Global.t -> Stdlib.Obj.t -> unit
    val get_global_position : Global.t -> int
    val check_global_initialized : (Cmo_format.reloc_info * int) list -> unit
    val initialized_compunits : + (Cmo_format.reloc_info * int) list -> + Cmo_format.compunit list
    val required_compunits : + (Cmo_format.reloc_info * int) list -> + Cmo_format.compunit list
    type global_map
    val empty_global_map : global_map
    val current_state : unit -> global_map
    val restore_state : global_map -> unit
    val hide_additions : global_map -> unit
    val filter_global_map : (Global.t -> bool) -> global_map -> global_map
    val iter_global_map : (Global.t -> int -> unit) -> global_map -> unit
    val is_defined_in_global_map : global_map -> Global.t -> bool
    type error =
    1. | Undefined_global of Global.t
    2. | Unavailable_primitive of string
    3. | Wrong_vm of string
    4. | Uninitialized_global of Global.t
    exception Error of error
    val report_error : Stdlib.Format.formatter -> error -> unit
    val reset : unit -> unit
    diff --git a/ocaml/Syntaxerr/index.html b/ocaml/Syntaxerr/index.html new file mode 100644 index 0000000..4b3708e --- /dev/null +++ b/ocaml/Syntaxerr/index.html @@ -0,0 +1,2 @@ + +Syntaxerr (ocaml.Syntaxerr)

    Module Syntaxerr

    Auxiliary type for reporting syntax errors

    Warning: this module is unstable and part of compiler-libs.

    type invalid_package_type =
    1. | Parameterized_types
    2. | Constrained_types
    3. | Private_types
    4. | Not_with_type
    5. | Neither_identifier_nor_with_type
    type error =
    1. | Unclosed of Location.t * string * Location.t * string
    2. | Expecting of Location.t * string
    3. | Not_expecting of Location.t * string
    4. | Applicative_path of Location.t
    5. | Variable_in_scope of Location.t * string
    6. | Other of Location.t
    7. | Ill_formed_ast of Location.t * string
    8. | Invalid_package_type of Location.t * invalid_package_type
    9. | Removed_string_set of Location.t
    exception Error of error
    exception Escape_error
    val location_of_error : error -> Location.t
    val ill_formed_ast : Location.t -> string -> 'a
    diff --git a/ocaml/Tag/Map/index.html b/ocaml/Tag/Map/index.html new file mode 100644 index 0000000..2a8399f --- /dev/null +++ b/ocaml/Tag/Map/index.html @@ -0,0 +1,17 @@ + +Map (ocaml.Tag.Map)

    Module Tag.Map

    include Map.S with type key = T.t and type 'a t = 'a Map.Make(T).t

    Maps

    type key = T.t

    The type of the map keys.

    type 'a t = 'a Stdlib.Map.Make(T).t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key -> 'a -> 'a t -> 'a t

    add key data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key -> 'a -> 'a list t -> 'a list t

    add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

    update key f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : (key -> bool) -> 'a t -> key * 'a

    find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : (key -> bool) -> 'a t -> key * 'a

    find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : (key -> 'a -> unit) -> 'a t -> unit

    iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

    fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : (key -> 'a -> bool) -> 'a t -> 'a t

    filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : (key -> 'a -> bool) -> 'a t -> bool

    for_all f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : (key -> 'a -> bool) -> 'a t -> bool

    exists f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Stdlib.Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Stdlib.Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    val of_list : (key * 'a) list -> 'a t
    val disjoint_union : + ?eq:('a -> 'a -> bool) -> + ?print:(Stdlib.Format.formatter -> 'a -> unit) -> + 'a t -> + 'a t -> + 'a t

    disjoint_union m1 m2 contains all bindings from m1 and m2. If some binding is present in both and the associated value is not equal, a Fatal_error is raised

    val union_right : 'a t -> 'a t -> 'a t

    union_right m1 m2 contains all bindings from m1 and m2. If some binding is present in both, the one from m2 is taken

    val union_left : 'a t -> 'a t -> 'a t

    union_left m1 m2 = union_right m2 m1

    val union_merge : ('a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
    val rename : key t -> key -> key
    val map_keys : (key -> key) -> 'a t -> 'a t
    val keys : 'a t -> Stdlib.Set.Make(T).t
    val data : 'a t -> 'a list
    val of_set : (key -> 'a) -> Stdlib.Set.Make(T).t -> 'a t
    val transpose_keys_and_data : key t -> key t
    val transpose_keys_and_data_set : key t -> Stdlib.Set.Make(T).t t
    val print : + (Stdlib.Format.formatter -> 'a -> unit) -> + Stdlib.Format.formatter -> + 'a t -> + unit
    diff --git a/ocaml/Tag/Set/index.html b/ocaml/Tag/Set/index.html new file mode 100644 index 0000000..2ad8c30 --- /dev/null +++ b/ocaml/Tag/Set/index.html @@ -0,0 +1,2 @@ + +Set (ocaml.Tag.Set)

    Module Tag.Set

    include Set.S with type elt = T.t and type t = Set.Make(T).t

    Sets

    type elt = T.t

    The type of the set elements.

    The type of sets.

    val empty : t

    The empty set.

    val add : elt -> t -> t

    add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val singleton : elt -> t

    singleton x returns the one-element set containing only x.

    val remove : elt -> t -> t

    remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val union : t -> t -> t

    Set union.

    val inter : t -> t -> t

    Set intersection.

    val disjoint : t -> t -> bool

    Test if two sets are disjoint.

    • since 4.08
    val diff : t -> t -> t

    Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

    val cardinal : t -> int

    Return the number of elements of a set.

    Elements

    val elements : t -> elt list

    Return the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Set.Make.

    val min_elt : t -> elt

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

    val min_elt_opt : t -> elt option

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

    • since 4.05
    val max_elt : t -> elt

    Same as min_elt, but returns the largest element of the given set.

    val max_elt_opt : t -> elt option

    Same as min_elt_opt, but returns the largest element of the given set.

    • since 4.05
    val choose : t -> elt

    Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    val choose_opt : t -> elt option

    Return one element of the given set, or None if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    • since 4.05

    Searching

    val find : elt -> t -> elt

    find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

    • since 4.01
    val find_opt : elt -> t -> elt option

    find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

    • since 4.05
    val find_first : (elt -> bool) -> t -> elt

    find_first f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

    For example, find_first (fun e -> Ord.compare e x >= 0) s will return the first element e of s where Ord.compare e x >= 0 (intuitively: e >= x), or raise Not_found if x is greater than any element of s.

    • since 4.05
    val find_first_opt : (elt -> bool) -> t -> elt option

    find_first_opt f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

    • since 4.05
    val find_last : (elt -> bool) -> t -> elt

    find_last f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

    • since 4.05
    val find_last_opt : (elt -> bool) -> t -> elt option

    find_last_opt f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

    • since 4.05

    Traversing

    val iter : (elt -> unit) -> t -> unit

    iter f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.

    val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc

    fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

    Transforming

    val filter : (elt -> bool) -> t -> t

    filter f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val filter_map : (elt -> elt option) -> t -> t

    filter_map f s returns the set of all v such that f x = Some v for some element x of s.

    For example,

    filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) s

    is the set of halves of the even elements of s.

    If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned unchanged: the result of the function is then physically equal to s.

    • since 4.11
    val partition : (elt -> bool) -> t -> t * t

    partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

    val split : elt -> t -> t * bool * t

    split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.

    Predicates and comparisons

    val is_empty : t -> bool

    Test whether a set is empty or not.

    val mem : elt -> t -> bool

    mem x s tests whether x belongs to the set s.

    val equal : t -> t -> bool

    equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

    val compare : t -> t -> int

    Total ordering between sets. Can be used as the ordering function for doing sets of sets.

    val subset : t -> t -> bool

    subset s1 s2 tests whether the set s1 is a subset of the set s2.

    val for_all : (elt -> bool) -> t -> bool

    for_all f s checks if all elements of the set satisfy the predicate f.

    val exists : (elt -> bool) -> t -> bool

    exists f s checks if at least one element of the set satisfies the predicate f.

    Converting

    val to_list : t -> elt list

    to_list s is elements s.

    • since 5.1
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t

    to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

    • since 4.07
    val to_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in ascending order

    • since 4.07
    val to_rev_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in descending order

    • since 4.12
    val add_seq : elt Stdlib.Seq.t -> t -> t

    Add the given elements to the set, in order.

    • since 4.07
    val of_seq : elt Stdlib.Seq.t -> t

    Build a set from the given bindings

    • since 4.07
    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    val to_string : t -> string
    val of_list : elt list -> t
    val map : (elt -> elt) -> t -> t
    diff --git a/ocaml/Tag/T/index.html b/ocaml/Tag/T/index.html new file mode 100644 index 0000000..302373a --- /dev/null +++ b/ocaml/Tag/T/index.html @@ -0,0 +1,2 @@ + +T (ocaml.Tag.T)

    Module Tag.T

    type t = t
    include Hashtbl.HashedType with type t := t
    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val hash : t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := t
    val compare : t -> t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    diff --git a/ocaml/Tag/Tbl/index.html b/ocaml/Tag/Tbl/index.html new file mode 100644 index 0000000..94387c4 --- /dev/null +++ b/ocaml/Tag/Tbl/index.html @@ -0,0 +1,2 @@ + +Tbl (ocaml.Tag.Tbl)

    Module Tag.Tbl

    include Hashtbl.S with type key = T.t and type 'a t = 'a Hashtbl.Make(T).t
    type key = T.t
    val create : int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    • since 4.00
    val copy : 'a t -> 'a t
    val add : 'a t -> key -> 'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    • since 4.05
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key -> 'a -> unit
    val mem : 'a t -> key -> bool
    val iter : (key -> 'a -> unit) -> 'a t -> unit
    val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
    • since 4.03
    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc
    val length : 'a t -> int
    val stats : 'a t -> Stdlib.Hashtbl.statistics
    • since 4.00
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
    • since 4.07
    val to_seq_keys : _ t -> key Stdlib.Seq.t
    • since 4.07
    val to_seq_values : 'a t -> 'a Stdlib.Seq.t
    • since 4.07
    val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
    • since 4.07
    val to_list : 'a t -> (T.t * 'a) list
    val of_list : (T.t * 'a) list -> 'a t
    val to_map : 'a t -> 'a Stdlib.Map.Make(T).t
    val of_map : 'a Stdlib.Map.Make(T).t -> 'a t
    val memoize : 'a t -> (key -> 'a) -> key -> 'a
    val map : 'a t -> ('a -> 'b) -> 'b t
    diff --git a/ocaml/Tag/index.html b/ocaml/Tag/index.html new file mode 100644 index 0000000..1a55dbf --- /dev/null +++ b/ocaml/Tag/index.html @@ -0,0 +1,2 @@ + +Tag (ocaml.Tag)

    Module Tag

    Tags on runtime boxed values.

    include Identifiable.S
    type t
    module T : Identifiable.Thing with type t = t
    include Identifiable.Thing with type t := T.t
    include Hashtbl.HashedType with type t := T.t
    val equal : T.t -> T.t -> bool

    The equality predicate used to compare keys.

    val hash : T.t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := T.t
    val output : out_channel -> T.t -> unit
    val print : Stdlib.Format.formatter -> T.t -> unit
    module Set : Identifiable.Set with module T := T
    module Map : Identifiable.Map with module T := T
    module Tbl : Identifiable.Tbl with module T := T
    val create_exn : int -> t
    val to_int : t -> int
    val zero : t
    val object_tag : t
    val compare : t -> t -> int
    diff --git a/ocaml/Targetint/index.html b/ocaml/Targetint/index.html new file mode 100644 index 0000000..91413d1 --- /dev/null +++ b/ocaml/Targetint/index.html @@ -0,0 +1,2 @@ + +Targetint (ocaml.Targetint)

    Module Targetint

    Target processor-native integers.

    This module provides operations on the type of signed 32-bit integers (on 32-bit target platforms) or signed 64-bit integers (on 64-bit target platforms). This integer type has exactly the same width as that of a pointer type in the C compiler. All arithmetic operations over are taken modulo 232 or 264 depending on the word size of the target architecture.

    Warning: this module is unstable and part of compiler-libs.

    type t

    The type of target integers.

    val zero : t

    The target integer 0.

    val one : t

    The target integer 1.

    val minus_one : t

    The target integer -1.

    val neg : t -> t

    Unary negation.

    val add : t -> t -> t

    Addition.

    val sub : t -> t -> t

    Subtraction.

    val mul : t -> t -> t

    Multiplication.

    val div : t -> t -> t

    Integer division. Raise Division_by_zero if the second argument is zero. This division rounds the real quotient of its arguments towards zero, as specified for Stdlib.(/).

    val unsigned_div : t -> t -> t

    Same as div, except that arguments and result are interpreted as unsigned integers.

    val rem : t -> t -> t

    Integer remainder. If y is not zero, the result of Targetint.rem x y satisfies the following properties: Targetint.zero <= Nativeint.rem x y < Targetint.abs y and x = Targetint.add (Targetint.mul (Targetint.div x y) y) (Targetint.rem x y). If y = 0, Targetint.rem x y raises Division_by_zero.

    val unsigned_rem : t -> t -> t

    Same as rem, except that arguments and result are interpreted as unsigned integers.

    val succ : t -> t

    Successor. Targetint.succ x is Targetint.add x Targetint.one.

    val pred : t -> t

    Predecessor. Targetint.pred x is Targetint.sub x Targetint.one.

    val abs : t -> t

    abs x is the absolute value of x. On min_int this is min_int itself and thus remains negative.

    val size : int

    The size in bits of a target native integer.

    val max_int : t

    The greatest representable target integer, either 231 - 1 on a 32-bit platform, or 263 - 1 on a 64-bit platform.

    val min_int : t

    The smallest representable target integer, either -231 on a 32-bit platform, or -263 on a 64-bit platform.

    val logand : t -> t -> t

    Bitwise logical and.

    val logor : t -> t -> t

    Bitwise logical or.

    val logxor : t -> t -> t

    Bitwise logical exclusive or.

    val lognot : t -> t

    Bitwise logical negation.

    val shift_left : t -> int -> t

    Targetint.shift_left x y shifts x to the left by y bits. The result is unspecified if y < 0 or y >= bitsize, where bitsize is 32 on a 32-bit platform and 64 on a 64-bit platform.

    val shift_right : t -> int -> t

    Targetint.shift_right x y shifts x to the right by y bits. This is an arithmetic shift: the sign bit of x is replicated and inserted in the vacated bits. The result is unspecified if y < 0 or y >= bitsize.

    val shift_right_logical : t -> int -> t

    Targetint.shift_right_logical x y shifts x to the right by y bits. This is a logical shift: zeroes are inserted in the vacated bits regardless of the sign of x. The result is unspecified if y < 0 or y >= bitsize.

    val of_int : int -> t

    Convert the given integer (type int) to a target integer (type t), module the target word size.

    val of_int_exn : int -> t

    Convert the given integer (type int) to a target integer (type t). Raises a fatal error if the conversion is not exact.

    val to_int : t -> int

    Convert the given target integer (type t) to an integer (type int). The high-order bit is lost during the conversion.

    val of_float : float -> t

    Convert the given floating-point number to a target integer, discarding the fractional part (truncate towards 0). The result of the conversion is undefined if, after truncation, the number is outside the range [Targetint.min_int, Targetint.max_int].

    val to_float : t -> float

    Convert the given target integer to a floating-point number.

    val of_int32 : int32 -> t

    Convert the given 32-bit integer (type int32) to a target integer.

    val to_int32 : t -> int32

    Convert the given target integer to a 32-bit integer (type int32). On 64-bit platforms, the 64-bit native integer is taken modulo 232, i.e. the top 32 bits are lost. On 32-bit platforms, the conversion is exact.

    val of_int64 : int64 -> t

    Convert the given 64-bit integer (type int64) to a target integer.

    val to_int64 : t -> int64

    Convert the given target integer to a 64-bit integer (type int64).

    val of_string : string -> t

    Convert the given string to a target integer. The string is read in decimal (by default) or in hexadecimal, octal or binary if the string begins with 0x, 0o or 0b respectively. Raise Failure "int_of_string" if the given string is not a valid representation of an integer, or if the integer represented exceeds the range of integers representable in type nativeint.

    val to_string : t -> string

    Return the string representation of its argument, in decimal.

    val compare : t -> t -> int

    The comparison function for target integers, with the same specification as Stdlib.compare. Along with the type t, this function compare allows the module Targetint to be passed as argument to the functors Set.Make and Map.Make.

    val unsigned_compare : t -> t -> int

    Same as compare, except that arguments are interpreted as unsigned integers.

    val equal : t -> t -> bool

    The equal function for target ints.

    type repr =
    1. | Int32 of int32
    2. | Int64 of int64
    val repr : t -> repr

    The concrete representation of a native integer.

    val print : Stdlib.Format.formatter -> t -> unit

    Print a target integer to a formatter.

    diff --git a/ocaml/Tast_iterator/index.html b/ocaml/Tast_iterator/index.html new file mode 100644 index 0000000..1d42cd4 --- /dev/null +++ b/ocaml/Tast_iterator/index.html @@ -0,0 +1,8 @@ + +Tast_iterator (ocaml.Tast_iterator)

    Module Tast_iterator

    Allows the implementation of typed tree inspection using open recursion

    type iterator = {
    1. attribute : iterator -> Typedtree.attribute -> unit;
    2. attributes : iterator -> Typedtree.attributes -> unit;
    3. binding_op : iterator -> Typedtree.binding_op -> unit;
    4. case : 'k. iterator -> 'k Typedtree.case -> unit;
    5. class_declaration : iterator -> Typedtree.class_declaration -> unit;
    6. class_description : iterator -> Typedtree.class_description -> unit;
    7. class_expr : iterator -> Typedtree.class_expr -> unit;
    8. class_field : iterator -> Typedtree.class_field -> unit;
    9. class_signature : iterator -> Typedtree.class_signature -> unit;
    10. class_structure : iterator -> Typedtree.class_structure -> unit;
    11. class_type : iterator -> Typedtree.class_type -> unit;
    12. class_type_declaration : iterator -> Typedtree.class_type_declaration -> unit;
    13. class_type_field : iterator -> Typedtree.class_type_field -> unit;
    14. env : iterator -> Env.t -> unit;
    15. expr : iterator -> Typedtree.expression -> unit;
    16. extension_constructor : iterator -> Typedtree.extension_constructor -> unit;
    17. location : iterator -> Location.t -> unit;
    18. module_binding : iterator -> Typedtree.module_binding -> unit;
    19. module_coercion : iterator -> Typedtree.module_coercion -> unit;
    20. module_declaration : iterator -> Typedtree.module_declaration -> unit;
    21. module_substitution : iterator -> Typedtree.module_substitution -> unit;
    22. module_expr : iterator -> Typedtree.module_expr -> unit;
    23. module_type : iterator -> Typedtree.module_type -> unit;
    24. module_type_declaration : iterator -> + Typedtree.module_type_declaration -> + unit;
    25. package_type : iterator -> Typedtree.package_type -> unit;
    26. pat : 'k. iterator -> 'k Typedtree.general_pattern -> unit;
    27. row_field : iterator -> Typedtree.row_field -> unit;
    28. object_field : iterator -> Typedtree.object_field -> unit;
    29. open_declaration : iterator -> Typedtree.open_declaration -> unit;
    30. open_description : iterator -> Typedtree.open_description -> unit;
    31. signature : iterator -> Typedtree.signature -> unit;
    32. signature_item : iterator -> Typedtree.signature_item -> unit;
    33. structure : iterator -> Typedtree.structure -> unit;
    34. structure_item : iterator -> Typedtree.structure_item -> unit;
    35. typ : iterator -> Typedtree.core_type -> unit;
    36. type_declaration : iterator -> Typedtree.type_declaration -> unit;
    37. type_declarations : iterator -> + (Asttypes.rec_flag * Typedtree.type_declaration list) -> + unit;
    38. type_extension : iterator -> Typedtree.type_extension -> unit;
    39. type_exception : iterator -> Typedtree.type_exception -> unit;
    40. type_kind : iterator -> Typedtree.type_kind -> unit;
    41. value_binding : iterator -> Typedtree.value_binding -> unit;
    42. value_bindings : iterator -> + (Asttypes.rec_flag * Typedtree.value_binding list) -> + unit;
    43. value_description : iterator -> Typedtree.value_description -> unit;
    44. with_constraint : iterator -> Typedtree.with_constraint -> unit;
    45. item_declaration : iterator -> Typedtree.item_declaration -> unit;
    }
    val default_iterator : iterator
    diff --git a/ocaml/Tast_mapper/index.html b/ocaml/Tast_mapper/index.html new file mode 100644 index 0000000..bf92a66 --- /dev/null +++ b/ocaml/Tast_mapper/index.html @@ -0,0 +1,50 @@ + +Tast_mapper (ocaml.Tast_mapper)

    Module Tast_mapper

    A generic Typedtree mapper

    type mapper = {
    1. attribute : mapper -> Typedtree.attribute -> Typedtree.attribute;
    2. attributes : mapper -> Typedtree.attributes -> Typedtree.attributes;
    3. binding_op : mapper -> Typedtree.binding_op -> Typedtree.binding_op;
    4. case : 'k. mapper -> 'k Typedtree.case -> 'k Typedtree.case;
    5. class_declaration : mapper -> + Typedtree.class_declaration -> + Typedtree.class_declaration;
    6. class_description : mapper -> + Typedtree.class_description -> + Typedtree.class_description;
    7. class_expr : mapper -> Typedtree.class_expr -> Typedtree.class_expr;
    8. class_field : mapper -> Typedtree.class_field -> Typedtree.class_field;
    9. class_signature : mapper -> + Typedtree.class_signature -> + Typedtree.class_signature;
    10. class_structure : mapper -> + Typedtree.class_structure -> + Typedtree.class_structure;
    11. class_type : mapper -> Typedtree.class_type -> Typedtree.class_type;
    12. class_type_declaration : mapper -> + Typedtree.class_type_declaration -> + Typedtree.class_type_declaration;
    13. class_type_field : mapper -> + Typedtree.class_type_field -> + Typedtree.class_type_field;
    14. env : mapper -> Env.t -> Env.t;
    15. expr : mapper -> Typedtree.expression -> Typedtree.expression;
    16. extension_constructor : mapper -> + Typedtree.extension_constructor -> + Typedtree.extension_constructor;
    17. location : mapper -> Location.t -> Location.t;
    18. module_binding : mapper -> + Typedtree.module_binding -> + Typedtree.module_binding;
    19. module_coercion : mapper -> + Typedtree.module_coercion -> + Typedtree.module_coercion;
    20. module_declaration : mapper -> + Typedtree.module_declaration -> + Typedtree.module_declaration;
    21. module_substitution : mapper -> + Typedtree.module_substitution -> + Typedtree.module_substitution;
    22. module_expr : mapper -> Typedtree.module_expr -> Typedtree.module_expr;
    23. module_type : mapper -> Typedtree.module_type -> Typedtree.module_type;
    24. module_type_declaration : mapper -> + Typedtree.module_type_declaration -> + Typedtree.module_type_declaration;
    25. package_type : mapper -> Typedtree.package_type -> Typedtree.package_type;
    26. pat : 'k. mapper -> + 'k Typedtree.general_pattern -> + 'k Typedtree.general_pattern;
    27. row_field : mapper -> Typedtree.row_field -> Typedtree.row_field;
    28. object_field : mapper -> Typedtree.object_field -> Typedtree.object_field;
    29. open_declaration : mapper -> + Typedtree.open_declaration -> + Typedtree.open_declaration;
    30. open_description : mapper -> + Typedtree.open_description -> + Typedtree.open_description;
    31. signature : mapper -> Typedtree.signature -> Typedtree.signature;
    32. signature_item : mapper -> + Typedtree.signature_item -> + Typedtree.signature_item;
    33. structure : mapper -> Typedtree.structure -> Typedtree.structure;
    34. structure_item : mapper -> + Typedtree.structure_item -> + Typedtree.structure_item;
    35. typ : mapper -> Typedtree.core_type -> Typedtree.core_type;
    36. type_declaration : mapper -> + Typedtree.type_declaration -> + Typedtree.type_declaration;
    37. type_declarations : mapper -> + (Asttypes.rec_flag * Typedtree.type_declaration list) -> + Asttypes.rec_flag * Typedtree.type_declaration list;
    38. type_extension : mapper -> + Typedtree.type_extension -> + Typedtree.type_extension;
    39. type_exception : mapper -> + Typedtree.type_exception -> + Typedtree.type_exception;
    40. type_kind : mapper -> Typedtree.type_kind -> Typedtree.type_kind;
    41. value_binding : mapper -> Typedtree.value_binding -> Typedtree.value_binding;
    42. value_bindings : mapper -> + (Asttypes.rec_flag * Typedtree.value_binding list) -> + Asttypes.rec_flag * Typedtree.value_binding list;
    43. value_description : mapper -> + Typedtree.value_description -> + Typedtree.value_description;
    44. with_constraint : mapper -> + Typedtree.with_constraint -> + Typedtree.with_constraint;
    }
    val default : mapper
    diff --git a/ocaml/Terminfo/index.html b/ocaml/Terminfo/index.html new file mode 100644 index 0000000..f63dbc1 --- /dev/null +++ b/ocaml/Terminfo/index.html @@ -0,0 +1,2 @@ + +Terminfo (ocaml.Terminfo)

    Module Terminfo

    Basic interface to the terminfo database

    Warning: this module is unstable and part of compiler-libs.

    type status =
    1. | Uninitialised
    2. | Bad_term
    3. | Good_term
    val setup : out_channel -> status
    val num_lines : out_channel -> int
    val backup : out_channel -> int -> unit
    val standout : out_channel -> bool -> unit
    val resume : out_channel -> int -> unit
    diff --git a/ocaml/Thread/index.html b/ocaml/Thread/index.html new file mode 100644 index 0000000..1a72d55 --- /dev/null +++ b/ocaml/Thread/index.html @@ -0,0 +1,7 @@ + +Thread (ocaml.Thread)

    Module Thread

    Lightweight threads for Posix 1003.1c and Win32.

    type t

    The type of thread handles.

    Thread creation and termination

    val create : ('a -> 'b) -> 'a -> t

    Thread.create funct arg creates a new thread of control, in which the function application funct arg is executed concurrently with the other threads of the domain. The application of Thread.create returns the handle of the newly created thread. The new thread terminates when the application funct arg returns, either normally or by raising the Thread.Exit exception or by raising any other uncaught exception. In the last case, the uncaught exception is printed on standard error, but not propagated back to the parent thread. Similarly, the result of the application funct arg is discarded and not directly accessible to the parent thread.

    See also Domain.spawn if you want parallel execution instead.

    val self : unit -> t

    Return the handle for the thread currently executing.

    val id : t -> int

    Return the identifier of the given thread. A thread identifier is an integer that identifies uniquely the thread. It can be used to build data structures indexed by threads.

    exception Exit

    Exception raised by user code to initiate termination of the current thread. In a thread created by Thread.create funct arg, if the Thread.Exit exception reaches the top of the application funct arg, it has the effect of terminating the current thread silently. In other contexts, there is no implicit handling of the Thread.Exit exception.

    val exit : unit -> unit

    Raise the Thread.Exit exception. In a thread created by Thread.create, this will cause the thread to terminate prematurely, unless the thread function handles the exception itself. Fun.protect finalizers and catch-all exception handlers will be executed.

    To make it clear that an exception is raised and will trigger finalizers and catch-all exception handlers, it is recommended to write raise Thread.Exit instead of Thread.exit ().

    • before 5.0

      A different implementation was used, not based on raising an exception, and not running finalizers and catch-all handlers. The previous implementation had a different behavior when called outside of a thread created by Thread.create.

    • deprecated Use 'raise Thread.Exit' instead.

    Suspending threads

    val delay : float -> unit

    delay d suspends the execution of the calling thread for d seconds. The other program threads continue to run during this time.

    val join : t -> unit

    join th suspends the execution of the calling thread until the thread th has terminated.

    val yield : unit -> unit

    Re-schedule the calling thread without suspending it. This function can be used to give scheduling hints, telling the scheduler that now is a good time to switch to other threads.

    Waiting for file descriptors or processes

    The functions below are leftovers from an earlier, VM-based threading system. The Unix module provides equivalent functionality, in a more general and more standard-conformant manner. It is recommended to use Unix functions directly.

    val wait_timed_read : Unix.file_descr -> float -> bool

    See Thread.wait_timed_write.

    • deprecated Use Unix.select instead.
    val wait_timed_write : Unix.file_descr -> float -> bool

    Suspend the execution of the calling thread until at least one character or EOF is available for reading (wait_timed_read) or one character can be written without blocking (wait_timed_write) on the given Unix file descriptor. Wait for at most the amount of time given as second argument (in seconds). Return true if the file descriptor is ready for input/output and false if the timeout expired. The same functionality can be achieved with Unix.select.

    • deprecated Use Unix.select instead.
    val select : + Unix.file_descr list -> + Unix.file_descr list -> + Unix.file_descr list -> + float -> + Unix.file_descr list * Unix.file_descr list * Unix.file_descr list

    Same function as Unix.select. Suspend the execution of the calling thread until input/output becomes possible on the given Unix file descriptors. The arguments and results have the same meaning as for Unix.select.

    • deprecated Use Unix.select instead.
    val wait_pid : int -> int * Unix.process_status

    Same function as Unix.waitpid. wait_pid p suspends the execution of the calling thread until the process specified by the process identifier p terminates. Returns the pid of the child caught and its termination status, as per Unix.wait.

    • deprecated Use Unix.waitpid instead.

    Management of signals

    Signal handling follows the POSIX thread model: signals generated by a thread are delivered to that thread; signals generated externally are delivered to one of the threads that does not block it. Each thread possesses a set of blocked signals, which can be modified using Thread.sigmask. This set is inherited at thread creation time. Per-thread signal masks are supported only by the system thread library under Unix, but not under Win32, nor by the VM thread library.

    val sigmask : Unix.sigprocmask_command -> int list -> int list

    sigmask cmd sigs changes the set of blocked signals for the calling thread. If cmd is SIG_SETMASK, blocked signals are set to those in the list sigs. If cmd is SIG_BLOCK, the signals in sigs are added to the set of blocked signals. If cmd is SIG_UNBLOCK, the signals in sigs are removed from the set of blocked signals. sigmask returns the set of previously blocked signals for the thread.

    val wait_signal : int list -> int

    wait_signal sigs suspends the execution of the calling thread until the process receives one of the signals specified in the list sigs. It then returns the number of the signal received. Signal handlers attached to the signals in sigs will not be invoked. The signals sigs are expected to be blocked before calling wait_signal.

    Uncaught exceptions

    val default_uncaught_exception_handler : exn -> unit

    Thread.default_uncaught_exception_handler will print the thread's id, exception and backtrace (if available).

    val set_uncaught_exception_handler : (exn -> unit) -> unit

    Thread.set_uncaught_exception_handler fn registers fn as the handler for uncaught exceptions.

    If the newly set uncaught exception handler raise an exception, default_uncaught_exception_handler will be called.

    diff --git a/ocaml/Thread_sanitizer/index.html b/ocaml/Thread_sanitizer/index.html new file mode 100644 index 0000000..26a157a --- /dev/null +++ b/ocaml/Thread_sanitizer/index.html @@ -0,0 +1,2 @@ + +Thread_sanitizer (ocaml.Thread_sanitizer)

    Module Thread_sanitizer

    Instrumentation of memory accesses to use ThreadSanitizer (TSan) for data race detection. This module contains an instrumentation pass on Cmm, where most of the instrumentation happens.

    TSan requires to instrument all memory accesses (to mutable data), thread spawning and joining, mutex operations, and all such events that are relevant for parallelism. Thread and mutex operations are instrumented by the C compiler via the runtime. Instrumentation calls are FFI (C) calls.

    TSan also requires to instrument the entry and exit of each function. TSan records function entries and exits along with other events in a history in to be able to print backtraces of an event (memory access, mutex creation...) when needed.

    In addition to this static instrumentation, we must let TSan know when a function is exited due to an exception or when performing effect, or re-entered when resuming a continuation. This dynamic instrumentation is performed by dedicated runtime functions in runtime/tsan.c. These functions are called from the assembly chunks of the runtime.

    val instrument : Cmm.expression -> Cmm.expression

    Instrumentation of a Cmm.expression: instrument memory accesses, and surround the expression by external calls to __tsan_func_entry and __tsan_func_exit. If the expression tail is a function call, then __tsan_func_exit is inserted before that call.

    val wrap_entry_exit : Cmm.expression -> Cmm.expression

    Surround an expression by external calls to __tsan_func_entry and __tsan_func_exit. If the expression tail is a function call, then __tsan_func_exit is inserted before that call.

    val init_code : unit -> Cmm.expression

    Call to __tsan_init, which should be called at least once in the compiled program, before other __tsan_* API functions. __tsan_init is idempotent, i.e. can be called more than once without consequences.

    diff --git a/ocaml/Tmc/index.html b/ocaml/Tmc/index.html new file mode 100644 index 0000000..ebe4a41 --- /dev/null +++ b/ocaml/Tmc/index.html @@ -0,0 +1,23 @@ + +Tmc (ocaml.Tmc)

    Module Tmc

    Tail-modulo-cons optimization.

    Warning: this module is unstable and part of compiler-libs.

    TMC (Tail Modulo Cons) is a code transformation that rewrites transformed functions in destination-passing-style, in such a way that certain calls that were not in tail position in the original program become tail-calls in the transformed program.

    As a classic example, the following program | + let[@tail_mod_cons] rec map f = function + | [] -> [] + | x :: xs -> + let y = f x in + y :: map f xs + | becomes (expressed in almost-source-form; the translation is in fact at the Lambda-level) | + let rec map f = function + | [] -> [] + | x :: xs -> + let y = f x in + let dst = y :: Placeholder in + map_dps dst 1 f xs; dst + and map_dps dst offset f = function + | [] -> + dst.offset <- [] + | x :: xs -> + let y = f x in + let dst' = y :: Placeholder in + dst.offset <- dst'; + map_dps dst 1 f fx + |

    In this example, the expression (y :: map f xs) had a call in non-tail-position, and it gets rewritten into tail-calls. TMC handles all such cases where the continuation of the call (what needs to be done after the return) is a "construction", the creation of a (possibly nested) data block.

    The code transformation generates two versions of the input function, the "direct" version with the same type and behavior as the original one (here just map), and the "destination-passing-style" version (here map_dps).

    Any call to the original function from outside the let..rec declaration gets transformed into a call into the direct version, which will itself call the destination-passing-style versions on recursive calls that may benefit from it (they are in tail-position modulo constructors).

    Because of this inherent code duplication, the transformation may not always improve performance. In this implementation, TMC is opt-in, we only transform functions that the user has annotated with an attribute to request the transformation.

    val rewrite : Lambda.lambda -> Lambda.lambda
    diff --git a/ocaml/Topcommon/index.html b/ocaml/Topcommon/index.html new file mode 100644 index 0000000..8b0f781 --- /dev/null +++ b/ocaml/Topcommon/index.html @@ -0,0 +1,5 @@ + +Topcommon (ocaml.Topcommon)

    Module Topcommon

    This module provides common implementations for internals of Toploop, for bytecode and native code (see Topeval for the diverging parts of the implementation).

    You should not use it directly, refer to the functions in Toploop instead.

    type evaluation_outcome =
    1. | Result of Stdlib.Obj.t
    2. | Exception of exn
    val backtrace : string option ref
    val parse_mod_use_file : + string -> + Stdlib.Lexing.lexbuf -> + Parsetree.toplevel_phrase list
    val comment_prompt_override : bool ref
    val refill_lexbuf : bytes -> int -> int
    diff --git a/ocaml/Topdirs/index.html b/ocaml/Topdirs/index.html new file mode 100644 index 0000000..9e067f9 --- /dev/null +++ b/ocaml/Topdirs/index.html @@ -0,0 +1,2 @@ + +Topdirs (ocaml.Topdirs)

    Module Topdirs

    val dir_quit : unit -> unit
    val dir_directory : string -> unit
    val dir_remove_directory : string -> unit
    val dir_cd : string -> unit
    val dir_load : Stdlib.Format.formatter -> string -> unit
    val dir_use : Stdlib.Format.formatter -> string -> unit
    val dir_use_output : Stdlib.Format.formatter -> string -> unit
    val dir_install_printer : Stdlib.Format.formatter -> Longident.t -> unit
    val dir_remove_printer : Stdlib.Format.formatter -> Longident.t -> unit
    val section_general : string
    val section_run : string
    val section_env : string
    val section_print : string
    val section_trace : string
    val section_options : string
    val section_undocumented : string
    val load_file : Stdlib.Format.formatter -> string -> bool
    • deprecated
    diff --git a/ocaml/Topeval/index.html b/ocaml/Topeval/index.html new file mode 100644 index 0000000..88d3e04 --- /dev/null +++ b/ocaml/Topeval/index.html @@ -0,0 +1,2 @@ + +Topeval (ocaml.Topeval)

    Module Topeval

    This module provides two alternative implementations for internals of Toploop, for bytecode and native code.

    You should not use it directly, refer to the functions in Toploop instead.

    diff --git a/ocaml/Tophooks/index.html b/ocaml/Tophooks/index.html new file mode 100644 index 0000000..7e0fcc5 --- /dev/null +++ b/ocaml/Tophooks/index.html @@ -0,0 +1,6 @@ + +Tophooks (ocaml.Tophooks)

    Module Tophooks

    type lookup_fn = string -> Stdlib.Obj.t option
    val lookup : lookup_fn
    val load : load_fn
    val register_loader : lookup:lookup_fn -> load:load_fn -> unit
    diff --git a/ocaml/Toploop/index.html b/ocaml/Toploop/index.html new file mode 100644 index 0000000..0806ab0 --- /dev/null +++ b/ocaml/Toploop/index.html @@ -0,0 +1,48 @@ + +Toploop (ocaml.Toploop)

    Module Toploop

    type input =
    1. | Stdin
    2. | File of string
    3. | String of string
    val getvalue : string -> Stdlib.Obj.t
    val setvalue : string -> Stdlib.Obj.t -> unit
    val filename_of_input : input -> string
    val set_paths : ?auto_include:Load_path.auto_include_callback -> unit -> unit
    val loop : Stdlib.Format.formatter -> unit
    val run_script : Stdlib.Format.formatter -> input -> string array -> bool
    type directive_fun =
    1. | Directive_none of unit -> unit
    2. | Directive_string of string -> unit
    3. | Directive_int of int -> unit
    4. | Directive_ident of Longident.t -> unit
    5. | Directive_bool of bool -> unit
    type directive_info = {
    1. section : string;
    2. doc : string;
    }
    val add_directive : string -> directive_fun -> directive_info -> unit
    val get_directive : string -> directive_fun option
    val get_directive_info : string -> directive_info option
    val all_directive_names : unit -> string list
    val directive_table : (string, directive_fun) Stdlib.Hashtbl.t
    • deprecated
    val directive_info_table : (string, directive_info) Stdlib.Hashtbl.t
    • deprecated
    val toplevel_env : Env.t ref
    val initialize_toplevel_env : unit -> unit
    val print_exception_outcome : Stdlib.Format.formatter -> exn -> unit
    val execute_phrase : + bool -> + Stdlib.Format.formatter -> + Parsetree.toplevel_phrase -> + bool
    val use_input : Stdlib.Format.formatter -> input -> bool
    val use_output : Stdlib.Format.formatter -> string -> bool
    val use_silently : Stdlib.Format.formatter -> input -> bool
    val mod_use_input : Stdlib.Format.formatter -> input -> bool
    val use_file : Stdlib.Format.formatter -> string -> bool
    val eval_module_path : Env.t -> Path.t -> Stdlib.Obj.t
    val eval_value_path : Env.t -> Path.t -> Stdlib.Obj.t
    val eval_extension_path : Env.t -> Path.t -> Stdlib.Obj.t
    val eval_class_path : Env.t -> Path.t -> Stdlib.Obj.t
    val record_backtrace : unit -> unit
    val load_file : Stdlib.Format.formatter -> string -> bool
    val print_value : + Env.t -> + Stdlib.Obj.t -> + Stdlib.Format.formatter -> + Types.type_expr -> + unit
    val print_untyped_exception : Stdlib.Format.formatter -> Stdlib.Obj.t -> unit
    type ('a, 'b) gen_printer =
    1. | Zero of 'b
    2. | Succ of 'a -> ('a, 'b) gen_printer
    val install_printer : + Path.t -> + Types.type_expr -> + (Stdlib.Format.formatter -> Stdlib.Obj.t -> unit) -> + unit
    val install_generic_printer : + Path.t -> + Path.t -> + (int -> + (int -> + Stdlib.Obj.t -> + Outcometree.out_value, + Stdlib.Obj.t -> + Outcometree.out_value) + gen_printer) -> + unit
    val install_generic_printer' : + Path.t -> + Path.t -> + (Stdlib.Format.formatter -> + Stdlib.Obj.t -> + unit, + Stdlib.Format.formatter -> + Stdlib.Obj.t -> + unit) + gen_printer -> + unit
    val remove_printer : Path.t -> unit
    val max_printer_depth : int ref
    val max_printer_steps : int ref
    val parse_toplevel_phrase : + (Stdlib.Lexing.lexbuf -> Parsetree.toplevel_phrase) ref
    val parse_use_file : + (Stdlib.Lexing.lexbuf -> Parsetree.toplevel_phrase list) ref
    val print_location : Stdlib.Format.formatter -> Location.t -> unit
    val print_error : Stdlib.Format.formatter -> Location.error -> unit
    val print_warning : Location.t -> Stdlib.Format.formatter -> Warnings.t -> unit
    val input_name : string ref
    val print_out_value : + (Stdlib.Format.formatter -> Outcometree.out_value -> unit) ref
    val print_out_type : + (Stdlib.Format.formatter -> Outcometree.out_type -> unit) ref
    val print_out_class_type : + (Stdlib.Format.formatter -> Outcometree.out_class_type -> unit) ref
    val print_out_module_type : + (Stdlib.Format.formatter -> Outcometree.out_module_type -> unit) ref
    val print_out_type_extension : + (Stdlib.Format.formatter -> Outcometree.out_type_extension -> unit) ref
    val print_out_sig_item : + (Stdlib.Format.formatter -> Outcometree.out_sig_item -> unit) ref
    val print_out_signature : + (Stdlib.Format.formatter -> Outcometree.out_sig_item list -> unit) ref
    val print_out_phrase : + (Stdlib.Format.formatter -> Outcometree.out_phrase -> unit) ref
    val read_interactive_input : (string -> bytes -> int -> int * bool) ref
    val toplevel_startup_hook : (unit -> unit) ref
    type event = ..
    type event +=
    1. | Startup
    2. | After_setup
    val add_hook : (event -> unit) -> unit
    val run_hooks : event -> unit
    val may_trace : bool ref
    val override_sys_argv : string array -> unit
    val split_path : string -> string list

    split_path path splits path according to the PATH-splitting conventions of the platform. On Unix, this is exactly String.split_on_char ':' path. On Windows, entries are separated by semicolons. Sections of entries may be double-quoted (which allows semicolons in filenames to be quoted). The double-quote characters are stripped (i.e. f"o"o = foo; also split_path "foo\";\";bar" = ["foo;"; "bar"])

    diff --git a/ocaml/Topmain/index.html b/ocaml/Topmain/index.html new file mode 100644 index 0000000..e1c42c4 --- /dev/null +++ b/ocaml/Topmain/index.html @@ -0,0 +1,2 @@ + +Topmain (ocaml.Topmain)

    Module Topmain

    val main : unit -> int
    diff --git a/ocaml/Topprinters/index.html b/ocaml/Topprinters/index.html new file mode 100644 index 0000000..6b231eb --- /dev/null +++ b/ocaml/Topprinters/index.html @@ -0,0 +1,2 @@ + +Topprinters (ocaml.Topprinters)

    Module Topprinters

    type printer_type = Types.type_expr -> Types.type_expr
    val printer_type_new : printer_type
    val printer_type_old : printer_type
    diff --git a/ocaml/Topstart/index.html b/ocaml/Topstart/index.html new file mode 100644 index 0000000..31701ab --- /dev/null +++ b/ocaml/Topstart/index.html @@ -0,0 +1,2 @@ + +Topstart (ocaml.Topstart)

    Module Topstart

    diff --git a/ocaml/Trace/index.html b/ocaml/Trace/index.html new file mode 100644 index 0000000..21b6697 --- /dev/null +++ b/ocaml/Trace/index.html @@ -0,0 +1,10 @@ + +Trace (ocaml.Trace)

    Module Trace

    type codeptr
    type traced_function = {
    1. path : Path.t;
    2. closure : Stdlib.Obj.t;
    3. actual_code : codeptr;
    4. instrumented_fun : codeptr -> Stdlib.Obj.t -> Stdlib.Obj.t -> Stdlib.Obj.t;
    }
    val traced_functions : traced_function list ref
    val is_traced : Stdlib.Obj.t -> Path.t option
    val get_code_pointer : Stdlib.Obj.t -> codeptr
    val set_code_pointer : Stdlib.Obj.t -> codeptr -> unit
    val instrument_closure : + Env.t -> + Longident.t -> + Stdlib.Format.formatter -> + Types.type_expr -> + codeptr -> + Stdlib.Obj.t -> + Stdlib.Obj.t -> + Stdlib.Obj.t
    val print_trace : Stdlib.Obj.t -> Stdlib.Obj.t -> Stdlib.Obj.t
    diff --git a/ocaml/Translattribute/index.html b/ocaml/Translattribute/index.html new file mode 100644 index 0000000..cb2f9a6 --- /dev/null +++ b/ocaml/Translattribute/index.html @@ -0,0 +1,24 @@ + +Translattribute (ocaml.Translattribute)

    Module Translattribute

    val add_inline_attribute : + Lambda.lambda -> + Location.t -> + Parsetree.attributes -> + Lambda.lambda
    val get_inline_attribute : Parsetree.attributes -> Lambda.inline_attribute
    val add_specialise_attribute : + Lambda.lambda -> + Location.t -> + Parsetree.attributes -> + Lambda.lambda
    val get_specialise_attribute : + Parsetree.attributes -> + Lambda.specialise_attribute
    val add_local_attribute : + Lambda.lambda -> + Location.t -> + Parsetree.attributes -> + Lambda.lambda
    val get_local_attribute : Parsetree.attributes -> Lambda.local_attribute
    val get_inlined_attribute : Typedtree.expression -> Lambda.inline_attribute
    val get_inlined_attribute_on_module : + Typedtree.module_expr -> + Lambda.inline_attribute
    val get_specialised_attribute : + Typedtree.expression -> + Lambda.specialise_attribute
    val get_tailcall_attribute : Typedtree.expression -> Lambda.tailcall_attribute
    val add_function_attributes : + Lambda.lambda -> + Location.t -> + Parsetree.attributes -> + Lambda.lambda
    diff --git a/ocaml/Translclass/index.html b/ocaml/Translclass/index.html new file mode 100644 index 0000000..eceed43 --- /dev/null +++ b/ocaml/Translclass/index.html @@ -0,0 +1,9 @@ + +Translclass (ocaml.Translclass)

    Module Translclass

    type error =
    1. | Tags of string * string
    exception Error of Location.t * error
    val report_error : Stdlib.Format.formatter -> error -> unit
    diff --git a/ocaml/Translcore/index.html b/ocaml/Translcore/index.html new file mode 100644 index 0000000..d8df102 --- /dev/null +++ b/ocaml/Translcore/index.html @@ -0,0 +1,39 @@ + +Translcore (ocaml.Translcore)

    Module Translcore

    val transl_let : + scopes:Debuginfo.Scoped_location.scopes -> + ?in_structure:bool -> + Asttypes.rec_flag -> + Typedtree.value_binding list -> + Lambda.lambda -> + Lambda.lambda
    val transl_extension_constructor : + scopes:Debuginfo.Scoped_location.scopes -> + Env.t -> + Path.t option -> + Typedtree.extension_constructor -> + Lambda.lambda
    val transl_scoped_exp : + scopes:Debuginfo.Scoped_location.scopes -> + Typedtree.expression -> + Lambda.lambda
    type error =
    1. | Free_super_var
    2. | Unreachable_reached
    exception Error of Location.t * error
    val report_error : Stdlib.Format.formatter -> error -> unit
    val transl_object : + (scopes:Debuginfo.Scoped_location.scopes -> + Ident.t -> + string list -> + Typedtree.class_expr -> + Lambda.lambda) + ref
    diff --git a/ocaml/Translmod/index.html b/ocaml/Translmod/index.html new file mode 100644 index 0000000..88e0e62 --- /dev/null +++ b/ocaml/Translmod/index.html @@ -0,0 +1,22 @@ + +Translmod (ocaml.Translmod)

    Module Translmod

    val transl_implementation : + string -> + (Typedtree.structure * Typedtree.module_coercion) -> + Lambda.program
    val transl_store_phrases : string -> Typedtree.structure -> int * Lambda.lambda
    val transl_store_implementation : + string -> + (Typedtree.structure * Typedtree.module_coercion) -> + Lambda.program
    val transl_implementation_flambda : + string -> + (Typedtree.structure * Typedtree.module_coercion) -> + Lambda.program
    val transl_toplevel_definition : Typedtree.structure -> Lambda.lambda
    val transl_package : + Ident.t option list -> + Ident.t -> + Typedtree.module_coercion -> + Lambda.lambda
    val transl_store_package : + Ident.t option list -> + Ident.t -> + Typedtree.module_coercion -> + int * Lambda.lambda
    val transl_package_flambda : + Ident.t option list -> + Typedtree.module_coercion -> + int * Lambda.lambda
    val toplevel_name : Ident.t -> string
    val nat_toplevel_name : Ident.t -> Ident.t * int
    val primitive_declarations : Primitive.description list ref
    type unsafe_component =
    1. | Unsafe_module_binding
    2. | Unsafe_functor
    3. | Unsafe_non_function
    4. | Unsafe_typext
    type unsafe_info =
    1. | Unsafe of {
      1. reason : unsafe_component;
      2. loc : Location.t;
      3. subid : Ident.t;
      }
    2. | Unnamed
    type error =
    1. | Circular_dependency of (Ident.t * unsafe_info) list
    2. | Conflicting_inline_attributes
    exception Error of Location.t * error
    val report_error : Location.t -> error -> Location.error
    val reset : unit -> unit
    diff --git a/ocaml/Translobj/index.html b/ocaml/Translobj/index.html new file mode 100644 index 0000000..7fb7b16 --- /dev/null +++ b/ocaml/Translobj/index.html @@ -0,0 +1,12 @@ + +Translobj (ocaml.Translobj)

    Module Translobj

    val oo_prim : string -> Lambda.lambda
    val meth : Lambda.lambda -> string -> Lambda.lambda * Lambda.lambda list
    val reset_labels : unit -> unit
    val transl_label_init : (unit -> Lambda.lambda * 'a) -> Lambda.lambda * 'a
    val transl_store_label_init : + Ident.t -> + int -> + ('a -> Lambda.lambda) -> + 'a -> + int * Lambda.lambda
    val method_ids : Ident.Set.t ref
    val oo_wrap : Env.t -> bool -> ('a -> Lambda.lambda) -> 'a -> Lambda.lambda
    val oo_wrap_gen : + Env.t -> + bool -> + ('a -> Lambda.lambda * 'b) -> + 'a -> + Lambda.lambda * 'b
    val oo_add_class : Ident.t -> Env.t * bool
    val reset : unit -> unit
    diff --git a/ocaml/Translprim/index.html b/ocaml/Translprim/index.html new file mode 100644 index 0000000..ca146ff --- /dev/null +++ b/ocaml/Translprim/index.html @@ -0,0 +1,25 @@ + +Translprim (ocaml.Translprim)

    Module Translprim

    val add_exception_ident : Ident.t -> unit
    val remove_exception_ident : Ident.t -> unit
    val clear_used_primitives : unit -> unit
    val get_used_primitives : unit -> Path.t list
    val check_primitive_arity : Location.t -> Primitive.description -> unit
    val transl_primitive : + Lambda.scoped_location -> + Primitive.description -> + Env.t -> + Types.type_expr -> + Path.t option -> + Lambda.lambda
    val transl_primitive_application : + Lambda.scoped_location -> + Primitive.description -> + Env.t -> + Types.type_expr -> + Path.t -> + Typedtree.expression option -> + Lambda.lambda list -> + Typedtree.expression list -> + Lambda.lambda
    type error =
    1. | Unknown_builtin_primitive of string
    2. | Wrong_arity_builtin_primitive of string
    exception Error of Location.t * error
    val report_error : Stdlib.Format.formatter -> error -> unit
    diff --git a/ocaml/Traverse_for_exported_symbols/index.html b/ocaml/Traverse_for_exported_symbols/index.html new file mode 100644 index 0000000..4072dcb --- /dev/null +++ b/ocaml/Traverse_for_exported_symbols/index.html @@ -0,0 +1,10 @@ + +Traverse_for_exported_symbols (ocaml.Traverse_for_exported_symbols)

    Module Traverse_for_exported_symbols

    type symbols_to_export = {
    1. symbols : Symbol.Set.t;
    2. export_ids : Export_id.Set.t;
    3. set_of_closure_ids : Set_of_closures_id.Set.t;
    4. set_of_closure_ids_keep_declaration : Set_of_closures_id.Set.t;
    5. relevant_imported_closure_ids : Closure_id.Set.t;
    6. relevant_local_closure_ids : Closure_id.Set.t;
    7. relevant_imported_vars_within_closure : Var_within_closure.Set.t;
    8. relevant_local_vars_within_closure : Var_within_closure.Set.t;
    }
    val traverse : + sets_of_closures_map:Flambda.set_of_closures Set_of_closures_id.Map.t -> + closure_id_to_set_of_closures_id:Set_of_closures_id.t Closure_id.Map.t -> + function_declarations_map: + Simple_value_approx.function_declarations Set_of_closures_id.Map.t -> + values:Export_info.descr Export_id.Map.t -> + symbol_id:Export_id.t Symbol.Map.t -> + root_symbol:Symbol.t -> + symbols_to_export

    Computes the transitive closure in Symbol.t, Closure_id.t and Set_of_closures_id.t and determines which ones of those should be exported (i.e: included in the cmx files). *

    diff --git a/ocaml/Type_immediacy/Violation/index.html b/ocaml/Type_immediacy/Violation/index.html new file mode 100644 index 0000000..93b12a0 --- /dev/null +++ b/ocaml/Type_immediacy/Violation/index.html @@ -0,0 +1,2 @@ + +Violation (ocaml.Type_immediacy.Violation)

    Module Type_immediacy.Violation

    type t =
    1. | Not_always_immediate
    2. | Not_always_immediate_on_64bits
    diff --git a/ocaml/Type_immediacy/index.html b/ocaml/Type_immediacy/index.html new file mode 100644 index 0000000..6e3ffcf --- /dev/null +++ b/ocaml/Type_immediacy/index.html @@ -0,0 +1,2 @@ + +Type_immediacy (ocaml.Type_immediacy)

    Module Type_immediacy

    Immediacy status of a type

    type t =
    1. | Unknown
      (*

      We don't know anything

      *)
    2. | Always
      (*

      We know for sure that values of this type are always immediate

      *)
    3. | Always_on_64bits
      (*

      We know for sure that values of this type are always immediate on 64 bit platforms. For other platforms, we know nothing.

      *)
    module Violation : sig ... end
    val coerce : t -> as_:t -> (unit, Violation.t) result

    coerce t ~as_ returns Ok () iff t can be seen as type immediacy as_. For instance, Always can be seen as Always_on_64bits but the opposite is not true. Return Error _ if the coercion is not possible.

    val of_attributes : Parsetree.attributes -> t

    Return the immediateness of a type as indicated by the user via attributes

    diff --git a/ocaml/Typeclass/index.html b/ocaml/Typeclass/index.html new file mode 100644 index 0000000..40c351c --- /dev/null +++ b/ocaml/Typeclass/index.html @@ -0,0 +1,25 @@ + +Typeclass (ocaml.Typeclass)

    Module Typeclass

    type 'a class_info = {
    1. cls_id : Ident.t;
    2. cls_id_loc : string Asttypes.loc;
    3. cls_decl : Types.class_declaration;
    4. cls_ty_id : Ident.t;
    5. cls_ty_decl : Types.class_type_declaration;
    6. cls_obj_id : Ident.t;
    7. cls_obj_abbr : Types.type_declaration;
    8. cls_abbr : Types.type_declaration;
    9. cls_arity : int;
    10. cls_pub_methods : string list;
    11. cls_info : 'a;
    }
    type class_type_info = {
    1. clsty_ty_id : Ident.t;
    2. clsty_id_loc : string Asttypes.loc;
    3. clsty_ty_decl : Types.class_type_declaration;
    4. clsty_obj_id : Ident.t;
    5. clsty_obj_abbr : Types.type_declaration;
    6. clsty_abbr : Types.type_declaration;
    7. clsty_info : Typedtree.class_type_declaration;
    }
    val class_declarations : + Env.t -> + Parsetree.class_declaration list -> + Typedtree.class_declaration class_info list * Env.t
    val class_descriptions : + Env.t -> + Parsetree.class_description list -> + Typedtree.class_description class_info list * Env.t
    val class_type_declarations : + Env.t -> + Parsetree.class_description list -> + class_type_info list * Env.t
    val approx_class_declarations : + Env.t -> + Parsetree.class_description list -> + class_type_info list * Env.t
    type kind =
    1. | Object
    2. | Class
    3. | Class_type
    type error =
    1. | Unconsistent_constraint of Errortrace.unification_error
    2. | Field_type_mismatch of string * string * Errortrace.unification_error
    3. | Unexpected_field of Types.type_expr * string
    4. | Structure_expected of Types.class_type
    5. | Cannot_apply of Types.class_type
    6. | Apply_wrong_label of Asttypes.arg_label
    7. | Pattern_type_clash of Types.type_expr
    8. | Repeated_parameter
    9. | Unbound_class_2 of Longident.t
    10. | Unbound_class_type_2 of Longident.t
    11. | Abbrev_type_clash of Types.type_expr * Types.type_expr * Types.type_expr
    12. | Constructor_type_mismatch of string * Errortrace.unification_error
    13. | Virtual_class of kind * string list * string list
    14. | Undeclared_methods of kind * string list
    15. | Parameter_arity_mismatch of Longident.t * int * int
    16. | Parameter_mismatch of Errortrace.unification_error
    17. | Bad_parameters of Ident.t * Types.type_expr list * Types.type_expr list
    18. | Bad_class_type_parameters of Ident.t + * Types.type_expr list + * Types.type_expr list
    19. | Class_match_failure of Ctype.class_match_failure list
    20. | Unbound_val of string
    21. | Unbound_type_var of Stdlib.Format.formatter -> + unit + * Ctype.closed_class_failure
    22. | Non_generalizable_class of {
      1. id : Ident.t;
      2. clty : Types.class_declaration;
      3. nongen_vars : Types.type_expr list;
      }
    23. | Cannot_coerce_self of Types.type_expr
    24. | Non_collapsable_conjunction of Ident.t + * Types.class_declaration + * Errortrace.unification_error
    25. | Self_clash of Errortrace.unification_error
    26. | Mutability_mismatch of string * Asttypes.mutable_flag
    27. | No_overriding of string * string
    28. | Duplicate of string * string
    29. | Closing_self_type of Types.class_signature
    exception Error of Location.t * Env.t * error
    exception Error_forward of Location.error
    val report_error : Env.t -> Stdlib.Format.formatter -> error -> unit
    val type_open_descr : + (?used_slot:bool ref -> + Env.t -> + Parsetree.open_description -> + Typedtree.open_description * Env.t) + ref
    diff --git a/ocaml/Typecore/Datatype_kind/index.html b/ocaml/Typecore/Datatype_kind/index.html new file mode 100644 index 0000000..5b0710a --- /dev/null +++ b/ocaml/Typecore/Datatype_kind/index.html @@ -0,0 +1,2 @@ + +Datatype_kind (ocaml.Typecore.Datatype_kind)

    Module Typecore.Datatype_kind

    type t =
    1. | Record
    2. | Variant
    val type_name : t -> string
    val label_name : t -> string
    diff --git a/ocaml/Typecore/index.html b/ocaml/Typecore/index.html new file mode 100644 index 0000000..6f3ca8a --- /dev/null +++ b/ocaml/Typecore/index.html @@ -0,0 +1,84 @@ + +Typecore (ocaml.Typecore)

    Module Typecore

    type type_forcing_context =
    1. | If_conditional
    2. | If_no_else_branch
    3. | While_loop_conditional
    4. | While_loop_body
    5. | For_loop_start_index
    6. | For_loop_stop_index
    7. | For_loop_body
    8. | Assert_condition
    9. | Sequence_left_hand_side
    10. | When_guard
    type type_expected = private {
    1. ty : Types.type_expr;
    2. explanation : type_forcing_context option;
    }
    type pattern_variable = {
    1. pv_id : Ident.t;
    2. pv_type : Types.type_expr;
    3. pv_loc : Location.t;
    4. pv_as_var : bool;
    5. pv_attributes : Typedtree.attributes;
    6. pv_uid : Types.Uid.t;
    }
    val mk_expected : + ?explanation:type_forcing_context -> + Types.type_expr -> + type_expected
    val is_nonexpansive : Typedtree.expression -> bool
    module Datatype_kind : sig ... end
    type wrong_name = {
    1. type_path : Path.t;
    2. kind : Datatype_kind.t;
    3. name : string Asttypes.loc;
    4. valid_names : string list;
    }
    type wrong_kind_context =
    1. | Pattern
    2. | Expression of type_forcing_context option
    type wrong_kind_sort =
    1. | Constructor
    2. | Record
    3. | Boolean
    4. | List
    5. | Unit
    type existential_restriction =
    1. | At_toplevel
      (*

      no existential types at the toplevel

      *)
    2. | In_group
      (*

      nor with let ... and ...

      *)
    3. | In_rec
      (*

      or recursive definition

      *)
    4. | With_attributes
      (*

      or let[@any_attribute] = ...

      *)
    5. | In_class_args
      (*

      or in class arguments class c (...) = ...

      *)
    6. | In_class_def
      (*

      or in class c = let ... in ...

      *)
    7. | In_self_pattern
      (*

      or in self pattern

      *)
    val type_binding : + Env.t -> + Asttypes.rec_flag -> + Parsetree.value_binding list -> + Typedtree.value_binding list * Env.t
    val type_expression : Env.t -> Parsetree.expression -> Typedtree.expression
    val type_class_arg_pattern : + string -> + Env.t -> + Env.t -> + Asttypes.arg_label -> + Parsetree.pattern -> + Typedtree.pattern + * (Ident.t * Ident.t * Types.type_expr) list + * Env.t + * Env.t
    val type_self_pattern : + Env.t -> + Parsetree.pattern -> + Typedtree.pattern * pattern_variable list
    val check_partial : + ?lev:int -> + Env.t -> + Types.type_expr -> + Location.t -> + Typedtree.value Typedtree.case list -> + Typedtree.partial
    val option_none : + Env.t -> + Types.type_expr -> + Location.t -> + Typedtree.expression
    val extract_option_type : Env.t -> Types.type_expr -> Types.type_expr
    val generalizable : int -> Types.type_expr -> bool
    val generalize_structure_exp : Typedtree.expression -> unit
    val reset_delayed_checks : unit -> unit
    val force_delayed_checks : unit -> unit
    val name_pattern : string -> Typedtree.pattern list -> Ident.t
    val name_cases : string -> Typedtree.value Typedtree.case list -> Ident.t
    val self_coercion : (Path.t * Location.t list ref) list ref
    type error =
    1. | Constructor_arity_mismatch of Longident.t * int * int
    2. | Label_mismatch of Longident.t * Errortrace.unification_error
    3. | Pattern_type_clash : Errortrace.unification_error + * Parsetree.pattern_desc option -> error
    4. | Or_pattern_type_clash of Ident.t * Errortrace.unification_error
    5. | Multiply_bound_variable of string
    6. | Orpat_vars of Ident.t * Ident.t list
    7. | Expr_type_clash of Errortrace.unification_error + * type_forcing_context option + * Parsetree.expression_desc option
    8. | Function_arity_type_clash of {
      1. syntactic_arity : int;
      2. type_constraint : Types.type_expr;
      3. trace : Errortrace.unification_error;
      }
    9. | Apply_non_function of {
      1. funct : Typedtree.expression;
      2. func_ty : Types.type_expr;
      3. res_ty : Types.type_expr;
      4. previous_arg_loc : Location.t;
      5. extra_arg_loc : Location.t;
      }
    10. | Apply_wrong_label of Asttypes.arg_label * Types.type_expr * bool
    11. | Label_multiply_defined of string
    12. | Label_missing of Ident.t list
    13. | Label_not_mutable of Longident.t
    14. | Wrong_name of string * type_expected * wrong_name
    15. | Name_type_mismatch of Datatype_kind.t + * Longident.t + * Path.t * Path.t + * (Path.t * Path.t) list
    16. | Invalid_format of string
    17. | Not_an_object of Types.type_expr * type_forcing_context option
    18. | Undefined_method of Types.type_expr * string * string list option
    19. | Undefined_self_method of string * string list
    20. | Virtual_class of Longident.t
    21. | Private_type of Types.type_expr
    22. | Private_label of Longident.t * Types.type_expr
    23. | Private_constructor of Types.constructor_description * Types.type_expr
    24. | Unbound_instance_variable of string * string list
    25. | Instance_variable_not_mutable of string
    26. | Not_subtype of Errortrace.Subtype.error
    27. | Outside_class
    28. | Value_multiply_overridden of string
    29. | Coercion_failure of Errortrace.expanded_type + * Errortrace.unification_error + * bool
    30. | Not_a_function of Types.type_expr * type_forcing_context option
    31. | Too_many_arguments of Types.type_expr * type_forcing_context option
    32. | Abstract_wrong_label of {
      1. got : Asttypes.arg_label;
      2. expected : Asttypes.arg_label;
      3. expected_type : Types.type_expr;
      4. explanation : type_forcing_context option;
      }
    33. | Scoping_let_module of string * Types.type_expr
    34. | Not_a_polymorphic_variant_type of Longident.t
    35. | Incoherent_label_order
    36. | Less_general of string * Errortrace.unification_error
    37. | Modules_not_allowed
    38. | Cannot_infer_signature
    39. | Not_a_packed_module of Types.type_expr
    40. | Unexpected_existential of existential_restriction * string
    41. | Invalid_interval
    42. | Invalid_for_loop_index
    43. | No_value_clauses
    44. | Exception_pattern_disallowed
    45. | Mixed_value_and_exception_patterns_under_guard
    46. | Inlined_record_escape
    47. | Inlined_record_expected
    48. | Unrefuted_pattern of Typedtree.pattern
    49. | Invalid_extension_constructor_payload
    50. | Not_an_extension_constructor
    51. | Literal_overflow of string
    52. | Unknown_literal of string * char
    53. | Illegal_letrec_pat
    54. | Illegal_letrec_expr
    55. | Illegal_class_expr
    56. | Letop_type_clash of string * Errortrace.unification_error
    57. | Andop_type_clash of string * Errortrace.unification_error
    58. | Bindings_type_clash of Errortrace.unification_error
    59. | Unbound_existential of Ident.t list * Types.type_expr
    60. | Missing_type_constraint
    61. | Wrong_expected_kind of wrong_kind_sort * wrong_kind_context * Types.type_expr
    62. | Expr_not_a_record_type of Types.type_expr
    exception Error of Location.t * Env.t * error
    exception Error_forward of Location.error
    val report_error : loc:Location.t -> Env.t -> error -> Location.error
    val type_open : + (?used_slot:bool ref -> + Asttypes.override_flag -> + Env.t -> + Location.t -> + Longident.t Asttypes.loc -> + Path.t * Env.t) + ref
    val type_open_decl : + (?used_slot:bool ref -> + Env.t -> + Parsetree.open_declaration -> + Typedtree.open_declaration * Types.signature * Env.t) + ref
    val type_object : + (Env.t -> + Location.t -> + Parsetree.class_structure -> + Typedtree.class_structure * string list) + ref
    val type_package : + (Env.t -> + Parsetree.module_expr -> + Path.t -> + (Longident.t * Types.type_expr) list -> + Typedtree.module_expr * (Longident.t * Types.type_expr) list) + ref
    val annotate_recursive_bindings : + Env.t -> + Typedtree.value_binding list -> + Typedtree.value_binding list
    val check_recursive_class_bindings : + Env.t -> + Ident.t list -> + Typedtree.class_expr list -> + unit
    diff --git a/ocaml/Typedecl/index.html b/ocaml/Typedecl/index.html new file mode 100644 index 0000000..21e72bd --- /dev/null +++ b/ocaml/Typedecl/index.html @@ -0,0 +1,47 @@ + +Typedecl (ocaml.Typedecl)

    Module Typedecl

    val transl_type_decl : + Env.t -> + Asttypes.rec_flag -> + Parsetree.type_declaration list -> + Typedtree.type_declaration list * Env.t * Shape.t list
    val transl_type_exception : + Env.t -> + Parsetree.type_exception -> + Typedtree.type_exception * Env.t * Shape.t
    val transl_type_extension : + bool -> + Env.t -> + Location.t -> + Parsetree.type_extension -> + Typedtree.type_extension * Env.t * Shape.t list
    val transl_with_constraint : + Ident.t -> + ?fixed_row_path:Path.t -> + sig_env:Env.t -> + sig_decl:Types.type_declaration -> + outer_env:Env.t -> + Parsetree.type_declaration -> + Typedtree.type_declaration
    val transl_package_constraint : + loc:Location.t -> + Env.t -> + Types.type_expr -> + Types.type_declaration
    val abstract_type_decl : injective:bool -> int -> Types.type_declaration
    val approx_type_decl : + Parsetree.type_declaration list -> + (Ident.t * Types.type_declaration) list
    val check_recmod_typedecl : + Env.t -> + Location.t -> + Ident.t list -> + Path.t -> + Types.type_declaration -> + unit
    val check_coherence : + Env.t -> + Location.t -> + Path.t -> + Types.type_declaration -> + unit
    val is_fixed_type : Parsetree.type_declaration -> bool
    type native_repr_kind =
    1. | Unboxed
    2. | Untagged
    type reaching_type_path = reaching_type_step list
    and reaching_type_step =
    1. | Expands_to of Types.type_expr * Types.type_expr
    2. | Contains of Types.type_expr * Types.type_expr
    type error =
    1. | Repeated_parameter
    2. | Duplicate_constructor of string
    3. | Too_many_constructors
    4. | Duplicate_label of string
    5. | Recursive_abbrev of string * Env.t * reaching_type_path
    6. | Cycle_in_def of string * Env.t * reaching_type_path
    7. | Definition_mismatch of Types.type_expr + * Env.t + * Includecore.type_mismatch option
    8. | Constraint_failed of Env.t * Errortrace.unification_error
    9. | Inconsistent_constraint of Env.t * Errortrace.unification_error
    10. | Type_clash of Env.t * Errortrace.unification_error
    11. | Non_regular of {
      1. definition : Path.t;
      2. used_as : Types.type_expr;
      3. defined_as : Types.type_expr;
      4. reaching_path : reaching_type_path;
      }
    12. | Null_arity_external
    13. | Missing_native_external
    14. | Unbound_type_var of Types.type_expr * Types.type_declaration
    15. | Cannot_extend_private_type of Path.t
    16. | Not_extensible_type of Path.t
    17. | Extension_mismatch of Path.t * Env.t * Includecore.type_mismatch
    18. | Rebind_wrong_type of Longident.t * Env.t * Errortrace.unification_error
    19. | Rebind_mismatch of Longident.t * Path.t * Path.t
    20. | Rebind_private of Longident.t
    21. | Variance of Typedecl_variance.error
    22. | Unavailable_type_constructor of Path.t
    23. | Unbound_type_var_ext of Types.type_expr * Types.extension_constructor
    24. | Val_in_structure
    25. | Multiple_native_repr_attributes
    26. | Cannot_unbox_or_untag_type of native_repr_kind
    27. | Deep_unbox_or_untag_attribute of native_repr_kind
    28. | Immediacy of Typedecl_immediacy.error
    29. | Separability of Typedecl_separability.error
    30. | Bad_unboxed_attribute of string
    31. | Boxed_and_unboxed
    32. | Nonrec_gadt
    33. | Invalid_private_row_declaration of Types.type_expr
    exception Error of Location.t * error
    val report_error : Stdlib.Format.formatter -> error -> unit
    diff --git a/ocaml/Typedecl_immediacy/index.html b/ocaml/Typedecl_immediacy/index.html new file mode 100644 index 0000000..8f7c3a1 --- /dev/null +++ b/ocaml/Typedecl_immediacy/index.html @@ -0,0 +1,5 @@ + +Typedecl_immediacy (ocaml.Typedecl_immediacy)

    Module Typedecl_immediacy

    type error =
    1. | Bad_immediacy_attribute of Type_immediacy.Violation.t
    exception Error of Location.t * error
    val update_decls : + Env.t -> + (Ident.t * Typedecl_properties.decl) list -> + (Ident.t * Typedecl_properties.decl) list
    diff --git a/ocaml/Typedecl_properties/index.html b/ocaml/Typedecl_properties/index.html new file mode 100644 index 0000000..0525bce --- /dev/null +++ b/ocaml/Typedecl_properties/index.html @@ -0,0 +1,11 @@ + +Typedecl_properties (ocaml.Typedecl_properties)

    Module Typedecl_properties

    An abstract interface for properties of type definitions, such as variance and immediacy, that are computed by a fixpoint on mutually-recursive type declarations. This interface contains all the operations needed to initialize and run the fixpoint computation, and then (optionally) check that the result is consistent with the declaration or user expectations.

    type ('prop, 'req) property = {
    1. eq : 'prop -> 'prop -> bool;
    2. merge : prop:'prop -> new_prop:'prop -> 'prop;
    3. default : decl -> 'prop;
    4. compute : Env.t -> decl -> 'req -> 'prop;
    5. update_decl : decl -> 'prop -> decl;
    6. check : Env.t -> Ident.t -> decl -> 'req -> unit;
    }

    'prop represents the type of property values (Types.Variance.t, just 'bool' for immediacy, etc).

    'req represents the property value required by the author of the declaration, if they gave an expectation: type +'a t = ....

    Some properties have no natural notion of user requirement, or their requirement is global, or already stored in type_declaration; they can just use unit as 'req parameter.

    val compute_property : + ('prop, 'req) property -> + Env.t -> + (Ident.t * decl) list -> + 'req list -> + (Ident.t * decl) list

    compute_property prop env decls req performs a fixpoint computation to determine the final values of a property on a set of mutually-recursive type declarations. The req argument must be a list of the same size as decls, providing the user requirement for each declaration.

    val compute_property_noreq : + ('prop, unit) property -> + Env.t -> + (Ident.t * decl) list -> + (Ident.t * decl) list
    diff --git a/ocaml/Typedecl_separability/index.html b/ocaml/Typedecl_separability/index.html new file mode 100644 index 0000000..aaf64c8 --- /dev/null +++ b/ocaml/Typedecl_separability/index.html @@ -0,0 +1,6 @@ + +Typedecl_separability (ocaml.Typedecl_separability)

    Module Typedecl_separability

    The OCaml runtime assumes for type-directed optimizations that all types are "separable". A type is "separable" if either all its inhabitants (the values of this type) are floating-point numbers, or none of them are.

    (Note: This assumption is required for the dynamic float array optimization; it is only made if Config.flat_float_array is set, otherwise the code in this module becomes trivial -- see compute_decl.)

    This soundness requirement could be broken by type declarations mixing existentials and the "@@unboxed" annotation. Consider the declaration

       type any = Any : 'a -> any [@@unboxed]

    which corresponds to the existential type "exists a. a". If this type is allowed to be unboxed, then it is inhabited by both float values and non-float values. On the contrary, if unboxing is disallowed, the inhabitants are all blocks with the Any constructors pointing to its parameter: they may point to a float, but they are not floats.

    The present module contains a static analysis ensuring that declarations annotated with "@@unboxed" can be safely unboxed. The idea is to check the "separability" (in the above sense) of the argument type that would be unboxed, and reject the unboxed declaration if it would create a non-separable type.

    Checking mutually-recursive type declarations is a bit subtle. Consider, for example, the following declarations.

       type foo = Foo : 'a t -> foo   [@@unboxed]
+   and 'a t = ...

    Deciding whether the type foo should be accepted requires inspecting the declaration of 'a t, which may itself refer to foo in turn. In general, the analysis performs a fixpoint computation. It is somewhat similar to what is done for inferring the variance of type parameters.

    Our analysis is defined using inference rules for our judgment Def; Gamma |- t : m, in which a type expression t is checked against a "mode" m. This "mode" describes the separability requirement on the type expression (see below for more details). The mode Gamma maps type variables to modes and Def records the "mode signature" of the mutually-recursive type declarations that are being checked.

    The "mode signature" of a type with parameters ('a, 'b) t is of the form ('a : m1, 'b : m2) t, where m1 and m2 are modes. Its meaning is the following: a concrete instance (foo, bar) t of the type is separable if foo has mode m1 and bar has mode m2.

    type error =
    1. | Non_separable_evar of string option
    exception Error of Location.t * error

    Exception raised when a type declaration is not separable, or when its separability cannot be established.

    type mode = Types.Separability.t =
    1. | Ind
    2. | Sep
    3. | Deepsep
      (*

      The mode Sep ("separable") characterizes types that are indeed separable: either they only contain floating-point values, or none of the values at this type are floating-point values. On a type parameter, it indicates that this parameter must be separable for the whole type definition to be separable. For example, the mode signature for the type declaration type 'a t = 'a is ('a : Sep) t. For the right-hand side to be separable, the parameter 'a must be separable.

      The mode Ind ("indifferent") characterizes any type -- separable or not. On a type parameter, it indicates that this parameter needs not be separable for the whole type definition to be separable. For example, type 'a t = 'a * bool does not require its parameter 'a to be separable as 'a * bool can never contain float values. Its mode signature is thus ('a : Ind) t.

      Finally, the mode Deepsep ("deeply separable") characterizes types that are separable, and whose type sub-expressions are also separable. This advanced feature is only used in the presence of constraints. For example, type 'a t = 'b constraint 'a = 'b * bool may not be separable even if 'a is (its separately depends on 'b, a fragment of 'a), so its mode signature is ('a : Deepsep) t.

      The different modes are ordered as Ind < Sep < Deepsep (from the least demanding to the most demanding).

      *)
    val compute_decl : Env.t -> Types.type_declaration -> mode list

    compute_decl env def returns the signature required for the type definition def in the typing environment env -- including signatures for the current recursive block.

    The Error exception is raised if no such signature exists -- the definition will always be invalid. This only happens when the definition is marked to be unboxed.

    Variant (or record) declarations that are not marked with the "@@unboxed" annotation, including those that contain several variants (or labels), are always separable. In particular, their mode signatures do not require anything of their type parameters, which are marked Ind.

    Finally, if Config.flat_float_array is not set, then separability is not required anymore; we just use Ind as the mode of each parameter without any check.

    Property interface (see Typedecl_properties). These functions rely on compute_decl and raise the Error exception on error.

    val property : (prop, unit) Typedecl_properties.property
    val update_decls : + Env.t -> + (Ident.t * Typedecl_properties.decl) list -> + (Ident.t * Typedecl_properties.decl) list
    diff --git a/ocaml/Typedecl_unboxed/index.html b/ocaml/Typedecl_unboxed/index.html new file mode 100644 index 0000000..8c37677 --- /dev/null +++ b/ocaml/Typedecl_unboxed/index.html @@ -0,0 +1,5 @@ + +Typedecl_unboxed (ocaml.Typedecl_unboxed)

    Module Typedecl_unboxed

    val get_unboxed_type_representation : + Env.t -> + Types.type_expr -> + Types.type_expr option
    diff --git a/ocaml/Typedecl_variance/index.html b/ocaml/Typedecl_variance/index.html new file mode 100644 index 0000000..d65cde5 --- /dev/null +++ b/ocaml/Typedecl_variance/index.html @@ -0,0 +1,29 @@ + +Typedecl_variance (ocaml.Typedecl_variance)

    Module Typedecl_variance

    type surface_variance = bool * bool * bool
    val variance_of_params : + (Parsetree.core_type * (Asttypes.variance * Asttypes.injectivity)) list -> + surface_variance list
    val variance_of_sdecl : Parsetree.type_declaration -> surface_variance list
    type prop = Types.Variance.t list
    type req = surface_variance list
    type variance_variable_context =
    1. | Type_declaration of Ident.t * Types.type_declaration
    2. | Gadt_constructor of Types.constructor_declaration
    3. | Extension_constructor of Ident.t * Types.extension_constructor
    type variance_variable_error =
    1. | No_variable
    2. | Variance_not_reflected
    3. | Variance_not_deducible
    type variance_error =
    1. | Variance_not_satisfied of int
    2. | Variance_variable_error of {
      1. error : variance_variable_error;
      2. context : variance_variable_context;
      3. variable : Types.type_expr;
      }
    type error =
    1. | Bad_variance of variance_error * surface_variance * surface_variance
    2. | Varying_anonymous
    exception Error of Location.t * error
    val check_variance_extension : + Env.t -> + Types.type_declaration -> + Typedtree.extension_constructor -> + (req * Location.t) -> + unit
    val compute_decl : + Env.t -> + check:Ident.t option -> + Types.type_declaration -> + req -> + prop
    val update_decls : + Env.t -> + Parsetree.type_declaration list -> + (Ident.t * Types.type_declaration) list -> + (Ident.t * Types.type_declaration) list
    diff --git a/ocaml/Typedtree/index.html b/ocaml/Typedtree/index.html new file mode 100644 index 0000000..5a970a3 --- /dev/null +++ b/ocaml/Typedtree/index.html @@ -0,0 +1,81 @@ + +Typedtree (ocaml.Typedtree)

    Module Typedtree

    Abstract syntax tree after typing

    By comparison with Parsetree:

    • Every Longindent.t is accompanied by a resolved Path.t.
    module Uid = Shape.Uid
    type partial =
    1. | Partial
    2. | Total

    Extension points

    type attribute = Parsetree.attribute
    type attributes = attribute list

    Core language

    type value =
    1. | Value_pattern
    type computation =
    1. | Computation_pattern
    type _ pattern_category =
    1. | Value : value pattern_category
    2. | Computation : computation pattern_category
    type pattern = value general_pattern
    and 'k general_pattern = 'k pattern_desc pattern_data
    and 'a pattern_data = {
    1. pat_desc : 'a;
    2. pat_loc : Location.t;
    3. pat_extra : (pat_extra * Location.t * attributes) list;
    4. pat_type : Types.type_expr;
    5. pat_env : Env.t;
    6. pat_attributes : attributes;
    }
    and pat_extra =
    1. | Tpat_constraint of core_type
      (*

      P : T pat_desc = P + ; pat_extra = (Tpat_constraint T, _, _) :: ...

      *)
    2. | Tpat_type of Path.t * Longident.t Asttypes.loc
      (*

      #tconst pat_desc = disjunction + ; pat_extra = (Tpat_type (P, "tconst"), _, _) :: ...

      where disjunction is a Tpat_or _ representing the branches of tconst.

      *)
    3. | Tpat_open of Path.t * Longident.t Asttypes.loc * Env.t
    4. | Tpat_unpack
      (*

      (module P) pat_desc = Tpat_var "P" + ; pat_extra = (Tpat_unpack, _, _) :: ... (module _) pat_desc = Tpat_any + ; pat_extra = (Tpat_unpack, _, _) :: ...

      *)
    and 'k pattern_desc =
    1. | Tpat_any : value pattern_desc
      (*

      _

      *)
    2. | Tpat_var : Ident.t * string Asttypes.loc * Uid.t -> value pattern_desc
      (*

      x

      *)
    3. | Tpat_alias : value general_pattern + * Ident.t + * string Asttypes.loc + * Uid.t -> value pattern_desc
      (*

      P as a

      *)
    4. | Tpat_constant : Asttypes.constant -> value pattern_desc
      (*

      1, 'a', "true", 1.0, 1l, 1L, 1n

      *)
    5. | Tpat_tuple : value general_pattern list -> value pattern_desc
      (*

      (P1, ..., Pn)

      Invariant: n >= 2

      *)
    6. | Tpat_construct : Longident.t Asttypes.loc + * Types.constructor_description + * value general_pattern list + * (Ident.t Asttypes.loc list * core_type) option -> value pattern_desc
      (*

      C (, None) C P (P, None) C (P1, ..., Pn) (P1; ...; Pn, None) C (P : t) (P, Some (, t)) C (P1, ..., Pn : t) (P1; ...; Pn, Some (, t)) C (type a) (P : t) (P, Some (a, t)) C (type a) (P1, ..., Pn : t) (P1; ...; Pn, Some (a, t))

      *)
    7. | Tpat_variant : Asttypes.label + * value general_pattern option + * Types.row_desc ref -> value pattern_desc
      (*

      `A (None) `A P (Some P)

      See Types.row_desc for an explanation of the last parameter.

      *)
    8. | Tpat_record : (Longident.t Asttypes.loc + * Types.label_description + * value general_pattern) + list + * Asttypes.closed_flag -> value pattern_desc
      (*

      l1=P1; ...; ln=Pn (flag = Closed) l1=P1; ...; ln=Pn; _ (flag = Open)

      Invariant: n > 0

      *)
    9. | Tpat_array : value general_pattern list -> value pattern_desc
      (*

      | P1; ...; Pn |

      *)
    10. | Tpat_lazy : value general_pattern -> value pattern_desc
      (*

      lazy P

      *)
    11. | Tpat_value : tpat_value_argument -> computation pattern_desc
      (*

      P

      Invariant: Tpat_value pattern should not carry pat_attributes or pat_extra metadata coming from user syntax, which must be on the inner pattern node -- to facilitate searching for a certain value pattern constructor with a specific attributed.

      To enforce this restriction, we made the argument of the Tpat_value constructor a private synonym of pattern, requiring you to use the as_computation_pattern function below instead of using the Tpat_value constructor directly.

      *)
    12. | Tpat_exception : value general_pattern -> computation pattern_desc
      (*

      exception P

      *)
    13. | Tpat_or : 'k general_pattern + * 'k general_pattern + * Types.row_desc option -> 'k pattern_desc
      (*

      P1 | P2

      row_desc = Some _ when translating Ppat_type _, None otherwise.

      *)
    and tpat_value_argument = private value general_pattern
    and expression = {
    1. exp_desc : expression_desc;
    2. exp_loc : Location.t;
    3. exp_extra : (exp_extra * Location.t * attributes) list;
    4. exp_type : Types.type_expr;
    5. exp_env : Env.t;
    6. exp_attributes : attributes;
    }
    and exp_extra =
    1. | Texp_constraint of core_type
      (*

      E : T

      *)
    2. | Texp_coerce of core_type option * core_type
      (*

      E :> T Texp_coerce (None, T) E : T0 :> T Texp_coerce (Some T0, T)

      *)
    3. | Texp_poly of core_type option
      (*

      Used for method bodies.

      *)
    4. | Texp_newtype of string
      (*

      fun (type t) ->

      *)
    and expression_desc =
    1. | Texp_ident of Path.t * Longident.t Asttypes.loc * Types.value_description
      (*

      x M.x

      *)
    2. | Texp_constant of Asttypes.constant
      (*

      1, 'a', "true", 1.0, 1l, 1L, 1n

      *)
    3. | Texp_let of Asttypes.rec_flag * value_binding list * expression
      (*

      let P1 = E1 and ... and Pn = EN in E (flag = Nonrecursive) let rec P1 = E1 and ... and Pn = EN in E (flag = Recursive)

      *)
    4. | Texp_function of function_param list * function_body
      (*

      fun P0 P1 -> function p1 -> e1 | p2 -> e2 (body = Tfunction_cases _) fun P0 P1 -> E (body = Tfunction_body _)

      This construct has the same arity as the originating Pexp_function. Arity determines when side-effects for effectful parameters are run (e.g. optional argument defaults, matching against lazy patterns). Parameters' effects are run left-to-right when an n-ary function is saturated with n arguments.

      *)
    5. | Texp_apply of expression * (Asttypes.arg_label * expression option) list
      (*

      E0 ~l1:E1 ... ~ln:En

      The expression can be None if the expression is abstracted over this argument. It currently appears when a label is applied.

      For example: let f x ~y = x + y in f ~y:3

      The resulting typedtree for the application is: Texp_apply (Texp_ident "f/1037", (Nolabel, None); (Labelled "y", Some (Texp_constant Const_int 3)) )

      *)
    6. | Texp_match of expression * computation case list * partial
      (*

      match E0 with | P1 -> E1 | P2 | exception P3 -> E2 | exception P4 -> E3

      Texp_match (E0, [(P1, E1); (P2 | exception P3, E2); (exception P4, E3)], _)

      *)
    7. | Texp_try of expression * value case list
      (*

      try E with P1 -> E1 | ... | PN -> EN

      *)
    8. | Texp_tuple of expression list
      (*

      (E1, ..., EN)

      *)
    9. | Texp_construct of Longident.t Asttypes.loc + * Types.constructor_description + * expression list
      (*

      C C E E C (E1, ..., En) E1;...;En

      *)
    10. | Texp_variant of Asttypes.label * expression option
    11. | Texp_record of {
      1. fields : (Types.label_description * record_label_definition) array;
      2. representation : Types.record_representation;
      3. extended_expression : expression option;
      }
      (*

      l1=P1; ...; ln=Pn (extended_expression = None) E0 with l1=P1; ...; ln=Pn (extended_expression = Some E0)

      Invariant: n > 0

      If the type is l1: t1; l2: t2 , the expression E0 with t2=P2 is represented as Texp_record fields = [| l1, Kept t1; l2 Override P2 |]; representation; + extended_expression = Some E0

      *)
    12. | Texp_field of expression * Longident.t Asttypes.loc * Types.label_description
    13. | Texp_setfield of expression + * Longident.t Asttypes.loc + * Types.label_description + * expression
    14. | Texp_array of expression list
    15. | Texp_ifthenelse of expression * expression * expression option
    16. | Texp_sequence of expression * expression
    17. | Texp_while of expression * expression
    18. | Texp_for of Ident.t + * Parsetree.pattern + * expression + * expression + * Asttypes.direction_flag + * expression
    19. | Texp_send of expression * meth
    20. | Texp_new of Path.t * Longident.t Asttypes.loc * Types.class_declaration
    21. | Texp_instvar of Path.t * Path.t * string Asttypes.loc
    22. | Texp_setinstvar of Path.t * Path.t * string Asttypes.loc * expression
    23. | Texp_override of Path.t * (Ident.t * string Asttypes.loc * expression) list
    24. | Texp_letmodule of Ident.t option + * string option Asttypes.loc + * Types.module_presence + * module_expr + * expression
    25. | Texp_letexception of extension_constructor * expression
    26. | Texp_assert of expression * Location.t
    27. | Texp_lazy of expression
    28. | Texp_object of class_structure * string list
    29. | Texp_pack of module_expr
    30. | Texp_letop of {
      1. let_ : binding_op;
      2. ands : binding_op list;
      3. param : Ident.t;
      4. body : value case;
      5. partial : partial;
      }
    31. | Texp_unreachable
    32. | Texp_extension_constructor of Longident.t Asttypes.loc * Path.t
    33. | Texp_open of open_declaration * expression
      (*

      let open! M in e

      *)
    and meth =
    1. | Tmeth_name of string
    2. | Tmeth_val of Ident.t
    3. | Tmeth_ancestor of Ident.t * Path.t
    and 'k case = {
    1. c_lhs : 'k general_pattern;
    2. c_guard : expression option;
    3. c_rhs : expression;
    }
    and function_param = {
    1. fp_arg_label : Asttypes.arg_label;
    2. fp_param : Ident.t;
      (*

      fp_param is the identifier that is to be used to name the parameter of the function.

      *)
    3. fp_partial : partial;
      (*

      fp_partial = Partial if the pattern match is partial Total otherwise.

      *)
    4. fp_kind : function_param_kind;
    5. fp_newtypes : string Asttypes.loc list;
      (*

      fp_newtypes are the new type declarations that come *after* that parameter. The newtypes that come before the first parameter are placed as exp_extras on the Texp_function node. This is just used in Untypeast.

      *)
    6. fp_loc : Location.t;
      (*

      fp_loc is the location of the entire value parameter, not including the fp_newtypes.

      *)
    }
    and function_param_kind =
    1. | Tparam_pat of pattern
      (*

      Tparam_pat p is a non-optional argument with pattern p.

      *)
    2. | Tparam_optional_default of pattern * expression
      (*

      Tparam_optional_default (p, e) is an optional argument p with default value e, i.e. ?x:(p = e). If the parameter is of type a option, the pattern and expression are of type a.

      *)
    and function_body =
    1. | Tfunction_body of expression
    2. | Tfunction_cases of {
      1. cases : value case list;
      2. partial : partial;
      3. param : Ident.t;
      4. loc : Location.t;
      5. exp_extra : exp_extra option;
      6. attributes : attributes;
        (*

        attributes is just used in untypeast.

        *)
      }
      (*

      The function body binds a final argument in Tfunction_cases, and this argument is pattern-matched against the cases.

      *)
    and record_label_definition =
    1. | Kept of Types.type_expr * Asttypes.mutable_flag
    2. | Overridden of Longident.t Asttypes.loc * expression
    and binding_op = {
    1. bop_op_path : Path.t;
    2. bop_op_name : string Asttypes.loc;
    3. bop_op_val : Types.value_description;
    4. bop_op_type : Types.type_expr;
    5. bop_exp : expression;
    6. bop_loc : Location.t;
    }
    and class_expr = {
    1. cl_desc : class_expr_desc;
    2. cl_loc : Location.t;
    3. cl_type : Types.class_type;
    4. cl_env : Env.t;
    5. cl_attributes : attributes;
    }
    and class_expr_desc =
    1. | Tcl_ident of Path.t * Longident.t Asttypes.loc * core_type list
    2. | Tcl_structure of class_structure
    3. | Tcl_fun of Asttypes.arg_label + * pattern + * (Ident.t * expression) list + * class_expr + * partial
    4. | Tcl_apply of class_expr * (Asttypes.arg_label * expression option) list
    5. | Tcl_let of Asttypes.rec_flag + * value_binding list + * (Ident.t * expression) list + * class_expr
    6. | Tcl_constraint of class_expr + * class_type option + * string list + * string list + * Types.MethSet.t
    7. | Tcl_open of open_description * class_expr
    and class_structure = {
    1. cstr_self : pattern;
    2. cstr_fields : class_field list;
    3. cstr_type : Types.class_signature;
    4. cstr_meths : Ident.t Types.Meths.t;
    }
    and class_field = {
    1. cf_desc : class_field_desc;
    2. cf_loc : Location.t;
    3. cf_attributes : attributes;
    }
    and class_field_kind =
    1. | Tcfk_virtual of core_type
    2. | Tcfk_concrete of Asttypes.override_flag * expression
    and class_field_desc =
    1. | Tcf_inherit of Asttypes.override_flag + * class_expr + * string option + * (string * Ident.t) list + * (string * Ident.t) list
    2. | Tcf_val of string Asttypes.loc + * Asttypes.mutable_flag + * Ident.t + * class_field_kind + * bool
    3. | Tcf_method of string Asttypes.loc * Asttypes.private_flag * class_field_kind
    4. | Tcf_constraint of core_type * core_type
    5. | Tcf_initializer of expression
    6. | Tcf_attribute of attribute
    and module_expr = {
    1. mod_desc : module_expr_desc;
    2. mod_loc : Location.t;
    3. mod_type : Types.module_type;
    4. mod_env : Env.t;
    5. mod_attributes : attributes;
    }
    and module_type_constraint =
    1. | Tmodtype_implicit
      (*

      The module type constraint has been synthesized during typechecking.

      *)
    2. | Tmodtype_explicit of module_type
      (*

      The module type was in the source file.

      *)

    Annotations for Tmod_constraint.

    and functor_parameter =
    1. | Unit
    2. | Named of Ident.t option * string option Asttypes.loc * module_type
    and module_expr_desc =
    1. | Tmod_ident of Path.t * Longident.t Asttypes.loc
    2. | Tmod_structure of structure
    3. | Tmod_functor of functor_parameter * module_expr
    4. | Tmod_apply of module_expr * module_expr * module_coercion
    5. | Tmod_apply_unit of module_expr
    6. | Tmod_constraint of module_expr + * Types.module_type + * module_type_constraint + * module_coercion
      (*

      ME (constraint = Tmodtype_implicit) (ME : MT) (constraint = Tmodtype_explicit MT)

      *)
    7. | Tmod_unpack of expression * Types.module_type
    and structure = {
    1. str_items : structure_item list;
    2. str_type : Types.signature;
    3. str_final_env : Env.t;
    }
    and structure_item = {
    1. str_desc : structure_item_desc;
    2. str_loc : Location.t;
    3. str_env : Env.t;
    }
    and structure_item_desc =
    1. | Tstr_eval of expression * attributes
    2. | Tstr_value of Asttypes.rec_flag * value_binding list
    3. | Tstr_primitive of value_description
    4. | Tstr_type of Asttypes.rec_flag * type_declaration list
    5. | Tstr_typext of type_extension
    6. | Tstr_exception of type_exception
    7. | Tstr_module of module_binding
    8. | Tstr_recmodule of module_binding list
    9. | Tstr_modtype of module_type_declaration
    10. | Tstr_open of open_declaration
    11. | Tstr_class of (class_declaration * string list) list
    12. | Tstr_class_type of (Ident.t * string Asttypes.loc * class_type_declaration) + list
    13. | Tstr_include of include_declaration
    14. | Tstr_attribute of attribute
    and module_binding = {
    1. mb_id : Ident.t option;
      (*

      None for module _ = struct ... end

      *)
    2. mb_name : string option Asttypes.loc;
    3. mb_uid : Uid.t;
    4. mb_presence : Types.module_presence;
    5. mb_expr : module_expr;
    6. mb_attributes : attributes;
    7. mb_loc : Location.t;
    }
    and value_binding = {
    1. vb_pat : pattern;
    2. vb_expr : expression;
    3. vb_rec_kind : Value_rec_types.recursive_binding_kind;
    4. vb_attributes : attributes;
    5. vb_loc : Location.t;
    }
    and module_coercion =
    1. | Tcoerce_none
    2. | Tcoerce_structure of (int * module_coercion) list + * (Ident.t * int * module_coercion) list
    3. | Tcoerce_functor of module_coercion * module_coercion
    4. | Tcoerce_primitive of primitive_coercion
      (*

      External declaration coerced to a regular value.

        module M : sig val ext : a -> b end =
+  struct external ext : a -> b = "my_c_function" end

      Only occurs inside a Tcoerce_structure coercion.

      *)
    5. | Tcoerce_alias of Env.t * Path.t * module_coercion
      (*

      Module alias coerced to a regular module.

        module M : sig module Sub : T end =
+  struct module Sub = Some_alias end

      Only occurs inside a Tcoerce_structure coercion.

      *)
    and module_type = {
    1. mty_desc : module_type_desc;
    2. mty_type : Types.module_type;
    3. mty_env : Env.t;
    4. mty_loc : Location.t;
    5. mty_attributes : attributes;
    }
    and module_type_desc =
    1. | Tmty_ident of Path.t * Longident.t Asttypes.loc
    2. | Tmty_signature of signature
    3. | Tmty_functor of functor_parameter * module_type
    4. | Tmty_with of module_type + * (Path.t * Longident.t Asttypes.loc * with_constraint) list
    5. | Tmty_typeof of module_expr
    6. | Tmty_alias of Path.t * Longident.t Asttypes.loc
    and primitive_coercion = {
    1. pc_desc : Primitive.description;
    2. pc_type : Types.type_expr;
    3. pc_env : Env.t;
    4. pc_loc : Location.t;
    }
    and signature = {
    1. sig_items : signature_item list;
    2. sig_type : Types.signature;
    3. sig_final_env : Env.t;
    }
    and signature_item = {
    1. sig_desc : signature_item_desc;
    2. sig_env : Env.t;
    3. sig_loc : Location.t;
    }
    and signature_item_desc =
    1. | Tsig_value of value_description
    2. | Tsig_type of Asttypes.rec_flag * type_declaration list
    3. | Tsig_typesubst of type_declaration list
    4. | Tsig_typext of type_extension
    5. | Tsig_exception of type_exception
    6. | Tsig_module of module_declaration
    7. | Tsig_modsubst of module_substitution
    8. | Tsig_recmodule of module_declaration list
    9. | Tsig_modtype of module_type_declaration
    10. | Tsig_modtypesubst of module_type_declaration
    11. | Tsig_open of open_description
    12. | Tsig_include of include_description
    13. | Tsig_class of class_description list
    14. | Tsig_class_type of class_type_declaration list
    15. | Tsig_attribute of attribute
    and module_declaration = {
    1. md_id : Ident.t option;
    2. md_name : string option Asttypes.loc;
    3. md_uid : Uid.t;
    4. md_presence : Types.module_presence;
    5. md_type : module_type;
    6. md_attributes : attributes;
    7. md_loc : Location.t;
    }
    and module_substitution = {
    1. ms_id : Ident.t;
    2. ms_name : string Asttypes.loc;
    3. ms_uid : Uid.t;
    4. ms_manifest : Path.t;
    5. ms_txt : Longident.t Asttypes.loc;
    6. ms_attributes : attributes;
    7. ms_loc : Location.t;
    }
    and module_type_declaration = {
    1. mtd_id : Ident.t;
    2. mtd_name : string Asttypes.loc;
    3. mtd_uid : Uid.t;
    4. mtd_type : module_type option;
    5. mtd_attributes : attributes;
    6. mtd_loc : Location.t;
    }
    and 'a open_infos = {
    1. open_expr : 'a;
    2. open_bound_items : Types.signature;
    3. open_override : Asttypes.override_flag;
    4. open_env : Env.t;
    5. open_loc : Location.t;
    6. open_attributes : attribute list;
    }
    and open_description = (Path.t * Longident.t Asttypes.loc) open_infos
    and open_declaration = module_expr open_infos
    and 'a include_infos = {
    1. incl_mod : 'a;
    2. incl_type : Types.signature;
    3. incl_loc : Location.t;
    4. incl_attributes : attribute list;
    }
    and include_description = module_type include_infos
    and include_declaration = module_expr include_infos
    and with_constraint =
    1. | Twith_type of type_declaration
    2. | Twith_module of Path.t * Longident.t Asttypes.loc
    3. | Twith_modtype of module_type
    4. | Twith_typesubst of type_declaration
    5. | Twith_modsubst of Path.t * Longident.t Asttypes.loc
    6. | Twith_modtypesubst of module_type
    and core_type = {
    1. mutable ctyp_desc : core_type_desc;
      (*

      mutable because of Typeclass.declare_method

      *)
    2. mutable ctyp_type : Types.type_expr;
      (*

      mutable because of Typeclass.declare_method

      *)
    3. ctyp_env : Env.t;
    4. ctyp_loc : Location.t;
    5. ctyp_attributes : attributes;
    }
    and core_type_desc =
    1. | Ttyp_any
    2. | Ttyp_var of string
    3. | Ttyp_arrow of Asttypes.arg_label * core_type * core_type
    4. | Ttyp_tuple of core_type list
    5. | Ttyp_constr of Path.t * Longident.t Asttypes.loc * core_type list
    6. | Ttyp_object of object_field list * Asttypes.closed_flag
    7. | Ttyp_class of Path.t * Longident.t Asttypes.loc * core_type list
    8. | Ttyp_alias of core_type * string Asttypes.loc
    9. | Ttyp_variant of row_field list + * Asttypes.closed_flag + * Asttypes.label list option
    10. | Ttyp_poly of string list * core_type
    11. | Ttyp_package of package_type
    12. | Ttyp_open of Path.t * Longident.t Asttypes.loc * core_type
    and package_type = {
    1. pack_path : Path.t;
    2. pack_fields : (Longident.t Asttypes.loc * core_type) list;
    3. pack_type : Types.module_type;
    4. pack_txt : Longident.t Asttypes.loc;
    }
    and row_field = {
    1. rf_desc : row_field_desc;
    2. rf_loc : Location.t;
    3. rf_attributes : attributes;
    }
    and row_field_desc =
    1. | Ttag of string Asttypes.loc * bool * core_type list
    2. | Tinherit of core_type
    and object_field = {
    1. of_desc : object_field_desc;
    2. of_loc : Location.t;
    3. of_attributes : attributes;
    }
    and object_field_desc =
    1. | OTtag of string Asttypes.loc * core_type
    2. | OTinherit of core_type
    and value_description = {
    1. val_id : Ident.t;
    2. val_name : string Asttypes.loc;
    3. val_desc : core_type;
    4. val_val : Types.value_description;
    5. val_prim : string list;
    6. val_loc : Location.t;
    7. val_attributes : attributes;
    }
    and type_declaration = {
    1. typ_id : Ident.t;
    2. typ_name : string Asttypes.loc;
    3. typ_params : (core_type * (Asttypes.variance * Asttypes.injectivity)) list;
    4. typ_type : Types.type_declaration;
    5. typ_cstrs : (core_type * core_type * Location.t) list;
    6. typ_kind : type_kind;
    7. typ_private : Asttypes.private_flag;
    8. typ_manifest : core_type option;
    9. typ_loc : Location.t;
    10. typ_attributes : attributes;
    }
    and type_kind =
    1. | Ttype_abstract
    2. | Ttype_variant of constructor_declaration list
    3. | Ttype_record of label_declaration list
    4. | Ttype_open
    and label_declaration = {
    1. ld_id : Ident.t;
    2. ld_name : string Asttypes.loc;
    3. ld_uid : Uid.t;
    4. ld_mutable : Asttypes.mutable_flag;
    5. ld_type : core_type;
    6. ld_loc : Location.t;
    7. ld_attributes : attributes;
    }
    and constructor_declaration = {
    1. cd_id : Ident.t;
    2. cd_name : string Asttypes.loc;
    3. cd_uid : Uid.t;
    4. cd_vars : string Asttypes.loc list;
    5. cd_args : constructor_arguments;
    6. cd_res : core_type option;
    7. cd_loc : Location.t;
    8. cd_attributes : attributes;
    }
    and constructor_arguments =
    1. | Cstr_tuple of core_type list
    2. | Cstr_record of label_declaration list
    and type_extension = {
    1. tyext_path : Path.t;
    2. tyext_txt : Longident.t Asttypes.loc;
    3. tyext_params : (core_type * (Asttypes.variance * Asttypes.injectivity)) list;
    4. tyext_constructors : extension_constructor list;
    5. tyext_private : Asttypes.private_flag;
    6. tyext_loc : Location.t;
    7. tyext_attributes : attributes;
    }
    and type_exception = {
    1. tyexn_constructor : extension_constructor;
    2. tyexn_loc : Location.t;
    3. tyexn_attributes : attribute list;
    }
    and extension_constructor = {
    1. ext_id : Ident.t;
    2. ext_name : string Asttypes.loc;
    3. ext_type : Types.extension_constructor;
    4. ext_kind : extension_constructor_kind;
    5. ext_loc : Location.t;
    6. ext_attributes : attributes;
    }
    and extension_constructor_kind =
    1. | Text_decl of string Asttypes.loc list + * constructor_arguments + * core_type option
    2. | Text_rebind of Path.t * Longident.t Asttypes.loc
    and class_type = {
    1. cltyp_desc : class_type_desc;
    2. cltyp_type : Types.class_type;
    3. cltyp_env : Env.t;
    4. cltyp_loc : Location.t;
    5. cltyp_attributes : attributes;
    }
    and class_type_desc =
    1. | Tcty_constr of Path.t * Longident.t Asttypes.loc * core_type list
    2. | Tcty_signature of class_signature
    3. | Tcty_arrow of Asttypes.arg_label * core_type * class_type
    4. | Tcty_open of open_description * class_type
    and class_signature = {
    1. csig_self : core_type;
    2. csig_fields : class_type_field list;
    3. csig_type : Types.class_signature;
    }
    and class_type_field = {
    1. ctf_desc : class_type_field_desc;
    2. ctf_loc : Location.t;
    3. ctf_attributes : attributes;
    }
    and class_type_field_desc =
    1. | Tctf_inherit of class_type
    2. | Tctf_val of string * Asttypes.mutable_flag * Asttypes.virtual_flag * core_type
    3. | Tctf_method of string + * Asttypes.private_flag + * Asttypes.virtual_flag + * core_type
    4. | Tctf_constraint of core_type * core_type
    5. | Tctf_attribute of attribute
    and class_declaration = class_expr class_infos
    and class_description = class_type class_infos
    and class_type_declaration = class_type class_infos
    and 'a class_infos = {
    1. ci_virt : Asttypes.virtual_flag;
    2. ci_params : (core_type * (Asttypes.variance * Asttypes.injectivity)) list;
    3. ci_id_name : string Asttypes.loc;
    4. ci_id_class : Ident.t;
    5. ci_id_class_type : Ident.t;
    6. ci_id_object : Ident.t;
    7. ci_expr : 'a;
    8. ci_decl : Types.class_declaration;
    9. ci_type_decl : Types.class_type_declaration;
    10. ci_loc : Location.t;
    11. ci_attributes : attributes;
    }
    type implementation = {
    1. structure : structure;
    2. coercion : module_coercion;
    3. signature : Types.signature;
    4. shape : Shape.t;
    }

    A typechecked implementation including its module structure, its exported signature, and a coercion of the module against that signature.

    If an .mli file is present, the signature will come from that file and be the exported signature of the module.

    If there isn't one, the signature will be inferred from the module structure.

    type item_declaration =
    1. | Value of value_description
    2. | Value_binding of value_binding
    3. | Type of type_declaration
    4. | Constructor of constructor_declaration
    5. | Extension_constructor of extension_constructor
    6. | Label of label_declaration
    7. | Module of module_declaration
    8. | Module_substitution of module_substitution
    9. | Module_binding of module_binding
    10. | Module_type of module_type_declaration
    11. | Class of class_declaration
    12. | Class_type of class_type_declaration
      (*

      item_declaration groups together items that correspond to the syntactic category of "declarations" which include types, values, modules, etc. declarations in signatures and their definitions in implementations.

      *)
    val as_computation_pattern : pattern -> computation general_pattern

    as_computation_pattern p is a computation pattern with description Tpat_value p, which enforces a correct placement of pat_attributes and pat_extra metadata (on the inner value pattern, rather than on the computation pattern).

    val classify_pattern_desc : 'k pattern_desc -> 'k pattern_category
    val classify_pattern : 'k general_pattern -> 'k pattern_category
    type pattern_action = {
    1. f : 'k. 'k general_pattern -> unit;
    }
    val shallow_iter_pattern_desc : pattern_action -> 'k pattern_desc -> unit
    type pattern_transformation = {
    1. f : 'k. 'k general_pattern -> 'k general_pattern;
    }
    val shallow_map_pattern_desc : + pattern_transformation -> + 'k pattern_desc -> + 'k pattern_desc
    val iter_general_pattern : pattern_action -> 'k general_pattern -> unit
    val iter_pattern : (pattern -> unit) -> pattern -> unit
    type pattern_predicate = {
    1. f : 'k. 'k general_pattern -> bool;
    }
    val exists_general_pattern : pattern_predicate -> 'k general_pattern -> bool
    val exists_pattern : (pattern -> bool) -> pattern -> bool
    val let_bound_idents : value_binding list -> Ident.t list
    val let_bound_idents_full : + value_binding list -> + (Ident.t * string Asttypes.loc * Types.type_expr * Types.Uid.t) list
    val alpha_pat : + (Ident.t * Ident.t) list -> + 'k general_pattern -> + 'k general_pattern

    Alpha conversion of patterns

    val mknoloc : 'a -> 'a Asttypes.loc
    val mkloc : 'a -> Location.t -> 'a Asttypes.loc
    val pat_bound_idents : 'k general_pattern -> Ident.t list
    val pat_bound_idents_full : + 'k general_pattern -> + (Ident.t * string Asttypes.loc * Types.type_expr * Types.Uid.t) list
    val split_pattern : + computation general_pattern -> + pattern option * pattern option

    Splits an or pattern into its value (left) and exception (right) parts.

    val exp_is_nominal : expression -> bool

    Whether an expression looks nice as the subject of a sentence in a error message.

    diff --git a/ocaml/Typemod/Sig_component_kind/index.html b/ocaml/Typemod/Sig_component_kind/index.html new file mode 100644 index 0000000..8dcd8de --- /dev/null +++ b/ocaml/Typemod/Sig_component_kind/index.html @@ -0,0 +1,2 @@ + +Sig_component_kind (ocaml.Typemod.Sig_component_kind)

    Module Typemod.Sig_component_kind

    type t =
    1. | Value
    2. | Type
    3. | Constructor
    4. | Label
    5. | Module
    6. | Module_type
    7. | Extension_constructor
    8. | Class
    9. | Class_type
    val to_string : t -> string
    diff --git a/ocaml/Typemod/Signature_names/index.html b/ocaml/Typemod/Signature_names/index.html new file mode 100644 index 0000000..3b4b911 --- /dev/null +++ b/ocaml/Typemod/Signature_names/index.html @@ -0,0 +1,2 @@ + +Signature_names (ocaml.Typemod.Signature_names)

    Module Typemod.Signature_names

    type t
    val simplify : Env.t -> t -> Types.signature -> Types.signature
    diff --git a/ocaml/Typemod/index.html b/ocaml/Typemod/index.html new file mode 100644 index 0000000..63f5c1b --- /dev/null +++ b/ocaml/Typemod/index.html @@ -0,0 +1,35 @@ + +Typemod (ocaml.Typemod)

    Module Typemod

    Type-checking of the module language and typed ast hooks

    Warning: this module is unstable and part of compiler-libs.

    module Signature_names : sig ... end
    val type_implementation : + Unit_info.t -> + Env.t -> + Parsetree.structure -> + Typedtree.implementation
    val type_interface : Env.t -> Parsetree.signature -> Typedtree.signature
    val transl_signature : Env.t -> Parsetree.signature -> Typedtree.signature
    val check_nongen_signature : Env.t -> Types.signature -> unit
    val modtype_of_package : + Env.t -> + Location.t -> + Path.t -> + (Longident.t * Types.type_expr) list -> + Types.module_type
    val path_of_module : Typedtree.module_expr -> Path.t option
    val save_signature : + Unit_info.t -> + Typedtree.signature -> + Env.t -> + Cmi_format.cmi_infos -> + unit
    val package_units : + Env.t -> + string list -> + Unit_info.Artifact.t -> + Typedtree.module_coercion
    val initial_env : + loc:Location.t -> + initially_opened_module:string option -> + open_implicit_modules:string list -> + Env.t
    module Sig_component_kind : sig ... end
    type hiding_error =
    1. | Illegal_shadowing of {
      1. shadowed_item_id : Ident.t;
      2. shadowed_item_kind : Sig_component_kind.t;
      3. shadowed_item_loc : Location.t;
      4. shadower_id : Ident.t;
      5. user_id : Ident.t;
      6. user_kind : Sig_component_kind.t;
      7. user_loc : Location.t;
      }
    2. | Appears_in_signature of {
      1. opened_item_id : Ident.t;
      2. opened_item_kind : Sig_component_kind.t;
      3. user_id : Ident.t;
      4. user_kind : Sig_component_kind.t;
      5. user_loc : Location.t;
      }
    type error =
    1. | Cannot_apply of Types.module_type
    2. | Not_included of Includemod.explanation
    3. | Cannot_eliminate_dependency of Types.module_type
    4. | Signature_expected
    5. | Structure_expected of Types.module_type
    6. | With_no_component of Longident.t
    7. | With_mismatch of Longident.t * Includemod.explanation
    8. | With_makes_applicative_functor_ill_typed of Longident.t + * Path.t + * Includemod.explanation
    9. | With_changes_module_alias of Longident.t * Ident.t * Path.t
    10. | With_cannot_remove_constrained_type
    11. | With_package_manifest of Longident.t * Types.type_expr
    12. | Repeated_name of Sig_component_kind.t * string
    13. | Non_generalizable of {
      1. vars : Types.type_expr list;
      2. expression : Types.type_expr;
      }
    14. | Non_generalizable_module of {
      1. vars : Types.type_expr list;
      2. item : Types.value_description;
      3. mty : Types.module_type;
      }
    15. | Implementation_is_required of string
    16. | Interface_not_compiled of string
    17. | Not_allowed_in_functor_body
    18. | Not_a_packed_module of Types.type_expr
    19. | Incomplete_packed_module of Types.type_expr
    20. | Scoping_pack of Longident.t * Types.type_expr
    21. | Recursive_module_require_explicit_type
    22. | Apply_generative
    23. | Cannot_scrape_alias of Path.t
    24. | Cannot_scrape_package_type of Path.t
    25. | Badly_formed_signature of string * Typedecl.error
    26. | Cannot_hide_id of hiding_error
    27. | Invalid_type_subst_rhs
    28. | Unpackable_local_modtype_subst of Path.t
    29. | With_cannot_remove_packed_modtype of Path.t * Types.module_type
    exception Error of Location.t * Env.t * error
    exception Error_forward of Location.error
    val report_error : Env.t -> loc:Location.t -> error -> Location.error
    diff --git a/ocaml/Typeopt/index.html b/ocaml/Typeopt/index.html new file mode 100644 index 0000000..125f46f --- /dev/null +++ b/ocaml/Typeopt/index.html @@ -0,0 +1,19 @@ + +Typeopt (ocaml.Typeopt)

    Module Typeopt

    val is_function_type : + Env.t -> + Types.type_expr -> + (Types.type_expr * Types.type_expr) option
    val is_base_type : Env.t -> Types.type_expr -> Path.t -> bool
    val maybe_pointer_type : + Env.t -> + Types.type_expr -> + Lambda.immediate_or_pointer
    val array_type_kind : Env.t -> Types.type_expr -> Lambda.array_kind
    val array_pattern_kind : Typedtree.pattern -> Lambda.array_kind
    val bigarray_type_kind_and_layout : + Env.t -> + Types.type_expr -> + Lambda.bigarray_kind * Lambda.bigarray_layout
    val value_kind : Env.t -> Types.type_expr -> Lambda.value_kind
    val classify_lazy_argument : + Typedtree.expression -> + [ `Constant_or_function + | `Float_that_cannot_be_shortcut + | `Identifier of [ `Forward_value | `Other ] + | `Other ]
    val value_kind_union : + Lambda.value_kind -> + Lambda.value_kind -> + Lambda.value_kind

    value_kind_union k1 k2 is a value_kind at least as general as k1 and k2

    diff --git a/ocaml/Types/MethSet/index.html b/ocaml/Types/MethSet/index.html new file mode 100644 index 0000000..ff053e8 --- /dev/null +++ b/ocaml/Types/MethSet/index.html @@ -0,0 +1,2 @@ + +MethSet (ocaml.Types.MethSet)

    Module Types.MethSet

    Sets

    type elt = string

    The type of the set elements.

    type t

    The type of sets.

    val empty : t

    The empty set.

    val add : elt -> t -> t

    add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val singleton : elt -> t

    singleton x returns the one-element set containing only x.

    val remove : elt -> t -> t

    remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val union : t -> t -> t

    Set union.

    val inter : t -> t -> t

    Set intersection.

    val disjoint : t -> t -> bool

    Test if two sets are disjoint.

    • since 4.08
    val diff : t -> t -> t

    Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

    val cardinal : t -> int

    Return the number of elements of a set.

    Elements

    val elements : t -> elt list

    Return the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Set.Make.

    val min_elt : t -> elt

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

    val min_elt_opt : t -> elt option

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

    • since 4.05
    val max_elt : t -> elt

    Same as min_elt, but returns the largest element of the given set.

    val max_elt_opt : t -> elt option

    Same as min_elt_opt, but returns the largest element of the given set.

    • since 4.05
    val choose : t -> elt

    Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    val choose_opt : t -> elt option

    Return one element of the given set, or None if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    • since 4.05

    Searching

    val find : elt -> t -> elt

    find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

    • since 4.01
    val find_opt : elt -> t -> elt option

    find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

    • since 4.05
    val find_first : (elt -> bool) -> t -> elt

    find_first f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

    For example, find_first (fun e -> Ord.compare e x >= 0) s will return the first element e of s where Ord.compare e x >= 0 (intuitively: e >= x), or raise Not_found if x is greater than any element of s.

    • since 4.05
    val find_first_opt : (elt -> bool) -> t -> elt option

    find_first_opt f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

    • since 4.05
    val find_last : (elt -> bool) -> t -> elt

    find_last f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

    • since 4.05
    val find_last_opt : (elt -> bool) -> t -> elt option

    find_last_opt f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

    • since 4.05

    Traversing

    val iter : (elt -> unit) -> t -> unit

    iter f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.

    val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc

    fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

    Transforming

    val map : (elt -> elt) -> t -> t

    map f s is the set whose elements are f a0,f a1... f aN, where a0,a1...aN are the elements of s.

    The elements are passed to f in increasing order with respect to the ordering over the type of the elements.

    If no element of s is changed by f, s is returned unchanged. (If each output of f is physically equal to its input, the returned set is physically equal to s.)

    • since 4.04
    val filter : (elt -> bool) -> t -> t

    filter f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val filter_map : (elt -> elt option) -> t -> t

    filter_map f s returns the set of all v such that f x = Some v for some element x of s.

    For example,

    filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) s

    is the set of halves of the even elements of s.

    If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned unchanged: the result of the function is then physically equal to s.

    • since 4.11
    val partition : (elt -> bool) -> t -> t * t

    partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

    val split : elt -> t -> t * bool * t

    split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.

    Predicates and comparisons

    val is_empty : t -> bool

    Test whether a set is empty or not.

    val mem : elt -> t -> bool

    mem x s tests whether x belongs to the set s.

    val equal : t -> t -> bool

    equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

    val compare : t -> t -> int

    Total ordering between sets. Can be used as the ordering function for doing sets of sets.

    val subset : t -> t -> bool

    subset s1 s2 tests whether the set s1 is a subset of the set s2.

    val for_all : (elt -> bool) -> t -> bool

    for_all f s checks if all elements of the set satisfy the predicate f.

    val exists : (elt -> bool) -> t -> bool

    exists f s checks if at least one element of the set satisfies the predicate f.

    Converting

    val to_list : t -> elt list

    to_list s is elements s.

    • since 5.1
    val of_list : elt list -> t

    of_list l creates a set from a list of elements. This is usually more efficient than folding add over the list, except perhaps for lists with many duplicated elements.

    • since 4.02
    val to_seq_from : elt -> t -> elt Seq.t

    to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

    • since 4.07
    val to_seq : t -> elt Seq.t

    Iterate on the whole set, in ascending order

    • since 4.07
    val to_rev_seq : t -> elt Seq.t

    Iterate on the whole set, in descending order

    • since 4.12
    val add_seq : elt Seq.t -> t -> t

    Add the given elements to the set, in order.

    • since 4.07
    val of_seq : elt Seq.t -> t

    Build a set from the given bindings

    • since 4.07
    diff --git a/ocaml/Types/Meths/index.html b/ocaml/Types/Meths/index.html new file mode 100644 index 0000000..4c1f68a --- /dev/null +++ b/ocaml/Types/Meths/index.html @@ -0,0 +1,8 @@ + +Meths (ocaml.Types.Meths)

    Module Types.Meths

    Maps

    type key = string

    The type of the map keys.

    type !+'a t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key -> 'a -> 'a t -> 'a t

    add key data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key -> 'a -> 'a list t -> 'a list t

    add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

    update key f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : (key -> bool) -> 'a t -> key * 'a

    find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : (key -> bool) -> 'a t -> key * 'a

    find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : (key -> 'a -> unit) -> 'a t -> unit

    iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

    fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : (key -> 'a -> bool) -> 'a t -> 'a t

    filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : (key -> 'a -> bool) -> 'a t -> bool

    for_all f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : (key -> 'a -> bool) -> 'a t -> bool

    exists f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val of_list : (key * 'a) list -> 'a t

    of_list bs adds the bindings of bs to the empty map, in list order (if a key is bound twice in bs the last one takes over).

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    diff --git a/ocaml/Types/Separability/index.html b/ocaml/Types/Separability/index.html new file mode 100644 index 0000000..74b7590 --- /dev/null +++ b/ocaml/Types/Separability/index.html @@ -0,0 +1,2 @@ + +Separability (ocaml.Types.Separability)

    Module Types.Separability

    see Typedecl_separability for an explanation of separability and separability modes.

    type t =
    1. | Ind
    2. | Sep
    3. | Deepsep
    val eq : t -> t -> bool
    val print : Stdlib.Format.formatter -> t -> unit
    val rank : t -> int

    Modes are ordered from the least to the most demanding: Ind < Sep < Deepsep. 'rank' maps them to integers in an order-respecting way: m1 < m2 <=> rank m1 < rank m2

    val compare : t -> t -> int

    Compare two mode according to their mode ordering.

    val max : t -> t -> t

    max_mode m1 m2 returns the most demanding mode. It is used to express the conjunction of two parameter mode constraints.

    type signature = t list

    The 'separability signature' of a type assigns a mode for each of its parameters. ('a, 'b) t has mode (m1, m2) if (t1, t2) t is separable whenever t1, t2 have mode m1, m2.

    val print_signature : Stdlib.Format.formatter -> signature -> unit
    val default_signature : arity:int -> signature

    The most pessimistic separability for a completely unknown type.

    diff --git a/ocaml/Types/TransientTypeOps/index.html b/ocaml/Types/TransientTypeOps/index.html new file mode 100644 index 0000000..1e9531a --- /dev/null +++ b/ocaml/Types/TransientTypeOps/index.html @@ -0,0 +1,2 @@ + +TransientTypeOps (ocaml.Types.TransientTypeOps)

    Module Types.TransientTypeOps

    Comparisons for functors

    val compare : t -> t -> int
    val equal : t -> t -> bool
    val hash : t -> int
    diff --git a/ocaml/Types/Transient_expr/index.html b/ocaml/Types/Transient_expr/index.html new file mode 100644 index 0000000..e502ff4 --- /dev/null +++ b/ocaml/Types/Transient_expr/index.html @@ -0,0 +1,2 @@ + +Transient_expr (ocaml.Types.Transient_expr)

    Module Types.Transient_expr

    Operations on transient_expr

    val create : type_desc -> level:int -> scope:int -> id:int -> transient_expr
    val set_desc : transient_expr -> type_desc -> unit
    val set_level : transient_expr -> int -> unit
    val set_scope : transient_expr -> int -> unit
    val type_expr : transient_expr -> type_expr
    val coerce : type_expr -> transient_expr

    Coerce without normalizing with repr

    val set_stub_desc : type_expr -> type_desc -> unit

    Instantiate a not yet instantiated stub. Fail if already instantiated.

    diff --git a/ocaml/Types/VarSet/index.html b/ocaml/Types/VarSet/index.html new file mode 100644 index 0000000..7c1a3cb --- /dev/null +++ b/ocaml/Types/VarSet/index.html @@ -0,0 +1,2 @@ + +VarSet (ocaml.Types.VarSet)

    Module Types.VarSet

    Sets

    type elt = string

    The type of the set elements.

    type t

    The type of sets.

    val empty : t

    The empty set.

    val add : elt -> t -> t

    add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val singleton : elt -> t

    singleton x returns the one-element set containing only x.

    val remove : elt -> t -> t

    remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val union : t -> t -> t

    Set union.

    val inter : t -> t -> t

    Set intersection.

    val disjoint : t -> t -> bool

    Test if two sets are disjoint.

    • since 4.08
    val diff : t -> t -> t

    Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

    val cardinal : t -> int

    Return the number of elements of a set.

    Elements

    val elements : t -> elt list

    Return the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Set.Make.

    val min_elt : t -> elt

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

    val min_elt_opt : t -> elt option

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

    • since 4.05
    val max_elt : t -> elt

    Same as min_elt, but returns the largest element of the given set.

    val max_elt_opt : t -> elt option

    Same as min_elt_opt, but returns the largest element of the given set.

    • since 4.05
    val choose : t -> elt

    Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    val choose_opt : t -> elt option

    Return one element of the given set, or None if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    • since 4.05

    Searching

    val find : elt -> t -> elt

    find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

    • since 4.01
    val find_opt : elt -> t -> elt option

    find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

    • since 4.05
    val find_first : (elt -> bool) -> t -> elt

    find_first f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

    For example, find_first (fun e -> Ord.compare e x >= 0) s will return the first element e of s where Ord.compare e x >= 0 (intuitively: e >= x), or raise Not_found if x is greater than any element of s.

    • since 4.05
    val find_first_opt : (elt -> bool) -> t -> elt option

    find_first_opt f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

    • since 4.05
    val find_last : (elt -> bool) -> t -> elt

    find_last f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

    • since 4.05
    val find_last_opt : (elt -> bool) -> t -> elt option

    find_last_opt f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

    • since 4.05

    Traversing

    val iter : (elt -> unit) -> t -> unit

    iter f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.

    val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc

    fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

    Transforming

    val map : (elt -> elt) -> t -> t

    map f s is the set whose elements are f a0,f a1... f aN, where a0,a1...aN are the elements of s.

    The elements are passed to f in increasing order with respect to the ordering over the type of the elements.

    If no element of s is changed by f, s is returned unchanged. (If each output of f is physically equal to its input, the returned set is physically equal to s.)

    • since 4.04
    val filter : (elt -> bool) -> t -> t

    filter f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val filter_map : (elt -> elt option) -> t -> t

    filter_map f s returns the set of all v such that f x = Some v for some element x of s.

    For example,

    filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) s

    is the set of halves of the even elements of s.

    If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned unchanged: the result of the function is then physically equal to s.

    • since 4.11
    val partition : (elt -> bool) -> t -> t * t

    partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

    val split : elt -> t -> t * bool * t

    split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.

    Predicates and comparisons

    val is_empty : t -> bool

    Test whether a set is empty or not.

    val mem : elt -> t -> bool

    mem x s tests whether x belongs to the set s.

    val equal : t -> t -> bool

    equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

    val compare : t -> t -> int

    Total ordering between sets. Can be used as the ordering function for doing sets of sets.

    val subset : t -> t -> bool

    subset s1 s2 tests whether the set s1 is a subset of the set s2.

    val for_all : (elt -> bool) -> t -> bool

    for_all f s checks if all elements of the set satisfy the predicate f.

    val exists : (elt -> bool) -> t -> bool

    exists f s checks if at least one element of the set satisfies the predicate f.

    Converting

    val to_list : t -> elt list

    to_list s is elements s.

    • since 5.1
    val of_list : elt list -> t

    of_list l creates a set from a list of elements. This is usually more efficient than folding add over the list, except perhaps for lists with many duplicated elements.

    • since 4.02
    val to_seq_from : elt -> t -> elt Seq.t

    to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

    • since 4.07
    val to_seq : t -> elt Seq.t

    Iterate on the whole set, in ascending order

    • since 4.07
    val to_rev_seq : t -> elt Seq.t

    Iterate on the whole set, in descending order

    • since 4.12
    val add_seq : elt Seq.t -> t -> t

    Add the given elements to the set, in order.

    • since 4.07
    val of_seq : elt Seq.t -> t

    Build a set from the given bindings

    • since 4.07
    diff --git a/ocaml/Types/Variance/index.html b/ocaml/Types/Variance/index.html new file mode 100644 index 0000000..86d3e8a --- /dev/null +++ b/ocaml/Types/Variance/index.html @@ -0,0 +1,2 @@ + +Variance (ocaml.Types.Variance)

    Module Types.Variance

    type t
    type f =
    1. | May_pos
    2. | May_neg
    3. | May_weak
    4. | Inj
    5. | Pos
    6. | Neg
    7. | Inv
    val null : t
    val full : t
    val covariant : t
    val unknown : t
    val union : t -> t -> t
    val inter : t -> t -> t
    val subset : t -> t -> bool
    val eq : t -> t -> bool
    val set : f -> t -> t
    val set_if : bool -> f -> t -> t
    val mem : f -> t -> bool
    val conjugate : t -> t
    val compose : t -> t -> t
    val strengthen : t -> t
    val get_upper : t -> bool * bool
    val get_lower : t -> bool * bool * bool
    val unknown_signature : injective:bool -> arity:int -> t list

    The most pessimistic variance for a completely unknown type.

    diff --git a/ocaml/Types/Vars/index.html b/ocaml/Types/Vars/index.html new file mode 100644 index 0000000..496e7d7 --- /dev/null +++ b/ocaml/Types/Vars/index.html @@ -0,0 +1,8 @@ + +Vars (ocaml.Types.Vars)

    Module Types.Vars

    Maps

    type key = string

    The type of the map keys.

    type !+'a t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key -> 'a -> 'a t -> 'a t

    add key data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key -> 'a -> 'a list t -> 'a list t

    add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

    update key f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : (key -> bool) -> 'a t -> key * 'a

    find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : (key -> bool) -> 'a t -> key * 'a

    find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : (key -> 'a -> unit) -> 'a t -> unit

    iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

    fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : (key -> 'a -> bool) -> 'a t -> 'a t

    filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : (key -> 'a -> bool) -> 'a t -> bool

    for_all f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : (key -> 'a -> bool) -> 'a t -> bool

    exists f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val of_list : (key * 'a) list -> 'a t

    of_list bs adds the bindings of bs to the empty map, in list order (if a key is bound twice in bs the last one takes over).

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    diff --git a/ocaml/Types/index.html b/ocaml/Types/index.html new file mode 100644 index 0000000..3d3c4a6 --- /dev/null +++ b/ocaml/Types/index.html @@ -0,0 +1,36 @@ + +Types (ocaml.Types)

    Module Types

    Representation of types and declarations

    Types defines the representation of types and declarations (that is, the content of module signatures).

    CMI files are made of marshalled types.

    Asttypes exposes basic definitions shared both by Parsetree and Types.

    type type_expr

    Type expressions for the core language.

    The type_desc variant defines all the possible type expressions one can find in OCaml. type_expr wraps this with some annotations.

    The level field tracks the level of polymorphism associated to a type, guiding the generalization algorithm. Put shortly, when referring to a type in a given environment, both the type and the environment have a level. If the type has an higher level, then it can be considered fully polymorphic (type variables will be printed as 'a), otherwise it'll be weakly polymorphic, or non generalized (type variables printed as '_a). See http://okmij.org/ftp/ML/generalization.html for more information.

    Note about type_declaration: one should not make the confusion between type_expr and type_declaration.

    type_declaration refers specifically to the type construct in OCaml language, where you create and name a new type or type alias.

    type_expr is used when you refer to existing types, e.g. when annotating the expected type of a value.

    Also, as the type system of OCaml is generative, a type_declaration can have the side-effect of introducing a new type constructor, different from all other known types. Whereas type_expr is a pure construct which allows referring to existing types.

    Note on mutability: TBD.

    type row_desc
    type row_field
    type field_kind
    type commutable
    type type_desc =
    1. | Tvar of string option
      (*

      Tvar (Some "a") ==> 'a or '_a Tvar None ==> _

      *)
    2. | Tarrow of Asttypes.arg_label * type_expr * type_expr * commutable
      (*

      Tarrow (Nolabel, e1, e2, c) ==> e1 -> e2 Tarrow (Labelled "l", e1, e2, c) ==> l:e1 -> e2 Tarrow (Optional "l", e1, e2, c) ==> ?l:e1 -> e2

      See commutable for the last argument.

      *)
    3. | Ttuple of type_expr list
      (*

      Ttuple [t1;...;tn] ==> (t1 * ... * tn)

      *)
    4. | Tconstr of Path.t * type_expr list * abbrev_memo ref
      (*

      Tconstr (`A.B.t', [t1;...;tn], _) ==> (t1,...,tn) A.B.t The last parameter keep tracks of known expansions, see abbrev_memo.

      *)
    5. | Tobject of type_expr * (Path.t * type_expr list) option ref
      (*

      Tobject (`f1:t1;...;fn: tn', `None') ==> < f1: t1; ...; fn: tn > f1, fn are represented as a linked list of types using Tfield and Tnil constructors.

      Tobject (_, `Some (`A.ct', [t1;...;tn]') ==> (t1, ..., tn) A.ct. where A.ct is the type of some class.

      There are also special cases for so-called "class-types", cf. Typeclass and Ctype.set_object_name:

      Tobject (Tfield(_,_,...(Tfield(_,_,rv)...), Some(`A.#ct`, [rv;t1;...;tn]) ==> (t1, ..., tn) #A.ct Tobject (_, Some(`A.#ct`, [Tnil;t1;...;tn]) ==> (t1, ..., tn) A.ct

      where rv is the hidden row variable.

      *)
    6. | Tfield of string * field_kind * type_expr * type_expr
      (*

      Tfield ("foo", field_public, t, ts) ==> <...; foo : t; ts>

      *)
    7. | Tnil
      (*

      Tnil ==> <...; >

      *)
    8. | Tsubst of type_expr * type_expr option
      (*

      Tsubst is used temporarily to store information in low-level functions manipulating representation of types, such as instantiation or copy. The first argument contains a copy of the original node. The second is available only when the first is the row variable of a polymorphic variant. It then contains a copy of the whole variant. This constructor should not appear outside of these cases.

      *)
    9. | Tvariant of row_desc
      (*

      Representation of polymorphic variants, see row_desc.

      *)
    10. | Tunivar of string option
      (*

      Occurrence of a type variable introduced by a forall quantifier / Tpoly.

      *)
    11. | Tpoly of type_expr * type_expr list
      (*

      Tpoly (ty,tyl) ==> 'a1... 'an. ty, where 'a1 ... 'an are names given to types in tyl and occurrences of those types in ty.

      *)
    12. | Tpackage of Path.t * (Longident.t * type_expr) list
      (*

      Type of a first-class module (a.k.a package).

      *)
    and fixed_explanation =
    1. | Univar of type_expr
      (*

      The row type was bound to an univar

      *)
    2. | Fixed_private
      (*

      The row type is private

      *)
    3. | Reified of Path.t
      (*

      The row was reified

      *)
    4. | Rigid
      (*

      The row type was made rigid during constraint verification

      *)
    and abbrev_memo =
    1. | Mnil
      (*

      No known abbreviation

      *)
    2. | Mcons of Asttypes.private_flag * Path.t * type_expr * type_expr * abbrev_memo
      (*

      Found one abbreviation. A valid abbreviation should be at least as visible and reachable by the same path. The first expression is the abbreviation and the second the expansion.

      *)

    abbrev_memo allows one to keep track of different expansions of a type alias. This is done for performance purposes.

    For instance, when defining type 'a pair = 'a * 'a, when one refers to an 'a pair, it is just a shortcut for the 'a * 'a type. This expansion will be stored in the abbrev_memo of the corresponding Tconstr node.

    In practice, abbrev_memo behaves like list of expansions with a mutable tail.

    Note on marshalling: abbrev_memo must not appear in saved types. Btype, with cleanup_abbrev and memo, takes care of tracking and removing abbreviations.

    commutable is a flag appended to every arrow type.

    When typing an application, if the type of the functional is known, its type is instantiated with commu_ok arrows, otherwise as commu_var ().

    When the type is not known, the application will be used to infer the actual type. This is fragile in presence of labels where there is no principal type.

    Two incompatible applications must rely on is_commu_ok arrows, otherwise they will trigger an error.

    let f g = g ~a:() ~b:(); g ~b:() ~a:();

    Error: This function is applied to arguments in an order different from other calls. This is only allowed when the real type is known.

    val is_commu_ok : commutable -> bool
    val commu_ok : commutable
    val commu_var : unit -> commutable

    field_kind indicates the accessibility of a method.

    An Fprivate field may become Fpublic or Fabsent during unification, but not the other way round.

    The same field_kind is kept shared when copying Tfield nodes so that the copies of the self-type of a class share the same accessibility (see also PR#10539).

    type field_kind_view =
    1. | Fprivate
    2. | Fpublic
    3. | Fabsent
    val field_kind_repr : field_kind -> field_kind_view
    val field_public : field_kind
    val field_absent : field_kind
    val field_private : unit -> field_kind
    val field_kind_internal_repr : field_kind -> field_kind

    Getters for type_expr; calls repr before answering a value

    val get_desc : type_expr -> type_desc
    val get_level : type_expr -> int
    val get_scope : type_expr -> int
    val get_id : type_expr -> int
    type transient_expr = private {
    1. mutable desc : type_desc;
    2. mutable level : int;
    3. mutable scope : int;
    4. id : int;
    }

    Transient type_expr. Should only be used immediately after Transient_expr.repr

    module Transient_expr : sig ... end

    Operations on transient_expr

    val create_expr : type_desc -> level:int -> scope:int -> id:int -> type_expr

    Functions and definitions moved from Btype

    val newty3 : level:int -> scope:int -> type_desc -> type_expr

    Create a type with a fresh id

    val newty2 : level:int -> type_desc -> type_expr

    Create a type with a fresh id and no scope

    module TransientTypeOps : sig ... end

    Comparisons for functors

    Comparisons for type_expr; cannot be used for functors

    val eq_type : type_expr -> type_expr -> bool
    val compare_type : type_expr -> type_expr -> int

    Constructor and accessors for row_desc

    `X | `Y (row_closed = true) < `X | `Y (row_closed = true) > `X | `Y (row_closed = false) < `X | `Y > `X (row_closed = true)

    type t = > `X as 'a (row_more = Tvar a) type t = private > `X (row_more = Tconstr ("t#row", , ref Mnil))

    And for:

    let f = function `X -> `X -> | `Y -> `X

    the type of "f" will be a Tarrow whose lhs will (basically) be:

    Tvariant row_fields = [("X", _)]; + row_more = + Tvariant { row_fields = [("Y", _)]; + row_more = + Tvariant { row_fields = []; + row_more = _; + _ ; _

    }

    ; _

    }

    val create_row : + fields:(Asttypes.label * row_field) list -> + more:type_expr -> + closed:bool -> + fixed:fixed_explanation option -> + name:(Path.t * type_expr list) option -> + row_desc
    val row_fields : row_desc -> (Asttypes.label * row_field) list
    val row_more : row_desc -> type_expr
    val row_closed : row_desc -> bool
    val row_fixed : row_desc -> fixed_explanation option
    val row_name : row_desc -> (Path.t * type_expr list) option
    val set_row_name : row_desc -> (Path.t * type_expr list) option -> row_desc
    val get_row_field : Asttypes.label -> row_desc -> row_field
    type row_desc_repr =
    1. | Row of {
      1. fields : (Asttypes.label * row_field) list;
      2. more : type_expr;
      3. closed : bool;
      4. fixed : fixed_explanation option;
      5. name : (Path.t * type_expr list) option;
      }

    get all fields at once; different from the old row_repr

    val row_repr : row_desc -> row_desc_repr
    type row_field_view =
    1. | Rpresent of type_expr option
    2. | Reither of bool * type_expr list * bool
    3. | Rabsent

    Current contents of a row field

    val row_field_repr : row_field -> row_field_view
    val rf_present : type_expr option -> row_field
    val rf_absent : row_field
    val rf_either : + ?use_ext_of:row_field -> + no_arg:bool -> + type_expr list -> + matched:bool -> + row_field
    val rf_either_of : type_expr option -> row_field
    val eq_row_field_ext : row_field -> row_field -> bool
    val changed_row_field_exts : row_field list -> (unit -> unit) -> bool
    val match_row_field : + present:(type_expr option -> 'a) -> + absent:(unit -> 'a) -> + either:(bool -> type_expr list -> bool -> row_field option -> 'a) -> + row_field -> + 'a
    module Uid = Shape.Uid
    module MethSet : Set.S with type elt = string
    module VarSet : Set.S with type elt = string
    module Meths : Map.S with type key = string
    module Vars : Map.S with type key = string
    type value_description = {
    1. val_type : type_expr;
    2. val_kind : value_kind;
    3. val_loc : Location.t;
    4. val_attributes : Parsetree.attributes;
    5. val_uid : Uid.t;
    }
    and value_kind =
    1. | Val_reg
    2. | Val_prim of Primitive.description
    3. | Val_ivar of Asttypes.mutable_flag * string
    4. | Val_self of class_signature * self_meths * Ident.t Vars.t * string
    5. | Val_anc of class_signature * Ident.t Meths.t * string
    and self_meths =
    1. | Self_concrete of Ident.t Meths.t
    2. | Self_virtual of Ident.t Meths.t ref
    and class_signature = {
    1. csig_self : type_expr;
    2. mutable csig_self_row : type_expr;
    3. mutable csig_vars : (Asttypes.mutable_flag * Asttypes.virtual_flag * type_expr) + Vars.t;
    4. mutable csig_meths : (method_privacy * Asttypes.virtual_flag * type_expr) + Meths.t;
    }
    and method_privacy =
    1. | Mpublic
    2. | Mprivate of field_kind
    module Variance : sig ... end
    module Separability : sig ... end

    see Typedecl_separability for an explanation of separability and separability modes.

    type type_declaration = {
    1. type_params : type_expr list;
    2. type_arity : int;
    3. type_kind : type_decl_kind;
    4. type_private : Asttypes.private_flag;
    5. type_manifest : type_expr option;
    6. type_variance : Variance.t list;
    7. type_separability : Separability.t list;
    8. type_is_newtype : bool;
    9. type_expansion_scope : int;
    10. type_loc : Location.t;
    11. type_attributes : Parsetree.attributes;
    12. type_immediate : Type_immediacy.t;
    13. type_unboxed_default : bool;
    14. type_uid : Uid.t;
    }
    and ('lbl, 'cstr) type_kind =
    1. | Type_abstract of type_origin
    2. | Type_record of 'lbl list * record_representation
    3. | Type_variant of 'cstr list * variant_representation
    4. | Type_open
    and type_origin =
    1. | Definition
    2. | Rec_check_regularity
    3. | Existential of string
    and record_representation =
    1. | Record_regular
    2. | Record_float
    3. | Record_unboxed of bool
    4. | Record_inlined of int
    5. | Record_extension of Path.t
    and variant_representation =
    1. | Variant_regular
    2. | Variant_unboxed
    and label_declaration = {
    1. ld_id : Ident.t;
    2. ld_mutable : Asttypes.mutable_flag;
    3. ld_type : type_expr;
    4. ld_loc : Location.t;
    5. ld_attributes : Parsetree.attributes;
    6. ld_uid : Uid.t;
    }
    and constructor_declaration = {
    1. cd_id : Ident.t;
    2. cd_args : constructor_arguments;
    3. cd_res : type_expr option;
    4. cd_loc : Location.t;
    5. cd_attributes : Parsetree.attributes;
    6. cd_uid : Uid.t;
    }
    and constructor_arguments =
    1. | Cstr_tuple of type_expr list
    2. | Cstr_record of label_declaration list
    type extension_constructor = {
    1. ext_type_path : Path.t;
    2. ext_type_params : type_expr list;
    3. ext_args : constructor_arguments;
    4. ext_ret_type : type_expr option;
    5. ext_private : Asttypes.private_flag;
    6. ext_loc : Location.t;
    7. ext_attributes : Parsetree.attributes;
    8. ext_uid : Uid.t;
    }
    and type_transparence =
    1. | Type_public
    2. | Type_new
    3. | Type_private
    type class_type =
    1. | Cty_constr of Path.t * type_expr list * class_type
    2. | Cty_signature of class_signature
    3. | Cty_arrow of Asttypes.arg_label * type_expr * class_type
    type class_declaration = {
    1. cty_params : type_expr list;
    2. mutable cty_type : class_type;
    3. cty_path : Path.t;
    4. cty_new : type_expr option;
    5. cty_variance : Variance.t list;
    6. cty_loc : Location.t;
    7. cty_attributes : Parsetree.attributes;
    8. cty_uid : Uid.t;
    }
    type class_type_declaration = {
    1. clty_params : type_expr list;
    2. clty_type : class_type;
    3. clty_path : Path.t;
    4. clty_hash_type : type_declaration;
    5. clty_variance : Variance.t list;
    6. clty_loc : Location.t;
    7. clty_attributes : Parsetree.attributes;
    8. clty_uid : Uid.t;
    }
    type visibility =
    1. | Exported
    2. | Hidden
    type module_type =
    1. | Mty_ident of Path.t
    2. | Mty_signature of signature
    3. | Mty_functor of functor_parameter * module_type
    4. | Mty_alias of Path.t
    and functor_parameter =
    1. | Unit
    2. | Named of Ident.t option * module_type
    and module_presence =
    1. | Mp_present
    2. | Mp_absent
    and signature = signature_item list
    and module_declaration = {
    1. md_type : module_type;
    2. md_attributes : Parsetree.attributes;
    3. md_loc : Location.t;
    4. md_uid : Uid.t;
    }
    and modtype_declaration = {
    1. mtd_type : module_type option;
    2. mtd_attributes : Parsetree.attributes;
    3. mtd_loc : Location.t;
    4. mtd_uid : Uid.t;
    }
    and rec_status =
    1. | Trec_not
    2. | Trec_first
    3. | Trec_next
    and ext_status =
    1. | Text_first
    2. | Text_next
    3. | Text_exception
    val item_visibility : signature_item -> visibility
    type constructor_description = {
    1. cstr_name : string;
    2. cstr_res : type_expr;
    3. cstr_existentials : type_expr list;
    4. cstr_args : type_expr list;
    5. cstr_arity : int;
    6. cstr_tag : constructor_tag;
    7. cstr_consts : int;
    8. cstr_nonconsts : int;
    9. cstr_generalized : bool;
    10. cstr_private : Asttypes.private_flag;
    11. cstr_loc : Location.t;
    12. cstr_attributes : Parsetree.attributes;
    13. cstr_inlined : type_declaration option;
    14. cstr_uid : Uid.t;
    }
    and constructor_tag =
    1. | Cstr_constant of int
    2. | Cstr_block of int
    3. | Cstr_unboxed
    4. | Cstr_extension of Path.t * bool
    val equal_tag : constructor_tag -> constructor_tag -> bool
    val may_equal_constr : + constructor_description -> + constructor_description -> + bool
    type label_description = {
    1. lbl_name : string;
    2. lbl_res : type_expr;
    3. lbl_arg : type_expr;
    4. lbl_mut : Asttypes.mutable_flag;
    5. lbl_pos : int;
    6. lbl_all : label_description array;
    7. lbl_repres : record_representation;
    8. lbl_private : Asttypes.private_flag;
    9. lbl_loc : Location.t;
    10. lbl_attributes : Parsetree.attributes;
    11. lbl_uid : Uid.t;
    }
    val bound_value_identifiers : signature -> Ident.t list

    Extracts the list of "value" identifiers bound by a signature. "Value" identifiers are identifiers for signature components that correspond to a run-time value: values, extensions, modules, classes. Note: manifest primitives do not correspond to a run-time value!

    val signature_item_id : signature_item -> Ident.t
    type snapshot
    val snapshot : unit -> snapshot
    val backtrack : cleanup_abbrev:(unit -> unit) -> snapshot -> unit
    val undo_first_change_after : snapshot -> unit
    val undo_compress : snapshot -> unit

    Functions to use when modifying a type (only Ctype?). The old values are logged and reverted on backtracking.

    val set_type_desc : type_expr -> type_desc -> unit
    val set_level : type_expr -> int -> unit
    val set_scope : type_expr -> int -> unit
    val set_name : + (Path.t * type_expr list) option ref -> + (Path.t * type_expr list) option -> + unit
    val set_univar : type_expr option ref -> type_expr -> unit
    val set_commu_ok : commutable -> unit
    diff --git a/ocaml/Typetexp/TyVarEnv/index.html b/ocaml/Typetexp/TyVarEnv/index.html new file mode 100644 index 0000000..902af5e --- /dev/null +++ b/ocaml/Typetexp/TyVarEnv/index.html @@ -0,0 +1,10 @@ + +TyVarEnv (ocaml.Typetexp.TyVarEnv)

    Module Typetexp.TyVarEnv

    val reset : unit -> unit

    removes all type variables from scope

    val with_local_scope : (unit -> 'a) -> 'a

    Evaluate in a narrowed type-variable scope

    type poly_univars
    val make_poly_univars : string list -> poly_univars

    remember that a list of strings connotes univars; this must always be paired with a check_poly_univars.

    val check_poly_univars : + Env.t -> + Location.t -> + poly_univars -> + Types.type_expr list

    Verify that the given univars are universally quantified, and return the list of variables. The type in which the univars are used must be generalised

    val instance_poly_univars : + Env.t -> + Location.t -> + poly_univars -> + Types.type_expr list

    Same as check_poly_univars, but instantiates the resulting type scheme (i.e. variables become Tvar rather than Tunivar)

    diff --git a/ocaml/Typetexp/index.html b/ocaml/Typetexp/index.html new file mode 100644 index 0000000..79faf9e --- /dev/null +++ b/ocaml/Typetexp/index.html @@ -0,0 +1,28 @@ + +Typetexp (ocaml.Typetexp)

    Module Typetexp

    module TyVarEnv : sig ... end
    val type_open : + (?used_slot:bool ref -> + Asttypes.override_flag -> + Env.t -> + Location.t -> + Longident.t Asttypes.loc -> + Path.t * Env.t) + ref
    val valid_tyvar_name : string -> bool
    val transl_simple_type : + Env.t -> + ?univars:TyVarEnv.poly_univars -> + closed:bool -> + Parsetree.core_type -> + Typedtree.core_type
    val transl_simple_type_univars : + Env.t -> + Parsetree.core_type -> + Typedtree.core_type
    val transl_simple_type_delayed : + Env.t -> + Parsetree.core_type -> + Typedtree.core_type * Types.type_expr * (unit -> unit)
    val transl_type_scheme : Env.t -> Parsetree.core_type -> Typedtree.core_type
    val transl_type_param : Env.t -> Parsetree.core_type -> Typedtree.core_type
    exception Already_bound
    type error =
    1. | Unbound_type_variable of string * string list
    2. | No_type_wildcards
    3. | Undefined_type_constructor of Path.t
    4. | Type_arity_mismatch of Longident.t * int * int
    5. | Bound_type_variable of string
    6. | Recursive_type
    7. | Type_mismatch of Errortrace.unification_error
    8. | Alias_type_mismatch of Errortrace.unification_error
    9. | Present_has_conjunction of string
    10. | Present_has_no_type of string
    11. | Constructor_mismatch of Types.type_expr * Types.type_expr
    12. | Not_a_variant of Types.type_expr
    13. | Variant_tags of string * string
    14. | Invalid_variable_name of string
    15. | Cannot_quantify of string * Types.type_expr
    16. | Multiple_constraints_on_type of Longident.t
    17. | Method_mismatch of string * Types.type_expr * Types.type_expr
    18. | Opened_object of Path.t option
    19. | Not_an_object of Types.type_expr
    exception Error of Location.t * Env.t * error
    val report_error : Env.t -> Stdlib.Format.formatter -> error -> unit
    val transl_modtype_longident : + (Location.t -> Env.t -> Longident.t -> Path.t) ref
    val transl_modtype : + (Env.t -> Parsetree.module_type -> Typedtree.module_type) ref
    val check_package_with_type_constraints : + (Location.t -> + Env.t -> + Types.module_type -> + (Longident.t Asttypes.loc * Typedtree.core_type) list -> + Types.module_type) + ref
    diff --git a/ocaml/Un_anf/index.html b/ocaml/Un_anf/index.html new file mode 100644 index 0000000..13a3eef --- /dev/null +++ b/ocaml/Un_anf/index.html @@ -0,0 +1,6 @@ + +Un_anf (ocaml.Un_anf)

    Module Un_anf

    val apply : + what:Symbol.t -> + ppf_dump:Stdlib.Format.formatter -> + Clambda.ulambda -> + Clambda.ulambda

    Expand ANF-like constructs so that pattern matches in Cmmgen will work correctly.

    diff --git a/ocaml/Unbox_closures/index.html b/ocaml/Unbox_closures/index.html new file mode 100644 index 0000000..c6fbae9 --- /dev/null +++ b/ocaml/Unbox_closures/index.html @@ -0,0 +1,11 @@ + +Unbox_closures (ocaml.Unbox_closures)

    Module Unbox_closures

    Turn free variables of closures into specialised arguments. The aim is to cause the closure to become closed.

    val rewrite_set_of_closures : + env:Inline_and_simplify_aux.Env.t -> + duplicate_function: + (env:Inline_and_simplify_aux.Env.t -> + set_of_closures:Flambda.set_of_closures -> + fun_var:Variable.t -> + new_fun_var:Variable.t -> + Flambda.function_declaration * Flambda.specialised_to Variable.Map.t) -> + set_of_closures:Flambda.set_of_closures -> + (Flambda.expr * Inlining_cost.Benefit.t) option
    diff --git a/ocaml/Unbox_free_vars_of_closures/index.html b/ocaml/Unbox_free_vars_of_closures/index.html new file mode 100644 index 0000000..3de8d0d --- /dev/null +++ b/ocaml/Unbox_free_vars_of_closures/index.html @@ -0,0 +1,5 @@ + +Unbox_free_vars_of_closures (ocaml.Unbox_free_vars_of_closures)

    Module Unbox_free_vars_of_closures

    When approximations of free variables of closures indicate that they are closures or blocks, rewrite projections from such blocks to new variables (which become free in the closures), with the defining expressions of the projections lifted out of the corresponding sets of closures.

    diff --git a/ocaml/Unbox_specialised_args/index.html b/ocaml/Unbox_specialised_args/index.html new file mode 100644 index 0000000..65ad3dc --- /dev/null +++ b/ocaml/Unbox_specialised_args/index.html @@ -0,0 +1,11 @@ + +Unbox_specialised_args (ocaml.Unbox_specialised_args)

    Module Unbox_specialised_args

    When approximations of specialised arguments indicate that they are closures or blocks, add more specialised arguments corresponding to the projections from such blocks (with definitions of such projections lifted out), such that the original specialised arguments may later be eliminated.

    This in particular enables elimination of closure allocations in examples such as:

    let rec map f = function | -> | a::l -> let r = f a in r :: map f l

    let g x = map (fun y -> x + y) 1; 2; 3; 4

    Here, the specialised version of map initially has a specialised argument f; and upon inlining there will be a projection of x from the closure of f. This pass adds a new specialised argument to carry that projection, at which point the closure of f is redundant.

    val rewrite_set_of_closures : + env:Inline_and_simplify_aux.Env.t -> + duplicate_function: + (env:Inline_and_simplify_aux.Env.t -> + set_of_closures:Flambda.set_of_closures -> + fun_var:Variable.t -> + new_fun_var:Variable.t -> + Flambda.function_declaration * Flambda.specialised_to Variable.Map.t) -> + set_of_closures:Flambda.set_of_closures -> + (Flambda.expr * Inlining_cost.Benefit.t) option
    diff --git a/ocaml/Unit_info/Artifact/index.html b/ocaml/Unit_info/Artifact/index.html new file mode 100644 index 0000000..fd8c09c --- /dev/null +++ b/ocaml/Unit_info/Artifact/index.html @@ -0,0 +1,2 @@ + +Artifact (ocaml.Unit_info.Artifact)

    Module Unit_info.Artifact

    Build artifacts

    type t

    Metadata for a single compilation artifact:

    • the module name associated to the artifact
    • the filesystem path
    • the input source file if it exists
    val source_file : t -> filename option

    source_file a is the source file of a if it exists.

    val prefix : t -> file_prefix

    prefix a is the filename prefix of the compilation artifact.

    val filename : t -> filename

    filename u is the filesystem path for a compilation artifact.

    val modname : t -> modname

    modname a is the module name of the compilation artifact.

    val from_filename : filename -> t

    from_filename filename reconstructs the module name modname_from_source filename associated to the artifact filename.

    diff --git a/ocaml/Unit_info/index.html b/ocaml/Unit_info/index.html new file mode 100644 index 0000000..9189a1f --- /dev/null +++ b/ocaml/Unit_info/index.html @@ -0,0 +1,2 @@ + +Unit_info (ocaml.Unit_info)

    Module Unit_info

    This module centralize the handling of compilation files and their metadata.

    Maybe more importantly, this module provides functions for deriving module names from strings or filenames.

    Module name convention and computation

    type modname = string
    type filename = string
    type file_prefix = string
    val modulize : string -> modname

    modulize s capitalizes the first letter of s.

    val normalize : string -> string

    normalize s uncapitalizes the first letter of s.

    val modname_from_source : filename -> modname

    modname_from_source filename is modulize stem where stem is the basename of the filename filename stripped from all its extensions. For instance, modname_from_source "/pa.th/x.ml.pp" is "X".

    Module name validation function

    val is_unit_name : modname -> bool

    is_unit_name ~strict name is true only if name can be used as a valid module name.

    Metadata for compilation unit

    type t

    Metadata for a compilation unit:

    • the module name associated to the unit
    • the filename prefix (dirname + basename with all extensions stripped) for compilation artifacts
    • the input source file For instance, when calling ocamlopt dir/x.mli -o target/y.cmi,
    • the input source file is dir/x.mli
    • the module name is Y
    • the prefix is target/y
    val source_file : t -> filename

    source_file u is the source file of u.

    val prefix : t -> file_prefix

    prefix u is the filename prefix of the unit.

    val modname : t -> modname

    modname u or artifact_modname a is the module name of the unit or compilation artifact.

    val check_unit_name : t -> unit

    check_unit_name u prints a warning if the derived module name modname u should not be used as a module name as specified by is_unit_name ~strict:true.

    val make : ?check_modname:bool -> source_file:filename -> file_prefix -> t

    make ~check ~source_file prefix associates both the source_file and the module name modname_from_source target_prefix to the prefix filesystem path prefix.

    If check_modname=true, this function emits a warning if the derived module name is not valid according to check_unit_name.

    module Artifact : sig ... end

    Derived build artifact metadata

    val cmi : t -> Artifact.t

    Those functions derive a specific artifact metadata from an unit metadata.

    val cmo : t -> Artifact.t
    val cmx : t -> Artifact.t
    val obj : t -> Artifact.t
    val cmt : t -> Artifact.t
    val cmti : t -> Artifact.t
    val annot : t -> Artifact.t
    val companion_obj : Artifact.t -> Artifact.t

    The functions below change the type of an artifact by updating the extension of its filename. Those functions purposefully do not cover all artifact kinds because we want to track which artifacts are assumed to be bundled together.

    val companion_cmt : Artifact.t -> Artifact.t
    val companion_cmi : Artifact.t -> Artifact.t

    Beware that companion_cmi a strips all extensions from the filename of a before adding the ".cmi" suffix contrarily to the other functions which only remove the rightmost extension. In other words, the companion cmi of a file something.d.cmo is something.cmi and not something.d.cmi.

    Mli and cmi derived from implementation files

    The compilation of module implementation changes in presence of mli and cmi files, the function belows help to handle this.

    val mli_from_source : t -> filename

    mli_from_source u is the interface source filename associated to the unit u. The actual suffix depends on Config.interface_suffix.

    val mli_from_artifact : Artifact.t -> filename

    mli_from_artifact t is the name of the interface source file derived from the artifact t. This variant is necessary when handling artifacts derived from an unknown source files (e.g. packed modules).

    val is_cmi : Artifact.t -> bool

    Check if the artifact is a cmi

    val find_normalized_cmi : t -> Artifact.t

    find_normalized_cmi u finds in the load_path a file matching the module name modname u.

    • raises Not_found

      if no such cmi exists

    diff --git a/ocaml/Unix/LargeFile/index.html b/ocaml/Unix/LargeFile/index.html new file mode 100644 index 0000000..1d67f48 --- /dev/null +++ b/ocaml/Unix/LargeFile/index.html @@ -0,0 +1,2 @@ + +LargeFile (ocaml.Unix.LargeFile)

    Module Unix.LargeFile

    File operations on large files. This sub-module provides 64-bit variants of the functions lseek (for positioning a file descriptor), truncate and ftruncate (for changing the size of a file), and stat, lstat and fstat (for obtaining information on files). These alternate functions represent positions and sizes by 64-bit integers (type int64) instead of regular integers (type int), thus allowing operating on files whose sizes are greater than max_int.

    val lseek : file_descr -> int64 -> seek_command -> int64

    See lseek.

    val truncate : string -> int64 -> unit

    See truncate.

    val ftruncate : file_descr -> int64 -> unit

    See ftruncate.

    type stats = {
    1. st_dev : int;
      (*

      Device number

      *)
    2. st_ino : int;
      (*

      Inode number

      *)
    3. st_kind : file_kind;
      (*

      Kind of the file

      *)
    4. st_perm : file_perm;
      (*

      Access rights

      *)
    5. st_uid : int;
      (*

      User id of the owner

      *)
    6. st_gid : int;
      (*

      Group ID of the file's group

      *)
    7. st_rdev : int;
      (*

      Device ID (if special file)

      *)
    8. st_size : int64;
      (*

      Size in bytes

      *)
    9. st_atime : float;
      (*

      Last access time

      *)
    10. st_mtime : float;
      (*

      Last modification time

      *)
    11. st_ctime : float;
      (*

      Last status change time

      *)
    }
    val stat : string -> stats
    val lstat : string -> stats
    val fstat : file_descr -> stats
    diff --git a/ocaml/Unix/index.html b/ocaml/Unix/index.html new file mode 100644 index 0000000..6a208bd --- /dev/null +++ b/ocaml/Unix/index.html @@ -0,0 +1,86 @@ + +Unix (ocaml.Unix)

    Module Unix

    Interface to the Unix system.

    To use the labeled version of this module, add module Unix = UnixLabels in your implementation.

    Note: all the functions of this module (except error_message and handle_unix_error) are liable to raise the Unix_error exception whenever the underlying system call signals an error.

    Error report

    type error =
    1. | E2BIG
      (*

      Argument list too long

      *)
    2. | EACCES
      (*

      Permission denied

      *)
    3. | EAGAIN
      (*

      Resource temporarily unavailable; try again

      *)
    4. | EBADF
      (*

      Bad file descriptor

      *)
    5. | EBUSY
      (*

      Resource unavailable

      *)
    6. | ECHILD
      (*

      No child process

      *)
    7. | EDEADLK
      (*

      Resource deadlock would occur

      *)
    8. | EDOM
      (*

      Domain error for math functions, etc.

      *)
    9. | EEXIST
      (*

      File exists

      *)
    10. | EFAULT
      (*

      Bad address

      *)
    11. | EFBIG
      (*

      File too large

      *)
    12. | EINTR
      (*

      Function interrupted by signal

      *)
    13. | EINVAL
      (*

      Invalid argument

      *)
    14. | EIO
      (*

      Hardware I/O error

      *)
    15. | EISDIR
      (*

      Is a directory

      *)
    16. | EMFILE
      (*

      Too many open files by the process

      *)
    17. | ENAMETOOLONG
      (*

      Filename too long

      *)
    18. | ENFILE
      (*

      Too many open files in the system

      *)
    19. | ENODEV
      (*

      No such device

      *)
    20. | ENOENT
      (*

      No such file or directory

      *)
    21. | ENOEXEC
      (*

      Not an executable file

      *)
    22. | ENOLCK
      (*

      No locks available

      *)
    23. | ENOMEM
      (*

      Not enough memory

      *)
    24. | ENOSPC
      (*

      No space left on device

      *)
    25. | ENOSYS
      (*

      Function not supported

      *)
    26. | ENOTDIR
      (*

      Not a directory

      *)
    27. | ENOTEMPTY
      (*

      Directory not empty

      *)
    28. | ENOTTY
      (*

      Inappropriate I/O control operation

      *)
    29. | ENXIO
      (*

      No such device or address

      *)
    30. | EPERM
      (*

      Operation not permitted

      *)
    31. | EPIPE
      (*

      Broken pipe

      *)
    32. | ERANGE
      (*

      Result too large

      *)
    33. | EROFS
      (*

      Read-only file system

      *)
    34. | ESPIPE
      (*

      Invalid seek e.g. on a pipe

      *)
    35. | ESRCH
      (*

      No such process

      *)
    36. | EXDEV
      (*

      Invalid link

      *)
    37. | EWOULDBLOCK
      (*

      Operation would block

      *)
    38. | EINPROGRESS
      (*

      Operation now in progress

      *)
    39. | EALREADY
      (*

      Operation already in progress

      *)
    40. | ENOTSOCK
      (*

      Socket operation on non-socket

      *)
    41. | EDESTADDRREQ
      (*

      Destination address required

      *)
    42. | EMSGSIZE
      (*

      Message too long

      *)
    43. | EPROTOTYPE
      (*

      Protocol wrong type for socket

      *)
    44. | ENOPROTOOPT
      (*

      Protocol not available

      *)
    45. | EPROTONOSUPPORT
      (*

      Protocol not supported

      *)
    46. | ESOCKTNOSUPPORT
      (*

      Socket type not supported

      *)
    47. | EOPNOTSUPP
      (*

      Operation not supported on socket

      *)
    48. | EPFNOSUPPORT
      (*

      Protocol family not supported

      *)
    49. | EAFNOSUPPORT
      (*

      Address family not supported by protocol family

      *)
    50. | EADDRINUSE
      (*

      Address already in use

      *)
    51. | EADDRNOTAVAIL
      (*

      Can't assign requested address

      *)
    52. | ENETDOWN
      (*

      Network is down

      *)
    53. | ENETUNREACH
      (*

      Network is unreachable

      *)
    54. | ENETRESET
      (*

      Network dropped connection on reset

      *)
    55. | ECONNABORTED
      (*

      Software caused connection abort

      *)
    56. | ECONNRESET
      (*

      Connection reset by peer

      *)
    57. | ENOBUFS
      (*

      No buffer space available

      *)
    58. | EISCONN
      (*

      Socket is already connected

      *)
    59. | ENOTCONN
      (*

      Socket is not connected

      *)
    60. | ESHUTDOWN
      (*

      Can't send after socket shutdown

      *)
    61. | ETOOMANYREFS
      (*

      Too many references: can't splice

      *)
    62. | ETIMEDOUT
      (*

      Connection timed out

      *)
    63. | ECONNREFUSED
      (*

      Connection refused

      *)
    64. | EHOSTDOWN
      (*

      Host is down

      *)
    65. | EHOSTUNREACH
      (*

      No route to host

      *)
    66. | ELOOP
      (*

      Too many levels of symbolic links

      *)
    67. | EOVERFLOW
      (*

      File size or position not representable

      *)
    68. | EUNKNOWNERR of int
      (*

      Unknown error

      *)

    The type of error codes. Errors defined in the POSIX standard and additional errors from UNIX98 and BSD. All other errors are mapped to EUNKNOWNERR.

    exception Unix_error of error * string * string

    Raised by the system calls below when an error is encountered. The first component is the error code; the second component is the function name; the third component is the string parameter to the function, if it has one, or the empty string otherwise.

    UnixLabels.Unix_error and Unix.Unix_error are the same, and catching one will catch the other.

    val error_message : error -> string

    Return a string describing the given error code.

    val handle_unix_error : ('a -> 'b) -> 'a -> 'b

    handle_unix_error f x applies f to x and returns the result. If the exception Unix_error is raised, it prints a message describing the error and exits with code 2.

    Access to the process environment

    val environment : unit -> string array

    Return the process environment, as an array of strings with the format ``variable=value''. The returned array is empty if the process has special privileges.

    val unsafe_environment : unit -> string array

    Return the process environment, as an array of strings with the format ``variable=value''. Unlike environment, this function returns a populated array even if the process has special privileges. See the documentation for unsafe_getenv for more details.

    • since 4.06 (4.12 in UnixLabels)
    val getenv : string -> string

    Return the value associated to a variable in the process environment, unless the process has special privileges.

    • raises Not_found

      if the variable is unbound or the process has special privileges.

    This function is identical to Sys.getenv.

    val unsafe_getenv : string -> string

    Return the value associated to a variable in the process environment.

    Unlike getenv, this function returns the value even if the process has special privileges. It is considered unsafe because the programmer of a setuid or setgid program must be careful to avoid using maliciously crafted environment variables in the search path for executables, the locations for temporary files or logs, and the like.

    • raises Not_found

      if the variable is unbound.

    • since 4.06
    val putenv : string -> string -> unit

    putenv name value sets the value associated to a variable in the process environment. name is the name of the environment variable, and value its new associated value.

    Process handling

    type process_status =
    1. | WEXITED of int
      (*

      The process terminated normally by exit; the argument is the return code.

      *)
    2. | WSIGNALED of int
      (*

      The process was killed by a signal; the argument is the signal number.

      *)
    3. | WSTOPPED of int
      (*

      The process was stopped by a signal; the argument is the signal number.

      *)

    The termination status of a process. See module Sys for the definitions of the standard signal numbers. Note that they are not the numbers used by the OS.

    On Windows: only WEXITED is used (as there are no inter-process signals) but with specific return codes to indicate special termination causes. Look for NTSTATUS values in the Windows documentation to decode such error return codes. In particular, STATUS_ACCESS_VIOLATION error code is the 32-bit 0xC0000005: as Int32.of_int 0xC0000005 is -1073741819, WEXITED -1073741819 is the Windows equivalent of WSIGNALED Sys.sigsegv.

    type wait_flag =
    1. | WNOHANG
      (*

      Do not block if no child has died yet, but immediately return with a pid equal to 0.

      *)
    2. | WUNTRACED
      (*

      Report also the children that receive stop signals.

      *)

    Flags for waitpid.

    val execv : string -> string array -> 'a

    execv prog args execute the program in file prog, with the arguments args, and the current process environment. Note that the first argument, args.(0), is by convention the filename of the program being executed, just like Sys.argv.(0). These execv* functions never return: on success, the current program is replaced by the new one.

    On Windows: the CRT simply spawns a new process and exits the current one. This will have unwanted consequences if e.g. another process is waiting on the current one. Using create_process or one of the open_process_* functions instead is recommended.

    val execve : string -> string array -> string array -> 'a

    Same as execv, except that the third argument provides the environment to the program executed.

    val execvp : string -> string array -> 'a

    Same as execv, except that the program is searched in the path.

    val execvpe : string -> string array -> string array -> 'a

    Same as execve, except that the program is searched in the path.

    val fork : unit -> int

    Fork a new process. The returned integer is 0 for the child process, the pid of the child process for the parent process. It fails if the OCaml process is multi-core (any domain has been spawned). In addition, if any thread from the Thread module has been spawned, then the child process might be in a corrupted state.

    • raises Invalid_argument

      on Windows. Use create_process or threads instead.

    • raises Failure

      if any domain has been spawned.

    val wait : unit -> int * process_status

    Wait until one of the children processes die, and return its pid and termination status.

    • raises Invalid_argument

      on Windows. Use waitpid instead.

    val waitpid : wait_flag list -> int -> int * process_status

    Same as wait, but waits for the child process whose pid is given. A pid of -1 means wait for any child. A pid of 0 means wait for any child in the same process group as the current process. Negative pid arguments represent process groups. The list of options indicates whether waitpid should return immediately without waiting, and whether it should report stopped children.

    On Windows: can only wait for a given PID, not any child process.

    val system : string -> process_status

    Execute the given command, wait until it terminates, and return its termination status. The string is interpreted by the shell /bin/sh (or the command interpreter cmd.exe on Windows) and therefore can contain redirections, quotes, variables, etc. To properly quote whitespace and shell special characters occurring in file names or command arguments, the use of Filename.quote_command is recommended. The result WEXITED 127 indicates that the shell couldn't be executed.

    val _exit : int -> 'a

    Terminate the calling process immediately, returning the given status code to the operating system: usually 0 to indicate no errors, and a small positive integer to indicate failure. Unlike Stdlib.exit, Unix._exit performs no finalization whatsoever: functions registered with Stdlib.at_exit are not called, input/output channels are not flushed, and the C run-time system is not finalized either.

    The typical use of Unix._exit is after a Unix.fork operation, when the child process runs into a fatal error and must exit. In this case, it is preferable to not perform any finalization action in the child process, as these actions could interfere with similar actions performed by the parent process. For example, output channels should not be flushed by the child process, as the parent process may flush them again later, resulting in duplicate output.

    • since 4.12
    val getpid : unit -> int

    Return the pid of the process.

    val getppid : unit -> int

    Return the pid of the parent process.

    • raises Invalid_argument

      on Windows (because it is meaningless)

    val nice : int -> int

    Change the process priority. The integer argument is added to the ``nice'' value. (Higher values of the ``nice'' value mean lower priorities.) Return the new nice value.

    • raises Invalid_argument

      on Windows

    Basic file input/output

    type file_descr

    The abstract type of file descriptors.

    val stdin : file_descr

    File descriptor for standard input.

    val stdout : file_descr

    File descriptor for standard output.

    val stderr : file_descr

    File descriptor for standard error.

    type open_flag =
    1. | O_RDONLY
      (*

      Open for reading

      *)
    2. | O_WRONLY
      (*

      Open for writing

      *)
    3. | O_RDWR
      (*

      Open for reading and writing

      *)
    4. | O_NONBLOCK
      (*

      Open in non-blocking mode

      *)
    5. | O_APPEND
      (*

      Open for append

      *)
    6. | O_CREAT
      (*

      Create if nonexistent

      *)
    7. | O_TRUNC
      (*

      Truncate to 0 length if existing

      *)
    8. | O_EXCL
      (*

      Fail if existing

      *)
    9. | O_NOCTTY
      (*

      Don't make this dev a controlling tty

      *)
    10. | O_DSYNC
      (*

      Writes complete as `Synchronised I/O data integrity completion'

      *)
    11. | O_SYNC
      (*

      Writes complete as `Synchronised I/O file integrity completion'

      *)
    12. | O_RSYNC
      (*

      Reads complete as writes (depending on O_SYNC/O_DSYNC)

      *)
    13. | O_SHARE_DELETE
      (*

      Windows only: allow the file to be deleted while still open

      *)
    14. | O_CLOEXEC
      (*

      Set the close-on-exec flag on the descriptor returned by openfile. See set_close_on_exec for more information.

      *)
    15. | O_KEEPEXEC
      (*

      Clear the close-on-exec flag. This is currently the default.

      *)

    The flags to openfile.

    type file_perm = int

    The type of file access rights, e.g. 0o640 is read and write for user, read for group, none for others

    val openfile : string -> open_flag list -> file_perm -> file_descr

    Open the named file with the given flags. Third argument is the permissions to give to the file if it is created (see umask). Return a file descriptor on the named file.

    val close : file_descr -> unit

    Close a file descriptor.

    val fsync : file_descr -> unit

    Flush file buffers to disk.

    • since 4.08 (4.12 in UnixLabels)
    val read : file_descr -> bytes -> int -> int -> int

    read fd buf pos len reads len bytes from descriptor fd, storing them in byte sequence buf, starting at position pos in buf. Return the number of bytes actually read.

    val read_bigarray : + file_descr -> + (_, Stdlib.Bigarray.int8_unsigned_elt, Stdlib.Bigarray.c_layout) + Stdlib.Bigarray.Array1.t -> + int -> + int -> + int

    Same as read, but read the data into a bigarray.

    • since 5.2
    val write : file_descr -> bytes -> int -> int -> int

    write fd buf pos len writes len bytes to descriptor fd, taking them from byte sequence buf, starting at position pos in buff. Return the number of bytes actually written. write repeats the writing operation until all bytes have been written or an error occurs.

    val write_bigarray : + file_descr -> + (_, Stdlib.Bigarray.int8_unsigned_elt, Stdlib.Bigarray.c_layout) + Stdlib.Bigarray.Array1.t -> + int -> + int -> + int

    Same as write, but take the data from a bigarray.

    • since 5.2
    val single_write : file_descr -> bytes -> int -> int -> int

    Same as write, but attempts to write only once. Thus, if an error occurs, single_write guarantees that no data has been written.

    val write_substring : file_descr -> string -> int -> int -> int

    Same as write, but take the data from a string instead of a byte sequence.

    • since 4.02
    val single_write_substring : file_descr -> string -> int -> int -> int

    Same as single_write, but take the data from a string instead of a byte sequence.

    • since 4.02
    val single_write_bigarray : + file_descr -> + (_, Stdlib.Bigarray.int8_unsigned_elt, Stdlib.Bigarray.c_layout) + Stdlib.Bigarray.Array1.t -> + int -> + int -> + int

    Same as single_write, but take the data from a bigarray.

    • since 5.2

    Interfacing with the standard input/output library

    val in_channel_of_descr : file_descr -> in_channel

    Create an input channel reading from the given descriptor. The channel is initially in binary mode; use set_binary_mode_in ic false if text mode is desired. Text mode is supported only if the descriptor refers to a file or pipe, but is not supported if it refers to a socket.

    On Windows: Stdlib.set_binary_mode_in always fails on channels created with this function.

    Beware that input channels are buffered, so more characters may have been read from the descriptor than those accessed using channel functions. Channels also keep a copy of the current position in the file.

    Closing the channel ic returned by in_channel_of_descr fd using close_in ic also closes the underlying descriptor fd. It is incorrect to close both the channel ic and the descriptor fd.

    If several channels are created on the same descriptor, one of the channels must be closed, but not the others. Consider for example a descriptor s connected to a socket and two channels ic = in_channel_of_descr s and oc = out_channel_of_descr s. The recommended closing protocol is to perform close_out oc, which flushes buffered output to the socket then closes the socket. The ic channel must not be closed and will be collected by the GC eventually.

    val out_channel_of_descr : file_descr -> out_channel

    Create an output channel writing on the given descriptor. The channel is initially in binary mode; use set_binary_mode_out oc false if text mode is desired. Text mode is supported only if the descriptor refers to a file or pipe, but is not supported if it refers to a socket.

    On Windows: Stdlib.set_binary_mode_out always fails on channels created with this function.

    Beware that output channels are buffered, so you may have to call Stdlib.flush to ensure that all data has been sent to the descriptor. Channels also keep a copy of the current position in the file.

    Closing the channel oc returned by out_channel_of_descr fd using close_out oc also closes the underlying descriptor fd. It is incorrect to close both the channel ic and the descriptor fd.

    See Unix.in_channel_of_descr for a discussion of the closing protocol when several channels are created on the same descriptor.

    val descr_of_in_channel : in_channel -> file_descr

    Return the descriptor corresponding to an input channel.

    val descr_of_out_channel : out_channel -> file_descr

    Return the descriptor corresponding to an output channel.

    Seeking and truncating

    type seek_command =
    1. | SEEK_SET
      (*

      indicates positions relative to the beginning of the file

      *)
    2. | SEEK_CUR
      (*

      indicates positions relative to the current position

      *)
    3. | SEEK_END
      (*

      indicates positions relative to the end of the file

      *)

    Positioning modes for lseek.

    val lseek : file_descr -> int -> seek_command -> int

    Set the current position for a file descriptor, and return the resulting offset (from the beginning of the file).

    val truncate : string -> int -> unit

    Truncates the named file to the given size.

    val ftruncate : file_descr -> int -> unit

    Truncates the file corresponding to the given descriptor to the given size.

    File status

    type file_kind =
    1. | S_REG
      (*

      Regular file

      *)
    2. | S_DIR
      (*

      Directory

      *)
    3. | S_CHR
      (*

      Character device

      *)
    4. | S_BLK
      (*

      Block device

      *)
    5. | S_LNK
      (*

      Symbolic link

      *)
    6. | S_FIFO
      (*

      Named pipe

      *)
    7. | S_SOCK
      (*

      Socket

      *)
    type stats = {
    1. st_dev : int;
      (*

      Device number

      *)
    2. st_ino : int;
      (*

      Inode number

      *)
    3. st_kind : file_kind;
      (*

      Kind of the file

      *)
    4. st_perm : file_perm;
      (*

      Access rights

      *)
    5. st_uid : int;
      (*

      User id of the owner

      *)
    6. st_gid : int;
      (*

      Group ID of the file's group

      *)
    7. st_rdev : int;
      (*

      Device ID (if special file)

      *)
    8. st_size : int;
      (*

      Size in bytes

      *)
    9. st_atime : float;
      (*

      Last access time

      *)
    10. st_mtime : float;
      (*

      Last modification time

      *)
    11. st_ctime : float;
      (*

      Last status change time

      *)
    }

    The information returned by the stat calls.

    val stat : string -> stats

    Return the information for the named file.

    val lstat : string -> stats

    Same as stat, but in case the file is a symbolic link, return the information for the link itself.

    val fstat : file_descr -> stats

    Return the information for the file associated with the given descriptor.

    val isatty : file_descr -> bool

    Return true if the given file descriptor refers to a terminal or console window, false otherwise.

    File operations on large files

    module LargeFile : sig ... end

    File operations on large files. This sub-module provides 64-bit variants of the functions lseek (for positioning a file descriptor), truncate and ftruncate (for changing the size of a file), and stat, lstat and fstat (for obtaining information on files). These alternate functions represent positions and sizes by 64-bit integers (type int64) instead of regular integers (type int), thus allowing operating on files whose sizes are greater than max_int.

    Mapping files into memory

    val map_file : + file_descr -> + ?pos:int64 -> + ('a, 'b) Stdlib.Bigarray.kind -> + 'c Stdlib.Bigarray.layout -> + bool -> + int array -> + ('a, 'b, 'c) Stdlib.Bigarray.Genarray.t

    Memory mapping of a file as a Bigarray. map_file fd kind layout shared dims returns a Bigarray of kind kind, layout layout, and dimensions as specified in dims. The data contained in this Bigarray are the contents of the file referred to by the file descriptor fd (as opened previously with openfile, for example). The optional pos parameter is the byte offset in the file of the data being mapped; it defaults to 0 (map from the beginning of the file).

    If shared is true, all modifications performed on the array are reflected in the file. This requires that fd be opened with write permissions. If shared is false, modifications performed on the array are done in memory only, using copy-on-write of the modified pages; the underlying file is not affected.

    map_file is much more efficient than reading the whole file in a Bigarray, modifying that Bigarray, and writing it afterwards.

    To adjust automatically the dimensions of the Bigarray to the actual size of the file, the major dimension (that is, the first dimension for an array with C layout, and the last dimension for an array with Fortran layout) can be given as -1. map_file then determines the major dimension from the size of the file. The file must contain an integral number of sub-arrays as determined by the non-major dimensions, otherwise Failure is raised.

    If all dimensions of the Bigarray are given, the file size is matched against the size of the Bigarray. If the file is larger than the Bigarray, only the initial portion of the file is mapped to the Bigarray. If the file is smaller than the big array, the file is automatically grown to the size of the Bigarray. This requires write permissions on fd.

    Array accesses are bounds-checked, but the bounds are determined by the initial call to map_file. Therefore, you should make sure no other process modifies the mapped file while you're accessing it, or a SIGBUS signal may be raised. This happens, for instance, if the file is shrunk.

    Invalid_argument or Failure may be raised in cases where argument validation fails.

    • since 4.06

    Operations on file names

    Removes the named file.

    If the named file is a directory, raises:

    • EPERM on POSIX compliant system
    • EISDIR on Linux >= 2.1.132
    • EACCESS on Windows
    val rename : string -> string -> unit

    rename src dst changes the name of a file from src to dst, moving it between directories if needed. If dst already exists, its contents will be replaced with those of src. Depending on the operating system, the metadata (permissions, owner, etc) of dst can either be preserved or be replaced by those of src.

    link ?follow src dst creates a hard link named dst to the file named src.

    • parameter follow

      indicates whether a src symlink is followed or a hardlink to src itself will be created. On Unix systems this is done using the linkat(2) function. If ?follow is not provided, then the link(2) function is used whose behaviour is OS-dependent, but more widely available.

    • raises ENOSYS

      On Unix if ~follow:_ is requested, but linkat is unavailable.

    • raises ENOSYS

      On Windows if ~follow:false is requested.

    val realpath : string -> string

    realpath p is an absolute pathname for p obtained by resolving all extra / characters, relative path segments and symbolic links.

    • since 4.13

    File permissions and ownership

    type access_permission =
    1. | R_OK
      (*

      Read permission

      *)
    2. | W_OK
      (*

      Write permission

      *)
    3. | X_OK
      (*

      Execution permission

      *)
    4. | F_OK
      (*

      File exists

      *)

    Flags for the access call.

    val chmod : string -> file_perm -> unit

    Change the permissions of the named file.

    val fchmod : file_descr -> file_perm -> unit

    Change the permissions of an opened file.

    • raises Invalid_argument

      on Windows

    val chown : string -> int -> int -> unit

    Change the owner uid and owner gid of the named file.

    • raises Invalid_argument

      on Windows

    val fchown : file_descr -> int -> int -> unit

    Change the owner uid and owner gid of an opened file.

    • raises Invalid_argument

      on Windows

    val umask : file_perm -> file_perm

    Set the process's file mode creation mask, and return the previous mask.

    • raises Invalid_argument

      on Windows

    val access : string -> access_permission list -> unit

    Check that the process has the given permissions over the named file.

    On Windows: execute permission X_OK cannot be tested, just tests for read permission instead.

    Operations on file descriptors

    val dup : ?cloexec:bool -> file_descr -> file_descr

    Return a new file descriptor referencing the same file as the given descriptor. See set_close_on_exec for documentation on the cloexec optional argument.

    val dup2 : ?cloexec:bool -> file_descr -> file_descr -> unit

    dup2 src dst duplicates src to dst, closing dst if already opened. See set_close_on_exec for documentation on the cloexec optional argument.

    val set_nonblock : file_descr -> unit

    Set the ``non-blocking'' flag on the given descriptor. When the non-blocking flag is set, reading on a descriptor on which there is temporarily no data available raises the EAGAIN or EWOULDBLOCK error instead of blocking; writing on a descriptor on which there is temporarily no room for writing also raises EAGAIN or EWOULDBLOCK.

    val clear_nonblock : file_descr -> unit

    Clear the ``non-blocking'' flag on the given descriptor. See set_nonblock.

    val set_close_on_exec : file_descr -> unit

    Set the ``close-on-exec'' flag on the given descriptor. A descriptor with the close-on-exec flag is automatically closed when the current process starts another program with one of the exec, create_process and open_process functions.

    It is often a security hole to leak file descriptors opened on, say, a private file to an external program: the program, then, gets access to the private file and can do bad things with it. Hence, it is highly recommended to set all file descriptors ``close-on-exec'', except in the very few cases where a file descriptor actually needs to be transmitted to another program.

    The best way to set a file descriptor ``close-on-exec'' is to create it in this state. To this end, the openfile function has O_CLOEXEC and O_KEEPEXEC flags to enforce ``close-on-exec'' mode or ``keep-on-exec'' mode, respectively. All other operations in the Unix module that create file descriptors have an optional argument ?cloexec:bool to indicate whether the file descriptor should be created in ``close-on-exec'' mode (by writing ~cloexec:true) or in ``keep-on-exec'' mode (by writing ~cloexec:false). For historical reasons, the default file descriptor creation mode is ``keep-on-exec'', if no cloexec optional argument is given. This is not a safe default, hence it is highly recommended to pass explicit cloexec arguments to operations that create file descriptors.

    The cloexec optional arguments and the O_KEEPEXEC flag were introduced in OCaml 4.05. Earlier, the common practice was to create file descriptors in the default, ``keep-on-exec'' mode, then call set_close_on_exec on those freshly-created file descriptors. This is not as safe as creating the file descriptor in ``close-on-exec'' mode because, in multithreaded programs, a window of vulnerability exists between the time when the file descriptor is created and the time set_close_on_exec completes. If another thread spawns another program during this window, the descriptor will leak, as it is still in the ``keep-on-exec'' mode.

    Regarding the atomicity guarantees given by ~cloexec:true or by the use of the O_CLOEXEC flag: on all platforms it is guaranteed that a concurrently-executing Caml thread cannot leak the descriptor by starting a new process. On Linux, this guarantee extends to concurrently-executing C threads. As of Feb 2017, other operating systems lack the necessary system calls and still expose a window of vulnerability during which a C thread can see the newly-created file descriptor in ``keep-on-exec'' mode.

    val clear_close_on_exec : file_descr -> unit

    Clear the ``close-on-exec'' flag on the given descriptor. See set_close_on_exec.

    Directories

    val mkdir : string -> file_perm -> unit

    Create a directory with the given permissions (see umask).

    val rmdir : string -> unit

    Remove an empty directory.

    val chdir : string -> unit

    Change the process working directory.

    val getcwd : unit -> string

    Return the name of the current working directory.

    val chroot : string -> unit

    Change the process root directory.

    • raises Invalid_argument

      on Windows

    type dir_handle

    The type of descriptors over opened directories.

    val opendir : string -> dir_handle

    Open a descriptor on a directory

    val readdir : dir_handle -> string

    Return the next entry in a directory.

    • raises End_of_file

      when the end of the directory has been reached.

    val rewinddir : dir_handle -> unit

    Reposition the descriptor to the beginning of the directory

    val closedir : dir_handle -> unit

    Close a directory descriptor.

    Pipes and redirections

    val pipe : ?cloexec:bool -> unit -> file_descr * file_descr

    Create a pipe. The first component of the result is opened for reading, that's the exit to the pipe. The second component is opened for writing, that's the entrance to the pipe. See set_close_on_exec for documentation on the cloexec optional argument.

    val mkfifo : string -> file_perm -> unit

    Create a named pipe with the given permissions (see umask).

    • raises Invalid_argument

      on Windows

    High-level process and redirection management

    val create_process : + string -> + string array -> + file_descr -> + file_descr -> + file_descr -> + int

    create_process prog args stdin stdout stderr creates a new process that executes the program in file prog, with arguments args. Note that the first argument, args.(0), is by convention the filename of the program being executed, just like Sys.argv.(0). The pid of the new process is returned immediately; the new process executes concurrently with the current process. The standard input and outputs of the new process are connected to the descriptors stdin, stdout and stderr. Passing e.g. Unix.stdout for stdout prevents the redirection and causes the new process to have the same standard output as the current process. The executable file prog is searched in the path. The new process has the same environment as the current process.

    val create_process_env : + string -> + string array -> + string array -> + file_descr -> + file_descr -> + file_descr -> + int

    create_process_env prog args env stdin stdout stderr works as create_process, except that the extra argument env specifies the environment passed to the program.

    val open_process_in : string -> in_channel

    High-level pipe and process management. This function runs the given command in parallel with the program. The standard output of the command is redirected to a pipe, which can be read via the returned input channel. The command is interpreted by the shell /bin/sh (or cmd.exe on Windows), cf. system. The Filename.quote_command function can be used to quote the command and its arguments as appropriate for the shell being used. If the command does not need to be run through the shell, open_process_args_in can be used as a more robust and more efficient alternative to open_process_in.

    val open_process_out : string -> out_channel

    Same as open_process_in, but redirect the standard input of the command to a pipe. Data written to the returned output channel is sent to the standard input of the command. Warning: writes on output channels are buffered, hence be careful to call Stdlib.flush at the right times to ensure correct synchronization. If the command does not need to be run through the shell, open_process_args_out can be used instead of open_process_out.

    val open_process : string -> in_channel * out_channel

    Same as open_process_out, but redirects both the standard input and standard output of the command to pipes connected to the two returned channels. The input channel is connected to the output of the command, and the output channel to the input of the command. If the command does not need to be run through the shell, open_process_args can be used instead of open_process.

    val open_process_full : + string -> + string array -> + in_channel * out_channel * in_channel

    Similar to open_process, but the second argument specifies the environment passed to the command. The result is a triple of channels connected respectively to the standard output, standard input, and standard error of the command. If the command does not need to be run through the shell, open_process_args_full can be used instead of open_process_full.

    val open_process_args : string -> string array -> in_channel * out_channel

    open_process_args prog args runs the program prog with arguments args. Note that the first argument, args.(0), is by convention the filename of the program being executed, just like Sys.argv.(0). The new process executes concurrently with the current process. The standard input and output of the new process are redirected to pipes, which can be respectively read and written via the returned channels. The input channel is connected to the output of the program, and the output channel to the input of the program.

    Warning: writes on output channels are buffered, hence be careful to call Stdlib.flush at the right times to ensure correct synchronization.

    The executable file prog is searched for in the path. This behaviour changed in 4.12; previously prog was looked up only in the current directory.

    The new process has the same environment as the current process.

    • since 4.08
    val open_process_args_in : string -> string array -> in_channel

    Same as open_process_args, but redirects only the standard output of the new process.

    • since 4.08
    val open_process_args_out : string -> string array -> out_channel

    Same as open_process_args, but redirects only the standard input of the new process.

    • since 4.08
    val open_process_args_full : + string -> + string array -> + string array -> + in_channel * out_channel * in_channel

    Similar to open_process_args, but the third argument specifies the environment passed to the new process. The result is a triple of channels connected respectively to the standard output, standard input, and standard error of the program.

    • since 4.08
    val process_in_pid : in_channel -> int

    Return the pid of a process opened via open_process_args_in or the pid of the shell opened via open_process_in.

    • since 4.08 (4.12 in UnixLabels)
    val process_out_pid : out_channel -> int

    Return the pid of a process opened via open_process_args_out or the pid of the shell opened via open_process_out.

    • since 4.08 (4.12 in UnixLabels)
    val process_pid : (in_channel * out_channel) -> int

    Return the pid of a process opened via open_process_args or the pid of the shell opened via open_process_args.

    • since 4.08 (4.12 in UnixLabels)
    val process_full_pid : (in_channel * out_channel * in_channel) -> int

    Return the pid of a process opened via open_process_args_full or the pid of the shell opened via open_process_full.

    • since 4.08 (4.12 in UnixLabels)
    val close_process_in : in_channel -> process_status

    Close channels opened by open_process_in, wait for the associated command to terminate, and return its termination status.

    val close_process_out : out_channel -> process_status

    Close channels opened by open_process_out, wait for the associated command to terminate, and return its termination status.

    val close_process : (in_channel * out_channel) -> process_status

    Close channels opened by open_process, wait for the associated command to terminate, and return its termination status.

    val close_process_full : + (in_channel * out_channel * in_channel) -> + process_status

    Close channels opened by open_process_full, wait for the associated command to terminate, and return its termination status.

    symlink ?to_dir src dst creates the file dst as a symbolic link to the file src. On Windows, ~to_dir indicates if the symbolic link points to a directory or a file; if omitted, symlink examines src using stat and picks appropriately, if src does not exist then false is assumed (for this reason, it is recommended that the ~to_dir parameter be specified in new code). On Unix, ~to_dir is ignored.

    Windows symbolic links are available in Windows Vista onwards. There are some important differences between Windows symlinks and their POSIX counterparts.

    Windows symbolic links come in two flavours: directory and regular, which designate whether the symbolic link points to a directory or a file. The type must be correct - a directory symlink which actually points to a file cannot be selected with chdir and a file symlink which actually points to a directory cannot be read or written (note that Cygwin's emulation layer ignores this distinction).

    When symbolic links are created to existing targets, this distinction doesn't matter and symlink will automatically create the correct kind of symbolic link. The distinction matters when a symbolic link is created to a non-existent target.

    The other caveat is that by default symbolic links are a privileged operation. Administrators will always need to be running elevated (or with UAC disabled) and by default normal user accounts need to be granted the SeCreateSymbolicLinkPrivilege via Local Security Policy (secpol.msc) or via Active Directory.

    has_symlink can be used to check that a process is able to create symbolic links.

    Returns true if the user is able to create symbolic links. On Windows, this indicates that the user not only has the SeCreateSymbolicLinkPrivilege but is also running elevated, if necessary. On other platforms, this is simply indicates that the symlink system call is available.

    • since 4.03

    Read the contents of a symbolic link.

    Polling

    val select : + file_descr list -> + file_descr list -> + file_descr list -> + float -> + file_descr list * file_descr list * file_descr list

    Wait until some input/output operations become possible on some channels. The three list arguments are, respectively, a set of descriptors to check for reading (first argument), for writing (second argument), or for exceptional conditions (third argument). The fourth argument is the maximal timeout, in seconds; a negative fourth argument means no timeout (unbounded wait). The result is composed of three sets of descriptors: those ready for reading (first component), ready for writing (second component), and over which an exceptional condition is pending (third component).

    Locking

    type lock_command =
    1. | F_ULOCK
      (*

      Unlock a region

      *)
    2. | F_LOCK
      (*

      Lock a region for writing, and block if already locked

      *)
    3. | F_TLOCK
      (*

      Lock a region for writing, or fail if already locked

      *)
    4. | F_TEST
      (*

      Test a region for other process locks

      *)
    5. | F_RLOCK
      (*

      Lock a region for reading, and block if already locked

      *)
    6. | F_TRLOCK
      (*

      Lock a region for reading, or fail if already locked

      *)

    Commands for lockf.

    val lockf : file_descr -> lock_command -> int -> unit

    lockf fd mode len puts a lock on a region of the file opened as fd. The region starts at the current read/write position for fd (as set by lseek), and extends len bytes forward if len is positive, len bytes backwards if len is negative, or to the end of the file if len is zero. A write lock prevents any other process from acquiring a read or write lock on the region. A read lock prevents any other process from acquiring a write lock on the region, but lets other processes acquire read locks on it.

    The F_LOCK and F_TLOCK commands attempts to put a write lock on the specified region. The F_RLOCK and F_TRLOCK commands attempts to put a read lock on the specified region. If one or several locks put by another process prevent the current process from acquiring the lock, F_LOCK and F_RLOCK block until these locks are removed, while F_TLOCK and F_TRLOCK fail immediately with an exception. The F_ULOCK removes whatever locks the current process has on the specified region. Finally, the F_TEST command tests whether a write lock can be acquired on the specified region, without actually putting a lock. It returns immediately if successful, or fails otherwise.

    What happens when a process tries to lock a region of a file that is already locked by the same process depends on the OS. On POSIX-compliant systems, the second lock operation succeeds and may "promote" the older lock from read lock to write lock. On Windows, the second lock operation will block or fail.

    Signals

    Note: installation of signal handlers is performed via the functions Sys.signal and Sys.set_signal.

    val kill : int -> int -> unit

    kill pid signal sends signal number signal to the process with id pid.

    On Windows: only the Sys.sigkill signal is emulated.

    type sigprocmask_command =
    1. | SIG_SETMASK
    2. | SIG_BLOCK
    3. | SIG_UNBLOCK
    val sigprocmask : sigprocmask_command -> int list -> int list

    sigprocmask mode sigs changes the set of blocked signals. If mode is SIG_SETMASK, blocked signals are set to those in the list sigs. If mode is SIG_BLOCK, the signals in sigs are added to the set of blocked signals. If mode is SIG_UNBLOCK, the signals in sigs are removed from the set of blocked signals. sigprocmask returns the set of previously blocked signals.

    When the systhreads version of the Thread module is loaded, this function redirects to Thread.sigmask. I.e., sigprocmask only changes the mask of the current thread.

    • raises Invalid_argument

      on Windows (no inter-process signals on Windows)

    val sigpending : unit -> int list

    Return the set of blocked signals that are currently pending.

    • raises Invalid_argument

      on Windows (no inter-process signals on Windows)

    val sigsuspend : int list -> unit

    sigsuspend sigs atomically sets the blocked signals to sigs and waits for a non-ignored, non-blocked signal to be delivered. On return, the blocked signals are reset to their initial value.

    • raises Invalid_argument

      on Windows (no inter-process signals on Windows)

    val pause : unit -> unit

    Wait until a non-ignored, non-blocked signal is delivered.

    • raises Invalid_argument

      on Windows (no inter-process signals on Windows)

    Time functions

    type process_times = {
    1. tms_utime : float;
      (*

      User time for the process

      *)
    2. tms_stime : float;
      (*

      System time for the process

      *)
    3. tms_cutime : float;
      (*

      User time for the children processes

      *)
    4. tms_cstime : float;
      (*

      System time for the children processes

      *)
    }

    The execution times (CPU times) of a process.

    type tm = {
    1. tm_sec : int;
      (*

      Seconds 0..60

      *)
    2. tm_min : int;
      (*

      Minutes 0..59

      *)
    3. tm_hour : int;
      (*

      Hours 0..23

      *)
    4. tm_mday : int;
      (*

      Day of month 1..31

      *)
    5. tm_mon : int;
      (*

      Month of year 0..11

      *)
    6. tm_year : int;
      (*

      Year - 1900

      *)
    7. tm_wday : int;
      (*

      Day of week (Sunday is 0)

      *)
    8. tm_yday : int;
      (*

      Day of year 0..365

      *)
    9. tm_isdst : bool;
      (*

      Daylight time savings in effect

      *)
    }

    The type representing wallclock time and calendar date.

    val time : unit -> float

    Return the current time since 00:00:00 GMT, Jan. 1, 1970, in seconds.

    val gettimeofday : unit -> float

    Same as time, but with resolution better than 1 second.

    val gmtime : float -> tm

    Convert a time in seconds, as returned by time, into a date and a time. Assumes UTC (Coordinated Universal Time), also known as GMT. To perform the inverse conversion, set the TZ environment variable to "UTC", use mktime, and then restore the original value of TZ.

    val localtime : float -> tm

    Convert a time in seconds, as returned by time, into a date and a time. Assumes the local time zone. The function performing the inverse conversion is mktime.

    val mktime : tm -> float * tm

    Convert a date and time, specified by the tm argument, into a time in seconds, as returned by time. The tm_isdst, tm_wday and tm_yday fields of tm are ignored. Also return a normalized copy of the given tm record, with the tm_wday, tm_yday, and tm_isdst fields recomputed from the other fields, and the other fields normalized (so that, e.g., 40 October is changed into 9 November). The tm argument is interpreted in the local time zone.

    val alarm : int -> int

    Schedule a SIGALRM signal after the given number of seconds.

    • raises Invalid_argument

      on Windows

    val sleep : int -> unit

    Stop execution for the given number of seconds.

    val sleepf : float -> unit

    Stop execution for the given number of seconds. Like sleep, but fractions of seconds are supported.

    • since 4.03 (4.12 in UnixLabels)
    val times : unit -> process_times

    Return the execution times of the process.

    On Windows: partially implemented, will not report timings for child processes.

    val utimes : string -> float -> float -> unit

    Set the last access time (second arg) and last modification time (third arg) for a file. Times are expressed in seconds from 00:00:00 GMT, Jan. 1, 1970. If both times are 0.0, the access and last modification times are both set to the current time.

    type interval_timer =
    1. | ITIMER_REAL
      (*

      decrements in real time, and sends the signal SIGALRM when expired.

      *)
    2. | ITIMER_VIRTUAL
      (*

      decrements in process virtual time, and sends SIGVTALRM when expired.

      *)
    3. | ITIMER_PROF
      (*

      (for profiling) decrements both when the process is running and when the system is running on behalf of the process; it sends SIGPROF when expired.

      *)

    The three kinds of interval timers.

    type interval_timer_status = {
    1. it_interval : float;
      (*

      Period

      *)
    2. it_value : float;
      (*

      Current value of the timer

      *)
    }

    The type describing the status of an interval timer

    Return the current status of the given interval timer.

    • raises Invalid_argument

      on Windows

    setitimer t s sets the interval timer t and returns its previous status. The s argument is interpreted as follows: s.it_value, if nonzero, is the time to the next timer expiration; s.it_interval, if nonzero, specifies a value to be used in reloading it_value when the timer expires. Setting s.it_value to zero disables the timer. Setting s.it_interval to zero causes the timer to be disabled after its next expiration.

    • raises Invalid_argument

      on Windows

    User id, group id

    val getuid : unit -> int

    Return the user id of the user executing the process.

    On Windows: always returns 1.

    val geteuid : unit -> int

    Return the effective user id under which the process runs.

    On Windows: always returns 1.

    val setuid : int -> unit

    Set the real user id and effective user id for the process.

    • raises Invalid_argument

      on Windows

    val getgid : unit -> int

    Return the group id of the user executing the process.

    On Windows: always returns 1.

    val getegid : unit -> int

    Return the effective group id under which the process runs.

    On Windows: always returns 1.

    val setgid : int -> unit

    Set the real group id and effective group id for the process.

    • raises Invalid_argument

      on Windows

    val getgroups : unit -> int array

    Return the list of groups to which the user executing the process belongs.

    On Windows: always returns [|1|].

    val setgroups : int array -> unit

    setgroups groups sets the supplementary group IDs for the calling process. Appropriate privileges are required.

    • raises Invalid_argument

      on Windows

    val initgroups : string -> int -> unit

    initgroups user group initializes the group access list by reading the group database /etc/group and using all groups of which user is a member. The additional group group is also added to the list.

    • raises Invalid_argument

      on Windows

    type passwd_entry = {
    1. pw_name : string;
    2. pw_passwd : string;
    3. pw_uid : int;
    4. pw_gid : int;
    5. pw_gecos : string;
    6. pw_dir : string;
    7. pw_shell : string;
    }

    Structure of entries in the passwd database.

    type group_entry = {
    1. gr_name : string;
    2. gr_passwd : string;
    3. gr_gid : int;
    4. gr_mem : string array;
    }

    Structure of entries in the groups database.

    val getlogin : unit -> string

    Return the login name of the user executing the process.

    val getpwnam : string -> passwd_entry

    Find an entry in passwd with the given name.

    • raises Not_found

      if no such entry exists, or always on Windows.

    val getgrnam : string -> group_entry

    Find an entry in group with the given name.

    • raises Not_found

      if no such entry exists, or always on Windows.

    val getpwuid : int -> passwd_entry

    Find an entry in passwd with the given user id.

    • raises Not_found

      if no such entry exists, or always on Windows.

    val getgrgid : int -> group_entry

    Find an entry in group with the given group id.

    • raises Not_found

      if no such entry exists, or always on Windows.

    Internet addresses

    type inet_addr

    The abstract type of Internet addresses.

    val inet_addr_of_string : string -> inet_addr

    Conversion from the printable representation of an Internet address to its internal representation. The argument string consists of 4 numbers separated by periods (XXX.YYY.ZZZ.TTT) for IPv4 addresses, and up to 8 numbers separated by colons for IPv6 addresses.

    • raises Failure

      when given a string that does not match these formats.

    val string_of_inet_addr : inet_addr -> string

    Return the printable representation of the given Internet address. See inet_addr_of_string for a description of the printable representation.

    val inet_addr_any : inet_addr

    A special IPv4 address, for use only with bind, representing all the Internet addresses that the host machine possesses.

    val inet_addr_loopback : inet_addr

    A special IPv4 address representing the host machine (127.0.0.1).

    val inet6_addr_any : inet_addr

    A special IPv6 address, for use only with bind, representing all the Internet addresses that the host machine possesses.

    val inet6_addr_loopback : inet_addr

    A special IPv6 address representing the host machine (::1).

    val is_inet6_addr : inet_addr -> bool

    Whether the given inet_addr is an IPv6 address.

    • since 4.12

    Sockets

    type socket_domain =
    1. | PF_UNIX
      (*

      Unix domain

      *)
    2. | PF_INET
      (*

      Internet domain (IPv4)

      *)
    3. | PF_INET6
      (*

      Internet domain (IPv6)

      *)

    The type of socket domains. Not all platforms support IPv6 sockets (type PF_INET6).

    On Windows: PF_UNIX supported since 4.14.0 on Windows 10 1803 and later.

    type socket_type =
    1. | SOCK_STREAM
      (*

      Stream socket

      *)
    2. | SOCK_DGRAM
      (*

      Datagram socket

      *)
    3. | SOCK_RAW
      (*

      Raw socket

      *)
    4. | SOCK_SEQPACKET
      (*

      Sequenced packets socket

      *)

    The type of socket kinds, specifying the semantics of communications. SOCK_SEQPACKET is included for completeness, but is rarely supported by the OS, and needs system calls that are not available in this library.

    type sockaddr =
    1. | ADDR_UNIX of string
    2. | ADDR_INET of inet_addr * int

    The type of socket addresses. ADDR_UNIX name is a socket address in the Unix domain; name is a file name in the file system. ADDR_INET(addr,port) is a socket address in the Internet domain; addr is the Internet address of the machine, and port is the port number.

    val socket : ?cloexec:bool -> socket_domain -> socket_type -> int -> file_descr

    Create a new socket in the given domain, and with the given kind. The third argument is the protocol type; 0 selects the default protocol for that kind of sockets. See set_close_on_exec for documentation on the cloexec optional argument.

    val domain_of_sockaddr : sockaddr -> socket_domain

    Return the socket domain adequate for the given socket address.

    val socketpair : + ?cloexec:bool -> + socket_domain -> + socket_type -> + int -> + file_descr * file_descr

    Create a pair of unnamed sockets, connected together. See set_close_on_exec for documentation on the cloexec optional argument.

    val accept : ?cloexec:bool -> file_descr -> file_descr * sockaddr

    Accept connections on the given socket. The returned descriptor is a socket connected to the client; the returned address is the address of the connecting client. See set_close_on_exec for documentation on the cloexec optional argument.

    val bind : file_descr -> sockaddr -> unit

    Bind a socket to an address.

    val connect : file_descr -> sockaddr -> unit

    Connect a socket to an address.

    val listen : file_descr -> int -> unit

    Set up a socket for receiving connection requests. The integer argument is the maximal number of pending requests.

    type shutdown_command =
    1. | SHUTDOWN_RECEIVE
      (*

      Close for receiving

      *)
    2. | SHUTDOWN_SEND
      (*

      Close for sending

      *)
    3. | SHUTDOWN_ALL
      (*

      Close both

      *)

    The type of commands for shutdown.

    val shutdown : file_descr -> shutdown_command -> unit

    Shutdown a socket connection. SHUTDOWN_SEND as second argument causes reads on the other end of the connection to return an end-of-file condition. SHUTDOWN_RECEIVE causes writes on the other end of the connection to return a closed pipe condition (SIGPIPE signal).

    val getsockname : file_descr -> sockaddr

    Return the address of the given socket.

    val getpeername : file_descr -> sockaddr

    Return the address of the host connected to the given socket.

    type msg_flag =
    1. | MSG_OOB
    2. | MSG_DONTROUTE
    3. | MSG_PEEK

    The flags for recv, recvfrom, send and sendto.

    val recv : file_descr -> bytes -> int -> int -> msg_flag list -> int

    Receive data from a connected socket.

    val recvfrom : + file_descr -> + bytes -> + int -> + int -> + msg_flag list -> + int * sockaddr

    Receive data from an unconnected socket.

    val send : file_descr -> bytes -> int -> int -> msg_flag list -> int

    Send data over a connected socket.

    val send_substring : file_descr -> string -> int -> int -> msg_flag list -> int

    Same as send, but take the data from a string instead of a byte sequence.

    • since 4.02
    val sendto : + file_descr -> + bytes -> + int -> + int -> + msg_flag list -> + sockaddr -> + int

    Send data over an unconnected socket.

    val sendto_substring : + file_descr -> + string -> + int -> + int -> + msg_flag list -> + sockaddr -> + int

    Same as sendto, but take the data from a string instead of a byte sequence.

    • since 4.02

    Socket options

    type socket_bool_option =
    1. | SO_DEBUG
      (*

      Record debugging information

      *)
    2. | SO_BROADCAST
      (*

      Permit sending of broadcast messages

      *)
    3. | SO_REUSEADDR
      (*

      Allow reuse of local addresses for bind

      *)
    4. | SO_KEEPALIVE
      (*

      Keep connection active

      *)
    5. | SO_DONTROUTE
      (*

      Bypass the standard routing algorithms

      *)
    6. | SO_OOBINLINE
      (*

      Leave out-of-band data in line

      *)
    7. | SO_ACCEPTCONN
      (*

      Report whether socket listening is enabled

      *)
    8. | TCP_NODELAY
      (*

      Control the Nagle algorithm for TCP sockets

      *)
    9. | IPV6_ONLY
      (*

      Forbid binding an IPv6 socket to an IPv4 address

      *)
    10. | SO_REUSEPORT
      (*

      Allow reuse of address and port bindings.

      • since 4.12.
      *)

    The socket options that can be consulted with getsockopt and modified with setsockopt. These options have a boolean (true/false) value.

    type socket_int_option =
    1. | SO_SNDBUF
      (*

      Size of send buffer

      *)
    2. | SO_RCVBUF
      (*

      Size of received buffer

      *)
    3. | SO_ERROR
      (*

      Deprecated. Use getsockopt_error instead.

      • deprecated Use Unix.getsockopt_error instead.
      *)
    4. | SO_TYPE
      (*

      Report the socket type

      *)
    5. | SO_RCVLOWAT
      (*

      Minimum number of bytes to process for input operations

      *)
    6. | SO_SNDLOWAT
      (*

      Minimum number of bytes to process for output operations

      *)

    The socket options that can be consulted with getsockopt_int and modified with setsockopt_int. These options have an integer value.

    type socket_optint_option =
    1. | SO_LINGER
      (*

      Whether to linger on closed connections that have data present, and for how long (in seconds)

      *)

    The socket options that can be consulted with getsockopt_optint and modified with setsockopt_optint. These options have a value of type int option, with None meaning ``disabled''.

    type socket_float_option =
    1. | SO_RCVTIMEO
      (*

      Timeout for input operations

      *)
    2. | SO_SNDTIMEO
      (*

      Timeout for output operations

      *)

    The socket options that can be consulted with getsockopt_float and modified with setsockopt_float. These options have a floating-point value representing a time in seconds. The value 0 means infinite timeout.

    val getsockopt : file_descr -> socket_bool_option -> bool

    Return the current status of a boolean-valued option in the given socket.

    val setsockopt : file_descr -> socket_bool_option -> bool -> unit

    Set or clear a boolean-valued option in the given socket.

    val getsockopt_int : file_descr -> socket_int_option -> int

    Same as getsockopt for an integer-valued socket option.

    val setsockopt_int : file_descr -> socket_int_option -> int -> unit

    Same as setsockopt for an integer-valued socket option.

    val getsockopt_optint : file_descr -> socket_optint_option -> int option

    Same as getsockopt for a socket option whose value is an int option.

    val setsockopt_optint : + file_descr -> + socket_optint_option -> + int option -> + unit

    Same as setsockopt for a socket option whose value is an int option.

    val getsockopt_float : file_descr -> socket_float_option -> float

    Same as getsockopt for a socket option whose value is a floating-point number.

    val setsockopt_float : file_descr -> socket_float_option -> float -> unit

    Same as setsockopt for a socket option whose value is a floating-point number.

    val getsockopt_error : file_descr -> error option

    Return the error condition associated with the given socket, and clear it.

    High-level network connection functions

    val open_connection : sockaddr -> in_channel * out_channel

    Connect to a server at the given address. Return a pair of buffered channels connected to the server. Remember to call Stdlib.flush on the output channel at the right times to ensure correct synchronization.

    The two channels returned by open_connection share a descriptor to a socket. Therefore, when the connection is over, you should call Stdlib.close_out on the output channel, which will also close the underlying socket. Do not call Stdlib.close_in on the input channel; it will be collected by the GC eventually.

    val shutdown_connection : in_channel -> unit

    ``Shut down'' a connection established with open_connection; that is, transmit an end-of-file condition to the server reading on the other side of the connection. This does not close the socket and the channels used by the connection. See Unix.open_connection for how to close them once the connection is over.

    val establish_server : (in_channel -> out_channel -> unit) -> sockaddr -> unit

    Establish a server on the given address. The function given as first argument is called for each connection with two buffered channels connected to the client. A new process is created for each connection. The function establish_server never returns normally.

    The two channels given to the function share a descriptor to a socket. The function does not need to close the channels, since this occurs automatically when the function returns. If the function prefers explicit closing, it should close the output channel using Stdlib.close_out and leave the input channel unclosed, for reasons explained in Unix.in_channel_of_descr.

    • raises Invalid_argument

      on Windows. Use threads instead.

    Host and protocol databases

    type host_entry = {
    1. h_name : string;
    2. h_aliases : string array;
    3. h_addrtype : socket_domain;
    4. h_addr_list : inet_addr array;
    }

    Structure of entries in the hosts database.

    type protocol_entry = {
    1. p_name : string;
    2. p_aliases : string array;
    3. p_proto : int;
    }

    Structure of entries in the protocols database.

    type service_entry = {
    1. s_name : string;
    2. s_aliases : string array;
    3. s_port : int;
    4. s_proto : string;
    }

    Structure of entries in the services database.

    val gethostname : unit -> string

    Return the name of the local host.

    val gethostbyname : string -> host_entry

    Find an entry in hosts with the given name.

    • raises Not_found

      if no such entry exists.

    val gethostbyaddr : inet_addr -> host_entry

    Find an entry in hosts with the given address.

    • raises Not_found

      if no such entry exists.

    val getprotobyname : string -> protocol_entry

    Find an entry in protocols with the given name.

    • raises Not_found

      if no such entry exists.

    val getprotobynumber : int -> protocol_entry

    Find an entry in protocols with the given protocol number.

    • raises Not_found

      if no such entry exists.

    val getservbyname : string -> string -> service_entry

    Find an entry in services with the given name.

    • raises Not_found

      if no such entry exists.

    val getservbyport : int -> string -> service_entry

    Find an entry in services with the given service number.

    • raises Not_found

      if no such entry exists.

    type addr_info = {
    1. ai_family : socket_domain;
      (*

      Socket domain

      *)
    2. ai_socktype : socket_type;
      (*

      Socket type

      *)
    3. ai_protocol : int;
      (*

      Socket protocol number

      *)
    4. ai_addr : sockaddr;
      (*

      Address

      *)
    5. ai_canonname : string;
      (*

      Canonical host name

      *)
    }

    Address information returned by getaddrinfo.

    type getaddrinfo_option =
    1. | AI_FAMILY of socket_domain
      (*

      Impose the given socket domain

      *)
    2. | AI_SOCKTYPE of socket_type
      (*

      Impose the given socket type

      *)
    3. | AI_PROTOCOL of int
      (*

      Impose the given protocol

      *)
    4. | AI_NUMERICHOST
      (*

      Do not call name resolver, expect numeric IP address

      *)
    5. | AI_CANONNAME
      (*

      Fill the ai_canonname field of the result

      *)
    6. | AI_PASSIVE
      (*

      Set address to ``any'' address for use with bind

      *)

    Options to getaddrinfo.

    val getaddrinfo : string -> string -> getaddrinfo_option list -> addr_info list

    getaddrinfo host service opts returns a list of addr_info records describing socket parameters and addresses suitable for communicating with the given host and service. The empty list is returned if the host or service names are unknown, or the constraints expressed in opts cannot be satisfied.

    host is either a host name or the string representation of an IP address. host can be given as the empty string; in this case, the ``any'' address or the ``loopback'' address are used, depending whether opts contains AI_PASSIVE. service is either a service name or the string representation of a port number. service can be given as the empty string; in this case, the port field of the returned addresses is set to 0. opts is a possibly empty list of options that allows the caller to force a particular socket domain (e.g. IPv6 only or IPv4 only) or a particular socket type (e.g. TCP only or UDP only).

    type name_info = {
    1. ni_hostname : string;
      (*

      Name or IP address of host

      *)
    2. ni_service : string;
      (*

      Name of service or port number

      *)
    }

    Host and service information returned by getnameinfo.

    type getnameinfo_option =
    1. | NI_NOFQDN
      (*

      Do not qualify local host names

      *)
    2. | NI_NUMERICHOST
      (*

      Always return host as IP address

      *)
    3. | NI_NAMEREQD
      (*

      Fail if host name cannot be determined

      *)
    4. | NI_NUMERICSERV
      (*

      Always return service as port number

      *)
    5. | NI_DGRAM
      (*

      Consider the service as UDP-based instead of the default TCP

      *)

    Options to getnameinfo.

    val getnameinfo : sockaddr -> getnameinfo_option list -> name_info

    getnameinfo addr opts returns the host name and service name corresponding to the socket address addr. opts is a possibly empty list of options that governs how these names are obtained.

    • raises Not_found

      if an error occurs.

    Terminal interface

    The following functions implement the POSIX standard terminal interface. They provide control over asynchronous communication ports and pseudo-terminals. Refer to the termios man page for a complete description.

    type terminal_io = {
    1. mutable c_ignbrk : bool;
      (*

      Ignore the break condition.

      *)
    2. mutable c_brkint : bool;
      (*

      Signal interrupt on break condition.

      *)
    3. mutable c_ignpar : bool;
      (*

      Ignore characters with parity errors.

      *)
    4. mutable c_parmrk : bool;
      (*

      Mark parity errors.

      *)
    5. mutable c_inpck : bool;
      (*

      Enable parity check on input.

      *)
    6. mutable c_istrip : bool;
      (*

      Strip 8th bit on input characters.

      *)
    7. mutable c_inlcr : bool;
      (*

      Map NL to CR on input.

      *)
    8. mutable c_igncr : bool;
      (*

      Ignore CR on input.

      *)
    9. mutable c_icrnl : bool;
      (*

      Map CR to NL on input.

      *)
    10. mutable c_ixon : bool;
      (*

      Recognize XON/XOFF characters on input.

      *)
    11. mutable c_ixoff : bool;
      (*

      Emit XON/XOFF chars to control input flow.

      *)
    12. mutable c_opost : bool;
      (*

      Enable output processing.

      *)
    13. mutable c_obaud : int;
      (*

      Output baud rate (0 means close connection).

      *)
    14. mutable c_ibaud : int;
      (*

      Input baud rate.

      *)
    15. mutable c_csize : int;
      (*

      Number of bits per character (5-8).

      *)
    16. mutable c_cstopb : int;
      (*

      Number of stop bits (1-2).

      *)
    17. mutable c_cread : bool;
      (*

      Reception is enabled.

      *)
    18. mutable c_parenb : bool;
      (*

      Enable parity generation and detection.

      *)
    19. mutable c_parodd : bool;
      (*

      Specify odd parity instead of even.

      *)
    20. mutable c_hupcl : bool;
      (*

      Hang up on last close.

      *)
    21. mutable c_clocal : bool;
      (*

      Ignore modem status lines.

      *)
    22. mutable c_isig : bool;
      (*

      Generate signal on INTR, QUIT, SUSP.

      *)
    23. mutable c_icanon : bool;
      (*

      Enable canonical processing (line buffering and editing)

      *)
    24. mutable c_noflsh : bool;
      (*

      Disable flush after INTR, QUIT, SUSP.

      *)
    25. mutable c_echo : bool;
      (*

      Echo input characters.

      *)
    26. mutable c_echoe : bool;
      (*

      Echo ERASE (to erase previous character).

      *)
    27. mutable c_echok : bool;
      (*

      Echo KILL (to erase the current line).

      *)
    28. mutable c_echonl : bool;
      (*

      Echo NL even if c_echo is not set.

      *)
    29. mutable c_vintr : char;
      (*

      Interrupt character (usually ctrl-C).

      *)
    30. mutable c_vquit : char;
      (*

      Quit character (usually ctrl-\).

      *)
    31. mutable c_verase : char;
      (*

      Erase character (usually DEL or ctrl-H).

      *)
    32. mutable c_vkill : char;
      (*

      Kill line character (usually ctrl-U).

      *)
    33. mutable c_veof : char;
      (*

      End-of-file character (usually ctrl-D).

      *)
    34. mutable c_veol : char;
      (*

      Alternate end-of-line char. (usually none).

      *)
    35. mutable c_vmin : int;
      (*

      Minimum number of characters to read before the read request is satisfied.

      *)
    36. mutable c_vtime : int;
      (*

      Maximum read wait (in 0.1s units).

      *)
    37. mutable c_vstart : char;
      (*

      Start character (usually ctrl-Q).

      *)
    38. mutable c_vstop : char;
      (*

      Stop character (usually ctrl-S).

      *)
    }
    val tcgetattr : file_descr -> terminal_io

    Return the status of the terminal referred to by the given file descriptor.

    • raises Invalid_argument

      on Windows

    type setattr_when =
    1. | TCSANOW
    2. | TCSADRAIN
    3. | TCSAFLUSH
    val tcsetattr : file_descr -> setattr_when -> terminal_io -> unit

    Set the status of the terminal referred to by the given file descriptor. The second argument indicates when the status change takes place: immediately (TCSANOW), when all pending output has been transmitted (TCSADRAIN), or after flushing all input that has been received but not read (TCSAFLUSH). TCSADRAIN is recommended when changing the output parameters; TCSAFLUSH, when changing the input parameters.

    • raises Invalid_argument

      on Windows

    val tcsendbreak : file_descr -> int -> unit

    Send a break condition on the given file descriptor. The second argument is the duration of the break, in 0.1s units; 0 means standard duration (0.25s).

    • raises Invalid_argument

      on Windows

    val tcdrain : file_descr -> unit

    Waits until all output written on the given file descriptor has been transmitted.

    • raises Invalid_argument

      on Windows

    type flush_queue =
    1. | TCIFLUSH
    2. | TCOFLUSH
    3. | TCIOFLUSH
    val tcflush : file_descr -> flush_queue -> unit

    Discard data written on the given file descriptor but not yet transmitted, or data received but not yet read, depending on the second argument: TCIFLUSH flushes data received but not read, TCOFLUSH flushes data written but not transmitted, and TCIOFLUSH flushes both.

    • raises Invalid_argument

      on Windows

    type flow_action =
    1. | TCOOFF
    2. | TCOON
    3. | TCIOFF
    4. | TCION
    val tcflow : file_descr -> flow_action -> unit

    Suspend or restart reception or transmission of data on the given file descriptor, depending on the second argument: TCOOFF suspends output, TCOON restarts output, TCIOFF transmits a STOP character to suspend input, and TCION transmits a START character to restart input.

    • raises Invalid_argument

      on Windows

    val setsid : unit -> int

    Put the calling process in a new session and detach it from its controlling terminal.

    • raises Invalid_argument

      on Windows

    diff --git a/ocaml/UnixLabels/LargeFile/index.html b/ocaml/UnixLabels/LargeFile/index.html new file mode 100644 index 0000000..adf4bde --- /dev/null +++ b/ocaml/UnixLabels/LargeFile/index.html @@ -0,0 +1,2 @@ + +LargeFile (ocaml.UnixLabels.LargeFile)

    Module UnixLabels.LargeFile

    File operations on large files. This sub-module provides 64-bit variants of the functions lseek (for positioning a file descriptor), truncate and ftruncate (for changing the size of a file), and stat, lstat and fstat (for obtaining information on files). These alternate functions represent positions and sizes by 64-bit integers (type int64) instead of regular integers (type int), thus allowing operating on files whose sizes are greater than max_int.

    val lseek : file_descr -> int64 -> mode:seek_command -> int64

    See lseek.

    val truncate : string -> len:int64 -> unit

    See truncate.

    val ftruncate : file_descr -> len:int64 -> unit

    See ftruncate.

    type stats = Unix.LargeFile.stats = {
    1. st_dev : int;
      (*

      Device number

      *)
    2. st_ino : int;
      (*

      Inode number

      *)
    3. st_kind : file_kind;
      (*

      Kind of the file

      *)
    4. st_perm : file_perm;
      (*

      Access rights

      *)
    5. st_uid : int;
      (*

      User id of the owner

      *)
    6. st_gid : int;
      (*

      Group ID of the file's group

      *)
    7. st_rdev : int;
      (*

      Device ID (if special file)

      *)
    8. st_size : int64;
      (*

      Size in bytes

      *)
    9. st_atime : float;
      (*

      Last access time

      *)
    10. st_mtime : float;
      (*

      Last modification time

      *)
    11. st_ctime : float;
      (*

      Last status change time

      *)
    }
    val stat : string -> stats
    val lstat : string -> stats
    val fstat : file_descr -> stats
    diff --git a/ocaml/UnixLabels/index.html b/ocaml/UnixLabels/index.html new file mode 100644 index 0000000..0618bf0 --- /dev/null +++ b/ocaml/UnixLabels/index.html @@ -0,0 +1,120 @@ + +UnixLabels (ocaml.UnixLabels)

    Module UnixLabels

    Interface to the Unix system.

    To use the labeled version of this module, add module Unix = UnixLabels in your implementation.

    Note: all the functions of this module (except error_message and handle_unix_error) are liable to raise the Unix_error exception whenever the underlying system call signals an error.

    Error report

    type error = Unix.error =
    1. | E2BIG
      (*

      Argument list too long

      *)
    2. | EACCES
      (*

      Permission denied

      *)
    3. | EAGAIN
      (*

      Resource temporarily unavailable; try again

      *)
    4. | EBADF
      (*

      Bad file descriptor

      *)
    5. | EBUSY
      (*

      Resource unavailable

      *)
    6. | ECHILD
      (*

      No child process

      *)
    7. | EDEADLK
      (*

      Resource deadlock would occur

      *)
    8. | EDOM
      (*

      Domain error for math functions, etc.

      *)
    9. | EEXIST
      (*

      File exists

      *)
    10. | EFAULT
      (*

      Bad address

      *)
    11. | EFBIG
      (*

      File too large

      *)
    12. | EINTR
      (*

      Function interrupted by signal

      *)
    13. | EINVAL
      (*

      Invalid argument

      *)
    14. | EIO
      (*

      Hardware I/O error

      *)
    15. | EISDIR
      (*

      Is a directory

      *)
    16. | EMFILE
      (*

      Too many open files by the process

      *)
    17. | ENAMETOOLONG
      (*

      Filename too long

      *)
    18. | ENFILE
      (*

      Too many open files in the system

      *)
    19. | ENODEV
      (*

      No such device

      *)
    20. | ENOENT
      (*

      No such file or directory

      *)
    21. | ENOEXEC
      (*

      Not an executable file

      *)
    22. | ENOLCK
      (*

      No locks available

      *)
    23. | ENOMEM
      (*

      Not enough memory

      *)
    24. | ENOSPC
      (*

      No space left on device

      *)
    25. | ENOSYS
      (*

      Function not supported

      *)
    26. | ENOTDIR
      (*

      Not a directory

      *)
    27. | ENOTEMPTY
      (*

      Directory not empty

      *)
    28. | ENOTTY
      (*

      Inappropriate I/O control operation

      *)
    29. | ENXIO
      (*

      No such device or address

      *)
    30. | EPERM
      (*

      Operation not permitted

      *)
    31. | EPIPE
      (*

      Broken pipe

      *)
    32. | ERANGE
      (*

      Result too large

      *)
    33. | EROFS
      (*

      Read-only file system

      *)
    34. | ESPIPE
      (*

      Invalid seek e.g. on a pipe

      *)
    35. | ESRCH
      (*

      No such process

      *)
    36. | EXDEV
      (*

      Invalid link

      *)
    37. | EWOULDBLOCK
      (*

      Operation would block

      *)
    38. | EINPROGRESS
      (*

      Operation now in progress

      *)
    39. | EALREADY
      (*

      Operation already in progress

      *)
    40. | ENOTSOCK
      (*

      Socket operation on non-socket

      *)
    41. | EDESTADDRREQ
      (*

      Destination address required

      *)
    42. | EMSGSIZE
      (*

      Message too long

      *)
    43. | EPROTOTYPE
      (*

      Protocol wrong type for socket

      *)
    44. | ENOPROTOOPT
      (*

      Protocol not available

      *)
    45. | EPROTONOSUPPORT
      (*

      Protocol not supported

      *)
    46. | ESOCKTNOSUPPORT
      (*

      Socket type not supported

      *)
    47. | EOPNOTSUPP
      (*

      Operation not supported on socket

      *)
    48. | EPFNOSUPPORT
      (*

      Protocol family not supported

      *)
    49. | EAFNOSUPPORT
      (*

      Address family not supported by protocol family

      *)
    50. | EADDRINUSE
      (*

      Address already in use

      *)
    51. | EADDRNOTAVAIL
      (*

      Can't assign requested address

      *)
    52. | ENETDOWN
      (*

      Network is down

      *)
    53. | ENETUNREACH
      (*

      Network is unreachable

      *)
    54. | ENETRESET
      (*

      Network dropped connection on reset

      *)
    55. | ECONNABORTED
      (*

      Software caused connection abort

      *)
    56. | ECONNRESET
      (*

      Connection reset by peer

      *)
    57. | ENOBUFS
      (*

      No buffer space available

      *)
    58. | EISCONN
      (*

      Socket is already connected

      *)
    59. | ENOTCONN
      (*

      Socket is not connected

      *)
    60. | ESHUTDOWN
      (*

      Can't send after socket shutdown

      *)
    61. | ETOOMANYREFS
      (*

      Too many references: can't splice

      *)
    62. | ETIMEDOUT
      (*

      Connection timed out

      *)
    63. | ECONNREFUSED
      (*

      Connection refused

      *)
    64. | EHOSTDOWN
      (*

      Host is down

      *)
    65. | EHOSTUNREACH
      (*

      No route to host

      *)
    66. | ELOOP
      (*

      Too many levels of symbolic links

      *)
    67. | EOVERFLOW
      (*

      File size or position not representable

      *)
    68. | EUNKNOWNERR of int
      (*

      Unknown error

      *)

    The type of error codes. Errors defined in the POSIX standard and additional errors from UNIX98 and BSD. All other errors are mapped to EUNKNOWNERR.

    exception Unix_error of error * string * string

    Raised by the system calls below when an error is encountered. The first component is the error code; the second component is the function name; the third component is the string parameter to the function, if it has one, or the empty string otherwise.

    UnixLabels.Unix_error and Unix.Unix_error are the same, and catching one will catch the other.

    val error_message : error -> string

    Return a string describing the given error code.

    val handle_unix_error : ('a -> 'b) -> 'a -> 'b

    handle_unix_error f x applies f to x and returns the result. If the exception Unix_error is raised, it prints a message describing the error and exits with code 2.

    Access to the process environment

    val environment : unit -> string array

    Return the process environment, as an array of strings with the format ``variable=value''. The returned array is empty if the process has special privileges.

    val unsafe_environment : unit -> string array

    Return the process environment, as an array of strings with the format ``variable=value''. Unlike environment, this function returns a populated array even if the process has special privileges. See the documentation for unsafe_getenv for more details.

    • since 4.12
    val getenv : string -> string

    Return the value associated to a variable in the process environment, unless the process has special privileges.

    • raises Not_found

      if the variable is unbound or the process has special privileges.

    This function is identical to Sys.getenv.

    val unsafe_getenv : string -> string

    Return the value associated to a variable in the process environment.

    Unlike getenv, this function returns the value even if the process has special privileges. It is considered unsafe because the programmer of a setuid or setgid program must be careful to avoid using maliciously crafted environment variables in the search path for executables, the locations for temporary files or logs, and the like.

    • raises Not_found

      if the variable is unbound.

    • since 4.06
    val putenv : string -> string -> unit

    putenv name value sets the value associated to a variable in the process environment. name is the name of the environment variable, and value its new associated value.

    Process handling

    type process_status = Unix.process_status =
    1. | WEXITED of int
      (*

      The process terminated normally by exit; the argument is the return code.

      *)
    2. | WSIGNALED of int
      (*

      The process was killed by a signal; the argument is the signal number.

      *)
    3. | WSTOPPED of int
      (*

      The process was stopped by a signal; the argument is the signal number.

      *)

    The termination status of a process. See module Sys for the definitions of the standard signal numbers. Note that they are not the numbers used by the OS.

    On Windows: only WEXITED is used (as there are no inter-process signals) but with specific return codes to indicate special termination causes. Look for NTSTATUS values in the Windows documentation to decode such error return codes. In particular, STATUS_ACCESS_VIOLATION error code is the 32-bit 0xC0000005: as Int32.of_int 0xC0000005 is -1073741819, WEXITED -1073741819 is the Windows equivalent of WSIGNALED Sys.sigsegv.

    type wait_flag = Unix.wait_flag =
    1. | WNOHANG
      (*

      Do not block if no child has died yet, but immediately return with a pid equal to 0.

      *)
    2. | WUNTRACED
      (*

      Report also the children that receive stop signals.

      *)

    Flags for waitpid.

    val execv : prog:string -> args:string array -> 'a

    execv prog args execute the program in file prog, with the arguments args, and the current process environment. Note that the first argument, args.(0), is by convention the filename of the program being executed, just like Sys.argv.(0). These execv* functions never return: on success, the current program is replaced by the new one.

    On Windows: the CRT simply spawns a new process and exits the current one. This will have unwanted consequences if e.g. another process is waiting on the current one. Using create_process or one of the open_process_* functions instead is recommended.

    val execve : prog:string -> args:string array -> env:string array -> 'a

    Same as execv, except that the third argument provides the environment to the program executed.

    val execvp : prog:string -> args:string array -> 'a

    Same as execv, except that the program is searched in the path.

    val execvpe : prog:string -> args:string array -> env:string array -> 'a

    Same as execve, except that the program is searched in the path.

    val fork : unit -> int

    Fork a new process. The returned integer is 0 for the child process, the pid of the child process for the parent process. It fails if the OCaml process is multi-core (any domain has been spawned). In addition, if any thread from the Thread module has been spawned, then the child process might be in a corrupted state.

    • raises Invalid_argument

      on Windows. Use create_process or threads instead.

    • raises Failure

      if any domain has been spawned.

    val wait : unit -> int * process_status

    Wait until one of the children processes die, and return its pid and termination status.

    • raises Invalid_argument

      on Windows. Use waitpid instead.

    val waitpid : mode:wait_flag list -> int -> int * process_status

    Same as wait, but waits for the child process whose pid is given. A pid of -1 means wait for any child. A pid of 0 means wait for any child in the same process group as the current process. Negative pid arguments represent process groups. The list of options indicates whether waitpid should return immediately without waiting, and whether it should report stopped children.

    On Windows: can only wait for a given PID, not any child process.

    val system : string -> process_status

    Execute the given command, wait until it terminates, and return its termination status. The string is interpreted by the shell /bin/sh (or the command interpreter cmd.exe on Windows) and therefore can contain redirections, quotes, variables, etc. To properly quote whitespace and shell special characters occurring in file names or command arguments, the use of Filename.quote_command is recommended. The result WEXITED 127 indicates that the shell couldn't be executed.

    val _exit : int -> 'a

    Terminate the calling process immediately, returning the given status code to the operating system: usually 0 to indicate no errors, and a small positive integer to indicate failure. Unlike Stdlib.exit, Unix._exit performs no finalization whatsoever: functions registered with Stdlib.at_exit are not called, input/output channels are not flushed, and the C run-time system is not finalized either.

    The typical use of Unix._exit is after a Unix.fork operation, when the child process runs into a fatal error and must exit. In this case, it is preferable to not perform any finalization action in the child process, as these actions could interfere with similar actions performed by the parent process. For example, output channels should not be flushed by the child process, as the parent process may flush them again later, resulting in duplicate output.

    • since 4.12
    val getpid : unit -> int

    Return the pid of the process.

    val getppid : unit -> int

    Return the pid of the parent process.

    • raises Invalid_argument

      on Windows (because it is meaningless)

    val nice : int -> int

    Change the process priority. The integer argument is added to the ``nice'' value. (Higher values of the ``nice'' value mean lower priorities.) Return the new nice value.

    • raises Invalid_argument

      on Windows

    Basic file input/output

    type file_descr = Unix.file_descr

    The abstract type of file descriptors.

    val stdin : file_descr

    File descriptor for standard input.

    val stdout : file_descr

    File descriptor for standard output.

    val stderr : file_descr

    File descriptor for standard error.

    type open_flag = Unix.open_flag =
    1. | O_RDONLY
      (*

      Open for reading

      *)
    2. | O_WRONLY
      (*

      Open for writing

      *)
    3. | O_RDWR
      (*

      Open for reading and writing

      *)
    4. | O_NONBLOCK
      (*

      Open in non-blocking mode

      *)
    5. | O_APPEND
      (*

      Open for append

      *)
    6. | O_CREAT
      (*

      Create if nonexistent

      *)
    7. | O_TRUNC
      (*

      Truncate to 0 length if existing

      *)
    8. | O_EXCL
      (*

      Fail if existing

      *)
    9. | O_NOCTTY
      (*

      Don't make this dev a controlling tty

      *)
    10. | O_DSYNC
      (*

      Writes complete as `Synchronised I/O data integrity completion'

      *)
    11. | O_SYNC
      (*

      Writes complete as `Synchronised I/O file integrity completion'

      *)
    12. | O_RSYNC
      (*

      Reads complete as writes (depending on O_SYNC/O_DSYNC)

      *)
    13. | O_SHARE_DELETE
      (*

      Windows only: allow the file to be deleted while still open

      *)
    14. | O_CLOEXEC
      (*

      Set the close-on-exec flag on the descriptor returned by openfile. See set_close_on_exec for more information.

      *)
    15. | O_KEEPEXEC
      (*

      Clear the close-on-exec flag. This is currently the default.

      *)

    The flags to openfile.

    type file_perm = int

    The type of file access rights, e.g. 0o640 is read and write for user, read for group, none for others

    val openfile : string -> mode:open_flag list -> perm:file_perm -> file_descr

    Open the named file with the given flags. Third argument is the permissions to give to the file if it is created (see umask). Return a file descriptor on the named file.

    val close : file_descr -> unit

    Close a file descriptor.

    val fsync : file_descr -> unit

    Flush file buffers to disk.

    • since 4.12
    val read : file_descr -> buf:bytes -> pos:int -> len:int -> int

    read fd ~buf ~pos ~len reads len bytes from descriptor fd, storing them in byte sequence buf, starting at position pos in buf. Return the number of bytes actually read.

    val read_bigarray : + file_descr -> + buf: + (_, Stdlib.Bigarray.int8_unsigned_elt, Stdlib.Bigarray.c_layout) + Stdlib.Bigarray.Array1.t -> + pos:int -> + len:int -> + int

    Same as read, but read the data into a bigarray.

    • since 5.2
    val write : file_descr -> buf:bytes -> pos:int -> len:int -> int

    write fd ~buf ~pos ~len writes len bytes to descriptor fd, taking them from byte sequence buf, starting at position pos in buff. Return the number of bytes actually written. write repeats the writing operation until all bytes have been written or an error occurs.

    val write_bigarray : + file_descr -> + buf: + (_, Stdlib.Bigarray.int8_unsigned_elt, Stdlib.Bigarray.c_layout) + Stdlib.Bigarray.Array1.t -> + pos:int -> + len:int -> + int

    Same as write, but take the data from a bigarray.

    • since 5.2
    val single_write : file_descr -> buf:bytes -> pos:int -> len:int -> int

    Same as write, but attempts to write only once. Thus, if an error occurs, single_write guarantees that no data has been written.

    val write_substring : file_descr -> buf:string -> pos:int -> len:int -> int

    Same as write, but take the data from a string instead of a byte sequence.

    • since 4.02
    val single_write_substring : + file_descr -> + buf:string -> + pos:int -> + len:int -> + int

    Same as single_write, but take the data from a string instead of a byte sequence.

    • since 4.02
    val single_write_bigarray : + file_descr -> + buf: + (_, Stdlib.Bigarray.int8_unsigned_elt, Stdlib.Bigarray.c_layout) + Stdlib.Bigarray.Array1.t -> + pos:int -> + len:int -> + int

    Same as single_write, but take the data from a bigarray.

    • since 5.2

    Interfacing with the standard input/output library

    val in_channel_of_descr : file_descr -> in_channel

    Create an input channel reading from the given descriptor. The channel is initially in binary mode; use set_binary_mode_in ic false if text mode is desired. Text mode is supported only if the descriptor refers to a file or pipe, but is not supported if it refers to a socket.

    On Windows: Stdlib.set_binary_mode_in always fails on channels created with this function.

    Beware that input channels are buffered, so more characters may have been read from the descriptor than those accessed using channel functions. Channels also keep a copy of the current position in the file.

    Closing the channel ic returned by in_channel_of_descr fd using close_in ic also closes the underlying descriptor fd. It is incorrect to close both the channel ic and the descriptor fd.

    If several channels are created on the same descriptor, one of the channels must be closed, but not the others. Consider for example a descriptor s connected to a socket and two channels ic = in_channel_of_descr s and oc = out_channel_of_descr s. The recommended closing protocol is to perform close_out oc, which flushes buffered output to the socket then closes the socket. The ic channel must not be closed and will be collected by the GC eventually.

    val out_channel_of_descr : file_descr -> out_channel

    Create an output channel writing on the given descriptor. The channel is initially in binary mode; use set_binary_mode_out oc false if text mode is desired. Text mode is supported only if the descriptor refers to a file or pipe, but is not supported if it refers to a socket.

    On Windows: Stdlib.set_binary_mode_out always fails on channels created with this function.

    Beware that output channels are buffered, so you may have to call Stdlib.flush to ensure that all data has been sent to the descriptor. Channels also keep a copy of the current position in the file.

    Closing the channel oc returned by out_channel_of_descr fd using close_out oc also closes the underlying descriptor fd. It is incorrect to close both the channel ic and the descriptor fd.

    See Unix.in_channel_of_descr for a discussion of the closing protocol when several channels are created on the same descriptor.

    val descr_of_in_channel : in_channel -> file_descr

    Return the descriptor corresponding to an input channel.

    val descr_of_out_channel : out_channel -> file_descr

    Return the descriptor corresponding to an output channel.

    Seeking and truncating

    type seek_command = Unix.seek_command =
    1. | SEEK_SET
      (*

      indicates positions relative to the beginning of the file

      *)
    2. | SEEK_CUR
      (*

      indicates positions relative to the current position

      *)
    3. | SEEK_END
      (*

      indicates positions relative to the end of the file

      *)

    Positioning modes for lseek.

    val lseek : file_descr -> int -> mode:seek_command -> int

    Set the current position for a file descriptor, and return the resulting offset (from the beginning of the file).

    val truncate : string -> len:int -> unit

    Truncates the named file to the given size.

    val ftruncate : file_descr -> len:int -> unit

    Truncates the file corresponding to the given descriptor to the given size.

    File status

    type file_kind = Unix.file_kind =
    1. | S_REG
      (*

      Regular file

      *)
    2. | S_DIR
      (*

      Directory

      *)
    3. | S_CHR
      (*

      Character device

      *)
    4. | S_BLK
      (*

      Block device

      *)
    5. | S_LNK
      (*

      Symbolic link

      *)
    6. | S_FIFO
      (*

      Named pipe

      *)
    7. | S_SOCK
      (*

      Socket

      *)
    type stats = Unix.stats = {
    1. st_dev : int;
      (*

      Device number

      *)
    2. st_ino : int;
      (*

      Inode number

      *)
    3. st_kind : file_kind;
      (*

      Kind of the file

      *)
    4. st_perm : file_perm;
      (*

      Access rights

      *)
    5. st_uid : int;
      (*

      User id of the owner

      *)
    6. st_gid : int;
      (*

      Group ID of the file's group

      *)
    7. st_rdev : int;
      (*

      Device ID (if special file)

      *)
    8. st_size : int;
      (*

      Size in bytes

      *)
    9. st_atime : float;
      (*

      Last access time

      *)
    10. st_mtime : float;
      (*

      Last modification time

      *)
    11. st_ctime : float;
      (*

      Last status change time

      *)
    }

    The information returned by the stat calls.

    val stat : string -> stats

    Return the information for the named file.

    val lstat : string -> stats

    Same as stat, but in case the file is a symbolic link, return the information for the link itself.

    val fstat : file_descr -> stats

    Return the information for the file associated with the given descriptor.

    val isatty : file_descr -> bool

    Return true if the given file descriptor refers to a terminal or console window, false otherwise.

    File operations on large files

    module LargeFile : sig ... end

    File operations on large files. This sub-module provides 64-bit variants of the functions lseek (for positioning a file descriptor), truncate and ftruncate (for changing the size of a file), and stat, lstat and fstat (for obtaining information on files). These alternate functions represent positions and sizes by 64-bit integers (type int64) instead of regular integers (type int), thus allowing operating on files whose sizes are greater than max_int.

    Mapping files into memory

    val map_file : + file_descr -> + ?pos:int64 -> + kind:('a, 'b) Stdlib.Bigarray.kind -> + layout:'c Stdlib.Bigarray.layout -> + shared:bool -> + dims:int array -> + ('a, 'b, 'c) Stdlib.Bigarray.Genarray.t

    Memory mapping of a file as a Bigarray. map_file fd ~kind ~layout ~shared ~dims returns a Bigarray of kind kind, layout layout, and dimensions as specified in dims. The data contained in this Bigarray are the contents of the file referred to by the file descriptor fd (as opened previously with openfile, for example). The optional pos parameter is the byte offset in the file of the data being mapped; it defaults to 0 (map from the beginning of the file).

    If shared is true, all modifications performed on the array are reflected in the file. This requires that fd be opened with write permissions. If shared is false, modifications performed on the array are done in memory only, using copy-on-write of the modified pages; the underlying file is not affected.

    map_file is much more efficient than reading the whole file in a Bigarray, modifying that Bigarray, and writing it afterwards.

    To adjust automatically the dimensions of the Bigarray to the actual size of the file, the major dimension (that is, the first dimension for an array with C layout, and the last dimension for an array with Fortran layout) can be given as -1. map_file then determines the major dimension from the size of the file. The file must contain an integral number of sub-arrays as determined by the non-major dimensions, otherwise Failure is raised.

    If all dimensions of the Bigarray are given, the file size is matched against the size of the Bigarray. If the file is larger than the Bigarray, only the initial portion of the file is mapped to the Bigarray. If the file is smaller than the big array, the file is automatically grown to the size of the Bigarray. This requires write permissions on fd.

    Array accesses are bounds-checked, but the bounds are determined by the initial call to map_file. Therefore, you should make sure no other process modifies the mapped file while you're accessing it, or a SIGBUS signal may be raised. This happens, for instance, if the file is shrunk.

    Invalid_argument or Failure may be raised in cases where argument validation fails.

    • since 4.06

    Operations on file names

    Removes the named file.

    If the named file is a directory, raises:

    • EPERM on POSIX compliant system
    • EISDIR on Linux >= 2.1.132
    • EACCESS on Windows
    val rename : src:string -> dst:string -> unit

    rename ~src ~dst changes the name of a file from src to dst, moving it between directories if needed. If dst already exists, its contents will be replaced with those of src. Depending on the operating system, the metadata (permissions, owner, etc) of dst can either be preserved or be replaced by those of src.

    link ?follow ~src ~dst creates a hard link named dst to the file named src.

    • parameter follow

      indicates whether a src symlink is followed or a hardlink to src itself will be created. On Unix systems this is done using the linkat(2) function. If ?follow is not provided, then the link(2) function is used whose behaviour is OS-dependent, but more widely available.

    • raises ENOSYS

      On Unix if ~follow:_ is requested, but linkat is unavailable.

    • raises ENOSYS

      On Windows if ~follow:false is requested.

    val realpath : string -> string

    realpath p is an absolute pathname for p obtained by resolving all extra / characters, relative path segments and symbolic links.

    • since 4.13

    File permissions and ownership

    type access_permission = Unix.access_permission =
    1. | R_OK
      (*

      Read permission

      *)
    2. | W_OK
      (*

      Write permission

      *)
    3. | X_OK
      (*

      Execution permission

      *)
    4. | F_OK
      (*

      File exists

      *)

    Flags for the access call.

    val chmod : string -> perm:file_perm -> unit

    Change the permissions of the named file.

    val fchmod : file_descr -> perm:file_perm -> unit

    Change the permissions of an opened file.

    • raises Invalid_argument

      on Windows

    val chown : string -> uid:int -> gid:int -> unit

    Change the owner uid and owner gid of the named file.

    • raises Invalid_argument

      on Windows

    val fchown : file_descr -> uid:int -> gid:int -> unit

    Change the owner uid and owner gid of an opened file.

    • raises Invalid_argument

      on Windows

    val umask : file_perm -> file_perm

    Set the process's file mode creation mask, and return the previous mask.

    • raises Invalid_argument

      on Windows

    val access : string -> perm:access_permission list -> unit

    Check that the process has the given permissions over the named file.

    On Windows: execute permission X_OK cannot be tested, just tests for read permission instead.

    Operations on file descriptors

    val dup : ?cloexec:bool -> file_descr -> file_descr

    Return a new file descriptor referencing the same file as the given descriptor. See set_close_on_exec for documentation on the cloexec optional argument.

    val dup2 : ?cloexec:bool -> src:file_descr -> dst:file_descr -> unit

    dup2 ~src ~dst duplicates src to dst, closing dst if already opened. See set_close_on_exec for documentation on the cloexec optional argument.

    val set_nonblock : file_descr -> unit

    Set the ``non-blocking'' flag on the given descriptor. When the non-blocking flag is set, reading on a descriptor on which there is temporarily no data available raises the EAGAIN or EWOULDBLOCK error instead of blocking; writing on a descriptor on which there is temporarily no room for writing also raises EAGAIN or EWOULDBLOCK.

    val clear_nonblock : file_descr -> unit

    Clear the ``non-blocking'' flag on the given descriptor. See set_nonblock.

    val set_close_on_exec : file_descr -> unit

    Set the ``close-on-exec'' flag on the given descriptor. A descriptor with the close-on-exec flag is automatically closed when the current process starts another program with one of the exec, create_process and open_process functions.

    It is often a security hole to leak file descriptors opened on, say, a private file to an external program: the program, then, gets access to the private file and can do bad things with it. Hence, it is highly recommended to set all file descriptors ``close-on-exec'', except in the very few cases where a file descriptor actually needs to be transmitted to another program.

    The best way to set a file descriptor ``close-on-exec'' is to create it in this state. To this end, the openfile function has O_CLOEXEC and O_KEEPEXEC flags to enforce ``close-on-exec'' mode or ``keep-on-exec'' mode, respectively. All other operations in the Unix module that create file descriptors have an optional argument ?cloexec:bool to indicate whether the file descriptor should be created in ``close-on-exec'' mode (by writing ~cloexec:true) or in ``keep-on-exec'' mode (by writing ~cloexec:false). For historical reasons, the default file descriptor creation mode is ``keep-on-exec'', if no cloexec optional argument is given. This is not a safe default, hence it is highly recommended to pass explicit cloexec arguments to operations that create file descriptors.

    The cloexec optional arguments and the O_KEEPEXEC flag were introduced in OCaml 4.05. Earlier, the common practice was to create file descriptors in the default, ``keep-on-exec'' mode, then call set_close_on_exec on those freshly-created file descriptors. This is not as safe as creating the file descriptor in ``close-on-exec'' mode because, in multithreaded programs, a window of vulnerability exists between the time when the file descriptor is created and the time set_close_on_exec completes. If another thread spawns another program during this window, the descriptor will leak, as it is still in the ``keep-on-exec'' mode.

    Regarding the atomicity guarantees given by ~cloexec:true or by the use of the O_CLOEXEC flag: on all platforms it is guaranteed that a concurrently-executing Caml thread cannot leak the descriptor by starting a new process. On Linux, this guarantee extends to concurrently-executing C threads. As of Feb 2017, other operating systems lack the necessary system calls and still expose a window of vulnerability during which a C thread can see the newly-created file descriptor in ``keep-on-exec'' mode.

    val clear_close_on_exec : file_descr -> unit

    Clear the ``close-on-exec'' flag on the given descriptor. See set_close_on_exec.

    Directories

    val mkdir : string -> perm:file_perm -> unit

    Create a directory with the given permissions (see umask).

    val rmdir : string -> unit

    Remove an empty directory.

    val chdir : string -> unit

    Change the process working directory.

    val getcwd : unit -> string

    Return the name of the current working directory.

    val chroot : string -> unit

    Change the process root directory.

    • raises Invalid_argument

      on Windows

    type dir_handle = Unix.dir_handle

    The type of descriptors over opened directories.

    val opendir : string -> dir_handle

    Open a descriptor on a directory

    val readdir : dir_handle -> string

    Return the next entry in a directory.

    • raises End_of_file

      when the end of the directory has been reached.

    val rewinddir : dir_handle -> unit

    Reposition the descriptor to the beginning of the directory

    val closedir : dir_handle -> unit

    Close a directory descriptor.

    Pipes and redirections

    val pipe : ?cloexec:bool -> unit -> file_descr * file_descr

    Create a pipe. The first component of the result is opened for reading, that's the exit to the pipe. The second component is opened for writing, that's the entrance to the pipe. See set_close_on_exec for documentation on the cloexec optional argument.

    val mkfifo : string -> perm:file_perm -> unit

    Create a named pipe with the given permissions (see umask).

    • raises Invalid_argument

      on Windows

    High-level process and redirection management

    val create_process : + prog:string -> + args:string array -> + stdin:file_descr -> + stdout:file_descr -> + stderr:file_descr -> + int

    create_process ~prog ~args ~stdin ~stdout ~stderr creates a new process that executes the program in file prog, with arguments args. Note that the first argument, args.(0), is by convention the filename of the program being executed, just like Sys.argv.(0). The pid of the new process is returned immediately; the new process executes concurrently with the current process. The standard input and outputs of the new process are connected to the descriptors stdin, stdout and stderr. Passing e.g. Unix.stdout for stdout prevents the redirection and causes the new process to have the same standard output as the current process. The executable file prog is searched in the path. The new process has the same environment as the current process.

    val create_process_env : + prog:string -> + args:string array -> + env:string array -> + stdin:file_descr -> + stdout:file_descr -> + stderr:file_descr -> + int

    create_process_env ~prog ~args ~env ~stdin ~stdout ~stderr works as create_process, except that the extra argument env specifies the environment passed to the program.

    val open_process_in : string -> in_channel

    High-level pipe and process management. This function runs the given command in parallel with the program. The standard output of the command is redirected to a pipe, which can be read via the returned input channel. The command is interpreted by the shell /bin/sh (or cmd.exe on Windows), cf. system. The Filename.quote_command function can be used to quote the command and its arguments as appropriate for the shell being used. If the command does not need to be run through the shell, open_process_args_in can be used as a more robust and more efficient alternative to open_process_in.

    val open_process_out : string -> out_channel

    Same as open_process_in, but redirect the standard input of the command to a pipe. Data written to the returned output channel is sent to the standard input of the command. Warning: writes on output channels are buffered, hence be careful to call Stdlib.flush at the right times to ensure correct synchronization. If the command does not need to be run through the shell, open_process_args_out can be used instead of open_process_out.

    val open_process : string -> in_channel * out_channel

    Same as open_process_out, but redirects both the standard input and standard output of the command to pipes connected to the two returned channels. The input channel is connected to the output of the command, and the output channel to the input of the command. If the command does not need to be run through the shell, open_process_args can be used instead of open_process.

    val open_process_full : + string -> + env:string array -> + in_channel * out_channel * in_channel

    Similar to open_process, but the second argument specifies the environment passed to the command. The result is a triple of channels connected respectively to the standard output, standard input, and standard error of the command. If the command does not need to be run through the shell, open_process_args_full can be used instead of open_process_full.

    val open_process_args : string -> string array -> in_channel * out_channel

    open_process_args prog args runs the program prog with arguments args. Note that the first argument, args.(0), is by convention the filename of the program being executed, just like Sys.argv.(0). The new process executes concurrently with the current process. The standard input and output of the new process are redirected to pipes, which can be respectively read and written via the returned channels. The input channel is connected to the output of the program, and the output channel to the input of the program.

    Warning: writes on output channels are buffered, hence be careful to call Stdlib.flush at the right times to ensure correct synchronization.

    The executable file prog is searched for in the path. This behaviour changed in 4.12; previously prog was looked up only in the current directory.

    The new process has the same environment as the current process.

    • since 4.08
    val open_process_args_in : string -> string array -> in_channel

    Same as open_process_args, but redirects only the standard output of the new process.

    • since 4.08
    val open_process_args_out : string -> string array -> out_channel

    Same as open_process_args, but redirects only the standard input of the new process.

    • since 4.08
    val open_process_args_full : + string -> + string array -> + string array -> + in_channel * out_channel * in_channel

    Similar to open_process_args, but the third argument specifies the environment passed to the new process. The result is a triple of channels connected respectively to the standard output, standard input, and standard error of the program.

    • since 4.08
    val process_in_pid : in_channel -> int

    Return the pid of a process opened via open_process_args_in or the pid of the shell opened via open_process_in.

    • since 4.12
    val process_out_pid : out_channel -> int

    Return the pid of a process opened via open_process_args_out or the pid of the shell opened via open_process_out.

    • since 4.12
    val process_pid : (in_channel * out_channel) -> int

    Return the pid of a process opened via open_process_args or the pid of the shell opened via open_process_args.

    • since 4.12
    val process_full_pid : (in_channel * out_channel * in_channel) -> int

    Return the pid of a process opened via open_process_args_full or the pid of the shell opened via open_process_full.

    • since 4.12
    val close_process_in : in_channel -> process_status

    Close channels opened by open_process_in, wait for the associated command to terminate, and return its termination status.

    val close_process_out : out_channel -> process_status

    Close channels opened by open_process_out, wait for the associated command to terminate, and return its termination status.

    val close_process : (in_channel * out_channel) -> process_status

    Close channels opened by open_process, wait for the associated command to terminate, and return its termination status.

    val close_process_full : + (in_channel * out_channel * in_channel) -> + process_status

    Close channels opened by open_process_full, wait for the associated command to terminate, and return its termination status.

    symlink ?to_dir ~src ~dst creates the file dst as a symbolic link to the file src. On Windows, ~to_dir indicates if the symbolic link points to a directory or a file; if omitted, symlink examines src using stat and picks appropriately, if src does not exist then false is assumed (for this reason, it is recommended that the ~to_dir parameter be specified in new code). On Unix, ~to_dir is ignored.

    Windows symbolic links are available in Windows Vista onwards. There are some important differences between Windows symlinks and their POSIX counterparts.

    Windows symbolic links come in two flavours: directory and regular, which designate whether the symbolic link points to a directory or a file. The type must be correct - a directory symlink which actually points to a file cannot be selected with chdir and a file symlink which actually points to a directory cannot be read or written (note that Cygwin's emulation layer ignores this distinction).

    When symbolic links are created to existing targets, this distinction doesn't matter and symlink will automatically create the correct kind of symbolic link. The distinction matters when a symbolic link is created to a non-existent target.

    The other caveat is that by default symbolic links are a privileged operation. Administrators will always need to be running elevated (or with UAC disabled) and by default normal user accounts need to be granted the SeCreateSymbolicLinkPrivilege via Local Security Policy (secpol.msc) or via Active Directory.

    has_symlink can be used to check that a process is able to create symbolic links.

    Returns true if the user is able to create symbolic links. On Windows, this indicates that the user not only has the SeCreateSymbolicLinkPrivilege but is also running elevated, if necessary. On other platforms, this is simply indicates that the symlink system call is available.

    • since 4.03

    Read the contents of a symbolic link.

    Polling

    val select : + read:file_descr list -> + write:file_descr list -> + except:file_descr list -> + timeout:float -> + file_descr list * file_descr list * file_descr list

    Wait until some input/output operations become possible on some channels. The three list arguments are, respectively, a set of descriptors to check for reading (first argument), for writing (second argument), or for exceptional conditions (third argument). The fourth argument is the maximal timeout, in seconds; a negative fourth argument means no timeout (unbounded wait). The result is composed of three sets of descriptors: those ready for reading (first component), ready for writing (second component), and over which an exceptional condition is pending (third component).

    Locking

    type lock_command = Unix.lock_command =
    1. | F_ULOCK
      (*

      Unlock a region

      *)
    2. | F_LOCK
      (*

      Lock a region for writing, and block if already locked

      *)
    3. | F_TLOCK
      (*

      Lock a region for writing, or fail if already locked

      *)
    4. | F_TEST
      (*

      Test a region for other process locks

      *)
    5. | F_RLOCK
      (*

      Lock a region for reading, and block if already locked

      *)
    6. | F_TRLOCK
      (*

      Lock a region for reading, or fail if already locked

      *)

    Commands for lockf.

    val lockf : file_descr -> mode:lock_command -> len:int -> unit

    lockf fd ~mode ~len puts a lock on a region of the file opened as fd. The region starts at the current read/write position for fd (as set by lseek), and extends len bytes forward if len is positive, len bytes backwards if len is negative, or to the end of the file if len is zero. A write lock prevents any other process from acquiring a read or write lock on the region. A read lock prevents any other process from acquiring a write lock on the region, but lets other processes acquire read locks on it.

    The F_LOCK and F_TLOCK commands attempts to put a write lock on the specified region. The F_RLOCK and F_TRLOCK commands attempts to put a read lock on the specified region. If one or several locks put by another process prevent the current process from acquiring the lock, F_LOCK and F_RLOCK block until these locks are removed, while F_TLOCK and F_TRLOCK fail immediately with an exception. The F_ULOCK removes whatever locks the current process has on the specified region. Finally, the F_TEST command tests whether a write lock can be acquired on the specified region, without actually putting a lock. It returns immediately if successful, or fails otherwise.

    What happens when a process tries to lock a region of a file that is already locked by the same process depends on the OS. On POSIX-compliant systems, the second lock operation succeeds and may "promote" the older lock from read lock to write lock. On Windows, the second lock operation will block or fail.

    Signals

    Note: installation of signal handlers is performed via the functions Sys.signal and Sys.set_signal.

    val kill : pid:int -> signal:int -> unit

    kill ~pid ~signal sends signal number signal to the process with id pid.

    On Windows: only the Sys.sigkill signal is emulated.

    type sigprocmask_command = Unix.sigprocmask_command =
    1. | SIG_SETMASK
    2. | SIG_BLOCK
    3. | SIG_UNBLOCK
    val sigprocmask : mode:sigprocmask_command -> int list -> int list

    sigprocmask ~mode sigs changes the set of blocked signals. If mode is SIG_SETMASK, blocked signals are set to those in the list sigs. If mode is SIG_BLOCK, the signals in sigs are added to the set of blocked signals. If mode is SIG_UNBLOCK, the signals in sigs are removed from the set of blocked signals. sigprocmask returns the set of previously blocked signals.

    When the systhreads version of the Thread module is loaded, this function redirects to Thread.sigmask. I.e., sigprocmask only changes the mask of the current thread.

    • raises Invalid_argument

      on Windows (no inter-process signals on Windows)

    val sigpending : unit -> int list

    Return the set of blocked signals that are currently pending.

    • raises Invalid_argument

      on Windows (no inter-process signals on Windows)

    val sigsuspend : int list -> unit

    sigsuspend sigs atomically sets the blocked signals to sigs and waits for a non-ignored, non-blocked signal to be delivered. On return, the blocked signals are reset to their initial value.

    • raises Invalid_argument

      on Windows (no inter-process signals on Windows)

    val pause : unit -> unit

    Wait until a non-ignored, non-blocked signal is delivered.

    • raises Invalid_argument

      on Windows (no inter-process signals on Windows)

    Time functions

    type process_times = Unix.process_times = {
    1. tms_utime : float;
      (*

      User time for the process

      *)
    2. tms_stime : float;
      (*

      System time for the process

      *)
    3. tms_cutime : float;
      (*

      User time for the children processes

      *)
    4. tms_cstime : float;
      (*

      System time for the children processes

      *)
    }

    The execution times (CPU times) of a process.

    type tm = Unix.tm = {
    1. tm_sec : int;
      (*

      Seconds 0..60

      *)
    2. tm_min : int;
      (*

      Minutes 0..59

      *)
    3. tm_hour : int;
      (*

      Hours 0..23

      *)
    4. tm_mday : int;
      (*

      Day of month 1..31

      *)
    5. tm_mon : int;
      (*

      Month of year 0..11

      *)
    6. tm_year : int;
      (*

      Year - 1900

      *)
    7. tm_wday : int;
      (*

      Day of week (Sunday is 0)

      *)
    8. tm_yday : int;
      (*

      Day of year 0..365

      *)
    9. tm_isdst : bool;
      (*

      Daylight time savings in effect

      *)
    }

    The type representing wallclock time and calendar date.

    val time : unit -> float

    Return the current time since 00:00:00 GMT, Jan. 1, 1970, in seconds.

    val gettimeofday : unit -> float

    Same as time, but with resolution better than 1 second.

    val gmtime : float -> tm

    Convert a time in seconds, as returned by time, into a date and a time. Assumes UTC (Coordinated Universal Time), also known as GMT. To perform the inverse conversion, set the TZ environment variable to "UTC", use mktime, and then restore the original value of TZ.

    val localtime : float -> tm

    Convert a time in seconds, as returned by time, into a date and a time. Assumes the local time zone. The function performing the inverse conversion is mktime.

    val mktime : tm -> float * tm

    Convert a date and time, specified by the tm argument, into a time in seconds, as returned by time. The tm_isdst, tm_wday and tm_yday fields of tm are ignored. Also return a normalized copy of the given tm record, with the tm_wday, tm_yday, and tm_isdst fields recomputed from the other fields, and the other fields normalized (so that, e.g., 40 October is changed into 9 November). The tm argument is interpreted in the local time zone.

    val alarm : int -> int

    Schedule a SIGALRM signal after the given number of seconds.

    • raises Invalid_argument

      on Windows

    val sleep : int -> unit

    Stop execution for the given number of seconds.

    val sleepf : float -> unit

    Stop execution for the given number of seconds. Like sleep, but fractions of seconds are supported.

    • since 4.12
    val times : unit -> process_times

    Return the execution times of the process.

    On Windows: partially implemented, will not report timings for child processes.

    val utimes : string -> access:float -> modif:float -> unit

    Set the last access time (second arg) and last modification time (third arg) for a file. Times are expressed in seconds from 00:00:00 GMT, Jan. 1, 1970. If both times are 0.0, the access and last modification times are both set to the current time.

    type interval_timer = Unix.interval_timer =
    1. | ITIMER_REAL
      (*

      decrements in real time, and sends the signal SIGALRM when expired.

      *)
    2. | ITIMER_VIRTUAL
      (*

      decrements in process virtual time, and sends SIGVTALRM when expired.

      *)
    3. | ITIMER_PROF
      (*

      (for profiling) decrements both when the process is running and when the system is running on behalf of the process; it sends SIGPROF when expired.

      *)

    The three kinds of interval timers.

    type interval_timer_status = Unix.interval_timer_status = {
    1. it_interval : float;
      (*

      Period

      *)
    2. it_value : float;
      (*

      Current value of the timer

      *)
    }

    The type describing the status of an interval timer

    Return the current status of the given interval timer.

    • raises Invalid_argument

      on Windows

    setitimer t s sets the interval timer t and returns its previous status. The s argument is interpreted as follows: s.it_value, if nonzero, is the time to the next timer expiration; s.it_interval, if nonzero, specifies a value to be used in reloading it_value when the timer expires. Setting s.it_value to zero disables the timer. Setting s.it_interval to zero causes the timer to be disabled after its next expiration.

    • raises Invalid_argument

      on Windows

    User id, group id

    val getuid : unit -> int

    Return the user id of the user executing the process.

    On Windows: always returns 1.

    val geteuid : unit -> int

    Return the effective user id under which the process runs.

    On Windows: always returns 1.

    val setuid : int -> unit

    Set the real user id and effective user id for the process.

    • raises Invalid_argument

      on Windows

    val getgid : unit -> int

    Return the group id of the user executing the process.

    On Windows: always returns 1.

    val getegid : unit -> int

    Return the effective group id under which the process runs.

    On Windows: always returns 1.

    val setgid : int -> unit

    Set the real group id and effective group id for the process.

    • raises Invalid_argument

      on Windows

    val getgroups : unit -> int array

    Return the list of groups to which the user executing the process belongs.

    On Windows: always returns [|1|].

    val setgroups : int array -> unit

    setgroups groups sets the supplementary group IDs for the calling process. Appropriate privileges are required.

    • raises Invalid_argument

      on Windows

    val initgroups : string -> int -> unit

    initgroups user group initializes the group access list by reading the group database /etc/group and using all groups of which user is a member. The additional group group is also added to the list.

    • raises Invalid_argument

      on Windows

    type passwd_entry = Unix.passwd_entry = {
    1. pw_name : string;
    2. pw_passwd : string;
    3. pw_uid : int;
    4. pw_gid : int;
    5. pw_gecos : string;
    6. pw_dir : string;
    7. pw_shell : string;
    }

    Structure of entries in the passwd database.

    type group_entry = Unix.group_entry = {
    1. gr_name : string;
    2. gr_passwd : string;
    3. gr_gid : int;
    4. gr_mem : string array;
    }

    Structure of entries in the groups database.

    val getlogin : unit -> string

    Return the login name of the user executing the process.

    val getpwnam : string -> passwd_entry

    Find an entry in passwd with the given name.

    • raises Not_found

      if no such entry exists, or always on Windows.

    val getgrnam : string -> group_entry

    Find an entry in group with the given name.

    • raises Not_found

      if no such entry exists, or always on Windows.

    val getpwuid : int -> passwd_entry

    Find an entry in passwd with the given user id.

    • raises Not_found

      if no such entry exists, or always on Windows.

    val getgrgid : int -> group_entry

    Find an entry in group with the given group id.

    • raises Not_found

      if no such entry exists, or always on Windows.

    Internet addresses

    type inet_addr = Unix.inet_addr

    The abstract type of Internet addresses.

    val inet_addr_of_string : string -> inet_addr

    Conversion from the printable representation of an Internet address to its internal representation. The argument string consists of 4 numbers separated by periods (XXX.YYY.ZZZ.TTT) for IPv4 addresses, and up to 8 numbers separated by colons for IPv6 addresses.

    • raises Failure

      when given a string that does not match these formats.

    val string_of_inet_addr : inet_addr -> string

    Return the printable representation of the given Internet address. See inet_addr_of_string for a description of the printable representation.

    val inet_addr_any : inet_addr

    A special IPv4 address, for use only with bind, representing all the Internet addresses that the host machine possesses.

    val inet_addr_loopback : inet_addr

    A special IPv4 address representing the host machine (127.0.0.1).

    val inet6_addr_any : inet_addr

    A special IPv6 address, for use only with bind, representing all the Internet addresses that the host machine possesses.

    val inet6_addr_loopback : inet_addr

    A special IPv6 address representing the host machine (::1).

    val is_inet6_addr : inet_addr -> bool

    Whether the given inet_addr is an IPv6 address.

    • since 4.12

    Sockets

    type socket_domain = Unix.socket_domain =
    1. | PF_UNIX
      (*

      Unix domain

      *)
    2. | PF_INET
      (*

      Internet domain (IPv4)

      *)
    3. | PF_INET6
      (*

      Internet domain (IPv6)

      *)

    The type of socket domains. Not all platforms support IPv6 sockets (type PF_INET6).

    On Windows: PF_UNIX supported since 4.14.0 on Windows 10 1803 and later.

    type socket_type = Unix.socket_type =
    1. | SOCK_STREAM
      (*

      Stream socket

      *)
    2. | SOCK_DGRAM
      (*

      Datagram socket

      *)
    3. | SOCK_RAW
      (*

      Raw socket

      *)
    4. | SOCK_SEQPACKET
      (*

      Sequenced packets socket

      *)

    The type of socket kinds, specifying the semantics of communications. SOCK_SEQPACKET is included for completeness, but is rarely supported by the OS, and needs system calls that are not available in this library.

    type sockaddr = Unix.sockaddr =
    1. | ADDR_UNIX of string
    2. | ADDR_INET of inet_addr * int

    The type of socket addresses. ADDR_UNIX name is a socket address in the Unix domain; name is a file name in the file system. ADDR_INET(addr,port) is a socket address in the Internet domain; addr is the Internet address of the machine, and port is the port number.

    val socket : + ?cloexec:bool -> + domain:socket_domain -> + kind:socket_type -> + protocol:int -> + file_descr

    Create a new socket in the given domain, and with the given kind. The third argument is the protocol type; 0 selects the default protocol for that kind of sockets. See set_close_on_exec for documentation on the cloexec optional argument.

    val domain_of_sockaddr : sockaddr -> socket_domain

    Return the socket domain adequate for the given socket address.

    val socketpair : + ?cloexec:bool -> + domain:socket_domain -> + kind:socket_type -> + protocol:int -> + file_descr * file_descr

    Create a pair of unnamed sockets, connected together. See set_close_on_exec for documentation on the cloexec optional argument.

    val accept : ?cloexec:bool -> file_descr -> file_descr * sockaddr

    Accept connections on the given socket. The returned descriptor is a socket connected to the client; the returned address is the address of the connecting client. See set_close_on_exec for documentation on the cloexec optional argument.

    val bind : file_descr -> addr:sockaddr -> unit

    Bind a socket to an address.

    val connect : file_descr -> addr:sockaddr -> unit

    Connect a socket to an address.

    val listen : file_descr -> max:int -> unit

    Set up a socket for receiving connection requests. The integer argument is the maximal number of pending requests.

    type shutdown_command = Unix.shutdown_command =
    1. | SHUTDOWN_RECEIVE
      (*

      Close for receiving

      *)
    2. | SHUTDOWN_SEND
      (*

      Close for sending

      *)
    3. | SHUTDOWN_ALL
      (*

      Close both

      *)

    The type of commands for shutdown.

    val shutdown : file_descr -> mode:shutdown_command -> unit

    Shutdown a socket connection. SHUTDOWN_SEND as second argument causes reads on the other end of the connection to return an end-of-file condition. SHUTDOWN_RECEIVE causes writes on the other end of the connection to return a closed pipe condition (SIGPIPE signal).

    val getsockname : file_descr -> sockaddr

    Return the address of the given socket.

    val getpeername : file_descr -> sockaddr

    Return the address of the host connected to the given socket.

    type msg_flag = Unix.msg_flag =
    1. | MSG_OOB
    2. | MSG_DONTROUTE
    3. | MSG_PEEK

    The flags for recv, recvfrom, send and sendto.

    val recv : + file_descr -> + buf:bytes -> + pos:int -> + len:int -> + mode:msg_flag list -> + int

    Receive data from a connected socket.

    val recvfrom : + file_descr -> + buf:bytes -> + pos:int -> + len:int -> + mode:msg_flag list -> + int * sockaddr

    Receive data from an unconnected socket.

    val send : + file_descr -> + buf:bytes -> + pos:int -> + len:int -> + mode:msg_flag list -> + int

    Send data over a connected socket.

    val send_substring : + file_descr -> + buf:string -> + pos:int -> + len:int -> + mode:msg_flag list -> + int

    Same as send, but take the data from a string instead of a byte sequence.

    • since 4.02
    val sendto : + file_descr -> + buf:bytes -> + pos:int -> + len:int -> + mode:msg_flag list -> + addr:sockaddr -> + int

    Send data over an unconnected socket.

    val sendto_substring : + file_descr -> + buf:string -> + pos:int -> + len:int -> + mode:msg_flag list -> + sockaddr -> + int

    Same as sendto, but take the data from a string instead of a byte sequence.

    • since 4.02

    Socket options

    type socket_bool_option = Unix.socket_bool_option =
    1. | SO_DEBUG
      (*

      Record debugging information

      *)
    2. | SO_BROADCAST
      (*

      Permit sending of broadcast messages

      *)
    3. | SO_REUSEADDR
      (*

      Allow reuse of local addresses for bind

      *)
    4. | SO_KEEPALIVE
      (*

      Keep connection active

      *)
    5. | SO_DONTROUTE
      (*

      Bypass the standard routing algorithms

      *)
    6. | SO_OOBINLINE
      (*

      Leave out-of-band data in line

      *)
    7. | SO_ACCEPTCONN
      (*

      Report whether socket listening is enabled

      *)
    8. | TCP_NODELAY
      (*

      Control the Nagle algorithm for TCP sockets

      *)
    9. | IPV6_ONLY
      (*

      Forbid binding an IPv6 socket to an IPv4 address

      *)
    10. | SO_REUSEPORT
      (*

      Allow reuse of address and port bindings.

      • since 4.12.
      *)

    The socket options that can be consulted with getsockopt and modified with setsockopt. These options have a boolean (true/false) value.

    type socket_int_option = Unix.socket_int_option =
    1. | SO_SNDBUF
      (*

      Size of send buffer

      *)
    2. | SO_RCVBUF
      (*

      Size of received buffer

      *)
    3. | SO_ERROR
      (*

      Deprecated. Use getsockopt_error instead.

      • deprecated Use Unix.getsockopt_error instead.
      *)
    4. | SO_TYPE
      (*

      Report the socket type

      *)
    5. | SO_RCVLOWAT
      (*

      Minimum number of bytes to process for input operations

      *)
    6. | SO_SNDLOWAT
      (*

      Minimum number of bytes to process for output operations

      *)

    The socket options that can be consulted with getsockopt_int and modified with setsockopt_int. These options have an integer value.

    type socket_optint_option = Unix.socket_optint_option =
    1. | SO_LINGER
      (*

      Whether to linger on closed connections that have data present, and for how long (in seconds)

      *)

    The socket options that can be consulted with getsockopt_optint and modified with setsockopt_optint. These options have a value of type int option, with None meaning ``disabled''.

    type socket_float_option = Unix.socket_float_option =
    1. | SO_RCVTIMEO
      (*

      Timeout for input operations

      *)
    2. | SO_SNDTIMEO
      (*

      Timeout for output operations

      *)

    The socket options that can be consulted with getsockopt_float and modified with setsockopt_float. These options have a floating-point value representing a time in seconds. The value 0 means infinite timeout.

    val getsockopt : file_descr -> socket_bool_option -> bool

    Return the current status of a boolean-valued option in the given socket.

    val setsockopt : file_descr -> socket_bool_option -> bool -> unit

    Set or clear a boolean-valued option in the given socket.

    val getsockopt_int : file_descr -> socket_int_option -> int

    Same as getsockopt for an integer-valued socket option.

    val setsockopt_int : file_descr -> socket_int_option -> int -> unit

    Same as setsockopt for an integer-valued socket option.

    val getsockopt_optint : file_descr -> socket_optint_option -> int option

    Same as getsockopt for a socket option whose value is an int option.

    val setsockopt_optint : + file_descr -> + socket_optint_option -> + int option -> + unit

    Same as setsockopt for a socket option whose value is an int option.

    val getsockopt_float : file_descr -> socket_float_option -> float

    Same as getsockopt for a socket option whose value is a floating-point number.

    val setsockopt_float : file_descr -> socket_float_option -> float -> unit

    Same as setsockopt for a socket option whose value is a floating-point number.

    val getsockopt_error : file_descr -> error option

    Return the error condition associated with the given socket, and clear it.

    High-level network connection functions

    val open_connection : sockaddr -> in_channel * out_channel

    Connect to a server at the given address. Return a pair of buffered channels connected to the server. Remember to call Stdlib.flush on the output channel at the right times to ensure correct synchronization.

    The two channels returned by open_connection share a descriptor to a socket. Therefore, when the connection is over, you should call Stdlib.close_out on the output channel, which will also close the underlying socket. Do not call Stdlib.close_in on the input channel; it will be collected by the GC eventually.

    val shutdown_connection : in_channel -> unit

    ``Shut down'' a connection established with open_connection; that is, transmit an end-of-file condition to the server reading on the other side of the connection. This does not close the socket and the channels used by the connection. See Unix.open_connection for how to close them once the connection is over.

    val establish_server : + (in_channel -> out_channel -> unit) -> + addr:sockaddr -> + unit

    Establish a server on the given address. The function given as first argument is called for each connection with two buffered channels connected to the client. A new process is created for each connection. The function establish_server never returns normally.

    The two channels given to the function share a descriptor to a socket. The function does not need to close the channels, since this occurs automatically when the function returns. If the function prefers explicit closing, it should close the output channel using Stdlib.close_out and leave the input channel unclosed, for reasons explained in Unix.in_channel_of_descr.

    • raises Invalid_argument

      on Windows. Use threads instead.

    Host and protocol databases

    type host_entry = Unix.host_entry = {
    1. h_name : string;
    2. h_aliases : string array;
    3. h_addrtype : socket_domain;
    4. h_addr_list : inet_addr array;
    }

    Structure of entries in the hosts database.

    type protocol_entry = Unix.protocol_entry = {
    1. p_name : string;
    2. p_aliases : string array;
    3. p_proto : int;
    }

    Structure of entries in the protocols database.

    type service_entry = Unix.service_entry = {
    1. s_name : string;
    2. s_aliases : string array;
    3. s_port : int;
    4. s_proto : string;
    }

    Structure of entries in the services database.

    val gethostname : unit -> string

    Return the name of the local host.

    val gethostbyname : string -> host_entry

    Find an entry in hosts with the given name.

    • raises Not_found

      if no such entry exists.

    val gethostbyaddr : inet_addr -> host_entry

    Find an entry in hosts with the given address.

    • raises Not_found

      if no such entry exists.

    val getprotobyname : string -> protocol_entry

    Find an entry in protocols with the given name.

    • raises Not_found

      if no such entry exists.

    val getprotobynumber : int -> protocol_entry

    Find an entry in protocols with the given protocol number.

    • raises Not_found

      if no such entry exists.

    val getservbyname : string -> protocol:string -> service_entry

    Find an entry in services with the given name.

    • raises Not_found

      if no such entry exists.

    val getservbyport : int -> protocol:string -> service_entry

    Find an entry in services with the given service number.

    • raises Not_found

      if no such entry exists.

    type addr_info = Unix.addr_info = {
    1. ai_family : socket_domain;
      (*

      Socket domain

      *)
    2. ai_socktype : socket_type;
      (*

      Socket type

      *)
    3. ai_protocol : int;
      (*

      Socket protocol number

      *)
    4. ai_addr : sockaddr;
      (*

      Address

      *)
    5. ai_canonname : string;
      (*

      Canonical host name

      *)
    }

    Address information returned by getaddrinfo.

    type getaddrinfo_option = Unix.getaddrinfo_option =
    1. | AI_FAMILY of socket_domain
      (*

      Impose the given socket domain

      *)
    2. | AI_SOCKTYPE of socket_type
      (*

      Impose the given socket type

      *)
    3. | AI_PROTOCOL of int
      (*

      Impose the given protocol

      *)
    4. | AI_NUMERICHOST
      (*

      Do not call name resolver, expect numeric IP address

      *)
    5. | AI_CANONNAME
      (*

      Fill the ai_canonname field of the result

      *)
    6. | AI_PASSIVE
      (*

      Set address to ``any'' address for use with bind

      *)

    Options to getaddrinfo.

    val getaddrinfo : string -> string -> getaddrinfo_option list -> addr_info list

    getaddrinfo host service opts returns a list of addr_info records describing socket parameters and addresses suitable for communicating with the given host and service. The empty list is returned if the host or service names are unknown, or the constraints expressed in opts cannot be satisfied.

    host is either a host name or the string representation of an IP address. host can be given as the empty string; in this case, the ``any'' address or the ``loopback'' address are used, depending whether opts contains AI_PASSIVE. service is either a service name or the string representation of a port number. service can be given as the empty string; in this case, the port field of the returned addresses is set to 0. opts is a possibly empty list of options that allows the caller to force a particular socket domain (e.g. IPv6 only or IPv4 only) or a particular socket type (e.g. TCP only or UDP only).

    type name_info = Unix.name_info = {
    1. ni_hostname : string;
      (*

      Name or IP address of host

      *)
    2. ni_service : string;
      (*

      Name of service or port number

      *)
    }

    Host and service information returned by getnameinfo.

    type getnameinfo_option = Unix.getnameinfo_option =
    1. | NI_NOFQDN
      (*

      Do not qualify local host names

      *)
    2. | NI_NUMERICHOST
      (*

      Always return host as IP address

      *)
    3. | NI_NAMEREQD
      (*

      Fail if host name cannot be determined

      *)
    4. | NI_NUMERICSERV
      (*

      Always return service as port number

      *)
    5. | NI_DGRAM
      (*

      Consider the service as UDP-based instead of the default TCP

      *)

    Options to getnameinfo.

    val getnameinfo : sockaddr -> getnameinfo_option list -> name_info

    getnameinfo addr opts returns the host name and service name corresponding to the socket address addr. opts is a possibly empty list of options that governs how these names are obtained.

    • raises Not_found

      if an error occurs.

    Terminal interface

    The following functions implement the POSIX standard terminal interface. They provide control over asynchronous communication ports and pseudo-terminals. Refer to the termios man page for a complete description.

    type terminal_io = Unix.terminal_io = {
    1. mutable c_ignbrk : bool;
      (*

      Ignore the break condition.

      *)
    2. mutable c_brkint : bool;
      (*

      Signal interrupt on break condition.

      *)
    3. mutable c_ignpar : bool;
      (*

      Ignore characters with parity errors.

      *)
    4. mutable c_parmrk : bool;
      (*

      Mark parity errors.

      *)
    5. mutable c_inpck : bool;
      (*

      Enable parity check on input.

      *)
    6. mutable c_istrip : bool;
      (*

      Strip 8th bit on input characters.

      *)
    7. mutable c_inlcr : bool;
      (*

      Map NL to CR on input.

      *)
    8. mutable c_igncr : bool;
      (*

      Ignore CR on input.

      *)
    9. mutable c_icrnl : bool;
      (*

      Map CR to NL on input.

      *)
    10. mutable c_ixon : bool;
      (*

      Recognize XON/XOFF characters on input.

      *)
    11. mutable c_ixoff : bool;
      (*

      Emit XON/XOFF chars to control input flow.

      *)
    12. mutable c_opost : bool;
      (*

      Enable output processing.

      *)
    13. mutable c_obaud : int;
      (*

      Output baud rate (0 means close connection).

      *)
    14. mutable c_ibaud : int;
      (*

      Input baud rate.

      *)
    15. mutable c_csize : int;
      (*

      Number of bits per character (5-8).

      *)
    16. mutable c_cstopb : int;
      (*

      Number of stop bits (1-2).

      *)
    17. mutable c_cread : bool;
      (*

      Reception is enabled.

      *)
    18. mutable c_parenb : bool;
      (*

      Enable parity generation and detection.

      *)
    19. mutable c_parodd : bool;
      (*

      Specify odd parity instead of even.

      *)
    20. mutable c_hupcl : bool;
      (*

      Hang up on last close.

      *)
    21. mutable c_clocal : bool;
      (*

      Ignore modem status lines.

      *)
    22. mutable c_isig : bool;
      (*

      Generate signal on INTR, QUIT, SUSP.

      *)
    23. mutable c_icanon : bool;
      (*

      Enable canonical processing (line buffering and editing)

      *)
    24. mutable c_noflsh : bool;
      (*

      Disable flush after INTR, QUIT, SUSP.

      *)
    25. mutable c_echo : bool;
      (*

      Echo input characters.

      *)
    26. mutable c_echoe : bool;
      (*

      Echo ERASE (to erase previous character).

      *)
    27. mutable c_echok : bool;
      (*

      Echo KILL (to erase the current line).

      *)
    28. mutable c_echonl : bool;
      (*

      Echo NL even if c_echo is not set.

      *)
    29. mutable c_vintr : char;
      (*

      Interrupt character (usually ctrl-C).

      *)
    30. mutable c_vquit : char;
      (*

      Quit character (usually ctrl-\).

      *)
    31. mutable c_verase : char;
      (*

      Erase character (usually DEL or ctrl-H).

      *)
    32. mutable c_vkill : char;
      (*

      Kill line character (usually ctrl-U).

      *)
    33. mutable c_veof : char;
      (*

      End-of-file character (usually ctrl-D).

      *)
    34. mutable c_veol : char;
      (*

      Alternate end-of-line char. (usually none).

      *)
    35. mutable c_vmin : int;
      (*

      Minimum number of characters to read before the read request is satisfied.

      *)
    36. mutable c_vtime : int;
      (*

      Maximum read wait (in 0.1s units).

      *)
    37. mutable c_vstart : char;
      (*

      Start character (usually ctrl-Q).

      *)
    38. mutable c_vstop : char;
      (*

      Stop character (usually ctrl-S).

      *)
    }
    val tcgetattr : file_descr -> terminal_io

    Return the status of the terminal referred to by the given file descriptor.

    • raises Invalid_argument

      on Windows

    type setattr_when = Unix.setattr_when =
    1. | TCSANOW
    2. | TCSADRAIN
    3. | TCSAFLUSH
    val tcsetattr : file_descr -> mode:setattr_when -> terminal_io -> unit

    Set the status of the terminal referred to by the given file descriptor. The second argument indicates when the status change takes place: immediately (TCSANOW), when all pending output has been transmitted (TCSADRAIN), or after flushing all input that has been received but not read (TCSAFLUSH). TCSADRAIN is recommended when changing the output parameters; TCSAFLUSH, when changing the input parameters.

    • raises Invalid_argument

      on Windows

    val tcsendbreak : file_descr -> duration:int -> unit

    Send a break condition on the given file descriptor. The second argument is the duration of the break, in 0.1s units; 0 means standard duration (0.25s).

    • raises Invalid_argument

      on Windows

    val tcdrain : file_descr -> unit

    Waits until all output written on the given file descriptor has been transmitted.

    • raises Invalid_argument

      on Windows

    type flush_queue = Unix.flush_queue =
    1. | TCIFLUSH
    2. | TCOFLUSH
    3. | TCIOFLUSH
    val tcflush : file_descr -> mode:flush_queue -> unit

    Discard data written on the given file descriptor but not yet transmitted, or data received but not yet read, depending on the second argument: TCIFLUSH flushes data received but not read, TCOFLUSH flushes data written but not transmitted, and TCIOFLUSH flushes both.

    • raises Invalid_argument

      on Windows

    type flow_action = Unix.flow_action =
    1. | TCOOFF
    2. | TCOON
    3. | TCIOFF
    4. | TCION
    val tcflow : file_descr -> mode:flow_action -> unit

    Suspend or restart reception or transmission of data on the given file descriptor, depending on the second argument: TCOOFF suspends output, TCOON restarts output, TCIOFF transmits a STOP character to suspend input, and TCION transmits a START character to restart input.

    • raises Invalid_argument

      on Windows

    val setsid : unit -> int

    Put the calling process in a new session and detach it from its controlling terminal.

    • raises Invalid_argument

      on Windows

    diff --git a/ocaml/Untypeast/index.html b/ocaml/Untypeast/index.html new file mode 100644 index 0000000..44d4a7e --- /dev/null +++ b/ocaml/Untypeast/index.html @@ -0,0 +1,65 @@ + +Untypeast (ocaml.Untypeast)

    Module Untypeast

    val lident_of_path : Path.t -> Longident.t
    type mapper = {
    1. attribute : mapper -> Typedtree.attribute -> Parsetree.attribute;
    2. attributes : mapper -> Typedtree.attribute list -> Parsetree.attribute list;
    3. binding_op : mapper -> + Typedtree.binding_op -> + Typedtree.pattern -> + Parsetree.binding_op;
    4. case : 'k. mapper -> 'k Typedtree.case -> Parsetree.case;
    5. class_declaration : mapper -> + Typedtree.class_declaration -> + Parsetree.class_declaration;
    6. class_description : mapper -> + Typedtree.class_description -> + Parsetree.class_description;
    7. class_expr : mapper -> Typedtree.class_expr -> Parsetree.class_expr;
    8. class_field : mapper -> Typedtree.class_field -> Parsetree.class_field;
    9. class_signature : mapper -> + Typedtree.class_signature -> + Parsetree.class_signature;
    10. class_structure : mapper -> + Typedtree.class_structure -> + Parsetree.class_structure;
    11. class_type : mapper -> Typedtree.class_type -> Parsetree.class_type;
    12. class_type_declaration : mapper -> + Typedtree.class_type_declaration -> + Parsetree.class_type_declaration;
    13. class_type_field : mapper -> + Typedtree.class_type_field -> + Parsetree.class_type_field;
    14. constructor_declaration : mapper -> + Typedtree.constructor_declaration -> + Parsetree.constructor_declaration;
    15. expr : mapper -> Typedtree.expression -> Parsetree.expression;
    16. extension_constructor : mapper -> + Typedtree.extension_constructor -> + Parsetree.extension_constructor;
    17. include_declaration : mapper -> + Typedtree.include_declaration -> + Parsetree.include_declaration;
    18. include_description : mapper -> + Typedtree.include_description -> + Parsetree.include_description;
    19. label_declaration : mapper -> + Typedtree.label_declaration -> + Parsetree.label_declaration;
    20. location : mapper -> Location.t -> Location.t;
    21. module_binding : mapper -> + Typedtree.module_binding -> + Parsetree.module_binding;
    22. module_declaration : mapper -> + Typedtree.module_declaration -> + Parsetree.module_declaration;
    23. module_substitution : mapper -> + Typedtree.module_substitution -> + Parsetree.module_substitution;
    24. module_expr : mapper -> Typedtree.module_expr -> Parsetree.module_expr;
    25. module_type : mapper -> Typedtree.module_type -> Parsetree.module_type;
    26. module_type_declaration : mapper -> + Typedtree.module_type_declaration -> + Parsetree.module_type_declaration;
    27. package_type : mapper -> Typedtree.package_type -> Parsetree.package_type;
    28. open_declaration : mapper -> + Typedtree.open_declaration -> + Parsetree.open_declaration;
    29. open_description : mapper -> + Typedtree.open_description -> + Parsetree.open_description;
    30. pat : 'k. mapper -> 'k Typedtree.general_pattern -> Parsetree.pattern;
    31. row_field : mapper -> Typedtree.row_field -> Parsetree.row_field;
    32. object_field : mapper -> Typedtree.object_field -> Parsetree.object_field;
    33. signature : mapper -> Typedtree.signature -> Parsetree.signature;
    34. signature_item : mapper -> + Typedtree.signature_item -> + Parsetree.signature_item;
    35. structure : mapper -> Typedtree.structure -> Parsetree.structure;
    36. structure_item : mapper -> + Typedtree.structure_item -> + Parsetree.structure_item;
    37. typ : mapper -> Typedtree.core_type -> Parsetree.core_type;
    38. type_declaration : mapper -> + Typedtree.type_declaration -> + Parsetree.type_declaration;
    39. type_extension : mapper -> + Typedtree.type_extension -> + Parsetree.type_extension;
    40. type_exception : mapper -> + Typedtree.type_exception -> + Parsetree.type_exception;
    41. type_kind : mapper -> Typedtree.type_kind -> Parsetree.type_kind;
    42. value_binding : mapper -> Typedtree.value_binding -> Parsetree.value_binding;
    43. value_description : mapper -> + Typedtree.value_description -> + Parsetree.value_description;
    44. with_constraint : mapper -> + (Path.t * Longident.t Location.loc * Typedtree.with_constraint) -> + Parsetree.with_constraint;
    }
    val default_mapper : mapper
    val untype_structure : + ?mapper:mapper -> + Typedtree.structure -> + Parsetree.structure
    val untype_signature : + ?mapper:mapper -> + Typedtree.signature -> + Parsetree.signature
    val untype_expression : + ?mapper:mapper -> + Typedtree.expression -> + Parsetree.expression
    val untype_pattern : + ?mapper:mapper -> + _ Typedtree.general_pattern -> + Parsetree.pattern
    diff --git a/ocaml/Value_rec_check/index.html b/ocaml/Value_rec_check/index.html new file mode 100644 index 0000000..9de9825 --- /dev/null +++ b/ocaml/Value_rec_check/index.html @@ -0,0 +1,5 @@ + +Value_rec_check (ocaml.Value_rec_check)

    Module Value_rec_check

    val is_valid_recursive_expression : + Ident.t list -> + Typedtree.expression -> + Value_rec_types.recursive_binding_kind option
    val is_valid_class_expr : Ident.t list -> Typedtree.class_expr -> bool
    diff --git a/ocaml/Value_rec_compiler/index.html b/ocaml/Value_rec_compiler/index.html new file mode 100644 index 0000000..82c49be --- /dev/null +++ b/ocaml/Value_rec_compiler/index.html @@ -0,0 +1,5 @@ + +Value_rec_compiler (ocaml.Value_rec_compiler)

    Module Value_rec_compiler

    diff --git a/ocaml/Value_rec_types/index.html b/ocaml/Value_rec_types/index.html new file mode 100644 index 0000000..09c32f2 --- /dev/null +++ b/ocaml/Value_rec_types/index.html @@ -0,0 +1,2 @@ + +Value_rec_types (ocaml.Value_rec_types)

    Module Value_rec_types

    Types related to the compilation of value let-recs (non-functional recursive definitions)

    type recursive_binding_kind =
    1. | Static
      (*

      Bindings for which some kind of pre-allocation scheme is possible. The expression is allowed to be recursive, as long as its definition does not inspect recursively defined values.

      *)
    2. | Dynamic
      (*

      Bindings for which pre-allocation is not possible. The expression is not allowed to refer to any recursive variable.

      *)

    The kind of recursive bindings, as computed by Value_rec_check.classify_expression

    diff --git a/ocaml/Var_within_closure/Map/index.html b/ocaml/Var_within_closure/Map/index.html new file mode 100644 index 0000000..31f3058 --- /dev/null +++ b/ocaml/Var_within_closure/Map/index.html @@ -0,0 +1,17 @@ + +Map (ocaml.Var_within_closure.Map)

    Module Var_within_closure.Map

    include Map.S with type key = T.t and type 'a t = 'a Map.Make(T).t

    Maps

    type key = T.t

    The type of the map keys.

    type 'a t = 'a Stdlib.Map.Make(T).t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key -> 'a -> 'a t -> 'a t

    add key data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key -> 'a -> 'a list t -> 'a list t

    add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

    update key f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : (key -> bool) -> 'a t -> key * 'a

    find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : (key -> bool) -> 'a t -> key * 'a

    find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : (key -> 'a -> unit) -> 'a t -> unit

    iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

    fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : (key -> 'a -> bool) -> 'a t -> 'a t

    filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : (key -> 'a -> bool) -> 'a t -> bool

    for_all f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : (key -> 'a -> bool) -> 'a t -> bool

    exists f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Stdlib.Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Stdlib.Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    val of_list : (key * 'a) list -> 'a t
    val disjoint_union : + ?eq:('a -> 'a -> bool) -> + ?print:(Stdlib.Format.formatter -> 'a -> unit) -> + 'a t -> + 'a t -> + 'a t

    disjoint_union m1 m2 contains all bindings from m1 and m2. If some binding is present in both and the associated value is not equal, a Fatal_error is raised

    val union_right : 'a t -> 'a t -> 'a t

    union_right m1 m2 contains all bindings from m1 and m2. If some binding is present in both, the one from m2 is taken

    val union_left : 'a t -> 'a t -> 'a t

    union_left m1 m2 = union_right m2 m1

    val union_merge : ('a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
    val rename : key t -> key -> key
    val map_keys : (key -> key) -> 'a t -> 'a t
    val keys : 'a t -> Stdlib.Set.Make(T).t
    val data : 'a t -> 'a list
    val of_set : (key -> 'a) -> Stdlib.Set.Make(T).t -> 'a t
    val transpose_keys_and_data : key t -> key t
    val transpose_keys_and_data_set : key t -> Stdlib.Set.Make(T).t t
    val print : + (Stdlib.Format.formatter -> 'a -> unit) -> + Stdlib.Format.formatter -> + 'a t -> + unit
    diff --git a/ocaml/Var_within_closure/Set/index.html b/ocaml/Var_within_closure/Set/index.html new file mode 100644 index 0000000..20e58b4 --- /dev/null +++ b/ocaml/Var_within_closure/Set/index.html @@ -0,0 +1,2 @@ + +Set (ocaml.Var_within_closure.Set)

    Module Var_within_closure.Set

    include Set.S with type elt = T.t and type t = Set.Make(T).t

    Sets

    type elt = T.t

    The type of the set elements.

    The type of sets.

    val empty : t

    The empty set.

    val add : elt -> t -> t

    add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val singleton : elt -> t

    singleton x returns the one-element set containing only x.

    val remove : elt -> t -> t

    remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val union : t -> t -> t

    Set union.

    val inter : t -> t -> t

    Set intersection.

    val disjoint : t -> t -> bool

    Test if two sets are disjoint.

    • since 4.08
    val diff : t -> t -> t

    Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

    val cardinal : t -> int

    Return the number of elements of a set.

    Elements

    val elements : t -> elt list

    Return the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Set.Make.

    val min_elt : t -> elt

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

    val min_elt_opt : t -> elt option

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

    • since 4.05
    val max_elt : t -> elt

    Same as min_elt, but returns the largest element of the given set.

    val max_elt_opt : t -> elt option

    Same as min_elt_opt, but returns the largest element of the given set.

    • since 4.05
    val choose : t -> elt

    Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    val choose_opt : t -> elt option

    Return one element of the given set, or None if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    • since 4.05

    Searching

    val find : elt -> t -> elt

    find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

    • since 4.01
    val find_opt : elt -> t -> elt option

    find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

    • since 4.05
    val find_first : (elt -> bool) -> t -> elt

    find_first f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

    For example, find_first (fun e -> Ord.compare e x >= 0) s will return the first element e of s where Ord.compare e x >= 0 (intuitively: e >= x), or raise Not_found if x is greater than any element of s.

    • since 4.05
    val find_first_opt : (elt -> bool) -> t -> elt option

    find_first_opt f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

    • since 4.05
    val find_last : (elt -> bool) -> t -> elt

    find_last f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

    • since 4.05
    val find_last_opt : (elt -> bool) -> t -> elt option

    find_last_opt f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

    • since 4.05

    Traversing

    val iter : (elt -> unit) -> t -> unit

    iter f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.

    val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc

    fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

    Transforming

    val filter : (elt -> bool) -> t -> t

    filter f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val filter_map : (elt -> elt option) -> t -> t

    filter_map f s returns the set of all v such that f x = Some v for some element x of s.

    For example,

    filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) s

    is the set of halves of the even elements of s.

    If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned unchanged: the result of the function is then physically equal to s.

    • since 4.11
    val partition : (elt -> bool) -> t -> t * t

    partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

    val split : elt -> t -> t * bool * t

    split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.

    Predicates and comparisons

    val is_empty : t -> bool

    Test whether a set is empty or not.

    val mem : elt -> t -> bool

    mem x s tests whether x belongs to the set s.

    val equal : t -> t -> bool

    equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

    val compare : t -> t -> int

    Total ordering between sets. Can be used as the ordering function for doing sets of sets.

    val subset : t -> t -> bool

    subset s1 s2 tests whether the set s1 is a subset of the set s2.

    val for_all : (elt -> bool) -> t -> bool

    for_all f s checks if all elements of the set satisfy the predicate f.

    val exists : (elt -> bool) -> t -> bool

    exists f s checks if at least one element of the set satisfies the predicate f.

    Converting

    val to_list : t -> elt list

    to_list s is elements s.

    • since 5.1
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t

    to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

    • since 4.07
    val to_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in ascending order

    • since 4.07
    val to_rev_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in descending order

    • since 4.12
    val add_seq : elt Stdlib.Seq.t -> t -> t

    Add the given elements to the set, in order.

    • since 4.07
    val of_seq : elt Stdlib.Seq.t -> t

    Build a set from the given bindings

    • since 4.07
    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    val to_string : t -> string
    val of_list : elt list -> t
    val map : (elt -> elt) -> t -> t
    diff --git a/ocaml/Var_within_closure/T/index.html b/ocaml/Var_within_closure/T/index.html new file mode 100644 index 0000000..b8edebf --- /dev/null +++ b/ocaml/Var_within_closure/T/index.html @@ -0,0 +1,2 @@ + +T (ocaml.Var_within_closure.T)

    Module Var_within_closure.T

    type t = t
    include Hashtbl.HashedType with type t := t
    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val hash : t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := t
    val compare : t -> t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    diff --git a/ocaml/Var_within_closure/Tbl/index.html b/ocaml/Var_within_closure/Tbl/index.html new file mode 100644 index 0000000..313a6c5 --- /dev/null +++ b/ocaml/Var_within_closure/Tbl/index.html @@ -0,0 +1,2 @@ + +Tbl (ocaml.Var_within_closure.Tbl)

    Module Var_within_closure.Tbl

    include Hashtbl.S with type key = T.t and type 'a t = 'a Hashtbl.Make(T).t
    type key = T.t
    val create : int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    • since 4.00
    val copy : 'a t -> 'a t
    val add : 'a t -> key -> 'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    • since 4.05
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key -> 'a -> unit
    val mem : 'a t -> key -> bool
    val iter : (key -> 'a -> unit) -> 'a t -> unit
    val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
    • since 4.03
    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc
    val length : 'a t -> int
    val stats : 'a t -> Stdlib.Hashtbl.statistics
    • since 4.00
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
    • since 4.07
    val to_seq_keys : _ t -> key Stdlib.Seq.t
    • since 4.07
    val to_seq_values : 'a t -> 'a Stdlib.Seq.t
    • since 4.07
    val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
    • since 4.07
    val to_list : 'a t -> (T.t * 'a) list
    val of_list : (T.t * 'a) list -> 'a t
    val to_map : 'a t -> 'a Stdlib.Map.Make(T).t
    val of_map : 'a Stdlib.Map.Make(T).t -> 'a t
    val memoize : 'a t -> (key -> 'a) -> key -> 'a
    val map : 'a t -> ('a -> 'b) -> 'b t
    diff --git a/ocaml/Var_within_closure/index.html b/ocaml/Var_within_closure/index.html new file mode 100644 index 0000000..fa8cb7f --- /dev/null +++ b/ocaml/Var_within_closure/index.html @@ -0,0 +1,2 @@ + +Var_within_closure (ocaml.Var_within_closure)

    Module Var_within_closure

    An identifier, unique across the whole program, that identifies a particular variable within a particular closure. Only Project_var, and not Var, nodes are tagged with these identifiers.

    include module type of Closure_element
    include Identifiable.S
    type t
    module T : Identifiable.Thing with type t = t
    include Identifiable.Thing with type t := T.t
    include Hashtbl.HashedType with type t := T.t
    val equal : T.t -> T.t -> bool

    The equality predicate used to compare keys.

    val hash : T.t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := T.t
    val compare : T.t -> T.t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> T.t -> unit
    val print : Stdlib.Format.formatter -> T.t -> unit
    module Set : Identifiable.Set with module T := T
    module Map : Identifiable.Map with module T := T
    module Tbl : Identifiable.Tbl with module T := T
    val wrap : Variable.t -> t
    val unwrap : t -> Variable.t
    val wrap_map : 'a Variable.Map.t -> 'a Map.t
    val unwrap_set : Set.t -> Variable.Set.t
    val in_compilation_unit : t -> Compilation_unit.t -> bool
    val get_compilation_unit : t -> Compilation_unit.t
    val unique_name : t -> string
    val output_full : out_channel -> t -> unit
    diff --git a/ocaml/Variable/Map/index.html b/ocaml/Variable/Map/index.html new file mode 100644 index 0000000..7e1bb81 --- /dev/null +++ b/ocaml/Variable/Map/index.html @@ -0,0 +1,17 @@ + +Map (ocaml.Variable.Map)

    Module Variable.Map

    include Map.S with type key = T.t and type 'a t = 'a Map.Make(T).t

    Maps

    type key = T.t

    The type of the map keys.

    type 'a t = 'a Stdlib.Map.Make(T).t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key -> 'a -> 'a t -> 'a t

    add key data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key -> 'a -> 'a list t -> 'a list t

    add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

    update key f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : (key -> bool) -> 'a t -> key * 'a

    find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : (key -> bool) -> 'a t -> key * 'a

    find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : (key -> 'a -> unit) -> 'a t -> unit

    iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

    fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : (key -> 'a -> bool) -> 'a t -> 'a t

    filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : (key -> 'a -> bool) -> 'a t -> bool

    for_all f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : (key -> 'a -> bool) -> 'a t -> bool

    exists f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Stdlib.Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Stdlib.Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    val of_list : (key * 'a) list -> 'a t
    val disjoint_union : + ?eq:('a -> 'a -> bool) -> + ?print:(Stdlib.Format.formatter -> 'a -> unit) -> + 'a t -> + 'a t -> + 'a t

    disjoint_union m1 m2 contains all bindings from m1 and m2. If some binding is present in both and the associated value is not equal, a Fatal_error is raised

    val union_right : 'a t -> 'a t -> 'a t

    union_right m1 m2 contains all bindings from m1 and m2. If some binding is present in both, the one from m2 is taken

    val union_left : 'a t -> 'a t -> 'a t

    union_left m1 m2 = union_right m2 m1

    val union_merge : ('a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
    val rename : key t -> key -> key
    val map_keys : (key -> key) -> 'a t -> 'a t
    val keys : 'a t -> Stdlib.Set.Make(T).t
    val data : 'a t -> 'a list
    val of_set : (key -> 'a) -> Stdlib.Set.Make(T).t -> 'a t
    val transpose_keys_and_data : key t -> key t
    val transpose_keys_and_data_set : key t -> Stdlib.Set.Make(T).t t
    val print : + (Stdlib.Format.formatter -> 'a -> unit) -> + Stdlib.Format.formatter -> + 'a t -> + unit
    diff --git a/ocaml/Variable/Pair/Map/index.html b/ocaml/Variable/Pair/Map/index.html new file mode 100644 index 0000000..fa13d7e --- /dev/null +++ b/ocaml/Variable/Pair/Map/index.html @@ -0,0 +1,17 @@ + +Map (ocaml.Variable.Pair.Map)

    Module Pair.Map

    include Map.S with type key = T.t and type 'a t = 'a Map.Make(T).t

    Maps

    type key = T.t

    The type of the map keys.

    type 'a t = 'a Stdlib.Map.Make(T).t

    The type of maps from type key to type 'a.

    val empty : 'a t

    The empty map.

    val add : key -> 'a -> 'a t -> 'a t

    add key data m returns a map containing the same bindings as m, plus a binding of key to data. If key was already bound in m to a value that is physically equal to data, m is returned unchanged (the result of the function is then physically equal to m). Otherwise, the previous binding of key in m disappears.

    • before 4.03

      Physical equality was not ensured.

    val add_to_list : key -> 'a -> 'a list t -> 'a list t

    add_to_list key data m is m with key mapped to l such that l is data :: Map.find key m if key was bound in m and [v] otherwise.

    • since 5.1
    val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

    update key f m returns a map containing the same bindings as m, except for the binding of key. Depending on the value of y where y is f (find_opt key m), the binding of key is added, removed or updated. If y is None, the binding is removed if it exists; otherwise, if y is Some z then key is associated to z in the resulting map. If key was already bound in m to a value that is physically equal to z, m is returned unchanged (the result of the function is then physically equal to m).

    • since 4.06
    val singleton : key -> 'a -> 'a t

    singleton x y returns the one-element map that contains a binding y for x.

    • since 3.12
    val remove : key -> 'a t -> 'a t

    remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map. If x was not in m, m is returned unchanged (the result of the function is then physically equal to m).

    • before 4.03

      Physical equality was not ensured.

    val merge : + (key -> 'a option -> 'b option -> 'c option) -> + 'a t -> + 'b t -> + 'c t

    merge f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. The presence of each such binding, and the corresponding value, is determined with the function f. In terms of the find_opt operation, we have find_opt x (merge f m1 m2) = f x (find_opt x m1) (find_opt x m2) for any key x, provided that f x None None = None.

    • since 3.12
    val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

    union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2. When the same binding is defined in both arguments, the function f is used to combine them. This is a special case of merge: union f m1 m2 is equivalent to merge f' m1 m2, where

    • f' _key None None = None
    • f' _key (Some v) None = Some v
    • f' _key None (Some v) = Some v
    • f' key (Some v1) (Some v2) = f key v1 v2
    • since 4.03
    val cardinal : 'a t -> int

    Return the number of bindings of a map.

    • since 3.12

    Bindings

    val bindings : 'a t -> (key * 'a) list

    Return the list of all bindings of the given map. The returned list is sorted in increasing order of keys with respect to the ordering Ord.compare, where Ord is the argument given to Map.Make.

    • since 3.12
    val min_binding : 'a t -> key * 'a

    Return the binding with the smallest key in a given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

    • since 3.12
    val min_binding_opt : 'a t -> (key * 'a) option

    Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

    • since 4.05
    val max_binding : 'a t -> key * 'a

    Same as min_binding, but returns the binding with the largest key in the given map.

    • since 3.12
    val max_binding_opt : 'a t -> (key * 'a) option

    Same as min_binding_opt, but returns the binding with the largest key in the given map.

    • since 4.05
    val choose : 'a t -> key * 'a

    Return one binding of the given map, or raise Not_found if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 3.12
    val choose_opt : 'a t -> (key * 'a) option

    Return one binding of the given map, or None if the map is empty. Which binding is chosen is unspecified, but equal bindings will be chosen for equal maps.

    • since 4.05

    Searching

    val find : key -> 'a t -> 'a

    find x m returns the current value of x in m, or raises Not_found if no binding for x exists.

    val find_opt : key -> 'a t -> 'a option

    find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

    • since 4.05
    val find_first : (key -> bool) -> 'a t -> key * 'a

    find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

    For example, find_first (fun k -> Ord.compare k x >= 0) m will return the first binding k, v of m where Ord.compare k x >= 0 (intuitively: k >= x), or raise Not_found if x is greater than any element of m.

    • since 4.05
    val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

    • since 4.05
    val find_last : (key -> bool) -> 'a t -> key * 'a

    find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

    • since 4.05
    val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

    find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

    • since 4.05

    Traversing

    val iter : (key -> 'a -> unit) -> 'a t -> unit

    iter f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc

    fold f m init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

    Transforming

    val map : ('a -> 'b) -> 'a t -> 'b t

    map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.

    val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

    Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

    val filter : (key -> 'a -> bool) -> 'a t -> 'a t

    filter f m returns the map with all the bindings in m that satisfy predicate p. If every binding in m satisfies f, m is returned unchanged (the result of the function is then physically equal to m)

    • since 3.12
    • before 4.03

      Physical equality was not ensured.

    val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t

    filter_map f m applies the function f to every binding of m, and builds a map from the results. For each binding (k, v) in the input map:

    • if f k v is None then k is not in the result,
    • if f k v is Some v' then the binding (k, v') is in the output map.

    For example, the following function on maps whose values are lists

    filter_map
+  (fun _k li -> match li with [] -> None | _::tl -> Some tl)
+  m

    drops all bindings of m whose value is an empty list, and pops the first element of each value that is non-empty.

    • since 4.11
    val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

    partition f m returns a pair of maps (m1, m2), where m1 contains all the bindings of m that satisfy the predicate f, and m2 is the map with all the bindings of m that do not satisfy f.

    • since 3.12
    val split : key -> 'a t -> 'a t * 'a option * 'a t

    split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

    • since 3.12

    Predicates and comparisons

    val is_empty : 'a t -> bool

    Test whether a map is empty or not.

    val mem : key -> 'a t -> bool

    mem x m returns true if m contains a binding for x, and false otherwise.

    val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

    equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data. cmp is the equality predicate used to compare the data associated with the keys.

    val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

    Total ordering between maps. The first argument is a total ordering used to compare data associated with equal keys in the two maps.

    val for_all : (key -> 'a -> bool) -> 'a t -> bool

    for_all f m checks if all the bindings of the map satisfy the predicate f.

    • since 3.12
    val exists : (key -> 'a -> bool) -> 'a t -> bool

    exists f m checks if at least one binding of the map satisfies the predicate f.

    • since 3.12

    Converting

    val to_list : 'a t -> (key * 'a) list

    to_list m is bindings m.

    • since 5.1
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in ascending order of keys

    • since 4.07
    val to_rev_seq : 'a t -> (key * 'a) Stdlib.Seq.t

    Iterate on the whole map, in descending order of keys

    • since 4.12
    val to_seq_from : key -> 'a t -> (key * 'a) Stdlib.Seq.t

    to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

    • since 4.07
    val add_seq : (key * 'a) Stdlib.Seq.t -> 'a t -> 'a t

    Add the given bindings to the map, in order.

    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t

    Build a map from the given bindings

    • since 4.07
    val of_list : (key * 'a) list -> 'a t
    val disjoint_union : + ?eq:('a -> 'a -> bool) -> + ?print:(Stdlib.Format.formatter -> 'a -> unit) -> + 'a t -> + 'a t -> + 'a t

    disjoint_union m1 m2 contains all bindings from m1 and m2. If some binding is present in both and the associated value is not equal, a Fatal_error is raised

    val union_right : 'a t -> 'a t -> 'a t

    union_right m1 m2 contains all bindings from m1 and m2. If some binding is present in both, the one from m2 is taken

    val union_left : 'a t -> 'a t -> 'a t

    union_left m1 m2 = union_right m2 m1

    val union_merge : ('a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
    val rename : key t -> key -> key
    val map_keys : (key -> key) -> 'a t -> 'a t
    val keys : 'a t -> Stdlib.Set.Make(T).t
    val data : 'a t -> 'a list
    val of_set : (key -> 'a) -> Stdlib.Set.Make(T).t -> 'a t
    val transpose_keys_and_data : key t -> key t
    val transpose_keys_and_data_set : key t -> Stdlib.Set.Make(T).t t
    val print : + (Stdlib.Format.formatter -> 'a -> unit) -> + Stdlib.Format.formatter -> + 'a t -> + unit
    diff --git a/ocaml/Variable/Pair/Set/index.html b/ocaml/Variable/Pair/Set/index.html new file mode 100644 index 0000000..3c573fc --- /dev/null +++ b/ocaml/Variable/Pair/Set/index.html @@ -0,0 +1,2 @@ + +Set (ocaml.Variable.Pair.Set)

    Module Pair.Set

    include Set.S with type elt = T.t and type t = Set.Make(T).t

    Sets

    type elt = T.t

    The type of the set elements.

    The type of sets.

    val empty : t

    The empty set.

    val add : elt -> t -> t

    add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val singleton : elt -> t

    singleton x returns the one-element set containing only x.

    val remove : elt -> t -> t

    remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val union : t -> t -> t

    Set union.

    val inter : t -> t -> t

    Set intersection.

    val disjoint : t -> t -> bool

    Test if two sets are disjoint.

    • since 4.08
    val diff : t -> t -> t

    Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

    val cardinal : t -> int

    Return the number of elements of a set.

    Elements

    val elements : t -> elt list

    Return the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Set.Make.

    val min_elt : t -> elt

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

    val min_elt_opt : t -> elt option

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

    • since 4.05
    val max_elt : t -> elt

    Same as min_elt, but returns the largest element of the given set.

    val max_elt_opt : t -> elt option

    Same as min_elt_opt, but returns the largest element of the given set.

    • since 4.05
    val choose : t -> elt

    Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    val choose_opt : t -> elt option

    Return one element of the given set, or None if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    • since 4.05

    Searching

    val find : elt -> t -> elt

    find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

    • since 4.01
    val find_opt : elt -> t -> elt option

    find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

    • since 4.05
    val find_first : (elt -> bool) -> t -> elt

    find_first f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

    For example, find_first (fun e -> Ord.compare e x >= 0) s will return the first element e of s where Ord.compare e x >= 0 (intuitively: e >= x), or raise Not_found if x is greater than any element of s.

    • since 4.05
    val find_first_opt : (elt -> bool) -> t -> elt option

    find_first_opt f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

    • since 4.05
    val find_last : (elt -> bool) -> t -> elt

    find_last f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

    • since 4.05
    val find_last_opt : (elt -> bool) -> t -> elt option

    find_last_opt f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

    • since 4.05

    Traversing

    val iter : (elt -> unit) -> t -> unit

    iter f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.

    val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc

    fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

    Transforming

    val filter : (elt -> bool) -> t -> t

    filter f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val filter_map : (elt -> elt option) -> t -> t

    filter_map f s returns the set of all v such that f x = Some v for some element x of s.

    For example,

    filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) s

    is the set of halves of the even elements of s.

    If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned unchanged: the result of the function is then physically equal to s.

    • since 4.11
    val partition : (elt -> bool) -> t -> t * t

    partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

    val split : elt -> t -> t * bool * t

    split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.

    Predicates and comparisons

    val is_empty : t -> bool

    Test whether a set is empty or not.

    val mem : elt -> t -> bool

    mem x s tests whether x belongs to the set s.

    val equal : t -> t -> bool

    equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

    val compare : t -> t -> int

    Total ordering between sets. Can be used as the ordering function for doing sets of sets.

    val subset : t -> t -> bool

    subset s1 s2 tests whether the set s1 is a subset of the set s2.

    val for_all : (elt -> bool) -> t -> bool

    for_all f s checks if all elements of the set satisfy the predicate f.

    val exists : (elt -> bool) -> t -> bool

    exists f s checks if at least one element of the set satisfies the predicate f.

    Converting

    val to_list : t -> elt list

    to_list s is elements s.

    • since 5.1
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t

    to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

    • since 4.07
    val to_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in ascending order

    • since 4.07
    val to_rev_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in descending order

    • since 4.12
    val add_seq : elt Stdlib.Seq.t -> t -> t

    Add the given elements to the set, in order.

    • since 4.07
    val of_seq : elt Stdlib.Seq.t -> t

    Build a set from the given bindings

    • since 4.07
    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    val to_string : t -> string
    val of_list : elt list -> t
    val map : (elt -> elt) -> t -> t
    diff --git a/ocaml/Variable/Pair/T/index.html b/ocaml/Variable/Pair/T/index.html new file mode 100644 index 0000000..f748857 --- /dev/null +++ b/ocaml/Variable/Pair/T/index.html @@ -0,0 +1,2 @@ + +T (ocaml.Variable.Pair.T)

    Module Pair.T

    type t = pair
    include Hashtbl.HashedType with type t := t
    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val hash : t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := t
    val compare : t -> t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    diff --git a/ocaml/Variable/Pair/Tbl/index.html b/ocaml/Variable/Pair/Tbl/index.html new file mode 100644 index 0000000..eec7659 --- /dev/null +++ b/ocaml/Variable/Pair/Tbl/index.html @@ -0,0 +1,2 @@ + +Tbl (ocaml.Variable.Pair.Tbl)

    Module Pair.Tbl

    include Hashtbl.S with type key = T.t and type 'a t = 'a Hashtbl.Make(T).t
    type key = T.t
    val create : int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    • since 4.00
    val copy : 'a t -> 'a t
    val add : 'a t -> key -> 'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    • since 4.05
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key -> 'a -> unit
    val mem : 'a t -> key -> bool
    val iter : (key -> 'a -> unit) -> 'a t -> unit
    val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
    • since 4.03
    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc
    val length : 'a t -> int
    val stats : 'a t -> Stdlib.Hashtbl.statistics
    • since 4.00
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
    • since 4.07
    val to_seq_keys : _ t -> key Stdlib.Seq.t
    • since 4.07
    val to_seq_values : 'a t -> 'a Stdlib.Seq.t
    • since 4.07
    val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
    • since 4.07
    val to_list : 'a t -> (T.t * 'a) list
    val of_list : (T.t * 'a) list -> 'a t
    val to_map : 'a t -> 'a Stdlib.Map.Make(T).t
    val of_map : 'a Stdlib.Map.Make(T).t -> 'a t
    val memoize : 'a t -> (key -> 'a) -> key -> 'a
    val map : 'a t -> ('a -> 'b) -> 'b t
    diff --git a/ocaml/Variable/Pair/index.html b/ocaml/Variable/Pair/index.html new file mode 100644 index 0000000..6741aa3 --- /dev/null +++ b/ocaml/Variable/Pair/index.html @@ -0,0 +1,2 @@ + +Pair (ocaml.Variable.Pair)

    Module Variable.Pair

    module T : Identifiable.Thing with type t = pair
    include Identifiable.Thing with type t := T.t
    include Hashtbl.HashedType with type t := T.t
    val equal : T.t -> T.t -> bool

    The equality predicate used to compare keys.

    val hash : T.t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := T.t
    val compare : T.t -> T.t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> T.t -> unit
    val print : Stdlib.Format.formatter -> T.t -> unit
    module Set : Identifiable.Set with module T := T
    module Map : Identifiable.Map with module T := T
    module Tbl : Identifiable.Tbl with module T := T
    diff --git a/ocaml/Variable/Set/index.html b/ocaml/Variable/Set/index.html new file mode 100644 index 0000000..5cdfd22 --- /dev/null +++ b/ocaml/Variable/Set/index.html @@ -0,0 +1,2 @@ + +Set (ocaml.Variable.Set)

    Module Variable.Set

    include Set.S with type elt = T.t and type t = Set.Make(T).t

    Sets

    type elt = T.t

    The type of the set elements.

    The type of sets.

    val empty : t

    The empty set.

    val add : elt -> t -> t

    add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val singleton : elt -> t

    singleton x returns the one-element set containing only x.

    val remove : elt -> t -> t

    remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val union : t -> t -> t

    Set union.

    val inter : t -> t -> t

    Set intersection.

    val disjoint : t -> t -> bool

    Test if two sets are disjoint.

    • since 4.08
    val diff : t -> t -> t

    Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

    val cardinal : t -> int

    Return the number of elements of a set.

    Elements

    val elements : t -> elt list

    Return the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Set.Make.

    val min_elt : t -> elt

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

    val min_elt_opt : t -> elt option

    Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

    • since 4.05
    val max_elt : t -> elt

    Same as min_elt, but returns the largest element of the given set.

    val max_elt_opt : t -> elt option

    Same as min_elt_opt, but returns the largest element of the given set.

    • since 4.05
    val choose : t -> elt

    Return one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    val choose_opt : t -> elt option

    Return one element of the given set, or None if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.

    • since 4.05

    Searching

    val find : elt -> t -> elt

    find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

    • since 4.01
    val find_opt : elt -> t -> elt option

    find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

    • since 4.05
    val find_first : (elt -> bool) -> t -> elt

    find_first f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

    For example, find_first (fun e -> Ord.compare e x >= 0) s will return the first element e of s where Ord.compare e x >= 0 (intuitively: e >= x), or raise Not_found if x is greater than any element of s.

    • since 4.05
    val find_first_opt : (elt -> bool) -> t -> elt option

    find_first_opt f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

    • since 4.05
    val find_last : (elt -> bool) -> t -> elt

    find_last f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

    • since 4.05
    val find_last_opt : (elt -> bool) -> t -> elt option

    find_last_opt f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

    • since 4.05

    Traversing

    val iter : (elt -> unit) -> t -> unit

    iter f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.

    val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc

    fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

    Transforming

    val filter : (elt -> bool) -> t -> t

    filter f s returns the set of all elements in s that satisfy predicate f. If f satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).

    • before 4.03

      Physical equality was not ensured.

    val filter_map : (elt -> elt option) -> t -> t

    filter_map f s returns the set of all v such that f x = Some v for some element x of s.

    For example,

    filter_map (fun n -> if n mod 2 = 0 then Some (n / 2) else None) s

    is the set of halves of the even elements of s.

    If no element of s is changed or dropped by f (if f x = Some x for each element x), then s is returned unchanged: the result of the function is then physically equal to s.

    • since 4.11
    val partition : (elt -> bool) -> t -> t * t

    partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

    val split : elt -> t -> t * bool * t

    split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.

    Predicates and comparisons

    val is_empty : t -> bool

    Test whether a set is empty or not.

    val mem : elt -> t -> bool

    mem x s tests whether x belongs to the set s.

    val equal : t -> t -> bool

    equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

    val compare : t -> t -> int

    Total ordering between sets. Can be used as the ordering function for doing sets of sets.

    val subset : t -> t -> bool

    subset s1 s2 tests whether the set s1 is a subset of the set s2.

    val for_all : (elt -> bool) -> t -> bool

    for_all f s checks if all elements of the set satisfy the predicate f.

    val exists : (elt -> bool) -> t -> bool

    exists f s checks if at least one element of the set satisfies the predicate f.

    Converting

    val to_list : t -> elt list

    to_list s is elements s.

    • since 5.1
    val to_seq_from : elt -> t -> elt Stdlib.Seq.t

    to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

    • since 4.07
    val to_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in ascending order

    • since 4.07
    val to_rev_seq : t -> elt Stdlib.Seq.t

    Iterate on the whole set, in descending order

    • since 4.12
    val add_seq : elt Stdlib.Seq.t -> t -> t

    Add the given elements to the set, in order.

    • since 4.07
    val of_seq : elt Stdlib.Seq.t -> t

    Build a set from the given bindings

    • since 4.07
    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    val to_string : t -> string
    val of_list : elt list -> t
    val map : (elt -> elt) -> t -> t
    diff --git a/ocaml/Variable/T/index.html b/ocaml/Variable/T/index.html new file mode 100644 index 0000000..199568e --- /dev/null +++ b/ocaml/Variable/T/index.html @@ -0,0 +1,2 @@ + +T (ocaml.Variable.T)

    Module Variable.T

    type t = t
    include Hashtbl.HashedType with type t := t
    val equal : t -> t -> bool

    The equality predicate used to compare keys.

    val hash : t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := t
    val compare : t -> t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> t -> unit
    val print : Stdlib.Format.formatter -> t -> unit
    diff --git a/ocaml/Variable/Tbl/index.html b/ocaml/Variable/Tbl/index.html new file mode 100644 index 0000000..b11db02 --- /dev/null +++ b/ocaml/Variable/Tbl/index.html @@ -0,0 +1,2 @@ + +Tbl (ocaml.Variable.Tbl)

    Module Variable.Tbl

    include Hashtbl.S with type key = T.t and type 'a t = 'a Hashtbl.Make(T).t
    type key = T.t
    val create : int -> 'a t
    val clear : 'a t -> unit
    val reset : 'a t -> unit
    • since 4.00
    val copy : 'a t -> 'a t
    val add : 'a t -> key -> 'a -> unit
    val remove : 'a t -> key -> unit
    val find : 'a t -> key -> 'a
    val find_opt : 'a t -> key -> 'a option
    • since 4.05
    val find_all : 'a t -> key -> 'a list
    val replace : 'a t -> key -> 'a -> unit
    val mem : 'a t -> key -> bool
    val iter : (key -> 'a -> unit) -> 'a t -> unit
    val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
    • since 4.03
    val fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc
    val length : 'a t -> int
    val stats : 'a t -> Stdlib.Hashtbl.statistics
    • since 4.00
    val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t
    • since 4.07
    val to_seq_keys : _ t -> key Stdlib.Seq.t
    • since 4.07
    val to_seq_values : 'a t -> 'a Stdlib.Seq.t
    • since 4.07
    val add_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val replace_seq : 'a t -> (key * 'a) Stdlib.Seq.t -> unit
    • since 4.07
    val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t
    • since 4.07
    val to_list : 'a t -> (T.t * 'a) list
    val of_list : (T.t * 'a) list -> 'a t
    val to_map : 'a t -> 'a Stdlib.Map.Make(T).t
    val of_map : 'a Stdlib.Map.Make(T).t -> 'a t
    val memoize : 'a t -> (key -> 'a) -> key -> 'a
    val map : 'a t -> ('a -> 'b) -> 'b t
    diff --git a/ocaml/Variable/index.html b/ocaml/Variable/index.html new file mode 100644 index 0000000..2111e68 --- /dev/null +++ b/ocaml/Variable/index.html @@ -0,0 +1,5 @@ + +Variable (ocaml.Variable)

    Module Variable

    Variable.t is the equivalent of a non-persistent Ident.t in the Flambda tree. It wraps an Ident.t together with its source compilation_unit. As such, it is unique within a whole program, not just one compilation unit.

    Introducing a new type helps in tracing the source of identifiers when debugging the inliner. It also avoids Ident renaming when importing cmx files.

    include Identifiable.S
    type t
    module T : Identifiable.Thing with type t = t
    include Identifiable.Thing with type t := T.t
    include Hashtbl.HashedType with type t := T.t
    val equal : T.t -> T.t -> bool

    The equality predicate used to compare keys.

    val hash : T.t -> int

    A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

    • ((=), hash) for comparing objects by structure (provided objects do not contain floats)
    • ((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
    • ((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
    include Map.OrderedType with type t := T.t
    val compare : T.t -> T.t -> int

    A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.

    val output : out_channel -> T.t -> unit
    val print : Stdlib.Format.formatter -> T.t -> unit
    module Set : Identifiable.Set with module T := T
    module Map : Identifiable.Map with module T := T
    module Tbl : Identifiable.Tbl with module T := T
    val create : + ?current_compilation_unit:Compilation_unit.t -> + Internal_variable_names.t -> + t
    val create_with_same_name_as_ident : Ident.t -> t
    val rename : ?current_compilation_unit:Compilation_unit.t -> t -> t
    val in_compilation_unit : t -> Compilation_unit.t -> bool
    val name : t -> string
    val unique_name : t -> string
    val get_compilation_unit : t -> Compilation_unit.t
    val print_list : Stdlib.Format.formatter -> t list -> unit
    val print_opt : Stdlib.Format.formatter -> t option -> unit
    val debug_when_stamp_matches : t -> stamp:int -> f:(unit -> unit) -> unit

    If the given variable has the given stamp, call the user-supplied function. For debugging purposes only.

    type pair = t * t
    module Pair : Identifiable.S with type t := pair
    val compare_lists : t list -> t list -> int
    val output_full : out_channel -> t -> unit

    Unlike output, output_full includes the compilation unit.

    diff --git a/ocaml/Warnings/index.html b/ocaml/Warnings/index.html new file mode 100644 index 0000000..e19b351 --- /dev/null +++ b/ocaml/Warnings/index.html @@ -0,0 +1,2 @@ + +Warnings (ocaml.Warnings)

    Module Warnings

    Warning definitions

    Warning: this module is unstable and part of compiler-libs.

    type loc = {
    1. loc_start : Stdlib.Lexing.position;
    2. loc_end : Stdlib.Lexing.position;
    3. loc_ghost : bool;
    }
    val ghost_loc_in_file : string -> loc

    Return an empty ghost range located in a given file

    type field_usage_warning =
    1. | Unused
    2. | Not_read
    3. | Not_mutated
    type constructor_usage_warning =
    1. | Unused
    2. | Not_constructed
    3. | Only_exported_private
    type t =
    1. | Comment_start
    2. | Comment_not_end
    3. | Fragile_match of string
    4. | Ignored_partial_application
    5. | Labels_omitted of string list
    6. | Method_override of string list
    7. | Partial_match of string
    8. | Missing_record_field_pattern of string
    9. | Non_unit_statement
    10. | Redundant_case
    11. | Redundant_subpat
    12. | Instance_variable_override of string list
    13. | Illegal_backslash
    14. | Implicit_public_methods of string list
    15. | Unerasable_optional_argument
    16. | Undeclared_virtual_method of string
    17. | Not_principal of string
    18. | Non_principal_labels of string
    19. | Ignored_extra_argument
    20. | Nonreturning_statement
    21. | Preprocessor of string
    22. | Useless_record_with
    23. | Bad_module_name of string
    24. | All_clauses_guarded
    25. | Unused_var of string
    26. | Unused_var_strict of string
    27. | Wildcard_arg_to_constant_constr
    28. | Eol_in_string
    29. | Duplicate_definitions of string * string * string * string
    30. | Unused_value_declaration of string
    31. | Unused_open of string
    32. | Unused_type_declaration of string
    33. | Unused_for_index of string
    34. | Unused_ancestor of string
    35. | Unused_constructor of string * constructor_usage_warning
    36. | Unused_extension of string * bool * constructor_usage_warning
    37. | Unused_rec_flag
    38. | Name_out_of_scope of string * string list * bool
    39. | Ambiguous_name of string list * string list * bool * string
    40. | Disambiguated_name of string
    41. | Nonoptional_label of string
    42. | Open_shadow_identifier of string * string
    43. | Open_shadow_label_constructor of string * string
    44. | Bad_env_variable of string * string
    45. | Attribute_payload of string * string
    46. | Eliminated_optional_arguments of string list
    47. | No_cmi_file of string * string option
    48. | Unexpected_docstring of bool
    49. | Wrong_tailcall_expectation of bool
    50. | Fragile_literal_pattern
    51. | Misplaced_attribute of string
    52. | Duplicated_attribute of string
    53. | Inlining_impossible of string
    54. | Unreachable_case
    55. | Ambiguous_var_in_pattern_guard of string list
    56. | No_cmx_file of string
    57. | Flambda_assignment_to_non_mutable_value
    58. | Unused_module of string
    59. | Unboxable_type_in_prim_decl of string
    60. | Constraint_on_gadt
    61. | Erroneous_printed_signature of string
    62. | Unsafe_array_syntax_without_parsing
    63. | Redefining_unit of string
    64. | Unused_open_bang of string
    65. | Unused_functor_parameter of string
    66. | Match_on_mutable_state_prevent_uncurry
    67. | Unused_field of string * field_usage_warning
    68. | Missing_mli
    69. | Unused_tmc_attribute
    70. | Tmc_breaks_tailcall
    71. | Generative_application_expects_unit
    type alert = {
    1. kind : string;
    2. message : string;
    3. def : loc;
    4. use : loc;
    }
    val parse_options : bool -> string -> alert option
    val parse_alert_option : string -> unit

    Disable/enable alerts based on the parameter to the -alert command-line option. Raises Arg.Bad if the string is not a valid specification.

    val without_warnings : (unit -> 'a) -> 'a

    Run the thunk with all warnings and alerts disabled.

    val is_active : t -> bool
    val is_error : t -> bool
    val defaults_w : string
    val defaults_warn_error : string
    type reporting_information = {
    1. id : string;
    2. message : string;
    3. is_error : bool;
    4. sub_locs : (loc * string) list;
    }
    val report : t -> [ `Active of reporting_information | `Inactive ]
    val report_alert : alert -> [ `Active of reporting_information | `Inactive ]
    exception Errors
    val check_fatal : unit -> unit
    val reset_fatal : unit -> unit
    val help_warnings : unit -> unit
    type state
    val backup : unit -> state
    val restore : state -> unit
    val with_state : state -> (unit -> 'a) -> 'a
    val mk_lazy : (unit -> 'a) -> 'a Stdlib.Lazy.t

    Like Lazy.of_fun, but the function is applied with the warning/alert settings at the time mk_lazy is called.

    type description = {
    1. number : int;
    2. names : string list;
    3. description : string;
    4. since : Stdlib.Sys.ocaml_release_info option;
    }
    val descriptions : description list
    diff --git a/ocaml/X86_ast/index.html b/ocaml/X86_ast/index.html new file mode 100644 index 0000000..833a3b4 --- /dev/null +++ b/ocaml/X86_ast/index.html @@ -0,0 +1,2 @@ + +X86_ast (ocaml.X86_ast)

    Module X86_ast

    Structured representation of Intel assembly language (32 and 64 bit).

    type condition =
    1. | L
    2. | GE
    3. | LE
    4. | G
    5. | B
    6. | AE
    7. | BE
    8. | A
    9. | E
    10. | NE
    11. | O
    12. | NO
    13. | S
    14. | NS
    15. | P
    16. | NP
    type float_condition =
    1. | EQf
    2. | LTf
    3. | LEf
    4. | UNORDf
    5. | NEQf
    6. | NLTf
    7. | NLEf
    8. | ORDf
    type rounding =
    1. | RoundUp
    2. | RoundDown
    3. | RoundNearest
    4. | RoundTruncate
    type constant =
    1. | Const of int64
    2. | ConstThis
    3. | ConstLabel of string
    4. | ConstAdd of constant * constant
    5. | ConstSub of constant * constant
    type data_type =
    1. | NONE
    2. | REAL4
    3. | REAL8
    4. | BYTE
    5. | WORD
    6. | DWORD
    7. | QWORD
    8. | OWORD
    9. | NEAR
    10. | PROC
    type reg64 =
    1. | RAX
    2. | RBX
    3. | RCX
    4. | RDX
    5. | RSP
    6. | RBP
    7. | RSI
    8. | RDI
    9. | R8
    10. | R9
    11. | R10
    12. | R11
    13. | R12
    14. | R13
    15. | R14
    16. | R15
    type reg8h =
    1. | AH
    2. | BH
    3. | CH
    4. | DH
    type registerf =
    1. | XMM of int
    2. | TOS
    3. | ST of int
    type arch =
    1. | X64
    2. | X86
    type addr = {
    1. arch : arch;
    2. typ : data_type;
    3. idx : reg64;
    4. scale : int;
    5. base : reg64 option;
    6. sym : string option;
    7. displ : int;
    }

    Addressing modes: displ + sym + base + idx * scale (if scale = 0, idx is ignored and base must be None)

    type arg =
    1. | Imm of int64
      (*

      Operand is an immediate constant integer

      *)
    2. | Sym of string
      (*

      Address of a symbol (absolute address except for call/jmp target where it is interpreted as a relative displacement

      *)
    3. | Reg8L of reg64
    4. | Reg8H of reg8h
    5. | Reg16 of reg64
    6. | Reg32 of reg64
    7. | Reg64 of reg64
    8. | Regf of registerf
    9. | Mem of addr
    10. | Mem64_RIP of data_type * string * int
    type instruction =
    1. | ADD of arg * arg
    2. | ADDSD of arg * arg
    3. | AND of arg * arg
    4. | ANDPD of arg * arg
    5. | BSWAP of arg
    6. | CALL of arg
    7. | CDQ
    8. | CMOV of condition * arg * arg
    9. | CMP of arg * arg
    10. | CMPSD of float_condition * arg * arg
    11. | COMISD of arg * arg
    12. | CQO
    13. | CVTSD2SI of arg * arg
    14. | CVTSD2SS of arg * arg
    15. | CVTSI2SD of arg * arg
    16. | CVTSS2SD of arg * arg
    17. | CVTTSD2SI of arg * arg
    18. | DEC of arg
    19. | DIVSD of arg * arg
    20. | FABS
    21. | FADD of arg
    22. | FADDP of arg * arg
    23. | FCHS
    24. | FCOMP of arg
    25. | FCOMPP
    26. | FCOS
    27. | FDIV of arg
    28. | FDIVP of arg * arg
    29. | FDIVR of arg
    30. | FDIVRP of arg * arg
    31. | FILD of arg
    32. | FISTP of arg
    33. | FLD of arg
    34. | FLD1
    35. | FLDCW of arg
    36. | FLDLG2
    37. | FLDLN2
    38. | FLDZ
    39. | FMUL of arg
    40. | FMULP of arg * arg
    41. | FNSTCW of arg
    42. | FNSTSW of arg
    43. | FPATAN
    44. | FPTAN
    45. | FSIN
    46. | FSQRT
    47. | FSTP of arg
    48. | FSUB of arg
    49. | FSUBP of arg * arg
    50. | FSUBR of arg
    51. | FSUBRP of arg * arg
    52. | FXCH of arg
    53. | FYL2X
    54. | HLT
    55. | IDIV of arg
    56. | IMUL of arg * arg option
    57. | INC of arg
    58. | J of condition * arg
    59. | JMP of arg
    60. | LEA of arg * arg
    61. | LEAVE
    62. | MOV of arg * arg
    63. | MOVAPD of arg * arg
    64. | MOVD of arg * arg
    65. | MOVLPD of arg * arg
    66. | MOVSD of arg * arg
    67. | MOVSS of arg * arg
    68. | MOVSX of arg * arg
    69. | MOVSXD of arg * arg
    70. | MOVZX of arg * arg
    71. | MULSD of arg * arg
    72. | NEG of arg
    73. | NOP
    74. | OR of arg * arg
    75. | POP of arg
    76. | PUSH of arg
    77. | RET
    78. | ROUNDSD of rounding * arg * arg
    79. | SAL of arg * arg
    80. | SAR of arg * arg
    81. | SET of condition * arg
    82. | SHR of arg * arg
    83. | SQRTSD of arg * arg
    84. | SUB of arg * arg
    85. | SUBSD of arg * arg
    86. | TEST of arg * arg
    87. | UCOMISD of arg * arg
    88. | XCHG of arg * arg
    89. | XOR of arg * arg
    90. | XORPD of arg * arg
    type asm_line =
    1. | Ins of instruction
    2. | Align of bool * int
    3. | Byte of constant
    4. | Bytes of string
    5. | Comment of string
    6. | Global of string
    7. | Long of constant
    8. | NewLabel of string * data_type
    9. | Quad of constant
    10. | Section of string list * string option * string list
    11. | Space of int
    12. | Word of constant
    13. | External of string * data_type
    14. | Mode386
    15. | Model of string
    16. | Cfi_adjust_cfa_offset of int
    17. | Cfi_endproc
    18. | Cfi_startproc
    19. | Cfi_remember_state
    20. | Cfi_restore_state
    21. | Cfi_def_cfa_register of string
    22. | Cfi_def_cfa_offset of int
    23. | File of int * string
    24. | Indirect_symbol of string
    25. | Loc of int * int * int
    26. | Private_extern of string
    27. | Set of string * constant
    28. | Size of string * constant
    29. | Type of string * string
    type asm_program = asm_line list
    diff --git a/ocaml/X86_dsl/D/index.html b/ocaml/X86_dsl/D/index.html new file mode 100644 index 0000000..b2a4912 --- /dev/null +++ b/ocaml/X86_dsl/D/index.html @@ -0,0 +1,2 @@ + +D (ocaml.X86_dsl.D)

    Module X86_dsl.D

    Directives

    val align : int -> unit
    val byte : X86_ast.constant -> unit
    val bytes : string -> unit
    val cfi_adjust_cfa_offset : int -> unit
    val cfi_endproc : unit -> unit
    val cfi_startproc : unit -> unit
    val cfi_remember_state : unit -> unit
    val cfi_restore_state : unit -> unit
    val cfi_def_cfa_register : string -> unit
    val cfi_def_cfa_offset : int -> unit
    val comment : string -> unit
    val data : unit -> unit
    val extrn : string -> X86_ast.data_type -> unit
    val file : file_num:int -> file_name:string -> unit
    val global : string -> unit
    val indirect_symbol : string -> unit
    val label : ?typ:X86_ast.data_type -> string -> unit
    val loc : file_num:int -> line:int -> col:int -> unit
    val long : X86_ast.constant -> unit
    val mode386 : unit -> unit
    val model : string -> unit
    val private_extern : string -> unit
    val qword : X86_ast.constant -> unit
    val section : string list -> string option -> string list -> unit
    val setvar : (string * X86_ast.constant) -> unit
    val size : string -> X86_ast.constant -> unit
    val space : int -> unit
    val text : unit -> unit
    val type_ : string -> string -> unit
    val word : X86_ast.constant -> unit
    diff --git a/ocaml/X86_dsl/I/index.html b/ocaml/X86_dsl/I/index.html new file mode 100644 index 0000000..7a701f6 --- /dev/null +++ b/ocaml/X86_dsl/I/index.html @@ -0,0 +1,2 @@ + +I (ocaml.X86_dsl.I)

    Module X86_dsl.I

    val add : X86_ast.arg -> X86_ast.arg -> unit
    val addsd : X86_ast.arg -> X86_ast.arg -> unit
    val and_ : X86_ast.arg -> X86_ast.arg -> unit
    val andpd : X86_ast.arg -> X86_ast.arg -> unit
    val bswap : X86_ast.arg -> unit
    val call : X86_ast.arg -> unit
    val cdq : unit -> unit
    val cmp : X86_ast.arg -> X86_ast.arg -> unit
    val comisd : X86_ast.arg -> X86_ast.arg -> unit
    val cqo : unit -> unit
    val cvtsd2ss : X86_ast.arg -> X86_ast.arg -> unit
    val cvtsi2sd : X86_ast.arg -> X86_ast.arg -> unit
    val cvtss2sd : X86_ast.arg -> X86_ast.arg -> unit
    val cvttsd2si : X86_ast.arg -> X86_ast.arg -> unit
    val dec : X86_ast.arg -> unit
    val divsd : X86_ast.arg -> X86_ast.arg -> unit
    val fabs : unit -> unit
    val fadd : X86_ast.arg -> unit
    val faddp : X86_ast.arg -> X86_ast.arg -> unit
    val fchs : unit -> unit
    val fcomp : X86_ast.arg -> unit
    val fcompp : unit -> unit
    val fcos : unit -> unit
    val fdiv : X86_ast.arg -> unit
    val fdivp : X86_ast.arg -> X86_ast.arg -> unit
    val fdivr : X86_ast.arg -> unit
    val fdivrp : X86_ast.arg -> X86_ast.arg -> unit
    val fild : X86_ast.arg -> unit
    val fistp : X86_ast.arg -> unit
    val fld1 : unit -> unit
    val fld : X86_ast.arg -> unit
    val fldcw : X86_ast.arg -> unit
    val fldlg2 : unit -> unit
    val fldln2 : unit -> unit
    val fldz : unit -> unit
    val fmul : X86_ast.arg -> unit
    val fmulp : X86_ast.arg -> X86_ast.arg -> unit
    val fnstcw : X86_ast.arg -> unit
    val fnstsw : X86_ast.arg -> unit
    val fpatan : unit -> unit
    val fptan : unit -> unit
    val fsin : unit -> unit
    val fsqrt : unit -> unit
    val fstp : X86_ast.arg -> unit
    val fsub : X86_ast.arg -> unit
    val fsubp : X86_ast.arg -> X86_ast.arg -> unit
    val fsubr : X86_ast.arg -> unit
    val fsubrp : X86_ast.arg -> X86_ast.arg -> unit
    val fxch : X86_ast.arg -> unit
    val fyl2x : unit -> unit
    val hlt : unit -> unit
    val idiv : X86_ast.arg -> unit
    val imul : X86_ast.arg -> X86_ast.arg option -> unit
    val inc : X86_ast.arg -> unit
    val j : X86_ast.condition -> X86_ast.arg -> unit
    val ja : X86_ast.arg -> unit
    val jae : X86_ast.arg -> unit
    val jb : X86_ast.arg -> unit
    val jbe : X86_ast.arg -> unit
    val je : X86_ast.arg -> unit
    val jg : X86_ast.arg -> unit
    val jmp : X86_ast.arg -> unit
    val jne : X86_ast.arg -> unit
    val jp : X86_ast.arg -> unit
    val lea : X86_ast.arg -> X86_ast.arg -> unit
    val mov : X86_ast.arg -> X86_ast.arg -> unit
    val movapd : X86_ast.arg -> X86_ast.arg -> unit
    val movd : X86_ast.arg -> X86_ast.arg -> unit
    val movsd : X86_ast.arg -> X86_ast.arg -> unit
    val movss : X86_ast.arg -> X86_ast.arg -> unit
    val movsx : X86_ast.arg -> X86_ast.arg -> unit
    val movsxd : X86_ast.arg -> X86_ast.arg -> unit
    val movzx : X86_ast.arg -> X86_ast.arg -> unit
    val mulsd : X86_ast.arg -> X86_ast.arg -> unit
    val neg : X86_ast.arg -> unit
    val nop : unit -> unit
    val or_ : X86_ast.arg -> X86_ast.arg -> unit
    val pop : X86_ast.arg -> unit
    val push : X86_ast.arg -> unit
    val ret : unit -> unit
    val sal : X86_ast.arg -> X86_ast.arg -> unit
    val sar : X86_ast.arg -> X86_ast.arg -> unit
    val set : X86_ast.condition -> X86_ast.arg -> unit
    val shr : X86_ast.arg -> X86_ast.arg -> unit
    val sqrtsd : X86_ast.arg -> X86_ast.arg -> unit
    val sub : X86_ast.arg -> X86_ast.arg -> unit
    val subsd : X86_ast.arg -> X86_ast.arg -> unit
    val test : X86_ast.arg -> X86_ast.arg -> unit
    val ucomisd : X86_ast.arg -> X86_ast.arg -> unit
    val xchg : X86_ast.arg -> X86_ast.arg -> unit
    val xor : X86_ast.arg -> X86_ast.arg -> unit
    val xorpd : X86_ast.arg -> X86_ast.arg -> unit
    diff --git a/ocaml/X86_dsl/index.html b/ocaml/X86_dsl/index.html new file mode 100644 index 0000000..766f776 --- /dev/null +++ b/ocaml/X86_dsl/index.html @@ -0,0 +1,16 @@ + +X86_dsl (ocaml.X86_dsl)

    Module X86_dsl

    Helpers for Intel code generators

    val sym : string -> X86_ast.arg
    val nat : nativeint -> X86_ast.arg
    val int : int -> X86_ast.arg
    val const_32 : int32 -> X86_ast.constant
    val const_nat : nativeint -> X86_ast.constant
    val const : int -> X86_ast.constant
    val al : X86_ast.arg
    val ah : X86_ast.arg
    val cl : X86_ast.arg
    val ax : X86_ast.arg
    val rax : X86_ast.arg
    val rbx : X86_ast.arg
    val rdx : X86_ast.arg
    val r10 : X86_ast.arg
    val r11 : X86_ast.arg
    val r12 : X86_ast.arg
    val r13 : X86_ast.arg
    val r14 : X86_ast.arg
    val r15 : X86_ast.arg
    val rsp : X86_ast.arg
    val rbp : X86_ast.arg
    val xmm15 : X86_ast.arg
    val eax : X86_ast.arg
    val ebx : X86_ast.arg
    val ecx : X86_ast.arg
    val edx : X86_ast.arg
    val ebp : X86_ast.arg
    val esp : X86_ast.arg
    val st0 : X86_ast.arg
    val st1 : X86_ast.arg
    val mem32 : + X86_ast.data_type -> + ?scale:int -> + ?base:X86_ast.reg64 -> + ?sym:string -> + int -> + X86_ast.reg64 -> + X86_ast.arg
    val mem64 : + X86_ast.data_type -> + ?scale:int -> + ?base:X86_ast.reg64 -> + ?sym:string -> + int -> + X86_ast.reg64 -> + X86_ast.arg
    val mem64_rip : X86_ast.data_type -> ?ofs:int -> string -> X86_ast.arg
    module D : sig ... end

    Directives

    module I : sig ... end
    diff --git a/ocaml/X86_gas/index.html b/ocaml/X86_gas/index.html new file mode 100644 index 0000000..9514972 --- /dev/null +++ b/ocaml/X86_gas/index.html @@ -0,0 +1,2 @@ + +X86_gas (ocaml.X86_gas)

    Module X86_gas

    Emit assembly instructions for gas.

    val generate_asm : out_channel -> X86_ast.asm_line list -> unit
    diff --git a/ocaml/X86_masm/index.html b/ocaml/X86_masm/index.html new file mode 100644 index 0000000..0825772 --- /dev/null +++ b/ocaml/X86_masm/index.html @@ -0,0 +1,2 @@ + +X86_masm (ocaml.X86_masm)

    Module X86_masm

    Emit assembly instructions for MASM (Intel syntax).

    val generate_asm : out_channel -> X86_ast.asm_line list -> unit
    diff --git a/ocaml/X86_proc/index.html b/ocaml/X86_proc/index.html new file mode 100644 index 0000000..aeef5f9 --- /dev/null +++ b/ocaml/X86_proc/index.html @@ -0,0 +1,7 @@ + +X86_proc (ocaml.X86_proc)

    Module X86_proc

    Definitions shared between the 32 and 64 bit Intel backends.

    Helpers for textual emitters

    val string_of_reg8l : X86_ast.reg64 -> string
    val string_of_reg8h : X86_ast.reg8h -> string
    val string_of_reg16 : X86_ast.reg64 -> string
    val string_of_reg32 : X86_ast.reg64 -> string
    val string_of_reg64 : X86_ast.reg64 -> string
    val string_of_registerf : X86_ast.registerf -> string
    val string_of_string_literal : string -> string
    val string_of_condition : X86_ast.condition -> string
    val string_of_float_condition : X86_ast.float_condition -> string
    val string_of_symbol : string -> string -> string
    val string_of_rounding : X86_ast.rounding -> string
    val buf_bytes_directive : Stdlib.Buffer.t -> string -> string -> unit

    Buffer of assembly code

    val emit : X86_ast.instruction -> unit
    val directive : X86_ast.asm_line -> unit
    val reset_asm_code : unit -> unit

    Code emission

    val generate_code : (X86_ast.asm_line list -> unit) option -> unit

    Post-process the stream of instructions. Dump it (using the provided syntax emitter) in a file (if provided) and compile it with an internal assembler (if registered through register_internal_assembler).

    val assemble_file : string -> string -> int

    Generate an object file corresponding to the last call to generate_code. An internal assembler is used if available (and the input file is ignored). Otherwise, the source asm file with an external assembler.

    System detection

    type system =
    1. | S_macosx
    2. | S_gnu
    3. | S_cygwin
    4. | S_solaris
    5. | S_beos
    6. | S_win64
    7. | S_linux
    8. | S_mingw64
    9. | S_freebsd
    10. | S_netbsd
    11. | S_openbsd
    12. | S_unknown
    val system : system
    val masm : bool
    val windows : bool
    val use_plt : bool

    Whether calls need to go via the PLT.

    Support for plumbing a binary code emitter

    val register_internal_assembler : + (X86_ast.asm_program -> string -> unit) -> + unit
    val with_internal_assembler : + (X86_ast.asm_program -> string -> unit) -> + (unit -> 'a) -> + 'a
    diff --git a/ocaml/_doc-dir/Changes b/ocaml/_doc-dir/Changes new file mode 100644 index 0000000..5e0282b --- /dev/null +++ b/ocaml/_doc-dir/Changes @@ -0,0 +1,14679 @@ +OCaml 5.2.1 (18 November 2024) +------------------------------ + +- #13207: Be sure to reload the register caching the exception handler in + caml_c_call and caml_c_call_stack_args, as its value may have been changed + if the OCaml stack is expanded during a callback. + (Miod Vallat, report by Vesa Karvonen, review by Gabriel Scherer and + Xavier Leroy) + +- #13252: Rework register assignment in the interpreter code on m68k on Linux, + due to the %a5 register being used by Glibc. + (Miod Vallat, report by Stéphane Glondu, review by Gabriel Scherer and + Xavier Leroy) + +- #13268: Fix a call to test in configure.ac that was causing errors when + LDFLAGS contains several words. + (Stéphane Glondu, review by Miod Vallat) + +- #13234, #13267: Open runtime events file in read-write mode on armel + (armv5) systems due to atomic operations limitations on that + platform. + (Stéphane Glondu, review by Miod Vallat and Vincent Laviron) + +- #13188: fix races in the FFI code coming from the use of Int_val(...) + on rooted values inside blocking questions / without the runtime lock. + (Calling Int_val(...) on non-rooted immediates is fine, but any + access to rooted values must be done outside blocking sections / + with the runtime lock.) + (Etienne Millon, review by Gabriel Scherer, Jan Midtgaard, Olivier Nicole) + +- #13318: Fix regression in GC alarms, and fix them for flambda. + (Guillaume Munch-Maccagnoni, report by Benjamin Monate, review by + Vincent Laviron and Gabriel Scherer) + +- #13140: POWER back-end: fix issue with call to `caml_call_realloc_stack` + from a DLL + (Xavier Leroy, review by Miod Vallat) + +- #13370: Fix a low-probability crash when calling Gc.counters. + (Demi Marie Obenour, review by Gabriel Scherer) + +- #13402, #13512, #13549, #13553: Revise bytecode implementation of callbacks + so that it no longer produces dangling registered bytecode fragments. + (Xavier Leroy, report by Jan Midtgaard, analysis by Stephen Dolan, + review by Miod Vallat) + +- #13502: Fix misindexing related to `Gc.finalise_last` that could prevent + finalisers from being run. + (Nick Roberts, review by Mark Shinwell) + +- #13520: Fix compilation of native-code version of systhreads. Bytecode fields + were being included in the thread descriptors. + (David Allsopp, review by Sébastien Hinderer and Miod Vallat) + +OCaml 5.2.0 (13 May 2024) +------------------------- + +(Changes that can break existing programs are marked with a "*") + +### Restored and new backends: + +- #12276, #12601: native-code compilation for POWER (64 bits, little-endian) + (Xavier Leroy, review by KC Sivaramakrishnan, Anil Madhavapeddy, + and Stephen Dolan) + +- #12667: extend the latter to POWER 64 bits, big-endian, ELFv2 ABI + (A. Wilcox, review by Xavier Leroy) + +### Runtime system: + +- #12193: Re-introduce GC compaction for shared pools + Adds a parallel compactor for the shared pools (which contain major heap + blocks sized less than 128 words). Explicit only for now, on calls to + `Gc.compact`. + (Sadiq Jaffer, Nick Barnes, review by Anil Madhavapeddy, Damien Doligez, + David Allsopp, Miod Vallat, Artem Pianykh, Stephen Dolan, Mark Shinwell + and KC Sivaramakrishnan) + +- #12114: Add ThreadSanitizer support + (Fabrice Buoro and Olivier Nicole, based on an initial work by Anmol Sahoo, + review by Damien Doligez, Sébastien Hinderer, Jacques-Henri Jourdan, Luc + Maranget, Guillaume Munch-Maccagnoni, Gabriel Scherer) + + +- #12850: Update Gc.quick_stat data at the end of major cycles and compaction + This PR adds an additional caml_collect_gc_stats_sample_stw to the major heap + cycling stw. This means that Gc.quick_stat now actually reflects the state of + the heap after a major cycle or compaction. + (Sadiq Jaffer, review by Miod Vallat and Gabriel Scherer) + +- #12859: Ensure Gc.compact does a full major before the compactor runs + (Sadiq Jaffer, review by Leo White, Mark Shinwell, Gabriel Scherer, + Josh Berdine, David Allsopp and KC Sivaramakrishnan) + +- #10111: Increase the detail of location information for debugging events to + allow the end line number and character offset to be reported. + (David Allsopp, review by Nick Barnes, Enguerrand Decorne and Stephen Dolan) + +- #10403, #12202: introduce `caml_ext_table_add_noexc` that does not + raise `Out_of_memory` exceptions and use it inside the blocking sections + of `caml_read_directory`. Also, check for overflows in ext table sizes. + (Xavier Leroy, report by Arseniy Alekseyev, review by Gabriel Scherer) + +- #11332, #12702: make sure `Bool_val(v)` has type `bool` in C++ + (Xavier Leroy, report by ygrek, review by Gabriel Scherer) + +- #12772, #12787: Avoid using _Bool in public headers for the sake of C++ + compatibility + (Guillaume Munch-Maccagnoni, report by KC Sivaramakrishnan, review + by Xavier Leroy and KC Sivaramakrishnan) + +- #12223: Constify constructors and flags tables in C code. Now these + tables will go in the readonly segment, where they belong. + (Antonin Décimo, review by Gabriel Scherer and Xavier Leroy) + +- #12234: make instrumented time calculation more thread-safe on macOS. + (Anil Madhavapeddy, review by Daniel Bünzli and Xavier Leroy) + +- #12235, #12468: introduce and use the `CAMLnoret` macro as + a lighter alternative to `CAMLnoreturn_start` / `CAMLnoreturn_end`. + Implement it so as to conform with C11, C23, C++11, C++17. + (Xavier Leroy and Dhruv Maroo, with help from Antonin Décimo, review by + Gabriel Scherer and David Allsopp) + +- #12275: caml/stack.h: more abstract macros to describe OCaml stacks and + how to traverse them, supporting more stack layouts. + (Xavier Leroy, review by KC Sivaramakrishnan and Fabrice Buoro) + +- #12268: deliver `Out_of_memory` exception if domain creation fails + due to memory resource exhaustion. It was previous always a `Failure`. + (Anil Madhavapeddy, review by David Allsopp) + +- #12300, #12314: Discard out_channel buffered data on permanent I/O error + (Xavier Leroy, report by Török Edwin, review by Anil Madhavapeddy + and Nicolás Ojeda Bär) + +- #11386: Simplifications and fixes to multicore systhreads implementation. + (Guillaume Munch-Maccagnoni, review by Anil Madhavapeddy and KC + Sivaramakrishnan) + +- #12875, #12879, #12882: Execute preemptive systhread switching as a + delayed pending action. This ensures that one can reason within the + FFI that no mutation happens on the same domain when allocating on + the OCaml heap from C, consistently with OCaml 4. This also fixes + further bugs with the multicore systhreads implementation. + (Guillaume Munch-Maccagnoni, bug reports and suggestion by Mark + Shinwell, review by Nick Barnes and Stephen Dolan) + +- #12408: `Domain.spawn` no longer leaks its functional argument for + the whole duration of the children domain lifetime. + (Guillaume Munch-Maccagnoni, review by Gabriel Scherer) + +- #12409: Fix unsafety and deadlocks should an asynchronous exception + arise at specific locations during domain creation and shutdown. + (Guillaume Munch-Maccagnoni, review by Gabriel Scherer) + +- #11911, #12381: Restore statmemprof functionality in part, with + some API changes in Gc.Memprof. + (Nick Barnes, review by Jacques-Henri Jourdan + and Guillaume Munch-Maccagnoni). + +- #12430: Simplify dynamic bytecode loading in Meta.reify_bytecode + (Stephen Dolan, review by Sébastien Hinderer, Vincent Laviron and Xavier + Leroy) + +- #12489: Fix an error-handling bug in caml_alloc_sprintf + (Stephen Dolan, report by Chris Casinghino, review by Jeremy Yallop + and Xavier Leroy) + +- #11307: Finish adapting the implementation of asynchronous actions for + multicore: soundness, liveness, and performance issues. + Do not crash if a signal handler is called from an unregistered C + thread, and other possible soundness issues. Prevent issues where join + on other domains could make the toplevel unresponsible to Ctrl-C. Avoid + needless repeated polling in C code when callbacks cannot run + immediately. + (Guillaume Munch-Maccagnoni, review by Enguerrand Decorne, Xavier + Leroy, and KC Sivaramakrishnan) + +- #12634: Simplify TSan backtrace bookkeeping upon raise + (Olivier Nicole and Fabrice Buoro, review by Gabriel Scherer) + +* #12686: Some primitives had the wrong types to be callable from the bytecode + interpreter. Either fix their types, mark them as `CAMLexport` instead of + `CAMLprim`, or remove them entirely if no longer used. + (Xavier Leroy, review by David Allsopp) + +- #12700, continuing #11763 and trying to address #12660: + Use the correct types for primitives when generating the table of primitives + used by ocamlrun. + (Xavier Leroy, motivation, review and improvements by Antonin Décimo) + +- #12345, #12710: Fix issues with finaliser orphaning at domain termination + (KC Sivaramakrishnan, report by Gabriel Scherer, review by Gabriel Scherer, + Sadiq Jaffer and Fabrice Buoro) + +- #12599: Refactor Dynlink startup to avoid parsing bytecode sections twice + (Stephen Dolan, review by David Allsopp, Hugo Heuzard, Damien Doligez and + Xavier Leroy) + +- #12678, #12898: free channel buffers on close rather than on finalization + (Damien Doligez, review by Jan Midtgaard and Gabriel Scherer, report + by Jan Midtgaard) + +- #12681: Fix TSan false positives due to volatile write handling + (Olivier Nicole, Fabrice Buoro and Anmol Sahoo, review by Luc Maranget, + Gabriel Scherer, Hernan Ponce de Leon and Xavier Leroy) + +- #12743: Use pthread_sigmask instead of sigprocmask + Updates usage of sigprocmask to pthread_sigmask in otherlibs/unix. + (Max Slater, review by Miod Vallat and Xavier Leroy) + +- #12769: Unify MSVC and MinGW-w64 code paths, by always using WinAPI + directly. + (David Allsopp, Antonin Décimo, and Samuel Hym, review by Nicolas + Ojeda Bar) + +- #11911, #12382, #12383: Restore statmemprof functionality in part + (backtrace buffers, per-thread and per-domain data structures, + GC/allocation interface). (Nick Barnes, review by Gabriel Scherer, + Fabrice Buoro, Sadiq Jaffer, Guillaume Munch-Maccagnoni, and + Jacques-Henri Jourdan). + +- #12735: Store both ends of the stack chain in continuations + (Leo White, review by Miod Vallat and KC Sivaramakrishnan) + +- #12746: Simplify and clean up TSan annotations + (Olivier Nicole, review by Miod Vallat and Fabrice Buoro) + +- #12809: Add ThreadSanitizer support to FreeBSD/amd64 + (Miod Vallat, review by Gabriel Scherer) + +- #12810: Port ThreadSanitizer support to Linux and macOS on arm64 + (Miod Vallat, review by Tim McGilchrist) + +- #12811: Define and use the CAMLthread_local macro for TLS variables. + (Antonin Décimo and Samuel Hym, review by Miod Vallat and Xavier Leroy) + +- #12814: More detailed failure messages from `input_value` and `Marshal.from_*` + (Xavier Leroy, review by Stephen Dolan and Anil Madhavapeddy) + +- #12815: Correctly format multi-line locations in exception backtraces, in the + style that the compiler driver uses. + (David Allsopp, review by Gabriel Scherer) + +- #12773, #12830, #12834: Rewrite `caml_c_thread_(un)register` to fix + various bugs. + (Guillaume Munch-Maccagnoni, reported by Miod Vallat, suggested by + Hari Hara Naveen S, reviewed by Fabrice Buoro, Gabriel Scherer and + Miod Vallat) + +- #12876: Port ThreadSanitizer support to Linux on POWER + (Miod Vallat, review by Tim McGilchrist) + +- #12886: Reinitialize IO mutexes after fork + (Max Slater, review by Guillaume Munch-Maccagnoni and Xavier Leroy) + +- #12907: Port ThreadSanitizer support to Linux on RiscV + (Miod Vallat, review by Nicolás Ojeda Bär and Fabrice Buoro) + +- #12915: Port ThreadSanitizer support to Linux on s390x + (Miod Vallat, review by Tim McGilchrist) + +- #12934: Fix data races between marking and sweeping functions + (Olivier Nicole, suggested by Stephen Dolan, review by Gabriel Scherer, + Miod Vallat and Damien Doligez) + +### Language features: + +- #12295, #12568: Give `while true' a polymorphic type, similarly to + `assert false' + (Jeremy Yallop, review by Nicolás Ojeda Bär and Gabriel Scherer, + suggestion by Rodolphe Lepigre and John Whitington) + +- #12044: Add local module open syntax for types. + ``` + module A = struct + type t = int + type r = unit + type s = string + end + + type example = A.(t * r * s) + ``` + (Alistair O'Brien, review by Gabriel Scherer, Nicolás Ojeda Bär + and Florian Angeletti) + +- #11252, RFC 27: Support raw identifier syntax \#foo + (Stephen Dolan, review by David Allsopp, Gabriel Scherer and Olivier Nicole) + + +- #12315: Use type annotations from arguments in let rec + (Stephen Dolan, review by Gabriel Scherer) + +- #12375: allow use of [@untagged] for all immediate types like char, bool, + and variant with only constant constructors. + (Christophe Raffalli, review by Gabriel Scherer) + +* #12502: the compiler now normalizes the newline sequence \r\n to + a single \n character during lexing, to guarantee that the semantics + of newlines in string literals is not modified by Windows tools + transforming \n into \r\n in source files. + Warning 29 [eol-in-string] is not emitted anymore, as the normalization + gives a more robust semantics to newlines in string literals. + (Gabriel Scherer and Damien Doligez, review by Daniel Bünzli, David + Allsopp, Andreas Rossberg, Xavier Leroy, report by Andreas Rossberg) + +### Standard library: + +- #11563: Add the Dynarray module to the stdlib. Dynamic arrays are + arrays whose length can be changed by adding or removing elements at + the end, similar to 'vectors' in C++ or Rust. + (Gabriel Scherer, Simon Cruanes and Florian Angeletti, review by + Daniel Bünzli, Guillaume Munch-Maccagnoni, Clément Allain, + Damien Doligez, Wiktor Kuchta and Pieter Goetschalckx) + + +- #12716: Add `Format.pp_print_nothing` function. + (Léo Andrès, review by Gabriel Scherer and Nicolás Ojeda Bär) + +* #6732, #12423: Make Buffer.add_substitute surjective and fix its + documentation. + (Damien Doligez, review by Antonin Décimo) + +* #10775, #12499: Half-precision floating-point elements in Bigarray. + (Anton Yabchinskiy, review by Xavier Leroy and Nicolás Ojeda Bär) + +- #11517, #12477: Expose pp_infinity in interface of the format module, and + check that margin is less than pp_infinity when setting or checking geometry. + (Janith Petangoda, reported by Simmo Saan, reviewed by Florian Angeletti, + Simmo Saan, Josh Berdine and Gabriel Scherer) + +- #12217: Add `Array.shuffle`. + (Daniel Bünzli, review by Nicolás Ojeda Bär, David Allsopp and Alain Frisch) + +- #12212: Add cache-aligned constructor for atomics. The patch ensures that + all allocations (of the right size) in the shared heap are aligned. + (Bartosz Modelski with Gabriel Scherer, Guillaume Munch-Maccagnoni, + Xavier Leroy, review by Alain Frisch, Anil Madhavapeddy, Gabriel Scherer, + Guillaume Munch-Maccagnoni, KC Sivaramakrishnan, Stefan Muenzel, + Xavier Leroy) + +- #12307: Add BLAKE2b hashing and an MD5 submodule to the Digest module. + (Xavier Leroy, review by Olivier Nicole, Gabriel Scherer, Wiktor Kuchta, + Daniel Bünzli, David Allsopp) + +- #12365: Add In_channel.input_bigarray, In_channel.really_input_bigarray, + Out_channel.output_bigarray, Unix.read_bigarray, Unix.write_bigarray, + Unix.single_write_bigarray. + (Nicolás Ojeda Bär, review by Jeremy Yallop, Xavier Leroy, Gabriel Scherer, + David Allsopp) + +- #12455: Add `Array.init_matrix`, `Float.Array.make_matrix`, + `Float.Array.init_matrix`. + (Glen Mével, review by Xavier Leroy, Gabriel Scherer, Jeremy Yallop, + Nicolas Ojeda Bar) + +* #12455: `Array.make_matrix dimx dimy f` now raises `Invalid_argument` + when `dimx = 0 && dimy < 0` This was already specified but not enforced. + (Glen Mével, report by Jeremy Yallop, review by Nicolas Ojeda Bar) + +- #12459: Add `Random.int_in_range`, `Random.int32_in_range`, + `Random.int64_in_range`, `Random.nativeint_in_range`, + and their counterpart in `Random.State`. + (Glen Mével and Xavier Leroy, review by Gabriel Scherer, Xavier Leroy, + Florian Angeletti) + +- #12459: `Random`: restore compatibility between 32-bit integers (JavaScript) + and 63-bit integers (64-bit OCaml). + For `Random.full_int` this was guaranteed in 4.14 but wrongly removed in 5.0. + (Xavier Leroy, review by Glen Mével) + +- #12511: Minor performance improvements and cleanups in the implementation + of modules Int32, Int64, and Nativeint + (Xavier Leroy, review by Gabriel Scherer and Daniel Bünzli) + +- #12558: Adapt GC alarms for multicore and fix their documentation. + (Guillaume Munch-Maccagnoni, review by KC Sivaramakrishnan + and Gabriel Scherer) + +- #12625: Remove the Closure module from Obj + (Vincent Laviron, review by Xavier Leroy) + +- #12758, #12998: Remove the `Marshal.Compression` flag to the + `Marshal.to_*` functions. The compilers are still able to use + ZSTD compression for compilation artefacts. + This is a forward port and clean-up of the emergency fix that was introduced + in OCaml 5.1.1 by #12734. + (Xavier Leroy, review by Damien Doligez) + +- #12784: Fix computation of minor-heap allocation in Gc.counters() + and Gc.allocated_bytes(). (Nick Barnes, review by Gabriel Scherer) + +- #12770: Add `Fun.compose`. + (Justin Frank, review by Nicolás Ojeda Bär, Daniel Bünzli and Jeremy Yallop) + +- #12845: Add `{In,Out}_channel.is_binary_mode` as the dual of + `set_binary_mode`. This function was previously only available in the internal + C API. + (David Allsopp, review by Nicolás Ojeda Bär and Xavier Leroy) + +### Type system: + +- #12313, #11799: Do not re-build as-pattern type when a ground type annotation + is given. This allows to work around problems with GADTs in as-patterns. + (Jacques Garrigue, report by Leo White, review by Gabriel Scherer) + +### Code generation and optimizations: + +- #11239: on x86-64 and RISC-V, reduce alignment of OCaml stacks from 16 to 8. + This reduces stack usage. It's only C stacks that require 16-alignment. + (Xavier Leroy, review by Gabriel Scherer and Stephen Dolan) + +- #12311: on POWER, 32-bit FP numbers stored in memory (e.g. in bigarrays) + were not correctly rounded sometimes. + (Xavier Leroy, review by Anil Madhavapeddy and Tim McGilchrist) + +- #12551, #12608, #12782, #12596: Overhaul of recursive value compilation. + Non-function recursive bindings are now forbidden from Lambda onwards, + and compiled using a new Value_rec_compiler module. + (Vincent Laviron and Lunia Ayanides, review by Gabriel Scherer, + Stefan Muenzel and Nathanaëlle Courant) + +- #1809, #12181: rewrite `compare x y op 0` to `x op y` when values are integers + (Xavier Clerc, Stefan Muenzel, review by Gabriel Scherer and Vincent Laviron) + +- #12825: disable common subexpression elimination for atomic loads... again. + (Gabriel Scherer, review by KC Sivaramakrishnan, Xavier Leroy + and Vincent Laviron, report by Vesa Karvonen) + +### Other libraries: + +- #12213: Dynlink library, improve legibility of error messages + (Samuel Hym, review by Gabriel Scherer and Nicolás Ojeda Bär) + +* #12686: Runtime_events library, C API: define + `caml_runtime_events_{start,pause,resume}` as returning `void` + instead of `value`. + (Xavier Leroy, review by David Allsopp) + +### Compiler user-interface and warnings: + +- #11989, #12246, RFC 31: New flag, -H, to allow for transitive dependencies + without including them in the initial environment. + (Chris Casinghino, François Bobot, and Gabriel Scherer, review by Leo White + and Stefan Muenzel, RFC by François Bobot) + + +* #10613, #12405: Simplify the values used for the system variable (`system:` in + `ocamlopt -config` or the `Config.system` constant). In particular, s390x and + ppc64 now report "linux" instead of "elf"; all variants of 32-bit ARM on Linux + now report "linux"; OpenBSD now reports "openbsd" instead of "bsd" for 32-bit + ARM; FreeBSD, NetBSD and OpenBSD now report the same value for both x86_64 and + x86_32; x86_32 systems matching *bsd but not freebsd*, netbsd* or openbsd* + are no longer identified (as on x86_64); x86_32 Linux now reports "linux" + instead of "linux_elf". + (David Allsopp, request by Kate Deplaix, review by Sébastien Hinderer and + Xavier Leroy) + +- #12247: configure: --disable-ocamldebug can now be used instead + of --disable-debugger (which remains available for compatibility) + (Gabriel Scherer, review by Damien Doligez and Sébastien Hinderer) + +- #12199: improve the error message for non-overriding `inherit!` + (Florian Angeletti, review by Jules Aguillon) + +- #12210: uniform style for inline code in compiler messages + (Florian Angeletti, review by Gabriel Scherer) + +* #12278, #:12325: Remove the OCAML_FLEXLINK environment variable from the + compiler drivers. This environment variable was previously used as part of the + FlexDLL bootstrap procedure and existed solely for that purpose. Its removal + greatly simplifies both the build system and testsuite machinery. + (David Allsopp, review by Sébastien Hinderer) + +- #12347: error messages: always report missing polyvariant tags + (Florian Angeletti, report by Tianbo Hao, review by Gabriel Scherer) + +- #12224, specialized error message when trying to apply non-functor + module (e.g `module M = Int(Int)`) + (Florian Angeletti, review by Gabriel Scherer) + +- #12451: Warning 53 (misplaced attributes) now works for all attributes. + (Chris Casinghino, review by Florian Angeletti) + +- #12622: Give hints about existential types appearing in error messages + (Leo White, review by Gabriel Scherer and Florian Angeletti) + +- #12671: When a class type parameter or class parameter does not match, + identify which parameter in the error message, instead of saying + "A type parameter" or "A parameter". + (Stefan Muenzel, review by Gabriel Scherer) + +- #12679: Add more detail to the error message and manual in case of + invalid module type substitutions. + (Stefan Muenzel, review by Gabriel Scherer and Florian Angeletti) + +- #12750: Display the command executed to extract primitives in + `ocamlc -verbose`. + (David Allsopp, review by Nicolás Ojeda Bär) + +- #12777: Add details about the actual and expected method types to the method + mismatch error messages. + (Javier Chávarri, review by Gabriel Scherer and Florian Angeletti) + +* #12942: Fix an line ordering in some module inclusion error messages + (Nick Roberts, review by Florian Angeletti, report by Carl Eastlund) +### Manual and documentation: + +- #12338: clarification of the documentation of process related function in + the unix module regarding the first element of args and shell's pid. + (Christophe Raffalli, review by Florian Angeletti) + +- #12473: Document in runtime/memory.c our current understanding of + accesses to the OCaml heap from the C runtime code -- the problem + of hybrid programs mixing two memory models. + (Gabriel Scherer and Guillaume Munch-Maccagnoni, review by Olivier + Nicole and Xavier Leroy) + +- #12456: Document the incompatibility between effects on the one + hand, and `caml_callback` and asynchronous callbacks (signal + handlers, finalisers, memprof callbacks...) on the other hand. + (Guillaume Munch-Maccagnoni, review by KC Sivaramakrishnan) + +- #12694: Document in runtime/tsan.c the TSan instrumentation choices and the + consequences with regard to the memory model. + (Olivier Nicole, review by Miod Vallat, Gabriel Scherer, Guillaume + Munch-Maccagnoni and Fabrice Buoro) + +- #12802: Add manual chapter about ThreadSanitizer support + (Olivier Nicole, review by Miod Vallat, Sebastien Hinderer, Fabrice Buoro, + Gabriel Scherer and KC Sivaramakrishnan) + +- #12819: Clarify which runtime interactions are allowed in custom ops + (Basile Clément, review by Guillaume Munch-Maccagnoni and Xavier Leroy) + +- #12840: manual: update runtime tracing chapter for custom events (ex #12335) + (Lucas Pluvinage, Sadiq Jaffer and Olivier Nicole, review by Gabriel Scherer, + David Allsopp, Tim McGilchrist and Thomas Leonard) + +- #13066, update OCAMLRUNPARAM documentation for the stack size parameter l + (Florian Angeletti, review by Nicolás Ojeda Bär, Tim McGilchrist, and + Miod Vallat) + +- #13078: update Format tutorial on structural boxes to mention alignment + questions. + (Edwin Török, review by Florian Angeletti) + +- #13092: document the existence of the `[@@poll error]` built-in attribute + (Florian Angeletti, review by Gabriel Scherer) + +### Tools: + +- #12340: testsuite: collect known issues with current -short-paths + implementation for existential types + (Florian Angeletti, Samuel Hym, review by Florian Angeletti and Thomas Refis) + +- #12147: ocamllex: Allow carriage returns at the end of line directives. + (SeungCheol Jung, review by Nicolás Ojeda Bär) + +- #12260: Fix invalid_argument on some external or module aliases in ocamlnat + (Fabian Hemmer, review by Vincent Laviron) + +- #12185: New script language for ocamltest. + (Damien Doligez with Florian Angeletti, Sébastien Hinderer, Gabriel Scherer, + review by Sébastien Hinderer and Gabriel Scherer) + +- #12371: ocamltest: fix recursive expansion of variables. + (Antonin Décimo, Damien Doligez, review by Sébastien Hinderer, + Damien Doligez, Gabriel Scherer, and Xavier Leroy) + +* #12497, #12613: Make ocamlc/ocamlopt fail with an error when no + input files are specified to build an executable. + (Antonin Décimo, review by Sébastien Hinderer) + +- #12576: ocamldep: various refactors. + (Antonin Décimo, review by Florian Angeletti, Gabriel Scherer, and Léo Andrès) + +- #12615: ocamldoc: get rid of the odoc_literate and odoc_todo generators. + (Sébaistien Hinderer, review by Gabriel Scherer and Florian Angeletti) + +- #12624: Use $XDG_CONFIG_DIRS in addition to $XDG_CONFIG_HOME when searching + for init.ml and use this to extend init.ml support to the toplevel when + running on Windows. + (David Allsopp, report by Jonah Beckford, review by Nicolás Ojeda Bär and + Antonin Décimo) + +- #12688: Setting the env variable `NO_COLOR` with an empty value no longer + has effects. Previously, setting `NO_COLOR` with any value, including + the empty value, would disable colors (unless `OCAML_COLOR` is also set). + After this change, the user must set `NO_COLOR` with an non-empty value + to disable colors. This reflects a specification clarification/change + from the upstream website at https://no-color.org. + (Favonia, review by Gabriel Scherer) + +- #12744: ocamltest: run tests in recursive subdirs more eagerly + (Nick Roberts, review by Nicolás Ojeda Bär) + +- #12901, 12908: ocamllex: add overflow checks to prevent generating incorrect + lexers; use unsigned numbers in the table encoding when possible. + (Vincent Laviron, report by Edwin Török, review by Xavier Leroy) + +### Internal/compiler-libs changes: + +- #12508 : Add compiler-side support for project-wide occurrences in Merlin, by + generating index tables of all identifier occurrences. This extra data in .cmt + files is only added when the new flag -bin-annot-occurrences is passed. + (Ulysse Gérard, Nathanaëlle Courant, suggestions by Gabriel Scherer and Thomas + Refis, review by Florian Angeletti, Gabriel Scherer and Thomas Refis) + +- #12236, #12386, #12391, #12496, #12673: Use syntax as sole determiner of arity + This changes function arity to be based solely on the source program's + parsetree. Previously, the heuristic for arity had more subtle heuristics + that involved type information about patterns. Function arity is important + because it determines when a pattern match's effects run and is an input + into the fast path for function application. + + This change affects tooling: it changes the function constructs in parsetree + and typedtree. + + See https://github.com/ocaml/RFCs/pull/32 for the original RFC. + + (Nick Roberts; review by Richard Eisenberg, Leo White, and Gabriel Scherer; + RFC by Stephen Dolan) + + +- #12639: parsing: Attach a location to the RHS of Ptyp_alias + and improve the 'alias type mismatch' error message. + (Jules Aguillon, review by Florian Angeletti) + +- #12447: Remove 32-bit targets from X86_proc.system + (Masanori Ogino, review by David Allsopp) + +- #12216, #12248: Prevent reordering of atomic loads during instruction + scheduling. This is for reference, as instruction scheduling is currently + unused in OCaml 5. + (Xavier Leroy, report by Luc Maranget and KC Sivaramakrishnan, + review by Nicolás Ojeda Bär) + +- #12025: Split Typecore.unify_pat_types into two + to avoid unnecessary references to the environment in type_pat + (Jacques Garrigue and Takafumi Saikawa, review by Gabriel Scherer) + +- #12031: Use dedicated types to represent names of compilation units + and predefined exceptions in CMO files. + (Sébastien Hinderer, review by Florian Angeletti, Thomas Refis, + Gabriel Scherer, Vincent Laviron, Pierre Chambart, Luke Maurer, + Hugo Heuzard, Xavier Leroy and Damien Doligez) + +- #12109: Pack parameters to unification in unification_environment + (Takafumi Saikawa and Jacques Garrigue, review by Richard Eisenberg) + +- #12331, #12361: Pack the unification data for pattern checking in Typecore + (Takafumi Saikawa and Jacques Garrigue, + review by Gabriel Scherer, Thomas Refis and Florian Angeletti) + +- #12229: Remove global mutable state for typechecking patterns + in Typecore in favor of local mutable state. + (Nick Roberts, review by Takafumi Saikawa) + +- #12542: Minor bugfix to #12236: restore dropped call to `instance` + (Nick Roberts, review by Jacques Garrigue) + +- #12242: Move the computation of stack frame parameters to a separate + `Stackframe` module, and save the parameters in the results of the + `Linearize` pass + (Xavier Leroy, review by KC Sivaramakrishnan and Mark Shinwell) + +- #12442: document jump summaries in the pattern-matching compiler + (Gabriel Scherer and Thomas Refis, review by Florian Angeletti + and Vincent Laviron) + +- #12446, #12792: remove the hooks machinery around channel locking + in runtime/io.c + (Gabriel Scherer, review by Xavier Leroy) + +- #12389, #12544, #12984, #12987: centralize the handling of metadata for + compilation units and artifacts in preparation for better unicode support for + OCaml source files. + (Florian Angeletti, review by Vincent Laviron and Gabriel Scherer) + +- #12532, #12553: improve readability of the pattern-matching debug output + (Gabriel Scherer, review by Thomas Refis) + +- #12537: Use C11/C++11 standard static assertion. + (Antonin Décimo, review by Sebastien Hinderer, Xavier Leroy, + and KC Sivaramakrishnan) + +- #12169: runtime: document and enforce naming conventions around STW sections. + (Gabriel Scherer, review by Enguerrand Decorne, Miod Vallat, B. Szilvasy + and Nick Barnes, report by KC Sivaramakrishnan) + +- #12669 : Clean up some global state handling in schedgen + (Stefan Muenzel, review by Miod Vallat and Gabriel Scherer) + +- #12640: Make the module separator used in symbol names configurable + (Miod Vallat, review by Hugo Heuzard and Xavier Leroy) + +- #12691 : Clean up Ctype.expand_abbrev_gen and + rename Env.add_local_type to add_local_constraint + (Takafumi Saikawa and Jacques Garrigue, review by Florian Angeletti) + +- #12786 : Clean up the algorithm of Ctype.limited_generalize + (Takafumi Saikawa and Jacques Garrigue, review by Gabriel Scherer) + +- #10691: Ast_mapper, Ast_iterator: add functions directive_argument, + toplevel_directive and toplevel_phrase. + (Guillaume Petiot, review by Gabriel Scherer and Kate Deplaix) + +- #12764: Move all installable headers in `caml/` sub-directories. + (Antonin Décimo, review by Gabriel Scherer and David Allsopp) + +- #12914: Slightly change the s390x assembly dialect in order to build with + Clang's integrated assembler. + (Miod Vallat, review by Gabriel Scherer) + +- #13001: do not read_back entire shapes to get aliases' uids when building the + usages index + (Ulysse Gérard, review by Gabriel Scherer and Nathanaëlle Courant) + +### Build system: + +- #12198, #12321, #12586, #12616, #12706, #13048: continue the merge of the + sub-makefiles into the root Makefile started with #11243, #11248, + #11268, #11420 and #11675. + (Sébastien Hinderer, review by David Allsopp and Florian Angeletti) + +- #12569, #12570: remove 'otherlibraries' as a prerequisite for 'runtop'; + use 'runtop-with-otherlibs' to use a library from otherlibs/ + (Gabriel Scherer, review by Sébastien Hinderer, suggestion by David Allsopp) + +- #12652: Make magic numbers easier to bump and duplicate. + (Sébastien Hinderer, review by Antonin Décimo, David Allsopp and Florian + Angeletti) + +* #12751: --with-target-bindir configure option implemented. This option + refers to the location of the runtime binaries on the target system for a + cross-compiler and is embedded in executables produced by ocamlc. It does + not affect the bytecode executables installed as part of the build. The old + mechanism `make TARGET_BINDIR=..` no longer works. + (David Allsopp, review by Damien Doligez, Xavier Leroy and Olivier Nicole) + +- #12768, #13030: Detect mingw-w64 coupling with GCC or LLVM, detect clang-cl, + and fix C compiler feature detection on macOS. + (Antonin Décimo, review by Miod Vallat and Sébastien Hinderer) + +### Bug fixes: + +- #10652, #12720: fix evaluation order in presence of optional arguments + (Jacques Garrigue, report by Leo White, review by Vincent Laviron) + +- #12595, #12597: fix a race in `caml_clear_gc_stats_sample` + (Gabriel Scherer, review by B. Szilvasy, report by B. Szilvasy) + +- #12580: Fix location of alias pattern variables. + (Chris Casinghino, review Gabriel Scherer, report by Milo Davis) + +- #12583: Add a closing event for when `EV_MAJOR_EPHE_MARK` is complete + (Sudha Parimala, review by Gabriel Scherer) + +- #12566: caml_output_value_to_malloc wrongly uses `caml_stat_alloc` + instead of `malloc` since 4.06, breaking (in pooled mode) user code + that uses `free` on the result. Symmetrically, + caml_input_value_from_malloc should use `free`. + (Gabriel Scherer, review by Xavier Leroy and Enguerrand Decorne, + report by Ido Yariv) + +- #12490: Unix: protect the popen_processes hashtable with a mutex + (Gabriel Scherer, report by Olivier Nicole, review by Xavier Leroy) + +- #11931: Fix tricky typing bug with type substitutions + (Stephen Dolan, review by Leo White and Jacques Garrigue) + +- #12037, #12171: Fix get_extern_state potential NULL dereference. + (Alexander Skvortsov, report by Török Edwin, + design by Gabriel Scherer, Xavier Leroy) + +- #12635: Fix get_intern_state potential NULL dereference. + (Antonin Décimo, review by KC Sivaramakrishnan) + +- #12032, #12059: Bug fixes related to compilation of recursive definitions + (Vincent Laviron, report by Victoire Noizet, review by Gabriel Scherer) + +* #12145: Loopy constraints cause ocamlc to loop. + Fixed by completely removing the call to `update_type` in + `Typedecl.transl_type_decl`, as the expansion is already checked by + `check_regularity`. As a result, recursion is more polymorphic, + which may cause some (essentially wrong) type declarations to have + unbound type variables, and some constraints unrelated to the concrete + type to be ignored (see tests/typing-misc/constraints.ml). + (Jacques Garrigue, report by Richard Eisenberg, review by Leo White) + +- #12207, #12222: Make closure computation linear in the number of recursive + functions instead of quadratic + (Vincent Laviron, report by François Pottier, review by Nathanaëlle Courant + and Gabriel Scherer) + +- #11040, #12591: fix a data race in major_gc.c + (Gabriel Scherer, review by Guillaume Munch-Maccagnoni + and KC Sivaramakrishnan, report by Sadiq Jaffer) + +- #12238, #12403, #12698: read input files in one go to avoid source reprinting + issues. + (Gabriel Scherer, report by Mike Spivey and Vincent Laviron, review by + Nicolás Ojeda Bär, Xavier Leroy and Jeremy Yallop) + +- #12334, #12368: Bad error message with mutually recursive abbreviations + (Jacques Garrigue, report by Richard Eisenberg, review by Gabriel Scherer + and Richard Eisenberg) + +- #12401: `seek_in` and `seek_out` sometimes returned normally when given + negative offsets, instead of failing. Now both functions should consistently + raise `Sys_error` in this case. + (Nicolás Ojeda Bär, review by Gabriel Scherer) + +- #12267: Fix stack alignment computation + (Miod Vallat, report by Jan Midtgaard, review by Gabriel Scherer) + +- #12395, #12404: Fix thread-unsafety in the fallback implementation of + `Unix.create_process` (the one used when `posix_spawnp` is unavailable) + (Xavier Leroy, report by Chris Vine, review by Nicolás Ojeda Bär) + +- #12949: open shadowing mistriggers + (Gabriel Scherer, review by Florian Angeletti, report by Andreas Rossberg) + +- #12526: Honor `ocaml.inline always` attribute on functions with + optional arguments and default values in the Closure backend + (Alain Frisch, review by Vincent Laviron) + +- #12677, #12889: make Domain.DLS thread-safe + (Gabriel Scherer, review by Olivier Nicole and Damien Doligez, + report by Vesa Karvonen) + +- #12561: Fix crash when combining TSan and frame-pointers + (Fabrice Buoro and Olivier Nicole, report by Jan Midtgaard, review by Miod + Vallat and Gabriel Scherer) + +- #12482: Rework bounds checking code in the POWER backend + (Miod Vallat and Xavier Leroy, report by Jan Midtgaard, review by + KC Sivaramakrishnan) + +- #12528, #12703: Avoid pointer arithmetic overflow in Tag_val macro + (very likely harmless, but can trigger alarms) + (Xavier Leroy, report by Sam Goldman, review by Guillaume Munch-Maccagnoni) + +- #12593: TSan should handle Effect.Unhandled correctly + (Fabrice Buoro and Olivier Nicole, report by Jan Midtgaard and Miod Vallat, + review by Gabriel Scherer) + +- #12684: fix locations filename in AST produced by the `-pp` option + (Gabriel Scherer, review by Florian Angeletti) + +- #12714: check whether macros are defined before using them to ensure + that the headers can always be used in code which turns on -Wundef + (or equivalent). + (Antonin Décimo, review by Miod Vallat, Gabriel Scherer, + Xavier Leroy, and David Allsopp) + +- #12726: fix segmentation fault under Windows when executing a bytecode file if + the runtime (`ocamlrun.exe`) cannot be found. + (Vadim Zborovskii, Nicolás Ojeda Bär, report by Vadim Zborovskii, review by + David Allsopp) + +- #12727, #12730: fix bug with value let-rec and labelled applications + (Vincent Laviron, review by Gabriel Scherer) + +* #12751: Always keep within the 128 character limit for shebang lines. Previous + fix in #8622 handled building the compiler with a long prefix; this patch + extends this to the bytecode executables emitted by that compiler. + (David Allsopp, review by Damien Doligez, Xavier Leroy and Olivier Nicole) + +- #12755: Fix data race on global pools arrays of pool_freelist + (Fabrice Buoro and Olivier Nicole, review by Gabriel Scherer) + +- #12796, #12801: Fix memory corruption in caml_unix_alloc_sockaddr + (Thomas Leonard, review by Nicolás Ojeda Bär) + +- #12737: Fix data races in minor_gc.c and caml_natdynlink_open + (Olivier Nicole, review by Stefan Muenzel, Miod Vallat, Guillaume + Munch-Maccagnoni, Gabriel Scherer and Xavier Leroy) + +- #12831: Fix call to caml_call_realloc_stack for s390x in PIC mode + (Vincent Laviron, report by Jerry James, review by Miod Vallat) + +* #12837: Show non-generalizable type parameters in type definitions + Changes type of type parameters in outcometree.mli. + (Jacques Garrigue, review by Richard Eisenberg) + +- #12897: fix locking bugs in Runtime_events + (Gabriel Scherer and Thomas Leonard, + review by Olivier Nicole, Vincent Laviron and Damien Doligez, + report by Thomas Leonard) + +- #12851: Fix race between runtime events teardown and event emission + (Olivier Nicole, review by Miod Vallat and Gabriel Scherer) + +- #12860: Fix an assertion that wasn't taking into account the possibility of an + ephemeron pointing at static data. + (Mark Shinwell, review by Gabriel Scherer and KC Sivaramakrishnan) + +- #12861: Fix a possible crash in the `threads` library. + (Mark Shinwell, review by Gabriel Scherer and KC Sivaramakrishnan) + +- #11040, #12894: Silence false data race observed between caml_shared_try_alloc + and oldify. Introduces macros to call tsan annotations which help annotate + a ``happens before'' relationship. + (Hari Hara Naveen S and Olivier Nicole, + review by Gabriel Scherer and Miod Vallat) + +- #12958: Fix tail-modulo-cons compilation of try-with, && and || + expressions. + (Gabriel Scherer and Nicolás Ojeda Bär, report by Sylvain Boilard, review by + Gabriel Scherer) + +- #12919: Fix register corruption in caml_callback2_asm on s390x. + (Miod Vallat, review by Gabriel Scherer) + +- #12924, #12930: Rework package constraint checking to improve interaction with + immediacy + (Chris Casinghino and Florian Angeletti, review by Florian Angeletti and + Richard Eisenberg) + +- #12969: Fix a data race in caml_darken_cont + (Fabrice Buoro and Olivier Nicole, review by Gabriel Scherer and Miod Vallat) + +- #12971, #12974: fix an uncaught Ctype.Escape exception on some + invalid programs forming recursive types. + (Gabriel Scherer, review by Florian Angeletti, report by Neven Villani) + +- #13019: Remove linking instructions for the Unix library from threads.cma + (this was done for threads.cmxa in OCaml 3.11). Eliminates warnings from + new lld when using threads.cma of duplicated libraries. + (David Allsopp, review by Nicolás Ojeda Bär) + +- #13058: Add TSan instrumentation to caml_call_gc(), since it may raise + exceptions. + (Fabrice Buoro, Olivier Nicole, Gabriel Scherer and Miod Vallat) + +- #13079: Save and restore frame pointer across Iextcall on ARM64 + (Tim McGilchrist, review by KC Sivaramakrishnan and Miod Vallat) + +- #13094: Fix undefined behavior of left-shifting a negative number. + (Antonin Décimo, review by Miod Vallat and Nicolás Ojeda Bär) + +- #13130: minor fixes to pprintast for raw identifiers and local module open + syntax for types. + (Chet Murthy, review by Gabriel Scherer) + +OCaml 5.1.1 (8 December 2023) +---------------------------- + +### Standard library: + +* #12562, #12734, #12783: Remove the `Marshal.Compression` flag to the + `Marshal.to_*` functions introduced in 5.1 by #12006, as it cannot + be implemented without risking to link -lzstd with all + ocamlopt-generated executables. The compilers are still able to use + ZSTD compression for compilation artefacts. + (Xavier Leroy and David Allsopp, report by Kate Deplaix, review by + Nicolás Ojeda Bär, Kate Deplaix, and Damien Doligez). + +### Bug fixes: + +- #11800, #12707: fix an assertion race condition in `install_backup_thread` + (Jan Midtgaard, review by Gabriel Scherer) + +- #12318: GC: simplify the meaning of custom_minor_max_size: blocks with + out-of-heap memory above this limit are now allocated directly in + the major heap. + (Damien Doligez, report by Stephen Dolan, review by Gabriel Scherer) + +- #12439: Finalize and collect dead custom blocks during minor collection + (Damien Doligez, review by Xavier Leroy, Gabriel Scherer and KC + Sivaramakrishnan) + +- #12486, #12535: Fix delivery of unhandled effect exceptions on amd64 with + --enable-frame-pointers + (Miod Vallat, report by Jan Midtgaard, review by Gabriel Scherer) + +- #12581, #12609: Fix error on uses of packed modules outside their pack + to correctly handle nested packs + (Vincent Laviron, report by Javier Chávarri, review by Pierre Chambart) + +- #12590, #12595: Move `caml_collect_gc_stats_sample` in + `caml_empty_minor_heap_promote` before barrier arrival. + (B. Szilvasy, review by Gabriel Scherer) + +- #12623, fix the computation of variance composition + (Florian Angeletti, report by Vesa Karvonen, review by Gabriel Scherer) + +- #12645, #12649 fix error messages for cyclic type definitions in presence of + the `-short-paths` flag. + (Florian Angeletti, report by Vesa Karvonen, review by Gabriel Scherer) + +- #12712, #12742: fix an assertion boundary case in `caml_reset_young_limit` + (Jan Midtgaard, review by Guillaume Munch-Maccagnoni and KC Sivaramakrishnan) + +- #12713, #12715: disable common subexpression elimination for atomic loads + (Gabriel Scherer and Vincent Laviron, + review by Vincent Laviron, KC Sivaramakrishnan and Xavier Leroy, + report by Vesa Karvonen and Carine Morel) + +- #12757: Fix ocamlnat (native toplevel) by registering frametables correctly + (Stephen Dolan, Nick Barnes and Mark Shinwell, + review by Vincent Laviron and Sébastien Hinderer) + +- #12791: `extern` is applied to definitions of `caml_builtin_cprim` + and `caml_names_of_builtin_cprim` when linking bytecode '-custom' + executables with a C++ linker. + (Shayne Fletcher, review by Antonin Décimo and Xavier Leroy) + +- #12491, #12493, #12500, #12754: Do not change GC pace when creating + sub-arrays of bigarrays + (Xavier Leroy, report by Ido Yariv, analysis by Gabriel Scherer, + review by Gabriel Scherer and Fabrice Buoro) + +OCaml 5.1.0 (14 September 2023) +------------------------------- + +### Restored backends + +- #11418, #11708: RISC-V multicore support. + (Nicolás Ojeda Bär, review by KC Sivaramakrishnan) + +- #11712, #12258, #12261: s390x / IBM Z multicore support: + OCaml & C stack separation; dynamic stack size checks; fiber and + effects support. + (Aleksei Nikiforov, with help from Vincent Laviron and Xavier Leroy, + additional suggestions by Luc Maranget, + review by the same and KC Sivaramakrishnan) + +- #11642: Restore Cygwin port. Add GC messages for address space reservations + when OCAMLRUNPARAM option v includes 0x1000. + (David Allsopp, review by Xavier Leroy, Guillaume Munch-Maccagnoni + and Gabriel Scherer) + +### Standard library: + +- #12006, #12064: Add `Marshal.Compression` flag to `Marshal.to_*` functions. + When this flag is explicitly set, marshaled data is compressed using ZSTD. + On some practical examples, the marshalled output became three times smaller + at no noticeable cost on the marshalling time. + (Xavier Leroy, review by Edwin Török and Gabriel Scherer, fix by Damien + Doligez) + +- #10464: Add List.is_empty. + (Craig Ferguson, review by David Allsopp) + +- #11848: Add `List.find_mapi`, + `List.find_index: ('a -> bool) -> 'a list -> int option`, + `Seq.find_mapi`, `Seq.find_index`, `Array.find_mapi`, `Array.find_index`, + `Float.Array.find_opt`, `Float.Array.find_index`, `Float.Array.find_map`, + `Float.Array.find_mapi`. + (Tima Kinsart, review by Daniel Bünzli and Nicolás Ojeda Bär) + +- #11410: Add Set.to_list, Map.to_list, Map.of_list, + `Map.add_to_list: key -> 'a -> 'a list t -> 'a list t`. + (Daniel Bünzli, review by Nicolás Ojeda Bär and Gabriel Scherer) + +- #11836, #11837: Add `Array.map_inplace`, `Array.mapi_inplace`, + `Float.Array.mapi_inplace` and `Float.Array.mapi_inplace`. + (Léo Andrès, review by Gabriel Scherer, KC Sivaramakrishnan and + Nicolás Ojeda Bär) + +- #10967: Add Filename.temp_dir. + (David Turner, review by Anil Madhavapeddy, Valentin Gatien-Baron, Nicolás + Ojeda Bär, Gabriel Scherer, and Daniel Bünzli) + +- #11246: Add "hash" and "seeded_hash" functions to Bool, Int, Char, Float, + Int32, Int64, and Nativeint. + (Nicolás Ojeda Bär, review by Xavier Leroy and Gabriel Scherer) + +- #11488: Add `Mutex.protect: Mutex.t -> (unit -> 'a) -> 'a` + for resource-safe critical sections protected by a mutex. + (Simon Cruanes, review by Gabriel Scherer, Xavier Leroy, + Guillaume Munch-Maccagnoni) + +- #11581: Add type equality witness + `type (_, _) eq = Equal: ('a, 'a) eq` + in a new module Stdlib.Type. + (Nicolás Ojeda Bär, review by Daniel Bünzli, Jacques Garrigue, Florian + Angeletti, Alain Frisch, Gabriel Scherer, Jeremy Yallop and Xavier Leroy) + +- #11843: Add `In_channel.input_lines` and `In_channel.fold_lines`. + (Xavier Leroy, review by Nicolás Ojeda Bär and Wiktor Kuchta). + +- #11856, #11859: Using TRMC, the following `Stdlib` functions are now + tail-recursive: + Stdlib.(@), List.append, + List.concat_map. + (Jeremy Yallop, review by Daniel Bünzli, Anil Madhavapeddy, Nicolás Ojeda Bär, + Gabriel Scherer, and Bannerets) + +- #11362, #11402: Using TRMC, the following `Stdlib` functions are now + tail-recursive: + List.map, List.mapi, List.map2, + List.filter, List.filteri, List.filter_map, + List.init, + List.of_seq. + (Nicolás Ojeda Bär, review by Xavier Leroy and Gabriel Scherer) + + +- #11878, #11965: Prevent seek_in from marking buffer data as valid after + closing the channel. This could lead to inputting uninitialized bytes. + (Samuel Hym, review by Xavier Leroy and Olivier Nicole) + +- #11128: Add In_channel.isatty, Out_channel.isatty. + (Nicolás Ojeda Bär, review by Gabriel Scherer and Florian Angeletti) + +- #10859: Add `Format.pp_print_iter` and `Format.pp_print_array`. + (Léo Andrès and Daniel Bünzli, review by David Allsopp and Hugo Heuzard) + +- #10789: Add `Stack.drop` + (Léo Andrès, review by Gabriel Scherer) + +* #10899: Change Stdlib.nan from signaling NaN to quiet NaN. + (Greta Yorsh, review by Xavier Leroy, Guillaume Melquiond and + Gabriel Scherer) + +- #11026, #11667, #11858: Rename the type of the accumulator + of fold functions to 'acc: + fold_left : ('acc -> 'a -> 'acc) -> 'acc -> 'a list -> 'acc + fold_right : ('a -> 'acc -> 'acc) -> 'a list -> 'acc -> 'acc + fold_left_map : ('acc -> 'a -> 'acc * 'b) -> 'acc -> 'a list -> 'acc * 'b list + ... + (Valentin Gatien-Baron and François Berenger, + review by Gabriel Scherer and Nicolás Ojeda Bär) + +- #11354: Hashtbl.find_all is now tail-recursive. + (Fermín Reig, review by Gabriel Scherer) + +- #11500: Make Hashtbl.mem non-allocating. + (Simmo Saan, review by Nicolás Ojeda Bär) + +- #11412: Add Sys.is_regular_file + (Xavier Leroy, review by Anil Madhavapeddy, Nicolás Ojeda Bär, David Allsopp) + +- #11322, #11329: serialization functions Random.State.{of,to}_binary_string + between Random.State.t and string + (Gabriel Scherer, report by Yotam Barnoy, + review by Daniel Bünzli, Damien Doligez, Hugo Heuzard and Xavier Leroy) + +- #11830: Add Type.Id with + `val provably_equal : 'a Type.Id.t -> 'b Type.Id.t -> ('a, 'b) Type.eq option` + (Daniel Bünzli, review by Jeremy Yallop, Gabriel Scherer, Wiktor Kuchta, + Nicolás Ojeda Bär) + +- #12184, #12320: Sys.rename Windows fixes on directory corner cases. + (Jan Midtgaard, review by Anil Madhavapeddy) + +* #11565: Enable -strict-formats by default. Some incorrect format + specifications (for `printf`) where silently ignored and now fail. + Those new failures occur at compile-time, except if you use advanced + format features like `%(...%)` that parse format strings dynamically. + Pass -no-strict-formats to revert to the previous lenient behavior. + (Nicolás Ojeda Bär, review by David Allsopp) + +### Installation size + + Specific efforts have been made during this release to reduce the filesystem +size of installed artifacts of the compiler distribution. +The installation size of 5.1 is 272 MiB compared to 521 MiB for 5.0. +Some of those changes will benefit all OCaml packages. + +- ocaml/RFCs#23, #12006: use compressed marshaled format from #12006 for .cmi, + .cmt, .cmti files, and for debug info in .cmo and .cma files, resulting in + major reduction in size. + (Xavier Leroy, review by Edwin Török and Gabriel Scherer, + RFC by Simon Cruanes) + +- #11981: Reduce size of OCaml installations by removing debugging information + from installed bytecode executables. It is no longer possible to + run ocamldebug over these installed bytecode executables, nor to get + exception backtraces for them. + (Xavier Leroy, review by David Allsopp, report by Fabrice Le Fessant) + +* #11993: install only bytecode executables for the `ocamlmklib`, `ocamlcmt`, + `ocamlprof`, `ocamlcp`, `ocamloptp`, and `ocamlmktop` tools, but no + native-code executables. A tool like `ocamlmklib` for example is now + installed directly to `$BINDIR/ocamlmklib`; `ocamlmklib.byte` and + `ocamlmklib.opt` are no longer installed to `$BINDIR`. + (Xavier Leroy, review by Gabriel Scherer) + +### Runtime system: + +- #11589, #11903: Modify the GC pacing code to make sure the GC keeps + up with allocations in the presence of idle domains. + (Damien Doligez and Stephen Dolan, report by Florian Angeletti, + review by KC Sivaramakrishnan and Sadiq Jaffer) + +- #11743: Speed up weak array operations + (KC Sivaramakrishnan, review by François Bobot and Sadiq Jaffer) + +- #12131: Simplify implementation of weak hash sets, fixing a + performance regression. (Nick Barnes, review by François Bobot, + Alain Frisch and Damien Doligez). + +- #11474, #11998, #12065: Add support for user-defined events in the runtime + event tracing system. + (Lucas Pluvinage, review by Sadiq Jaffer, Guillaume Munch-Maccagnoni, + Enguerrand Decorne, Gabriel Scherer and Anil Madhavapeddy) + +- #11827, #12249: Restore prefetching for GC marking + (Fabrice Buoro and Stephen Dolan, review by Gabriel Scherer and Sadiq Jaffer) + +- #11144: Restore frame-pointers support for amd64 + (Fabrice Buoro, review by Frédéric Bour and KC Sivaramakrishnan) + +- #11935: Load frametables of dynlink'd modules in batch + (Stephen Dolan, review by David Allsopp and Guillaume Munch-Maccagnoni) + +- #11284, #12525: Use compression of entries scheme when pruning mark stack. + Can decrease memory usage for some workloads, otherwise should be + unobservable. + (Tom Kelly, review by Sabine Schmaltz, Sadiq Jaffer and Damien Doligez) + +* #11865, #11868, #11876: Clarify that the operations of a custom + block must never access the OCaml runtime. The previous + documentation only mentioned the main illicit usages. In particular, + since OCaml 5.0, it is no longer safe to call + `caml_remove_global_root` or `caml_remove_generational_global_root` + from within the C finalizer of a custom block, or within the + finalization function passed to `caml_alloc_final`. As a workaround, + such a finalization operation can be registered with `Gc.finalize` + instead, which guarantees to run the finalizer at a safe point. + (Report by Timothy Bourke, discussion by Yotam Barnoy, Timothy + Bourke, Sadiq Jaffer, Xavier Leroy, Guillaume Munch-Maccagnoni, and + Gabriel Scherer) + +- #12130: Fix multicore crashes with weak hash sets. Fixes #11934. + (Nick Barnes, review by François Bobot) + +- #12099: Add ocamlrund option, -events, to produce a trace of + debug events during bytecode interpretation. Fixes #12098. + (Richard L Ford, review by Gabriel Scherer) + +- #12001: Fix book keeping for last finalisers during the minor cycle + (KC Sivaramakrishnan and Enguerrand Decorne, report by Guillaume Bury + and Vincent Laviron, review by Sadiq Jaffer and KC Sivaramakrishnan) + +- #11919: New runtime events counters for major heap stats and minor heap + resizing. + (Sadiq Jaffer, review by Gabriel Scherer and David Allsopp) + +- #11287, #11872, #11955: Clean up reserved header bits (once used for + Spacetime profiling). + (Nick Barnes, review by Gabriel Scherer and Damien Doligez) + +- #11750: Decouple major slice from minor GC. + (KC Sivaramakrishnan, review by Sadiq Jaffer, Guillaume Munch-Maccagnoni and + Damien Doligez) + +- #11796: protect lazy computation of code fragment digest by a mutex. + This makes the thread sanitizer happier, and avoids duplicating + the hashing work. + (Gabriel Scherer, review by Xavier Leroy, report by Olivier Nicole) + +- #11137: new `Unsafe_store_tag(val, new_tag)` macro to stop using + `Tag_val(val)` as lvalue. + (Gabriel Scherer, review by Xavier Leroy, Guillaume Munch-Maccagnoni + and Nicolás Ojeda Bär) + +- #11880: Restore the correct sigmask in systhreads. + (Christiano Haesbaert, review by Guillaume Munch-Maccagnoni and + Sébastien Hinderer) + +- #11881: Fix thread-unsafety of registration of operations for "custom" + values. + (Guillaume Munch-Maccagnoni, review by Gabriel Scherer and KC + Sivaramakrishnan) + +- #11980: fix quadratic behavior in natdynlink by using a STW section + for frame-descriptor updates. + (Gabriel Scherer, review by Sadiq Jaffer, report by André Maroneze + for Frama-C and Guillaume Melquiond for Coq) + +- #12121: unrooted implementations of caml_callback*_exn + (Gabriel Scherer, review by KC Sivaramakrishnan and Xavier Leroy) + +- #3921, #12039, #12128: poll for signals in long-running polymorphic + comparisons. + (B. Szilvasy, Gabriel Scherer and Xavier Leroy, review by + Stefan Muenzel, Guillaume Munch-Maccagnoni and Damien Doligez) + +- #12231: Support MinGW-w64 11.0 winpthreads library, where the macro + to set up to get flexdll working changed + (David Allsopp and Samuel Hym, light review by Xavier Leroy) + +* #12512: Add volatile casts to FFI macros to enforce memory model (technically + a breaking change although no opam package seemed broken by it.) + (Olivier Nicole, suggested by Guillaume Munch-Maccagnoni, review by Gabriel + Scherer and Xavier Leroy) + +### Language features: + +* #11694: Add short syntax for generative functor types `() -> ...` + (Jeremy Yallop, review by Gabriel Scherer, Nicolás Ojeda Bär, + Jacques Garrigue) + + +* #11457: Remove old polymorphic variant syntax. + With ``type t = [ `A | `B ]``, one could use the syntax `#t` in types, + where it means the same thing as `[< t]`, and in patterns, where it means + ``(`A | `B)``. The use of `#t` in types for polymorphic variants + was deprecated since 2001, and is now removed. The syntax remains available + in patterns, or for objects -- when `t` is a class type. + (Stefan Muenzel, review by Gabriel Scherer and Jacques Garrigue) + +* #11984: Add dedicated syntax for generative functor application. + Previously, OCaml did not distinguish between `F ()` and + `F (struct end)`, even though the latter looks applicative. Instead, + the decision between generative and applicative functor application + was made based on the type of `F`. With this patch, we now distinguish + these two application forms; writing `F (struct end)` for a generative + functor leads to new warning 73. + (Frédéric Bour and Richard Eisenberg, review by Florian Angeletti) + + +- #9975, #11365: Make empty types (`type t = |`) immediate. + (Antal Spector-Zabusky, review by Gabriel Scherer) + +### Type system: + +* #6941, #11187, #12483: prohibit using classes through recursive modules + inheriting or including a class belonging to a mutually-recursive module + would previous behave incorrectly, and now results in a clean error. + (Leo White, review by Gabriel Scherer and Florian Angeletti) + +* #12189, #12211: anonymous row variables in explicitly polymorphic type + annotation, e.g. `'a. [< X of 'a ] -> 'a`, are now implicitly + universally quantified (in other words, the example above is now read + as `'a 'r. ([< X of 'a ] as 'r) -> 'a`). + (Florian Angeletti and Gabriel Scherer, review by Jacques Garrigue) + +### Code generation and optimizations: + +- #11967: Remove traces of Obj.truncate, which allows some mutable + loads to become immutable. + (Nick Barnes, review by Vincent Laviron and KC Sivaramakrishnan) + +- #9945, #10883: Turn boolean-result float comparisons into primitive operations + Uses the architecture's elementary operations for float comparisons, + when available, rather than branching and then setting the return value. + (Stefan Muenzel, review by Stephen Dolan, Alain Frisch and Vincent Laviron) + +- #8998, #11321, #11430: change mangling of OCaml long identifiers + from `camlModule__name_NNN` to `camlModule.name_NNN`. The previous + mangling schema, using `__`, was ambiguous. + (Xavier Leroy, report by sliquister and Michael Bacarella, + review by Gabriel Scherer) + +- #10834: The -safer-matching option disables type-based optimizations of + pattern-matching compilation. This allows to produce a match failure if + a pattern-matching was wrongly assumed to be exhaustive. Since the + exhaustiveness check for GADTs has had bugs in the past, it may be + useful if you need extra security with GADTs. + (Jacques Garrigue, review by Gabriel Scherer) + +- #11102: Speed up register allocation by permanently spilling registers + (Stephen Dolan, review by Xavier Leroy) + +- #11383: Restrict the local function optimisation to forbid moving code + inside a sub-function + (Vincent Laviron, review by Gabriel Scherer) + +- #11686: Better spilling heuristic for the Linear Scan allocator for more + efficient stack usage. + (Nicolás Ojeda Bär, Gabriel Scherer, Alain Frisch, review by Gabriel Scherer, + Alain Frisch and Nathanaëlle Courant) + +- #11904: Remove arm, i386 native-code backends that were already + disabled at configuration time. + (Nicolás Ojeda Bär, review by Stephen Dolan, Anil Madhavapeddy, and Xavier + Leroy) + +- #11134: Optimise 'include struct' in more cases + (Stephen Dolan, review by Leo White and Vincent Laviron) + +### Other libraries: + +- #11374: Remove pointer cast to a type with stricter alignment requirements + in Windows implementation of Unix.gettimeofday. Windows implementations of + caml_unix_map_file, caml_unix_lseek and caml_unix_lseek_64 now release the + runtime lock. Windows implementation of caml_unix_lockf modernised and + simplified. Where possible, 64 bit integers are used instead of LARGE_INTEGER + structs. + (David Allsopp, review by Jonah Beckford and Xavier Leroy) + +- #11475: Make Unix terminal interface bindings domain-safe + (Olivier Nicole and Xavier Leroy, review by Xavier Leroy) + +- #11775: Unix.write on a non-blocking socket under Windows will return normally + if the write blocks after some data has already been written (as otherwise + there is no way of knowing how much data has been written before + blocking). The same behaviour was already present under Unix. + (Nicolás Ojeda Bär, review by David Allsopp) + +* #11991: Unix on Windows: map ERROR_TOO_MANY_LINKS to EMLINK. + (Nicolás Ojeda Bär) + +- #12067: Document Windows specific meanings of `Unix.process_status` + type + (Samuel Hym, review by David Allsopp) + +- #12072: Document and test that Sys.rename works over directories too + (Jan Midtgaard, review by Anil Madhavapeddy and Xavier Leroy) + +### Tools: + +- #11889, #11978: ocamldoc: handle injectivity annotations and wildcards in type + parameters. + (Florian Angeletti, report by Wiktor Kuchta, review by Jules Aguillon) + +- #11787: Fix GDB scripts to work with OCaml 5's heap layout. (Nick + Barnes) + +- #11772: fix ocamlyacc's handling of raw string literals + (Demi Marie Obenour) + +- #9290: Add a directive to switch off debugging in toplevel. + This allows to see optimized bytecode with -dlambda. + (Jacques Garrigue, review by Gabriel Scherer) + +- #11166: ocamllex: the union of two character sets "cset1 | cset2" can now be + used in any context where a character set is expected. + (Nicolás Ojeda Bär, Martin Jambon, review by Sébastien Hinderer) + +- #11718: ocamlyacc: OCaml-style comments are now supported, in addition to + the C-style comments already supported. The syntax is the same as that used + in OCaml code. + (Demi Marie Obenour, review by Damien Doligez) + +- #11728: ocamlyacc: generate line directives for %type declarations + (Demi Marie Obenour, review by Damien Doligez) + +- #11773: ocamlyacc: Do not allow quoted literals (such as 'a' or "bc") + in a token name or %type declaration. Previously such literals were + accepted by ocamlyacc, but produced malformed OCaml that was rejected + by the compiler. + (Demi Marie Obenour, review by Gabriel Scherer) + +- #11774: ocamlyacc: fail if there is an I/O error + (Demi Marie Obenour, review by Gabriel Scherer) + +- #11973: Add support for postfixed mingw host triplets + (Romain Beauxis) + +- #12165: ocamldoc, use standard doctype to avoid quirk mode. + (Florian Angeletti, review by Gabriel Scherer) + +### Manual and documentation: + +- #11476: Add examples in documentation of Hashtbl, Queue, Atomic, Format + (Simon Cruanes, review by Yotam Barnoy, Gabriel Scherer, Daniel Bünzli, + Ulugbek Abdullaev, and Nicolás Ojeda Bär) + +- #11883, #11884: Update documentation for In_channel and Out_channel + with examples and sections to group related functions. + (Kiran Gopinathan, review by Daniel Bünzli and Xavier Leroy) + + +- #12095, #12097: Put the sample code of the user's manual and reference + documentation of the standard library under the CC0 1.0 Universal + (CC0 1.0) Public Domain Dedication license. + +- #11892: Document the semantic differences of Unix.exec* between Unix and + Windows. + (Boris Yakobowski, review by Daniel Bünzli, Gabriel Scherer and Nicolás Ojeda + Bär) + +- #9430, #11291: Document the general desugaring rules for binding operators. + (Gabriel Scherer, review by Nicolás Ojeda Bär) + +- #11481: Fix the type of Unix.umask to Unix.file_perm -> Unix.file_perm + (Favonia, review by Sébastien Hinderer) + +- #11514: Document ocamltest builtin variables and actions + (Olivier Nicole, review by Sébastien Hinderer) + +- #11676: Fix missing since annotation in the `Sys` and `Format` modules + (Github user Bukolab99, review by Florian Angeletti) + +- #12028: Update format documentation to make it clearer that + `pp_print_newline` flushes its newline + (Florian Angeletti, review by Gabriel Scherer) + +- #12201: in the tutorial on modules, replace priority queue example by + a simpler example based on FIFO queues. + (Xavier Leroy, review by Anil Madhavapeddy and Nicolás Ojeda Bär). + +- #12352: Fix a typo in the documentation of Arg.write_arg + (Christophe Raffalli, review by Florian Angeletti) + +- #7179, #11894: correct the description of CAMLreturn and CAMLreturn0 in + the Interfacing C page and memory.h file. + (Dong An, review by Guillaume Munch-Maccagnoni and Olivier Nicole ) + +### Compiler user-interface and warnings: + +- #10647: Show hints for the "undefined global" error in the toplevel + (Wiktor Kuchta, review by Gabriel Scherer) + +- #12116: Don't suggest to insert a semicolon when the type is not unit + (Jules Aguillon, review by Florian Angeletti) + +- #11679: Improve the error message about too many arguments to a function + (Jules Aguillon, review by Gabriel Scherer and Florian Angeletti) + +- #10009: Improve the error reported by mismatched struct/sig and =/: in module + and module type bindings. + (Jules Aguillon, review by Gabriel Scherer) + +- #11530: Include kinds in kind mismatch error message. + "Error: This variant or record definition does not match that of type M.t + The original is abstract, but this is a record". + (Leonhard Markert, review by Gabriel Scherer and Florian Angeletti) + +- #11646: Add colors to error message hints. + (Christiana Anthony, review by Florian Angeletti) + +- #11235, #11864: usage warnings for constructors and fields can now be disabled + on field-by-field or constructor-by-constructor basis + (Florian Angeletti, review by Gabriel Scherer) + +- #11888: Improve the error message when type variables cannot be deduced from + the type parameters: + Before: + "Error: In this definition, a type variable cannot be deduced + from the type parameters." + After: + "Error: In the GADT constructor + T : 'a -> 'a s t + the type variable 'a cannot be deduced from the type parameters." + (Stefan Muenzel, review by Florian Angeletti and Gabriel Scherer) + + +- #10818: Preserve integer literal formatting in type hint. + (Leonhard Markert, review by Gabriel Scherer and Florian Angeletti) + +- #11338: Turn some partial application warnings into hints. + (Leo White, review by Stephen Dolan) + +- #10931: Improve warning 14 (illegal backslash) with a better explanation + of the causes and how to fix it. + (David Allsopp, Florian Angeletti, Lucas De Angelis, Gabriel Scherer, + review by Nicolás Ojeda Bär, Florian Angeletti, David Allsopp and + Gabriel Scherer) + +- #10911: Improve the location reported by parenthesized assert expressions + (Fabian Hemmer, review by Gabriel Scherer) + +- #1391, #7645, #3922: Add an early error when compiling different + modules with mismatching -for-pack + (Pierre Chambart and Vincent Laviron, review by Mark Shinwell) + +- #11297: Report "unclosed" error when "done" is missing in a "do .. done" + construct. + (Nicolás Ojeda Bär, review by Gabriel Scherer) + +- #11635, #5461, #10564: turn warning 31 (Module_linked_twice) into a hard error + for ocamlc — this was already an error with ocamlopt. + (Hugo Heuzard, review by Valentin Gatien-Baron and Gabriel Scherer) + +- #11653: Add the -no-absname option to ocamlc, ocamlopt and ocamldep. + (Abiola Abdulsalam, review by Sébastien Hinderer and Florian Angeletti) + +- #11696: Add the -no-g option to ocamlc and ocamlopt. + (Abiola Abdulsalam, review by Sébastien Hinderer, Nicolás Ojeda Bär and + Florian Angeletti) + +- #11722: clearer error messages on non-well-founded type definitions + (Gabriel Scherer, review by Jacques Garrigue) + +- #11819: make the `native_compiler` and `native_dynlink` configuration + variables available through ocamlc -config. + (Sébastien Hinderer, review by Gabriel Scherer and David Allsopp) + +- #8602, #11863: Add -stop-after lambda flag option + (Douglas Smith and Dmitrii Kosarev, review by Gabriel Scherer) + +- #11910: Simplify naming convention for shadowed or ephemeral identifiers in + error messages (eg: `Illegal shadowing of included type t/2 by t`) + (Florian Angeletti, review by Jules Aguillon) + +- #12024: insert a blank line between separate compiler messages + (Gabriel Scherer, review by Florian Angeletti, report by David Wong) + +- #12088, #9265, #11949: ocamldebug: fix confusing repeating behavior + on blank lines within source scripts + (Damien Doligez, review by Gabriel Scherer, report by Gaëtan Gilbert) + +- #12107: use aliases to mark weak row variables: `_[< ... ]`, `< _..>`, `_#ct` + are now rendered as `[< ...] as '_weak1`, `< .. > as '_weak1`, + and `#ct as '_weak1`. + (Florian Angeletti, suggestion by Stefan Muenzel, review by Gabriel Scherer) + +- #12051: Improve the error messages when type variables cannot be generalized + (Stefan Muenzel, review by Florian Angeletti) + +* #12094: Trigger warning 5 (ignored-partial-application) when the scrutinee of + a pattern matching is of arrow type and all cases match wildcard or exception + patterns. + (Nicolás Ojeda Bär, review by Gabriel Scherer) + +### Internal/compiler-libs changes: + +- #11018, #11869: Clean up Types.Variance, adding a description of + the lattice used, and defining explicitly composition. + (Jacques Garrigue, review by Gabriel Scherer and Jeremy Yallop) + +- #11536: Introduce wrapper functions for level management + ([Ctype.with_level], etc) and for type variable scoping + ([Typetexp.with_local_type_variable_scope]). + The older API ([Ctype.(begin_def,end_def)], [Typetexp.(narrow,widen)], etc.) + is now removed. + (Jacques Garrigue and Takafumi Saikawa, review by Gabriel Scherer) + +- #11601, #11612, #11628, #11613, #11623, #12120 : Clean up some + global state handling in emitcode, bytepackager, bytegen, + bytesections, spill. + (Hugo Heuzard, Stefan Muenzel, review by Vincent Laviron, Gabriel Scherer + and Nathanaëlle Courant) + +- #12119, #12188, #12191: mirror type constraints on value binding in the + parsetree: + the constraint `typ` in `let pat : typ = exp` is now directly stored + in the value binding node in the parsetree. + (Florian Angeletti, review by Richard Eisenberg) + +- #11912: Refactoring handling of scoped type variables + (Richard Eisenberg, review by Gabriel Scherer and Florian Angeletti) + + +- #11691, #11706: use __asm__ instead of asm for strict ISO C conformance + (Xavier Leroy, report by Gregg Reynolds , review by Sadiq Jaffer) + +- #11693: Remove use of C99 Variable Length Arrays (VLAs) in the runtime. + (David Allsopp, review by Xavier Leroy, Guillaume Munch-Maccagnoni, + Stefan Muenzel and Gabriel Scherer) + +- #12138: Generalise interface for BUILD_PATH_PREFIX_MAP mapping. + Absolute paths are now rewritten too. + (Richard L Ford, suggestions and review by Gabriel Scherer) + +- #10512: explain the compilation strategy for switches on constructors + (Gabriel Scherer, review by Vincent Laviron) + +- #11990: Improve comments and macros around frame descriptors. + (Nick Barnes, review by Gabriel Scherer) + +- #11847, #11849, #11851, #11898: small refactorings in the type checker + (Gabriel Scherer, review by Nicolás Ojeda Bär) + +- #11027: Separate typing counter-examples from type_pat into retype_pat; + type_pat is no longer in CPS. + (Jacques Garrigue and Takafumi Saikawa, review by Gabriel Scherer) + +- #11286, #11515: disambiguate identifiers by using how recently they have + been bound in the current environment + (Florian Angeletti, review by Gabriel Scherer) + +- #11364: Allow `make -C testsuite promote` to take `TEST` and `LIST` variables + (Antal Spector-Zabusky, review by Gabriel Scherer and David Allsopp) + +- #11446: document switch compilation (lambda/switch.ml) + (Gabriel Scherer, review by Luc Maranget and Vincent Laviron) + +- #11568: Encode inline record types in Path.t + (Leo White and Hyunggyu Jang, review by Gabriel Scherer) + +- #11569: Remove hash type encoding + (Hyunggyu Jang, review by Gabriel Scherer and Florian Angeletti) + +- #11627: use return values instead of globals for linear scan intervals + (Stefan Muenzel, review by Nicolás Ojeda Bär) + +- #11634: Dll.open_dll now properly handles opening for execution while already + opened for checking + (Hugo Heuzard, review by Nicolás Ojeda Bär) + +* #11745, #12358: Debugger and toplevels: embed printer types rather than + reading their representations from topdirs.cmi at runtime. + This change also removes the ocamlmktop initialization module introduced + in #11382 which was no longer useful. + This change breaks toplevel scripts relying on the visibility of `Topdirs` + in the initial toplevel environment without loading `topfind`. + Since the opam default `.ocamlinit` file loads `topfind`, it is expected + that only scripts run with `ocaml -noinit` are affected. + For those scripts, accessing `Topdirs` now requires the `compiler-libs` + directory to be added to the toplevel search path with + ``` + #directory "+compiler-libs";; + ```` + as was already the case for the other modules in the toplevel interface + library. + (Sébastien Hinderer, review by Florian Angeletti, Nicolás Ojeda Bär and + Gabriel Scherer) + +- #11615: remove global variables form asmcomp/linearize.ml + (Stefan Muenzel, review by Nicolás Ojeda Bär + +- #10856: Add location, attribute(s) visitors to Tast_mapper/Tast_iterator + (Yan Dong, review by Nicolás Ojeda Bär and Gabriel Scherer) + +- #11933: Use the correct machtype when reading the code pointer from closures + (Nathanaëlle Courant, review by Gabriel Scherer and Vincent Laviron) + +- #11972: refactor runtime/frame_descriptors.c + in preparation for quadratic-time fix + (Gabriel Scherer, review by Enguerrand Decorne) + +- #11997: translate structured constants into their Obj.t representation + at compile time rather than link time. Changes the way dumpobj prints + these constants because their representation becomes untyped. + (Sébastien Hinderer, review by Xavier Leroy, Nicolás Ojeda Bär and + Hugo Heuzard) + +- #12011: remove Ctype.reified_var_counter + (Takafumi Saikawa and Jacques Garrigue, review by Gabriel Scherer) + +- #12012: move calls to Typetexp.TyVarEnv.reset inside with_local_level etc. + (Jacques Garrigue and Takafumi Saikawa, review by Gabriel Scherer) + +- #12034: a logarithmic algorithm to find the next free variable + (Gabriel Scherer, review by Stefan Muenzel) + +- #12092: remove Lev_module_definition from lambda + (Nick Roberts, review by Gabriel Scherer) + +- #12117: Remove arity-interrupting elaboration of module unpacks + (Nick Roberts, review by Richard Eisenberg and Jacques Garrigue) + +- #12118: stop storing names of predefined exceptions in the + cu_required_globals field of compilation unit descriptors. + (Sébastien Hinderer, review by Vincent Laviron) + +- #12125: Add Misc.print_see_manual and modify [@manual_ref] to accept + lists for simpler printing of manual references + (Stefan Muenzel, review by Florian Angeletti) + +### Build system: + +- #11844: Reduce verbosity of `make` logs by printing program invocations in + shorthand (eg `OCAMLC foo.cmo`). Setting `V=1` recovers the old style (with + full command-lines). + (Xavier Leroy, Nicolás Ojeda Bär, review by Sébastien Hinderer) + + +- #11243, #11248, #11268, #11420, #11675: merge the sub-makefiles into + the root Makefile. + (Sébastien Hinderer, review by David Allsopp and Florian Angeletti) + +- #11828: Compile otherlibs/ C stubs in two version for native and bytecode + (Olivier Nicole, review by Sébastien Hinderer and Xavier Leroy) + +- #12265: Stop adding -lexecinfo to cclibs (leftover debugging code from the + multicore project). Harden the feature probe for -lm in configure so -lm is + only added if strictly necessary. configure.ac now correctly propagates + library flags for the Windows ports, allowing Windows OCaml to be configured + with ZSTD support. + (David Allsopp, review by Sébastien Hinderer) + +### Bug fixes: + +- #8813, #12029: In the toplevel, let the user type several phrases in one line + (Damien Doligez, report by Daniel Bünzli, review by Gabriel Scherer and + Wiktor Kuchta) + +- #12062: fix runtime events consumer: when events are dropped they shouldn't be + parsed. (Lucas Pluvinage) + +- #12132: Fix overcounting of minor collections in GC stats. + (Damien Doligez, review by Gabriel Scherer) + +- #12017: Re-register finaliser only after calling user alarm in Gc.create_alarm + (Fabrice Buoro, report by Sam Goldman, review by Guillaume Munch-Maccagnoni) + +- #11887, #11893: Code duplication in pattern-matching compilation + (Vincent Laviron, report par Greta Yorsh, review by Luc Maranget and + Gabriel Scherer) + +- #10664, #11600: Unsoundness in the typing of polymorphic methods + involving polymorphic variants + (Jacques Garrigue, report by Mike Shulman, review by Gabriel Scherer) + +- #11302, #11412: `ocamlc` and `ocamlopt` should not remove generated files + when they are not regular files. + (Xavier Leroy, report by Thierry Martinez, review by + Anil Madhavapeddy, Nicolás Ojeda Bär, David Allsopp) + +- #10348, #10560, #11561: Expand GADT equations lazily during unification to + avoid ambiguity + (Jacques Garrigue, review by Leo White) + +- #11436: Fix wrong stack backtrace for out-of-bound exceptions raised + by leaf functions. + (Tom Kelly and Xavier Leroy, review by Mark Shinwell) + +- #11450, #12018: Fix erroneous functor error messages that were too eager to + cast `struct end` functor arguments as unit modules in `F(struct end)`. + (Florian Angeletti, review by Gabriel Scherer) + +- #11643: Add missing test declaration to float_compare test, so that it will + run. + (Stefan Muenzel, review by David Allsopp) + +- #11630: Use correct location when reporting record labels with non-existent + paths. + (Nicolás Ojeda Bär, report by Jason Gross, review by Gabriel Scherer) + +- #11727: Ensure push_defaults can push past module patterns, fixing an + currying optimisation accidentally disabled by #10340. + (Stephen Dolan, review by Gabriel Scherer) + +- #11771: Use a more relaxed mode for unification in Ctype.subst + (Leo White, review by Jacques Garrigue and Gabriel Scherer) + +- #11803, #11808: on x86, the destination of an integer comparison must be + a register, it cannot be a stack slot. + (Vincent Laviron, review by Xavier Leroy, report by + Emilio Jesús Gallego Arias) + +- #11809: Protect Parmatch.pats_of_type from missing cmis + (Jacques Garrigue, review by Stephen Dolan and Gabriel Scherer) + +- #11824: Fix a crash when calling `ocamlrun -b` + (Florian Angeletti, review by Sébastien Hinderer) + +- #11815: Marshalling continuations raises invalid argument exception. + (Jérôme Vouillon, review by Nicolás Ojeda Bär, Stephen Dolan and + Hugo Heuzard) + +- #11846: Mark rbx as destroyed at C call for Win64 (mingw-w64 and Cygwin64). + Reserve the shadow store for the ABI in the c_stack_link struct instead of + explicitly when calling C functions. This simultaneously reduces the number of + stack pointer manipulations and also fixes a bug when calling noalloc + functions where the shadow store was not being reserved. + (David Allsopp, report by Vesa Karvonen, review by Xavier Leroy and + KC Sivaramakrishnan) + +- #11850: When stopping before the `emit` phase (using `-stop-after`), an empty + temporary assembly file is no longer left in the file system. + (Nicolás Ojeda Bär, review by Gabriel Scherer and Xavier Leroy) + +- #11866: Fix the result of `caml_read_directory()` on non-existent paths. + (Andrei Paskevich and Charlène Gros, review by David Allsopp and + Nicolás Ojeda Bär) + +- #11879: Bugfix for Ctype.nondep_type + (Stephen Dolan, review by Gabriel Scherer) + +- #12004: Don't ignore function attributes on lambdas with locally abstract + types. + (Chris Casinghino, review by Gabriel Scherer) + +- #12037: Fix some data races by using volatile when necessary + (Fabrice Buoro and Olivier Nicole, review by Guillaume Munch-Maccagnoni, + Gabriel Scherer and Luc Maranget) + +- #12046: Flush stderr when tracing the parser + (Hugo Heuzard, review by David Allsopp and Nicolás Ojeda Bär) + +- #12061, #12063: don't add inconsistent equalities when computing + high-level error messages for functor applications and inclusions. + (Florian Angeletti, review by Gabriel Scherer) + +- #12075: auto-detect whether `ar` support @FILE arguments at + configure-time to avoid using this feature with toolchains + that do not support it (eg FreeBSD/Darwin). + (Nicolás Ojeda Bär, review by Xavier Leroy, David Allsopp, Javier + Chávarri, Anil Madhavapeddy) + +- #12103, 12104: fix a concurrency memory-safety bug in Buffer + (Gabriel Scherer, review by Florian Angeletti, report by Samuel Hym) + +- #12112: Fix caml_callback{2,3}_exn when used with effect handlers. + (Lucas Pluvinage, review by Gabriel Scherer, David Allsopp and Xavier Leroy) + +- #12134: Use ghost location for nodes created when handling defaults in + optional arguments. + (Paul-Elliot Anglès d'Auriac, review by Gabriel Scherer) + +- #12153: Fix segfault in bytecode programs involving recursive value + definitions of values of size 0 + (Vincent Laviron, Xavier Leroy, Gabriel Scherer, + review by Xavier Leroy, report by Nick Roberts) + +- #12162: Fix miscompilation on amd64 backends involving integer overflows + (Vincent Laviron and Greta Yorsh, review by Stefan Muenzel) + +- #12170: fix pthread_geaffinity_np configure check for android + (David Allsopp, review by Sébastien Hinderer) + +- #12178: Fix runtime events consumer poll function returning an invalid value + instead of an OCaml integer value. (Lucas Pluvinage) + +- #12252: Fix shared library build error on RISC-V. + (Edwin Török, review by Nicolás Ojeda Bär and Xavier Leroy) + +- #12255, #12256: Handle large signal numbers correctly (Nick Barnes, + review by David Allsopp). + +- #12277: ARM64, fix a potential assembler error for very large functions by + emitting stack reallocation code before the body of the function. + (Xavier Leroy, review by KC Sivaramakrishnan) + +- #12253, #12342: Fix infinite loop in signal handling. + (Guillaume Munch-Maccagnoni, report by Thomas Leonard, review by + KC Sivaramakrishnan and Sadiq Jaffer) + +- #12445: missing GC root registrations in runtime/io.c + (Gabriel Scherer, review by Xavier Leroy and Jeremy Yallop) + +- #12481, #12505: Fix incorrect initialization of array expressions + `[|e1;...;eN|]` when `N` is large enough to require major heap allocation. + (Xavier Leroy, report by Andrey Popp, analysis by KC Sivaramakrishnan + and Vincent Laviron, review by Gabriel Scherer) + +- #11150, #11207, #11936: Avoid recomputation in Typedecl.check_wellfounded + (Jacques Garrigue, report by Boris Yakobowski, review by Gabriel Scherer) + +- #11186, #11188: Fix composition of coercions with aliases + (Vincent Laviron, report and review by Leo White) + +- #12486: Fix delivery of unhandled effect exceptions on s390x + (Miod Vallat, report by Jan Midtgaard, review by Vincent Laviron and Xavier + Leroy) + +OCaml 5.0.0 (15 December 2022) +------------------------------ + +- #10831: Multicore OCaml + (Enguerrand Decorne, Stephen Dolan, Tom Kelly, Sadiq Jaffer, + Anil Madhavapeddy, Sudha Parimala, KC Sivaramakrishnan, + Leo White, the Tarides multicore team, + review by Florian Angeletti, Damien Doligez, Xavier Leroy, + Guillaume Munch-Maccagnoni, Olivier Nicole, Nicolás Ojeda Bär, + Gabriel Scherer, the OCaml core development team, and many + other valued reviewers.) + +### Language features: + +### Runtime system: + +- #11400: Runtime events counters fixes + Fixes mismatch between OCaml and C APIs, removes events from 4.x that + are not present in the 5.0 GC and adds some missing probes. + (Sadiq Jaffer, review by Gabriel Scherer, Florian Angeletti) + +- #11368: Runtime events buffer size OCAMLRUNPARAMS fix + The runtime events buffer size can now be set via the 'e' OCAMLRUNPARAM. + This is previously mistakenly enabled/disabled tracing instead. + (Sadiq Jaffer, review by KC Sivaramakrishnan, David Allsopp, Damien Doligez) + +- #11308: Add environment variable to preserve runtime_events after exit + If the environment variable OCAML_RUNTIME_EVENTS_PRESERVE exists then the + runtime will not remove the runtime events ring buffers at exit. This + makes tracing very short running programs more reliable. + (Sadiq Jaffer, review by KC Sivaramakrishnan) + +- #10964: Ring-buffer based runtime tracing (runtime_events) + Runtime_events is a very low overhead runtime tracing system designed for + continuous monitoring of OCaml applications. + (Sadiq Jaffer, review by Anil Madhavapeddy, Enguerrand Decorne, + Richard Warburton, Gabriel Scherer, Sabine Schmaltz, Florian Angeletti, + Patrick Ferris, Tom Kelly) + +* #10723: do not use `-flat-namespace` linking for macOS. + (Carlo Cabrera, review by Damien Doligez) + +* #10863, #10933: Remove support for old, unprefixed C runtime function names + such as `alloc`. The new names prefixed with `caml_` must be used instead, + such as `caml_alloc`. Consequently, it is no longer needed to define + `CAML_NAME_SPACE` to avoid bringing unprefixed names into scope: this is now + the default behavior. + (Nicolás Ojeda Bär, review by Xavier Leroy) + +- #10902: Do not register empty code fragments in natdynlink. + (David Allsopp, review by Xavier Leroy and Damien Doligez) + +- #10965: `caml_fatal_error_hook`, GC timing hooks, and + `caml_scan_roots_hook` are now atomic variables. Restore GC timing + hooks in multicore. + (Guillaume Munch-Maccagnoni, review by Enguerrand Decorne, Xavier + Leroy, Gabriel Scherer, and KC Sivaramakrishnan) + +- #11209: Add a public and thread-safe timing hook running at domain + termination, after this domain has stopped running any OCaml code: + `caml_domain_terminated_hook`. This can be useful for implementing + domain-local state in C. + (Guillaume Munch-Maccagnoni, review by Xavier Leroy and Gabriel + Scherer) + +- #10875, #11731: Add option to allocate fiber stacks and sigaltstacks with + mmap(MAP_STACK) instead of malloc. This is exposed via a configure + --enable-mmap-map-stack option, and is enabled by default on OpenBSD where + it is mandatory. + (Anil Madhavapeddy, review by Gabriel Scherer, Tom Kelly, + Michael Hendricks and KC Sivaramakrishnan). + +- #10950: Do not use mmap to allocate Caml_state. + In order to reduce virtual memory usage, we dynamically allocate + the domain_state structure. + (Enguerrand Decorne, KC Sivaramakrishnan and Tom Kelly, + review by Anil Madhavapeddy and Gabriel Scherer) + +- #11010: Use strerror_r for reentrant error string conversion. + (Anil Madhavapeddy and Xavier Leroy, review by same and Edwin Török) + +- #11002, #11066, #11086: Do not use Begin_roots/End_roots macros in + the runtime system. Also fix a missing root registration in the + implementation of Unix.write on Windows. + (Nicolás Ojeda Bär, Daniel Bünzli and Antonin Décimo, + review by Xavier Leroy and David Allsopp) + +- #11022: Track GC work for all managed bigarray allocations + (Stephen Dolan, report by Andrew Hunter, review by Damien Doligez) + +- #10802: Use 4.12 value macros and helpers in C code + (Antonin Décimo, review by Gabriel Scherer) + +- #11105: Fix handling of fiber stack cache with multiple domains + (Jon Ludlam, KC Sivaramakrishnan and Tom Kelly) + +- #11054: Respect user provided maximum stack space + Make sure the stack we initially request is sized accordingly to + the user provided settings. tmc/stack_space is also updated by + this PR in order to account for this change. + (Enguerrand Decorne, report by Jon Ludlam, + review by Tom Kelly, KC Sivaramakrishnan and Gabriel Scherer) + +- #11238: Increase the default limit for the stack size to 128 Mi words, + i.e. 1 Gib for 64-bit platforms and 512 Mib for 32-bit platforms. + (Xavier Leroy, review by Sébastien Hinderer) + +* #11295: An ISO C 2011 compliant compiler, including full support for atomic + types, is now required to build the OCaml runtime system. + (Xavier Leroy, review by David Allsopp and Sébastien Hinderer) + +- #10915, #11039, #11057, #11095, #11190: Implement quality treatment for + asynchronous actions in multicore. Reimplement the old behaviour of + `caml_process_pending*` for multicore. + (Guillaume Munch-Maccagnoni, review by Sadiq Jaffer and Gabriel Scherer) + +- #11303: Ensure that GC is not invoked from bounds check failures + (Stephen Dolan, review by Sadiq Jaffer and Xavier Leroy) + +- #11304: Fix data race on Windows file descriptors + (Olivier Nicole and Xavier Leroy, review by Xavier Leroy, David Allsopp, + and Sadiq Jaffer) + +* #11337: pass 'flags' metadata to root scanners, to optimize stack + scanning in the bytecode interpreter. + Changes the interface of user-provided root-scanning hooks. + (Gabriel Scherer, review by Xavier Leroy, + Guillaume Munch-Maccagnoni, Sadiq Jaffer and Tom Kelly) + +* #11255: in the C interface, `&Field(v, i)` now has type `volatile value *` + instead of `value *` in OCaml 4. This makes the memory model + for mixed OCaml/C code better defined, but can cause warnings or type + errors in user C code. + (KC Sivaramakrishnan, review by Xavier Leroy, Gabriel Scherer and + Guillaume Munch-Maccagnoni, additional discussions with Stephen + Dolan and Luc Maranget) + +- #5299, #4787, #11138, #11272, #11506: To help debugging, `Caml_state` + now dynamically checks that the domain lock is held, and fails + otherwise (with a fatal error at most entry points of the C API, or + systematically in debug mode). A new variable `Caml_state_opt` is + introduced, and is `NULL` when the domain lock is not held. This + allows to test from C code if the current thread holds the lock of + its domain. + (Guillaume Munch-Maccagnoni, review by Florian Angeletti, Damien + Doligez, Sadiq Jaffer, Xavier Leroy, and Gabriel Scherer) + +- #11223: The serialization format of custom blocks changed in 4.08, + but the deserializer would still support the pre-4.08 format. OCaml + 5.x removed support for this old format; provide a clear error message + in this case. + (Hugo Heuzard, review by Gabriel Scherer) + +- #11504, #11522: Use static allocation in `caml_make_float_vect` in + no-flat-float-array mode, it's more efficient and avoids a a race condition + (Xavier Leroy, report by Guillaume Munch-Maccagnoni, review by David Allsopp) + +- #11652: Fix benign off-by-one error in Windows implementation of caml_mem_map. + (David Allsopp, review by Gabriel Scherer) + +- #11669, #11704: Fix construction of Effect.Unhandled exceptions in the + bytecode interpreter. + (David Allsopp and Xavier Leroy, report by Samuel Hym, review by Xavier Leroy + and Gabriel Scherer) + +### Code generation and optimizations: + +- #10972: ARM64 multicore support: OCaml & C stack separation; + dynamic stack size checks; fiber and effects support. + (Tom Kelly and Xavier Leroy, review by KC Sivaramakrishnan, Xavier Leroy, + Guillaume Munch-Maccagnoni, Eduardo Rafael, Stephen Dolan and + Gabriel Scherer) + +### Standard library: + +- #10742: Use LXM as the pseudo-random number generator for module Random. + Add `Random.State.split` and `Random.split` to "split" a PRNG off + another PRNG. + (Xavier Leroy, review by Gabriel Scherer and Hugo Heuzard) + +* #10867, #11345: Remove deprecated values: Array.create, Array.make_float, + Array.create_matrix, Bytes.uppercase, Bytes.lowercase, Bytes.capitalize, + Bytes.uncapitalize, Char.lowercase, Char.uppercase, Filename.temp_dir_name, + Int32.format, Int64.format, Nativeint.format, Format.bprintf, Format.kprintf, + Format.set_all_formatter_output_functions, + Format.get_all_formatter_output_functions, + Format.pp_set_all_formatter_output_functions, + Format.pp_get_all_formatter_output_functions, Format.pp_open_tag, + Format.pp_close_tag, Format.open_tag, Format.close_tag, + Format.formatter_tag_functions, Format.pp_set_formatter_tag_functions, + Format.pp_get_formatter_tag_functions, Format.set_formatter_tag_functions, + Format.get_formatter_tag_functions, Gc (mutability of the fields of type + Gc.control), Lazy.lazy_from_fun, Lazy.lazy_from_val, Lazy.lazy_is_val, + Obj.set_tag, Obj.truncate, Obj.final_tag, Obj.extension_constructor, + Obj.extension_name, Obj.extension_id, Scanf.stdib, Scanf.fscanf, + Scanf.kfscanf, Stdlib.( & ), Stdlib.( or ), String.set, String.copy, + String.fill, String.unsafe_set, String.unsafe_fill, String.uppercase, + String.lowercase, String.capitalize, String.uncapitalize, Thread.kill, + Thread.wait_write, Thread.wait_read, the whole ThreadUnix module, the + infix operator (.[]<-). + (Nicolás Ojeda Bär, review by Damien Doligez) + +* #10896: Remove Stream, Genlex and Pervasives. Also remove legacy standalone + bigarray library (the Bigarray module is now part of the standard library). + (Nicolás Ojeda Bär, review by Kate Deplaix and Anil Madhavapeddy) + +- #10921: Use getentropy, when available, to seed the generator during + `Random.self_init` + (Michael Hendricks, review by Gabriel Scherer, Xavier Leroy, and + Anil Madhavapeddy) + +* #10924: Add deprecated attribute to Printexc.catch, Printf.kprintf and + Unix.SO_ERROR. + (Nicolás Ojeda Bär, review by Damien Doligez) + +- #10986: Add Scanf.sscanf_opt, Scanf.bscanf_opt and Scanf.scanf_opt. + (Nicolás Ojeda Bär, review by Florian Angeletti and Gabriel Scherer) + +* #11157: Rename "hash" in the "Hashtbl.SeededHashedType" signature to + "seeded_hash". This allows defining both seeded and unseeded hash functions in + the same module. + (Nicolás Ojeda Bär, review by Gabriel Scherer and Xavier Leroy) + +- #8878: Add String.hash and String.seeded_hash. + (Tom Kelly, review by Alain Frisch and Nicolás Ojeda Bär) + +- #11279, #11585, #11742: ensure that the unsafe Buffer code + remains memory-safe in concurrent settings. + Unsynchronized access to Buffer is a programming error and may + result in wrong behavior, but it should preserve memory-safety. + (Florian Angeletti and Gabriel Scherer, review by Gabriel Scherer + and Vincent Laviron, report by David Allsopp) + + +### Other libraries: + +* #9071, #9100, #10935: Reimplement `Thread.exit()` as raising the + exception `Thread.Exit`, and mark `Thread.exit` as deprecated. + The new implementation changes the behavior compared with + the OCaml 4 implementation. For example, the new implementation + causes `Fun.finally` finalizers to be run and catch-all exception + handlers to prevent termination. + (Jacques-Henri Jourdan and Xavier Leroy, review by Damien Doligez, + Guillaume Munch-Maccagnoni, Gabriel Scherer, and Enguerrand Decorne) + +- #11034: Dynlink library, add a global lock to make dynlinking + thread-safe. + (Florian Angeletti, review by Gabriel Scherer) + +- #11087: deprecate Thread.wait_timed_read, Thread.wait_timed_write, + Thread.select, Thread.wait_pid. The same functionality is available in the + Unix module. + (Nicolás Ojeda Bär, review by Anil Madhavapeddy) + +- #11309, #11424, #11427, #11545: Add Domain.recommended_domain_count. + (Christiano Haesbaert, Konstantin Belousov, review by David Allsopp, + KC Sivaramakrishnan, Gabriel Scherer, Nicolás Ojeda Bär) + +- #11461, #11466: Fix gethostbyaddr for IPv6 arguments and make it domain-safe + (Olivier Nicole, Nicolás Ojeda Bär, David Allsopp and Xavier Leroy, + review by the same) + +- #11479: Make Unix.symlink domain-safe on Windows + (Olivier Nicole, review by Xavier Leroy and David Allsopp) + +### Tools: + +* #11004: Litmus tests for checking the implementation of the + memory model. + (Luc Maranget, review by Gabriel Scherer and Xavier Leroy) + +- #11024: Handle alerts in ocamldoc. + The alert `[@@alert deprecated]` is handled specifically and it's no longer + needed to duplicate the deprecated annotation (the alert for the compiler and + the tag for the documentation). Every other alerts also appear in the + documentation. + (Jules Aguillon, review by Florian Angeletti) + +- #11065: Port the bytecode debugger to 5.0, adding support for effect handlers. + (Damien Doligez and @fabbing, review by @fabbing and Xavier Leroy) + +- #11079: Add the -nobanners option to dumpobj. + (Sébastien Hinderer, review by Gabriel Scherer and Vincent Laviron) + +- #11100: Fix ocamltest to make sure failed tests are not counted as + "unexpected error". + (Damien Doligez, review by Sébastien Hinderer) + +- #11245: Merge the common code of ocamlcp and ocamloptp into a single module. + (David Allsopp, review by Sébastien Hinderer) + +- #11382: OCamlmktop use a new initialization module "OCamlmktop_init" to + preserve backward-compatibility with user-module provided modules that install + toplevel printers. + (Florian Angeletti, review by Gabriel Scherer and David Allsopp) + +### Manual and documentation: + +- #11058: runtime/HACKING.adoc tips on debugging the runtime + (Gabriel Scherer, review by Enguerrand Decorne and Nicolás Ojeda Bär) + +- #11093: Add an effect handlers tutorial + (KC Sivaramakrishnan, review by François Pottier, Gabriel Scherer, François + Bobot and Wiktor Kuchta) + +- #11192: Better documentation for condition variables. + (François Pottier, review by Luc Maranget, Xavier Leroy, and Wiktor Kuchta) + +- #11093: Add tutorials on parallelism features and the relaxed memory model + (KC Sivaramakrishnan, review by Damien Doligez, Anil Madhavapeddy, Gabriel + Scherer, Thomas Leonard, Tom Ridge, Xavier Leroy, Luc Maranget, Fabrice + Buoro, Olivier Nicole, Guillaume Munch-Maccagnoni, Jacques-Henri Jourdan) + +- #11640, #11647: Add missing options to the man pages: + flambda commonly-used options, and negative options (`-no-rectypes`, ... ). + (Amandine Nangah, review by David Allsopp, Florian Angeletti, + Sébastien Hinderer, and Vincent Laviron) + +- #11676: Fix missing since annotation in the `Sys` and `Format` modules + (Github user Bukolab99, review by Florian Angeletti) + +- #11813: Make new multicore chapters easier to discover, and emphasize impact + on C bindings. + (Edwin Török, review by KC Sivaramakrishnan, and Florian Angeletti) + +### Compiler user-interface and warnings: + +- #9140, #11131: New command-line flag -nocwd to not include implicit + the current directory to the load path. + (Thomas Roglin, review by Gabriel Scherer and Nicolás Ojeda Bär) + +- #11089: Add 'since ' information to compiler warnings. + (André Maroneze, review by Florian Angeletti and Gabriel Scherer) + +- #10909: Disable warning 59 (assignment to immutable blocks) unless flambda + invariant checks are enabled. + (Vincent Laviron, review by Gabriel Scherer) + +- #10981, #11276: Implement a -cmi-file option for ocamlc and ocamlopt. + (Sébastien Hinderer, review by Damien Doligez, Daniel Bünzli and + Florian Angeletti) + +* #11049: Stop padding 1-digit compiler minor version numbers. + (So for instance OCaml 5.0 rather than 5.00) + (Sébastien Hinderer, review by David Allsopp, Florian Angeletti and + Xavier Leroy) + +- #11253: Deprecate `ocaml script` and `ocamlnat` script where `script` has no + extension and is an implicit basename. + (David Allsopp, review by Florian Angeletti and Sébastien Hinderer) + +### Internal/compiler-libs changes: + +- #10878, #10909: restore flambda after the Multicore merge. + (Vincent Laviron, review by Gabriel Scherer and Xavier Leroy) + +- #10864, #10888: restore afl-fuzz mode for sequential programs. + (Jan Midtgaard, review by Xavier Leroy and Gabriel Scherer) + +- #11008, #11047: rework GC statistics in the Multicore runtime + (Gabriel Scherer, review by Enguerrand Decorne) + +- #11058: basic debugging documentation in runtime/HACKING.adoc + (Gabriel Scherer, review by Enguerrand Decorne and Nicolás Ojeda Bär) + +- #11199: Stop installing topdirs.cmi twice. The toplevel now reads topdirs.cmi + from +compiler-libs, as the debugger does. + (David Allsopp, review by Sébastien Hinderer) + +- #11007, #11399: META files for the stdlib, compiler-libs and other libraries + (unix, dynlink, str, runtime_events, threads, ocamldoc) are now installed + along with the compiler. + (David Allsopp, Florian Angeletti, Nicolás Ojeda Bär and Sébastien Hinderer, + review by Daniel Bünzli, Kate Deplaix, Anil Madhavapeddy and Gabriel Scherer) + +### Build system: + +* #10893: Remove configuration options --disable-force-safe-string and + DEFAULT_STRING=unsafe as well as --enable-force-safe-string and + DEFAULT_STRING=safe which are now the default unconditionally. + (Kate Deplaix, review by Gabriel Scherer and David Allsopp) + +- #11092: Build native-code compilers on OpenBSD/aarch64. + (Christopher Zimmermann, review by Anil Madhavapeddy) + +- #11126: Build system: make it possible to choose which ocamldep + (and flags) to use when computing dependencies for the compiler. + Add a -no-slash option to ocamldep to let users override -slash. + (Sébastien Hinderer, review by David Allsopp) + +- #11147: Factorize the stdlib-related compilation flags. Make it + possible to control them consistently through the STDLIBFLAGS + build variable. Make sure ocamldoc and ocamllex get compiled and + linked with debugging information (-g). + (Sébastien Hinderer, review by Gabriel Scherer) + +- #11149: Make the bootstrap process reproducible on systems with non-big-endian + floating point. If the boot/ artefacts are up-to-date, this means that running + make bootstrap on any platform should not change the images in boot/ and paves + the way for automated testing that the bootstrap is repeatable. + (David Allsopp, review by Damien Doligez and Sébastien Hinderer) + +- #11160: otherlibs: merge win32unix into unix. + (Sébastien Hinderer, review by David Allsopp, Nicolás Ojeda Bär, + Xavier Leroy, Vincent Laviron and Antonin Décimo) + +* #11198, #11298: Install the Dynlink, Str and Unix libraries to individual + subdirectories of LIBDIR. The compiler, debugger and toplevel automatically + add `-I +lib` if required, but display an alert. + (David Allsopp, review by Florian Angeletti, Nicolás Ojeda Bär, + Valentin Gatien-Baron and Sébastien Hinderer) + +- #11200: Install ocamlprof's Profiling runtime module to a +profiling, + removing it from the default namespace. + (David Allsopp, review by Sébastien Hinderer) + +- #11294: Switch minimum required autoconf to 2.71. + (David Allsopp, review by Xavier Leroy) + +- #11097: Build native-code compilers on NetBSD/aarch64 + (Kate Deplaix, review by Anil Madhavapeddy) + +### Bug fixes: + +- #10790: don't drop variance and injectivity annotations when pretty printing + `with` constraints (for example, `with type +!'a t = ...`). + (Florian Angeletti, report by Luke Maurer, review by Matthew Ryan and + Gabriel Scherer) + +- #11167: Fix memory leak from signal stack. + (Antoni Żewierżejew, review by Gabriel Scherer and Enguerrand Decorne) + +- #11112: harden -use-runtime against spaces or quotes in the provided path + (Gabriel Scherer, report by Brahima Dibassi, review by David Allsopp) + +- #11068, #11070: Fix typo in function name given in Unix_error exception for + Unix.readlink on Windows. + (David Allsopp, report by Xia Li-yao) + +- #10807: Don't duplicate standard handles in the child process + spawned by win32unix Unix.create_process if the handles were already + inheritable. Fix broken signalling of EOF on standard handles if + they were already inheritable. + (Antonin Décimo, review by Xavier Leroy and Nicolás Ojeda Bär) + +- #10868: Fix off-by-1 bug when initializing frame hashtables + (Jonah Beckford, review by Tom Kelly, Nicolás Ojeda Bär and + KC Sivaramakrishnan) + +- #11077: Make dumpobj compatible with absence of naked pointer support + (Olivier Nicole and Jan Midtgaard, review by Gabriel Scherer) + +- #11111: fix fork() usage in ocamltest C code. + When calling fork() from C code with the Multicore runtime active, + one needs to call caml_atfork_hook() on the forked child before it + can use the OCaml runtime. + (Gabriel Scherer, review by Xavier Leroy, report by Brahima Dibassi) + +- #10809: Use the WSA_FLAG_NO_HANDLE_INHERIT on Windows when creating + sockets with WSASocket if the cloexec (non-inheritable) parameter is + true. Fixes a race condition where a child process could inherit the + socket and deadlock the parent. + (Antonin Décimo, review by Xavier Leroy) + +- #11289, #11405: fix some leaks on systhread termination + (Fabrice Buoro, Enguerrand Decorne, Gabriel Scherer, + review by Xavier Leroy and Florian Angeletti, report by Romain Beauxis) + +- #11314, #11416: fix non-informative error message for module inclusion + (Florian Angeletti, report by Thierry Martinez, review by Gabriel Scherer) + +- #11358, #11379: Refactor the initialization of bytecode threading, + This avoids a "dangling pointer" warning of GCC 12.1. + (Xavier Leroy, report by Armaël Guéneau, review by Gabriel Scherer) + +- #11387, module type with constraints no longer crash the compiler in presence + of both shadowing warnings and the `-bin-annot` compiler flag. + (Florian Angeletti, report by Christophe Raffalli, review by Gabriel Scherer) + +- #11482, #11542: Fix random crash in large closure allocation + (Damien Doligez, report by Thierry Martinez and Vincent Laviron, review by + Xavier Leroy) + +- #11508, #11509: make Bytes.escaped domain-safe + (Christiano Haesbaert and Gabriel Scherer, + review by Xavier Leroy, + report by Jan Midtgaard and Tom Kelly) + +- #11576: Fix bug in Bigarray.Genarray.init in the the case of zero-dimensional + arrays. + (Nicolás Ojeda Bär, Jeremy Yallop, report by Masayuki Takeda, review by Jeremy + Yallop and Florian Angeletti) + +- #11587: Prevent integer comparison from being used on pointers + (Vincent Laviron, review by Gabriel Scherer) + +- #11662, #11673: fix a memory leak when using Dynlink, + the bug was only present in development version of OCaml 5. + (Stephen Dolan, report by Andre Maroneze, review by Gabriel Scherer) + + +OCaml 4.14 maintenance version +------------------------------ + +### Runtime system: + +- #11764, #12577: Add prototypes to old-style C function definitions + and declarations. + (Antonin Décimo, review by Xavier Leroy and Nick Barnes) + +- #11763, #11759, #11861, #12509, #12577: Use strict prototypes on primitives. + (Antonin Décimo, review by Xavier Leroy, David Allsopp, Sébastien + Hinderer and Nick Barnes) + +### Build system: + +- #11590: Allow installing to a destination path containing spaces. + (Élie Brami, review by Sébastien Hinderer and David Allsopp) + +- #12372: Pass option -no-execute-only to the linker for OpenBSD >= 7.3 + so that code sections remain readable, as needed for closure marshaling. + (Xavier Leroy and Anil Madhavapeddy, review by Anil Madhavapeddy and + Sébastien Hinderer) + +- #12903: Disable control flow integrity on OpenBSD >= 7.4 to avoid + illegal instruction errors on certain CPUs. + (Michael Hendricks, review by Miod Vallat) + +### Bug fixes: + +- #12878: fix incorrect treatment of injectivity for private recursive types. + (Jeremy Yallop, review by Gabriel Scherer and Jacques Garrigue) + +- #12971, #12974: fix an uncaught Ctype.Escape exception on some + invalid programs forming recursive types. + (Gabriel Scherer, review by Florian Angeletti, report by Neven Villani) + +- #12264, #12289: Fix compact_allocate to avoid a pathological case + that causes very slow compaction. + (Damien Doligez, report by Arseniy Alekseyev, review by Sadiq Jaffer) + +* #10845 Emit frametable size on amd64 BSD (OpenBSD, FreeBSD, NetBSD) systems + (emitted for Linux in #8805) + (Hannes Mehnert, review by Nicolás Ojeda Bär) + + +OCaml 4.14.1 (20 December 2022) +------------------------------ + +### Compiler user-interface and warnings: + +- #11184, #11670: Stop calling ranlib on created / installed libraries + (Sébastien Hinderer and Xavier Leroy, review by the same) + +### Build system: + +- #11370, #11373: Don't pass CFLAGS to flexlink during configure. + (David Allsopp, report by William Hu, review by Xavier Leroy and + Sébastien Hinderer) + +- #11487: Thwart FMA test optimization during configure + (William Hu, review by David Allsopp and Sébastien Hinderer) + +### Bug fixes: + +- #10768, #11340: Fix typechecking regression when combining first class + modules and GADTs. + (Jacques Garrigue, report by François Thiré, review by Matthew Ryan) + +- #11204: Fix regression introduced in 4.14.0 that would trigger Warning 17 when + calling virtual methods introduced by constraining the self type from within + the class definition. + (Nicolás Ojeda Bär, review by Leo White) + +- #11263, #11267: caml/{memory,misc}.h: check whether `_MSC_VER` is defined + before using it to ensure that the headers can always be used in code which + turns on -Wundef (or equivalent). + (David Allsopp and Nicolás Ojeda Bär, review by Nicolás Ojeda Bär and + Sébastien Hinderer) + +- #11392, #11392: assertion failure with -rectypes and external definitions + (Gabriel Scherer, review by Florian Angeletti, report by Dmitrii Kosarev) + +- #11417: Fix regression allowing virtual methods in non-virtual classes. + (Leo White, review by Florian Angeletti) + +- #11468: Fix regression from #10186 (OCaml 4.13) detecting IPv6 on Windows for + mingw-w64 i686 port. + (David Allsopp, review by Xavier Leroy and Sébastien Hinderer) + +- #11489, #11496: More prudent deallocation of alternate signal stack + (Xavier Leroy, report by @rajdakin, review by Florian Angeletti) + +- #11516, #11524: Fix the `deprecated_mutable` attribute. + (Chris Casinghino, review by Nicolás Ojeda Bär and Florian Angeletti) + +- #11194, #11609: Fix inconsistent type variable names in "unbound type var" + messages + (Ulysse Gérard and Florian Angeletti, review Florian Angeletti and + Gabriel Scherer) + +- #11622: Prevent stack overflow when printing a constructor or record + mismatch error involving recursive types. + (Florian Angeletti, review by Gabriel Scherer) + +- #11732: Ensure that types from packed modules are always generalised + (Stephen Dolan and Leo White, review by Jacques Garrigue) + +- #11737: Fix segfault condition in Unix.stat under Windows in the presence of + multiple threads. + (Marc Lasson, Nicolás Ojeda Bär, review by Gabriel Scherer and David Allsopp) + +- #11776: Extend environment with functor parameters in `strengthen_lazy`. + (Chris Casinghino and Luke Maurer, review by Gabriel Scherer) + +- #11533, #11534: follow synonyms again in #show_module_type + (this had stopped working in 4.14.0) + (Gabriel Scherer, review by Jacques Garrigue and Florian Angeletti, + report by Yaron Minsky) + +- #11768, #11788: Fix crash at start-up of bytecode programs in + no-naked-pointers mode caused by wrong initialization of caml_global_data + (Xavier Leroy, report by Etienne Millon, review by Gabriel Scherer) + +- #11803, #11808: on x86, the destination of an integer comparison must be + a register, it cannot be a stack slot. + (Vincent Laviron, review by Xavier Leroy, report by + Emilio Jesús Gallego Arias) + +OCaml 4.14.0 (28 March 2022) +---------------------------- + +### Language features: + +- #10462: Add attribute to produce a compiler error for polls. + (Sadiq Jaffer, review by Mark Shinwell, Stephen Dolan + and Guillaume Munch-Maccagnoni) + +- #10437: Allow explicit binders for type variables. + (Stephen Dolan, review by Leo White) + +- #10441: Remove unnecessary parentheses surrounding immediate objects. + Allow 'object ... end # f', 'f object ... end', etc. + (Yan Dong, review by Nicolás Ojeda Bär, Florian Angeletti and Gabriel Scherer) + +- #181, #9760, #10740: opt-in tail-modulo-cons (TMC) transformation + let[@tail_mod_cons] rec map f li = ... + (Frédéric Bour, Gabriel Scherer, Basile Clément, + review by Basile Clément and Pierre Chambart, + tested by Konstantin Romanov) + +### Runtime system: + +* #9391, #9424: Fix failed assertion in runtime due to ephemerons *set_* and + *blit_* function during Mark phase + (François Bobot, reported by Stephen Dolan, reviewed by Damien Doligez) + +- #10195, #10680: Speed up GC by prefetching during marking + (Stephen Dolan, review by Xavier Leroy, Guillaume Munch-Maccagnoni, + Jacques-Henri Jourdan, Damien Doligez and Leo White) + +- #10549: Stack overflow detection and naked pointers checking for ARM64 + (Xavier Leroy, review by Stephen Dolan) + +* #10675: Emit deprecation warnings when old C runtime function names + are used. This will break C stub code that uses these old names and + treats warnings as errors. The workaround is to use the new names. + (Xavier Leroy and David Allsopp, review by Sébastien Hinderer and + Damien Doligez) + +- #10698, #10726: Free the alternate signal stack when the main OCaml + code or an OCaml thread stops + (Xavier Leroy, review by David Allsopp and Damien Doligez) + +- #10730, 10731: Fix bug in `Obj.reachable_words` causing a slowdown when called + multiple time (Alain Frisch, report by ygrek, review by Xavier Leroy) + +- #10926: Rename the two internal Windows Unicode functions with `caml_` prefix + instead of `win_`. + (David Allsopp, review by Kate Deplaix, Damien Doligez and Xavier Leroy) + +### Code generation and optimizations: + +- #10578: Increase the number of integer registers used for + parameter passing on PowerPC (16 registers) and on s390x (8 registers). + (Xavier Leroy, review by Mark Shinwell) + +- #10591, #10615: Tune the heuristic for CSE of integer constants + so as to avoid excessive CSE on compiler-generated constants + and long register allocation times. + (Xavier Leroy, report by Edwin Török, review by Nicolás Ojeda Bär) + +- #10595: Tail calls with up to 64 arguments are guaranteed to be compiled + as tail calls. To this end, memory locations in the domain state + are used for passing arguments that do not fit in registers. + (Xavier Leroy, review by Vincent Laviron) + +- #10681: Enforce boolean conditions for the native backend + (Vincent Laviron, review by Gabriel Scherer) + +- #10719: Ensure that build_apply respects Lambda.max_arity + (Stephen Dolan, review by Xavier Leroy) + +- #10728: Ensure that functions are evaluated after their arguments + (Stephen Dolan, review by Mark Shinwell) + +- #10732: Ensure right-to-left evaluation of arguments in cmm_helpers + (Greta Yorsh, review by Xavier Leroy) + +### Standard library: + +* #10710: Add UTF tools, codecs and validations to the Uchar, Bytes and + String modules. + (Daniel Bünzli, review by Florian Angeletti, Nicolás Ojeda Bär, Alain + Frisch and Gabriel Scherer) + +* #10622: Annotate `Uchar.t` with immediate attribute + (Hongbo Zhang, reivew by Gabriel Scherer and Nicolás Ojeda Bär) + +* #7812, #10475: `Filename.chop_suffix name suff` now checks that `suff` + is actually a suffix of `name` and raises Invalid_argument otherwise. + (Xavier Leroy, report by whitequark, review by David Allsopp) + +* #10482: mark the Stream and Genlex modules as deprecated, in preparation + for a future removal. These modules (without deprecation alert) + are now provided by the camlp-streams library. + (Xavier Leroy, review by Nicolás Ojeda Bär) + +- #10526: add Random.bits32, Random.bits64, Random.nativebits + (Xavier Leroy, review by Gabriel Scherer and François Bobot) + +* #10568: remove Obj.marshal and Obj.unmarshal + (these functions have been deprecated for a while and are superseded + by the functions from module Marshal) + (François Pottier, review by Gabriel Scherer and Kate Deplaix) + +- #10545: Add In_channel and Out_channel modules. + (Nicolás Ojeda Bär, review by Daniel Bünzli, Simon Cruanes, Gabriel Scherer, + Guillaume Munch-Maccagnoni, Alain Frisch and Xavier Leroy) + +- #10538: add Out_channel.set_buffered and Out_channel.is_buffered to control + the buffering mode of output channels. + (Nicolás Ojeda Bär, review by John Whitington, Daniel Bünzli, David Allsopp + and Xavier Leroy) + +* #10583, #10998: Add over 40 new functions in Seq. + (François Pottier and Simon Cruanes, review by Nicolás Ojeda Bär, + Daniel Bünzli, Nathanaëlle Courant, Craig Ferguson, Wiktor Kuchta, + Xavier Leroy, Guillaume Munch-Maccagnoni, Raphaël Proust, Gabriel Scherer + and Thierry Martinez) + +- #10596, #10978: Add with_open_bin, with_open_text and with_open_gen to + In_channel and Out_channel. Also, add In_channel.input_all. + (Nicolás Ojeda Bär, review by Daniel Bünzli, Jérémie Dimino, Damien Doligez + and Xavier Leroy) + +- #10658: add detailed information about the current version of OCaml + to the Sys module of the standard library. + (Sébastien Hinderer, review by Damien Doligez, Gabriel Scherer, David + Allsopp, Nicolás Ojeda Bär, Vincent Laviron) + +- #10642: On Windows, Sys.remove and Unix.unlink now remove symlinks + to directories instead of raising EACCES. Introduce + caml/winsupport.h to hold more common code between the runtime, + lib-sys, and win32unix. + (Antonin Décimo, review by David Allsopp and Xavier Leroy) + +- #10737: add new ephemeron API for forward compatibility with Multicore + OCaml. + (Damien Doligez, review by Stephen Dolan) + +- #10786: The implementation of Complex.norm now uses Float.hypot. + (Christophe Troestler, review by David Allsopp and Xavier Leroy) + +### Other libraries: + +- #10192: Add support for Unix domain sockets on Windows and use them + to emulate Unix.socketpair (only available on Windows 1803+) + (Antonin Décimo, review by David Allsopp) + +- #10469: Add Thread.set_uncaught_exception_handler and + Thread.default_uncaught_exception_handler. + (Enguerrand Decorne, review by David Allsopp) + +- #10697: Bindings of dup and dup2 in win32unix now correctly call + WSADuplicateSocket on sockets instead of DuplicateHandle. + (Antonin Décimo, review by Xavier Leroy and Nicolás Ojeda Bär) + +* #10926, #11336: Ensure all C functions in the Unix library are prefixed with + `caml_`. + (David Allsopp, review by Kate Deplaix, Damien Doligez and Xavier Leroy) + +- #10951: Introduce the Thread.Exit exception as an alternative way to + terminate threads prematurely. This alternative way will become + the standard way in 5.0. + (Xavier Leroy, review by Florian Angeletti) + +### Tools: + +- #9701: Release bytecode only after collecting backtrace information + for exceptions, same for dynamic loaded code compiled from toplevel on + ocamlnat. + (Renato Alencar, reported by Krzysztof Leśniak, reviewed by Gabriel Scherer) + +- #10839: Fix regression of #show when printing class type + (Élie Brami, review by Florian Angeletti) + +- #3959, #7202, #10476: ocaml, in script mode, directive errors + (`#use "missing_file";;`) use stderr and exit with an error. + (Florian Angeletti, review by Gabriel Scherer) + +- #10438: add a new toplevel cli argument `-e

    Package ocaml

    Stdlib

    Threads

    • Event First-class synchronous communication.
    • Thread Lightweight threads for Posix 1003.1c and Win32.

    Compiler libs

    Package info

    changes-files
    license-files
    readme-files
    diff --git a/odoc.css b/odoc.css new file mode 100644 index 0000000..15f7254 --- /dev/null +++ b/odoc.css @@ -0,0 +1,1610 @@ +@charset "UTF-8"; +/* Copyright (c) 2016 The odoc contributors. All rights reserved. + Distributed under the ISC license, see terms at the end of the file. + odoc 3.0.0 */ + +/* Fonts */ +/* noticia-text-regular - latin */ +@font-face { + font-family: 'Noticia Text'; + font-style: normal; + font-weight: 400; + src: url('fonts/noticia-text-v15-latin-regular.woff2') format('woff2'); /* Chrome 36+, Opera 23+, Firefox 39+, Safari 12+, iOS 10+ */ +} + +/* noticia-text-italic - latin */ +@font-face { + font-family: 'Noticia Text'; + font-style: italic; + font-weight: 400; + src: url('fonts/noticia-text-v15-latin-italic.woff2') format('woff2'); /* Chrome 36+, Opera 23+, Firefox 39+, Safari 12+, iOS 10+ */ +} + +/* noticia-text-700 - latin */ +@font-face { + font-family: 'Noticia Text'; + font-style: normal; + font-weight: 700; + src: url('fonts/noticia-text-v15-latin-700.woff2') format('woff2'); /* Chrome 36+, Opera 23+, Firefox 39+, Safari 12+, iOS 10+ */ +} + +/* fira-mono-regular - latin */ +@font-face { + font-family: 'Fira Mono'; + font-style: normal; + font-weight: 400; + src: url('fonts/fira-mono-v14-latin-regular.woff2') format('woff2'); /* Chrome 36+, Opera 23+, Firefox 39+, Safari 12+, iOS 10+ */ +} + +/* fira-mono-500 - latin */ +@font-face { + font-family: 'Fira Mono'; + font-style: normal; + font-weight: 500; + src: url('fonts/fira-mono-v14-latin-500.woff2') format('woff2'); /* Chrome 36+, Opera 23+, Firefox 39+, Safari 12+, iOS 10+ */ +} + +/* fira-sans-regular - latin */ +@font-face { + font-family: 'Fira Sans'; + font-style: normal; + font-weight: 400; + src: url('fonts/fira-sans-v17-latin-regular.woff2') format('woff2'); /* Chrome 36+, Opera 23+, Firefox 39+, Safari 12+, iOS 10+ */ +} + +/* fira-sans-italic - latin */ +@font-face { + font-family: 'Fira Sans'; + font-style: italic; + font-weight: 400; + src: url('fonts/fira-sans-v17-latin-italic.woff2') format('woff2'); /* Chrome 36+, Opera 23+, Firefox 39+, Safari 12+, iOS 10+ */ +} + +/* fira-sans-500 - latin */ +@font-face { + font-family: 'Fira Sans'; + font-style: normal; + font-weight: 500; + src: url('fonts/fira-sans-v17-latin-500.woff2') format('woff2'); /* Chrome 36+, Opera 23+, Firefox 39+, Safari 12+, iOS 10+ */ +} + +/* fira-sans-500italic - latin */ +@font-face { + font-family: 'Fira Sans'; + font-style: italic; + font-weight: 500; + src: url('fonts/fira-sans-v17-latin-500italic.woff2') format('woff2'); /* Chrome 36+, Opera 23+, Firefox 39+, Safari 12+, iOS 10+ */ +} + +/* fira-sans-700 - latin */ +@font-face { + font-family: 'Fira Sans'; + font-style: normal; + font-weight: 700; + src: url('fonts/fira-sans-v17-latin-700.woff2') format('woff2'); /* Chrome 36+, Opera 23+, Firefox 39+, Safari 12+, iOS 10+ */ +} + +/* fira-sans-700italic - latin */ +@font-face { + font-family: 'Fira Sans'; + font-style: italic; + font-weight: 700; + src: url('fonts/fira-sans-v17-latin-700italic.woff2') format('woff2'); /* Chrome 36+, Opera 23+, Firefox 39+, Safari 12+, iOS 10+ */ +} + + +:root, +.light:root { + + scroll-padding-top: calc(var(--search-bar-height) + var(--search-padding-top) + 1em); + + /* light gruvbox theme colors */ + --bg_h: #f9f5d7; + --bg: #f6f8fa; /*#fbf1c7;*/ + --bg_s: #f2e5bc; + --bg1: #ebdbb2; + --bg2: #d5c4a1; + --bg3: #bdae93; + --bg4: #a89984; + + --fg: #282828; + --fg1: #3c3836; + --fg2: #504945; + --fg3: #665c54; + --fg4: #7c6f64; + + --red: #9d0006; + --green: #79740e; + --yellow: #b57614; + --blue: #076678; + --purple: #8f3f71; + --aqua: #427b58; + --orange: #af3a03; + --gray: #928374; + + --red-dim: #cc2412; + --green-dim: #98971a; + --yellow-dim: #d79921; + --blue-dim: #458598; + --purple-dim: #b16286; + --aqua-dim: #689d6a; + --orange-dim: #d65d0e; + --gray-dim: #7c6f64; + + /* odoc colors */ + --odoc-blue: #5c9cf5; + --odoc-bg: #FFFFFF; + --odoc-bg1: #f6f8fa; + --odoc-fg: #333333; + --odoc-fg1: #1F2D3D; + +} + +@media (prefers-color-scheme: dark) { + :root { + /* dark gruvbox theme colors */ + --bg_h: #1d2021; + --bg: #282828; + --bg_s: #32302f; + --bg1: #3c3836; + --bg2: #504945; + --bg3: #665c54; + --bg4: #7c6f64; + + --fg: #fbf1c7; + --fg1: #ebdbb2; + --fg2: #d5c4a1; + --fg3: #bdae93; + --fg4: #a89984; + + --red: #fb4934; + --green: #b8bb26; + --yellow: #fabd2f; + --blue: #83a598; + --purple: #d3869b; + --aqua: #8ec07c; + --gray: #928374; + --orange: #fe8019; + + --red-dim: #cc2412; + --green-dim: #98971a; + --yellow-dim: #d79921; + --blue-dim: #458588; + --purple-dim: #b16286; + --aqua-dim: #689d6a; + --gray-dim: #a89984; + --orange-dim: #d65d0e; + + /* odoc colors */ + --odoc-blue: #5c9cf5; + --odoc-bg: #202020; + --odoc-bg1: #252525; + --odoc-fg: #bebebe; + --odoc-fg1: #777; + } +} + +:root { + --main-background: var(--odoc-bg); + --color: var(--odoc-fg); + --anchor-hover: var(--fg1); + --anchor-color: var(--bg2); + --xref-shadow: var(--red-dim); + --xref-unresolved: var(--blue-dim); + --header-shadow: var(--bg3); + --by-name-version-color: var(--bg4); + --by-name-nav-link-color: var(--fg2); + --target-background: color-mix(in srgb, var(--main-background) 70%, var(--odoc-blue) 30%); + --target-border: var(--odoc-blue); + --pre-border-color: var(--fg4); + --link-color: var(--odoc-blue); + --source-link-color: var(--fg4); + + + --toc-color: var(--fg); + --toc-before-color: var(--odoc-fg1); + --toc-background: var(--odoc-bg1); + --toc-list-border: var(--fg1); + + --hljs-bg: var(--code-background); + --hljs-link: var(--fg2); + --source-code-keyword: var(--orange); + --hljs-regexp: var(--yellow); + --hljs-title: var(--yellow-dim); + + --spec-label-color: var(--aqua); + --spec-summary-background: var(--code-background); + --spec-summary-border-color: var(--odoc-blue); + --spec-summary-hover-background: var(--odoc-bg1); + --spec-details-after-background: var(--odoc-bg1); + --spec-details-after-border: var(--fg3); + --search-results-border: var(--fg1); + --search-results-shadow: var(--bg3); + --search-highlight-color: var(--odoc-blue); + --search-snake-color: var(--odoc-blue); + /* code colors */ + --code-color: var(--fg); + --code-background: var(--bg); + --li-code-background: var(--bg); + --li-code-color: var(--fg); + + + --source-line-column: var(--fg3); + --source-line-column-bg: var(--bg_h); + + --source-code-comment: var(--gray); + --source-code-docstring: var(--green-dim); + --source-code-lident: var(--fg1); + --source-code-uident: var(--blue); + --source-code-literal: var(--yellow); + --source-code-keyword: var(--red); + --source-code-underscore: var(--fg3); + --source-code-operator: var(--purple); + --source-code-parens: var(--orange-dim); + --source-code-separator: var(--orange-dim); + + --hljs-variable: var(--yellow); + --hljs-literal: var(--red); + --hljs-name: var(--green-dim); + --hljs-tag: var(--fg4); + --hljs-attr: var(--purple); + --hljs-addition: var(--green-dim); + --hljs-addition-bg: color-mix(in srgb, var(--hljs-addition) 10%, var(--hljs-bg) 90%); + --hljs-deletion: var(--red-dim); + --hljs-deletion-bg: color-mix(in srgb, var(--hljs-deletion) 10%, var(--hljs-bg) 90%); + + + +} + +/* Reset a few things. */ + +html, body, div, span, applet, object, iframe, h1, h2, h3, h4, h5, h6, p, blockquote, pre, a, abbr, acronym, address, big, cite, code, del, dfn, em, img, ins, kbd, q, s, samp, small, strike, strong, sub, sup, tt, var, b, u, i, center, dl, dt, dd, ol, ul, li, fieldset, form, label, legend, table, caption, tbody, tfoot, thead, tr, th, td, article, aside, canvas, details, embed, figure, figcaption, footer, header, hgroup, menu, nav, output, ruby, section, summary, time, mark, audio, video { + padding: 0; + border: 0; + font: inherit; + vertical-align: baseline; + +} + +table { + border-collapse: collapse; + border-spacing: 0; +} + +*, *:before, *:after { + box-sizing: border-box; +} + +html { + font-size: 15px; + scroll-behavior: smooth; +} + +body { + text-align: left; + color: var(--color); + background-color: var(--main-background); + font-family: "Noticia Text", Georgia, serif; + line-height: 1.5; +} + +body { + margin-left: auto; + margin-right: auto; + padding: 0 4ex; + margin-top: 0; +} + +body.odoc { + max-width: 181ex; + display: grid; + grid-template-columns: min-content 1fr min-content; + grid-template-areas: + "search-bar nav ." + "toc-global preamble toc-local" + "toc-global content toc-local"; + column-gap: 4ex; + grid-template-rows: auto auto 1fr; +} + +body.odoc:has(> .odoc-search:focus-within) { + grid-template-areas: + "search-bar search-bar search-bar" + ". nav ." + "toc-global preamble toc-local" + "toc-global content toc-local"; +} + +body.odoc:not(:has(> .odoc-tocs .odoc-global-toc)) { + grid-template-areas: + "search-bar search-bar" + "nav ." + "preamble toc-local" + "content toc-local"; + grid-template-columns: 1fr min-content; +} + +/* When there is no global sidebar */ +body.odoc:not(:has(> .odoc-tocs .odoc-global-toc)) nav.odoc-nav { + padding-top: 0; +} + +/* When there is no global sidebbar and the searchbar is focused */ +body.odoc:not(:has(> .odoc-tocs .odoc-global-toc)) nav.odoc-nav:has(+ .odoc-search:focus-within) { + padding-top: var(--search-padding-top); +} + +nav.odoc-nav:has(+ .odoc-search:focus-within) { + padding-top: 0; +} + +body.odoc-src { + display: grid; + grid-template-columns: min-content 1fr; + grid-template-areas: + "search-bar nav " + "toc-global preamble" + "toc-global content "; + column-gap: 4ex; + grid-template-rows: auto auto 1fr; +} + +.odoc-content { + grid-area: content; +} + +.odoc-content > *:first-child { + margin-top: 0; +} + +.odoc-preamble > *:first-child { + /* This make the first thing in the preamble align with the sidebar */ + padding-top: 0; + margin-top: 0; +} + +/* Add margin after the preamble if it contains more than one element. */ +header.odoc-preamble:has(> :nth-child(2)) { + margin-bottom: 30px; +} + +header.odoc-preamble { + grid-area: preamble; +} + +nav { + font-family: "Fira Sans", sans-serif; +} + +nav.odoc-nav { + grid-area: nav; + padding-top: var(--search-padding-top); + padding-bottom: var(--search-padding-top); +} + +/* Basic markup elements */ + +b, strong { + font-weight: bold; +} + +i { + font-style: italic; +} + +em, i em.odd{ + font-style: italic; +} + +em.odd, i em { + font-style: normal; +} + +sup { + vertical-align: super; +} + +sub { + vertical-align: sub; +} + +sup, sub { + font-size: 12px; + line-height: 0; + margin-left: 0.2ex; +} + +ul, ol { + list-style-position: outside +} + +ul>li { + margin-left: 22px; +} + +ol>li { + margin-left: 27.2px; +} + +li>*:first-child { + margin-top: 0 +} + +/* Text alignements, this should be forbidden. */ + +.left { + text-align: left; +} + +.right { + text-align: right; +} + +.center { + text-align: center; +} + +/* Links and anchors */ + +a { + text-decoration: none; + color: var(--link-color); +} + +.odoc-src pre a { + color: inherit; +} + +a:hover:not(.img-link) { + box-shadow: 0 1px 0 0 var(--link-color); +} + +/* Linked highlight */ +*:target, .current_unit { + background-color: var(--target-background) !important; + border-radius: 1px; + border: var(--target-border) 1px solid !important; +} + +*:hover > a.anchor { + visibility: visible; +} + +a.anchor:before { + content: "#"; +} + +a.anchor:hover { + box-shadow: none; + text-decoration: none; + color: var(--anchor-hover); +} + +a.anchor { + visibility: hidden; + position: absolute; + /* top: 0px; */ + /* margin-left: -3ex; */ + margin-left: -1.3em; + font-weight: normal; + font-style: normal; + padding-right: 0.4em; + padding-left: 0.4em; + /* To remain selectable */ + color: var(--anchor-color); +} + +.spec > a.anchor { + margin-left: -2.3em; + padding-right: 0.9em; +} + +.xref-unresolved { + color: var(--xref-unresolved); +} +.xref-unresolved:hover { + box-shadow: 0 1px 0 0 var(--xref-shadow); +} + +/* Source links float inside preformated text or headings. */ +a.source_link { + float: right; + color: var(--source-link-color); + font-family: "Fira Sans", sans-serif; + font-size: initial; +} + +/* Section and document divisions. + Until at least 4.03 many of the modules of the stdlib start at .h7, + we restart the sequence there like h2 */ + +h1, h2, h3, h4, h5, h6, .h7, .h8, .h9, .h10 { + font-family: "Fira Sans", sans-serif; + font-weight: 400; + padding-top: 0.1em; + line-height: 1.2; + overflow-wrap: break-word; +} + +.odoc-preamble h1 { + margin-top: 10px; +} + +h1 { + font-weight: 500; + font-size: 2.441em; +} + +h1 { + font-weight: 500; + font-size: 1.953em; + box-shadow: 0 1px 0 0 var(--header-shadow); +} + +h2 { + font-size: 1.563em; +} + +h3 { + font-size: 1.25em; +} + +small, .font_small { + font-size: 0.8em; +} + +h1 code, h1 tt { + font-size: inherit; + font-weight: inherit; +} + +h2 code, h2 tt { + font-size: inherit; + font-weight: inherit; +} + +h3 code, h3 tt { + font-size: inherit; + font-weight: inherit; +} + +h3 code, h3 tt { + font-size: inherit; + font-weight: inherit; +} + +h4 { + font-size: 1.12em; +} + +/* Comment delimiters, hidden but accessible to screen readers and + selected for copy/pasting */ + +/* Taken from bootstrap */ +/* See also https://stackoverflow.com/a/27769435/4220738 */ +.comment-delim { + position: absolute; + width: 1px; + height: 1px; + padding: 0; + margin: -1px; + overflow: hidden; + clip: rect(0, 0, 0, 0); + white-space: nowrap; + border: 0; +} + +/* Preformatted and code */ + +tt, code, pre { + font-family: "Fira Mono", monospace; + font-weight: 400; +} + +.odoc pre { + padding: 0.1em; + border: 1px solid var(--pre-border-color); + border-radius: 5px; + overflow-x: auto; + text-indent: initial; +} + +.odoc p code, +.odoc li code { + background-color: var(--li-code-background); + color: var(--li-code-color); + border-radius: 3px; + padding: 0 0.3ex; +} + +p a > code, li a > code { + color: var(--link-color); +} + +.odoc code { + white-space: pre-wrap; +} + +/* Code blocks (e.g. Examples) */ + +.odoc pre code { + font-size: 0.893rem; +} + +/* Code lexemes */ + +.keyword { + font-weight: 500; +} + +.arrow { white-space: nowrap } + +/* Module member specification */ + +.spec { + background-color: var(--spec-summary-background); + border-radius: 3px; + border-left: 4px solid var(--spec-summary-border-color); + border-right: 5px solid transparent; + padding: 0.35em 0.5em; +} + +.spec .label, .spec .optlabel { + color: var(--spec-label-color); +} + +li:not(:last-child) > .def-doc { + margin-bottom: 15px; +} + +/* Spacing between items */ +div.odoc-spec,.odoc-include { + margin-bottom: 2em; +} + +.spec.type .variant p, .spec.type .record p { + margin: 5px; +} + +.spec.type .variant, .spec.type .record { + margin-left: 2ch; +} + +.spec.type li.variant, .spec.type li.record { + list-style: none; +} + +.spec.type .record > code, .spec.type .variant > code { + min-width: 40%; +} + +.spec.type > ol { + margin-top: 0; + margin-bottom: 0; +} + +.spec.type .record > .def-doc, .spec.type .variant > .def-doc { + min-width:50%; + padding: 0.25em 0.5em; + margin-left: 10%; + border-radius: 3px; + background: var(--main-background); + box-shadow: 1px 1px 2px lightgrey; +} + +div.def { + margin-top: 0; + text-indent: -2ex; + padding-left: 2ex; +} + +div.def-doc>*:first-child { + margin-top: 0; +} + +/* Collapsible inlined include and module */ + +.odoc-include details { + position: relative; +} + +.odoc-include.shadowed-include { + display: none; +} + +.odoc-include details:after { + z-index: -100; + display: block; + content: " "; + position: absolute; + border-radius: 0 1ex 1ex 0; + right: -20px; + top: 1px; + bottom: 1px; + width: 15px; + background: var(--spec-details-after-background, rgba(0, 4, 15, 0.05)); + box-shadow: 0 0px 0 1px var(--spec-details-after-border, rgba(204, 204, 204, 0.53)); +} + +.odoc-include summary { + position: relative; + margin-bottom: 1em; + cursor: pointer; + outline: none; +} + +.odoc-include summary:hover { + background-color: var(--spec-summary-hover-background); +} + +/* FIXME: Does not work in Firefox. */ +.odoc-include summary::-webkit-details-marker { + color: #888; /* todo : use color from palette */ + transform: scaleX(-1); + position: absolute; + top: calc(50% - 5px); + height: 11px; + right: -29px; +} + +/* Records and variants FIXME */ + +div.def table { + text-indent: 0em; + padding: 0; + margin-left: -2ex; +} + +td.def { + padding-left: 2ex; +} + +td.def-doc *:first-child { + margin-top: 0em; +} + +/* Lists of @tags */ + +.at-tags { list-style-type: none; margin-left: -3ex; } +.at-tags li { padding-left: 3ex; text-indent: -3ex; } +.at-tags .at-tag { text-transform: capitalize } + +/* Alert emoji */ + +.alert::before, .deprecated::before { + content: '⚠️ ' / ''; +} + +/* Since emoji */ + +.since::before { + content: '🕚 ' / ''; +} + +/* Lists of modules */ + +.modules { list-style-type: none; margin-left: -3ex; } +.modules li { padding-left: 3ex; text-indent: -3ex; margin-top: 5px } +.modules .synopsis { padding-left: 1ch; } + +/* Odig package index */ + +.packages { list-style-type: none; margin-left: -3ex; } +.packages li { padding-left: 3ex; text-indent: -3ex } +.packages li a.anchor { padding-right: 0.5ch; padding-left: 3ch; } +.packages .version { font-size: 10px; color: var(--by-name-version-color); } +.packages .synopsis { padding-left: 1ch } + +.by-name nav a { + text-transform: uppercase; + font-size: 18px; + margin-right: 1ex; + color: var(--by-name-nav-link-color,); + display: inline-block; +} + +.by-tag nav a { + margin-right: 1ex; + color: var(--by-name-nav-link-color); + display: inline-block; +} + +.by-tag ol { list-style-type: none; } +.by-tag ol.tags li { margin-left: 1ch; display: inline-block } +.by-tag td:first-child { text-transform: uppercase; } + +/* Odig package page */ + +.package nav, h1 nav { + display: inline; + font-size: 14px; + font-weight: normal; +} + +.package .version, h1 .version { + font-size: 14px; +} + +.package.info { + margin: 0; +} + +.package.info td:first-child { + font-style: italic; + padding-right: 2ex; +} + +.package.info ul { + list-style-type: none; + display: inline; + margin: 0; +} + +.package.info li { + display: inline-block; + margin: 0; + margin-right: 1ex; +} + +#info-authors li, #info-maintainers li { + display: block; +} + +/* Sidebar and TOC */ + +.odoc-toc:before { + display: block; + content: "Contents"; + text-transform: uppercase; + font-size: 1em; + margin: 1.414em 0 0.5em; + font-weight: 500; + color: var(--toc-before-color); + line-height: 1.2; +} + +.odoc-toc.odoc-local-toc:before { + content: "Local content"; + +} +.odoc-toc.odoc-global-toc:before { + content: "Global content"; +} + +/* When a search bar is present, we need the sticky sidebar to be a bit lower, + so `top` is higher */ + +body.odoc:has( .odoc-search) .odoc-toc { + --toc-top: calc(var(--search-bar-height) + 2 * var(--search-padding-top)); + max-height: calc(100vh - 2 * var(--toc-top)); + top: var(--toc-top) +} + +.odoc-tocs { + display: contents; +} + +.odoc-local-toc { + grid-area: toc-local; +} + +.odoc-global-toc { + grid-area: toc-global; +} + +.odoc-toc { + --toc-top: 20px; + width: 42ex; + background: var(--toc-background); + overflow: auto; + color: var(--toc-color); + padding-left: 2ex; + padding-right: 2ex; + height: fit-content; + border: solid 1px var(--border); + border-radius: 5px; + position:sticky; + max-height: calc(100vh - 2 * var(--toc-top)); + top: var(--toc-top) +} + +.odoc-toc ul li a { + font-family: "Fira Sans", sans-serif; + font-size: 0.95em; + color: var(--color); + font-weight: 400; + line-height: 1.2em; + display: block; +} + +.odoc-toc.odoc-global-toc > ul > li { + margin-left:0; +} + +.odoc-toc.odoc-global-toc > ul > li > ul > li { + margin-left:0; + padding-left:0; + border: 0; + margin-top: 10px; + margin-bottom: 10px; +} + +.odoc-toc.odoc-global-toc > ul > li > ul > li { + font-weight: 500; +} + +.odoc-toc.odoc-global-toc > ul > li > ul > li > a { + font-weight: inherit; + font-size: inherit; +} + +.odoc-toc.odoc-global-toc > ul > li > a { + font-size: 1.2em; +} + +:root { + --search-bar-height: 25px; + --search-padding-top: 1rem; +} + +.odoc-search { + position: sticky; + top: 0; + background: var(--main-background); + /* This amounts to fit-content when the search is not active, but when you + have the search results displayed, you do not want the height of the search + container to change. */ + height: calc(var(--search-bar-height) + 2 * var(--search-padding-top)); + width: 100%; + padding-top: var(--search-padding-top); + padding-bottom: var(--search-padding-top); + z-index: 1; + grid-area: search-bar; + +} + + +.odoc-search .search-inner { + width: 100%; + position: relative; + left: 0; + display: grid; + /* The second column is for the search snake, which has 0 width */ + grid-template-columns: 1fr 0fr; + grid-row-gap: 1rem; + /* The second row is for the search results. It has a width, but only */ + grid-template-rows: min-content 0px; + background: transparent; +} + +.odoc-search .search-bar { + position: relative; + z-index: 2; + font-size: 1em; + transition: font-size 0.3s; + box-shadow: 0px 0px 0.2rem 0.3em var(--main-background); + height: var(--search-bar-height); + border: 1px solid var(--fg4); + /* inputs are of fixed size by default, even if you display:block them */ + width: 100%; + color: var(--odoc-fg); + background: var(--odoc-bg1); + border-radius: 5px; + outline: none; +} + +.odoc-search:focus-within { + width: 100%; +} + +.odoc-search:focus-within .search-bar { + font-size: 1.1em; + border-color: var(--search-highlight-color); +} + +.search-bar:focus-visible { + outline: 2px solid var(--search-highlight-color); +} + +.search-bar::placeholder { + color: var(--fg3); +} + +.odoc-search:not(:focus-within) .search-result { + display: none; +} + +.odoc-search .search-result:empty { + display: none; +} + +.odoc-search .search-result { + grid-row: 2; + background: var(--toc-background); + position: absolute; + left: 0; + right: 0; + border: solid; + border-color: var(--search-results-border); + border-width: 1px; + border-radius: 6px; + box-shadow: 0 3px 10px 2px var(--search-results-shadow), 0 0 3px 4px var(--main-background), 0px -1rem 0px 0px var(--main-background); + /* Works better on smallish screens with this */ + max-height: calc(min(40rem, 50vh)); + overflow-y: auto; +} + + +.odoc-search .search-no-result { + color: var(--color); + border-bottom: var(--search-results-border) solid 1px; + background-color: inherit; + outline: 0; + padding: 10px; + padding-right: 0.5rem; +} + +.search-bar-container { + display: flex; + align-items: stretch; + border-bottom: 1rem solid var(--main-background); +} + +.search-snake { + grid-row: 1; + grid-column: 2; + display: flex; + align-items: center; + width: 0; + z-index: 2; + position: relative; + left: 0; + margin-top: 4px; + margin-bottom: 4px; + /* Otherwise the search snake flickers for very fast searches. */ + transition: opacity 0.2s; + opacity: 0; +} + +.search-snake.search-busy { + opacity: 1; +} + +.search-snake:before { + content: " "; + display: block; + aspect-ratio: 1 / 1; + height: 100%; + margin-right: 4px; + border-radius: 50%; + border: 3px solid #aaa; + border-color: var(--search-snake-color) transparent var(--search-snake-color) transparent; + animation: search-snake 1.2s linear infinite; + position: absolute; + right: 0; +} + +@keyframes search-snake { + 0% { + transform: rotate(0deg); + } + + 100% { + transform: rotate(360deg); + } +} + +:root { + --kind-font-size-factor: 0.8; +} + +.odoc-search .search-entry { + color: var(--color); + display: grid; + /* Possible kinds are the following : + "doc" "type" "mod" "exn" "class" "meth" "cons" "sig" "cons" "field" "val" + and "ext". + As the longest is 5 characters (and the font monospace), we give 5 + character size to the column. However the font used for kind is a little + smaller, so we adjust by this factor. + */ + grid-template-columns: [kinds] calc(var(--kind-font-size-factor) * 5ch) [titles] 1fr; + column-gap: 0.5rem; + border-bottom: var(--search-results-border) solid 1px; + background-color: inherit; + outline: 0; + padding: 0.4rem 0.4rem 0.7rem 0.7rem; +} +.odoc-search .search-entry p { + margin: 0; + overflow: hidden; + text-overflow: ellipsis; + white-space: nowrap; +} + +.odoc-search .search-result .search-entry:focus-visible { + box-shadow: none; + background-color: var(--target-background); +} + +.odoc-search .search-entry:hover { + box-shadow: none; + background-color: var(--main-background); +} + +.odoc-search .search-entry .entry-kind { + grid-row: 1/2; + grid-column: 1/2; + line-height: 1.4rem; + font-size: calc(var(--kind-font-size-factor) * 1em); + font-weight: bold; + text-align: right; + position: relative; + bottom: 0; +} + +.odoc-search .search-entry pre { + border: none; + margin: 0; +} + +.odoc-search .search-entry pre code { + font-size: 1em; + background-color: var(--code-background); + color: var(--code-color); + border-radius: 3px; + padding: 0 0.3ex; +} + +.odoc-search .search-entry .entry-title { + width: 100%; + display: block; + grid-column: 2/2; + grid-row: 1/2; + align-self: end; + line-height: 1.4rem; + white-space: nowrap; + overflow: hidden; + text-overflow: ellipsis; +} + +.odoc-search .entry-name { + font-weight: bold; +} + +.odoc-search .prefix-name { + font-weight: bold; +} + +.odoc-search .search-entry .prefix-name { + opacity: 0.7; +} + +.odoc-search .entry-rhs { + white-space: nowrap; +} + +.odoc-search .search-entry .entry-content { + flex-grow: 1; + flex-shrink: 1; + min-width: 0; +} + +.odoc-search .search-entry .entry-comment { + max-height: 1.5em; + overflow: hidden; + text-overflow: ellipsis; + white-space: nowrap; + font-size: 0.95em; + grid-row: 2/2; + grid-column: 2/2; +} + +.odoc-search .search-entry .entry-comment ul { + white-space: nowrap; + display: inline; +} + +.odoc-search .search-entry .entry-comment li { + display: inline; + white-space: nowrap; +} + +.odoc-search .search-entry .entry-comment ul>li::before { + content: '•'; +} + +.odoc-search .search-entry .entry-comment div { + display: inline; + white-space: nowrap; +} + +.odoc-search .search-entry .entry-comment p { + display: inline; + white-space: nowrap; +} + +.odoc-search .search-entry .entry-comment code { + display: inline; + white-space: nowrap; +} + +/* First level titles */ + +.odoc-toc>ul>li>a { + font-weight: 500; +} + +.odoc-toc ul li ul { + margin: 0px; + padding-top: 0.25em; +} + +.odoc-toc ul { + list-style-type: none; +} + +.odoc-toc ul li { + padding: 0.25em 0; +} + +.odoc-toc>ul>li { + margin-left: 0; + margin-bottom: 0.3em; +} + +.odoc-toc ul li li { + border-left: 1px solid var(--toc-list-border); + margin-left: 5px; + padding-left: 12px; +} + +/* Tables */ + +.odoc-table { + margin: 1em; +} + +.odoc-table td, +.odoc-table th { + padding-left: 0.5em; + padding-right: 0.5em; + border: 1px solid black; +} + +.odoc-table th { + font-weight: bold; +} + +/* Mobile adjustements. */ + +@media only screen and (max-width: 210ex) { + body.odoc { + max-width: 132ex; + grid-template-areas: + "search-bar nav" + "sidebar preamble" + "sidebar content"; + } + body.odoc .odoc-tocs { + display: flex; + grid-area: sidebar; + flex-direction : column; + gap: 20px; + } + body.odoc .odoc-tocs .odoc-toc { + position: unset; + max-height: unset; + } + body.odoc:has(.odoc-search:focus-within) { + grid-template-areas: + "search-bar search-bar" + ". nav" + "sidebar preamble" + "sidebar content"; + } +} + +@media only screen and (max-width: 110ex) { + body.odoc { + margin: 2em; + padding: 0; + grid-template-areas: + "search-bar" + "nav" + "preamble" + "toc-local" + "content" + "toc-global"; + grid-template-columns: 1fr; + } + body.odoc:has(> .odoc-search:focus-within) { + /* This is the same as when there is no focus on the search bar, this is + just to prevent the default "wide layout" rule from changing anything. */ + grid-template-areas: + "search-bar" + "nav" + "preamble" + "toc-local" + "content" + "toc-global"; + grid-template-columns: 1fr; + } + body.odoc .odoc-search { + position: relative; + height: calc(var(--search-bar-height) + 2 * var(--search-padding-top)); + } + body.odoc nav.odoc-nav { + padding-top: 0; + padding-bottom: var(--search-padding-top); + } + body.odoc .odoc-tocs { + display: contents; + } + body.odoc .odoc-tocs .odoc-toc { + position: static; + width: auto; + min-width: unset; + max-width: unset; + max-height: unset; + border: none; + padding: 0.2em 1em; + border-radius: 5px; + margin-bottom: 2em; + } +} + +/* Print adjustements. */ + +@media print { + body { + color: black; + background: white; + } + + body nav:first-child { + visibility: hidden; + } +} + +/* Source code. */ + +.source_container { + display: flex; + grid-area: content; + margin-top: 0; +} + +.source_line_column { + padding-right: 0.5em; + text-align: right; + color: var(--source-line-column); + background: var(--source-line-column-bg); +} + +.source_line { + padding: 0 1em; +} + +.source_code { + flex-grow: 1; + background: var(--code-background); + padding: 0 0.3em; + color: var(--code-color); +} + +/* Source directories */ + +.odoc-directory::before { + content: "📁"; + margin: 0.3em; + font-size: 1.3em; +} + +.odoc-file::before { + content: "📄"; + margin: 0.3em; + font-size: 1.3em; +} + +.odoc-folder-list { + list-style: none; +} + +/* Syntax highlighting (based on github-gist) */ + +.hljs { + display: block; + background: var(--code-background); + padding: 0.5em; + color: var(--color); + overflow-x: auto; +} + +.hljs-comment, +.hljs-meta { + color: var(--source-code-comment); +} + +.hljs-string, +.hljs-variable, +.hljs-template-variable, +.hljs-strong, +.hljs-emphasis, +.hljs-quote, +.hljs-literal { + color: var(--source-code-literal); +} + +.hljs-keyword, +.hljs-selector-tag { + color: var(--source-code-keyword); +} + +.hljs-type, +.hljs-class .hljs-title { + color: var(--source-code-uident); + font-weight: 500; +} + +.hljs-symbol, +.hljs-bullet, +.hljs-attribute { + color: var(--hljs-literal); +} + +.hljs-section, +.hljs-name { + color: var(--hljs-name); +} + +.hljs-tag { + color: var(--hljs-tag); +} + +.hljs-attr, +.hljs-selector-id, +.hljs-selector-class, +.hljs-selector-attr, +.hljs-selector-pseudo { + color: var(--hljs-attr); +} + +.hljs-addition { + color: var(--hljs-addition); + background-color: var(--hljs-addition-bg); +} + +.hljs-deletion { + color: var(--hljs-deletion); + background-color: var(--hljs-deletion-bg); +} + +.hljs-link { + text-decoration: underline; +} + +/* Keywords */ +.AND, .ANDOP, .AS, .ASSERT, +.BAR, .BEGIN, +.CLASS, .CONSTRAINT, +.DO, .DONE, .DOWNTO, +.ELSE, .END, .EXCEPTION, .EXTERNAL, +.FOR, .FUN, .FUNCTION, .FUNCTOR, +.IF, .IN, .INCLUDE, .INHERIT, .INITIALIZER, +.LAZY, .LESSMINUS, .LET, .LETOP, +.MATCH, .METHOD, .MINUSGREATER, .MODULE, .MUTABLE, +.NEW, .NONREC, +.OBJECT, .OF, .OPEN, +.PERCENT, .PRIVATE, +.REC, +.SEMISEMI, .SIG, .STRUCT, +.THEN, .TO, .TRY, .TYPE, +.VAL, .VIRTUAL, +.WHEN, .WITH, .WHILE +{ + color: var(--source-code-keyword);; +} + +/* Separators */ +.COMMA, .COLON, .COLONGREATER, .SEMI { + color: var(--source-code-separator); +} + +/* Parens + `begin` and `end ` are excluded because `end` is used in other, more + keyword-y contexts*/ +.BARRBRACKET, +.LBRACE, +.LBRACELESS, +.LBRACKET, +.LBRACKETAT, +.LBRACKETATAT, +.LBRACKETATATAT, +.LBRACKETBAR, +.LBRACKETGREATER, +.LBRACKETLESS, +.LBRACKETPERCENT, +.LBRACKETPERCENTPERCENT, +.LPAREN, +.RBRACE, +.RBRACKET, +.RPAREN +{ + color: var(--source-code-parens); +} + +/* Prefix operators */ +.ASSERT, .BANG, .PREFIXOP, +/* Infix operators. + A choice had to be made for equal `=` which is both a keyword and an operator. + It looked better having it as an operator, because when it is a keyword, + there are already loads of keyword around. + It would look even nicer if there was a way to distinguish between these + two cases.*/ +.INFIXOP0, .INFIXOP1, .INFIXOP2, .INFIXOP3, .INFIXOP4, +.BARBAR, .PLUS, .STAR, .AMPERAMPER, .AMPERAND, .COLONEQUAL, .GREATER, .LESS, +.MINUS, .MINUSDOT, .MINUSGREATER, .OR, .PLUSDOT, .PLUSEQ, .EQUAL +{ + color: var(--source-code-operator); +} + +/* Upper case ident + `true` and `false` are considered uident here, because you can bind them in a + constructor defintion : + ```ocaml + type my_bool = + | true of string + | false + | Other of int + ``` +*/ +.UIDENT, .COLONCOLON, .TRUE, .FALSE { + color: var(--source-code-uident); + +} + +/* Lower case idents. + Quotes are here because of `type 'a t = 'a list`, + and question mark and tildes because of + ```ocaml + let f ~a ?b () = Option.map a b + ``` +*/ +.LIDENT, .QUESTION, .QUOTE, .TILDE { + color: var(--source-code-lident); +} + +/* Litterals */ + .STRING, .CHAR, .INT, .FLOAT, .QUOTED_STRING_EXPR, .QUOTED_STRING_ITEM { + color: var(--source-code-literal); +} + +.UNDERSCORE { + color: var(--source-code-underscore); +} + +.DOCSTRING { + color: var(--source-code-docstring); +} + +.COMMENT { + color: var(--source-code-comment); +} + +/*--------------------------------------------------------------------------- + Copyright (c) 2016 The odoc contributors + + Permission to use, copy, modify, and/or distribute this software for any + purpose with or without fee is hereby granted, provided that the above + copyright notice and this permission notice appear in all copies. + + THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES + WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF + MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR + ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES + WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN + ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF + OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. + ---------------------------------------------------------------------------*/ diff --git a/odoc_search.js b/odoc_search.js new file mode 100644 index 0000000..79b86bd --- /dev/null +++ b/odoc_search.js @@ -0,0 +1,150 @@ +/* The browsers interpretation of the CORS origin policy prevents to run + webworkers from javascript files fetched from the file:// protocol. This hack + is to workaround this restriction. */ +function createWebWorker() { + var searchs = search_urls.map((search_url) => { + let parts = document.location.href.split("/"); + parts[parts.length - 1] = search_url; + return '"' + parts.join("/") + '"'; + }); + blobContents = ["importScripts(" + searchs.join(",") + ");"]; + var blob = new Blob(blobContents, { type: "application/javascript" }); + var blobUrl = URL.createObjectURL(blob); + + var worker = new Worker(blobUrl); + URL.revokeObjectURL(blobUrl); + + return worker; +} + +var worker; +var waiting = 0; + +function wait() { + waiting = waiting + 1; + document.querySelector(".search-snake").classList.add("search-busy"); +} + +function stop_waiting() { + if (waiting > 0) waiting = waiting - 1; + else waiting = 0; + if (waiting == 0) { + document.querySelector(".search-snake").classList.remove("search-busy"); + } +} + +document.querySelector(".search-bar").addEventListener("focus", (ev) => { + if (typeof worker == "undefined") { + worker = createWebWorker(); + worker.onmessage = (e) => { + stop_waiting(); + let results = e.data; + let search_results = document.querySelector(".search-result"); + search_results.innerHTML = ""; + let f = (entry) => { + let search_result = document.createElement("a"); + search_result.classList.add("search-entry"); + search_result.href = base_url + entry.url; + search_result.innerHTML = entry.html; + search_results.appendChild(search_result); + }; + results.forEach(f); + let search_request = document.querySelector(".search-bar").value; + if (results.length == 0 && search_request != "") { + let no_result = document.createElement("div"); + no_result.classList.add("search-no-result"); + no_result.innerText = "No result..."; + search_results.appendChild(no_result); + } + }; + } +}); + +document.querySelector(".search-bar").addEventListener("input", (ev) => { + wait(); + worker.postMessage(ev.target.value); +}); + + +/** Navigation */ + +let search_result_elt = document.querySelector(".search-result") + +function search_results() { + return search_result_elt.children; +} + +function enter_search() { + document.querySelector(".search-bar").focus(); +} + +function escape_search() { + document.activeElement.blur() +} + +function focus_previous_result() { + let results = Array.from(search_results()); + let current_focus = results.findIndex((elt) => (document.activeElement === elt)); + if (current_focus === -1) + return; + else if (current_focus === 0) + enter_search(); + else + results[current_focus - 1].focus(); +} + +function focus_next_result() { + let results = Array.from(search_results()); + if (results.length === 0) return; + let current_focus = results.findIndex((elt) => (document.activeElement === elt)); + if (current_focus === -1) + results[0].focus(); + else if (current_focus + 1 === results.length) + return; + else + results[current_focus + 1].focus(); +} + + +function is_searching() { + return (document.querySelectorAll(".odoc-search:focus-within").length > 0); +} + +function is_typing() { + return (document.activeElement === document.querySelector(".search-bar")); +} + +function handle_key_down(event) { + if (is_searching()) { + if (event.key === "ArrowUp") { + event.preventDefault(); + focus_previous_result(); + } + if (event.key === "ArrowDown") { + event.preventDefault(); + focus_next_result(); + } + if (event.key === "Escape") { + event.preventDefault(); + escape_search(); + } + } + if (!(is_typing())) { + let ascii = event.key.charCodeAt(0); + if (event.key === "/") { + event.preventDefault(); + enter_search(); + } + else if ( is_searching() + && event.key.length === 1 + && ( (ascii >= 65 && ascii <= 90) // lowercase letter + || (ascii >= 97 && ascii <= 122) // uppercase letter + || (ascii >= 48 && ascii <= 57) // numbers + || (ascii >= 32 && ascii <= 46) // ` ` to `.` + || (ascii >= 58 && ascii <= 64)) // `:` to `@` + ) + // We do not prevent default because we want the char to be added to the input + enter_search (); + } +} +document.addEventListener("keydown", handle_key_down); diff --git a/picos/Picos/Computation/Tx/index.html b/picos/Picos/Computation/Tx/index.html new file mode 100644 index 0000000..e220a37 --- /dev/null +++ b/picos/Picos/Computation/Tx/index.html @@ -0,0 +1,7 @@ + +Tx (picos.Picos.Computation.Tx)

    Module Computation.Tx

    Transactional interface for atomically completing multiple computations.

    ⚠️ The implementation of this mechanism is designed to avoid making the single computation completing operations, i.e. try_return and try_cancel, slower and to avoid making computations heavier. For this reason the transaction mechanism is only obstruction-free. What this means is that a transaction may be aborted by another transaction or by a single computation manipulating operation.

    type 'a computation := 'a t

    Destructively substituted alias for Computation.t.

    val same : _ computation -> _ computation -> bool

    same computation1 computation2 determines whether the two computations are the one and the same.

    type t

    Represents a transaction.

    val create : unit -> t

    create () returns a new empty transaction.

    val try_return : t -> 'a computation -> 'a -> bool

    try_return tx computation value adds the completion of the computation as having returned the given value to the transaction. Returns true in case the computation had not yet been completed and the transaction was still alive. Otherwise returns false which means that transaction was aborted and it is as if none of the completions succesfully added to the transaction have taken place.

    val try_cancel : + t -> + 'a computation -> + exn -> + Stdlib.Printexc.raw_backtrace -> + bool

    try_cancel tx computation exn bt adds the completion of the computation as having canceled with the given exception and backtrace to the transaction. Returns true in case the computation had not yet been completed and the transaction was still alive. Otherwise returns false which means that transaction was aborted and it is as if none of the completions succesfully added to the transaction have taken place.

    val try_commit : t -> bool

    try_commit tx attempts to mark the transaction as committed successfully. Returns true in case of success, which means that all the completions added to the transaction have been performed atomically. Otherwise returns false which means that transaction was aborted and it is as if none of the completions succesfully added to the transaction have taken place.

    diff --git a/picos/Picos/Computation/index.html b/picos/Picos/Computation/index.html new file mode 100644 index 0000000..cd15c81 --- /dev/null +++ b/picos/Picos/Computation/index.html @@ -0,0 +1,47 @@ + +Computation (picos.Picos.Computation)

    Module Picos.Computation

    A cancelable computation.

    A computation basically holds the status, i.e.

    • running,
    • returned, or
    • canceled,

    of some sort of computation and most importantly allows anyone to be notified when the status of the computation changes from running to completed.

    A hopefully enlightening analogy is that a computation is a kind of single-shot atomic event.

    Another hopefully helpful analogy is that a computation is basically like a cancelable promise and a basic non-cancelable promise can be implemented trivially on top of a computation.

    To define a computation, one first creates it and then arranges for the computation to be completed by returning a value through it or by canceling it with an exception at some point in the future. There are no restrictions on what it means for a computation to be running. The cancelation status of a computation can be polled or checked explicitly. Observers can also attach triggers to a computation to get a signal when the computation is completed or await the computation.

    Here is an example:

      run begin fun () ->
+    Flock.join_after @@ fun () ->
+
+    let computation =
+      Computation.create ()
+    in
+
+    let canceler = Flock.fork_as_promise @@ fun () ->
+      Fiber.sleep ~seconds:1.0;
+
+      Computation.cancel computation
+        Exit (Printexc.get_callstack 0)
+    in
+
+    Flock.fork begin fun () ->
+      let rec fib i =
+        Computation.check
+          computation;
+        if i <= 1 then
+          i
+        else
+          fib (i - 1) + fib (i - 2)
+      in
+      Computation.capture computation
+        fib 10;
+
+      Promise.terminate canceler
+    end;
+
+    Computation.await computation
+  end

    A fiber is always associated with at least a single computation. However, it is possible for multiple fibers to share a single computation and it is also possible for a single fiber to perform multiple computations. Furthermore, the computation associated with a fiber can be changed by the fiber.

    Computations are not hierarchical. In other words, computations do not directly implement structured concurrency. However, it is possible to propagate cancelation to implement structured concurrency on top of computations.

    Operations on computations are either wait-free or lock-free and designed to avoid starvation and complete in amortized constant time. The properties of operations to complete a computation depend on the properties of actions attached to the triggers.

    Interface for creating

    type !'a t

    Represents a cancelable computation. A computation is either running or has been completed either with a return value or with canceling exception with a backtrace.

    ℹ️ Once a computation becomes completed it no longer changes state.

    🏎️ A computation that has been completed is a small object that only holds onto the return value or the canceling exception with a backtrace.

    ⚠️ In the running state a computation may refer to any number of triggers and it is important to make sure that any triggers attached to a computation are detached when they are no longer needed unless the computation has been completed.

    val create : ?mode:[ `FIFO | `LIFO ] -> unit -> 'a t

    create () creates a new computation in the running state.

    The optional mode specifies the order in which triggers attached to the computation will be signaled after the computation has been completed. `FIFO ordering may reduce latency of IO bound computations and is the default. `LIFO may improve thruput of CPU bound computations and be preferable on a work-stealing scheduler, for example.

    ℹ️ Typically the creator of a computation object arranges for the computation to be completed by using the capture helper, for example. However, it is possible and safe to race multiple threads of execution to complete a computation.

    val returned : 'a -> 'a t

    returned value returns a constant computation that has returned the given value.

    val finished : unit t

    finished is a constant finished computation.

    val try_return : 'a t -> 'a -> bool

    try_return computation value attempts to complete the computation with the specified value and returns true on success. Otherwise returns false, which means that the computation had already been completed before.

    val return : 'a t -> 'a -> unit

    return computation value is equivalent to try_return computation value |> ignore.

    val try_finish : unit t -> bool

    try_finish computation is equivalent to try_return computation ().

    val finish : unit t -> unit

    finish computation is equivalent to try_finish computation |> ignore.

    val try_capture : 'a t -> ('b -> 'a) -> 'b -> bool

    try_capture computation fn x calls fn x and tries to complete the computation with the value returned or the exception raised by the call and returns true on success. Otherwise returns false, which means that the computation had already been completed before.

    val capture : 'a t -> ('b -> 'a) -> 'b -> unit

    capture computation fn x is equivalent to try_capture computation fn x |> ignore.

    module Tx : sig ... end

    Transactional interface for atomically completing multiple computations.

    Interface for canceling

    type packed =
    1. | Packed : 'a t -> packed

    An existential wrapper for computations.

    val try_cancel : 'a t -> exn -> Stdlib.Printexc.raw_backtrace -> bool

    try_cancel computation exn bt attempts to mark the computation as canceled with the specified exception and backtrace and returns true on success. Otherwise returns false, which means that the computation had already been completed before.

    val cancel : 'a t -> exn -> Stdlib.Printexc.raw_backtrace -> unit

    cancel computation exn bt is equivalent to try_cancel computation exn bt |> ignore.

    Interface for timeouts

    val cancel_after : + 'a t -> + seconds:float -> + exn -> + Stdlib.Printexc.raw_backtrace -> + unit

    cancel_after ~seconds computation exn bt arranges to cancel the computation after the specified time with the specified exception and backtrace. Completion of the computation before the specified time effectively cancels the timeout.

    ℹ️ The behavior is that cancel_after first checks that seconds is not negative, and then

    • on OCaml 5, cancel_after will perform the Cancel_after effect, and
    • on OCaml 4, cancel_after will call the cancel_after operation of the current handler.
    • raises Invalid_argument

      if seconds is negative or too large as determined by the scheduler.

    Interface for polling

    val is_running : 'a t -> bool

    is_running computation determines whether the computation is in the running state meaning that it has not yet been completed.

    val is_canceled : 'a t -> bool

    is_canceled computation determines whether the computation is in the canceled state.

    val canceled : 'a t -> (exn * Stdlib.Printexc.raw_backtrace) option

    canceled computation returns the exception that the computation has been canceled with or returns None in case the computation has not been canceled.

    val check : 'a t -> unit

    check computation is equivalent to Option.iter (fun (exn, bt) -> Printexc.raise_with_backtrace exn bt) (canceled computation).

    val peek : 'a t -> ('a, exn * Stdlib.Printexc.raw_backtrace) result option

    peek computation returns the result of the computation or None in case the computation has not completed.

    exception Running

    Exception raised by peek_exn when it's used on a still running computation. This should never be surfaced to the user.

    val peek_exn : 'a t -> 'a

    peek_exn computation returns the result of the computation or raises an exception. It is important to catch the exception. If the computation was cancelled with exception exn then exn is re-raised with its original backtrace.

    • raises Running

      if the computation has not completed.

    Interface for awaiting

    val try_attach : 'a t -> Trigger.t -> bool

    try_attach computation trigger tries to attach the trigger to be signaled on completion of the computation and returns true on success. Otherwise returns false, which means that the computation has already been completed or the trigger has already been signaled.

    ⚠️ Always detach a trigger after it is no longer needed unless the computation is known to have been completed.

    val detach : 'a t -> Trigger.t -> unit

    detach computation trigger signals the trigger and detaches it from the computation.

    🏎️ The try_attach and detach operations essentially implement a lock-free bag. While not formally wait-free, the implementation is designed to avoid starvation by making sure that any potentially expensive operations are performed cooperatively.

    val await : 'a t -> 'a

    await computation waits for the computation to complete and either returns the value of the completed computation or raises the exception the computation was canceled with.

    ℹ️ If the computation has already completed, then await returns or raises immediately without performing any effects.

    val wait : _ t -> unit

    wait computation waits for the computation to complete.

    Interface for propagating cancelation

    val canceler : from:_ t -> into:_ t -> Trigger.t

    canceler ~from ~into creates a trigger that propagates cancelation from one computation into another on signal. The returned trigger is not attached to any computation.

    The caller usually attaches the returned trigger to the computation from which cancelation is to be propagated and the trigger should usually also be detached after it is no longer needed. See also attach_canceler.

    The intended use case of canceler is as a low level building block of structured concurrency mechanisms. Picos does not require concurrent programming models to be hierarchical or structured.

    ⚠️ The returned trigger will be in the awaiting state, which means that it is an error to call Trigger.await or Trigger.on_signal on it.

    val attach_canceler : from:_ t -> into:_ t -> Trigger.t

    attach_canceler ~from ~into tries to attach a canceler to the computation from to propagate cancelation to the computation into and returns the canceler when successful. If the computation from has already been canceled, the exception that from was canceled with will be raised.

    • raises Invalid_argument

      if the from computation has already returned.

    Interface for schedulers

    type Stdlib.Effect.t += private
    1. | Cancel_after : {
      1. seconds : float;
        (*

        Guaranteed to be non-negative.

        *)
      2. exn : exn;
      3. bt : Stdlib.Printexc.raw_backtrace;
      4. computation : 'a t;
      } -> unit Stdlib.Effect.t

    Schedulers must handle the Cancel_after effect to implement the behavior of cancel_after.

    The scheduler should typically attach a trigger to the computation passed with the effect and arrange the timeout to be canceled upon signal to avoid space leaks.

    The scheduler should measure time using a monotonic clock.

    In case the fiber permits propagation of cancelation and the computation associated with the fiber has been canceled the scheduler is free to discontinue the fiber before setting up the timeout.

    If the fiber is continued normally, i.e. without raising an exception, the scheduler should guarantee that the cancelation will be delivered eventually.

    The scheduler is free to choose which ready fiber to resume next.

    val with_action : + ?mode:[ `FIFO | `LIFO ] -> + 'x -> + 'y -> + (Trigger.t -> 'x -> 'y -> unit) -> + 'a t

    with_action x y resume is equivalent to

      let computation = create () in
+  let trigger =
+    Trigger.from_action x y resume in
+  let _ : bool =
+    try_attach computation trigger in
+  computation

    ⚠️ The same warnings as with Trigger.from_action apply.

    • alert handler This is an escape hatch for experts implementing schedulers or structured concurrency mechanisms. If you know what you are doing, use [@alert "-handler"].

    Design rationale

    The main feature of the computation concept is that anyone can efficiently attach triggers to a computation to get notified when the status of the computation changes from running to completed and can also efficiently detach such triggers in case getting a notification is no longer necessary. This allows the status change to be propagated omnidirectionally and is what makes computations able to support a variety of purposes such as the implementation of structured concurrency.

    The computation concept can be seen as a kind of single-shot atomic event that is a generalization of both a cancelation Context or token and of a promise. Unlike a typical promise mechanism, a computation can be canceled. Unlike a typical cancelation mechanism, a computation can and should also be completed in case it is not canceled. This promotes proper scoping of computations and resource cleanup at completion, which is how the design evolved from a more traditional cancelation context design.

    Every fiber is associated with a computation. Being able to return a value through the computation means that no separate promise is necessarily required to hold the result of a fiber. On the other hand, multiple fibers may share a single computation. This allows multiple fibers to be canceled efficiently through a single atomic update. In other words, the design allows various higher level patterns to be implemented efficiently.

    Instead of directly implementing a hierarchy of computations, the design allows attaching triggers to computations and a special trigger constructor is provided for propagating cancelation. This helps to keep the implementation lean, i.e. not substantially heavier than a typical promise implementation.

    Finally, just like with Trigger.Await, a key idea is that the handler of Computation.Cancel_after does not need to run arbitrary user defined code. The action of any trigger attached to a computation either comes from some scheduler calling Trigger.on_signal or from Computation.canceler.

    diff --git a/picos/Picos/Fiber/FLS/index.html b/picos/Picos/Fiber/FLS/index.html new file mode 100644 index 0000000..6f246a9 --- /dev/null +++ b/picos/Picos/Fiber/FLS/index.html @@ -0,0 +1,2 @@ + +FLS (picos.Picos.Fiber.FLS)

    Module Fiber.FLS

    Fiber local storage

    Fiber local storage is intended for use as a low overhead storage mechanism for fiber extensions. For example, one might associate a priority value with each fiber for a scheduler that uses a priority queue or one might use FLS to store unique id values for fibers.

    type fiber := t

    Destructively substituted alias for Fiber.t.

    type 'a t

    Represents a key for storing values of type 'a in storage associated with fibers.

    val create : unit -> 'a t

    create () allocates a new key for associating values in storage associated with fibers.

    ⚠️ New keys should not be created dynamically.

    exception Not_set

    Raised by get_exn in case value has not been set.

    val get_exn : fiber -> 'a t -> 'a

    get_exn fiber key returns the value associated with the key in the storage associated with the fiber or raises Not_set using raise_notrace.

    ⚠️ It is only safe to call get_exn from the fiber itself or when the fiber is known not to be running.

    val get : fiber -> 'a t -> default:'a -> 'a

    get fiber key ~default returns the value associated with the key in the storage associated with the fiber or the default value.

    ⚠️ It is only safe to call get from the fiber itself or when the fiber is known not to be running.

    val set : fiber -> 'a t -> 'a -> unit

    set fiber key value sets the value associated with the key to the given value in the storage associated with the fiber.

    ⚠️ It is only safe to call set from the fiber itself or when the fiber is known not to be running.

    val remove : fiber -> 'a t -> unit

    remove fiber key removes the value, if any, associated with the key from the storage associated with the fiber.

    ⚠️ It is only safe to call remove from the fiber itself or when the fiber is known not to be running.

    val reserve : fiber -> 'a t -> unit

    reserve fiber key ensures that sufficient space has been allocated to associate a value with the specified key such that a subsequent set with the key will not allocate.

    ℹ️ This can be used to optimize the population of the FLS and to avoid performing memory allocations in critical sections.

    ⚠️ It is only safe to call reserve from the fiber itself or when the fiber is known not to be running.

    diff --git a/picos/Picos/Fiber/Maybe/index.html b/picos/Picos/Fiber/Maybe/index.html new file mode 100644 index 0000000..7a1712b --- /dev/null +++ b/picos/Picos/Fiber/Maybe/index.html @@ -0,0 +1,2 @@ + +Maybe (picos.Picos.Fiber.Maybe)

    Module Fiber.Maybe

    An unboxed optional fiber.

    type t

    Either a fiber or nothing.

    val nothing : t

    Not a fiber.

    val of_fiber : fiber -> t

    of_fiber fiber casts the fiber into an optional fiber.

    🏎️ This performs no allocations.

    val to_fiber : t -> fiber

    to_fiber casts the optional fiber to a fiber.

    • raises Invalid_argument

      in case the optional fiber is nothing.

    val current_if : bool option -> t

    current_if checked returns nothing in case checked is Some false and otherwise of_fiber (Fiber.current ()).

    val current_and_check_if : bool option -> t

    current_check_if checked returns nothing in case checked is Some false and otherwise of_fiber (Fiber.current ()) and also calls Fiber.check on the fiber.

    val or_current : t -> t

    or_current maybe returns of_fiber (Fiber.current ()) in case maybe is nothing and otherwise returns maybe.

    val to_fiber_or_current : t -> fiber

    to_fiber_or_current maybe returns Fiber.current () in case maybe is nothing and otherwise returns the fiber that maybe was cast from.

    val check : t -> unit

    check maybe returns immediately if maybe is nothing and otherwise calls Fiber.check on the fiber.

    val equal : t -> t -> bool

    equal l r determines whether l and r are maybe equal. Specifically, if either l or r or both is nothing, then they are considered (maybe) equal. Otherwise l and r are compared for physical equality.

    val unequal : t -> t -> bool

    equal l r determines whether l and r are maybe unequal. Specifically, if either l or r or both is nothing, then they are considered (maybe) unequal. Otherwise l and r are compared for physical equality.

    Design rationale

    The fiber identity is often needed only for the purpose of dynamically checking against programming errors. Unfortunately it can be relative expensive to obtain the current fiber.

    As a data point, in a benchmark that increments an int ref protected by a mutex, obtaining the fiber identity for the lock and unlock operations — that only need it for error checking purposes — roughly tripled the cost of an increment on a machine.

    Using GADTs internally allows an optional fiber to be provided without adding overhead to operations on non-optional fibers and allows optional fibers to used without allocations at a very low cost.

    diff --git a/picos/Picos/Fiber/index.html b/picos/Picos/Fiber/index.html new file mode 100644 index 0000000..3096358 --- /dev/null +++ b/picos/Picos/Fiber/index.html @@ -0,0 +1,42 @@ + +Fiber (picos.Picos.Fiber)

    Module Picos.Fiber

    An independent thread of execution.

    A fiber corresponds to an independent thread of execution. Fibers are created by schedulers in response to Spawn effects. A fiber is associated with a computation and either forbids or permits the scheduler from propagating cancelation when the fiber performs effects. A fiber also has an associated fiber local storage.

    ⚠️ Many operations on fibers can only be called safely from the fiber itself, because those operations are neither concurrency nor parallelism safe. Such operations can be safely called from a handler in a scheduler when it is handling an effect performed by the fiber. In particular, a scheduler can safely check whether the fiber has_forbidden cancelation and may access the FLS of the fiber.

    Interface for rescheduling

    val yield : unit -> unit

    yield () asks the current fiber to be rescheduled.

    ℹ️ The behavior is that

    • on OCaml 5, yield perform the Yield effect, and
    • on OCaml 4, yield will call the yield operation of the current handler.
    val sleep : seconds:float -> unit

    sleep ~seconds suspends the current fiber for the specified number of seconds.

    Interface for current fiber

    type t

    Represents a fiber or an independent thread of execution.

    ⚠️ Unlike with most other concepts of Picos, operations on fibers are typically not concurrency or parallelism safe, because the fiber is considered to be owned by a single thread of execution.

    type fiber := t

    Type alias for Fiber.t within this signature.

    val current : unit -> t

    current () returns the current fiber.

    ⚠️ Extra care should be taken when storing the fiber object in any shared data structure, because, aside from checking whether two fibers are equal, it is generally unsafe to perform any operations on foreign fibers.

    ℹ️ The behavior is that

    • on OCaml 5, current performs the Current effect, and
    • on OCaml 4, current will call the current operation of the current handler.

    ⚠️ The current operation must always resume the fiber without propagating cancelation. A scheduler may, of course, decide to reschedule the current fiber to be resumed later.

    Because the scheduler does not discontinue a fiber calling current, it is recommended that the caller checks the cancelation status at the next convenient moment to do so.

    val has_forbidden : t -> bool

    has_forbidden fiber determines whether the fiber forbids or permits the scheduler from propagating cancelation to it.

    ℹ️ This is mostly useful in the effect handlers of schedulers.

    ⚠️ There is no "reference count" of how many times a fiber has forbidden or permitted propagation of cancelation. Calls to forbid and permit directly change a single boolean flag.

    ⚠️ It is only safe to call has_forbidden from the fiber itself.

    val forbid : t -> (unit -> 'a) -> 'a

    forbid fiber thunk tells the scheduler that cancelation must not be propagated to the fiber during the execution of thunk.

    The main use case of forbid is the implementation of concurrent abstractions that may have to await for something, or may need to perform other effects, and must not be canceled while doing so. For example, the wait operation on a condition variable typically reacquires the associated mutex before returning, which may require awaiting for the owner of the mutex to release it.

    ℹ️ forbid does not prevent the fiber or the associated computation from being canceled. It only tells the scheduler not to propagate cancelation to the fiber when it performs effects.

    ⚠️ It is only safe to call forbid from the fiber itself.

    val permit : t -> (unit -> 'a) -> 'a

    permit fiber thunk tells the scheduler that cancelation may be propagated to the fiber during the execution of thunk.

    It is possible to spawn a fiber with cancelation forbidden, which means that cancelation won't be propagated to fiber unless it is explicitly permitted by the fiber at some point.

    ⚠️ It is only safe to call permit from the fiber itself.

    val is_canceled : t -> bool

    is_canceled fiber is equivalent to

      not (Fiber.has_forbidden fiber) &&
+  let (Packed computation) =
+    Fiber.get_computation fiber
+  in
+  Computation.is_canceled computation

    ℹ️ This is mostly useful in the effect handlers of schedulers.

    ⚠️ It is only safe to call is_canceled from the fiber itself.

    val canceled : t -> (exn * Stdlib.Printexc.raw_backtrace) option

    canceled fiber is equivalent to:

      if Fiber.has_forbidden fiber then
+    None
+  else
+    let (Packed computation) =
+      Fiber.get_computation fiber
+    in
+    Computation.canceled computation

    ℹ️ This is mostly useful in the effect handlers of schedulers.

    ⚠️ It is only safe to call canceled from the fiber itself.

    val check : t -> unit

    check fiber is equivalent to:

      if not (Fiber.has_forbidden fiber) then
+    let (Packed computation) =
+      Fiber.get_computation fiber
+    in
+    Computation.check computation

    ℹ️ This is mostly useful for periodically polling the cancelation status during CPU intensive work.

    ⚠️ It is only safe to call check from the fiber itself.

    val exchange : t -> forbid:bool -> bool

    exchange fiber ~forbid sets the bit that tells the scheduler whether to propagate cancelation or not and returns the previous state.

    val set : t -> forbid:bool -> unit

    set fiber ~forbid sets the bit that tells the scheduler whether to propagate cancelation or not.

    module FLS : sig ... end

    Fiber local storage

    Interface for spawning

    val create_packed : forbid:bool -> Computation.packed -> t

    create_packed ~forbid packed creates a new fiber record.

    val create : forbid:bool -> 'a Computation.t -> t

    create ~forbid computation is equivalent to create_packed ~forbid (Computation.Packed computation).

    val spawn : t -> (t -> unit) -> unit

    spawn fiber main starts a new fiber by performing the Spawn effect.

    ⚠️ Fiber records must be unique and the caller of spawn must make sure that a specific fiber record is not reused. Failure to ensure that fiber records are unique will break concurrent abstractions written on top the the Picos interface.

    ⚠️ If the main function raises an exception it is considered a fatal error. A fatal error should effectively either directly exit the program or stop the entire scheduler, without discontinuing existing fibers, and force the invocations of the scheduler on all domains to exit. What this means is that the caller of spawn should ideally arrange for any exception to be handled by main, but, in case that is not practical, it is also possible to allow an exception to propagate out of main, which is then guaranteed to, one way or the other, to stop the entire program. It is not possible to recover from a fatal error.

    ℹ️ The behavior is that

    • on OCaml 5, spawn performs the Spawn effect, and
    • on OCaml 4, spawn will call the spawn operation of the current handler.

    Interface for structuring

    val get_computation : t -> Computation.packed

    get_computation fiber returns the computation that the fiber is currently associated with.

    val set_computation : t -> Computation.packed -> unit

    set_computation fiber packed associates the fiber with the specified computation.

    Interface for foreign fiber

    val equal : t -> t -> bool

    equal fiber1 fiber2 is physical equality for fibers, i.e. it determines whether fiber1 and fiber2 are one and the same fiber.

    ℹ️ One use case of equal is in the implementation of concurrent primitives like mutexes where it makes sense to check that acquire and release operations are performed by the same fiber.

    module Maybe : sig ... end

    An unboxed optional fiber.

    Interface for schedulers

    val try_suspend : + t -> + Trigger.t -> + 'x -> + 'y -> + (Trigger.t -> 'x -> 'y -> unit) -> + bool

    try_suspend fiber trigger x y resume tries to suspend the fiber to await for the trigger to be signaled. If the result is false, then the trigger is guaranteed to be in the signaled state and the fiber should be eventually resumed. If the result is true, then the fiber was suspended, meaning that the trigger will have had the resume action attached to it and the trigger has potentially been attached to the computation of the fiber.

    val unsuspend : t -> Trigger.t -> bool

    unsuspend fiber trigger makes sure that the trigger will not be attached to the computation of the fiber. Returns false in case the fiber has been canceled and propagation of cancelation is not forbidden. Otherwise returns true.

    • raises Invalid_argument

      if the trigger is not in the signaled state.

    val resume : + t -> + ((exn * Stdlib.Printexc.raw_backtrace) option, 'r) + Stdlib.Effect.Deep.continuation -> + 'r

    resume fiber k is equivalent to Effect.Deep.continue k (Fiber.canceled t).

    val resume_with : + t -> + ((exn * Stdlib.Printexc.raw_backtrace) option, 'b) + Stdlib.Effect.Shallow.continuation -> + ('b, 'r) Stdlib.Effect.Shallow.handler -> + 'r

    resume_with fiber k h is equivalent to Effect.Shallow.continue_with k (Fiber.canceled t) h.

    val continue : t -> ('v, 'r) Stdlib.Effect.Deep.continuation -> 'v -> 'r

    continue fiber k v is equivalent to:

      match Fiber.canceled fiber with
+  | None -> Effect.Deep.continue k v
+  | Some (exn, bt) ->
+    Effect.Deep.discontinue_with_backtrace k exn bt
    val continue_with : + t -> + ('v, 'b) Stdlib.Effect.Shallow.continuation -> + 'v -> + ('b, 'r) Stdlib.Effect.Shallow.handler -> + 'r

    continue_with fiber k v h is equivalent to:

      match Fiber.canceled fiber with
+  | None -> Effect.Shallow.continue_with k v h
+  | Some (exn, bt) ->
+    Effect.Shallow.discontinue_with_backtrace k exn bt h
    type Stdlib.Effect.t += private
    1. | Current : t Stdlib.Effect.t

    Schedulers must handle the Current effect to implement the behavior of current.

    ⚠️ The scheduler must eventually resume the fiber without propagating cancelation. This is necessary to allow a fiber to control the propagation of cancelation through the fiber.

    The scheduler is free to choose which ready fiber to resume next. However, in typical use cases of current it makes sense to give priority to the fiber performing Current, but this is not required.

    type Stdlib.Effect.t += private
    1. | Yield : unit Stdlib.Effect.t

    Schedulers must handle the Yield effect to implement the behavior of yield.

    In case the fiber permits propagation of cancelation and the computation associated with the fiber has been canceled the scheduler is free to discontinue the fiber immediately.

    The scheduler should give priority to running other ready fibers before resuming the fiber performing Yield. A scheduler that always immediately resumes the fiber performing Yield may prevent an otherwise valid program from making progress.

    type Stdlib.Effect.t += private
    1. | Spawn : {
      1. fiber : t;
      2. main : t -> unit;
      } -> unit Stdlib.Effect.t

    Schedulers must handle the Spawn effect to implement the behavior of spawn.

    In case the fiber permits propagation of cancelation and the computation associated with the fiber has been canceled the scheduler is free to discontinue the fiber immediately before spawning new fibers.

    The scheduler is free to run the newly created fiber on any domain and decide which fiber to give priority to.

    ⚠️ The scheduler should guarantee that, when Spawn returns normally, the given main will eventually be called by the scheduler and, when Spawn raises an exception, the main will not be called. In other words, Spawn should check cancelation just once and be all or nothing. Furthermore, in case a newly spawned fiber is canceled before its main is called, the scheduler must still call the main. This allows a program to ensure, i.e. keep track of, that all fibers it spawns are terminated properly and any resources transmitted to spawned fibers will be disposed properly.

    Design rationale

    The idea is that fibers correspond 1-to-1 with independent threads of execution. This allows a fiber to non-atomically store state related to a thread of execution.

    The status of whether propagation of cancelation is forbidden or permitted could be stored in the fiber local storage. The justification for storing it directly with the fiber is that the implementation of some key synchronization and communication mechanisms, such as condition variables, requires the capability.

    No integer fiber id is provided by default. It would seem that for most intents and purposes the identity of the fiber is sufficient. Fiber local storage can be used to implement a fiber id or e.g. a fiber hash.

    The fiber local storage is designed for the purpose of extending fibers and to be as fast as possible. It is not intended for application programming.

    Yield is provided as a separate effect to specifically communicate the intent that the current fiber should be rescheduled. This allows all the other effect handlers more freedom in choosing which fiber to schedule next.

    diff --git a/picos/Picos/Handler/index.html b/picos/Picos/Handler/index.html new file mode 100644 index 0000000..b657ee2 --- /dev/null +++ b/picos/Picos/Handler/index.html @@ -0,0 +1,7 @@ + +Handler (picos.Picos.Handler)

    Module Picos.Handler

    Handler for the effects based operations of Picos for OCaml 4.

    type 'c t = {
    1. current : 'c -> Fiber.t;
      (*

      See Picos.Fiber.current.

      *)
    2. spawn : 'c -> Fiber.t -> (Fiber.t -> unit) -> unit;
      (*

      See Picos.Fiber.spawn.

      *)
    3. yield : 'c -> unit;
      (*

      See Picos.Fiber.yield.

      *)
    4. cancel_after : 'a. 'c -> + 'a Computation.t -> + seconds:float -> + exn -> + Stdlib.Printexc.raw_backtrace -> + unit;
      (*

      See Picos.Computation.cancel_after.

      *)
    5. await : 'c -> Trigger.t -> (exn * Stdlib.Printexc.raw_backtrace) option;
      (*

      See Picos.Trigger.await.

      *)
    }

    A record of implementations of the primitive effects based operations of Picos. The operations take a context of type 'c as an argument.

    val using : 'c t -> 'c -> (Fiber.t -> unit) -> unit

    using handler context main sets the handler and the context for the handler of the primitive effects based operations of Picos while running main.

    ℹ️ The behavior is that

    • on OCaml 4, using stores the handler in TLS, which allows the operations to be accessed during the execution of the thunk, and
    • on OCaml 5, using runs thunk with a deep effect handler that delegates to the operations of the handler.

    ⚠️ While this works on OCaml 5, you usually want to use a scheduler that implements an effect handler directly, because that is likely to perform better.

    diff --git a/picos/Picos/Trigger/index.html b/picos/Picos/Trigger/index.html new file mode 100644 index 0000000..70c941a --- /dev/null +++ b/picos/Picos/Trigger/index.html @@ -0,0 +1,18 @@ + +Trigger (picos.Picos.Trigger)

    Module Picos.Trigger

    Ability to await for a signal.

    To suspend and later resume the current thread of execution, one can create a trigger, arrange signal to be called on it, and await for the call.

    Here is a simple example:

      run begin fun () ->
+    Flock.join_after @@ fun () ->
+
+    let trigger = Trigger.create () in
+
+    Flock.fork begin fun () ->
+      Trigger.signal trigger
+    end;
+
+    match Trigger.await trigger with
+    | None ->
+      (* We were resumed normally. *)
+      ()
+    | Some (exn, bt) ->
+      (* We were canceled. *)
+      Printexc.raise_with_backtrace exn bt
+  end

    ⚠️ Typically we need to cleanup after await, but in the above example we didn't insert the trigger into any data structure nor did we attach the trigger to any computation.

    All operations on triggers are wait-free, with the obvious exception of await. The signal operation inherits the properties of the action attached with on_signal to the trigger.

    Interface for suspending

    type t

    Represents a trigger. A trigger can be in one of three states: initial, awaiting, or signaled.

    ℹ️ Once a trigger becomes signaled it no longer changes state.

    🏎️ A trigger in the initial and signaled states is a tiny object that does not hold onto any other objects.

    val create : unit -> t

    create () allocates a new trigger in the initial state.

    val is_signaled : t -> bool

    is_signaled trigger determines whether the trigger is in the signaled state.

    This can be useful, for example, when a trigger is being inserted to multiple locations and might be signaled concurrently while doing so. In such a case one can periodically check with is_signaled trigger whether it makes sense to continue.

    ℹ️ Computation.try_attach already checks that the trigger being inserted has not been signaled so when attaching a trigger to multiple computations there is no need to separately check with is_signaled.

    val await : t -> (exn * Stdlib.Printexc.raw_backtrace) option

    await trigger waits for the trigger to be signaled.

    The return value is None in case the trigger has been signaled and the fiber was resumed normally. Otherwise the return value is Some (exn, bt), which indicates that the fiber has been canceled and the caller should raise the exception. In either case the caller is responsible for cleaning up. Usually this means making sure that no references to the trigger remain to avoid space leaks.

    ⚠️ As a rule of thumb, if you inserted the trigger to some data structure or attached it to some computation, then you are responsible for removing and detaching the trigger after await.

    ℹ️ A trigger in the signaled state only takes a small constant amount of memory. Make sure that it is not possible for a program to accumulate unbounded numbers of signaled triggers under any circumstance.

    ⚠️ Only the owner or creator of a trigger may call await. It is considered an error to make multiple calls to await.

    ℹ️ The behavior is that, unless await can return immediately,

    • on OCaml 5, await will perform the Await effect, and
    • on OCaml 4, await will call the await operation of the current handler.
    • raises Invalid_argument

      if the trigger was in the awaiting state, which means that multiple concurrent calls of await are being made.

    Interface for resuming

    val signal : t -> unit

    signal trigger puts the trigger into the signaled state and calls the resume action, if any, attached using on_signal.

    The intention is that calling signal trigger guarantees that any fiber awaiting the trigger will be resumed. However, when and whether a fiber having called await will be resumed normally or as canceled is determined by the scheduler that handles the Await effect.

    ℹ️ Note that under normal circumstances, signal should never raise an exception. If an exception is raised by signal, it means that the handler of Await has a bug or some catastrophic failure has occurred.

    ⚠️ Do not call signal from an effect handler in a scheduler.

    Interface for schedulers

    ⚠️ The operations in this section are for more advanced use cases and their use requires a deeper understanding of how schedulers work.

    val is_initial : t -> bool

    is_initial trigger determines whether the trigger is in the initial or in the signaled state.

    ℹ️ Consider using is_signaled instead of is_initial as in some contexts a trigger might reasonably be either in the initial or the awaiting state depending on the order in which things are being done.

    • raises Invalid_argument

      if the trigger was in the awaiting state.

    val on_signal : t -> 'x -> 'y -> (t -> 'x -> 'y -> unit) -> bool

    on_signal trigger x y resume attempts to attach the resume action to the trigger and transition the trigger to the awaiting state.

    The return value is true in case the action was attached successfully. Otherwise the return value is false, which means that the trigger was already in the signaled state.

    ⚠️ The action that you attach to a trigger must be safe to call from any context that might end up signaling the trigger directly or indirectly through propagation. Unless you know, then you should assume that the resume action might be called from a different domain running in parallel with neither effect nor exception handlers and that if the attached action doesn't return the system may deadlock or if the action doesn't return quickly it may cause performance issues.

    ⚠️ It is considered an error to make multiple calls to on_signal with a specific trigger.

    • raises Invalid_argument

      if the trigger was in the awaiting state, which means that either the owner or creator of the trigger made concurrent calls to await or the handler called on_signal more than once.

    • alert handler Only a scheduler should call this in the handler of the Await effect to attach the scheduler specific resume action to the trigger. Annotate your effect handling function with [@alert "-handler"].
    val from_action : 'x -> 'y -> (t -> 'x -> 'y -> unit) -> t

    from_action x y resume is equivalent to let t = create () in assert (on_signal t x y resume); t.

    ℹ️ This can useful when you just want to have an arbitrary callback executed when a trigger you attach to a computation is signaled.

    ⚠️ The action that you attach to a trigger must be safe to call from any context that might end up signaling the trigger directly or indirectly through propagation. Unless you know, then you should assume that the resume action might be called from a different domain running in parallel with neither effect nor exception handlers and that if the attached action doesn't return the system may deadlock or if the action doesn't return quickly it may cause performance issues.

    ⚠️ The returned trigger will be in the awaiting state, which means that it is an error to call await, on_signal, or dispose on it.

    • alert handler This is an escape hatch for experts implementing schedulers or structured concurrency mechanisms. If you know what you are doing, use [@alert "-handler"].
    val dispose : t -> unit

    dispose trigger transition the trigger from the initial state to the signaled state.

    🚦 The intended use case of dispose is for use from the handler of Await to ensure that the trigger has been put to the signaled state after await returns.

    • raises Invalid_argument

      if the trigger was in the awaiting state.

    type Stdlib.Effect.t += private
    1. | Await : t -> (exn * Stdlib.Printexc.raw_backtrace) option Stdlib.Effect.t

    Schedulers must handle the Await effect to implement the behavior of await.

    In case the fiber permits propagation of cancelation, the trigger must be attached to the computation of the fiber for the duration of suspending the fiber by the scheduler.

    Typically the scheduler calls try_suspend, which in turn calls on_signal, to attach a scheduler specific resume action to the trigger. The scheduler must guarantee that the fiber will be resumed after signal has been called on the trigger.

    Whether being resumed due to cancelation or not, the trigger must be either signaled outside of the effect handler, or disposed by the effect handler, before resuming the fiber.

    In case the fiber permits propagation of cancelation and the computation associated with the fiber has been canceled the scheduler is free to continue the fiber immediately with the cancelation exception after disposing the trigger.

    ⚠️ A scheduler must not discontinue, i.e. raise an exception to, the fiber as a response to Await.

    The scheduler is free to choose which ready fiber to resume next.

    Design rationale

    A key idea behind this design is that the handler for Await does not need to run arbitrary user defined code while suspending a fiber: the handler calls on_signal by itself. This should make it easier to get both the handler and the user code correct.

    Another key idea is that the signal operation provides no feedback as to the outcome regarding cancelation. Calling signal merely guarantees that the caller of await will return. This means that the point at which cancelation must be determined can be as late as possible. A scheduler can check the cancelation status just before calling continue and it is, of course, possible to check the cancelation status earlier. This allows maximal flexibility for the handler of Await.

    The consequence of this is that the only place to handle cancelation is at the point of await. This makes the design simpler and should make it easier for the user to get the handling of cancelation right. A minor detail is that await returns an option instead of raising an exception. The reason for this is that matching against an option is slightly faster than setting up an exception handler. Returning an option also clearly communicates the two different cases to handle.

    On the other hand, the trigger mechanism does not have a way to specify a user-defined callback to perform cancelation immediately before the fiber is resumed. Such an immediately called callback could be useful for e.g. canceling an underlying IO request. One justification for not having such a callback is that cancelation is allowed to take place from outside of the scheduler, i.e. from another system level thread, and, in such a case, the callback could not be called immediately. Instead, the scheduler is free to choose how to schedule canceled and continued fibers and, assuming that fibers can be trusted, a scheduler may give priority to canceled fibers.

    This design also separates the allocation of the atomic state for the trigger, or create, from await, and allows the state to be polled using is_signaled before calling await. This is particularly useful when the trigger might need to be inserted to multiple places and be signaled in parallel before the call of await.

    No mechanism is provided to communicate any result with the signal. That can be done outside of the mechanism and is often not needed. This simplifies the design.

    Once signal has been called, a trigger no longer refers to any other object and takes just two words of memory. This e.g. allows lazy removal of triggers, assuming the number of attached triggers can be bounded, because nothing except the trigger itself would be leaked.

    To further understand the problem domain, in this design, in a suspend-resume scenario, there are three distinct pieces of state:

    1. The state of shared data structure(s) used for communication and / or synchronization.
    2. The state of the trigger.
    3. The cancelation status of the fiber.

    The trigger and cancelation status are both updated independently and atomically through code in this interface. The key requirement left for the user is to make sure that the state of the shared data structure is updated correctly independently of what await returns. So, for example, a mutex implementation must check, after getting Some (exn, bt), what the state of the mutex is and how it should be updated.

    diff --git a/picos/Picos/index.html b/picos/Picos/index.html new file mode 100644 index 0000000..cc6fa6b --- /dev/null +++ b/picos/Picos/index.html @@ -0,0 +1,16 @@ + +Picos (picos.Picos)

    Module Picos

    A systems programming interface between effects based schedulers and concurrent abstractions.

    This is essentially an interface between schedulers and concurrent abstractions that need to communicate with a scheduler. Perhaps an enlightening analogy is to say that this is the POSIX of effects based schedulers.

    ℹ️ Picos, i.e. this module, is not intended to be an application level concurrent programming library or framework. If you are looking for a library or framework for programming concurrent applications, then this module is probably not what you are looking for.

    The architecture of Picos

    The core concepts of Picos are

    • Trigger — ability to await for a signal,
    • Computation — a cancelable computation, and
    • Fiber — an independent thread of execution,

    that are implemented in terms of the effects

    that can be used to implement many kinds of higher level concurrent programming facilities.

    Understanding cancelation

    A central idea of Picos is to provide a collection of building blocks for parallelism safe cancelation.

    Consider the following motivating example:

      Mutex.protect mutex begin fun () ->
+    while true do
+      Condition.wait condition mutex
+    done
+  end

    Assume that the fiber executing the above computation might be canceled, at any point, by another fiber running in parallel. How could that be done ensuring both safety and liveness?

    • For safety, cancelation should not leave the program in an invalid state or cause the program to leak memory. In this case, the ownership of the mutex must be transferred to the next fiber or be left unlocked and no references to unused objects must be left in the mutex or the condition variable.
    • For liveness, cancelation should take effect as soon as possible. In this case, cancelation should take effect even during the Mutex.lock inside Mutex.protect and the Condition.wait operations when the fiber might be in a suspended state awaiting for a signal to continue.

    Here is another motivating example:

      (* ... allocate resources ... *)
+  Fun.protect ~finally begin fun () ->
+    Flock.join_after begin fun () ->
+      (* ... *)
+      Flock.fork begin fun () ->
+        (* ... may use resources ... *)
+      end;
+      (* ... *)
+    end;
+    (* ... resources no longer used ... *)
+  end

    The idea is that the main or parent fiber allocates some resources, which are then used by child fibers running in parallel. What should happen when the main fiber gets canceled? We again have both safety and liveness concerns:

    • For safety, to ensure that resources are not finalized prematurely, the Flock.join_after call must not return or raise before all of the child fibers have terminated.
    • For liveness, when the parent fiber gets canceled, we'd like all the child fibers to also get canceled.

    Picos is designed to allow the above motivating examples and more to be implemented correctly addressing both safety and liveness.

    Cancelation in Picos

    The Fiber concept in Picos corresponds to an independent thread of execution. A fiber may explicitly forbid or permit the scheduler from propagating cancelation to it. This is important for the implementation of some key concurrent abstractions such as condition variables, where it is necessary to forbid cancelation when the associated mutex is reacquired.

    Each fiber has an associated Computation at all times. A computation is something that needs to be completed either by returning a value through it or by canceling it with an exception. To cancel a fiber one cancels the computation associated with the fiber or any computation whose cancelation is propagated to the computation associated with the fiber.

    Before a computation has been completed, it is also possible to attach a Trigger to the computation and also to later detach the trigger from the computation. A trigger attached to a computation is signaled as the computation is completed.

    The Trigger concept in Picos is what allows a fiber to be suspended and later resumed. A fiber can create a trigger, add it to any shared data structure(s), and await for the trigger to be signaled. The await operation, which is implemented by the scheduler, also, in case the fiber permits cancelation, attaches the trigger to the computation of the fiber when it suspends the fiber. This is what allows a fiber to be resumed via cancelation of the computation.

    The return value of await tells whether the fiber was resumed normally or due to being canceled and the caller then needs to properly handle either case. After being canceled, depending on the concurrent abstraction being implemented, the caller might need to e.g. remove references to the trigger from the shared data structures, cancel asynchronous IO operations, or transfer ownership of a mutex to the next fiber in the queue of the mutex.

    Modules reference

    For the examples in this document, we first open the Picos module

      open Picos

    as well as the Picos_std_structured library,

      open Picos_std_structured

    which we will be using for managing fibers in some of the examples, and define a simple scheduler on OCaml 4

      let run main = Picos_mux_thread.run main

    using the basic thread based scheduler and on OCaml 5

      let run main = Picos_mux_random.run_on ~n_domains:2 main

    using the randomized effects based scheduler that come with Picos as samples.

    Core modules

    module Trigger : sig ... end

    Ability to await for a signal.

    module Computation : sig ... end

    A cancelable computation.

    module Fiber : sig ... end

    An independent thread of execution.

    module Handler : sig ... end

    Handler for the effects based operations of Picos for OCaml 4.

    diff --git a/picos/Picos__/index.html b/picos/Picos__/index.html new file mode 100644 index 0000000..1cdf022 --- /dev/null +++ b/picos/Picos__/index.html @@ -0,0 +1,2 @@ + +Picos__ (picos.Picos__)

    Module Picos__

    This module is hidden.

    diff --git a/picos/Picos__Intf/index.html b/picos/Picos__Intf/index.html new file mode 100644 index 0000000..da398f0 --- /dev/null +++ b/picos/Picos__Intf/index.html @@ -0,0 +1,2 @@ + +Picos__Intf (picos.Picos__Intf)

    Module Picos__Intf

    This module is hidden.

    diff --git a/picos/Picos_domain/DLS/index.html b/picos/Picos_domain/DLS/index.html new file mode 100644 index 0000000..a7de65c --- /dev/null +++ b/picos/Picos_domain/DLS/index.html @@ -0,0 +1,2 @@ + +DLS (picos.Picos_domain.DLS)

    Module Picos_domain.DLS

    Domain-local storage for Picos.

    ℹ️ On OCaml 4 there is always only a single domain.

    type 'a key

    Represents a key for storing values of type 'a in storage associated with domains.

    val new_key : (unit -> 'a) -> 'a key

    new_key compute allocates a new key for associating values in storage associated with domains. The initial value for each domain is computed by calling the given function if the key is read before it has been written. The compute function might be called multiple times per domain, but only one result will be used.

    val get : 'a key -> 'a

    get key returns the value associated with the key in the storage associated with the current domain.

    val set : 'a key -> 'a -> unit

    set key value sets the value associated with the key in the storage associated with the current domain.

    diff --git a/picos/Picos_domain/index.html b/picos/Picos_domain/index.html new file mode 100644 index 0000000..f9b9b29 --- /dev/null +++ b/picos/Picos_domain/index.html @@ -0,0 +1,2 @@ + +Picos_domain (picos.Picos_domain)

    Module Picos_domain

    Minimalistic domain API available both on OCaml 5 and on OCaml 4.

    ℹ️ On OCaml 4 there is always only a single domain.

    val at_exit : (unit -> unit) -> unit

    at_exit action registers action to be called when the current domain exits.

    On OCaml 5 this calls Domain.at_exit. On OCaml 4 this calls Stdlib.at_exit.

    recommended_domain_count () returns 1 on OCaml 4 and calls Domain.recommended_domain_count on OCaml 5.

    val is_main_domain : unit -> bool

    is_main_domain () returns true on OCaml 4 and calls Domain.is_main_domain on OCaml 5.

    module DLS : sig ... end

    Domain-local storage for Picos.

    diff --git a/picos/Picos_thread/TLS/index.html b/picos/Picos_thread/TLS/index.html new file mode 100644 index 0000000..e280920 --- /dev/null +++ b/picos/Picos_thread/TLS/index.html @@ -0,0 +1,2 @@ + +TLS (picos.Picos_thread.TLS)

    Module Picos_thread.TLS

    Thread-local storage.

    Note that here "thread" refers to system level threads rather than fibers or domains. In case a system level thread implementation, i.e. the threads.posix library, is not available, this will use Picos_domain.DLS.

    type 'a t

    Represents a key for associating values with threads.

    val create : unit -> 'a t

    create () allocates a new key for associating values with threads.

    ⚠️ Keys should not be created dynamically as each key will potentially increase the space taken by every thread.

    exception Not_set

    Exception raised by get_exn when no value is associated with the specified key for the current thread.

    val get_exn : 'a t -> 'a

    get_exn key returns the value associated with the specified key for the current thread or raises Not_set in case no value has been set for the key.

    ⚠️ The Not_set exception is raised with no backtrace. Always catch the exception unless it is known that a value has been set.

    val set : 'a t -> 'a -> unit

    set key value associates the value with the specified key for the current thread.

    diff --git a/picos/Picos_thread/index.html b/picos/Picos_thread/index.html new file mode 100644 index 0000000..f4b0c02 --- /dev/null +++ b/picos/Picos_thread/index.html @@ -0,0 +1,2 @@ + +Picos_thread (picos.Picos_thread)

    Module Picos_thread

    Minimalistic thread API available with or without threads.posix.

    val is_main_thread : unit -> bool

    is_main_thread () determines whether running on the main thread of the application.

    module TLS : sig ... end

    Thread-local storage.

    diff --git a/picos/_doc-dir/CHANGES.md b/picos/_doc-dir/CHANGES.md new file mode 100644 index 0000000..eb5ce11 --- /dev/null +++ b/picos/_doc-dir/CHANGES.md @@ -0,0 +1,191 @@ +## 0.6.0 + +- Added a futex-like `Awaitable` abstraction as the `picos_std.awaitable` + library (@polytypic) +- Changed the core Picos library to be internally built from a single `.ml` file + (@polytypic) +- Optimized heap and stack usage of fibers and resource cleanup mechanisms and + added workarounds for compiler generated space leaks due to closures + (@polytypic) +- Added `lastly` as a safe alternative to `Fun.protect` (@polytypic) +- Workarounds for the `Uri` library not being threadsafe (@polytypic) +- Fixed to raise proper error when `Picos_io_select` has not been configured + properly (@polytypic) +- Forbid cancelation propagation during `release` calls in the + `picos_std.finally` library (@polytypic) + - This is a change in behaviour and could be seen as a breaking change, but it + should really be considered a bug fix. +- Renamed `(Ivar|Stream).poison` to `(Ivar|Stream).poison_at` and added + `(Ivar|Stream).poison` with optional `?callstack:int` (@polytypic) + +## 0.5.0 + +- Major additions, changes, bug fixes, improvements, and restructuring + (@polytypic, @c-cube) + + - Additions: + + - Minimalistic Cohttp implementation + - Implicitly propagated `Flock` of fibers for structured concurrency + - Option to terminate `Bundle` and `Flock` on return + - `Event` abstraction + - Synchronization and communication primitives: + - Incremental variable or `Ivar` + - Countdown `Latch` + - `Semaphore` + - `Stream` of events + - Multi-producer, multi-consumer lock-free queue optimized for schedulers + - Multithreaded (work-stealing) FIFO scheduler + - Support `quota` for FIFO based schedulers + - Transactional interface for atomically completing multiple `Computation`s + + - Changes: + + - Redesigned resource management based on `('r -> 'a) -> 'a` functions + - Redesigned `spawn` interface allowing `FLS` entries to be populated before + spawn + - Introduced concept of fatal errors, which must terminate the scheduler or + the whole program + - Simplified `FLS` interface + - Removed `Exn_bt` + + - Improvements: + + - Signficantly reduced per fiber memory usage of various sample schedulers + + - Picos has now been split into multiple packages and libraries: + + - pkg: `picos` + - lib: `picos` + - lib: `picos.domain` + - lib: `picos.thread` + - pkg: `picos_aux` + - lib: `picos_aux.htbl` + - lib: `picos_aux.mpmcq` + - lib: `picos_aux.mpscq` + - lib: `picos_aux.rc` + - pkg: `picos_lwt` + - lib: `picos_lwt` + - lib: `picos_lwt.unix` + - pkg: `picos_meta` (integration tests) + - pkg: `picos_mux` + - lib: `picos_mux.fifo` + - lib: `picos_mux.multififo` + - lib: `picos_mux.random` + - lib: `picos_mux.thread` + - pkg: `picos_std` + - lib: `picos_std.event` + - lib: `picos_std.finally` + - lib: `picos_std.structured` + - lib: `picos_std.sync` + - pkg: `picos_io` + - lib: `picos_io` + - lib: `picos_io.fd` + - lib: `picos_io.select` + - pkg: `picos_io_cohttp` + - lib: `picos_io_cohttp` + +## 0.4.0 + +- Renamed `Picos_mpsc_queue` to `Picos_mpscq`. (@polytypic) + +- Core API changes: + + - Added `Computation.returned`. (@polytypic) + +- `Lwt` interop improvements: + + - Fixed `Picos_lwt` handling of `Cancel_after` to not raise in case of + cancelation. (@polytypic) + + - Redesigned `Picos_lwt` to take a `System` module, which must implement a + semi thread-safe trigger mechanism to allow unblocking `Lwt` promises on the + main thread. (@polytypic) + + - Added `Picos_lwt_unix` interface to `Lwt`, which includes an internal + `System` module implemented using `Lwt_unix`. (@polytypic) + + - Dropped thunking from `Picos_lwt.await`. (@polytypic) + +- Added a randomized multicore scheduler `Picos_randos` for testing. + (@polytypic) + +- Changed `Picos_select.check_configured` to always (re)configure signal + handling on the current thread. (@polytypic) + +- `Picos_structured`: + + - Added a minimalistic `Promise` abstraction. (@polytypic) + - Changed to more consistently not treat `Terminate` as an error. (@polytypic) + +- Changed schedulers to take `~forbid` as an optional argument. (@polytypic) + +- Various minor additions, fixes, and documentation improvements. (@polytypic) + +## 0.3.0 + +- Core API changes: + + - Added `Fiber.set_computation`, which represents a semantic change + - Renamed `Fiber.computation` to `Fiber.get_computation` + - Added `Computation.attach_canceler` + - Added `Fiber.sleep` + - Added `Fiber.create_packed` + - Removed `Fiber.try_attach` + - Removed `Fiber.detach` + + Most of the above changes were motivated by work on and requirements of the + added structured concurrency library (@polytypic) + +- Added a basic user level structured concurrent programming library + `Picos_structured` (@polytypic) + +- Added a functorized `Picos_lwt` providing direct style effects based interface + to programming with Lwt (@polytypic) + +- Added missing `Picos_stdio.Unix.select` (@polytypic) + +## 0.2.0 + +- Documentation fixes and restructuring (@polytypic) +- Scheduler friendly `waitpid`, `wait`, and `system` in `Picos_stdio.Unix` for + platforms other than Windows (@polytypic) +- Added `Picos_select.configure` to allow, and sometimes require, configuring + `Picos_select` for co-operation with libraries that also deal with signals + (@polytypic) +- Moved `Picos_tls` into `Picos_thread.TLS` (@polytypic) +- Enhanced `sleep` and `sleepf` in `Picos_stdio.Unix` to block in a scheduler + friendly manner (@polytypic) + +## 0.1.0 + +- First experimental release of Picos. + + Core: + + - `picos` — A framework for interoperable effects based concurrency. + + Sample schedulers: + + - `picos.fifos` — Basic single-threaded effects based Picos compatible + scheduler for OCaml 5. + - `picos.threaded` — Basic `Thread` based Picos compatible scheduler for + OCaml 4. + + Scheduler agnostic libraries: + + - `picos.sync` — Basic communication and synchronization primitives for Picos. + - `picos.stdio` — Basic IO facilities based on OCaml standard libraries for + Picos. + - `picos.select` — Basic `Unix.select` based IO event loop for Picos. + + Auxiliary libraries: + + - `picos.domain` — Minimalistic domain API available both on OCaml 5 and on + OCaml 4. + - `picos.exn_bt` — Wrapper for exceptions with backtraces. + - `picos.fd` — Externally reference counted file descriptors. + - `picos.htbl` — Lock-free hash table. + - `picos.mpsc_queue` — Multi-producer, single-consumer queue. + - `picos.rc` — External reference counting tables for disposable resources. + - `picos.tls` — Thread-local storage. diff --git a/picos/_doc-dir/LICENSE.md b/picos/_doc-dir/LICENSE.md new file mode 100644 index 0000000..5da6962 --- /dev/null +++ b/picos/_doc-dir/LICENSE.md @@ -0,0 +1,13 @@ +Copyright © 2023 Vesa Karvonen + +Permission to use, copy, modify, and/or distribute this software for any purpose +with or without fee is hereby granted, provided that the above copyright notice +and this permission notice appear in all copies. + +THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH +REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND +FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, +INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS +OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER +TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF +THIS SOFTWARE. diff --git a/picos/_doc-dir/README.md b/picos/_doc-dir/README.md new file mode 100644 index 0000000..26e31b8 --- /dev/null +++ b/picos/_doc-dir/README.md @@ -0,0 +1,791 @@ +[API reference](https://ocaml-multicore.github.io/picos/doc/index.html) · +[Benchmarks](https://bench.ci.dev/ocaml-multicore/picos/branch/main?worker=pascal&image=bench.Dockerfile) +· +[Stdlib Benchmarks](https://bench.ci.dev/ocaml-multicore/multicore-bench/branch/main?worker=pascal&image=bench.Dockerfile) + +# **Picos** — Interoperable effects based concurrency + +Picos is a +[systems programming](https://en.wikipedia.org/wiki/Systems_programming) +interface between effects based schedulers and concurrent abstractions. + +

    + +Picos is designed to enable an _open ecosystem_ of +[interoperable](https://en.wikipedia.org/wiki/Interoperability) and +interchangeable elements of effects based cooperative concurrent programming +models such as + +- [schedulers]() that + multiplex large numbers of + [user level fibers](https://en.wikipedia.org/wiki/Green_thread) to run on a + small number of system level threads, +- mechanisms for managing fibers and for + [structuring concurrency](https://en.wikipedia.org/wiki/Structured_concurrency), +- communication and synchronization primitives, such as + [mutexes and condition variables](), + message queues, + [STM](https://en.wikipedia.org/wiki/Software_transactional_memory)s, and more, + and +- integrations with low level + [asynchronous IO](https://en.wikipedia.org/wiki/Asynchronous_I/O) systems + +by decoupling such elements from each other. + +Picos comes with a +[reference manual](https://ocaml-multicore.github.io/picos/doc/index.html) and +many sample libraries. + +⚠️ Please note that Picos is still considered experimental and unstable. + +## Introduction + +Picos addresses the incompatibility of effects based schedulers at a fundamental +level by introducing +[an _interface_ to decouple schedulers and other concurrent abstractions](https://ocaml-multicore.github.io/picos/doc/picos/Picos/index.html) +that need services from a scheduler. + +The +[core abstractions of Picos](https://ocaml-multicore.github.io/picos/doc/picos/Picos/index.html#the-architecture-of-picos) +are + +- [`Trigger`](https://ocaml-multicore.github.io/picos/doc/picos/Picos/Trigger/index.html) + — the ability to await for a signal, +- [`Computation`](https://ocaml-multicore.github.io/picos/doc/picos/Picos/Computation/index.html) + — a cancelable computation, and +- [`Fiber`](https://ocaml-multicore.github.io/picos/doc/picos/Picos/Fiber/index.html) + — an independent thread of execution, + +that are implemented partially by the Picos interface in terms of the effects + +- [`Trigger.Await`](https://ocaml-multicore.github.io/picos/doc/picos/Picos/Trigger/index.html#extension-Await) + — to suspend and resume a fiber, +- [`Computation.Cancel_after`](https://ocaml-multicore.github.io/picos/doc/picos/Picos/Computation/index.html#extension-Cancel_after) + — to cancel a computation after given period of time, +- [`Fiber.Current`](https://ocaml-multicore.github.io/picos/doc/picos/Picos/Fiber/index.html#extension-Current) + — to obtain the current fiber, +- [`Fiber.Yield`](https://ocaml-multicore.github.io/picos/doc/picos/Picos/Fiber/index.html#extension-Yield) + — to request rescheduling, and +- [`Fiber.Spawn`](https://ocaml-multicore.github.io/picos/doc/picos/Picos/Fiber/index.html#extension-Spawn) + — to start a new fiber. + +The partial implementation of the abstractions and the effects define a contract +between schedulers and other concurrent abstractions. By handling the Picos +effects according to the contract a scheduler becomes _Picos compatible_, which +allows any abstractions written against the Picos interface, i.e. _Implemented +in Picos_, to be used with the scheduler. + +### Understanding cancelation + +A central idea or goal of Picos is to provide a collection of building blocks +for parallelism safe cancelation that allows the implementation of both blocking +abstractions as well as the implementation of abstractions for structuring +fibers for cancelation or managing the propagation and scope of cancelation. + +While cancelation, which is essentially a kind of asynchronous exception or +signal, is not necessarily recommended as a general control mechanism, the +ability to cancel fibers in case of errors is crucial for the implementation of +practical concurrent programming models. + +Consider the following characteristic +[example](https://ocaml-multicore.github.io/picos/doc/picos_std/Picos_std_structured/index.html#understanding-cancelation): + +```ocaml skip +Mutex.protect mutex begin fun () -> + while true do + Condition.wait condition mutex + done +end +``` + +Assume that a fiber executing the above code might be canceled, at any point, by +another fiber running in parallel. This could be necessary, for example, due to +an error that requires the application to be shut down. How could that be done +while ensuring both +[safety and liveness](https://en.wikipedia.org/wiki/Safety_and_liveness_properties)? + +- For safety, cancelation should not leave the program in an invalid state or + cause the program to leak memory. In this case, `Condition.wait` must exit + with the mutex locked, even in case of cancelation, and, as `Mutex.protect` + exits, the ownership of the mutex must be transferred to the next fiber, if + any, waiting in queue for the mutex. No references to unused objects may be + left in the mutex or the condition variable. + +- For liveness, cancelation should ensure that the fiber will eventually + continue after cancelation. In this case, cancelation could be triggered + during the `Mutex.lock` operation inside `Mutex.protect` or the + `Condition.wait` operation, when the fiber might be in a suspended state, and + cancelation should then allow the fiber to continue. + +The set of abstractions, `Trigger`, `Computation`, and `Fiber`, work together +[to support cancelation](https://ocaml-multicore.github.io/picos/doc/picos/Picos/index.html#cancelation-in-picos). +Briefly, a fiber corresponds to an independent thread of execution and every +fiber is associated with a computation at all times. When a fiber creates a +trigger in order to await for a signal, it ask the scheduler to suspend the +fiber on the trigger. Assuming the fiber has not forbidden the propagation of +cancelation, which is required, for example, in the implementation of +`Condition.wait` to lock the mutex upon exit, the scheduler must also attach the +trigger to the computation associated with the fiber. If the computation is then +canceled before the trigger is otherwise signaled, the trigger will be signaled +by the cancelation of the computation, and the fiber will be resumed by the +scheduler as canceled. + +This cancelable suspension protocol and its partial implementation designed +around the first-order +[`Trigger.Await`](https://ocaml-multicore.github.io/picos/doc/picos/Picos/Trigger/index.html#extension-Await) +effect creates a clear separation between schedulers and user code running in +fibers and is designed to handle the possibility of a trigger being signaled or +a computation being canceled at any point during the suspension of a fiber. +Schedulers are given maximal freedom to decide which fiber to resume next. As an +example, a scheduler could give priority to canceled fibers — going as far +as moving a fiber already in the ready queue of the scheduler to the front of +the queue at the point of cancelation — based on the assumption that user +code promptly cancels external requests and frees critical resources. + +### `Trigger` + +A trigger provides the ability to await for a signal and is perhaps the best +established and least controversial element of the Picos interface. + +Here is an extract from the signature of the +[`Trigger` module](https://ocaml-multicore.github.io/picos/doc/picos/Picos/Trigger/index.html): + + + +```ocaml skip +type t +val create : unit -> t +val await : t -> (exn * Printexc.raw_backtrace) option +val signal : t -> unit +val on_signal : (* for schedulers *) +``` + +The idea is that a fiber may create a trigger, insert it into some shared data +structure, and then call `await` to ask the scheduler to suspend the fiber until +something signals the trigger. When `await` returns an exception with a +backtrace it means that the fiber has been canceled. + +As an example, let's consider the implementation of an `Ivar` or incremental or +single-assignment variable: + +```ocaml skip +type 'a t +val create : unit -> 'a t +val try_fill : 'a t -> 'a -> bool +val read : 'a t -> 'a +``` + +An `Ivar` is created as empty and can be filled with a value once. An attempt to +read an `Ivar` blocks until the `Ivar` is filled. + +Using `Trigger` and `Atomic`, we can represent an `Ivar` as follows: + +```ocaml +type 'a state = + | Filled of 'a + | Empty of Trigger.t list + +type 'a t = 'a state Atomic.t +``` + +The `try_fill` operation is then fairly straightforward to implement: + +```ocaml +let rec try_fill t value = + match Atomic.get t with + | Filled _ -> false + | Empty triggers as before -> + let after = Filled value in + if Atomic.compare_and_set t before after then + begin + List.iter Trigger.signal triggers; (* ! *) + true + end + else + try_fill t value +``` + +The interesting detail above is that after successfully filling an `Ivar`, the +triggers are signaled. This allows the `await` inside the `read` operation to +return: + + + +```ocaml +let rec read t = + match Atomic.get t with + | Filled value -> value + | Empty triggers as before -> + let trigger = Trigger.create () in + let after = Empty (trigger :: triggers) in + if Atomic.compare_and_set t before after then + match Trigger.await trigger with + | None -> read t + | Some (exn, bt) -> + cleanup t trigger; (* ! *) + Printexc.raise_with_backtrace exn bt + else + read t +``` + +An important detail above is that when `await` returns an exception with a +backtrace, meaning that the fiber has been canceled, the `cleanup` operation +(which is omitted) is called to remove the `trigger` from the `Ivar` to avoid +potentially accumulating unbounded numbers of triggers in an empty `Ivar`. + +As simple as it is, the design of `Trigger` is far from arbitrary: + +- First of all, `Trigger` has single-assignment semantics. After being signaled, + a trigger takes a constant amount of space and does not point to any other + heap object. This makes it easier to reason about the behavior and can also + help to avoid leaks or optimize data structures containing triggers, because + it is safe to hold bounded amounts of signaled triggers. + +- The `Trigger` abstraction is essentially first-order, which provides a clear + separation between a scheduler and programs, or fibers, running on a + scheduler. The `await` operation performs the `Await` effect, which passes the + trigger to the scheduler. The scheduler then attaches its own callback to the + trigger using `on_signal`. This way a scheduler does not call arbitrary user + specified code in the `Await` effect handler. + +- Separating the creation of a trigger from the `await` operation allows one to + easily insert a trigger into any number of places and allows the trigger to be + potentially concurrently signaled before the `Await` effect is performed in + which case the effect can be skipped entirely. + +- No value is propagated with a trigger. This makes triggers simpler and makes + it less likely for one to e.g. accidentally drop such a value. In many cases, + like with the `Ivar`, there is already a data structure through which values + can be propagated. + +- The `signal` operation gives no indication of whether a fiber will then be + resumed as canceled or not. This gives maximal flexibility for the scheduler + and also makes it clear that cancelation must be handled based on the return + value of `await`. + +### `Computation` + +A `Computation` basically holds the status, i.e. _running_, _returned_, or +_canceled_, of some sort of computation and allows anyone with access to the +computation to attach triggers to it to be signaled in case the computation +stops running. + +Here is an extract from the signature of the +[`Computation` module](https://ocaml-multicore.github.io/picos/doc/picos/Picos/Computation/index.html): + +```ocaml skip +type 'a t + +val create : unit -> 'a t + +val try_attach : 'a t -> Trigger.t -> bool +val detach : 'a t -> Trigger.t -> unit + +val try_return : 'a t -> 'a -> bool +val try_cancel : 'a t -> exn -> Printexc.raw_backtrace -> bool + +val check : 'a t -> unit +val await : 'a t -> 'a +``` + +A `Computation` directly provides a superset of the functionality of the `Ivar` +we sketched in the previous section: + +```ocaml +type 'a t = 'a Computation.t +let create : unit -> 'a t = Computation.create +let try_fill : 'a t -> 'a -> bool = + Computation.try_return +let read : 'a t -> 'a = Computation.await +``` + +However, what really makes the `Computation` useful is the ability to +momentarily attach triggers to it. A `Computation` essentially implements a +specialized lock-free bag of triggers, which allows one to implement dynamic +completion propagation networks. + +The `Computation` abstraction is also designed with both simplicity and +flexibility in mind: + +- Similarly to `Trigger`, `Computation` has single-assignment semantics, which + makes it easier to reason about. + +- Unlike a typical cancelation context of a structured concurrency model, + `Computation` is unopinionated in that it does not impose a specific + hierarchical structure. + +- Anyone may ask to be notified when a `Computation` is completed by attaching + triggers to it and anyone may complete a `Computation`. This makes + `Computation` an omnidirectional communication primitive. + +Interestingly, and unintentionally, it turns out that, given +[the ability to complete two (or more) computations atomically](https://ocaml-multicore.github.io/picos/doc/picos/Picos/Computation/Tx/index.html), +`Computation` is essentially expressive enough to implement the +[event](https://ocaml.org/manual/latest/api/Event.html) abstraction of +[Concurrent ML](https://en.wikipedia.org/wiki/Concurrent_ML). The same features +that make `Computation` suitable for implementing more or less arbitrary dynamic +completion propagation networks make it suitable for implementing Concurrent ML +style abstractions. + +### `Fiber` + +A fiber corresponds to an independent thread of execution. Technically an +effects based scheduler creates a fiber, effectively giving it an identity, as +it runs some function under its handler. The `Fiber` abstraction provides a way +to share a proxy identity, and a bit of state, between a scheduler and other +concurrent abstractions. + +Here is an extract from the signature of the +[`Fiber` module](https://ocaml-multicore.github.io/picos/doc/picos/Picos/Fiber/index.html): + +```ocaml skip +type t + +val current : unit -> t + +val create : forbid:bool -> 'a Computation.t -> t +val spawn : t -> (t -> unit) -> unit + +val get_computation : t -> Computation.packed +val set_computation : t -> Computation.packed -> unit + +val has_forbidden : t -> bool +val exchange : t -> forbid:bool -> bool + +module FLS : sig (* ... *) end +``` + +Fibers are where all of the low level bits and pieces of Picos come together, +which makes it difficult to give both meaningful and concise examples, but let's +implement a slightly simplistic structured concurrency mechanism: + +```ocaml skip +type t (* represents a scope *) +val run : (t -> unit) -> unit +val fork : t -> (unit -> unit) -> unit +``` + +The idea here is that `run` creates a "scope" and waits until all of the fibers +forked into the scope have finished. In case any fiber raises an unhandled +exception, or the main fiber that created the scope is canceled, all of the +fibers are canceled and an exception is raised. To keep things slightly simpler, +only the first exception is kept. + +A scope can be represented by a simple record type: + +```ocaml +type t = { + count : int Atomic.t; + inner : unit Computation.t; + ended : Trigger.t; +} +``` + +The idea is that after a fiber is finished, we decrement the count and if it +becomes zero, we finish the computation and signal the main fiber that the scope +has ended: + +```ocaml +let decr t = + let n = Atomic.fetch_and_add t.count (-1) in + if n = 1 then begin + Computation.finish t.inner; + Trigger.signal t.ended + end +``` + +When forking a fiber, we increment the count unless it already was zero, in +which case we raise an error: + +```ocaml +let rec incr t = + let n = Atomic.get t.count in + if n = 0 then invalid_arg "ended"; + if not (Atomic.compare_and_set t.count n (n + 1)) + then incr t +``` + +The fork operation is now relatively straightforward to implement: + +```ocaml +let fork t action = + incr t; + try + let main _ = + match action () with + | () -> decr t + | exception exn -> + let bt = Printexc.get_raw_backtrace () in + Computation.cancel t.inner exn bt; + decr t + in + let fiber = + Fiber.create ~forbid:false t.inner + in + Fiber.spawn fiber main + with canceled_exn -> + decr t; + raise canceled_exn +``` + +The above `fork` first increments the count and then tries to spawn a fiber. The +Picos interface specifies that when `Fiber.spawn` returns normally, the action, +`main`, must be called by the scheduler. This allows us to ensure that the +increment is always matched with a decrement. + +Setting up a scope is the most complex operation: + + + +```ocaml +let run body = + let count = Atomic.make 1 in + let inner = Computation.create () in + let ended = Trigger.create () in + let t = { count; inner; ended } in + let fiber = Fiber.current () in + let (Packed outer) = + Fiber.get_computation fiber + in + let canceler = + Computation.attach_canceler + ~from:outer + ~into:t.inner + in + match + Fiber.set_computation fiber (Packed t.inner); + body t + with + | () -> join t outer canceler fiber + | exception exn -> + let bt = Printexc.get_raw_backtrace () in + Computation.cancel t.inner exn bt; + join t outer canceler fiber; + Printexc.raise_with_backtrace exn bt +``` + +The `Computation.attach_canceler` operation attaches a special trigger to +propagate cancelation from one computation into another. After the body exits, +`join` + +```ocaml +let join t outer canceler fiber = + decr t; + Fiber.set_computation fiber (Packed outer); + let forbid = Fiber.exchange fiber ~forbid:true in + Trigger.await t.ended |> ignore; + Fiber.set fiber ~forbid; + Computation.detach outer canceler; + Computation.check t.inner; + Fiber.check fiber +``` + +is called to wait for the scoped fibers and restore the state of the main fiber. +An important detail is that propagation of cancelation is forbidden by setting +the `forbid` flag to `true` before the call of `Trigger.await`. This is +necessary to ensure that `join` does not exit, due to the fiber being canceled, +before all of the child fibers have actually finished. Finally, `join` checks +the inner computation and the fiber, which means that an exception will be +raised in case either was canceled. + +The design of `Fiber` includes several key features: + +- The low level design allows one to both avoid unnecessary overheads, such as + allocating a `Computation.t` for every fiber, when implementing simple + abstractions and also to implement more complex behaviors that might prove + difficult given e.g. a higher level design with a built-in notion of + hierarchy. + +- As `Fiber.t` stores the `forbid` flag and the `Computation.t` associated with + the fiber one need not pass those as arguments through the program. This + allows various concurrent abstractions to be given traditional interfaces, + which would otherwise need to be complicated. + +- Effects are relatively expensive. The cost of performing effects can be + amortized by obtaining the `Fiber.t` once and then manipulating it multiple + times. + +- A `Fiber.t` also provides an identity for the fiber. It has so far proven to + be sufficient for most purposes. Fiber local storage, which we do not cover + here, can be used to implement, for example, a unique integer id for fibers. + +### Assumptions + +Now, consider the `Ivar` abstraction presented earlier as an example of the use +of the `Trigger` abstraction. That `Ivar` implementation, as well as the +`Computation` based implementation, works exactly as desired inside the scope +abstraction presented in the previous section. In particular, a blocked +`Ivar.read` can be canceled, either when another fiber in a scope raises an +unhandled exception or when the main fiber of the scope is canceled, which +allows the fiber to continue by raising an exception after cleaning up. In fact, +Picos comes with a number of libraries that all would work quite nicely with the +examples presented here. + +For example, a library provides an operation to run a block with a timeout on +the current fiber. One could use it with `Ivar.read` to implement a read +operation +[with a timeout](https://ocaml-multicore.github.io/picos/doc/picos_std/Picos_std_structured/Control/index.html#val-terminate_after): + +```ocaml +let read_in ~seconds ivar = + Control.terminate_after ~seconds @@ fun () -> + Ivar.read ivar +``` + +This interoperability is not accidental. For example, the scope abstraction +basically assumes that one does not use `Fiber.set_computation`, in an arbitrary +unscoped manner inside the scoped fibers. An idea with the Picos interface +actually is that it is not supposed to be used by applications at all and most +higher level libraries should be built on top of libraries that do not directly +expose elements of the Picos interface. + +Perhaps more interestingly, there are obviously limits to what can be achieved +in an "interoperable" manner. Imagine an operation like + +```ocaml skip +val at_exit : (unit -> unit) -> unit +``` + +that would allow one to run an action just before a fiber exits. One could, of +course, use a custom spawn function that would support such cleanup, but then +`at_exit` could only be used on fibers spawned through that particular spawn +function. + +### The effects + +As mentioned previously, the Picos interface is implemented partially in terms +of five effects: + +```ocaml version>=5.0.0 +type _ Effect.t += + | Await : Trigger.t -> (exn * Printexc.raw_backtrace) option Effect.t + | Cancel_after : { + seconds : float; + exn: exn; + bt : Printexc.raw_backtrace; + computation : 'a Computation.t; + } + -> unit Effect.t + | Current : t Effect.t + | Yield : unit Effect.t + | Spawn : { + fiber : Fiber.t; + main : (Fiber.t -> unit); + } + -> unit Effect.t +``` + +A scheduler must handle those effects as specified in the Picos documentation. + +The Picos interface does not, in particular, dictate which ready fibers a +scheduler must run next and on which domains. Picos also does not require that a +fiber should stay on the domain on which it was spawned. Abstractions +implemented against the Picos interface should not assume any particular +scheduling. + +Picos actually comes with +[a randomized multithreaded scheduler](https://ocaml-multicore.github.io/picos/doc/picos_std/Picos_std_randos/index.html), +that, after handling any of the effects, picks the next ready fiber randomly. It +has proven to be useful for testing that abstractions implemented in Picos do +not make invalid scheduling assumptions. + +When a concurrent abstraction requires a particular scheduling, it should +primarily be achieved through the use of synchronization abstractions like when +programming with traditional threads. Application programs may, of course, pick +specific schedulers. + +## Status and results + +We have an experimental design and implementation of the core Picos interface as +illustrated in the previous section. We have also created several _Picos +compatible_ +[sample schedulers](https://ocaml-multicore.github.io/picos/doc/picos_mux/index.html). +A scheduler, in this context, just multiplexes fibers to run on one or more +system level threads. We have also created some sample higher-level +[scheduler agnostic libraries](https://ocaml-multicore.github.io/picos/doc/picos_std/index.html) +_Implemented in Picos_. These libraries include +[a library for resource management](https://ocaml-multicore.github.io/picos/doc/picos_std/Picos_std_finally/index.html), +[a library for structured concurrency](https://ocaml-multicore.github.io/picos/doc/picos_std/Picos_std_structured/index.html), +[a library of synchronization primitives](https://ocaml-multicore.github.io/picos/doc/picos_std/Picos_std_sync/index.html), +and +[an asynchronous I/O library](https://ocaml-multicore.github.io/picos/doc/picos_io/Picos_io/index.html). +The synchronization library and the I/O library intentionally mimic libraries +that come with the OCaml distribution. All of the libraries work with all of the +schedulers and all of these _elements_ are interoperable and entirely opt-in. + +What is worth explicitly noting is that all of these schedulers and libraries +are small, independent, and highly modular pieces of code. They all crucially +depend on and are decoupled from each other via the core Picos interface +library. A basic single threaded scheduler implementation requires only about +100 lines of code (LOC). A more complex parallel scheduler might require a +couple of hundred LOC. The scheduler agnostic libraries are similarly small. + +Here is an +[example](https://ocaml-multicore.github.io/picos/doc/picos_std/Picos_std_structured/index.html#a-simple-echo-server-and-clients) +of a concurrent echo server using the scheduler agnostic libraries provided as +samples: + +```ocaml +let run_server server_fd = + Unix.listen server_fd 8; + Flock.join_after begin fun () -> + while true do + let@ client_fd = instantiate Unix.close @@ fun () -> + Unix.accept ~cloexec:true server_fd |> fst + in + Flock.fork begin fun () -> + let@ client_fd = move client_fd in + Unix.set_nonblock client_fd; + let bs = Bytes.create 100 in + let n = + Unix.read client_fd bs 0 (Bytes.length bs) + in + Unix.write client_fd bs 0 n |> ignore + end + done + end +``` + +The +[`Unix`](https://ocaml-multicore.github.io/picos/doc/picos_io/Picos_io/Unix/index.html) +module is provided by the I/O library. The operations on file descriptors on +that module, such as `accept`, `read`, and `write`, use the Picos interface to +suspend fibers allowing other fibers to run while waiting for I/O. The +[`Flock`](https://ocaml-multicore.github.io/picos/doc/picos_std/Picos_std_structured/Flock/index.html) +module comes from the structured concurrency library. A call of +[`join_after`](https://ocaml-multicore.github.io/picos/doc/picos_std/Picos_std_structured/Flock/index.html#val-join_after) +returns only after all the fibers +[`fork`](https://ocaml-multicore.github.io/picos/doc/picos_std/Picos_std_structured/Flock/index.html#val-fork)ed +into the flock have terminated. If the main fiber of the flock is canceled, or +any fiber within the flock raises an unhandled exception, all the fibers within +the flock will be canceled and an exception will be raised on the main fiber of +the flock. The +[`let@`](https://ocaml-multicore.github.io/picos/doc/picos_std/Picos_std_finally/index.html#val-let@), +[`finally`](https://ocaml-multicore.github.io/picos/doc/picos_std/Picos_std_finally/index.html#val-instantiate), +and +[`move`](https://ocaml-multicore.github.io/picos/doc/picos_std/Picos_std_finally/index.html#val-move) +operations come from the resource management library and allow dealing with +resources in a leak-free manner. The responsibility to close the `client_fd` +socket is +[`move`](https://ocaml-multicore.github.io/picos/doc/picos_std/Picos_std_finally/index.html#val-move)d +from the main server fiber to a fiber forked to handle that client. + +We should emphasize that the above is just an example. The Picos interface +should be both expressive and efficient enough to support practical +implementations of many different kinds of concurrent programming models. Also, +as described previously, the Picos interface does not, for example, internally +implement structured concurrency. However, the abstractions provided by Picos +are designed to allow structured and unstructured concurrency to be _Implemented +in Picos_ as libraries that will then work with any _Picos compatible_ scheduler +and with other concurrent abstractions. + +Finally, an interesting demonstration that Picos really fundamentally is an +interface is +[a prototype _Picos compatible_ direct style interface to Lwt](https://ocaml-multicore.github.io/picos/doc/picos_lwt/Picos_lwt/index.html). +The implementation uses shallow effect handlers and defers all scheduling +decisions to Lwt. Running a program with the scheduler returns a Lwt promise. + +## Future work + +As mentioned previously, Picos is still an ongoing project and the design is +considered experimental. We hope that Picos soon matures to serve the needs of +both the commercial users of OCaml and the community at large. + +Previous sections already touched a couple of updates currently in development, +such as the support for finalizing resources stored in +[`FLS`](https://ocaml-multicore.github.io/picos/doc/picos/Picos/Fiber/FLS/index.html) +and the development of Concurrent ML style abstractions. We also have ongoing +work to formalize aspects of the Picos interface. + +One potential change we will be investigating is whether the +[`Computation`](https://ocaml-multicore.github.io/picos/doc/picos/Picos/Computation/index.html) +abstraction should be simplified to only support cancelation. + +The implementation of some operations, such as +[`Fiber.current`](https://ocaml-multicore.github.io/picos/doc/picos/Picos/Fiber/index.html#val-current) +to retrieve the current fiber proxy identity, do not strictly need to be +effects. Performing an effect is relatively expensive and we will likely design +a mechanism to store a reference to the current fiber in some sort of local +storage, which could significantly improve the performance of certain +abstractions, such as checked mutexes, that need to access the current fiber. + +We also plan to develop a minimalist library for spawning threads over domains, +much like Moonpool, in a cooperative manner for schedulers and other libraries. + +We also plan to make Domainslib Picos compatible, which will require developing +a more efficient non-effects based interface for spawning fibers, and +investigate making Eio Picos compatible. + +We also plan to design and implement asynchronous IO libraries for Picos using +various system call interface for asynchronous IO such as io_uring. + +Finally, Picos is supposed to be an _open ecosystem_. If you have feedback or +would like to work on something mentioned above, let us know. + +## Motivation + +There are already several concrete effects-based concurrent programming +libraries and models being developed. Here is a list of some such publicly +available projects:[\*](https://xkcd.com/927/) + +1. [Affect](https://github.com/dbuenzli/affect) — "Composable concurrency + primitives with OCaml effects handlers (unreleased)", +2. [Domainslib](https://github.com/ocaml-multicore/domainslib) — + "Nested-parallel programming", +3. [Eio](https://github.com/ocaml-multicore/eio) — "Effects-Based Parallel IO + for OCaml", +4. [Fuseau](https://github.com/c-cube/fuseau) — "Lightweight fiber library for + OCaml 5", +5. [Miou](https://github.com/robur-coop/miou) — "A simple scheduler for OCaml + 5", +6. [Moonpool](https://github.com/c-cube/moonpool) — "Commodity thread pools for + OCaml 5", and +7. [Riot](https://github.com/leostera/riot) — "An actor-model multi-core + scheduler for OCaml 5". + +All of the above libraries are mutually incompatible with each other with the +exception that Domainslib, Eio, and Moonpool implement an earlier +interoperability proposal called +[domain-local-await](https://github.com/ocaml-multicore/domain-local-await/) or +DLA, which allows a concurrent programming library like +[Kcas](https://github.com/ocaml-multicore/kcas/)[\*](https://github.com/ocaml-multicore/kcas/pull/136) +to work on all of those. Unfortunately, DLA, by itself, is known to be +insufficient and the design has not been universally accepted. + +By introducing a scheduler interface and key libraries, such as an IO library, +implemented on top of the interface, we hope that the scarce resources of the +OCaml community are not further divided into mutually incompatible ecosystems +built on top of such mutually incompatible concurrent programming libraries, +while, simultaneously, making it possible to experiment with many kinds of +concurrent programming models. + +It should be +technically[\*](https://www.youtube.com/watch?v=hou0lU8WMgo) possible +for all the previously mentioned libraries, except +[Miou](https://github.com/robur-coop/miou), to + +1. be made + [Picos compatible](https://ocaml-multicore.github.io/picos/doc/picos/index.html#picos-compatible), + i.e. to handle the Picos effects, and +2. have their elements + [implemented in Picos](https://ocaml-multicore.github.io/picos/doc/picos/index.html#implemented-in-picos), + i.e. to make them usable on other Picos-compatible schedulers. + +Please read +[the reference manual](https://ocaml-multicore.github.io/picos/doc/index.html) +for further information. diff --git a/picos/_doc-dir/odoc-pages/index.mld b/picos/_doc-dir/odoc-pages/index.mld new file mode 100644 index 0000000..c061e20 --- /dev/null +++ b/picos/_doc-dir/odoc-pages/index.mld @@ -0,0 +1,153 @@ +{0 Picos — Interoperable effects based concurrency} + +This packages contains the core {!Picos} interface library and auxiliary +libraries for dealing with the OCaml multithreading architecture. + +{1 Libraries} + +{!modules: + Picos + Picos_domain + Picos_thread +} + +{1 Introduction} + +{!Picos} is a {{:https://en.wikipedia.org/wiki/Systems_programming} systems +programming} interface between effects based schedulers and concurrent +abstractions. Picos is designed to enable an ecosystem of +{{:https://en.wikipedia.org/wiki/Interoperability} interoperable} elements of +{{:https://v2.ocaml.org/manual/effects.html} effects based} +{{:https://en.wikipedia.org/wiki/Cooperative_multitasking} cooperative} +{{:https://en.wikipedia.org/wiki/Concurrent_computing} concurrent programming +models} such as + +- {{:https://en.wikipedia.org/wiki/Scheduling_(computing)} schedulers} that + multiplex large numbers of {{:https://en.wikipedia.org/wiki/Green_thread} user + level fibers} to run on a small number of system level threads, +- mechanisms for managing fibers and for + {{:https://en.wikipedia.org/wiki/Structured_concurrency} structuring + concurrency}, +- communication and synchronization primitives, such as + {{:https://en.wikipedia.org/wiki/Monitor_(synchronization)} mutexes and + condition variables}, message queues, + {{:https://en.wikipedia.org/wiki/Software_transactional_memory} STMs}, and + more, and +- integrations with low level {{:https://en.wikipedia.org/wiki/Asynchronous_I/O} + asynchronous IO} systems. + +If you are the author of an application level concurrent programming library or +framework, then Picos should not fundamentally be competing with your work. +However, Picos and libraries built on top of Picos probably do have overlap with +your work and making your work Picos compatible may offer benefits: + +- You may find it useful that the {{!Picos} core} of Picos provides parallelism + safe building blocks for cancelation, which is a particularly tricky problem + to get right. +- You may find it useful that you don't have to reinvent many of the basic + communication and synchronization abstractions such as mutexes and condition + variables, promises, concurrent bounded queues, channels, and what not. +- You may benefit from further non-trivial libraries, such as IO libraries, that + you don't have to reimplement. +- Potential users of your work may be reassured and benefit from the ability to + mix-and-match your work with other Picos compatible libraries and frameworks. + +Of course, interoperability does have some costs. It takes time to understand +Picos and it takes time to implement Picos compatibility. Implementing your +programming model elements in terms of the Picos interface may not always give +ideal results. To address concerns such as those, a conscious effort has been +made to keep Picos as minimal and unopinionated as possible. + +{2 Interoperability} + +Picos is essentially an interface between schedulers and concurrent +abstractions. Two phrases, {i Picos compatible} and {i Implemented in Picos}, +are used to describe the opposing sides of this contract. + +{3 Picos compatible} + +The idea is that schedulers provide their own handlers for the Picos effects. +By handling the Picos effects a scheduler allows any libraries built on top of +the Picos interface to be used with the scheduler. Such a scheduler is then +said to be {i Picos compatible}. + +{3 Implemented in Picos} + +A scheduler is just one element of a concurrent programming model. Separately +from making a scheduler Picos compatible, one may choose to implement other +elements of the programming model, e.g. a particular approach to structuring +concurrency or a particular collection of communication and synchronization +primitives, in terms of the Picos interface. Such scheduler agnostic elements +can then be used on any Picos compatible scheduler and are said to be {i +Implemented in Picos}. + +{2 Design goals and principles} + +The {{!Picos} core} of Picos is designed and developed with various goals and +principles in mind. + +- {b Simple}: Picos should be kept as simple as possible. +- {b Minimal}: Picos should be kept minimal. The dependency footprint should be + as small as possible. Convenience features should be built on top of the + interface. +- {b Safe}: Picos should be designed with safety in mind. The implementation + must be data race free. The interface should promote and always allow proper + resource management. +- {b Unopinionated}: Picos should not make strong design choices that are + controversial. +- {b Flexible}: Picos should allow higher level libraries as much freedom as + possible to make their own design choices. + +The documentation of the {{!Picos} concepts} includes design rationale for some +of the specific ideas behind their detailed design. + +{3 Constraints Liberate, Liberties Constrain} + +Picos aims to be unopinionated and flexible enough to allow higher level +libraries to provide many different kinds of concurrent programming models. +While it is impossible to give a complete list of what Picos does not dictate, +it is perhaps illuminating to explicitly mention some of those: + +- Picos does not implement + {{:https://en.wikipedia.org/wiki/Capability-based_security} capability-based + security}. Higher level libraries with or without capabilities may be built + on top of Picos. +- Picos never cancels computations implicitly. Higher level libraries may + decide when cancelation should be allowed to take effect. +- Picos does not dictate which fiber should be scheduled next after a Picos + effect. Different schedulers may freely use desired data structures (queues, + work-stealing deques, stacks, priority queues, ...) and, after handling any + Picos effect, freely decide which fiber to run next. +- Picos does not dictate how fibers should be managed. It is possible to + implement both unstructured and structured concurrent programming models on + top of Picos. +- Picos does not dictate which mechanisms applications should use for + communication and synchronization. It is possible to build many different + kinds of communication and synchronization mechanisms on top of Picos + including mutexes and condition variables, STMs, asynchronous and synchronous + message passing, {{:https://en.wikipedia.org/wiki/Actor_model} actors}, and + more. +- Picos does not dictate that there should be a connection between the scheduler + and other elements of the concurrent programming model. It is possible to + provide those separately and mix-and-match. +- Picos does not dictate which library to use for IO. It is possible to build + direct-style asynchronous IO libraries on top of Picos that can then be used + with any Picos compatible schedulers or concurrent programming models. + +Let's build an incredible ecosystem of interoperable concurrent programming +libraries and frameworks! + +{1 Conventions} + +Many operation in the Picos libraries use +{{:https://en.wikipedia.org/wiki/Non-blocking_algorithm} non-blocking} +algorithms. Unless explicitly specified otherwise, + +- non-blocking operations in Picos are {i atomic} or {i strictly linearizable} + (i.e. {{:https://en.wikipedia.org/wiki/Linearizability} linearizable} and + {{:https://en.wikipedia.org/wiki/Database_transaction_schedule#Serializable} + serializable}), and +- {{:https://en.wikipedia.org/wiki/Non-blocking_algorithm#Lock-freedom} + lock-free} operations in Picos are designed to avoid having competing + operations of widely different complexities, which should make such operations + much less prone to starvation. diff --git a/picos/index.html b/picos/index.html new file mode 100644 index 0000000..74ae368 --- /dev/null +++ b/picos/index.html @@ -0,0 +1,2 @@ + +index (picos.index)

    Package picos

    This packages contains the core Picos interface library and auxiliary libraries for dealing with the OCaml multithreading architecture.

    Libraries

    • Picos A systems programming interface between effects based schedulers and concurrent abstractions.
    • Picos_domain Minimalistic domain API available both on OCaml 5 and on OCaml 4.
    • Picos_thread Minimalistic thread API available with or without threads.posix.

    Introduction

    Picos is a systems programming interface between effects based schedulers and concurrent abstractions. Picos is designed to enable an ecosystem of interoperable elements of effects based cooperative concurrent programming models such as

    If you are the author of an application level concurrent programming library or framework, then Picos should not fundamentally be competing with your work. However, Picos and libraries built on top of Picos probably do have overlap with your work and making your work Picos compatible may offer benefits:

    • You may find it useful that the core of Picos provides parallelism safe building blocks for cancelation, which is a particularly tricky problem to get right.
    • You may find it useful that you don't have to reinvent many of the basic communication and synchronization abstractions such as mutexes and condition variables, promises, concurrent bounded queues, channels, and what not.
    • You may benefit from further non-trivial libraries, such as IO libraries, that you don't have to reimplement.
    • Potential users of your work may be reassured and benefit from the ability to mix-and-match your work with other Picos compatible libraries and frameworks.

    Of course, interoperability does have some costs. It takes time to understand Picos and it takes time to implement Picos compatibility. Implementing your programming model elements in terms of the Picos interface may not always give ideal results. To address concerns such as those, a conscious effort has been made to keep Picos as minimal and unopinionated as possible.

    Interoperability

    Picos is essentially an interface between schedulers and concurrent abstractions. Two phrases, Picos compatible and Implemented in Picos, are used to describe the opposing sides of this contract.

    Picos compatible

    The idea is that schedulers provide their own handlers for the Picos effects. By handling the Picos effects a scheduler allows any libraries built on top of the Picos interface to be used with the scheduler. Such a scheduler is then said to be Picos compatible.

    Implemented in Picos

    A scheduler is just one element of a concurrent programming model. Separately from making a scheduler Picos compatible, one may choose to implement other elements of the programming model, e.g. a particular approach to structuring concurrency or a particular collection of communication and synchronization primitives, in terms of the Picos interface. Such scheduler agnostic elements can then be used on any Picos compatible scheduler and are said to be Implemented in Picos.

    Design goals and principles

    The core of Picos is designed and developed with various goals and principles in mind.

    • Simple: Picos should be kept as simple as possible.
    • Minimal: Picos should be kept minimal. The dependency footprint should be as small as possible. Convenience features should be built on top of the interface.
    • Safe: Picos should be designed with safety in mind. The implementation must be data race free. The interface should promote and always allow proper resource management.
    • Unopinionated: Picos should not make strong design choices that are controversial.
    • Flexible: Picos should allow higher level libraries as much freedom as possible to make their own design choices.

    The documentation of the concepts includes design rationale for some of the specific ideas behind their detailed design.

    Constraints Liberate, Liberties Constrain

    Picos aims to be unopinionated and flexible enough to allow higher level libraries to provide many different kinds of concurrent programming models. While it is impossible to give a complete list of what Picos does not dictate, it is perhaps illuminating to explicitly mention some of those:

    • Picos does not implement capability-based security. Higher level libraries with or without capabilities may be built on top of Picos.
    • Picos never cancels computations implicitly. Higher level libraries may decide when cancelation should be allowed to take effect.
    • Picos does not dictate which fiber should be scheduled next after a Picos effect. Different schedulers may freely use desired data structures (queues, work-stealing deques, stacks, priority queues, ...) and, after handling any Picos effect, freely decide which fiber to run next.
    • Picos does not dictate how fibers should be managed. It is possible to implement both unstructured and structured concurrent programming models on top of Picos.
    • Picos does not dictate which mechanisms applications should use for communication and synchronization. It is possible to build many different kinds of communication and synchronization mechanisms on top of Picos including mutexes and condition variables, STMs, asynchronous and synchronous message passing, actors, and more.
    • Picos does not dictate that there should be a connection between the scheduler and other elements of the concurrent programming model. It is possible to provide those separately and mix-and-match.
    • Picos does not dictate which library to use for IO. It is possible to build direct-style asynchronous IO libraries on top of Picos that can then be used with any Picos compatible schedulers or concurrent programming models.

    Let's build an incredible ecosystem of interoperable concurrent programming libraries and frameworks!

    Conventions

    Many operation in the Picos libraries use non-blocking algorithms. Unless explicitly specified otherwise,

    • non-blocking operations in Picos are atomic or strictly linearizable (i.e. linearizable and serializable), and
    • lock-free operations in Picos are designed to avoid having competing operations of widely different complexities, which should make such operations much less prone to starvation.

    Package info

    changes-files
    license-files
    readme-files
    diff --git a/tiny_httpd/Tiny_httpd/index.html b/tiny_httpd/Tiny_httpd/index.html new file mode 100644 index 0000000..c77babc --- /dev/null +++ b/tiny_httpd/Tiny_httpd/index.html @@ -0,0 +1,134 @@ + +Tiny_httpd (tiny_httpd.Tiny_httpd)

    Module Tiny_httpd

    Tiny Http Server

    This library implements a very simple, basic HTTP/1.1 server using blocking IOs and threads. Basic routing based is provided for convenience, so that several handlers can be registered.

    It is possible to use a thread pool, see create's argument new_thread.

    The echo example (see src/examples/echo.ml) demonstrates some of the features by declaring a few endpoints, including one for uploading files:

    module S = Tiny_httpd
+
+let () =
+  let server = S.create () in
+
+  (* say hello *)
+  S.add_route_handler ~meth:`GET server
+    S.Route.(exact "hello" @/ string @/ return)
+    (fun name _req -> S.Response.make_string (Ok ("hello " ^name ^"!\n")));
+
+  (* echo request *)
+  S.add_route_handler server
+    S.Route.(exact "echo" @/ return)
+    (fun req -> S.Response.make_string
+        (Ok (Format.asprintf "echo:@ %a@." S.Request.pp req)));
+
+  (* file upload *)
+  S.add_route_handler ~meth:`PUT server
+    S.Route.(exact "upload" @/ string_urlencoded @/ return)
+    (fun path req ->
+        try
+          let oc = open_out @@ "/tmp/" ^ path in
+          output_string oc req.S.Request.body;
+          flush oc;
+          S.Response.make_string (Ok "uploaded file")
+        with e ->
+          S.Response.fail ~code:500 "couldn't upload file: %s"
+            (Printexc.to_string e)
+      );
+
+  (* run the server *)
+  Printf.printf "listening on http://%s:%d\n%!" (S.addr server) (S.port server);
+  match S.run server with
+  | Ok () -> ()
+  | Error e -> raise e

    It is then possible to query it using curl:

    $ dune exec src/examples/echo.exe &
+listening on http://127.0.0.1:8080
+
+# the path "hello/name" greets you.
+$ curl -X GET http://localhost:8080/hello/quadrarotaphile
+hello quadrarotaphile!
+
+# the path "echo" just prints the request.
+$ curl -X GET http://localhost:8080/echo --data "howdy y'all"
+echo:
+{meth=GET;
+ headers=Host: localhost:8080
+         User-Agent: curl/7.66.0
+         Accept: */*
+         Content-Length: 10
+         Content-Type: application/x-www-form-urlencoded;
+ path="/echo"; body="howdy y'all"}
+
+

    Tiny buffer implementation

    These buffers are used to avoid allocating too many byte arrays when processing streams and parsing requests.

    module Buf = Tiny_httpd_core.Buf

    IO Abstraction

    module IO = Tiny_httpd_core.IO

    Logging

    module Log = Tiny_httpd_core.Log

    Utils

    module Util = Tiny_httpd_core.Util

    Resource pool

    module Pool = Tiny_httpd_core.Pool

    Static directory serving

    module Dir = Tiny_httpd_unix.Dir
    module type VFS = Tiny_httpd_unix.Dir.VFS

    HTML combinators

    module Html = Tiny_httpd_html

    Alias to Tiny_httpd_html

    Main server types

    module Request = Tiny_httpd_core.Request
    module Response = Tiny_httpd_core.Response
    module Response_code = Tiny_httpd_core.Response_code
    module Route = Tiny_httpd_core.Route
    module Headers = Tiny_httpd_core.Headers
    module Meth = Tiny_httpd_core.Meth
    module Server = Tiny_httpd_core.Server
    exception Bad_req of int * string

    Exception raised to exit request handlers with a code+error message

    Middlewares

    A middleware can be inserted in a handler to modify or observe its behavior.

    • since 0.11
    module Middleware = Server.Middleware
    module Head_middleware = Server.Head_middleware

    A middleware that only considers the request's head+headers.

    Main Server type

    A HTTP server. See create for more details.

    module type IO_BACKEND = Server.IO_BACKEND

    A backend that provides IO operations, network operations, etc.

    val create_from : + ?enable_logging:bool -> + ?buf_size:int -> + ?head_middlewares:Head_middleware.t list -> + ?middlewares:([ `Encoding | `Stage of int ] * Middleware.t) list -> + backend:(module IO_BACKEND) -> + unit -> + t

    Create a new webserver using provided backend.

    The server will not do anything until run is called on it. Before starting the server, one can use add_path_handler and set_top_handler to specify how to handle incoming requests.

    • parameter buf_size

      size for buffers (since 0.11)

    • parameter enable_logging

      if true and Logs is installed, emit logs via Logs (since 0.18). Default true.

    • since 0.14
    val addr : t -> string

    Address on which the server listens.

    val is_ipv6 : t -> bool

    is_ipv6 server returns true iff the address of the server is an IPv6 address.

    • since 0.3
    val port : t -> int

    Port on which the server listens. Note that this might be different than the port initially given if the port was 0 (meaning that the OS picks a port for us).

    val active_connections : t -> int

    Number of currently active connections.

    val add_decode_request_cb : + t -> + (unit Tiny_httpd_core.Request.t -> + (unit Tiny_httpd_core.Request.t + * (Tiny_httpd_core.IO.Input.t -> + Tiny_httpd_core.IO.Input.t)) + option) -> + unit

    Add a callback for every request. The callback can provide a stream transformer and a new request (with modified headers, typically). A possible use is to handle decompression by looking for a Transfer-Encoding header and returning a stream transformer that decompresses on the fly.

    val add_encode_response_cb : + t -> + (unit Tiny_httpd_core.Request.t -> + Tiny_httpd_core.Response.t -> + Tiny_httpd_core.Response.t option) -> + unit

    Add a callback for every request/response pair. Similarly to add_encode_response_cb the callback can return a new response, for example to compress it. The callback is given the query with only its headers, as well as the current response.

    val add_middleware : + stage:[ `Encoding | `Stage of int ] -> + t -> + Middleware.t -> + unit

    Add a middleware to every request/response pair.

    • parameter stage

      specify when middleware applies. Encoding comes first (outermost layer), then stages in increasing order.

    • raises Invalid_argument

      if stage is `Stage n where n < 1

    • since 0.11
    val add_head_middleware : t -> Head_middleware.t -> unit

    Add a request-header only Head_middleware.t. This is called on requests, to modify them, and returns a new request immediately.

    • since 0.18
    Request handlers

    Setup a handler called by default.

    This handler is called with any request not accepted by any handler installed via add_path_handler. If no top handler is installed, unhandled paths will return a 404 not found

    This used to take a string Request.t but it now takes a byte_stream Request.t since 0.14 . Use Request.read_body_full to read the body into a string if needed.

    val add_route_handler : + ?accept: + (unit Tiny_httpd_core.Request.t -> + (unit, Tiny_httpd_core.Response_code.t * string) result) -> + ?middlewares:Middleware.t list -> + ?meth:Tiny_httpd_core.Meth.t -> + t -> + ('a, string Tiny_httpd_core.Request.t -> Tiny_httpd_core.Response.t) + Tiny_httpd_core.Route.t -> + 'a -> + unit

    add_route_handler server Route.(exact "path" @/ string @/ int @/ return) f calls f "foo" 42 request when a request with path "path/foo/42/" is received.

    Note that the handlers are called in the reverse order of their addition, so the last registered handler can override previously registered ones.

    • parameter meth

      if provided, only accept requests with the given method. Typically one could react to `GET or `PUT.

    • parameter accept

      should return Ok() if the given request (before its body is read) should be accepted, Error (code,message) if it's to be rejected (e.g. because its content is too big, or for some permission error). See the http_of_dir program for an example of how to use accept to filter uploads that are too large before the upload even starts. The default always returns Ok(), i.e. it accepts all requests.

    • since 0.6
    val add_route_handler_stream : + ?accept: + (unit Tiny_httpd_core.Request.t -> + (unit, Tiny_httpd_core.Response_code.t * string) result) -> + ?middlewares:Middleware.t list -> + ?meth:Tiny_httpd_core.Meth.t -> + t -> + ('a, + Tiny_httpd_core.IO.Input.t Tiny_httpd_core.Request.t -> + Tiny_httpd_core.Response.t) + Tiny_httpd_core.Route.t -> + 'a -> + unit

    Similar to add_route_handler, but where the body of the request is a stream of bytes that has not been read yet. This is useful when one wants to stream the body directly into a parser, json decoder (such as Jsonm) or into a file.

    • since 0.6
    Server-sent events

    EXPERIMENTAL: this API is not stable yet.

    module type SERVER_SENT_GENERATOR = Server.SERVER_SENT_GENERATOR

    A server-side function to generate of Server-sent events.

    type server_sent_generator = (module SERVER_SENT_GENERATOR)

    Server-sent event generator. This generates events that are forwarded to the client (e.g. the browser).

    • since 0.9
    val add_route_server_sent_handler : + ?accept: + (unit Tiny_httpd_core.Request.t -> + (unit, Tiny_httpd_core.Response_code.t * string) result) -> + ?middlewares:Head_middleware.t list -> + t -> + ('a, string Tiny_httpd_core.Request.t -> server_sent_generator -> unit) + Tiny_httpd_core.Route.t -> + 'a -> + unit

    Add a handler on an endpoint, that serves server-sent events.

    The callback is given a generator that can be used to send events as it pleases. The connection is always closed by the client, and the accepted method is always GET. This will set the header "content-type" to "text/event-stream" automatically and reply with a 200 immediately. See server_sent_generator for more details.

    This handler stays on the original thread (it is synchronous).

    • since 0.9
    Upgrade handlers

    These handlers upgrade the connection to another protocol.

    • since 0.17
    module type UPGRADE_HANDLER = Server.UPGRADE_HANDLER

    Handler that upgrades to another protocol.

    type upgrade_handler = (module UPGRADE_HANDLER)
    • since 0.17
    val add_upgrade_handler : + ?accept: + (unit Tiny_httpd_core.Request.t -> + (unit, Tiny_httpd_core.Response_code.t * string) result) -> + ?middlewares:Head_middleware.t list -> + t -> + ('a, upgrade_handler) Tiny_httpd_core.Route.t -> + 'a -> + unit
    Run the server
    val running : t -> bool

    Is the server running?

    • since 0.14
    val stop : t -> unit

    Ask the server to stop. This might not have an immediate effect as run might currently be waiting on IO.

    val run : ?after_init:(unit -> unit) -> t -> (unit, exn) result

    Run the main loop of the server, listening on a socket described at the server's creation time, using new_thread to start a thread for each new client.

    This returns Ok () if the server exits gracefully, or Error e if it exits with an error.

    • parameter after_init

      is called after the server starts listening. since 0.13 .

    val run_exn : ?after_init:(unit -> unit) -> t -> unit

    run_exn s is like run s but re-raises an exception if the server exits with an error.

    • since 0.14
    val create : + ?enable_logging:bool -> + ?masksigpipe:bool -> + ?max_connections:int -> + ?timeout:float -> + ?buf_size:int -> + ?get_time_s:(unit -> float) -> + ?new_thread:((unit -> unit) -> unit) -> + ?addr:string -> + ?port:int -> + ?sock:Unix.file_descr -> + ?head_middlewares:Head_middleware.t list -> + ?middlewares:([ `Encoding | `Stage of int ] * Middleware.t) list -> + unit -> + t

    Create a new webserver using UNIX abstractions.

    The server will not do anything until run is called on it. Before starting the server, one can use add_path_handler and set_top_handler to specify how to handle incoming requests.

    • parameter masksigpipe

      if true, block the signal Sys.sigpipe which otherwise tends to kill client threads when they try to write on broken sockets. Default: true except when on Windows, which defaults to false.

    • parameter buf_size

      size for buffers (since 0.11)

    • parameter new_thread

      a function used to spawn a new thread to handle a new client connection. By default it is Thread.create but one could use a thread pool instead. See for example this use of moonpool.

    • parameter max_connections

      maximum number of simultaneous connections.

    • parameter timeout

      connection is closed if the socket does not do read or write for the amount of second. Default: 0.0 which means no timeout. timeout is not recommended when using proxy.

    • parameter addr

      address (IPv4 or IPv6) to listen on. Default "127.0.0.1".

    • parameter port

      to listen on. Default 8080.

    • parameter sock

      an existing socket given to the server to listen on, e.g. by systemd on Linux (or launchd on macOS). If passed in, this socket will be used instead of the addr and port. If not passed in, those will be used. This parameter exists since 0.10.

    • parameter enable_logging

      if true and Logs is installed, log requests. Default true. This parameter exists since 0.18. Does not affect debug-level logs.

    • parameter get_time_s

      obtain the current timestamp in seconds. This parameter exists since 0.11.

    diff --git a/tiny_httpd/Tiny_httpd_core/Atomic_/index.html b/tiny_httpd/Tiny_httpd_core/Atomic_/index.html new file mode 100644 index 0000000..9e1dfdc --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core/Atomic_/index.html @@ -0,0 +1,64 @@ + +Atomic_ (tiny_httpd.Tiny_httpd_core.Atomic_)

    Module Tiny_httpd_core.Atomic_

    include module type of struct include Stdlib.Atomic end
    type !'a t = 'a Stdlib.Atomic.t

    An atomic (mutable) reference to a value of type 'a.

    val make : 'a -> 'a t

    Create an atomic reference.

    val make_contended : 'a -> 'a t

    Create an atomic reference that is alone on a cache line. It occupies 4-16x the memory of one allocated with make v.

    The primary purpose is to prevent false-sharing and the resulting performance degradation. When a CPU performs an atomic operation, it temporarily takes ownership of an entire cache line that contains the atomic reference. If multiple atomic references share the same cache line, modifying these disjoint memory regions simultaneously becomes impossible, which can create a bottleneck. Hence, as a general guideline, if an atomic reference is experiencing contention, assigning it its own cache line may enhance performance.

    val get : 'a t -> 'a

    Get the current value of the atomic reference.

    val set : 'a t -> 'a -> unit

    Set a new value for the atomic reference.

    val exchange : 'a t -> 'a -> 'a

    Set a new value for the atomic reference, and return the current value.

    val compare_and_set : 'a t -> 'a -> 'a -> bool

    compare_and_set r seen v sets the new value of r to v only if its current value is physically equal to seen -- the comparison and the set occur atomically. Returns true if the comparison succeeded (so the set happened) and false otherwise.

    val fetch_and_add : int t -> int -> int

    fetch_and_add r n atomically increments the value of r by n, and returns the current value (before the increment).

    val incr : int t -> unit

    incr r atomically increments the value of r by 1.

    val decr : int t -> unit

    decr r atomically decrements the value of r by 1.

    Examples

    Basic Thread Coordination

    A basic use case is to have global counters that are updated in a thread-safe way, for example to keep some sorts of metrics over IOs performed by the program. Another basic use case is to coordinate the termination of threads in a given program, for example when one thread finds an answer, or when the program is shut down by the user.

    Here, for example, we're going to try to find a number whose hash satisfies a basic property. To do that, we'll run multiple threads which will try random numbers until they find one that works.

    Of course the output below is a sample run and will change every time the program is run.

    (* use for termination *)
+let stop_all_threads = Atomic.make false
+
+(* total number of individual attempts to find a number *)
+let num_attempts = Atomic.make 0
+
+(* find a number that satisfies [p], by... trying random numbers
+   until one fits. *)
+let find_number_where (p:int -> bool) =
+  let rand = Random.State.make_self_init() in
+  while not (Atomic.get stop_all_threads) do
+
+    let n = Random.State.full_int rand max_int in
+    ignore (Atomic.fetch_and_add num_attempts 1 : int);
+
+    if p (Hashtbl.hash n) then (
+      Printf.printf "found %d (hash=%d)\n%!" n (Hashtbl.hash n);
+      Atomic.set stop_all_threads true; (* signal all threads to stop *)
+    )
+  done;;
+
+
+(* run multiple domains to search for a [n] where [hash n <= 100] *)
+let () =
+  let criterion n = n <= 100 in
+  let threads =
+    Array.init 8
+      (fun _ -> Domain.spawn (fun () -> find_number_where criterion))
+  in
+  Array.iter Domain.join threads;
+  Printf.printf "total number of attempts: %d\n%!"
+    (Atomic.get num_attempts) ;;
+
+- : unit = ()
+found 1651745641680046833 (hash=33)
+total number of attempts: 30230350

    Treiber Stack

    Another example is a basic Treiber stack (a thread-safe stack) that can be safely shared between threads.

    Note how both push and pop are recursive, because they attempt to swap the new stack (with one more, or one fewer, element) with the old stack. This is optimistic concurrency: each iteration of, say, push stack x gets the old stack l, and hopes that by the time it tries to replace l with x::l, nobody else has had time to modify the list. If the compare_and_set fails it means we were too optimistic, and must try again.

    type 'a stack = 'a list Atomic.t
+
+let rec push (stack: _ stack) elt : unit =
+  let cur = Atomic.get stack in
+  let success = Atomic.compare_and_set stack cur (elt :: cur) in
+  if not success then
+    push stack elt
+
+let rec pop (stack: _ stack) : _ option =
+  let cur = Atomic.get stack in
+  match cur with
+  | [] -> None
+  | x :: tail ->
+    let success = Atomic.compare_and_set stack cur tail in
+    if success then Some x
+    else pop stack
+
+# let st = Atomic.make []
+# push st 1
+- : unit = ()
+# push st 2
+- : unit = ()
+# pop st
+- : int option = Some 2
+# pop st
+- : int option = Some 1
+# pop st
+- : int option = None
    diff --git a/tiny_httpd/Tiny_httpd_core/Buf/index.html b/tiny_httpd/Tiny_httpd_core/Buf/index.html new file mode 100644 index 0000000..faf8723 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core/Buf/index.html @@ -0,0 +1,2 @@ + +Buf (tiny_httpd.Tiny_httpd_core.Buf)

    Module Tiny_httpd_core.Buf

    Simple buffer.

    These buffers are used to avoid allocating too many byte arrays when processing streams and parsing requests.

    • since 0.12
    type t
    val size : t -> int
    val clear : t -> unit
    val create : ?size:int -> unit -> t
    val of_bytes : bytes -> t
    val contents : t -> string
    val clear_and_zero : t -> unit

    Clear the buffer and zero out its storage.

    • since 0.15
    val bytes_slice : t -> bytes

    Access underlying slice of bytes.

    • since 0.5
    val contents_and_clear : t -> string

    Get contents of the buffer and clear it.

    • since 0.5
    val add_char : t -> char -> unit

    Add a single char.

    • since 0.14
    val add_bytes : t -> bytes -> int -> int -> unit

    Append given bytes slice to the buffer.

    • since 0.5
    val add_string : t -> string -> unit

    Add string.

    • since 0.14
    val add_buffer : t -> Stdlib.Buffer.t -> unit

    Append bytes from buffer.

    • since 0.14
    diff --git a/tiny_httpd/Tiny_httpd_core/Headers/index.html b/tiny_httpd/Tiny_httpd_core/Headers/index.html new file mode 100644 index 0000000..ea1f0a7 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core/Headers/index.html @@ -0,0 +1,2 @@ + +Headers (tiny_httpd.Tiny_httpd_core.Headers)

    Module Tiny_httpd_core.Headers

    Headers

    Headers are metadata associated with a request or response.

    type t = (string * string) list

    The header files of a request or response.

    Neither the key nor the value can contain '\r' or '\n'. See https://tools.ietf.org/html/rfc7230#section-3.2

    val empty : t

    Empty list of headers.

    • since 0.5
    val get : ?f:(string -> string) -> string -> t -> string option

    get k headers looks for the header field with key k.

    • parameter f

      if provided, will transform the value before it is returned.

    val get_exn : ?f:(string -> string) -> string -> t -> string
    • raises Not_found
    val set : string -> string -> t -> t

    set k v headers sets the key k to value v. It erases any previous entry for k

    val remove : string -> t -> t

    Remove the key from the headers, if present.

    val contains : string -> t -> bool

    Is there a header with the given key?

    val pp : Stdlib.Format.formatter -> t -> unit

    Pretty print the headers.

    /

    val parse_ : buf:Buf.t -> IO.Input.t -> t
    val parse_line_ : string -> (string * string, string) result

    /

    diff --git a/tiny_httpd/Tiny_httpd_core/IO/Input/class-bufferized/index.html b/tiny_httpd/Tiny_httpd_core/IO/Input/class-bufferized/index.html new file mode 100644 index 0000000..baafd29 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core/IO/Input/class-bufferized/index.html @@ -0,0 +1,2 @@ + +bufferized (tiny_httpd.Tiny_httpd_core.IO.Input.bufferized)

    Class Input.bufferized

    inherit Iostream__.In.t
    method fill_buf : unit -> Iostream__.Slice.t

    ic#fill_buf() returns a slice into the ic's internal buffer, and ensures it's empty only if ic.ic is empty. In other words, the invariant is that this only returns an empty slice if the input stream is exhausted.

    method consume : int -> unit

    Consume n bytes from the inner buffer. This is only valid if the last call to fill_buf returned a slice with at least n bytes.

    diff --git a/tiny_httpd/Tiny_httpd_core/IO/Input/class-of_bytes/index.html b/tiny_httpd/Tiny_httpd_core/IO/Input/class-of_bytes/index.html new file mode 100644 index 0000000..25b1bd8 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core/IO/Input/class-of_bytes/index.html @@ -0,0 +1,2 @@ + +of_bytes (tiny_httpd.Tiny_httpd_core.IO.Input.of_bytes)

    Class Input.of_bytes

    inherit Iostream__.In.t
    method fill_buf : unit -> Iostream__.Slice.t

    ic#fill_buf() returns a slice into the ic's internal buffer, and ensures it's empty only if ic.ic is empty. In other words, the invariant is that this only returns an empty slice if the input stream is exhausted.

    method consume : int -> unit

    Consume n bytes from the inner buffer. This is only valid if the last call to fill_buf returned a slice with at least n bytes.

    diff --git a/tiny_httpd/Tiny_httpd_core/IO/Input/class-of_in_channel/index.html b/tiny_httpd/Tiny_httpd_core/IO/Input/class-of_in_channel/index.html new file mode 100644 index 0000000..9adbd9e --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core/IO/Input/class-of_in_channel/index.html @@ -0,0 +1,2 @@ + +of_in_channel (tiny_httpd.Tiny_httpd_core.IO.Input.of_in_channel)

    Class Input.of_in_channel

    inherit Iostream__.In.t
    method fill_buf : unit -> Iostream__.Slice.t

    ic#fill_buf() returns a slice into the ic's internal buffer, and ensures it's empty only if ic.ic is empty. In other words, the invariant is that this only returns an empty slice if the input stream is exhausted.

    method consume : int -> unit

    Consume n bytes from the inner buffer. This is only valid if the last call to fill_buf returned a slice with at least n bytes.

    diff --git a/tiny_httpd/Tiny_httpd_core/IO/Input/class-of_string/index.html b/tiny_httpd/Tiny_httpd_core/IO/Input/class-of_string/index.html new file mode 100644 index 0000000..eb57393 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core/IO/Input/class-of_string/index.html @@ -0,0 +1,2 @@ + +of_string (tiny_httpd.Tiny_httpd_core.IO.Input.of_string)

    Class Input.of_string

    inherit Iostream__.In.t
    method fill_buf : unit -> Iostream__.Slice.t

    ic#fill_buf() returns a slice into the ic's internal buffer, and ensures it's empty only if ic.ic is empty. In other words, the invariant is that this only returns an empty slice if the input stream is exhausted.

    method consume : int -> unit

    Consume n bytes from the inner buffer. This is only valid if the last call to fill_buf returned a slice with at least n bytes.

    diff --git a/tiny_httpd/Tiny_httpd_core/IO/Input/class-open_file/index.html b/tiny_httpd/Tiny_httpd_core/IO/Input/class-open_file/index.html new file mode 100644 index 0000000..e1968d5 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core/IO/Input/class-open_file/index.html @@ -0,0 +1,2 @@ + +open_file (tiny_httpd.Tiny_httpd_core.IO.Input.open_file)

    Class Input.open_file

    inherit Iostream__.In.t
    method fill_buf : unit -> Iostream__.Slice.t

    ic#fill_buf() returns a slice into the ic's internal buffer, and ensures it's empty only if ic.ic is empty. In other words, the invariant is that this only returns an empty slice if the input stream is exhausted.

    method consume : int -> unit

    Consume n bytes from the inner buffer. This is only valid if the last call to fill_buf returned a slice with at least n bytes.

    diff --git a/tiny_httpd/Tiny_httpd_core/IO/Input/class-t_from_refill/index.html b/tiny_httpd/Tiny_httpd_core/IO/Input/class-t_from_refill/index.html new file mode 100644 index 0000000..e06066a --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core/IO/Input/class-t_from_refill/index.html @@ -0,0 +1,2 @@ + +t_from_refill (tiny_httpd.Tiny_httpd_core.IO.Input.t_from_refill)

    Class Input.t_from_refill

    A mixin to implement a buffered input by only providing a refill method. Add a close method and it's good to go.

    method private virtual refill : Iostream__.Slice.t -> unit

    Implementation of the stream: this takes a slice, resets its offset, and fills it with bytes. It must write at least one byte in the slice, unless the underlying input has reached its end.

    method input : bytes -> int -> int -> int
    method fill_buf : unit -> Iostream__.Slice.t
    method consume : int -> unit
    diff --git a/tiny_httpd/Tiny_httpd_core/IO/Input/class-type-t/index.html b/tiny_httpd/Tiny_httpd_core/IO/Input/class-type-t/index.html new file mode 100644 index 0000000..178734a --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core/IO/Input/class-type-t/index.html @@ -0,0 +1,2 @@ + +t (tiny_httpd.Tiny_httpd_core.IO.Input.t)

    Class type Input.t

    The implementation of buffered input streams.

    inherit Iostream__.In.t
    method fill_buf : unit -> Iostream__.Slice.t

    ic#fill_buf() returns a slice into the ic's internal buffer, and ensures it's empty only if ic.ic is empty. In other words, the invariant is that this only returns an empty slice if the input stream is exhausted.

    method consume : int -> unit

    Consume n bytes from the inner buffer. This is only valid if the last call to fill_buf returned a slice with at least n bytes.

    diff --git a/tiny_httpd/Tiny_httpd_core/IO/Input/index.html b/tiny_httpd/Tiny_httpd_core/IO/Input/index.html new file mode 100644 index 0000000..793c2b2 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core/IO/Input/index.html @@ -0,0 +1,29 @@ + +Input (tiny_httpd.Tiny_httpd_core.IO.Input)

    Module IO.Input

    Input channel (byte source)

    include module type of struct include Iostream.In_buf end
    class type t = object ... end

    The implementation of buffered input streams.

    class virtual t_from_refill : ?bytes:bytes -> unit -> object ... end

    A mixin to implement a buffered input by only providing a refill method. Add a close method and it's good to go.

    val create : + ?bytes:bytes -> + ?close:(unit -> unit) -> + refill:(bytes -> int) -> + unit -> + t

    Create a new buffered input stream.

    • parameter refill

      will be called to refill the content of the bytes, returning how many bytes were added (starting at offset 0).

    • parameter buf

      the underlying buffer

    • raises Invalid_argument

      if the buffer's length is not at least 16.

    class of_bytes : ?off:int -> ?len:int -> bytes -> t
    val of_bytes : ?off:int -> ?len:int -> bytes -> t
    class of_string : ?off:int -> ?len:int -> string -> t
    val of_string : ?off:int -> ?len:int -> string -> t
    class bufferized : ?bytes:bytes -> Iostream.In.t -> t
    val bufferized : ?bytes:bytes -> Iostream.In.t -> t

    Read from the given buffer.

    • parameter off

      initial offset (default 0)

    • parameter len

      length of the slice in the bytes. (default all available bytes from offset)

    class of_in_channel : ?bytes:bytes -> in_channel -> t
    val of_in_channel : ?bytes:bytes -> in_channel -> t

    Wrap a standard input channel.

    class open_file : ?bytes:bytes -> ?mode:int -> ?flags:open_flag list -> string -> t
    val open_file : + ?bytes:bytes -> + ?mode:int -> + ?flags:open_flag list -> + string -> + t
    val with_open_file : + ?bytes:bytes -> + ?mode:int -> + ?flags:open_flag list -> + string -> + (t -> 'a) -> + 'a
    val fill_buf : t -> Iostream.Slice.t

    fill_buffer bic returns a slice into bic's internal buffer, and ensures it's empty only if bic.ic is empty.

    val of_in : ?bytes:bytes -> Iostream.In.t -> t

    Make a buffered version of the input stream.

    • parameter bytes

      the buffer to use.

    • raises Invalid_argument

      if the buffer's length is not at least 16.

    val consume : t -> int -> unit

    consume bic n consumes n bytes from bic. Precondition: n <= get_len bic, ie. one cannot consume bytes that have not yet been obtained via fill_buffer or fill_and_get.

    val into_in : t -> Iostream.In.t

    Cast into a In.t. This doesn't allocate.

    val input_all_into_buffer : t -> Stdlib.Buffer.t -> unit

    Read the whole content into the given buffer.

    val input_all : ?buf:bytes -> t -> string

    input_all ic reads the whole content of ic into a string.

    • parameter buf

      the initial buffer to use internally.

    • since 0.2
    val copy_into : t -> Iostream.Out.t -> unit

    Copy the entire stream into the given output.

    val skip : t -> int -> unit

    skip ic n reads and dicards the next n bytes in ic.

    val input_line : ?buffer:Stdlib.Buffer.t -> t -> string option

    Read a line from the input. Return None if the stream is empty.

    • parameter buffer

      a buffer to use to hold the line.

    val input_lines : ?buffer:Stdlib.Buffer.t -> t -> string list

    Read all lines from the input.

    val to_iter : t -> (char -> unit) -> unit
    val to_seq : t -> char Stdlib.Seq.t
    val of_seq : ?bytes:bytes -> char Stdlib.Seq.t -> t
    val of_unix_fd : + ?close_noerr:bool -> + closed:bool ref -> + buf:Slice.t -> + Unix.file_descr -> + t
    val of_slice : Slice.t -> t
    val input : t -> bytes -> int -> int -> int

    Read into the given slice.

    • returns

      the number of bytes read, 0 means end of input.

    val close : < close : unit -> unit.. > -> unit

    Close the channel.

    val really_input : t -> bytes -> int -> int -> unit

    Read exactly len bytes.

    • raises End_of_file

      if the input did not contain enough data.

    val iter_slice : (Slice.t -> unit) -> t -> unit
    val iter : (bytes -> int -> int -> unit) -> t -> unit
    val to_chan : out_channel -> t -> unit
    val to_chan' : Iostream.Out.t -> t -> unit
    val read_all_using : buf:Buf.t -> t -> string
    val read_exactly_ : too_short:(unit -> unit) -> t -> bytes -> int -> unit

    Read n bytes from the input into bytes.

    val read_line_into : t -> buf:Buf.t -> unit

    read a line into the buffer, after clearing it.

    val read_line_using : buf:Buf.t -> t -> string
    val read_line_using_opt : buf:Buf.t -> t -> string option
    val reading_exactly_ : + skip_on_close:bool -> + close_rec:bool -> + size:int -> + bytes:bytes -> + t -> + t
    val limit_size_to : close_rec:bool -> max_size:int -> bytes:bytes -> t -> t

    new stream with maximum size max_size.

    • parameter close_rec

      if true, closing this will also close the input stream

    val reading_exactly : close_rec:bool -> size:int -> bytes:bytes -> t -> t

    New stream that consumes exactly size bytes from the input. If fewer bytes are read before close is called, we read and discard the remaining quota of bytes before close returns.

    • parameter close_rec

      if true, closing this will also close the input stream

    val read_chunked : bytes:bytes -> fail:(string -> exn) -> t -> t
    val output_chunked' : ?buf:Buf.t -> Iostream.Out_buf.t -> t -> unit

    Output a stream using chunked encoding

    val output_chunked : ?buf:Buf.t -> out_channel -> t -> unit

    print a stream as a series of chunks

    diff --git a/tiny_httpd/Tiny_httpd_core/IO/Output/class-bufferized/index.html b/tiny_httpd/Tiny_httpd_core/IO/Output/class-bufferized/index.html new file mode 100644 index 0000000..3000ee5 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core/IO/Output/class-bufferized/index.html @@ -0,0 +1,2 @@ + +bufferized (tiny_httpd.Tiny_httpd_core.IO.Output.bufferized)

    Class Output.bufferized

    inherit Iostream__.Out.t
    method output_char : char -> unit

    Output a single char

    method flush : unit -> unit

    Flush underlying buffer

    diff --git a/tiny_httpd/Tiny_httpd_core/IO/Output/class-dummy/index.html b/tiny_httpd/Tiny_httpd_core/IO/Output/class-dummy/index.html new file mode 100644 index 0000000..1465759 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core/IO/Output/class-dummy/index.html @@ -0,0 +1,2 @@ + +dummy (tiny_httpd.Tiny_httpd_core.IO.Output.dummy)

    Class Output.dummy

    inherit Iostream__.Out.t
    method output_char : char -> unit

    Output a single char

    method flush : unit -> unit

    Flush underlying buffer

    diff --git a/tiny_httpd/Tiny_httpd_core/IO/Output/class-of_buffer/index.html b/tiny_httpd/Tiny_httpd_core/IO/Output/class-of_buffer/index.html new file mode 100644 index 0000000..956d1e0 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core/IO/Output/class-of_buffer/index.html @@ -0,0 +1,2 @@ + +of_buffer (tiny_httpd.Tiny_httpd_core.IO.Output.of_buffer)

    Class Output.of_buffer

    inherit Iostream__.Out.t
    method output_char : char -> unit

    Output a single char

    method flush : unit -> unit

    Flush underlying buffer

    diff --git a/tiny_httpd/Tiny_httpd_core/IO/Output/class-of_out_channel/index.html b/tiny_httpd/Tiny_httpd_core/IO/Output/class-of_out_channel/index.html new file mode 100644 index 0000000..1ae06d1 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core/IO/Output/class-of_out_channel/index.html @@ -0,0 +1,2 @@ + +of_out_channel (tiny_httpd.Tiny_httpd_core.IO.Output.of_out_channel)

    Class Output.of_out_channel

    inherit t
    inherit Iostream__.Seekable.t
    diff --git a/tiny_httpd/Tiny_httpd_core/IO/Output/class-of_unix_fd/index.html b/tiny_httpd/Tiny_httpd_core/IO/Output/class-of_unix_fd/index.html new file mode 100644 index 0000000..793bae3 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core/IO/Output/class-of_unix_fd/index.html @@ -0,0 +1,2 @@ + +of_unix_fd (tiny_httpd.Tiny_httpd_core.IO.Output.of_unix_fd)

    Class Output.of_unix_fd

    inherit Iostream__.Out.t
    method output_char : char -> unit

    Output a single char

    method flush : unit -> unit

    Flush underlying buffer

    diff --git a/tiny_httpd/Tiny_httpd_core/IO/Output/class-open_file/index.html b/tiny_httpd/Tiny_httpd_core/IO/Output/class-open_file/index.html new file mode 100644 index 0000000..d2dfbe2 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core/IO/Output/class-open_file/index.html @@ -0,0 +1,2 @@ + +open_file (tiny_httpd.Tiny_httpd_core.IO.Output.open_file)

    Class Output.open_file

    inherit t
    inherit Iostream__.Seekable.t
    diff --git a/tiny_httpd/Tiny_httpd_core/IO/Output/class-t_from_output/index.html b/tiny_httpd/Tiny_httpd_core/IO/Output/class-t_from_output/index.html new file mode 100644 index 0000000..5a86704 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core/IO/Output/class-t_from_output/index.html @@ -0,0 +1,2 @@ + +t_from_output (tiny_httpd.Tiny_httpd_core.IO.Output.t_from_output)

    Class Output.t_from_output

    Make a bufferized output from a non bufferized output+close.

    • parameter bytes

      the buffer to use. It's owned by this channel as long as the channel exists.

    inherit t
    method private virtual output_underlying : bytes -> int -> int -> unit

    Emit these private bytes, unbufferized

    method private virtual close_underlying : unit -> unit

    Close the underlying output. The bufferized output will flush and then call this.

    diff --git a/tiny_httpd/Tiny_httpd_core/IO/Output/class-type-t/index.html b/tiny_httpd/Tiny_httpd_core/IO/Output/class-type-t/index.html new file mode 100644 index 0000000..10ee64c --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core/IO/Output/class-type-t/index.html @@ -0,0 +1,2 @@ + +t (tiny_httpd.Tiny_httpd_core.IO.Output.t)

    Class type Output.t

    An output stream, ie. a place into which we can write bytes, with a buffer to amortize the cost of operations.

    This can be a Buffer.t, an out_channel, a Unix.file_descr, etc.

    inherit Iostream__.Out.t
    method output_char : char -> unit

    Output a single char

    method flush : unit -> unit

    Flush underlying buffer

    diff --git a/tiny_httpd/Tiny_httpd_core/IO/Output/class-type-t_seekable/index.html b/tiny_httpd/Tiny_httpd_core/IO/Output/class-type-t_seekable/index.html new file mode 100644 index 0000000..7a80004 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core/IO/Output/class-type-t_seekable/index.html @@ -0,0 +1,2 @@ + +t_seekable (tiny_httpd.Tiny_httpd_core.IO.Output.t_seekable)

    Class type Output.t_seekable

    inherit t
    inherit Iostream__.Seekable.t
    diff --git a/tiny_httpd/Tiny_httpd_core/IO/Output/index.html b/tiny_httpd/Tiny_httpd_core/IO/Output/index.html new file mode 100644 index 0000000..8e45ffd --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core/IO/Output/index.html @@ -0,0 +1,21 @@ + +Output (tiny_httpd.Tiny_httpd_core.IO.Output)

    Module IO.Output

    Output channel (byte sink)

    include module type of struct include Iostream.Out_buf end
    class type t = object ... end

    An output stream, ie. a place into which we can write bytes, with a buffer to amortize the cost of operations.

    class type t_seekable = object ... end
    val create : + ?flush:(unit -> unit) -> + ?close:(unit -> unit) -> + output_char:(char -> unit) -> + output:(bytes -> int -> int -> unit) -> + unit -> + t

    Create a new output stream from raw components.

    class dummy : t
    val dummy : t

    Dummy output, drops everything written to it.

    class virtual t_from_output : ?bytes:bytes -> unit -> object ... end

    Make a bufferized output from a non bufferized output+close.

    class bufferized : ?bytes:bytes -> Iostream.Out.t -> t
    val bufferized : ?bytes:bytes -> Iostream.Out.t -> t
    class of_out_channel : ?close_noerr:bool -> out_channel -> t_seekable
    val of_out_channel : ?close_noerr:bool -> out_channel -> t_seekable

    Wrap an out channel.

    val of_buffer : Stdlib.Buffer.t -> t

    of_buffer buf is an output channel that writes directly into buf. flush and close have no effect.

    class open_file : ?close_noerr:bool -> ?mode:int -> ?flags:open_flag list -> string -> + t_seekable
    val open_file : + ?close_noerr:bool -> + ?mode:int -> + ?flags:open_flag list -> + string -> + t_seekable

    open_file file creates an out stream writing into the given file.

    • parameter mode

      permissions for the file creation

    • parameter flags

      set of unix flags to use. It must contain write permissions.

    val with_open_file : + ?close_noerr:bool -> + ?mode:int -> + ?flags:open_flag list -> + string -> + (t_seekable -> 'a) -> + 'a
    val output_char : t -> char -> unit

    Output a single char

    val output : t -> bytes -> int -> int -> unit

    Write the slice of bytes.

    val close : t -> unit

    Close the stream. Idempotent.

    val flush : t -> unit

    Ensure the bytes written so far are indeed written to the underlying storage/network socket/… and are not just sitting in a buffer.

    val output_string : t -> string -> unit

    Output the whole string.

    val output_line : t -> string -> unit

    Output the whole string followed by '\n'.

    • since 0.2
    val output_lines : t -> string Stdlib.Seq.t -> unit

    Output a series of lines, each terminated by '\n'.

    val output_int : t -> int -> unit

    Output an integer in decimal notation.

    val tee : t list -> t

    tee ocs is an output that accepts bytes and writes them to every output in ocs. When closed, it closes all elements of oc.

    val map_char : (char -> char) -> t -> t

    Transform the stream byte by byte

    class of_unix_fd : ?close_noerr:bool option -> closed:bool ref -> buf:Slice.t -> Unix.file_descr -> + t
    val output_buf : t -> Buf.t -> unit
    val chunk_encoding : ?buf:Buf.t -> close_rec:bool -> t -> t

    chunk_encoding oc makes a new channel that outputs its content into oc in chunk encoding form.

    • parameter close_rec

      if true, closing the result will also close oc

    • parameter buf

      a buffer used to accumulate data into chunks. Chunks are emitted when buf's size gets over a certain threshold, or when flush is called.

    diff --git a/tiny_httpd/Tiny_httpd_core/IO/TCP_server/index.html b/tiny_httpd/Tiny_httpd_core/IO/TCP_server/index.html new file mode 100644 index 0000000..3868501 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core/IO/TCP_server/index.html @@ -0,0 +1,2 @@ + +TCP_server (tiny_httpd.Tiny_httpd_core.IO.TCP_server)

    Module IO.TCP_server

    A TCP server abstraction.

    type conn_handler = {
    1. handle : client_addr:Unix.sockaddr -> Input.t -> Output.t -> unit;
      (*

      Handle client connection

      *)
    }
    type t = {
    1. endpoint : unit -> string * int;
      (*

      Endpoint we listen on. This can only be called from within serve.

      *)
    2. active_connections : unit -> int;
      (*

      Number of connections currently active

      *)
    3. running : unit -> bool;
      (*

      Is the server currently running?

      *)
    4. stop : unit -> unit;
      (*

      Ask the server to stop. This might not take effect immediately, and is idempotent. After this server.running() must return false.

      *)
    }

    A running TCP server.

    This contains some functions that provide information about the running server, including whether it's active (as opposed to stopped), a function to stop it, and statistics about the number of connections.

    type builder = {
    1. serve : after_init:(t -> unit) -> handle:conn_handler -> unit -> unit;
      (*

      Blocking call to listen for incoming connections and handle them. Uses the connection handler handle to handle individual client connections in individual threads/fibers/tasks.

      • parameter after_init

        is called once with the server after the server has started.

      *)
    }

    A TCP server builder implementation.

    Calling builder.serve ~after_init ~handle () starts a new TCP server on an unspecified endpoint (most likely coming from the function returning this builder) and returns the running server.

    diff --git a/tiny_httpd/Tiny_httpd_core/IO/Writer/index.html b/tiny_httpd/Tiny_httpd_core/IO/Writer/index.html new file mode 100644 index 0000000..7774ffa --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core/IO/Writer/index.html @@ -0,0 +1,2 @@ + +Writer (tiny_httpd.Tiny_httpd_core.IO.Writer)

    Module IO.Writer

    A writer abstraction.

    type t = {
    1. write : Output.t -> unit;
    }

    Writer.

    A writer is a push-based stream of bytes. Give it an output channel and it will write the bytes in it.

    This is useful for responses: an http endpoint can return a writer as its response's body; the writer is given access to the connection to the client and can write into it as if it were a regular out_channel, including controlling calls to flush. Tiny_httpd will convert these writes into valid HTTP chunks.

    • since 0.14
    val make : write:(Output.t -> unit) -> unit -> t
    val write : Output.t -> t -> unit

    Write into the channel.

    val empty : t

    Empty writer, will output 0 bytes.

    val of_string : string -> t

    A writer that just emits the bytes from the given string.

    val of_input : Input.t -> t
    diff --git a/tiny_httpd/Tiny_httpd_core/IO/index.html b/tiny_httpd/Tiny_httpd_core/IO/index.html new file mode 100644 index 0000000..332a38d --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core/IO/index.html @@ -0,0 +1,2 @@ + +IO (tiny_httpd.Tiny_httpd_core.IO)

    Module Tiny_httpd_core.IO

    IO abstraction.

    We abstract IO so we can support classic unix blocking IOs with threads, and modern async IO with Eio.

    NOTE: experimental.

    • since 0.14
    module Buf = Buf
    module Slice = Iostream.Slice
    module Output : sig ... end

    Output channel (byte sink)

    module Input : sig ... end

    Input channel (byte source)

    module Writer : sig ... end

    A writer abstraction.

    module TCP_server : sig ... end

    A TCP server abstraction.

    diff --git a/tiny_httpd/Tiny_httpd_core/Log/index.html b/tiny_httpd/Tiny_httpd_core/Log/index.html new file mode 100644 index 0000000..acb48ce --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core/Log/index.html @@ -0,0 +1,8 @@ + +Log (tiny_httpd.Tiny_httpd_core.Log)

    Module Tiny_httpd_core.Log

    Logging for tiny_httpd

    val info : + ((('a, Stdlib.Format.formatter, unit, unit) format4 -> 'a) -> unit) -> + unit
    val debug : + ((('a, Stdlib.Format.formatter, unit, unit) format4 -> 'a) -> unit) -> + unit
    val error : + ((('a, Stdlib.Format.formatter, unit, unit) format4 -> 'a) -> unit) -> + unit
    val setup : debug:bool -> unit -> unit

    Setup and enable logging. This should only ever be used in executables, not libraries.

    • parameter debug

      if true, set logging to debug (otherwise info)

    val dummy : bool
    val fully_disable : unit -> unit

    Totally silence logs for tiny_httpd. With Logs installed this means setting the level of the tiny_httpd source to None.

    • since 0.18
    diff --git a/tiny_httpd/Tiny_httpd_core/Meth/index.html b/tiny_httpd/Tiny_httpd_core/Meth/index.html new file mode 100644 index 0000000..b83367f --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core/Meth/index.html @@ -0,0 +1,2 @@ + +Meth (tiny_httpd.Tiny_httpd_core.Meth)

    Module Tiny_httpd_core.Meth

    HTTP Methods

    type t = [
    1. | `GET
    2. | `PUT
    3. | `POST
    4. | `HEAD
    5. | `DELETE
    6. | `OPTIONS
    ]

    A HTTP method. For now we only handle a subset of these.

    See https://tools.ietf.org/html/rfc7231#section-4

    val pp : Stdlib.Format.formatter -> t -> unit
    val to_string : t -> string
    val of_string : string -> t
    diff --git a/tiny_httpd/Tiny_httpd_core/Pool/Raw/index.html b/tiny_httpd/Tiny_httpd_core/Pool/Raw/index.html new file mode 100644 index 0000000..bb728c6 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core/Pool/Raw/index.html @@ -0,0 +1,2 @@ + +Raw (tiny_httpd.Tiny_httpd_core.Pool.Raw)

    Module Pool.Raw

    Low level control over the pool. This is easier to get wrong (e.g. releasing the same resource twice) so use with caution.

    • since 0.18
    val acquire : 'a t -> 'a
    val release : 'a t -> 'a -> unit
    diff --git a/tiny_httpd/Tiny_httpd_core/Pool/index.html b/tiny_httpd/Tiny_httpd_core/Pool/index.html new file mode 100644 index 0000000..9418606 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core/Pool/index.html @@ -0,0 +1,7 @@ + +Pool (tiny_httpd.Tiny_httpd_core.Pool)

    Module Tiny_httpd_core.Pool

    Resource pool.

    This pool is used for buffers. It can be used for other resources but do note that it assumes resources are still reasonably cheap to produce and discard, and will never block waiting for a resource — it's not a good pool for DB connections.

    • since 0.14.
    type 'a t

    Pool of values of type 'a

    val create : + ?clear:('a -> unit) -> + mk_item:(unit -> 'a) -> + ?max_size:int -> + unit -> + 'a t

    Create a new pool.

    • parameter mk_item

      produce a new item in case the pool is empty

    • parameter max_size

      maximum number of item in the pool before we start dropping resources on the floor. This controls resource consumption.

    • parameter clear

      a function called on items before recycling them.

    val with_resource : 'a t -> ('a -> 'b) -> 'b

    with_resource pool f runs f x with x a resource; when f fails or returns, x is returned to the pool for future reuse.

    module Raw : sig ... end

    Low level control over the pool. This is easier to get wrong (e.g. releasing the same resource twice) so use with caution.

    diff --git a/tiny_httpd/Tiny_httpd_core/Request/index.html b/tiny_httpd/Tiny_httpd_core/Request/index.html new file mode 100644 index 0000000..8bd2323 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core/Request/index.html @@ -0,0 +1,14 @@ + +Request (tiny_httpd.Tiny_httpd_core.Request)

    Module Tiny_httpd_core.Request

    Requests

    Requests are sent by a client, e.g. a web browser or cURL. From the point of view of the server, they're inputs.

    type 'body t = private {
    1. meth : Meth.t;
      (*

      HTTP method for this request.

      *)
    2. host : string;
      (*

      Host header, mandatory. It can also be found in headers.

      *)
    3. client_addr : Unix.sockaddr;
      (*

      Client address. Available since 0.14.

      *)
    4. headers : Headers.t;
      (*

      List of headers.

      *)
    5. mutable meta : Hmap.t;
      (*

      Metadata.

      • since 0.17
      *)
    6. http_version : int * int;
      (*

      HTTP version. This should be either 1, 0 or 1, 1.

      *)
    7. path : string;
      (*

      Full path of the requested URL.

      *)
    8. path_components : string list;
      (*

      Components of the path of the requested URL.

      *)
    9. query : (string * string) list;
      (*

      Query part of the requested URL.

      *)
    10. body : 'body;
      (*

      Body of the request.

      *)
    11. start_time : float;
      (*

      Obtained via get_time_s in create

      • since 0.11
      *)
    }

    A request with method, path, host, headers, and a body, sent by a client.

    The body is polymorphic because the request goes through several transformations. First it has no body, as only the request and headers are read; then it has a stream body; then the body might be entirely read as a string via read_body_full.

    • since 0.6 The field [query] was added and contains the query parameters in ["?foo=bar,x=y"]
    • since 0.6 The field [path_components] is the part of the path that precedes [query] and is split on ["/"].
    • since 0.11 the type is a private alias
    • since 0.11 the field [start_time] was added
    val add_meta : _ t -> 'a Hmap.key -> 'a -> unit

    Add metadata

    • since 0.17
    val get_meta : _ t -> 'a Hmap.key -> 'a option

    Get metadata

    • since 0.17
    val get_meta_exn : _ t -> 'a Hmap.key -> 'a

    Like get_meta but can fail

    • raises Invalid_argument

      if not present

    • since 0.17
    val pp_with : + ?mask_header:(string -> bool) -> + ?headers_to_mask:string list -> + ?show_query:bool -> + ?pp_body:(Stdlib.Format.formatter -> 'body -> unit) -> + unit -> + Stdlib.Format.formatter -> + 'body t -> + unit

    Pretty print the request. The exact format of this printing is not specified.

    • parameter mask_header

      function which is given each header name. If it returns true, the header's value is masked. The presence of the header is still printed. Default fun _ -> false.

    • parameter headers_to_mask

      a list of headers masked by default. Default is "authorization"; "cookie". @show_query if true (default true), the query part of the request is shown.

    • parameter pp_body

      body printer (default prints "?" instead of the body, which works even for stream bodies)

    val pp : Stdlib.Format.formatter -> string t -> unit

    Pretty print the request and its body. The exact format of this printing is not specified.

    val pp_ : Stdlib.Format.formatter -> _ t -> unit

    Pretty print the request without its body. The exact format of this printing is not specified.

    val headers : _ t -> Headers.t

    List of headers of the request, including "Host".

    val get_header : ?f:(string -> string) -> _ t -> string -> string option

    get_header req h looks up header h in req. It returns None if the header is not present. This is case insensitive and should be used rather than looking up h verbatim in headers.

    val get_header_int : _ t -> string -> int option

    Same as get_header but also performs a string to integer conversion.

    val set_header : string -> string -> 'a t -> 'a t

    set_header k v req sets k: v in the request req's headers.

    val remove_header : string -> 'a t -> 'a t

    Remove one instance of this header.

    • since 0.17
    val update_headers : (Headers.t -> Headers.t) -> 'a t -> 'a t

    Modify headers using the given function.

    • since 0.11
    val set_body : 'a -> _ t -> 'a t

    set_body b req returns a new query whose body is b.

    • since 0.11
    val host : _ t -> string

    Host field of the request. It also appears in the headers.

    val client_addr : _ t -> Unix.sockaddr

    Client address of the request.

    • since 0.16
    val meth : _ t -> Meth.t

    Method for the request.

    val path : _ t -> string

    Request path.

    val query : _ t -> (string * string) list

    Decode the query part of the path field.

    • since 0.4
    val body : 'b t -> 'b

    Request body, possibly empty.

    val start_time : _ t -> float

    time stamp (from Unix.gettimeofday) after parsing the first line of the request

    • since 0.11
    val limit_body_size : + max_size:int -> + bytes:bytes -> + IO.Input.t t -> + IO.Input.t t

    Limit the body size to max_size bytes, or return a 413 error.

    • since 0.3
    val read_body_full : ?bytes:bytes -> ?buf_size:int -> IO.Input.t t -> string t

    Read the whole body into a string. Potentially blocking.

    • parameter buf_size

      initial size of underlying buffer (since 0.11)

    • parameter bytes

      the initial buffer (since 0.14)

    diff --git a/tiny_httpd/Tiny_httpd_core/Response/index.html b/tiny_httpd/Tiny_httpd_core/Response/index.html new file mode 100644 index 0000000..6dffbca --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core/Response/index.html @@ -0,0 +1,33 @@ + +Response (tiny_httpd.Tiny_httpd_core.Response)

    Module Tiny_httpd_core.Response

    Responses

    Responses are what a http server, such as Tiny_httpd, send back to the client to answer a Request.t

    type body = [
    1. | `String of string
    2. | `Stream of IO.Input.t
    3. | `Writer of IO.Writer.t
    4. | `Void
    ]

    Body of a response, either as a simple string, or a stream of bytes, or nothing (for server-sent events notably).

    • `String str replies with a body set to this string, and a known content-length.
    • `Stream str replies with a body made from this string, using chunked encoding.
    • `Void replies with no body.
    • `Writer w replies with a body created by the writer w, using a chunked encoding. It is available since 0.14.
    type t = private {
    1. code : Response_code.t;
      (*

      HTTP response code. See Response_code.

      *)
    2. headers : Headers.t;
      (*

      Headers of the reply. Some will be set by Tiny_httpd automatically.

      *)
    3. body : body;
      (*

      Body of the response. Can be empty.

      *)
    }

    A response to send back to a client.

    val set_body : body -> t -> t

    Set the body of the response.

    • since 0.11
    val set_header : string -> string -> t -> t

    Set a header.

    • since 0.11
    val update_headers : (Headers.t -> Headers.t) -> t -> t

    Modify headers.

    • since 0.11
    val remove_header : string -> t -> t

    Remove one instance of this header.

    • since 0.17
    val set_headers : Headers.t -> t -> t

    Set all headers.

    • since 0.11
    val set_code : Response_code.t -> t -> t

    Set the response code.

    • since 0.11
    val make_raw : ?headers:Headers.t -> code:Response_code.t -> string -> t

    Make a response from its raw components, with a string body. Use "" to not send a body at all.

    val make_raw_stream : + ?headers:Headers.t -> + code:Response_code.t -> + IO.Input.t -> + t

    Same as make_raw but with a stream body. The body will be sent with the chunked transfer-encoding.

    val make_void : ?headers:Headers.t -> code:int -> unit -> t

    Return a response without a body at all.

    • since 0.13
    val make : + ?headers:Headers.t -> + ?code:int -> + (body, Response_code.t * string) result -> + t

    make r turns a result into a response.

    • make (Ok body) replies with 200 and the body.
    • make (Error (code,msg)) replies with the given error code and message as body.
    val make_string : + ?headers:Headers.t -> + ?code:int -> + (string, Response_code.t * string) result -> + t

    Same as make but with a string body.

    val make_writer : + ?headers:Headers.t -> + ?code:int -> + (IO.Writer.t, Response_code.t * string) result -> + t

    Same as make but with a writer body.

    val make_stream : + ?headers:Headers.t -> + ?code:int -> + (IO.Input.t, Response_code.t * string) result -> + t

    Same as make but with a stream body.

    val fail : + ?headers:Headers.t -> + code:int -> + ('a, unit, string, t) format4 -> + 'a

    Make the current request fail with the given code and message. Example: fail ~code:404 "oh noes, %s not found" "waldo".

    exception Bad_req of int * string

    Exception raised by fail_raise with the HTTP code and body

    val fail_raise : code:int -> ('a, unit, string, 'b) format4 -> 'a

    Similar to fail but raises an exception that exits the current handler. This should not be used outside of a (path) handler. Example: fail_raise ~code:404 "oh noes, %s not found" "waldo"; never_executed()

    val pp_with : + ?mask_header:(string -> bool) -> + ?headers_to_mask:string list -> + ?pp_body:(Stdlib.Format.formatter -> body -> unit) -> + unit -> + Stdlib.Format.formatter -> + t -> + unit

    Pretty print the response. The exact format of this printing is not specified.

    • parameter mask_header

      function which is given each header name. If it returns true, the header's value is masked. The presence of the header is still printed. Default fun _ -> false.

    • parameter headers_to_mask

      a list of headers masked by default. Default is "set-cookie".

    • parameter pp_body

      body printer (default fully prints String bodies, but omits stream bodies)

    • since 0.18
    val pp : Stdlib.Format.formatter -> t -> unit

    Pretty print the response. The exact format is not specified.

    diff --git a/tiny_httpd/Tiny_httpd_core/Response_code/index.html b/tiny_httpd/Tiny_httpd_core/Response_code/index.html new file mode 100644 index 0000000..c621001 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core/Response_code/index.html @@ -0,0 +1,2 @@ + +Response_code (tiny_httpd.Tiny_httpd_core.Response_code)

    Module Tiny_httpd_core.Response_code

    Response Codes

    type t = int

    A standard HTTP code.

    https://tools.ietf.org/html/rfc7231#section-6

    val ok : t

    The code 200

    val not_found : t

    The code 404

    val descr : t -> string

    A description of some of the error codes. NOTE: this is not complete (yet).

    val is_success : t -> bool

    is_success code is true iff code is in the 2xx or 3xx range.

    • since 0.17
    diff --git a/tiny_httpd/Tiny_httpd_core/Route/Private_/index.html b/tiny_httpd/Tiny_httpd_core/Route/Private_/index.html new file mode 100644 index 0000000..24df793 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core/Route/Private_/index.html @@ -0,0 +1,2 @@ + +Private_ (tiny_httpd.Tiny_httpd_core.Route.Private_)

    Module Route.Private_

    val eval : string list -> ('a, 'b) t -> 'a -> 'b option
    diff --git a/tiny_httpd/Tiny_httpd_core/Route/index.html b/tiny_httpd/Tiny_httpd_core/Route/index.html new file mode 100644 index 0000000..d0dfae8 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core/Route/index.html @@ -0,0 +1,2 @@ + +Route (tiny_httpd.Tiny_httpd_core.Route)

    Module Tiny_httpd_core.Route

    Routing

    Basic type-safe routing of handlers based on URL paths. This is optional, it is possible to only define the root handler with something like Routes.

    • since 0.6
    type ('a, 'b) comp

    An atomic component of a path

    type ('a, 'b) t

    A route, composed of path components

    val int : (int -> 'a, 'a) comp

    Matches an integer.

    val string : (string -> 'a, 'a) comp

    Matches a string not containing '/' and binds it as is.

    val string_urlencoded : (string -> 'a, 'a) comp

    Matches a URL-encoded string, and decodes it.

    val exact : string -> ('a, 'a) comp

    exact "s" matches "s" and nothing else.

    val return : ('a, 'a) t

    Matches the empty path.

    val rest_of_path : (string -> 'a, 'a) t

    Matches a string, even containing '/'. This will match the entirety of the remaining route.

    • since 0.7
    val rest_of_path_urlencoded : (string -> 'a, 'a) t

    Matches a string, even containing '/', and URL-decode it (piecewise). This will match the entirety of the remaining route.

    • since 0.7
    val (@/) : ('a, 'b) comp -> ('b, 'c) t -> ('a, 'c) t

    comp / route matches "foo/bar/…" iff comp matches "foo", and route matches "bar/…".

    val exact_path : string -> ('a, 'b) t -> ('a, 'b) t

    exact_path "foo/bar/..." r is equivalent to exact "foo" @/ exact "bar" @/ ... @/ r

    • since 0.11 *
    val pp : Stdlib.Format.formatter -> (_, _) t -> unit

    Print the route.

    • since 0.7
    val to_string : (_, _) t -> string

    Print the route.

    • since 0.7
    module Private_ : sig ... end
    diff --git a/tiny_httpd/Tiny_httpd_core/Server/Head_middleware/index.html b/tiny_httpd/Tiny_httpd_core/Server/Head_middleware/index.html new file mode 100644 index 0000000..ee9c8e7 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core/Server/Head_middleware/index.html @@ -0,0 +1,2 @@ + +Head_middleware (tiny_httpd.Tiny_httpd_core.Server.Head_middleware)

    Module Server.Head_middleware

    A middleware that only considers the request's head+headers.

    These middlewares are simpler than full Middleware.t and work in more contexts.

    • since 0.17
    type t = {
    1. handle : 'a. 'a Request.t -> 'a Request.t;
    }

    A handler that takes the request, without its body, and possibly modifies it.

    • since 0.17
    val trivial : t

    Pass through

    val to_middleware : t -> Middleware.t
    diff --git a/tiny_httpd/Tiny_httpd_core/Server/Middleware/index.html b/tiny_httpd/Tiny_httpd_core/Server/Middleware/index.html new file mode 100644 index 0000000..a56cb25 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core/Server/Middleware/index.html @@ -0,0 +1,2 @@ + +Middleware (tiny_httpd.Tiny_httpd_core.Server.Middleware)

    Module Server.Middleware

    type handler = IO.Input.t Request.t -> resp:(Response.t -> unit) -> unit

    Handlers are functions returning a response to a request. The response can be delayed, hence the use of a continuation as the resp parameter.

    type t = handler -> handler

    A middleware is a handler transformation.

    It takes the existing handler h, and returns a new one which, given a query, modify it or log it before passing it to h, or fail. It can also log or modify or drop the response.

    val nil : t

    Trivial middleware that does nothing.

    diff --git a/tiny_httpd/Tiny_httpd_core/Server/index.html b/tiny_httpd/Tiny_httpd_core/Server/index.html new file mode 100644 index 0000000..6318a12 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core/Server/index.html @@ -0,0 +1,45 @@ + +Server (tiny_httpd.Tiny_httpd_core.Server)

    Module Tiny_httpd_core.Server

    HTTP server.

    This module implements a very simple, basic HTTP/1.1 server using blocking IOs and threads.

    It is possible to use a thread pool, see create's argument new_thread.

    • since 0.13
    exception Bad_req of int * string

    Exception raised to exit request handlers with a code+error message

    Middlewares

    A middleware can be inserted in a handler to modify or observe its behavior.

    • since 0.11
    module Middleware : sig ... end
    module Head_middleware : sig ... end

    A middleware that only considers the request's head+headers.

    Main Server type

    type t

    A HTTP server. See create for more details.

    module type IO_BACKEND = sig ... end

    A backend that provides IO operations, network operations, etc.

    val create_from : + ?enable_logging:bool -> + ?buf_size:int -> + ?head_middlewares:Head_middleware.t list -> + ?middlewares:([ `Encoding | `Stage of int ] * Middleware.t) list -> + backend:(module IO_BACKEND) -> + unit -> + t

    Create a new webserver using provided backend.

    The server will not do anything until run is called on it. Before starting the server, one can use add_path_handler and set_top_handler to specify how to handle incoming requests.

    • parameter buf_size

      size for buffers (since 0.11)

    • parameter enable_logging

      if true and Logs is installed, emit logs via Logs (since 0.18). Default true.

    • since 0.14
    val addr : t -> string

    Address on which the server listens.

    val is_ipv6 : t -> bool

    is_ipv6 server returns true iff the address of the server is an IPv6 address.

    • since 0.3
    val port : t -> int

    Port on which the server listens. Note that this might be different than the port initially given if the port was 0 (meaning that the OS picks a port for us).

    val active_connections : t -> int

    Number of currently active connections.

    val add_decode_request_cb : + t -> + (unit Request.t -> (unit Request.t * (IO.Input.t -> IO.Input.t)) option) -> + unit

    Add a callback for every request. The callback can provide a stream transformer and a new request (with modified headers, typically). A possible use is to handle decompression by looking for a Transfer-Encoding header and returning a stream transformer that decompresses on the fly.

    val add_encode_response_cb : + t -> + (unit Request.t -> Response.t -> Response.t option) -> + unit

    Add a callback for every request/response pair. Similarly to add_encode_response_cb the callback can return a new response, for example to compress it. The callback is given the query with only its headers, as well as the current response.

    val add_middleware : + stage:[ `Encoding | `Stage of int ] -> + t -> + Middleware.t -> + unit

    Add a middleware to every request/response pair.

    • parameter stage

      specify when middleware applies. Encoding comes first (outermost layer), then stages in increasing order.

    • raises Invalid_argument

      if stage is `Stage n where n < 1

    • since 0.11
    val add_head_middleware : t -> Head_middleware.t -> unit

    Add a request-header only Head_middleware.t. This is called on requests, to modify them, and returns a new request immediately.

    • since 0.18

    Request handlers

    val set_top_handler : t -> (IO.Input.t Request.t -> Response.t) -> unit

    Setup a handler called by default.

    This handler is called with any request not accepted by any handler installed via add_path_handler. If no top handler is installed, unhandled paths will return a 404 not found

    This used to take a string Request.t but it now takes a byte_stream Request.t since 0.14 . Use Request.read_body_full to read the body into a string if needed.

    val add_route_handler : + ?accept:(unit Request.t -> (unit, Response_code.t * string) result) -> + ?middlewares:Middleware.t list -> + ?meth:Meth.t -> + t -> + ('a, string Request.t -> Response.t) Route.t -> + 'a -> + unit

    add_route_handler server Route.(exact "path" @/ string @/ int @/ return) f calls f "foo" 42 request when a request with path "path/foo/42/" is received.

    Note that the handlers are called in the reverse order of their addition, so the last registered handler can override previously registered ones.

    • parameter meth

      if provided, only accept requests with the given method. Typically one could react to `GET or `PUT.

    • parameter accept

      should return Ok() if the given request (before its body is read) should be accepted, Error (code,message) if it's to be rejected (e.g. because its content is too big, or for some permission error). See the http_of_dir program for an example of how to use accept to filter uploads that are too large before the upload even starts. The default always returns Ok(), i.e. it accepts all requests.

    • since 0.6
    val add_route_handler_stream : + ?accept:(unit Request.t -> (unit, Response_code.t * string) result) -> + ?middlewares:Middleware.t list -> + ?meth:Meth.t -> + t -> + ('a, IO.Input.t Request.t -> Response.t) Route.t -> + 'a -> + unit

    Similar to add_route_handler, but where the body of the request is a stream of bytes that has not been read yet. This is useful when one wants to stream the body directly into a parser, json decoder (such as Jsonm) or into a file.

    • since 0.6

    Server-sent events

    EXPERIMENTAL: this API is not stable yet.

    module type SERVER_SENT_GENERATOR = sig ... end

    A server-side function to generate of Server-sent events.

    type server_sent_generator = (module SERVER_SENT_GENERATOR)

    Server-sent event generator. This generates events that are forwarded to the client (e.g. the browser).

    • since 0.9
    val add_route_server_sent_handler : + ?accept:(unit Request.t -> (unit, Response_code.t * string) result) -> + ?middlewares:Head_middleware.t list -> + t -> + ('a, string Request.t -> server_sent_generator -> unit) Route.t -> + 'a -> + unit

    Add a handler on an endpoint, that serves server-sent events.

    The callback is given a generator that can be used to send events as it pleases. The connection is always closed by the client, and the accepted method is always GET. This will set the header "content-type" to "text/event-stream" automatically and reply with a 200 immediately. See server_sent_generator for more details.

    This handler stays on the original thread (it is synchronous).

    • since 0.9

    Upgrade handlers

    These handlers upgrade the connection to another protocol.

    • since 0.17
    module type UPGRADE_HANDLER = sig ... end

    Handler that upgrades to another protocol.

    type upgrade_handler = (module UPGRADE_HANDLER)
    • since 0.17
    val add_upgrade_handler : + ?accept:(unit Request.t -> (unit, Response_code.t * string) result) -> + ?middlewares:Head_middleware.t list -> + t -> + ('a, upgrade_handler) Route.t -> + 'a -> + unit

    Run the server

    val running : t -> bool

    Is the server running?

    • since 0.14
    val stop : t -> unit

    Ask the server to stop. This might not have an immediate effect as run might currently be waiting on IO.

    val run : ?after_init:(unit -> unit) -> t -> (unit, exn) result

    Run the main loop of the server, listening on a socket described at the server's creation time, using new_thread to start a thread for each new client.

    This returns Ok () if the server exits gracefully, or Error e if it exits with an error.

    • parameter after_init

      is called after the server starts listening. since 0.13 .

    val run_exn : ?after_init:(unit -> unit) -> t -> unit

    run_exn s is like run s but re-raises an exception if the server exits with an error.

    • since 0.14
    diff --git a/tiny_httpd/Tiny_httpd_core/Server/module-type-IO_BACKEND/index.html b/tiny_httpd/Tiny_httpd_core/Server/module-type-IO_BACKEND/index.html new file mode 100644 index 0000000..f046596 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core/Server/module-type-IO_BACKEND/index.html @@ -0,0 +1,2 @@ + +IO_BACKEND (tiny_httpd.Tiny_httpd_core.Server.IO_BACKEND)

    Module type Server.IO_BACKEND

    A backend that provides IO operations, network operations, etc.

    This is used to decouple tiny_httpd from the scheduler/IO library used to actually open a TCP server and talk to clients. The classic way is based on Unix and blocking IOs, but it's also possible to use an OCaml 5 library using effects and non blocking IOs.

    val init_addr : unit -> string

    Initial TCP address

    val init_port : unit -> int

    Initial port

    val get_time_s : unit -> float

    Obtain the current timestamp in seconds.

    val tcp_server : unit -> IO.TCP_server.builder

    TCP server builder, to create servers that can listen on a port and handle clients.

    diff --git a/tiny_httpd/Tiny_httpd_core/Server/module-type-SERVER_SENT_GENERATOR/index.html b/tiny_httpd/Tiny_httpd_core/Server/module-type-SERVER_SENT_GENERATOR/index.html new file mode 100644 index 0000000..7c57eb9 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core/Server/module-type-SERVER_SENT_GENERATOR/index.html @@ -0,0 +1,8 @@ + +SERVER_SENT_GENERATOR (tiny_httpd.Tiny_httpd_core.Server.SERVER_SENT_GENERATOR)

    Module type Server.SERVER_SENT_GENERATOR

    A server-side function to generate of Server-sent events.

    See the w3c page and this blog post.

    • since 0.9
    val set_headers : Headers.t -> unit

    Set headers of the response. This is not mandatory but if used at all, it must be called before any call to send_event (once events are sent the response is already sent too).

    val send_event : + ?event:string -> + ?id:string -> + ?retry:string -> + data:string -> + unit -> + unit

    Send an event from the server. If data is a multiline string, it will be sent on separate "data:" lines.

    val close : unit -> unit

    Close connection.

    • since 0.11
    diff --git a/tiny_httpd/Tiny_httpd_core/Server/module-type-UPGRADE_HANDLER/index.html b/tiny_httpd/Tiny_httpd_core/Server/module-type-UPGRADE_HANDLER/index.html new file mode 100644 index 0000000..c18828b --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core/Server/module-type-UPGRADE_HANDLER/index.html @@ -0,0 +1,5 @@ + +UPGRADE_HANDLER (tiny_httpd.Tiny_httpd_core.Server.UPGRADE_HANDLER)

    Module type Server.UPGRADE_HANDLER

    Handler that upgrades to another protocol.

    • since 0.17
    type handshake_state

    Some specific state returned after handshake

    val name : string

    Name in the "upgrade" header

    val handshake : + Unix.sockaddr -> + unit Request.t -> + (Headers.t * handshake_state, string) result

    Perform the handshake and upgrade the connection. This returns either Ok (resp_headers, state) in case of success, in which case the server sends a 101 response with resp_headers; or it returns Error log_msg if the the handshake fails, in which case the connection is closed without further ado and log_msg is logged locally (but not returned to the client).

    val handle_connection : handshake_state -> IO.Input.t -> IO.Output.t -> unit

    Take control of the connection and take it from ther.e

    diff --git a/tiny_httpd/Tiny_httpd_core/Util/index.html b/tiny_httpd/Tiny_httpd_core/Util/index.html new file mode 100644 index 0000000..cf3c796 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core/Util/index.html @@ -0,0 +1,2 @@ + +Util (tiny_httpd.Tiny_httpd_core.Util)

    Module Tiny_httpd_core.Util

    Some utils for writing web servers

    • since 0.2
    val percent_encode : ?skip:(char -> bool) -> string -> string

    Encode the string into a valid path following https://tools.ietf.org/html/rfc3986#section-2.1

    • parameter skip

      if provided, allows to preserve some characters, e.g. '/' in a path.

    val percent_decode : string -> string option

    Inverse operation of percent_encode. Can fail since some strings are not valid percent encodings.

    val split_query : string -> string * string

    Split a path between the path and the query

    • since 0.5
    val split_on_slash : string -> string list

    Split a string on '/', remove the trailing '/' if any.

    • since 0.6
    val get_non_query_path : string -> string

    get the part of the path that is not the query parameters.

    • since 0.5
    val get_query : string -> string

    Obtain the query part of a path.

    • since 0.4
    val parse_query : string -> ((string * string) list, string) result

    Parse a query as a list of '&' or ';' separated key=value pairs. The order might not be preserved.

    • since 0.3
    val show_sockaddr : Unix.sockaddr -> string

    Simple printer for socket addresses.

    • since 0.17
    val is_ipv6_str : string -> bool

    Is this string potentially an IPV6 address?

    • since 0.17
    diff --git a/tiny_httpd/Tiny_httpd_core/index.html b/tiny_httpd/Tiny_httpd_core/index.html new file mode 100644 index 0000000..5229c52 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core/index.html @@ -0,0 +1,2 @@ + +Tiny_httpd_core (tiny_httpd.Tiny_httpd_core)

    Module Tiny_httpd_core

    module Atomic_ : sig ... end
    module Buf : sig ... end

    Simple buffer.

    module Common_ : sig ... end
    module Headers : sig ... end

    Headers

    module IO : sig ... end

    IO abstraction.

    module Log : sig ... end

    Logging for tiny_httpd

    module Meth : sig ... end

    HTTP Methods

    module Parse_ : sig ... end
    module Pool : sig ... end

    Resource pool.

    module Request : sig ... end

    Requests

    module Response : sig ... end

    Responses

    module Response_code : sig ... end

    Response Codes

    module Route : sig ... end

    Routing

    module Server : sig ... end

    HTTP server.

    module Util : sig ... end
    diff --git a/tiny_httpd/Tiny_httpd_core__Atomic_/index.html b/tiny_httpd/Tiny_httpd_core__Atomic_/index.html new file mode 100644 index 0000000..a968c3c --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core__Atomic_/index.html @@ -0,0 +1,2 @@ + +Tiny_httpd_core__Atomic_ (tiny_httpd.Tiny_httpd_core__Atomic_)

    Module Tiny_httpd_core__Atomic_

    This module is hidden.

    diff --git a/tiny_httpd/Tiny_httpd_core__Buf/index.html b/tiny_httpd/Tiny_httpd_core__Buf/index.html new file mode 100644 index 0000000..15a868d --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core__Buf/index.html @@ -0,0 +1,2 @@ + +Tiny_httpd_core__Buf (tiny_httpd.Tiny_httpd_core__Buf)

    Module Tiny_httpd_core__Buf

    This module is hidden.

    diff --git a/tiny_httpd/Tiny_httpd_core__Headers/index.html b/tiny_httpd/Tiny_httpd_core__Headers/index.html new file mode 100644 index 0000000..3347448 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core__Headers/index.html @@ -0,0 +1,2 @@ + +Tiny_httpd_core__Headers (tiny_httpd.Tiny_httpd_core__Headers)

    Module Tiny_httpd_core__Headers

    This module is hidden.

    diff --git a/tiny_httpd/Tiny_httpd_core__IO/index.html b/tiny_httpd/Tiny_httpd_core__IO/index.html new file mode 100644 index 0000000..db1ea6a --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core__IO/index.html @@ -0,0 +1,2 @@ + +Tiny_httpd_core__IO (tiny_httpd.Tiny_httpd_core__IO)

    Module Tiny_httpd_core__IO

    This module is hidden.

    diff --git a/tiny_httpd/Tiny_httpd_core__Log/index.html b/tiny_httpd/Tiny_httpd_core__Log/index.html new file mode 100644 index 0000000..052f974 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core__Log/index.html @@ -0,0 +1,2 @@ + +Tiny_httpd_core__Log (tiny_httpd.Tiny_httpd_core__Log)

    Module Tiny_httpd_core__Log

    This module is hidden.

    diff --git a/tiny_httpd/Tiny_httpd_core__Meth/index.html b/tiny_httpd/Tiny_httpd_core__Meth/index.html new file mode 100644 index 0000000..0124f34 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core__Meth/index.html @@ -0,0 +1,2 @@ + +Tiny_httpd_core__Meth (tiny_httpd.Tiny_httpd_core__Meth)

    Module Tiny_httpd_core__Meth

    This module is hidden.

    diff --git a/tiny_httpd/Tiny_httpd_core__Pool/index.html b/tiny_httpd/Tiny_httpd_core__Pool/index.html new file mode 100644 index 0000000..bac1063 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core__Pool/index.html @@ -0,0 +1,2 @@ + +Tiny_httpd_core__Pool (tiny_httpd.Tiny_httpd_core__Pool)

    Module Tiny_httpd_core__Pool

    This module is hidden.

    diff --git a/tiny_httpd/Tiny_httpd_core__Request/index.html b/tiny_httpd/Tiny_httpd_core__Request/index.html new file mode 100644 index 0000000..3a5c607 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core__Request/index.html @@ -0,0 +1,2 @@ + +Tiny_httpd_core__Request (tiny_httpd.Tiny_httpd_core__Request)

    Module Tiny_httpd_core__Request

    This module is hidden.

    diff --git a/tiny_httpd/Tiny_httpd_core__Response/index.html b/tiny_httpd/Tiny_httpd_core__Response/index.html new file mode 100644 index 0000000..d173d8e --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core__Response/index.html @@ -0,0 +1,2 @@ + +Tiny_httpd_core__Response (tiny_httpd.Tiny_httpd_core__Response)

    Module Tiny_httpd_core__Response

    This module is hidden.

    diff --git a/tiny_httpd/Tiny_httpd_core__Response_code/index.html b/tiny_httpd/Tiny_httpd_core__Response_code/index.html new file mode 100644 index 0000000..55e5b47 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core__Response_code/index.html @@ -0,0 +1,2 @@ + +Tiny_httpd_core__Response_code (tiny_httpd.Tiny_httpd_core__Response_code)

    Module Tiny_httpd_core__Response_code

    This module is hidden.

    diff --git a/tiny_httpd/Tiny_httpd_core__Route/index.html b/tiny_httpd/Tiny_httpd_core__Route/index.html new file mode 100644 index 0000000..cabb320 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core__Route/index.html @@ -0,0 +1,2 @@ + +Tiny_httpd_core__Route (tiny_httpd.Tiny_httpd_core__Route)

    Module Tiny_httpd_core__Route

    This module is hidden.

    diff --git a/tiny_httpd/Tiny_httpd_core__Server/index.html b/tiny_httpd/Tiny_httpd_core__Server/index.html new file mode 100644 index 0000000..4ae7d96 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core__Server/index.html @@ -0,0 +1,2 @@ + +Tiny_httpd_core__Server (tiny_httpd.Tiny_httpd_core__Server)

    Module Tiny_httpd_core__Server

    This module is hidden.

    diff --git a/tiny_httpd/Tiny_httpd_core__Util/index.html b/tiny_httpd/Tiny_httpd_core__Util/index.html new file mode 100644 index 0000000..7de5568 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_core__Util/index.html @@ -0,0 +1,2 @@ + +Tiny_httpd_core__Util (tiny_httpd.Tiny_httpd_core__Util)

    Module Tiny_httpd_core__Util

    This module is hidden.

    diff --git a/tiny_httpd/Tiny_httpd_html/A/index.html b/tiny_httpd/Tiny_httpd_html/A/index.html new file mode 100644 index 0000000..68c0392 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_html/A/index.html @@ -0,0 +1,2 @@ + +A (tiny_httpd.Tiny_httpd_html.A)

    Module Tiny_httpd_html.A

    Attributes.

    This module contains combinator for the standard attributes. One can also just use a pair of strings.

    Attributes.

    This module contains combinator for the standard attributes. One can also just use a pair of strings.

    type t = string -> string * string

    Attribute builder

    val accept : t

    Attribute "accept".

    val accept_charset : t

    Attribute "accept-charset".

    val accesskey : t

    Attribute "accesskey".

    val action : t

    Attribute "action".

    val align : t

    Attribute "align".

    val allow : t

    Attribute "allow".

    val alt : t

    Attribute "alt".

    val async : t

    Attribute "async".

    val autocapitalize : t

    Attribute "autocapitalize".

    val autocomplete : t

    Attribute "autocomplete".

    val autofocus : t

    Attribute "autofocus".

    val autoplay : t

    Attribute "autoplay".

    val buffered : t

    Attribute "buffered".

    val capture : t

    Attribute "capture".

    val challenge : t

    Attribute "challenge".

    val charset : t

    Attribute "charset".

    val checked : t

    Attribute "checked".

    val cite : t

    Attribute "cite".

    val class_ : t

    Attribute "class".

    val code : t

    Attribute "code".

    val codebase : t

    Attribute "codebase".

    val cols : t

    Attribute "cols".

    val colspan : t

    Attribute "colspan".

    val content : t

    Attribute "content".

    val contenteditable : t

    Attribute "contenteditable".

    val contextmenu : t

    Attribute "contextmenu".

    val controls : t

    Attribute "controls".

    val coords : t

    Attribute "coords".

    val crossorigin : t

    Attribute "crossorigin".

    val csp : t

    Attribute "csp".

    val data : t

    Attribute "data".

    val data_star : t

    Attribute "data-*".

    val datetime : t

    Attribute "datetime".

    val decoding : t

    Attribute "decoding".

    val default : t

    Attribute "default".

    val defer : t

    Attribute "defer".

    val dir : t

    Attribute "dir".

    val dirname : t

    Attribute "dirname".

    val disabled : t

    Attribute "disabled".

    val download : t

    Attribute "download".

    val draggable : t

    Attribute "draggable".

    val enctype : t

    Attribute "enctype".

    val enterkeyhint : t

    Attribute "enterkeyhint".

    val for_ : t

    Attribute "for".

    val form : t

    Attribute "form".

    val formaction : t

    Attribute "formaction".

    val formenctype : t

    Attribute "formenctype".

    val formmethod : t

    Attribute "formmethod".

    val formnovalidate : t

    Attribute "formnovalidate".

    val formtarget : t

    Attribute "formtarget".

    val headers : t

    Attribute "headers".

    val hidden : t

    Attribute "hidden".

    val high : t

    Attribute "high".

    val href : t

    Attribute "href".

    val hreflang : t

    Attribute "hreflang".

    val http_equiv : t

    Attribute "http-equiv".

    val icon : t

    Attribute "icon".

    val id : t

    Attribute "id".

    val importance : t

    Attribute "importance".

    val integrity : t

    Attribute "integrity".

    val ismap : t

    Attribute "ismap".

    val itemprop : t

    Attribute "itemprop".

    val keytype : t

    Attribute "keytype".

    val kind : t

    Attribute "kind".

    val label : t

    Attribute "label".

    val lang : t

    Attribute "lang".

    val language : t

    Attribute "language".

    val list : t

    Attribute "list".

    val loop : t

    Attribute "loop".

    val low : t

    Attribute "low".

    val manifest : t

    Attribute "manifest".

    val max : t

    Attribute "max".

    val maxlength : t

    Attribute "maxlength".

    val minlength : t

    Attribute "minlength".

    val media : t

    Attribute "media".

    val method_ : t

    Attribute "method".

    val min : t

    Attribute "min".

    val multiple : t

    Attribute "multiple".

    val muted : t

    Attribute "muted".

    val name : t

    Attribute "name".

    val novalidate : t

    Attribute "novalidate".

    val open_ : t

    Attribute "open".

    val optimum : t

    Attribute "optimum".

    val pattern : t

    Attribute "pattern".

    val ping : t

    Attribute "ping".

    val placeholder : t

    Attribute "placeholder".

    val poster : t

    Attribute "poster".

    val preload : t

    Attribute "preload".

    val radiogroup : t

    Attribute "radiogroup".

    val readonly : t

    Attribute "readonly".

    val referrerpolicy : t

    Attribute "referrerpolicy".

    val rel : t

    Attribute "rel".

    val required : t

    Attribute "required".

    val reversed : t

    Attribute "reversed".

    val rows : t

    Attribute "rows".

    val rowspan : t

    Attribute "rowspan".

    val sandbox : t

    Attribute "sandbox".

    val scope : t

    Attribute "scope".

    val scoped : t

    Attribute "scoped".

    val selected : t

    Attribute "selected".

    val shape : t

    Attribute "shape".

    val size : t

    Attribute "size".

    val sizes : t

    Attribute "sizes".

    val slot : t

    Attribute "slot".

    val span : t

    Attribute "span".

    val spellcheck : t

    Attribute "spellcheck".

    val src : t

    Attribute "src".

    val srcdoc : t

    Attribute "srcdoc".

    val srclang : t

    Attribute "srclang".

    val srcset : t

    Attribute "srcset".

    val start : t

    Attribute "start".

    val step : t

    Attribute "step".

    val style : t

    Attribute "style".

    val summary : t

    Attribute "summary".

    val tabindex : t

    Attribute "tabindex".

    val target : t

    Attribute "target".

    val title : t

    Attribute "title".

    val translate : t

    Attribute "translate".

    val text : t

    Attribute "Text".

    val type_ : t

    Attribute "type".

    val usemap : t

    Attribute "usemap".

    val value : t

    Attribute "value".

    val width : t

    Attribute "width".

    val wrap : t

    Attribute "wrap".

    diff --git a/tiny_httpd/Tiny_httpd_html/Out/index.html b/tiny_httpd/Tiny_httpd_html/Out/index.html new file mode 100644 index 0000000..dfc7eb9 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_html/Out/index.html @@ -0,0 +1,2 @@ + +Out (tiny_httpd.Tiny_httpd_html.Out)

    Module Tiny_httpd_html.Out

    Output for HTML combinators.

    This output type is used to produce a string reasonably efficiently from a tree of combinators.

    NOTE: this is experimental and an unstable API.

    • since 0.12

    Output for HTML combinators.

    This output type is used to produce a string reasonably efficiently from a tree of combinators.

    NOTE: this is experimental and an unstable API.

    • since 0.12
    type t
    val create_of_buffer : Stdlib.Buffer.t -> t
    val create_of_out : Tiny_httpd_core.IO.Output.t -> t
    val flush : t -> unit
    val add_char : t -> char -> unit
    val add_string : t -> string -> unit
    val add_format_nl : t -> unit
    val with_no_format_nl : t -> (unit -> 'a) -> 'a
    diff --git a/tiny_httpd/Tiny_httpd_html/index.html b/tiny_httpd/Tiny_httpd_html/index.html new file mode 100644 index 0000000..18216cb --- /dev/null +++ b/tiny_httpd/Tiny_httpd_html/index.html @@ -0,0 +1,2 @@ + +Tiny_httpd_html (tiny_httpd.Tiny_httpd_html)

    Module Tiny_httpd_html

    HTML combinators.

    This module provides combinators to produce html. It doesn't enforce the well-formedness of the html, unlike Tyxml, but it's simple and should be reasonably efficient.

    • since 0.12
    module Out : sig ... end

    Output for HTML combinators.

    type attribute = string * string

    An attribute, i.e. a key/value pair

    type elt = Out.t -> unit

    A html element. It is represented by its output function, so we can directly print it.

    type void = ?if_:bool -> attribute list -> elt

    Element without children.

    type nary = ?if_:bool -> attribute list -> elt list -> elt

    Element with children, represented as a list.

    • parameter if_

      if false, do not print anything (default true)

    type sub_elt = [
    1. | `E of elt
    2. | `L of elt list
    3. | `S of elt Stdlib.Seq.t
    4. | `Nil
    ]

    A chunk of sub-elements, possibly empty.

    type nary' = ?if_:bool -> attribute list -> sub_elt list -> elt

    Element with children, represented as a list of sub_elt to be flattened

    • parameter if_

      if false, do not print anything (default true)

    val sub_e : elt -> sub_elt

    Sub-element with a single element inside.

    val sub_l : elt list -> sub_elt

    Sub-element with a list of items inside.

    val sub_seq : elt Stdlib.Seq.t -> sub_elt

    Sub-element with a sequence (Seq.t) of items inside.

    val seq_of_array : 'a array -> 'a Stdlib.Seq.t

    Helper to build a Seq.t from an array.

    val sub_empty : sub_elt

    Sub-element with nothing inside. Useful in conditionals, when one decides not to emit a sub-element at all.

    val txt : string -> elt

    Emit a string value, which will be escaped.

    val txtf : ('a, Stdlib.Format.formatter, unit, Out.t -> unit) format4 -> 'a

    Formatted version of txt

    val raw_html : string -> elt

    Emit raw HTML. Caution, this can lead to injection vulnerabilities, never use with text that comes from untrusted users.

    val area : void

    tag "area", see mdn

    val base : void

    tag "base", see mdn

    val br : void

    tag "br", see mdn

    val col : void

    tag "col", see mdn

    val embed : void

    tag "embed", see mdn

    val hr : void

    tag "hr", see mdn

    val img : void

    tag "img", see mdn

    val input : void

    tag "input", see mdn

    tag "link", see mdn

    val menuitem : void

    tag "menuitem", see mdn

    val meta : void

    tag "meta", see mdn

    val param : void

    tag "param", see mdn

    val source : void

    tag "source", see mdn

    val track : void

    tag "track", see mdn

    val wbr : void

    tag "wbr", see mdn

    val a : nary

    tag "a", see mdn

    val a' : nary'

    tag "a", see mdn

    val abbr : nary

    tag "abbr", see mdn

    val abbr' : nary'

    tag "abbr", see mdn

    val address : nary

    tag "address", see mdn

    val address' : nary'

    tag "address", see mdn

    val article : nary

    tag "article", see mdn

    val article' : nary'

    tag "article", see mdn

    val aside : nary

    tag "aside", see mdn

    val aside' : nary'

    tag "aside", see mdn

    val audio : nary

    tag "audio", see mdn

    val audio' : nary'

    tag "audio", see mdn

    val b : nary

    tag "b", see mdn

    val b' : nary'

    tag "b", see mdn

    val bdi : nary

    tag "bdi", see mdn

    val bdi' : nary'

    tag "bdi", see mdn

    val bdo : nary

    tag "bdo", see mdn

    val bdo' : nary'

    tag "bdo", see mdn

    val blockquote : nary

    tag "blockquote", see mdn

    val blockquote' : nary'

    tag "blockquote", see mdn

    val body : nary

    tag "body", see mdn

    val body' : nary'

    tag "body", see mdn

    val button : nary

    tag "button", see mdn

    val button' : nary'

    tag "button", see mdn

    val canvas : nary

    tag "canvas", see mdn

    val canvas' : nary'

    tag "canvas", see mdn

    val caption : nary

    tag "caption", see mdn

    val caption' : nary'

    tag "caption", see mdn

    val cite : nary

    tag "cite", see mdn

    val cite' : nary'

    tag "cite", see mdn

    val code : nary

    tag "code", see mdn

    val code' : nary'

    tag "code", see mdn

    val colgroup : nary

    tag "colgroup", see mdn

    val colgroup' : nary'

    tag "colgroup", see mdn

    val data : nary

    tag "data", see mdn

    val data' : nary'

    tag "data", see mdn

    val datalist : nary

    tag "datalist", see mdn

    val datalist' : nary'

    tag "datalist", see mdn

    val dd : nary

    tag "dd", see mdn

    val dd' : nary'

    tag "dd", see mdn

    val del : nary

    tag "del", see mdn

    val del' : nary'

    tag "del", see mdn

    val details : nary

    tag "details", see mdn

    val details' : nary'

    tag "details", see mdn

    val dfn : nary

    tag "dfn", see mdn

    val dfn' : nary'

    tag "dfn", see mdn

    val dialog : nary

    tag "dialog", see mdn

    val dialog' : nary'

    tag "dialog", see mdn

    val div : nary

    tag "div", see mdn

    val div' : nary'

    tag "div", see mdn

    val dl : nary

    tag "dl", see mdn

    val dl' : nary'

    tag "dl", see mdn

    val dt : nary

    tag "dt", see mdn

    val dt' : nary'

    tag "dt", see mdn

    val em : nary

    tag "em", see mdn

    val em' : nary'

    tag "em", see mdn

    val fieldset : nary

    tag "fieldset", see mdn

    val fieldset' : nary'

    tag "fieldset", see mdn

    val figcaption : nary

    tag "figcaption", see mdn

    val figcaption' : nary'

    tag "figcaption", see mdn

    val figure : nary

    tag "figure", see mdn

    val figure' : nary'

    tag "figure", see mdn

    tag "footer", see mdn

    val footer' : nary'

    tag "footer", see mdn

    val form : nary

    tag "form", see mdn

    val form' : nary'

    tag "form", see mdn

    val h1 : nary

    tag "h1", see mdn

    val h1' : nary'

    tag "h1", see mdn

    val h2 : nary

    tag "h2", see mdn

    val h2' : nary'

    tag "h2", see mdn

    val h3 : nary

    tag "h3", see mdn

    val h3' : nary'

    tag "h3", see mdn

    val h4 : nary

    tag "h4", see mdn

    val h4' : nary'

    tag "h4", see mdn

    val h5 : nary

    tag "h5", see mdn

    val h5' : nary'

    tag "h5", see mdn

    val h6 : nary

    tag "h6", see mdn

    val h6' : nary'

    tag "h6", see mdn

    val head : nary

    tag "head", see mdn

    val head' : nary'

    tag "head", see mdn

    val header : nary

    tag "header", see mdn

    val header' : nary'

    tag "header", see mdn

    val hgroup : nary

    tag "hgroup", see mdn

    val hgroup' : nary'

    tag "hgroup", see mdn

    val html : nary

    tag "html", see mdn

    val html' : nary'

    tag "html", see mdn

    val i : nary

    tag "i", see mdn

    val i' : nary'

    tag "i", see mdn

    val iframe : nary

    tag "iframe", see mdn

    val iframe' : nary'

    tag "iframe", see mdn

    val ins : nary

    tag "ins", see mdn

    val ins' : nary'

    tag "ins", see mdn

    val kbd : nary

    tag "kbd", see mdn

    val kbd' : nary'

    tag "kbd", see mdn

    val label : nary

    tag "label", see mdn

    val label' : nary'

    tag "label", see mdn

    val legend : nary

    tag "legend", see mdn

    val legend' : nary'

    tag "legend", see mdn

    val li : nary

    tag "li", see mdn

    val li' : nary'

    tag "li", see mdn

    val main : nary

    tag "main", see mdn

    val main' : nary'

    tag "main", see mdn

    val map : nary

    tag "map", see mdn

    val map' : nary'

    tag "map", see mdn

    val mark : nary

    tag "mark", see mdn

    val mark' : nary'

    tag "mark", see mdn

    val math : nary

    tag "math", see mdn

    val math' : nary'

    tag "math", see mdn

    val menu : nary

    tag "menu", see mdn

    val menu' : nary'

    tag "menu", see mdn

    val meter : nary

    tag "meter", see mdn

    val meter' : nary'

    tag "meter", see mdn

    val nav : nary

    tag "nav", see mdn

    val nav' : nary'

    tag "nav", see mdn

    val noscript : nary

    tag "noscript", see mdn

    val noscript' : nary'

    tag "noscript", see mdn

    val object_ : nary

    tag "object", see mdn

    val object_' : nary'

    tag "object", see mdn

    val ol : nary

    tag "ol", see mdn

    val ol' : nary'

    tag "ol", see mdn

    val optgroup : nary

    tag "optgroup", see mdn

    val optgroup' : nary'

    tag "optgroup", see mdn

    val option : nary

    tag "option", see mdn

    val option' : nary'

    tag "option", see mdn

    val output : nary

    tag "output", see mdn

    val output' : nary'

    tag "output", see mdn

    val p : nary

    tag "p", see mdn

    val p' : nary'

    tag "p", see mdn

    val picture : nary

    tag "picture", see mdn

    val picture' : nary'

    tag "picture", see mdn

    val pre : nary

    tag "pre", see mdn

    val pre' : nary'

    tag "pre", see mdn

    val progress : nary

    tag "progress", see mdn

    val progress' : nary'

    tag "progress", see mdn

    val q : nary

    tag "q", see mdn

    val q' : nary'

    tag "q", see mdn

    val rb : nary

    tag "rb", see mdn

    val rb' : nary'

    tag "rb", see mdn

    val rp : nary

    tag "rp", see mdn

    val rp' : nary'

    tag "rp", see mdn

    val rt : nary

    tag "rt", see mdn

    val rt' : nary'

    tag "rt", see mdn

    val rtc : nary

    tag "rtc", see mdn

    val rtc' : nary'

    tag "rtc", see mdn

    val ruby : nary

    tag "ruby", see mdn

    val ruby' : nary'

    tag "ruby", see mdn

    val s : nary

    tag "s", see mdn

    val s' : nary'

    tag "s", see mdn

    val samp : nary

    tag "samp", see mdn

    val samp' : nary'

    tag "samp", see mdn

    val script : nary

    tag "script", see mdn

    val script' : nary'

    tag "script", see mdn

    val section : nary

    tag "section", see mdn

    val section' : nary'

    tag "section", see mdn

    val select : nary

    tag "select", see mdn

    val select' : nary'

    tag "select", see mdn

    val slot : nary

    tag "slot", see mdn

    val slot' : nary'

    tag "slot", see mdn

    val small : nary

    tag "small", see mdn

    val small' : nary'

    tag "small", see mdn

    val span : nary

    tag "span", see mdn

    val span' : nary'

    tag "span", see mdn

    val strong : nary

    tag "strong", see mdn

    val strong' : nary'

    tag "strong", see mdn

    val style : nary

    tag "style", see mdn

    val style' : nary'

    tag "style", see mdn

    val sub : nary

    tag "sub", see mdn

    val sub' : nary'

    tag "sub", see mdn

    val summary : nary

    tag "summary", see mdn

    val summary' : nary'

    tag "summary", see mdn

    val sup : nary

    tag "sup", see mdn

    val sup' : nary'

    tag "sup", see mdn

    val svg : nary

    tag "svg", see mdn

    val svg' : nary'

    tag "svg", see mdn

    val table : nary

    tag "table", see mdn

    val table' : nary'

    tag "table", see mdn

    val tbody : nary

    tag "tbody", see mdn

    val tbody' : nary'

    tag "tbody", see mdn

    val td : nary

    tag "td", see mdn

    val td' : nary'

    tag "td", see mdn

    val template : nary

    tag "template", see mdn

    val template' : nary'

    tag "template", see mdn

    val textarea : nary

    tag "textarea", see mdn

    val textarea' : nary'

    tag "textarea", see mdn

    val tfoot : nary

    tag "tfoot", see mdn

    val tfoot' : nary'

    tag "tfoot", see mdn

    val th : nary

    tag "th", see mdn

    val th' : nary'

    tag "th", see mdn

    val thead : nary

    tag "thead", see mdn

    val thead' : nary'

    tag "thead", see mdn

    val time : nary

    tag "time", see mdn

    val time' : nary'

    tag "time", see mdn

    val title : nary

    tag "title", see mdn

    val title' : nary'

    tag "title", see mdn

    val tr : nary

    tag "tr", see mdn

    val tr' : nary'

    tag "tr", see mdn

    val u : nary

    tag "u", see mdn

    val u' : nary'

    tag "u", see mdn

    val ul : nary

    tag "ul", see mdn

    val ul' : nary'

    tag "ul", see mdn

    val var : nary

    tag "var", see mdn

    val var' : nary'

    tag "var", see mdn

    val video : nary

    tag "video", see mdn

    val video' : nary'

    tag "video", see mdn

    module A : sig ... end

    Attributes.

    val to_output : ?top:bool -> elt -> Tiny_httpd_core.IO.Output.t -> unit

    Write an HTML element to this output.

    • parameter top

      if true, add DOCTYPE at the beginning. The top element should then be a "html" tag.

    • since 0.14
    val to_string : ?top:bool -> elt -> string

    Convert a HTML element to a string.

    • parameter top

      if true, add DOCTYPE at the beginning. The top element should then be a "html" tag.

    val to_string_l : elt list -> string

    Convert a list of HTML elements to a string. This is designed for fragments of HTML that are to be injected inside a bigger context, as it's invalid to have multiple elements at the toplevel of a HTML document.

    val to_string_top : elt -> string
    val to_out_channel_top : elt -> Tiny_httpd_core.IO.Output.t -> unit

    Write a toplevel element to an output channel.

    • since 0.14
    val to_writer : ?top:bool -> elt -> Tiny_httpd_core.IO.Writer.t

    Produce a streaming writer from this HTML element.

    • parameter top

      if true, add a DOCTYPE. See to_out_channel.

    • since 0.14
    val to_stream : elt -> Tiny_httpd_core.IO.Input.t

    Convert a HTML element to a stream. This might just convert it to a string first, do not assume it to be more efficient.

    diff --git a/tiny_httpd/Tiny_httpd_html__/index.html b/tiny_httpd/Tiny_httpd_html__/index.html new file mode 100644 index 0000000..16406f0 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_html__/index.html @@ -0,0 +1,2 @@ + +Tiny_httpd_html__ (tiny_httpd.Tiny_httpd_html__)

    Module Tiny_httpd_html__

    This module is hidden.

    diff --git a/tiny_httpd/Tiny_httpd_html__Html_/index.html b/tiny_httpd/Tiny_httpd_html__Html_/index.html new file mode 100644 index 0000000..9307081 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_html__Html_/index.html @@ -0,0 +1,2 @@ + +Tiny_httpd_html__Html_ (tiny_httpd.Tiny_httpd_html__Html_)

    Module Tiny_httpd_html__Html_

    This module is hidden.

    diff --git a/tiny_httpd/Tiny_httpd_multipart_form_data/Content_disposition/index.html b/tiny_httpd/Tiny_httpd_multipart_form_data/Content_disposition/index.html new file mode 100644 index 0000000..a484ee4 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_multipart_form_data/Content_disposition/index.html @@ -0,0 +1,2 @@ + +Content_disposition (tiny_httpd.Tiny_httpd_multipart_form_data.Content_disposition)

    Module Tiny_httpd_multipart_form_data.Content_disposition

    type t = {
    1. kind : string;
    2. name : string option;
    3. filename : string option;
    }
    val to_string : t -> string

    Simple display

    val parse : Tiny_httpd.Headers.t -> t option
    diff --git a/tiny_httpd/Tiny_httpd_multipart_form_data/Private_/index.html b/tiny_httpd/Tiny_httpd_multipart_form_data/Private_/index.html new file mode 100644 index 0000000..3d02957 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_multipart_form_data/Private_/index.html @@ -0,0 +1,2 @@ + +Private_ (tiny_httpd.Tiny_httpd_multipart_form_data.Private_)

    Module Tiny_httpd_multipart_form_data.Private_

    /

    /

    type chunk =
    1. | Delim
    2. | Eof
    3. | Read of int
    val read_chunk_ : st -> bytes -> int -> int -> chunk
    diff --git a/tiny_httpd/Tiny_httpd_multipart_form_data/index.html b/tiny_httpd/Tiny_httpd_multipart_form_data/index.html new file mode 100644 index 0000000..31c6015 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_multipart_form_data/index.html @@ -0,0 +1,7 @@ + +Tiny_httpd_multipart_form_data (tiny_httpd.Tiny_httpd_multipart_form_data)

    Module Tiny_httpd_multipart_form_data

    Streaming parser for multipart/form-data

    module Content_disposition : sig ... end
    type st

    Parser state

    val create : + ?buf_size:int -> + ?out_buf_size:int -> + boundary:string -> + Iostream.In.t -> + st
    val parse_content_type : Tiny_httpd.Headers.t -> [ `boundary of string ] option

    Parse headers for content-type: multipart/form-data; boundary=…

    type slice = Iostream.Slice.t
    type event =
    1. | Part of Tiny_httpd.Headers.t
    2. | Read of slice
    3. | End_of_input
    val next : st -> event
    module Private_ : sig ... end

    /

    diff --git a/tiny_httpd/Tiny_httpd_multipart_form_data__/index.html b/tiny_httpd/Tiny_httpd_multipart_form_data__/index.html new file mode 100644 index 0000000..5f6b216 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_multipart_form_data__/index.html @@ -0,0 +1,2 @@ + +Tiny_httpd_multipart_form_data__ (tiny_httpd.Tiny_httpd_multipart_form_data__)

    Module Tiny_httpd_multipart_form_data__

    This module is hidden.

    diff --git a/tiny_httpd/Tiny_httpd_multipart_form_data__Content_disposition/index.html b/tiny_httpd/Tiny_httpd_multipart_form_data__Content_disposition/index.html new file mode 100644 index 0000000..304c0f3 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_multipart_form_data__Content_disposition/index.html @@ -0,0 +1,2 @@ + +Tiny_httpd_multipart_form_data__Content_disposition (tiny_httpd.Tiny_httpd_multipart_form_data__Content_disposition)

    Module Tiny_httpd_multipart_form_data__Content_disposition

    This module is hidden.

    diff --git a/tiny_httpd/Tiny_httpd_multipart_form_data__Utils_/index.html b/tiny_httpd/Tiny_httpd_multipart_form_data__Utils_/index.html new file mode 100644 index 0000000..a6199c8 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_multipart_form_data__Utils_/index.html @@ -0,0 +1,2 @@ + +Tiny_httpd_multipart_form_data__Utils_ (tiny_httpd.Tiny_httpd_multipart_form_data__Utils_)

    Module Tiny_httpd_multipart_form_data__Utils_

    This module is hidden.

    diff --git a/tiny_httpd/Tiny_httpd_prometheus/Counter/index.html b/tiny_httpd/Tiny_httpd_prometheus/Counter/index.html new file mode 100644 index 0000000..c809596 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_prometheus/Counter/index.html @@ -0,0 +1,2 @@ + +Counter (tiny_httpd.Tiny_httpd_prometheus.Counter)

    Module Tiny_httpd_prometheus.Counter

    Counters

    type t

    A counter, monotonically increasing

    val create : Registry.t -> ?tags:tags -> ?descr:string -> string -> t
    val incr : t -> unit
    val incr_by : t -> int -> unit
    val incr_to : t -> int -> unit

    Increment to the given number. If it's lower than the current value this does nothing

    diff --git a/tiny_httpd/Tiny_httpd_prometheus/GC_metrics/index.html b/tiny_httpd/Tiny_httpd_prometheus/GC_metrics/index.html new file mode 100644 index 0000000..6345968 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_prometheus/GC_metrics/index.html @@ -0,0 +1,2 @@ + +GC_metrics (tiny_httpd.Tiny_httpd_prometheus.GC_metrics)

    Module Tiny_httpd_prometheus.GC_metrics

    type t
    val create : Registry.t -> t
    val update : t -> unit
    val create_and_update_before_emit : Registry.t -> unit

    create_and_update_before_emit reg creates new GC metrics, adds them to the registry, and uses Registry.on_will_emit to update the metrics every time the registry is polled.

    diff --git a/tiny_httpd/Tiny_httpd_prometheus/Gauge/index.html b/tiny_httpd/Tiny_httpd_prometheus/Gauge/index.html new file mode 100644 index 0000000..1a2364d --- /dev/null +++ b/tiny_httpd/Tiny_httpd_prometheus/Gauge/index.html @@ -0,0 +1,2 @@ + +Gauge (tiny_httpd.Tiny_httpd_prometheus.Gauge)

    Module Tiny_httpd_prometheus.Gauge

    Gauges

    type t

    A gauge, taking arbitrary values

    val create : Registry.t -> ?tags:tags -> ?descr:string -> string -> t
    val set : t -> int -> unit
    val incr : t -> unit
    val incr_by : t -> int -> unit
    val decr : t -> unit
    val decr_by : t -> int -> unit
    diff --git a/tiny_httpd/Tiny_httpd_prometheus/Histogram/index.html b/tiny_httpd/Tiny_httpd_prometheus/Histogram/index.html new file mode 100644 index 0000000..c720f33 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_prometheus/Histogram/index.html @@ -0,0 +1,8 @@ + +Histogram (tiny_httpd.Tiny_httpd_prometheus.Histogram)

    Module Tiny_httpd_prometheus.Histogram

    type t

    Histogram

    val create : + Registry.t -> + ?tags:tags -> + ?descr:string -> + buckets:float list -> + string -> + t
    val add : t -> float -> unit
    diff --git a/tiny_httpd/Tiny_httpd_prometheus/Registry/index.html b/tiny_httpd/Tiny_httpd_prometheus/Registry/index.html new file mode 100644 index 0000000..51c3013 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_prometheus/Registry/index.html @@ -0,0 +1,2 @@ + +Registry (tiny_httpd.Tiny_httpd_prometheus.Registry)

    Module Tiny_httpd_prometheus.Registry

    Registry for metrics.

    type t

    The registry contains a group of metrics

    val create : unit -> t
    val on_will_emit : t -> (unit -> unit) -> unit

    on_will_emit registry f calls f() every time emit buf registry is called (before the metrics start being emitted). This is useful to update some metrics on demand.

    val emit : Stdlib.Buffer.t -> t -> unit

    Write metrics into the given buffer. The buffer will be cleared first thing.

    val emit_str : t -> string
    diff --git a/tiny_httpd/Tiny_httpd_prometheus/index.html b/tiny_httpd/Tiny_httpd_prometheus/index.html new file mode 100644 index 0000000..5d121ab --- /dev/null +++ b/tiny_httpd/Tiny_httpd_prometheus/index.html @@ -0,0 +1,2 @@ + +Tiny_httpd_prometheus (tiny_httpd.Tiny_httpd_prometheus)

    Module Tiny_httpd_prometheus

    Expose metrics over HTTP in the prometheus format.

    This sub-library tiny_httpd.prometheus provides definitions for counters, gauges, and histogram, and endpoints to expose them for Prometheus to scrape them.

    • since 0.16
    type tags = (string * string) list
    module Registry : sig ... end

    Registry for metrics.

    val global : Registry.t
    module Counter : sig ... end

    Counters

    module Gauge : sig ... end

    Gauges

    module Histogram : sig ... end

    Middleware to get basic metrics about HTTP requests

    val add_route_to_server : Tiny_httpd_core.Server.t -> Registry.t -> unit

    Add a "/metrics" route to the server

    val instrument_server : Tiny_httpd_core.Server.t -> Registry.t -> unit

    Add middleware and route

    module GC_metrics : sig ... end
    diff --git a/tiny_httpd/Tiny_httpd_prometheus__/index.html b/tiny_httpd/Tiny_httpd_prometheus__/index.html new file mode 100644 index 0000000..3ba4bb4 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_prometheus__/index.html @@ -0,0 +1,2 @@ + +Tiny_httpd_prometheus__ (tiny_httpd.Tiny_httpd_prometheus__)

    Module Tiny_httpd_prometheus__

    This module is hidden.

    diff --git a/tiny_httpd/Tiny_httpd_unix/Dir/Embedded_fs/index.html b/tiny_httpd/Tiny_httpd_unix/Dir/Embedded_fs/index.html new file mode 100644 index 0000000..c1e18e0 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_unix/Dir/Embedded_fs/index.html @@ -0,0 +1,2 @@ + +Embedded_fs (tiny_httpd.Tiny_httpd_unix.Dir.Embedded_fs)

    Module Dir.Embedded_fs

    An embedded file system, as a list of files with (relative) paths. This is useful in combination with the "tiny-httpd-mkfs" tool, which embeds the files it's given into a OCaml module.

    • since 0.12
    type t

    The pseudo-filesystem

    val create : ?mtime:float -> unit -> t
    val add_file : ?mtime:float -> t -> path:string -> string -> unit

    Add file to the virtual file system.

    • raises Invalid_argument

      if the path contains '..' or if it tries to make a directory out of an existing path that is a file.

    val to_vfs : t -> (module VFS)
    diff --git a/tiny_httpd/Tiny_httpd_unix/Dir/index.html b/tiny_httpd/Tiny_httpd_unix/Dir/index.html new file mode 100644 index 0000000..7acea29 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_unix/Dir/index.html @@ -0,0 +1,19 @@ + +Dir (tiny_httpd.Tiny_httpd_unix.Dir)

    Module Tiny_httpd_unix.Dir

    Serving static content from directories

    This module provides the same functionality as the "http_of_dir" tool. It exposes a directory (and its subdirectories), with the optional ability to delete or upload files.

    • since 0.11
    type dir_behavior =
    1. | Index
      (*

      Redirect to index.html if present, else fails.

      *)
    2. | Lists
      (*

      Lists content of directory. Be careful of security implications.

      *)
    3. | Index_or_lists
      (*

      Redirect to index.html if present and lists content otherwise. This is useful for tilde ("~") directories and other per-user behavior, but be mindful of security implications

      *)
    4. | Forbidden
      (*

      Forbid access to directory. This is suited for serving assets, for example.

      *)

    behavior of static directory.

    This controls what happens when the user requests the path to a directory rather than a file.

    type hidden

    Type used to prevent users from building a config directly. Use default_config or config instead.

    type config = {
    1. mutable download : bool;
      (*

      Is downloading files allowed?

      *)
    2. mutable dir_behavior : dir_behavior;
      (*

      Behavior when serving a directory and not a file

      *)
    3. mutable delete : bool;
      (*

      Is deleting a file allowed? (with method DELETE)

      *)
    4. mutable upload : bool;
      (*

      Is uploading a file allowed? (with method PUT)

      *)
    5. mutable max_upload_size : int;
      (*

      If upload is true, this is the maximum size in bytes for uploaded files.

      *)
    6. _rest : hidden;
      (*

      Just ignore this field.

      *)
    }

    configuration for static file handlers. This might get more fields over time.

    val default_config : unit -> config

    default configuration: { download=true ; dir_behavior=Forbidden ; delete=false ; upload=false ; max_upload_size = 10 * 1024 * 1024 }

    val config : + ?download:bool -> + ?dir_behavior:dir_behavior -> + ?delete:bool -> + ?upload:bool -> + ?max_upload_size:int -> + unit -> + config

    Build a config from default_config.

    • since 0.12
    val add_dir_path : + config:config -> + dir:string -> + prefix:string -> + Tiny_httpd_core.Server.t -> + unit

    add_dirpath ~config ~dir ~prefix server adds route handle to the server to serve static files in dir when url starts with prefix, using the given configuration config.

    module type VFS = sig ... end

    Virtual file system.

    val vfs_of_dir : string -> (module VFS)

    vfs_of_dir dir makes a virtual file system that reads from the disk.

    • since 0.12
    val add_vfs : + config:config -> + vfs:(module VFS) -> + prefix:string -> + Tiny_httpd_core.Server.t -> + unit

    Similar to add_dir_path but using a virtual file system instead.

    • since 0.12
    module Embedded_fs : sig ... end

    An embedded file system, as a list of files with (relative) paths. This is useful in combination with the "tiny-httpd-mkfs" tool, which embeds the files it's given into a OCaml module.

    diff --git a/tiny_httpd/Tiny_httpd_unix/Dir/module-type-VFS/index.html b/tiny_httpd/Tiny_httpd_unix/Dir/module-type-VFS/index.html new file mode 100644 index 0000000..4418513 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_unix/Dir/module-type-VFS/index.html @@ -0,0 +1,2 @@ + +VFS (tiny_httpd.Tiny_httpd_unix.Dir.VFS)

    Module type Dir.VFS

    Virtual file system.

    This is used to emulate a file system from pure OCaml functions and data, e.g. for resources bundled inside the web server.

    • since 0.12
    val descr : string

    Description of the VFS

    val is_directory : string -> bool
    val contains : string -> bool

    file_exists vfs path returns true if path points to a file or directory inside vfs.

    val list_dir : string -> string array

    List directory. This only returns basenames, the files need to be put in the directory path using Filename.concat.

    val delete : string -> unit

    Delete path

    val create : string -> (bytes -> int -> int -> unit) * (unit -> unit)

    Create a file and obtain a pair write, close

    val read_file_content : string -> Tiny_httpd_core.IO.Input.t

    Read content of a file

    val file_size : string -> int option

    File size, e.g. using "stat"

    val file_mtime : string -> float option

    File modification time, e.g. using "stat"

    diff --git a/tiny_httpd/Tiny_httpd_unix/Sem/index.html b/tiny_httpd/Tiny_httpd_unix/Sem/index.html new file mode 100644 index 0000000..34ec2c5 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_unix/Sem/index.html @@ -0,0 +1,2 @@ + +Sem (tiny_httpd.Tiny_httpd_unix.Sem)

    Module Tiny_httpd_unix.Sem

    semaphore, for limiting concurrency.

    type t = {
    1. mutable n : int;
    2. max : int;
    3. mutex : Stdlib.Mutex.t;
    4. cond : Stdlib.Condition.t;
    }
    val create : int -> t
    val acquire : int -> t -> unit
    val release : int -> t -> unit
    val num_acquired : t -> int
    diff --git a/tiny_httpd/Tiny_httpd_unix/Unix_tcp_server_/index.html b/tiny_httpd/Tiny_httpd_unix/Unix_tcp_server_/index.html new file mode 100644 index 0000000..06acaaa --- /dev/null +++ b/tiny_httpd/Tiny_httpd_unix/Unix_tcp_server_/index.html @@ -0,0 +1,2 @@ + +Unix_tcp_server_ (tiny_httpd.Tiny_httpd_unix.Unix_tcp_server_)

    Module Tiny_httpd_unix.Unix_tcp_server_

    val get_addr_ : Unix.file_descr -> Unix.inet_addr * int
    type t = {
    1. addr : string;
    2. port : int;
    3. buf_pool : Tiny_httpd_core.Buf.t Tiny_httpd_core.Pool.t;
    4. slice_pool : Tiny_httpd_core.IO.Slice.t Tiny_httpd_core.Pool.t;
    5. max_connections : int;
    6. sem_max_connections : Sem.t;
      (*

      semaphore to restrict the number of active concurrent connections

      *)
    7. mutable sock : Unix.file_descr option;
      (*

      Socket

      *)
    8. new_thread : (unit -> unit) -> unit;
    9. timeout : float;
    10. masksigpipe : bool;
    11. mutable running : bool;
    }
    val shutdown_silent_ : Unix.file_descr -> unit
    val close_silent_ : Unix.file_descr -> unit
    diff --git a/tiny_httpd/Tiny_httpd_unix/index.html b/tiny_httpd/Tiny_httpd_unix/index.html new file mode 100644 index 0000000..efd9772 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_unix/index.html @@ -0,0 +1,2 @@ + +Tiny_httpd_unix (tiny_httpd.Tiny_httpd_unix)

    Module Tiny_httpd_unix

    module Dir : sig ... end

    Serving static content from directories

    module Sem : sig ... end

    semaphore, for limiting concurrency.

    module Unix_tcp_server_ : sig ... end
    diff --git a/tiny_httpd/Tiny_httpd_unix__/index.html b/tiny_httpd/Tiny_httpd_unix__/index.html new file mode 100644 index 0000000..65cf25b --- /dev/null +++ b/tiny_httpd/Tiny_httpd_unix__/index.html @@ -0,0 +1,2 @@ + +Tiny_httpd_unix__ (tiny_httpd.Tiny_httpd_unix__)

    Module Tiny_httpd_unix__

    This module is hidden.

    diff --git a/tiny_httpd/Tiny_httpd_unix__Dir/index.html b/tiny_httpd/Tiny_httpd_unix__Dir/index.html new file mode 100644 index 0000000..44dc82a --- /dev/null +++ b/tiny_httpd/Tiny_httpd_unix__Dir/index.html @@ -0,0 +1,2 @@ + +Tiny_httpd_unix__Dir (tiny_httpd.Tiny_httpd_unix__Dir)

    Module Tiny_httpd_unix__Dir

    This module is hidden.

    diff --git a/tiny_httpd/Tiny_httpd_unix__Sem/index.html b/tiny_httpd/Tiny_httpd_unix__Sem/index.html new file mode 100644 index 0000000..ef5a3f3 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_unix__Sem/index.html @@ -0,0 +1,2 @@ + +Tiny_httpd_unix__Sem (tiny_httpd.Tiny_httpd_unix__Sem)

    Module Tiny_httpd_unix__Sem

    This module is hidden.

    diff --git a/tiny_httpd/Tiny_httpd_ws/index.html b/tiny_httpd/Tiny_httpd_ws/index.html new file mode 100644 index 0000000..486f311 --- /dev/null +++ b/tiny_httpd/Tiny_httpd_ws/index.html @@ -0,0 +1,18 @@ + +Tiny_httpd_ws (tiny_httpd.Tiny_httpd_ws)

    Module Tiny_httpd_ws

    Websockets for Tiny_httpd.

    This sub-library (tiny_httpd.ws) exports a small implementation for a websocket server. It has no additional dependencies.

    Websocket handler

    Upgrade a byte stream to the websocket framing protocol.

    exception Close_connection

    Exception that can be raised from IOs inside the handler, when the connection is closed from underneath.

    val add_route_handler : + ?accept:(unit Tiny_httpd_core.Request.t -> (unit, int * string) result) -> + ?accept_ws_protocol:(string -> bool) -> + ?middlewares:Tiny_httpd_core.Server.Head_middleware.t list -> + Tiny_httpd_core.Server.t -> + (Tiny_httpd_core.Server.upgrade_handler, + Tiny_httpd_core.Server.upgrade_handler) + Tiny_httpd_core.Route.t -> + handler -> + unit

    Add a route handler for a websocket endpoint.

    • parameter accept_ws_protocol

      decides whether this endpoint accepts the websocket protocol sent by the client. Default accepts everything.

    diff --git a/tiny_httpd/Tiny_httpd_ws__/index.html b/tiny_httpd/Tiny_httpd_ws__/index.html new file mode 100644 index 0000000..9bb072a --- /dev/null +++ b/tiny_httpd/Tiny_httpd_ws__/index.html @@ -0,0 +1,2 @@ + +Tiny_httpd_ws__ (tiny_httpd.Tiny_httpd_ws__)

    Module Tiny_httpd_ws__

    This module is hidden.

    diff --git a/tiny_httpd/_doc-dir/CHANGES.md b/tiny_httpd/_doc-dir/CHANGES.md new file mode 100644 index 0000000..5561af6 --- /dev/null +++ b/tiny_httpd/_doc-dir/CHANGES.md @@ -0,0 +1,204 @@ + +## 0.19 + +- feat(headers): `set` will not reallocate whole list if not needed +- feat(headers): use case insensitive comparison +- fix(response): do not override "content-length" in raw response +- feat pool: expose `acquire/release` for advanced uses + +## 0.18 + +- feat: add ?head_middlewares to `create` +- add content-type header for prometheus endpoint +- new flag ?enable_logging to disable regular logs (not debug) +- new sublibrary to deal with multipart-form-data +- feat response: add `pp_with`; have `pp` hide set-cookie headers + +- fix percent encoding for < 0x10 chars +- Processing to fix incompatible -O and gcc flags +- fix: make check for 'Connection: Upgrade' header case-insensitive + +## 0.17 + +- add optional middlewares to tiny_httpd_ws +- add `Head_middleware.trivial` +- add `Head_middleware.t`; accept it for SSE/websocket +- add `Request.pp_with` which is a customizable printer +- expose `Response.Bad_req` +- use `iostream` for IOs +- add a `hmap`-typed field to requests, to carry request specific data + across middlewares +- http_of_dir: ability to setup socket timeout +- add `tiny_httpd.ws`, a websocket library +- add `Response_code.is_success` + +- fix: No setting of sigprocmask on Windows +- fix: give the correct code+error if protocol upgrade fails +- remove potentially security-leaking debug line +- fix: avoid collisions in `Mime_` private module +- fix middlewares: merge-sort per-request middleares and global ones +- fix tiny_httpd dir: handle html files + +- perf: optim in read_line +- perf: remove some uses of scanf in parsing + +- require iostream-camlzip >= 0.2.1 +- add optional dependency on `logs` +- logs is a testdep for tiny_httpd_camlzip + +## 0.16 + +- feat: add `Request.client_addr` accessor +- feat: add `tiny_httpd.prometheus`, a simple sub-library + to expose [prometheus](https://prometheus.io) metrics over HTTP. +- feat: add optional dependency on `logs` + +## 0.15 + +- fix: do not block in `accept`, enabling more graceful shutdown +- improve help message for tiny-httpd-vfs-pack +- security: zero out buffers from pool before reusing them + +## 0.14 + +- breaking: `set_top_handler` takes a stream request, for more generality + +- Don't let client handling threads handle SIGINT/SIGHUP +- improve termination behavior (wait for threads to terminate when shutting down server) +- Preserve client address down to Request.t +- add `Tiny_httpd_io` module, abstraction over IOs (output/input) as better IO channels + than the stdlib's +- add `Tiny_httpd_html.to_writer` +- add `IO.Writer.t`, a push based stream. +- add `Server.run_exn` +- add `Tiny_httpd_pool` +- server: add `IO_BACKEND` abstraction; implement a unix version of it + +- perf: use TCP_NODELAY for client sockets +- perf: use a resource pool to recycle buffers, improves memory consumption and GC pressure + +## 0.13 + +- feat: `Server.run` takes `?after_init` parameter +- remove dep on ounit2 and qtest +- expose `Response.make_void` +- Add OPTIONS method +- use ocamlformat on the code + +- fix: SSE requires no body +- fix: get addr/port from the current socket +- fix: missing closing crlf in chunked streams +- fix: module Html was not exposed +- fix: close stream after Response.output +- fix(tiny-httpd-vfs-pack): allow redirections when fetching resources + +## 0.12 + +- add dep on `seq` +- add a `Html` module with combinators to produce html +- add `Tiny_httpd_dir.VFS` to emulate file systems +- add a small program, `tiny-httpd-vfs-pack`, to pack directories and files + (local or behind a URL) into a OCaml module using `VFS` +- show small example of socket activation + +## 0.11 + +- breaking: remove deprecated path handlers based on scanf +- breaking: more getter/setters for request/response, change signatures, + make request/response private aliases + +- fix: release semaphore in case of exception in accept + +- feat: add a notion of Middleware +- feat: add `?middlewares` param to `create` +- feat: add `?get_time_s` param to `create` +- feat: close connection if response's headers contains connection +- feat: store `start_time` in request +- feat: implement connection timeout using socket options + Default is `max_keep_alive = -1.0` which preserves the original behaviour. +- feat: in server-sent-events, add a `close()` function + +- refactor(zip): compression is now a middleware +- perf: pass `buf_size` in many places, set default `buf_size` to 16kb +- example: update `echo` to provide a /stats/ endpoint using a middleware + +## 0.10 + +- feat: allow socket activation by passing a raw unix socket to `create` +- fix: `Unix.accept` may raise an exception + (typicall Unix.EINTR, even with sigpipe blocked ?), + prevent the server from stopping + +## 0.9 + +- support handlers that stream server-sent events to client + +## 0.8 + +- bump to ocaml 4.04 +- Validate header key's character set (#15) +- perf: simpler parsing of headers + +- fix: workaround for css/js in `http_of_dir` (#16) +- fix(urlencode): encode non ascii chars + +## 0.7 + +- feat: add `rest_of_path_urlencoded` and rename `rest` to `rest_of_path` +- feat: `http_of_dir`: redirect to index.html if present +- fix: `http_of_dir`: do not url-encode '/' in paths +- feat: add `Route.rest` to match the rest of the path +- feat: printing routes + +## 0.6 + +- feat: add `Route.t` construct, deprecate scanf, add more structured path +- feat: use chunked encoding for large string responses, in addition to streams +- refactor(echo): simplify code, use gzip aggressively +- accept http1.0 + +- fix: do not output a `content-length` for a chunked response +- fix: set `transfer-encoding` header when returning a chunked stream +- fix(zip): handle case where camlzip consumes 0 bytes +- feat(zip): also compress string responses if they're big +- add more debug msg + +## 0.5 + +- new `tiny_httpd_camlzip` library for handling `deflate` compression +- feat: expose `Headers.empty` +- fix: use the non-query path for routing +- feat(util): add some query related utils + +## 0.4 + +- easy accessor to the query parameters in path +- fix: header field names are case insensitive +- doc: add note on jemalloc in the readme +- log error when closing client socket + +## 0.3 + +- feat(http_of_dir): use `file` to guess mime type of file +- feat: allow handlers to take streams +- feat(bin): disable uploading by default +- feat: add `Tiny_httpd_util.parse_query` for query decoding +- feat(bin): set charset to utf8 +- feat: autodetect ipv6 address +- feat: support ipv6 address + +- fix: missing crlf between chunks +- fix: read_all must return rather than blocking when done +- fix: proper amortized O(1) push in Buf.push +- fix: `%X` for percent_encode; use `percent_decode` in `parse_query` + +## 0.2 + +- feat(bin): count number of hidden files +- feat(bin): use `details` for hiding hidden files by default +- fix: improved percent encoding of paths +- feat: add percent encoding/decoding +- feat(bin): better human-size display +- feat: in http_of_dir, sort entries and display their size +- fix(http_of_dir): handle bad symlinks +- improve docs and opam, tidy up for 0.1 diff --git a/tiny_httpd/_doc-dir/README.md b/tiny_httpd/_doc-dir/README.md new file mode 100644 index 0000000..0dbc50f --- /dev/null +++ b/tiny_httpd/_doc-dir/README.md @@ -0,0 +1,194 @@ +# Tiny_httpd [![build](https://github.com/c-cube/tiny_httpd/workflows/build/badge.svg)](https://github.com/c-cube/tiny_httpd/actions) + +Minimal HTTP server using good old threads, with stream abstractions, +simple routing, URL encoding/decoding, static asset serving, +and optional compression with camlzip. +It also supports [server-sent events](https://developer.mozilla.org/en-US/docs/Web/API/Server-sent_events/Using_server-sent_events) +([w3c](https://html.spec.whatwg.org/multipage/server-sent-events.html#event-stream-interpretation)) + +Free from all forms of `ppx`, async monads, etc. 🙃 + +**Note**: it can be useful to add the `jemalloc` opam package for long running +server, as it does a good job at controlling memory usage. + +The basic echo server from `src/examples/echo.ml`: + +```ocaml + +module S = Tiny_httpd + +let () = + let server = S.create () in + (* say hello *) + S.add_route_handler ~meth:`GET server + S.Route.(exact "hello" @/ string @/ return) + (fun name _req -> S.Response.make_string (Ok ("hello " ^name ^"!\n"))); + (* echo request *) + S.add_route_handler server + S.Route.(exact "echo" @/ return) + (fun req -> S.Response.make_string (Ok (Format.asprintf "echo:@ %a@." S.Request.pp req))); + Printf.printf "listening on http://%s:%d\n%!" (S.addr server) (S.port server); + match S.run server with + | Ok () -> () + | Error e -> raise e +``` + +```sh +$ dune exec src/examples/echo.exe & +listening on http://127.0.0.1:8080 + +# the path "hello/name" greets you. +$ curl -X GET http://localhost:8080/hello/quadrarotaphile +hello quadrarotaphile! + +# the path "echo" just prints the request. +$ curl -X GET http://localhost:8080/echo --data "howdy y'all" +echo: +{meth=GET; + headers=Host: localhost:8080 + User-Agent: curl/7.66.0 + Accept: */* + Content-Length: 10 + Content-Type: application/x-www-form-urlencoded; + path="/echo"; body="howdy y'all"} + +``` + +## `http_of_dir` + +Similar to `python -m http.server`, a simple program `http_of_dir` is provided. +It serves files from the current directory. + +```sh +$ http_of_dir . -p 8080 & +$ curl -X GET http://localhost:8080 +... + +... + +``` + +## Static assets and files + +The program `http_of_dir` relies on the module `Tiny_httpd_dir`, which +can serve directories, as well as _virtual file systems_. + +In 'examples/dune', we produce an OCaml module `vfs.ml` using +the program `tiny-httpd-vfs-pack`. This module contains a VFS (virtual file +system) which can be served as if it were an actual directory. + +The dune rule: + +```lisp +(rule + (targets vfs.ml) + (deps (source_tree files) (:out test_output.txt.expected)) + (enabled_if (= %{system} "linux")) + (action (run ../src/bin/vfs_pack.exe -o %{targets} + --mirror=files/ + --file=test_out.txt,%{out} + --url=example_dot_com,http://example.com))) +``` + +The code to serve the VFS from `vfs.ml` is as follows: + +```ocaml + … + Tiny_httpd_dir.add_vfs server + ~config:(Tiny_httpd_dir.config ~download:true + ~dir_behavior:Tiny_httpd_dir.Index_or_lists ()) + ~vfs:Vfs.vfs ~prefix:"vfs"; + … +``` + +it allows downloading the files, and listing directories. +If a directory contains `index.html` then this will be served +instead of listing the content. + +## Steaming response body + +Tiny_httpd provides multiple ways of returning a body in a response. +The response body type is: + +```ocaml +type body = + [ `String of string + | `Stream of byte_stream + | `Writer of Tiny_httpd_io.Writer.t + | `Void ] +``` + +The simplest way is to return, say, `` `String "hello" ``. The response +will have a set content-length header and its body is just the string. +Some responses don't have a body at all, which is where `` `Void `` is useful. + +The `` `Stream _ `` case is more advanced and really only intended for experts. + +The `` `Writer w `` is new, and is intended as an easy way to write the +body in a streaming fashion. See 'examples/writer.ml' to see a full example. +Typically the idea is to create the body with `Tiny_httpd_io.Writer.make ~write ()` +where `write` will be called with an output channel (the connection to the client), +and can write whatever it wants to this channel. Once the `write` function returns +the body has been fully sent and the next request can be processed. + +## Socket activation + +Since version 0.10, socket activation is supported indirectly, by allowing a +socket to be explicitly passed in to the `create` function: + +```ocaml +module S = Tiny_httpd + +let not_found _ _ = S.Response.fail ~code:404 "Not Found\n" + +let () = + (* Module [Daemon] is from the [ocaml-systemd] package *) + let server = match Daemon.listen_fds () with + (* If no socket passed in, assume server was started explicitly i.e. without + socket activation *) + | [] -> S.create () + + (* If a socket passed in e.g. by systemd, listen on that *) + | sock :: _ -> S.create ~sock () + in + S.add_route_handler server S.Route.rest_of_path not_found; + Printf.printf "Listening on http://%s:%d\n%!" (S.addr server) (S.port server); + match S.run server with + | Ok () -> () + | Error e -> raise e +``` + +On Linux, this requires the +[ocaml-systemd](https://github.com/juergenhoetzel/ocaml-systemd) package: + +``` +opam install ocaml-systemd +``` + +Tip: in the `dune` file, the package name should be `systemd`. + +In case you're not familiar with socket activation, Lennart Poettering's +[blog post](http://0pointer.de/blog/projects/socket-activation.html) explains it +well. + +## Why? + +Why not? If you just want a super basic local server (perhaps for exposing +data from a local demon, like Cups or Syncthing do), no need for a ton of +dependencies or high scalability libraries. + +Use cases might include: + +- serve content directly from a static blog generator; +- provide a web UI to some tool (like CUPS and syncthing do); +- implement a basic monitoring page for a service; +- provide a simple json API for a service, on top of http; +- use `http_of_dir` to serve odoc-generated docs or some assets directory. + +## Documentation + +See https://c-cube.github.io/tiny_httpd + +## License + +MIT. diff --git a/tiny_httpd/index.html b/tiny_httpd/index.html new file mode 100644 index 0000000..bb3c8d0 --- /dev/null +++ b/tiny_httpd/index.html @@ -0,0 +1,2 @@ + +index (tiny_httpd.index)

    Package tiny_httpd

    Package info

    changes-files
    readme-files
    diff --git a/trace/Trace/index.html b/trace/Trace/index.html new file mode 100644 index 0000000..7d0d5dd --- /dev/null +++ b/trace/Trace/index.html @@ -0,0 +1,57 @@ + +Trace (trace.Trace)

    Module Trace

    include module type of struct include Trace_core end
    type span = int64

    A span identifier.

    The meaning of the identifier depends on the collector.

    type user_data = [
    1. | `Int of int
    2. | `String of string
    3. | `Bool of bool
    4. | `Float of float
    5. | `None
    ]

    User defined data, generally passed as key/value pairs to whatever collector is installed (if any).

    type explicit_span = Trace_core.explicit_span = {
    1. span : span;
      (*

      Identifier for this span. Several explicit spans might share the same identifier since we can differentiate between them via meta.

      *)
    2. mutable meta : Trace_core.Meta_map.t;
      (*

      Metadata for this span (and its context). This can be used by collectors to carry collector-specific information from the beginning of the span, to the end of the span.

      *)
    }

    Explicit span, with collector-specific metadata

    module Collector = Trace_core.Collector
    module Meta_map = Trace_core.Meta_map
    module Level = Trace_core.Level

    Tracing

    val enabled : unit -> bool

    Is there a collector?

    This is fast, so that the traced program can check it before creating any span or message.

    val get_default_level : unit -> Level.t

    Current default level for spans.

    • since 0.7
    val set_default_level : Level.t -> unit

    Set level used for spans that do not specify it. The default default value is Level.Trace.

    • since 0.7
    val with_span : + ?level:Level.t -> + ?__FUNCTION__:string -> + __FILE__:string -> + __LINE__:int -> + ?data:(unit -> (string * user_data) list) -> + string -> + (span -> 'a) -> + 'a

    with_span ~__FILE__ ~__LINE__ name f enters a new span sp, and calls f sp. sp might be a dummy span if no collector is installed. When f sp returns or raises, the span sp is exited.

    This is the recommended way to instrument most code.

    • parameter level

      optional level for this span. since 0.7. Default is set via set_default_level.

    NOTE an important restriction is that this is only supposed to work for synchronous, direct style code. Monadic concurrency, Effect-based fibers, etc. might not play well with this style of spans on some or all backends. If you use cooperative concurrency, see enter_manual_span.

    val enter_span : + ?level:Level.t -> + ?__FUNCTION__:string -> + __FILE__:string -> + __LINE__:int -> + ?data:(unit -> (string * user_data) list) -> + string -> + span

    Enter a span manually.

    • parameter level

      optional level for this span. since 0.7. Default is set via set_default_level.

    val exit_span : span -> unit

    Exit a span manually. This must run on the same thread as the corresponding enter_span, and spans must nest correctly.

    val add_data_to_span : span -> (string * user_data) list -> unit

    Add structured data to the given active span (see with_span). Behavior is not specified if the span has been exited.

    • since 0.4
    val enter_manual_sub_span : + parent:explicit_span -> + ?flavor:[ `Sync | `Async ] -> + ?level:Level.t -> + ?__FUNCTION__:string -> + __FILE__:string -> + __LINE__:int -> + ?data:(unit -> (string * user_data) list) -> + string -> + explicit_span

    Like with_span but the caller is responsible for obtaining the parent span from their own caller, and carry the resulting explicit_span to the matching exit_manual_span.

    • parameter flavor

      a description of the span that can be used by the Collector.S to decide how to represent the span. Typically, `Sync spans start and stop on one thread, and are nested purely by their timestamp; and `Async spans can overlap, migrate between threads, etc. (as happens in Lwt, Eio, Async, etc.) which impacts how the collector might represent them.

    • parameter level

      optional level for this span. since 0.7. Default is set via set_default_level.

    • since 0.3
    val enter_manual_toplevel_span : + ?flavor:[ `Sync | `Async ] -> + ?level:Level.t -> + ?__FUNCTION__:string -> + __FILE__:string -> + __LINE__:int -> + ?data:(unit -> (string * user_data) list) -> + string -> + explicit_span

    Like with_span but the caller is responsible for carrying this explicit_span around until it's exited with exit_manual_span. The span can be used as a parent in enter_manual_sub_span.

    • parameter level

      optional level for this span. since 0.7. Default is set via set_default_level.

    • since 0.3
    val exit_manual_span : explicit_span -> unit

    Exit an explicit span. This can be on another thread, in a fiber or lightweight thread, etc. and will be supported by backends nonetheless. The span can be obtained via enter_manual_sub_span or enter_manual_toplevel_span.

    • since 0.3
    val add_data_to_manual_span : + explicit_span -> + (string * user_data) list -> + unit

    add_data_explicit esp data adds data to the span esp. The behavior is not specified is the span has been exited already.

    • since 0.4
    val message : + ?level:Level.t -> + ?span:span -> + ?data:(unit -> (string * user_data) list) -> + string -> + unit

    message msg logs a message msg (if a collector is installed). Additional metadata can be provided.

    • parameter level

      optional level for this span. since 0.7. Default is set via set_default_level.

    • parameter span

      the surrounding span, if any. This might be ignored by the collector.

    val messagef : + ?level:Level.t -> + ?span:span -> + ?data:(unit -> (string * user_data) list) -> + ((('a, Stdlib.Format.formatter, unit, unit) format4 -> 'a) -> unit) -> + unit

    messagef (fun k->k"hello %s %d!" "world" 42) is like message "hello world 42!" but only computes the string formatting if a collector is installed.

    • parameter level

      optional level for this span. since 0.7. Default is set via set_default_level.

    val set_thread_name : string -> unit

    Give a name to the current thread. This might be used by the collector to display traces in a more informative way.

    val set_process_name : string -> unit

    Give a name to the current process. This might be used by the collector to display traces in a more informative way.

    val counter_int : + ?level:Level.t -> + ?data:(unit -> (string * user_data) list) -> + string -> + int -> + unit

    Emit a counter of type int. Counters represent the evolution of some quantity over time.

    • parameter level

      optional level for this span. since 0.7. Default is set via set_default_level.

    • parameter data

      metadata for this metric (since 0.4)

    val counter_float : + ?level:Level.t -> + ?data:(unit -> (string * user_data) list) -> + string -> + float -> + unit

    Emit a counter of type float. See counter_int for more details.

    • parameter level

      optional level for this span. since 0.7. Default is set via set_default_level.

    • parameter data

      metadata for this metric (since 0.4)

    Collector

    type collector = (module Collector.S)

    An event collector.

    See Collector for more details.

    val setup_collector : collector -> unit

    setup_collector c installs c as the current collector.

    • raises Invalid_argument

      if there already is an established collector.

    val get_current_level : unit -> Level.t

    Get current level. This is only meaningful if a collector was set up with setup_collector.

    • since 0.7
    val set_current_level : Level.t -> unit

    Set the current level of tracing. This only has a visible effect if a collector was installed with setup_collector.

    • since 0.7
    val shutdown : unit -> unit

    shutdown () shutdowns the current collector, if one was installed, and waits for it to terminate before returning.

    Extensions

    type extension_event = ..

    Extension event

    • since 0.8
    val extension_event : extension_event -> unit

    Trigger an extension event, whose meaning depends on the library that defines it. Some collectors will simply ignore it. This does nothing if no collector is setup.

    • since 0.8
    diff --git a/trace/Trace_core/Collector/index.html b/trace/Trace_core/Collector/index.html new file mode 100644 index 0000000..67608dc --- /dev/null +++ b/trace/Trace_core/Collector/index.html @@ -0,0 +1,2 @@ + +Collector (trace.Trace_core.Collector)

    Module Trace_core.Collector

    A global collector.

    The collector, if present, is responsible for collecting messages and spans, and storing them, recording them, forward them, or offering them to other services and processes.

    val dummy_span : int64
    val dummy_explicit_span : Trace_core__.Types.explicit_span
    module type S = sig ... end

    Signature for a collector.

    diff --git a/trace/Trace_core/Collector/module-type-S/index.html b/trace/Trace_core/Collector/module-type-S/index.html new file mode 100644 index 0000000..1832e1d --- /dev/null +++ b/trace/Trace_core/Collector/module-type-S/index.html @@ -0,0 +1,95 @@ + +S (trace.Trace_core.Collector.S)

    Module type Collector.S

    Signature for a collector.

    This is only relevant to implementors of tracing backends; to instrument your code you only need to look at the Trace module.

    val with_span : + __FUNCTION__:string option -> + __FILE__:string -> + __LINE__:int -> + data: + (string + * [ `Int of int + | `String of string + | `Bool of bool + | `Float of float + | `None ]) + list -> + string -> + (int64 -> 'a) -> + 'a

    Run the function in a new span.

    This replaces the previous enter_span and exit_span which were too flexible to be efficient to implement in async contexts.

    • since 0.3
    val enter_span : + __FUNCTION__:string option -> + __FILE__:string -> + __LINE__:int -> + data: + (string + * [ `Int of int + | `String of string + | `Bool of bool + | `Float of float + | `None ]) + list -> + string -> + int64

    Enter a new implicit span. For many uses cases, with_span will be easier to use.

    • since 0.6
    val exit_span : int64 -> unit

    Exit span. This should be called on the same thread as the corresponding enter_span, and nest properly with other calls to enter/exit_span and with_span.

    • since 0.6
    val enter_manual_span : + parent:Trace_core__.Types.explicit_span option -> + flavor:[ `Sync | `Async ] option -> + __FUNCTION__:string option -> + __FILE__:string -> + __LINE__:int -> + data: + (string + * [ `Int of int + | `String of string + | `Bool of bool + | `Float of float + | `None ]) + list -> + string -> + Trace_core__.Types.explicit_span

    Enter an explicit span. Surrounding scope, if any, is provided by parent, and this function can store as much metadata as it wants in the hmap in the explicit_span's meta field.

    This means that the collector doesn't need to implement contextual storage mapping span to scopes, metadata, etc. on its side; everything can be transmitted in the explicit_span.

    • since 0.3
    val exit_manual_span : Trace_core__.Types.explicit_span -> unit

    Exit an explicit span.

    • since 0.3
    val add_data_to_span : + int64 -> + (string + * [ `Int of int + | `String of string + | `Bool of bool + | `Float of float + | `None ]) + list -> + unit
    • since Adds data to the current span.

    0.4

    val add_data_to_manual_span : + Trace_core__.Types.explicit_span -> + (string + * [ `Int of int + | `String of string + | `Bool of bool + | `Float of float + | `None ]) + list -> + unit

    Adds data to the given span.

    • since 0.4
    val message : + ?span:int64 -> + data: + (string + * [ `Int of int + | `String of string + | `Bool of bool + | `Float of float + | `None ]) + list -> + string -> + unit

    Emit a message with associated metadata.

    val name_thread : string -> unit

    Give a name to the current thread.

    val name_process : string -> unit

    Give a name to the current process.

    val counter_int : + data: + (string + * [ `Int of int + | `String of string + | `Bool of bool + | `Float of float + | `None ]) + list -> + string -> + int -> + unit

    Integer counter.

    val counter_float : + data: + (string + * [ `Int of int + | `String of string + | `Bool of bool + | `Float of float + | `None ]) + list -> + string -> + float -> + unit

    Float counter.

    val extension_event : Trace_core__.Types.extension_event -> unit

    Handle an extension event. A collector MUST simple ignore events it doesn't know, and return () silently.

    • since 0.8
    val shutdown : unit -> unit

    Shutdown collector, possibly waiting for it to finish sending data.

    diff --git a/trace/Trace_core/Level/index.html b/trace/Trace_core/Level/index.html new file mode 100644 index 0000000..7e9a930 --- /dev/null +++ b/trace/Trace_core/Level/index.html @@ -0,0 +1,2 @@ + +Level (trace.Trace_core.Level)

    Module Trace_core.Level

    Tracing levels.

    This is similar to log levels in, say, Logs. In a thoroughly instrumented program, there will be a lot of spans, and enabling them all in production might slow down the application or overwhelm the tracing system; yet they might be useful in debug situations.

    • since 0.7
    type t =
    1. | Error
      (*

      Only errors

      *)
    2. | Warning
      (*

      Warnings

      *)
    3. | Info
    4. | Debug1
      (*

      Least verbose debugging level

      *)
    5. | Debug2
      (*

      Intermediate verbosity debugging level

      *)
    6. | Debug3
      (*

      Maximum verbosity debugging level

      *)
    7. | Trace
      (*

      Enable everything (default level)

      *)

    Level of tracing. These levels are in increasing order, i.e if level Debug1 is enabled, everything below it (Error, Warning, Info, etc.) are also enabled.

    • since 0.7
    val to_string : t -> string
    • since 0.7
    val leq : t -> t -> bool
    diff --git a/trace/Trace_core/Meta_map/index.html b/trace/Trace_core/Meta_map/index.html new file mode 100644 index 0000000..15a4c5a --- /dev/null +++ b/trace/Trace_core/Meta_map/index.html @@ -0,0 +1,2 @@ + +Meta_map (trace.Trace_core.Meta_map)

    Module Trace_core.Meta_map

    include module type of struct include Hmap end

    Keys

    type 'a key = 'a Hmap.key

    The type for keys whose lookup value is of type 'a.

    module Key = Hmap.Key

    Keys.

    Maps

    type t = Hmap.t

    The type for heterogeneous value maps.

    val empty : t

    empty is the empty map.

    val is_empty : t -> bool

    is_empty m is true iff m is empty.

    val mem : 'a key -> t -> bool

    mem k m is true iff k is bound in m.

    val add : 'a key -> 'a -> t -> t

    add k v m is m with k bound to v.

    val singleton : 'a key -> 'a -> t

    singleton k v is add k v empty.

    val rem : 'a key -> t -> t

    rem k m is m with k unbound.

    val find : 'a key -> t -> 'a option

    find k m is the value of k's binding in m, if any.

    val get : 'a key -> t -> 'a

    get k m is the value of k's binding in m.

    • raises Invalid_argument

      if k is not bound in m.

    type binding = Hmap.binding =
    1. | B : 'a key * 'a -> binding

    The type for bindings.

    val iter : (binding -> unit) -> t -> unit

    iter f m applies f to all bindings of m.

    val fold : (binding -> 'a -> 'a) -> t -> 'a -> 'a

    fold f m acc folds over the bindings of m with f, starting with acc

    val for_all : (binding -> bool) -> t -> bool

    for_all p m is true iff all bindings of m satisfy p.

    val exists : (binding -> bool) -> t -> bool

    exists p m is true iff there exists a bindings of m that satisfies p.

    val filter : (binding -> bool) -> t -> t

    filter p m are the bindings of m that satisfy p.

    val cardinal : t -> int

    cardinal m is the number of bindings in m.

    val any_binding : t -> binding option

    any_binding m is a binding of m (if not empty).

    val get_any_binding : t -> binding

    get_any_binding m is a binding of m.

    • raises Invalid_argument

      if m is empty.

    Functorial interface

    The functorial interface allows to associate more information to the keys. For example a key name or a key value pretty-printer.

    module type KEY_INFO = Hmap.KEY_INFO

    The type for key information.

    module type S = Hmap.S

    Output signature of the functor Make

    module Make = Hmap.Make

    Functor for heterogeneous maps whose keys hold information of type Key_info.t

    val find_exn : 'a key -> t -> 'a
    diff --git a/trace/Trace_core/index.html b/trace/Trace_core/index.html new file mode 100644 index 0000000..7ce42cd --- /dev/null +++ b/trace/Trace_core/index.html @@ -0,0 +1,57 @@ + +Trace_core (trace.Trace_core)

    Module Trace_core

    Trace.

    type span = int64

    A span identifier.

    The meaning of the identifier depends on the collector.

    type user_data = [
    1. | `Int of int
    2. | `String of string
    3. | `Bool of bool
    4. | `Float of float
    5. | `None
    ]

    User defined data, generally passed as key/value pairs to whatever collector is installed (if any).

    type explicit_span = {
    1. span : span;
      (*

      Identifier for this span. Several explicit spans might share the same identifier since we can differentiate between them via meta.

      *)
    2. mutable meta : Meta_map.t;
      (*

      Metadata for this span (and its context). This can be used by collectors to carry collector-specific information from the beginning of the span, to the end of the span.

      *)
    }

    Explicit span, with collector-specific metadata

    module Collector : sig ... end

    A global collector.

    module Meta_map : sig ... end
    module Level : sig ... end

    Tracing levels.

    Tracing

    val enabled : unit -> bool

    Is there a collector?

    This is fast, so that the traced program can check it before creating any span or message.

    val get_default_level : unit -> Level.t

    Current default level for spans.

    • since 0.7
    val set_default_level : Level.t -> unit

    Set level used for spans that do not specify it. The default default value is Level.Trace.

    • since 0.7
    val with_span : + ?level:Level.t -> + ?__FUNCTION__:string -> + __FILE__:string -> + __LINE__:int -> + ?data:(unit -> (string * user_data) list) -> + string -> + (span -> 'a) -> + 'a

    with_span ~__FILE__ ~__LINE__ name f enters a new span sp, and calls f sp. sp might be a dummy span if no collector is installed. When f sp returns or raises, the span sp is exited.

    This is the recommended way to instrument most code.

    • parameter level

      optional level for this span. since 0.7. Default is set via set_default_level.

    NOTE an important restriction is that this is only supposed to work for synchronous, direct style code. Monadic concurrency, Effect-based fibers, etc. might not play well with this style of spans on some or all backends. If you use cooperative concurrency, see enter_manual_span.

    val enter_span : + ?level:Level.t -> + ?__FUNCTION__:string -> + __FILE__:string -> + __LINE__:int -> + ?data:(unit -> (string * user_data) list) -> + string -> + span

    Enter a span manually.

    • parameter level

      optional level for this span. since 0.7. Default is set via set_default_level.

    val exit_span : span -> unit

    Exit a span manually. This must run on the same thread as the corresponding enter_span, and spans must nest correctly.

    val add_data_to_span : span -> (string * user_data) list -> unit

    Add structured data to the given active span (see with_span). Behavior is not specified if the span has been exited.

    • since 0.4
    val enter_manual_sub_span : + parent:explicit_span -> + ?flavor:[ `Sync | `Async ] -> + ?level:Level.t -> + ?__FUNCTION__:string -> + __FILE__:string -> + __LINE__:int -> + ?data:(unit -> (string * user_data) list) -> + string -> + explicit_span

    Like with_span but the caller is responsible for obtaining the parent span from their own caller, and carry the resulting explicit_span to the matching exit_manual_span.

    • parameter flavor

      a description of the span that can be used by the Collector.S to decide how to represent the span. Typically, `Sync spans start and stop on one thread, and are nested purely by their timestamp; and `Async spans can overlap, migrate between threads, etc. (as happens in Lwt, Eio, Async, etc.) which impacts how the collector might represent them.

    • parameter level

      optional level for this span. since 0.7. Default is set via set_default_level.

    • since 0.3
    val enter_manual_toplevel_span : + ?flavor:[ `Sync | `Async ] -> + ?level:Level.t -> + ?__FUNCTION__:string -> + __FILE__:string -> + __LINE__:int -> + ?data:(unit -> (string * user_data) list) -> + string -> + explicit_span

    Like with_span but the caller is responsible for carrying this explicit_span around until it's exited with exit_manual_span. The span can be used as a parent in enter_manual_sub_span.

    • parameter level

      optional level for this span. since 0.7. Default is set via set_default_level.

    • since 0.3
    val exit_manual_span : explicit_span -> unit

    Exit an explicit span. This can be on another thread, in a fiber or lightweight thread, etc. and will be supported by backends nonetheless. The span can be obtained via enter_manual_sub_span or enter_manual_toplevel_span.

    • since 0.3
    val add_data_to_manual_span : + explicit_span -> + (string * user_data) list -> + unit

    add_data_explicit esp data adds data to the span esp. The behavior is not specified is the span has been exited already.

    • since 0.4
    val message : + ?level:Level.t -> + ?span:span -> + ?data:(unit -> (string * user_data) list) -> + string -> + unit

    message msg logs a message msg (if a collector is installed). Additional metadata can be provided.

    • parameter level

      optional level for this span. since 0.7. Default is set via set_default_level.

    • parameter span

      the surrounding span, if any. This might be ignored by the collector.

    val messagef : + ?level:Level.t -> + ?span:span -> + ?data:(unit -> (string * user_data) list) -> + ((('a, Stdlib.Format.formatter, unit, unit) format4 -> 'a) -> unit) -> + unit

    messagef (fun k->k"hello %s %d!" "world" 42) is like message "hello world 42!" but only computes the string formatting if a collector is installed.

    • parameter level

      optional level for this span. since 0.7. Default is set via set_default_level.

    val set_thread_name : string -> unit

    Give a name to the current thread. This might be used by the collector to display traces in a more informative way.

    val set_process_name : string -> unit

    Give a name to the current process. This might be used by the collector to display traces in a more informative way.

    val counter_int : + ?level:Level.t -> + ?data:(unit -> (string * user_data) list) -> + string -> + int -> + unit

    Emit a counter of type int. Counters represent the evolution of some quantity over time.

    • parameter level

      optional level for this span. since 0.7. Default is set via set_default_level.

    • parameter data

      metadata for this metric (since 0.4)

    val counter_float : + ?level:Level.t -> + ?data:(unit -> (string * user_data) list) -> + string -> + float -> + unit

    Emit a counter of type float. See counter_int for more details.

    • parameter level

      optional level for this span. since 0.7. Default is set via set_default_level.

    • parameter data

      metadata for this metric (since 0.4)

    Collector

    type collector = (module Collector.S)

    An event collector.

    See Collector for more details.

    val setup_collector : collector -> unit

    setup_collector c installs c as the current collector.

    • raises Invalid_argument

      if there already is an established collector.

    val get_current_level : unit -> Level.t

    Get current level. This is only meaningful if a collector was set up with setup_collector.

    • since 0.7
    val set_current_level : Level.t -> unit

    Set the current level of tracing. This only has a visible effect if a collector was installed with setup_collector.

    • since 0.7
    val shutdown : unit -> unit

    shutdown () shutdowns the current collector, if one was installed, and waits for it to terminate before returning.

    Extensions

    type extension_event = ..

    Extension event

    • since 0.8
    val extension_event : extension_event -> unit

    Trigger an extension event, whose meaning depends on the library that defines it. Some collectors will simply ignore it. This does nothing if no collector is setup.

    • since 0.8
    diff --git a/trace/Trace_core__/index.html b/trace/Trace_core__/index.html new file mode 100644 index 0000000..62fe62b --- /dev/null +++ b/trace/Trace_core__/index.html @@ -0,0 +1,2 @@ + +Trace_core__ (trace.Trace_core__)

    Module Trace_core__

    This module is hidden.

    diff --git a/trace/Trace_core__Atomic_/index.html b/trace/Trace_core__Atomic_/index.html new file mode 100644 index 0000000..9c7dc18 --- /dev/null +++ b/trace/Trace_core__Atomic_/index.html @@ -0,0 +1,2 @@ + +Trace_core__Atomic_ (trace.Trace_core__Atomic_)

    Module Trace_core__Atomic_

    This module is hidden.

    diff --git a/trace/Trace_core__Collector/index.html b/trace/Trace_core__Collector/index.html new file mode 100644 index 0000000..9366cc3 --- /dev/null +++ b/trace/Trace_core__Collector/index.html @@ -0,0 +1,2 @@ + +Trace_core__Collector (trace.Trace_core__Collector)

    Module Trace_core__Collector

    This module is hidden.

    diff --git a/trace/Trace_core__Level/index.html b/trace/Trace_core__Level/index.html new file mode 100644 index 0000000..486227e --- /dev/null +++ b/trace/Trace_core__Level/index.html @@ -0,0 +1,2 @@ + +Trace_core__Level (trace.Trace_core__Level)

    Module Trace_core__Level

    This module is hidden.

    diff --git a/trace/Trace_core__Meta_map/index.html b/trace/Trace_core__Meta_map/index.html new file mode 100644 index 0000000..4cd6ee5 --- /dev/null +++ b/trace/Trace_core__Meta_map/index.html @@ -0,0 +1,2 @@ + +Trace_core__Meta_map (trace.Trace_core__Meta_map)

    Module Trace_core__Meta_map

    This module is hidden.

    diff --git a/trace/Trace_core__Types/index.html b/trace/Trace_core__Types/index.html new file mode 100644 index 0000000..9bede54 --- /dev/null +++ b/trace/Trace_core__Types/index.html @@ -0,0 +1,2 @@ + +Trace_core__Types (trace.Trace_core__Types)

    Module Trace_core__Types

    This module is hidden.

    diff --git a/trace/Trace_private_util/B_queue/index.html b/trace/Trace_private_util/B_queue/index.html new file mode 100644 index 0000000..4029a41 --- /dev/null +++ b/trace/Trace_private_util/B_queue/index.html @@ -0,0 +1,2 @@ + +B_queue (trace.Trace_private_util.B_queue)

    Module Trace_private_util.B_queue

    Basic Blocking Queue

    type 'a t
    val create : unit -> _ t
    exception Closed
    val push : 'a t -> 'a -> unit

    push q x pushes x into q, and returns ().

    • raises Closed

      if close q was previously called.

    val pop_all : 'a t -> 'a list

    pop_all bq returns all items presently in bq, in the same order, and clears bq. It blocks if no element is in bq.

    val close : _ t -> unit

    Close the queue, meaning there won't be any more push allowed.

    diff --git a/trace/Trace_private_util/Domain_util/index.html b/trace/Trace_private_util/Domain_util/index.html new file mode 100644 index 0000000..ac8963d --- /dev/null +++ b/trace/Trace_private_util/Domain_util/index.html @@ -0,0 +1,2 @@ + +Domain_util (trace.Trace_private_util.Domain_util)

    Module Trace_private_util.Domain_util

    val cpu_relax : unit -> unit
    val n_domains : unit -> int
    diff --git a/trace/Trace_private_util/Mpsc_bag/index.html b/trace/Trace_private_util/Mpsc_bag/index.html new file mode 100644 index 0000000..2574922 --- /dev/null +++ b/trace/Trace_private_util/Mpsc_bag/index.html @@ -0,0 +1,2 @@ + +Mpsc_bag (trace.Trace_private_util.Mpsc_bag)

    Module Trace_private_util.Mpsc_bag

    A multi-producer, single-consumer bag

    type 'a t
    val create : unit -> 'a t
    val add : 'a t -> 'a -> unit

    add q x adds x in the bag.

    val pop_all : 'a t -> 'a list option

    Return all current items in the insertion order.

    diff --git a/trace/Trace_private_util/index.html b/trace/Trace_private_util/index.html new file mode 100644 index 0000000..0b5f08c --- /dev/null +++ b/trace/Trace_private_util/index.html @@ -0,0 +1,2 @@ + +Trace_private_util (trace.Trace_private_util)

    Module Trace_private_util

    module B_queue : sig ... end

    Basic Blocking Queue

    module Domain_util : sig ... end
    module Mpsc_bag : sig ... end

    A multi-producer, single-consumer bag

    diff --git a/trace/Trace_private_util__B_queue/index.html b/trace/Trace_private_util__B_queue/index.html new file mode 100644 index 0000000..35c56c3 --- /dev/null +++ b/trace/Trace_private_util__B_queue/index.html @@ -0,0 +1,2 @@ + +Trace_private_util__B_queue (trace.Trace_private_util__B_queue)

    Module Trace_private_util__B_queue

    This module is hidden.

    diff --git a/trace/Trace_private_util__Domain_util/index.html b/trace/Trace_private_util__Domain_util/index.html new file mode 100644 index 0000000..520b31b --- /dev/null +++ b/trace/Trace_private_util__Domain_util/index.html @@ -0,0 +1,2 @@ + +Trace_private_util__Domain_util (trace.Trace_private_util__Domain_util)

    Module Trace_private_util__Domain_util

    This module is hidden.

    diff --git a/trace/Trace_private_util__Mpsc_bag/index.html b/trace/Trace_private_util__Mpsc_bag/index.html new file mode 100644 index 0000000..92b91fa --- /dev/null +++ b/trace/Trace_private_util__Mpsc_bag/index.html @@ -0,0 +1,2 @@ + +Trace_private_util__Mpsc_bag (trace.Trace_private_util__Mpsc_bag)

    Module Trace_private_util__Mpsc_bag

    This module is hidden.

    diff --git a/trace/Trace_subscriber/Callbacks/Dummy/index.html b/trace/Trace_subscriber/Callbacks/Dummy/index.html new file mode 100644 index 0000000..3714f06 --- /dev/null +++ b/trace/Trace_subscriber/Callbacks/Dummy/index.html @@ -0,0 +1,34 @@ + +Dummy (trace.Trace_subscriber.Callbacks.Dummy)

    Module Callbacks.Dummy

    Dummy callbacks. It can be useful to reuse some of these functions in a real subscriber that doesn't want to handle all events, but only some of them.

    val on_init : 'a -> time_ns:'b -> unit
    val on_shutdown : 'a -> time_ns:'b -> unit
    val on_name_thread : 'a -> time_ns:'b -> tid:'c -> name:'d -> unit
    val on_name_process : 'a -> time_ns:'b -> tid:'c -> name:'d -> unit
    val on_message : 'a -> time_ns:'b -> tid:'c -> span:'d -> data:'e -> 'f -> unit
    val on_counter : 'a -> time_ns:'b -> tid:'c -> data:'d -> name:'e -> 'f -> unit
    val on_enter_span : + 'a -> + __FUNCTION__:'b -> + __FILE__:'c -> + __LINE__:'d -> + time_ns:'e -> + tid:'f -> + data:'g -> + name:'h -> + 'i -> + unit
    val on_exit_span : 'a -> time_ns:'b -> tid:'c -> 'd -> unit
    val on_add_data : 'a -> data:'b -> 'c -> unit
    val on_enter_manual_span : + 'a -> + __FUNCTION__:'b -> + __FILE__:'c -> + __LINE__:'d -> + time_ns:'e -> + tid:'f -> + parent:'g -> + data:'h -> + name:'i -> + flavor:'j -> + trace_id:'k -> + 'l -> + unit
    val on_exit_manual_span : + 'a -> + time_ns:'b -> + tid:'c -> + name:'d -> + data:'e -> + flavor:'f -> + trace_id:'g -> + 'h -> + unit
    val on_extension_event : 'a -> time_ns:'b -> tid:'c -> 'd -> unit
    diff --git a/trace/Trace_subscriber/Callbacks/index.html b/trace/Trace_subscriber/Callbacks/index.html new file mode 100644 index 0000000..85a4f8b --- /dev/null +++ b/trace/Trace_subscriber/Callbacks/index.html @@ -0,0 +1,10 @@ + +Callbacks (trace.Trace_subscriber.Callbacks)

    Module Trace_subscriber.Callbacks

    Callbacks used for subscribers.

    Each subscriber defines a set of callbacks, for each possible tracing event. These callbacks take a custom state that is paired with the callbacks in Subscriber.t.

    To use a default implementation for some callbacks, use:

    module My_callbacks = struct
+  type st = …
+
+  include Trace_subscriber.Callbacks.Dummy
+
+  let on_init (state:st) ~time_ns : unit = …
+
+  (* … other custom callbacks … *)
+end
    module type S = sig ... end

    First class module signature for callbacks

    type 'st t = (module S with type st = 'st)

    Callbacks for a subscriber. There is one callback per event in Trace. The type 'st is the state that is passed to every single callback.

    module Dummy : sig ... end

    Dummy callbacks. It can be useful to reuse some of these functions in a real subscriber that doesn't want to handle all events, but only some of them.

    val dummy : unit -> 'st t

    Dummy callbacks, ignores all events.

    diff --git a/trace/Trace_subscriber/Callbacks/module-type-S/index.html b/trace/Trace_subscriber/Callbacks/module-type-S/index.html new file mode 100644 index 0000000..eda25eb --- /dev/null +++ b/trace/Trace_subscriber/Callbacks/module-type-S/index.html @@ -0,0 +1,57 @@ + +S (trace.Trace_subscriber.Callbacks.S)

    Module type Callbacks.S

    First class module signature for callbacks

    type st

    Type of the state passed to every callback.

    val on_init : st -> time_ns:float -> unit

    Called when the subscriber is initialized in a collector

    val on_shutdown : st -> time_ns:float -> unit

    Called when the collector is shutdown

    val on_name_thread : st -> time_ns:float -> tid:int -> name:string -> unit

    Current thread is being named

    val on_name_process : st -> time_ns:float -> tid:int -> name:string -> unit

    Current process is being named

    val on_enter_span : + st -> + __FUNCTION__:string option -> + __FILE__:string -> + __LINE__:int -> + time_ns:float -> + tid:int -> + data:(string * Trace_subscriber__.Types.user_data) list -> + name:string -> + Trace_core.span -> + unit

    Enter a regular (sync) span

    val on_exit_span : st -> time_ns:float -> tid:int -> Trace_core.span -> unit

    Exit a span. This and on_enter_span must follow strict stack discipline

    val on_add_data : + st -> + data:(string * Trace_subscriber__.Types.user_data) list -> + Trace_core.span -> + unit

    Add data to a regular span (which must be active)

    val on_message : + st -> + time_ns:float -> + tid:int -> + span:Trace_core.span option -> + data:(string * Trace_subscriber__.Types.user_data) list -> + string -> + unit

    Emit a log message

    val on_counter : + st -> + time_ns:float -> + tid:int -> + data:(string * Trace_subscriber__.Types.user_data) list -> + name:string -> + float -> + unit

    Emit the current value of a counter

    val on_enter_manual_span : + st -> + __FUNCTION__:string option -> + __FILE__:string -> + __LINE__:int -> + time_ns:float -> + tid:int -> + parent:Trace_core.span option -> + data:(string * Trace_subscriber__.Types.user_data) list -> + name:string -> + flavor:Trace_subscriber__.Types.flavor option -> + trace_id:int -> + Trace_core.span -> + unit

    Enter a manual (possibly async) span

    val on_exit_manual_span : + st -> + time_ns:float -> + tid:int -> + name:string -> + data:(string * Trace_subscriber__.Types.user_data) list -> + flavor:Trace_subscriber__.Types.flavor option -> + trace_id:int -> + Trace_core.span -> + unit

    Exit a manual span

    val on_extension_event : + st -> + time_ns:float -> + tid:int -> + Trace_core.extension_event -> + unit

    Extension event

    • since 0.8
    diff --git a/trace/Trace_subscriber/Subscriber/index.html b/trace/Trace_subscriber/Subscriber/index.html new file mode 100644 index 0000000..df09ab3 --- /dev/null +++ b/trace/Trace_subscriber/Subscriber/index.html @@ -0,0 +1,2 @@ + +Subscriber (trace.Trace_subscriber.Subscriber)

    Module Trace_subscriber.Subscriber

    Trace subscribers

    type t =
    1. | Sub : {
      1. st : 'st;
      2. callbacks : 'st Callbacks.t;
      } -> t

    A trace subscriber. It pairs a set of callbacks with the state they need (which can contain a file handle, a socket to write events to, config, etc.).

    The design goal for this is that it should be possible to avoid allocations whenever the trace collector invokes the callbacks.

    val dummy : t

    Dummy subscriber that ignores every call.

    val tee : t -> t -> t

    tee s1 s2 is a subscriber that forwards every call to s1 and s2 both.

    val tee_l : t list -> t

    Tee multiple subscribers, ie return a subscriber that forwards to all the subscribers in subs.

    diff --git a/trace/Trace_subscriber/index.html b/trace/Trace_subscriber/index.html new file mode 100644 index 0000000..e9ef98d --- /dev/null +++ b/trace/Trace_subscriber/index.html @@ -0,0 +1,2 @@ + +Trace_subscriber (trace.Trace_subscriber)

    Module Trace_subscriber

    Generic subscribers.

    This defines the notion of a subscriber, a set of callbacks for every trace event. It also defines a collector that needs to be installed for the subscriber(s) to be called.

    • since 0.8
    module Callbacks : sig ... end

    Callbacks used for subscribers.

    module Subscriber : sig ... end

    Trace subscribers

    type user_data =
    1. | U_bool of bool
    2. | U_float of float
    3. | U_int of int
    4. | U_none
    5. | U_string of string
      (*

      A non polymorphic-variant version of Trace_core.user_data

      *)
    type flavor =
    1. | Sync
    2. | Async
      (*

      A non polymorphic-variant version of Trace_core.flavor

      *)

    Main API

    type t = Subscriber.t
    val collector : t -> Trace_core.collector

    A collector that calls the subscriber's callbacks.

    It uses mtime (if available) to obtain timestamps.

    diff --git a/trace/Trace_subscriber__/index.html b/trace/Trace_subscriber__/index.html new file mode 100644 index 0000000..86c352f --- /dev/null +++ b/trace/Trace_subscriber__/index.html @@ -0,0 +1,2 @@ + +Trace_subscriber__ (trace.Trace_subscriber__)

    Module Trace_subscriber__

    This module is hidden.

    diff --git a/trace/Trace_subscriber__Callbacks/index.html b/trace/Trace_subscriber__Callbacks/index.html new file mode 100644 index 0000000..53f4c71 --- /dev/null +++ b/trace/Trace_subscriber__Callbacks/index.html @@ -0,0 +1,2 @@ + +Trace_subscriber__Callbacks (trace.Trace_subscriber__Callbacks)

    Module Trace_subscriber__Callbacks

    This module is hidden.

    diff --git a/trace/Trace_subscriber__Subscriber/index.html b/trace/Trace_subscriber__Subscriber/index.html new file mode 100644 index 0000000..b0c4cac --- /dev/null +++ b/trace/Trace_subscriber__Subscriber/index.html @@ -0,0 +1,2 @@ + +Trace_subscriber__Subscriber (trace.Trace_subscriber__Subscriber)

    Module Trace_subscriber__Subscriber

    This module is hidden.

    diff --git a/trace/Trace_subscriber__Thread_/index.html b/trace/Trace_subscriber__Thread_/index.html new file mode 100644 index 0000000..d39c918 --- /dev/null +++ b/trace/Trace_subscriber__Thread_/index.html @@ -0,0 +1,2 @@ + +Trace_subscriber__Thread_ (trace.Trace_subscriber__Thread_)

    Module Trace_subscriber__Thread_

    This module is hidden.

    diff --git a/trace/Trace_subscriber__Time_/index.html b/trace/Trace_subscriber__Time_/index.html new file mode 100644 index 0000000..7ca588f --- /dev/null +++ b/trace/Trace_subscriber__Time_/index.html @@ -0,0 +1,2 @@ + +Trace_subscriber__Time_ (trace.Trace_subscriber__Time_)

    Module Trace_subscriber__Time_

    This module is hidden.

    diff --git a/trace/Trace_subscriber__Types/index.html b/trace/Trace_subscriber__Types/index.html new file mode 100644 index 0000000..5e46acf --- /dev/null +++ b/trace/Trace_subscriber__Types/index.html @@ -0,0 +1,2 @@ + +Trace_subscriber__Types (trace.Trace_subscriber__Types)

    Module Trace_subscriber__Types

    This module is hidden.

    diff --git a/trace/_doc-dir/CHANGES.md b/trace/_doc-dir/CHANGES.md new file mode 100644 index 0000000..dd9ae4f --- /dev/null +++ b/trace/_doc-dir/CHANGES.md @@ -0,0 +1,72 @@ +# 0.9.1 + + +- fix: upper bound on ppxlib +- feat trace-tef: print names of non-closed spans upon exit +- fix: block signals in background threads + +# 0.9 + +- add an extensible sum type, so users can implement custom events. For example + an OTEL collector can provide custom events to link two spans to one another. + +# 0.8 + +- add `trace.subscriber` instead of a separate library +- add `trace-tef.tldrs`, to trace multiple processes easily (with external rust daemon) + +- breaking: `trace-tef`: use `mtime.now`, not a counter, for multiproc +- `trace-fuchsia`: require thread-local-storage 0.2 + +# 0.7 + +- feat: add levels to `Trace_core`. Levels are similar to `logs` levels, to help control verbosity. +- add hmap as a depopt (#28) + +- fix: truncate large strings in fuchsia + +# 0.6 + +- add `ppx_trace` for easier instrumentation. + * `let%trace span = "foo" in …` will enter a scope `span` named "foo" + * `let%trace () = "foo" in …` will enter a scope named "foo" with a hidden name +- add `trace-fuchsia` backend, which produces traces in the binary format + of [fuchsia](https://fuchsia.dev/fuchsia-src/reference/tracing/trace-format). + These traces are reasonably efficient to produce (~60ns per span on my machines) + and reasonably compact on disk, at least compared to the TEF backend. + +# 0.5 + +- perf: reduce overhead in trace-tef +- perf: add Mpsc_queue, adapted from picos, to trace-tef + +# 0.4 + +- add `?data` to `counter_int` and `counter_float` +- add `float` to user data +- add `add_data_to_current_span` and `add_data_to_manual_span` +- make `explicit_span.meta` mutable +- trace-tef: write to `trace.json` if env variable `TRACE` is either 1 or true +- trace-tef: emit function name, if provided, as a metadata key/value pair +- re-export trace.core in trace + +- perf: in trace-tef, use broadcast instead of signal in the job queue + +# 0.3 + +- add explicit spans, for more precise tracing +- rename repo to ocaml-trace +- trace-tef: add a ticker thread to ensure we flush the file regularly + +# 0.2 + +- trace-tef: additional argument to `with_setup`; env for "stdout"/"stderr" +- refactor: avoid conflicting with stdlib `Trace` module by adding sublibrary `trace.core`. + Programs that use `compiler-libs.toplevel` should use `trace.core` + directly, because using `trace` will cause linking errors. +- perf(trace-tef): improve behavior of collector under contention by + pulling all events at once in the worker + +# 0.1 + +initial release diff --git a/trace/_doc-dir/README.md b/trace/_doc-dir/README.md new file mode 100644 index 0000000..99e943b --- /dev/null +++ b/trace/_doc-dir/README.md @@ -0,0 +1,167 @@ + +# Trace + +[![Build and Test](https://github.com/c-cube/ocaml-trace/actions/workflows/main.yml/badge.svg)](https://github.com/c-cube/ocaml-trace/actions/workflows/main.yml) + +This small library provides basic types that can be used to instrument +a library or application, either by hand or via a ppx. + +## Features + +- [x] spans +- [x] messages +- [x] counters +- [ ] other metrics? +- [x] ppx to help instrumentation + +## Usage + +To instrument your code, you can simply add `trace` to your dune/opam files, and then +write code like such: + +```ocaml +let f x = + Trace.with_span ~__FILE__ ~__LINE__ "inside-f" @@ fun _sp -> + (* … code for f *) + +let g x = + Trace.with_span ~__FILE__ ~__LINE__ "inside-g" @@ fun _sp -> + let y = f x in + (* … code for f *) + +let () = + Some_trace_backend.setup () @@ fun () -> + let result = g 42 in + print_result result +``` + +The file `test/t1.ml` follows this pattern, using `trace-tef` as a simple backend +that emits one JSON object per span/message: + +```ocaml +let run () = + Trace.set_process_name "main"; + Trace.set_thread_name "t1"; + + let n = ref 0 in + + for _i = 1 to 50 do + Trace.with_span ~__FILE__ ~__LINE__ "outer.loop" @@ fun _sp -> + for _j = 2 to 5 do + incr n; + Trace.with_span ~__FILE__ ~__LINE__ "inner.loop" @@ fun _sp -> + Trace.messagef (fun k -> k "hello %d %d" _i _j); + Trace.message "world"; + Trace.counter_int "n" !n + done + done + +let () = + Trace_tef.with_setup ~out:(`File "trace.json") () @@ fun () -> + run () +``` + +After running this, the file "trace.json" will contain something like: +```json +[{"pid":2,"name":"process_name","ph":"M","args": {"name":"main"}}, +{"pid":2,"tid": 3,"name":"thread_name","ph":"M","args": {"name":"t1"}}, +{"pid":2,"cat":"","tid": 3,"ts": 2.00,"name":"hello 1 2","ph":"I"}, +{"pid":2,"cat":"","tid": 3,"ts": 3.00,"name":"world","ph":"I"}, +{"pid":2,"tid":3,"ts":4.00,"name":"c","ph":"C","args": {"n":1}}, +… +``` + +Opening it in https://ui.perfetto.dev we get something like this: + +![screenshot of perfetto UI](media/ui.png) + +## ppx_trace + +On OCaml >= 4.12, and with `ppxlib` installed, you can install `ppx_trace`. +This is a preprocessor that will rewrite like so: + +```ocaml +let%trace f x y z = + do_sth x; + do_sth y; + begin + let%trace () = "sub-span" in + do_sth z + end +``` + +This more or less corresponds to: + +```ocaml +let f x y z = + let _trace_span = Trace_core.enter_span ~__FILE__ ~__LINE__ "Foo.f" in + match + do_sth x; + do_sth y; + begin + let _trace_span = Trace_core.enter_span ~__FILE__ ~__LINE__ "sub-span" in + match do_sth z with + | res -> + Trace_core.exit_span _trace_span; + res + | exception e -> + Trace_core.exit_span _trace_span + raise e + end; + with + | res -> + Trace_core.exit_span _trace_span + res + | exception e -> + Trace_core.exit_span _trace_span + raise e +``` + +Alternatively, a name can be provided for the span, which is useful if you want +to access it and use functions like `Trace.add_data_to_span`: + + +```ocaml +let%trace f x y z = + do_sth x; + do_sth y; + begin + let%trace _sp = "sub-span" in + do_sth z; + Trace.add_data_to_span _sp ["x", `Int 42] + end +``` + +### Dune configuration + +In your `library` or `executable` stanza, add: `(preprocess (pps ppx_trace))`. +The dependency on `trace.core` is automatically added. You still need to +configure a backend to actually do collection. + +## Backends + +Concrete tracing or observability formats such as: + +- [x] Fuchsia (see [the spec](https://fuchsia.dev/fuchsia-src/reference/tracing/trace-format) and [tracing](https://github.com/janestreet/tracing). + Can be opened in https://ui.perfetto.dev) +- Catapult + * [x] light bindings here with `trace-tef`. + (Can be opened in https://ui.perfetto.dev) + * [x] backend for [tldrs](https://github.com/imandra-ai/tldrs), a + small rust daemon that aggregates TEF traces from multiple processes/clients + into a single `.jsonl` file + * [x] [tldrs](https://github.com/imandra-ai/tldrs), to collect TEF traces from multiple processes in a clean way. + This requires the rust `tldrs` program to be in path. + * ~~[ ] richer bindings with [ocaml-catapult](https://github.com/imandra-ai/catapult), + with multi-process backends, etc.~~ (subsumed by tldrs) +- [x] Tracy (see [ocaml-tracy](https://github.com/imandra-ai/ocaml-tracy), more specifically `tracy-client.trace`) +- [x] Opentelemetry (see [ocaml-opentelemetry](https://github.com/imandra-ai/ocaml-opentelemetry/), in `opentelemetry.trace`) +- [ ] landmarks? +- [ ] Logs (only for messages, obviously) + +## Subscribers + +The library `trace.subscriber` defines composable _subscribers_, which are sets of callbacks +that consume tracing events. +Multiple subscribers can be aggregated together (with events being dispatched to all of them) +and be installed as a normal _collector_. diff --git a/trace/index.html b/trace/index.html new file mode 100644 index 0000000..ddfa448 --- /dev/null +++ b/trace/index.html @@ -0,0 +1,2 @@ + +index (trace.index)

    Package trace

    Package info

    changes-files
    readme-files

    zJ2S$!l`6KRrrfazuLhIEO`|O>!_M2AYXd@C5;)BH770f?onWuC?JGuSiGETHx3r9k zo0Ecgb>mVEq0IOo+CXD!QNDDt~BS+VCt^{^Jhqh9eBg zm$dL{-UhA5hoZT7jml+tr%1-}m#3^qRb1A@2YI4Xxk|k}SupeV9zeZjlSN0W70t?O zRt~3~AsF~*SJ#t2QrXII^h4Y7y3*^TW(hL`s%hz-ojX10ZEBCNMUCOEo#`Gc4ER*7 z!t5%+-Ip%B`N<*KO1(0?Uir`yvK@?zk#6kp&0Mf0_P4CU`v;RRMPioB`9_=C_PEJz zT1O|VFS;)JJlgM`ydO#Fe5S*;C#blK3I}_y3vA&qCE4)M3z7j1`6VD8sq8G<-q6fE z*G+}Pw%yXFU%c^MqQo)*Y5kOURlmuP zmj!OI3dI9avuWx6iV6!cXGml=nIA7%hx46&xWXmbZ^Wxori!b{k|u-V6%ahU zKBTU4_PcW=rN0RzQgwMhOy`m;`Kw)qao<$VYDZ>irVhS1(hRH-L2@v4F^XWM$L?jMFpRzs_ zGj{|EAB{OEioS&2pbmCsZ705MOYX`xC|sVjFN-QXD=p=IC_Ics@Jg&MZiAwtiB6@o z!Y0oHubjMN>k@z!fv}Z<5E77LL{61uQ3Rz^Q36=FH%daeC!-W(1fnPp9D(IHt&WO` zc^G~#3whDI;MA+nsE{u6EfB`h^2Ti(bK!@D0jG*x z&q(MYV3sFEsEN{xE_U+@OtWsIYM8X7wwq&`E{n~q8MN4-U}zRnuJ;cN?;~V$t}hxR zze))X>y&JM7+_4N3{m0i)gX)oQwYM!=J6&Fj$lEs*^@knz_+uAQLZfNFU!D-cq^rb zx0G5pZ?OdyB1U+bqJLtQRi)iLHy43VcsDyEfML=EyW%59Fb8PG5Nrf+6;0;U^XlGL z6^p&56Is^MCM_5mr#=fB8c?UCj%0YK?dR=7a8ZGSe06wHs~|i>EUE8k{I^U z6%AvAd;6bpyoQ8bedY2A9_Of`*Yk>9lWY-ILRcp)=o^ruRtEU%rySuzV-)Qm*|$GO zgL1W|eFB8MlO15uGJP=i*FzMDK+dX+&1{~4fVbftB#}ZM(#S^vGH?ima1hR76pG*o zijhSLN>PS#jK&yLpb}#-4&yNa6EO*sF$GikgFRg)lijrcaIVS1gu8-)x&OguQBnNR z>UO?26zUxw>|KkU&ev&7zfa?frYQW z4*;S#!!}3&*Fzd^Y-*3#Hnz(tAhdJu6~H%02BcL0RR9100000000000000000000 z00006U;u$c2o4FH3=s$lsxYAz0X7081A!h3QUC-X1&II$f+P%q92+wyBN29Uw8B&T zjAYNE z*U5HIKt@(Y5~%9o_QfZTG-V({TgpY1umY=WfOG*epq`8% z1ttI4MeU-#t{R;oNdjV3`v1RHY2W=-wG4JSL>@>d!p4|Cue#>c|G%39Rl^N~Jtte$ zyJ6&>4iG9Q^=4aj#Y#*NCJeFlO8dM= z0T@1kwgCeG+ko8*0Gp&sMjwJBfPq-!GJqe%@a=c-d}@b9ec(lwnK(J)(Hg16J4t}8 zoj8ciNH-U5QF3U|av}lIkV4k)A{$6Xb{!U4>=^bq_AZWVCE5h7P5X$BXZXs5nFtee zW+ng<#jXuM5z~rRZ`MAjV;jCS!8iBrBJT}bZ87*?$$!rO1n*<-{r%q8@3p+Acr){L z-Rs)dHGn|;!_@F7K!B&viz4g)VC-%k=EL_u`ZCm8I+G^w3Ksc4TLz>W>WQ%ycmt^2 z7F3wL0|7EWb6`-b)`3In3w-9*i0>eyq~r@W)A1#>n_xUR7x)gwPOc$t&s(gki^-$u zJg{x?RyaF)@IXRLeJj&x#qB9@8%|@Z)UJMsh~WtZLz0uE^z@#pky?2079#uJQaZ}s zum|%fSn!B@KY}H0nr5T+wxPUx9*;ced5cn@m}{u$siaEKn#R+E5jm4)L%|SNC0UaQ z&6S0l+(C-b&;Tspa|qlA;9{w)=$j}~YEv%qKd}sP_wkP*WsG%>pcG>q6kiIIR39A- zNKYUl*8+<>0hW8%?v1s^a_(RzT_#Ecg;jdd;Xxpj^@C7|x*MM&=;*mjvdV5)-(Tm9 zT`k#yauk^A9Qsn&7*u#9DFOrwUqmyAw+Wh40gs(wPGT)Y_-2FkUKF>jnwu3#gW`@d zy6R{|!~tT^)Z2}m?U790V*!zA7ervEMXKAEO@WaDT}KB2se9=mbdSJ++)MhaS{Rkd zksBl4dmc#spg~2E4OAgENJuS@2b4vWrkrTx2R>+m%D?+PO^f+$5>0TowkhFwJo4GdZsbTH^) zNQEH{1_KNf3`Q7Cu(Ay@H*U!uPpER~C~G>Il_Za?a{FjtPoEp6?QlS3ASEqnp3>|4 z9>;0J0XY+^QW5qY)!pskXcvag_QLxZYtogZJ&r7=L%z^&pM??FpCix54@!i%wFGmQ zAhuJupi?DXXCuBs+>kjLL=gb2A0S5tsylNIPlqCiLsNrH6inuxNhJfoFPXm8X2XfU zPdQ6CF*btSw;t8mo39;N0Op8u4-whbu3z|a0FQ4@8=H&FH6FJ%*#)VVTL?_|CM`nu zjb)qOyKq6+q!~DnO)f=$yRC95jm|94eyYbsuo(E3mv}VY0>M-(4CcBvak*@gPPe<= zGz_!K%n+IO^ORAz?1KezeI0I+nO0ERSBVs1L zfsq9|H#IOkw*VLA_dWN`rA+4`+#x0SmhvhdLnU)+P4l`_U}PkO8PdL1-@znuxw|#* zl}!7{-)BCZG_$7D+nn7Tcyp!$FI3H3N>D$JVaM#nAak)Qw9dTItkt*SJ+rg_eg}Kl z>;e~ntkiF`5M-x@+_}<@VB_f^RYg|Nb5vA-xhhR&{10aM?i0Y{)K_D-R66A)UW~%+ z3Gesvk-bz5YMCSBo7p+%bjsMO+0;g|RMG((Z@5vVlH517I_H>nl?aq2XV3n83zxZn zqdUUgUN_}^6)2!wj*L{S1eu7c?h595DwXsbUBOwt8sj=g6%(sL3sPKAE0pR+Awj)R z-GD@iXk?(kC?p69jW^)}1PU^mEv1&xNYHAjZbJ(s+J%Y^p`uf$?(&Qx(TyX~gCo(4 zBOOAbRP^B#O#QB!W?RVIK@Nr10Lv5}jQ|k~nK{6KK?~8)XapFx(83W*407^lMpe0} zm$Ap-)8nakC-D0d?Ic2uh)z1lnsN|LZw|SxG1tz;JUiFS2ls#l-hmc6h!#0WExv~5 zVTqlGrFI^c*?Cy*0j+Qlt#puD<%j2EwVjVOc0ShH`B>)xt#=S@a8P-pOkiy|z5;B0`Dg&Duo z{{GExjj`Kag0huo_(dR^h~Ac9fGQZA5J)lG!fb|9YMK+p6$Ei|f*{3QRDUXpSRL25 zR%YDCSzjJY=y?X$m*(@e8O9XQOx5hp{ z367|%NIeBpe`Dq~DxN^fxg$6&KAc`mH#m)dpPOZz8%k&8IZ`WLTH|I|q=H{&X-$Y_ zY_4DH4_jJ4PsS?+#-Ide&dEEM+HF&9yZ+jUj}U@Afzie8yGN@iAA4)NvT{jDvaVgj zTJa=B%tbExX?KaZn`}p;VSO>w;$C-taFZ|lacbIf8+RtQ?;k37Cnxql3 zecblysBw18*zXr^xD;M!y|7IzGxSw#`2Vqwuk7$o{js0pv=}VjK4rV3n3nOK|X=sugo0QRG+Dm zV)13{zr%&7-`U14>_6$G;XOxc)+hO(s_0#W!&Bbydt{`EekLc?97ykv9K5GEtB6;S z>SHfoW=*8pTfno{38~p$Z_`XoB43wH?}qBDKoG61`&f5`pr z+uqNdLn_GgK(|@k@&)c=pJcD&^wr+R`*c!L9aE5|fHz)m5zU_^kv;evsS(btcTwGK zzJFU%2B?z2as?$q30E+9`I41j47Xf}8#pxtl;@KsZQ2CZNcC}>w<*ivmM!x9d1l9Q z)C?@vS)!Ad19oqE?5+BNn&GbB9DV;*cUh!{QOE;>(k~{6gZxbJP@a$6LHR%a@L%8` zq`vB7Ek5jR?a>F*^0Pq|i1Lw_5NlUH1EIC>S{yyyzVsLXChNk=BBx}j)Q8Q>A&Vs+s#Ad4tff%Nd`UxQ*s&x?5Aw>QU>m9O}pnRQY7(4rj~>^ac+k^#}L0;gpy%R_^A3FHxJ|{Pa&|{oNt035`@LYj?X*C^#Wi`Mnr`o z!K1IeU+b2Z7XA1YlUY!Fp=70=FVL_2e`nCkZDD@(W0AD9*8To#j|zkVA;;sq?r_)C z?%>0li7~79%I1$xt{kH+#pbOv2cCnUm^*4}-Hz){5Bzc$`eGH1oxrhIiXoW%<*XM! zfuTod{Z#<=4+&MsopXO1`CBZlx+dw-KgfEq*igFE5j3r_RN48r{2k`2g|9Bd0z2ELs z|LedXxuI!o&0O=my5b`}HAK}lyG9D0;bS(?&!3;CK)9#{y>ec%j#(zzp{wsH&!JMY zPi7uyhSpRa3zMbAt={J?<=7DNHE(;|Q^gq+Dj;_@naP)G2+ij=l(Qv#c|rO;$IKte ze_t!vJerw(+GpI_z!ZIwcIeMAX_^vknuf*l1KUyTKRf+~>opqJ7_A{2+ zmFpvuUP_FcQB|sR+P#{uqzv(&WGmTXcshBz>Ohx%DN-*{`1K=qJ@2*V6{wS5ocI~K z{tYLJ3-}lC4-2-c$7q%SOXMy*ZRD8HJ9KTfBDre|#zUHlo1-(I8u*%tvl1bG{ zt7*-W5(P8)UO}aGD1N#2-9_-H{G#@Leu)}62{L?s6J#46bph5D%s)vNRS;wN{ZuaXs)Wh_iN6p=oWl>C*{_I;x; zVn7~lD$}FeL?ex5?(V~a=1Qoy^c^Q}X;0Jmy$^6W+dg^qR9R8{kYU4h)(Gc;dvW@- z_7;gh0Z(w_9^N{=bO7*`Th(WzlAALsU+dr~JMk#FEol|yTXvL2oO3Oo26%_+k939Q zYy2i22@}+=Z_TS$f2g(V6gRta|FOOHC9;uDCNCRzt222E{I3yRPKC$P*93tvher5Z<_nUOyOQe2%_q z%RaV35O%yXd+@EYou?;LNAmC5x!}->C*spb_1EH*&sXf;zS+AL99b1CI_9!BM3t+@ z7Dlp8CbxATt=?3!@Rt)u1d`+=#}KF6(r-I_+88zuPn9U{E-lVa?aCngXIU-SCdR)yS72!ybSNc^_@>`|6U?i*{S?b3xsU?x0Ni_R+ zO>6M!DgD&6zxtS4u9@_<|%l4L30K~60L8uy>;&1E>X^J zY!UwDq-Rm?@PpF*{44wS1nXW#Eda0qGnJz3bwO*?qZ#r4B3AEO3>f?kP8f-*=E-c#63Q zlupdWKnQov#i7{aa|uWb@aHnXA8_uI**aH%%|?^2q!7|WZ$p6*qvjhIc839zNR$vG zk`s-V$to*HSd>(#--Ll0E@+Se{VD{j7NjybaW-7{(;d>`Q58zl;~KuOM_=t9GGB#& z##J`!(jaU>zf-;ba8FYP^%z%d#IQ+8jdxAICu5_1Lb8yK_QSf|E3hgknQHhZbDD36nD@~Pgk{Q$Ex7DXkQJs{9TcmK(s8{y4bwa3kQdE=C*eGNMxxVV#)hJeJSinGR z?99rX($rrw-*>X~*F>o%DNiL&Xz3S>GH(XiG~J{Vch|Q4CoA7=Q`Z%01^@ z0Ki*H*Z>D8yw;<2b2o4FH3=s$ljcAHC0X70816~U<00bZfi2w(I91MXR8`~Nq5q5L5B1BP= zCIf=MO0b<-%=R`R#gQy8VO~)Y_9Wg6A;jG~PCYawUBwUZ z^xD#3Q2{A1%A~TNHb90A%~8TOOF_xEzM^(fZ&!V-?SKLE>MQB$_yXG?`2Vf>+IMF+ zMf6O*?0YI?jhRfcIhmdP44afbCn*tG07?l^l|8T#J$14|*7;Tf!RQ#O@AV?Z$o5!j zog>ReN(nARZ>{%T1}Oc5>;wnUFntuj*8YacXUHNHjn;#}uX_CSGwx>6wBhY=!It_x zV~gh3aTl5UZNQEu28~1;USGtRREQ$miY$VE_CV;tK!y$J7=}i4Vik_l=jlfblh8j= zO8q_>4X_~%!%z@ zdF}#VWi}2l}?SUCU+9bog+auC`YA(y*wIdM+dVJ-@fIc91Ys(vwOD$O0~hLlcQ`3 zF5_Vu%-S(Au|Z74#2C1i%!cKSI_ZQbFJX&sLz)hAGM~Wb=wUo1 zeA;=Sm|Im%6Dtw6<-!oXWKdNbZqqN_IHkA!T-R9b-40u9#=POmR*IT@5?nVim`)zU zrNaeOK+WX=9r-39P;I6HMso$)TtHfbpxO+mAzlxn<@_HjO(F8(s*-J79xsk1Vo;9= zC${7Zh@_DV%96>>Oriq9dX`C_SWB1mSS)6y2-_mA#3jQxXpN_u63t^`NKyl%U6ED< zcK*kjA?eH;(L42N$p>_(v?J4w+W|dlhzL4=jBl)qG={>u_2DpmzxqwDklJK97*XfbbqY-AI74rp;wZ8Lig-qHQ zLQwuCs>g?B!kLPWyc3BrlL=ZgGzKb@{MR~nR>tL$n3)iyoHwMdN?)WaF5XK4Gb*NI zz(N@zE2GqpG1Q;2G=On5knuE#sVJ5S6vxz=nNS@L3SWKPi7E}`?OC&6V6atjv;NiQ zkm4!&_ZG9^47wO^H%NWD7xP%0;sptUL_v}uS&$+~6{HE$1sQ_>{-KbzaA{a@##+fp z=W3K&PGcEbyU}()-dOj{W*`e9Gf~y2Wkp}$#~f%n5y;`*`Kq=jSKgt>+N_*TPvXNA zt>sM9m_z;9kY^EObKPhJZLqsIK(v_O6(=l(6Tu3XkIFbSLR}{!Y zbFB^J-(y2K-#bYGDwP?RMrOdCHIMLpA3m^|7KsPWCy3dQuR48sDNqP7^J_7Kby&AQ zewAepiOYxmP!nnUeAAAiIBB+p0&j*&6Vn2j+~;nxRA_L5Gj2kGFhiN zFN)A8#H*hB-6;&q+$kJOmz~p?;)0o9@kWVFDJrT{7dkB~P7yhUIwIL-n`LF{Tq+2CHcQ!{`^@eJum40N|)un=Q;$xAvYO(g@I@bl2Moj)Z zzJ+naZKWt}YN}nQmZ7%GJKu5}lXp{$F>;M7Kw+FXuo4u--X@4zo5Mc;9*)^;uq$bJ z9A@g&Dip{s$Yv=Jh1$1DD~+!31dl)!yWDoid1?O@vuYNxiPy6gTU~L!ZW4U*mqun{ zD~cmWvAidEUC%;SQi0Ld^wU3fz%$)@NiLDQ*&$jFlp=!3Ole9*$N{`e$ybU9s+a~>;}{~0sL_;aOA|qz zrc_@EqG-^R8cP#Flcr`fH!^EMX06Dq4cYWVamd=mlBSj-f@w_EbpMdF8A#epByARw zHXBKsgQU$x(&ix*%}2#fCe;FC46dRtM7g;r`K|@r-4~-0C@paiZK;FMvLx)1W4XSI z75c6f7=oKRK;Y6lQLe9qn^q;Eq{V8z#2URsP%jbEORUvPtkX-ZFW$fgy@8E-1Do^) zHXD|-#X%_SApS1=l|JDHz%LGL2XpqQ-uaYl8KI5lGD(wGylEd~2na|tnhuRpR-DET zzyy$A0r~+NrC5}qm=sxe5g=h%Hg2FC#P19B*GOi&f$zwn}2eKu{6Q7bkzy z)JsCupH6=#(;`I>RNnoFuJyg|i}*K93+{l-T%D*DSHE*8i)Z2f#6;-Z0_#py;1c63GI_2rbwXYf8YC^L=%vS z)EQ7jb8m0e!IO0#^rO4Yp2K1GS^D~__tk%RYQQ_dBAF0WT(}3*-u3Q3Ui02@>$`_{ zZ#$l%B=_|A4xFeBqNiU3N9cuu2qL)YFOO~;Z!Hb>J(L`YAgGIeu~;9W(70jCANq8_>tL6P9w|yq>8^&hrS^5;J4uJ%|No#+Dlal(3jU|;6~m#=@MT?zppA^tw6(W;r()=m$Avwkr zk@(?yuyf~n9j0!RKg)5K1DWq!W_)qZzO6alp+)?}WlMO^&_eEZxAr;Xd<=W(>6acY z?fo(CPfbFNNdc)_^nKCw(TdBrW&* zZHOirvt{1rfS?@owKAqk`_hjv98f9#Bs-TBXs?=7tFQ1Sef1h8!R`90JU8x&c zDM4!=i&yQG8XKEN>7ENU=pp26j2$j>+OHc^S9BOgSIN+!Y>w=(SF zgbUf*rR#Oq$MM1B+J2jQ_aDKx#VQ*!P`9?8mX|o;+4*v)aDTmisH%Tu|Nd)C+>0}m zTA6={7ZP47bf%ePYS5g9f%$WmlrzFR{nfDn==@qI4=+^_6`w&2m!(qyFit_LQWz4K zCslgSd12M>h95?MKiYUzuYp$hw&L4z{yxCBZnai#{lzGs07L($gOp7gN+OE>>IdKA zb-*z{jKykWY^)mR&GU)~TpcVwJiMY=SNyl2W4;4`mB~k*?4RXE&8;!qIqo6=0Tj)7 zE@q>SI}MeH{v<|5Zsb^S0}fjeWIWxl>1TNB8aRPfkVp0Smm)t$qQ79RHP=D2xzo{G zwmwkcMosfg%y*biN8%q#TDov)tI@<;!-`3uMvrYv(8`{iNsUEdKv*?^lYprrvwa8{ZKn3Pw0RmWrnV60lSOOc;;72-a zaKH{b3NV#D$%gA4YcpO>~>s$<@ZpL6q=vX;GS~C$Yi8wqCzH! zG{6WidX<5<%|6#6rJq*JR?wx5^HvV$iY~>lXhy+F^p8wQl}5!JVS^_UHzRu>namZ+ z^iM%x70W6!lBGb=`f(NAF;Y>~8qex2_rx)Qd@;~uJ`hC!C>^R~`4B@vsuVvIJX0#k zpocSV0cK=|iO)n}#-J)J&co63=RnM?GV7|MdzwaB|oq zZ87}%ab7O*a;O!Q9A9cXmmBYE(ap5f95`NNRSbOQk21kCbSTW_wYVp z2#Yg>BRo+NfvAb7S~_p0-Cl0*@7!s3sF%!~(?0cIq=^x7MC8vM1&(sfT{Ulb{^<%Z z_CdTjx#liHw%1-KKR67z;4Y}#cL5pmw#5}60w8VqI0*w(-jzf)dupz`HrJS`ou#Ee uC}16e%Gv>UrEUWr7J?uwp6K^lh(`Fkpv`!YL^q7xb{CaG@8Q~cR8|6Fhs$~Z literal 0 HcmV?d00001 diff --git a/fonts/KaTeX_Size4-Regular.woff2 b/fonts/KaTeX_Size4-Regular.woff2 new file mode 100644 index 0000000000000000000000000000000000000000..680c13085076a2f6c5a7e695935ec3f21cddb65f GIT binary patch literal 4928 zcmV-G6Tj?tPew8T0RR91024p}4gdfE04S^g021l|0RR9100000000000000000000 z00006U;u$M2o4FH3=s$lpb(dJ0X7081A$BnXaEEt1&II$gDMPx92+(xvye7xR)-Qr zuyF+D<2}WHmB5qvtDzk>iwqJnL*(fZs|06Yb!k(1`ETc1I4-BI5fi@^u8fdm)_=e` zdp}9j)YFz0DG~@_Kr>cMHY70C!K^ZDLNTA1b7Br>uDhMiy#E2l3s-l)|7lD20$2hm z@RXnGF4_PYHl#gB*k&mx`PNs|E@~BRiaIk-Yp%L*)p~xqH)tK24LDPq+9^`k`Cgg@ z?wr3yPQ)iMi`0C({fo<{L5l+`f3Eib=1O^!+?5mxbFzfbmnAs&^Jiy+y`4!4(_Cp% zqD;z%tlFv-x2E;!;w zVW0LxIo!N76;gG%@Hb~*66P0cigm@!%!Cno$kKtF{J6eOf$5?ZhZ zGxUV~z5L(+ewzJn*7bz*N{9T6&S$7sY0!Etm|_zlZIG>ifQcfRwh5_SQlHslg9^@7tlD^wLmOxkR|-Rl>&iBW8}oeXg=l3PGl0WW7UOHQ$AH=-*sQ_FPT5-1d5EJQD9Pn$NP z=&ex`C2L6`ubBa-+$U+ol!uAv{MKA*F%G6?$zgGfC`t3*GI6_Eb;)%5MJ*?0ruoG$O;U?7n^){QDYAVGaEVAHLqZB9$dHf<2?`{n zLBa$`NQZCJlm;XxcSy38uj#vUF*`Hs$Te_xywo5!OD#vP&QtM_|MGmbfNp9M$0RSK=0_8_ zABCw>{ZyuM9=Qack^&VKMj|Ak)m~&+sFoKh!y*qw(#BI)DONKBw}KKQLVnAX zG1&USa_<#$+$JX-mDDDeb~MggE1*$BlEb77LoKF}k$@k0xv!=(a9U`DIxRMzDx4M- zby_$y8F)ug0CH(Ej8jTz)P`gfLQ@?uVB-n6GIj$~)F}})=^B$un~SNqEM_044HB;N zhGmM31%SFVDb>`A0h1#dQO?j~Y^-I)6a-yTPH)gB2)PoKXk{Nguv@^n30~1Uz4`%@ zD`m4i&uZq$jbBlIr!`;~fTB|CWScMarV3S1Y6Ge}8#%>J_FVVI{x3$o9E61rv-C=)ljThD#+}}^zAw|gQO7_rj>e?#e`;j4(=L3iD8l>nvKp>+j@jEgyUwZEikoU zHWST>2naBxf=JYIC;){c0_HLu-=J;+&@vhwQB#6|W=GUg1Q6yqqWK8|7C1^ROpF?C z4J(R71hg?xdm%6l9Zb|25zxhC-Rw}!J;^ooCJ5+rWc?5T1CD4gLBNosqr+-OSs87_ zHo}VL7ojq>IQPjFsy3FWnUJ(p$So71-$xwI z?-zDt94hM6EP-*1I$K5)wa*E%kwg-TMNvt2=HcQl{g&m$ZUSxtJ5FpQZ$aTfFJ)Q^ zKqdy3I8BgEQ0@SJBhqaonQ$$rn0XLeCP8yU{np*|Vs>g`NUiHm1r*-6C^Ak@npARd z+~sMJ@odvPOygYR7IQ1sqae%e#;7iVVvO(o1Ck$0* zFd;Bmk#K2Cdlr&B;k#c9JTX4=Tb+%hn~s0mmbsT+pj5fN?boKS1uqw}iVm{fn@Pzy zlBeJ}FNK{1rNjm{l2+_Gjs>rRH35$8i)y?pjmO2P18mc2)B)8;a&4%GCor|!ue2l0 z@X11NoM#Ltr=3&ntIU+uA7Q!Dp}Y!^&Ni{D-6snT!|DB3i!jgBoFj`Q*i^tK&VyE& zvw)M1orI5?t@f#>&HD zak^D@rlVy+5kEoOn_MXLu0H+IQn&56%Sqs?@mfCVarak6{Uy;q{3a2bl}wz`wDWW2 zFe_eM+Gu$l-T;AwdpZ%+8c>Xjj9L02w!{{t3%dFTa16K4; zIWgrd&P@RPxY}Dr-k_JC=$4!E7KBmC2$MP#w->H5!6_>Pr9I@t|HRTurr;U-+c_17 zle`RDGL=Dw*u?=Af_22JyfNP9Y9`_6ee?*coA&SST${*$%I)9i# z>QCny1#6hw;;UEI`#w-TSOu)Bv#Nl9%?K)BC3UGOY|qXa&%vaQ&-k$DKw$9Uzn^>N z;eYm}h<1CJ|M-dDT8kDhn~;uxfl>{O`#pnGusBQTSLWLp4DhWwVxo*Jch`sW+*@`` z_ak7SJRpZ@zrTH5oMa}J_!{pz=N{2)H*N16;-^2s^hBQjFPN0S{9v~~X*yzY_B#zO zZ`@+Co5ek=JsDu`K7U@w>p@27n{aZ>nzEX1pWoc#*^kkriEAA7%^NB*>>W^ey;Zpi zK!h)^cg;i*qx(Fqr!ofnW(o(Jlf!m9yX8!vY0LMzT4C!J!MLHRZ~Cm6X}7Ig@)HLQ zN4^)s3V-w0A8ldnFz_#kX$F&6{MfvW3#FaG49`9U;jg#Mja*)<+B@LVi8>dBl55q- z<(9ei@FTF_lM#&RYYcTxSBh`d_^9v-bF)Asgvwz@xrQ-KuWBg<$S|DWP7O|s(zdQE(#);lqcVpr9 zSKNgW-))N`jHq|DB)ATJ8H}+79&pVt6y$wTZJe&42aC)hH};_9m($#@|E1)$CS3N4 z`O|W9wY%3hVY)?s53f)8=JJ$umzkl$!eV3YQ)MfaYwE79zY^UoH*1k01Af^b>H%ZG z^-DO;E}HCzW9!w$_j~-7$l*4@;Rv(b4R1>?|7ShTT$e0)e4>665*$kjchBvGYlW zVFf{88Rp5xs_ysr^`=9=Fi?M47nbk1E?9R>W>`1R@MHqzN_m-wSvrhkCVj<4pSw2P z9)=TJ^AcaxXRvNtuJ_T1AAF?ccXZ%oE_l%9(r`;hs!%jQG?KAQ^?y|NMm0=%m zDp3wQk=5Rfussmr&7R<7&lQCop?gBz@77;ie_dPVir%j-KZ3*88_esm=dk1WcPGAg zto?*Wm=AMA!|Wqb!MEldKGJdgGeJxdqsAN-1>yD|6?!3WhqDhm>PHM>j@5nhx#9SC zj^p2-XK{?-drRD44zlS_--hSvOCM?YJ?{7N{K3&Z!TxDjURSqu!?e!HYXw&1>@L0Z zZ=-jKj*UzCrvgQ_uG{h>He8n&ugf-VTVA_iTHV%la@cN*S^%7Rg7*2Tf+kR*!tk*_@q85UwF!pw(p|nk`ns4bNmF3u!6WrJ!9# zT^44B(E|fR(rr2R^(;aba*?6@{ZjXVY_1F|9y?hWL?q1gppPxAM3zE_WC}8Bbh)$x z{n%R~yGzrnT4THQvNK6vTcWBi$4ecM>e*PrOhhnvRW%Hq7FP?Yee05N4RUnp3c%t4 z38w?h+SS7nbYPivurP_2byCduQ6FY!VI<&E`djO1pk75!^k?zAa`GJs5iIxC+f{{a z7`Rzd#v*CwDlx~hw-hBXRw<4;5_Hl%w*>9g(~%NK%i=IJp!MrN39~R2^?_pyOs5yO z6ge2o{ae&O0u#(|U<%4nfdyzK24CVUVu`~Yq$8g6B#?oOWFj+J$VxU6$xaS(QWUw! zP0CfBZ=4xqAJKL2sICSTTqTeI literal 0 HcmV?d00001 diff --git a/fonts/KaTeX_Typewriter-Regular.woff2 b/fonts/KaTeX_Typewriter-Regular.woff2 new file mode 100644 index 0000000000000000000000000000000000000000..771f1af705f5cef5f578b3a1e7d8eff66f9b76b0 GIT binary patch literal 13568 zcmV+bHUG+YPew8T0RR9105t#r4gdfE0Bjrp05qlm0RR9100000000000000000000 z00006U;u$!2wDl83=s$lfunT&H~}^SBm;sB3xWm!1Rw>8CN9CW*AUKZRb(vF-L12^-sRp4kkW?yS(-j4&mT7M`-Mm+~H|D|J~(s zx%geq;*D1(>ArFW~rrE6envo%`l% zO&%1KVbFMCgu$9D>Vhor_p7zu_xgZnQd6^Hr;Yl38vs1CA)z7xl?8(x!jsR-@WGX-^qjEyCu_uh7 z*I^gY?D-X??S9Ph4`*u;DbmS24lMp0i)^I~rpgtodMf)%0pM!zD=q+k>MsCRbH@(- z*djQscm())^5fs_Q}OsZfs<}Ca@=XAhI-RiE3ozs0|0$%4*;FwG9?G4Rt|A9A}!%eLthL~ z5hhYIlz9=7#fhLTpzK79Hts?j8WWCQfh6zi7&fdo>H*Dy^`wGqe+Zaua-BoP^#*kY z3z_^znGb}NHKj3Pq9&3}l9gHI(a{W=QeL@bkbp*+=_Htdm(o$X9YqGJ01gn@2p|*y z0zI{2&_qe=)m}fd*%BKaA=oLEO*l8gqOn_# zPoOow3G4Z`O&=u8PbWhJ6^9~s9Uvh}A{)1{B_X$fDlVHsH-j^5HaNj%bZ6Q!;-^Gl z@?y|!gCyYAg>S@lK9Oa$%UVw{mh~uOoA__b- z6Qm;q`)u5Tut+)VDp`kkf-+s%4T>DP@&Mu^AIgYq-U=%_>xi*s5^~9uDv;S;Q1m`XrT zUKx2RO&Bu;GwG|9CQf0Q^!16R(*mvNZ8Mo$umL-4#15OV!)ENT1v?y# z9ge{c$6|-$uuCQ>RcVWovm@ji>M+YXk%gtmk}~&QV^t(aB&QBGB^nT=E~i<3zZWmZ z3(a6 zn$mj_ystCK!Iic{wgNEU*eQa98yRh@2y8{6%}jEVC#rHLtU^u=m7s%xdaoh~;lfhY zc_TE4yXZ`VBp0XR%WbQ`C>zym?nl~OTeK{eJoRH!1;pZ*!L>9dg^MJEES9^1it)tc z=`G=Ynl%i8^*?UOFQRJ)BQ=Z}WGnSRRR=aIBx7ZC(wAzvO zD6-?cnO;Rs%(?|KZAa$J30Xj`gw=<9QNU!Wk>GD9h-Nhau@L^+B=dhxp&yyn@<-O}{5 zE5*kHssQR=MuxChqR4tt=>lLfj@8u9Y0O-irgcmcXAYHX4Zzuq3Wg{s5D;SKDqIf#!G+&Gn$%yuHMM`PzX6+JO=6 zz(T`lkq6OY56Ufpl6)-H`2b#~^RZm#W7IHO;X$<0gO*n%>=%B1`{CoLYCi&Ve04^> zN?%{^jvvRm#yO^n;SbrjB!&SXP*3XQFH#LP+;ad>%>ZaGr#2M8Il(O4_Md}`1B${N z-~vY}DarsO*_nHD?kZ#;jShxR0XaWF2-x}U&vQCcwd4Frw7gBEB9iQtl!^qTgpx@E zxJ0Fo>eDGP5k<>lazl2sG?hw75J(dlkw_$0@Wi*OsOd) z<;h}WbWmEG?f29*1e`jG)nnRhNxZ}wEsGW8dW4iuq!A`n85;6gNung4NDbv=rnk4( z_?&`5lb8?_5@CWSNw1Jnqz01+O@%gvlvJ3!@j8{);i!;GTAH*fCRxZ8B0EJGxDkCR zuH(ssrD<->mdv;jZU)8?Cn2tv#FRr{Rtw9-MP#yS#O8yXIv>O_R0#w+uR|0Rj(&T> zeJ4$=5U6IbCfYkh10Xvefi$Mz)$xvVQTs$8DI-oYVT!v3=Gv@&v?9tdulZMlFHSQ% zwUGgRMEXf!_YI8z%St;C1VAvHmZ`6r?x{Jj3xxh?bMI zLt79$Y|&_S#X<4jUp2)QmJ{)8sD0tpBi$=WsXa}-&L|?js#Zgs6pAON4`IY#lIlrW zmTQ54S=XP#5FBzsvZW3@T<4R+rDtHpb5k)Pa;N;%uV=KuS?|6 z^i1#RRV-+FB%2;#K00n^4BMito@X{Rebt~&fY_3z+qWQYv$qZd?3Aq9m0#{w&7X?G zbfeW|jzTxXH_*Tq>C|;8UB{viS47ym=GyGh$`~TiAB31FaGf3}5b;Kd?rh1RPz8k> z)8{InUV2()n@t9K1WM#eaV96(b{V6H=2Ymed9yuzJz~nCo~JuWnxypK>3-ioHKk(2 z9x}kj0sLRdCWSLDdIo#L?c^$bIdf{eFhq=Jg$hQ9n^j4sLHjn18LwQf3z2C>>DltQ91-pXfi zjPe)p*t7t|uVXEE8d)1Ns$GA?wLE&Ylwd`;!xpRe>;{i!yxx7g%Bil&OS%owo|yMJf)CgRgbF%6aG@`kjCX{ZWw~H4 zxT$E=PdMKt#G_ZE)?mtr4Tp~;+x}3B!>-*s8hmyLL{75bc{ej0BcVSX{q+svv#xha z-t*lF)}DwMt{K~~auT|#?7n4*dGHoucJiC7+{^`7NwaDe>{u}eOB)1vgW|v=*t5Iu zGVpC!q4@QF1^wu9qTk4kTz&hpwH!L^6*D|m*WbU8jB%5bq4wyJVrOwM!o*ik1a^lGY}TY*E7$)Hpj6c(POo|?!PdkhQa zKYD)m z)$q&rA#NQQzPC_FMZ+jQcKfg$Lr=pyXrO+@)2}GFqb%vZbBN1J0lLc*6I%mt!bQFi z8=zx_#){UwFOzpPQY;t#(115RPD-M%WTeYHphHbu8Cwj27^zVQwFW%Y_f}JVuj$#$^@%6vJ3V@FAy(l}<#PD+lW71S{lKw+lLaE6h4N5dsYTLP?krv*Bd4hl9`=Vp;B z71E1lm4q~52G|=#UwPX`1J#7Zyi`>J9!los7cl71fg~|NH@=jRG^X!KgKCtVNS#x( zO-U|#`_%|Ev{9dhFn}|Y(;HjdysA^6U)omF?&^9jNc)6tuPUs)oE!EmfXGW8p)prT zpB^pPmn2i6?m!UOW(ijn1=Q0cfI1Lnavm-ORV%;)CV*AI{4vB(ut6;(WjiB{xXlGY z+oDFzKv11HX;1&Sl{V@`g?GnZ&s67rGK*=*D*fd%sB9KoJ|5b!58`n3(n9-2)gW3c z6A{n*ynO_sZCI`Oq!~7g@`rr*i+&d%qoMXrE1m6%c(+h)4AQFa4_gFDCg;vYasE+X zH4}tZk?$I7U~uuAvxaC9^?bg)lj*d>RdO66bL?EcZg;rhD3Jc}Y%aiddGVCH7`0Y_ zp79O>JdaMKD>FX?W-;G4mX)@O*Txbavf)&rt0CeG*^B$j$8I+(h<9d$)qPzol}yI$ z5tL%j{RoY~LZnL4Lpl>9z5thU%b)Y~h(3+LQG%B{C8)CNLy3%pY6F5S(TmlH@CM4; zo;&h+&~MP---F~o-IPc=vAKrIT$y=}j@AbJln&iZ&KuuvS0m=$lv2D@g$mw>Q95d+ zP(ei}KRM2k?Jnx7Ky3dDSD&>bKLACf*v>L%rs0IOt{IuAV9Wl82qX0Ft&9zo%WmO#X9X)@LOyJ z0uv67m&>@XujfPv7M{eJK>QJ>;<+^I_ru}=i$*|by3GPj6#}cKQu9m#D5DqdxgUA6 zE<>I)ck>-dr3u(r8qqz|_`iY;k})m1uu>!wY47Jl0E`!vzc8tn{^mu{Y2|d(TI=4` z;QnBlvYFhv)eTW)WU5aysv^W+tt%G<&!vbtMQTCLsD&-SQOIw?S=L=zybq(99>_&k zR3i?(1TG^lP#I0%Pm)EKt6X-gY8-%|GAZj2h1+Yu%WA0Qu)VXal%&x?d3H7B5fEst zc=@(18SOa{nj&-r0YkZ$YSMA>G?GvE6Bc)VHVjPBNw;Li?}M}l$CY?W3D^`|pdG=jFB|2Gx5GDDse``9o{6}tPd4*Zb6so!Z$ z{>q(|MU~gfn&$3l=tbQW-wNf894!R*$zJ^om+tN(Ik3&Jo*vJJ zRlhh6Gl9!KqoLAE>*1Ipj@$SplvO$g)T_{_74YLqEpry2q?N?|h{P`Q9{lbtsOx&T znWvIXc!Ye~U%Z?>>Xul|B#)CwWr%u(Fj==58#MQ!*3RuB0p%aKk z%NGW`Im2PO!J}ZhVc4E0qgGwR z=tcUJPy=7;KL#tRW5jp@3F8>m#Bd_R%6K(EX#6ubv{)9<{%p&dJR7diKe6jeEhbkv z3J~mKs>g+~yqEOcOa7UJ&W+=nVIU7-rXi+J7Ll|)9WkAHT zD3V33(M;v@ktQ*yD>K#Vz^g?Y)PPHy2yA4*7`98L!Jbie&E}UKv7TV%&>qB|X4%Me?xUUl=>zE`0cQT_Qw-(bOpL*!;i`%=Y>-PR*(^R+sQe{U-xQvaeY? zlNy|FW320hn66!Nx<6?j8K5)51PHASPYy+`sJv}{3u)*qfM~1Ejc3WGq}W$Bv<^vo zohsqlaxbJB(+Qw~&d18nnhn|SxHlX2g@$r_! zjHggV#BdlCaA15Cf)mD9G0I3VIoXlQ_fd-y7Uf7K)3|VIim-J9Ew-!LVO8qjkb>Hx zGfb`=p8z_DDt#KoMHEAS3`v3k>LhMflGFZnLn*1^oXlWEdmc_ntu^jRgIzhPdQZu` z%Tkxqfgson8aLEaafQ_h{?HMpNT)Ka7^1aZLiG+Jx;?LYFopS)!S6;ax+^=Dy!%&L zX<}tnn(j3I=&nX(UZ~a$ts@?rQ0Q52^Zqf$EgjJbpQ7mLLW0P ze0hn@Qk1E~)ZUrJNk;#JHjz4IW~3wqEe%G-Sx?FX)TxX?VHe zmjl+qXqp21Pa3}dN5UEk=jl!4&^nyKkfPY;fmjPjoG9Y4MJxL zRyH&5l8Q>TKW?BS|2uTr>@zC`+GweM*Fg_z{IU9Epx^5ETjOz>U{;=4*r3|k8s8CD z7h8q?!PB*CG$M=;2{{}Hf{%!88&UiT8U4L2oC^4d)_e>7K*=IFfBGSjnFB!_j!;Bk zB8|3PidRlw8=3EPt*QD8p+RG&Cp`)0uT-o`R938fzp;7etloV=X+>Pcluzkjr#9cy%dsi$r4^mV z!q{Lo-?_^9Ons?iapDy*Hu|FMc9Vqu%ytF&)Lb@p!baFO_4CuyLX2A3kT@xm38keU zI|}LTtIqcc%WH-=8Gk>OO@ z#n;*nHAswE^#=;6&Nm`i6j^2>qLamz3RoMt9XaGGC3>q z3^!EOO?NL>q3i{Qe#i3l_2#U(VwSVBwcEE09y zQ@^Ei7F~eb0QQG7v)Y}NY;_jy$4mMrAC$>ld$KrNw{V*8auJ*!*P4juK_}snnGqhM zY?ue;y#{R>%Z}E1e4TCymtQ=mt7%zM^Sjnh82SfBHk*Y1GZT8q?TjnT31p?q-;s-~ zxfX5BR{0;ydjYD$}$t< z<{c6(Bn`ocDJ=@E_LgH4{5X3;lj4Kv&kqcJEtHK8DJa`mfJ#UtJB`Y{rNU@NC@p&Y zU-a{DbALfaJg5)NnsCkxmznzgg4X(+1c&>5TxZhF0b7d?m^31G%X=c61!?H5& zvu>9G2UdLG%|)MjbS7U)yWeJs3E1iawxQOn5?7MQIp#}F&MNgJF^dcZg5~hK_W0qq z385QR*yf&h`a46jN=o0PX?$K;;Kv0=^c9odiD%EV^7j})%PVHPsxX!4u>lZc*-~sS zk6N;LG`dg~=eGPb50T10z>ZEz_ig)-)GsjnAWbivk{wl`iJqEVwk)C&e)6gE*_#0L zaIDz1dTFH?9Sl|7OnF87iam7GJsp!&N+s_Q(eK2*_YP{Fr#!ptw*8qk&!~5tRVs$9 zr%!FA6t}U4bg{=p#(H0o;sy!U{v_ue^*brAdo0wB=KYx4lOG&x8nIc!Psf$T#mgny z`G2#_%{5x1hiRJS_+~YQQ&kaPq(@9&OuDe(S%p;j(eELd`WY5)o3ngxL{K4Seaj60 zJ@L+vEv2aR`ns6%>RI_}#kJ0b>dMJaHdoaz@k<8ibk|!d#%7_!6Dftl|FaTjM6mMp zo=}a!_p(bMnf`*-6B{o)2yAlO+t{gqLdvLETX|WHR!TPP(R~iVeZA{?`(TIz3w3)M zNU6qOUT$Mmj8s9wApJomC%TLYX1dZH(I_968_26~^8mzCD_5|yv*3O>i=C|;#lp+! zKO&l)VCm4NA`+LaISE#+2KzyqeC|)c5Nq?TAB!!l&d@yjy*vBt4msK8bsunCZj2AE$7ju%d!SMHE9Nk7E+|}oTfz)d4UJUJUzB2a znNVf^F(d7KVZq#iT;D(WiP^3sSuP{jGMvElDQHEFR(`*oq$ViY;C;Ea1}vBd7P=+( ze2ptt6jVQOiq}tzuMaF;QITSuNOitfI17{IYHLuGR#(JW*-Ih|HB1G@Y?NXsqK-0r zc5o)n5^`B+EI_Ru>@v#YGbjFR#|JB9+Fq(rs_DkzS`FT`JH*N-eMn)h7}96vx)?Mn)+@(-miKjsr%2eVYR=H$!II+k{d zK7aiD_LD_hz^N^SiVfxEPvqx?Se3TG`r;m9souv`pw&GtTXh;er_HTFI3nE1sKnEk zcC`rQf5o}{o;b#Fq)@u&q8&#^B3ij1*4LVB7sxf; zpd=7b%I^=#sKHVbsOzukLq4HYY^cBwd<(Qww71SzmlRu4x(e611afuV$jQ|tebJ!G z=^0P+?U<1>IT}A2A9hXd{s`b0%@ZHR<0d03oW3BeXwIv}d;?EySwm$3f|Y)Z9+R+T0%7 z{mTEpicZ$`nnvml=N_(m$;|#vMz8*VY~uvFJ>Vn`gtUQ%U6oJEmBq8$--tUwlY@lK zI_KsKWJ1-){hLBct#!s|N9(Ncc-%=@EmGgcu7I;k;x7X%rV#s%V`0BU!2I0?<( znratT;d4JHXWNm!qh8+?H+4nD(cG_ck5;Uhik+G%JnL+W5O1BcJHd>%i_VFfpaSnt z9~V<}Bg?lI-3i~h^UgSADdkDO#C2Lb@Nd`!n?4X0YjR6ed9o>Q&xm{?4n#T16b^0= zKT5>h`5Q8Ic=HdwygME0q>y;$6A@?x-C<_fup8DJ{vB zzwG(qR1j5kPz?eZQ6k|!M9#zPPm!l&x%c|49iC#mLI#R4(zC3aNH56qu6|pw?^;lBdJCQOr z{p=+AZ@UMb_p5u+mV&m*A9O_nJ!lBs`>M(6L1Vo~TvAp(u8ac%4tU`5nV>Fs=JG&3 z08fqY{-Yxu5^lr$pp$_|UBAjKjm zN!BDOE;(3mutZWUYf6GdEjmTh>_t%AQqP59vu3CEO@mXr)4EyOGNPrWj9(1naSR^2 zef!0am-2rz602{Omf)$PRk5~iYd7MUl|LuU#DGu6R#sM{HC`P7<}!B8fNJBVq=w+%K73Me&<734gPI32j(!oXWxSO#3f3)6<&CA3n3S@ z(@fa8?beq)^5rW4H&&B4g~Yz++xMvpoEMi%DsW>weT3K}s}*2-8-GqnC_oWkK^i~$ zWAOKmsnf`^6Ry5K_<5z(OsFC_5UdEX>Gf#V28ju$$9jtPQ7j@(ldzlSGo29@%@0n> z+hV@w3Z~VJ67Hq}^YezQS+zsZ>2fcaF?wgxN)(Y^=`V|Fe zW_A1V;pT5qCds8^uRM-#_ITcT&W4TOyCCS;9)Ys%1#|pJ2#DNV`E?05JGGZ`V(KO4QcNdwk5qL={p{=zf zx(usm%*6HNn59$ zvJ9Ky&C3IhW?4>u7kGo*(-7RrP=vy zL1zlt@-0o;ER=9#Vk4@(Ro}O`))BRI6!*hsQ~%@qCWX4rk#A#J{<3;kw6xAOwbGyM ztx543{pLY<7&^9}5IX;MmScavxlVvqLE&z+1{D!o-h3838+)%lH#aAvSiko;OA5w{ z8myUtSrrQRl~{*s+8o`hFRd&stdQFx&+fqDR)UphdbQEP@0&9m$7^Aho}gu?q7Z@i zHb<-RxSH{eTpl(jyV(8@=(@35reZ_cIc!FHh(&VN^Vz zkZ?wOlDn-n5L><^3nP@$unUrYPWi#c2W6gIM|Yq=uvovq>-HtP7I`v6W_fHw7ZMwj z9Ao~~5-ly0f}i{Q4Nu*RXxM8Nf%I0>Dw@mw>KCM`rZ^^abP3v8VTsFpWudy0sdIy% zhMcXw(EByzfE3d|1BpKzl~Ho6TLGF|_S{-mBIvm!RwHMUXhzE_Bny8h)|_6&x}BgV zw+6JeiY(Ob-FdluH#gK^$dP+7E{aiTx6fcNGHAbE*>>+l8F%b_aUrPHXlpnep+rZ? zMcpC`_4V&v!qr+-N^HL0D^`4f$=c&rw0m;;I1h~<=y9JLT})r ztGX#A@qTKe$-!4kMjAXiO^jR~D{Ch0TRRE_4D>mqF&uxJ5+ z4*m4I&A6X8y-VKoB%z;_!ELVJekV}QsA`HMH^kBi^j7{fL#!#XXcN`??=v>)^9VY9 z*zG8@&FHktW=6@f*I2`oWxq;tY~?9qFzUvs9W;^qW~y&s0+ zE^Qxet|y!x`eJjcI#jn^pYox`CS3T>?cKC7Y%iPsX5+NsG7P?q_zGtVWrUpmt|dwN z=AGr?+1dine9l`wZJMZ*7g9LNLut~1cRwD{uu^TfhF?=uid}pI@4~$@GY>;$9#32T z>}C=D9!+kx!(+wmHh&4%<#6VQSe3?~8PO`IwzD?y$IXIrd~R-enU#Hv8-41K;vwy7uk&Pk4b9wvX}07Ls{t#|wAtZl|4_L1?Am4< zA1+*iT2MEo2SJ_LIf621*$~PzC!q13axUS!r!oFAX3B`~ferTdJa~4VBQR2|uAll4 zGy+$9ckj+`LO*#!{u5rOOc_htO)gAbCy)r%r7k2nnIB#`647YWU6qxUhC|W`D=)j0 zEh)7$RXOyR*3SGwYYVJZ!H^+tB`B+0`xeawf@HdUmMo)(l(iq2lU~JEnlK24xtw^_ z%iSDEe^zJ@ME*AY!h8;?#?&v84TlCvCRk80O1H^*D2#~MuDLyaRlmGJQYEQYjX`1b za+}?g?16Y!jVd-2tSo!yq0=Wjtxg!awLaaC>jpS?+$*&j>XKdv#k;Oe{`qGoPyZ>c z@xO9%jZEB9x!Ijom|6(+?6SEGx;D0^G6Wj>-p@mS0FZsDd+&YKI++fts)X4SmEjOg zFU#^C33B6Ja-W0pVeZS-^)E4XzsQwP`HGjR=uW@f&lrERu;&^24$YBK7J`?$DpMXn z`>)TVc|3$en25;3AFD6Z>S@ibV3qb?L%F09m=frBi6sUfE#L|GaE%N+`stM~Rr(d9 zt)!Kj1_T~vucIn0tFgFr{U@eKNv{HQMojmLF>46lP(;ZHs%QfqvKC|a%w3?1YfU>xvx9zpXvWN;*VuN@aS8qM`4QwZ>PFh4gd?c;fK4Ah@yy4|q24ARrvB)S*Egx1-``*;q&b~G@(`Fxfo$lx| zem_k;yquy(tI^Bwdam)vaYTCmKXG30$pwiZ;&kqed*i1NZOV;`d3smx)Pauyq? za||!z!$e}zZ?F>rqW)Vi9P0Hf-Ou zO`R=bYI)>}_43z#0(Y-pxATccy%A3O!$nF5|K$pH4HPd>5G?KO6&}b!{pO6bx1t>l zS!PUBS(yXr&+>V<-aLON^Tgfu3j*fu;zbFvWr^;)4F5f}_4k8YfIiK&XZNzIKB2lE z{qnBVh?8G09gTrTI7BTjJhaGAMEeI*~KyLu}cMi<2&)c1=2lsp39XZyC`fsF0Pb{7juPEzLKfHr`N@6JM@?|_2hIz||Pg0XBx<^PDIzR-isrRE%0HNm8 zM^++u0D{R8_T(N438v3^g46T@$|8yRZdGXTTn_) zvG8)JCMt(#nL=_`a{t+O`p&SJ78>UCpjHK5!7bMt%?1;v>2E>5z0*GXbU?J~iQ^N! zPZ#Y_`nf2j)v5rSh{?OkHh-@z>HG&HgGICP!DS6bUBtXKg^>j)DDfb`C6ih7>p6 zL{M_aBo4w#ftpyrN1!L4RIMu)Ga%ez^3Zlw_|+heVgarZDB+;k6doF-WS8zbIEiUd zo-%R~7Y;l3=wX<6#0On?xE2e>*tR&D#i*Wor6Jn`t-QA*SD-gVTu%* zOvDdh64-yNqN3}KBoQSo5UW()rxt57@{6&3;xxZwTLPh7{FKV8zAyFQ#DuTwpRI_6 zTC6adgcJ#*>$bdZ?Jq&U^1H}S@qRO}<}l}(sD~M15x14w5M2-%&<#WiqPY#+O7ydt z{U=s@-3(r?l__YUfJ;JpFe(;~ra%Ur>1*fLGC3u{Ob|hg%0~&0kkEtEorfr?0EX@H zhqSbitAC=eO8L5nTbjyB-D-|K-YE(eyR+i-YDU84wp(;H*OX<#iw8uRKH(}jBm^QE zKxB}J3xbNmd_E2xQqdyHB1(yvc%tD4DRu_99JMIOO^t_q792U8m!6WO&^>f0tMbJX zP?EBgvG~*hsi;m%D#coam`+KQNiKQ&R-|6?Pg7ABkGLoHWCnO*dD7D+J+9w+Y_d7m zBBqc)5u)S?4nz$}9O^R2s;FnY+d7nCxnY3~2BH1`hxVD7%^KLEhMfLct9^%gah*g`)h#3xT%i2LlU6gqr(_&>O4Hj`{dYJ2Tb%gf?5S&qpT zr$ed)8mST`NR;H5y|P$jaY&#>h=C(9EO3Rg$S8Z{vWu$>9WF?l;|A0t^Fpw*xfRMv!C>hw@Wm9Vs046!)dDTxH)~?8LGnC76NG%%$ zqfAbxi^Y0E^7U1pq+u9=SCD(2aG}8+?N}o8Kz5(+CIRP*+veQ`(`^T4)QFXr=;H zGI}Th)0BMDqRe;IUMow%&r#FFU3xHbgvPTtq9`Tv9R&PLef>N|ssVSQskO?P-g7p~ zCP68+rc(M)Q)A_{PG0t4uk``s=9Ky|tHj?!fYT&uyr%rH2Oug$86&l;xQbg%1sU$h z((YsLY{=2FbrpL6OANW^RGADzoFi2Ao-%5GAY(ZK3+XjQ*)r_%_0uA87vTg4I&Pv$ zoo6EjC|)u+L-Od-3K^M5dE#Df0?|i}8RpUlfSMeYDo)~Pn%b!ioPy+FA=Igdonyr> zddn5~@*@l?7Ly%D*}m?zrvP$*^Z7LsK`I4|IOrYw z%mma?KlxW&tQ{4jgu_m2`QKu8p+*0;IPm|AA2Tp~0zx8U5>hyV42eQxu;dh!RMa%I zqUh)u7@3$^M2itCPW;COo}7PvyA-L?q<`J@XH1rCIdbK3$mitZ=Hca2z^_n|VgV&e zl_^&tD5O%AYBg%rsn?)UlV&Yig|!7{4o_O_Q@4`G|9p`Gi!9+IAN#~@pQX$StE{ok z2AgcL%?`VG)8X{kFCnoNzFO_9xoKwAS?i6?bc^0(v$pf-24xvVl^VTf^vTf{#*Uqy z2?|4BK6K@y51!RkerYBzsY>|D@!>0@POF>sV*j)k?p}&|v)%}_ZsiD^4F!exS-wI4 z&a1bt3V0_?49+3t+y79NTY0JW^O%c+a~}T5DG&LNQM9%p;XJ@uIIA854zN}e-)`N9 z^KD&^4pNLb!qCDvSBysY87J7A0?M0fJ8nOQ(}aI$%AE_+Opl<`rO1C$>3SRP;Zm{g G0ssIW6LIfZMgH#8J91MXV z8!B}L)5X2Q1gnwXrV$mB?@I`n3 z;6bfGf(9kJ^ufdL1f{4?MpF2kzufrf2#tM`3so#z_w0WrB;gRA!iT89sHkxklt4&S z@?Qv_)a{ZTmBEp2A?T?}Y|VmIu}U^#RE$go`=S_$jgeplX5L4n zl@I?bRekUMzq+xlxuvPu8BqZNhF8=AXy;1HHUHl-O9NQXorRP>iegY zEfWOzlC#uQx*#h)JA|-jEa0?t7&CUA+6MRE2l&4^|MOlMFtH>fNVa1;dBkT%1DK(9 z)h@g2e)m5g>e5ror*sRmKfo;6g>?-9KSLyYEo@_m_4%K*8X_L#hY#M}Yt~rCRwY4` zF>Kc4aHMiOz4ST&A&zA()I0#nA1PBQ212?0pRV8ENjAv68D2$iMM+UXkB>xH!g~S2 zIl*OyGC8zv%fr5yRmleNe9u?;dsEH!zg?~bQVxW|4CSoT#n`XH+4MP=cIBdT`|4OzsJeD6=lgN)_oX_f(VtLa8$o zYC#&d4VyomSwR#!Q(z-t#mbw7g6DPayyWE$@usoQoK6c^HRCPbE%WE3E8*_BrIxyd z(XCWqbp{;srX(fXT&heK>7zOhLLhRA%d!&$mVH?^09kxCxUes$xXeEW$u`^@W;c zK~xm3iplc>g0w2ob?z4wM%T}oHeg7bejo+uRRzNXCPCE1^`=>g7fUKMa*127q8IMH zaLiqTmy;iL%&&g)JAiUkkAIzyyXX&p`b!u-6)IJ!R-;y(dJP&KcEmkD_&GWttZ+gE zg!f}RF2qDuHX(*UHHC}tI%LVqOv(13B$x}QV2Itt+z4C!iN4c3pQsK-q2wR)6gPaGJi0uaXVun~yP{lFud(k7rGEf$4FD|xhLucHOO+b{tB=9z!8~Ks z4-FqG59EX32SN8Q-am`33IiMfaN`RA-zi<+4r7F4l~vo;UH6k`j@~hhIs1PP>~q?b zJxg{y@U?GD`y>K49()9(%aADx90C#=Mh*%Zx?BuQJbZZsL{6J`$S)@_@EtV`9Rmw1 z8#|vuenpA})vDK^QIlpJI(6yR=cEr#x$S|2uKLW!KKH~c|9WA-HQ%}FWdQ#DV!Ii? zeeb#5{@AA6IZHHawS^rER-D*y;KEBpvJ|Ocz#yO!Wh21CA;J3*5f=*^hY(eWoP?B; zjDm`mSpg#xFDDl_y;7CRl&ePrMa?R$$ri%M=s=tGZx_h7J&49716Eqef>H8aHj7{Hg}C z-Jt~w#}zIMDS=Hub3Ow>TNQ&8#6djB@np$)Bh9hhAtk zZE$Bo+i~G0jb<}W`BT~p;TF>!(W6a;pnjc!1qTK6AZC~V*Wc%(@9!xj*K}BZf zM|9@@Ac@=@plXVu#HFdTNZ2T9DOj3UQV)r#z*rF{vW^&W6>K8o=)nOZ zPfsc%A$3@S7~cC5ijWM-5IW#E_VRF2*H-rdXPAR{s-zm4)`6eo&67{fr@W=7dfgLx zXlj`hGRT<=r&T~g&*+JJ1n5v9;Te~*%vK?~g4hsHDH9BP5g~jwcr)$4oF6&mO8ywF z#RLMe2+>WhK~$FzgGj%^#Tv^cJZ1o{a~`CD;f#pZfzKIrBnT@`Yb2zi0wVXn5tc9x z6j{*WZZdfkapaXh2qpn;T=)5JD_V~`J8G#XkIka9rN)*^X8Ic{j0 zxeKDxD%2g$ZdPO63%Z-XTv`-SiLON_yKa6Y8#~4m(xgP|1)7;k(c%V^N(#E!xR_{* zP4ymK?TR`qHadj6p*W5Y^2V<&=|t%c%AcP6Tka0+RPriDr=pZf7JGnp-$OCFRB}6w z(cRkyjUpe0_Nc&6`jisu1M;rjGvL3>_{=)eW%0;(I#OlbL?t&~#pqQ)DY%_zuc;Bz zuWP ziHJSkPs6mWG7Rmi(PP><-_UkjQOR>m?r7ZMqU#n6OBccH2i3D%OQ~QmcqDA}J=1nn znbrq)d@^k_Lbhd3b0ykzv!VVFO0j7-ohW#mcE8929k8St>O~;qk?SP}CDa8irbDr! z6G~Z%9$!8V!3=sbVAnMRS@>nLs)}JvH9`W}8k$2~OGj7_U2&07X?nwog+y##aZ>kk zO%j?Z`}$?!$SULG_}!~_df}rHdcAQ+<|FiZUWgPfyYsz=JaC<$nVrxWLkjQ#C8+1Be6SyV)i8Vn~(#E!wIMyNgOvJ zC(`3ILVutyXVn{q{W#AE7k89Gd@k1kJXbZqbq!o^SbT2R!7X<+$bAj+P=h=khIpzW zo@#%4xVCC3!iT+fgcPhr3FOJO&(3OUk&dEXL(TfuLS)4Ty2eforQKaQW2k zXZ^BOZB`b$N4nQauh%)7Gt@I~1emjF54LurzE`gMn7L}NECDL#;k~T!s=wcud)x1< z-HW&WhB{bh2j}DchTC;snjG}byzZvFPos~gJLsJAyx;R)uh-pOf@|)zz1?`DmETEQ zV{nQexNz4T?pQMZ4Lokm;P3NCMK>^Rqzo_(%qs3y&~V6$Nmr$?*ql9`~_#+q%iOu?r(HStwzcHaOrlf`e zJNrYOaO3CyGD(^J+_4z(VNg-XRQ&~_w?N~f(mh@AMSS4uTD>&bqmSyi!1@H@zD>m_ z_|J_Ot41Q-JRAO=+7SeVwQx?v5~;AqHgLL*#GeI|lCx)KQgv4P?}GFnjKpCc;I@E2 z<2lL+HsSj7(6FT1xad9SnH-W5IC{uN1g(Y+qQI^na-XB?KdM+Ho;9>47%W<%PoRZRCmWhm@^t~dI(CONK_w0u$c z;Y@?C4Z^zN)+sy1wGoUCbreNpU_oiFSSR;Jq-rjhhMsorh-sQ4V1l=4tMQlK_-f@Z zCM1Dd-bpW~C%Y_aA@89Yr;?g-Z`;UwefAC}uk`DBNL#p|o?-Pe>&kT9e3T0 z@_ZOk8zcWCV4_CcWih@nU9W?#eNVY22R;4&>x`CHEZ);*+BX)-R{9&j^)7QeZyd0Yg>9JFV_!dJG&96H zeB|xpHjAwO5U0h5hhW~Cp5B0zSpU&3cPA{8;D z*vkH$wIzCuab3GUqqYuFQ^jkGXk27u5RiqISOzo*DEHx0v*K2gkq^4fN0)zditDX6 zCSFN6;+%kt;1~;hs&lbC-KyWKZVO!PlU{W6g2!jxrdRFk?l%H=Z2GVdp&F)ZchrGw zyc4cyT*vc`t((2N4L|6dIG|%(kW|dk3*%fd*iQHI{z(+ zmku`0wA87Firb4gGGtl`K{$YC64PC!lj0&D83}|JN5l=6y=k@hYzmq>MeC6>^24Ck z$T$S;<2i`{LKn~J%^6gCbq5E;?qjhF^>hDwV4CM?jf(TPOQUvXbjuKnM=&&hU5oB| zcdN-#N3ctGF1jPAjH_|jJu0UN){L#Sjt}3&8aJg9+EXeCI zHt;zH;#>#G00U&4$Ph|CRlocpy->Ujrc*9ZA7L>p7U_40?NN(s%UYDbFPj#`R1gRo zgg&j$c=ZR!42O=s z36`mJOmAB@D#lovBI^!J4HpO3Q$t+#xpZv{!g#S`w$5l7R@|Y1OwVz8x>fV?DgdEV zbcHTX)#l?^w@=>?By%*C|Ax> zzS1a8qzqk}K+!x=`S z_GQY9T@5F`XW{Ju)Fa=v-W~}8+QS3Q&T)Unu9X6C*A0T?6lL9t>jl!=$BKi@`%U6w zCW&*NDcb>Zf&geSWPso_h=?;Oj;w9x-HCM2ZgWvIB%>;cQG(Jxe`wr)%t0->Y{t*V>H{O8n_chz6ATh@Zd!^LsnKGwYdLfH~)` zxb+tZ^jC~sW+tGFj_FOYE;!*?UxYgX+d91~#)Zcmk6nK3P_ucxZoSYN+>~Rbi_MwObZB)BCub3W|dt~&&z`*Fa$?c<;{E+jL z?epYw^m^)DFi$Z@2gBwgo>z&s)^BIlMecxCxHGd`)`>RP-=GII39oi_ytdCNFnr;* zTZ?~XrR%e1bL^@04NHEz|F@s!znP89SjSg1DR69wb4mC(SM%H{Se#v7b$IGv^@%!; zlh!xBEVrM{qxUZ_OKtlYdzM+Yw4u-bs%3g+WNBSp=gE*JEyrts_h88`?f- z>i71xPPg7n^(%Gx1uDHnMalhDHetXU;+>i-Lk+HqsVKnYbq$`G+%bBwe_&*0XXkv$ zuwE~jvtYh#SgV%|FCe0}IEqwhmq_#WL-f$r>GN^dI|T~1#`dREq2%Y2vgeBZ?M&-t zzb{`^pbm-6d^Tdip-?lb)?dIC+H0wbMLw%gp%NDI6ciHViUR&a5LV^)lFD1{_X8O* z{%a8M_bOg(tx(_8J5+za^^`NunlH(-I#0DhKAdX*VruReQ@vZ|kk|9&|Ed04=$Z<# zrP`+*il_O~D*WWs+}ES8d(H_zY8_gWy*9h&Uc)&VwxTuimpy}9RohkFzwCxVieidB z_6FVx0;heRSG2!Mq0TJ5HG1NbGn-}hdvvy8Pp2NuILn7>;|d|h0LEKg?Q{HfQ6Rz4 z+QbGWgHF6fR{3C2sgPMfYpx*|JT**}zEwiV6%1#*6ql>Ccy#t^R}~pk<;&a~4_52Y z`CJJh{iTFRA(?TiaL0Cl8LcOOa#uvBli_g4&hCwZvL9dSaHR60WpjEP)|R<*CAQ#C zjj_lr^M!$uGLDaf-YtFID;Zp6l#v-~N(q|PHE%_qMbzJ_F;^GlGnMb9GJT*ppm)hw z>mJZAb75(G-O`YP$fx|f{SQ0pAtC?2AAbr)N>=J|)L?LY$inFJt0WeF+!nkrP;$OO zM%BMvm>>LZaQe@5lRf?~mG(Py!O;5%LO4Goa_k|w3G7$!eO zLfN(RSR7tj$aCe;Wkl0F=b)z|o2cTI!Ar-uW+fJjET#F>8a^5FVCpxbipAyHgH(wF zP?og_H|%9FYuF4vr?zta^}Da^IGR>#HVlPAG#(x!As2Uter${(rd~>!4~Ne~qB`IR z)nhn6X5DyhUAM*>RoZE(eQu(%Qc^k)@D3Dm9vnU&>D;z-|LQ}CB*#F;V0D%AzExtl z9r~#;cK+=@FbjS_K72Hclq{8-@l%k3dW*^JHon)ioxlj10 zmL=Ldhnd-`6xl#?cA-0=BvKLSCgy6j7X462o4frDGFw6_?g?pK&t>3*iNEo75x8y# z94v$2enc;$Yjr5fc(32+gA=fx6@!C)E1Q~omk;;%uWk}Lh5nLKL7_+_@Rye0Kq2|N zFZjKVUUk!D+1<`8e4jb5&&mE9Nt5NYIWzIyr&&UOX?tyb(NmCcK;RFyd+GyEL8=s( zX>!sF-BNsv;bl!Yl|Kffj-B zmRF)(Bv?eeRa1`k5O;xLX?@jeN^OKUjj_L#0Og+=2^6Vgt>tx%G>`8qEoXY!wbwt~ zrpJ=b=lYqjvk8y-x0ARO#*_w2ert@K%~pBK{9|)_>(-XI9Or{9FFSjl^li7K_BFIF z`J%b5*zCwCxLjk#n~fo(d0R>sT<(_1{w`2oL1jSQerK9fAyqb6OWJHgno31AmF1;Y zw>LO4>`Iko#2TFA(B{db&2TcS`$^Cy#r*X}nJy(GiR*cbmeF_&i<7|77UT2^9O)}E zZfgHW#t#svGi%FBGvFRPBTfMcrPekyRV;rVWlAG^OA5{KHfvjZW9*#6v6e{~=>(m9 z9j9enpP*{6*)l?Ye<-m8C_m;Q&<%QvVIZWfA3l}PHFtV+x&=}rXwPq7;7+LH+|Z7O z1^7rw?nljYftuUe{mK(XXw+xPqCpeL{Vp5byS><`^54ab}FG`?uF3{ zEy(wt7|%*;W-#14&zc^jbw6?HR43DZiAa|*Z{A#_gyR%8tw`Rat>kB5@6*!XL%>Qq z+yMVuJd8m}F%U?meRS5Cdu;yVC!wx#8KbO-mtWGg0J{qk>oqk)`0WbEOvX>NdfRS3dM-AK1PJbiDY4mHdN0`n*oabu#It3ZqW}&$xqmOUXEUm^X zh$CSkew9?SASF^MbniDO)Wc?d#Z`|f;2OV(m*;I@>J4>FuAAFFBIwQ4@C8C^DS;~} z#^;&%Qrzd>C#M`ZT04{3mitGJRf71~OD*O|gkrHw%)qZc*RiyJvFXrc)nas}d13al z?&!*VjTgW(Y(`M76;@Ys<*??5Q(>)~QbnFnuT%4-Y#!uU`u}kW{{vkPi%+Yy7V30X zpH^$}>AbAJQPN87$rspGfzmf3YGNbaWTYPhL;e*XdlxC)#HAov5)QM!DuQ61?YP2c zDww%!yF_ZVd9*rTkzMphS;*Ve`yB%IM>>s}e>H364>JlFZ*vm*^vC(L_w7JXoE(F} z%A)X%DZf8}@S_s@w>m8@xH0JH*zOD70;(Nepcwl*~9Q18eoUtL;g%hk~@riFzH@582% znvUO>ejDUSLr z&j2?E{@^244i=hoSlFB#F*65;Y0MLY%VA;>*28ja`mJY%LoV9Q7wcMT@-hz8-m-5K<-81FeKtMB1iZ7Oh%UTK%PN}XL{o=`KwMn z)|nltoBW6dP#{-hwn883EX|e;fwT?e)T6c7x*o3k9E3d7-t2K^)|8r=04Y~X#7$aX zU53@dueSzGx;^?@pAOGnL(Nv9rgeN*`A8)DGy-`VX+(>#==JS8+(PV%hfvteb5zWe zl6nWWk@Z}~tA6ZG1bH@rx)VSi)}!i1H^m$sut=B{>%w5u&U|M$=%ihb;ihBj5j2t% zJg32h5C2Cw*ZZRIMdtOV{6pNN<57v+U29K{@RFmFj`L>tw(5|?m=Kw~FCvC2$D6z+ zIi3oNNZuEjU<^sC1qpMMh~w;!qpAo7uR%qm#wG8~XSMNXcuB{jl6c47{Bez!7*(AH z_dL%g1wCXWd3L_u=}toLX|v6*c6w&}q?_UGowS^W`jHs3nN68t8~ z-pJ_aN_U|<6J7x>1ZTEa)D+faF0K$4iZh?%_dPUR87Y3?zV_DO50uJ*jZv!S((Z@r zzwfy(%|r$9ha3@{mZ`?%)jWw=9GpM3gcvc4Df{U9P%g6oktKGEen0%EAVRziN*)VDq+itt%uu&CC zV=vF)NY<#rpTE~vE)Xch`2sngpC`{3=PCGA-m@b`MC!RgRph+@yt348stg5U#K(1C;BithNU$Rfn=rXu8-BdnYY|zD7 zeo2&nW51oKI0~|9403`RyuDn8G1mIh{8-^4k@w%i%kqW3h1>Vl zOr+#fTKKMZqHqE=;hR85R+kJs;+PzF9k-cQU}U88uJaDZJn*Pw_!00)cj#HYtvgRXn>_huc7aE!Ebz+ZMz2!geq3^>>>CRCdnoi9T47#5-kp;tE2Mk}9pEsf z-4|TxS-GZk&A4a$zM9IvVB9;tpzJ7X%9f)R`W8BNoqw--f6>kpy=&;5@?ECwx>aR$ zm>f2h&1u3$AG4Q_NY#C9qYtk|)ha411C47!CX%Df0N3Z>#9Ll$fEo?wY^dtr)<>ZzPf6r|=m}Qtv7A35iY}nYyIqQHN5|q0uPXI}|HMTiFh_vZFhTrp?D;7V-JafS1kZ zAboM;ThL0Z5m|_q*e@Z4wzwlB3AJErkMf`MfuZ1EdG0F8WE2)XQ>qe zJW0Y{Cs#IF3#)V-vigN2Er)>WaV5GLtdyOV#G)QZ;CkNC-5E z_L~H)encca#$X0BFPM1kJ9J!QEmrFQ3d$Yj%GBfspv-W0~%nSY||ACK5D!=wfurent9{M>UCZY9{ zN21L+F7RR5H>Q)f8-cKK-1MMjz;bbZiza#dzj6pf0fj0c5INKmRy#BiJWl@nGYi85 zOlMxurn56d%aO8c_ho_CFT~8f;H)zlrZi^wzvLU*n8dcLj|3~QXr3STbWjfggvox!-)LH5*gdAoA|Lys|jxkIjiH4j2iCVWZ|J7EGgG^;LQ_WN} zWx)l>az>e=+r6^*0i-KB!VR!K%^eGd{h42U&%Z6)%vR>)K6DT<8 zpMWuCNGZW!?TEk#ZtxhmvV^@0NioM5_){stgNneI0L`|{hXo}fMTUMmMuwO;QSO#pXRw5Qse zSG^i552TmXSG`awX$#wHMk}Ollv+VPkN8m8e1+)aJcg%^2I_M-kYnynCkLwte1-6s z&L$@_wkzKE_%YW`I^p*>b>ZM-ws@ey?K9!%OaNZs5*J{1iVhOekTI*aHuWPzB{PK= z=1odbGKC^FC|2r&U;`>UNT{YZqn|A(d}AA!mne7Td1)lRS=BXzuUjK zQ37OS)Gq`;d}Q2eNSimrQ7<0Y?v%vsF_+nppxm{Tb4bE+Fj%?Ns)lW|UfVN08z_=V zZ0IsEX3~ugDP>z06JWQ!`%2LxDdgx5nRFe?p8!B%Hg|(pjDHP16DX^wjkPXflL{@- zk-Fmqv`UXjCu%lo=Pmrkf#}e=foi)L^31^G))3A{eAn;HLTw4*z;u8b){M(>w8r?= zHlP4BG#Y7iHXz5y#!wx=sMs(D%~kbKMs$+NgbDFx!A6 zt+}QMTa?q|um(!HA`nfCl^SmL-XJ zvV{dWVI#@fyPBAV>~Iw?+(+Lpouzz-e~LL#UKVAcn>tA_%Y8_gCnd}@{dX{EUb}6R zB+b-}Nu5-SG;4D^zvD<933FMK4J4SzFC?q%wsBVt8taY?(W*}n)IMe;oAUrpZDmEB@6m7EjEsMhF~tkXsI!2pJKQ+@#3pQ{X~G_09Ts=|BHr)~9o-gEjzW9TDT??Bh~S<&7jj!IqG=W`ha@c8K^FKNNQ3 zdtZL`SCpS&oBMayR`RT|%7k*s#1K6!IZy@L)bZ(Ps(5PU#5l-P6^L&qpU^|^eIueP zj#BoN35vfQ?~@;2ewepA5svp0_v*~1W)Q-Flyb+3%u&EIH4P_LL>ib_%$|!Va(S3~ zK-D!p>jX_EoRDe}Lng=2B^y)(L>0Y^2Gf;LfX-#RHhj5h>4Z78l4-1%1CJK;PZR4@ zGgjoJL2J}orldQepC7c+6WO5lf<%T+CmHo>3y4{%wCu#x=EWjsm2_PY43LP&6cZC9 zQBy_XJ|UQzKWD=i779PiLcWw;**~X*aLQFODsYhq`Ou+`TeJ|SXI*6|P62-)?I=>0 z#2=;(iUQEWRxmD3Cv^PWwyx4}3e{*QxZyG3i!pbI&=PN27e6{x5Wa>o6e4E*=iC>; zRSca+50>5U)D{bbi5d;kgjr0SCNXgz>)kM|Bc+a$P&AFas;T}#R9G~|BdZ4a~FsY}8gGmg)KPgxE*v!I%J?mA$;oo`NC zH+7>JP(ebH6YU(@Op%B46eH$wwVUE5%oOKlW-!^0QIXTsrPHYjeruX`+A%bofMD;8 z!(avkyTKt2p~T9%uxfKtuW;`(qJdA*{_>GH)A+HdemK=^l=LbFPZWwUjje=L;6oV~ zB`g9o8nn70fD`cQoSk4F@uth1`KMpueu=_FL0J&zP6fa7_$Ua$-?jr##4knr8Q9%oFK3L9ksL^DS zRi)+XMFbpIv1vTIvb#mJfx@`^8H`6Qol;&0^4KInbrp?f@WGOR%#e2C2s84x1A^#k z?}?Ek_P&EVczShtT=O*IX031PGREL0N>I**(p*ETQaB2p9@{KDS(zSk(`8qpjAg+G zMdX_S@=jSp`g;~#)d4_zN9{lz?jl$?+@dnQ^omat*#?%~oTP=1Vk9Um71?^jmB#u$ zdZ{ywWY_~pbI8a@Q{k|w_5qXYab{sl4BE6qm4lvzwK4p@$7@jx)wMcw{?>3(k-xsjgUtdRFKZlf&>hqjVv}; zG+~rsMA_EVs)%3^=m|Gy?7K)y2hi%ozlIQ5!+Z{RGl+kIvt z8=A^1NRF7IN0dGHN&3Cw&4C6epKZBO%(6h;gjlU3e~c#4d>i80?*lV10&b(x@Xq^Ymub= zyD}bT`7$?eG}5S`BU;ciXjJZK=s4~kCF+X@poPC4K2F<=n!ihnx)}s9C z1E0^mYJ+8qBWYZ){*o52aG!Wn)D8z~^Yq5S_WxS}xR5~Cftb?Vq|%w`D*9<-N<78< z#?p|)Ab|3S>)P6V;QcF%*2cLknnt8h8Q%gPLt9eLmObsL@)H{*JAUjkJq>W;g|%e( zKhq!qAd+>#y;Xa3=IBaW7gat~QDlkw`p{dmMN^kWp8ZFHw927uyC6ujTusbZd9F$# zWFF;&F9}m}b3Z+g^0v;d1=_V;MiC!4Yn70X`m)N2ImV1-8WM-r&Bju9r(LaNQ@@kYjFs99L!e7TCg5Qpo+|Ow;=zg|5E1dpEh549T z{OkMNyMja9Lm3V_$1&-Tv{MLl6|1EXf_gpi{9t_DIiM z{rq>x_+okO?1@2fl?5Brrpl&b2kqE@EQr{}%dT}6*lkxJf|gzGDuBx(5hH_V(iNtg zVJG&Q%hvgR?3sO|Ga9=c-at+gf&|5nc|P45O#-b$2-YI0MZ)Ka&(ZeJN5Nc8m&ZO% zK8u^x+z;2Hhx*bE%qy|7$H<I6QHa~J1crL?UHiCxWlvQ z`tbw`P7@{VPFSSq$VW`@=QRZ`5bPp}c39h5=sj-ZH@FcuSv6X7RjCB3M(J3p;!m#| zCD*bZ){8Poxtli3^5F98PfKKW7(ccfR9D@P$y8hZi{O#D@S7i}kJ(ne=x?j7TFOF+Dm1E!1g62u&U)}4z^@rSv^~g_iY^E+9woS?Y>eE8uxZT+x z3KTE~oa@3YwcB1xr$VM&Q`7RGWNVuYIqs?b$+7FS8ph1AJyc@m{H{F0s`S18v5XRK zDx%oK3%;2Dr+>R=_C7mLBT?VPria(A#bg;vrl{2NKt#3_(9&Co(SDuV3$WZRx0k09 z_hOTj)98kNCBjX4=ng7xQ<5?lCPk29UJIbt&UEQVBZ<&ym}@-@Cvk!U><1=ChqdF@ zh7-;i0Z#y~^!CB!9CEl046f+uMtiYq17^sjogv3;H~3J3rCT$^}Ma4mDv3d6Vg zbjNO6m%}`bw53g!EDiR@RCfsM+sC!wB!!*bU@b_L{Iv|th(}(*!=}m-X{1Gs12B$Q z5$k+kpUEIp=qP}y2wd=EsgS|!RtaH)E(?7TpqyQU)}pXOoD9GL4gJkg3jNBFl08p} z9z>9V7;Xuz1V)$7AB4I2{#9bLCU8JDt6h>{RN{VtlHws-4KF#QI6I?f zK8led3{YdQ#`@IDyv8UXNl_E_;>bKLan2n>KJ3;@ADykcjU**J9n z5U9Ky_*MMz0$})IEu%vHwUG-f3JcVbxTYo;uyTs+6#@vst#m?`qF!4pghMfS01pm8 z0BTJlNPt<8ro?~%uxrU{|NplZ%LWR6O)_v03Bk1q|UW`BvuhJD7~_P12N=-0-V4{d7+SEc$(~Q3Vxzrjf}wztcIoV zfwf8k6R_yfHI|I`5ehs&hFh=)K7?zKWqp@eR0I@QZUXBu63D=?nn+;-VE^;{8>hnC+W zs9AN#XsyCjEk<2tH1>^3LB5HKfeLz?l_+pV0~wS&Rjy3+wyEb_MYAfEf3rwTR19<+ z@yY^nb_%lFLkCu)5{x=Yq8Xh)@>P*xg=$RDYIaKuB&18UDnYO>q)Rgns!~Y1(PB)y zWKqO?HZml;#46Wic1OajqXE^rHVwqwPf^lF)h=4DPPqzbFoSuo4V9GKS;~9$XNGP_ zNju>qU%&`uH(XO{zbFT^Q-M_m=XZGJuDj_L0wNN!+wQpQ9ttX2!o7IiDlpvlK&6M4 zS+mZ_-xD$&ii_tXAFJ}oG*g8_e-b4kf-~2uQ=>t>&0PE~RQrQQ=(*_i6oy@mma;kZBb&1mq+XzoEGro)^AXSG9KOsK;d6b2}#r>Y@3Co zN}C{yO)m8>?HOOa^eP-86`9CIAxcq++9Z=rG1WBF%`np}!9s)z6D~p|aqL_&kBkIM zs41)jpl!v1ldNPi0mZ~5VsPgmT8!BowuwJE?6&BLqfR?w$F4o6qAE^2a~;N(+l=TH z;Y5fap&)DziN~IZ!mBG}DN?0LH&=#Ciu?v6TD>NXYBj6kV2S%a^MSkMzVNlrV=P;a zTzT@%Q=pL3iM#biFUodIx{F+(}_OWdg;Q? z1*V0}a!7!l6QIC=78K};0tEte#efzJC{Um)`}8_)Xl_U3wE5=NmX6Wgj&rk}vcPD63s%Ew z`%*(>2&#brtx#a&7P*y`#m)7lvjX{HFzn)yc|~h4|6-`XYKdB(!BQE zuf1k{#o2jUS@Yf2em1JL7w-g#YXkE}>c#O}RqlvCz+bBlL_Y#(rj)u%0fGEZq51xC zxRufSJ(fI^I&E0XON^e1PgS0rK9v6-M+p2410jc^4*VU1sSOlDjy}EC@c(QmbRs!9 mf2}u&@BZ<$?q!(cboTo!`%LDv5p@sf{|Nm14^8{#Nge<~iWRp2 literal 0 HcmV?d00001 diff --git a/fonts/fira-mono-v14-latin-regular.woff2 b/fonts/fira-mono-v14-latin-regular.woff2 new file mode 100644 index 0000000000000000000000000000000000000000..edc71a868ab6867ccab1e3b3b772033909548799 GIT binary patch literal 16284 zcmV;NKV!gmPew8T0RR9106&}n5dZ)H0Es9706#bY0RR9100000000000000000000 z0000Q92*`Sh$IGJ0EB!9ff5Oq7ZC^wfzB9#uvZI&8UO({0we>6LIfZMgKP(h91MXV z8zpx&%I*s)&>aB#k$RPvQIx6K%P|@m!Nvgu1;0V$|Nna27y}Bl?|wM29SQ}mN^#05 zb5%rF71~7=>Z}wlqj7IzahV?6XbxL98o^ec^YGD2)ySpJ?2Vg^_2LyPII4H)OML@d zF6GSl4U@H1U}ehqjZfI3k&GH1wfRIC;UE7a0w-)Nbzp39s_31(@Q8<+E3-WB3~U?u zlbpQ7f4|@N_S$CvLH(}*L#!qW*a4sdl(C6SMG*=aMSd!Z`Q4w-E8h<^vw};W2rj8x zsRi67Gr+s8$AzLfCR0HW1OeH~5`o9wiW5{6QE{U?)0VcE-E3(6pRJp9jdi!{>UMQ? zX5Ad|5B{Dz_eZK&>_>swFSi}5esuHyPlA*}g#<_`c#}}0W>51(Z2LB> ze_7r(-RtXv)c0{dJIPB`)D}RfVwl*5e{^n#L;VI?MF88`Gux*XrA26lyc1(1cCsc+DSg{BeP{`b6{X3?n_*j~%cH8)< zt*je{NEMy^pXfLKGJBb{AeoR|);X6Z_hY_0dmeLzCE^q3RPL+GuS#y!@84q226oSU z=z20{LM-^TU>bjKs@eYc7mz?mJ_8r2bJWE=JucJEO`Y4_|NmnD{sp+eg5)h1q(p+0 zM1qut1ZWZ>bT0*#wfrJ7SBIS@{6>}Lwi)`>uD(=vIO22eGT>h(wa9% z1Vuzv`UmvOSDVF2t~E>$a{Yd%oJfE%u%m(@JcWGnCzQLp5t>k<&OKje10^8-roa`j z9{p`1V0-oY{a9BBlp+yx*7;ftY~Amdzw1}dt8Kx^Y^e_(B%ao)la4IYlG7?(ES|xZ zdg(qa1xWbq)C_qD1*fLTfy14eA`1q4YLW~U`KKmGQ-(P;PKpxr$uVMz@|klPHOl2%u%m(Hs$Rnk7?XuXuhCcx~5DhMQ&PwAt=Fj3`a{7=0<87^M%54_|)# z1qc)*Scp)FG=hzpsAySlRF=EAuN65-Yv_(^tXqSH2Gtw5X-kCAFyucu7EU}(f z%Zp;|XSE3!#78K|1Nm1Pb&$t)lB)U)B3rlVtvsJ2>8?RC8k;lFx zFf8fuFLRx@EqY=}6dBJv_rgoBy!M7GH}0xb`|TSK(E&v-2gl&(YD|&0m`H{OU z%!EKS+CQ94eFzQ$^;z?rMJ5HkDY@6R7kjhdy~jYV19}-yll2C$*nqvG=fpt4*t+3Y z?J*d!R3)>)GweBH#9HU;QvIl3TO!OH27$@LU@-&?A0yMfshg>%pT9vbKwlo4{hy@k zFisa8-~Je}ls$SD1H+)sm-m^{{VuQvL??iHN5NSz5scef0JQ%F*nhW8wXJVcw%NB? z{Qdm*;NJs(-u-DopF{yifL!V>P+sy(rrIz)y-ILrGnF)1?S$L&w0x!o|ZUQ0AOemFAU_z!{WOG<3`?tZXV& z@~T#&UW-;CZ90VY>eDY`$Qh%~`r&=YeR9XgKJ|kcyeUsy_LWP14d5?5W+hqB?q_NK zN$^ywX`Z|lV2~&r8cRf)k_?%$D@Ro|M5Zc)FQ4CUcSjBAKwZ-e zH26Bu5KmLQu~vzqqYklRF)K#pk;l}NPn%lYozzO3v5EZb+u5>}Wm8fQZ$f-+(pwFp z`BwEVEMeSYx|Ol60XBFz0tN?}ywN%Y1nEh{)q?f+wrP~xX#i#pbU6K|yU$yP;i#xg ziP(-?voJRLFzx(-g&Q>s;g8sIT9HX+bJR7W%RFI*l?5@LvbTIig^)bCVj``QsW<}S z6mQ+(UE9acVy5EFn@6K^!x8$9WqCoeY54`&x zMU*_drY@zi`qH{UJBMg0pr*Gd@MTk1pMOJfYiXr0oQfC@gcVJ11C=cfY?Bf%QdwiE z!W|ZXHED@RcrYT5uC+ZZ75KdOfnD+F=)B+Fw1ryqh(zhPJ6VP;6QBPov^C}bhvtep z`Y7NXItD0cMGRxq!x{>)j{4X@5jIhb8z{jRN^x`G7^sLIEKSf)nxg*$I>Qpj%}U52 zgMtjG#25{*hB(%dzy^}oL=|qJA-2#6H+fB{MiI>hN4gP>1dOIaIQoh@;$m~;xouwB z_sIglfVxOYI+l)X>^!!ydYQ`#s*a{yl*RBt7p|#`<_eqA3|(vBw#E7ec?~(KafnQP z>6{d>U-10SY46K%S^MC?aSPNKEVcx`dNhgGf=@|D#{J8fhSU+$)g21TjMVTtI$-{Y`3sC1HAmr49N=k~lcs>XGtHtN4 zH{mDVuNLN=4y%#+Ua-$1GUty;|G8S7jY-6wh;{cBFyl<9G0jAA?DwF z=|TE*Y=jnjVl}9qYmAtLkS;k9(Qh?0>7r~7_284CX81I+e$J(h>mRz~1158`5m2zD zK2At?J86l}@}7t~QeWa;4s}7rG#9>x3bj}h)6O$M1N6A5{l#jz8>Z~{in@?g41uY0W1T`djEU@G0QL#Q(whzYNh#~%n1Ehz!X)VXb)_Aj3 zE5$Q7!U*8!%~odB6U}LO5eb^7H9|||YZ>3RydW=oUL6%cZk)TpU!(Mcf!=HhSSP5^ zXP%I<-W~;HoNt^#?~X=*b^^-4Akz=P!VxwX$gx8Rxqbj1j_?U2I3R>VKY$2F!~_6N z2%*#uAj1(kfdUtVQ0WIy;fR_*iW@?x^#kZ|R`nnOS`5iJ#gaylXtJ~gfkLxM`O)H` zX!THI8$hAmWOsCU7&<)+T^@$+g&aK|j$RK(pN9|oq4dj&D8Bi`{XN{AdOe1(=U-Lc z=?+5Id6L8!BzXx~g%^ik9m*B>7XDFrHgq?L1q?PhZb0rMET0{9$?%Kz0!nS}Qd&vI z&!|ujeJ`|7(|z^4mW9T&sjHFK0w_UDG!@Tv$yo&VvvAYwaPLjRt5`|ORp!-?kFZL+Xkk(!8WvZ%CT;;1lLiNt{ z?4_~?`;jI3`9mY8F!Aumbz-du>3Hr#FETP;JVzgWkn!&KR1jiq3PNJUt?%M-b(}mY zp?!5cZ*iT3Cy~zbd>0c(lA{NWC`NncC$W!2%tKrI{d;5Dwyx<&?292Dqs(&L%Z2s* zbzUk-eq0}{NDxH?=#fuA@BJnS<+D5Q@b5u+aJ}3c|IuN` zq2wjfV*!khC~250#&K53f)37+bl*nKc5O=bP;m&b3{rZ|%$Yt!ARz~Peij549LWJ< zE`zJeN2Cd}z1cMua(wF|B?7d(wmCYTQlb>bTC+Po(5>TdQ|FJ|sW5hv>YA`p>Jm=$ zD5y4ql58R&7fhgN;tefSsZR7#pAnm+EXM7WWx!IFiEmk{<`ZsGkZ2rlZLy7gVuP7j zf@lt6Q?!7xP}^*c%-Rx1Gc-F|ScPW_+`3223mr=RQb6s zT*c2qRP`;;HEB*fOVY%pI?FP;Q3-xewmx6VC$9K4N86Jn>{kCh4jJh2l>hkVG|$I3 zu~ZUup8rlwV1Ps>Y=|IDHl3uJiNTxsv*4LDxh0b;yZG;r4ZGmUlPifMZ4oNp|h#|Xzi4o3(Sy*N-dKSTL`+@7D>Q-p)V0!&^!oiHkn6 z+CM>;!?8;dPcpW9(mFl6( zMIS^ZaDs8PZ=08w?U-v*6r8kFwyY*i&5Tf36SUEVYJ-ozUv*SJM&2q4OroxLQtEhPf`K|IT($D01$h7FHe z7+}VJSk3^J`hO4YMgC-fl^YCEXomZR9ILh9GH*djweH@d6^5EsMhE=YtXn0CBC7&@ zESuU}%fc7erCG&X%L5d4G<|i?m2WwqUsrHYD>2?jlv*1LUyHSvvWJZipJbB)=~?$X z=?ZUP!>I-pUcR{Jgy7!Ztr3#ZZ_?qGk;}@ihd3h5>C*Ki5w$ptl_e4y)vUL0R+}ulMCc_!xzyqJ{Nv#%(&(Hg1n? z94cjb#@r|E=N50SaR}5N1j&dyM{u*9W{(Gl6yVD2#$AWMK$OhXJ*N<;NFL0PV@cSjS6RNSocarH`vuZIeFX znPc$0NvyBBHsTUvK!K`p91M$qDzU>#``f$%p!foiZQ`;h@z$)0L#5d>YKbb8yrZ2ysy+&~svSZp_OTl6M1-DzJqC^Q_-=tn?zEM9@X%6v<9j!v8Wvbo48T%!@)yA%I3#S>Irs zUObxH*2;-~j0C#rrS(9u`|4aubC}C%-yfcy7(8^_t&y3M5F;LV4YYXBUf<+!3~F=n z&^^Afkqk8JNH72E!Hn2eD21g-i1%~&69nPol^P!&R;SN;T{8OSw|F4pDv^Reudq`g zufBn7oAef{_Iza((8Ho^ebmaBXOR~-rcZMMbi6(HDF)~02S2W+@dKcz#8i2lk`+E( z9mIH6&d79dUUWnbZ(XzqUsw}-0@7rfe4A~NVwwT%Tc%~a9bPGhHFZ`Al69kKVq815 z0jEc=1uvs&Ja0~6P9!an0e{}nVn}26Zwq`v>e0w7TB^ub0SC#pJr7;<@mjRiaaiU4 zI73|_HnQiY#OoTrNyZhj`hqrP=@Dqr4ZR<4li6d!hOzI@t{>Gv!w{(L|EEpf`L#^H zX1d!lAl!0hnIWX8-&_k9Qzf6St^_=Wh~?HH&G@* zxpks(=&pSmy**W~JSr=J^_AVir?-UP?i*@aWAhBLr`^JO=#DL5VmAt#&s8Z^PRiH$ zGo05yHG*UhY)#KqpLBrdxZGSyh0*b8kf9@@j1e$wOxt~W)YP=NiA!}^17GFcp&K`? z(ABZRnKe>iQ}((hi?)ur#m|}?E&~*@DCT*cCLT?-1_2TXnAn@BY9d#JT9I&oq~+$J zq!&cgI!em`7Oq&MDGped4`4IQ>Wjiv$F*}?Z-ablVL3S9K~<$Rf$u+Wn7KYp{rfYZ zvkp`zy$=%oMPtPKsyl8{NVdcTd4WPPO!8aqDGR8}E58-^$TE1i=p9f-{#V2~@f}-j zgLW>lZ?}4ipG}=V$+1huJH(wo8khV?eMgm#Tb-bfd0+MMFv&+K?CK@@xVKbIFZ^HR z#Z&D`DdIzhqQ@6L_TcC5m4WqvFOFF}^ww-;m4Xbnbo2G4#Kff}o76~8%b6=h7 zgD94mkIyQPvVMA1`6KRFs!G*a*{MWUY_4cMJO4^xwaF_|Yl3?bGd*EBQ_}cF+ejGk zvwTb(%5zltsU8^gzaPs7x`P$w$9tuF|JpA6a1^8j{lZtQpPzy# z3rSz~rYKUF&iSnnB?osdapr%=!^VBfO?rtF_af&X8Io*kTd{eQXR1=Y{{1P4>aj}L zlqVA%Rm3Wt^G;kW?tSL`ADVX%cF0%DKh_niaX&opht>?SYS65~ zymLNd&c956?rMd#5vJxGK0%^x5)R?pvKr&6c6L5+4m`*dRtnP_ErhxLw%g6OBgAc$ z@k#rUp*`(T}j}O6}iNbt_tX z=y!?qmvbIDMDYtx20pY?xijV^u{udm5xff zFWsvpsZ%U!n5F`kZ>!MT4XqCD-j)FGK-g`GEPwNm$2Bl`jQ=yM2sT?$qs_QMZ#qx# z7CPqVM#pPwDkNH-*$49L4I()iHZJgVFb&!WZewrq!iqm74t& ziLANsQmLY>N~mWs^Zr!hq!~5HCbygDa5mi5#wTdrL#BQq=QcO+E{ zO3Bd@@9oe#5`xPGdHiC{Dfel&=kW`UHCTty}9WSQ3Zkz7>KyvtH5I*dS^Y5v8={amEkvk!?bN+Ow=S zzqosRHm9Ue zoTF^iRiWwO;mt$F(!oZB+!tQm2hFZCEovRH)(p^RxwDM-a0x&j%PtQ&TTUcMUp{0% zGz1I`S~fKpBs5; z?O|lHcsOfSlW*uAK-0Z$yKjYrug7EBqS4-N`zKv(*uZuz;7zZ6ZnjE zr9M*n36eFl!?4a%pDOW&<#PJ-+O9zMrH@$^qer-BOY;ybe|Miv~ z|BC2f=JwRXq5natU#a5Mzhf8EwxCw5srd2^c-O{}!Je(b*6v-qSK|UQoD8i*r;WrLm+0SlN##E0aATSE2)~1 z?@V*)TZnbEFQO>gxXOhnM}e7UOMzz$HEyYQRQzp)+*g6sS4?D@0B8(92*Wpcso2-l z#Pf@q7H(WL6jI(8_`<%riX6WGC<$8OC9;6(z7?{pROfv=BNEtN-3q+hDDah$B$Q6D z@jl-F2);AvgsdYj!aVv#izGv0owiCgrVgS37a%)l<;kf8M4G3yBF8BfOI!7xkeTNO zD`B*-95y|<&Yoja$c!U;@1R-n?Vq3WsEqEV8l$)%_pgcOOgM8@Qvyy*l` zA(nDj6C83(O6g^qBlD6f@Q+Z(@9yK?QSrC^U=!thm;mU%;cehIVAt~^q%HyA~F9#^C{ z8fI+f3!gf2G<+%)`d4@K$bS*71kjjOt1#$Q$j|LalpTeVqmXh`Su7x% zmc5+5yGnCoMAJ&ro~vRo9HnA@@7PRFPzF)%lueF~Z(ua?`4S1AA;v&=kNapcy7pXk zG0Q*`>Rl0WtjDPn2&#h|MOiylH#BF$QdB05WcfNCL`o{r3I(MqA&)H0rGH>GwwI^A z;C|8kVxH*gC-U4=CoX~CR$p*a?grC7eRD0w(a_N#<2DAkicXuE`Mq7PwHgh8jE6iU zl(|~VM&5AIST#xwFI3Ab>kA$|7#6-1t}tou#4qC-U7Mmto^PA7Nt05Kd0T|8V;_m? z0$SAaZOKWMfMUBOqYwV)J%M_^9HsY`ae3|*hEf$^mN-j0SBqD(RXjnNxr)Hxc=3D# zUrna$JV?DlVT*+Vfml$Qj60=3%VEuoW`SC&Q0V1c;)b(rYlb&yUfo%@5?{WNuw@F= zv)Mu`;kh`BIzYwu``G2!h?;gis#j8{0RXc}CsGMG@TWP?n}X-mAGfJmtu|LHRVJ@S zZStzLr5yyq1cyCEFa#ayXVomsdK*uoM4mYRTrrnmPOi=7c)2QCTn_Xxs&s_#z7|&` zQt;@+HieuspY1as9$S>6`nGiL=ktfli*X!r33Eq761Dit^a(bODQ7V_ z*77o)#j8;|yr%LbTD|k_6~}D_*eW%K?~&O#IEnJ z31Q4bIk}MMTU`;@CW0CF;97eDmSc@+MnMY<@5RB4TSdvUHdK5k32`9|-LabM(Pzr>LbtI}}+{`rzyO`(4FSw5a* zI;|_dcsDZ>o5{eVZ4Ibg^5vrXE+czTs3SK;^`fpI^C}>X-)JE>tI{}*3+#lk1F!h0 zQFOl|m;IqH)Fxd~sgHbT7FT4wtjvCSL(XRJK`wctS?E(+PO0I|8!#Zq{gvQ2e3O+hwts4T1 zjd%=UbsjZ~bbj*pi{285;JbMKbsrYE$utF#Fd=<-e1V3wmmK;gkQ$@e786K`(XfB} zrrBLa)&GYV&tJ9jUC*!uMdmX)+B=IeS=i7h2U~?W8J42K-)lz8FPdLqC|1;pcw^>` zgmn4`e^^0AI>g(10e~w5JRN14WN_AN;ADz~tV;N})-af?}R{-Lq<+Q(5uV%ig{2RM3{I_x< zRqc;{pKbL-w7^lPBD9MCa$B30Z@E`IsslXzl&y{6@rxA1WAE1?EsxZ`jtyX(HNTo7 zT`VUlU@jgX<|Zl17b!q~wGPZ&%t^q}Zaxp@Leke-3x+_vE|m+0smxL3zy>R;R8_Eb zm0T4U7FBZm-7=L!o4Pr5Yd3n%^UQT8n17}X>B(Elo3x1}>JtJbM`dN_t++M1z~_F^ zP9yZ*fg|>Nd6;YHl*o(bBU0kR!qc?ddEAdai$>(EgFj0zh>1Uo;iHk+rXxV?PHvgf zT5@A96$|f6IVGE0akyB9T}llZmyWCifY?wx6kWY+<@FSC(+ zuYr2(oF<#FyH+5xT9ZA$-hEbi_uiExufd@vtB@<4-I-Cn`{dYtfY5H91yg zzjdz65t-SA=LCiQxA?aPX>bY40#VM%v<1_IQ48NP%As2AG`=Y0>gCTkW&|@cu9>xh zwT`v?t~Z@EhlQ~(2;ICN*Ngu4-Ou1qZExIG$pzSDN&c*?yd~#rpZXQpN>L9A<xqW)P1nzI2W(f$y)- z&)`(;dG}v5Al!ze;QdU$zL-cnB}foMcUU3!ZA4*`tbst0lgGzw)cYCj+IHC8qmg5> zK5TYmU=09M_uV-u<+nx(*ib1WW7SeJl`5rRRb-j55_nS2pf#W|QWjf`F#`|`NR*(O z3>^8lnMtq7W*af*%qE)NC z0B-}E{Mu=4y6J+p-ct0Reb{T~h98`rgzhgl2@0#>(xlkJ+FFA$(mduHt;RpUInt=| za}lbzaAP=cyVv99wH0nk5SOlDEBeGNZ-Wu%AY;~IUXHzqGbqm*(9O9=TMF3D;=I@y zY!2W_`>4J|ukrC{-V(j3PLmq*jH_o+s9HOP7vp9~sAvU2s5B{yBna*=D)JRwVtG4T zm-wr(jaBOA@_C*x+Z=-#UF^4%PdlCEYx~VMTf{7$b~we;5sOXEsFBfoG#YwW4WLle z0JJWRhSpOfQxKJm|A|@)i&$crm?5UnEvW{%+FkD!l5J`-Wx9Q_QwDU&hD&o;CNQIP7polp~ z#L}SA?Ngo}$w$t z;DJx9T_hs4QZPWA=v6Eb;`PG2OGpU`J+B9J%X zh}V#an{b+C<5S9_Iw`IDvYMdBW`99Rf+eMP-S!Zh@;eck(vJ+@cbdScpK+QY)1b*S z+04s$_4!j1kGw}t)><-HPD>(Fp$ zI5Zp@HX|*V74{Iw@NUMgox_nATvNf2#!rlUye<;)kN|;)?H=d7Oe1)0dwoFeY7hi> zctgCQOMU4lIK&Tl{k;Ln8gzv-*Nz3Qi{{bZ^xmRzRq4{3tRHB$t>c+rT)#b} z&3ccu_Sr)1qPC7_esTS#RP^=(RYNfI%qzqqo_+rr6|BQi!5ZuV`2n0zplyFk9>X3F@kv?*xL&f#3F(wZN}nE>)SpnsYIt zdlOt+8c<6vpSi!KIaz~tp82&J7Z4{Gb$^=uoqDY+CJ!}~F9_YUPrV+eL*$uLoy~#j zu+XoT&T5|zdvmbX-Tm)Oc)g{~al#)bHE-f%)_9=7?K5CMV}OB*X#qv2=pZ5W#-yOq}SFlz_X|T<VjlLTq3!4jV4d%mOq~4nVi$z+6B9V~^gDyY@}aJ#5FcETdp@YXC_RW1Rg9wI+l~ zSsN_$2L2B>0}Ig55K=!IkOOEKr~`xwBSRm&&fT2kCsr|9j-7&qKP6G8!{5 z7_lbqs}kSc66P}}BW|w19_vU3(A5OQr$?LNg<~{1bQ5y_A2JV{H!o3Nk2*;(%Y%uo~E<&^XVHE!|_CZ+uoe{5;_{@vc|Q=6y^US1MIeNpB6OW2@LE4%uFaRlwk`r z=$(6yQa>q;AKGZCaMxU+xE6)EL0v{!mMZ{vJfD40A!DHZGb@q^=9--eWs9`d%-RJw zfR1(|5s@;W#4ZA8l#?>c1QZz@p+zsDoSIm3fAaSFKY zth0{Vg3QTC+Ayf7Mk>&J2qntigtQiT!Vub5Dv76(n8kVkL(*;Jci$WR77_uA}oem5`$Wkmp`Mj z@u4Tg^EOBq*U?IgxpLj2i%}6`>FS8g790~(GOB_)B}xF?S3W-335kc2lkG=Q_ff=r zOcU$GU@Ex)kWuYAK4enOv-bwDNdEv;3T})kF&aO7uK!`OH<1ic8)};D@IH1d0Kw6v3s_UhTseN-Ow|2*Q=>(7c`8PTXtv=@p zTny2}8VinBYi(OVs&Ud}Q-vu8&IRSV^^H~65Wn(AP%0D3brVzzkM-$VsXg*t!-%f< zUhvYBe<^x6Z~CKy8cw&I%AKIjo+TwZ62;sStOYDdjcCe-cUY=w%?)(Xx!&467sN0p$QWtsBrDLMc{u#4qRpC< zA~6rCt=Estm4x0un7bmKRY&l?Xm{Apl{SEwm63*Rj?{0&*PLDcb0KA^htosD<{WIupHETmk??-)OceKDPt*52P|RnSeUz? z)Taz>y3n-^Yq4x==9YHXQu5k*xzp~pP4oObFH6wFpZR9BEN5jslyK6~x`?)($|ICG zF^`tH-_*jK#fi`~4R=!-ks}8ul~e);2?UafLS|2yS$W+jU`IwTd>CMJH#Vs6I8p+% zXX}ts4t-%EU2(osCWhsf*`Z|O1C!F(S3#oj<`swd&uUSj0F3#1&AX4Ef+^|?ZaA(l-Fyi^?nsKg+fW7 zF3E2tRTf)#$vw@CfmPD2s+xBouAI6tI#-ONbaThBC%Ufq6jODyXS5ffJ;cWJD@5}l zQbt~zRx$Km089W>Yvu+Z)Vcjta#d3I2%@WfBx3+l^jndAXO)8^1Lb3RN^SSzq)hLgAIY+%Dfrd|bm0;wtwS+W=?&UDQHY!PW|I1cKuKr0zkw7i5lsr%!wiE;m>9%e326;>!=@I=4LSd;!Yl>d zeT;^@OslMdowh;LwopM{B?kipp=I3&8Vy-Kf$3XcYAWfKqP5WOcPA^hI#Xx6I9j3p z88vRG+l}9`2yg{&ecV{@TD^Z?b@%9JQP}$KeT_Q$7q>;_=@Hk01sx--NW9&T>7cVa zo@>SeEOki;T1y6LPJp@{awEOey-H&3*(>Xf@VhyKlUjgW7|2zFa9g*gLs^p^n>l`Hgi&*>5$L#yc%BaT$S5l-!3_BgvqSWwPl1(tT28aB`8s)yh!1^V zPgCpAHe7YCgn5YphL1>yWWJiBgz@6Vb`H5z6BTl4@ zj8hoceL1|mh&QSX;$kVu0-aWX`z^H%iFeIWUWqDP=7vzWz18HIUMn$W7RY!f=fl%*SATT)JD`uJn&~&Ai(_x*K1Us+(70laeQStIA4oUobwvK|=6+JR^evc8s zmaFMTh9ArM&Ala)d98mfy}rg@Nevdr7{SyRiL+_N>#|5Ri|S+rCxs!f9}yQ~I9&Bx z_fA>-CxncRmeV7Z15(6w1umrm5Q$ZU*$4i-m4Z|r*H{I60y4m0)vz_Z=FQRkBqr*@ zPA8PN$K6W0Wzg`^MgUwDtUn8K5Bz&J73x;!$}Z(->@%Lb-7yf76qv>C>E}*gJhG^yqoRm~`Tp>n zhh=FT^~3-9k-Awf$%T}=LA=W4?o$$D3%o9!@HJq7V~m5HF!y$N%0ZW&`B-u|X#Y&Y zugp!<$9AT$kZ7>c4tQ=N@-8it2i>`+aW8l>tC>r*E!X=BfMJ?pC zAw*akD7yP)ckd!~5U5bl{1D7C8t{M?1*2OFB(Bc>^-w=A$6;Fp)6N2qni zpf)8!3BfB|lSRPqJb@$WGh?EiIMa=aF4H*evLD$;V3@9&q%k(^vgT5pkG~(}jIClg z*WSm%fnSfBf!8(}^w?VB3a4|aK#xJ(Z!i1KNj0h%3WTL?sMyj@m7(ojQvRh9HA)OW zqokneW^JfI6mcCoJ&#o*>%oa_ih&|f3>2fJf12Z4)Tw7LOkU5miZV6F(27E+ciXCC zEQ4*Eh`otx2212(My4_RN6(QVE6Urhd)QA%@L|d8d z@h(QhE@jFZh7>ryD`tbk5n=nkVt`_H3~dQXjlcyP^V8! zhhisVWgW@Rj;@9>;lvlUV8b9BYI$z|l9Q?Jl?oI_HB4|1tMCYUR|Wt1b_chxbtC2{ zjhk{np0F_#+UoUd`Lr>UnZTF%!%JK>{&-sMKqirCaYKTX>uwD5{6oR%y+cHAG;yFV z=o0O`tc-JIL65#^<2dN9W(i%U7*bn>(;j0@9A%qN$N{^2P+)L*HUDt#00CX&;XCLz;5-Rsff=@~hAC@hIa-ZFu_LeS3iJ8#bBsRuV$!a7Mj!6?Zw zE^Ww$(j4C;HyR!Bd2Xydoz5}yef`NUbj*tVn7j;8$3wJKM@r$`_^?OQxvQVn9T;2w;w|$JBg30p0zZ?3QzQ=zf*kFKy#l=+Se6`H<&3vJ8qK zMXH71HRC?JVgJK-C$@M0DHd`8Q6Um3n{xa$eNMG)p(Vl0$>RY-)pnjX%VmM%FP_ zM>R068$N9Z7lg-pKc@YjG#skB2~;mlrCll)kRB0DU`=KWFQY1x(t;~s)Dj_BJ0zUl zNK`02WAQsk1h$ zmBv<7<8X?Aw;&Y3wNhVhhdXQxDmI1FJmFAc73>t5-pUBuDb}1UMIl%I7UtM23mJ4S zFB~|OP2-)Gv69MG4@`Wy>?0h_)>GR!eTB1?Mh!@$E84p88%S+}L^ncI8IFf*RzuE~ zcqn90c`#sADWK_k2~&RL`L{KgSW4M_;hz{06=_x>(J+Y1Tpby9|FiA3?RUswoa@r%lrQAC9%Tq z%rB#$CZw>)ZnpKKUd9i?VX)(EH};9UuMUh4&1nihX9A?Sh@ph5$X zfjF58fI}RhB`5=EQp&d&%{QE7{*_5(H0>=i~?t)fxh6xC)u7qS@I z)&mXHfN?S(AcPFyhKf23sYVU0YJy~UW-uUXaZ$*KOWnYC#@i2zidVzeh4S_?zkkewIzG2`MJvaSh5qTdSi;>oR zEY8{bV+r~~$CA|9j-}{g>(Vm`a>IIUs~sN=O{aQcfr#GKgT*@apryCP^+v>CBLy7= z^@i2biyqRwR2KfOccb;%sXKfTZcQ_`hQU&diLT_`#MpUY+}U4k0stEsDM6ow^QHRH zWih=`Lzf;wFZIFj8C`i$e{{QkVQ6Z_c)3NHid#{t-^xLW>o!c(U)_joAtP7^6m8u? zm9@1OwK3Z6#C}134G=QwZ@pH|veb;2>ej1c$~ z`VNub71vxxQiP1+hMR7A7gaG@F>CRvHDG$r`x<>{gB-aWJk{dbTq&-Pe5}bQ3S-$q zPm~qA1*^9RY8KLJzxC^zt+Ys`eQ(d!K}|zT=XM*~qqjJ>RJ=Ywfo)|j-dz^`1`LWg z;E{PdJY!?$u*x1T!$v*xgq!Eg$X;^Rp%V1>)+or5t&OJYiv3M{-jr!Gu^Gu|#xkCX zOlB(S$w+3hlAWAD0}DKeAcIP7@`4UVvXw5Fq9s)ZLIR2$tb<4#Z5gDh)DRI%BF=WO z!KJ`S`DDX;S-NU9n*2|ZVkH_gPGN{9RH1Xg3c-#!T@j3YXtR-h?*|NN0Z~FtacH53 z5oTDbJ%$6}%7eStJiV~mv_I~c@eAOt&%Nz;ws0t+6fQjY2oSnZcQ6>M^R;!Q7;Edh zyZpt$w)&t+r-cOkUYkW58_YXNp;{r*dlGJIZ}O+K<&rU55RuI8gtn01ZR+Zc8HsAB z^hrR5Nx}T)Ku_kOoq;|o3d`Q8#w&X}G!zK2UWmXYfw}|=gMLuxD}_R#nG6DhzELQ# z_-DMga6{>XF+(pWTTM|15dE{WXMZdWVi8Zk zv4X@FtomV8#zE^ohG^y9-nmt-dpq)B;{j)xQK;|doY?6~(l2LU78W!3q0GUUv4iiU S=daF)={K-yhxDBb0002=D`A}g literal 0 HcmV?d00001 diff --git a/fonts/fira-sans-v17-latin-500.woff2 b/fonts/fira-sans-v17-latin-500.woff2 new file mode 100644 index 0000000000000000000000000000000000000000..24bb8f45f89f43e11b1e6589de9f6fa9f0175e94 GIT binary patch literal 24020 zcmV(_K-9l?Pew8T0RR910A17o5dZ)H0Pw&709|kZ0RR9100000000000000000000 z0000QbQ^)6P8^a-24Db%EC_-y37QrW2nvDaD1pXz3xx^*0X7081Bws?AO(X^2aZn+ zfmIvY-51c)b|BB)Hel%RmaqM~?5hw)*f#Vv|Yt6K)k#sB%h6%F$TYCV_Aic(uWXJSA|5s@

RTmo)srvC_1FH)CBw? zG@@IGz;v~wRL&_R#F7y4tYdRV(x5GG*E3#J?=(iY^aK_--g^%58Vc906G460Kj32k zIjMp7Ex?Bb=u$E(C?z3cO5hl{y}-$W2@Fd39uTDm?>V-u&2O+ z2HOtPA-V@ne)Chn7E5DnUiG`JM6@RIjVrvw!^P@Ts2i01u8gLPiUW~1eUMWnR*O)jS5rEQ-N68jIBQ4 zpi%2und{5jKWkK;$PAm+kZW8XA$UFw%02CN&+AGCu{3kLA=dT&&mKZ!jQ*uvT5MxX zv|m;3v99!bz!5BaD;NrWqw z%Ay!Yr2vEw49s!xR>wCUq}EzOfEplD03rlQ(QD0Mt+QK(C{;>@aW4!6P%i~g@#J|D zL^MWKqR~7dF0-ASb$t2z6cLTL^(htRV11a)oQ4y5qJF3mZSiah_WS)l>8-if2GMN0 zJa0|^+*6`@$7rR)NM2V_)k^R?l>-@VMiV^oRuD=@k;9yBUa7zN#&>eMrEYvReaida{<%Gm*I{gj zzqG}>CQ4IrB_r#byrx#C)M%>j-q%q+_EmhT>PuOh`u+9tk`DD#lusial&JwUK!d1N z4;M|RPV>Z%yvmAafI%;^hZ<_;w*&LaYvPp`-pP(nT4fjRG~Zy2y3nC6rE*yzt4ite z8%g|NoozE8?UTFwbUClSyPpTH?bGY>zB%{#XZP^EJM)mgTfXL>*7N;u|Bp{^6Y)c^(1cPG}Ftl*TY`Eng;YO}-@SCAX{Hl{ViSVw*2L)60unsLXxg zFa_X;G+mTi;!xU!?wfmwjU5t%z!3@zll;qNxl?J(X3T%dvFFoH(a_*($Rbw5_VQs8 zM;4IJ!$3C%V*r$DfO2MQn?zv5$(@y(tUGd@O=s)<1If3rzl%#Z0>4`Qmqmc^9)`z| z+Wx1puYSz3>|_#%ug!oy_Koh%0>M@1WFR(BS2ade1`DkojniRt4 zXRtYE<#@RsI#&I^WM%bUZ@ulTuP=p6Ldf)dQ)(UKebaQ^r_MaV-HO>5 zxSsjg7#1e18zl$Q*^;E4Lo*^#7ecyMEke;B6(n@GdX4~_b09$UBg$lD(72C*jk(NU zEVyG%QYv*gq?y3+Ff7n5Pd)>TaePg}4;A3h4H2jL6qFPIm&2gpHzJN8R;rV5HEVN? zyc{9bH8uuO!TR9Ev`9&eYE$=+J*TY{gW3?rki($r?2f9!q@X%6;YQo861hS!#Ne>& zSoFcNX6UG+m6lp(NwAx`tull#OX^;VFB_T*!s-yDpMk-cl8|r%9R$xGvjcb{FnK&J z4j}AlStcdOis@!vNshZh_YtN|0Xh6IFI zy%s>EA%MJ-SR-5zUe7?X#Y{qiId?m3vJ9LGsJ-|AZQ!2{^?CnH=8Jeug zd|^%-*pX%b1T6uc3HRq@sgD%5O6eVi`G;f4rq)Cz zU$=W^%7TW5n;f4ZqTKTwgO(tamWaGGn}AG=vCxRzf(*Um;XzLe?64jidL_qZcP+Cw z3C;tP0NbI-wTl9Kq&7Cr=2qI#KFkrYYf@!sOgL*RF)%~mRFO~Q z5m9k2wVXgg=5(f<{tPSao@L!TI?)%0Grm8ouZ8RL-ge8*UjJO0ecNI7z3XJcw?`GG zxrJO=d4aC8T0Mj+U9ie`7DB&=;!x2YE0vZ%f`nYsVw9_Kt`T}G(b|k%qEo+P15`}s zy3XlSBc90FK^BFt-cF7O(A%YnaA3t9)b$=D5t7=X6leF94?Paj+Z91h;CFXTqAuH= z5VZo;2A4zvJQwT@AOi#knBY(tX|;!dZHkJZC7euAIw?ak4b$CGAb~T zp@pZ=GpbD)c9y4q`accoDKkQ zt#CbE^!nhL-D=wO=BMsoZAzWQPj)4d$_u!J#|BtKstXiJ*=uL^_uea}ZQ>|Ur7~%v zZIpIw3$!aKi=PB9`esyhO6np(R2bIMO6@Nn7$Gq3wj9a@KcFvdaDW-`(So4|E0H8f z!;ce*wL6?EFf`flk=l;v$Sypcg&iWpz-x|mGR#Y2tO1E+9g*6j`#Lr?$FIL?VOx6j zqK7AeKnR`z3cceTKk)IXO=@PkW*{(V6Qp70lzD(N*u~HjeVv>qpr+qP%co%lahO#72jASk4&RK!9 zNfJyP>!bWHtZE-Eb`aqnO8uxUx(WM5z@X+D6f`ovw>vtiJJe2#Oa4#O!u z6F>Rl(|37fe25Id7T&$b_IDv|gX#n(X(1s3 zV<*VF^8&gD3~G5#MzQbXB$-Ml2^FWjkQgUf$vI`U&Rgt67GVDsW0=by9J9zdPWd<$ z81msnxe*e40p+!Eu{_l-f3G$4nI zStWYZ(SbD_Lzrut7CN{|SLR3Lnq=M9MYW?R0-^vSa~d;3V_@Kx>n)8jivg`Ul12^e zS%IvPao#IN(h?nJ*LfGx@wkO^CmHdeicz>x6z6Ik>pe9qf+fv0OXVqP!2GC(1`ESN zUuFDoiyYucz!@~Lp4)93WAcqjhWNA*0cR zIQ)*lu3&HQ8VUAdIx4;xDyZhvxPHRJK(R)gvCD|)}{0Ump0oI$8C}#&`GcuG>}&OYSD;uR3yD3B6P0B9(HNA z8B<)9Zsy0y{%X3=V>0`mhZx)s;D$K|TmX*^HX2yZlu>wK$wIBrXJ;+Ufg(r(R%eOA z`)0ssPWl~wJZ-ier+3;?6Nc3Gt;dO{L^Y;9ZP{6V1;uoWwR6mBZsBJ7MzM_nyK)w5 z-I*)bg0_9QF;#wJ8t!e5uur&vNzvA2?HfoLV)_ytbXzMwxWaugL=^ zMv8Xd9v8vHq`5J6E*pxknoTWM%EBo1@~1))h4T4cY(NWjiCe{|Mk=-)uc$88s_R0! zFk-a(w5>m83;SOn?G$X46DGd{BqRvB<48t1C1nB<8HEs=94qsU1cg;ZAbM357Cnsy zf>;?Gr*E$ZX3;@|iYT3fw27$?R__s*U6L}}=;b?g$x21orqg1jkq?^3vJx&o)xL{D z8J7jInF(1W>tI5;Szsd{{V3^T!5>@q!`;3Pm$f&65F6c<>|?NrvR>Qj@iTi8?IXQ- z$t=O;7rJf-F$gCXV<_le(iCOgDMEIa8RXiAcY#53Sa5RP-hlkTI2hlW3)I%2Z6_e7 zG0qv06Qs+!0w31k4d}DhB^y0ixj35Z5zsL{8|x)8Bu^?Nl3;9VhQCrrM2n-qN#FJj6atOSu0VW<% zhxxMJrvpQE+j6g2Zt>;iT~pdu_~T>l!R6&!@XK=m~Jh1%H@fefdAFdY~b;iC0exK%`Jx4C$=3)D{b44{Uc8Pes} zGAEc%fHnvbYTf~uk&J?z7(41}k_jA-MjO=rx5BpnUO@7;Bv?0g(h654Z~HnO9wk<~ z)Gr~$P#Mcy_oMWcaFs|9n@)m_L}qIqm=$`suZ@)qOFO-#tW0IRDU z@dO2a)5@{s-C3${5Rihn4yp8dETRc z-r|EF-udQ@H*moQ;eUH!HEV^mRVENmsb7F$k;*01eK(Bp4^K_%)6;OG{M-V~lWq#F zr~*;^R&IXq&JS;VbMc$dSWk()&Q3Euf-y{GA}m2nmJwJPJj8&#h+ntkdl*anr(FxM%h zAz$X|xcNII&Pal5w?qiV<2UpN;`J#7rVN)yknK+OcLDu&;mJ`Gd(;YCRP-4?#H_%f zzqr7|Q5|+A^Fdtw37SD}k~WZALdSR+TmjKlc__xRydonhv zQQYHU#{6eIjF4Ab7OZ6}^1*zp)`G)T9%nlFbi$71BlIf1n|v8a;YL%a#DM~c4h^eQ zQF9bAbn+qi@Y^A;8D=1;L|0TwkzUB$t2qggys%X|AL)Kqxl$oDMw zbjm!`l}M?Diub)BkK@(?0Hr2&e)uX^VeD;=PNZ<8m7@69%!F)*z_D53oAL6N^@8#S zc!NFR8;YGQ69Y{=fWS}Ni{St&7^rU%Tb_9 zc{Hq1A-o$*p)Do@cy+bLI}rK&_{}{JyGq3CD^4d8Y+7Bm{+6nrI`l@^nB~1n%g@L! z?WUa~^p&VnsHd+c?qDB|cm;nXOLdQzep-^o(~;`?Bgq5ctWBj!Plc*v9V_yA*W5XFjl`LFdXhy;CQOt^c*ARj2XFxASk6UvdZ+Tq{%qs`ZsP4hRG z%gOM^waUNqBknDMw1jg6s)Pz_WeQpVHD_+$sBTlhrE7^@&Hj$z_4H` zF^4ypLDN$!ECye6peBx#-IxqrRkZ7g^x^c12N#yxOGkHXp}u)qjF#VAM8#uS6KO+f z6_+L9l3tF@L6_BrwF?W{qE~&LHkDsB$O;+^EH~Z>IZ?}onD7`J#67m>( z6M_@It-ZB)@`clQYq@Tg{vuRuXJ0uush&oTb<_28?3bdiJv$NjqH~J9GazI;piuq@ zq&Io8XJ0G^C!PdggawU;F-$;TAX0h}1L*hVsIT(>8dwFUF9q*Wa5LS^c|C*oYB2{? zpEzRZ4VQxy1U|S@K(au?^2g>z8Ig|#`%{x~Y8UNJ6cb5qM;M02RuP2L!6Kb$I+V z6@lxXOWuDulnAh`uq^J)l(@mNR8|pPdCalXlOCLUU}nt%IrqY+Jqy(2p z8_}bz-1Tp}BmF8d3*<=#`F9uye&AkC7e(&%>!0&NZ%6PqgWF(8Cdx!m-iKTcb=GXX$0&Hl=l^ z{kEG{TKJtXRMCb|-g&?4sOJ!P+yg4vVsrkK9MQG?&a61iF)Nby{9tfh-Hig&abi`3Mu|K!e)#xa6sX+%NMe7r>4gnq1XbV?;|GbXs&vSs^S&kACnw1i_89IEb;#}#0L15i|j5veXGmsRWXb{;;6x; zZ>#h*D?cny$Kp{O8W%QX2W>l&-6tBq7NOi2UoNQEGcQ8RSBQ@u;aNa!_`U)q5R2#7 znW205AEUCAp7Wf4X6T^I^4$|nckxKmw7740w682+^{JU|=ST~cx7AUWLZxG9VGWz*bqxUJ-+TK8vxvQ-@I4l@3gGB zw}G#&M+qUq8gN=L5U}YM*WRz9DXG2743zWkNP-C<_q7zm5@ZLKbv3iRNpoK1l_4Tx z7>jZ)Iv@R&5H+0mWyF4WJcF($P5yJEZ&jfOE~VrrM=l+p@pj~32RtZg<_|T*C%;VuxxZ)XsU|pmRfV5sdW$1>s8)%m9j?Y4+eF!9h4N_Gvmu^?@MmE2eU`n z4~6w}rHy!7`BXpdP!Sa~)?@0AHpbi(z37qTsCJ6Qa&`x$hLMRCKE_$1|IlGn&VygC zm7DoAtJX12Bp$r2vIJxabq#%iSmpa$t0#HqM8pTu zazp@IglZ7NHa_wWoF?LVJ&6I+O-u}->f_h03C8y!Y2KLTNnqA^)?EQMq}&X*2<2Jw zXx4TvTNgiazmFa5fdWz}2q=Mm*!<$d0ZhHX;rG4H6U+IeqWGi@E^7tW$g%Io!%9KK zri6{4bt~|@J6dJ0+buk*Nud;myT5*}-#Dx3ymogaj{53T10|;AX=`fn+2+MHrVu6} zd_32%S%OOTUulzD2Z=FCHmTbY(Bx!YSk4Qz9&7|tevdg$7MI9GR3}ESlgJhslJfCq z;(v1F8bM~4oLorgPk3tTUX2`55xVc<7D3^lG`-s@eIG`3On580z3eLj8}j&SY7)UO z^dbLB(!Q<*13|SstFzHr8sb#KHo8u5Lu!>^Y{eF4a#f>6I`LHNDAzK_+FiMMbPZ?u znIoOq-SM}C22>iPi%HBhm1T6JQs}iBwQVPqy2eZwA%0tYDnkWx>cQZ{Dw{{vm?3fv zZUf@Lz8nFTsInuV`?XNz(<;Rt%OVuqK)L~5;9jPa$_x(IV;G_gt(778(z+kH=qfEc zTQ#Hrx{zx>&i9S5X9HwFSR^SEg-GQ0qbSIJE+C<^&=S_G@wQEd*B%~9IB}zEQt7-Baa)z&V>*;X&3@^zW>p-s0;p9V%D3g%?~?cwTs~tXJUA)FAhksF)%9F?##~kQ6eXiHtGDABJ0Nkt3og0 zj`5r2H8q30Jm!?}=_$#w@(dK;GHi??Ip0%J zabYNI=ER_mlMGdc$H0x6SwOmVi3=B`)FQ#lOSUROC|cVG!2qywqN zgG^}0SgQ+VLr$|vpfm7V-ga<2r8o%>MYmsTr+XxVCh{?nZ(zqo&0wB|?DWQJC%+;o zjqJxMiZUt_ff6r5M_qOZW|vNJtRQ^zn%@s&9Md?`{zSMYREe1|Mlqa|`fJK+jGGJ? zwNZRAC|vhU8P1xu;wCInyOBNz!57=#OL=7s_IC=J>c^#jrC|vq>AIh0y3_QvTo#`>=f-4U4rhMw_$gC_8b{b)Y~oY_Rn0O z&8^eo2c!t$WDxgf-zE$C39A}TDRJWBLJ@0HU-&Z}G=XXY6rnL zh`YilPN!F7Ll)@T;0;rJ3~v@}HctUg>__v)Y3xshxfqf+pw2h{y22k8*Cgp!cL9|1 zVyXxK&T5FXCfacc><0?J>3~JsCJu|*7h<}{j|h353o^hNCO+x8~25H^|sOcKdIk( z)6&1bwmKPo@j(pZL|oUHx*9TRFZa3?W8nLnm9PO&A~`MI`ZDtM$IsQ7+Rh8Q6tSyn z1iul>uX?Saf|5XlGnfgb5=hD%Z3AY`H#R(3FuN3-HR*a?G^6Egpl?o@4^8&~d?#nI z854%nNyT^lL4Kq!pmf#DHv@hBzZtOQV1PL4*)hR|dzaccc8Na?S*jIe!16j@YN*nv zS&!SrQ@S>6kSLqc?|RDmK*5WQGO5vB8db$9Ow$n?2bF3J3gAjvmR8p+KRBl7^~||d z@IRf0upW=*LBFb5D;JZN&{neg?|(oEv6N@gRD@{8 zXglsZ#~qxFn^-X)%GM^tH3*HO01?M17Ht!N-C)X@z7xy*h`H<{J$GRDwRbSqX+c z|EM0`lJ{pKtFaD|)UE$)`#s83#W8L%6g7fZ|LMUeO zd&v+Z>fCiiB8Cx9{@%Xd2JVQ3*2Zl!-1`kTK`qdx@lw6agg0Uv$EZne95Wf=;(@I|VI?d3eK z*){Qj`H|@!xFh69CONimxT~t*F~x~tG6QfsbgZq)eHu^0pPA8Rf7A?IWs5Z- zG3#6_0J~FZOtDxsqX!(ngFt@OR4;-X`G@IQ{XR zGc?B)y-8IE(^a`N;gTSDiE~)_TKVo7o+mANS> zo{V~y8Sg4|Fj)k%IJ$hA2^(EIIr}Zajc5@4PHJFY-RKrE-luN0g#3YAv0iyA3)^qa zwC1#{FD9aiyTbyM1Qq{)C(ai%q%G>GgemJJT~zPB|AG!QSnU&27m@&mt~|0xTyV zF3G~){2OC{YQTSkP`YI4?~?{Er%bhocooao`W5DTK*P8yhE zbtnD3@QHHETO}oWgXi9s_u<@phfundD4pqL%};}mmEzMO#sPCSnWWntYB!r5@suO1 zR-x2Au%CeOesovOqM89O#l4>GPgcq0Kp*sZK&OMBgLZH9U*$8z+j9q_>!hy|j9)Wg z;tTb)Dm8*ny2v%1L*L_M6nw0(hQHv#*yCO2gV)THvKQPabue-m12?LjYV1{1%rUL0 zXGQJzT23fJAZN&8!LL)b5G>faZj>ouk!J!gZorQyorP(vFbdRSb)ke5TGcy87|we_;^5=kWk{ANW+YBb44&Ga z$ECx(AXMOi%LlElzu7tp8TH3X3@E$y(N4J}T_PHI22c#i+UNbnLB@mK74SXfwfA{n zgb}2h29k;WTB=IhRCm^=r~2Zh{7|zAGXKCGA2t2*J?%-}d4Pb)_}=UN(}*tZWQ79> zGya1>)b~gJ8mh@n0hqNOfwFe}TXEYix>e9GMG;;})Lj1GZjC#l!(7B%RqppE$wqeN zOcW`aa@exCab=Y*D{(pJC`DR=LD+KWn?>O(vKgb|7N$}Nc!A%>j00R!AqFA6bF(4g zy8t&p$iHcO)3e4eq}NznlcQoj2k^#rEk0Hj+z$mEd`sO}63~4c@lTJQh&5i=Yv-YR z@d(hTX9 z`D1uf(AV2~PvFvL4C}+)0|L|9ov4=~qg6hO;uNW{RJf9omKOETP&v!ZUWc2m)dCG9 zmtxN-^n8N^)}o9ZM1Eys1^Yhh4*uhI;*zSA#v=-bKUG#7z$B~(l_ON}jy0n!!!d2t z7owmLq&oHnG%D=33xJL+e`?(LoD`X-ZCpyO=0_zu=n2rs0Mw*itoXw(=^(v^TQ!HY za*1ogJgb~s+4mHtyoZE|XnDgO&1g68v)E#g3qjn`%=BHk@&=j8PW;S&)M&2@8G5D^ zoM^ddclhu`g{Ji6g`rxMFG3EArsmT{`3U@m?aWRk4lD__=Wz&OA`{3k!|v&1pqFR) zv%t4wor(&m0oc2@B5Jw(;K98_!DNs-6&@JCB%Pqnu`;3v?t`XLoXaN4K7i78Bl!Kf z8;XXJ!g?#%o4vTN2ni+R2IKYYQ~te)RTlQu^a*m9krYtHUj#S`(2riF1?0h41HAry z9KM${$oo{}{Nh4Wh2Ir3$^N4>2|(U~B*`esW__*V!52r107-jIDVugWiz0@{qjC}K z%5i;_p+|BS&|X-INh|a40tIpbQj|;(S{X93Ju`%Q1J$L8bQ<1fu*-%E6xemhct= zCt6_ZHo@*U+Ii}CMUo$TkbD=BPD4>-VGq;vEXlzBd5y95TOn;~u&pE39MebvEY4{h0OyeP{d);%$Oa_YPC< ztk&~7cyNjPm&E|di35U4X#$89)N~g&Ui@wAJ(0SHFziTkqIFT-KM=(^(1EH*KHh)e zzQkUx54HVzUAAJ>%%5U|F1=#W*ge^WLfxxJ;4|ZO1Zcx!K58?`lzW;1QfT)tfgg@vAGjm8*1YgBc1&;-XhrC<$*)Zy^+-4cp5NiY|cLt;nPXfZRcn(xT4g4}k z^kx;tACjv{Y}n#6nPd^is|3{D!LbrT7*h#`F}0efFYO?9M68KB!q%@6`ev!1as=$$ zDQcYRn>Gj(WMt8x;IrvK70Mt0&1V$Hjzc>6hNE{XaTl9C<6Z5zD=$-7Q0<3JMkF#D znZQMlCIqMNv!~0C5|w67yD?5ph*k1k(?XBKSPZ<6b#PJ3C#}!>J6%w?!y1;+n~%3z zKj#Hc695Y^gE;&jL(yrz)oWGq)-mrUTD4#g@#M%wE%)*<>k_+?et+>;x^R9R z)u(bCg~i{@gjupy{9~FmMI$>xyDE3n$dV10%z)#EYJ}TyZUs1y@YbrSAioc zR?XbjTf1&7esb?~xr-_VquD#IoiYKonsuIn3ZwwhqddrJUZO-=tM9q@1oVB}!iayb zJ?PKRygF^07v<9A(cZR%M#KSt@tyj{^9GW#y1f24edb7corA(9@EWI%h+eOCs?OG@ zA=t~#37$|e7$xHVI(wj3IoM(V|&**+U4A<-OB5cyou!^dzREl;e=iN@WGPqi62ofNnUSkEDxr6wW!f0 zBx2O-l0opw%SQ4C+-W!YU~*3m=x~wQ+MvD%q3wQzX^oN~YeI6| zT*gTdmriXIDH&i5e>0mnXe}TB*{`p{?(|+6Y~2)gBL11Y-4% z!iH|U1(vovFb7bI&&cZNm3>a-i2)j)q$WtYS+T{UoC=(G?#KhDL~?jmAF@*!fRf9U z0Zuo2pFi0=Jm|pQ`u5EdriYcyZZ~80`57v{{4T6E)5Rcy^i^0$yx`Ah1LU82^KqMA z6MdaymM~AHu3iYdHMxTui?*&+5 zS*+< zb2ZbeUsQ=Ft-M{>l08*7%bAiz?WW*7tqThpr`s4B({cLvb1bPbSOacvFGCZ%Y{rGVBRsN5HY{>OtMCbG^YV z0&_x=+3G3Y6AK#k_%=SdY+fzYWV9VM?4Ecaq{wZQ-{dt64Y1t|n=l&s-X2g;)|diT ztIi-;rVQsi-j&(o6ckQs!Z@(CAk}MZ7I@KlO&~sOKZhG-z45O{(nuEFZSlI2&zk-{ zz;9L)aDPIG*c~BLDr|C`Ma5LPH(A!9sZ$Q?okvoponRC(nbtNF_@mB6@a(U(!LvMoLJFQ;2;^y;@OSP-VYd5yM=crONzj0qOk~Z zgv?*G}7sA$A)X6xt`!gQ~LG|=oA$pAyu03OX$R1&sm`lJL(<-E06DUKr@ zl$6;*r;@pOMM!4*Aa%^L$S*2@cO6?RuVaJa=JrN{q~OJ6$Jp6;0p~xOyMXq)X9=5( zN)zvI4`IR$?JQV(LRFJa`N!dg_!qf>MgI)gL^A@ni|okA!D9L^JAHG-=db{R;kP)-?bSXh>>^ zd(zV~o*yP}#&<1y+Ia4h213$0$D1Jjf&8iopUh$Y7f)^P(LF%~UtWxW_ww_(@(7*a zFTGTtj~A3Xq|S$GAads9~X@YKTjd zr;u!=Wu6y41?849D{O*kxp};>CSYHfNyL#&*Mf|Vk1$-at3692>q%LzQpuY%&_(`a zD=iM;c~Oa6huk&|lmebaERjC%#OaPOML;&?{GKg^FeMV6y zV)wSC*sOaR7H%4)|Kn2d91iH7S&H1Fj#UkMo8Kehh0`9=j;@RdsCrb-CdZTVW%rMrpeM*{+s3Iu z$tJ&wlhspeJ`tyCX9~xuzXXDsK%N$dJZ@Ap zfOUxRmdcmjK0oHq*ok1X=cNBrcvDy#ZST@ABh6p8K610gVSRPL3{d(le*ro6e!KA% zR>L>y>Q-duDKWzgvqicPp2gBx=w22H#E>ZNrj974IFgAgl{)HF(g-usa{76-K+xtH zUzA0D_pfmjyKigF-WCiy*g9;H2g=`fWo|IVWP7oM)JcSW4!D?;9|p7( zNFW6}!$hSx7YfKHv*1AcJUdfdT zt|{tGExx`h>}$FT!f^X!Z2ohDAvg4>ayAgMo|>n9vNzPtB$ox@?;c~Y1sp@@Y0x;I zAt!zWBtCV83-^;w57R(gGB##$Zmw6%7JT+QK1IqEj3D2)196?@Vs~(GtB?_(>~+hGmE^S$!ZDpx8-}DlcU;31kanrMb14uaO>BhTk zCvjNjET=j#z1teZ8;nEx2logiiJNUn8{k{ z9rG?x7vgS_FA3PcoM2kV3=re4&NVXJGzh8&<@JI~-iDn{xLU}TZP0W7>XKoOxbf6ce9Dv%S*wy=y)Z>b>OZYgBw4 zJgOl-!lQCR=@8;I;X`E{h5#>RZPpZaX#ZDU#}KWEgph*qg+!w#SVq51O}~c*ekuKd z?GS?nh(Wte-kQwqmE@}(~&A!VAK;v9D$!O?v6+!sZYF5%Ow5_ zoglhGFg!+Vr!-HGjxe_7RSe z@BOb=;lGtBPc&*@!Bx{;}bGyn{}lpDAqT_PxClP~R3Ab#L-dn#S|sK>qOzY?=R7px0I)gm=Ye z{d*Q?|II7V8?r+lR70#lyVoH#I8>*QcsH&7Ls)N-{#(4;N;ULQ_m`Gvm_hifHFvc~ zT@eq0IE$WJRf-=>uBjkIRuK(n+95xro&JW+$+^GY#ZX(Lb5rDYgYr0|kD`yK16^GN zIQX!Eaq~#(LrBxM)d+t;whWw3*~r5>xYghICI))^tsd9PNbKmGV(O40h`E=h$ME|< zU3<%x3}k7TZD<&~Aq?8*AdTJ zb7x8}tND4MZlH$)X~Fau3?H>;ftnr%4Z)Vb1A=4@JAUu&ZPr(JLGeAPn0^IX3UC_` z-U~tv@+`#OvRL6b`FZ#uzQNz@sWn?N_*hB@t z=tmJlAQ zX|Q*FgopLl=jGQ}dA~Z-Eqri~_^DowALti8-X(rWdlEV`g08V}XGLN{_KWYs!$R){ z@m@Pjc=ti^Hn3lKH-O_!)2MddH*K$NfUIaJnQHA6+*SS&OEgCpk~;+;S~|y*%V3b zy-mG;Y_CB@vWN0I6KHJbsNmZRVsu+qoRjZtwlqu3!{e0yYg=gCHioKy$R|;zy?UN* z6}y}*AWYB`SxN+SBr}%Z&<~L4O2G7}l7S`xyTj8zevkc2-SNDs7}Nk2WF6WKl0o98 z(CbMhUV@|~=o&4E#W!n_hPqKlj94?xco_5H4R~m=^#ETa z@Ggdht~}L{Y4l++H=QnH3GYOZ_fy?Jk>W8BD*_lRj-S=5qm?{ju!JskZ{^ zSoYD%%=zaUtNn^<&wn&)o4y&;CO5)bq3Rzhb>GFlsoi(L+ai~S&FP?T8L^wuf0w4; zfm(vZZ?jHMa-JI}Ai{UP2BImJ866y&wYn)JE=dU_cAA^G+n7i@QnxOiPvrQ}v?$U* zZC9t|RUa6z7^6wQqoIxOTdjx@)`tYrS#yM&!z^)uk>m0-TTM~JEC3WbBVArv+ib9+;HTFvnKl@4^sbv}x#rXx z1OcU17Nj-<6h0aagWV8#v&ww#oBKJP^!FP&E#0^-L)Ykc8b0Tg5yoa;dvvK5e(Crn zwtfoohD52F`Kc|dZqtmBhDWJ#`6TZ=(YDZ2j7;C8owvW3gTp>pJ4Se3cH1&T)=QKN zycd;oieq&G?3It)Hdc$-O4PfZJm&e5C52@C8D1;!gQ5s%!JU$GI>`A+mCOZ_h17noG0gA+SrJN`Ko-Tp7iVa*z&GqyIp14$3{h3IgjZRg|v$CQoop&tUmn(o^iD61n8Xg7L>$DMTK-I<_mL6WQQY%tx5)Zw$ZM-|n_8Dr|;$vxdh} z@+uzbsjQ)tGeg)JW7ptZHyXm0R`ZLNSrVl41@*W2v9Te!JlHOB@d9b0#e?5Frq_bA zCdrkkHq;-G(rafO`h|i;-z#n;zNYU-;})>~A5Hs%d@$&v*&i^_^4k9_R67n4;RX$x z%16EXS!;*4JzS=KvY7K=hjeJB{cZO4b#eHFO=)34+P@ZKSP|9|H|D?6U{o?D50nW; z+@u3NGqb&&gJd{gF6z{qEt($RUoYqJ3otyVK04S+>VfLBqose}37@kkZ#$|*bvrv) zpE;to>o!s-pVfu*#VFPMd)Lp&rF{+IK9wQr@-aW6{g3D|CTdZVrcQk%VLWfrgif|7 zsu+9q$HTljaHZABT>5g|<&K8XzBV*DzG?i9Xn$^>PX$Fm60r2LOyV+ik$N+{Jh5i; z!JDBYN}kxCuJ{W-*3Q^2RX?@O{TYrLd6@2`<;t!ocDQLM+(??B*4&EIh_X#D4*gWj zkhFDnCb(I`r|(=6`H%1x;os`bVSK;Y&d$Hq8DV&5gDt4$;QxnPM)mu-8bX)65VbeD zzdUPtD=pz+wU%uZHlu5-X_3a%4!x>cVnR@PwJ#=BZJlu&xCs)8n&Uh8zZSsRjs!gg z5N=E=E-n7=#Z3zt6afJQr6N|G2$<->)RWD9nU*MQbc%s)tA=Uo&CCT*-Rrp&Y|K$z z@acsnOkiFw(4~^p0Zg$&4xqT%Q@=h1_p^5}aGn`i{r;RQ6Wsi9#oY$@VvUW|KW%Ec zc?Z%;T!op#Xh|`Sc0G|sO$RrUF$4P2LbUydW%s*&&$3p78@OAVq`f|Hza81`4=1YK z+XsKNsdH?8zW|pzeh8;GFg}N z>KCZXZr^+^?M3bYOHH>KS_+zm40y`8gDdywAT*Dj(4sT{|8?|{|ED8D0aywYeD z8fD7GB|_mp$cNRZy&KTB2ft)?TGD_YUR&+L4ftv2k4%Oj+!`wK+c)`hvY!z{MNXb4 zM8tlr?J|1ra}+$S3`6Nx@rfh&(P^8bXKXh`XYG91VTV2V?^%d$9l%j_oy;bfR=Y@8 zTdIYTvJvyM@mP3|>G00McW-}+7Wx&TcC^w!4pA#imO6YZv<~4yDtA)B{`b>1epz?P z;L}ku#CLt%!>n~D4W18)G4#}>*>hY8I65XCR?F)l)Q*Pg=!QA4PvFgkjPIS%3Y zI=CYIr)qQS<>f6Mg<>(c^W!oHg&1?w{fO}`47g=Zal}Z_z7Vh0`uGAW@;EE%?>*j*Vu@Et{CX< zaJV@{`v2U#6z_C((9aePe81?I2bA#r&P^=*?b&O0{XiU#e=U2bs_DDfzw`Qqtzq_i zj)j@$i+pE%%xe%Yybx#+-3Mk3upX`d9%V|AJ}f_eVZP>$1-{!q;U{nH`0+)&!0*{H zxl4M>_K6puzjOy&g74lImC4(b*o%)yVhHW4X5^#gLPCt2&km*{)ECkKC+O}2FriPpN>)cG+GO^4mV5$jyOM-3{2nHR9o;0jC?X2>e*%>JvwVHLPS z(=kk)qs$CO1?P})I3Es#eaza4fRKg^!})L+cM|-i=~Nx+jqLyccZ8YdEHgvu5hd3h z0%PLc6b0&|+~Y)HWJhvi<}F-<5;7v!gM-ri5H+wKs+4wmha_OXCT42__}G^<4$Xxd z#+8!*&)-t&(&~vQS>BBy^iKjPT)*ZXrcEMB>M}a@FbIQ_oiky-d9f7k@c#>iEX#+- z5Mghp(F+z4s$^TO6^LVo-jI1lKR6n1Z|fllRtt5^M%O-Y6dkM-j%e@UFpfgW6lf)P zAlnX|(G~NJ67l80^0Pg;$E=oH>k~s7N1N7Y6H|;|Uv*vZ4}Jg#jQ6>=#DM*^PUNr; ztc9_x>3f;m4>G^s&C+i`vgU0twc|l;xcMQs6Mw)DHiLt=SElyF?%U99gx-;@+MskB zp?P7XefWncw;60FcXUJCKsc3Zn??86!2NFA=?mcp+pH5ElqTvPYQVq5fW&&-$OD`e(h&R<@va!0rPW&G00>>!$F zg4CbJUbMS(OV7(hB~H^l?#7*|4#K)yk}{P+)IXdw(%7`EZJRVxy|Z7M?#pCWoeY}g zbg~=Vv>NsG*aUT(_~lp~IMixXJ*qCwYwFoC|LAf)TWq!` z_wnKCcz&pg{@%Z@x$}QVlVmzPg7QzU@Uo&i>vca>|IY_LTQ^xnEA<;qC#P%XSDSM4 z%my)6KUK|_>((3p@OI@)t+m)X-<(~JG@EjSbykL%JP5;ym5~jWiqQAUVFrc6s2tt- zg?rK_%U--*c>&}hn!p9(xB22QG5W%LHHE|%`xB<iZGZ_m8B;x{b$k-@I=@_qTYDU#PfmJpm4YhDp&>9UlvhIF1SweZobQ|-X z$t3HPjWks#+e6WC`6vz8eUhLGQ!FkG=&pQ0D110o4sALcVp;LFT7`ZZgl;7GTo}7L zNbIA}I@VsS>?hx^I#rPuW;?vXZgh0(#1+_cJITT9b|iZjA6!oDQ+h-zeLlW>(nD9& zb(qqoLQ~!i?32XI779&if;L((@3RtHTDYYNmMkhQ>ZRNj;VtJmdZ5OyhWs^0=2di8 zFOIJ%UBee`zk0&2cRRP>x$prBpDyQHD!i(|3BO!kg;T=~%XQssWSDPosji(-KUyu_ zBSU4|J&OOmMWEjH+lvJy>2FsNf+@pWl~VYR7V(bx3~HCOU(T>Hd*Bz-c%bXYb6&R4 zuPzJh{jud0$)O*~H1ARUh159^{H1g~qjN(=f+G{o!Z2;{>H3LPcbh=orp@?CaW<1# zXi#0{=S$bO5d)<+t4}(l+un(mM&1&bRo2}w{XkPDLps!~Aj3oSi}dBqof~0IV!m0S z#LqkK6Tew^mU2|EvK`!!SbZV?&Qw3{<+Z6bK5ZCOR|9~r~CBp$g!aj^S3 z*PNB*LJkP@AyyoY=*1_GSuKLOZ z*Wu#;8wcM~3b-MapwP?6eMcVm0XI|ackIyFRqjP$Js!!K7B|^d{IqUdSo?lBzHyEA z_t)FWA!HA31+)R=(zK#8h$b6bn3xxq{oq6)$NA3-6ZgJ7#P}``Lt}R>$m4L6 za&EnwOLh=9?5i31j{=3x@|*lM_;BX$1xw2PN996pg~w8`>EnNwj5}=3uCeL!UQ&S` z+}n}t+w${N>qZIhicL|Fa--W_y=Tb`5bmpA)N*oC@6rX7=ZXZXxG3nj4Km5(p!8!5 z!P^rl(tY;ucit}LuiXm!KeQ`&+%+cim)-RRIF_V^j9HY!G#+Tah&=0SThqUkU>Qjr z)#VpkSMko%zQ5DZ8YH|Eg||8=N>69AJ!we)ng6X>@mjG|v0%_iQ9bC)2IY z&H52_A38i$B%QNc@B^>|i^|9xmg5HPM97*K@fJ+gzJu2}xf+?DDAoe24$LMk(Ercu z9x$v7zx_o6XVH3=Uo>R&UH`w1)K5k@L^qrD6N)G4IGr}m6TT21s$1EQ>oSs>WdfZ? z%1lzEp(nCsg-T0hs&#K^@(g+nV#JJ-#m->G&s8|vl_&50QHlMd)?;wr3CiE|w{rCF zRJ@-DMsm}A3pq2hdRyl8aj}#ghgDUy@FGHdQ&`ma!5^-iQB&pd__fc!@ZHX5FMdz( z7j9_L_rp=2pJP}o#SJ}L&X=BcdA5-AqAIi_7x|N1X?bEVtP_@%IX9t_b`Ua@k1SOa zhqG;}lHG3B87}m%K&gGD1nf6!JP$tiEqgkZF#@GQIskgJcWuJ21g>BU%=y%zqMgOZ(PO>-qXY=j<8txTVD_GKmN3PTH%4^2^cT%SflmZbmuRn<+)9}Oj7mmvC*&7vR}K6z`dzN`iB+xv zSItWD_->e1$=q>I8`A3pr^w(0>s(fE9tPs|d9@LfBNz;yGo{T|cs4T%6F)=OTKyB4 zKfquy{raC(0ptRx62K5R-z>ubW)^z77Q&|+S!FK9!;u1e>H~#;C)^lc4N_ymThKAE z7ccr65&VmhetFJ;Us3m9&;h{d0FhK@vv%X~t#g0;FF6VT3Z{0{aZA}Ib)?HKwwI2;)a?`h9xX{nz#C29~L~mDt%?g%j-;bZ!;p^ zMs4e)Vi86onxGCb+r_Vcg>q_l&NSD@JFGFsnIub*IHR~YBcr55^ct#eanIT`P2Wy= z^hhC@RXRMAUobH_C1Ap16HoGZ%=#BL7KY<#lR?89HqEZjM~b*#yQBBmvJ-OhSay|%uH>XvA&=!>xNiDkm-CK;XIXo`PpzoS`*VI5$Om8WIpaT67@@_i1H8*(atU3<4V*1Nrb z#k=LmT$;gAQP?oQlCG*LVX2E-yk)Jc=|ML?@hPrJskNB|$^Q+ln!7#|9=+Y`?^A`X z>y`sJm`O^&Z&%x2aTk88Y=4J#W))-`BG@@=t%vP^^ImZ^p9w^$H+#Ys4G zy)&agJJ%L!k!AA|gdU7fh(?Ehr!sFb=I(p5!N+LLZCH9z@2f96+c*l3i>UR^>^L@6 z`GDDNCaN{{VMXWXtm!*zc z+XHI1FFf8pPuvsKUKajUq`7J~27`=!hMhL73znGAF1(vidM||Zedx?kcW94kq~4^s z@n!vBMP`95yJ`Qixy`LJO-)nRn=v^)C0oIcQc(Y?iO zPT9Mq`$Gsp=GT9(bobL7lJc|6_026ehMK3UozAgXiH@ja8;{dc2I)y$X6eDM`lT2T z(@L9EimK9=pSh6=ey90r%t;G7HD_sPl`E?Cb#X#>J|>&W_6`#11k2z)(=QsXXywh)J_kgR||#dsVGPm zj&ey2fGU|{|1xzcL9P4BAwP8{@31X;#1z35jH+g@mIZg)WJCTXmp-PNx>_FGLrJc( zg~f7CyFSLa<6t<7`Okck}b?%3U zf%cmU#e?AAi2H7zd(UL#`Rf z`b5pt{ZqB%&H|n7dP?;Jw1#xY*0a&Bsp}v2oK4UN-OKc{s3uGAjM@3aqF2M>M_oC` zUhm3G)hSwoG6GLZTlZw|Tf&SY?n(2*%x|W0?-`UIdo-MHugL2R77%7#8atCeFh}kS zI~p_z*N|2aBnD0e;Z+pWN~*CZ?q{`6B4O?1KwO7wP^rq6*AROxIjogfAxq+x%DtSWHLYSJjegy0M%`}taQw+N?olckZC!BOM>u^UO(DvNhC*> zX36fkSucM0Vo`8!hNUl;mkqDpSXu4*L_Lual<^L?Vf%G&O_rAc9@>TywIFwHt7SMAdc!$m8>X1~~N!w}G>(|+VG zk>8#pZNl^TlsM*!(zf^f-gL1I3|k~9dp)(xG^Hid(XB(hMo}|u6VtRwMja(Bmy$16 zw4B}`57gBLZZwpugxZrj{lH8`4tZZvr;kAU47oiWjumy{MTNUSNMDiHdf1;s!9QRR zn7nY;6MaT>R0Q9-d~xD0weyX)wHn^PS8c?`AX{-~Vd6ah={e~2ijAj=nE6hZ>x-$1 zDZL4X&rMamMeMvb)SuCT-5a{n9k%19U-vOdy!uuY)tHtcFD%WEQ7y+sHTN#0wL$}7 zDM+s^nNN0W=;N65>0!Z;1cc`sDM4Bt_UGk$8LC;o0OMV-d45 z$iX%#EN(65uWtpjx32D9FS3K+OT|?$%wg`r z=13wp%96r(`1ICXxiubR6;?e+t~U;5e_@u{l^aH<1~OiiwiGrOrlD6m7Gt}tp{#R6 zK6ogRc2rh)bnW_FnH>>ZCaijr*lz63A<@yIA@mGv4)_+zdK78@f3g&2^(iBn6nfm- zl7`~;O5v8w$pkX-=vOa9F6Q~qA)58;LHE6C-cIjHwfiSoQgY%VLQ3DoEXEud$#m=|3x&$u2U{NbRm z&CT-!Nwh0Lqt5a{W<-a*j&FS2*Ah{U+U?z5ts(1)gr1%W!zXelW@r=sE+_&yKS$QG zx=tRftKD$#)vpr<{B)hz${A>-;Vq4r{>g^3Di*XRO^IV(5ewO#Mdp zh6XFHMY==CN*$KJEX0@YlX^t~%z;5L2QZ4kq&ibI%DnI}vPp#8rD0qCJKPHi&xsAq zK#2k_9|~qLcDBQ4P{X4hRWP=>8ivIfo}N!ML_K9K)*tnF z;rB8pZdxvSIw?FGUmNCCz45HbWx*e17*ToN6MiGf6j}1W+mlrR(M8$69OWP%o@*D9 z3zf(YWkbD6*;ud4Z){Ym8k!Kv$Bwz>A3L^<528961pL3R$5Vam_#=0mqdgD%t9#dp zykp0n;e#R^4TF?z1;^$O49u2;%}sudtuod1QmSjMP25mcOshg8?$;~wHy+h*)bCWw z|F({cjh!4T?38-B;p^aM*mE!+p=9LKb7ZkLpn`iSyhE2J>B{>A$xvm>avVHU$JyxU zBA!3v*!#0)b$h5@aq zXi+R1!#S#KOf89`&=_S57+uqpRgIfLZE&tk4y{iHBO*p#5;JQ$jU7)%~20S z>O{mOdV5Y?T^k(QS|8InVpeyAoD&G&6r#0ai|B$=q^F-tFDkYa!wb&^Z~B@Fv?IlZ zEzjNb6iU^58BNOP?yy0iSZdCvH`kyJ3fjMLal@O#Ci-pU3>-T#ezFUjoj;q%xHiHQ zFCI^kTU%-h2R}Tsc8+0}Kv5UV*7AA?SdwO*5Ys?HOpKsc*K=j}0C@MNX)zvpXwd3{HVZ&y)7@xtxhNB!4 z+En6{9F~6?JTgsJB}t|+qL`rq__TErACd`m&1^TQBo&ouu`^lk6(#PYm`N~qVT+5W zykzjeQf*=1ksh+7aquE*aWc_jKedjq_uGH?rb>a2F-n{xh^F+X>+>73@YK?%0nt}O z9e3HLV)QrKS@5;6=BPTgWn--4h8rTBAgBMWvi~j70`0q6q5oW5Bl%m=$`!Y+amR+R zYd5Bc##>#IPcx8-_(K`WspW|?uB>q-A`w5Av6YsquTd1wKC9=WC41kw;}rh^24#?o zw*7z?p(v4zKqV7hUBq{wgXTJ0eo<~6QQMYjl-x8eV*4-V$FBbsOy3}Mg!#Bc{mE>N zi}5UWE(c zG$6atz>4RUrj}OO{#ymYQT6k+JHvhN3?SOP^A_aWo|UPFpaxz002jIMtxbB!2doNhC;0;AE^CXQ`TXbe@ov9 zjuv!%TXgv8SNGxPUnx5&LyUuNJ1!b|A5gJQ;``1nx}MwHw{ZE=VTn7TP+I+A+_<>L zZ?m{JUsS*Q2Wo!KFSUUR>-|mB236@%w5#77M>_T1b8%BQGmibk_GOyjdSxg&{MRY_ns9=Q7? zwVmyfx&oRj&~#qNo0y?ZBH>bGZjg6*bDmP6AdJ=3u6w3@Zs?L4d@|Po>-_UTYLX{X zqmJZIla`Yb{1HXz;P3jNqN8%k_K1)TP5(|(`NmaaGk!h zMtI46R7uPIne^6ssOEJ8=1%IFM*Khd{4L%;QNX%ce^vQJ=jIG+U**P28N{Jh=j#^$ z@4Pt?EeXEqXBhTLpx&YlY>A3$$rc#4OlB&kj3$UA$l|v*WO2NK+kJoiykAmqVgUPa z9{R&yH}7BI_6Y}FDYRINjy)oD_PP%>VH)7HIp$>KLgUblyQ1rs$^D!DXF&8qpzTp? z^QG=1jtancd9rBzPH}<7rWkgwXh7s<*^qEYWNx5$MVmq?R}qE;0!?3=cx&<_In?AO zZQdk{g}@gE$dbety8uc+wZB(yR2h^+i=sd0UYU!aOS0q}X#|O`7%Ph_tU6W_5z|eb zB;>*)z5CoV8tWREO1Q$b@SUGIZF+w7LsNNDDn(W_EC0{v0EiD3Qb;!otfq&HcZUzB zWR6bvw5TdAvhuagh+p7%GlXZ0tE3GnG>N~5PqG4yWoIPOid&HR_xuuhd@KTUuo)K# zi-wlbeN(ej*ach+CMT!~&4Vz!8tfK!F-%#m!IAQL1x>tyFLT4-OuydYTjZ-H{+nUm1qt&;+{Cd6pG5D3hO!At z->aQP$^@}uTSumsh?cX7Z{u82-TRS>g4#KwBT~H+NB5yH%&Etn8CxI+a+$T=lQe7< zvAQ+43y6?gu9Rg(;U-l%klbDIRHRJ}*6gGF^ao2vLhu0Yf-?xXmz9Deh?6P24d^Gu!bJ~Ej zs{h4txit6ETmbH>0W<(78V_Y8+1l}>yIjfWBzN=W8VHNvHhTOsE}NUJIA6Y0&;j9HMCbi z-TK-oDky{@ul>V|7VvFd_H_JE6EYXupCj?aB!H6o^o{f1 z`Ti}!roLkNSDa8g7hM;(?qeIJOd59oPyeJ~S%j%S0a3}W61e<*`D6c70ltA)(@=lv z6`^@4sjm$Um5wk!yDGL$?a>+fucmpti@gChAccs%`Ooucs76Y9Oi{AwC!QR|m^@0RuWKL;A3PqB`e{h+4?)og6?8k9Hy8Df-8j5vbGB27u|-!ngtPr^gyQ-Y?s{@n{H zK1uMHj=F)pq`plJTMhh$#F{m=y(gb2#YdZ6F7$iE4*%ulTd`~8<}<6nN`1;}ED6k6 za|27@q6fk&h0s;{6tQ!e`%u&91R*rILHjgA=$+e`Fj#0CM%2OvdC8NeYmA!neBVxK zSUzf>NUhkJ9vRIR9AZp_6pZusWNww=~PBl>Bqo@TDgNI?qG?_z7K7LyuT5w zVf@ftx>*s|6nFtx_ZiB?c$O@p&5{l2QUi}%FtqgJ!5t7yZCN@S>e`8>Rd8A=Cc+SM z7}}$#44fOlipzhF{&%J;D)j*xDxJ)#2Xyg2xTdhe4f{lR8}F@l44bMdcSQ?6o86T6 zjL`X}r+7!?JbU#yw)XkyUNOD8$E~)5ATT@_(1vZJ~-{O=shKgFU_hCd%@JZ`xk#?#tQ|~ z{`F#@(q1m!r81@$QO*PS7Q-u4N@kuNJ``S|1d!e78G9weVl3K&G3*Ra^3=+Wc_CD9 z#s(5`tsz4dZ7XZcL^%GUo_m@;7P#NIv6SAE-t8Ox{p)stn) zFvBc8cvnIicIY>Rj`{6Whz^E@t3UGE(cRF=ehp_0Cl!dxdRC7dL$$@sqo)ToZ0?7o zAW4siox}ag4@I_sVcOh_WsT~un|dBp8{U(XZ@6Jb+DHC<|FQTT*3_#T_vPadN127$uu$)WfzEQTTUuf90N%-+Nf@RFY)+jc_7L(` z#=41E_r%{0+W8Q+U03~#G{#@L1YVcRj=b3Wj>OLW`1L7kLY@phOGN$<18Vi07_8?iR8V9WXVlV z4Xcf$u@*p3qG#6bN!XqVePsW#X@}D*^Dq1)-?XB1DuSG| zy~tJrE+Ehz8whoKt=xYQtWBQj{BB03i>@w{$EWAOHN_!)n$tR&-O9P?bpB!$ zrheI4T!^ZT-a~aOck-s-REKF+Fwnu`DtImIs4~N0d!N~#AU;+0!#>D@YIVqI@w|D! zO4mssZ8*-G7*FCAoMbvFy`YI-sDRcDe(ev-SA01KuuQAEnl#RuTa-S(4>P>fgfP6^ z>EM~<3SKg}l^kz3kGTt*r%Swf;~9C>+e51H{&*F&IbtEEkbJg7?)z#UW-SC>z4hU} z4+c`eXFR>Ip+RLmt|1JhgnyK>B*pOWgrqcxDUbJ*!B?8noJ14S6kW__+`X`ljsY`K zSF0M;Jk8Z%TZEMtrqIsPzY+}OG{c%Js9LV#QuP@`jGvNI3-l#~s38N_5QEL7Z)Efew@3E=wON~=Elofp-$di8W}^M!!2$K;qraNB=x8SE z=YGltJqXKtu5Led*QH7CCR%P>A@XcxAMg!6v zyJAXQd?IQdHu@E4syn>x|x0`h|le6Z2$^qR7i?dYePNiZ42P6DN@q=~coNzx+;L_6u z$Q{U$y+QZ3r@tq$SxnEnzg?^}Vkz)mn6&A|TG-@12pP6+M}$(Wilj_2$kMv3%1R{2 zcTq_-MJiE1EtMx`i52;O$X!-uCi%#BQj0ldKyB=QO3Z~}KV-U5>t%weyUb1s(~Od_ zo*C~==Oj!Xk1gQ5kJADl*hKW=ehyv;8#%kLAv7lNs&~}NHA1V*X`Ak!{GI3PVQX{R zahGy@B?CoXadB*eOmOHN3in`N5mwap*mx>RsHzpj6#4XE|V9GkvOo_P8U=g$M$Bkm@XzTvGRT2sH&lZqq+ z3syIan58v}+|AhMi0zi=O@7t2`={GxWF=sXS5u*({5>9a%l11qh zMN6lqYGg0fKMl_$?h78;Kl@P;yIJ#RqGYC8X>U{K5Kx`%!g&^=9AA#sI)`oEF;pXZ zi2@}3z`5`y?;V6{E7Vac8VHhxk*_u@-tf#IaaR12X_kDH{K!1MxoYz9*lOSO{XwVd zYf-Y+#$q6H)}m3I9hlB`LTE#<$5JKM&=8_}_T=g}NPW|^DQ9|!0SI8soTrGtb4{|H zX(VQ|ZcZCK=Vy)h{^oxDg?V7mE*1Qe^gJ;X1&{X<7|Keg-?=F~Uvt;8p?L$}7i_rg z)wGFuS1!eI}bvkRk~-qHx%Hm9*wL#XD&b&LUw zpqVmz0#?hEae3&U{bSZmyW9bNXOI1z8#T3$tE+&_(+ru@|N6WH7hPF zIy#o224p@!H?t|BeMrJn3|}3BCYzpfLl20Kyu-PYYs=Ed7T5?2Oueu@aPN)Ipl~b= zMs>{5_RCeLwyeX*#0Z8Ep=c6#*f$jKjfeZ4tu3#ukj#iGVwhE{x1?;pGM7TK03NkX zT<7h6E%ER8yx28xkN3LZKGXn5wJq-kyE*3bg19?QB5axXO;cR z$?#%1z>1Hhh8ZgIn(Qi7sd!6%QD>|s1o!KI{#^GjjmOb75b2jo&yCnTClvPQFfb}; z^`!n38{eIMq6gbAR|}0*NEitX4u#C5#!fl0Pky#0IAd+F*#U`w>|8pWS1{5KCI3)v zI1Q7T^=s!`H`UT(Au}bR>w>^-e>yv{7fS>C=lWI7rZwzG4~Y{F}z`~x5yLiqhqG@9{fL`a{I z^3ZiQ>hi(3L2MJH-NDX}XxJ$&k?_L&122KgUKL0uI7O9%D#aX|wo|zJTk`Qn{b^{L z8_klq?5LAF{=}dE=J(?2w%5&vd-`EQB++ErXnFyZ1ECR(M=~)%?i>X3cTIea3g3r| zIW-Q_qLgNz!}tU|JOEnjl&&#M3Vz1{c%14Oh3j zz?Mu7T|(eBp~%pxz+6{0Jcel0Ux)~Dt|Q9)8-G#A-e)^9$d5JIIdz=Vy*H$`uKx62biu2ya(!OOIng z;w1Ps;hCJG+DJ#YBNGfd9g4*~@@2oz?gY`=a3F#G5t(^NekBW3>C=fUMSr9(V`}@-dii|;^ ztFqw5X{u+!D-Uk={H1pO<6hB-$WcAZ#EYAFmLxsVr_?V%(VVCYSV^$t7j;J(bduZ+ z8-=^P(*9@b=YVHl)y>D;XHNTuXOLYo2M+om%Tm_@YlW2x;n0!k{X;dg_Hs#MiY0A$#M ziAc?*brjOI^Nm-?p_ZuM8a!0db~01Pu-E1;MuET^J}3Hf$Yk@j?{8@|aaw{?EJoC6 zaG`fJa|1lE?OKnCb;?MQrjf4bcHz1}F1taw0Z?oDu~aVH1w&fD6{{YAUoEClca^n8 z#ggF304~dsr{Wn*0%Wj0pB?|`_N}=;9(>MTZM4BaznXbHc@@#7mqL#thSZd8lr-C z*r$;HMEwCUE*1m%!JVY5Z_lX`?9gknJD*v!9`(tK#Liy(j3ljGn#`$I9R88X1d{KM zZ5Rt_h(@C6jW*~sMukdo?T8l@8-!6GqbSlRlD)u8W2T3_UeGm@(@H$9K9*FLRX~(@ zG1!VJJ#^x!B=D=tAJlcV=iQr=&l864d1nlBBFWn}HC$h9FL_F*yn@Fg^MKWtdX(Ds zV%D9-=TI-co+{APv)`PTakX2&`Tn_jg-2;-LCCn1&bW{p6@xdj*|&g2ii#N=@+jqq zLC6aqT*ppzlX}Y0RVF1%xX#$0Q&;MS=^!W7_LU7~Umz0FR8fhoIAn|ehffK&^c)5t zfetwHvi;+CA#D4R8uTa=H`3QabIj>V(ll%Co&bqp??&GjFep{+wgCnCclWe%b+3$+ z0F?|XW?MRXPX>w|_VO=eT(Ed(YmvBUQ7N@7uvFMAy&DlcL_q){qwIUCcy{Qefy1v& zwm1h8KS$fTc*k*+?Z*u&@%vt0pL+Ek4mxXlS4#aUpSE6B$Pqls4Uz9)(U(eNd=aQg z{yuNN9E2xMU7A6qUyiXv9JoEuA!csfm1Qh6`7f7cgrphSAdUu`Op#&KQY=+>6zm%q z;cITDJKbop_$|O`UxzUlVTr9UQfLXyB$hRBv+l|?non@dxPhJ$@@WR`r?yT-8g^>W zC-IoPV5v;z2*FEfic#6p5tC}0+bdYJ8vW0>oKq~bcPubPr zz2I$T=!}|kZ*;X74f*f%+_qBLu#=bzUcZQy6@ACWayW1u2Zlp0;X0?sb$QGXaD~mj zWt||WB62m?*F1sd6mmlKZgmWE=kpU1l@xyh8!<32(_$dKlb9Nc4ONb?qU9FVfP3~v zG;P2u0)L`b+8}wJTYvDx$XQ>uKf;e*{+zh_M!{SC^w8llO8gL92nXGlI%Ulr(E78C zM}32OxB-3XA;g%0Yc*u?KuXhW1;u8tTLh3QF_j=$-9FUAjFRRETO=T-}vYTn< z_Je+RUt_{OzTB3Org=UHT>O7Ccs~pFmB^nAk(K)cbXN*y%}xxBJtVYG`{hf$!W>F4 zgkcIrTD9j{2QxVIj>QfS6#m6+zf;)u{g?D*0&UP3jt%xUjwR}Mz~|cz%745tK{$F+ zG>**@XwFkCws^OYXOPYN-7U`CweY|DA0`Y~c=}u2@m5a)PZU7v^siPqz4XX-!PacC znGBqFD#ultc)#y&LxxkW@JKvFBQ7_mDZ?=)ePl2-^+w}I=~uR&UF4|8MdS!l;~q_UIp5;;m+tiv56H;DPvI0f_XHR32q{GX?Rm_Ud{m5bg+ z`K^?WmhUESlN)u#!qR>-5ES1tTva{Ow%d2AD87>Qda@f#k+<9C|uI z)D=1Wuoyy9!A(F28lG>i(bn$b<4tZGnQnm1lztvRAV3A^81<9ecPwh@8FVVj`Ml6e z)2jtutNsf7mggF0FNGwcLXK@?q(83dSULW|GnucfrH~zs05`UdD}bNt1k~LRaWMQt z;H3!PX1N+D4;JbVT?wErOJlE=W36`~6bA`QA^+Y?YRo$(K;W1pa7p@;C;!PLLFHa= zTM{hT8u#V?sVYW*-SHb@7`nQ7w8V5*uj29sHbKhw-Ft+( z-Z*fCz^<0r2@=+PTiWq`7)Az^2mx1jB*1arWcS^GF2RI^`mhqO!|?wW)kl27MQQV& zI3A8a8PlxZX`%?~dpw~Lss#Rmu9feJnch?z4MMj??voh?Ny-+RL(NkycXrbD)z1cR z^0)FR6Z5B5t&i^DYQptWJ^I~wFA*!lOknRHN;Hj-y9K4u6%^YOJ4?%~*#&cRu$l{F z{=n0I{wh}>!I9f{Lq+R$bg0gmm4-5T-NMjlXEnAQ8}azsNsm~9y)VVrCk5A0ll`}i z8?C@gem9Oo_enJ9FjM%i1uk7F7>So$sLTd23(`Yc`!8KVJ#0nn`Lv`4qtOU?w#)#S zfC)ka2R*u$Ct=}LJgwpK+%s2 zs=?(sOq7tBBp#p4f$i0d@Z@E3Kqbo9*`hH9l9TD|K|HXit@zgL9*4FxLe+v06 za&}5EiZl;w&<&f&&1nKy@(K$3nEZ5#50!ILd?@2kp=Zs`l8#}|))78_zy-cER3p~( zUL$rkNi0r{mTWKU3XP||x&_MFNu6nr5&+WV-c#pWxb_>~H1T@HFNOD_O2 zn=QDmdZsSM^cfLd2buxw`4O^?@#;Y3tNGBgTBfRP*=JqB1FThcH>uH5l}i|q1#_d| zR8p%hrO@-ScdPhgj)I__e258c8*rpj1CxwS%2f#Lsg=i}LMLOB6uGJP+g`4#Q;~!L zCI6#si~6t=q7zx3F*}P7)eBFpa_}qFWwNtw;DPY>^biaS{TS>pp?vZ84V+f;U+3eQ7^-fCFr5QTN2WI+*IUS0>9ewJS-DFjfz@NEN%p&7+nipuutn^K1cV}h?+ZQfXtp}Y zg{sSj(5{8yG6^=ZWMcwptTlRkB3m^$SzA@n%03W$t5TDR5rrpt#uL2l@w1pb@4qjv z#Di!T6Mcwe%=Pp`60&I_!L~d<&t_>`(mRlv6eh5oj}L3NpB z-RAE3!nUwx-+rZY)Aoen`12F;G1BtP3h|78qK_GUwdx$@D{JYJLc+T!RDv@o96>t- z)y}uKaF{#<$C(E7M9YZE!g(F1W&S8xL4>o z=UB$5tKj8Rvr7LozjWYn$HRD(*Lc>@T%GMn8$bU%h_Jj|%7zf(gQ}n&EmV~%kFe7q zc=-Fwe%LEq)zTG8WxU8Jn-wK{e27ddjf6*i^Cl8>@6U2jkc8V+=^@vv{VeeTaDaDF zuZlW5Odb%xpu5S9?c8bb?(NqNn7EU=0~A*eM`^Kuu~9& z&SG7x= z?O^9HvKfRreHS37>~nJ4*C7l2>j(*!spyx|rBoHFPukO!m^lb@jPqiXlMaMV{|iM; zKIsi5_AnI|9(l}@0b4C|pbE=@QhvMb967YP93I8OSJm08V8OpPDQRx!je(MV>}Oap z0^E(2gevNYDvVHFl&=aaEUBu?Cmk*GLSN=acRP&+gmQO(D}5KC0qJ4Hu*#3MWsayl zdFqk{=IZW99bO#ww5tAV`2WJ)vQjZ~pC$lb`%`9ANuu7p{L?5F#M$x7in-!^Po@v` zl9=#ePjExyS6XlCf&Jvg-@NOH+)YdAac2Fv-`u@%z)5~JxS(I8xOUZ4k$m||Y_fz& zBEL+QtYIL7eY_{gNPJ7IymDFJqPTj^M3H<2(7w8xXL4Bcdr*Y4q{OJhhp|u|4JV+F z`6w6|csP_RWl=dch<9lV5DAl*S6fX>3nA{v78utnJd0;mtkCxoCNaFb`}>NCLY5dw z=-OyY2KINe#*ZX+IliAc*b+f~@z!d0RR1{hd5g-{Of4$3!c>Ev{aD9|?nDbrtho>9 z4B0*<^hp;zWrol)b1wtgsmIH_=^0R&9fm6u$=8yTV3S{}dS>#$1F@9{fN+p>cm=oA z+}9HXLSKrE5gz{$N^HG%nuL@{QW=CAk}X5~v7oW4r7gk5w*gXKx;u}I@@0Hy@;%zZ z-q(fL0I4V$%L_wbZ{eCU`j1TGo6f+{pa0s@YTR3soELa$Ne9?(KFI#goFo*?854{N zWvsK$55~onosXYAE-Z;(Uct7(iEXVML{c?iPc|uiOfE#kR-l+;mIvQ7ln`6o0@6IJHB^~nxeIlTw=pGrFzwE30g0*nN!AhMD1Q6j6b1 zCK@iUsMJpl4#QZdgFrihOkowEe1JXb?#DlIoj?p-l>+bivTV+}6~)wl=YXbg)&Sk* zVq$5DPu7n>v@7fWR^mPoutJ$w;`LR5;KV_Ja?nh5APT}t;+fYc3+z9`{sUW-#V0M1 z9BO2nc1#m4S|lRtorK6NwX3PzXy9`-CPb~UvC?%}=}ZnRgmyBC?WYJ%u8d$Gf>9r$ zOe}$jmeT?e5+DStIlia8fH*fn$ZVlo2XG5+{iqT$2^3^*?DVxLc(|gN>M<_jS_bri zZu^?(#*|>$^rqOA$>H@4dN~uih5sh%v(i~X(m+t=+J1kb6e3+R8NgsXDaY?Og>*|r zxeLjpAb-waX-yc%;{&0fEDZ)m2@_oO^?h%PZe4f2)N3?=%eiSid|$wM>p#5I8wZJT z>6wlfB04fAl~ye|h2)khNOKOzl*WGXaSuQRoPAL}m^je!<@uN8Qx-ij21%x zh)ptaL4GBug{X6F%p6^V1LXNRp>S2Xl^bx-l=$waYiK+KK>3fH83+1?s8HToN0;IKyxgW--J^`s;+H80N&vv@{&5&Eyk;K?=nmQos8DMhC zB&lb{_$~IxP8$w^W8=juT${u7%-s^y(TxjJ^dPLgW7D?pG(Zt#-k{fl`5A67J41lr z+NY23NhPsYkrsQ955MD30;$P6C7i_3r&*YTXfYY2Ia@_>WJtBIgI3+r@1->~8&v8M$&#kY%cOo2k-Jl$MkV|Kh>3I~mq zWH$lDO9PU&TTDE{EF5K`IPwRE^7NjA7cwT#lPsjX!7Bzxs7cw?A{_)hF_d~TlTEC- zD1gs&v41W3=@`6(f6s#+A|lMaq#3~jMFb;C)>ZyCXL6{V7uYP^>s8=AZmgWkE!FdFIoqU!KayM^l8>s7G0NxsFzMDbMm~dXM603+96CHFW)z#U} zmiF2k-XaLUgkJNATUXo7%thypHCU3j?U0@6(knI@q>~YVr1`*e3nC4VX zZhabl49CKmoX$b?;gNTcV%u_bAT|+F4R&R801pCJ?33=3lq=E7k9ZIeKHgicLX8t8 zb#XqqQN)ib{Na$fEWbI0akpI`v-PT0Lf=9EiA^e?#zA+XC7M37E91AXED4y->yCVe znpK!Sv8&*BtSAkbQTD>toNxCRnAy{+*xg^hIZJbJ{5Cm|sRs|fjjLZd9F~jgEIP;H zF+)N&3*&E-M8Fv;^eoN1$(k9c%54#hP zg;Ym^{A;J^py1E^?};Hp&$<2}efC)F2JfcMnq~t$(7>W&hrHD`zq#ty9ed?K%pcIj z6RV|O)g=&)dUe}jd)99#EBj=kKMQtj=C&dW8cCY%G+Kp4SiO2+*IBSS!H5MI@I1~_d`8er=e4tZJ3 zn*5N*yoXMqv;eoRcGnKgV6>T|PS3iI`UUFlHR|YH&*_4_G?2Sh`+|(peHf#YTC^wL zVE0?*ZYcz@Vdl=0nl?b~51-n~kh65L1?xF)?rfyNF|Cu)xKBeB`7C`E&U(U|yYKKX zf}MfQ#fIK^mOxJEt8d*%?+Mx3T2VzSgW!ra>gX^e(@diwTMa!MsjY-QFFC%?a{Ja4 z=)UMfT;er?dfWO%Cu`w09|m^3IPYS>95Jgb`GU)tBWPDct7pOP^>fiiu5rPXwA#hA z+8q?jxM-(mKBFHxd!QEf8RNr@K@TkZ%qDNGB>FM>^<7_pO0I-^hMX4Cm$_vK;@Kmw zsHx3=aSJ5LuH1;L!@rNLib$jRtagYeoLK)vX1T} zL6%+`@x+<*>CbnSjpNC6UjJ?i&|(s>sPgra+xKvr!RyAufblZ0u5z&=&9E~xDB!~W zfGzSGvo1juGQmr6k4$_ir5v|H}x=Gl^dn8{mV6M*N2PmMJ1gayyrFJj)hzwCpNIh|zzBOC71olLhx3cA0k) z36N9px|KDe>tP44E%_%*aY2asaEyvL6g>KX6KeB~E@>o4#sb`~=#qce+O=9V*!1YK zFSjt`!?vS0=vswUEsozJjbuP@jVJR$*!Ok&8iTL*+nvIn^Sf4wuGHFwrwJ2F?Sij2 zHa6BzsVdVzIavY@^zZ~s5AheSi4)cqcsKv5i1n`jYbjsVMc3we#}=oC)ri9nH}{+! z|NQ@sBwkio=0C@lXN6G8?-Z^U8`tc&+X)GV0oaL)4u$t*YPqJ4<4F-b5Iyez z>Q|A_?VgS*^@I~P-A%~b$zN=`J;JATT#?2^Fl$5rUJWW;d#o(LZoH&rI*29X1G(QQ z=^aX$J;enD{YIusiW`O~y$(%CpbfM$HT|Bf>;-5yDENj-oeiWNm^bYh;7l&jbr1<= zFt_}RvATtnZy8rNw|X*^23iT5^(XRP@3XJWx>T7plJ$DE+YVUvZSTIujS8NF@4WJS zLLV?wgG$e`f0>d^c?7#Lvz@K%f2h%Q|9t)OM_KNOG&}-;?lUZ==hsQFr{8VA(iVr$ z3H1pKnjj1pX44kHUWSc8@1-jGTnc$=SeR+ zF&#{LeU5~et$h(*)q)M@*4I3s>^^gMtHx2AytNb^xb~q;$rAP{nDsJ&64Q!tFAY8Y zrPEc4dz;n_7CFB&^hbd%xfZAB|I6@H@}c0q==pbm5kf*=Zr`6!s1ooQ1}%h=gz*~H zC>g;M@7t+fJM%P9`u^cH{cTYDukU>B`V|{cRo6JyFdq4;23nT8aR1&inyNX~2o$*V z2No^Y#bzsXwt+pMcIau^9i$UeGI0qCq1))vkLM!=oPTpBHc|$^OkI%t2}cowSk^Z4 zV{fv9@28FFf$0+_s)TpT;nC+Ck{_ul)ucbFpv8CRzgTh5yH_15;4i2Fijxwx5Rvmk zGHn&cJ1#ykNYE3vl&4&tKJ1G1iewnrS#NIowrU=}jjr8KSzapNEX6giuQ?7T9QGHKt0W<^p*^$`v+Zev|;QwPdIhH2X3^vW7 ze0`Z0Tw<{!&!H(|_$j}#>VRYIWLxzbeb`}j!C^IP^{!4+^@A}N&#Hq)1q&$!+*1L{ zzy)GqjtaTtnYnXw7X^5M7CPHm*UgCzxi5B0(Gii&c|{i)`YkMmqbeN%9t9DDe;+1P zj=V_xczWT<>vRuRn7*`8TZ3+IMgr-`C8_k8MO&>@;tj ziirb4N!_m)awR#U0v;5|&ueY#boUD;zTC!RtG9 z!~$`^tQQ9(ObS$1NXRt1`IP>Y;ucJgRz>+8ya^Tm%`xkDdXrR^Ii*mmdG_5m2f)pT zFAOM7yb+KkVhJGwKftO^HXKC`w&cpY6d>7wsQqi}Dp!aeboGV&cQSQ_EC`>I2U8In8ZN-Yh9Tk`7@G5%^l!4W#gv zJ%6w-;KHZ2m_$#{{cm>;7d1s5i2AeL^FI?%6~B6Ke*&WoBlX4dr{i~P+SQ-fXbUkP z9@Z7AL!0OW-!^uYS}@lo_dDxPv}kFJ7uwQK)Qh5F!9q}u+@8LG6OB8bT{rl;-?39x zgT2e2X%^lPM)Tkw$+X@Ee()lqfEJ@~0lSK?K}w%B!>lEWxW&W`pmq0h@W3wnkO87P-G30GKP^ktm+n&NV zevLe`Ztw{&_G>!0xsEhIAHWemg}{v8=XWWf{t*A_yt?0;zJ&K`hk?ZR7IAdQpe4VL zb01ZXZ|J%R zOxruR6ctRS`_{3AI3=pvsP5{{)iB}*6lPFU_<-Ev7ZU_O=cB|2cs!~T`lttY22o#H7^~B#U6c1SOipo3(5dkg zO?^xC;F~Nv1vFU9O>t9_?9z2G2;k1r+xt~-tL}>JI4Om~z!Dgx`@tXH;jww_AV%8+ zO2dgXaSz{eN%qqzN{td~K%KB?24uiWv#rpgd*a*pgUfgCDK0qP(_R6tDs#*K!-m}h zZoRlGfeqHWdbcKi;`Q%%z%%-1{fEgD&wIaKXBTTi)H`EUgrU%V575x9$miU!4P5|=>t&J<7h1<)6Io50PWp=c6mok55lge;oX=#1@bZ)NYiKz zVc=hF*TZqA{QC0*e3i%T&^07)&wH}zc)>iVAaA(PuPzKetAJ>4dkw);RTl>cp7(lz$RNWTs4r{aH*sGn%{nDuuoi0%7X21d`Jyu z2A_Sxu4jyp0jEH|PXUFQVF%j%~iQbT0Y9>fd=n@_fdt{FJ z)bfPxw%9rOC3plf&w1P_wv=+Ri4tPvuOjnk8#3^4!*_kvYX3a z5so{2g4+f-nj@7}R%8KJ)Q*n3HfIDSiI_REB-26b?ec*|NkjMySGkpEk*GbG#*+8W zRBjxvtyvbDCQy$^jcZO*#uljQt4C!XwUu|pQ0<225i@o(Y+Bis1oK9%Lu|D!a_r!L8J=VdiME(80cf5oO)4%9_!PD?5;?8iq@W zB4SO!v)YPTi(+>hNsNP?Q6AAqJ7Lkph*xstvPv2uJ1FY7aVwx1`EEl>F_R#_+&6Ib zF5h!Htlln_Alq~jG1G>mM-2{qvkW4q;DN{N1c?TTs$oj*i~P(Y|1ti4e`;dD4qr4D-N3(_z+0u0 zbqC@Qv~H8PkwbG*AE?KysPeAhf#RyZ>}ATG_0ocDMk=fhK7bBD=I4K|C+I)Cd4VTm zOEfkh0b%j)uO%^=hnPWOsFcgsP#Neb2FuQxVwJ)@gR{Pdy&DcEZ|PCtP0^O&&El&n z(pFX7@e6rx5QfZ>VFN`6#DD&^Ecr|S3*?Fo*krzM+FE2S+O zk%)nRm<0TuXL{0{P6SM=1`^5E$f5%QU9{lKg;^hYmZy~kcneUmm^z_r1tVg zwbeFPyK?`Suls_xtM$pbnna-*s9FqpWXULNaT>~*MAK$4{-zQ5`d)@|)r)(wx2@bJ zg7odkVKnbeBpjCDL^o4=>ciPmM)Z}d+(IVC5`dQyBw-w52$oOwAMr^wm;Jvi3X%0D zSAcrFFL;$9H11>Y3j^xW{)^ObZk9YjX*OCL#@mquw00>X#Rzj_`w)4uGkaso;FD9t^J{MOA|HOiNZCHfns z*_fgsnBPeYzIEO>Wb>~7BR4PGDr03Wx?SRetGG4fx~BSNlu?>dth%cU{Ds-ix|*Lj zjqhJ}(#^VU5ehA7Jy(&C791HTKqnJ96ozOKwN9Fl4P-|B6FO_>kN;#cWQ z+N6gl{E74a%B3C8@VSVLvQKL+4pi9t$5G_-v!o|@9t9#qC?C(M`U=h8F0s!ni^xy@wBgnX7~xY)Ia|KA9lmj3)~w$& zRMcf>0;3)?k6yU<*L=naN1W))4R(TU3RhejjAmB`1f{Ve-O&9g>Ibf2!hje*K{zws zjS5fj@Uij>8|?@`$4aR@zzVct>aF~4RI@VwcP1i|4Fqhw4RyC0!hxYl$PX)Z$YHXy z0X0}5jHf+1k#yUrrr|udtTA8=_$oCX3&uyTHwuNIRmK2hav&Yb+rs7{Wx;rkA=sM} z%7*f`GPXC}57`&Tvk;ol>_v)@E0xD7%|`i!h3rV^gL3ni_T+3)-A)DR+fm^*@+=aR zbPKh=K8huyCtNwf&1Is@{`f3{1br^f3+0SWhOqO-dQY8+1E|hYKgaKkv9FfWLmOzQ z6tG_$F?Ws>`xeIbiatUI*-`RHtn>MEnP^Af;@E*)d)Z-%2%NL_nsq6pD~7js%L9c5 z<-MHd3r^izwK8v**siU|qWQDVN2RFmpKe}s-VcUdr(u6*Rt*asQsJOH+SKL=Yi0Oo+&K36m1EA?^8r zxKwhuD|~E=P=p6sLzD`Q(xvM%TDSxw9GvbNYH~Q{2qNfp?FeX@RhJcwxx!TAy0_57 zav6-BJF*KKPh+d#Xb)jAXBr=VA=S~a?YO6;ck3Sx65dS-YWvG!6lTbnye(S`k8$f{ z^7A67J9iwY)@Yn5q6M%SPj~QbPjm}AbOD^{=MAGe(Rp%v(tm*sm?SDo06;*$zx+`H zT`N*1D^5DDg;m-nlKn&gJvFz@Iw|i=Q~Q3WJn#R!yc_-4qTp0dN+*piW)}s(Ly7Pk zY(hYv)d8x0{pb-`rtiEL+`_?HrGj?i3|M@bGc&274_@KR1P`JqSO+(qn;mYNuq`)vV{kTqI{Ws8jpg*9z8i z&b~3&pXrcbgVxZY@{Xkm^04UbaPihmuE+F}!M;*2ij_+vbE);Ib1&}ETgwYkXX{C{ zZWqWCsy#h)vsHHKEFsMUSW((^dsI}4s?e=Rolu@Y&8QFI zTq=Tb3rqXmEnUr>-VVrjrZI=3>eMAQ_U69 zFTet9b(hQg?c&ANC+r^Y z4fL8E_P{S!OOV9tJmZXGt%S9ROzorUx)sM?yQ6X^A=mJksIrXB(%!CIL(O|n!{mz-;hYqp|xdc>K=(1m$3;yQL-d15QTU&PHJ)(Y;%P3%~n zAP?8o-_6FCWkU3#!M@U<&5`J;VQn%|uxgb=gw%&Of<0UT1~5b!9<>$}&|`6j{hQcn zRj@v+0LGJFYabiv3QnmOhK<2}tIHmTa>RGdb4Euj4!(7Zq#5=*eTS{+W17lkWKcbQ zt6~`W^elIj6{B-Y1~pAs!U;r0XVx2f`4e9K#6fOP*J4E>Q-$wWoQ6hov(G#{+9fe0 zSyW+-Mpf;c2r2FIpRrD?%$EH;V@cGhXi?ZBLG>(jxkm@eAKOqG>Nl_(C%R#z-gj^y zZX-F&Gz7x(Op#-4Pl@(G15$ZO2xYLIKzv{d)IQ(2N10ZWn?P z^>I0u)*Z@Jyp#G!6ZaPt0ju|J^bSW;jm!N2gqMr@$5zw3uN9Q_)z=SNOf5Hz=<9fk zto+9#x8=O)rz(ughSYLe zCI()7I3~>E-;N1&C&WzDkBk-6r4N@^XwuR_JN5=iDyKttFodw=M=uz}2-{nr_O!%m8wsUICLs7o6zD=$dP$fsXTJ?^UQ ztw;2aW&AuhM8SwW4ZAS-PoE6+52R3i0{vj@@d+iaP@2yQ5062(gdL8KC=6~sUMCfR z_NBS|j!B_#JSqs|>*GOL?n%*P2opP7@(R30JqY7)UJ^o20CcZO0RloD~L?$}Lezb(rtXf8;6&Zm8%@V;12H@Y< zJvD7w1|1J~LR(f}j2Mtu?xF*ui`+LHnUPZ^ugLMrUbG@6+;4Y^OOv@Oegx1?^^w$R)y3p8v70<`>5Gja=_ z=hGmdGX+_wf2X1GrsF{7(RI6{>2)}MjGrX3v1x#T=S4HIZhJq7L&w5`B>wSkNCY;t ztWk74Fl<$}-al@p>4jd(nU1&2?GU?T;fTCUh^~si)2$G%Dw1!Ta|hT4NAetiG-qvv z6V+0p|Jv=`%JAUNO?e}-(jqSQrxw)ZR59fs?aqc`t0iYz=?+lQeWJc|qy(!S^x^pE zN78zXl%L1U0|HGl-)@`q>Aoz^N=)uKbT#wzDz^^lb7prNL7a7l=SyOS%ZnwanY=|5 zx>go4|F7^m7yZTzmsUS2CQy~ z;g#5B&Xtc4>teI_I`;Bf@i(Qm zi4{{mk9?=Va|Apl?0uu-hNexR8x<*hZT`c`&;#1H8+_77lWE(HrH3is*%z*s&TG8z zMHbpExybs1SXEc$DE<~m@%B={J76FH#_(fUS&V~=gN$(_=K(&C)3QyK6meVe$1|V< zZ6tS#_~iAnB z*AsyNrQZH_JmVq(DwCA4mmBvZqefp7YnIct1}byC+UQJt-$l5MFqvVWz4wJ4E}lq` zzh)v_WJQ%C2}2$Px@2q3eIUve+Zpj3iv*}D$GDj5b=}JRrjZP>ZU@r#DDt+fbF)$dL~Bxrbip)AK|lz5*YKxU|cL=kRn?K ze5K8lqji@6W3@-vh-bL?L?6O4Ed5o^7?r?t*2>;@xW6 z!;$~EfNf-AT1YJc?+s&i!3gU+w;e3+J82%H0jLKlNZhu$=X0nMOg=H@SS$B#N(-V) zoS3*n9^qc$J!#h2hk;R{#Zm$F-yiVD;wMbibW~ku;E{S~iZMuFPh)3ggHZ4dinsf^ z@o&J%l{X{vlbKKO{3ke3o!Vl=b@~?i?B;F=9zKEpfq%cTKVh&MYyifD#kOP)-NQ3P zCzFzT?9YL=^Va=((=wL#?q3=fF`eeDK0~}m{Y6S^NCbF*y=xS!s5=hvNDqZN~n|DOlI2Zrp^&P#)Uz|07EOv#>xjN}q zm2FKn)h?X(-~hU6fOqpc90H>@h;rzK;~Qoq&U-X! zaF$I6vF4wcNWy(`xEKH3xE1>Kw1%Tz23Z}DAh)+;Tu{L_LchERHz$+P%B>NmM!g|> znx~hMY_?rFjFLP(Y(5V6H=t6dTIsJn#s~!^8IDkm-M-0MRrkPQmMgJ1T0+*8$uvOtXRxA3^kffBW|2DzTH? zvZX>GD@3;n(2{f9NBCGibd#nIF2LDLD=@G=i=m=j{ z@W%9R>%5yt-!<$25x9o{%>H4ka7}p&x)&o}hXDK%O33y)18JVA)2+lwKC^YxV z&o1T(sj+5{j6MQLCsD+^{T%Lz-W_yEt7-AI*owI+wjtMozYYI?<9td^pCy>u@eGTy zMDlc+yXIHm_)Glf`}W8gsgpvaf5*9a^$NDzw&7}BWTKthOs45bw3oo15lE-t`-KR; zB``kAav~euxE|+@#>F^<9z+Zu;OXdslUoL?8`~{gQTc3^Zt~TGphhQop6tt!HEd^1 zorf`Cog(DC+%(pbrXN26=2V6Yjw1UP1TsS(+|x-3&CcAGW`dAYQ|L%SG5BOUMZ=c{s zXA9#oXGjpeUTM(j3U~n24%%@~;0ge>Du<53hfFjh`+r$0O3N?al2@`{+m=}5=9Ta) z6GMfRjH9V>& zI4@s$(hl-s>U(1la5IM)b_~NO^#mJS+l}RnsR=1F;+o8pFsBU%q|vRIf-7A9Z?`1S5m;odBZ=+pCtpmZhh z#DGy~X3Y25g(L8{vT)>@G^Mi^W9c5%S$l;7opc( zHR~bFtF*2ATySx%f7=SJ7tv3|v(HO$ajGEw*jG}3<|H8kzgBO}goVl$#~jd=5~buN zh)8%AG5kDwpDq`X5nf2+W9o1`B>bMKhp+neZ4Oy&9)!*R^)3tGwJjC!*0%%UiHh3z zhj{t=2-2WLxp-_%pvoT&GHwsYx|`?F_N2spL=oV{OC4y>;=WN`RyWx{hXVonoH6n< zl&rB9R6ap6(YiyI#p4ksil5P=aNrZA~p?}0f-MEO1us2d=x5HM2Zim%l zU?JI9`DdED>)_nq!+c;xtt6(&#A35wy1Fd2hBPhtHZC1p)d(IcVBg-g262Z$l4$3t z%g19-C0WGfZ)V#*wRUHTO`mx$`6wd*i$Sh}t;Xa=UHOD_0Ml*1Cs5xM;Ts<2O2US4 zK~1IC^AkNOb^eP_xh)@KLTX5o3+9+=f2U{S54C>%BS#Ki$s`{-;Is3VSx}9a;&g!z zY>|8ObAoJvImN359=E=xeVI&@3n6S4?x{JgRou<3_3+Cfy%sc3kLKslezDYW_w3yX zZm;h$?gze+9t79tcQ}nx@pYRKgM4WXsjdt519&1P%?;_T_UzwvxKEAnN%5qpYLkgH z(zM_~$~P(&C^&oUfDwZ)!*EVkqUqZ+}F4FN|loH8DiCffR&nZ zWPW4N#di$$zgkvF%$zmAwRwIjazUZK)PU>2+nZ$u-oV+zp7S<^4M4QB1nY_P5~_SB z79_apoG}`|tY8t9C5+=rlof9OcAWU9BSq$JUQOY1JV_YA^f}hfZ2;@4pZ7_*Lc0q* zZoTvVZZ6+n1PwCo*f=MZ19y-Kql|xi1(de2xdnBoc!hvXlV%ATnELY#4qTNd+2i9g z1fa?BkMz4CE=uB6)8M-y~iq28lVR|=N;h4@a8w;knH2>V;>mlIabskC5) zs%NPdS~xVotfe~JfWej8b*DweUHRo`z+J@ zt|$%fKE4!Gt#VKTwEi4ab*k?*dpNRCb+ZL@F*%r8@y^$_m7m82_u1!A0j&DOTsFSn z-J?hC(PT%a<(Oklje1+<&upr?nR(!@z8eY~M*TTSy;|?wRGaA=j0{QalZSW)rq2Cl zWeYTla_Ppajp}qrfE()VBpd22is1I{2@AHgnv`)f$JxVHujyqPGkcn`0NLg7bZfZ` zfHlr^?4&S(J^EXV+)v~p3zjXb-nT z?5vX067~2_x3h;*5V-^Xm%o{8`?%^&GBL%}0c47jbBpljteCDj0&v}>i-}7vkev$+ zA;U;|k(n@yi@MOuAoJ;of&}>bBzc!SRF6YB&L2-Cj!nyHT0X)EE(M{fe%RJ9EvAVz z-7gWDmYtxP6?7%>BSU99bq_@yAzw06(@zP7Cg}%0`{`pvclfzK(l0%|+{gPVJ%td& z&o~^ZfKPYFIS(#sRgeen@D$BAgKetL%eKWE{Z4{4N!|(l0hfOm?MsS3s8^p$yk#t7 zYBEmkxuz04bC!UTF|MoZ6Nf;|JhX7b5G=cLJS*AB`P!|0)jlLSw`b;$qslw;h=c__>cu#=Yeo=1)$sR;P zPS-$2ZjQy>do1d<0c<=GYTuf+?3j@nA1A|ZNjhm#lpp@OQ~7{X9%({RiqF})D`59> z+W4$6pmvDhneP|KI4@%amtlefL1!NGm~GbLg_+<7zU4;-K9jCW%=(Mc_AP-}Y^o6a z58*87D4Ba4wI}Bre$~33fJawvkcDN0N5Gx5a}UJ9QY2PyKy`C|yyeIlmxKepD$6K0 z^tOjCZoJ_gXx$y7*F8Qql23%ar~M*#*ZZXxI#m#Bm*fGlGzA@1(vPlOmP_oEs|A%g zSCHzL&~UYoUH(0|ICLhCdVH&b*Y3#7;6xucaPJTWR?o=rc7-k+C%|fH#Uzq%!>}Bz zOkB?ZO0`<_xtF?MXdm#(bzcKDzG4_J$;(~ho7=TxH}B>*pOPCdFYcSbns7^s2Um