rust 2#rustc 1.98.1 (48a229cea 2026-09-01)RL.SAwjL-df1bddb45adbe94bm6GÂn62-64f5f36fb09276941 Xr*-1ad4f876c768bda9<%Z>64V`-2d2ab9fb0fe1def5G g{(3iF-06449a08aaab5e30rustc_std_workspace_core{`"Ei%G-cb0d4d77988d81b5")pE͗E-3ec41d3a5a80a4a4 miniz_oxide8bž LƨJ-e44eaef1807e5fc0adler29lyA6P/D$UB-dca52f01a59c33e7 hashbrownX {e-143c77bb957d9940rustc_std_workspace_alloc _z%-145a318e0772276c std_detectK(0*8D?-f99feda5ce9e492arustc_demangle%jerV-cfd0ab54bb33760ecfg_if}λ՞Co-360da4ba13154744 addr2linecY\G--09755979c57b7e64gimliQ`Dy-9a1fede77fbbf2f0objectF λv.z-7ff85ea729a864ffmemchr]1<=UO-0e3477fb2664a277 jlToKG-549498e8b2e4d924 regex_syntaxe;Z4-64dae4b52f103216 aho_corasick oh *'-5fed2b58eacfc033% u;%C-de3d4e99a744dd44 AutomatonLs dfa-searchs OverlappingStates&( StartErrorTtDF StartKindLtac dense,xx tests,$ regex,yy sparse4yy accel,zy automatonLzz determinize\z dfa-buildz minimizeD{ { ,C C search4|{ special<|| ,||StateMapDנ| , $ dfa_try_search_half_rev  dfa_eoi_rev\= = ,$ ,*$*dfa_try_search_half_fwd  dfa_eoi_fwd\1 1 ,$ dfa    , $   , $   , $ڿ   , $ݡ   ,$<internal-instrument-pikevm&CountersD& ,ڧ$ϧ ,$CaptureNameMapt| ,T$Tlazy$DDD ,҆$dž is_word_chardsyntax unicode-perlĄ.3dunicode-word-boundary!# ,$inner,| ,ϒ$Ē ,z$zNE܆ ,$ ,$, perf-literal-substring " $ ,޵$ӵ perl_wordLĨmacroslogtrace DEAD onepass                                        ! " 1 1 match_kind1starts_for_each_pattern1 byte_classes1 size_limit1get_match_kind1get_starts_for_each_pattern1get_byte_classes1get_size_limit1 overwrite < <build< build_many?<build_from_nfa< configure<<thompson E'aE EEshuffle_statesEcompile_transitionJ Eadd_start_stateEadd_dfa_state_for_nfa_stateEadd_empty_stateN E stack_push Q Qnew_manySQ new_from_nfaQ always_matchQ never_matchQconfigQbuilderQcreate_capturesQ create_cacheQ reset_cacheQ get_configQget_nfaQ pattern_lenQ state_lenQ alphabet_lenQstride2QstrideQ memory_usaged fis_matchg'hgffindjjfcapturesmmf try_searchftry_search_slotsftry_search_slots_imp s search_imps find_match vv start_patternv transitionvset_transitionvsparse_transitionsvpattern_epsilonsvset_pattern_epsilonsv prev_state_idv last_state_idv swap_statesvremapimpl Fn(StateID) -> StateID debug_state_transitions     resetexplicit_slots setup_search   STATE_ID_BITSSTATE_ID_SHIFTSTATE_ID_LIMITMATCH_WINS_SHIFT INFO_MASK is_dead match_winsstate_id set_state_idepsilons    PATTERN_ID_BITSPATTERN_ID_SHIFTPATTERN_ID_NONEPATTERN_ID_LIMITPATTERN_ID_MASK EPSILONS_MASKemptyis_empty pattern_idpattern_id_uncheckedset_pattern_id# set_epsilons    SLOT_MASK SLOT_SHIFT LOOK_MASK$$slots set_slotslooks set_looks  LIMITinsertremove$apply    nfawordtoo_many_statestoo_many_patternsunsupported_lookexceeded_size_limit not_one_pass source  remapper Remappable    impl Remappable swap) ) to_index to_state_id   hybrid      !"#$%&'() MIN_STATESSENTINEL_STATES try_search_fwd  try_search_rev  try_search_overlapping_fwd try_search_overlapping_rev try_which_overlapping_matches next_statenext_state_untaggednext_state_untagged_uncheckednext_eoi_state start_statestart_state_forward start_state_reverse  match_len match_pattern ! search_start search_update search_finishsearch_total_len  clear_countID_SIZE STATE_SIZE 'i'c cache_next_state cache_start_groupcache_start_one add_builder_state#impl Fn(LazyStateID) -> LazyStateID add_state4 next_state_idtry_clear_cache clear_cache  init_cache    save_statesaved_state_idset_all_transitionsset_start_stateget_state_builderput_state_builder33 get_cached_start_idget_cached_state is_sentinel unknown_iddead_idquit_idis_validstate_fits_in_cachestate_builder_fits_in_cachememory_usage_for_one_more_state33  take_to_save take_saved  prefilterunicode_word_boundaryquitspecialize_start_statescache_capacityskip_cache_capacity_checkminimum_cache_clear_countminimum_bytes_per_state get_prefilterget_unicode_word_boundaryget_quit get_specialize_start_statesget_cache_capacityget_skip_cache_capacity_checkget_minimum_cache_clear_countget_minimum_bytes_per_stateget_minimum_cache_capacitybyte_classes_from_nfaquit_set_from_nfa     get_match"skip_empty_utf8_splits_overlappingminimum_lazy_state_idminimum_cache_capacity33error'insufficient_cache_capacityinsufficient_state_id_capacity%unsupported_dfa_word_boundary_unicode(cache:unsupported_anchored(too_many_cache_clearsbad_efficiencyidMAX_BIT MASK_UNKNOWN MASK_DEAD MASK_QUIT MASK_START MASK_MATCHMAX  as_usize_untaggedas_usize_unchecked to_unknownto_deadto_quitto_startto_match is_tagged is_unknown"is_quitis_start attempted        find_iter'r3 is_anchoredforwardreverseG3   !HH forward_mut reverse_mutas_parts as_parts_mut build_from_dfas>      find_fwd find_fwd_impnext_unchecked  find_rev find_rev_impK  find_overlapping_fwdfind_overlapping_fwd_imp find_overlapping_rev init_fwdinit_reveoi_fwd  eoi_rev  prefilter_restartgave_up   @pattern syntax_errorasthir'(    from_offset   limitedhybrid_try_search_half_rev  hybrid_eoi_rev  alternation_literalsprefixhir_can_contain_literal hir_has_fixed_length  has_disjoint_class_separator  has_disjoint_class_separator_at hir_matches_empty_onlyrequired_classhir_is_disjoint_from_class  uncaptureclasses_are_disjointclass_is_disjoint_from_literals class_is_disjoint_from_literal   hir_can_consume_byte byte_class_contains unicode_class_contains        !"#$%&'()*+, CachePoolCachePoolGuard CachePoolFn GG captures_iterGsplitGsplitnG  search_halfsearch_captures search_slotswhich_overlapping_matches search_withsearch_half_withsearch_captures_withsearch_slots_withwhich_overlapping_matches_with captures_lenstatic_captures_len  group_infois_accelerated  props props_union is_anchored_startis_always_anchored_startis_always_anchored_endcaptures_disabled is_impossibleG input'sG    G G `` G    G G``G GG``G  size_hintG !  utf8_emptyauto_prefilter9which_capturesnfa_size_limitonepass_size_limithybrid_cache_capacitydfa_size_limitdfa_state_limitline_terminator pool_capacity+ backtrackget_utf8_emptyget_auto_prefilter;get_which_capturesget_nfa_size_limitget_onepass_size_limitget_hybrid_cache_capacityget_dfa_size_limitget_dfa_state_limitget_line_terminatorget_pool_capacityDEFAULT_POOL_CAPACITY AVAILABLE_PARALLELISM   get_hybridget_dfa get_onepass get_backtrackto_thompson_config    build_from_hirbuild_many_from_hir   reverse_inner   has_no_earlier_match  prefilter_with_literals top_concat flatten  reverse_suffixkstrip_literal_suffixstrip_literal_suffix_atstrip_repetition_literal_suffix stopathybrid_try_search_half_fwd hybrid_eoi_fwd  strategy      !"#$%&'()*+,-./Strategy ]] [[[    from_prefixesfrom_alternation_literals ]]   [ [[ try_search_mayfail search_nofailsearch_half_nofailsearch_slots_nofailis_match_nofailis_capture_search_needed ]]    [[[ try_search_half_anchored_rev ]] [[[  try_search_half_starttry_search_half_fwdtry_search_half_rev_limited   ]   ]    [  [ [     try_search_full try_search_half_fwd_stopat w    ]   ]    [  [ [copy_match_to_slotswrappers                                 get     [ [    !   z      z     [ max_haystack_len    !   z      z      [         !          z is_some       v  x try_search_half_rev  w /         !         z }        v x ~ w /        z    w       !        z }      w '  e                                min_visited_capacity    9 visited_capacity ; get_visited_capacity DEFAULT                             |   try_is_match    try_find    try_captures    try_find_iter G 3   try_captures_iter G 3              e step   G 3       G 3         !  !   BLOCK_SIZE   ' ! !   div_ceil                              goto     clear    finish_pattern current_pattern_id   add_empty  add_union add_union_reverse  add_range  add_sparse add_look add_capture_start add_capture_end add_fail  add_match   patch set_utf8 get_utf8  set_reverse  get_reverse set_look_matcher get_look_matcher set_size_limit   check_size_limit                                         ! "    utf8 H d shrink  d  look_matcher   f  get_shrink  get_captures f  get_unanchored_prefix    >  is_none is_any       j j     compile         c_concat   c_alt_slice    c_alt_iter  c_cap  c_repetition  c_bounded  c_at_least   c_zero_or_one  c_exactly   c_byte_class c_unicode_class  #c_unicode_class_reverse_with_suffix c_look  c_literal  c_range c_empty c_fail        ‹ Ӌ   ό ߌ  is_reverse    ׊     finish     compile_from ˒  add_suffix   pop_freeze pop_root top_last_freeze  set_last_transition @            ' ( ' ( invalid_capture_index unsupported_captures  (    literal_trie                   H H  get_or_add_state   ˒        ߌ is_leaf chunks  active_chunk active_chunk_start                        PRIME INIT    ׊  z set    ׊    z  '                                        ! " #          patterns  start_anchored start_unanchored  byte_class_set   states ]  has_capture  has_empty is_utf8  is_always_start_anchored   look_set_any look_set_prefix_any   into_nfa] set_startsЍ set_captures      is_epsilon     matches  matches_unit  matches_byte   դ      դ      pikevm      instrument 9;   GG3ZG3 [  search_slots_imp  [which_overlapping_impnextsnexts_overlapping epsilon_closureepsilon_closure_explore start_configG3  G3   !!  !!  ! ! for_state all_absent  range_trie   FINALROOT ׊'  duplicateadd_transitionadd_transition_atset_transition_at state_mut binary_search ׊  push#ranges     parts1parts2parts3as_slice  intersects                   utilalphabeteoias_u8as_eoias_usizeis_byte is_eoi is_word_byte$  singletons from_byteswrite_to write_to_lenz get_by_unit is_singletonrepresentativeselementselement_ranges>     > $ set_rangeadd_set $ 'containscontains_range  iter_ranges$          $N? get_groupget_group_by_name  group_len]interpolate_stringinterpolate_string_into  interpolate_bytesinterpolate_bytes_into  extract    extract_bytes   ׊ set_pattern& slots_mutCapturesDebugMappidcapsKey  c  $ * to_name pattern_names  all_names& slotػ all_group_lenslot_lenimplicit_slot_lenexplicit_slot_lenadd_first_groupadd_explicit_group fixup_slot_ranges ػsmall_slot_len  (too_many_groupsmissing_groupsfirst_must_be_unnamedۯ (  $   c escape  DebugHaystack  interpolatestringimpl FnMut(usize, &mut String)!impl FnMut(&str) -> Option bytesimpl FnMut(usize, &mut Vec)  find_cap_reffind_cap_ref_braced  is_valid_cap_letter `` advance_halfadvancetry_advance_half try_advanceinto_half_matches_iterinto_matches_iterinto_captures_iter#handle_overlapping_empty_half_matchhandle_overlapping_empty_matchTryHalfMatchesIteritfinder infallible`3 `3 TryMatchesIter`3  `3  TryCapturesIterɾ      Lazy  zdatacreateowned z lookreversedas_repr from_repras_char$ singleton$̸contains_anchorcontains_anchor_haystackcontains_anchor_linecontains_anchor_lfcontains_anchor_crlf contains_wordcontains_word_unicodecontains_word_ascii' set_insert' set_removesubtract set_subtractC set_union intersect set_intersect read_repr write_repr available  set_line_terminatorhmatches_inline matches_setmatches_set_inlineadd_to_byteset Eis_end is_start_lf is_end_lf is_start_crlf is_end_crlf is_word_asciiis_word_ascii_negateis_word_unicodeis_word_unicode_negateis_word_start_asciiis_word_end_asciiis_word_start_unicodeis_word_end_unicodeis_word_start_half_asciiis_word_end_half_asciiis_word_start_half_unicodeis_word_end_half_unicode>checkfwdrevis_word_characterpoolPool   with_capacity#with_available_parallelism_capacityh  z PoolGuard put     COUNTERTHREAD_ID_UNOWNEDTHREAD_ID_INUSETHREAD_ID_DROPPEDMAX_POOL_STACKSstacksowner owner_val z get_slow put_value  guard_owned guard_stackguard_stack_transientdiscard value_mutput_imp9   R is_fastbyteset     R   R    R    Rmemmem   Rteddy    R          from_choicefrom_hir_prefixfrom_hirs_prefix Rmax_needle_len PrefilterI R R  prefixessuffixes primitives zD&ZEROSIZE  mustas_u64as_u32as_i32one_more from_ne_bytes from_ne_bytes_unchecked  to_ne_bytes Error    E  index_type_implsIteratorIndexExtwith_pattern_idswith_state_ids from_input_forward from_input_reverse look_behindanchoredget_look_behind get_anchored  z  parse parse_many parse_withparse_many_with case_insensitive multi_linedot_matches_new_linecrlfe swap_greedignore_whitespaceunicode nest_limitoctal get_unicodeget_case_insensitiveget_multi_lineget_dot_matches_new_lineget_crlfhget_swap_greedget_ignore_whitespaceget_nest_limit get_octal' apply_ast apply_hir>wire    buffer_too_smallgeneric invalid_usizeversion_mismatchendian_mismatchalignment_mismatchlabel_mismatcharithmetic_overflowpattern_id_errorstate_id_erroru32s_to_state_idsu32s_to_state_ids_mutu32s_to_pattern_idscheck_alignmentskip_initial_paddingalloc_aligned_buffer read_label  write_labelwrite_label_lenread_endianness_checkwrite_endianness_checkwrite_endianness_check_len read_version write_versionwrite_version_lenread_pattern_id  read_pattern_id_uncheckedwrite_pattern_idtry_read_state_id read_state_id  read_state_id_uncheckedwrite_state_idtry_read_u16_as_usize   try_read_u32_as_usize    try_read_u16 try_read_u32 try_read_u128read_u16 read_u32  read_u128 check_slice_len   padding_lenEndian write_u16 write_u32 write_u128LEBE           borrowdead is_from_word is_half_crlf look_have look_need11match_pattern_idsiter_nfa_state_ids   into_matches׊capacityset_is_from_wordset_is_half_crlfȋ set_look_haveimpl FnMut(LookSet) -> LookSetadd_match_pattern_id repr_vecto_state׊ًӍ set_look_needadd_nfa_state_idas_bytes Repr has_pattern_idsȋً11 iter_match_pattern_idspattern_offset_endencoded_pattern_len  ReprVec   set_is_matchset_has_pattern_idsȋًӍclose_match_pattern_ids  write_vari32 read_vari32 write_varu32 read_varu32     add_nfa_states  set_lookbehind_from_start             $skip_splits_fwdskip_splits_rev skip_splitsintU8U16low_u8high_u8U32low_u16high_u16U64low_u32high_u32I32to_bits from_bits͙ܙUsizeas_u16memchr2memchr3memrchrmemrchr2memrchr3  spanrangeearliestset_span set_startset_end set_anchored set_earliesthaystackget_span get_range get_earliestis_doneis_char_boundaryٜ$̸      N   NٜŜ$ ׊̸' try_insert$is_full c next_backHNcontinue_past_first_match :Mhaystack_too_longB sparse_set resize׊* $'̸׊  unicode_data mkwordset  WORD decode decode_last is_boundaryis_leading_or_invalid_byte Config   > Builder   InternalBuilderuncompiled_nfa_ids nfa_to_dfa_idstackseenmatched'classes  DFA'tablestarts min_match_idש pateps_offsetexplicit_slot_start  SparseTransitionItercur  Cache!    Transition    ! " # $ % PatternEpsilons  & ' ( Epsilons  ) * + Slots  , - .  SlotsIter& /  BuildError 0 1 BuildErrorKindNFA Word  TooManyStateslimitTooManyPatternsUnsupportedLookExceededSizeLimit NotOnePassmsg 2 3Remapper idxmap IndexMapper' start_mapשquitset:  trans states_to_idsparsesscratch_state_builder state_savermemory_usage_state2bytes_searchedprogress SearchProgressat33A33LazyRef33A33 StateSaver ToSaveCSaved çpre::::;;> matCnext_match_indexrev_eoi  ή InsufficientCacheCapacityminimumgivenInsufficientStateIDCapacityerr Unsupported    QuitbyteUnsupportedAnchoredmode  CacheError  LazyStateID >      LazyStateIDErrorERegexHH FindMatchesG3reA G3HH    ήSyntax  RetryError Quadratic Fail RetryQuadraticError RetryFailError impRegexIstratinfo RegexInfo  RegexInfoI^^GAGCapturesMatchesGAɾGSplitGGSplitNGsplitsG capmatchese+ revhybrid !çcautopreѶdddd+eeeee"#$>OO%&InnerPrefilterRѶliteralsPreѶ]  CoreѶ'nfareve+ ReverseAnchored ReverseSuffixѶ ReverseInnerpreinner+  PikeVM      PikeVMEngine      PikeVMCache       BoundedBacktracker     BoundedBacktrackerEngine     BoundedBacktrackerCache       OnePass      OnePassEngine      OnePassCache       Hybrid      HybridEngine       HybridCache   !  "     #   DFAEngine   $   ReverseHybrid   %  ReverseHybridEngine   &  ReverseHybridCache   '  (   ReverseDFA   )  ReverseDFAEngine   *  ç Ѷ          >            ' ! ! TryFindMatches!G!3!!!A!ɾ! !G!3!! TryCapturesMatches!G!3!!!A!ɾ! !G!3!! !!visited ! ! Frame!Step!sid!!RestoreCapture!!  ! ! Visited!bitset! ! ! State!Empty! ! ByteRange!!Sparse! transitions!Look!! ! CaptureStart!$! group_index! ! CaptureEnd!$!! !! alternates! UnionReverse!!! !Match!$ ! ! !  ! !$!!!! memory_states!!H!! ! !  !> ç!!H!d!!d! !  !  !>  WhichCaptures!All! !Implicit! !!     !   " Compiler"parser""" utf8_state" trie_state" utf8_suffix " "  ThompsonRef""  "  "  Utf8Compiler"""" ""  Utf8State"compiled" uncompiled " " Utf8Node"" " " Utf8LastTransition"" " " " " " ή"" ""Captures" """ """"""""""InvalidCaptureIndex""UnsupportedCaptures"  " "  LiteralTrie"" " """"C"  "" ""  "  "> StateChunksIter""""active  "" ""     "  Utf8BoundedMap"""  " " Utf8BoundedEntry##key# # # #>  Utf8SuffixMap###  # #  Utf8SuffixKey###  #  #  #>  #   # Utf8SuffixEntry### # # #> # #  # Inner###֠##]####š##H#### memory_extra  #> #### ##Dense# #### ### BinaryUnion#alt1#alt2#`# #$#### ##$  # #  # SparseTransitions# # # #  # DenseTransitions# # # #  # ###   #  $ $$   !$  PatternIter$$$_marker "$$ç$$Ѷ $ $ $>$$$$$$'$$$G$3$$$A$ɾ$$G$3$$$G$3$$$A$ɾ$$G$3$$$$curr$ $$ ActiveStates$$ slot_table$$ SlotTable$$slots_per_state$slots_for_captures$$ FollowEpsilon$Explore$ $$$$ $$ RangeTrie$$free$ iter_stack$$ dupe_stack$ insert_stack$$$$ٜ$next_id $NextDupe$old_id$new_id $ $NextIter$#$tidx % % NextInsert%#%% %%%% partitions% %%%%% % SplitRange%Old% %%New% %%Both% %%%%%Unit% %%%%% %UnitKind%% %%EOI% %%%%% % ByteClasses% %%  %% ! ByteClassIter%%ש%"%%ByteClassRepresentatives%%ש%cur_byte%end_byte% last_class#%%ByteClassElements%%ש%class%$%%ByteClassElementRanges%%%ٜ%%% ByteClassSet% %&%'&ByteSet&()&*+&,&>-&./&BitSet& && 01&& 23&>4&& 56& ByteSetIter&&&7&&ByteSetRangeIter&&&8&&&]&&&&CapturesPatternIter&&ɾ& &&&& GroupInfo& &&&&>GroupInfoInner& slot_ranges& name_to_index& index_to_name&&&>GroupInfoError&&&GroupInfoErrorKind&&& TooManyGroups&N&& MissingGroups&N&FirstMustBeUnnamed&N& Duplicate&N& &&GroupInfoPatternNames&&&&&&GroupInfoAllNames&&]&pids& current_pid& && DebugByte& &' CaptureRef''cap''''''''''''Ref''' ''Number' ' ' '' ' '' '''''Searcher''`'last_match_end''''HalfMatchesIter' '''''' MatchesIter' '''''' CapturesIter' '''''''Start' ' 'End' ' 'StartLF' ' 'EndLF' ' ' StartCRLF' ' 'EndCRLF' ' ' WordAscii' ' 'WordAsciiNegate' ' ' WordUnicode' ' 'WordUnicodeNegate' ' 'WordStartAscii' ' ' WordEndAscii' ' 'WordStartUnicode' ' 'WordEndUnicode( ( 'WordStartHalfAscii( ( 'WordEndHalfAscii( ( 'WordStartHalfUnicode( ( 'WordEndHalfUnicode( (   (  ( ((LookSet(((>(( LookSetIter((( LookMatcher(lineterm((UnicodeWordBoundaryError( ((( THREAD_ID(__rust_std_internal_init_fn( ( (__RUST_STD_INTERNAL_VAL( (Η CacheLine( (( (( AhoCorasick(ac((΁( (( ((Memchr( (((Memchr2( ((( (Memchr3( ((( ( (Memmem(((Teddy(searcher( anchored_ac( minimum_len(( Prefilter(Ѷ(())Choice)) ))י) ))) ))ۚ) ))) ))΁) ))) ))) NonMaxUsize) ))))))) ) SmallIndex) ))))>) ))!")#) $)SmallIndexError)E%)&)')())SmallIndexIter)rng*)+) PatternID) ),-)./)>0)1))23)4) 5)StateID) )67)89)>:);))<=)>) ?*@*D*&*** * ******** ** ** *A*B***C**D***E**F*G**H**I**J**K*ELM*N* O** P** Q*** PatternIDError* *R*S*T*UV* PatternIDIter* *W*X*WithPatternIDIter***idsY**Z**[*D*&*** * ******** ** ** *\*]***^**_+++`++a+b++c++d++e++f+Egh+i+ j++ k++ l+++  StateIDError+ +m+n+o+pq+ StateIDIter+ +r+s+WithStateIDIter+++t++u++ç++++ StartByteMap+ + ++ NonWordByte+ + +WordByte+ + +Text+ + +LineLF+ + +LineCR+ + +CustomLineTerminator+ + +  + +  +ç+++++e++++++++AlignAs+++_align, +,,,SerializeError,what ,DeserializeError, , ,DeserializeErrorKind,Generic,,BufferTooSmall,dz, InvalidUsize,dz,VersionMismatch,,found,EndianMismatch,,,AlignmentMismatch,,, LabelMismatch,,ArithmeticOverflow,dz,,,dz,,,dz , , , , , ,,,, ,StateBuilderEmpty, ,,,StateBuilderMatches, ,,StateBuilderNFA, ,prev_nfa_state_id,,,,Ŝ,,,,Span,,,,,,, HalfMatch,N,  !,"#,$,%,,&',,N,Ŝ(),*+-,----./- PatternSet--which0-1-2-34-PatternSetInsertError-E-5-6-PatternSetIter--7--8--Anchored-No- -Yes- -Pattern- -9:-;<-=->?- MatchKind-- @A-BC->D-E-FG-- LeftmostFirst-  MatchError- -H-I-J-KL-MatchErrorKind--- -GaveUp- -HaystackTooLong---M-N-O-PQ- SparseSets-set1-set2-- SparseSet-- - - SparseSetIter- ----8888788898:8;88888>8>8?8?8A8B8C8D8888I8J8J8L8M8N8P88R8S8Z8[8\8\8]8^8_8`8a8b8c8d8g8g8j8j8m8m8m8p8p8p8p8p8q8q8q8q8q8r8r8r8r8r8t8t8t8t8t8u8u8u8u8u8u8w8x8y8z8{8|8}8~8888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8!8!8!8!8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8!8!8!8 8!8!8!8 8!8!8!8!8 8 8 8 8 8 8 8 8!8!8!8!8!8!8!8!8 8 8 8 8 8 8 8 8 8!8!8!8!8!8!8!8 8 8!8!8!8!8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8!8!8!8!8 8 8 8 8 8 8 8 8 8"8"8"8"8 8 8"8"8"8"8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8"8"8"8"8"8"8"8"8"8"8"8"8"8"8"8"8"8"8"8 8 8 8 8 8 8 8 8 8 8 8 8 8"8"8"8"8"8"8"8"8 8 8 8 8 8 8"8 8 8 8 8 8 8 8 8"8"8"8"8 8 8 8 8 8 8 8 8"8"8"8 8"8 8 8 8"8#8#8#8#8#8#8#8 8 8 8 8 8 8#8#8#8#8#8#8#8#8#8#8#8#8#8#8#8 8 8 8 8 8 8#8 8 8 8 8 8 8 88888888888888888888888888888888#8#8#8#88888888#8#8#8#8#8#8#88888#8#8#8#8#8#8#888888$8$8$8$8$8$88888888$8$8$88$8$8$8$8888$8$8$8$888888888$8$8$8$8888888888888888888888888888888888888888888888888888888888888888888888888888888888$8$8$88$8$8$88$8$8$8$888888$8$8$8$888888$8$8$8$8888888$8$8$8$8$8$8$888888888888888888$8$8$8$8%8%8%8%8%8%8%8%8888888%8%8%8%8%8%8%8%8%8%8%8%8%8%88888888888%8%8%8%8%8%8%8%8%8%8%8%8%8%8%8%8888%8888888888888888888%8%8%88%8%8%88%8%8%88%8%8%88&8&8&8&88888&8&8&8&8&8&8&8&8&8&8&888888888888888&8&8&88&8&8&88&888888888888888888888888888888888888888&8&8&8&888&8&8&8&888888888888888&8&8&8888888&8&8&8&8&8&8&8&888888&8&8&8&888&8&8&88'888888888888888'8'8'8'8'8'8'8'8'8'8'8'8'8'888'8'8'8'88888888888888888888888888888888'8'8'8888888888'8'8'88888888888'8'8'8888888888888888(8(8(8(8(8(8(8(8(8(8(8888888888888888(8(8(8(88(8(8(8(8888888888888888888888888888888888888888888888888(8(8(8(8888888888888888(8(8(888888888888888888(8(8(8(888888888(8(8(8(888888888(8(8(8(888888888(8(8(8(888888888(8(8(8(888888888(8(8(8(888888888(8(8(8(888888888)8)8)8)8888888888888888888888888)8)8)8)8888)8)8)8)8)8)8)8)8)8)8888)8)8)8)8)8)8)8)8)8)8)8)8)88888888888)8)8)8)8)8)8)88888)8)8)8)88)8)8)8)8)8)8)8)8)8)8)8)8)8)8)8)8*8*8*8*8*8*8*8*8*8*8*8*8*8*8*8*8*8*8*8*8*8*8*8*8*8*8*8*8*8*8*8*8*8*8*8*8*8*8*8*8*8*8*8*8*8*8*8*8*8+8+8+8+8+8+8+8+8+8+8+8+8+8+8+8+8+8+8+8+8+8+8+8+8+8+8+8888888+8888888888+8+8+8+8+8+8+888888888+8+8+8+888888888888888888,8,8,8,8,8,8888,8,8,8,8,8,888888888888888888888888888888888888888888,8,8,8,8,8,8,8,8,8,8888888888888888,8,8,8,888,88888888888,88888888888888888888888888888888888888888888888888888888888888888888888888888,8888888888888888888,8,8,8,8,8,8888888888888888,8,8,8,8,8,8,8,8,888,8-8-8-8-8-8-8-8-88888888-8-8-8-8-8-8-8888888888-8-8-8-8888-8-8-8-8888-8-8-8-8-8-8-888-8-8-8-8-8-8-88-8-8-8-8-8-8-88-8-8-8-8-8-8-8888-8-8-8-88888-8888888888888-8-8-88888 8ç    ]u܊g  E5t{ggɨ        ' ש &2zg  '    ש   ܪ  2}<gg ī 6u5QJQ!  o|^g   g  ŵ 4 g  -[c g̭  Ǩ gg& .h(=Q Gg    ׯ   O!;נgggΰ z-g<:'ʱש::Tg Ѳ2ѳ;}/gW9,lggAŭ833gAO9Ѹb[ 33C ,5Rgç Ѷ::::;;"cgoEUg Ce8g(gKg̹1*K]ggɮTgg z7I6gg Έ ghE'5gggHH2gAoG3QgHHd0PAZkg݃݃0g _rgggQiLJg---- 7blg r 1@nngg EjNgۆgW )|g.M^Bވ  aLg^^7""ggAx A쳍GQTgAɾ?3GQTgb1mHGQTgZ>_cGQTge+HdyeˎçcѶdddd+eeeee<6ɹgŏŏOOgӑgRѶNGpQ"Ѷ]jFNvgg Ѷ'e+욑87'yؓgik[mZgѶ5#}Wg + Y3|g      b49۶g      ܈ @      Is?ogg      g      cK      *?gg      .j?g      S0      ͏Ccgg      N;o'g      />      cY:gg      kr!g      %8.:g      wT$g      Pd      1_'g˞g      ,g      F]SN:D  ç Ѷ   Ҫ g       S(gޠ     ' B.JEgg!!! !A !ɾ ! *wI F9G3Qg!!! !A !ɾ ! "DG3Q!!! ! c> g!!! ! !! !  *g!!! ! çؓg! !!  !! !! !! !  !!$ ! !  !!$ ! !  !! !! !!! !$ l0g!! !$ ! ! ! ! ! !H ! ! |6tdg!!ç! !H !d ! !d ! ?A19g!!!!!!!, g""" " " " " " «ݝg""""CjD gg""" " " aEQ""" " OZ1 jg""" " hg""" " Ug""" J~Qqu gװ"""" """ """ "" " "" " "" "" ""Ld cegװgװ""" " F l%Jgg""" " "C "  e%'V롳""" " 2<9Ȉgg""" " " UzQɵ""" "  @E g""" " "  OwP og### # # Q<g### # #  㾞a~gθ#####kf g### # # g1Z\hg####  gNpk+g### # #֠ # #] # # # #š # #H # # # # ZxgԻ# ########### ######`# #$######$=@`PȽȽȽȽgȽ###Gws{wg###F%}g##### C$5vc hgg$$$ $  66\Q$$ç$$Ѷ#h} g$$$$hcCC)kg$$$$'&Úlgg$$$$A$ɾ$J%5΅G3Qg$$$$A$ɾ$ՎpG3Q$$$$$ b;g$$$$I,}g$$$$$:p()bg$$$$$$$ +d޻g+g$$$$$$$$S 3;5$$$fs $$$ٜ$EY_9>$$$$7nY=tHg$$$#$r Bg%%%#%%4g%%%%)0Fg%%%%%%%%%%%#yv gggg%%%% f) J %%%%%%%f g%%%% 8/3! gg%%%ש%θbQg%%%ש%%%nzLiQg%%%ש%%aMQg%%ƀ%%ٜq ^Q%%%% e@g&&΁&P1g: g&&&& 9?꟦ gg&&&&jchQg&&&&79aAQ&&&]&&&Ms!—ԎggɾGF {Tg LO&&ք&ɾ& MT Pb gQQT&&&& bYvRgg&&&&&&Al H&&&LyFdMg&&&&ч&N&&&N&&N&&N& u0gg&&&'|02ygQQTg&&ɉ&]&&& ox2Q&&&& )8OhC gg S''''RT  g'''''''](!"l g '''''''](!"l''ɍ'`'z飈wgQzUgg'''' Oty_TQQVSgg'''' n]^QQɾJagg'''Ǐ' 5;!&_Q" c 8Tzg !ԧI|neg#'''''''''ʐ'''''''''''''''ɑ''''''''''''ʒ''''((((((((Γ(((((((7 Z g(((T6n g((֕(Y%>hCgQ(((s*g(((ɖ( hʨggg 4E" k"`"gg(((( Yڡ P Cg#Si`HĪg(((ɘܓng(((΁( Wzm g(((( KvPg(((י(( + qg(((((( Ƣ8g((ۚ(n-g((((([g(((Ѷ((Et2a&gKKKK 7Kphantom7K736FFFGlobal ě +))))))י))))))ۚ))))))΁))))O"ߥg)))) i1f[ 4 hg)))) Sׁ ׁgׁׁׁhׁׁׁׁׁׁׁ ׁ#ׁCCCbuf=C=ׁ#ׁׁׁׁׁׁ)))E9ԞgЄЄЄЄЄЄgЄ))):g΅Q΅)))) 8L,<Q h)))) ;4KÇ ÇÇÇhÇÇÇÇÇÇÇg##**** BJ#gg**** 5XgQ**¨**/e g̋Q̋gÇÇ#ÇÇ#ÇÇÇÇÇÇ++++ iO'gg++++ fL, gQ++++N[-gQ++ç++aE )g+++ щ 'sgŐ+++++++++++++++ɰ++++6gIq5 g++ç +++++e++++++smKݒ ݒgݒݒg++ٲ,,Pc>Ъg,,,dz^?usgg,,,, 疫E;lg, ,,,ƴ,dz,,dz,,,,,,,յ,,,,,,dz,,,dz, ,,dz%r&,֕g֕vllAՈ,,,, F8h g,,,, M} gޚ,,,, /V, g,,, ,=%R^ggߏ omr/# ,,,,Ŝ,,I{g ,,,,*H]Ş ŞŞhŞŞŞŞgŞȚŞ#ȚŞŞŞ}JŞŞŞ,,,N, ( IE gh,,,N,Ŝ%:U"N gh--̼--ǜ *g---E-OS"gg---SE(6gQP---վ-----vW MKإ إgإإإإإ-----̘ifK gۆgۆۆۆۆۆ---- -- ----&A2hgȨȨȨȨȨۆgۆ----=՛kTg---- - g Ecgݪg---- _Q        ! !!!!!!!!!!!!!!""""""""""""""""""""""##################$$$$$$$$$$$$$$$$$$$$$$%$%%%%%%%%%%%%%%&&&&&&&&&&&&&&&&'&''''''('(((((((((((((((((((((()())))))))))))))******++++++++++++++,,,,,,,,,,,,,,,,------------------                       ! !!!!!!!!!!!!!!!!"!"""""""""""""""" """ """ """################$$$$$$$$$$$$$$$$$$$$$$%$%%%%%%$$$%%%%%%%%%%&%&&&&&&&&&&&&&&&&&&&&&&&''''''''''''('((((((((((((((((((((((()()))))))))*)*******)+++++++++++++,+,,,,,,,,,,,,,,,-,-------------------  !!!! !""########$$%%&&&&&&&&((())))))+-- ! ! "$$$%%%%&&&&&'''()****++++--!!""""##%%%%%%%%&&&&&&''''('(())))))))++++,,,,,,----"!""""$#%%%%%%%%&&&&'&''''('(())))))))++++,,,,-,----!!########$#%%%%%%%%&&&&''''('(())))))))))**++++,,,,,,-,----------!!########$#%%%%%%%%&&&&''''('(())))))))))**++++,,,,,,-,----------!!########$#%%%%%%%%&&&&''''('(())))))))))**++++,,,,,,,-,---------- "&()**++,,-- "&()**++,,--$#)))))))),,,,,,-,%%%%)))))))),,%%%%))))))*),,'')*)+),,&&  &&(((((((K C* *C* +C  C* *C* +C ))))*)*)*)*)+)+)+)+), -(g Q$ %%'gh F8 8TU*Q#" #"8#) %TPx& *ÇwZ Çw 'F*Ç&crate::util::primitives::StateID::ZEROřǙșəʙ˙G*R{9 \a s{%řǙșəʙ˙G*R{9 [` rz(0! řǙșəʙ˙G*R{9 řǙșəʙ˙G*R{9   ( 4 @ KL X wT `9(    ) g%  *     )  !   *6 g 17%+   jÜĜŜƜǜȜ_wĤĤŤ :M  ggg cgcثq1ȡW`QZc)2;  W. %  !  8 4@gpn .6o .6(n n.: E q{(n pn )o  )  5  grwn   Vdof6 v  lvv"Tv 2Dvvv;F<Ħt ѦҦbR<NPÌtdÌ#T ?JD ȭɭ̬}SDQÌl\ 2X74ؐWtd =Y:<WDT 0d, H<,l I"ZfD, 'LT $$[D,, 1w, ,$\\O, ,y!A Rd]@<, 1L^7$, 1t< ^$L\ Fl_O,,8T C8,t< b$L"@$ 9`S,,(LšaE,, 0db;,, 0t<š$L@#  J%ŐcA,,=šT.,  * -\  CÇ 8, Ç  (     - a   - Ȕd ,,^=]ƣƣh^ dƭ$̭ ,,,,Ŝ,,I{,ƭ4̭ƭDӭ $ܭ tӭ,d ,t+ #|] )#}] !#}] #|`], l -!d  B 7 ܯ4< gӤ řǙșəʙ˙G*R{9 u  ޮ- q$ޮ, (ޮ64 _řǙșəʙ˙G*R{9 ۆ Dw ޮ@< W  Lg"$,,Ӥ,٤L٤lإ ٤ dY ٤إ mvÜĜŜƜǜȜ_wۆA` `dͤ٥\WX HXguF3d$ͤ,4,d(t'$|])$}] !$}] $|`], l -!d > 3 ܓt<$L\C  l!   '  $ ř$ řd 4T0$,ZP +94X D :  %G %*6:m  D% /  %řǙșəʙ˙G*R{9 řǙșəʙ˙G*R{9 20 4 W9D I,  " D #"% #/"J !" 4!q D  @, % ,$ T Ş%C$/* ř$0t<$'LܲT'C&d  &,($ * ř% ! %  D*;(L)04 /T 1)  "CCC=C=1h01q0 $,/0.1+9 4.Y-1D :  ۴-B, 1 % 2,1 2!": 3,m+3,8);+tD *;*:$1T #1  )0<: & <:(%1N9< 897&1-̓67"46*5'1D(5C4(1,,A)E+tDE(D)1TFD & FD(*1NCFGC & GC(+1NBGABz@,1#?@&4?*>-1D,>C=.1,I ,4=$T+I=H/1** řH )0" )2j ~ k      pJl,,Ӥ,٤L إ  d  إ w   Lt d m[}OD^ & o     S  ,     a  p Ş,rL L  ^ _ ,  l ƣd!ƣƣLKŞpA` ` & r   -  ginfo & slots_len (& )+ } 34g=#ͤf\S۴07 r   z #    _   ۴   [D   d$ͤ,4,d(t' &|] )&}] !&}] &|`], l -!d > 3 4$T p$,:$-4 _ۆe  Dm,,Ӥ, $٤LeإdO~إwÜĜŜƜǜȜ_wۆA`ɾ`Mͤ, L $\5$,,^0 6  %`%*6I6 m\ $    [ÜĜŜƜǜȜ_wۆv % 44ˆ ۆΈ pهuR ,Ն,,$m[}OD^8A`ɾ݇   v SK$%t<$LԁL E\+t<$L6 ğ< fLLŤ  . r$,,,")t<$  LT C  d/ A  ,\    Ц.զ$Ц,,,"զ)t<$L䕧\Cl! '$ק ř$ݧ řd֧ \4$,,S/ 5 Z$065m4,"\!"h  !| r 1z pY [-# %9"Qѩ-|ש x,ѩש'< ۆt"$Ī$ ř' !' $5 ʪ#*\ (# (#'#,4 $,,'c&#/ 5  &[%# % )%1 )5 +%m4Ĭ .#,ͬ 1\ͬ 01h ˬ / 0|ʬ  .l/C- #-  *%[ "*.# #"- |,-ì,!#'< ۆ+i#"#$ q ŧcjq=ت I P W  2%,Т,ߢ,,L`6Ez BqTɧ1! y) ]tTU&/  :kA`& utf8emptymin enough{got  #ܪ +  * +*   I    ~ wS & H( |ws"$L `*\    PP%*߬G V[ Q mv{  6"  $t<š) L\)).(, @#  9   $ĭĭdɭ a* tɭ   J $ APUa jo{ TT   -d rb,!D TT T"  " -!"d # r!a+̮$L̮% & # Ç$@%6#?.d #h!'  ( 'J&$*&[@,*OT,`+in-+z- .+0\4į 45. ů3/ دt231 201(/1\6 #65. 5.$5/ٯ P  MT{7Ԭ L+\w &4{$vφ/Ç$ 6)ƣ2 Q ƣÇ8 SM4TφcÇƈ\Ç͊Qq Ç   R   ! u*+. W ^ š`x%,i:!O(S S<  Enumerate<< 0{?ippIterp op end_or_lenopo2ЫS!  řǙșəʙ˙G*R{9 v   S   ī 6u5QJ-6?09 ЌEt}  T( 08T(T T0< GoyT(U U( +U  )  5 nsU  Ucnd2(WW&+8@ISYY &0Z&ZHZov5 BL21@̓2 4@1b;2_@/  C_.n;._ ̖ 9 41i$@' (@N C A _0x000003FF_FFFFFFFF(cc&+8 CLV22%@ 4 5@2dԎD0_?0x00000000_003FFFFF? PatternEpsilons::PATTERN_ID_NONE0xFFFFFC00_000000000x000003FF_FFFFFFFF(mׯmܯ&+8 CLV0x000003FF_FFFFFC00 100x00000000_000003FF(ww&+8 CLV 32(  ` +7ch gy~jo    + 08( /; F bl(   +7chuzfk $ (/a  `   M P ׯ %  7  ?P  :   P #  % 7 ? װ!& װ8 @,  L :> s    װװ& v .6  BK__self_0 b   ^  K Q (/ T!\ 2":F$ R#$!"# `19EQ-3AG ZPׯ~4< HT P !3;GS`ftz P  " 3;G S   &J S#4 @   g  w  װ$5A t -IOV]dkry%   dv -0?H˿Q] {  N ,w V.k|&˿˿( %  &*! ' *  6 ot      ^lwm<(= ( p? ))5`erwdi=MTM $MM-MLcMLMM D |  / 20_ ., ƣ._3 p% /7%)2p%% Ő Ő /8%  ) 2&   / 8&($   $$]lx  Ő ŐnwI U ) Z*s&(%  p%%   p%   %Ő %&&!G    jw*% !*3< V_<E'0 *3h=FS:C)P8A+ N5 >K 2 ;,H  / 8-E  h J  ktW`BK-6!>t3d3 3#T3 ID33 443}ÜĜŜƜǜȜ_w3D3 "?t< $LԵLİE\İ)tӰ<ذ$ӰLذ6 Ӱ<dL$ $,, 5%  %ÜĜŜƜǜȜ_wřǙșəʙ˙G*R{9 ۆ      V% m & +   [M# % 9q L$ʱ řDDZ ۆ| \4 *D D řd ۆX  ,,,,Ŝ,,I{ÜĜŜƜǜȜ_wřǙșəʙ˙G*R{9 ۆU ŹŹ ,ܹ}O    GNUݱ-t%,,,ٯLm[}OD^aBK$) 5"K' 0A3`6<hm&  Qj h5u$ , $ D 4,-% K$0C%mʺκ WUʺ]Һκ[" %8Ǻ# ۆ j!  ,r_/8`R$AX ayLZ _ref__self _ref__cacheܺ\ܺ4ߺ(Dߺ׺ /ֺGӺywt<$LԅLC\)t<$L6 ģ<dL$ $,, 5%  S $  0  a% m & +   [" . L$ řD ۆ| \4(D D řd ۆQc  ,kM &-4-t%,,,LCQ)$e3M A`  an tOb$ , $ D 4,-% K$0C%m Wf ܔ[".# ۆ (j   f,]J`R$A Vd7ق E\4(D  )yYt<$LԑLC\)t<$L6 į<dLї7ї $,,, =ї8  % a %*  6  j,L +  \  [" .d  L4 ۆk Ƙn  U"  ,,ؙ|E4 ۆdl ɕї8,,, ,LxPm[}OD^<t} $H A`  \n p*   o h$,7䔚 D4,,Ś5ݚ-  H, ,gp`*,$A t<$LԍLC\)t<$L6 ī<dL7 $,,, =8   [ $  0  p,L )  \  [" .b  L4 ۆq n  "  ,,bE4 ۆtr w~8,,, ,LS+ z@ [$ A`  s? P+  S a $,7 D4,,5  , ,`*,$A3I ̈ T 9 $,, D4:  \$ 0 C, L  (\ [" .q <   \< * LT 4L 4< + L+ d , t04 ۆw :,,, 4L % @ox >3ÜĜŜƜǜȜ_w7k  +A`patset l y+  l . < 7    d 0,T$\ T)< ܾ  * #     - \CCC=C=D « t4 .  T *d+ , $<   L $, 166 c<$ jÜĜŜƜǜȜ_w,,<,,z4# @ƣ  « O i$ Aŭ8ű Acurrent`     ۪ O  M  Ů  <L *\+ɞT]  [.&)d   ., T$\  J!< 䝨  * $   - \˨« D֨ + 4ר$˨֧T\, ,ʦ<, *,ڧ4d ~ƣM  "A ` y    \ 2ӵ   <L (\)ɢT]  .&'d   ., T$\  J!< ӵ  ( $   - \« !  "« 2#*l w^ 4 "c\,ŷ ,<,> X,4 ƣ 6  C cA `       qӵ A׼   d 0,D DT< ۪  (!   - \ « D  +4 $  T (d)d . ,<   L $, +06Ů W<$ c ,,<4 ƣl , L  $ñ sű |A   rP  ۪ \   ] Ů ,̤d $8.d 4tć| 4,  _$ d D  0 T\ + I  d܎D 0 $  t3    $ $ tŐĆ 0 $ L$,) >D<$*  %ÜĜŜƜǜȜ_wx}*m DT (d[ÜĜŜƜǜȜ_whv %  L $,+d ;[,9 D<" * ,, 4AO9Ѹb[ $ŷ إD,řǙșəʙ˙G*R{9 $q2Dm[}OD^ T     ñ ű   A start_id- 9      n        (! ,&<ŀ \ $,;ܲր ۆU<΀ _ۆ  l΀ԄÜĜŜƜǜȜ_wۆ,,,4 s  KHAJ`LN   m L܀'$ إ&   $ &$Ӂ, ",  2<, l,  -<" C "F\  t߂&  /$4؂ Wz =؂. $4 ,̈́уr ۆۀ ׀~4GإmLUg`Kc o   f +     c _ref__input(! ,&< \ $,9   < _ۆ  ` ,,Ћ,4  , GAI`KM  m L'$إя&я  $$$,\Î 1,Î, \  -,Ӎ Ӎ A ڎڎ $4*Vr ۆ ķ_4إ7@L` U   y W 7 ȨlȨD˨ *T˨+d $, +  +06'^ . :L R\ ,,ŷ ,X r  ? HUAWCY   \ ) ϴ\Դ $ϴlԴϴ &| *̟d $, +0 ;Ƶ V׵Ƶcl L\հ Lϱ,ŷ ,\U   UAWCY match_indexg*  ~ G «  « 08«  *3CCC=C=X]  ox based`fBB RandomStateBk0Bk1Q *3      0 9  *  3(ޚ ޚ1 : 0 9Ȧ    řǙșəʙ˙G*R{9 _d  v  (      % 5 EUeuŷ «  « b k <  H   ( 4ޚ ޚ s|aj P  \  U $    T ޚ   %« ,« 3(   «  «         (ޚȧ    $     JWi r! !"ŷ     7 @ %      ktV_AJ,  8 A-6@N \hq  R 4     aD'  123  4      5  6 78 9:  m;    oxYbCL,5 l $ X54-<  < *,     6  ]  & ř 6  7 L   zoL iƣ8 imߐ !ב l 4 W5D! <@4 W h@)LӃnLՂ řǙșəʙ˙G*R{9  0 Q y 9l $ߐ /4! =>4 W_=)L <ב (,҆     6  ߅ ԅLʅ, e P ƣSWYߐ  ב :ģ   '0,(_ߑ  ߑ 'ő-,ב(_`H( 2> Fmw( >` ?*H @ *  6 otÙ   Ucnc2( A` + B +  7 pu  ű      es~ s A( C` + B ŷ +  7 pu       ŷ Ѩ _mx mϨ ;,D *TDt' D"T "0 ddT \   ,  3    ,   tD( T*  D  &/  (D#\ #.l(t< $L dT  & (MdT  tD(T -H -j - $ŷ  $« ,!<  L!*!  %  ,إD,\ ,dƣNs,Hb~9ƣ#uƣƣcƣ/  '0ŷ 9CGJ start_indexYO  Щ ٪ m I  d   a  ľ   !0,(_   !-,(_ ('X % 7?x`>C OW [` rz 6 $kqx   . @+ t__self_1j  Ż ('X LTD2 >mx`EPXFd W _Gk w  PVdj   H g  &  rA   L^  j    Y E *2řǙșəʙ˙G*R{9 řǙșəʙ˙G*R{9   %+ 4޳  * 3#  +  4 řǙșəʙ˙G*R{9 ^c   u  ~Ŵ%+ 4 0 9'+  40 +  4. +  4(     \kw      $ }Wb  g 5 P s(       %   ޳ # Ŵ%'0 . $     &3EN[ou       r{[ dEN.7 ) #/8   c D&hqI~dmz_h u[ dJq V _,l  R [Kh  MV-cIRL_DMMZ?HNU%     ]l}  GP1:# |O    %  ޳  #       Ŵ%      '    0    .    8      \k w  bI+ i P1  kP p *2 *3(    AP\d(  p  +   +  7 pu    Xfqf4  ԙ   /,  / < (       ! Zt   R5  - L    S 3 T [D   <  _װ a|       %ÜĜŜƜǜȜ_wz  m#.   [ÜĜŜƜǜȜ_wbv %     ė t  $ E     #+ *\  jz5  , D jm[}OD^ 1   s 'r R q A   | 5[ Ci wm ! 19 "řǙșəʙ˙G*R{9 _d  v~ׁ  *   +3ʼn   (    ; G O  l  x   O 3 (  O !P, "F  , ׁ   @ *   * Q,ʼn  R)5SY g kq^d-3        _h t}  m:       ". 6?I ʼn %6 !,1 HMU\ "    ,1    H M U\ ׁ  '  8  *,1 HMUZbo H   "    @HP    c Ƃ T,̖ ̖ LҖ  )\Җ (Ɩ 8   d ,  t 4  ۆ[   "\    l -   \ 4 ( D ֗ #ܗ  ,֗  N  ܗ 7  $  ř җ Q 4  ۆ \ 4 ( D ̘ #Ҙ  ,̘ JҘ 34  ۆ 4   * # G<E   b$0,  L  )\  [".d   gŘ  4ә  ۆ9D  } t ,3: t  ,̒  ,  T 4 + F$ h إإ ?YAs    1:k $ę `   yHq { ] :~ [    O  #ĭ     ! 0, (_     !˭ -,ݭ (_ /7( -9 D `jΔ (   *6afsxej     × ! ((`   Y    $  6 >p ̹` ̹8) װ$08o   7  װYFjV (a>  u  D((` LTS 1=l T19UEQ  &9p ̹`  ̹w VN VWb W _Xk w    װ?H$3?tzr  6 ɜ u ɜ m  ] 0 A \Dm(!&p&إ$ إ6>@$ !x"$ 6> l# !W]dk y   ;CՏ إ#{ç  Ѩ d(!&p&إJRY19ZEQ@$  [0 8\D  P  "(6 <  Ox"r{3;UGS! % .7? P      Տ z Տ C ߰ - x> O>(> !+ >(> ] >!LQ^cPp>     (??&+8 @IS(? ^ ?!LQ^cPp?     ?  8? ?-9bGշ s??  &0? h3 ?D?&1 9 ù D Ubl ?&?H?  ov5 BLP?   (- řLessGreater%ӡy?řǙșəʙ˙G*R{9      &0 >I T?(- >CK??     9 FP 31AA@-  AA\-lA8,A,_ԊBB B5 20eB@#  BI$ BA9,A ƣ="_BB B5 20eB@#  BI$ BB9,B ƣ="_ԇCC C5 20eC@#  CI$ CB:,B ƣ="_CC C5 20eC@#  CI$ CC:,C ƣ="_܄DD D/ 20_C:,Cƣ._LJJ JJ  JJI\IIC=MMӵ $MMM, MMMl,M ,Mw4Yӵ 4P|PPO,O ,OX5y} P} {Q5̱Q$Q $Qӵ /Q QW Q QQh  ԉQ ' QQP\P ,P !ER2R$R $Rӵ /R SW S SRe  R % SSR\R ,R !ET2̪T$T $Tӵ /T TW T TTe  ԂT % TTS\S ,S !EV3̿V$V $Vӵ /V VW V VVf  ԗV % VWU\V ,U !EX3X$X $Xӵ /X XW X YXf  ԲX % YYW\X ,X !Ḛ[[ӵ $[[[,[[[b$[ ,[v3Xӵ  ӵ  [ [ 8 ,$̬^^ӵ $^^^5 ^^9 ^^]p$^ ,^s:ӵ  ӵ  ^  ^  g :̯aaӵ $aaa2 aa6 aaaj$a ,as:ӵ  ӵ  a  a  g :eeӵ $eee2 ee6 ffej$e ,es:ӵ  ӵ  e  f  g :̢iiӵ $iii3 ii7 iihl$i ,is:ӵ  ӵ  i  i  g :̂kkӵ $kkk3 kk7 kkjl$j ,js:ӵ  ӵ  k  k  g :pm(m m-9ɜ AjrYc(m _pm ` )5`erwdimɜ ˿˿mm ɜ &0pm&mHmɜ ɜ ov5 BL( a` b*` c *  6 ot     Wepf 5-t- -%T. ID.. ..-ÜĜŜƜǜȜ_w-D- ݃݃ " @ ݃݃ Wr   tW2#:ڝ83[ " 8.2,˞ >2|˞ <ў >(=$Lў1] <= A l < A(@%L9] ?@] ; <?A] B;I] C;ə]  BI]CQ]D&8?D')!]E ]] g4e2H(4<]G ř Argumentstemplateccg@# H}] ] [E!]BQ]CY]GFL,ڟ K2tڟ 4K(J*D M d 4M(L+Dڟ IJL I,-ɝT]   5f05N) R l < R(Q.L, U2t 4U(T/D W d 4W(V0D S TV7 T QS@P1&= O řPA ۆOʠ2 0 7 >  ޛ ] ] ]Xׅ ! , ,Ɉ,   L ?    , 5 y $  I    M  I c  + E   N ) ]  -     ٤L٤,٤٤@   إ,"|n  z~NevX]!]řǙșəʙ˙G*R{9   gkQGa)CA`fcachercache   revsearch)x 2 h 8 9left_valB right_valCE.& 6   { '      h &   W ܖ   ٥ q Ҙ ;    '  Ĝ q  ڞ p  g6  (ɱ g h h + B  +     +  7   g ~ α8E  QZcS\  h5>  J    / 8   }ױ  l T # ׅ U /<   ,ʴҳxl  L        2>_AVM  , ܨT C3,īôׅ   ,  `\ A, @ _ref__re(ͻ  b+ c +  7 puһ   ŷ Ѩ ŷ [itŷ iѨ 7 08 *3(Ի ٻػAP\ dŷ ŷ    08( /݃; C\f (  +7chuzfk   $<" !DT.D  %M$)5G m"!, *, /<[ " %  8 ol\ $ ř2L W:|f L,  t -T k6 L T   %< <$  lD \/2 T ZD    L !& 2 m !#.   [ " .O<" <!   &| $h K!*  ! "6!>KX"`BL} !" VP l # ̎ ,Dhm[}OD^ Q ,< x    !*JX Bz R9H L H#   e   C    r )    ~D  %   /7(  -9 D `j (     *6afsxej       !( $ װ$08p  Parse Translated..*   @  f #   g  V| hװ  ;  ( $ װH P$1 ={ lp   iNVjbV ^Uj v  JP^d    6 "QZFO  [. JX V m (' $p( H Pk1 =  {  l' l 1= n' 5;B P \em    u  A  v!(.  m. !LQ^cPp.     (8  nh8  o)5`erwdi8  (O aO pKKKK 7K7K736txU q  4EˎBoxljk###ˎ    $O  ވ       bp{ q (V rZ sKKKK 7K7K736zx_ t *  6 pu V; H T]fW`  l      Dt !%T MD ÜĜŜƜǜȜ_wވDʁ ӑ"ӑ+# K #ӑӑ,ç d˧$ѧͤ,˧4ѧ˧Dا٥C$ tاD l " 1"'4 #l d 01,   Lը  |ըߨ ˎ  8 ,ߨ  D t +" +  " Q  $T  " k"`ˎ b k4D   5  䊩,  t ˎ H -4  6 G7Ũ$ ,Ӥ,٤٤ f o H Lɨ 4  R    ˎP  \ \``   w ͤ٥ Z   M   , 0 d$ͤ,4lԌ4 $2pl ,Ӥ,٤'`)Yͤ d$ͤ,4l)| $3$$ ,Ӥ,$˵٤2`4ɾ7rͤ ,   L |¼ .,¼,  d$ͤ;4ڼ!ڼ̇ C",#  !1 5Ѽ] Ax A쳍 DӤ,   ռ٤Ӥ A V`XAIU/ )ͤ̇  bӤi ,   L | . ,| $,  d$ͤ;4!̇ C", $ -     1A 5g Aɾ?3 DӤ, X 8$ ٤Ӥ Ej`lAɾijg  ͤĖ " ӤL Ӥ$,0  b1mHl DӤ, `!Α , Ӥ$,d+ ċZ>_ct DӤ,ъ,ʒ )`+/  D l +!! O,D  l  + ! "l M,2$ג řL  |   A ,D t + " (  K T  # ,V4  R,Ǔ  ̴,ޜ  ϜtϜ < !4   ; K5  lˑ ,, T ] }    L y4  . 7 W  r M`   W 7            D l +!!˧ M˧*D  l  + ! "l M,2$ řL֨  |֨   A ,D t + " -  K T  # ,V\  R,  ,  t < !4  ; K5ƨ ,, R [ {    Lʨ y4  . 7 W  r M`   W 5          $ ř\$:L$\*d $,V%\$Z  ,,$%IN`PɾSEd ?  D l +!! M*D  l  + !  "l  M,2$ řL  |   A ,D t + " 5  K T  # ,Vd  R,, &,  t < !4  ; K5 ,,,( f o     , L 4  B K k   } X`&  o V (   <      E D l +!"l M,2 L  |   A, (  ,  #   j   L  T # ,V   R,4  4, t <  !    < L 5 ,, 4o    L ]4    :  K x5`  #S  T    m¹    D l +!! M*D  l  + !  "l  M,2$ ř D t +!  #   J  $4  m,, l , ,,  # Cy     ' 0 PA`  { 2   _ f D l +!! M*D  l  + !  "l  M,2$֊ ř D t +!  (   J  $\  m,, ߈Ɖ , ,,  # Cy     ' 0 PA`  { 2   _ f$ ř\$:L$\ө6ة $ө,,^ة1\$ ɩf  , ,Ψ,$8\ͩ$YA[`]ɾ`R _! D l +!! M*D  l  + !  "l  M, 2 $ڼ ř D t +! 0  J  $d  m,,, !ʻ ,ٺ ,,, . 7 W     ; D dA`&   S %   D l +!"l M,2D  t  + !   >   J $¹  m,,4/  , ,, 4G      $ DrAt`v y    S¹ ZD  +!5\ Ola F WUe  l ,ܕ  Properties Ie}o0 n w s  p K &t  F ] | Dү tү +! ү I#T  rdRT ,    ,Q   D l +!4 NDαJ ŏ< ,   $L  D t +!   J$t  sT$ ,    ,O   D t +!  I#d  rtQ, ,    ,P   xKKKK 7K7K736ch  z( /; C   _i ( u x #OTafRs     pŏ ŏ08إCCC=C= X]  ox   09( Tco zŏz  O  [      ŏ ( v p ŏ+ئ w  +   x   +  7  ױ  z 4A JS\LU ^+4 =    (   mױ d,t*"\ Pl*E ę $ԙ$ ,,Տ  إ/`1`?  \ $l$| F\ :D Z5$ ,Q`J  ʐɑʒΓ6{œ|   p 7\ $l$| FL 8D X3$ ,   $H   "l, ,< &ā $ԁ-$ W!\ ,,D , T $  $  ij.  $ G!\ $  l \  F  l*  & ̥4 D ,T, 6!P w,$ ! $,ċ6  $Ĭ, \ $l \ Fl*&4D,T, !Lq, $ !, !  $ ,,Z2p Țm $D ŞŞO $Ş%`minlen4^maxlen4ш  l   w  D^  ~Y ( g h h +ȩ B  +     +  7  ױ  z 4A  MV_OX  d1:  F % . sױ  < 8 L, 1<͆ |͆,Ն 2<ՆKlD |9 l T (   4<  g1}lև  Lȇ   -1A(Lj ,ֈ  (0Lj\ʈ eU,݈ʈĈ  ۆׅ È ,   &`/ A, d 3ޔ ‹ LƋ ы ,4 &- U Ќ_ӌ Ќsӌ\Ќp, QzU< ōƍ , $     cK.A&A,    , ! F6,% ۆ ,  `' AA 4 ( yh h +Ȫ B  + pĒ  z +  ؒ   +7 +1$   d  zYb n;D M V-;F;  y< 8 L, 1<ǖ |ǖ,ϖ.<ϖܖKlD x9~Ϙ lӘ dT m   y<  mv$ |D  +T+$˚ d˚,К  / <Кƚ ř _$ ř' řǙșəʙ˙G*R{9 ח  Lɗ F :-  ٦YtdAɾѦ\Ù ,ۙ  (0$ Ù+ƙ {k, Cƙ($  L =\ ۆ ׅ  ٦, @  !*3`Q A,ۘ ɾ$ 4  _ref__caps ֛ Lڛ  ,ٜ4؜ &- _ b\p,ѝ QzU<ѝ ݝ'ޝQ5ǜ , $     ʱKGA?8A,˜ 3ı @G NU , !D4,% ۆ ,  `' AM Y ( {ث | +X } *  6 otġ  ʒ  Zhsh6\פ פ, 4<OlD~9( ~ ʒ +`  *  6 ot  ݔ  Zhsh6\ѱʒ ѱ,ݱ 4<ݱOlD~9(  (   7   * (2˞$/    O\nw ˎ % ?H$-       ˞ bc "0 ,(  $       (    Rar ;D$-  +3( 1 :7 1 :*   1 :(   1 :2 ˞ ˞ 1 :(     % 5 E ˎ+4~˞QZ%0 }E -4;BI*2*2*2    *2% řǙșəʙ˙G*R{9 _d  v %  + 4)+4$ +4* 3 * 3% + 4& + 4 * 3 *3Я*3د!   !0 9# #*"3(    "n}$ŏ Zc 5 > zS \,5luFO    ,  c3 R Z)  )(          %%)$ % &    " !"а$#$ذ& %&)()#'(    !#%'(5G*P]+qw*+,   t}] fFO09#    enx lN 0 xZ;^" ,)I%  "           !  !       ! ". 7 {dmMV7@!* _      %  !% ) $        %   &       б ر      8      n}ŏ rS:!v ^@)qX? &  gL1  R8pŏ *2 ParserBuilderempty_min_range)~CixJ Ǣ&TranslatorBuildereflagsWmoTsx ( DSӑ_ gŏ  . : 6fŏ ( p ŏ+  , Ǣ&  -  9  ױ  | 7D MV_OX a.7@  !* oױ ;B A   C FlagsLiteralDot Assertion ClassUnicode ClassPerlClassBracketed RepetitionGroup  Alternation Concat Z$W   CHir^2%5_V DѼCCC=C=σDۼCCC=C=|$ wD 34" ppp opopo2Ы  3"  P**¨**/e  3ch    Q݊  3      Œ̽̽2, @0 3<|$D$34WT4   2D̽U, GS 2  N Ŝ !\uxU̽< _σ2(̽  %ÜĜŜƜǜȜ_wσ2z̽mσB#. ܾ:۾[ÜĜŜƜǜȜ_wYv % 2~-3$B  t$ MσU J:L B }"܉$#3$ֿ'\ֿ "'+&3#*$ۿ wσ&U%34ۿ3ҿ Q݊ppp opopo2Ыσ#%"3ҿ3  PZipJJJJ by]݊"!3(!  *(  Q*)3 +) + ,) σ  -)Œ .)̃ 52 , 5143<,@ "҈@(?)31a 34T 4- 6 1D^ L 36L.2!1 8, 7 NŜHc4MzU8 < _ٛԛ271"1(   %ÜĜŜƜǜȜ_w10#1z 90 9$% ;0mA#./;  4'8 :0[ #:/&1!Q 4,3$ = A  >/t $ M=U>J<(8L  A J  $?j*3 +40} A.B.b/4r0 43'346 6 M /3^ A37u3B39Z̼  ½?      C  ,D͵r҈(҈҈݊M ݊ ݊h řǙșəʙ˙G*R{9   ݊ T  Œ σƽm[}OD^σe  ÜĜŜƜǜȜ_wσ  Parser pos capture_indexinitial_ignore_whitespacecomments stack_group stack_class capture_namesscratch*9lF{0  ) 2 σ d   σ   ݊:   σ  ; W řǙșəʙ˙G*R{9      Œ   m[}OD^nÜĜŜƜǜȜ_wٛ   TranslatoreBq3   1 Ԝ  (1   ҈   ҈  asts'hirs O, X (4 , -O .Ot / K : ;h,Ƀ%eO܉#׊~Y&Q2@W܉  t 6  œ_  @  N  ۠o ҈< C ҈J Q  ҈f m  σѾ| <־)ھ(@\Ŵ _ref__pid́| <) Ԝ ٛ T$4( &)'1<%DO$W\ŏ( , A<\$ w$#4# Qppp opopo2Ы  U#-< R̊̊MapϊЊD^)cOӹCCC=C=Y#L4( ') ,  "ϻ ( !1' t   i!< & ',,"+ܵl ZP'  %ÜĜŜƜǜȜ_w   x}   m %!, 4 T  /' [5#/ P %   ˎU & D ^9> $FQ  \ ŏ  14 $  <  ˎ rL1  $ , %  ! $ &  " !"  D 8 ;($ #5  #9 ވ@%IU&^l#{(&#(HR#  $@ Q%ct&t ' (" AHO ) ̬ ,  $ŏ[   ϻ$ӹ$ŏ@   ϻ$ ,m[}OD^ z   $ ,  4  ljk# < ވ Ej  <?F;T   j    m\ ^ W  m 6 ͹ [ v G ;B E ϻyϻ ϻ C ŏ ŏd4 Dn   O  ,  +#d  Ttˎ      (%! %! +ȿ&! I * )!!   CCC=C=exactT>q    W]ױ kq^d.4  %!    P^i^,ױ 0< /7<)2(< <<BQ] hŒ(< 0< I*<   +  7 pu<  Œ XfqŒf5Dz|z$z 14zxz#( # z  f T &Q Argumentf0m֔49d       g   "=" ,#(,"q"  III4 K"UZz4 {zhBorrowedOwned9cgMz,z 9{Œ  'E{|{CT{,{ .|T| $|d||,|C<||(l|<}ܚ}  })}'  ~~  ~~  ~$~"  |     " 2 B| ˎ,|,|gL3˞S ;i!(/6,, 4_cacheJD< 4LC$,Œz5Dڀڀd 4tG,ʀ,Œ}8|< ,L0$ ř̂d҂,̂t҂*̂"\ Pl* ̄ D , TȃD΃,ȃ T΃U4   { T * WŞŞU|$)D ÄDɄ ,Ä TɄՄDۄ,Մ Tۄ>$  {T  (u WŞ q$)l, 4ǁ,ہ5Տ إřǙșəʙ˙G*R{9 ŞVŒŞmŒŞ`   < K&T|*6Şsp#w*T|*6Şv*܆4 $܆,,܆G WU(-, ,,*A,`.j, \< *L < *,$t J'e}  / ̳4$,,ƈ:#<͈ WfL͈܈t$, ,, 5A7`9rɊ4Ί$Ɋ,Պ,܊ΊЩɊ  %X$)5HɊ m < w,  T %#  T  $    L, *<ܨ D  !#  a <,  TATދ $ф <( ,̒@!׋_ Č\Č<ƌ(Lƌ ř֌ ov}<:, ,É,މ, Ŋm[}OD^EJřǙșəʙ˙G*R{9 фmфbE_ĊфJ{* kAn`q&tw ` 1 == p~@W5̬4$,,:#<Ǝ`LƎ*ގ4 4ގ|* , ,ʍ, 4"+KAM`O R*B( xɏ    @   řǙșəʙ˙G*R{9 \ 'Ѐא#      '5IO]ciox ؓ    > J+ 7 #       -ї]%.I;!*7&4           t  4=' D 0,T1<   T  , řÜĜŜƜǜȜ_w \   0, T1  <     &T  :, $, ř  $ָ ř( Ǵ|řǙșəʙ˙G*R{9 -, ,,řǙșəʙ˙G*R{9 Cc řǙșəʙ˙G*R{9 ɡ{OɡD <A` 7 DT.dHT,x9~T ؓ$d,I<(lA \Ԩd 0 ttd 0 td ܏d  0  t\ d  0  t$"         # 3 Cˎ,, >y ї^~˞Dx ˩f,ͪBIPW^dd , G6||&, G6l l ",  G 6 d d ,  G6 , , H їt  B5AnD.,T/< T ,2 ̨ $  l $,,    \  ., T/ <   ɡ&T 8, $9, $ l޵$,,   l޵$,,TTl, ,,rgT,yOɡD<, A`H _err ܻXN޵\޵s޵ D.,T/<   ,4 " $ % $,,     \  ., T/ <   ɡ/  :, -;5 $%$,,   %$,,  TT, ,,zoÜĜŜƜǜȜ_w,kɡr,; A`l ܻ  "Hܻ 49^D.,T/<  ,ԓ2 " $ "| $,,     \<  (L\., T/ <   ɡ/ 8, -95 $"|$,,  \< (L"|$,,$, ,,, XuɡjAb,  A`] ܻ  ܻ '  G%,Â\Â*Ī $3%5d4,ī L,< \̭4 ؓ$,, е  X #  / ԭ m ՃՃ  ,  ,ƃ \<( L řĀ"<ċ W  Lċ4 4-. $,-H,)% $,ˌ,Ҍ >+_,_-$,,,($-$,,,ǎ($ ř\  ԑ, ,< "L,"(!< ɓ$<ɓ˓$(#,˓ !#@$ܖ  ?Ĺ '\<'(&L% -&vDߓ %6ߓ(4Ô *. $,*9,˔)) + ] 4 W)y+=(z ř(  ~dkr., ,,,y Љe řǙșəʙ˙G*R{9   <\,٤,٤L٤إ$Tn  A`& \ BHܻ`#   l C   <L3 [*ܖ  x@D.,T/< .쯘  ,͘4Ԙ ,>  4     \  ., T/ <   ɡɛ˛  ɛ;,4 ˛~DÛ  \ 0 ,ȟ=̮  :,۟4 ;Е ||fٖ, ,, 4c9.ÜĜŜƜǜȜ_wm4ɡ4ܜ7  % &A)`, 0Gܻ$  Zܻ$x( P ؓ,8ejw|gl   ) lб,ֱ ,б<ֱl -б%Dޱ X3ޱlؓ4 ̐B -\, <    4س ³ij  ³ 2 ijؓ4䀴B- \, <   ɡ˵4޵0  I8 ."`"` g.`J 9@`` [^%öı), ,Ȯ,٤,ȱ٤#إtc3"ɡ4 }A`` @V   6LؓT.dIT,x9~LؓĨd ؓ4tƽHˎ,,~9Lؓ举\¾ ؓ4,ξ¾۾V, ,x&A(Wd,t*"\ Pl*Lؓ4.,,/ $,,*> 5  ah 5    d< ( L$ ř$ L ؓ%l޵ /,, \4( D\ , , 2T RA'8 ř hl, ,,BՏ إ$$L|XrSA`ܻk  ( ] , ޵~<  d,t*"\ Pl*Lؓ#\ ؓ5,,̟/$,,*< 5  _f 5    d< ( L$ ř$ L ؓ* /,, \ , ,)tI %/ ř , ,,Տ 0إ9$L$[A`ܻ   v=    d,t*"\ Pl*Lؓ D ؓ5,, /$,,*< 5  _f 5  $  ,  $ L ؓ'| /,,  $, ,,Տ `إi$LrAt`vܻ<  ϔk2:d,t*"\ Pl*Lؓ+d ؓ5,,,!/$,, *<  5  _f  5   Lؓ,\/ĿN. %$ ř$  L ؓ2 /,,,( \4(Dd< (L\4(D\ ,, 2T @& ,* \<(L ř", ,!<\ ,#," #P$ܖ !"? &d< &(%L$ -%D  $8)L'ؓ4(3'>,(6,) ), ,,,&Տ gإp$LR= 9 ) h1K,٤,٤٤إU' oAr`u&xܻ `3 ޚc O -  ? ܖ   cLؓ9̷ ؓ5,,4/, ,, 45A7`9 <(  P ؓ,p I +  7 pu   aoznƯ;D,T ƈ шDD ,T$ %$ lZ 5䂉4 + $Չ Ş܊, ,܊<l -܊GD X3 l, , <dɋ  ܊z$ܖ  ?  !L L=܋ $,J@ 8>  %ÜĜŜƜǜȜ_w x} >mDÌ[ÜĜŜƜǜȜ_wDv %hTDD řd t" \ "/ !t&4 W!` D3 d# ġ#$Ў$ řD͎ $ێ  Љ͊ь4 %ه%, ,,ŞDl Ş$Ş٤Dъ٤D٤إl8m[}OD^E'9(l[ A`Ŝ min_startlitmatchD Ŝ! revinput  9 ) w ߱ g . ܖ g,3  lŐؓ4אŐӐO:\Ӑ,<  4   = ؓ4В  仒̒ O: \̒,  <    ɡ40 TC."`"`.`H5@``X# ߐؒ), ,ɏ,tiX ɡ  O3ZA`6G lؓ4̊O:\,<   4  0ܢ  @Lƙ. ؓ4   O: \, <   ɡ4C܌  VELÜA"`"`.`H5@``X# ɖ%, ,,Lx1 ɡ YSnA`C X_23LؓT.d IT,x9~Lؓėd.t Hˎ,,x9~Lؓ䧡\.,ʡ V, ,r&A(Wd,t*"\ Pl*LǤؓǤ4Ѥ.,ؤ,ߤѤ( $,,#> . j 7   _  DϨ", , <$ ř$ Lؓ%l޵/,,L ؓ4 .,æ,ʦDѩѩ<ک (Lک% -gD {8/D4(D\ ,, $ܖ @$Lת* $,Ъ;%;0\,4"D%< %($L"`"`.`g!5$Lؓ%l޵/,¬,ɬܴ@``! #Dׯ(ׯ4(('D4*"|4*()Dׯ"& ')T $&C#( ř# °  Ǩ+l,ģ ,ˣ,ޣՏ /إ8ܺ$  n٤D٤٤إ6y$L RB A`ܻ$Хܻ hm_startcfwdinput\ܻhm_end"q% y ޵  X ܖ  ޵F md,t*"\ Pl*Lؓ#\/,̲,Ӳ($,,#< . h 7   _  DǼ", ,Ǽ <$ ř$ Lؓ*/,, L ؓ#\ /,,ȴ̵D< (L% -ǼgD }8/Dɽɽ4ҽ(Dҽ\ܽ ,ܽ,ɽ Ǽ$Ľܖ @Ľ$L*$,9%90Z,4"d ř" "`"`.`g!5$žLؓ*/,, @``! #   #߱, ,,ñՏ 4إ=ܮ$ڶ t٤D٤٤إ:}$L g ;A>`Aܻ$ijܻ ܻ@" W$ L =  ܖ c*_d,t*"\ Pl*Lؓ Dϔ/,, ($,,#< . _f 5   ]  $  ,  $ Lؓ'|/,, L ؓ'| /,,  $, ,,Տ إA$ {^A`ܻ$ܻ  gϔwd,t*"\ Pl*Lؓ+dޚ/,,,!L ؓ, \  /ġ N . %0 ($,,#̤4 $,, X #/ Ԥm  , *  \<(L ř. - V DD D4(D$ ř\$Lؓ2/,,,(Lؓ+dޚ/,,,!Ԧ , ,"<\  ,$, # $@ $ܖ "#?!D ' < '(&L% % -&} D !%7 /L (ؓ4 ) 3 (>,)6,)  ~$ *, ,,,Տ إ(9x[t ЉuV Dn$ c,m٤, ٤٤T9إdX }A`&F  E+ܻ$ܻ  `  + ޚRH҄1Mޚ  ܖ V  Lؓ9/,,4/ , ,, 45A7`9 <(  P ؓ,  , X   ,   ם-ȵ +7Y_ ms_e.4      םcl  {wD +D,T   چ lD , T$ *$߱j X 3䛇2 0 )$ Şt l    , , <1 ފ6 *lČ -GD 3 l, , <t  |$ܖ ? #L|̐ѐ $̐,KAѐ}̐ [ %1̐m t %Α[ " %ÜĜŜƜǜȜ_w*D!", ,$<DĒ'!Ē<͒ '(&L͒%% -&gD $%7#/D*!4*()D\ ,+,( )+$ܖ #(@"$Lѓ ."1 ԯ $,ʓ.;-,2   %ÜĜŜƜǜȜ_wÜĜŜƜǜȜ_w-, /, /2 1,m 218 2ۓ 0,[ÜĜŜƜǜȜ_wv %0*4 71D;!< ;(:!L4 313tٔ6 ٔ\6, 5tٔ&45X4 D̔34%D>!4Ö>(="DÖ4͖@7|͖4Ԗ@(?#DԖ"< =?T :<C9$(ݕ8 ř9ڕ 8 *TBDϗCABCA&)tF 옘\F, E't&4EXD(D3DdޘG ̘G $H řD H*  † Б M      Iȅ!, ,,ŞDƆ   Ş $ʇŞ O y n  L ٤D٤ ٤F إ _     : 3 j s   ٤D٤o٤إ eMm[}OD^ϩ$>  \  } m `z'pA`Ŝmin_match_start min_pre_startD Ŝc ٿ   O !_ " w 01m37  ߱S    ܖ y 2     c +  ܖ   ɩU ۬\ w[ H lؓ4̄O:\,<  4؜  $Խ  @" ؓ4  䀝 O: \,  <    ɡמ47Լ  VE5"`"`.`G5@``X#̟˙ ϩ0, ,,zo^ɡ  O9\A`8G  Dԡ4ԡݡ L<\ݡ.<ʡ  ϡ  ʟ4  0  @L.\ ם4Ť    L< \. <    ˞4Ȧʦ  ȦWFLʦ"`"`.`G5@``X# ͤ%, , ,ݠLřǙșəʙ˙G*R{9 :.řǙșəʙ˙G*R{9 aV ˞E8 gl`Ac`fk G^TLؓT.d IT,x9~LؓĤd.t\ثםثd 0t|ƫ˞˞,B˞   sˎ,,ˎLA˞1A3{d-˞ˎLؓ\.,|˞dם#, G6ɭ Ƭ,լ ,ܬ=A?o d,t*"\ Pl*Lؓ4.,,ñ "| $,,= ݱ( `g 5  DD  $ݳ L ؓ%lǴ޵ /,մ,ܴ ǴL ؓ4 .,,  ȳlذ, ,,°Տ إaܘ {^A`ܻ$ܻ matornot  S ޵d,t*"\ Pl*Lؓ#\/,,̤׷"|ܷ$׷,,ܷ; ѷ( ^e 5   ]    ƻ\ƻ<Ȼ( LȻ$ ř$۹ Lؓ*ʺ/,ݺ,ʺ L ؓ#\ /,,̒ ӻ<ӻջ(,ջ$taG&* ř ۻ ƹ9ö, ,,Տ إd܌$ 4wA`ܻ$ܻ +L  < %\d,t*"\ Pl*Lؓ Dϔ/,Ž,̽ "|$,,; ( ^e 5   ]  $  ,  $ Lؓ'|/,, L ؓ'| /,, 짿 ߿$, ,,ҼՏ إ@ܡ$ {^A`ܻ$ܻ  fϔwd,t*"\ Pl*Lؓ+dޚ/,,,!L ؓ, \  / N . %0 "|$,,4 $,, X #/ m  , *  \<(L řġ( - V    Ի, , <$ ř\$Lؓ2/,,,(Lؓ+dޚ/,,,! #L,#("< %<%($,! "$@$ܖ  !@ (\<(('L& -'vD &6(L )ؓ4 *3 )>,*6,)  ~")0+, ,,,Տ إ(9x[t ЉvW  nܐ$ p٤,٤٤vPj)Cإ`T A`&M  M1ܻ$ܻ ` $ ޚKA+ Sޚܖ D  Lؓ9/,,4/ , ,, 45A7`9 < \<(L'DLTԪ & (Mt  &  (M  ́<,T 2  T  $  ф L,(<ܭ@# b <, D 2T $ф <( ,̒@ !^ 42 ,T8vƣ5DƣĊ_фT :TĊфR& slot_startslot_end  v{Mq%(  ` "NS`eQr   <   A l ,  .(   p "NS`eQr    4 <    , 4d C ̌  qL, 4 <     , , , 4  DAG`J Nʔ řǙșəʙ˙G*R{9 ]b Ɩt|(    -9AƖ Ɩ]g(    Ɩ"NS`eQr   ("  # řǙșəʙ˙G*R{9 \h"  ї  +6+K(1  1 "NS`eQr1     ҞОJ řǙșəʙ˙G*R{9 ]b t|(I  I  -9A ]g(I  J "NS`eQrI   ڢ(R  S řǙșəʙ˙G*R{9 [gR    ң*5*J4V ң|V 4V  W1DV V   %G#(4GV mV dV ,V tV V  %" \  V" \V   lV ' W  <  _ۆ  qd     ֨  ) ɡ, , ,է ڨ   d  v < gpA`fwdcache _= D $   4    ۆ   4  <  .L <Ԯ  Ԯ 4ܮ  / Dܮ Ԯ 4  @D Ԯ( d At Ԯ* Tү   f /  ͯ B,ޯ 3ޱ    Į  ϩ0 ɡ, , ,   LȮ   M wAy`{}At 'V4  <  .L <   4  / D ̴ 4Ŵ  @DŴ ( dδ Atδ * l   ( t Ҙ  ?, $ > <  _ۆ  qd       ) ɡ,Ȳ ,ײ ,   d  t <dmA`revcache Z8Ҙ D $   4    ۆ   4ٹ ٹ <  .L <   4  / D ̇ 4  @ D ( d  At * T   r 0   B, L ;  շ Ϲ  % ɡ, , , LӸ ӹ  L  - _A`A Gv4  <  .L <   4  / D  4  @ D ( d  At * l   ?    A, 4 ; f <  _ۆ  zd      ѿ Ӿ ɡ, , , 4   dտ    OwA`  uS1D $   4    ۆ     08(    /;C _i(    #PUbgRt   (  * řǙșəʙ˙G*R{9 \h    ,7,L4 | 4  W4D    %K$)5H md  ř   %#D  9 U[a , 4 m[}OD^~R4  =, (    "OTafQs     D`` *`(2  % , , p`Q D`` *`(2  ) , , p`Q D`` *`(2  ϩ0 , , p`Q D`` *`(2  ڀ) , , p`Q D`` *`(2 Ԅ ̅% , , L z'`)-i D`` *`(2  Կ , , 4 z(`* -i (   س řǙșəʙ˙G*R{9 \h    -8,M4 | 4Ö  W4DÖ    %K$)5H md֖  ř ˖  %#D  9 U[a䈖 ,ܕ 4 m[}OD^~R4  =, (  × #PUbgRt    < < řǙșəʙ˙G*R{9  4  WzD ̨ 4  WLD T   ϧr ϧ0  @, L 9      % , , , L  L řǙșəʙ˙G*R{9  ?HA`A)ǂй  08(    /˞;C _i(  к #PUbgRtƪ   އއ̉(    řǙșəʙ˙G*R{9 ʟ\h    NJ-8,M4 NJ| 4  Wʟ4D    %K$)5H md  řη   %#D  9 U[a ,Ӷ 4ڶ m[}OD^~R4  =,ȍێ (   "OTafQs     D`` *`(2  % , , L z'`)-i    )1  *3(    > MY d      (    I *   ,  8 qv      Ucn d3      8    > MY p   \L; ;  #/@?  ; M p/z |; ; $ 'K ; :'  ,; $,3ƣE_pP  /7Q )2(P  P P > MޠY ޠd(P  pP  *Q   *  6 otP   ϠR`ka0 X  lX X" TX ,DX X X#   %J$)5HX# m !, X    X tX  $X  A X X [ÜĜŜƜǜȜ_wװGu %ÜĜŜƜǜȜ_wװ X  X ! ))W V f   4XU w~ W& Ϡ,W DW m[}OD^"A-6c'  `Ҧp҆ *2@ *3(    A!P\Ҟd(  p҆  +@   +  7 pu ! Ҟ  Ygrf4슗 ܊  !2 T  MD    —   ٖ& D ϠޠTޠޠd   @ < Ҟ,  1L   7 $ Ҟ,  1  T  $ d (   H ,   ' (N' D  D   6* t  4   # D   4   0 D    )   $  5  ; t  a          , Ҟ, D Byƣ*4 l 1  Ƚg?qublocksb real_capacityp8  .N¸ wȽd $ ͤ, 4  D ٥C$  t 4 <    Ӥ  -   $ , lb( F đ  _ۆ ӤUپȑ đ   Џ }  ÜĜŜƜǜȜ_wۆ Ҟ, , Ӥ, ٤, ٤g]A\`^``ͤj٥Eɾ  *: VXGhΑ lΑ <ґ (Lґ ۑ  ͑ پɑ Ϭv<4dӛ $ٛ ͤ,ӛ 4ٛ t <  $ L  \ El !   '$  ř$  řd    4  T ֜0 ۜ $֜ , ZP ۜ+ ֜1   W $ 0 ֜1  mМ7    [" .0ȝ    D % / $  řD  ۆ| 0t   ˞ <ў Ӟ  ў ,Ӟ $  řD  ۆ0   D % /J t  Ο !<ԟ ֟ ! ԟ ,֟ $ řD ۆ  0 $ ,$ T  $=#)* " ř#. ۆ"5 0t͠ <Ҡ $͠ &LҠ ͠ Tܠ &C%dܠ ̂  %, ' $ ) ř ! )7'L (,4 -T /(/#.1,0  $ , -j.`,1+ 1  ,X+1 %0+101 2+m32ޡ7 3  1+[" 1.31΢ 52֢ *5, 8( ;*t D ;(:!1T $ 4 řD  ۆ4| / <:  & <:("1N9< 89z7#1#̀ =7 =%$ ң ?7<أ ڣ ? أ 6&1,ڣ $ > řD  ۆ>/, B( F*t D F(E'1T  GE  & GE((1NDG HD  & HD()1NCHĉ BCzA*1#설 IA# I,+ ڤ KA<  K  @-1, $¤ J řD  ۆJ/ N ,6@$ T * N=M.1** L řM.  ۆL  (0(0 -(2 `/ Ǜ  Ɯ F M T  Ý  ƞ   ɟ      ԡ ɢ  ͣ  դ Oׅ ! Ҟ,ޚ , Ӥ, ٤,˛   & L    P       $   ,   $    o X $   : q Ş ,Š  L L ء @$ , zƣ$ <  ~.ƣƣ$ IŞA``&ʜ  :} F ` G !( %"'&#(*  1 2s 56'?@_Kͤ  r    x ?      2Sk d $ı ͤ, 4ı l + T  $ , ;$̱ & ױ    Ҟ, , Ӥ,հ $ ٤=A?`AɾDͤ' $   t < $  L  T D d # , B < 6   E #,ƻ    dƻ $̻ ͤ ; 4̻ !  ̇  C"$  ݻ,  !      !1   5޺ f  !!! !A !ɾ ! *wI F9Թ ҞD , Ӥ, {5k  ٤Ӥr5sAu`wɾci}ͤ8̇ Ӥ$    |  $  ,   d $ ͤ;4 !  ̇ C"$ 0  !    !1  5 j  !!! !A !ɾ ! "D ҞD , Ӥ,   ٤ӤWXAZ`\ɾ]cNRͤ̇ Ӥ $  ř \ $ :  L $ \ 5  $ , , \0 6  Z$ 0 C6 m \ $    [" . 4  ۆ    u  Ҟ, , , $  Dt`{A}`ɾ   |  IW1t < $ L  L C\ )t < $ L 6  ċ < dL L   ؇. ݇  $؇ , , , ݇) ؇/   _  $  0  ؇/  m   W UD       [" ..#  ۆ* .t < $ L ܙ T Cd /  A ,Չ \Չ Չ .  $ , , , ) /  ]$0 / m̊ Պ  W D̊ ي Պ  [ "..Ɋ#  ۆŠ* .t < $ L 䃋 \ Cl !   '#$ŋ  ř$ˋ ! řdċ   !\ % $%4  $ , , $S#/ 5  #Z"$ &"0 & 5 ("m4֍ +,ߍ .\ߍ -.hݍ , -|܍ +a,8* ! '"["'..- |ō , *Ս )!ō' Ԅ   W (  /"   ۆ/% .$Ɏ 1 ř ! 17ώ 0$,\ 505#4%/,4  $ , , 4c3&// 5  3[2'/ %6216() 5 82m4ɐ ;0,Ґ >\Ґ =>hА < =|ϐ ;a<8:+/" 72["7.*/  0.- | , :Ȑ 9,/'    W 8 ԏ ?-/   ۆ?0. 00  ݆ ɇ x       ދ  F MT  ݎ @% Ҟ, ,˅ , , L M  %  W    .   9 n  jWJyT 9)  ;lT _.7Bs3A6`9&<Bmaybe_hmD͇    P –D   W   ( '6(l0 8 H783%k8  o  } S .    o  } f A  D R T%e9 oƏ% d <  (L      x/ ފ dފ <  (L   l ݊  ڊ x   d <  (L       x   d <  (L    ԏ x (    hҞ+  B + p  z +     +7 ,2$   e ! Оz \en;D M V.<GО;  z Ҟl d T  d    Ҟt \     ~q  L  _ۆq\      řǙșəʙ˙G*R{9 ÜĜŜƜǜȜ_wۆ! L Ҟ  ׅ !NNAEɾ<3Nۦ Ҟ, $ ! T  Y I, A "   S$0C$   L ;\  [" . ۆ   "  ׅ   ,  Y 9ҞMV_h`dҞA, ɾ$  i` + 9 (    hҞ+  B + p  z +     +7 ,2$   e ! ОzYbk8A J S+9DО8 w  Ҟl d T  p     \      w }  L  h\    %I&+ 7 J  m     %řǙșəʙ˙G*R{9 ÜĜŜƜǜȜ_wۆ T$ | D ) T )  $ d , ) <   ۆ  řc  $  ř'      Bɸ$ L Ҟ m[}OD^9mׅ ȶ Aɾ R =ø' Ҟ, $ ! T  Y I, A "   S$0C$   L ;\  [" . ۆ   "  ׅ   ȶ,  Y 9Ҟ`dҞA, ɾ$  i` + 9  CCC=C=X] ow  09( !  A!P\ g) 5 f(     +   ,  8 qv !    \juj8( % ׁ >C ׁU ]` ÇH =BNV= !   B !  M !z  ͊$Ç6  ׁׁ~ m <( % ׁ hpQYf Yaom y ` ÇH JSRZgZ b@n z     ! (1:B͊<']W`KT]gRv     ,K͊F2fƦ CCC=C=W\ nvh ( ! !2>F q{# (  Ʀ  ,h   +  7 pu !   Zhsg4    ,!   ' (N  Ȩ<  ,ڨ ƣ7_(   42   $ 08x !, $08$ #/7 ! ׁh" ÇY^ jr  ׁh ÇY^  jrP h Ç<A M U CCC=C=^c u} $ 6 >h Ç$0 8V ! y !# !B   !  _er{flyE !CIV_JP]f !b ! ! !  ! MSZahov} ͊Ç  ͊ Ç͊kׁÇ@,͊[ׁGÇ3 kt     v__self_2m+  =  Q  %b2 (   42 < X =`2 >: G @<S ?@  =>? ;k ; , 6'70 48< I:6U9:rx789 $ 1233; H51T45  2&34 9  &! 'ׁh" (Ç) n*v +&w, -'.0(/0-3ױ A)G*+,-./ q   ׁh Ç nv  w! "#%$%ekױ y !"#$ P h ÇQY eYanzY_ms  4< IU + N W 4 <;H  T      h Ç4<IU39GM ` ! {A͊1: ͊F# S ͊K7͊#oxdmYbk͊@             - q   e& U'E(& 1 6 <       , ױ Q ױ v   {   !   !'-3?GPZ%H +: JN[Nh    $##OOPPQ1 Q? ORa Ro S S T T U U V!V/?WQW_  2 XJX .Y?KY X LJd MKr w LM#, ZFZ.[?G[X HFd IGr w HI#$ \B\-]>C]V DBb ECp uDE# ^4^! _5_ׁh" `6`Ça7ab8bׁc9cÇ;4<7$*;7<=:F d&d e'eׁh f(fÇg)gh*hׁi+iÇ-&.)$*-7.=,F P jjh kkÇ\lmlXmi mÇ"# "#! nn.o?oXdrw # pp.q?qXdrw #h rrÇ.s?sÇXdrw ͊͊#!$% $%# #,~0'1* 01//2(3+23# #:">5?8>?= ="!@6A9@A# $#  !         ! ( / 6 tB K T \ d k y           ͊͊HQZcd͊?v͊Qs|͊͊3<E *3  ͊~   ͊                 ] f o x  &/8AJS\enw"+4= G U __self_discro __arg1_discr__arg1_0CѧPѧ    ѧ) __arg1_1   & u 'T (ѧ ) *__arg1_2 +7 4  5 6ѧ^ 7= 8 9 Bѧ% C Fѧ G Jѧ K{  e t  B S    u  /7x CCC=C=W\ nvz ) 2~$ CCC=C=CCC=C=řǙșəʙ˙G*R{9 KKKK 7K7K736$*  =G  P̂  h   09Å  *3(s !   s s  $ s! Ϭ )2  m vHS جvӭA԰W ;   ^el(s  !u x    z    ~$   P̂ h  Å #      (s !CIP^gpyϬmvXaCL-6!  HQ[i w ϬbE( 2        c    "     Ud!uR[=F(1#u   x   z    ~$         P̂    h        Å     8s !  s s   $ s! kL. 3{a A )1 )1% *2  )1%  * 2! řǙșəʙ˙G*R{9 ^c  u }( !   !<H S\e7 CqB(  !     %      % ! #    4AS\i} !  x[=$ c        !!2 ?H    %    %  !   8 ! !<HK3(  "(4 ?HR( '.6H QY$pxC  "  "  OOBAPU gop  08 000.0.FrTY ks 000.0.FrTY  k t 000.0.FrTY  k t# 000.0.FrθUZ  l u( "      % m"|- 9 @ L x  R9#*(  " p           # $    9FXao "    |^@+            ("9 FO  @   PD (- JY^ Qpy~   Œ$  \ ( ,  1< , "+[T 4    D O ,   L   <  _ װ _   ܰ    %ÜĜŜƜǜȜ_wװ   z    m $  <    [# %9-     $ jԤ    =   &-4 , D ҈D ^gřǙșəʙ˙G*R{9 Œ Œ,##m[}OD^?ÜĜŜƜǜȜ_w $ OOFLgob'(ʯׯ`  jD ҈j҈q҈ <  $ , t     ,ّ , exprsOW\   * \Ӣ * 쵢  +"/ װM\  \  0l + \     1  *  ) 4   R D ,  "    ' װ Md ̣ T  14 d -!   "11RefMut2.2.2 .뜿Er Usz,   U<  Ĥ dΤ Τ Tۤ ́.dۤ 'Τ:  KT\  D  0TT fD  GT   d ̒ T ́.d '@  KS\ ̸ \ĥ  .Slĥ d\  ES&  ҥ dܥ %ܥ& T ́%/$d (#$ܥd  #L"R\ '   '0&R f  "&G!R0   $dʦ -ʦ& T ́-/,d (+,ʦd  +L*Q\ /   /1. Q gt  *.H)!Q0 ʦe   %ÜĜŜƜǜȜ_wװ)("Qy~0(0$%#  ,' 1(["1.&QN,Md $ , 4(4 *34 5  U   Rӹ č35h2) \ 8# Ƭ  817*Ƭ ,7,+d 624 - 6!-D :6:3.t <  $ </L x   %ÜĜŜƜǜȜ_wװ<;0w|=;=12#| ?;m 9? : >;[ ">.M D  D  D/C4! BC֭7 Tۭ  $֭ B3,    A5Pۭ2 ֭8  Ao@6P %E@1E78#֭8 G@m9G  C: F@[ "F.9PNCMd® $Ȯ ,® K;4Ȯ Ӯ L  Uč® Ϯ  Qӹ čKLlJ<Ϯ  T  ̊̊ϊЊD^)cOӹ$ JI=   IH> %MH1M?@# OHm R9Çtձ SOÇ1 ,  $ RLS=QA,  NH["N.M2  QPB$TP0TCD# \3 T ́\/[Ed  UP["U.McZ[o   "ZYFO$t ]OÇв ^9ÇS,  Y]E^6XGO. p  XWHO %_W1_IJ#p aWmVa  [LN `W["`.KOO[Mų bV<³  װbϳ M  γ VV[VCV ,V $V V V V  q x  ʦe     S   Q%,2   Kcء , ,ȡ װ)Iװ  PYy.7v?xi   5  m[}OD^ h q    [ { X a d  ӹ) ӹ2  D    ) m[}OD^3 j w   ե  , [ AnyCharAnyByte AnyCharExceptAnyCharExceptLFAnyCharExceptCRLF AnyByteExceptAnyByteExceptLFAnyByteExceptCRLF;lC o x  ե   ӹX 7  ڣaÇ Ç   Q gpÇÇ )k 1% all_anchoredb2H6unanchored_prefixJ9 Y > ?  FZ GD O  N O e U>'nV E`a?*E wȭV ́E{́[,Ä:́]*܆ḱ\ψ́Ê>LUÎُ ޒR `  וU      ́]       ,  : {'! T 4   D  T  Ed \Ӫ   Ӫ \ߪ @lߪ ) |  ,  t  0 D  X3ė ի |۫  ,ի ۫   ի2 D   X 3         , t L +  @\$¡ ^rte@   a ($ ! l  !0|    %ÜĜŜƜǜȜ_wװw| m$ "$  řT 4   D  [4# %9X ,  "     ԟ    `$ 0   m$ݯ #ݯ L  #0 \   ["۹ .ݯ   %ÜĜŜƜǜȜ_wÇװ w| ݯ mÇ$ $< Ç# , $C3t   [/ #۹/I$  $ 0 $ %Lʰ Ç t  %D4̻  ["۹.  $ 0  mL  Ç5  " 9  װ ԰ ["۹.H  /  ȯ y   $ x    y&֮   Ԯ m[}OD^cեgřǙșəʙ˙G*R{9 4=m[}OD^ÇcbkÇڣ>Ç Ç& ~ YÇv*c  :one    match_state_idt̯   !    ۹ Bǻ۹=g۹K۹?۹FJ, G G L $  Q/=4 .| 4 8  4 ="l 4  $ >=D Vb<  m  L $  ) =4   ["۹ .?=d  |   4  8  4  ="L  װ  7T` < m L  $ =\  [ "۹.@=  =$0 mÇ L  $ =\  ["۹.A=  =$ 0  mÇ\  Ç , $ , ==̞  ["۹.B=  = % 1 L $ Ç , $ $5 #=  !["۹!.C=  #"=$%"0%d )Ç , $ , )>(=  &"["۹&.D=  ('= %*'1* !T .Çܑ , $ .5 -"=  +'[ "۹+.E=  -,#=$/,0/$% G 2   P2@1&=% 0,[$"۹0.F=f31 '''53'54(9'64'6*)4 '748 ( 74 8+9" 35=<(98H(9,-< (;8mt )>;Ç! ), $ , >>=.9  (:8[+"۹:.G9" ) =</9 %)?<1)?01d )C;Ç ), $ C5 B29į  )@<[/"۹@.H9 ) BA39$)DA0)D'4 )EA[^3"۹E.I9x! F "%  װF  8l37=G8; 3= Z8i:yG:< 7 7 7777?7| 7$7u+6/636 6               F   * 18 x   ' !kr#y %?F'} ( ('*.(,n)u.|)" 0)2) 4H , 4 řǙșəʙ˙G*R{9    $ ~ եk      $  եu      ) 2 Ç  z o x Ç ڣL  Ç   ڣ ) ÇH 4 = ڣ  Ç ڣfÇ -Z?HQ'ե(B(ڣ%ÇD/8)ڣÇ){!firstz    { second4   # w C,       4   ! \ &  +!  #0%H '3  (7D ); *:8 ,; .@0 2E4(c۹c۹q,۹f۹  ۹ E  ۹S  ; ۹  u ۹   ~ & ۹  l ۹  ۹   el(  "(-: ENX(   ȇǔ  ?Ç+   Ç,  8 qv "   ͊͊Zhs͊g5 (   ܞ  ,  G  . x   Ç,  8  ױ  {  ":G """ " " aEQ z Ybk͊t"-!ױ V۟  08ȉ CCC=C=X] ox( "  A"P\ g) 5  h2(   ۟  ,Ȋ    ,  8 qv "   ^lwk8Š *2 řǙșəʙ˙G*R{9 _d v( "  A"P\ g*3 f6(  Š  ;+ } ,  8 qv "    ]kvj8H 8͡ ( " "2> I  pz  (  H  ?*8͡   +  7 pu "      Xfq e 4" /7(" """-װ9A ]g("  " *6afsxej""  !(" 07 "J P"{ "" `" "K `" `"8 )6 " `" `" 8 )  "  3 "$0 8 "$ 6 > " $ 0 8 "  "0  "X "" ")07ENV   js@-Q=?G  [   k  \$ =L lL (" 07*?NS `*e mP"%&1'9F)%R()&'( `" "!+2":F$ R#$kq!"# `"`"" NVXbW_kwDJX^ {`"`"!NVXbW_kw'-;A ^"  #3 ? r  "  4 @  7=K Q s _ " i3?r ""#*+8AJR c ٖ ٖAS\H5clYbks`#Sbenw &/ 8 u  q} n/ %K V gkx TԤ u$ CCC=C=W\ nvH% (! "! "0< G q{! ! (j  غk  """ " " Uzsm.    ppp opopo2Ыw p   +  r!  ,8 ;A   k "# """ " "C "  e%'V롳 & 2&1&.dփ CCC=C=X] owؽ CCC=C=[` r{( "  A"P\ gk w 5փ   ؾ    8 "  A"P\sӶ] (  ՚     0-  ppp opopo2Ыx   řǙșəʙ˙G*R{9 r  ~  u{ױ {FL   "  _h  wмn|{Dμױ (  "(-3@ KT^ 1099511628211%#"14695981039346656037`##x##%#CCC=C=W\ ÿnv(# " #"3?G  ÿ ÿ ^C( ( # `## *x##  * %#  & ÿ*  6  ױ  y ~ ##0=FOXHQZ(1: &kױ `'#(#)1`)#Ç)2(%# #%#%#A#P\ gÇ͊C( (%# `'# *(#  + `)#   Ç+  7  ױ  z %##2?HQZJS\*3< ͊$iױ `'#  (#  `)#  Ç8%# #%#%#A#P\Çzi`B#xC#D#CCC=C=W\ nv(@# #@##3θ? θJ Z?$ (@#  `B# *xC#  * D#  & *  6  ױ  y ~@##0=FOXHQZ(1: &kױ F#Ç)1hF#XF#(E# #E##3? JÇ͊     (E#  F# Ç+hF# ? ) XF#   *  6  ױ  y ~E##0=FOXHQ͊Z'0 9  #͊  hױ F# hF#  XF# 8E# #E##3?Çr\F##E# #,6hF#&7XF#&7F# Ç Ç*/ ÇÇ F KSX`mF##HF# :BJ ͊͊e r|`I#I# /7`J#Ç)1(G# #G##3? JÇ͊* (G# `I# *I#  + `J#   Ç+  7  ױ  z G##2?HQZJS\*3< ͊$iױ `I# I#  `J# 8G# #G##3?Çs] 1099511628211%#"14695981039346656037PDKKKK 7K7K736Իbg y(> #>#-9A ]g|QlQ Q$TQCDQQ QQQ~ QDQO4 "1"'R, M,܆,҆ Ի'K4+!Çݏ MÇ<,mA4+!Ç QÇ<Ζ,ĖmA4+!(  "P#ץ tץDۥ (Tۥbӥ wÇKӥ14 XÇD  řǙșəʙ˙G*R{9 Ç|,řǙșəʙ˙G*R{9 ͊  Ç 14+ͷOd,pAl4¸$D$ ÇK/M Ƚ4,ɿÇпC!T¸4l+tCCC=C=ȽV[ "mu?D, 'L4+#T PdKT,V,Q4+!D$,i?4+!@$,i?4\+! Б9$,i?4t+! Μ?$,i?t $, $,0 T"o$,ޮ͊Ç͊Ç,O߅4+ ռOd,pA4+! I<,mA4+! W<,mA Ի 4 l + !  CȽV, Ƚ  (     - j   - 4+!L, 1  -  .4+ ! d O t .4+! .,,|lƣPƣS ƣƣS8ƣ~ƣg* sčGjHp               xދ   P   h   ڏ   Ǒ       8 #     %#ԻÇÇhP2vX?(–=˗pV<"IPW(  3ސ % 19x #hڅ`Ç``ׁڋ`ׁrwhÇhÇ>COW  ljk#bg  yP h Ç>C O W % 7 ? % 7 ? %1 9' #K #$j #Chn {  #   # #  # ##  !(/6ȽDMUu~  '0͊Ç BK͊͊ÇÇ͊dQ>+ÇuׁbׁORx  r #  {6 '__self_3  ޡ/£`- #  "(.4@HQ[#H,; KI\Ii   "!!JJKKL0 L> NM` Mn ~N N O O P P  Q Q. ސRER/S@FSY GEe HFs xGH!hڅT2T`ÇU3U`V4V`ׁڋW5W`ׁX6X`ÇY7Y`Z8Z`ׁ[9[`ׁT ;2a <6p v;<: h\)\Çh]*]Ç^^o+^ÇY_j,_Ç.)/+./-`%`.a?&aW'%c(&qv '(! PbbhccÇ^dodYejeÇ!"!" ff/g@gYesx !hh/i@iYesx ߨߨ!jj/k@kYesx! #$#$!!-0*1,01! ! :  >3 ?7 >?= =  A4 B8  AB@%- @  C5 D9, 2C?DE!NT ]k ! #         & - 4 l@ I R Z b i w          ߨbߨk ߨw*3 ?H@͊R͊,bktNW.7 CL͊D͊͊V͊0foxR[͊+    ͊O +   q z  ] f o I R [ 7 @ f o x         "+4=FOXajs| !.ѧѧѧ  m ѧ  b %ѧo &k ) I *ѧ +c ,7 2  3 4 5ѧk 6K 7+ 8__arg1_3 9< EѧI F ] = U  Ѽ ;  ?    ,\  4$ǜ , ܜϙ$,:" ljk# ^c u}( ##/;ߨC _i( " -9fkx}hm#ߨ '# ߨ'1",1 HMU#Hߨߨ8 EO wD<  Uߨ4D X Çe#|ߨ,DřǙșəʙ˙G*R{9  Ex{( $ߨd / |K ߨ$ߨ+  Unique ]8"O 3f*ہ $ w4  Pppp opopo2Ыot Q     < t    d  $ 6  4 Çd řÇ $ řÇ& 0 ||ߨ,$3k %QřǙșəʙ˙G*R{9  1ÇY2 1_7>ޡ+3( ##/;C\fޡ(  -9fkx}hm#$# '1,1 HMU#H8 EOD< 4D X Ç[#|,D148s/ $d / |zK $\ $##    ]8"O 3f*ہ       $l  ͊? 5!($ řÇ]T řÇ*|,$Ç$7͊'͊!OW_gpt vr*Ç p*Ç͊Ç*Ç͊l ͊ ÇÇ\R,!N  ͊UC TÇ͊͊͊# *Ç"*Ç1@#͊^Çgot*Ç$$͊d, $<d,$<x #< U;lÇ͊*; 4$($(-3@HQ[$ $-7h hù 2 DX)@6Ç hÇù 4A$    ͊ O h'8X'8 Ç Ç+0 < AINVc$H 4<D ͊͊f s}(   +* !!! PhantomDatao$z - ^  j $" / $$$ $  66\vw Yb  qzڇ)1  )1( $$0< G  pz (   * I  *  6 ot$    Ucnd3   8 $$0< iS pH /7H)2(H $HH>$MY d(H pH *H  *  6 otH$ R`ka0 O  lOO"TO,DOOO# D#/BO# m !, O   OtO $O A OO[! %ÜĜŜƜǜȜ_wװd O  O! ))NV f  4OU#*1 N,NDN?v"cg' o 6~pv)1@v)2(u $uu>$MYa (u pv *@v  *  6 otu$ Sala0| !&T MD ԽDSd@<, 1L7$, 1d$ͤ,4ܧD٥C$ t4<  Ӥ   )d $,l b$@3<fLj $,Ε,Ӥ,٤,٤~Ϭ5/8aAc`e`gͤ٥V G6d$ͤ,4t< $L\El! '$ ř$ řd   4 T,d$, ZP '- ۴ W $ 0 - m  D% / 0wH  % $)5 Lm|2, 0  D% /JH îp#/Lm|2,0 ! ,$ T!= )* ř 1 0t<$#LܺT#C"d",$$& ř ! &7$L%,4*T,%,#+1,,d$,*j+`)1'- ۴)X(1 %-(1--.(m'.,3%6'tD6(51T3175 & 75( 1N4734y2!1"̎12 î1(0"1$8008#$Ԏ90m 93/%1,41,>%B'tDB(A&1TCA & CA('1N@CD@ & D@((1N?D>?z=)1#<= î<(;*1$E;0E+,F;m$F3:-1,!51H ,/:$T'H=G.1** řG %0%0-%2/f/~!/$5  X_ f cW^e 8h  k"Il,Ε,Ӥ,٤, $ [ L  <      % ,m[}OD^ Z  i [   < b K p  @ Şe , LL0{u~[,sƣp%@qHxƣbƣ CŞA``& 2     M    +"%$&&%' O  ./ /9: h "F#ͤ~W۴NUîQ _î9  G  /    q E ۴    î [  î&d$ͤ,4l'4 $,;$",Ε,Ӥ,$٤=A?`AɾDͤ& $   t<$ LTD d#,B <6C !,Dž   dDž$ͤͅ ; 4ͅ!̇  C"$ ޅ) $   !1  5߄c $$$$A$ɾ$J%5΅DΕ,Ӥ,y3i ٤Ӥr5sAu`wɾci{ͤ8̇ Ӥ$   | $,  d$ͤ;4!̇ C"$Œ- $ !1 5g $$$$A$ɾ$ՎpDΕ,Ӥ, ٤ӤWXAZ`\ɾ]cNRͤ̇ Ӥ$׮ řƮ\ˮ$Ʈ:ˮL$\1d$,,\,\$ ǯŭa ,ܭΕ,,$6Z"YA[`]ɾ`R]!)t<$LLC\)t<$L6 ą<dLL  * $,,, %+  % e  %*  6  + m  d< ( L& ř̅&t<$LTCd/A,\*$,,,%+ ]$0 +m d< (L & ř̏&t<$ L\ Cl! '$" ř$# řd! "#\ &! %&0 $,,%S$+4)!,,\+,h* +|)a*8(!-|,(''Բ W$&$. ř ! .7- ,\1-1#0!',0$,,0c/"'+44-,7\67h5 6|4a583#'"-|,32$''ԋ W/%' -&-(ff Q  8,Ε,,,L1 f  m[}OD^_1KBYrKgIT hCZsT_h FAI`L&OU7   @   |  !q$--&/ X 3   x 7  E D     ` n ~Y?`6 g7d< (L6x_ d< (Lx@ 0 $,,4+,Ε,, 4-A/`1 4z( g p h+ B Ε+ p  z +     +7 +1$   d$ z Ε\en;D M V-;F;  ylΕdT _  Εk<  ~hl L/ Ε&  ΕIDvAmɾd[,Ε$4XH,@$  L;\ ۆ] ׅ  x,Ε`H.A,Εɾ$x" ( yp h+ B Ε+ p  z +     +7 +1$   d$ zYbk8A J S*8C8 vlΕdT _    k<  vh$ |D )T)$ d, ) < ř _$ ř'  L ;VΕ:mgA^ɾULt,Ε$4XH,@Ԥ$  L;\ ۆ\ ׅ  w,Ε`H-A,Εɾ$x" CCC=C=X] ow 09*3( $T$co zt   N (   +  ,    ,  8  ױ  { $6CLU^NW`-6?   )nױ pݪ ݪ08 09( $A$P\dݪ ݪ(  p ݪ,   ,  8 qv$   ^lwk8̔+3ԕ( $$5AI (  ̔-ԕ  +    +  7  ױ  z $7DMV_NW`+4= %jױ (%ׁ>COW8Ç %19 $  $G$AGN \ hp͊Ç]HׁoZ5 j(%ׁ h pQ Yf Y aom y     8Ç-65Aciw}t$͊O]]M < q]l6 *Ç6%Ç<6'E*Ç StateID::ZERO̸7  7 * 7770Ç<7'_ BCCC=C=W\ nvC) 2D"000.0.FrCCC=C=  E$ 000.0.FrCCC=C= Utf8Range9D ֺ  G CCC=C=W\ Ƽ n wH CCC=C=W\ ½ n w(@ $  @@  $ 4 D $    ֺ ֺƼ Ƽ ½ ½4? )H^Ƽ>ֺELSZJCCC=C=W\ nv(H $H$-9 D `jL̻ ̻/7LÇ)1(K $K$0< G̻ ̻Ç͊s}xÇ*2xÇ*2( $$2> IÇ͊Ç͊r|( x Ç,x  Ç,  8 qv$  ͊͊[it͊h5Ç*2X( $%2> IÇ͊q{(  Ç,X  +  7 pu%   ͊Zhs͊g44Ç*2̻', >F8( %%5A LÇ͊  A  (   Ç,  , 8   +  7  ױ  z %7DMV_NW͊`,5>   %͊ jױ 43', >FP( %%2> I t~( {  ,P  +  7 pu‚%   Ygrg4Ƃ%Ă $-73+0 GLT[P'8@HUт%HȂ O \fM(%(-: ENX('Hτ ̻L T3 ? nH̻ 3 ?    q"H̻FO5A|t%  2V1:rg{ (% '1 H,; K\ i |     Hτ̻/@̻Yesx  H̻/@̻Yesx H ̻/ @  ̻Y  e sx  %")0!<ENV^es{:CLU#,5>GPY c q8 ѧE ѧѧ*(  %&+8 CLV %  &0@ */ FKS %H  : GQP    (- ř  %[ gow  @ */ AFN %   9 FP(  %&+1>FOY %  #,6 H +: J[ h y "->Vbpu   -> V  b  pu      %JPW^eqz 2 ; D M  &/8AJT bq~ ѧ ѧ6P  "' ř  %U aiq y   &49 JOW\hw           &  " - >X] ns {   - >X]  ns { %KQX_fm {  ҇ 6 ?"+4=F P ^mz ѧkѧx&256( F F%&+8@IS256DH HH %HGC\Gs-256 II 8J  # J J ;8J  P exhaustedݠ PsxJ; Q JI=  | (   ˳ +X   , X   \ *  6  ױ  y ~ %5B NW`OXa.7@ 'lױ (   ̹-ػ   řǙșəʙ˙G*R{9 v   ! %= J %%ƀ%%ٜq ^ox   *8 *2(  % &/; F_i(   8 #PUbgRt & (  &(-:BKU(  `  ,8ejw|gl &   )`   8  & &/;gJx &  '1` +0 GLT &H 8 EO2(  &(-:BKU2H   ,8  & &/;tJ &  '12H +0 GLT &H  ; HR2\4 J5!K$,?   #+(     ,@   +  7 pu &  &&&&jch@IRAJS(1:u(    ,@   +  7 pu &  &&&&79aA@IRAJS(1:u -)1 .ج)2 >*3( + & + +A&P\dϬXج)Dmm ٙ0T$d#, F,$  %řǙșəʙ˙G*R{9 jo{$m X0TϘ Dۘ T#Խ "#1"")Ț w"]T̚!|Ț#4ؚ X! Dؚ$  %řǙșəʙ˙G*R{9  jo${$ !$%m% î%3"0Q&]&#$%'mT--+,%0P,{D+&l!4+*'D" *A)($.)0.)*"/)m# î/3(+"0Q0(]0,-#1(m\ ',3.,&0Lț ̛1ț4/,̛+ 2 ,341 řŞ2ڛ0 )Ζ   f ʘ   q lsz4;B!n18!?#%'5d,,  W  $ V  m[}OD^ _ y  ҈ ҈t  M Im[}OD^`qm[}OD^#řǙșəʙ˙G*R{9 ]0PYy:Ş{Җ X  ߌ      h    3    ,' i% ' 1 !#/ H%'1"{۴VdE K  Y         5  îi  ~ oLîZz /\$ $4< R&&ք&ɾ& MT Pb L<ȩtȩ$Щ Q??Flatten??#Tz=d4ЩLީ  ȩ 4ש WŞ =שǩ"  ŞD[.4  p  U  | +ǖ   u䍫  ٨,D\ŞMɖhl|ɖ whole_match\ group_matchesy  t͕_<ɖt$.4ê 04Y7!D$͕+$^  ŞɖLU<ɖ`[i/͕ _ref__matched_ref__haystack\$$4<CL<t$)4L   4Y 7"  ȚŞDW04  p  Uɖ | +ˠ   u  Ӹչͺ̱,D\ٹTŞ ɖ%lѺsɖ|~ǘ\^ jПB<ɖt$.4̝ 04Y7!Dƻ$λП+ϻ$ܻ^  Şɖ-6<ݹɖE[ti/ПȜ؜ $ ř|T,#D wUT  PppIterMutp opopohEC8GuzG  Q   $ ф$ řd   L Ċ Dфo biܨ!(tULI\(0I,o9|)1YLp9  7܋<< 0{?i&&&'|02y ( Ȅ & ̈́&4@ K" . ~ gJ( τ   z+ 7 -  9 rw Ԅ& IJ ز ^lwزk9 KKKK 7K7K736ch z(  & &/;C _i(    #PUbgRt &    8  & &/;gJxUtK J)I1<HDOGWbKj   CׁׁP+   C d`fׁ Aa   C@&J  & tK  L P AN\&L QPVN\&  P܋<< 0{?iҿNej     Q  ?    l 4I  t *l L% +NY< _ m!  L*Z  %ÜĜŜƜǜȜ_wLy~ Zm4I L PAL\[ÜĜŜƜǜȜ_wv %ÜĜŜƜǜȜ_wQLL QPCL\ H \  $ Q܋<< 0{?inJ4m    řǙșəʙ˙G*R{9 {    J* % >'#  >&( / 6/ 6 6T ! | !, J\ H  #X   P#@"J%* $" G &$V [&g%=pu '% '  \ (%T G  )% | (\,!H% $*J] . /( - ЄU./ < _ׁЄ,-+"Hf   %ÜĜŜƜǜȜ_wׁ+*#Hz 0* 0$%  2*mׁT 5T G  6)5  5R2,6W4&H* 1*[M#1/RHh6   %ÜĜŜƜǜȜ_w43'Hx} 73 7()  G  83["8.SH H T I] Z T; ;+:,N :C9-N %<91<./ ?CCC=C=&l C?x>0N|=9["=.TNĺACCC=C=(l CAx@1N|C(l CC9B2N|TJ FD 8FBE3N'D &E# D J <( G5C8 GAO $EJ EJAHJ8 I9F I   :N;PJ< $JW J5  N APg )5=J7L[H7D 9? )= G=GLHLI?I?KP JPM2BCKBO8494:4 P W ^           ! (/ 6L!t_ Lҿ.řǙșəʙ˙G*R{9 | m[}OD^;ÜĜŜƜǜȜ_w0|řǙșəʙ˙G*R{9  <$    8       z e m[}OD^ׁ  ÜĜŜƜǜȜ_wׁЄ      ׁ m[}OD^        5 4 = x    (  "W &pattern_groups] pattern_indexgroups\ 4 groups_iter  $U ( maybe_nameM )group, 2  1 2 2 8  =5zO_̿6 \~jn O)JfX      Q   fu a h ~    \1 _C(TlЄ H_ref__group_index0 4  " 1"'(  "V# tD ( Tb w K)  %řǙșəʙ˙G*R{9  mr ~ ) mɑё ׁ  <ɑ$Ց Lё %# ,ɑ4ۑ Xׁ Dۑɑ0 WׁׁUk wal,ʐѐ$m[}OD^#  0 w  :EřǙșəʙ˙G*R{9 ׁřǙșəʙ˙G*R{9 qu xindices<  ?   VZ dD *Tׁ y4  +!(  "P# tD ( Tb w K)  %řǙșəʙ˙G*R{9  mr ~ ) m " l % %#d wg\   %řǙșəʙ˙G*R{9   ns m΃*Dϡ X:Tϡ͡ߡ wkqwdѠ,\m[}OD^8  "+Km[}OD^΃8  E΃+OSXl  j  ?! d6Dɂ 6  ,"[ K tD ( T\ B Wppp opopo2ЫǓĞ욮Ӯ  + LӮ$֮ w [ 4֮Lɮ W5 Tɮ &,ǬάřǙșəʙ˙G*R{9 Y; ؍  (hFOWt<&$؍&4̌<؍ٽ\޽$ٽl޽ɽ#|ɽ *F"$ ř$ ř &ʼ&&ɉ&]&&& ox2,ۼ ?řǙșəʙ˙G*R{9 )s$ $\; W UwїԎ,\),0k!ėL & (M 3їK,ƣyL $t"$ ř & tD (T4+  &  (M  ř ,    /, ׁ, D( T & ( M & ( M*  -0 řpl,\~D(ƣׁ ;  ,&)ƣ ƣƣb (Ξ4+#\ PlG,,@4+#L PtV,,'*Y|D $T !5 F FH,,=4+#t PI"DoT܀R,,ׁ,P˪\$l & (MʊO,,ƣ?|D$TĠ$8tpI(Εq,,>  4  + ! ģ CV,쾙  !:     - ^   - 4+! CV,   2  -  .4+ !ԭš CV ,šʚʚ  9 - .4  +!! !.!",ɘ,$JY6?_ƣƣ\eƣƣD4ƣƣƣC k6±,"̵(   * - ߤ"  -  )   -      +7$ 28$*   k &{Xaj5>GP.<G;z  *    ߤ"  ! )   8  &  %g&vC#=] \)\1,̸ #6͸;/䷸ׁ tD ) ;T  &  (;N #| x ;!R < _ׁЄ  ;[  l;!&2 EmׁݸTT ![" %8<;$\ $l4 0 3D U 3, ĺ] ֺ, 6 80$, "+8#ֺ,d ׁ ֺ48J,!!" 8+%̠  T8+*  03$$T$%#8$ #L"8,', #'6&8/,)T )/(8'84 ׁ &(`,%8 ʼ,,ܼ #,6ݼ+8/$] .T- ř.ʼ($ M+ʼ-H*8(& 18#02"1 2"18.0243 0' 3(08O/3½Y4/ 4/884"  ׁ58#765 65 886]&;9,9,8";%$: ř"$8:;7#;T(&;$;=<; <;%;8<&,@D @*?';T1 ]>?$CLC)B(;t9 ]AB ]= >AA ]D=I ]E=I ] GDQ ] HE ] FGH F*),ODO(N+;T !] I  ] K ř  ]]   ]I! ]DQ ]EY ]KXJ;C1 ]MNS, S6R,;0 CRQ-;,9 ]PQ ]L MPA ]TLI ]ULI ] WTQ ] XU ] VWX V/.4  2 !] Y  ] [ ř  ]]   ]Y! ]TQ ]UY ][XZ;C]1;^^52;\26 2% 36 ]37G\4:Y4s__94 1    # z  ] ] ] ] `ԒLׁ,״řǙșəʙ˙G*R{9 T ׁ Z{ #2Mƣ  ׁ  ^ $4  Q G       ' 0     W x $ > /    k    1 ƣ ƣ ƣ @ ƣ! YIƣ0>rfY&RH ! ]  7QM  ! ] d  f ~ P "  D  Ee I  T  U Y'Oy1}RX1 g 1 $ M A   G r  R¹,ǹǹD͹-T͹6yG&Є 5>owl _ref__group  08(  & &/;ٖC _i(    +7div{fk &ٖ %( +  ` >C  O W   %  1  9   %  1  9 чp ч=B NV  % 7? &   &4  & S  & r   d &  & R[ %j| k    w  T  ( + ` nv QYfY an"z!" ! 4=5=JV  5=JV!/5H  чp  ч  R Zg  ZbWn z    0 T]!4<UHT &#(0B *{6?*3<#  We>3  "  r S '8 + 19(  & &1= H dn(   +,8ejw|gl & &( ͎    ,   ,      ,   ؏? -9# 17#)   j Ҏ& ~ڇ\eϬn:C  R[6DOCڇϬ( $ $'&+8 CLV 10)\D ($T* \ D  ( $T$4 $$ Q$05 *    \  , H?$*D 5  $ܢ\  , >IFTul $W\D% $T<  $4;4 X U, t $q   D  5$l \    , ʕPG$! \  D!%$T!'ɑ T]  )$+\!"!D!"%!$T!!$d! !? $!&# !*#"& "D""&5%$l"l!ӕ2yӕb|t# U1 ŗLFays3L replacementdappendnsdstz  cap_ref ( ; ;'&+1> IR\( ;  ` < +P <  *  6 ot ;'   Xfqf4 ;' ; #,6` <*/ FKSZP <&7?GT ;'H ;M ZdH( = ='&+1>FOY( =$( =G O1 =  {  l8 =1= n ='5;B PYbj{i{2g =' = #,6 H =+: J[ h y( =->Vbpu 8 = -> V  b  pu    ='JPW^eqz2;DM#,5>GQ _n{ ѧ ѧ3 9%٤ )1 ;% )1( 8% ' 8%'2 > F٤ oy  ( 8%  9% ٤+ ;%  +  7 pu 8%'     Wepe3 Z%Z% $Z%4Z%ĮZ%5Z#%WZ%ۆ[% "`  ([% ۆ fۆ4 = Z%\%y    [   g[   @` ` "`* \%Y%TZ%Z%u|Y% LY%4Y%/,Z%ۆ  dGS [utۆJ Ŀy%\y% $y%4y%y%5y%Vz%ۆz% "`  (z%) 2 y%{%n  ~  V   gV   @` ` "`* {%x%Ty%y%iplx% Lx%4x%ׅ ",y%ۆ }V9E MgrۆH,~%( (4%\%٤% 9 # O1:% V# / % m  ԇ% % [! - %  % %T%4%&D%$% řD% ۆ |%% ř%'%Ƃ Q0 ")  %4%( 3%#% $%\R .%4% Y  %1 4%m:%%[". %%%$% řD% ۆ|%T؁% ٤ %"T%4%"(!D%؁ %L%  m!K% %%T%4%%($D%%# ř$&%# %'<%& ř'\% ۆ& ‚%((Â%}%>M\l(7 h~%,d% d%)}%% L}%T}%]$ S 9V$%y c| *u$%T5O^ ej       Ƃ }, .5< ,%* *4%\%٤% <H(1%  %ׅ T%* 6 % m  Ԅ% % ["  . ׆%  ݆% %d%D% *T%$% řD% ۆ |%r  %<%%( ,%l% ř%$% Ƃ S1 #*  %4%* Ç.%ȇ% $Ç%[Q ȇ)%Ç/% X %1Ç/%m5%%[" . % % %$% řD% ۆ|%T݈%"٤ %$<%%$(#,%݈%L%"h#F!% %'<%%'(&,%l%% ř&#%% %)<%( ř)\% ۆ( %**‰%%?N]m* i%3:Ad҆% d%+ׅ !% LЄ%T%m[}OD^ׅ  ,5w$% JS F ׅ  1:~$%#ZGa     [  R   a hnƂ   p9'% %%zUȕ% $%4%#% ܣ%%VS¢% $%4%*% %%ɾJa% $˷%$ٷ%4%"ɾ%( T%٤T% ٤%,%  .<%!%\%B %t%*%4%ZD%@%L%H5%4% \% ٤%  < H (1 %%% %% L̼% ߼%T%B   og ?  %d%D%( T%*T%٤T% ٤%,%  .  <% %   +!%\% t %  t%*%4% Z  D%@%L% I 5%4% \%٤% < H( 1 % % %ׅ !% L% %T%5OZ )" $  m JrAH% '%W%'''' Oty_T% $% f<% |%,%.<%%K%l%  D% {<<% %*%% N="%6%L% _ۆZ\%%%řǙșəʙ˙G*R{9 ÜĜŜƜǜȜ_wۆ%%  L%A xk' q @% $%d% g %>"%5$% D%    G%,% db P%D%  |d%    r%,%  g U%%4% dSD%%%% ,% % dd DebugStructddd dd has_fieldsd19   %H    A   Χ \%   :NJ( % ȯ % #PUbgRt %'      L%  %,%3<%%M%l%ˬ D% }9~ 4% l%$% Q 54%p%  % K$)5t%m %% %# % ۆ%  "`  (% * 3 %<% ř%      @` ` "`  * % % %%%  L%m[}OD^  % Fv ,%ۆk[ HYska} U{    ð 6ۆ% '%O%'''' n]^%ې $% f<% |%,%.<%%K%l% ې D% {<<% %%%\% N=%1%L%O\%%y%!% ې L%ׅ  $MѺ %  %d%  %:%0$% D%    C%,% \ J%D%  |d%    n%,%  g U%%4%Χ MD%%%%ع ,% %  '  | 4&/y{   u IΧ \%  #N( ܃%   %ې #PUbgRt %'   ع ع  L%ې  %,%3<%%ԆM%l% D% }9~ 4%ې l%$% Qې 54%p% E#/t%m%% % ۆ%  "`  (% * 3 %<% ř%      @` ` "`  * Њ% ˆ% %%l؈%  Lʈ%˻ d,%ۆ  !+4= )  i ۆ% '%ϓQ%'''Ǐ' 5;!&_% $% f,% TՖ% d%t%Ɨd%  %\%   % lq%%L%h\%% C % 1 % m#. 4՘% dϘ%  Ę%ø % ™% % ۆD% ۆt% ř % $%d%,%) <%% ۆ% ř  % % &%V hۆ  _%%aԗ%ɸ$%  L% 4%9ׅ  w,%ۆeA{ɾri    o'ø ۆAD% $% %  D # _:B%  _#/B$%   %L% ;\%%[" .% ۆ% N% ׅ ͗%  ,Ǘ% W A`d4%ɾ$% UE X  $ _ref__finder% !%d%  %:%1$%  D%    D%,%  \ J%4ś%  zT͛% k%,%  \ J̿%D% |d%  %,% hV%%4%Χ ND%%%њ%  ,% %  +  + 4W \NW  n M  Χ T\%  [ N( %   % #PUbgRt %'       4% l%$Ǥ% Q 54Ǥ%p%  %ɸK$)5t%m%ͤ% %# % ۆ¥%  "`  (% * 3 %<% ř%   Z gZ     @` ` "`  * % % 5ݤ%%%  L%m[}OD^ ɸX y,ݤ%ۆ[ H  41   M % ,4 N6ۆ| 4* WT48      M6 4d 5,@  $ thisD |L $*5  , . z4l g1 4R\ ,   M .. .%t. aC&4.- !!!Ȅo$z - ljk#. .-T-4-``Va`68Rt R 9W       .\. !   .   \1$1 $1410T1$1 $2: l2|2 #2(0t3D3 $3&2l2 I$L5  55 6 6 6 55 a  w _ VG 547 D6 7  88l8 , $8#$8  8 &L86 ,:   )9K Zfz !    !F 1 2,2257 1 ,1řǙșəʙ˙G*R{9  r> 4$2  <2 ÜĜŜƜǜȜ_w  45    GFݱ}L5!* v c  J!S[ckr!{   \ old     h!!!qL< < CIT\dkr{ $9T9 @ @ R@ 'ā@ 'Ľ? '> '> ' > ' = ' = ' < ' < '; '|; '|: 'l: 'l: '\9 '\9 'L9 '@8$8$8\98 @ @   ' ' ' ' '  '  '  '  '  ' ' ' ' ' ' ' ' '\D DCC$C$D7#) DTF @ @ $P řO 'O ř PԣO 'O  ř ON 'N ř NĕN 'N ř NM ' M ř MM ' M ř ML ' L ř  LL ' ԀL ř  LK ' K ř  KJ 'J ř  KJ 'ܳJ ř  J|I 'I ř JlI 'I ř I|H 'H ř I\H 'H ř HlH 'H ř HLG '|G ř G\G 'G ř GPF řǙșəʙ˙G*R{9 dF$F9|EQ]'  @ @  ř ' ř ' ř ' ř ' ř '  ř '  ř  '  ř    '  ř    '   ř     ' ř   $ '# ř   )(/ '. ř+43: '9 ř6?>E 'D řAJIP 'O řLUT[ 'Z řW`_f 'e řbkjq 'p řmvut!,+"e.q: }   F    S  A$STS @ @ R,Y %,Y %,X %,X %,W  0,W 0W >V <4V 4V U BU bU RU rT $T ^T zT AYS$S$S\S6 @ @ d%-%.%/%0  01!02">3#<4$5%6&B7'b8(R9 )r:!*$;"+^<#,z=$-A>%$! 2U( [ [(&+8 CLVh ` շ 8 [ ( [(-9]Gշ n [( [ !&0h `& [(H [!!ov5 BLa ( aaa= ll $llmlt$l!,l2!!}$n\n 'nDn ;1n-n6 $oLo 'ĂoDo!9/oonu$n!,n3T!! $qlq 'qDq!9/q+$q\r 'qDr!9/r+$r |r 'rDr! 9 /̬r+q $r lr 'rDr! 9 /rrq $q!,qRy :4f! !![!$ulu 'uDu!9/u+u: $u\u 'ԱuDu!9/uuts$u!,t2S!!$w|w 'wDw!9/w+w> $xlx 'xDx!9/xxwy$w!,w2S!!zz $zz*z: Ծzz $zzzym$z$z2""} | '| D|!$|2ܱ|. | ' |&D|!$|2|!/ } ' }%D}!$}2} / } ' }#D}!$} 2}. Ԉ~ '})D}!$} 2  }$/  |  ~ '~'D~!$~ 2 ~"~{ $|$|<Vt2c!!B!!!_! | 'D!$5̭1  'ր$Dۀ!$ր6ۀ3  ' #D!$62 ˁ ' !D!$ 62  ''D!$ 6  "3     '%D!$ 6  Ђ $$=\h!@d!!]! !!l!߃ (J\Ƀ$ 1Lt<!$Lԫ , (͆g<$$n,/_!$4!)$dˇS L݇$'*\!Lˊt؊<݊!$؊L݊|׊ˊ - (h<$$n36f!$4 +$d̞S"L$'*Y"LT\ ) (j<܍$Í,ɍn3 5e$؏؏Dݏ +,|ݏЏ\ŏ"L,' )X֢"LT ( (ΐf<$ې,n, .^$, +,dےVВ"L,' )X"LT ( (ǔݓj<$,n, .^$L +,^"Lѕ,ܕ' )X"  ,,M$D TT4 _ȫ"TryFromSliceError' g~WD2 #Ϙ (ԗ]<,$ȫ"ÜĜŜƜǜȜ_wȫ"" """; L\ /l  4% /J  D     ,      4 % / J   D,  ћ 4͛% /J ț D›, ›  4% /J  Dݛ ,   ݛ!֚$ Ț,Śȫ"4 Ț2XA"B"-5<"~  @ Uӯ"6`  08(  ( (/; F!_i"(   `  ,8ejw|gl (" !!"&DD 0T+$ը řlt 5-l M)64 _QDDѪ     Ѫ@ !|  u !Щ  %! D $) 5  H mD4". $ dڪ %!# T ř  i!d L6ÜĜŜƜǜȜ_w5m[}OD^c!=6&bit$   """""@"""-  08( ó ( ȳ(/;C\f"( ʳ    ,8ejw|gl ϳ( "&'t $$D"}$,$D,/26y"$T @ @ T+Ĉ $D &-ԉ $D () $D$+ģ $D&& $D !( $D#$ $D& $D!) $D$"| $D' $D" l $Dܱ\ $D l $DܳL $D\ $D̻4 $DD $D+4 _SD24"D14"D/4" D64" D44" jD  $,$D\ÜĜŜƜǜȜ_w"8""J""\ ""l"3""""O""""l"3""""U"""""`"<""* $D%$,D,/26z"b\ 'D!51D"$D<, aL 'D! 51 ̃4"$D <  , al 'D! 5  1  \"$D  ̓< , a\ 'D!51L"$D<, a| 'D!5̀1 l"$Dܱ=, al 'ܐD!51\"$D<, a| 'D!5̤1#  l"$D!="#, a '#D!6$3(%'"$D&">'(, a 'D!6)2.*"|"$D ++4" U,D*-., a" ' %D!"6!/!3!40)"$D$1$24"$V#2D*#34, a& ' "D!&6%52%96&"$D'7!>'89, a) '  D!)6(:2(>;$"$D*<>*=>, a, ' $D!,6+? 3+D@("$D.A#14".V-BD*-CD, a0 ' "D!06/E2/JF&"$D2G!/4"2V1HD*1IJ, aĿ4 '&D!463K"33OL+"$D5M&>5NO, a7 '$D!766P 36TQ)"$D8R$>8ST, aԋ: '(D!:69U$39ZV-Ծ"$D<W(64"<V;XD*;YZ, a> '&D!>6=["3=`\+"$D@]&44"@V?^D*?_`, a$ a A$,D`.# V u $   v    K j    h   z "  8 "Febr"0"?^ Yi"'" R*!z"?!"! "!U"!"c! " !/ " !w ": ! " "J ! " "l ! " !H " !"Q"!"t"=!"!"!]" "!"B" < S$,Lė֗! _haystack,0htޚ]$Ϛ,Dm(+/gߝD"$ߝD<ߝB 4 & (M   4| #  $Н,D1ƣ:TW["̊4"$D<< d 4|̡Ġ $,ՠDܠ1CFJ"ܷD"$DŤϤ<4 & (M      4,  4 & (M    4  ̌  ,   t ^ / dҥ  4ҥ, $,D3Oƣ>ƣG+3:"֨4ۨ"$֨Dۨ<d 4, ֨  d      4   ,  <ϩ  թ&  Q  Ω&  4 & ( Mک  4ک,  $Ǩ,DR(07fƣo!"~ 4 &4 & (. n      4$ _"tҭ ͭ   d  ͭ7   U #~   \T ̎}$׬,Dɬ\vQƣZTmu| word_before word_after #G'# l"$Dñܫ!̱԰x$,D'*.f"  D-   %"Q%*6 m D - %"ÜĜŜƜǜȜ_w#v #  # $ 0    mҷ  Ϸ   ķ## : ˵ضov}^rx~ "&,Dm[}OD^#"@#"> #\ܶ ##T  #- ƥ###O###4 &  4D;$  " |%* ( V ÜĜŜƜǜȜ_w ƥ#D  +L ,  # ~  $  0    m r##t  4D;$ d |$)#Jͯ#,#D+L ,  #~$0 m fr##\T̳    "ڼ&,DƼ\řǙșəʙ˙G*R{9 ͯ#34$#+"Tи#)ӕ4$#}"T CGL#R ## # - #ƥ##l#s#M### 4 &4 & (. n      4$#] t    d  7   U #~   \ T     ~$,D\xƣ T!##o #U7# 4 &4 & (. n      4$#] t    d  7   U #~   \ T \ԫ    ~$,D\ƣ!T0##v #lN#ƥ#D+  #I$0 m#D +##   # v$ 0    m\ o##    T 1      LSZ_ "&,D#["'#"T< jmq#\ @##T  # Uƥ#f#;##I##ƥ#D+  #I$0 m#D +##   # v$ 0    m\ o## \  Ԋ          LSZ_ "&,D#["'#"T+ jmq#\ @##T  # Uƥ#f#;##I##4 &4 & (. n      4$#] \ d \ $,D\tƣ}^ae#j#td   7 U #~ T \ o $,DT+B 'VY]#b#4 &  4D;$  "#|#( ( T ͯ#7 ƥ#D  +L ,  # ~  $  0    mp r##\d  "&,D\и#L4$#"0m # #!U#ƥ##8#?t  4D ;$  좀d#|"' # S ͯ#7 #D  +L ,  # ~  $ 0   mo r##Tׁ\ց|Ӂ  "&,DTи#Sӕ4ހ$Ҁ#"8u'# #)c###G#N ˆ(( Ɔ",  ( ͆  "OTafQs ҆(     4D;$d#|"'#JQͯ#5 ͯ#  $,  % "-Dи#bӕ4$Y]ch? ##;  4D;$"#|#((KRͯ#5 ͯ## ",  % "-Dи#a4$Y]#< ##8'# & x4 _UnicodeWordError  y̥]ͮ$ÜĜŜƜǜȜ_w#E##q#n#.ģ@@ 4@*@0@ N%@6 @?jT?4? ljk#`##HCԕH DH4H2G[G#PGa HGTGDG4G#'+Xڀ$# N! OO  c 8TzBLN ƃ$|DN N4P OO  OJ 04O OLO C )PL P0~SN TL4LS /$WTpY777 6wQ?m!؆$U$\NNN:N _׈$$NNMeM U/ÜĜŜƜǜȜ_w׈$ÜĜŜƜǜȜ_w$׈$$$ԉ$F{  $ߍZ$[  e  e 18 e  (ޠ$$U1٠$ e e !e  ($%٠$ !eS $e e(٠$"'($($X_ #e( #ZeY #e g (; #e #e$  #Be $e(C$ !e ڨ$`řǙșəʙ˙G*R{9   !e ggStoragegfgf~[l(>__rust_std_internal_initu0$d(    #PUbgRt ƙ(    ɭ$,ڀ$|45oT43nڀ$| D 4# C(((( Yڡ66666poison666M3TrCCC=C= (4D C$2T   J$ i@  OT ` in  z  4   C  & # F $T 6$ ' (Ѱ$*$ M$D #$ ř| 2řǙșəʙ˙G*R{9 ~ l44)  KTD4CCC=C=$Tr $φJ $2$|Ѱ$$;ޢ$,#,22 UnsafeCell2.\*="Ŷ$LŶ$$]a& l ̯$k$)$1$:$$$$8$yL  $Ę$  Uo$DtTޢ$ "$ G7|T ޢ$|    4,  p ` <)\ $4D $4,  $$,4$x,ܢ$!@ܢ$!zmpi($$̾$T$$$K09($HW7$u$~($H$_C 2 5 4   Tޢ$   |        { WG\, _0<1 l| + (5  řt$ 2Ŷ$4+,5%=!4> =B?KŶ$[m@ >?|A@ AŶ$>-58!9 8:Ŷ$; 9:)<;6K <VŶ$9,\$ C$8 ,Ԟ#  4        P}J [` } Q$\$$T $$5D#.lƀ3|ƀ 3+ 2("#Ѱ$"D 6$"5!T.%!(%%,&!RRRlock6R$6RK6$,4  & 6!6!"\ C (,'),5*'\*,+' \ $+,0),4 - \$ $-A,)&l0| 0+ /))̭D /H.)!\$$.,1)̽D 21!5 $1R0 4 ) PV "$)H()s!!)4 !#7!7#$ 4& 4 (  5 *H!I HJ Ŷ$-KI:ML KJ]MLl M /{B!C BDŶ$ECF EDGF  G . f5o\$$4m } +u'' GdN$$,4,! R [ ÜĜŜƜǜȜ_wܢ$t g p O X !8 !,   $ Ŷ$Z  !  Ŷ$1  $T D $ y $ $H $ řǙșəʙ˙G*R{9 `  $l  $LÜĜŜƜǜȜ_w$888Poisoned888 WouldBlocka ti$ Ѱ$ $U $u 4$řǙșəʙ˙G*R{9  C $O $:" $ ,}!  ! !~     !     !      !   (,1resstack_idV@   & +.$ $ n$Ŷ$$$b $ $ $  $V $o $ $ p G $& $$ $ $ $$Ŷ$4 L $ā$ ѽ$[$Dt\$˃$.,˃Զ# 5 (   ( $ T $  A  PU$ a jo { \$T$+D % ‹Ѱ$"D$/ T)( ,͊$,׊ , $ M ,M\ Ë V$v  Ӊʊ$,Ђ ,ׂ$iD$$W$$i$r${Q$L׉$$$$4$z$$ T$;  :($$$&$$$ $$$$$$N$U "($1@$^$got($E$\C |\  < ,$nj$,4ÜĜŜƜǜȜ_w psL  ݎ: ,$$, ,$!RL  Ƒ9 $$$, ,$!R4 d  9/Dݓ  d $  E,ד  ] Jד<  \ޢ$ r,  ] J܆\  |Ɣ$, ^K#4Χ ODܒ$,      (K$ܢ$PA$J $c Bܢ$ $ Χ QTÜĜŜƜǜȜ_w ljk# %1 ]9 ] ] A ]I ] I ] Q ]  ]    ,%%   ]8"O 3f*ہ !   !   !  !]  ] ř  ]]  ] ! ]Q ] Y ]XB P Cs22$2.\*="řǙșəʙ˙G*R{9  2Ċ%,!  )Ċ%9K Zfz Ċ% 8 W$%2  ̦'!( ')(2* )?J+*Y + <"!L# "[$#h{% $&% &  K4 W!Dŝ t ] ],$$,ٝL %s+fN1$ ! ]l $qřǙșəʙ˙G*R{9 $ Ċ%h Ċ% %%|% %!!!!!(/6BC)    O%я%% T%+ ۬%1 ]9 ] ] A ] I ] I ] Q ]  ]    L%%  %dž%%)!8 F O_q!  "! "  !]  ] ř  ]]  ]! ] Q ] Y ]XBܯ%%ܯ%@,گ!  )Ċ%9K Zfz Ċ% گ8 WĜ$گ%2  (!) ($*)1D+ *Q\,+k , #!$ #&%$3F& %S^'&m ' |  _4 W5D ׬ ] ]-Ĝ$4˧ޜ$LĜ$l %gJ=% ! ] Ĝ$řǙșəʙ˙G*R{9 Ĝ$ Ċ%%%%N%%`!!px!!19@GNC    SC%՞%ۛ%$ɴ"ɴ $$*$t " ManuallyDrop~$$i_f< LXű$$Ф%Dޜ$ Ф%  4 7o%dʤ%*%1 |%  %; %~D+0AS , 1 ]9 ] ] A ] I ] I ]Q ] ],%d    L%, ԉL G 7   !]  ] ř  ]]  ]! ]Q ]Y ]XB|%ޢ$ /,$V ,<  ] ]Ҷޜ$Lȶ%5 %%kL%?,%4- ! ] bܢ$!%%   %v%%{$t<%$L:ޜ$Lb7%\  d  9/4 qT %  F, \ J<  \ %  s,  ] Jܤ4Χ MD$,     r %~- %* % %p OΧ " &   aut    start_kind "_e_ej %|( Z& ( _&(+7 B% %^hܷ%( a&   & %+7bgtyfk f&(% ĸ%ĸ% Ϻ%!$ &T & && l&&&$"&  &,&  "$&"& E <&l& ř   NoncontiguousNFA  ContiguousNFA  Q6Τ4BI&$&  &t&T&  Fl& ̢&& &T&  \3  )&&L&  I,&  &6   &,&     m<& t&4&d& $& C5$& ř&&%& (& řV`& & & &&d&&řǙșəʙ˙G*R{9 &$&%<&StandardLeftmostLongestxXl & &%<&awÜĜŜƜǜȜ_w%%4&   AhoCorasickBuilder nfa_noncontiguous  nfa_contiguous      % 9: %%%%S%%řǙșəʙ˙G*R{9 %0%G UnanchoredžOM54&%x%qneedles ac_match_kindYac_kindY ɘ&ɘܻt w%%ؾ%%~̿%U%256X '"( Z' ( _'(+7 B%y %^h %( a' X '%"MR_dQq f'(% %%%d','t'$' w<'4'p'  Pppp opopo2Ыns' Q%  4' %|'4' Ț 4' D''d' (' ř'd'  '   '$  $' ře ' L'   3 '\' Z ܣ'$ . "'$'Ia''w~'řǙșəʙ˙G*R{9 |','%<'%<'%%%řǙșəʙ˙G*R{9 % %w%4',Q<C%'_kind% needle % %%%%d 256 (( Z( ( _((+7 Bk sZd ( a(  (!LQ^cPp f((%    l(( ($$( ř  (  T(      3 (4(%YD(̀(( ($$( ř  ( T( 3(4(%YD( ( (  3 ( ( $( ř (  (řǙșəʙ˙G*R{9 t(,(%<(  M% S%%%&%%% ( (( ( ( ((0< G  nx  ( (  ( (!sx gzY (( %   (  %Gl(( ($$( ř t($(%<(4(&-(( R%%Um%((X (  T(      $( ř W  (4(% } D( ( (   3  ( T(  3(4(%Y D( ( (  3|( (( ř(   (y(L(řǙșəʙ˙G*R{9 | (, (%< (6%t%}(n%r]d(% E07%%b1b2}%%h%:%U%xT(4(% (D((( ((z( %% (m% ( ( (( ( ( ((3? J      ( (  ( ( (   !  g^ (( %     M[f [ ? #%l(( ($$( řt($(%<(4(&-(( R%%e%̕((P (  T(      $( řW  (4(% } D( ( (   3  ( T(  3(4(%Y D( ( (  3 ( T(  3(4(%YD( (  (!" ! "! 3 (# (( ř#( ((}(P($řǙșəʙ˙G*R{9 |(,(%<(%]%f(_%cNU(%6!(()%v-%#%(%%b3%%%z%%%T(4(% (D((( ((( %% (m% ')  Finder % F7/7SWY^ &px( Z) ( _)(+7 B& &^h&( a)  ') |&+7bgtyfk f)(& && &!l)) )$$) ř) ) T)   3)4)%YD)#)ܰ) Ț4) )0)T)  J d)) ( ) ř ())l) řǙșəʙ˙G*R{9 t),)%<) 4)%&4)&p %l%p%eG %%&& (*ɍ rabinkarp search_kind8Rbhr~ & #*      matches_memory_usage pattern_lens 9      min_pattern_len max_pattern_len  d?D _m &-7 *( Z* ( _* ^*>(MY d&m &y& &֑&& && ( a*  (* &, #*   &,  *    *  6  ױ  y ~ f*(2?&HQZKT&])2Օ&;"&Օ&gױ $*T*.* &* * *%!Yl*%t*$*%<* 4*(** Q%%U bœ&* *.** R̊̊ϊЊD^)cO%œ&  ,*;*L* W  * d*#*!* !R*T* H**.m*<* U L*'*4* %%W<* |*8*,* ` <**  %řǙșəʙ˙G*R{9 & kp| *m&  ** %řǙșəʙ˙G*R{9 g<!** ""!"L*T* !Il* ̂*!*# *T*  ^#4-**L* J,* *7*,* %%g<*t*** _&%[$**  %řǙșəʙ˙G*R{9 &kp$|$*%m&4*' 4*& ('% :* ř&* *&" * K L * ***|* F (&l*$ *%<*&P%&%*IJ*&%\*&%M&4*m[}OD^&iܠ& inert$,Fa&9 &E&& çforceonly_teddy_fatonly_teddy_256bitheuristic_pattern_limits^wm &yӭ&&&*m[}OD^&d&ÜĜŜƜǜȜ_w&%6    noncontiguous % p-iOغ ï&&&m&ï&%Yf&& %packed_match_kind %     !\*%   %%8 & & &\ &! & & & &S ֠&/ &&= &&٣&&Ф&f&'Х&&&&&&T*4*% *D*** * œ& % *s %r )+KKKK 7K7K736hm &h *+ *+( (+ ( (+)3?G& &*&e&&o & (+ ( (+   )+ I&*h *+  )  *+   *  6  ױ  y ~ (+)/<ENWGP&Y'09#&hױ ;+\;+ $<+<<+-<+  U%;+D<+ X&&m<+=+;+ ;+$;+%<;+řǙșəʙ˙G*R{9 6& m%q&l& t<+   <<+%t<+$<+%*4<+<(+<+ Q%Ϝ&Z&<+<+<.+=+ R̊̊ϊЊD^)cO%&,=+<;+L=+& =+d=+4=+  =.+=+ ;t=+(=+ =+ A<+  <+&b4<+'x&%%choiceL%%%b&B&&&4 _ref__needlesT<+4<+% <+D<+<+=+<+ &% <+s%rY+DY+ $Y+$Y+,1Y,+DY+ WTY+Z!+    U Ye+DZ+ X&&&~Z++ Z+Z+X+ Y+$X+$Y+řǙșəʙ˙G*R{9 &g SeqD^&&&&(&&&E&L$Z+&ԓZ+tZ+ >$Z++Z+N Z+&e&$Z+&lits!&& _ref__kindDd+&d+$d+ &1Dd+$d+d+d+b+dc+,b+Db+Ş$c+&'+Ŝ/g&Dq+&q+4q+ &2Dr+$r+q+r+p+dp+,p+Dp+Ş$p+&'+Ŝ/g&Dt+&t+dt+ &1tt+t+s+,s+,s+&v6&}v+w+u+,u+,u+ .d+++$+,+ -D+ ",+%|+$+C4++>+d+ ,+Œ<&DÏ+&,ŏ+Ï+$̏+=Dя+$ۏ+̏++i+d+&,+D+Ş$+Œ*-Ŝ0k&D+&,++4+>D+$+++m+d֐+&,+D+Ş$ǐ+Œ*-Ŝ0k&D+&,++d+=t++ёG+,+&,+Œ8&4+&,++<+L+L++ג=+$+&,+Œ7&( +/X + % 7?8 ў+ ΁ %  7?( +  %  7  ?0 + ۚ %  7  ?8 + % 7 ?8 +י % 7 ?0 + % 7 ? ) +6 )$U )Ct ) b )  ) ) +) !(/6D PX%%%?H&&%AJ%!r e  F&&&&d&'&& ( +/X +T\ 3?n 8 ў+΁3? r +( +OX5At 0 +ۚ5A !t /8 + S \5 A t 8 +י 5 A    % t 30 +W`5At  Ý+) &!)%:  %%a %%J\ %h& && &%CU %a%$ % CQ'E cx&&%&&E&&c!&2lѩ+ѩ+ +&$Ǫ+ řt+$+%<+4+*-++ R%%k&̨++T$+ řӰ+\Ӱ+ $߰+<+16 Lǰ+  ̰+ + ) ̲+ ř +d+ $+<+  16  L+  + ز+ )Ӳ+ řܔ+d+ $+<+ 16L+++ )+ řԶ+\+ $´+<ȴ+16L+++ )̕+ řյ+Tյ+ $+<+16Lɵ+ε++ )IJ+ ř+d+ $+<+16L++׷+ )ҷ+ ř++ $+<+ 27! L+!+" Ă+# )"+ ř#$+ ř+ +h+j+j+Ѵh+f+j+s+$&t̨+$+%<+%%g%p%|q`%(&`UD& &~D9(%%b'  5%9Ѷu ѶѶ-ѶѶѶAѶ" %[%&&B&&&D&&&FT+4+% +D++D+CT++,+ &E% +m%++ L++ ,+$+ @5"+++  +  P$+(- U+I  X] Qӹ o x}    + D+L+d+4+ + D+$+T+ +<+ {o +$+4+,+ 2 ++ +D+,+!+ -#+D+|+$+ +4+D++,+ +<+D++ ++(++&d+$+$+ Extractor limit_class limit_repeatlimit_literal_len limit_totalcAbx;$l+ ' 'OPrefixSuffixa2aF&d+ӹ/ӹ8řǙșəʙ˙G*R{9 \5 &']& 't+''F'a extractor2b O ߃''؄''ͅ''|'@&ƈ'''&0&B( , ,)&+8 CLV ,) , '&0` ,$ h$ù 3 ,D ,)&1'9 A $Ubl'` ,$$*/ $$FKS ,)H ,''''7 DN'P ,   (- ř  ,)[ g'o'w  '` ,$$*/ $AFN ,) , '' ''9 FP',d, ,, ,|,(,,  ]$9,, W$ )Q\,' ,,y,,,,řǙșəʙ˙G*R{9 $/a'N''4,$d,,$*,,,d, > ,|,,F,,,$,$<$˛'( 2, 2,)&+ׁ8@IS( 2,   3,!MR_dPq 2,)    3, շ 8 2, ) 2,)-ׁ9]Gշ n 2,) 2, &0 3, ( 2,9 2,)&19 A vR_i  3,& 2,)H 2,ov5 BLP 2,  ׁ (- ř  2,)[ gow  ' 3,(- 9>F 2,) 2,   9 FP ܒ5,5,t5,* 5,L 'sM46,  4, ' 5,4,ׁT4,ƣ>_Ծ7,|7,4 ;D7,FT7, 7,7, 7,$ 'KM78,,7,ׁƣNׁ_/8ׁGVsׁ|ׁ8,  ̞8,' 8,58:,ׁT8,'_9",  9 ,!9;,,9,&_ܦ;,;, ׁ,;,);,:k,:#,,:, /'zd@,@, )@,?,ׁT?,,?,[6},@, @, ) @,ׁxA,|A,,B,B, A4,4B, _ׁЄ]>B,B,Al,ׁTA,,A,>'4D,|D,D,C,,C,,C,X5y} D,}{4F,lF,F,E,E,,E,X5y} F,}{4G,G,G8,G,,G, -a_]ZXa4J,lJ,J,I,I,,I,X5y} J,}{|L,DL,$L,TL,L, L,$ 'KL,KC,,L,,L,ƣ< ̿O,O,",O,|O, O,4O, 2DO,O,lP,LP, P,(P,, )P1, ׁЄQ,lP,DP, P, TP,P(,P,' CP,, ׁЄ~N,O, O#,ȫ",N,O,WЄ UׁNCRׁ"%¼'''?')2ׁAPmׁv~ׁ4̠T,T,",T,T$,DT,'<TT,T?,̆T,'=T,S,ׁTS,ȫ",S,?"''44U,U,\U,ӯ"*lU,V,UI,ȫ"q,Z,Z,DZ,%TZ,Z, $Z,J,Z,YP, Y, ,Y,ׁ,Y,$'W',[,[,D[,%T[,[, #$[,I+[,[`,'4[, L[,ׁ,[,$'W'p l,( l, ) l,)-Є9 ЄDmu\f( l, p l, ` )5afsxdi l,)'˿˿ l,) l, '&0p l,& l,)H l,''ov5 BL q, /7( p, ) q,)-΅9 ΅D `j'( q,  q, +7chuzfk q,)' '''#( , ,)(-:BKUP ,  ׁ8 , ) ,)/;ׁgJ'x ,) , '1P ,ׁ hׁù 4 ,F ,)(3; CTak'P ,ׁׁ+0 ׁׁGLT ,)H ,8 EO'P ,  !). ř  ,)] iqy  'P ,ׁׁ+0'<AI ,) , !: GQ'( , ,)(-Ç:͊BKUP , '8 , ) ,)/Ç;ׁaJ'r ,) , ͊'1P ,ׁ'* ,< ,)(3͊; CzTak'P ,ׁׁ+0'<AI ,)H ,͊͊8 EO'P ,  Ç!). ř  ,*] i͊q͊y  'P ,ׁׁ+0'<AI ,* , ͊͊!: GQ' v, )x w,ׁ v.,*( v,+Bׁ_ w,  w+,*( w,*ISmallIndex::LIMIT x, ) x,ׁ x0,*( x,+Bׁ_ y,  y),*( y,*ISmallIndex::SIZE |,x |,( |,% |!, |, _ׁЄ )Z( |,' P |, |/,8 |, _Є *~ |,' h |, |,* {, {,( {,ÜĜŜƜǜȜ_wЄ.cs']'  , ,'( ,) ށ', ) ,* y,( Ɓ,( ,ׁ?' ' , ) ,*ׁD0 ,P ,( ,( ̓~, ,0 ƃ, _qI ƃ, ڄ,* ,( ,( ,H'0 ,ׁ ,@ ,4P , ˆ,* W,( ,( ,>ׁ  ,*"0 ,ׁx ,0 , 6@ , ,* ۇQ, ,( ,>'ׁ ' ,*$0 ,ׁx ,0 ,¼'4@ , ,* ‰Q, ,( ։,>¼'ׁ ¼' ,*"0 ߋ,ׁx ߋ,0 , 6@ , ,* Q, ɋ,( ,>'ׁ ' ,*$0 ,ׁ ,@ ,4P , ,* Q,( Ύ,( Ď,>  , , ( ,+ +, ,'N( ,' P , 9,8 ƒ,'\ Β,' h ƒ, ,* ̑, ,ȫ"( ,' J'''4 *, #, ( ,, 1, ) ,* ,( ,ȫ"( ԕ,ׁB(40 ,ׁ ,X , 6h , ,* ƗY,ȫ"8 ,( ٗ,?(4( , ,@ ,.P , ,"  , ,* ɞ[,  ,'( Ҟ,( ٞ,77m( Ӡ, Ӡ,@ ٠,.P ٠, Π,.  ɠ, ,* k,'0 ,'H ,( ,'??u( Ѣ, Ѣ,@ ע,.P ע, Т, ' ̢,O( ,* [,  ,'( ,( ,**`'( Ĥ, Ĥ,@ ʤ,.P ʤ, ä, ' ,O( ,* k,'0 ,'H ,( ,**`'x ,Є Є08( , * ,*/;CЄ'\f(( , x ,Є#PUbgRt ,* ''׏( ,* , '1x ,ЄЄ+0 ЄЄGLT ,*H ,''8 EO(p ,΅ ΅08( , * ,*/;ڇC΅'\f(( ,  p ,΅#PUbgRt ,*ڇ ''ŕ(( , 08P , 09( Ѿ, * ־, վ,E*T̋` ̋k ڇ(&(( ؾ, ( , +P ,  ,  8 qv ݾ,* (  ( ڇڇ]kv(j(8 ,@ , , Q4( , ,X ,Q$ , , * , , ,* T,̋` , , , (%67(F 8 ,p , ,50 ,x,  %řǙșəʙ˙G*R{9 Qqv ,x ,m(@ , x , , Q ;  0 ,, %řǙșəʙ˙G*R{9 (m ,0 , W  @ , , P ,  , ř(  , ,  ,* ,LSZ Q, ۡ( , ̋H ,( ,m[}OD^(Ÿ(Lo( ,k (( oCms((ա(ܢ(A( v, )x w,ׁ v.,*Ç( v,+Bׁ_ w,  w+,*( w,*ISmallIndex::LIMIT x, ) x,ׁ x0,*Ç( x,+Bׁ_ y,  y),*( y,*ISmallIndex::SIZE |,x |,( |,% |!, |, _ׁЄÇ )Z( |,( P |, |/,8 |, _ÇЄ +~ |,( h |, |,* {,ÜĜŜƜǜȜ_wÇ {,( {,ÜĜŜƜǜȜ_wÇЄs((g  , ,'( ,) ށ', ) ,* y,Ç( Ɓ,( ,ׁ?' ' , ) ,*ÇׁD0 ,P , *( ,* ̓~, ,0 ƃ, _ÇsI ƃ, ڄ,* ,Ç( ,( ,׬(H((0 ,ׁ ,@ ,4P , ˆ,* W,( ,͊( ,>ׁ  ,*͊"0 ,ׁx ,0 ,'4@ , ,* ۇQ, ,͊( ,>'ׁ ' ,*͊"0 ,ׁx ,0 ,¼'4@ , ,* ‰Q, ,͊( ։,>¼'ׁ ¼' ,*͊"0 ߋ,ׁx ߋ,0 ,'4@ , ,* Q, ɋ,͊( ,>'ׁ ' ,*͊"0 ,ׁ ,@ ,4P , ,* Q,( Ύ,͊( Ď,>  , ,'( ,) +, ,(L( ,( P , 9,8 ƒ,(\ Β,( h ƒ, ,* ̑,׬( ,ȫ"( ,( J'((4 *, #,(( ,* 1, ) ,* ,Ç( ,ȫ"( ԕ,ׁB(40 ,ׁ ,X ,(4h , ,* ƗY,ȫ"8 ,͊( ٗ,?(4( , ,@ , *0P , ,"  , ,* ɞ[,  ,'( Ҟ,Ç( ٞ,͊77m(( Ӡ, Ӡ,@ ٠,(.P ٠, Π,.  ɠ, ,* k,'0 ,'H ,Ç( ,͊'??u(( Ѣ, Ѣ,@ ע,(.P ע, Т, ' ̢,O( ,+ [,  ,'( ,Ç( ,͊**`('( Ĥ, Ĥ,@ ʤ,(.P ʤ, ä, ' ,O( ,+ k,'0 ,'H ,Ç( ,͊**`('x ,Є(*2( , + ,+/; FЄ'_i(( ,  x ,Є#PUbgRt ,+(׏('׏( ,+ , ('1x ,ЄЄ+0(<AI ,+H ,((''8 EO(p ,΅(*2( , + ,+/; F΅'_i(( ,  p ,΅#PUbgRt ,+(ŕ('ŕ(( ,(*2P , 09( Ѿ, + ־, վ,E+T` k((((( ؾ, ( , +P ,  ,  8 qv ݾ,+ (  ( ((]kv(j(8 ,@ , ,(.( , ,X , *M& , , + , , ,+ T,` , , ,(!67(B( 8 ,p , ,50 ,x, (E# ,Gx ,m(@ , x , , Q ;  0 ,, %řǙșəʙ˙G*R{9 Ç(m? ,0 , WÇ  @ , , P ,  , ř(  , ,  ,+ ,LSZ Q, ( , H ,( ,(oŸ((DÇ , ?(1(K{{ Cm"J("((0((e,, *$,*,,**¨**/e (,($, o(,, +($,),,++++N[-(,($, o( ! )1 "إç )1( ! + !+0< D إՏ mwç ( !  !   + "  إ+  7 pu !+   ߰ Տ Ucnd߰ 2256 <&+ (=E( < + <+-Ő9A( (]g(256K\K $K K$ .I(KKW,K,K$K!&R 256012345( f f+&2 :CM ( f,3; fV^#u}Ba     f+/< ENW_iw  f+ f  *H f f+>CIT \ dkr{ ,w\w wvv ,v_f=dy,y $yLRX^g "-+ (   u ~ajNW;D(1      vZ?$   h4= K4=K4=K4 =K 3 < J  3 <J  3<J3<J3< J2;I    .+? L U' qz0(    9`   +  7 pu ,  $ )) %%p~)~)>(   % +7chuzfk , #( /  0"NS`eQr 0, ֕  ϡ)͡) ( 0  4 4=  4> u ?}O @WUc A=W B_l D>x CD  ?@ABC  35 36V 7_ Q 8YUe 95Y :an <6z ;< 789:;  30 1)42<I40U34kq123  3+, 4-<I/+U./ , -. 3 2#յp 2$յq%zO&W d'#Y(an*$z)*%&'() h 2P 2W`OWdY an"z!" ! h 1P 2=FOWdYanz  1 4<IUSYgm  1 ƴ 4 <I  U       0>G4<HT  0, E#ϡ),5=%O7@I|     '  $o ?H5>G "+    (  Y ' 0  % .   4   # $+, 0 5  6 =  >l (? ,  y f    #         8* ; $L | *)4;?*PatternID::SIZEl *)4;?* StateID::SIZE2416H -KKKK 7K7K736Țbg )y( , , ,,-9 A) )]g) ,, ,  &0H -) h)ù 3 ,D ,,&1 9 AԾ)R_i)H -))*/ ))FKS ,,H ,  Ծ)Ծ)7 DN)P -   (- ř  -,[ g o w  )H -))*/ )AFN -, -    Ծ)Ծ)9 FP)8 @̹ ̹/7( ? , ?,-ޚ9 A̹ ̹]g)( @ 8 @̹"NS`eQr @,  )))8 F̹))1( E , E,-9 D̹)]g)h S̹))1й SÇ)2( R , R R>,MY d̹)Ç͊)̹J8.\J. $J. ,J.TJ.dJ.$J.MJ.H.ÜĜŜƜǜȜ_wŶ$ۆI.,H.TH.dI.$I.`) init_value6 match_offsetFI)LL9.\L.),L. ,L.TL.dM.$M.CM.J.)K.,K.TK.dK.$K.`))-)25v).`.. .`.d`.,`.$t`.'`".\`. K$l`.(d`. `$.`. ,`. - $`./ T`..  `. ř `r.$a. ř%`v. Ŷ$ۆ !Tb..  lc.,c. ,c.*#,,Şv8LŞ8Ş$, 1|D$T*, Q<Od,ŞA*lإDإD, 1l@$, /|D$T|D$T+Y$,ŞlŞ*M|D $T* F4*p$,4 !N Ü*T D+J٤L)D3*(  ,(-Ş:BKU ,  '1  hù 2 Dp Ƞ*)@6 ,cnv ~Ƞ*Ƞ* '8p '8@HU ,H J Wa,\ Ş4*Fd,Ş{9*TDE$,qd=DT#tB3ԷN,,>|D $T.TD> !|$,41 4a*DT ,D ,; ,w Ş$,4ƣƣC Fu,l,*(<| Ț$P/J,,Ş,')Y**,l,*(<| #Ț$O.ZƷ"LƷ"LŞ,')Y**,l,*(<| $N-I$,Ş,')Y**\L+ ,`Ş$,znٜATD* ʀ^dŞ$Ҁ~rŜAT\̛DLĂ2 !ӂm$,',9ٜ<jTT˃ĽDكDك0 !b$',$9Ŝ<j(  É,(-3@HQ[( ˉ    ,h ʋ o *  6 ot Љ,   Ygrf3 ԉ, ҉ $-7  hù 4 ։Fh ʋȠ*)@6 ډ,cnv ~*Ƞ* +0Ĝ <AIPh ʋ'8@HU ,H ܉M ZdĜ @쉍 ,ČhL<ό4N It<" 4 _KD8tL4(L<̏4܏N' *Y*d?L, 1\̕ݕ9,, 0( ؚ ݚ,(-3@HQ[(    ,P   Ş,  8 qv -   ^lwk*8 -  $-7 ** <P Ş hŞù 4KA -ny ** +0Ĝ <AIPP ŞŞ+0 ŞŞGLTYan -H "Q ^hĜ ]*\$Ģ Ş$4ĢTܢDܢ , "`"` 2 @` `U# ,<*$Ş$' NGŜJŜM*  Ī +| *<M$ī *T *H-ϫتw Ϋ7,<*$*eN/Ŝ2*T**dѮ?L, 1\$ $4گ>,,Şx8*\±$DZ*$±4DZ|±ױ:,,Şv8*\$*$4*,*O<R,ŞA**LŞ4Ş$, 1\$*$4*D*OTE$,Ş?**\$*$4*O,<,ѷ,ǷŞ@*P    ljk# \a *s{(  - -2> F* *q{(* (   P  +   *-  9 rw -    **^lwk*9 -   $-7P '8  **,1 **HMUZbo ǿ-H   **N [e*  *2x (  - -2> Iq{ (    ` +x   +  7 pu - *  Ygrf4 6܋<< 0{?ippp opopo2Ы *(  - -1---SE(6k *v*D *P*n(   6*,8ejw|gl -* ***&(  -(-إ:Տ BKU( 'H LT3 ? n   -9? MՏ V_gpyTfo   -  Տ '1H ,; K Տ \ ixՏ H Տ  /Տ @ Y  e  sx   -Տ Տ Տ Տ %.7Տ Տ (Տ 1Տ :D Ran ѧ , |]) }] ! }] ٱg |`]$Տ ,lT,\$ řL ř ӷ#ҶՏ ,ȶZ(  -(4&<EOl - -8 ( %,4  PX$qv  -&  - &!+H  -@EKV&^&fmt}  ! ljk#Ȩ]b +t|(  - -/ۆ;C+ +_i+(    !+$QVchSu - +++ -  '1 !++,1 ++HMU -H ++8 EO+( )p  إ %ç  1 9P    -  h  -M@ h :*W -y -  - Ȩ Ȩ X`Տ إHT D [ ç o8 ( )p إNVY2:ZFRP 2:GS)/=CVh  y 4<oH T @ h 09[PX\dX `ol x     - +#,4 G3ObkW`i);DM Տ ߰  4 $ .g ߰ E|;  -  "+*3=H ,; K!+\ !i ~"+" #+# $+ $  -%+? %M p &+&إ/'+@'إYe sx Տ Տ  P (+(.)+?)Wcqvh *+*.++?+Wcqv @ ,+ ,h -+ -\.+m.W/+h/     # -0++++ "*   / 8 A% Տ mՏ v߰ ߰ ++++ +++$+-+6+?+H+Q+Z+c+lv   f ѧOѧ\ѧ ѧ++?%Њ 0ݪ)1Њ 0ݪ)2( 0 - 0 0>-MY aݪݪ ݪ( 0  Ћ 0 ݪ+Ћ 0  ݪ+  7 pu 0-     Zhsh+6P 0 0)1 0)2( 0 - 0 0A-Pݪ\d@%( <0   <0ppp opopo2ЫÇam <0- ---- _(1!  +0+9\ju+j4>0+l>0$>0 Q+24>0>04>0AD>0>0=L0|>0 +L>0 +D+$ 1 %T 1 1$ .I 11$1 1%!B%<1d1,1l1$1_1$ .1$1 1D1$1 0\1 d1$1$197 1l1 $1     1 1  $  . 1 $1 1 L1  1   = I1 1h p \1 >D 1\1$1A\1 d1$1$1Z7  1l1$1 11$ . 1$1 1L1 1   =I1 1h p \1 >D 1\1$1a\1  d1$1$1z7  1l1$1 11$ .1$1 1L1  1   = I1  1h p  \1" >"D 1 1 1 1111$%\1%pM4UyyV{J>>+|b+W256256\ 1  L 1 ! &1%\ 1'_2561D1,1T1($1 řͯ# 1 D1 3l11 [$1 1(1! <1,1!8 " 1 D1 11\11  1  D1      3  l1  1 řͯ#  1 D1 ,Ol1 1 řͯ#1T1 /&1 1 řͯ##11 z l1"'")1" 1+ D1,-+, -,+ 1#L1,1 À# 1(<1)'(1$1 QCharsyD4]Nc'&41141 W&y%D11$ %#1 řͯ#$ 1R*+l1) *1 řͯ#) 1111<11,1.и#ľ1,1h&$1ͯ#5 ͯ#<'.ͯ#Y>ÜĜŜƜǜȜ_w Utf8Error valid_up_toy error_leny"C*uH,1ͯ#řǙșəʙ˙G*R{9  ++ͯ#7\GNd1(4f#  +bN++4++X+1D1,1T1($1 řͯ#1\1|1 1$ 'K\11t1% 11,1 l1  ,1 d1    3  (1Խ1  \  '  T1 1$ ' K\1,181 L1,18 "141#|1 $1ELͯ#3\1|1 1$ '1ͯ#41 d1 řͯ# 1$1 řͯ#1 31 !1 řͯ# 11111и#1,1L1sƣn,1$nƣ`и#ӕ41$1ͯ#ͯ#Kƣ#_3*+u##1   $1 ř<1 ř 1-̕1 $1 ř1  <1 ř 1-1  <1 ř 1-̜1  <1 ř 1-am|  x    11 l1$1qxOV:ASvd11,1 141-1N $1 $1\$1\!1!1 !1$$1 $1\$1=%11$01 $1,1 1^$!1! GKW,1 \,1, 1\,1-1&1$'1 '1j4 (4;B (4;B| (4;Bd (4;B (4װ<C$ (4<C, (4<C '3װ;B\  '3;B> '3:A? '3:A '3װ;BL' '3;B$( '3;B.% (4;B (4 <C   '3;B   '3;B   '3Ɩ;B"$   (4<C1*   (4<CI)   (4<C̀S   '3ң;BX   (4<Cw   '3;B   (4<Cņ   (4<C   (4<C   (4<Cܰ   (4;B   )ם5=D%   )5=Dɪ$   )˞5=D   (4NJ<C"   )ʟ5<C4 " ""'3 ;BD " ""'3;B$" ""'3;Bt> ##'3;B4 ##(Ƚ4<C, ##(Ƚ4<C< $$(4Ç<C %%(4̻<C %%(4̻<C$ʄ %%(4̻<C| %%'3;B  %%'3:A" %%'3:AF %%'3;B %%(4<Cl &&(4<Ct - LOv} &&(4<C$ &&'3:A$ ) Sckr,= '')5=D4= '')5<C!% ' '/ ; CJ% ''. :ې BI% ''. : BI! !0<DKՆ# (()5<C>! !0<#DK[/ #2$>$FM ((,8@Gi' ((&2%:Ai( ((&29@̦ ( ((*6=DK( ((-9@GNU4+ ))(4<C<+ ))(4<C<+ ))(4<C4+ ))(4<C,+ ))(4<C<ɞ+ ))(4<C\ߞ+ ))(4<C, ))'3$;B2, ))'ׁ3:A, ))(4ׁ<C, ))(Ç4ׁ<C !, **+7Є?F (, **+7΅?F !, +++7Є?F (, +++7΅?F܃0 ,,'֕3;B- ,,'3);B@# ,,(ޚ4̹<CE% ,,(4̹<C|u )ߏ omr/#fnu * {L2>v1(gʹov< --(إ4<C --(ۆ4+<C<#0 --*+6+>E  2,2L2),&,$,L,,,̼Tտ--t-žDʨ-ӿL-T-tȗ-22 This crate exposes a variety of regex engines used by the `regex` crate. It provides a vast, sprawling and "expert" level API to each regex engine. The regex engines provided by this crate focus heavily on finite automata implementations and specifically guarantee worst case `O(m * n)` time complexity for all searches. (Where `m ~ len(regex)` and `n ~ len(haystack)`.) The primary goal of this crate is to serve as an implementation detail for the `regex` crate. A secondary goal is to make its internals available for use by others. # Table of contents * [Should I be using this crate?](#should-i-be-using-this-crate) gives some reasons for and against using this crate. * [Examples](#examples) provides a small selection of things you can do with this crate. * [Available regex engines](#available-regex-engines) provides a hyperlinked list of all regex engines in this crate. * [API themes](#api-themes) discusses common elements used throughout this crate. * [Crate features](#crate-features) documents the extensive list of Cargo features available. # Should I be using this crate? If you find yourself here because you just want to use regexes, then you should first check out whether the [`regex` crate](https://docs.rs/regex) meets your needs. It provides a streamlined and difficult-to-misuse API for regex searching. If you're here because there is something specific you want to do that can't be easily done with `regex` crate, then you are perhaps in the right place. It's most likely that the first stop you'll want to make is to explore the [`meta` regex APIs](meta). Namely, the `regex` crate is just a light wrapper over a [`meta::Regex`], so its API will probably be the easiest to transition to. In contrast to the `regex` crate, the `meta::Regex` API supports more search parameters and does multi-pattern searches. However, it isn't quite as ergonomic. Otherwise, the following is an inexhaustive list of reasons to use this crate: * You want to analyze or use a [Thompson `NFA`](nfa::thompson::NFA) directly. * You want more powerful multi-pattern search than what is provided by `RegexSet` in the `regex` crate. All regex engines in this crate support multi-pattern searches. * You want to use one of the `regex` crate's internal engines directly because of some interesting configuration that isn't possible via the `regex` crate. For example, a [lazy DFA's configuration](hybrid::dfa::Config) exposes a dizzying number of options for controlling its execution. * You want to use the lower level search APIs. For example, both the [lazy DFA](hybrid::dfa) and [fully compiled DFAs](dfa) support searching by exploring the automaton one state at a time. This might be useful, for example, for stream searches or searches of strings stored in non-contiguous in memory. * You want to build a fully compiled DFA and then [use zero-copy deserialization](dfa::dense::DFA::from_bytes) to load it into memory and use it for searching. This use case is supported in core-only no-std/no-alloc environments. * You want to run [anchored searches](Input::anchored) without using the `^` anchor in your regex pattern. * You need to work-around contention issues with sharing a regex across multiple threads. The [`meta::Regex::search_with`](meta::Regex::search_with) API permits bypassing any kind of synchronization at all by requiring the caller to provide the mutable scratch spaced needed during a search. * You want to build your own regex engine on top of the `regex` crate's infrastructure. # Examples This section tries to identify a few interesting things you can do with this crate and demonstrates them. ### Multi-pattern searches with capture groups One of the more frustrating limitations of `RegexSet` in the `regex` crate (at the time of writing) is that it doesn't report match positions. With this crate, multi-pattern support was intentionally designed in from the beginning, which means it works in all regex engines and even for capture groups as well. This example shows how to search for matches of multiple regexes, where each regex uses the same capture group names to parse different key-value formats. ``` use regex_automata::{meta::Regex, PatternID}; let re = Regex::new_many(&[ r#"(?m)^(?[[:word:]]+)=(?[[:word:]]+)$"#, r#"(?m)^(?[[:word:]]+)="(?[^"]+)"$"#, r#"(?m)^(?[[:word:]]+)='(?[^']+)'$"#, r#"(?m)^(?[[:word:]]+):\s*(?[[:word:]]+)$"#, ])?; let hay = r#" best_album="Blow Your Face Out" best_quote='"then as it was, then again it will be"' best_year=1973 best_simpsons_episode: HOMR "#; let mut kvs = vec![]; for caps in re.captures_iter(hay) { // N.B. One could use capture indices '1' and '2' here // as well. Capture indices are local to each pattern. // (Just like names are.) let key = &hay[caps.get_group_by_name("key").unwrap()]; let val = &hay[caps.get_group_by_name("val").unwrap()]; kvs.push((key, val)); } assert_eq!(kvs, vec![ ("best_album", "Blow Your Face Out"), ("best_quote", "\"then as it was, then again it will be\""), ("best_year", "1973"), ("best_simpsons_episode", "HOMR"), ]); # Ok::<(), Box>(()) ``` ### Build a full DFA and walk it manually One of the regex engines in this crate is a fully compiled DFA. It takes worst case exponential time to build, but once built, it can be easily explored and used for searches. Here's a simple example that uses its lower level APIs to implement a simple anchored search by hand. ``` use regex_automata::{dfa::{Automaton, dense}, Input}; let dfa = dense::DFA::new(r"(?-u)\b[A-Z]\w+z\b")?; let haystack = "Quartz"; // The start state is determined by inspecting the position and the // initial bytes of the haystack. let mut state = dfa.start_state_forward(&Input::new(haystack))?; // Walk all the bytes in the haystack. for &b in haystack.as_bytes().iter() { state = dfa.next_state(state, b); } // DFAs in this crate require an explicit // end-of-input transition if a search reaches // the end of a haystack. state = dfa.next_eoi_state(state); assert!(dfa.is_match_state(state)); # Ok::<(), Box>(()) ``` Or do the same with a lazy DFA that avoids exponential worst case compile time, but requires mutable scratch space to lazily build the DFA during the search. ``` use regex_automata::{hybrid::dfa::DFA, Input}; let dfa = DFA::new(r"(?-u)\b[A-Z]\w+z\b")?; let mut cache = dfa.create_cache(); let hay = "Quartz"; // The start state is determined by inspecting the position and the // initial bytes of the haystack. let mut state = dfa.start_state_forward(&mut cache, &Input::new(hay))?; // Walk all the bytes in the haystack. for &b in hay.as_bytes().iter() { state = dfa.next_state(&mut cache, state, b)?; } // DFAs in this crate require an explicit // end-of-input transition if a search reaches // the end of a haystack. state = dfa.next_eoi_state(&mut cache, state)?; assert!(state.is_match()); # Ok::<(), Box>(()) ``` ### Find all overlapping matches This example shows how to build a DFA and use it to find all possible matches, including overlapping matches. A similar example will work with a lazy DFA as well. This also works with multiple patterns and will report all matches at the same position where multiple patterns match. ``` use regex_automata::{ dfa::{dense, Automaton, OverlappingState}, Input, MatchKind, }; let dfa = dense::DFA::builder() .configure(dense::DFA::config().match_kind(MatchKind::All)) .build(r"(?-u)\w{3,}")?; let input = Input::new("homer marge bart lisa maggie"); let mut state = OverlappingState::start(); let mut matches = vec![]; while let Some(hm) = { dfa.try_search_overlapping_fwd(&input, &mut state)?; state.get_match() } { matches.push(hm.offset()); } assert_eq!(matches, vec![ 3, 4, 5, // hom, home, homer 9, 10, 11, // mar, marg, marge 15, 16, // bar, bart 20, 21, // lis, lisa 25, 26, 27, 28, // mag, magg, maggi, maggie ]); # Ok::<(), Box>(()) ``` # Available regex engines The following is a complete list of all regex engines provided by this crate, along with a very brief description of it and why you might want to use it. * [`dfa::regex::Regex`] is a regex engine that works on top of either [dense](dfa::dense) or [sparse](dfa::sparse) fully compiled DFAs. You might use a DFA if you need the fastest possible regex engine in this crate and can afford the exorbitant memory usage usually required by DFAs. Low level APIs on fully compiled DFAs are provided by the [`Automaton` trait](dfa::Automaton). Fully compiled dense DFAs can handle all regexes except for searching a regex with a Unicode word boundary on non-ASCII haystacks. A fully compiled DFA based regex can only report the start and end of each match. * [`hybrid::regex::Regex`] is a regex engine that works on top of a lazily built DFA. Its performance profile is very similar to that of fully compiled DFAs, but can be slower in some pathological cases. Fully compiled DFAs are also amenable to more optimizations, such as state acceleration, that aren't available in a lazy DFA. You might use this lazy DFA if you can't abide the worst case exponential compile time of a full DFA, but still want the DFA search performance in the vast majority of cases. A lazy DFA based regex can only report the start and end of each match. * [`dfa::onepass::DFA`] is a regex engine that is implemented as a DFA, but can report the matches of each capture group in addition to the start and end of each match. The catch is that it only works on a somewhat small subset of regexes known as "one-pass." You'll want to use this for cases when you need capture group matches and the regex is one-pass since it is likely to be faster than any alternative. A one-pass DFA can handle all types of regexes, but does have some reasonable limits on the number of capture groups it can handle. * [`nfa::thompson::backtrack::BoundedBacktracker`] is a regex engine that uses backtracking, but keeps track of the work it has done to avoid catastrophic backtracking. Like the one-pass DFA, it provides the matches of each capture group. It retains the `O(m * n)` worst case time bound. This tends to be slower than the one-pass DFA regex engine, but faster than the PikeVM. It can handle all types of regexes, but usually only works well with small haystacks and small regexes due to the memory required to avoid redoing work. * [`nfa::thompson::pikevm::PikeVM`] is a regex engine that can handle all regexes, of all sizes and provides capture group matches. It tends to be a tool of last resort because it is also usually the slowest regex engine. * [`meta::Regex`] is the meta regex engine that combines *all* of the above engines into one. The reason for this is that each of the engines above have their own caveats such as, "only handles a subset of regexes" or "is generally slow." The meta regex engine accounts for all of these caveats and composes the engines in a way that attempts to mitigate each engine's weaknesses while emphasizing its strengths. For example, it will attempt to run a lazy DFA even if it might fail. In which case, it will restart the search with a likely slower but more capable regex engine. The meta regex engine is what you should default to. Use one of the above engines directly only if you have a specific reason to. # API themes While each regex engine has its own APIs and configuration options, there are some general themes followed by all of them. ### The `Input` abstraction Most search routines in this crate accept anything that implements `Into`. Both `&str` and `&[u8]` haystacks satisfy this constraint, which means that things like `engine.search("foo")` will work as you would expect. By virtue of accepting an `Into` though, callers can provide more than just a haystack. Indeed, the [`Input`] type has more details, but briefly, callers can use it to configure various aspects of the search: * The span of the haystack to search via [`Input::span`] or [`Input::range`], which might be a substring of the haystack. * Whether to run an anchored search or not via [`Input::anchored`]. This permits one to require matches to start at the same offset that the search started. * Whether to ask the regex engine to stop as soon as a match is seen via [`Input::earliest`]. This can be used to find the offset of a match as soon as it is known without waiting for the full leftmost-first match to be found. This can also be used to avoid the worst case `O(m * n^2)` time complexity of iteration. Some lower level search routines accept an `&Input` for performance reasons. In which case, `&Input::new("haystack")` can be used for a simple search. ### Error reporting Most, but not all, regex engines in this crate can fail to execute a search. When a search fails, callers cannot determine whether or not a match exists. That is, the result is indeterminate. Search failure, in all cases in this crate, is represented by a [`MatchError`]. Routines that can fail start with the `try_` prefix in their name. For example, [`hybrid::regex::Regex::try_search`] can fail for a number of reasons. Conversely, routines that either can't fail or can panic on failure lack the `try_` prefix. For example, [`hybrid::regex::Regex::find`] will panic in cases where [`hybrid::regex::Regex::try_search`] would return an error, and [`meta::Regex::find`] will never panic. Therefore, callers need to pay close attention to the panicking conditions in the documentation. In most cases, the reasons that a search fails are either predictable or configurable, albeit at some additional cost. An example of predictable failure is [`BoundedBacktracker::try_search`](nfa::thompson::backtrack::BoundedBacktracker::try_search). Namely, it fails whenever the multiplication of the haystack, the regex and some constant exceeds the [configured visited capacity](nfa::thompson::backtrack::Config::visited_capacity). Callers can predict the failure in terms of haystack length via the [`BoundedBacktracker::max_haystack_len`](nfa::thompson::backtrack::BoundedBacktracker::max_haystack_len) method. While this form of failure is technically avoidable by increasing the visited capacity, it isn't practical to do so for all inputs because the memory usage required for larger haystacks becomes impractically large. So in practice, if one is using the bounded backtracker, you really do have to deal with the failure. An example of configurable failure happens when one enables heuristic support for Unicode word boundaries in a DFA. Namely, since the DFAs in this crate (except for the one-pass DFA) do not support Unicode word boundaries on non-ASCII haystacks, building a DFA from an NFA that contains a Unicode word boundary will itself fail. However, one can configure DFAs to still be built in this case by [configuring heuristic support for Unicode word boundaries](hybrid::dfa::Config::unicode_word_boundary). If the NFA the DFA is built from contains a Unicode word boundary, then the DFA will still be built, but special transitions will be added to every state that cause the DFA to fail if any non-ASCII byte is seen. This failure happens at search time and it requires the caller to opt into this. There are other ways for regex engines to fail in this crate, but the above two should represent the general theme of failures one can find. Dealing with these failures is, in part, one the responsibilities of the [meta regex engine](meta). Notice, for example, that the meta regex engine exposes an API that never returns an error nor panics. It carefully manages all of the ways in which the regex engines can fail and either avoids the predictable ones entirely (e.g., the bounded backtracker) or reacts to configured failures by falling back to a different engine (e.g., the lazy DFA quitting because it saw a non-ASCII byte). ### Configuration and Builders Most of the regex engines in this crate come with two types to facilitate building the regex engine: a `Config` and a `Builder`. A `Config` is usually specific to that particular regex engine, but other objects such as parsing and NFA compilation have `Config` types too. A `Builder` is the thing responsible for taking inputs (either pattern strings or already-parsed patterns or even NFAs directly) and turning them into an actual regex engine that can be used for searching. The main reason why building a regex engine is a bit complicated is because of the desire to permit composition with de-coupled components. For example, you might want to [manually construct a Thompson NFA](nfa::thompson::Builder) and then build a regex engine from it without ever using a regex parser at all. On the other hand, you might also want to build a regex engine directly from the concrete syntax. This demonstrates why regex engine construction is so flexible: it needs to support not just convenient construction, but also construction from parts built elsewhere. This is also in turn why there are many different `Config` structs in this crate. Let's look more closely at an example: [`hybrid::regex::Builder`]. It accepts three different `Config` types for configuring construction of a lazy DFA regex: * [`hybrid::regex::Builder::syntax`] accepts a [`util::syntax::Config`] for configuring the options found in the [`regex-syntax`](regex_syntax) crate. For example, whether to match case insensitively. * [`hybrid::regex::Builder::thompson`] accepts a [`nfa::thompson::Config`] for configuring construction of a [Thompson NFA](nfa::thompson::NFA). For example, whether to build an NFA that matches the reverse language described by the regex. * [`hybrid::regex::Builder::dfa`] accept a [`hybrid::dfa::Config`] for configuring construction of the pair of underlying lazy DFAs that make up the lazy DFA regex engine. For example, changing the capacity of the cache used to store the transition table. The lazy DFA regex engine uses all three of those configuration objects for methods like [`hybrid::regex::Builder::build`], which accepts a pattern string containing the concrete syntax of your regex. It uses the syntax configuration to parse it into an AST and translate it into an HIR. Then the NFA configuration when compiling the HIR into an NFA. And then finally the DFA configuration when lazily determinizing the NFA into a DFA. Notice though that the builder also has a [`hybrid::regex::Builder::build_from_dfas`] constructor. This permits callers to build the underlying pair of lazy DFAs themselves (one for the forward searching to find the end of a match and one for the reverse searching to find the start of a match), and then build the regex engine from them. The lazy DFAs, in turn, have their own builder that permits [construction directly from a Thompson NFA](hybrid::dfa::Builder::build_from_nfa). Continuing down the rabbit hole, a Thompson NFA has its own compiler that permits [construction directly from an HIR](nfa::thompson::Compiler::build_from_hir). The lazy DFA regex engine builder lets you follow this rabbit hole all the way down, but also provides convenience routines that do it for you when you don't need precise control over every component. The [meta regex engine](meta) is a good example of something that utilizes the full flexibility of these builders. It often needs not only precise control over each component, but also shares them across multiple regex engines. (Most sharing is done by internal reference accounting. For example, an [`NFA`](nfa::thompson::NFA) is reference counted internally which makes cloning cheap.) ### Size limits Unlike the `regex` crate, the `regex-automata` crate specifically does not enable any size limits by default. That means users of this crate need to be quite careful when using untrusted patterns. Namely, because bounded repetitions can grow exponentially by stacking them, it is possible to build a very large internal regex object from just a small pattern string. For example, the NFA built from the pattern `a{10}{10}{10}{10}{10}{10}{10}` is over 240MB. There are multiple size limit options in this crate. If one or more size limits are relevant for the object you're building, they will be configurable via methods on a corresponding `Config` type. # Crate features This crate has a dizzying number of features. The main idea is to be able to control how much stuff you pull in for your specific use case, since the full crate is quite large and can dramatically increase compile times and binary size. The most barebones but useful configuration is to disable all default features and enable only `dfa-search`. This will bring in just the DFA deserialization and search routines without any dependency on `std` or `alloc`. This does require generating and serializing a DFA, and then storing it somewhere, but it permits regex searches in freestanding or embedded environments. Because there are so many features, they are split into a few groups. The default set of features is: `std`, `syntax`, `perf`, `unicode`, `meta`, `nfa`, `dfa` and `hybrid`. Basically, the default is to enable everything except for development related features like `logging`. ### Ecosystem features * **std** - Enables use of the standard library. In terms of APIs, this usually just means that error types implement the `std::error::Error` trait. Otherwise, `std` sometimes enables the code to be faster, for example, using a `HashMap` instead of a `BTreeMap`. (The `std` feature matters more for dependencies like `aho-corasick` and `memchr`, where `std` is required to enable certain classes of SIMD optimizations.) Enabling `std` automatically enables `alloc`. * **alloc** - Enables use of the `alloc` library. This is required for most APIs in this crate. The main exception is deserializing and searching with fully compiled DFAs. * **logging** - Adds a dependency on the `log` crate and makes this crate emit log messages of varying degrees of utility. The log messages are especially useful in trying to understand what the meta regex engine is doing. ### Performance features **Note**: To get performance benefits offered by the SIMD, `std` must be enabled. None of the `perf-*` features will enable `std` implicitly. * **perf** - Enables all of the below features. * **perf-inline** - When enabled, `inline(always)` is used in (many) strategic locations to help performance at the expense of longer compile times and increased binary size. * **perf-literal** - Enables all literal related optimizations. * **perf-literal-substring** - Enables all single substring literal optimizations. This includes adding a dependency on the `memchr` crate. * **perf-literal-multisubstring** - Enables all multiple substring literal optimizations. This includes adding a dependency on the `aho-corasick` crate. ### Unicode features * **unicode** - Enables all Unicode features. This feature is enabled by default, and will always cover all Unicode features, even if more are added in the future. * **unicode-age** - Provide the data for the [Unicode `Age` property](https://www.unicode.org/reports/tr44/tr44-24.html#Character_Age). This makes it possible to use classes like `\p{Age:6.0}` to refer to all codepoints first introduced in Unicode 6.0 * **unicode-bool** - Provide the data for numerous Unicode boolean properties. The full list is not included here, but contains properties like `Alphabetic`, `Emoji`, `Lowercase`, `Math`, `Uppercase` and `White_Space`. * **unicode-case** - Provide the data for case insensitive matching using [Unicode's "simple loose matches" specification](https://www.unicode.org/reports/tr18/#Simple_Loose_Matches). * **unicode-gencat** - Provide the data for [Unicode general categories](https://www.unicode.org/reports/tr44/tr44-24.html#General_Category_Values). This includes, but is not limited to, `Decimal_Number`, `Letter`, `Math_Symbol`, `Number` and `Punctuation`. * **unicode-perl** - Provide the data for supporting the Unicode-aware Perl character classes, corresponding to `\w`, `\s` and `\d`. This is also necessary for using Unicode-aware word boundary assertions. Note that if this feature is disabled, the `\s` and `\d` character classes are still available if the `unicode-bool` and `unicode-gencat` features are enabled, respectively. * **unicode-script** - Provide the data for [Unicode scripts and script extensions](https://www.unicode.org/reports/tr24/). This includes, but is not limited to, `Arabic`, `Cyrillic`, `Hebrew`, `Latin` and `Thai`. * **unicode-segment** - Provide the data necessary to provide the properties used to implement the [Unicode text segmentation algorithms](https://www.unicode.org/reports/tr29/). This enables using classes like `\p{gcb=Extend}`, `\p{wb=Katakana}` and `\p{sb=ATerm}`. * **unicode-word-boundary** - Enables support for Unicode word boundaries, i.e., `\b`, in regexes. When this and `unicode-perl` are enabled, then data tables from `regex-syntax` are used to implement Unicode word boundaries. However, if `regex-syntax` isn't enabled as a dependency then one can still enable this feature. It will cause `regex-automata` to bundle its own data table that would otherwise be redundant with `regex-syntax`'s table. ### Regex engine features * **syntax** - Enables a dependency on `regex-syntax`. This makes APIs for building regex engines from pattern strings available. Without the `regex-syntax` dependency, the only way to build a regex engine is generally to deserialize a previously built DFA or to hand assemble an NFA using its [builder API](nfa::thompson::Builder). Once you have an NFA, you can build any of the regex engines in this crate. The `syntax` feature also enables `alloc`. * **meta** - Enables the meta regex engine. This also enables the `syntax` and `nfa-pikevm` features, as both are the minimal requirements needed. The meta regex engine benefits from enabling any of the other regex engines and will use them automatically when appropriate. * **nfa** - Enables all NFA related features below. * **nfa-thompson** - Enables the Thompson NFA APIs. This enables `alloc`. * **nfa-pikevm** - Enables the PikeVM regex engine. This enables `nfa-thompson`. * **nfa-backtrack** - Enables the bounded backtracker regex engine. This enables `nfa-thompson`. * **dfa** - Enables all DFA related features below. * **dfa-build** - Enables APIs for determinizing DFAs from NFAs. This enables `nfa-thompson` and `dfa-search`. * **dfa-search** - Enables APIs for searching with DFAs. * **dfa-onepass** - Enables the one-pass DFA API. This enables `nfa-thompson`. * **hybrid** - Enables the hybrid NFA/DFA or "lazy DFA" regex engine. This enables `alloc` and `nfa-thompson`.   ajbj`j^j)\j,[j,Yj,Wj,̼Uj-Sj-Qj-žOj-ӿMj-Kj-Ij-\k_kbk2Zk2Ok"2t2`k2T24233 3 3 3 3, 3 3 3, 383& 383 3*3 3 3+ 3 3 383 3 38<3 37loggingL3 3 3, 3 3 3, 383 33,3 3 3 3 3, 3 3 3, 383& 383 3*3 3 383 3 3 383'38,3 3 3 3, 3 3 3, 383 33,3 3 3 3 3, 3 3 3, 383& 383 3*3 3 383 3 3 383'38,3 3 3 3, 3 3 3, 383 3\2ss A module for building and searching with deterministic finite automata (DFAs). Like other modules in this crate, DFAs support a rich regex syntax with Unicode features. DFAs also have extensive options for configuring the best space vs time trade off for your use case and provides support for cheap deserialization of automata for use in `no_std` environments. If you're looking for lazy DFAs that build themselves incrementally during search, then please see the top-level [`hybrid` module](crate::hybrid). # Overview This section gives a brief overview of the primary types in this module: * A [`regex::Regex`] provides a way to search for matches of a regular expression using DFAs. This includes iterating over matches with both the start and end positions of each match. * A [`dense::DFA`] provides low level access to a DFA that uses a dense representation (uses lots of space, but fast searching). * A [`sparse::DFA`] provides the same API as a `dense::DFA`, but uses a sparse representation (uses less space, but slower searching). * An [`Automaton`] trait that defines an interface that both dense and sparse DFAs implement. (A `regex::Regex` is generic over this trait.) * Both dense DFAs and sparse DFAs support serialization to raw bytes (e.g., [`dense::DFA::to_bytes_little_endian`]) and cheap deserialization (e.g., [`dense::DFA::from_bytes`]). There is also a [`onepass`] module that provides a [one-pass DFA](onepass::DFA). The unique advantage of this DFA is that, for the class of regexes it can be built with, it supports reporting the spans of matching capturing groups. It is the only DFA in this crate capable of such a thing. # Example: basic regex searching This example shows how to compile a regex using the default configuration and then use it to find matches in a byte string: ``` use regex_automata::{Match, dfa::regex::Regex}; let re = Regex::new(r"[0-9]{4}-[0-9]{2}-[0-9]{2}")?; let text = b"2018-12-24 2016-10-08"; let matches: Vec = re.find_iter(text).collect(); assert_eq!(matches, vec![ Match::must(0, 0..10), Match::must(0, 11..21), ]); # Ok::<(), Box>(()) ``` # Example: searching with regex sets The DFAs in this module all fully support searching with multiple regexes simultaneously. You can use this support with standard leftmost-first style searching to find non-overlapping matches: ``` # if cfg!(miri) { return Ok(()); } // miri takes too long use regex_automata::{Match, dfa::regex::Regex}; let re = Regex::new_many(&[r"\w+", r"\S+"])?; let text = b"@foo bar"; let matches: Vec = re.find_iter(text).collect(); assert_eq!(matches, vec![ Match::must(1, 0..4), Match::must(0, 5..8), ]); # Ok::<(), Box>(()) ``` # Example: use sparse DFAs By default, compiling a regex will use dense DFAs internally. This uses more memory, but executes searches more quickly. If you can abide slower searches (somewhere around 3-5x), then sparse DFAs might make more sense since they can use significantly less space. Using sparse DFAs is as easy as using `Regex::new_sparse` instead of `Regex::new`: ``` use regex_automata::{Match, dfa::regex::Regex}; let re = Regex::new_sparse(r"[0-9]{4}-[0-9]{2}-[0-9]{2}").unwrap(); let text = b"2018-12-24 2016-10-08"; let matches: Vec = re.find_iter(text).collect(); assert_eq!(matches, vec![ Match::must(0, 0..10), Match::must(0, 11..21), ]); # Ok::<(), Box>(()) ``` If you already have dense DFAs for some reason, they can be converted to sparse DFAs and used to build a new `Regex`. For example: ``` use regex_automata::{Match, dfa::regex::Regex}; let dense_re = Regex::new(r"[0-9]{4}-[0-9]{2}-[0-9]{2}").unwrap(); let sparse_re = Regex::builder().build_from_dfas( dense_re.forward().to_sparse()?, dense_re.reverse().to_sparse()?, ); let text = b"2018-12-24 2016-10-08"; let matches: Vec = sparse_re.find_iter(text).collect(); assert_eq!(matches, vec![ Match::must(0, 0..10), Match::must(0, 11..21), ]); # Ok::<(), Box>(()) ``` # Example: deserialize a DFA This shows how to first serialize a DFA into raw bytes, and then deserialize those raw bytes back into a DFA. While this particular example is a bit contrived, this same technique can be used in your program to deserialize a DFA at start up time or by memory mapping a file. ``` use regex_automata::{Match, dfa::{dense, regex::Regex}}; let re1 = Regex::new(r"[0-9]{4}-[0-9]{2}-[0-9]{2}").unwrap(); // serialize both the forward and reverse DFAs, see note below let (fwd_bytes, fwd_pad) = re1.forward().to_bytes_native_endian(); let (rev_bytes, rev_pad) = re1.reverse().to_bytes_native_endian(); // now deserialize both---we need to specify the correct type! let fwd: dense::DFA<&[u32]> = dense::DFA::from_bytes(&fwd_bytes[fwd_pad..])?.0; let rev: dense::DFA<&[u32]> = dense::DFA::from_bytes(&rev_bytes[rev_pad..])?.0; // finally, reconstruct our regex let re2 = Regex::builder().build_from_dfas(fwd, rev); // we can use it like normal let text = b"2018-12-24 2016-10-08"; let matches: Vec = re2.find_iter(text).collect(); assert_eq!(matches, vec![ Match::must(0, 0..10), Match::must(0, 11..21), ]); # Ok::<(), Box>(()) ``` There are a few points worth noting here: * We need to extract the raw DFAs used by the regex and serialize those. You can build the DFAs manually yourself using [`dense::Builder`], but using the DFAs from a `Regex` guarantees that the DFAs are built correctly. (In particular, a `Regex` constructs a reverse DFA for finding the starting location of matches.) * To convert the DFA to raw bytes, we use the `to_bytes_native_endian` method. In practice, you'll want to use either [`dense::DFA::to_bytes_little_endian`] or [`dense::DFA::to_bytes_big_endian`], depending on which platform you're deserializing your DFA from. If you intend to deserialize on either platform, then you'll need to serialize both and deserialize the right one depending on your target's endianness. * Safely deserializing a DFA requires verifying the raw bytes, particularly if they are untrusted, since an invalid DFA could cause logical errors, panics or even undefined behavior. This verification step requires visiting all of the transitions in the DFA, which can be costly. If cheaper verification is desired, then [`dense::DFA::from_bytes_unchecked`] is available that only does verification that can be performed in constant time. However, one can only use this routine if the caller can guarantee that the bytes provided encoded a valid DFA. The same process can be achieved with sparse DFAs as well: ``` use regex_automata::{Match, dfa::{sparse, regex::Regex}}; let re1 = Regex::new(r"[0-9]{4}-[0-9]{2}-[0-9]{2}").unwrap(); // serialize both let fwd_bytes = re1.forward().to_sparse()?.to_bytes_native_endian(); let rev_bytes = re1.reverse().to_sparse()?.to_bytes_native_endian(); // now deserialize both---we need to specify the correct type! let fwd: sparse::DFA<&[u8]> = sparse::DFA::from_bytes(&fwd_bytes)?.0; let rev: sparse::DFA<&[u8]> = sparse::DFA::from_bytes(&rev_bytes)?.0; // finally, reconstruct our regex let re2 = Regex::builder().build_from_dfas(fwd, rev); // we can use it like normal let text = b"2018-12-24 2016-10-08"; let matches: Vec = re2.find_iter(text).collect(); assert_eq!(matches, vec![ Match::must(0, 0..10), Match::must(0, 11..21), ]); # Ok::<(), Box>(()) ``` Note that unlike dense DFAs, sparse DFAs have no alignment requirements. Conversely, dense DFAs must be aligned to the same alignment as a [`StateID`](crate::util::primitives::StateID). # Support for `no_std` and `alloc`-only This crate comes with `alloc` and `std` features that are enabled by default. When the `alloc` or `std` features are enabled, the API of this module will include the facilities necessary for compiling, serializing, deserializing and searching with DFAs. When only the `alloc` feature is enabled, then implementations of the `std::error::Error` trait are dropped, but everything else generally remains the same. When both the `alloc` and `std` features are disabled, the API of this module will shrink such that it only includes the facilities necessary for deserializing and searching with DFAs. The intended workflow for `no_std` environments is thus as follows: * Write a program with the `alloc` or `std` features that compiles and serializes a regular expression. You may need to serialize both little and big endian versions of each DFA. (So that's 4 DFAs in total for each regex.) * In your `no_std` environment, follow the examples above for deserializing your previously serialized DFAs into regexes. You can then search with them as you would any regex. Deserialization can happen anywhere. For example, with bytes embedded into a binary or with a file memory mapped at runtime. The `regex-cli` command (found in the same repository as this crate) can be used to serialize DFAs to files and generate Rust code to read them. # Syntax This module supports the same syntax as the `regex` crate, since they share the same parser. You can find an exhaustive list of supported syntax in the [documentation for the `regex` crate](https://docs.rs/regex/1/regex/#syntax). There are two things that are not supported by the DFAs in this module: * Capturing groups. The DFAs (and [`Regex`](regex::Regex)es built on top of them) can only find the offsets of an entire match, but cannot resolve the offsets of each capturing group. This is because DFAs do not have the expressive power necessary. * Unicode word boundaries. These present particularly difficult challenges for DFA construction and would result in an explosion in the number of states. One can enable [`dense::Config::unicode_word_boundary`] though, which provides heuristic support for Unicode word boundaries that only works on ASCII text. Otherwise, one can use `(?-u:\b)` for an ASCII word boundary, which will work on any input. There are no plans to lift either of these limitations. Note that these restrictions are identical to the restrictions on lazy DFAs. # Differences with general purpose regexes The main goal of the [`regex`](https://docs.rs/regex) crate is to serve as a general purpose regular expression engine. It aims to automatically balance low compile times, fast search times and low memory usage, while also providing a convenient API for users. In contrast, this module provides a lower level regular expression interface based exclusively on DFAs that is a bit less convenient while providing more explicit control over memory usage and search times. Here are some specific negative differences: * **Compilation can take an exponential amount of time and space** in the size of the regex pattern. While most patterns do not exhibit worst case exponential time, such patterns do exist. For example, `[01]*1[01]{N}` will build a DFA with approximately `2^(N+2)` states. For this reason, untrusted patterns should not be compiled with this module. (In the future, the API may expose an option to return an error if the DFA gets too big.) * This module does not support sub-match extraction via capturing groups, which can be achieved with the regex crate's "captures" API. * While the regex crate doesn't necessarily sport fast compilation times, the regexes in this module are almost universally slow to compile, especially when they contain large Unicode character classes. For example, on my system, compiling `\w{50}` takes about 1 second and almost 15MB of memory! (Compiling a sparse regex takes about the same time but only uses about 1.2MB of memory.) Conversely, compiling the same regex without Unicode support, e.g., `(?-u)\w{50}`, takes under 1 millisecond and about 15KB of memory. For this reason, you should only use Unicode character classes if you absolutely need them! (They are enabled by default though.) * This module does not support Unicode word boundaries. ASCII word boundaries may be used though by disabling Unicode or selectively doing so in the syntax, e.g., `(?-u:\b)`. There is also an option to [heuristically enable Unicode word boundaries](crate::dfa::dense::Config::unicode_word_boundary), where the corresponding DFA will give up if any non-ASCII byte is seen. * As a lower level API, this module does not do literal optimizations automatically. Although it does provide hooks in its API to make use of the [`Prefilter`](crate::util::prefilter::Prefilter) trait. Missing literal optimizations means that searches may run much slower than what you're accustomed to, although, it does provide more predictable and consistent performance. * There is no `&str` API like in the regex crate. In this module, all APIs operate on `&[u8]`. By default, match indices are guaranteed to fall on UTF-8 boundaries, unless either of [`syntax::Config::utf8`](crate::util::syntax::Config::utf8) or [`thompson::Config::utf8`](crate::nfa::thompson::Config::utf8) are disabled. With some of the downsides out of the way, here are some positive differences: * Both dense and sparse DFAs can be serialized to raw bytes, and then cheaply deserialized. Deserialization can be done in constant time with the unchecked APIs, since searching can be performed directly on the raw serialized bytes of a DFA. * This module was specifically designed so that the searching phase of a DFA has minimal runtime requirements, and can therefore be used in `no_std` environments. While `no_std` environments cannot compile regexes, they can deserialize pre-compiled regexes. * Since this module builds DFAs ahead of time, it will generally out-perform the `regex` crate on equivalent tasks. The performance difference is likely not large. However, because of a complex set of optimizations in the regex crate (like literal optimizations), an accurate performance comparison may be difficult to do. * Sparse DFAs provide a way to build a DFA ahead of time that sacrifices search performance a small amount, but uses much less storage space. Potentially even less than what the regex crate uses. * This module exposes DFAs directly, such as [`dense::DFA`] and [`sparse::DFA`], which enables one to do less work in some cases. For example, if you only need the end of a match and not the start of a match, then you can use a DFA directly without building a `Regex`, which always requires a second DFA to find the start of a match. * This module provides more control over memory usage. Aside from choosing between dense and sparse DFAs, one can also choose a smaller state identifier representation to use less space. Also, one can enable DFA minimization via [`dense::Config::minimize`], but it can increase compilation times dramatically. 2 dfa-onepass212<22 w,$w Ç|x A DFA that can return spans for matching capturing groups. This module is the home of a [one-pass DFA](DFA). This module also contains a [`Builder`] and a [`Config`] for building and configuring a one-pass DFA. /xx // A normal multi-pattern search will show pattern 1 matches..2/ re.try_search(&mut cache, &input, &mut caps)?;/=: assert_eq!(Some(Match::must(1, 0..3)), caps.get_match());//EB // If we only want to report pattern 0 matches, then we'll get no0 // match here.0FC let input = input.anchored(Anchored::Pattern(PatternID::must(0)));12/1'$ assert_eq!(None, caps.get_match());11.+ # Ok::<(), Box>(())<2/2B11 4$22A23GD Whether to attempt to shrink the size of the DFA's alphabet or not.44IF This option is enabled by default and should never be disabled unless4$! one is debugging a one-pass DFA.55IF When enabled, the DFA will use a map from all possible bytes to their5HE corresponding equivalence class. Each equivalence class represents a6KH set of bytes that does not discriminate between a match and a non-match7A> in the DFA. For example, the pattern `[ab]+` has at least two7JG equivalence classes: a set containing `a` and `b` and a set containing8B? every byte except for `a` and `b`. `a` and `b` are in the same8KH equivalence class because they never discriminate between a match and at9 non-match.99FC The advantage of this map is that the size of the transition table:DA can be reduced drastically from (approximately) `#states * 256 *:HE sizeof(StateID)` to `#states * k * sizeof(StateID)` where `k` is the;IF number of equivalence classes (rounded up to the nearest power of 2).;HE As a result, total space usage can decrease substantially. Moreover,FC disabled, a byte class map is still used while searching. The only?FC difference is that every byte will be forced into its own distinct?HE equivalence class. This is useful for debugging the actual generated@IF transitions because it lets one see the transitions defined on actual@-* bytes instead of the equivalence classes.dAB11 5$AAO;B>; Set a size limit on the total heap used by a one-pass DFA.BB?< This size limit is expressed in bytes and is applied duringCC@ construction of a one-pass DFA. If the DFA's heap usage exceedsCGD this configured limit, then construction is stopped and an error islD returned.DD The default is no limit.DlD/EEDA This example shows a one-pass DFA that fails to build because ofEEB a configured size limit. This particular example also serves as aFFC cautionary tale demonstrating just how big DFAs with large UnicodeF character classes can get.G; assert_eq!(Some(Match::must(0, 0..20)), caps.get_match());MM.Ǭ/?ABCDpoEB Create a new one-pass DFA builder with the default configuration.pB<<s=q0- Build a one-pass DFA from the given pattern.rrJG If there was a problem parsing or compiling the pattern, then an errorr is returned.rr,s.. . .B< s<$sN; assert_eq!(Some(Match::must(0, 0..11)), caps.get_match());.Ǭ/</ɥå. .BQ Q RNk̬IئIF Like `new`, but parses multiple patterns into a single "multi regex."85 This similarly uses the default regex configuration.l/</3/ɨѨ30 let re = DFA::new_many(&["[a-z]+", "[0-9]+"])?;J/ة1. re.captures(&mut cache, "abc123", &mut caps);=: assert_eq!(Some(Match::must(0, 0..3)), caps.get_match());ت1. re.captures(&mut cache, "123abc", &mut caps);=/ث.Ǭ/</ԟDӬ. .BQTT Q/ ܬ/T߬ Sw!8ϭGD Like `new`, but builds a one-pass DFA directly from an NFA. This isHE useful if you already have an NFA, or even if you hand-assembled theD NFA.l/EB This shows how to hand assemble a regular expression via its HIR,A> compile an NFA from it and build a one-pass DFA from the NFA.</̻/ٰ dfa::onepass::DFA, nfa::thompson::NFA,t Match,4ݥ/EB use regex_syntax::hir::{Hir, Class, ClassBytes, ClassBytesRange};;8 let hir = Hir::class(Class::Bytes(ClassBytes::new(vec![Ȳ)& ClassBytesRange::new(b'0', b'9'),)& ClassBytesRange::new(b'A', b'Z'),)& ClassBytesRange::new(b'_', b'_'),ҳ)& ClassBytesRange::new(b'a', b'z'),L ])));;8 let config = NFA::config().nfa_size_limit(Some(1_000));ִFC let nfa = NFA::compiler().configure(config).build_from_hir(&hir)?;%" let re = DFA::new_from_nfa(nfa)?;ӵJ/.+ let expected = Some(Match::must(0, 0..1));ն,) re.captures(&mut cache, "A", &mut caps);+( assert_eq!(expected, caps.get_match());.Ǭ/</dBQQ U'߽074 Create a new one-pass DFA that matches every input.l/Ĺ<̹/ع3/# let dfa = DFA::always_match()?;'$ let mut cache = dfa.create_cache();)& let mut caps = dfa.create_captures();(% let expected = Match::must(0, 0..0);ϻ,) dfa.captures(&mut cache, "", &mut caps);1. assert_eq!(Some(expected), caps.get_match());/, dfa.captures(&mut cache, "foo", &mut caps);10.Ǭ/<ӽ/dBQQ V/;8 Create a new one-pass DFA that never matches any input.l/ӿ<ۿ/*' use regex_automata::dfa::onepass::DFA;" let dfa = DFA::never_match()?;'0)ۍ0,ώ0'//0'/.Ǭ/</\BQQ W̥-* Return a default configuration for a DFA.IF This is a convenience routine to avoid needing to import the `Config`41 type when customizing the construction of a DFA.l/IF This example shows how to change the match semantics of this DFA fromKH its default "leftmost first" to "all." When using "all," non-greedinessJG doesn't apply and neither does preference order matching. Instead, theJG longest match possible is always returned. (Although, by construction,EB it's impossible for a one-pass DFA to have a different answer for+( "preference order" vs "longest match.")</>; use regex_automata::{dfa::onepass::DFA, Match, MatchKind};ܳ/<9 .configure(DFA::config().match_kind(MatchKind::All)) .build(r"(abc)+?")?;&# let mut cache = re.create_cache();(% let mut caps = re.create_captures();1. re.captures(&mut cache, "abcabc", &mut caps);FC // Normally, the non-greedy repetition would give us a 0..3 match.=: assert_eq!(Some(Match::must(0, 0..6)), caps.get_match());.Ǭ/</4BQQ Xܭ?< Return a builder for configuring the construction of a DFA.@= This is a convenience routine to avoid needing to import the%" [`Builder`] type in common cases.l/DA This example shows how to use the builder to disable UTF-8 mode.</=//0 nfa::thompson, util::syntax,t04ݥ//2/ .syntax(syntax::Config::new().utf8(false))63 .thompson(thompson::Config::new().utf8(false))&# .build(r"foo(?-u:[^b])ar.*")?;J/0- let haystack = b"foo\xFFarzz\xE2\x98\xFF\n";.+ let expected = Some(Match::must(0, 0..8));1. re.captures(&mut cache, haystack, &mut caps);+Ċ0.Ǭ/</<BQQÌ)GD Create a new empty set of capturing groups that is guaranteed to be*' valid for the search APIs on this DFA.IF A `Captures` value created for a specific DFA cannot be used with anyt other DFA.A> This is a convenience function for [`Captures::all`]. See theDA [`Captures`] documentation for an explanation of its alternativeIF constructors that permit the DFA to do less work during a search, and thus might make it faster.|. .BQ Q Z$#$! Create a new cache for this DFA.@= The cache returned should only be used for searches for thisA> DFA. If you want to reuse the cache for another DFA, then you?< must call [`Cache::reset`] with that DFA (or, equivalently, [`DFA::reset_cache`]).d. .BQ Q [$,IF Reset the given cache such that it can be used for searching with the! this DFA (and only this DFA).HE A cache reset permits reusing memory already allocated in this cache̓ with a different DFA.l/FC This shows how to re-purpose a cache for use with a different DFA.</=/3/ let re1 = DFA::new(r"\w")?; let re2 = DFA::new(r"\W")?;*' let mut caps1 = re1.create_captures();*' let mut caps2 = re2.create_captures();'$ let mut cache = re1.create_cache();| assert_eq!(# Some(Match::must(0, 0..2)),JG { re1.captures(&mut cache, "Δ", &mut caps1); caps1.get_match() },4 );HE // Using 'cache' with re2 is not allowed. It may result in panics orIF // incorrect results. In order to re-purpose the cache, we must reset96 // it with the one-pass DFA we'd like to use it with.4 //JG // Similarly, after this reset, using the cache with 're1' is also not| // allowed.  re2.reset_cache(&mut cache);|0# Some(Match::must(0, 0..3)),KH { re2.captures(&mut cache, "☃", &mut caps2); caps2.get_match() },40.Ǭ/</\.. . .BQ Q \$A#,) Return the config for this one-pass DFA.T. . .BQ Q ]$.+ Returns a reference to the underlying NFA.<. . .BQ Q$"@= Returns the total number of patterns compiled into this DFA.EB In the case of a DFA that contains no patterns, this returns `0`.\. .BQ Q _$ <9 Returns the total number of states in this one-pass DFA.IF Note that unlike dense or sparse DFAs, a one-pass DFA does not exposeJG a low level DFA API. Therefore, this routine has little use other thanļ being informational.L. .BQ Q$#FC Returns the total number of elements in the alphabet for this DFA.C@ That is, this returns the total number of transitions that eachHE state in this DFA must have. The maximum alphabet size is 256, which,) corresponds to each possible byte value.=: The alphabet size may be less than 256 though, and unlessHE [`Config::byte_classes`] is disabled, it is typically must less thanHE 256. Namely, bytes are grouped into equivalence classes such that noIF two bytes in the same class can distinguish a match from a non-match.EB For example, in the regex `^[a-z]+$`, the ASCII bytes `a-z` couldGD all be in the same equivalence class. This leads to a massive spaced savings.IF Note though that the alphabet length does _not_ necessarily equal theGD total stride space taken up by a single DFA state in the transitionDA table. Namely, for performance reasons, the stride is always theGD smallest power of two that is greater than or equal to the alphabetDA length. For this reason, [`DFA::stride`] or [`DFA::stride2`] areGD often more useful. The alphabet length is typically useful only for informational purposes.C@ Note also that unlike dense or sparse DFAs, a one-pass DFA doesEB not have a special end-of-input (EOI) transition. This is becauseFC a one-pass DFA handles look-around assertions explicitly (like theHE [`PikeVM`](crate::nfa::thompson::pikevm::PikeVM)) and does not build)& them into the transitions of the DFA.d. .BQ Q$JG Returns the total stride for every state in this DFA, expressed as theJG exponent of a power of 2. The stride is the amount of space each stateKH takes up in the transition table, expressed as a number of transitions.Ł,) (Unused transitions map to dead states.)EB The stride of a DFA is always equivalent to the smallest power ofȂFC 2 that is greater than or equal to the DFA's alphabet length. ThisHE definition uses extra space, but possibly permits faster translationKH between state identifiers and their corresponding offsets in this DFA's transition table.ʄ҄JG For example, if the DFA's stride is 16 transitions, then its `stride2`䡅 is `4` since `2^4 = 16`.…ʅIF The minimum `stride2` value is `1` (corresponding to a stride of `2`)GD while the maximum `stride2` value is `9` (corresponding to a strideGD of `512`). The maximum in theory should be `8`, but because of someKH implementation quirks that may be relaxed in the future, it is one moreFC than `8`. (Do note that a maximal stride is incredibly rare, as itˈHE would imply that there is almost no redundant in the regex pattern.)I0J0Ľ0<. .BQ Qš$섐JG Returns the total stride for every state in this DFA. This correspondsGD to the total number of transitions used by each state in this DFA'sČ0ތIF Please see [`DFA::stride2`] for more information. In particular, thisGD returns the stride as the number of transitions, where as `stride2`/, returns it as the exponent of a power of 2.I0J0ُ04. .BQ Q c$#ː41 Returns the memory usage, in bytes, of this DFA.EB The memory usage is computed based on the number of bytes used to֑ represent this DFA.DA This does **not** include the stack size used up by this DFA. ToÒ<9 compute that, use `std::mem::size_of::()`.d. .BQ Q d$ē<ϓD̔gjmpqrr۔IF Executes an anchored leftmost forward search, and returns true if and96 only if this one-pass DFA matches the given haystack.C@ This routine may short circuit if it knows that scanning futureFC input will never lead to a different result. In particular, if theFC underlying DFA enters a match state, then this routine will return͗IF `true` immediately without inspecting any future input. (Consider howEB this might make a difference given the regex `a+` on the haystackIF `aaaaaaaaaaaaaaa`. This routine can stop after it sees the first `a`,FC but routines like `find` need to continue searching because `+` is greedy by default.)GD The given `Input` is forcefully set to use [`Anchored::Yes`] if theDA given configuration was [`Anchored::No`] (which is the default).d # PanicsЛ؛HE This routine panics if the search could not complete. This can occur# in the following circumstances:͜՜C@ * When the provided `Input` configuration is not supported. ForA> example, by providing an unsupported anchor mode. Concretely,A> this occurs when using [`Anchored::Pattern`] without enabling(% [`Config::starts_for_each_pattern`].֞ޞGD When a search panics, callers cannot know whether a match exists orD not.GD Use [`DFA::try_search`] if you want to handle these panics as error values instead.l/Š This shows basic usage:</*ۑ0'/ܡ&ʛ041 assert!(re.is_match(&mut cache, "foo12345bar"));Ȣ0- assert!(!re.is_match(&mut cache, "foobar"));.Ǭ/</ģ+( # Example: consistency with search APIsIF `is_match` is guaranteed to return `true` whenever `captures` returnsʤGD a match. This includes searches that are executed entirely within at codepoint:</30 use regex_automata::{dfa::onepass::DFA, Input}; let re = DFA::new("a*")?;&ʛ0ʦҦDA assert!(!re.is_match(&mut cache, Input::new("☃").span(1..2)));.Ǭ/<Χ/ڧEB Notice that when UTF-8 mode is disabled, then the above reports aIF match because the restriction against zero-width matches that split a codepoint has been lifted:</GD use regex_automata::{dfa::onepass::DFA, nfa::thompson::NFA, Input};܅/,) .thompson(NFA::config().utf8(false))֪ .build("a*")?;&ʛ0C@ assert!(re.is_match(&mut cache, Input::new("☃").span(1..2)));.Ǭ/</D.. . .ӤBfhihi fӤ ͬӤ|Ь gӤ$Af`qɬGIwJG Executes an anchored leftmost forward search, and returns a `Match` if=: and only if this one-pass DFA matches the given haystack.ðKH This routine only includes the overall match span. To get access to theDA individual spans of each capturing group, use [`DFA::captures`].ܱG0D0d0H0#0C0ߴA0A0(0G0D0G0ͷ0l/DA Leftmost first match semantics corresponds to the match with theиGD smallest starting offset, but where the end offset is determined byGD preferring earlier branches in the original regular expression. ForKH example, `Sam|Samwise` will match `Sam` in `Samwise`, but `Samwise|Sam`&# will match `Samwise` in `Samwise`.KH Generally speaking, the "leftmost first" match is how most backtrackingHE regular expressions tend to work. This is in contrast to POSIX-styleFC regular expressions that yield "leftmost longest" matches. Namely,ӼC@ both `Sam|Samwise` and `Samwise|Sam` match `Samwise` when usingFC leftmost longest semantics. (This crate does not currently support  leftmost longest semantics.)</3/׾߾$! let re = DFA::new("foo[0-9]+")?;&ʛ0(% let expected = Match::must(0, 0..8);@= assert_eq!(Some(expected), re.find(&mut cache, "foo12345"));GD // Even though a match is found after reading the first byte (`a`),JG // the leftmost first match semantics demand that we find the earliestHE // match that prefers earlier parts of the pattern over later parts.  let re = DFA::new("abc|a")?;&ʛ0(% let expected = Match::must(0, 0..3);;8 assert_eq!(Some(expected), re.find(&mut cache, "abc"));.Ǭ/</$.. . .ӤBfkllk f0 0| jӤ$A`;=EB Executes an anchored leftmost forward search and writes the spansFC of capturing groups that participated in a match into the providedJG [`Captures`] value. If no match was found, then [`Captures::is_match`]$! is guaranteed to return `false`.G0D0d0H0#0C0A0A0(0G0D0G00l/A> This shows a simple example of a one-pass regex that extractsԹ capturing group spans.</96 use regex_automata::{dfa::onepass::DFA, Match, Span}; let re = DFA::new(IF // Notice that we use ASCII here. The corresponding Unicode regex! // is sadly not one-pass.DA "(?P[[:alpha:]]+)[[:space:]]+(?P[[:alpha:]]+)",< )?;J/<9 re.captures(&mut cache, "Bruce Springsteen", &mut caps);>; assert_eq!(Some(Match::must(0, 0..17)), caps.get_match());:7 assert_eq!(Some(Span::from(0..5)), caps.get_group(1));HE assert_eq!(Some(Span::from(6..17)), caps.get_group_by_name("last"));.Ǭ/</D... . .Ӥ .Bfnono f0 0| mӤ$A`ɾDFE1F1J1$1/, The differences with [`DFA::captures`] are:FC 1. This returns an error instead of panicking if the search fails.KH 2. Accepts an `&Input` instead of a `Into`. This permits reusingFC the same input for multiple searches, which _may_ be important ford latency.IF 3. This does not automatically change the [`Anchored`] mode from `No`HE to `Yes`. Instead, if [`Input::anchored`] is `Anchored::No`, then an error is returned.d # ErrorsHE This routine errors if the search could not complete. This can occur#0C0A0A0(0GD When a search returns an error, callers cannot know whether a match exists or not.&# # Example: specific pattern searchHE This example shows how to build a multi-regex that permits searchingFC for specific patterns. Note that this is somewhat less useful thanEB in other regex engines, since a one-pass DFA by definition has noIF ambiguity about which pattern can match at a position. That is, if itJG were possible for two different patterns to match at the same startingIF position, then the multi-regex would not be one-pass and construction would have failed.IF Nevertheless, this can still be useful if you only care about matchesIF for a specific pattern, and want the DFA to report "no match" even if*' some other pattern would have matched.96 Note that in order to make use of this functionality,GD [`Config::starts_for_each_pattern`] must be enabled. It is disabled:7 by default since it may result in higher memory usage.</̚/=/4ݥ/܍/?/,/J//=/A/2/=/Eª//F/2/'/.Ǭ/</0- # Example: specifying the bounds of a searchGD This example shows how providing the bounds of a search can produce;8 different results than simply sub-slicing the haystack.</=/DA use regex_automata::{dfa::onepass::DFA, Anchored, Input, Match};;8 // one-pass DFAs fully support Unicode word boundaries!KH // A sad joke is that a Unicode aware regex like \w+\s is not one-pass.T // :-((% let re = DFA::new(r"\b[0-9]{3}\b")?;J/ let haystack = "foo123bar";EB // Since we sub-slice the haystack, the search doesn't know aboutFC // the larger context and assumes that `123` is surrounded by wordIF // boundaries. And of course, the match position is reported relativeEB // to the sub-slice as well, which means we get `0..3` instead oft // `3..6`..+ let expected = Some(Match::must(0, 0..3));DA let input = Input::new(&haystack[3..6]).anchored(Anchored::Yes);2/+Ċ0ہKH // But if we provide the bounds of the search within the context of theHE // entire haystack, then the search can take the surrounding contextFC // into account. (And if we did find a match, it would be reported˃C@ // as a valid offset into `haystack` instead of its sub-slice.)ē let expected = None;IF let input = Input::new(haystack).range(3..6).anchored(Anchored::Yes);2/+Ċ0.Ǭ/</T..... . . .,,,,Ŝ,,I{. .Bf Նf$ֆAD`OɾZԈE1F1EB `slots`, and returns the matching pattern ID. The contents of theJG slots for patterns other than the matching pattern are unspecified. IfGD no match was found, then `None` is returned and the contents of all΋ `slots` is unspecified.FC This is like [`DFA::try_search`], but it accepts a raw slots sliceGD instead of a `Captures` value. This is useful in contexts where you0- don't want or need to allocate a `Captures`.ʍKH It is legal to pass _any_ number of slots to this routine. If the regexFC engine would otherwise write a slot offset that doesn't fit in theKH provided slice, then it is simply skipped. In general though, there are63 usually three slice lengths you might want to use:C@ * An empty slice, if you only care about which pattern matched. * A slice withא@= [`pattern_len() * 2`](crate::dfa::onepass::DFA::pattern_len)KH slots, if you only care about the overall match spans for each matchingd/1KH [`slot_len()`](crate::util::captures::GroupInfo::slot_len) slots, whichFC permits recording match offsets for every capturing group in everyd/dȓ1ٓH1#0֔ޔC0A0A0(0ߖG1¥1ʗlҗ/A> This example shows how to find the overall match offsets in aJG multi-pattern search without allocating a `Captures` value. Indeed, we)& can put our slots right on the stack.</ÙHE use regex_automata::{dfa::onepass::DFA, Anchored, Input, PatternID};옚 let re = DFA::new_many(&[ r"[a-zA-Z]+",Ԛ r"[0-9]+",D ])?;&ʛ0:7 let input = Input::new("123").anchored(Anchored::Yes);DA // We only care about the overall match offsets here, so we justGD // allocate two slots for each pattern. Each slot records the start // and end of the match. let mut slots = [None; 4];ÝC@ let pid = re.try_search_slots(&mut cache, &input, &mut slots)?;.+ assert_eq!(Some(PatternID::must(1)), pid);ƞKH // The overall match offsets are always at 'pid * 2' and 'pid * 2 + 1'.IF // See 'GroupInfo' for more details on the mapping between groups and // slot indices.1. let slot_start = pid.unwrap().as_usize() * 2;" let slot_end = slot_start + 1;ڠ<9 assert_eq!(Some(0), slots[slot_start].map(|s| s.get()));:7 assert_eq!(Some(3), slots[slot_end].map(|s| s.get()));ڡ.Ǭ/</..... . . .,,,,Ŝ,,I{. .Bf Тf$ѢA`& ..... . . .,,,,Ŝ,,I{. .Bf f$A,`,׭&,DtuT ..... . . .,,,,Ŝ,,I{. .Bs Ⱥs t$ɺA,׺`,&,T ...... . . .,,,,Ŝ,,I{.Ç . .Bs s u$A,`,&, matched_pid\D؃wxyz{|}~Զ, . .ÇBv v w$Fl . .ÜĜŜƜǜȜ_wÇۆBv v x$֎:Tَ . .ÇBv v y$$Dt . .ÇBv v z$$toʑF . .Ç ī 6u5QJ.Bv v {$; . .ÇBv v |$I . .ÇBv v }$pateps4ן7lڟ . .ÇBv v ~$C"l . .ÇBv v $@\ . .ÇÇBv v $id1id2ȩ@, . .Bv  vܸ##Ç<̬$ FHݯg@... . .ggg cgcثq1ȡ.B  $ ̰ϰ ... .ggg cgcثq1ȡ. .ÇB   .QQL$2$. .B  $T-* Create a new [`onepass::DFA`](DFA) cache.>; A potentially more convenient routine to create a cache isDA [`DFA::create_cache`], as it does not require also importing the `Cache` type.KH If you want to reuse the returned `Cache` with some other one-pass DFA,FC then you must call [`Cache::reset`] with the desired one-pass DFA.. .B !B? Reset this cache such that it can be used for searching with a$! different [`onepass::DFA`](DFA).H0" with a different one-pass DFA.l/JG This shows how to re-purpose a cache for use with a different one-passD DFA.</=/3/0ϲ0*0*0'0|0#0J040H۵0I0904ŷ0Jַ0|0 ĸ0|0#0K040.Ǭ/</,.. . .B $#;8 Returns the heap memory usage, in bytes, of this cache.FC This does **not** include the stack size used up by this cache. To52 compute that, use `std::mem::size_of::()`.d. .B  $:t . . .B  $4d . .B  $|l t ̲t  L H ÇB "T#Dij< B $T . .B  $D . .ÇB $΂(dт . .ÇB ނ$D . .B  $$g@... . .ggg cgcثq1ȡ.B  $ ԯ| Ԏڎ ԕ| ːѐ ԏ| őlˑ 쁓, B ̭D B $ܖ(Tߖ B $* B $:t B $ʠD͠ B $֠<d B $#D)g@... . .ggg cgcثq1ȡ.B  $ lL Tư L , B D B $, B $,L B $&,̀, B $1L B $look_setD¸"g@... . .ggg cgcثq1ȡ.B  $ T, %4 B $$%4 B $$D B $$ B $k, / /B  $caller_explicit_slotsg@/// / /ggg cgcثq1ȡ/B  $ ܉QQL$#$/ /B  $|; װB4$ B ,| B ,. B ,- B $2 B ,0d  B %|>4/ /řǙșəʙ˙G*R{9  /B  $&gD/// / /ggg cgcثq1ȡ/B  $ d{ {/{{0{;D{ C<3)|)  -T  ( g( 2,2 282, L  / /(B  ($  <  / /(B  ($ 6\ / /(ÇÇB  ($116, / /( B  Ө2#Ө2#Ө2Ç< (Ө2$ LNl!#2# / /)B) #2|#2T# 2 #%'$2 ÇU&y$& // / /2ÇÇB) '۪2|'2T' 2$' '1'1'68*6,* / /2B) *۪2|*2T* 2$* *$&462ÇU??(D?/ /ÇB ? $?C?@.\@/ /ÇB @ $@,A\H/HH = re.find_iter(&mut cache, haystack).collect(); assert_eq!(matches, vec![ Match::must(0, 0..10), Match::must(0, 11..21), ]); # Ok::<(), Box>(()) ``` # Example: searching with multiple regexes The lazy DFAs in this module all fully support searching with multiple regexes simultaneously. You can use this support with standard leftmost-first style searching to find non-overlapping matches: ``` # if cfg!(miri) { return Ok(()); } // miri takes too long use regex_automata::{hybrid::regex::Regex, Match}; let re = Regex::new_many(&[r"\w+", r"\S+"])?; let mut cache = re.create_cache(); let haystack = "@foo bar"; let matches: Vec = re.find_iter(&mut cache, haystack).collect(); assert_eq!(matches, vec![ Match::must(1, 0..4), Match::must(0, 5..8), ]); # Ok::<(), Box>(()) ``` # When should I use this? Generally speaking, if you can abide the use of mutable state during search, and you don't need things like capturing groups or Unicode word boundary support in non-ASCII text, then a lazy DFA is likely a robust choice with respect to both search speed and memory usage. Note however that its speed may be worse than a general purpose regex engine if you don't select a good [prefilter](crate::util::prefilter). If you know ahead of time that your pattern would result in a very large DFA if it was fully compiled, it may be better to use an NFA simulation instead of a lazy DFA. Either that, or increase the cache capacity of your lazy DFA to something that is big enough to hold the state machine (likely through experimentation). The issue here is that if the cache is too small, then it could wind up being reset too frequently and this might decrease searching speed significantly. # Differences with fully compiled DFAs A [`hybrid::regex::Regex`](crate::hybrid::regex::Regex) and a [`dfa::regex::Regex`](crate::dfa::regex::Regex) both have the same capabilities (and similarly for their underlying DFAs), but they achieve them through different means. The main difference is that a hybrid or "lazy" regex builds its DFA lazily during search, where as a fully compiled regex will build its DFA at construction time. While building a DFA at search time might sound like it's slow, it tends to work out where most bytes seen during a search will reuse pre-built parts of the DFA and thus can be almost as fast as a fully compiled DFA. The main downside is that searching requires mutable space to store the DFA, and, in the worst case, a search can result in a new state being created for each byte seen, which would make searching quite a bit slower. A fully compiled DFA never has to worry about searches being slower once it's built. (Aside from, say, the transition table being so large that it is subject to harsh CPU cache effects.) However, of course, building a full DFA can be quite time consuming and memory hungry. Particularly when large Unicode character classes are used, which tend to translate into very large DFAs. A lazy DFA strikes a nice balance _in practice_, particularly in the presence of Unicode mode, by only building what is needed. It avoids the worst case exponential time complexity of DFA compilation by guaranteeing that it will only build at most one state per byte searched. While the worst case here can lead to a very high constant, it will never be exponential. # Syntax This module supports the same syntax as the `regex` crate, since they share the same parser. You can find an exhaustive list of supported syntax in the [documentation for the `regex` crate](https://docs.rs/regex/1/regex/#syntax). There are two things that are not supported by the lazy DFAs in this module: * Capturing groups. The DFAs (and [`Regex`](regex::Regex)es built on top of them) can only find the offsets of an entire match, but cannot resolve the offsets of each capturing group. This is because DFAs do not have the expressive power necessary. Note that it is okay to build a lazy DFA from an NFA that contains capture groups. The capture groups will simply be ignored. * Unicode word boundaries. These present particularly difficult challenges for DFA construction and would result in an explosion in the number of states. One can enable [`dfa::Config::unicode_word_boundary`] though, which provides heuristic support for Unicode word boundaries that only works on ASCII text. Otherwise, one can use `(?-u:\b)` for an ASCII word boundary, which will work on any input. There are no plans to lift either of these limitations. Note that these restrictions are identical to the restrictions on fully compiled DFAs. +2242T.4T.4 T.4\.4$.4.4OQ@B24|.4'\.4 Types and routines specific to lazy DFAs. This module is the home of [`hybrid::dfa::DFA`](DFA). This module also contains a [`hybrid::dfa::Builder`](Builder) and a [`hybrid::dfa::Config`](Config) for configuring and building a lazy DFA. .4$8< CTT T\ 4D $\%΁<& $,,,|,$,L(L) NFAStateIDT)žD-L,,,T-ӿL-̼T-T-$,+d+$d|,$x{Vmp]`NQlC<D-0 \<ps`cPS@C4(,   T  | D&,4&HE Parse the given regular expression using a default configuration and'&# return the corresponding lazy DFA.''H/(/(l(/(<(/(=: use regex_automata::{hybrid::dfa::DFA, HalfMatch, Input};))(% let dfa = DFA::new("foo[0-9]+bar")?;)'0***' let expected = HalfMatch::must(0, 11);|*0* Some(expected),*DA dfa.try_search_fwd(&mut cache, &Input::new("foo12345bar"))?,4+0+.Ǭ/<,/,Ԑ,,/ /B , N<,3I-IF Parse the given regular expressions using a default configuration and-,) return the corresponding lazy multi-DFA...H/.//l////, Return a default configuration for a `DFA`.??KH This is a convenience routine to avoid needing to import the [`Config`]?96 type when customizing the construction of a lazy DFA.@l@/@@JG This example shows how to build a lazy DFA that heuristically supportsA Unicode word boundaries.A And another example for a DFA that matches at every position:g; let dfa = DFA::new_many(&["[0-9]+", "[a-z]+", "[A-Z]+"])?;j%" assert_eq!(dfa.pattern_len(), 3);k.Ǭ/()`. This also does not{)& include the size of the `Cache` used.||HE This also does not include any heap memory used by the NFA inside of|KH this hybrid NFA/DFA. This is because the NFA's ownership is shared, and}JG thus not owned by this hybrid NFA/DFA. More practically, several regex~FC engines in this crate embed an NFA, and reporting the NFA's memory~EB usage in all of them would likely result in reporting higher heap! memory than is actually used.d/ /B  $DJG Executes a forward search and returns the end position of the leftmostEB match that is found. If no match exists, then `None` is returned.ń̈́GD In particular, this method continues searching even after it entersEB a match state. The search only terminates once it has reached theFC end of the input or when it has entered a dead or quit state. UponJG termination, the position of the last byte seen while still in a match state is returned.d1H1! in a number of circumstances:KH * The configuration of the lazy DFA may permit it to "quit" the search.EB For example, setting quit bytes or enabling heuristic support forΉJG Unicode word boundaries. The default configuration does not enable any63 option that could result in the lazy DFA quitting.؊GD * The configuration of the lazy DFA may also permit it to "give up"C@ on a search if it makes ineffective use of its transition tableEB cache. The default configuration does not enable this by default,,) although it is typically a good idea to.C052 example, by providing an unsupported anchor mode.G1¥1Ԏl܎/1. This example shows how to run a basic search.</=2%" let dfa = DFA::new("foo[0-9]+")?;'0)& let expected = HalfMatch::must(0, 8);22ő.+ &mut cache, &Input::new("foo12345"))?,40G1גJԌ1H1! let dfa = DFA::new("abc|a")?;'0Ŕ)& let expected = HalfMatch::must(0, 3);22)& &mut cache, &Input::new("abc"))?,4ؕ0.Ǭ/</&1ݖKH This example shows how to build a lazy multi-DFA that permits searchingԵ for specific patterns.ԗ<ܗ//̆ hybrid::dfa::DFA,.+ Anchored, HalfMatch, PatternID, Input,4טݥ/ let dfa = DFA::builder()?/ϙ;8 .build_many(&["[a-z0-9]{6}", "[a-z][a-z0-9]{5}"])?;'0仚 let haystack = "foo123";ܚC@ // Since we are using the default leftmost-first match and bothKH // patterns match at the same starting position, only the first patternGD // will be returned in this case when doing a search for any of theȜ // patterns.ݜ/, let expected = Some(HalfMatch::must(0, 6));EB let got = dfa.try_search_fwd(&mut cache, &Input::new(haystack))?;۝3JG // But if we want to check whether some other pattern matches, then we՞" // can provide its pattern ID./, let expected = Some(HalfMatch::must(1, 6));$! let input = Input::new(haystack)ٟ96 .anchored(Anchored::Pattern(PatternID::must(1)));63 let got = dfa.try_search_fwd(&mut cache, &input)?;Ҡ3.Ǭ/</ġ01Gȱ1͢;1</=2FC // N.B. We disable Unicode here so that we use a simple ASCII wordEB // boundary. Alternatively, we could enable heuristic support for@= // Unicode word boundaries since our haystack is pure ASCII.ť.+ let dfa = DFA::new(r"(?-u)\b[0-9]{3}\b")?;'0ص1ȦЦIF // Since we sub-slice the haystack, the search doesn't know about theB? // larger context and assumes that `123` is surrounded by wordI1GD // to the sub-slice as well, which means we get `3` instead of `6`./, let expected = Some(HalfMatch::must(0, 3));! let got = dfa.try_search_fwd(٩ &mut cache,%" &Input::new(&haystack[3..6]),<ę13ʪҪK1H1FȻ1C1Ă1!3ŭ3ݭ*' &Input::new(haystack).range(3..6),<ę13î.Ǭ/</t//// / / /,,,,Ŝ,,I{/B  8A4`4<$ҺJG Executes a reverse search and returns the start of the position of theлDA leftmost match that is found. If no match exists, then `None` isl/d1ļ̼H1!3ǽK̾3E3J363G3C3E3,3C053G1¥1l/30 This routine is principally useful when used in conjunction with theMJ [`nfa::thompson::Config::reverse`](crate::nfa::thompson::Config::reverse)FC configuration. In general, it's unlikely to be correct to use bothEB `try_search_fwd` and `try_search_rev` with the same DFA since anyDA particular DFA will only support searching in one direction with܎ respect to the pattern.<//03̙ HalfMatch, Input,4ݥ/385 .thompson(thompson::Config::new().reverse(true)) .build("foo[0-9]+")?;'0)2|02A> dfa.try_search_rev(&mut cache, &Input::new("foo12345"))?,40FC // Even though a match is found after reading the last byte (`c`),JԌ1IF // match that prefers earlier parts of the pattern over latter parts.383 .build("abc|c")?;'0)22/ assert_eq!(Some(expected), dfa.try_search_rev()340.Ǭ/</̪ # Example: UTF-8 modeA> This examples demonstrates that UTF-8 mode applies to reverseDA DFAs. When UTF-8 mode is enabled in the underlying NFA, then allHE matches reported must correspond to valid UTF-8 spans. This includes:7 prohibiting zero-width matches that split a codepoint.JG UTF-8 mode is enabled by default. Notice below how the only zero-width30 matches reported are those at UTF-8 boundaries:</̎/̬30$! HalfMatch, Input, MatchKind,4ݥ/383 .build(r"")?;'02/ // Run the reverse DFA to collect all matches.&# let mut input = Input::new("☃"); let mut matches = vec![];T loop {74 match dfa.try_search_rev(&mut cache, &input)? {Ԝ None => break,̻ Some(hm) => {! matches.push(hm);96 if hm.offset() == 0 || input.end() == 0 {Խ break;52 } else if hm.offset() < input.end() {/, input.set_end(hm.offset()); } else {B? // This is only necessary to handle zero-widthFC // matches, which of course occur in this example.C@ // Without this, the search would never advance:7 // backwards beyond the initial match.30 input.set_end(input.end() - 1); }l }L }, }$! // No matches split a codepoint.ĩ let expected = vec![ HalfMatch::must(0, 3), HalfMatch::must(0, 0),4 ];" assert_eq!(expected, matches);.Ǭ/</B? Now let's look at the same example, but with UTF-8 mode on the underlying NFA disabled:</̉/̧30$34ݥ/3DA .thompson(thompson::Config::new().reverse(true).utf8(false))3'023&33T373ԣ33!393353/33B3F3C3:3333l3L3,3$3İ33 HalfMatch::must(0, 2), HalfMatch::must(0, 1),343"3.Ǭ/</t//// / / /,,,,Ŝ,,I{/B Ҙ ;BAg>`r><$ ɕJG Executes an overlapping forward search and returns the end position ofKH matches as they are found. If no match exists, then `None` is returned.GD This routine is principally only useful when searching for multipleIF patterns on inputs where multiple patterns may match the same regionsHE of text. In particular, callers must preserve the automaton's searchJG state from prior calls so that the implementation knows where the last match occurred.C@ When using this routine to implement an iterator of overlappingIF matches, the `start` of the search should remain invariant throughoutIF iteration. The `OverlappingState` given to the search will keep trackDA of the current position of the search. (This is because multipleDA matches may be reported at the same position, so only the search>; implementation itself knows when to advance the position.)GD If for some reason you want the search to forget about its previousKH state and restart the search at a particular position, then setting the>; state to [`OverlappingState::start`] will accomplish that.d1H1!3K̾3E3J363G3C3E3,3C053G1¥1l/ƒDA This example shows how to run a basic overlapping search. NoticeFC that we build the automaton with a `MatchKind::All` configuration.քFC Overlapping searches are unlikely to work as one would expect whenGD using the default `MatchKind::LeftmostFirst` match semantics, sinceJG leftmost-first matching is fundamentally incompatible with overlappingIF searches. Namely, overlapping searches need to report matches as theyKH are seen, where as leftmost-first searches will continue searching evenڇIF after a match has been observed in order to find the conventional endGD position of the match. More concretely, leftmost-first searches useJG dead states to terminate a search after a specific match can no longerÉKH be extended. Overlapping searches instead do the opposite by continuingKH the search to find totally new matches (potentially of other patterns).</=/̹/׋-* hybrid::dfa::{DFA, OverlappingState},$34ݥ/Ō3<ݚ0*' .build_many(&[r"\w+$", r"\S+$"])?;֍'0Ԋ let haystack = "@foo";.+ let mut state = OverlappingState::start();܎/, let expected = Some(HalfMatch::must(1, 4));# dfa.try_search_overlapping_fwd(63 &mut cache, &Input::new(haystack), &mut state,<ę1,) assert_eq!(expected, state.get_match());IF // The first pattern also matches at the same position, so re-runningFC // the search will yield another match. Notice also that the firstّGD // pattern is returned after the second. This is because the secondIF // pattern begins its match before the first, is therefore an earlier(% // match and is thus reported first./, let expected = Some(HalfMatch::must(0, 4));ԓ#464<ę1Ô,4.Ǭ/</Е///// / / /,,,,Ŝ,,I{/ /B  gIAF`F Gt FC Executes a reverse overlapping search and returns the start of theΛJG position of the leftmost match that is found. If no match exists, then `None` is returned.C4Iۍ4םI4D4Dҏ4>4G4ΠKɑ4>4d1H1Ϣ!3K̾3ͣE3J363G3C3E3,3C053G1¥1̥3é˩A3D3ڪH3:3J333</̉/-ĝ4٭0$34ݥ/䰮3Ѯ<ݚ083ϯ%" .build_many(&[r"", r"☃"])?;'023" let input = Input::new("☃");.4쾱3T3HE dfa.try_search_overlapping_rev(&mut cache, &input, &mut state)?;! match state.get_match() {3)& Some(hm) => matches.push(hm),L3,3dzϳ$333 HalfMatch::must(1, 0),۴343"3.Ǭ/</B3ƶ3<//-ĝ4˷0$34ݥ/䢸3ø<ݚ0D4͹%4'023"4.4켻3T޻3Hñ4!43)в4L3,3Žͽ:7 // Now *all* positions match, even within a codepoint,52 // because we lifted the requirement that matchesƾ'$ // correspond to valid UTF-8 spans.334տք4׳4343"3.Ǭ/<////// / / /,,,,Ŝ,,I{/ /B  !OAM`MMt FC Writes the set of patterns that match anywhere in the given searchEB configuration to `patset`. If multiple patterns match at the sameJG position and the underlying DFA supports overlapping matches, then all30 matching patterns are written to the given set.GD Unless all of the patterns in this DFA are anchored, then generally96 speaking, this will visit every byte in the haystack.IF This search routine *does not* clear the pattern set. This gives someGD flexibility to the caller (e.g., running multiple searches with theHE same pattern set), but does make the API bug-prone if you're reusingFC the same pattern set for multiple searches but intended them to be independent.DA If a pattern ID matched but the given `PatternSet` does not haveIF sufficient capacity to store it, then it is not inserted and silentlyd dropped.d1H1!3K̾3E3J363G3C3E3,3C053G1¥1l/GD This example shows how to find all matching patterns in a haystack,IF even when some patterns match at the same position as other patterns.</=//̘3%" Input, MatchKind, PatternSet,4ݥ/ let patterns = &[FC r"\w+", r"\d+", r"\pL+", r"foo", r"bar", r"barfoo", r"foobar",433<ݚ0 .build_many(patterns)?;'0%" let input = Input::new("foobar");85 let mut patset = PatternSet::new(dfa.pattern_len());HE dfa.try_which_overlapping_matches(&mut cache, &input, &mut patset)?;'$ let expected = vec![0, 2, 3, 4, 6];HE let got: Vec = patset.iter().map(|p| p.as_usize()).collect();3.Ǭ/<////// / / /,,,,Ŝ,,I{/ /B $A}R`R RDHE Transitions from the current state to the next state, given the next byte of input.>; The given cache is used to either reuse pre-computed stateFC transitions, or to store this newly computed transition for futureJG reuse. Thus, this routine guarantees that it will never return a state! ID that has an "unknown" tag. # State identifier validityDA The only valid value for `current` is the lazy state ID returnedC@ by the most recent call to `next_state`, `next_state_untagged`,=: `next_state_untagged_unchecked`, `start_state_forward` orKH `state_state_reverse` for the given `cache`. Any state ID returned fromGD prior calls to these routines (with the same `cache`) is consideredKH invalid (even if it gives an appearance of working). State IDs returnedFC from _any_ prior call for different `cache` values are also alwaysd invalid.IF The returned ID is always a valid ID when `current` refers to a validDA ID. Moreover, this routine is defined for all possible values ofd `input`.IF These validity rules are not checked, even in debug mode. Callers are.+ required to uphold these rules themselves.EB Violating these state ID validity rules will not sacrifice memory=: safety, but _may_ produce an incorrect result or a panic.d0FC If the given ID does not refer to a valid state, then this routineHE may panic but it also may not panic and instead return an invalid or incorrect ID.l/FC This shows a simplistic example for walking a lazy DFA for a given.+ haystack by using the `next_state` method.</22$! let dfa = DFA::new(r"[a-z]+r")?;'0$! let haystack = "bar".as_bytes();GD // The start state is determined by inspecting the position and the%" // initial bytes of the haystack.*' let mut sid = dfa.start_state_forward(*' &mut cache, &Input::new(haystack),<ę1*' // Walk all the bytes in the haystack. for &b in haystack {2/ sid = dfa.next_state(&mut cache, sid, b)?;,3KH // Matches are always delayed by 1 byte, so we must explicitly walk the96 // special "EOI" transition at the end of the search./, sid = dfa.next_eoi_state(&mut cache, sid)?; assert!(sid.is_match());.Ǭ/</T// / / B  $AW W`WH441 byte of input and a state ID that is not tagged.JG The only reason to use this routine is performance. In particular, theIF `next_state` method needs to do some additional checks, among them isFC to account for identifiers to states that are not yet computed. InIF such a case, the transition is computed on the fly. However, if it isKH known that the `current` state ID is untagged, then these checks can bedۀ omitted.FC Since this routine does not compute states on the fly, it does notKH modify the cache and thus cannot return an error. Consequently, `cache`FC does not need to be mutable and it is possible for this routine toڂFC return a state ID corresponding to the special "unknown" state. InGD this case, it is the caller's responsibility to use the prior stateIF ID and `input` with `next_state` in order to force the computation ofHE the unknown transition. Otherwise, trying to use the "unknown" stateGD ID will just result in transitioning back to itself, and thus never؅IF terminating. (This is technically a special exemption to the state IDJG validity rules, but is permissible since this routine is guaranteed toIF never mutate the given `cache`, and thus the identifier is guaranteedÇ to remain valid.)݇HE See [`LazyStateID`] for more details on what it means for a state IDܲ to be tagged. Also, see҈IF [`next_state_untagged_unchecked`](DFA::next_state_untagged_unchecked)A> for this same idea, but with bounds checks forcefully elided.4>; The only valid value for `current` is an **untagged** lazy݊>; state ID returned by the most recent call to `next_state`,;8 `next_state_untagged`, `next_state_untagged_unchecked`,IF `start_state_forward` or `state_state_reverse` for the given `cache`.FC Any state ID returned from prior calls to these routines (with theGD same `cache`) is considered invalid (even if it gives an appearanceōGD of working). State IDs returned from _any_ prior call for different+( `cache` values are also always invalid.ɎI4HE ID, although it may be tagged. Moreover, this routine is defined for# all possible values of `input`.GD Not all validity rules are checked, even in debug mode. Callers are.4E4=4d0ȒF4H44l/F4FC haystack by using the `next_state_untagged` method where possible.</•22$4'0֖$4G4ӗ%4*4*4<ۘę1*4 let mut at = 0; while at < haystack.len() {ҙ if sid.is_tagged() {A> sid = dfa.next_state(&mut cache, sid, haystack[at])?; } else {Κ# let mut prev_sid = sid;HE // We attempt to chew through as much as we can while movingÛHE // through untagged state IDs. Thus, the transition functionGD // does less work on average per byte. (Unrolling this loopܜ# // may help even more.)'$ while at < haystack.len() { prev_sid = sid;ԝ.+ sid = dfa.next_state_untagged(2/ &mut cache, sid, haystack[at], );՞ at += 1;$! if sid.is_tagged() {ԛ33lП3IF // We must ensure that we never proceed to the next iterationEB // with an unknown state ID. If we don't account for thisHE // case, then search isn't guaranteed to terminate since allǡA> // transitions on unknown states loop back to itself.! if sid.is_unknown() {%" sid = dfa.next_state(ݢ;8 &mut cache, prev_sid, haystack[at - 1], )?;l3Lǣ3,գ3ߣK494/4䡥4¥ʥ.Ǭ/</// / /B  $AL[ W[`a[HE Transitions from the current state to the next state, eliding boundsKH checks, given the next byte of input and a state ID that is not tagged.J4ުI4F4I4ŬK4d4F4K4ɮF4F4߯G4I4H4ƱG4I4J4I44H4452 [`next_state_untagged`](DFA::next_state_untagged)ƵFC for this same idea, but with memory safety guaranteed by retaining bounds checks.4Զܶ>4>4;4I4F4G4G4Ӻ+4I4ٻH4#4μּG4.4սݽE4=4d # SafetyJG Callers of this method must guarantee that `current` refers to a validٿJG state ID according to the rules described above. If `current` is not aKH valid state ID for this automaton, then calling this routine may result in undefined behavior.IF If `current` is valid, then the ID returned is valid for all possible values of `input`.// / /  $A^ ^`^HE Transitions from the current state to the next state for the special| EOI symbol.>4F4J4!4GD This routine must be called at the end of every search in a correctKH implementation of search. Namely, lazy DFAs in this crate delay matchesFC by one byte in order to support look-around operators. Thus, afterKH reaching the end of a haystack, a search implementation must follow oneĴ last EOI transition.KH It is best to think of EOI as an additional symbol in the alphabet of aJG DFA that is distinct from every other symbol. That is, the alphabet ofKH lazy DFAs in this crate has a logical size of 257 instead of 256, whereKH 256 corresponds to every possible inhabitant of `u8`. (In practice, theIF physical alphabet size may be smaller because of alphabet compressionIF via equivalence classes, but EOI is always represented somehow in thet alphabet.)4D4C4=4K4G4K4F4d4I4< ID.I4.4E4=4d0F4H44l/KH This shows a simplistic example for walking a DFA for a given haystack,@= and then finishing the search with the final EOI transition.</22$4'0$4G4%4*4*4<ę1*4ă424,3GD // Matches are always delayed by 1 byte, so we must explicitly walkJG // the special "EOI" transition at the end of the search. Without thisJG // final transition, the assert below will fail since the DFA will not&# // have entered a match state yet!/44.Ǭ/</t// / / B  $Akb vbDA Return the ID of the start state for this lazy DFA for the givenܹ starting configuration.HE Unlike typical DFA implementations, the start state for DFAs in this2/ crate is dependent on a few different factors:C@ * The [`Anchored`] mode of the search. Unanchored, anchored andJG anchored searches for a specific [`PatternID`] all use different start\ states.FC * Whether a "look-behind" byte exists. For example, the `^` anchor85 matches if and only if there is no look-behind byte.JG * The specific value of that look-behind byte. For example, a `(?m:^)`GD assertion only matches when there is either no look-behind byte, or30 when the look-behind byte is a line terminator.B? The [starting configuration](start::Config) provides the above information.DA This routine can be used for either forward or reverse searches.A> Although, as a convenience, if you have an [`Input`], then it?< may be more succinct to use [`DFA::start_state_forward`] orIF [`DFA::start_state_reverse`]. Note, for example, that the convenienceEB routines return a [`MatchError`] on failure where as this routine returns a [`StartError`].d1HE This may return a [`StartError`] if the search needs to give up whenFC determining the start state (for example, if it sees a "quit" byteDA or if the cache has become inefficient). This can also return anIF error if the given configuration contains an unsupported [`Anchored`] configuration.\/// / / / B  $AAiOiGD Return the ID of the start state for this lazy DFA when executing a forward search.GD This is a convenience routine for calling [`DFA::start_state`] thatKH converts the given [`Input`] to a [start configuration](start::Config).KH Additionally, if an error occurs, it is converted from a [`StartError`]A> to a [`MatchError`] using the offset information in the givent [`Input`].d1HE This may return a [`MatchError`] if the search needs to give up whenIF determining the start state (for example, if it sees a "quit" byte orJG if the cache has become inefficient). This can also return an error ifIF the given `Input` contains an unsupported [`Anchored`] configuration.//// / / /,,,,Ŝ,,I{/ B  $Am`m,ր ڄG5 reverse search.ƅG5K5K5A5t5d1H5I5ljJ5I5//// / / /,,,,Ŝ,,I{/ B  $‹Ar`r, @B? Returns the total number of patterns that match in this state.A> If the lazy DFA was compiled with one pattern, then this must74 necessarily always return `1` for all match states.HE A lazy DFA guarantees that [`DFA::match_pattern`] can be called with’IF indices up to (but not including) the length returned by this routine without panicking.d0ē̓GD If the given state is not a match state, then this may either panic" or return an incorrect result.lǔ/ٔDA This example shows a simple instance of implementing overlappingGD matches. In particular, it shows not only how to determine how manyGD patterns have matched in a particular state, but also how to access–)& which specific patterns have matched.KH Notice that we must use [`MatchKind::All`] when building the DFA. If weȗHE used [`MatchKind::LeftmostFirst`] instead, then the DFA would not beJG constructed in a way that supports overlapping matches. (It would onlyJG report a single pattern that matches at any particular point in time.)GD Another thing to take note of is the patterns used and the order inIF which the pattern IDs are reported. In the example below, pattern `3`՚C@ is yielded first. Why? Because it corresponds to the match thatGD appears first. Namely, the `@` symbol is part of `\S+` but not partJG of any of the other patterns. Since the `\S+` pattern has a match thatJG starts to the left of any other pattern, its ID is returned before anyT other.</=/=: use regex_automata::{hybrid::dfa::DFA, Input, MatchKind};䶞3מ<ݚ0 .build_many(&[1. r"\w+", r"[a-z]+", r"[A-Z]+", r"\S+",d ])?;'0%" let haystack = "@bar".as_bytes();РؠG4%4Ρ*4*4<ę1*4424,3ţ/4䁤42/ assert_eq!(dfa.match_len(&mut cache, sid), 3);٤HE // The following calls are guaranteed to not panic since `match_len`Ԧ // returned `3` above.ťDA assert_eq!(dfa.match_pattern(&mut cache, sid, 0).as_usize(), 3);DA assert_eq!(dfa.match_pattern(&mut cache, sid, 1).as_usize(), 0);צDA assert_eq!(dfa.match_pattern(&mut cache, sid, 2).as_usize(), 1);.Ǭ/<ۧ/L// / /B  $AwC wհHE Returns the pattern ID corresponding to the given match index in the given state.C@ See [`DFA::match_len`] for an example of how to use this methodتGD correctly. Note that if you know your lazy DFA is configured with aFC single pattern, then this routine is never necessary since it willC@ always return a pattern ID of `0` for an index of `0` when `id`! corresponds to a match state.ݬDA Typically, this routine is used when implementing an overlapping52 search, as the example for `DFA::match_len` does.d0EB If the state ID is not a match state or if the match index is outӮEB of bounds for the given state, then this routine may either panicFC or produce an incorrect result. If the state ID is correct and theEB match index is correct, then this routine always produces a valid `PatternID`.lܰ// / /B  $AyCy yT.+ Create a new cache for the given lazy DFA.JG The cache returned should only be used for searches for the given DFA.FC If you want to reuse the cache for another DFA, then you must call# [`Cache::reset`] with that DFA./ /B  "JG Reset this cache such that it can be used for searching with the given! lazy DFA (and only that DFA).H03J3FÖ3$3E͗33l/F0</=/=2 3 ߙ3(3|0$Ԛ3<340I3I00œ34ŷ0K3|0 cache.reset(&dfa2);|0$3=ў340.Ǭ/</,// / /B  $)<9 Initializes a new search starting at the given position.JG If a previous search was unfinished, then it is finished automatically and a new search is begun.A> Note that keeping track of search progress is _not necessary_C@ for correct implementations of search using a lazy DFA. Keeping>; track of search progress is only necessary if you want theC@ [`Config::minimum_bytes_per_state`] configuration knob to work.d/ /B  $c*DA Updates the current search to indicate that it has search to the current position.GD No special care needs to be taken for reverse searches. Namely, theJG position given may be _less than_ the starting position of the search.Ádˁ0܁IF This panics if no search has been started by [`Cache::search_start`].lǂ/ /B Ղ $ڂ*?< Indicates that a search has finished at the given position.d0Ƅ΄I5l/ /B  $ą'HE Returns the total number of bytes that have been searched since thisʇ cache was last cleared.C@ This is useful for determining the efficiency of the cache. ForA> example, the lazy DFA uses this value in conjunction with theIF [`Config::minimum_bytes_per_state`] knob to help determine whether itΉ should quit searching.HE This always returns `0` if search progress isn't being tracked. NoteŠGD that the lazy DFA search routines in this crate always track searchl progress./ /B  $ UȎ"JG Returns the total number of times this cache has been cleared since it%" was either created or last reset.FC This is useful for informational purposes or if you want to changeEB search strategies based on the number of times the cache has beend cleared.\ώ/ /B ێ $܎ސ#;1яُF151d/ /B  $<őTˑ؛ۛ/ /B ߛב $l|ޟD ΢33Ӣע: 3 3B 33A,ϣ*4 AO9Ѹb[ 3B 33$#%/ / B  33$ <ͬ$,U/ /إ B  33$D,׿|/ /Ç B  33$ nfa_start_idd,$đ6/ /4 B4 6##6Ǒ6#6Ǒ6\ 336$<idmap,hjL0 06 B4 6#ĕ6ٕ6\ 336$,6,HJ>l0 0 B  33$7|0 0ÜĜŜƜǜȜ_wB  33$̈\0 0B  33$۟\ޟ0 0B  33$$đ6 ĈT0 0B  33$$đ6$đ6$đ6)T0 0B  33$C+t0 0B  33$E0 0B  33$$1}t0 0B  33$$$1w|0 0إB  33$D,C40 0ޚB  33$90 0B  33$<3396 3B 33A,0 0إ B  33$60 0 0B  33$.\0 0B  33$C#T0 0B  33$€ <0 0B  33$ą <Dž0 0B υ 33$Ѕ+D0 0B  33$C400 0 0B  33$,̏FϏ00 0 0B  33$,a0 0B  33$state_heap_size|<T|ß$B :d¡0 0řǙșəʙ˙G*R{9 B ϡ $ԡ/T0 0 B  $\85 Return a new default lazy DFA builder configuration.B 6$/߷I/F/H/͹3ݒ/B/ԺFC [`MatchKind::All`]. This corresponds to classical DFA construction96 where all possible matches are added to the lazy DFA.ݻEB Typically, `All` is used when one wants to execute an overlappingHE search and `LeftmostFirst` otherwise. In particular, it rarely makesKH sense to use `All` with the various "leftmost" find routines, since the̽IF leftmost routines depend on the `LeftmostFirst` automata constructionC@ strategy. Specifically, `LeftmostFirst` adds dead states to theA> lazy DFA as a way to terminate the search and report a match.HE `LeftmostFirst` also supports non-greedy matches using this strategy where as `All` does not.! # Example: overlapping searchGD This example shows the typical use of `MatchKind::All`, which is to report overlapping matches.</=/̒/-ĝ4$34ݥ/3<ݚ0*Þ4'04.4/4#464<ę1,4I4F͢4G4I4(Ĥ4/4#464<ę1,4.Ǭ/</74 # Example: reverse automaton to find start of matchDA Another example for using `MatchKind::All` is for constructing aGD reverse automaton to find the start of a match. `All` semantics areDA used for this in order to find the longest possible match, which2/ corresponds to the leftmost starting position.41 Note that if you need the starting position thenJG [`hybrid::regex::Regex`](crate::hybrid::regex::Regex) will handle this?< for you, so it's usually not necessary to do this yourself.<//3ܑ0.+ Anchored, HalfMatch, Input, MatchKind,4ݥ/+( let input = Input::new("123foobar456"); let pattern = r"[a-z]+r";%" let dfa_fwd = DFA::new(pattern)?;  let dfa_rev = DFA::builder().+ .thompson(NFA::config().reverse(true))<ݚ0̔ .build(pattern)?;/, let mut cache_fwd = dfa_fwd.create_cache();/, let mut cache_rev = dfa_rev.create_cache();-* let expected_fwd = HalfMatch::must(0, 9);-* let expected_rev = HalfMatch::must(0, 3);KH let got_fwd = dfa_fwd.try_search_fwd(&mut cache_fwd, &input)?.unwrap();IF // Here we don't specify the pattern to search for since there's onlyIF // one pattern and we're doing a leftmost search. But if this were anIF // overlapping search, you'd need to specify the pattern that matchedJG // in the forward direction. (Otherwise, you might wind up finding theHE // starting position of a match of some other pattern.) That in turnKH // requires building the reverse automaton with starts_for_each_pattern| // enabled. let input = input .clone()" .range(..got_fwd.offset())! .anchored(Anchored::Yes);KH let got_rev = dfa_rev.try_search_rev(&mut cache_rev, &input)?.unwrap();&# assert_eq!(expected_fwd, got_fwd);&# assert_eq!(expected_rev, got_rev);.Ǭ/</TB $$<A> Set a prefilter to be used whenever a start state is entered.FC A [`Prefilter`] in this context is meant to accelerate searches byGD looking for literal prefixes that every match for the correspondingFC pattern (or patterns) must start with. Once a prefilter produces aHE match, the underlying search routine continues on to try and confirmt the match.IF Be warned that setting a prefilter does not guarantee that the searchC@ will be faster. While it's usually a good bet, if the prefilterHE produces a lot of false positive candidates (i.e., positions matchedGD by the prefilter but not by the regex), then the overall result canHE be slower than if you had just executed the regex engine without any| prefilters.A> Note that unless [`Config::specialize_start_states`] has beenEB explicitly set, then setting this will also enable (when `pre` isIF `Some`) or disable (when `pre` is `None`) start state specialization.GD This occurs because without start state specialization, a prefilterHE is likely to be less effective. And without a prefilter, start state(% specialization is usually pointless.# By default no prefilter is set.l/<//3# util::prefilter::Prefilter,$! Input, HalfMatch, MatchKind,4ݥ/HE let pre = Prefilter::new(MatchKind::LeftmostFirst, &["foo", "bar"]);ܿ/0- .configure(DFA::config().prefilter(pre))$! .build(r"(foo|bar)[a-z]+")?;&ʛ0.+ let input = Input::new("foo1 barfox bar");|0%" Some(HalfMatch::must(0, 11)),/, re.try_search_fwd(&mut cache, &input)?,40.Ǭ/</FC Be warned though that an incorrect prefilter can lead to incorrectd results!<//3#6$64ݥ/HE let pre = Prefilter::new(MatchKind::LeftmostFirst, &["foo", "car"]);/06$6&ʛ0.6|0>; // No match reported even though there clearly is one!l None,/640.Ǭ/</L B $Ѷސ=Eћ/l lazy DFA.GƜ/HE pattern in the lazy DFA. When this start state is used, then the DFAIF will only search for matches for the pattern specified, even if there" are other patterns in the DFA.H/FC the size of the DFA and/or increase the time it takes to build theGD DFA at search time. However, since this is configuration for a lazyIF DFA, these states aren't actually built unless they're used. EnablingJG this isn't necessarily free, however, as it may result in higher cacheT usage.HE There are a few reasons one might want to enable this (it's disabled by default):JG 1. When looking for the start of an overlapping match (using a reverseKH DFA), doing it correctly requires starting the reverse search using theHE starting state of the pattern that matched in the forward direction.FC Indeed, when building a [`Regex`](crate::hybrid::regex::Regex), itGD will automatically enable this option when building the reverse DFA| internally.GD 2. When you want to use a DFA with multiple patterns to both searchGD for matches of any pattern or to search for anchored matches of one΁KH particular pattern while using the same DFA. (Otherwise, you would need+( to compile a new DFA for each pattern.)΂ւ /l/IF This example shows how to use this option to permit the same lazy DFAJG to run both general searches for any pattern and anchored searches for a specific pattern.ք<ބ//̈3.+ Anchored, HalfMatch, Input, PatternID,4مݥ/3?/ц=: .build_many(&[r"[a-z0-9]{6}", r"[a-z][a-z0-9]{5}"])?;'0  let haystack = "bar foo123";DA // Here's a normal unanchored search that looks for any pattern.*' let expected = HalfMatch::must(0, 10);%" let input = Input::new(haystack);HE assert_eq!(Some(expected), dfa.try_search_fwd(&mut cache, &input)?);ۉJG // We can also do a normal anchored search for any pattern. Since it'sGD // an anchored search, we position the start of the search where we! // know the match will begin.*6ˋ0- let input = Input::new(haystack).range(4..);H6͌GD // Since we compiled anchored start states for each pattern, we canDA // also look for matches of other patterns explicitly, even if a52 // different pattern would have normally matched.*' let expected = HalfMatch::must(1, 10);ˎ$3 .range(4..)93ʏH6.Ǭ/<Ґ/B $2GD Whether to attempt to shrink the size of the lazy DFA's alphabet orD0ɒI/" one is debugging the lazy DFA.ƓEB When enabled, the lazy DFA will use a map from all possible bytesDA to their corresponding equivalence class. Each equivalence classٔHE represents a set of bytes that does not discriminate between a matchGD and a non-match in the DFA. For example, the pattern `[ab]+` has atIF least two equivalence classes: a set containing `a` and `b` and a setHE containing every byte except for `a` and `b`. `a` and `b` are in theFC same equivalence classes because they never discriminate between aؗ match and a non-match.F/ʘIF can be reduced drastically from `#states * 256 * sizeof(LazyStateID)`EB to `#states * k * sizeof(LazyStateID)` where `k` is the number ofDA equivalence classes (rounded up to the nearest power of 2). As aKH result, total space usage can decrease substantially. Moreover, since aJG smaller alphabet is used, DFA compilation during search becomes fasterʛJG as well since it will potentially be able to reuse a single transition for multiple bytes.GD **WARNING:** This is only useful for debugging lazy DFAs. DisablingGD this does not yield any speed advantages. Namely, even when this is՝F/F/Hܺ/I/-/dB $Р֠;1. Heuristically enable Unicode word boundaries.JG When set, this will attempt to implement Unicode word boundaries as ifJG they were ASCII word boundaries. This only works when the search inputJG is ASCII only. If a non-ASCII byte is observed while searching, then aף+( [`MatchError::quit`] error is returned.FC A possible alternative to enabling this option is to simply use anڤJG ASCII word boundary, e.g., via `(?-u:\b)`. The main reason to use thisJG option is if you absolutely need Unicode support. This option lets oneFC use a fast search implementation (a DFA) for some potentially veryæGD common cases, while providing the option to fall back to some otherFC regex engine to handle the general case when an error is returned.ڧIF If the pattern provided has no Unicode word boundary in it, then thisEB option has no effect. (That is, quitting on a non-ASCII byte onlyGD occurs when this option is enabled _and_ a Unicode word boundary isƩ present in the pattern.)GD This is almost equivalent to setting all non-ASCII bytes to be quitIF bytes. The only difference is that this will cause non-ASCII bytes toGD be quit bytes _only_ when a Unicode word boundary is present in thedի/<9 When enabling this option, callers _must_ be prepared to=: handle a [`MatchError`] error during search. When using aIF [`Regex`](crate::hybrid::regex::Regex), this corresponds to using theIF `try_` suite of methods. Alternatively, if callers can guarantee thatKH their input is ASCII only, then a [`MatchError::quit`] error will neverݮ  be returned while searching.  This is disabled by default.l/ɯѯJG This example shows how to heuristically enable Unicode word boundariesIF in a pattern. It also shows what happens when a search comes across a non-ASCII byte.</̚/̸3ֱ%" HalfMatch, Input, MatchError,4ݥ/䓲3=3 .build(r"\b[0-9]+\b")?;'0ƳγC@ // The match occurs before the search ever observes the snowman%" // character, so no error occurs." let haystack = "foo 123 ☃";/, let expected = Some(HalfMatch::must(0, 7));E33GD // Notice that this search fails, even though the snowman characterܶC@ // occurs after the ending match offset. This is because searchGD // routines read one byte past the end of the search to account forJG // look-around, and indeed, this is required here to determine whether // the trailing \b matches.! let haystack = "foo 123 ☃";-* let expected = MatchError::quit(0xE2, 8);DA let got = dfa.try_search_fwd(&mut cache, &Input::new(haystack));# assert_eq!(Err(expected), got);KH // Another example is executing a search where the span of the haystackKH // we specify is all ASCII, but there is non-ASCII just before it. ThisԻ'$ // correctly also reports an error./, let input = Input::new("β123").range(2..);-* let expected = MatchError::quit(0xB2, 1);52 let got = dfa.try_search_fwd(&mut cache, &input);#7Ƚн41 // And similarly for the trailing word boundary./, let input = Input::new("123β").range(..3);-* let expected = MatchError::quit(0xCE, 3);5ȫ7#7ѿٿ.Ǭ/</B $4&# Add a "quit" byte to the lazy DFA.JG When a quit byte is seen during search time, then search will return aHE [`MatchError::quit`] error indicating the offset at which the searchd stopped.FC A quit byte will always overrule any other aspects of a regex. ForJG example, if the `x` byte is added as a quit byte and the regex `\w` isFC used, then observing `x` will cause the search to quit immediately30 despite the fact that `x` is in the `\w` class.IF This mechanism is primarily useful for heuristically enabling certainHE features like Unicode word boundaries in a DFA. Namely, if the inputGD to search is ASCII, then a Unicode word boundary can be implementedGD via an ASCII word boundary with no change in semantics. Thus, a DFAJG can attempt to match a Unicode word boundary but give up as soon as itIF observes a non-ASCII byte. Indeed, if callers set all non-ASCII bytesIF to be quit bytes, then Unicode word boundaries will be permitted when85 building lazy DFAs. Of course, callers should enableIF [`Config::unicode_word_boundary`] if they want this behavior instead.JG (The advantage being that non-ASCII quit bytes will only be added if a-* Unicode word boundary is in the pattern.)<ǚ7=7I֛7 `try_` suite of methods.,) By default, there are no quit bytes set.d0HE This panics if heuristic Unicode word boundaries are enabled and anyJG non-ASCII byte is removed from the set of quit bytes. Namely, enablingKH Unicode word boundaries requires setting every non-ASCII byte to a quitGD byte. So if the caller attempts to undo any of that, then this willT panic.l/FC This example shows how to cause a search to terminate if it sees aJG `\n` byte. This could be useful if, for example, you wanted to preventA> a user supplied pattern from matching across a line boundary.</=/>; use regex_automata::{hybrid::dfa::DFA, MatchError, Input};330 .configure(DFA::config().quit(b'\n', true))# .build(r"foo\p{any}+bar")?;'0 let haystack = "foo\nbar";HE // Normally this would produce a match, since \p{any} contains '\n'.GD // But since we instructed the automaton to enter a quit state if a=: // '\n' is observed, this produces a match error instead..+ let expected = MatchError::quit(b'\n', 3);!33 &Input::new(haystack), ).unwrap_err();3.Ǭ/</$B $$=52 Enable specializing start states in the lazy DFA.IF When start states are specialized, an implementor of a search routineKH using a lazy DFA can tell when the search has entered a starting state.GD When start states aren't specialized, then it is impossible to know1. whether the search has entered a start state.C@ Ideally, this option wouldn't need to exist and we could alwaysJG specialize start states. The problem is that start states can be quiteIF active. This in turn means that an efficient search routine is likelyGD to ping-pong between a heavily optimized hot loop that handles mostHE states and to a less optimized specialized handling of start states.DA This causes branches to get heavily mispredicted and overall canHE materially decrease throughput. Therefore, specializing start states-* should only be enabled when it is needed.KH Knowing whether a search is in a start state is typically useful when aIF prefilter is active for the search. A prefilter is typically only runJG when in a start state and a prefilter can greatly accelerate a search.IF Therefore, the possible cost of specializing start states is worth itIF in this case. Otherwise, if you have no prefilter, there is likely no&# reason to specialize start states.B? This is disabled by default, but note that it is automaticallyIF enabled (or disabled) if [`Config::prefilter`] is set. Namely, unlessIF `specialize_start_states` has already been set, [`Config::prefilter`]HE will automatically enable or disable it based on whether a prefilterGD is present or not, respectively. This is done because a prefilter'sFC effectiveness is rooted in being executed whenever the DFA is in aJG start state, and that's only possible to do when they are specialized.A> Note that it is plausibly reasonable to _disable_ this optionFC explicitly while _enabling_ a prefilter. In that case, a prefilterIF will still be run at the beginning of a search, but never again. ThisJG in theory could strike a good balance if you're in a situation where aB? prefilter is likely to produce many false positive candidates.l/HE This example shows how to enable start state specialization and then?< shows how to check whether a state is a start state or not.</>73?< .configure(DFA::config().specialize_start_states(true))ܝ .build(r"[a-z]+")?;'00- let haystack = "123 foobar 4567".as_bytes();JG let sid = dfa.start_state_forward(&mut cache, &Input::new(haystack))?;HE // The ID returned by 'start_state_forward' will always be tagged as@= // a start state when start state specialization is enabled. assert!(sid.is_tagged()); assert!(sid.is_start());.Ǭ/</C@ Compare the above with the default lazy DFA configuration whereEB start states are _not_ specialized. In this case, the start state52 is not tagged and `sid.is_start()` returns false.</>7# let dfa = DFA::new(r"[a-z]+")?;'007J7@= // Start states are not tagged in the default configuration! assert!(!sid.is_tagged()); assert!(!sid.is_start());.Ǭ/</B $ 7HE Sets the maximum amount of heap memory, in bytes, to allocate to thè KH cache for use during a lazy DFA search. If the lazy DFA would otherwise GD use more heap memory, then, depending on other configuration knobs, EB either stop the search and return an error or clear the cache andIJ  continue the search.ς ׂ DA The default cache capacity is some "reasonable" number that will GD accommodate most regular expressions. You may find that if you need GD to build a large DFA then it may be necessary to increase the cachel  capacity.ʄ ҄ KH Note that while building a lazy DFA will do a "minimum" check to ensure GD the capacity is big enough, this is more or less about correctness. KH If the cache is bigger than the minimum but still "too small," then the HE lazy DFA could wind up spending a lot of time clearing the cache and HE recomputing transitions, thus negating the performance benefits of a؇ HE lazy DFA. Thus, setting the cache capacity is mostly an experimental FC endeavor. For most common patterns, however, the default should be|  sufficient.  A> For more details on how the lazy DFA's cache is used, see the҉  documentation for [`Cache`]. l /  GD This example shows what happens if the configured cache capacity is IF too small. In such cases, one can override the cache capacity to make JG it bigger. Alternatively, one might want to use less memory by setting삌  a smaller cache capacity. < / =/ =2 č ! let pattern = r"\p{L}{1000}";  JG // The default cache capacity is likely too small to deal with regexes HE // that are very large. Large repetitions of large Unicode character ;8 // classes are a common way to make very large regexes.Ώ +( let _ = DFA::new(pattern).unwrap_err(); 0- // Bump up the capacity to something bigger.䳐 3Ԑ IF .configure(DFA::config().cache_capacity(100 * (1<<20))) // 100 MB̢ 6 '0  IF let haystack = "ͰͲͶͿΆΈΉΊΌΎΏΑΒΓΔΕΖΗΘΙ".repeat(50);’ 2/ let expected = Some(HalfMatch::must(0, 2000)); FC let got = dfa.try_search_fwd(&mut cache, &Input::new(&haystack))?;ē 3  .Ǭ/< /t B $Ȕ ,Δ Ǩ ? KH Configures construction of a lazy DFA to use the minimum cache capacity KH if the configured capacity is otherwise too small for the provided NFA.˖ Ӗ JG This is useful if you never want lazy DFA construction to fail because $! of a capacity that is too small.˗ ӗ HE In general, this option is typically not a good idea. In particular, GD while a minimum cache capacity does permit the lazy DFA to function HE where it otherwise couldn't, it's plausible that it may not function HE well if it's constantly running out of room. In that case, the speed EB advantages of the lazy DFA may be negated. On the other hand, theК HE "minimum" cache capacity computed may not be completely accurate and IF could actually be bigger than what is really necessary. Therefore, it IF is plausible that using the minimum cache capacity could still result친  in very good performance.ۜ  7 l /  G7 IF too small. In such cases, one could override the capacity explicitly.Ğ IF An alternative, demonstrated here, let's us force construction to use FC the minimum cache capacity if the configured capacity is otherwisetݟ  too small. < / =/Ơ =2  !7  J7 H7ڢ ;7 +7ʣ GD // Configure construction such it automatically selects the minimum 96 // cache capacity if it would otherwise be too small.Ԥ 3 A> .configure(DFA::config().skip_cache_capacity_check(true))̻ 6٥ '0  I7ۦ 27 F7ݧ 3  .Ǭ/< /Ψ B $   Hթ GD Configure a lazy DFA search to quit after a certain number of cachet  clearings.  GD When a minimum is set, then a lazy DFA search will *possibly* "give IF up" after the minimum number of cache clearings has occurred. This is֫ JG typically useful in scenarios where callers want to detect whether the KH lazy DFA search is "efficient" or not. If the cache is cleared too many KH times, this is a good indicator that it is not efficient, and thus, theŭ 30 caller may wish to use some other regex engine.  EB Note that the number of times a cache is cleared is a property ofϮ EB the cache itself. Thus, if a cache is used in a subsequent search A> with a similarly configured lazy DFA, then it could cause the߯ DA search to "give up" if the cache needed to be cleared, depending A> on its internal count and configured minimum. The cache clear ?< count can only be reset to `0` via [`DFA::reset_cache`] (or GD [`Regex::reset_cache`](crate::hybrid::regex::Regex::reset_cache) if " you're using the `Regex` API).  FC By default, no minimum is configured. Thus, a lazy DFA search will HE never give up due to cache clearings. If you do set this option, youų FC might consider also setting [`Config::minimum_bytes_per_state`] in HE order for the lazy DFA to take efficiency into account before giving<ݴ  up. l /  JG This example uses a somewhat pathological configuration to demonstrateڵ EB the _possible_ behavior of cache clearing and how it might result &# in a search that returns an error.϶ ׶ FC It is important to note that the precise mechanics of how and when 52 a cache gets cleared is an implementation detail.ܷ < / =/ NK use regex_automata::{hybrid::dfa::DFA, Input, MatchError, MatchErrorKind};  @= // This is a carefully chosen regex. The idea is to pick oneҹ DA // that requires some decent number of states (hence the bounded HE // repetition). But we specifically choose to create a class with an KH // ASCII letter and a non-ASCII letter so that we can check that no new KH // states are created once the cache is full. Namely, if we fill up the JG // cache on a haystack of 'a's, then in order to match one 'β', a new׼ JG // state will need to be created since a 'β' is encoded with multiple JG // bytes. Since there's no room for this state, the search should quit " // at the very first position.  let pattern = r"[aβ]{100}"; 3  .configure( FC // Configure it so that we have the minimum cache capacityſ KH // possible. And that if any clearings occur, the search quits.̕  DFA::config() 0- .skip_cache_capacity_check(true) " .cache_capacity(0) 41 .minimum_cache_clear_count(Some(0)),L  ) 6 '0  74 // Our search will give up before reaching the end! 0- let haystack = "a".repeat(101).into_bytes(); HE let result = dfa.try_search_fwd(&mut cache, &Input::new(&haystack));  assert!(matches!( $! *result.unwrap_err().kind(), &# MatchErrorKind::GaveUp { .. },<  ));  JG // Now that we know the cache is full, if we search a haystack that we GD // know will require creating at least one new state, it should not %" // be able to make much progress. 1. let haystack = "β".repeat(101).into_bytes(); H8 ħ8 $8 &8< è8  JG // If we reset the cache, then we should be able to create more states 74 // and make more progress with searching for betas.  cache.reset(&dfa); 18 H8 ħ8 $8 &8< è8  KH // ... switching back to ASCII still makes progress since it just needs -* // to set transitions on existing states! 08 H8 ħ8 $8 &8< è8  .Ǭ/< /̩ B $   F FC Configure a lazy DFA search to quit only when its efficiency drops  below the given minimum.  IF The efficiency of the cache is determined by the number of DFA states JG compiled per byte of haystack searched. For example, if the efficiency FC is 2, then it means the lazy DFA is creating a new DFA state after HE searching approximately 2 bytes in a haystack. Generally speaking, 2 IF is quite bad and it's likely that even a slower regex engine like the EB [`PikeVM`](crate::nfa::thompson::pikevm::PikeVM) would be faster.  KH This has no effect if [`Config::minimum_cache_clear_count`] is not set. JG Namely, this option only kicks in when the cache has been cleared more KH than the minimum number. If no minimum is set, then the cache is simply IF cleared whenever it fills up and it is impossible for the lazy DFA to -* quit due to ineffective use of the cache.  HE In general, if one is setting [`Config::minimum_cache_clear_count`], FC then one should probably also set this knob as well. The reason is GD that the absolute number of times the cache is cleared is generally HE not a great predictor of efficiency. For example, if a new DFA state GD is created for every 1,000 bytes searched, then it wouldn't be hard GD for the cache to get cleared more than `N` times and then cause the KH lazy DFA to quit. But a new DFA state every 1,000 bytes is likely quite FC good from a performance perspective, and it's likely that the lazy IF DFA should continue searching, even if it requires clearing the cache  occasionally.  FC Finally, note that if you're implementing your own lazy DFA search GD routine and also want this efficiency check to work correctly, then HE you'll need to use the following routines to record search progress:  DA * Call [`Cache::search_start`] at the beginning of every search. C@ * Call [`Cache::search_update`] whenever [`DFA::next_state`] is\  called. FC * Call [`Cache::search_finish`] before completing a search. (It is EB not strictly necessary to call this when an error is returned, as GD `Cache::search_start` will automatically finish the previous search IF for you. But calling it where possible before returning helps improve @= the accuracy of how many bytes have actually been searched.) B $   ) :/t 0 0B  $  1 C@ Returns the prefilter set in this configuration, if one at all.l 0 0řǙșəʙ˙G*R{9  0B  $  1 K/ !/ 0 0B  $  & G/ J/ / 0 0B  $  / IF Returns whether this configuration has enabled heuristic Unicode word IF boundary support. When enabled, it is possible for a search to returnl  an error. 0 0B  $  ( JG Returns whether this configuration will instruct the lazy DFA to enter IF a quit state whenever the given byte is seen during a search. When at JG least one byte has this enabled, it is possible for a search to returnl 8D 0 0B  $ $  U 1 DA Returns whether this configuration will instruct the lazy DFA to HE "specialize" start states. When enabled, the lazy DFA will tag start EB states so that search routines using the lazy DFA can detect when FC it's in a start state and do some kind of optimization (like run a|  prefilter).ܚ 0 0B  $  ) 96 Returns the cache capacity set on this configuration. 0 0B  $  3 ?< Returns whether the cache capacity check should be skipped. 0 0B  $  < JG Returns, if set, the minimum number of times the cache must be cleared HE before a lazy DFA search can give up. When no minimum is set, then a FC search will never quit and will always clear the cache whenever itl  fills up. 0 0B  $  : JG Returns, if set, the minimum number of bytes per state that need to be KH processed in order for the lazy DFA to keep going. If the minimum falls IF below this number (and the cache has been cleared a minimum number of <9 times), then the lazy DFA will return a "gave up" error.ܞ 0 0B  $  q KH Returns the minimum lazy DFA cache capacity required for the given NFA.  GD The cache capacity required for a particular NFA may change without 74 notice. Callers should not rely on it being stable.  IF This is useful for informational purposes, but can also be useful for GD other reasons. For example, if one wants to check the minimum cache HE capacity themselves or if one wants to set the capacity based on thed  minimum.  JG This may return an error if this configuration does not support all ofˁ IF the instructions used in the given NFA. For example, if the NFA has a JG Unicode word boundary but this configuration does not enable heuristic (% support for Unicode word boundaries.Ԝ 00 0 0ÜĜŜƜǜȜ_wB  $ 'σ ڇ r݇ 000 0 0 0B  $ ' :$  f 00 0 0ÜĜŜƜǜȜ_wB ȓ  $ɓ 'ד  (L 0 0B  $    Ud   A> Create a new lazy DFA builder with the default configuration. B  = ,) Build a lazy DFA from the given pattern.  J/ / Ծ , 00 0 0B  $ N<  i -* Build a lazy DFA from the given patterns.  I/ #/  T 00 0 0B / /T $ "$ b #/  JG Note that this requires owning a `thompson::NFA`. While this may force HE you to clone the NFA, such a clone is not a deep clone. Namely, NFAs KH are defined internally to support shared ownership such that cloning is|  very cheap. l /  IF This example shows how to build a lazy DFA if you already have an NFAd  in hand. < /̀ /̞ 3 0 34 ݥ/  ص1  E/ '$ let nfa = thompson::Compiler::new() 85 .configure(thompson::Config::new().shrink(true))  .build(r"[0-9]+")?; 2/ let dfa = DFA::builder().build_from_nfa(nfa)?; '0 /3 E3 3  .Ǭ/< /t 0 0B  $ '  ; C@ Apply the given lazy DFA configuration options to this builder.L 0 08B  $ 4  d 7/ 4/  J/t /  JG These settings only apply when constructing a lazy DFA directly from ad /  4 0 0ݒ8B  $ 4  D =/ </  KH This permits setting things like whether the DFA should match the regex JG in reverse or if additional time should be spent shrinking the size ofd  the NFA.  E/d /  D 0 08B  $ 4  ފ " HE Create a new overlapping state that begins at the start state of anytˊ  automaton., B , JG Return the match result of the most recent search to execute with thisT  state.  DA A searches will clear this result automatically, such that if no 63 match is found, this will correctly report `None`.L 0 0B  $   "000 0,,,,Ŝ,,I{0 0 B Ӓ  Ē 000#  0,,,,Ŝ,,I{0 0 B000# 9   `  4  _ 0 0ÜĜŜƜǜȜ_wB ĝ  ש<  | 00 0 0B  ' ש<ˬ   < ˭ Tѭ L.4,.4'* žD=-, @.0/ |  ? װB   l B < ,  ` B  C%B %|>40 0řǙșəʙ˙G*R{9  02B  $&gD000 0 0ggg cgcثq1ȡ0B  $ |&&2,&B &'*$'B $''@(إB $()%|(()>4)0 0řǙșəʙ˙G*R{9  02B ) $)*&g+D+000 0 0ggg cgcثq1ȡ0B + $+ +|>>3>B ?,t?B @%|??@&g@D@000 0 0ggg cgcثq1ȡ0B @ $@ @4.4.4?@32܇@64ܤ@@:?E<@̯AdAALABLBBTBCTCCCEEE9B CEI0lIB CM/M0 0B M۪ $MO6O0 0B Oӵ $OP4TP1 1B P $PR1 hybrid::regex::Regex, nfa::thompson, util::syntax, Match,42ݥ/22 let re = Regex::builder()2203603&03&ʛ04441 let haystack = b"\xFEfoo\xFFarzz\xE2\x98\xFF\n";4.+ let expected = Some(Match::must(0, 1..9));5,) let got = re.find(&mut cache, haystack);5355.Ǭ/<6/<6݃B 9#6(% Create a new cache for this `Regex`.77@07EB `Regex`. If you want to reuse the cache for another `Regex`, then8GD you must call [`Cache::reset`] with that `Regex` (or, equivalently,8 [`Regex::reset_cache`]).d91 1B 9 $9E,9I0:)& this `Regex` (and only this `Regex`).::H0; with a different `Regex`.;;J3<>/>=/>6û9??! let re1 = Regex::new(r"\w")?;?! let re2 = Regex::new(r"\W")?;??'0|@0@#0@# re1.find(&mut cache, "Δ"),4A0AAH۵0AI0B2/ // it with the Regex we'd like to use it with.4Bŷ0BJַ0|C0C ĸ0|D0D#0D$! re2.find(&mut cache, "☃"),4D0DD.Ǭ/ = re.find_iter(&mut cache, text).collect();w assert_eq!(matches, vec![w Match::must(0, 0..4),x Match::must(0, 5..10),x Match::must(0, 11..17), 1. It is not generic over `Into` and instead accepts a~IF `&Input`. This permits reusing the same `Input` for multiple searchesFC without needing to create a new one. This _may_ help with latency.DA 2. It returns an error if the search could not complete where as [`Regex::find`] will panic.Հd݀1H1Á!3K̾3E3J3ڃ63G3C3E3,3C053G1¥1T1111 1 1 1,,,,Ŝ,,I{1ׅ B  $A`ѡ0\ԡ111 1 1,,,,Ŝ,,I{1B  $`,TJG Non-search APIs for querying information about the regex and setting at prefilter.윦ѤDA Return the underlying lazy DFA responsible for forward matching.EB This is useful for accessing the underlying lazy DFA and using it+( directly if the situation calls for it.<1 1 1B  $쨨ݦDA Return the underlying lazy DFA responsible for reverse matching.E:+:<1 1 1B  $"?< Returns the total number of patterns matched by this regex.l/ǩ<ϩ/۩=/-9Ϫת?< let re = Regex::new_many(&[r"[a-z]+", r"[0-9]+", r"\w+"])?;$! assert_eq!(3, re.pattern_len());ī.Ǭ/</\1 1B  $²5G3QQDz˲ϲL$#$1 1B  G3$< T-* Create a new cache for the given `Regex`.EB The cache returned should only be used for searches for the givenIF `Regex`. If you want to reuse the cache for another `Regex`, then you1. must call [`Cache::reset`] with that `Regex`.ľ1 1B ̾ Ⱦ#J5$! `Regex` (and only that `Regex`).H09J3K99l/J9</=/6û9!9!9'0|0#0#940H۵0I0294ŷ0Jַ0|0 cache.reset(&re2);|0#0$940.Ǭ/</,11 1 1B  $(,) Return a reference to the forward cache.<1 1 1B  $(,) Return a reference to the reverse cache.<1 1 1B  $041 Return a mutable reference to the forward cache.JG If you need mutable references to both the forward and reverse caches,%" then use [`Cache::as_parts_mut`].\1 1 1B  $041 Return a mutable reference to the reverse cache.J:%:\1 1 1B  $4FC Return references to the forward and reverse caches, respectively.D1 1 1͝:B  $D@= Return mutable references to the forward and reverse caches, respectively.d1 1 1:B $#HE Returns the heap memory usage, in bytes, as a sum of the forward and reverse lazy DFA caches.F151d1 1B  $d݃>; Create a new regex builder with the default configuration.݃B ?)& Build a regex from the given pattern.J//,11 1݃ 1 B  $N<k*' Build a regex from the given patterns.ԝT11 1݃ 1 B / /T $J'"$BIF Build a regex from its component forward and reverse hybrid NFA/DFAs.C@ This is useful when you've built a forward and reverse lazy DFAIF separately, and want to combine them into a single regex. Once build,JG the individual DFAs given can still be accessed via [`Regex::forward`] and [`Regex::reverse`].C@ It is important that the reverse lazy DFA be compiled under the̹ following conditions:1. * It should use [`MatchKind::All`] semantics.! * It should match in reverse.@= * Otherwise, its configuration should match the forward DFA.JG If these conditions aren't satisfied, then the behavior of searches is unspecified.GD Note that when using this constructor, no configuration is applied.DA Since this routine provides the DFAs to the builder, there is no52 opportunity to apply other configuration options.l/IF This shows how to build individual lazy forward and reverse DFAs, and,) then combine them into a single `Regex`.<//)& hybrid::{dfa::DFA, regex::Regex},0 MatchKind,4ݥ/&# let fwd = DFA::new(r"foo[0-9]+")?; let rev = DFA::builder()<ݚ083Ӏ .build(r"foo[0-9]+")?;85 let re = Regex::builder().build_from_dfas(fwd, rev);&ʛ085 assert_eq!(true, re.is_match(&mut cache, "foo123"));.Ǭ/<ւ/|1 1݃B  $H<H<ӅdՃ7/4/ʄ҄J/t/Դ4څ1 1݃ݒ:B  $4D=/0- [`nfa::thompson::Config`](thompson::Config).F/(/D1 1݃:B  $4:EB Set the lazy DFA compilation configuration for this builder usingՊ [`dfa::Config`].KH This permits setting things like whether Unicode word boundaries shouldƋIF be heuristically supported or settings how the behavior of the cache.1 1݃:B  $4ċ݃<݃B T/44/4,)5 05B5\T5L5(L5,,5,T5-$5,,55"5|P5l5|55|~kmY[GI5D51111 1 1 1,,,,Ŝ,,I{1B 55A,5`,5 5d 511111 1 1 1,,,,Ŝ,,I{1řǙșəʙ˙G*R{9  1B 5  5A, 5`, 5Ѷ 5D 5ܐ5t5 5 5 5 5 , 585& 58$5$ 5, 585& 58$5*5 5 5 5 5858$5 5 58`,5 58D5 5 5 58 get_uncheckedl5 5 5, 585% 585 5805 5 58A,5$ 5, 585$ 58$5% 55ۆUU5::o5Do51111 1 1 1,,,,Ŝ,,I{1B o5o5A,o5`,o5r5dr51111 1 1 1,,,,Ŝ,,I{1B r5 r5A,r5`,r5Dr5x5tx5 x5 z5 x5 y5 , y58y5& y58$y5$ y5, y58y5& y58$y5*y5 y5 z5 y5 z58y58$y5 y5 y58`,y5 y58Dy5 y5 y5 y58:ly5 y5 y5, y58y5% y58y5 y580y5 z5 z58A,z5$ z5, z58z5$ z58$z5% z5|5::5::5511111 1 1 1,,,,Ŝ,,I{1 1B ޛ5 ٛ5A,5`,5,55Ą5111111 1 1 1,,,,Ŝ,,I{1řǙșəʙ˙G*R{9  1 1B 5 5A,5`,Ƞ5Ѷߠ5,55::5511111 1 1 1,,,,Ŝ,,I{1 1B 5 5A,5`,5,Ͽ55::n5D51111 1 1 1,,,,Ŝ,,I{1 B 5 5A,5`,5n5D51111 1 1 1,,,,Ŝ,,I{1 B 5 5A,5`,55<5111111 1 1 1,,,,Ŝ,,I{1 1 1B 5 5A,5`,5555::5: 5<5111111 1 1 1,,,,Ŝ,,I{1 1 1B 5 5A,5`,5555::5::551222 1 2 2,,,,Ŝ,,I{2 B 5 5A,5`,55́'5<ρ5ۆB  4ׁ5d26 Provides a regex matcher that composes several other regex matchers automatically. This module is home to a meta [`Regex`], which provides a convenient high level API for executing regular expressions in linear time. # Comparison with the `regex` crate A meta `Regex` is the implementation used directly by the `regex` crate. Indeed, the `regex` crate API is essentially just a light wrapper over a meta `Regex`. This means that if you need the full flexibility offered by this API, then you should be able to switch to using this API directly without any changes in match semantics or syntax. However, there are some API level differences: * The `regex` crate API returns match objects that include references to the haystack itself, which in turn makes it easy to access the matching strings without having to slice the haystack yourself. In contrast, a meta `Regex` returns match objects that only have offsets in them. * At time of writing, a meta `Regex` doesn't have some of the convenience routines that the `regex` crate has, such as replacements. Note though that [`Captures::interpolate_string`](crate::util::captures::Captures::interpolate_string) will handle the replacement string interpolation for you. * A meta `Regex` supports the [`Input`](crate::Input) abstraction, which provides a way to configure a search in more ways than is supported by the `regex` crate. For example, [`Input::anchored`](crate::Input::anchored) can be used to run an anchored search, regardless of whether the pattern is itself anchored with a `^`. * A meta `Regex` supports multi-pattern searching everywhere. Indeed, every [`Match`](crate::Match) returned by the search APIs include a [`PatternID`](crate::PatternID) indicating which pattern matched. In the single pattern case, all matches correspond to [`PatternID::ZERO`](crate::PatternID::ZERO). In contrast, the `regex` crate has distinct `Regex` and a `RegexSet` APIs. The former only supports a single pattern, while the latter supports multiple patterns but cannot report the offsets of a match. * A meta `Regex` provides the explicit capability of bypassing its internal memory pool for automatically acquiring mutable scratch space required by its internal regex engines. Namely, a [`Cache`] can be explicitly provided to lower level routines such as [`Regex::search_with`].  2Ĥ2$2 T6<6,6|6ç46\6,6,646$66(6vxgiXZIK: -LJ )d hjY[,# LN0 >+-| *  J G If it is known which pattern ID caused this build error to occur, thenܨ  this method returns it.  J G Some errors are not associated with a particular pattern. However, any G D errors that occur as part of parsing a pattern are guaranteed to be !  associated with a pattern ID. l / < /1 . use regex_automata::{meta::Regex, PatternID}; I F let err = Regex::new_many(&["a", "b", r"\p{Foo}", "c"]).unwrap_err();8 5 assert_eq!(Some(PatternID::must(2)), err.pattern());< /< 2 2B   $ ) I F If this error occurred because the regex exceeded the configured sizeJ G limit before being built, then this returns the configured size limit. E B The limit returned is what was configured, and corresponds to the* ' maximum amount of heap usage in bytes.T 2 2B   $ : J G If this error corresponds to a syntax error, then a reference to it is  returned by this method.d 2 2řǙșəʙ˙G*R{9  2 B   $ @  BŴ  @  ٛB  ?  װB  % |  > 4 2 2řǙșəʙ˙G*R{9  22B   $ & gD  222 2 2ggg cgcثq1ȡ2B   $   (% |( ( (& g)D ) 222 2 2ggg cgcثq1ȡ2B )  $)  ) *$ +' $+ ۆB merr$+ . .* / B/. |/ / 0/ g0D 0 222 2 2ggg cgcثq1ȡ2B 0  $0  0 1- 2/ $2 B 2 9 9: \9 B  49 :) |: : :* g:D ; 222 2 2ggg cgcثq1ȡ2B ;  $;  ; <( <* $< B < =( =+ $= ۆB ;$= =# \6 6+6+666<6TL,,,T-,ľz|hjVXBD-/,+,Ԝ,,2222 2 2 2,,,,Ŝ,,I{2B ,,A,-`,-L-0:::U F+FԗFtF222222 2 2 2,,,,Ŝ,,I{2 2 2B G FA,G`,GGHJ::M::\6<6 7=7C47LS7ӿLl7-,7z|D7Z!7J,>7F7=^7-f77222 2 2 2řǙșəʙ˙G*R{9 CCC=C=̹B 7 $7$77<7<7T646<8Class,88HirKind<888fNP<>$&D8822 2 2ȚB 8 O8lit8<8ϗ 58 82 2B 8 O 8, 8 U , 8 U:a8822 2 2&B 8 R48D8,8;U,8Ϩ;o8822 2̯ 2&B 8 $8 separatorL8D8T 8U UnicodeBytes:= ,8 82 2B !8 O!8!.8t!82 2řǙșəʙ˙G*R{9  2;B !8 O!8$C8$822 2 2;B $8 O$8;L$8,)8Ϩ;;)#8L*82 2ԯ;B *8 O*8+<8+822 2; 2;B +8 left$+8right,+82M82822 2; 2&B 28 cls28D28,38 U;3B83822 2; 2ȚB 38 ϰ;38;38<48ϗ  ClassBytesM"X15,58U /ߛEY$68U;648682 2B 68 O68$68,>8Ϩ;>M8>82 2;B ?8 ϰ;?8$?8",ll r".",Dm1mJG let haystack = "fn is_boss(bruce: i32, springsteen: String) -> bool;";m?< let matches: Vec = re.find_iter(haystack).collect();n9n'$ Match::must(1, 0..2), // 'fn'n&# Match::must(0, 2..3), // ' 'o,) Match::must(1, 3..10), // 'is_boss'o&# Match::must(3, 10..11), // '('p*' Match::must(1, 11..16), // 'bruce'p&# Match::must(3, 16..17), // ':'p&# Match::must(0, 17..18), // ' 'q(% Match::must(1, 18..21), // 'i32'q&# Match::must(3, 21..22), // ','q&# Match::must(0, 22..23), // ' 'r0- Match::must(1, 23..34), // 'springsteen'r&# Match::must(3, 34..35), // ':'r&# Match::must(0, 35..36), // ' 's+( Match::must(1, 36..42), // 'String's&# Match::must(3, 42..43), // ')'s&# Match::must(0, 43..44), // ' 't'$ Match::must(2, 44..46), // '->'t&# Match::must(0, 46..47), // ' 't)& Match::must(1, 47..51), // 'bool'u&# Match::must(3, 51..52), // ';'[[:space:]])|(?P[A-Za-z0-9][A-Za-z0-9_]+)|...`,wGD but then you need to ask whether capture group matched to determinewFC which branch in the regex matched, and thus, which token the matchxJG corresponds to. In contrast, the above example includes the pattern IDy?< in the match. There's no need to use capture groups at all.yy74 # Example: finding the pattern that caused an errorzzC@ When a syntax error occurs, it is possible to ask which patternz caused the syntax error.{<{/{1:{{I:|8:<|/|}%" # Example: zero patterns is valid}}EB Building a regex with zero patterns results in a regex that never}GD matches anything. Because this routine is generic, passing an empty~GD slice usually requires a turbo-fish (or something else to help type| inference).</;8 use regex_automata::{meta::Regex, util::syntax, Match};+( let re = Regex::new_many::<&str>(&[])?;" assert_eq!(None, re.find(""));ۀ.Ǭ/</D2 2 B ԁ/ /T : "̩1. Return a default configuration for a `Regex`.K3ƃ85 type when customizing the construction of a `Regex`.'$ # Example: lower the NFA size limitJG In some cases, the default size limit might be too big. The size limitKH can be lowered, which will prevent large regex patterns from compiling.ޅ</=/$! use regex_automata::meta::Regex;݆! let result = Regex::builder()FC .configure(Regex::config().nfa_size_limit(Some(20 * (1<<10))))ևIF // Not even 20KB is enough to build a single large Unicode class! .build(r"\pL"); assert!(result.is_err());.Ǭ/</4ŏB ܟC3@0%0)& # Example: change the line terminatorۋJG This example shows how to enable multi-line mode by default and change(% the line terminator to the NUL byte:ߌ</;;컍9ݍ74 .syntax(syntax::Config::new().multi_line(true))<9 .configure(Regex::config().line_terminator(b'\x00'))ڎ .build(r"^foo$")?; let hay = "\x00foo\x00";96 assert_eq!(Some(Match::must(0, 1..4)), re.find(hay));؏.Ǭ/</<ӑB TݐKH High level convenience routines for using a regex to search a haystack.ވ@F9I9ےHE will never lead to a different result. (Consider how this might makeHE a difference given the regex `a+` on the haystack `aaaaaaaaaaaaaaa`.JG This routine _may_ stop after it sees the first `a`, but routines likeĔHE `find` need to continue searching because `+` is greedy by default.)l/</$;)9(% assert!(re.is_match("foo12345bar"));Ӗ$! assert!(!re.is_match("foobar"));.Ǭ/</×˗+0GD `is_match` is guaranteed to return `true` whenever `find` returns aϘEB match. This includes searches that are executed entirely within at0</-* use regex_automata::{meta::Regex, Input}; let re = Regex::new("a*")?;FC // This doesn't match because the default configuration bans empty*' // matches from splitting a codepoint.85 assert!(!re.is_match(Input::new("☃").span(1..2)));ݛ<9 assert_eq!(None, re.find(Input::new("☃").span(1..2)));.Ǭ/<ٜ/E0I00</41 use regex_automata::{meta::Regex, Input, Match};952 .configure(Regex::config().utf8_empty(false))ٟ074 assert!(re.is_match(Input::new("☃").span(1..2)));|0̠# Some(Match::must(0, 1..1)),.+ re.find(Input::new("☃").span(1..2)),40.Ǭ/</JG A similar idea applies when using line anchors with CRLF mode enabled,Т@= which prevents them from matching between a `\r` and a `\n`.</4݀<%" let re = Regex::new(r"(?Rm:$)")?;96 assert!(!re.is_match(Input::new("\r\n").span(1..1)));Ҥ:7 // A regular line anchor, which only considers \n as a# // line terminator, will match.$! let re = Regex::new(r"(?m:$)")?;85 assert!(re.is_match(Input::new("\r\n").span(1..1)));.Ǭ/<ڦ/D2 2ވӤB 0 0| Ӥ$`?46EIF Executes a leftmost search and returns the first match that is found, if one exists.l/</-;&9@= assert_eq!(Some(Match::must(0, 0..8)), re.find("foo12345"));.Ǭ/</$í2 2ވӤB 0 ̭0|ϭ Ӥ$`Aȭ46lHE Executes a leftmost forward search and writes the spans of capturingFC groups that participated in a match into the provided [`Captures`]ʯKH value. If no match was found, then [`Captures::is_match`] is guaranteed to return `false`.l/ϰ<װ/,) use regex_automata::{meta::Regex, Span};@= let re = Regex::new(r"^([0-9]{4})-([0-9]{2})-([0-9]{2})$")?;(0)& re.captures("2010-03-14", &mut caps);IJ assert!(caps.is_match());:7 assert_eq!(Some(Span::from(0..4)), caps.get_group(1));:7 assert_eq!(Some(Span::from(5..7)), caps.get_group(2));;8 assert_eq!(Some(Span::from(8..10)), caps.get_group(3));.Ǭ/<ߴ/D22 2ވӤ 2B 0 0| Ӥ$`Bɾ&B=?nDA Returns an iterator over all non-overlapping leftmost matches inGD the given haystack. If no match exists, then the iterator yields nol elements.̷lԷ/</-;&9߸'$ let haystack = "foo1 foo12 foo123";?;Ϲ9999<ں9.Ǭ/</L ވӤAx A쳍BĻ0 ̻0|ϻ Ӥ$`gD;=Ȼ8:vIF Returns an iterator over all non-overlapping `Captures` values. If no74 match exists, then the iterator yields no elements.ƾIF This yields the same matches as [`Regex::find_iter`], but it includesEB the spans of all capturing groups that participate in each match.޿JG **Tip:** See [`util::iter::Searcher`](crate::util::iter::Searcher) forJG how to correctly iterate over all matches in a haystack while avoidingJG the creation of a new `Captures` value for every match. (Which you are%" forced to do with an `Iterator`.)l/</,<30 let re = Regex::new("foo(?P[0-9]+)")?;'Ř< let matches: Vec = re  .captures_iter(haystack)KH // The unwrap is OK since 'numbers' matches if the pattern matches.?< .map(|caps| caps.get_group_by_name("numbers").unwrap()) .collect();9 Span::from(3..4),ԅ Span::from(8..10),ܤ Span::from(14..17),<9.Ǭ/</l ވӤAɾ?3B0 0| Ӥ$`aG;=8:dFC Returns an iterator of spans of the haystack given, delimited by aKH match of the regex. Namely, each element of the iterator corresponds toJG a part of the haystack that *isn't* matched by the regular expression.l/GD To split a string delimited by arbitrary amounts of spaces or tabs:</$;$! let re = Regex::new(r"[ \t]+")?;" let hay = "a b \t c\td e";KH let fields: Vec<&str> = re.split(hay).map(|span| &hay[span]).collect();63 assert_eq!(fields, vec!["a", "b", "c", "d", "e"]);.Ǭ/</̢ # Example: more cases Basic usage:</$; let re = Regex::new(r" ")?;'$ let hay = "Mary had a little lamb";DA let got: Vec<&str> = re.split(hay).map(|sp| &hay[sp]).collect();@= assert_eq!(got, vec!["Mary", "had", "a", "little", "lamb"]); let re = Regex::new(r"X")?; let hay = "";D< assert_eq!(got, vec![""]);̰<$! let hay = "lionXXtigerXleopard";D<:7 assert_eq!(got, vec!["lion", "", "tiger", "leopard"]);  let re = Regex::new(r"::")?;%" let hay = "lion::tiger::leopard";D<63 assert_eq!(got, vec!["lion", "tiger", "leopard"]);.Ǭ/</GD If a haystack contains multiple contiguous matches, you will end up-* with empty spans yielded by the iterator:</$;̰<ܜ let hay = "XXXXaXXbXc";D<=: assert_eq!(got, vec!["", "", "", "", "a", "", "b", "c"]); let re = Regex::new(r"/")?; let hay = "(///)";D<,) assert_eq!(got, vec!["(", "", "", ")"]);.Ǭ/</HE Separators at the start or end of a haystack are neighbored by emptyT spans.</$; let re = Regex::new(r"0")?; let hay = "010";D<'$ assert_eq!(got, vec!["", "1", ""]);.Ǭ/</FC When the empty string is used as a regex, it splits at every validJG UTF-8 boundary by default (which includes the beginning and end of thet haystack):</$; let re = Regex::new(r"")?; let hay = "rust";D<63 assert_eq!(got, vec!["", "r", "u", "s", "t", ""]);>; // Splitting by an empty string is UTF-8 aware by default!Ƚ< let hay = "☃";D<)& assert_eq!(got, vec!["", "☃", ""]);.Ǭ/</JG But note that UTF-8 mode for empty strings can be disabled, which will@= then result in a match at every byte offset in the haystack,,) including between every UTF-8 code unit.</$;95<3 let hay = "☃".as_bytes();EB let got: Vec<&[u8]> = re.split(hay).map(|sp| &hay[sp]).collect(); assert_eq!(got, vec![IF // Writing byte string slices is just brutal. The problem is that52 // b"foo" has type &[u8; 3] instead of &[u8].IF &[][..], &[b'\xE2'][..], &[b'\x98'][..], &[b'\x83'][..], &[][..],<9.Ǭ/</JG Contiguous separators (commonly shows up with whitespace), can lead toDA possibly surprising behavior. For example, this code is correct:</$;ɮ<ܷ let hay = " a b c";D<=ڶ<.Ǭ/</KH It does *not* give you `["a", "b", "c"]`. For that behavior, you'd want)& to match contiguous space characters:</$;  let re = Regex::new(r" +")?;ܙ<D<EB // N.B. This does still include a leading empty span because ' +'0- // matches at the beginning of the haystack.-* assert_eq!(got, vec!["", "a", "b", "c"]);.Ǭ/</, ވӤb1mHB0 0| Ӥ$` I;=8:|GD Returns an iterator of at most `limit` spans of the haystack given,GD delimited by a match of the regex. (A `limit` of `0` will return noFC spans.) Namely, each element of the iterator corresponds to a partGD of the haystack that *isn't* matched by the regular expression. TheKH remainder of the haystack that is not split will be the last element in the iterator.l/-* Get the first two words in some haystack:</=/$;)& let re = Regex::new(r"\W+").unwrap();" let hay = "Hey! How are you?"; let fields: Vec<&str> =;8 re.splitn(hay, 3).map(|span| &hay[span]).collect();74 assert_eq!(fields, vec!["Hey", "How", "are you?"]);.Ǭ/</ # Examples: more cases</$;ɮ<'<HE let got: Vec<&str> = re.splitn(hay, 3).map(|sp| &hay[sp]).collect();:7 assert_eq!(got, vec!["Mary", "had", "a little lamb"]);̰<π<H<<Ձ̰݁<$<H<74 assert_eq!(got, vec!["lion", "", "tigerXleopard"]); <%<HE let got: Vec<&str> = re.splitn(hay, 2).map(|sp| &hay[sp]).collect();ׄ41 assert_eq!(got, vec!["lion", "tiger::leopard"]);̰<ļ let hay = "abcXdef";مHE let got: Vec<&str> = re.splitn(hay, 1).map(|sp| &hay[sp]).collect();%" assert_eq!(got, vec!["abcXdef"]);І؆̰< let hay = "abcdef";H<$! assert_eq!(got, vec!["abcdef"]);̰<ĺ<׈HE let got: Vec<&str> = re.splitn(hay, 0).map(|sp| &hay[sp]).collect();䤉 assert!(got.is_empty());ʼn͉.Ǭ/</4 ވӤZ>_cB0 0| Ӥ$Ê`4J>JDFACTȋ74 Lower level search routines that give more control.ވ8G9݌$9HE This is like [`Regex::find`] but, but it accepts a concrete `&Input`ۍ  instead of an `Into`.l/</4݀<)& let re = Regex::new(r"Samwise|Sam")?;ܝ let input = Input::new(96 "one of the chief characters, Samwise the Brave",40@= assert_eq!(Some(Match::must(0, 29..36)), re.search(&input));ːӐ.Ǭ/</4222 2ވ 2,,,,Ŝ,,I{2B  $`MAJG Returns the end offset of the leftmost match. If no match exists, thenϝ4KH This is distinct from [`Regex::search`] in that it only returns the endÞHE of a match and not the start of the match. Depending on a variety ofIF implementation details, this _may_ permit the regex engine to do lessޟJG overall work. For example, if a DFA is being used to execute a search,HE then the start of a match usually requires running a separate DFA inJG reverse to the find the start of a match. If one only needs the end ofɡHE a match, then the separate reverse scan to find the start of a matchJG can be skipped. (Note that the reverse scan is avoided even when usingJG `Regex::search` when possible, for example, in the case of an anchoredd search.)ţlͣ/ߣ</85 use regex_automata::{meta::Regex, Input, HalfMatch};)<<9<4ĥ0ϥEB assert_eq!(Some(HalfMatch::must(0, 36)), re.search_half(&input));.Ǭ/<Ԧ/\222 2ވ 2,,,,Ŝ,,I{2B  $`REH<F<ūK<<HE This is like [`Regex::captures`], but it accepts a concrete `&Input` <&1ݭHE This example shows how to build a multi-pattern `Regex` that permits$! searching for specific patterns.ۮ<// meta::Regex,*' Anchored, Match, PatternID, Input,4կݥ/DA let re = Regex::new_many(&["[a-z0-9]{6}", "[a-z][a-z0-9]{5}"])?;(0ް3C3ϱK3G33.+ let expected = Some(Match::must(0, 0..6));96 re.search_captures(&Input::new(haystack), &mut caps);+Ċ0J3"3.+ let expected = Some(Match::must(1, 0..6));ҵ$393*' re.search_captures(&input, &mut caps);+Ċ0.Ǭ/<ӷ/߷01Gȱ1;1</Ĺ=/41 use regex_automata::{meta::Regex, Match, Input};Ǻ*' let re = Regex::new(r"\b[0-9]{3}\b")?;(0ص1ǻϻE1F߶1I1E1tӸ1.1¾,) let input = Input::new(&haystack[3..6]);*<+Ċ0ҿڿK1H1FȻ1C1Ċ11. let input = Input::new(haystack).range(3..6);*<+Ċ0.Ǭ/</|2222 2ވ 2,,,,Ŝ,,I{2 2B  $`&Uɾ1UH<FC groups that participated in a match into the provided `slots`, andKH returns the matching pattern ID. The contents of the slots for patternsKH other than the matching pattern are unspecified. If no match was found,GD then `None` is returned and the contents of `slots` is unspecified.DA This is like [`Regex::search`], but it accepts a raw slots sliceG101K1F1K161C1JG * A slice with [`pattern_len() * 2`](Regex::pattern_len) slots, if youFC only care about the overall match spans for each matching pattern.1K1F1d/l/A1J1)1</=/85 use regex_automata::{meta::Regex, PatternID, Input};; r"\pL+",| r"\d+",D1%" let input = Input::new("!@#123");D1G1112/ let pid = re.search_slots(&input, &mut slots);.1K1I1111"1<9 assert_eq!(Some(3), slots[slot_start].map(|s| s.get()));:7 assert_eq!(Some(6), slots[slot_end].map(|s| s.get()));.Ǭ/</d2222 2ވ 2,,,,Ŝ,,I{2 2B  $`=Y&HYrF4E4DA position and this `Regex` was configured with [`MatchKind::All`]GD semantics, then all matching patterns are written to the given set.KH Unless all of the patterns in this `Regex` are anchored, then generally1. speaking, this will scan the entire haystack.I4G4H4F44D4I4d4l/G4I4IF It is important that we configure the `Regex` with [`MatchKind::All`]EB semantics here, or else overlapping matches will not be reported.</=/DA use regex_automata::{meta::Regex, Input, MatchKind, PatternSet};4F4439>; .configure(Regex::config().match_kind(MatchKind::All))4%474 let mut patset = PatternSet::new(re.pattern_len());63 re.which_overlapping_matches(&input, &mut patset);'4H43.Ǭ/</̨2222 2ވ 2,,,,Ŝ,,I{2 2B  $`Z] e]TNK Lower level search routines that give more control, and require the caller/, to provide an explicit [`Cache`] parameter.ވo>; This is like [`Regex::search`], but requires the caller to  explicitly pass a [`Cache`].$! # Why pass a `Cache` explicitly?JG Passing a `Cache` explicitly will bypass the use of an internal memoryGD pool used by `Regex` to get a `Cache` for a search. The use of thisIF pool can be slower in some cases when a `Regex` is used from multipleHE threads simultaneously. Typically, performance only becomes an issueEB when there is heavy contention, which in turn usually only occursHE when each thread's primary unit of work is a regex search on a smalll haystack.l/</4݀<)<&ʛ0<9<40|0%" Some(Match::must(0, 29..36)),+( re.search_with(&mut cache, &input),40.Ǭ/</\2222 2ވ 2ˎ 2,,,,Ŝ,,I{2B ޔ$A```߈xC@ This is like [`Regex::search_half`], but requires the caller to ʞ=ǀ$=J=ǁG=I=H=E=Hܢ=lń=ׄl߄/</8<…ʅ)<&ʛ0ܣ<Æ9<40|0%" Some(HalfMatch::must(0, 36)),ʇ0- re.search_half_with(&mut cache, &input),40.Ǭ/<ň/2222 2ވ 2ˎ 2,,,,Ŝ,,I{2B $Ac`cGD This is like [`Regex::search_captures`], but requires the caller to ʞ=$=Č̌J=G=I=H=E=̏Hܢ=l=&1ސH<$<ܑ<//<*<4֒ݥ/D<J/䁔3C3K3•G33.<֖JG re.search_captures_with(&mut cache, &Input::new(haystack), &mut caps);+Ċ0՗ݗJ3"3Ә.<$393;8 re.search_captures_with(&mut cache, &input, &mut caps);+Ċ0ݚ.Ǭ/</01Gȱ1;1</=/˝4<*<J/ص1E1F߶1ˠI1E1tӸ1.1,<ڢ;=+Ċ0ʣңK1H1FȻ1C1Ă11=զ;=+Ċ0ŧͧ.Ǭ/</22222 2ވ 2ˎ 2,,,,Ŝ,,I{2 2B $Ae`eɾeDA This is like [`Regex::search_slots`], but requires the caller to ʞ=$=ԫܫJ=G=I=ŭH=E=ܮHܢ=l=lï/կݯA1J1)1</=/8=;߲=|=D1&ʛ0%=D1G1䇵11˵C@ let pid = re.search_slots_with(&mut cache, &input, &mut slots);.1ƶζK1I1111"1<ڍ=:=.Ǭ/</22222 2ވ 2ˎ 2,,,,Ŝ,,I{2 2B ٺ $ںAh`h&hGD This is like [`Regex::which_overlapping_matches`], but requires the*' caller to explicitly pass a [`Cache`].J=G=̿I=H=E=Hܢ=l=$=l/</=/D=4F4439>=4&ʛ0%47=GD re.which_overlapping_matches_with(&mut cache, &input, &mut patset);'4H43.Ǭ/</22222 2ވ 2ˎ 2,,,,Ŝ,,I{2 2B  $Aj`j kTHE Various non-search routines for querying properties of a `Regex` andHE convenience routines for creating [`Captures`] and [`Cache`] values.ވ)JG Creates a new object for recording capture group offsets. This is usedKH in search APIs like [`Regex::captures`] and [`Regex::search_captures`].%" This is a convenience routine forKH `Captures::all(re.group_info().clone())`. Callers may build other typesGD of `Captures` values that record less information (and thus requireDA less work from the regex engine) using [`Captures::matches`] and [`Captures::empty`].l/?< This shows some alternatives to [`Regex::create_captures`]:<//<! util::captures::Captures, Match, PatternID, Span,4ݥ/HE let re = Regex::new(r"(?[A-Z][a-z]+) (?[A-Z][a-z]+)")?;GD // This is equivalent to Regex::create_captures. It stores matching+( // offsets for all groups in the regex.96 let mut all = Captures::all(re.group_info().clone());/, re.captures("Bruce Springsteen", &mut all);=: assert_eq!(Some(Match::must(0, 0..17)), all.get_match());GD assert_eq!(Some(Span::from(0..5)), all.get_group_by_name("first"));GD assert_eq!(Some(Span::from(6..17)), all.get_group_by_name("last"));EB // In this version, we only care about the implicit groups, whichHE // means offsets for the explicit groups will be unavailable. It canHE // sometimes be faster to ask for fewer groups, since the underlying@= // regex engine needs to do less work to keep track of them.A> let mut matches = Captures::matches(re.group_info().clone());30 re.captures("Bruce Springsteen", &mut matches);+( // We still get the overall match info.A> assert_eq!(Some(Match::must(0, 0..17)), matches.get_match());30 // But now the explicit groups are unavailable.96 assert_eq!(None, matches.get_group_by_name("first"));85 assert_eq!(None, matches.get_group_by_name("last"));JG // Finally, in this version, we don't ask to keep track of offsets forHE // *any* groups. All we get back is whether a match occurred, and if.+ // so, the ID of the pattern that matched.=: let mut empty = Captures::empty(re.group_info().clone());1. re.captures("Bruce Springsteen", &mut empty); // it's a match! assert!(empty.is_match()); // for pattern ID 074 assert_eq!(Some(PatternID::ZERO), empty.pattern());%" // Match offsets are unavailable.(% assert_eq!(None, empty.get_match());:7 // And of course, explicit groups are unavailable too.74 assert_eq!(None, empty.get_group_by_name("first"));63 assert_eq!(None, empty.get_group_by_name("last"));.Ǭ/</|2 2ވB  $#A> Creates a new cache for use with lower level search APIs like [`Regex::search_with`].IF The cache returned should only be used for searches for this `Regex`.JG If you want to reuse the cache for another `Regex`, then you must call'$ [`Cache::reset`] with that `Regex`.52 This is a convenience routine for [`Cache::new`].l/</4݀<.+ let re = Regex::new(r"(?-u)m\w+\s+m\w+")?;&ʛ0>; let input = Input::new("crazy janey and her mission man");|0%" Some(Match::must(0, 20..31)),+=40.Ǭ/</d2 2ވˎB  $"74 Returns the total number of patterns in this regex.GD The standard [`Regex::new`] constructor always results in a `Regex`EB with a single pattern, but [`Regex::new_many`] permits building aĖ multi-pattern regex.JG A `Regex` guarantees that the maximum possible `PatternID` returned inIF any match is `Regex::pattern_len() - 1`. In the case where the number.+ of patterns is `0`, a match is impossible.l/</$;)& let re = Regex::new(r"(?m)^[a-z]$")?;$! assert_eq!(1, re.pattern_len());+;$! assert_eq!(0, re.pattern_len());0- let re = Regex::new_many(&["a", "b", "c"])?;$:.Ǭ/</\2 2ވB  $#1. Returns the total number of capturing groups.C@ This includes the implicit capturing group corresponding to the?< entire match. Therefore, the minimum value returned is `1`.l/DA This shows a few patterns and how many capture groups they have.</$;̝ let len = |pattern| {74 Regex::new(pattern).map(|re| re.captures_len())4ݥ/ assert_eq!(1, len("a")?); assert_eq!(2, len("(a)")?);# assert_eq!(3, len("(a)|(b)")?);)& assert_eq!(5, len("(a)(b)|(c)(d)")?);! assert_eq!(2, len("(a)|b")?);! assert_eq!(2, len("a|(b)")?);  assert_eq!(2, len("(b)*")?);  assert_eq!(2, len("(b)+")?);.Ǭ/</  # Example: multiple patternsFC This routine also works for multiple patterns. The total number is2/ the sum of the capture groups of each pattern.</$; let len = |patterns| {=: Regex::new_many(patterns).map(|re| re.captures_len())4ݥ/%" assert_eq!(2, len(&["a", "b"])?);)& assert_eq!(4, len(&["(a)", "(b)"])?);1. assert_eq!(6, len(&["(a)|(b)", "(c)|(d)"])?);63 assert_eq!(8, len(&["(a)(b)|(c)(d)", "(x)(y)"])?);'$ assert_eq!(3, len(&["(a)", "b"])?);'$ assert_eq!(3, len(&["a", "(b)"])?);*' assert_eq!(4, len(&["(a)", "(b)*"])?);+( assert_eq!(4, len(&["(a)+", "(b)+"])?);.Ǭ/</d2 2ވB ΀ $π2EB Returns the total number of capturing groups that appear in everyȂ possible match.IF If the number of capture groups can vary depending on the match, thenJG this returns `None`. That is, a value is only returned when the number0- of matching groups is invariant or "static."„EB Note that like [`Regex::captures_len`], this **does** include theJG implicit capturing group corresponding to the entire match. Therefore,ۅKH when a non-None value is returned, it is guaranteed to be at least `1`.B? Stated differently, a return value of `Some(0)` is impossible.l/EB This shows a few cases where a static number of capture groups isއ.+ available and a few cases where it is not.</=/$;̠=>; Regex::new(pattern).map(|re| re.static_captures_len())4ݥ/# assert_eq!(Some(1), len("a")?);%" assert_eq!(Some(2), len("(a)")?);)& assert_eq!(Some(2), len("(a)|(b)")?);/, assert_eq!(Some(3), len("(a)(b)|(c)(d)")?);ȋ$! assert_eq!(None, len("(a)|b")?);$! assert_eq!(None, len("a|(b)")?);# assert_eq!(None, len("(b)*")?);Œ&# assert_eq!(Some(2), len("(b)+")?);.Ǭ/</ =GD This property extends to regexes with multiple patterns as well. InIF order for their to be a static number of capture groups in this case,30 every pattern must have the same static number.<Ï/Ϗ=/$;ʐ=DA Regex::new_many(patterns).map(|re| re.static_captures_len())4ݥ/ő+( assert_eq!(Some(1), len(&["a", "b"])?);/, assert_eq!(Some(2), len(&["(a)", "(b)"])?);74 assert_eq!(Some(2), len(&["(a)|(b)", "(c)|(d)"])?);<9 assert_eq!(Some(3), len(&["(a)(b)|(c)(d)", "(x)(y)"])?);*' assert_eq!(None, len(&["(a)", "b"])?);Փ*' assert_eq!(None, len(&["a", "(b)"])?);-* assert_eq!(None, len(&["(a)", "(b)*"])?);1. assert_eq!(Some(2), len(&["(a)+", "(b)+"])?);.Ǭ/</ȕ2 2ވB ܕ $ݕ, &@= Return information about the capture groups in this `Regex`.ޗGD A `GroupInfo` is an immutable object that can be cheaply cloned. ItGD is responsible for maintaining a mapping between the capture groupsC@ in the concrete syntax of zero or more regex patterns and theirƙJG internal representation used by some of the regex matchers. It is alsoHE responsible for maintaining a mapping between the name of each group63 (if one exists) and its corresponding group index.KH A `GroupInfo` is ultimately what is used to build a [`Captures`] value,JG which is some mutable space where group offsets are stored as a resultĜ of a search.ٜl/?=<ǝ/ӝ/<!==4Ԟݥ/ߞH=G=+=9=/===G=G=E=֣H=H=@=A=3=+=A=3=9=8=ܨJ=H=.===1==ī==7=%=(=:=խ7=6=̮Ԯ.Ǭ/</T3 3ވ 3B  $α#@= Returns the configuration object used to build this `Regex`.ư>; If no configuration object was explicitly passed, then the2/ configuration returned represents the default.Tձ3 3ވ 3ŏB  $$HE Returns true if this regex has a high chance of being "accelerated."JG The precise meaning of "accelerated" is specifically left unspecified,³FC but the general meaning is that the search is a high likelihood ofDA running faster than a character-at-a-time loop inside a standardִ regex engine.IF When a regex is accelerated, it is only a *probabilistic* claim. ThatµJG is, just because the regex is believed to be accelerated, that doesn'tGD mean it will definitely execute searches very fast. Similarly, if aݶHE regex is *not* accelerated, that is also a probabilistic claim. ThatJG is, a regex for which `is_accelerated` returns `false` could still runIF searches more quickly than a regex for which `is_accelerated` returns\Ǹ `true`.׸߸C@ Whether a regex is marked as accelerated or not is dependent onKH implementations details that may change in a semver compatible release.JG That is, a regex that is accelerated in a `x.y.1` release might not beƺ%" accelerated in a `x.y.2` release.GD Basically, the value of acceleration boils down to a hedge: a hodgeĻFC podge of internal heuristics combine to make a probabilistic guessIF that this regex search may run "fast." The value in knowing this fromݼIF a caller's perspective is that it may act as a signal that no furtherHE work should be done to accelerate a search. For example, a grep-likeIF tool might try to do some extra work extracting literals from a regexƾEB to create its own heuristic acceleration strategies. But it mightHE choose to defer to this crate's acceleration strategy if one exists.ݿIF This routine permits querying whether such a strategy is active for a particular regex.l/</$;96 // A simple literal is very likely to be accelerated.! let re = Regex::new(r"foo")?;! assert!(re.is_accelerated());@= // A regex with no literals is likely to not be accelerated.  let re = Regex::new(r"\w")?;" assert!(!re.is_accelerated());.Ǭ/</t3 3ވB  $#MJ Return the total approximate heap memory, in bytes, used by this `Regex`.IF Note that currently, there is no high level configuration for settingHE a limit on the specific value returned by this routine. Instead, theGD following routines can be used to control heap memory at a bit of a lower level:GD * [`Config::nfa_size_limit`] controls how big _any_ of the NFAs are allowed to be.IF * [`Config::onepass_size_limit`] controls how big the one-pass DFA isӽ>IF * [`Config::hybrid_cache_capacity`] controls how much memory the lazy?< DFA is permitted to allocate to store its transition table.IF * [`Config::dfa_size_limit`] controls how big a fully compiled DFA isӽ>IF * [`Config::dfa_state_limit`] controls the conditions under which theFC meta regex engine will even attempt to build a fully compiled DFA.d3 3ވB  $ވĪ,3 3ވވB  $<t=33ŏ 3 3B 4$&43 3 3ŏB  $0,3 3 3 B  $4\3 3 3 B  $)\3 3B  $*d3 3B  $;UA333 3 3,,,,Ŝ,,I{3B $`y53 3B  $$33 3B  $$#3 3B  $2l333 3 3,,,,Ŝ,,I{3B  $`1 G 96 Returns the `Regex` value that created this iterator.,3 3 GވB  G$+>; Returns the current `Input` associated with this iterator.JG The `start` position on the given `Input` may change during iteration,ȅ<9 but all other values are guaranteed to remain invariant.,  ,,,,Ŝ,,I{B G$#%-GQQQL$#$Ç3 3B ȇ G$͇<,B G<ʍ>GύӍ$G 9>,3 3>B  G$+>>J>•<>,  >B G$#%1GQQQL$&$ė3 3B ɗ G$Η<٦,B G;<BGԗG+>>J>ң<>,  >B G$#%'GQQL$Ş"$3 3B  G$ƥ8GܐG+>>J>̰<>,  >B G$#%(GQQQL$Ş"$3 3B  G$Ѷ-LԶ3 3B ޶ G$߶9GTˎ2/ Creates a new `Cache` for use with this regex.E:Iɍ:1:3 3ވˎB  #J5$Ï:IF A cache reset permits potentially reusing memory already allocated in(% this cache with a different `Regex`.l/J9</=/4<!9!9'0|0#074 re1.search_with(&mut cache, &Input::new("Δ")),40H۵0I0294ŷ0Jַ0|0:|0#085 re2.search_with(&mut cache, &Input::new("☃")),40.Ǭ/</,33 3ˎ 3ވB  $#;1F151d3 3ˎB  $\ŏ41 Create a new configuration object for a `Regex`.ŏB 2*' Set the match semantics for a `Regex`.63 The default value is [`MatchKind::LeftmostFirst`].l/</85 use regex_automata::{meta::Regex, Match, MatchKind};;8 // By default, leftmost-first semantics are used, which>; // disambiguates matches at the same position by selecting74 // the one that corresponds earlier in the pattern.(% let re = Regex::new("sam|samwise")?;?< assert_eq!(Some(Match::must(0, 0..3)), re.find("samwise"));:7 // But with 'all' semantics, match priority is ignored;8 // and all match states are included. When coupled with96 // a leftmost search, the search will report the last // possible match.9>= .build("sam|samwise")?;?< assert_eq!(Some(Match::must(0, 0..7)), re.find("samwise"));52 // Beware that this can lead to skipping matches!:7 // Usually 'all' is used for anchored reverse searches)& // only, or for overlapping searches.DA assert_eq!(Some(Match::must(0, 4..11)), re.find("sam samwise"));.Ǭ/</TŏŏB $$,IF Toggles whether empty matches are permitted to occur between the code'$ units of a UTF-8 encoded codepoint.JG This should generally be enabled when search a `&str` or anything thatIF you otherwise know is valid UTF-8. It should be disabled in all otherJG cases. Namely, if the haystack is not valid UTF-8 and this is enabled,! then behavior is unspecified.  By default, this is enabled.l/</-; let re = Regex::new("")?;85 let got: Vec = re.find_iter("☃").collect();B? // Matches only occur at the beginning and end of the snowman.< Match::must(0, 0..0), Match::must(0, 3..3),<995< .build("")?;8?+( // Matches now occur at every position!̠<쾀? Match::must(0, 1..1),삁 Match::must(0, 2..2),줁?<Ɓ9ҁځ,) Ok::<(), Box>(())</TŏŏB $0;8 Toggles whether automatic prefilter support is enabled.ƒʃFC If this is disabled and [`Config::prefilter`] is not set, then theEB meta regex engine will not use any prefilters. This can sometimes߄EB be beneficial in cases where you know (or have measured) that the85 prefilter leads to overall worse search performance. ق?l/</=/-;콇9߇96 .configure(Regex::config().auto_prefilter(false)) .build(r"Bruce \w+")?;)& let hay = "Hello Bruce Springsteen!";:7 assert_eq!(Some(Match::must(0, 6..23)), re.find(hay));,?</tŏŏB $ȟ8ފ=: Overrides and sets the prefilter to use inside a `Regex`.EB This permits one to forcefully set a prefilter in cases where theFC caller knows better than whatever the automatic prefilter logic is| capable of.ьٌHE By default, this is set to `None` and an automatic prefilter will beGD used if one could be built. (Assuming [`Config::auto_prefilter`] is%" enabled, which it is by default.)l/FC This example shows how to set your own prefilter. In the case of aEB pattern like `Bruce \w+`, the automatic prefilter is likely to beӏGD constructed in a way that it will look for occurrences of `Bruce `.HE In most cases, this is the best choice. But in some cases, it may beEB the case that running `memchr` on `B` is the best choice. One canEB achieve that behavior by overriding the automatic prefilter logic41 and providing a prefilter that just matches `B`.</͒=/̏/<Ɠ#6 Match, MatchKind,4ݥ/>; let pre = Prefilter::new(MatchKind::LeftmostFirst, &["B"]) .expect("a prefilter");솕985 .configure(Regex::config().prefilter(Some(pre)))?)?:ݎ?.Ǭ/</ėB? # Example: incorrect prefilters can lead to incorrect results!DA Be warned that setting an incorrect prefilter can lead to missedܘIF matches. So if you use this option, ensure your prefilter can _never_JG report false negatives. (A false positive is, on the other hand, quite$! okay and generally unavoidable.)</=//<#6כ?4ݥ/>; let pre = Prefilter::new(MatchKind::LeftmostFirst, &["Z"])˜?98?Ν?)?52 // Oops! No match found, but there should be one!ٞ# assert_eq!(None, re.find(hay));.Ǭ/</Lϟŏ ŏB $ٟѶߟHFC Configures what kinds of groups are compiled as "capturing" in the䃡 underlying regex engine.IF This is set to [`WhichCaptures::All`] by default. Callers may wish toFC use [`WhichCaptures::Implicit`] in cases where one wants avoid theŢ30 overhead of capture states for explicit groups.IF Note that another approach to avoiding the overhead of capture groupsӣC@ is by using non-capturing groups in the regex pattern. That is,JG `(?:a)` instead of `(a)`. This option is useful when you can't controlKH the concrete syntax but know that you don't need the underlying captureJG states. For example, using `WhichCaptures::Implicit` will behave as ifDA all explicit capturing groups in the pattern were non-capturing.ҦڦKH Setting this to `WhichCaptures::None` is usually not the right thing toHE do. When no capture states are compiled, some regex engines (such asKH the `PikeVM`) won't be able to report match offsets. This will manifestǨC@ as no match being found. Indeed, in order to enforce consistentJG behavior, the meta regex engine will always report `None` for routinesީDA that return match offsets even if one of its regex engines couldGD service the request. This avoids "match or not" behavior from beingJG influenced by user input (since user input can influence the selection« of the regex engine).l/JG This example demonstrates how the results of capture groups can changeѬJG based on this option. First we show the default (all capture groups in the pattern are capturing):ĭ<̭/ح30 use regex_automata::{meta::Regex, Match, Span};,) let re = Regex::new(r"foo([0-9]+)bar")?;ɮ let hay = "foo123bar";(0  re.captures(hay, &mut caps);¯:7 assert_eq!(Some(Span::from(0..9)), caps.get_group(0));:7 assert_eq!(Some(Span::from(3..6)), caps.get_group(1));Ȱ,?</FC And now we show the behavior when we only include implicit captureرJG groups. In this case, we can only find the overall match span, but theJG spans of any other explicit group don't exist because they are treatedIF as non-capturing. (In effect, when `WhichCaptures::Implicit` is used,ijKH there is no real point in using [`Regex::captures`] since it will never=: be able to report more information than [`Regex::find`].)ִ<޴//<%" nfa::thompson::WhichCaptures,t˵0l޵ Span,4ݥ/샶9KH .configure(Regex::config().which_captures(WhichCaptures::Implicit))# .build(r"foo([0-9]+)bar")?;ԝӲ?ķ(0 ?:?ո(% assert_eq!(None, caps.get_group(1));,?</ǹϹ-* # Example: strange `Regex::find` behaviorGD As noted above, when using [`WhichCaptures::None`], this means thatպEB `Regex::is_match` could return `true` while `Regex::find` returns\ `None`:</û/<%?t Input,t0lʼ?4ܼݥ/9GD .configure(Regex::config().which_captures(WhichCaptures::None))ݽ#?ԅӲ? assert!(re.is_match(hay));Ͼ# assert_eq!(re.find(hay), None);74 assert_eq!(re.search_half(&Input::new(hay)), None);,?</tŏŏB $dt;JG Sets the size limit, in bytes, to enforce on the construction of every'$ NFA build by the meta regex engine.GD Setting it to `None` disables the limit. This is not recommended if(% you're compiling untrusted patterns.FC Note that this limit is applied to _each_ NFA built, and if any ofGD them exceed the limit, then construction will fail. This limit doesKH _not_ correspond to the total memory used by all NFAs in the meta regex\ engine.HE This defaults to some reasonable number that permits most reasonablel patterns.l/</=/$;!;F;I;;;FC // But notice that building such a regex with the exact same limitGD // can succeed depending on other aspects of the configuration. ForIF // example, a single *forward* NFA will (at time of writing) fit intoHE // the 20KB limit, but a *reverse* NFA of the same pattern will not.IF // So if one configures a meta regex such that a reverse NFA is neverJG // needed and thus never built, then the 20KB limit will be enough for // a pattern like \pL!!;" .configure(Regex::config()/, .nfa_size_limit(Some(20 * (1<<10)))JG // The DFAs are the only thing that (currently) need a reverseGD // NFA. So if both are disabled, the meta regex engine willIF // skip building the reverse NFA. Note that this isn't an APIJG // guarantee. A future semver compatible version may introduce/, // new use cases for a reverse NFA. .hybrid(false) .dfa(false)L8I;; assert!(result.is_ok());.Ǭ/</tŏŏB $,?85 Sets the size limit, in bytes, for the one-pass DFA.C@ Setting it to `None` disables the limit. Disabling the limit isGD strongly discouraged when compiling untrusted patterns. Even if theKH patterns are trusted, it still may not be a good idea, since a one-passGD DFA can use a lot of memory. With that said, as the size of a regexDA increases, the likelihood of it being one-pass likely decreases.H? one-pass patterns.l/FC This shows how to set the one-pass DFA size limit. Note that sinceEB a one-pass DFA is an optional component of the meta regex engine,HE this size limit only impacts what is built internally and will never63 determine whether a `Regex` itself fails to build.</=/$;!;IF .configure(Regex::config().onepass_size_limit(Some(2 * (1<<20)))) .build(r"\pL{5}");?.Ǭ/</ŏŏB $,:74 Set the cache capacity, in bytes, for the lazy DFA.HE The cache capacity of the lazy DFA determines approximately how muchHE heap memory it is allowed to use to store its state transitions. TheIF state transitions are computed at search time, and if the cache fillsGD up it, it is cleared. At this point, any previously generated stateFC transitions are lost and are re-generated if they're needed again.HE This sort of cache filling and clearing works quite well _so long asKH cache clearing happens infrequently_. If it happens too often, then theGD meta regex engine will stop using the lazy DFA and switch over to aܰ different regex engine.HE In cases where the cache is cleared too often, it may be possible toGD give the cache more space and reduce (or eliminate) how often it isKH cleared. Similarly, sometimes a regex is so big that the lazy DFA isn't74 used at all if its cache capacity isn't big enough.FC The capacity set here is a _limit_ on how much memory is used. The85 actual memory used is only allocated as it's needed.KH Determining the right value for this is a little tricky and will likelyKH required some profiling. Enabling the `logging` feature and setting theHE log level to `trace` will also tell you how often the cache is beingd6l/</=/$;!;GD .configure(Regex::config().hybrid_cache_capacity(20 * (1<<20)))Ԧ??.Ǭ/</ŏŏB $,;C@ Sets the size limit, in bytes, for heap memory used for a fully compiled DFA.GD **NOTE:** If you increase this, you'll likely also need to increase  [`Config::dfa_state_limit`].GD In contrast to the lazy DFA, building a full DFA requires computingGD all of its state transitions up front. This can be a very expensiveFC process, and runs in worst case `2^n` time and space (where `n` isGD proportional to the size of the regex). However, a full DFA unlocks/, some additional optimization opportunities.JG Because full DFAs can be so expensive, the default limits for them areIF incredibly small. Generally speaking, if your regex is moderately bigIF or if you're using Unicode features (`\w` is Unicode-aware by defaultKH for example), then you can expect that the meta regex engine won't even" attempt to build a DFA for it.GD If this and [`Config::dfa_state_limit`] are set to `None`, then theGD meta regex will not use any sort of limits when deciding whether toB? build a DFA. This in turn makes construction of a `Regex` takeIF worst case exponential time and space. Even short patterns can resultKH in huge space blow ups. So it is strongly recommended to keep some kind of limit set!IF The default is set to a small number that permits some simple regexes1. to get compiled into DFAs in reasonable time.l/</=/$;!;1. // 100MB is much bigger than the default."?0- .dfa_size_limit(Some(100 * (1<<20)))>; // We don't care about size too much here, so just52 // remove the NFA state limit altogether.# .dfa_state_limit(None))??.Ǭ/</tŏŏB $,<HE Sets a limit on the total number of NFA states, beyond which, a fullȀ(% DFA is not attempted to be compiled.HE This limit works in concert with [`Config::dfa_size_limit`]. Namely,ʁKH where as `Config::dfa_size_limit` is applied by attempting to constructKH a DFA, this limit is used to avoid the attempt in the first place. ThisJG is useful to avoid hefty initialization costs associated with buildingKH a DFA for cases where it is obvious the DFA will ultimately be too big.30 By default, this is set to a very small number.Ʉlф/</=/$;!;"?B? // Sometimes the default state limit rejects DFAs evenDA // if they would fit in the size limit. Here, we disableLJEB // the check on the number of NFA states and just rely on // the size limit.#?܈ .build(r"(?-u)\w{30}");䀉?.Ǭ/<ԉ/|ŏŏB $,.GD Whether to attempt to shrink the size of the alphabet for the regexFC pattern or not. When enabled, the alphabet is shrunk into a set ofGD equivalence classes, where every byte in the same equivalence classŌ52 cannot discriminate between a match or non-match.G/ӍHE does not yield any speed advantages. Indeed, disabling it can resultEB in much higher memory usage. Disabling byte classes is useful forJG debugging the actual generated transitions because it lets one see theKH transitions defined on actual bytes instead of the equivalence classes.I/ߐ74 one is debugging the meta regex engine's internals.l/</ɑ-;샒974 .configure(Regex::config().byte_classes(false))7́ let hay = "!!quux!!";96 assert_eq!(Some(Match::must(0, 2..6)), re.find(hay));ݓ.Ǭ/</dŏŏB $Ҟ0DA Set the line terminator to be used by the `^` and `$` anchors inܕ multi-line mode.A> This option has no effect when CRLF mode is enabled. That is,ÖIF regardless of this setting, `(?Rm:^)` and `(?Rm:$)` will always treatJG `\r` and `\n` as line terminators (and will never match between a `\r` and a `\n`).,) By default, `\n` is the line terminator.FC **Warning**: This does not change the behavior of `.`. To do that,.+ you'll need to configure the syntax optionUR [`syntax::Config::line_terminator`](crate::util::syntax::Config::line_terminator)B? in addition to this. Otherwise, `.` will continue to match any՚ character other than `\n`.l/</;;97;̜<;ԍ;䬝;͝9;.Ǭ/<ƞ/|ٞŏŏB $$5ǟFC Sets the capacity used to manage a pool of [`Cache`] values in the" higher level convenience APIs.HE When not configured explicitly, a reasonable default is selected. ItJG is rarely expected that a number large than the number of logical CPUsݡIF makes sense as a value. A smaller number could result in slowdowns if0- many regex queries are run under contention.lŏŏB $D(ܣKH Toggle whether the hybrid NFA/DFA (also known as the "lazy DFA") should2/ be available for use by the meta regex engine.B? Enabling this does not necessarily mean that the lazy DFA willIF definitely be used. It just means that it will be _available_ for use63 if the meta regex engine thinks it will be useful.æGD When the `hybrid` crate feature is enabled, then this is enabled byFC default. Otherwise, if the crate feature is disabled, then this isڧ=: always disabled, regardless of its setting by the caller.4ŏŏB $%JG Toggle whether a fully compiled DFA should be available for use by theΩ meta regex engine.IF Enabling this does not necessarily mean that a DFA will definitely beGD used. It just means that it will be _available_ for use if the meta*' regex engine thinks it will be useful.«JG When the `dfa-build` crate feature is enabled, then this is enabled byF@ܬ=@ŏŏB $)IF Toggle whether a one-pass DFA should be available for use by the metaɮި>߮DA Enabling this does not necessarily mean that a one-pass DFA willEB definitely be used. It just means that it will be _available_ forEB use if the meta regex engine thinks it will be useful. (Indeed, aİEB one-pass DFA can only be used when the regex is one-pass. See theC@ [`dfa::onepass`](crate::dfa::onepass) module for more details.)ֱޱIF When the `dfa-onepass` crate feature is enabled, then this is enabledIF by default. Otherwise, if the crate feature is disabled, then this is=@<óŏŏB $˳ѳ+JG Toggle whether a bounded backtracking regex engine should be available%" for use by the meta regex engine.KH Enabling this does not necessarily mean that a bounded backtracker willI@6@KH When the `nfa-backtrack` crate feature is enabled, then this is enabledӷI@=@LŏŏB $)̹;8 Returns the match kind on this configuration, as set by܌ [`Config::match_kind`].C@ If it was not explicitly set, then a default value is returned.t3 3ŏB  $$IF Returns whether empty matches must fall on valid UTF-8 boundaries, as" set by [`Config::utf8_empty`].C@t3 3ŏB ʽ $˽ƿ(?< Returns whether automatic prefilters are enabled, as set byҾ [`Config::auto_prefilter`].C@Ϳ3 3ŏB  $174 Returns a manually set prefilter, if one was set by [`Config::prefilter`].C@l3 3ŏřǙșəʙ˙G*R{9  3B  $10- Returns the capture configuration, as set by [`Config::which_captures`].C@3 3ŏB  $1A> Returns NFA size limit, as set by [`Config::nfa_size_limit`].C@3 3ŏB  $5.+ Returns one-pass DFA size limit, as set by# [`Config::onepass_size_limit`].C@3 3ŏB  $041 Returns hybrid NFA/DFA cache capacity, as set by&# [`Config::hybrid_cache_capacity`].C@3 3ŏB  $1A> Returns DFA size limit, as set by [`Config::dfa_size_limit`].C@3 3ŏB  $2JG Returns DFA size limit in terms of the number of states in the NFA, as'$ set by [`Config::dfa_state_limit`].C@3 3ŏB  $&74 Returns whether byte classes are enabled, as set by [`Config::byte_classes`].C@3 3ŏB  $'A> Returns the line terminator for this configuration, as set by  [`Config::line_terminator`].C@3 3ŏB  $(30 Returns the configured pool capacity, as set by [`Config::pool_capacity`].C@3 3ŏB $"U$) c 8TzB@$ JG Returns whether the hybrid NFA/DFA regex engine may be used, as set by [`Config::hybrid`].C@T3 3ŏB  $?< Returns whether the DFA regex engine may be used, as set by [`Config::dfa`].C@<3 3ŏB  $!HE Returns whether the one-pass DFA regex engine may be used, as set by [`Config::onepass`].C@\3 3ŏB  $#IF Returns whether the bounded backtracking regex engine may be used, as! set by [`Config::backtrack`].C@l3 3ŏB  $;3 3ŏB  $3L3 3ŏŏŏB  $ 8 dӑѣGD Creates a new builder for configuring and constructing a [`Regex`].أӑB Ҫ?2/ Builds a `Regex` from a single pattern string.ޥK;/;l/74 This example shows how to configure syntax options.ȧ<Ч/ܧ;;줨9ƨB? .syntax(syntax::Config::new().crlf(true).multi_line(true))ԍ;䬩;ͩ9;.Ǭ/<ƪ/,٪33 3ӑ 3 B ߪ $N<kë/, Builds a `Regex` from many pattern strings.K;Ϭ9;7;ѭ٭C;䡮;®<ʮ/֮1: let err = Regex::builder()1. .build_many(&["a", "b", r"\p{Foo}", "c"])/8:<Ű/Ѱٰ%;E;ձG;G;|;</;;ճݳ9" .build_many::<&str>(&[])?;";ʹմ.Ǭ/</T33 3ӑ 3 B / /T $"$),,ԜD74 Builds a `Regex` directly from an `Hir` expression.HE This is useful if you needed to parse a pattern string into an `Hir`IF for other reasons (such as analysis or transformations). This routineIF permits building a `Regex` directly from the `Hir` expression instead;8 of first converting the `Hir` back to a pattern string.GD When using this method, any options set via [`Builder::syntax`] areIF ignored. Namely, the syntax options only apply when parsing a pattern&# string, which isn't relevant here.HE If there was a problem building the underlying regex matcher for the+( given `Hir`, then an error is returned.l/IF This example shows how one can hand-construct an `Hir` expression and;8 build a regex from it without doing any parsing at all.</L use {-* regex_automata::{meta::Regex, Match},'$ regex_syntax::hir::{Hir, Look},4ݥ/ // (?Rm)^foo$ let hir = Hir::concat(vec![# Hir::look(Look::StartCRLF),'$ Hir::literal("foo".as_bytes()),! Hir::look(Look::EndCRLF),<99 .build_from_hir(&hir)?;;9;,?</t33 3ӑ 3 B  $Oq:7 Builds a `Regex` directly from many `Hir` expressions.DA This is useful if you needed to parse pattern strings into `Hir`HE expressions for other reasons (such as analysis or transformations).C@ This routine permits building a `Regex` directly from the `Hir`IF expressions instead of first converting the `Hir` expressions back to pattern strings.G@I@&@H@74 given `Hir` expressions, then an error is returned.EB Note that unlike [`Builder::build_many`], this can only fail as aEB result of building the underlying matcher. In that case, there isGD no single `Hir` expression that can be isolated as a reason for theKH failure. So if this routine fails, it's not possible to determine which(% `Hir` expression caused the failure.l/@= This example shows how one can hand-construct multiple `Hir`DA expressions and build a single regex from them without doing any parsing at all.</L@-@'@4ݥ/@  let hir1 = Hir::concat(vec![#@'@!@<9 // (?Rm)^bar$  let hir2 = Hir::concat(vec![#@'$ Hir::literal("bar".as_bytes()),!@<99/, .build_many_from_hir(&[&hir1, &hir2])?; let hay = "\r\nfoo\r\nbar";63 let got: Vec = re.find_iter(hay).collect();3 Match::must(0, 2..5), Match::must(1, 7..10),433,?</33 3ӑ 3 B  \ $46,<;(% Configure the behavior of a `Regex`.JG This configuration controls non-syntax options related to the behaviorKH of a `Regex`. This includes things like whether empty matches can splitHE a codepoint, prefilters, line terminators and a long list of optionsJG for configuring which regex engines the meta regex engine will be able to use internally.l/HE This example shows how to disable UTF-8 empty mode. This will permitEB empty matches to occur between the UTF-8 encoding of a codepoint.</-;Ճ?8?B?̻<??<995<?8?+Ά?̓<??Ƈ??<9,?</L3 3ӑŏAB  $4dDA Configure the syntax options when parsing a pattern string while building a `Regex`.QN These options _only_ apply when [`Builder::build`] or [`Builder::build_many`]EB are used. The other build methods accept `Hir` values, which haveĢ already been parsed.l/;8 This example shows how to enable case insensitive mode.</;;9=: .syntax(syntax::Config::new().case_insensitive(true)) .build(r"δ")?;;8 assert_eq!(Some(Match::must(0, 0..2)), re.find(r"Δ"));,?</43 3ӑݒAB  $46l6!CO$!$!<!!;<!R4!L!(ӿL!-|!ƌ!!*!<!y{,!d!p!`LN`!!33 3 3&B !  concat_prefixl!D!,!;)!):!)!33 3 3řǙșəʙ˙G*R{9 B )! $)!CJ!C!3 3řǙșəʙ˙G*R{9 B D! OD!R0!TR!3 3řǙșəʙ˙G*R{9 ҈B R! OR!Y!;U`!<`!3 3B `! O`!e!ٙAf!ٙA6t6NC/H333 3 3 3ȚB  $suffix4@33 3 3ȚřǙșəʙ˙G*R{9 B  OA4q33 3 3ȚřǙșəʙ˙G*R{9 B  OA4 suffix_cursorl  33 3maxgreedyEx jb 3ȚAB ! rep!A4!Al!,%UT6 6+6+66646tL,,,T-,ܧdPR<>')$+$ԕ$Ծ$3333 3 3 3,,,,Ŝ,,I{3ϩB $$A,%`,%'::;+::t;333333 3 3 3,,,,Ŝ,,I{3 3 3B ; ;A,;`,<<<>::A: d6D6 q,gqg»;l(;T7p\format4aKoK<TTt,LjlltyD $ l!#D&L&\(9$L(T\)L)žD-L,,,,,ӿL-̼T-$T!,L\TLiz,"twdgTWpIL9<*- DLwzmp]`NQ>A.1! YD 2 2, ($  ($ (l (T (< 2r2nAcAYANƴAC״A>22AAAxƴAm״Ah  $$ 3 3(9cgMB  ($  #T 3 3( 3B  ($  d 3 3(ˎB  ($ )\33 3( 3ˎB  ($A,!t3 3(B  ($ d4 4(B  ($H44444 4( 4ˎ 4,,,,Ŝ,,I{4B  ($A,`,p\4444 4( 4ˎ 4,,,,Ŝ,,I{4B  ($A,`,AD4444 4( 4ˎ 4,,,,Ŝ,,I{4B  ($A,`,d44444 4( 4ˎ 4,,,,Ŝ,,I{4 4B  ($A,`,&,̭44444 4( 4ˎ 4,,,,Ŝ,,I{4 4B  ($A,`, 4f444 4 4 4ÜĜŜƜǜȜ_wKKKK 7K7K736B ;$$L.&&</ <T<=#=AB Ѷ=dBѶ]jFNvHolH44 4 4&řǙșəʙ˙G*R{9 AB H $HDHjq̆j444 4 4 4AB j $j$jk#\ky'/ yATy z#$z4 4AB z $z{"T{4 4 4B { ${|d|4 4ˎB | $|)\44 4 4ˎB  $ t4 4B  $d4 4B  $H44444 4 4ˎ 4,,,,Ŝ,,I{4B  $;`F$$o\4444 4 4ˎ 4,,,,Ŝ,,I{4B  $A`@D4444 4 4ˎ 4,,,,Ŝ,,I{4B  $A`d44444 4 4ˎ 4,,,,Ŝ,,I{4 4B  $A(`3&>̘44444 4 4ˎ 4,,,,Ŝ,,I{4 4B  $AV`a lLؓy44 4 4ÜĜŜƜǜȜ_wؓB  $̑Ѷ$Ǵʴ4444 4ؓ 4ˎ 4,,,,Ŝ,,I{4B $A`ml4444 4ؓ 4ˎ 4,,,,Ŝ,,I{4B ޵$A,`,v4444 4ؓ 4ˎ 4,,,,Ŝ,,I{4B $A,`,44444 4ؓ 4ˎ 4,,,,Ŝ,,I{4 4B $A,`,&,G|4444 4ؓ 4ˎ 4,,,,Ŝ,,I{4B $A,`,<4 4ؓB $Lؓ #$4 4ؓAB  $"T4 4ؓ 4B  $d4 4ؓˎB  $(\44 4ؓ 4ˎB  $A t4 4ؓB  $,Ud4 4ؓB  $,AU,UG44444 4ؓ 4ˎ 4,,,,Ŝ,,I{4B  $A`o\4444 4ؓ 4ˎ 4,,,,Ŝ,,I{4B  $A!`"@D4444 4ؓ 4ˎ 4,,,,Ŝ,,I{4B  $A'`'d44444 4ؓ 4ˎ 4,,,,Ŝ,,I{4 4B  $A0`0&0Еӕ44444 4ؓ 4ˎ 4,,,,Ŝ,,I{4 4B  $A6`6 7ˠ3ΠؓÜĜŜƜǜȜ_wؓB $Ҡ䓮4444 4 4ˎ 4,,,,Ŝ,,I{4B $A =`=! #$4 4AB  $"T5 5 5B  $d5 5ˎB  $(\55 5 5ˎB  $A@ t5 5B  $d5 5B  $G45555 5 5ˎ 5,,,,Ŝ,,I{5B  $AC`Co\5555 5 5ˎ 5,,,,Ŝ,,I{5B  $AH`%H@D5555 5 5ˎ 5,,,,Ŝ,,I{5B  $AyK`Kd55555 5 5ˎ 5,,,,Ŝ,,I{5 5B  $AR`R&R55555 5 5ˎ 5,,,,Ŝ,,I{5 5B  $AU`U U @55ؓ 5 5ÜĜŜƜǜȜ_wؓB  $$     A5555 5 5ˎ 5,,,,Ŝ,,I{5B $A]`]5555 5 5ˎ 5,,,,Ŝ,,I{5B $A)c`4cĕ5555 5 5ˎ 5,,,,Ŝ,,I{5B $A'g`2g`Ast`->`Hir`->`NFA` process. * Parsing a string into an `Ast` gives it a structured representation. Crucially, the size and amount of work done in this step is proportional to the size of the original string. No optimization or Unicode handling is done at this point. This means that parsing into an `Ast` has very predictable costs. Moreover, an `Ast` can be round-tripped back to its original pattern string as written. * Translating an `Ast` into an `Hir` is a process by which the structured representation is simplified down to its most fundamental components. Translation deals with flags such as case insensitivity by converting things like `(?i:a)` to `[Aa]`. Translation is also where Unicode tables are consulted to resolve things like `\p{Emoji}` and `\p{Greek}`. It also flattens each character class, regardless of how deeply nested it is, into a single sequence of non-overlapping ranges. All the various literal forms are thrown out in favor of one common representation. Overall, the `Hir` is small enough to fit into your head and makes analysis and other tasks much simpler. * Compiling an `Hir` into an `NFA` formulates the regex into a finite state machine whose transitions are defined over bytes. For example, an `Hir` might have a Unicode character class corresponding to a sequence of ranges defined in terms of `char`. Compilation is then responsible for turning those ranges into a UTF-8 automaton. That is, an automaton that matches the UTF-8 encoding of just the codepoints specified by those ranges. Otherwise, the main job of an `NFA` is to serve as a byte-code of sorts for a virtual machine. It can be seen as a sequence of instructions for how to match a regex. C9 9D9 <:!T:":#\:$:#,:#T:#:#D:"ç4:!l:!:  An NFA backed bounded backtracker for executing regex searches with capturing groups. This module provides a [`BoundedBacktracker`] that works by simulating an NFA using the classical backtracking algorithm with a twist: it avoids redoing work that it has done before and thereby avoids worst case exponential time. In exchange, it can only be used on "short" haystacks. Its advantage is that is can be faster than the [`PikeVM`](thompson::pikevm::PikeVM) in many cases because it does less book-keeping. B:!:L: !!!!! =     C  $   T "  , #   #  D &  $,   $   L (  \ )  L )  T )  < )  žD -  L ,  , ,  , ,  T -  $ ,  , D , ԣ D svD  hVYGJ ; .1!  B @ = Returns the minimum visited capacity for the given haystack. M J This function can be used as the argument to [`Config::visited_capacity`]J G in order to guarantee that a backtracking search for the given `input`L I won't return an error when using a [`BoundedBacktracker`] built from the given `NFA`.  O L This routine exists primarily as a way to test that the bounded backtracker M J works correctly when its capacity is set to the smallest possible amount. O L Still, it may be useful in cases where you know you want to use the bounded H E backtracker for a specific input, and just need to know what visited ( % capacity to provide to make it work.  N K Be warned that this number could be quite large as it is multiplicative in ( % the size the given NFA and haystack. 777 7 7,,,,Ŝ,,I{7B ' `, \   - * Return a new default regex configuration. B  $< A 6 F 6G 6F 6H 6t 6 I 6C 6H 6G 6H 6| 6 # 6 l / < /̺ /5 2 nfa::thompson::backtrack::BoundedBacktracker,# 6  Input, Match, MatchKind,4 ݥ/ H 6* ' let re = BoundedBacktracker::builder()? < .configure(BoundedBacktracker::config().prefilter(pre))$ 6& ʛ0. 6| 0$ ! Some(Match::must(0, 5..11)),( % re.try_find(&mut cache, input)?,4 0 . Ǭ/< / F 6d 6 < / /5 C# 6$ 64 ݥ/  H 6 * C!? C!$ 6"& ʛ0". 6": 7 // No match reported even though there clearly is one!#6 3 assert_eq!(None, re.try_find(&mut cache, input)?);# #. Ǭ/<$ /L$  B  $$ Ѷ$ 6< %8 5 Set the visited capacity used to bound backtracking.% %K H The visited capacity represents the amount of heap memory (in bytes) to&H E allocate toward tracking which parts of the backtracking search have'I F been done before. The heap memory needed for any particular search is'F C proportional to `haystack.len() * nfa.states().len()`, which an be(J G quite large. Therefore, the bounded backtracker is typically only able(  to run on shorter haystacks.) )E B For a given regex, increasing the visited capacity means that the)B ? maximum haystack length that can be searched is increased. The*I F [`BoundedBacktracker::max_haystack_len`] method returns that maximum.* +E B The default capacity is a reasonable but empirically chosen size.+ l+ /+ +J G As with other regex engines, Unicode is what tends to make the bounded,G D backtracker less useful by making the maximum haystack length quite-K H small. If necessary, increasing the visited capacity using this routine-G D will increase the maximum haystack length at the cost of using more\.  memory.. .D A Note though that the specific maximum values here are not an API/H E guarantee. The default visited capacity is subject to change and not/  covered by semver./ = 25_000);5- * assert!(re.max_haystack_len() <= 28_000);6. Ǭ/<6 /6 B  $6 D7 81 7C 8l8 7 7řǙșəʙ˙G*R{9  7B  8  $8 :+ 9, ) Returns the configured visited capacity.9 9F C Note that the actual capacity used may be slightly bigger than theĩ:  configured capacity.: 7 7B  :  $: : <;  =3 L= 7 7B  >  $>  > >        8dQ ޠ R QK H Create a new BoundedBacktracker builder with its default configuration.R ޠB  Uc S8 5 Build a `BoundedBacktracker` from the given pattern.T TJ /T /U ԓU ,U 77 7ޠ 7B  U  $U N re.try_find_iter(&mut cache, "zzzfoo12345barzzz").next(),4 0. Ǭ/< /   7 7B    N< g I /8 / l / <ŏ /я /5 Ct 04 ݥ/ǐ ϐB ? let re = BoundedBacktracker::new_many(&["[a-z]+", "[0-9]+"])?;& ʛ0 ɑG D let mut it = re.try_find_iter(&mut cache, "abc 1 foo 4567 0 quux");: 7 assert_eq!(Some(Ok(Match::must(0, 0..3))), it.next());Ԓ: 7 assert_eq!(Some(Ok(Match::must(1, 4..5))), it.next());: 7 assert_eq!(Some(Ok(Match::must(0, 6..9))), it.next());ғ< 9 assert_eq!(Some(Ok(Match::must(1, 10..14))), it.next());< 9 assert_eq!(Some(Ok(Match::must(1, 15..16))), it.next());Ԕ< 9 assert_eq!(Some(Ok(Match::must(0, 17..21))), it.next()); 9. Ǭ/< /  D 7 7B    ʖ  /  /T C "G lȗ /ڗ E 0G D compile an NFA from it and build a BoundedBacktracker from the NFA. < /̌ /< 9 nfa::thompson::{NFA, backtrack::BoundedBacktracker},t 04 ݥ/E ބ0Ӛ ۚ; 0) 0ɛ) 0) 0) 0LӜ Ї0 ; 0F 0 4 1 let re = BoundedBacktracker::new_from_nfa(nfa)?;J /. + let expected = Some(Match::must(0, 3..4));7 4 re.try_captures(&mut cache, "!@#A#@!", &mut caps)?;+ Ċ0 . Ǭ/<ޠ /d B  ' ٦? ? < Create a new `BoundedBacktracker` that matches every input. lŢ /ע <ߢ / /5 Ctã 04֣ ݥ/ 1 . let re = BoundedBacktracker::always_match()?;& ʛ0ʤ Ҥ2 / let expected = Some(Ok(Match::must(0, 0..0)));B ? assert_eq!(expected, re.try_find_iter(&mut cache, "").next());ХE B assert_eq!(expected, re.try_find_iter(&mut cache, "foo").next());. Ǭ/<ͦ /d B  > C @ Create a new `BoundedBacktracker` that never matches any input.ͨ lը / < /E אDũ ͩ0 - let re = BoundedBacktracker::never_match()?;& ʛ0 > ; assert_eq!(None, re.try_find_iter(&mut cache, "").next());A > assert_eq!(None, re.try_find_iter(&mut cache, "foo").next());. Ǭ/< /\ B  ́ > ; Return a default configuration for a `BoundedBacktracker`. I ɔ0E B type when customizing the construction of a `BoundedBacktracker`. l / D A This example shows how to disable UTF-8 mode. When UTF-8 mode isD A disabled, zero-width matches that split a codepoint are allowed.& # Otherwise they are never reported. G D In the code below, notice that `""` is permitted to match positions+ ( that split the encoding of a codepoint. < /́ /= : nfa::thompson::{self, backtrack::BoundedBacktracker},t 04 ݥ/ * C6 0 3& ʛ0 ܾ  let haystack = "a☃z";޴8 5 let mut it = re.try_find_iter(&mut cache, haystack);: 7 assert_eq!(Some(Ok(Match::must(0, 0..0))), it.next());ڵ: 7 assert_eq!(Some(Ok(Match::must(0, 1..1))), it.next());: 7 assert_eq!(Some(Ok(Match::must(0, 2..2))), it.next());ض: 7 assert_eq!(Some(Ok(Match::must(0, 3..3))), it.next());: 7 assert_eq!(Some(Ok(Match::must(0, 4..4))), it.next());ַ: 7 assert_eq!(Some(Ok(Match::must(0, 5..5))), it.next()); 9 ¸. Ǭ/< /4 B   : 7 Return a builder for configuring the construction of a  `BoundedBacktracker`. @ 0% 0 l / C 3| 9 < /= / /= Dƽ 0t 04 ݥ/ * C2 06 0& 0ҿJ / 4 9. 96 3 re.try_captures(&mut cache, haystack, &mut caps)?;+ Ċ0 . Ǭ/< /< ޠB  # & # Create a new cache for this regex. @ 0E B regex. If you want to reuse the cache for another regex, then youA > must call [`Cache::reset`] with that regex (or, equivalently,) & [`BoundedBacktracker::reset_cache`]).d 7 7B    $ ) G Ҧ0; 8 valid for the search APIs on this `BoundedBacktracker`. I F A `Captures` value created for a specific `BoundedBacktracker` cannot0 - be used with any other `BoundedBacktracker`. A ߨ0D 0E B constructors that permit the `BoundedBacktracker` to do less work3 0 during a search, and thus might make it faster.| 7 7B    $ , I 0C @ this `BoundedBacktracker` (and only this `BoundedBacktracker`). H 0* ' with a different `BoundedBacktracker`. l / A > This shows how to re-purpose a cache for use with a different̫ D < /= /̟ /5 Ct 04 ݥ/ . + let re1 = BoundedBacktracker::new(r"\w")?;. + let re2 = BoundedBacktracker::new(r"\W")?; ' 0| 0' $ Some(Ok(Match::must(0, 0..2))),3 0 re1.try_find_iter(&mut cache, "Δ").next(),4 0 H ۵0I 0? < // it with the BoundedBacktracker we'd like to use it with.4 ŷ0J ַ0| 0 :| 0' $ Some(Ok(Match::must(0, 0..3))),4 1 re2.try_find_iter(&mut cache, "☃").next(),4 0 . Ǭ/< /\ 77 7 7B    $ A, " ; 8 Returns the total number of patterns compiled into this̊ D I F In the case of a `BoundedBacktracker` that contains no patterns, this returns `0`. l / I F This example shows the pattern length for a `BoundedBacktracker` that  never matches: < /E אD 0 D$ ! assert_eq!(re.pattern_len(), 0);. Ǭ/< / H E And another example for a `BoundedBacktracker` that matches at everyl position: < /E אD 1 D$ ! assert_eq!(re.pattern_len(), 1);. Ǭ/< / J G And finally, a `BoundedBacktracker` that was constructed from multiplel patterns: < /E אD L I let re = BoundedBacktracker::new_many(&["[0-9]+", "[a-z]+", "[A-Z]+"])?;$ ! assert_eq!(re.pattern_len(), 3);. Ǭ/< /\ 7 7B    $ # 4 1 Return the config for this `BoundedBacktracker`.T 8 8 8B    $  . 0< 8 8 8B    $ ' F C Returns the maximum haystack length supported by this backtracker. K H This routine is a function of both [`Config::visited_capacity`] and the+ ( internal size of the backtracker's NFA. l / I F This example shows how the maximum haystack length can vary dependingJ G on the size of the regex itself. Note though that the specific maximumI F values here are not an API guarantee. The default visited capacity is0 - subject to change and not covered by semver. < /= / /5 Cԭ  Match, MatchError,4 ݥ/ 8 5 // If you're only using ASCII, you get a big budget.3 0 let re = BoundedBacktracker::new(r"(?-u)\w+")?;& ʛ0/ , assert_eq!(re.max_haystack_len(), 299_592);!  // Things work up to the max.+ ( let mut haystack = "a".repeat(299_592);8 5 let expected = Some(Ok(Match::must(0, 0..299_592)));I F assert_eq!(expected, re.try_find_iter(&mut cache, &haystack).next());H E // But you'll get an error if you provide a haystack that's too big.D A // Notice that we use the 'try_find_iter' routine instead, which9 6 // yields Result instead of Match.  haystack.push('a');E B let expected = Some(Err(MatchError::haystack_too_long(299_593)));I D G DI D< ֒D. D, ԓDK D* CH Dį D- D- D. Ǭ/< / 8 8B    $   Џ F 9 E B In the case of a backtracking regex engine, and unlike most otherK H regex engines in this crate, short circuiting isn't practical. However,I F this routine may still be faster because it instructs backtracking to+ ( not keep track of any capturing groups. d 1 G D This routine only errors if the search could not complete. For thisH E backtracking regex engine, this only occurs when the haystack length5 2 exceeds [`BoundedBacktracker::max_haystack_len`]. F C When a search cannot complete, callers cannot know whether a match ¥1 l / < /ɂE אD 6 Dփ& ʛ0 9 6 assert!(re.try_is_match(&mut cache, "foo12345bar")?);DŽ5 2 assert!(!re.try_is_match(&mut cache, "foobar")?);. Ǭ/< / ȅ+ 0 G ;̆E ;t 0 < /̽ /ۇ5 Ct ?4 ݥ/ , ) let re = BoundedBacktracker::new("a*")?;& ʛ0 I F assert!(!re.try_is_match(&mut cache, Input::new("☃").span(1..2))?);. Ǭ/< / E 0I 0̋ 0 < /̃ /< 9 nfa::thompson::{backtrack::BoundedBacktracker, NFA},t ?4 ݥ/ * C, 0 0& ʛ0 H E assert!(re.try_is_match(&mut cache, Input::new("☃").span(1..2))?);. Ǭ/< /d׏ 88 8 8ӤſB       0  0| Ӥ$ A` <>,ȑ       پ K H Executes a leftmost forward search and returns a `Match` if one exists. = : This routine only includes the overall match span. To get? < access to the individual spans of each capturing group, useƓ) & [`BoundedBacktracker::try_captures`]. d 1 G EH E5 ܄E F E ¥1Җ lږ / < /̀ /5 Ctؗ 04 ݥ/ 3 0 let re = BoundedBacktracker::new("foo[0-9]+")?;& ʛ0( 1E B assert_eq!(Some(expected), re.try_find(&mut cache, "foo12345")?);ؙ . Ǭ/< /D 88 8 8Ӥׅ B      ޚ  0  0|Ě Ӥ$ߚ A}.`. <> H <F <ΦK < < d 1ҧ ڧG EH E5 ܄E F E ¥1 l / < /Ū /5 Cl ?4 ݥ/ «% " let re = BoundedBacktracker::new(. + r"^([0-9]{4})-([0-9]{2})-([0-9]{2})$",< ę1J / : 7 re.try_captures(&mut cache, "2010-03-14", &mut caps)?; <: <: <; < . Ǭ/<ܯ /d 888 8 8Ӥ 8B       0  0| Ӥ$ A3`3ɾ4 EG ݱH 9J 9 H E If the regex engine returns an error at any point, then the iteratorγ  will yield that error. l / < /̛ /5 C D4 ݥ/ 3 Eݵ& ʛ0 # 93 0 let result: Result, MatchError> = re( % .try_find_iter(&mut cache, text) <Ե  let matches = result?;Է 9 9 9 9<߸ 9. Ǭ/< /l       Ӥ!!! !A !ɾ ! *wI F9  B    ͹  0 ٹ 0|ܹ Ӥ$ A6`6CEѹ չ GI I <7 Ȝ< J G This yields the same matches as [`BoundedBacktracker::try_find_iter`],I F but it includes the spans of all capturing groups that participate in|ľ each match.ؾ H Eԭ E̿ ԿJ Ȟ<J <J <% Ǡ< l / < /̙ /5 Cl ?4 ݥ/ @ = let re = BoundedBacktracker::new("foo(?P[0-9]+)")?;& ʛ0 # 9ܶ  let mut spans = vec![];: 7 for result in re.try_captures_iter(&mut cache, text) {ܕ  let caps = result?;K <? < spans.push(caps.get_group_by_name("numbers").unwrap());, 3  assert_eq!(spans, vec![ ¤<ԑ <ܰ << 9. Ǭ/< /       Ӥ!!! !A !ɾ ! "D  B      0  0| Ӥ$ A9`9CE  GI   H <F <K < < G D This is like [`BoundedBacktracker::try_captures`], but it accepts a2 / concrete `&Input` instead of an `Into`. d 1 G EH E5 ܄E F E ¥1 & 1 D A This example shows how to build a multi bounded backtracker that, ) permits searching for specific patterns. < / /5 C* ' Anchored, Input, Match, PatternID,4 ݥ/ , ) let re = BoundedBacktracker::new_many(&[  "[a-z0-9]{6}",ܩ  "[a-z][a-z0-9]{5}",D 1J / 3 C 3K 3G 3 3. <A > re.try_search(&mut cache, &Input::new(haystack), &mut caps)?;+ Ċ0 J 3" 3. <$ 39 32 /+ Ċ0 . Ǭ/< / 0 1 G ȱ1; 1 < /= / /5 C  Match, Input,4 ݥ/ 7 4 let re = BoundedBacktracker::new(r"\b[0-9]{3}\b")?;J / ص1 E 1F ߶1I 1E 1t Ӹ1. 1H E re.try_search(&mut cache, &Input::new(&haystack[3..6]), &mut caps)?;+ Ċ0 K 1H 1F Ȼ1C 1 1  re.try_search(A > &mut cache, &Input::new(haystack).range(3..6), &mut caps,< ę1+ Ċ0 . Ǭ/< /T 88888 8 8 8,,,,Ŝ,,I{8 8B    $ A<`<ɾ< H <F =K =K =K H then `None` is returned and the contents of all `slots` is unspecified. I F This is like [`BoundedBacktracker::try_search`], but it accepts a rawI F slots slice instead of a `Captures` value. This is useful in contexts: 7 where you don't want or need to allocate a `Captures`. K 1F 1K 16 1 C 1 1A > [`pattern_len() * 2`](crate::nfa::thompson::NFA::pattern_len)K 1d / 1K 1F 1d / d 1 G EH E5 ܄E F E ¥1 l / A 1J 1) 1 < /= /̉ /5 C  PatternID, Input,4 ݥ/ , E =| =D 1& ʛ0% = D 1G 1 1 1C 1. 1 K 1I 1Ђ 11 1" 1ƃ< ڍ=: =Ƅ ΄. Ǭ/< / 88888 8 8 8,,,,Ŝ,,I{8 8B    $ AH`H&H$       $ي       $       $       ԏԓ ד  88888 8 8 8,,,,Ŝ,,I{8 8B    $ A, `, &, <ۗ        Ҟ$         Tœ  88888 8 8 8,,,,Ŝ,,I{8 8B  ֜  $ל A, `, &,  L  88888 8 8 8,,,,Ŝ,,I{8Ç 8B    $ A, `, ʹ  D &,  $  88888 8 8 8,,,,Ŝ,,I{8Ç 8B    $ A,þ `,޾   &, ,        U:8 G 3     QQ    L $   7 $ 8 8B    G3$ <       < G 3     QQ    L $   : $ 8 8ɸB    G3$ <       ȶT  , . + Create a new [`BoundedBacktracker`] cache. > 1E B [`BoundedBacktracker::create_cache`], as it does not require also  importing the `Cache` type. = : If you want to reuse the returned `Cache` with some otherF C `BoundedBacktracker`, then you must call [`Cache::reset`] with the!  desired `BoundedBacktracker`. 8 8B     Ȋ0 J G Reset this cache such that it can be used for searching with different  [`BoundedBacktracker`]. H 0* D l / A D D < /= / /5 Ctʃ 04݃ ݥ/ . D. Dք ބ' 0| 0' Dʅ3 D4 0 H ۵0I 0? D4 ŷ0J ַ0|Έ 0 :| 0' D4 D4 0 . Ǭ/< /,ϊ 88 8 8B  Պ  $ڊ  # ; 1 F 15 1d 8 8B    $  d  8888 8 8 8,,,,Ŝ,,I{8B    $  `,ȓ d  Ȩ TΨ    Ī* Ǫ  8 8B  Ϫ  ˪ 5 4  8 8ÇB    $   + ,  88 8 8B    $    d  8888 8 8 8,,,,Ŝ,,I{8B    $  `, ϶        ۆU: d  8 8B    $ , D  B rhs \:<: !!    K" K  ' =    1 C  Ti "  '$    #  T #   #  $ '  \ (     L )  T )  < )  L R, L H7:D, ,< < b  ; can be quite useful in the construction process of an NFA. d 1 K H This returns an error if the state identifier space is exhausted, or if5 2 the configured heap size limit has been exceeded.L 8 8B    $ k   Add a "union" NFA state. H E A "union" NFA state that contains zero or more unconditional epsilonC @ transitions to other NFA states. The order of these transitionsJ G reflects a priority order where earlier transitions are preferred over  later transitions. K H Callers may provide an empty set of alternates to this method call, andJ G then later add transitions via `patch`. At final build time, a "union"J G state with no alternates is converted to a "fail" state, and a "union"H E state with exactly one alternate is treated as if it were an "empty"T 8 d 1 K F5 FL 8 8B    $ T s $ ! Add a "reverse union" NFA state.ҁ ځK H A "reverse union" NFA state contains zero or more unconditional epsilonC FC @ reflects a priority order where later transitions are preferredE B over earlier transitions. This is an inverted priority order whenJ G compared to `add_union`. This is useful, for example, for implementingӄ$ ! non-greedy repetition operators. K FԅK H then later add transitions via `patch`. At final build time, a "reverseI F union" state with no alternates is converted to a "fail" state, and aH E "reverse union" state with exactly one alternate is treated as if itԿ  were an "empty" state.އ d 1 K Fψ5 F 8 8B    $ T d 俊  Add a "range" NFA state. J G A "range" NFA state is a state with one outgoing transition to anotherJ G state, where that transition may only be followed if the current input. + byte falls between a range of bytes given. d 1Ҍ ڌK F5 FL 8 8B    $ , p 샏  Add a "sparse" NFA state. J G A "sparse" NFA state contains zero or more outgoing transitions, whereI F the transition to be followed (if any) is chosen based on whether theʐE B current input byte falls in the range of one such transition. TheJ G transitions given *must* be non-overlapping and in ascending order. (AH E "sparse" state with no transitions is equivalent to a "fail" state.) H E A "sparse" state is like adding a "union" state and pointing it at aF C bunch of "range" states, except that the different alternates haveГ  equal priority. H E Note that a "sparse" state is the only state that cannot be patched.H E This is because a "sparse" state has many transitions, each of whichB ? may point to a different NFA state. Moreover, adding more suchѕG D transitions requires more than just an NFA state ID to point to. ItH E also requires a byte range. The `patch` routine does not support theH E additional information required. Therefore, callers must ensure thatJ G all outgoing transitions for this state are included when `add_sparse`1 . is called. There is no way to add more later. dĘ 1՘ ݘK F5 F d 0 H E This routine _may_ panic if the transitions given overlap or are not՚  in ascending order.T 8 8B    $ \ s ܟ  Add a "look" NFA state. ǜ> ; A "look" NFA state corresponds to a state with exactly oneE B *conditional* epsilon transition to another NFA state. Namely, itԝF C represents one of a small set of simplistic look-around operators. I F Callers may provide a "dummy" state ID (typically [`StateID::ZERO`]),< 9 and then change it later with [`patch`](Builder::patch). d 1ϟ ןK F5 FD 8 8ÇB    $  $ $  $ ! Add a "start capture" NFA state. G D A "start capture" NFA state corresponds to a state with exactly oneF C outgoing unconditional epsilon transition to another state. UnlikeףC @ "empty" states, a "start capture" state also carries with it anH E instruction for saving the current position of input to a particularG D location in memory. NFA simulations, like the Pike VM, may use thisF C information to report the match locations of capturing groups in a  regex pattern. H E If the corresponding capturing group has a name, then callers should  include it here. I Fާ< F J G Note that unlike `start_pattern`/`finish_pattern`, capturing start andH E end states may be interleaved. Indeed, it is typical for many "startéG D capture" NFA states to appear before the first "end capture" state. d 1 K FD A the configured heap size limit has been exceeded or if the givenɫ$ ! capture index overflows `usize`. E B While the above are the only conditions in which this routine canĬI F currently return an error, it is possible to call this method with anI F inputs that results in the final `build()` step failing to produce anH E NFA. For example, if one adds two distinct capturing groups with theH E same name, then that will result in `build()` failing with an error. D A See the [`GroupInfo`](crate::util::captures::GroupInfo) type for˯A > more information on what qualifies as valid capturing groups. l / J G This example shows that an error occurs when one tries to add multiple< 9 capturing groups with the same name to the same pattern.ñ <˱ /ױ /  nfa::thompson::Builder,"  util::primitives::StateID,4 ݥ/˲ Ӳ1 . let name = Some(std::sync::Arc::from("foo"));% " let mut builder = Builder::new();쳳  builder.start_pattern()?;ճ2 / // 0th capture group should always be unnamed.C @ let start = builder.add_capture_start(StateID::ZERO, 0, None)?;LԴ  // OK? < builder.add_capture_start(StateID::ZERO, 1, name.clone())?;G D // This is not OK, but 'add_capture_start' still succeeds. We don'tG D // get an error until we call 'build' below. Without this call, the+ ( // call to 'build' below would succeed.? < builder.add_capture_start(StateID::ZERO, 2, name.clone())?;9 6 // Finish our pattern so we can try to build the NFA.# builder.finish_pattern(start)?;- * let result = builder.build(start, start);ʸ ; . Ǭ/< / C @ However, adding multiple capturing groups with the same name to  distinct patterns is okay: < /  use std::sync::Arc;ֺ ޺ /= : nfa::thompson::{pikevm::PikeVM, Builder, Transition},| util::{һ  captures::Captures,- * primitives::{PatternID, StateID},T  },l ?4ɼ ݥ/Լ ܼG D // Hand-compile the patterns '(?P[a-z])' and '(?P[A-Z])'.% FҽF C // We compile them to support an unanchored search, which requiresK H // adding an implicit '(?s-u:.)*?' prefix before adding either pattern.? < let unanchored_prefix = builder.add_union_reverse(vec![])?;, ) let any = builder.add_range(Transition {: 7 start: b'\x00', end: b'\xFF', next: StateID::ZERO,D  })?;+ ( builder.patch(unanchored_prefix, any)?;+ ( builder.patch(any, unanchored_prefix)?; F C // Compile an alternation that permits matching multiple patterns.) & let alt = builder.add_union(vec![])?;+ ( builder.patch(unanchored_prefix, alt)?; !  // Compile '(?P[a-z]+)'. FD A let start0 = builder.add_capture_start(StateID::ZERO, 0, None)?;5 2 // N.B. 0th capture group must always be unnamed./ , let foo_start0 = builder.add_capture_start(1 . StateID::ZERO, 1, Some(Arc::from("foo")),< ę12 / let lowercase = builder.add_range(Transition {4 1 start: b'a', end: b'z', next: StateID::ZERO,D F> ; let foo_end0 = builder.add_capture_end(StateID::ZERO, 1)?;: 7 let end0 = builder.add_capture_end(StateID::ZERO, 0)?;& # let match0 = builder.add_match()?;' $ builder.patch(start0, foo_start0)?;* ' builder.patch(foo_start0, lowercase)?;( % builder.patch(lowercase, foo_end0)?;# builder.patch(foo_end0, end0)?;!  builder.patch(end0, match0)?;$ ! builder.finish_pattern(start0)?; !  // Compile '(?P[A-Z]+)'. FD A let start1 = builder.add_capture_start(StateID::ZERO, 0, None)?;5 F/ , let foo_start1 = builder.add_capture_start(1 F< ę12 / let uppercase = builder.add_range(Transition {4 1 start: b'A', end: b'Z', next: StateID::ZERO,D F> ; let foo_end1 = builder.add_capture_end(StateID::ZERO, 1)?;: 7 let end1 = builder.add_capture_end(StateID::ZERO, 0)?;& # let match1 = builder.add_match()?;' $ builder.patch(start1, foo_start1)?;* ' builder.patch(foo_start1, uppercase)?;( % builder.patch(uppercase, foo_end1)?;# builder.patch(foo_end1, end1)?;!  builder.patch(end1, match1)?;$ ! builder.finish_pattern(start1)?; E B // Now add the patterns to our alternation that we started above.  builder.patch(alt, start0)?;  builder.patch(alt, start1)?; I F // Finally build the NFA. The first argument is the anchored startingA > // state (the pattern alternation) where as the second is the9 6 // unanchored starting state (the unanchored prefix).5 2 let nfa = builder.build(alt, unanchored_prefix)?; D A // Now build a Pike VM from our NFA and access the 'foo' captureE B // group regardless of which pattern matched, since it is defined  // for both patterns.( % let vm = PikeVM::new_from_nfa(nfa)?;& # let mut cache = vm.create_cache();  let caps: Vec =< 9 vm.captures_iter(&mut cache, "0123aAaAA").collect();  assert_eq!(5, caps.len()); < 9 assert_eq!(Some(PatternID::must(0)), caps[0].pattern());I F assert_eq!(Some(Span::from(4..5)), caps[0].get_group_by_name("foo")); < 9 assert_eq!(Some(PatternID::must(1)), caps[1].pattern());I F assert_eq!(Some(Span::from(5..6)), caps[1].get_group_by_name("foo")); < 9 assert_eq!(Some(PatternID::must(0)), caps[2].pattern());I F assert_eq!(Some(Span::from(6..7)), caps[2].get_group_by_name("foo")); < 9 assert_eq!(Some(PatternID::must(1)), caps[3].pattern());I F assert_eq!(Some(Span::from(7..8)), caps[3].get_group_by_name("foo")); < 9 assert_eq!(Some(PatternID::must(1)), caps[4].pattern());I F assert_eq!(Some(Span::from(8..9)), caps[4].get_group_by_name("foo")); . Ǭ/< / 8 8ÇB    $  $ \  $  "  Add a "end capture" NFA state. E B A "end capture" NFA state corresponds to a state with exactly oneF FA > "empty" states, a "end capture" state also carries with it anH FG FF F I F< F J FH FG F d 1 K FD F$ F E FI FI FH FH F D FA F| 8 8ÇB    $  $ \ 9   Adds a "fail" NFA state. I F A "fail" state is simply a state that has no outgoing transitions. ItF C acts as a way to cause a search to stop without reporting a match.I F For example, one way to represent an NFA with zero patterns is with aĿ  single "fail" state. d 1 K F5 FD 8 8B    $ ۅ:   Adds a "match" NFA state. C @ A "match" state has no outgoing transitions (just like a "fail"ހF C state), but it has special significance in that if a search entersJ G this state, then a match has been found. The match state that is addedH E automatically has the current pattern ID associated with it. This isł: 7 used to report the matching pattern ID at search time. d 1 K F5 F d 0Ȅ ЄC @ This must be called after a `start_pattern` call but before the> ; corresponding `finish_pattern` call. Otherwise, it panics.L 8 8B    $ >   8 8B    $ ,         /װUl / , Add a transition from one state to another. E B This routine is called "patch" since it is very common to add theJ G states you want, typically with "dummy" state ID transitions, and thenI F "patch" in the real state IDs later. This is because you don't alwaysݍE B know all of the necessary state IDs to add because they might nott exist yet. dŽ 1ӎ ێH E This may error if patching leads to an increase in heap usage beyondI F the configured size limit. Heap usage only grows when patching adds a7 4 new transition (as in the case of a "union" state). d 0ː ӐH E This panics if `from` corresponds to a "sparse" state. When "sparse"K H states are added, there is no way to patch them after-the-fact. (If youI F have a use case where this would be helpful, please file an issue. It# will likely require a new API.), 8 8ÇÇB    $ $ 1 % I F Set whether the NFA produced by this builder should only match UTF-8. ; 8 This should be set when both of the following are true: I F 1. The caller guarantees that the NFA created by this build will only= : report non-empty matches with spans that are valid UTF-8.ПI F 2. The caller desires regex engines using this NFA to avoid reportingJ G empty matches with a span that splits a valid UTF-8 encoded codepoint. E B Property (1) is not checked. Instead, this requires the caller toH E promise that it is true. Property (2) corresponds to the behavior ofF C regex engines using the NFA created by this builder. Namely, thereעG D is no way in the NFA's graph itself to say that empty matches foundH E by, for example, the regex `a*` will fall on valid UTF-8 boundaries.K H Instead, this option is used to communicate the UTF-8 semantic to regexI F engines that will typically implement it as a post-processing step byD A filtering out empty matches that don't fall on UTF-8 boundaries.ץ ߥ: 7 If you're building an NFA from an HIR (and not using aI F [`thompson::Compiler`](crate::nfa::thompson::Compiler)), then you canG D use the [`syntax::Config::utf8`](crate::util::syntax::Config::utf8)J G option to guarantee that if the HIR detects a non-empty match, then it$ ! is guaranteed to be valid UTF-8. G D Note that property (2) does *not* specify the behavior of executingH E a search on a haystack that is not valid UTF-8. Therefore, if you'reѩE B *not* running this NFA on strings that are guaranteed to be validB ? UTF-8, you almost certainly do not want to enable this option.J G Similarly, if you are running the NFA on strings that *are* guaranteedK H to be valid UTF-8, then you almost certainly want to enable this optionJ G unless you can guarantee that your NFA will never produce a zero-widthTЬ  match.߬   It is disabled by default.D 8 8B    $   ֭; 8 Returns whether UTF-8 mode is enabled for this builder. J G See [`Builder::set_utf8`] for more details about what "UTF-8 mode" is.D 8 8B    $ ( F C Sets whether the NFA produced by this builder should be matched inF C reverse or not. Generally speaking, when enabled, the NFA producedK H should be matched by moving backwards through a haystack, from a higher- * memory address to a lower memory address.ñ ˱2 / See also [`NFA::is_reverse`] for more details. H E This is disabled by default, which means NFAs are by default matchedײ  in the forward direction.\ 8 8B    ܆$  ! ˳= : Returns whether reverse mode is enabled for this builder. K H See [`Builder::set_reverse`] for more details about what "reverse mode"<  is.\ 8 8B    $ 2 K H Sets the look-around matcher that should be used for the resulting NFA. B ? A look-around matcher can be used to configure how look-aroundԶ> ; assertions are matched. For example, a matcher might carryH E configuration that changes the line terminator used for `(?m:^)` and  `(?m:$)` assertions. 8 8B    ψ$   . : 7 Returns the look-around matcher used for this builder. I F If a matcher was not explicitly set, then `LookMatcher::default()` isl / 8 8 8B    $ g ޺' $ Set the size limit on this builder. G D Setting the size limit will also check whether the NFA built so far޻E B fits within the given size limit. If it doesn't, then an error isl / ¼2 / By default, there is no configured size limit.t 8 8B    Ê$ , ˿- / , Return the currently configured size limit. G D By default, this returns `None`, which corresponds to no configured| size limit.tҿ 8 8B    $ # I F Returns the heap memory usage, in bytes, used by the NFA states added\  so far. H E Note that this is an approximation of how big the final NFA will be.F C In practice, the final NFA will likely be a bit smaller because ofE B its simpler state representation. (For example, using things like0 - `Box<[StateID]>` instead of `Vec`.)d 8 8B    $ 4   8 8B    $ d::ԟ:D: !!""""""Y4    K  C =    M C  O$r   x   ֺL   Utf8Sequencesl   l   < !  T "  \ "  t "  l #  l #  T #   #  L $  $ '  \ (  L )  < )  $ t l ,0 L8 DH dX X l X. vy, Կ  r c̚ T GJ7:'*       \   = : Return a new default Thompson NFA compiler configuration. B  .* 6 3 Whether to enable UTF-8 mode during search or not. F C A regex engine is said to be in UTF-8 mode when it guarantees that I F all matches returned by it have spans consisting of only valid UTF-8. B ? That is, it is impossible for a match span to be returned that   contains any invalid UTF-8.  0 - UTF-8 mode generally consists of two things:  H E 1. Whether the NFA's states are constructed such that all paths to a I F match state that consume at least one byte always correspond to validT  UTF-8. I F 2. Whether all paths to a match state that do _not_ consume any bytes 7 4 should always correspond to valid UTF-8 boundaries.  : 7 (1) is a guarantee made by whoever constructs the NFA.< 9 If you're parsing a regex from its concrete syntax, thenH E [`syntax::Config::utf8`](crate::util::syntax::Config::utf8) can makeI F this guarantee for you. It does it by returning an error if the regexK H pattern could every report a non-empty match span that contains invalidK H UTF-8. So long as `syntax::Config::utf8` mode is enabled and your regexJ G successfully parses, then you're guaranteed that the corresponding NFAG D will only ever report non-empty match spans containing valid UTF-8. H E (2) is a trickier guarantee because it cannot be enforced by the NFAI F state graph itself. Consider, for example, the regex `a*`. It matchesH E the empty strings in `☃` at positions `0`, `1`, `2` and `3`, whereI F positions `1` and `2` occur within the UTF-8 encoding of a codepoint,D A and thus correspond to invalid UTF-8 boundaries. Therefore, thisE B guarantee must be made at a higher level than the NFA state graphI F itself. This crate deals with this case in each regex engine. Namely,F C when a zero-width match that splits a codepoint is found and UTF-8H E mode enabled, then it is ignored and the engine moves on looking for  the next match. F C Thus, UTF-8 mode is both a promise that the NFA built only reportsI F non-empty matches that are valid UTF-8, and an *instruction* to regexF C engines that empty matches that split codepoints should be banned. K H Because UTF-8 mode is fundamentally about avoiding invalid UTF-8 spans,K H it only makes sense to enable this option when you *know* your haystackD A is valid UTF-8. (For example, a `&str`.) Enabling UTF-8 mode andK H searching a haystack that contains invalid UTF-8 leads to **unspecified| behavior**. G D Therefore, it may make sense to enable `syntax::Config::utf8` whileK H simultaneously *disabling* this option. That would ensure all non-emptyK H match spans are valid UTF-8, but that empty match spans may still splitA > a codepoint or match at other places that aren't valid UTF-8. F C In general, this mode is only relevant if your regex can match the% " empty string. Most regexes don't.    This is enabled by default. l /  I F This example shows how UTF-8 mode can impact the match spans that may!!  be reported in certain cases.! J G Sets an approximate size limit on the total heap used by the NFA beingl> compiled.> >I F This permits imposing constraints on the size of a compiled NFA. This?J G may be useful in contexts where the regex pattern is untrusted and one@) & wants to avoid using too much memory.@ @@ = This size limit does not apply to auxiliary heap used duringA2 / compilation that is not part of the built NFA.A AH E Note that this size limit is applied during compilation in order forBD A the limit to prevent too much heap from being used. However, theBE B implementation may use an intermediate NFA representation that isCH E otherwise slightly bigger than the final public form. Since the sizeCH E limit may be applied to an intermediate representation, there is notDJ G necessarily a precise correspondence between the configured size limitE( % and the heap usage of the final NFA.E E& # There is no size limit by default.E lE /F FG D This example demonstrates how Unicode mode can greatly increase theF  size of the NFA.F  ; .thompson(thompson::Config::new().look_matcher(lookm))!  .build(r"(?m)^[a-z]+$")?;& ʛ0 9 6 // Multi-line assertions now use NUL as a terminator.| 0# Some(Match::must(0, 1..4)),, ) re.find(&mut cache, b"\x00abc\x00"),4 0: 7 // ... and \n is no longer recognized as a terminator.| 0lÆ 6Ն( % re.find(&mut cache, b"\nabc\n"),4 0 . Ǭ/<ȇ /dۇ B  $    > ; Returns whether this configuration has enabled UTF-8 mode.D 8 8B    Ä$ ! K H Returns whether this configuration has enabled reverse NFA compilation.\ 8 8B    $ ǎ1 ލH E Return the configured NFA size limit, if it exists, in the number of  bytes of heap used.Ύ 8 8B    $  , ) Return whether NFA shrinking is enabled.T 8 8B    $ ґ" K H Return whether NFA compilation is configured to produce capture states.Huse get_which_captures instead G dّ HH18 8B    $ 1 E B Return what kinds of capture states will be compiled into an NFA. 8 8B    $ - 0 - Return the look-around matcher for this NFA. 9 9B    $ '   9 9B  ז  Î$ؖ 3 L 9 9B    $           U   ò <Ʋ B    쒴 G D Returns true if this configuration indicates that no capture states!  should be produced in an NFA.< 9 9B    $ 䱶 I F Returns true if this configuration indicates that some capture statesH E should be added to an NFA. Note that this might only include capture' $ states for implicit capture groups.4 9 9B    $ l  Đ < 9 Create a new NFA builder with its default configuration. B  = = : Compile the given regular expression pattern into an NFA. J G If there was a problem parsing the regex, then that error is returned. H E Otherwise, if there was a problem building the NFA, then an error isJ G returned. The only error that can occur is if the compiled regex wouldH E exceed the size limits configured on this builder, or if any part ofH E the NFA would exceed the integer representations used. (For example,> ; too many states might plausibly occur on a 16-bit target.) l / < /F C use regex_automata::{nfa::thompson::{NFA, pikevm::PikeVM}, Match}; ; 0C @ let nfa = NFA::compiler().configure(config).build(r"(?-u)\w")?; ( % let re = PikeVM::new_from_nfa(nfa)?;& ʛ0( 0. D2 / re.captures(&mut cache, "!@#A#@!", &mut caps);+ Ċ0 . Ǭ/< /, 99 9 9B    $ N< i D A Compile the given regular expression patterns into a single NFA. I /# / l / < /F H ; 0= : let nfa = NFA::compiler().configure(config).build_many(&[  r"(?-u)\s",  r"(?-u)\w",D 1 ( H& ʛ0( 0. + let expected = Some(Match::must(1, 1..2));2 / re.captures(&mut cache, "!A! !A!", &mut caps);+ Ċ0 . Ǭ/< /T 99 9 9B      /  /T $ Ѻ"$C I F Compile the given high level intermediate representation of a regularܘ  expression into an NFA. K H If there was a problem building the NFA, then an error is returned. TheG D only error that can occur is if the compiled regex would exceed theK H size limits configured on this builder, or if any part of the NFA wouldJ G exceed the integer representations used. (For example, too many states. + might plausibly occur on a 16-bit target.) l / < /F HE ބ0 ; 0) 0) 0) 0À) 0L Ї0 ; 0ǁF 0 ( Hǂ& ʛ0( 0. D҃2 H+ Ċ0 . Ǭ/< /t 99 9 9B    $ $ p H E Compile the given high level intermediate representations of regularȆ"  expressions into a single NFA. I /Ň# / l / < /F HE ބ0   let hirs = &[Ή5 2 Hir::class(Class::Bytes(ClassBytes::new(vec![/ , ClassBytesRange::new(b'\t', b'\r'),- * ClassBytesRange::new(b' ', b' '),l ]))),5 H- * ClassBytesRange::new(b'0', b'9'),- * ClassBytesRange::new(b'A', b'Z'),- * ClassBytesRange::new(b'_', b'_'),Ќ- * ClassBytesRange::new(b'a', b'z'),l H4 3 ; 0K H let nfa = NFA::compiler().configure(config).build_many_from_hir(hirs)?; ( H& ʛ0( 0ď. H2 H+ Ċ0ސ . Ǭ/< / 99 9 9B    ّ  A  A\Ñ $ڑ (*< > ; Apply the given NFA configuration options to this builder. l / < /+ H ; 0C H% H . Ǭ/<Օ /L 9 9IB    $ 4 ͝e 7 /4 / J /t /̘ ԘH E This syntax configuration only applies when an NFA is built directlyJ G from a pattern string. If an NFA is built from an HIR, then all syntax  settings are ignored. l / < /; 8 use regex_automata::{nfa::thompson::NFA, util::syntax}; = : let syntax_config = syntax::Config::new().unicode(false);ƛB ? let nfa = NFA::compiler().syntax(syntax_config).build(r"\w")?;J G // If Unicode were enabled, the number of states would be much bigger.ܜ% " assert!(nfa.states().len() < 15); . Ǭ/< /4ԝ 9 9ݒIB    $ 4 l  I <  99 9 9B      A  A\ x!#       Ӯ       :   99 9 9B    $ $ ˴ ,ߴ <         ;Uč D  9 9B        P; Q& $  HJG \  99 9 9̯B    $ ,          U        Ič T  9 9B      I  Q0 I& $  <> ,  999 9řǙșəʙ˙G*R{9  9 9B    $ ,  $ $ g d  99 9 9֡AB    $ ΡA  L  99 9 9B    $ $ A4  A  T  99 9 9B    ޒ$ $ A4   ,        ;s l  99 9 9B    $ $ A4 i L  99 9 9B    $ $  ř         AUg d  99 9 9;B    $ ϰ;ȟ l |  99 9 9;B  ¨  $è ϰ;Ѩ ,          ̻U  #  99 9 9;B    $ ϰ; G 4  99 9 9 B    $ anchor4 D L  99 9 9ȚB    $ ,         UčH <  9 9B    $ ,  4 <  9 9B    ُ$ 3 4  9 9B    $ E ,  9 9ÇÇB    $ $ 1 8 l  9 9B    $ c t  9 9ÇB    $  Dƃ Ȅ2 L˄  9 9B  Մ  $ք F L  9 9B  Å  $ą ,ʅ Յ c T  9 9B    $ 4 A D  9 9B  ň  $ƈ $Ј 2 L  9 9B    $ :   9 9B    $    99 9řǙșəʙ˙G*R{9  9B    $ l  $֌ ˎc |Ύ  9 9B    $ l 1 D  9 9B    $ 2 L  9 9B    ǻ$  T  9 9B    $ t١     B   ,  9 9B    $     ţ y     ÜĜŜƜǜȜ_wװB  < , 7 4  9 9B    $ A   99 9 9՝IB    $ 4          U        UA d  9 9B    $ $ Ӯb <֮  9 9B    $ node$ ֱ. Tٱ  99 9 9՝IB    $ 4  L  9 9B    $ : T  9 9ÇB    $  $ ) Dù  9 9B  ̹  $ѹ , |  9 9ÇB    $  $ǻ l  ν0 ѽ  9 9ÇB    $  $ L:,: ""D"  $!"  L8")  "4'"9 9װřǙșəʙ˙G*R{9  92B  '" $'")&"װ g *D"*"999 9װ 9ggg cgcثq1ȡ9B  *" $*" *":::d: """""     =    & C  $N   \^ "  Tk "  # $>#>#$>##D>#J#θ N,#N#θB  DN#P#,P#: :θB  P# $P#S0#$S#:: :θ :B  S# $S#S#U#,U# |U#$U# Yi#Y#:: :θ :B  Y# $Y#Y#$Z#^I#^#: :θÇB  ^# $^#^#$^##D^#<:: #######$ c      *  A4/  4?I  KMK  R=    \C  D"  ç4!  T"  <!  $  d%  \%  L&  t&  $'  \(  <(    L)  l*  T)  <)  L-  $@C25,T#)t7 LGDWic$('=<SR,6JDwzgjWZGJ7:+DD J4DH2̑E build an NFA from it.EE=: If you want a non-default configuration, then use the NFAE# [`Compiler`] with a [`Config`].FlF/F Returns an iterator over all pattern identifiers in this NFA.xxEB Pattern IDs are allocated in sequential order starting from zero,yHE where the order corresponds to the order of patterns provided to they" [`NFA::new_many`] constructor.zlz/z; let nfa = NFA::new_many(&["[0-9]+", "[a-z]+", "[A-Z]+"])?;{85 let pids: Vec = nfa.patterns().collect();ԑ| assert_eq!(pids, vec![ܰ| PatternID::must(0),| PatternID::must(1),| PatternID::must(2),<}9}}.Ǭ/<}/D}: :$$$ $  66\:B  } $}";8 Returns the total number of regex patterns in this NFA.HE This may return zero if the NFA was constructed with no patterns. In?< this case, the NFA can never produce a match for any input.HE This is guaranteed to be no bigger than [`PatternID::LIMIT`] becausé>; NFA construction will fail if too many patterns are added.IF It is always true that `nfa.patterns().count() == nfa.pattern_len()`.l/</+Hẵ>J%" assert_eq!(3, nfa.pattern_len());! let nfa = NFA::never_match();%" assert_eq!(0, nfa.pattern_len());" let nfa = NFA::always_match();%" assert_eq!(1, nfa.pattern_len());.Ǭ/</\Ɔ: :B  ҆ $ӆ'JG Return the state identifier of the initial anchored state of this NFA.FC The returned identifier is guaranteed to be a valid index into theFC slice returned by [`NFA::states`], and is also a valid argument to [`NFA::state`].l/GD This example shows a somewhat contrived example where we can easily(% predict the anchored starting state.</ƊC@ use regex_automata::nfa::thompson::{NFA, State, WhichCaptures};얋/EB .configure(NFA::config().which_captures(WhichCaptures::None)) .build("a")?;0- let state = nfa.state(nfa.start_anchored());ь match *state {'$ State::ByteRange { trans } => {*' assert_eq!(b'a', trans.start);Í(% assert_eq!(b'a', trans.end);L3.+ _ => unreachable!("unexpected state"),,3Î.Ǭ/</t: :ÇB   ߅$)GD Return the state identifier of the initial unanchored state of thisD0Đ41 This is equivalent to the identifier returned byJG [`NFA::start_anchored`] when the NFA has no unanchored starting state.̑ԑFJF؞JJl/GD This example shows that the anchored and unanchored starting states1. are equivalent when an anchored NFA is built.</+H let nfa = NFA::new("^a")?;=: assert_eq!(nfa.start_anchored(), nfa.start_unanchored());וߕ.Ǭ/</: :ÇB  Ė $Ŗ>KH Return the state identifier of the initial anchored state for the givenӗHE pattern, or `None` if there is no pattern corresponding to the given| identifier.JG If one uses the starting state for a particular pattern, then the only@= match that can be returned is for the corresponding pattern.ЙؙFJF؞JJd1IF If the pattern doesn't exist in this NFA, then this returns an error.;8 This occurs when `pid.as_usize() >= nfa.pattern_len()`.l/ϜלGJ1Jٝ</8J,) let nfa = NFA::new_many(&["^a", "^b"])?;JG // The anchored and unanchored states for the entire NFA are the same,.+ // since all of the patterns are anchored.=JFC // But the anchored starting states for each pattern are distinct,EB // because these starting states can only lead to matches for the켡 // corresponding pattern.ޡ.+ let anchored = Some(nfa.start_anchored());@= assert_ne!(anchored, nfa.start_pattern(PatternID::must(0)));֢@= assert_ne!(anchored, nfa.start_pattern(PatternID::must(1)));?< // Requesting a pattern not in the NFA will result in None:ߣ<9 assert_eq!(None, nfa.start_pattern(PatternID::must(2)));.Ǭ/<ۤ/l: :B   $:4t: : :B   $*ݬ&# Get the byte classes for this NFA.EB Byte classes represent a partitioning of this NFA's alphabet intoڭHE equivalence classes. Any two bytes in the same equivalence class areIF guaranteed to never discriminate between a match or a non-match. (The%" partitioning may not be minimal.)FC Byte classes are used internally by this crate when building DFAs.GD Namely, among other optimizations, they enable a space optimizationEB where the DFA's internal alphabet is defined over the equivalenceGD classes of bytes instead of all possible byte values. The former isԱKH often quite a bit smaller than the latter, which permits the DFA to use(% less space for its transition table.Ѳlٲ/?< This example shows how to query the class of various bytes.</˳+H" let nfa = NFA::new("[a-z]+")?;%" let classes = nfa.byte_classes();Դ85 // 'a' and 'z' are in the same class for this regex.52 assert_eq!(classes.get(b'a'), classes.get(b'z'));˵ // But 'a' and 'A' are not.52 assert_ne!(classes.get(b'a'), classes.get(b'A'));.Ǭ/</d: : :B   $*ӷFC Return a reference to the NFA state corresponding to the given ID.96 This is a convenience routine for `nfa.states()[id]`.d0KH This panics when the given identifier does not reference a valid state.չ85 That is, when `id.as_usize() >= nfa.states().len()`.l/C@ The anchored state for a pattern will typically correspond to aC@ capturing state for that pattern. (Although, this is not an API|Ļ guarantee!)ػ</A> use regex_automata::{nfa::thompson::{NFA, State}, PatternID};캼 let nfa = NFA::new("a")?;ܼGD let state = nfa.state(nfa.start_pattern(PatternID::ZERO).unwrap());J(% State::Capture { slot, .. } => {+( assert_eq!(0, slot.as_usize());L3.J,ݾ3.Ǭ/</,ÿ: :Ç :ȽB  ɿ $ʿC= .+ Returns a slice of all states in this NFA.JG The slice returned is indexed by `StateID`. This provides a convenientHE way to access states while following transitions among those states.l/JG This demonstrates that disabling UTF-8 mode can shrink the size of theKH NFA considerably in some cases, especially when using Unicode characterd classes.</=/+H'$ let nfa_unicode = NFA::new(r"\w")?;*' let nfa_ascii = NFA::new(r"(?-u)\w")?;.+ // Yes, a factor of 45 difference. No lie.HE assert!(40 * nfa_ascii.states().len() < nfa_unicode.states().len());.Ǭ/</4: : :B   ¸$&2/ Returns the capturing group info for this NFA.EB The [`GroupInfo`] provides a way to map to and from capture indexFC and capture name for each pattern. It also provides a mapping fromHE each of the capturing groups in every pattern to their corresponding63 slot offsets encoded in [`State::Capture`] states.GD Note that `GroupInfo` uses reference counting internally, such that(% cloning a `GroupInfo` is very cheap.l/GD This example shows how to get a list of all capture group names for̆ a particular pattern.</8J:7 let nfa = NFA::new(r"(a)(?Pb)(c)(d)(?Pe)")?;GD // The first is the implicit group that is always unnamed. The nextKH // 5 groups are the explicit groups found in the concrete syntax above.JG let expected = vec![None, None, Some("foo"), None, None, Some("bar")];  let got: Vec> =B? nfa.group_info().pattern_names(PatternID::ZERO).collect();3B? // Using an invalid pattern ID will result in nothing yielded.KH let got = nfa.group_info().pattern_names(PatternID::must(999)).count(); assert_eq!(0, got);.Ǭ/</T: : :B   $!96 Returns true if and only if this NFA has at least one:7 [`Capture`](State::Capture) in its sequence of states.EB This is useful as a way to perform a quick test before attemptingHE something that does or does not require capture states. For example,KH some regex engines (like the PikeVM) require capture states in order to work at all.l/JG This example shows a few different NFAs and whether they have captures\ or not.</<H$! // Obviously has capture states. let nfa = NFA::new("(a)")?; assert!(nfa.has_capture());FC // Less obviously has capture states, because every pattern has atKH // least one anonymous capture group corresponding to the match for the // entire pattern.JJKH // Other than hand building your own NFA, this is the only way to buildKH // an NFA without capturing groups. In general, you should only do thisHE // if you don't intend to use any of the NFA-oriented regex engines.IF // Overall, capturing groups don't have many downsides. Although theyJG // can add a bit of noise to simple NFAs, so it can be nice to disable# // them for debugging purposes.4ŷ0C@ // Notice that 'has_capture' is false here even when we have an-* // explicit capture group in the pattern./EJ .build("(a)")?;  assert!(!nfa.has_capture());.Ǭ/</\: :B   $DA Returns true if and only if this NFA can match the empty string.HE When it returns false, all possible matches are guaranteed to have a non-zero length.HE This is useful as cheap way to know whether code needs to handle theJG case of a zero length match. This is particularly important when UTF-8HE modes are enabled, as when UTF-8 mode is enabled, empty matches thatEB split a codepoint must never be reported. This extra handling canGD sometimes be costly, and since regexes matching an empty string areHE somewhat rare, it can be beneficial to treat such regexes specially.l/FC This example shows a few different NFAs and whether they match theFC empty string or not. Notice the empty string isn't merely a matterHE of a string of length literally `0`, but rather, whether a match can*' occur between specific pairs of bytes.</;I0- // The empty regex matches the empty string. let nfa = NFA::new("")?;41 assert!(nfa.has_empty(), "empty matches empty");FC // The '+' repetition operator requires at least one match, and so'$ // does not match the empty string. let nfa = NFA::new("a+")?;85 assert!(!nfa.has_empty(), "+ does not match empty");,) // But the '*' repetition operator does. let nfa = NFA::new("a*")?;30 assert!(nfa.has_empty(), "* does match empty");JG // And wrapping '+' in an operator that can match an empty string also/, // causes it to match the empty string too.! let nfa = NFA::new("(a+)*")?;<9 assert!(nfa.has_empty(), "+ inside of * matches empty");FC // If a regex is just made of a look-around assertion, even if theJG // assertion requires some kind of non-empty string around it (such asGD // \b), then it is still treated as if it matches the empty string.JG // Namely, if a match occurs of just a look-around assertion, then the // match returned is empty./20)& .build(r"^$\A\z\b\B(?-u:\b\B)")?;74 assert!(nfa.has_empty(), "assertions match empty");GD // Even when an assertion is wrapped in a '+', it still matches the // empty string.  let nfa = NFA::new(r"\b+")?;@= assert!(nfa.has_empty(), "+ of an assertion matches empty");JG // An alternation with even one branch that can match the empty string63 // is also said to match the empty string overall.+( let nfa = NFA::new("foo|(bar)?|quux")?;=: assert!(nfa.has_empty(), "alternations can match empty");C@ // An NFA that matches nothing does not match the empty string." let nfa = NFA::new("[a&&b]")?;IF assert!(!nfa.has_empty(), "never matching means not matching empty");GD // But if it's wrapped in something that doesn't require a match at/, // all, then it can match the empty string!# let nfa = NFA::new("[a&&b]*")?;EB assert!(nfa.has_empty(), "* on never-match still matches empty");IF // Since a '+' requires a match, using it on something that can neverGD // match will itself produce a regex that can never match anything,0- // and thus does not match the empty string.# let nfa = NFA::new("[a&&b]+")?;HE assert!(!nfa.has_empty(), "+ on never-match still matches nothing");.Ǭ/</L: :B   $엑63 Whether UTF-8 mode is enabled for this NFA or not.FC When UTF-8 mode is enabled, all matches reported by a regex engineHE derived from this NFA are guaranteed to correspond to spans of valid̀JG UTF-8. This includes zero-width matches. For example, the regex engineGD must guarantee that the empty regex will not match at the positionsC@ between code units in the UTF-8 encoding of a single codepoint..+ See [`Config::utf8`] for more information.Gl/IG!G<//߄.GźE4ݥ/GJ/(G&3-GÇ=GDGֈGG̢GG܉-G=GЊ؊HGGȋ60?-GΌ=GG-G=GG̎-G=GȏG-G'/ʐ.Ǭ/</<: :B   $ ֑A> Returns true when this NFA is meant to be matched in reverse.JG Generally speaking, when this is true, it means the NFA is supposed toKH be used in conjunction with moving backwards through the haystack. ThatÓ?< is, from a higher memory address to a lower memory address.FC It is often the case that lower level routines dealing with an NFAڔKH don't need to care about whether it is "meant" to be matched in reverseHE or not. However, there are some specific cases where it matters. ForFC example, the implementation of CRLF-aware `^` and `$` line anchors–A> needs to know whether the search is in the forward or reverseIF direction. In the forward direction, neither `^` nor `$` should match֗HE when a `\r` has been seen previously and a `\n` is next. However, inGD the reverse direction, neither `^` nor `$` should match when a `\n`KH has been seen previously and a `\r` is next. This fundamentally changesFC how the state machine is constructed, and thus needs to be altered)& based on the direction of the search.LI This is automatically set when using a [`Compiler`] with a configurationIF where [`Config::reverse`] is enabled. If you're building your own NFAߛ by hand via a [`Builder`]T: :B   $.ԜKH Returns true if and only if all starting states for this NFA correspond+( to the beginning of an anchored search.ԝܝKH Typically, an NFA will have both an anchored and an unanchored startingJG state. Namely, because it tends to be useful to have both and the costGD of having an unanchored starting state is almost zero (for an NFA).ǟJG However, if all patterns in the NFA are themselves anchored, then evenGD the unanchored starting state will correspond to an anchored search30 since the pattern doesn't permit anything else.l/DA This example shows a few different scenarios where this method'są return value varies.</+HKH // The unanchored starting state permits matching this pattern anywhere74 // in a haystack, instead of just at the beginning.J-* assert!(!nfa.is_always_start_anchored());Τ֤GD // In this case, the pattern is itself anchored, so there is no way# // to run an unanchored search.ʥӪJ,) assert!(nfa.is_always_start_anchored());KH // When multiline mode is enabled, '^' can match at the start of a lineIF // in addition to the start of a haystack, so an unanchored search isħ // actually possible." let nfa = NFA::new("(?m)^a")?;-KèJG // Weird cases also work. A pattern is only considered anchored if all96 // matches may only occur at the start of a haystack.Щ" let nfa = NFA::new("(^a)|a")?;-KIF // When multiple patterns are present, if they are all anchored, then&# // the NFA is always anchored too.2/ let nfa = NFA::new_many(&["^a", "^b", "^c"])?;,KDA // But if one pattern is unanchored, then the NFA must permit an // unanchored search.1. let nfa = NFA::new_many(&["^a", "b", "^c"])?;-K.Ǭ/</Ů: :B  ޮ $߮*=: Returns the look-around matcher associated with this NFA.IH˰EHKH/H@= If the NFA was built using a [`Compiler`], then this matcher=: can be set via the [`Config::look_matcher`] configurationB? knob. Otherwise, if you've built an NFA by hand, it is set via" [`Builder::set_look_matcher`].l/KH</̜/.G HźE4ݥ/'H'HG·>H!H&ʛ0ָ޸9H|0#Hع,H40:H|Ӻ0l6(H40.Ǭ/</d: : :B   $%ۼHE Returns the union of all look-around assertions used throughout thisGD NFA. When the returned set is empty, it implies that the NFA has noIF look-around assertions and thus zero conditional epsilon transitions.¾ʾB? This is useful in some cases enabling optimizations. It is notGD unusual, for example, for optimizations to be of the form, "for anyݿHE regex with zero conditional epsilon transitions, do ..." where "..."! is some kind of optimization.KH This isn't only helpful for optimizations either. Sometimes look-aroundIF assertions are difficult to support. For example, many of the DFAs inIF this crate don't support Unicode word boundaries or handle them usingGD heuristics. Handling that correctly typically requires some kind ofKH cheap check of whether the NFA has a Unicode word boundary in the firstT place.l/JG This example shows how this routine varies based on the regex pattern:</?< use regex_automata::{nfa::thompson::NFA, util::look::Look}; // No look-around at all.J+( assert!(nfa.look_set_any().is_empty());HE // When multiple patterns are present, since this returns the union,EB // it will include look-around assertions that only appear in one| // pattern.63 let nfa = NFA::new_many(&["a", "b", "a^b", "c"])?;63 assert!(nfa.look_set_any().contains(Look::Start));EB // Some groups of assertions have various shortcuts. For example:%" let nfa = NFA::new(r"(?-u:\b)")?;0- assert!(nfa.look_set_any().contains_word());96 assert!(!nfa.look_set_any().contains_word_unicode());63 assert!(nfa.look_set_any().contains_word_ascii());.Ǭ/</d: :B   $,DA Returns the union of all prefix look-around assertions for everyKH pattern in this NFA. When the returned set is empty, it implies none ofHE the patterns require moving through a conditional epsilon transition52 before inspecting the first byte in the haystack.JG This can be useful for determining what kinds of assertions need to beGD satisfied at the beginning of a search. For example, typically DFAsHE in this crate will build a distinct starting state for each possibleFC starting configuration that might result in look-around assertionsEB being satisfied differently. However, if the set returned here isHE empty, then you know that the start state is invariant because there74 are no conditional epsilon transitions to consider.l/JK</?KKJ2/ assert!(nfa.look_set_prefix_any().is_empty());HKEKJG // pattern. But it will only include assertions that are in the prefixKH // of a pattern. For example, this includes '^' but not '$' even though // '$' does appear.74 let nfa = NFA::new_many(&["a", "b", "^ab$", "c"])?;=: assert!(nfa.look_set_prefix_any().contains(Look::Start));<9 assert!(!nfa.look_set_prefix_any().contains(Look::End));.Ǭ/</: :B   $#41 Returns the memory usage, in bytes, of this NFA.DA This does **not** include the stack size used up by this NFA. To30 compute that, use `std::mem::size_of::()`.l/IF This example shows that large Unicode character classes can use quite a bit of memory.</=/+H'J+( let nfa_ascii = NFA::new(r"(?-u:\w)")?;HE assert!(10 * nfa_ascii.memory_usage() < nfa_unicode.memory_usage());.Ǭ/</d: :B   $<g8::: : :ggg cgcثq1ȡ:B  $ T̖Ի'D ԻB $-T : :Ի :B $5 : :ԻȽÇB  $,T :: :ԻÇÇ :B  $t֠l,D : :ԻB  $/\ : :ԻB  $9 : :ԻB  $ ~d :: :Ի :B  $D،̊̊ϊЊD^)cO΃řǙșəʙ˙G*R{9 UUK6, :: :Ի :B  $ old_to_newTԻg8::: :Ի :ggg cgcثq1ȡ:B  $ TȽϙ GD Returns true if and only if this state contains one or more epsilonܑ transitions.HE In practice, a state has no outgoing transitions (like `Match`), hasƒGD only non-epsilon transitions (like `ByteRange`) or has only epsilon transitions (like `Union`).l/Г<ؓ//+( nfa::thompson::{State, Transition},;8 util::primitives::{PatternID, StateID, SmallIndex},4ݥ/.+ // Capture states are epsilon transitions.  let state = State::Capture {ݕ next: StateID::ZERO,$! pattern_id: PatternID::ZERO,&# group_index: SmallIndex::ZERO,Җ slot: SmallIndex::ZERO,4ݥ/  assert!(state.is_epsilon());  // ByteRange states are not.ӗ" let state = State::ByteRange {JG trans: Transition { start: b'a', end: b'z', next: StateID::ZERO },4ɘݥ/Ԙ! assert!(!state.is_epsilon());.Ǭ/</T֙: :ȽB  $d : :ȽB  $Τ&,Ѥ :: :Ƚ :B פ $ܤ ,̽Ƚgݭ8::: :Ƚ :ggg cgcثq1ȡ:B  $ U$͊UD?< This follows the matching transition for a particular byte.C@ The matching transition is found by looking for a matching byteFC range (there is at most one) corresponding to the position `at` in| `haystack`.85 If `at >= haystack.len()`, then this returns `None`.<:: : :ȚB  mll$ad: :B  $$4IU7?LIF The matching transition is found by looking for a matching byte range;8 (there is at most one) corresponding to the byte given.d: :B $!qD?LEB The matching transition is found by looking for a transition thatEB doesn't correspond to `StateID::ZERO` for the byte `at` the given position in `haystack`.8L<:: : :ȚB  Hw2v Returns true if the position `at` in `haystack` falls in this  transition's range of bytes.96 If `at >= haystack.len()`, then this returns `false`.<;; ; ;ȚB  $D$ϗK8FC Returns true if the given alphabet unit falls in this transition'sKH range of bytes. If the given unit is [`EOI`](alphabet::Unit::eoi), then this returns `false`.d; ;B  $$4IUK,FC Returns true if the given byte falls in this transition's range ofT bytes.d; ;B $$g8;;; ; ;ggg cgcثq1ȡ;B  $ L܂%QQL$'$; ;B  $t: An NFA backed Pike VM for executing regex searches with capturing groups. This module provides a [`PikeVM`] that works by simulating an NFA and resolving all spans of capturing groups that participate in a match.  nfa-pikevm::4:$$$$$$$$$=C$ T",##D&$,$L(\)L)T)<)žD-L,,,,,ӿL-̼T-$,L-,D,DDsvgZ]JM:=*- # T     , 8fun & 8$ *   +   8   8<  7   8 8L &  8 84 8,    8 8D   8 , 8L % 8COUNTERSD  8with$     8 &  8<  8D   8L    8  8  8 borrow_mutT   % % \.+ Return a new default PikeVM configuration.B 6$/I/F/H/3ݒ/B/H/FC where all possible matches are visited in the NFA by the `PikeVM`.E6H6K6I6C@ strategy. Specifically, `LeftmostFirst` results in the `PikeVM`HE simulating dead states as a way to terminate the search and report aFC match. `LeftmostFirst` also supports non-greedy matches using this%" strategy where as `All` does not.TB $$0<A6F6G6 F6!H6t!6!!I6"C6#H6#G6$H6|$6%%#6%l%/%<%/%/%&J&#6& C4&ݥ/''H6'G'30 .configure(PikeVM::config().prefilter(pre))($6(&ʛ0).6)HE assert_eq!(Some(Match::must(0, 5..11)), re.find(&mut cache, input));**.Ǭ/<*/**F6d+6+<+/+/+&J,#6,$64,ݥ/,,H6-G-3ɵL.$6.&ʛ0..6/:D/1. assert_eq!(None, re.find(&mut cache, input));00.Ǭ/<0/L0 B $0Ѷ02)1:/t2; ;B 2 $2313C8l3; ;řǙșəʙ˙G*R{9  ;B 3 $363L6; ;B 6 $6 678dIII?< Create a new PikeVM builder with its default configuration.IB L@K,) Build a `PikeVM` from the given pattern.KKJ/L/LL,L;; ; ;B L $LNwKƐEK0GD individual spans of each capturing group, use [`PikeVM::captures`].l/D1G1G؄1K1&1K1H1F1C1F1 ׉1</?I'$ let re = PikeVM::new("foo[0-9]+")?;&ʛ0(1@1G1JԌ1H1# let re = PikeVM::new("abc|a")?;&ʛ0(1;1.Ǭ/</$;; ; ;ӤB 0 0| Ӥ$A`<>H<F<K<<l/</>; use regex_automata::{nfa::thompson::pikevm::PikeVM, Span};A> let re = PikeVM::new(r"^([0-9]{4})-([0-9]{2})-([0-9]{2})$")?;J/52 re.captures(&mut cache, "2010-03-14", &mut caps);<:<:<;<.Ǭ/</D;;; ; ;Ӥ ;B 0 0| Ӥ$A`ɾEGH9J9l/</?I'M&ʛ0#9G9܁999Â9<9.Ǭ/</Lǃ  Ӥ$$$$A$ɾ$J%5΅Bу0 ݃0| Ӥ$Ar`}CEՃكGII<7Ȝ<JG This yields the same matches as [`PikeVM::find_iter`], but it includesE<ƈJȞ<J<J<%Ǡ<݊l/</>M΋֋41 let re = PikeVM::new("foo(?P[0-9]+)")?;&ʛ0Œ#9<(% .captures_iter(&mut cache, text)K<?Σ<ώ<9̉¤<ԧ<Ə<<9.Ǭ/</lƐ  Ӥ$$$$A$ɾ$ՎpBԐ0 0| Ӥ$AG`RCEؐܐGI\ŭvH<ۓF<K<<IF This is like [`PikeVM::captures`], but it accepts a concrete `&Input` <&1ǖIF This example shows how to build a multi-PikeVM that permits searchingԕ3</ȗ/&J*<4ݥ/˘ӘEB let re = PikeVM::new_many(&["[a-z0-9]{6}", "[a-z][a-z0-9]{5}"])?;J/3C3ݚK3G33.<<9 re.search(&mut cache, &Input::new(haystack), &mut caps);+Ċ0J3"3.<$393ʟ-G+Ċ0.Ǭ/</01Gȱ1;1Ģ<̢/آ=/FC use regex_automata::{nfa::thompson::pikevm::PikeVM, Match, Input};+( let re = PikeVM::new(r"\b[0-9]{3}\b")?;J/ص1E1F߶1I1E1tŧӸ1ا.1C@ re.search(&mut cache, &Input::new(&haystack[3..6]), &mut caps);Ө+Ċ0K1۩H1FȻ1C1Ļ1ث1=-G+Ċ0.Ǭ/</4̭;;;;; ; ; ;,,,,Ŝ,,I{; ;B ܭ$ݭA5`@ɾKͯH<F=K=K=G=ѲٲEB This is like [`PikeVM::search`], but it accepts a raw slots sliceG101K1F1ǵK161ҶڶC11AEK1dϸ/1K1ǹF1d/l/źA1J1ڻ)1</=/޼JG use regex_automata::{nfa::thompson::pikevm::PikeVM, PatternID, Input};  let re = PikeVM::new_many(&[ڽ=|=D1&ʛ0%=D1G111>; let pid = re.search_slots(&mut cache, &input, &mut slots);.1K1I1111"1<ڍ=:=.Ǭ/</d;;;;; ; ; ;,,,,Ŝ,,I{; ;B $A#`.&9$$;;;;; ; ; ;,,,,Ŝ,,I{; ;B $A,`,&,<Ε$F4E4EB position and this `PikeVM` was configured with [`MatchKind::All`]G=B? Unless all of the patterns in this `PikeVM` are anchored, thenC@ generally speaking, this will visit every byte in the haystack.I4G4H4F44D4I4d4l/G4I4</=//&J%44ݥ/4F443G?< .configure(PikeVM::config().match_kind(MatchKind::All))4&ʛ0%47=B? re.which_overlapping_matches(&mut cache, &input, &mut patset);'4H43.Ǭ/</;;;;; ; ; ;,,,,Ŝ,,I{; ;B ʔ$A`  \T;;;;; ; ; ;,,,,Ŝ,,I{; ;B  $A,`,&,ƺɺ;;;;; ; ; ;,,,,Ŝ,,I{; ;B $A,`, 4,;;;;;;; ; ; ; ; ;,,,,Ŝ,,I{; ;B  $,$ $`,&,;;;;;;; ; ; ; ; ;,,,,Ŝ,,I{; ;B  $,$ $`, 4$;;;;;; ; ; ; ; ;,,,,Ŝ,,I{;ÇB  $,curr_slot_table| $`,҂|Ղ;;;;;; ; ; ; ; ;,,,,Ŝ,,I{;ÇB  $, curr_slotsT $Ճ`,;;;;;; ; ; ; ; ;,,,,Ŝ,,I{;ÇB Ӕ $Ԕ,MT $`,ەDd;;; ; ;,,,,Ŝ,,I{;řǙșəʙ˙G*R{9 ÇB ˹ $̹`,ҹ5G3QQL$#$; ;B  G3$<9G3QQL$&$; ;B  G3$<T " Create a new [`PikeVM`] cache.>1GD [`PikeVM::create_cache`], as it does not require also importing the1GD If you want to reuse the returned `Cache` with some other `PikeVM`,B? then you must call [`Cache::reset`] with the desired `PikeVM`.< <B  $B1̵ different [`PikeVM`].H0Ll/KL</=/?I"L"L'0|0#0/L40H۵0I03L4ŷ0Jַ0|0:|0#00L40.Ǭ/</,<< < <B  $#;1F151d< <B  $<4d< <B  $captures_slot_len#< <B   ,<< < <B  $d< <B  $4d< <B Ȉ $͈Mӈtė̘ϘB  ,<< < <B  $ U:d< <B  $4d< <B  $MCL< <Ç <B  $6T< < <B  $t:::T: $$$$$%%%<404c 4t4A4445I5=5CֺL5<5)$4l4̜4,4t4D5l5\5 M6,6Ç7$7ÇtL̯MMB Q,Q< <B Q $QSp$S< <ÜĜŜƜǜȜ_wB TN S S<# <՝IS$<#߁NNlT N$T Ttvprb.4c<< < <՝IB c $c4c},< <Ç̻ÇU &LȘ< <ÇB Ҙ $ט3L< <ÇÇB  $4yt< <Ç̻ÇB  $from_id<ϱٜ,<< <Ç̻ÇB  $ ޅN<ٜ,ڴ<Զ׶< <Ç̻ÇB  $ ޅN<ٜ,<˷&,< <Ç <B  $C2L< <Ç <B  $CT)$< <̻B  $ٜ,fl< <B  N <# <<#N$ xspred$uwy{ U,< <B  $|=<Ç <՝IB  #D4 z$<<< < <½ <՝IÇB  trie$,4D< <ÇB  $ 4< < <՝IB  $Tބ3̻̻řǙșəʙ˙G*R{9 B   Æ̻UЕNU ĕNNNNN"4B r1И24ӘB Nژr2B4B NNr3#D< < < B Ü $Ĝ식g8<<< < <ggg cgcثq1ȡ<B  $ ܟg8<<< < <ggg cgcثq1ȡ<B  $ Ug8<<< < <ggg cgcثq1ȡ<B  $ 3T̻̻B NN$:::<:ޜӜלȜ̜D::Դ:ќœ.,՜ƜECٜd2 ; A collection of modules that provide APIs that are useful across many regex engines. While one should explore the sub-modules directly to get a sense of what's there, here are some highlights that tie the sub-modules to higher level use cases: * `alphabet` contains APIs that are useful if you're doing low level things with the DFAs in this crate. For example, implementing determinization or walking its state graph directly. * `captures` contains APIs for dealing with capture group matches and their mapping to "slots" used inside an NFA graph. This is also where you can find iterators over capture group names. * `escape` contains types for pretty-printing raw byte slices as strings. * `iter` contains API helpers for writing regex iterators. * `lazy` contains a no-std and no-alloc variant of `lazy_static!` and `once_cell`. * `look` contains APIs for matching and configuring look-around assertions. * `pool` provides a way to reuse mutable memory allocated in a thread safe manner. * `prefilter` provides APIs for building prefilters and using them in searches. * `primitives` are what you might use if you're doing lower level work on automata, such as walking an NFA state graph. * `syntax` provides some higher level convenience functions for interacting with the `regex-syntax` crate. * `wire` is useful if you're working with DFA serialization. $2 ; This module provides APIs for dealing with the alphabets of finite state machines. There are two principal types in this module, [`ByteClasses`] and [`Unit`]. The former defines the alphabet of a finite state machine while the latter represents an element of that alphabet. To a first approximation, the alphabet of all automata in this crate is just a `u8`. Namely, every distinct byte value. All 256 of them. In practice, this can be quite wasteful when building a transition table for a DFA, since it requires storing a state identifier for each element in the alphabet. Instead, we collapse the alphabet of an automaton down into equivalence classes, where every byte in the same equivalence class never discriminates between a match or a non-match from any other byte in the same class. For example, in the regex `[a-z]+`, then you could consider it having an alphabet consisting of two equivalence classes: `a-z` and everything else. In terms of the transitions on an automaton, it doesn't actually require representing every distinct byte. Just the equivalence classes. The downside of equivalence classes is that, of course, searching a haystack deals with individual byte values. Those byte values need to be mapped to their corresponding equivalence class. This is what `ByteClasses` does. In practice, doing this for every state transition has negligible impact on modern CPUs. Moreover, it helps make more efficient use of the CPU cache by (possibly considerably) shrinking the size of the transition table. One last hiccup concerns `Unit`. Namely, because of look-around and how the DFAs in this crate work, we need to add a sentinel value to our alphabet of equivalence classes that represents the "end" of a search. We call that sentinel [`Unit::eoi`] or "end of input." Thus, a `Unit` is either an equivalence class corresponding to a set of bytes, or it is a special "end of input" sentinel. In general, you should not expect to need either of these types unless you're doing lower level shenanigans with DFAs, or even building your own DFAs. (Although, you don't have to use these types to build your own DFAs of course.) For example, if you're walking a DFA's state graph, it's probably useful to make use of [`ByteClasses`] to visit each element in the DFA's alphabet instead of just visiting every distinct `u8` value. The latter isn't necessarily wrong, but it could be potentially very wasteful. D ;%%%%%%%%%%%&&&&&L&&$,t,\r.M$=?+-L"&"1. Create a new haystack unit from a byte value.""IF All possible byte values are legal. However, when creating a haystack#JG unit for a specific DFA, one should be careful to only construct units$GD that are in that DFA's alphabet. Namely, one way to compact a DFA's$GD in-memory representation is to collapse its transitions to a set of%HE equivalence classes into a set of all possible byte values. If a DFA%HE uses equivalence classes instead of byte values, then the byte given&)& here should be the equivalence class.'B $'+1'.+ Create a new "end of input" haystack unit.''HE The value given is the sentinel value used by this unit to represent(KH the "end of input." The value should be the total number of equivalence)FC classes in the corresponding alphabet. Its maximum value is `256`,)>; which occurs when every byte is its own equivalence class.*d*0**DA This panics when `num_byte_equiv_classes` is greater than `256`.+BКnum_byte_equiv_classes+. -DA If this unit is not an "end of input" sentinel, then returns its.30 underlying byte value. Otherwise return `None`.,. B $.1"/JG If this unit is an "end of input" sentinel, then return the underlying0DA sentinel value that was given to [`Unit::eoi`]. Otherwise return\1 `None`.41řǙșəʙ˙G*R{9 B $142KH Return this unit as a `usize`, regardless of whether it is a byte value3EB or an "end of input" sentinel. In the latter case, the underlying363 sentinel value given to [`Unit::eoi`] is returned.D4B $46&5KH Returns true if and only of this unit is a byte value equivalent to the6HE byte given. This always returns false when this is an "end of input"l6 sentinel.<7B $7$77МLܰ87FC Returns true when this unit represents an "end of input" sentinel.48B $8:!8B? Returns true when this unit corresponds to an ASCII word byte.99IF This always returns false when this unit represents an "end of input"l:Nd:B $:;g;@;<<< < <ggg cgcثq1ȡ<B ; $; ;FGFJG Creates a new set of equivalence classes where all bytes are mapped toG the same class.,GB̌HI"HGD Creates a new set of equivalence classes where each byte belongs toH its own equivalence class.TIB MgTM< <ȚÜĜŜƜǜȜ_w֕B M ,MViDV<< < <ȚÜĜŜƜǜȜ_wB V $VĨVY*dY< <B Z $ZZ*Z1. Set the equivalence class for the given byte.Z< <B Zď$Z& / \![1. Get the equivalence class for the given byte.\< <B \ $\; ].\HE Get the equivalence class for the given haystack unit and return the] class as a `usize`.\]< <B ] $] ̨`_JG Create a unit that represents the "end of input" sentinel based on the_" number of equivalence classes.`< <B ` $`c#aFC Return the total number of elements in the alphabet represented bybJG these equivalence classes. Equivalently, this returns the total number܎c of equivalence classes.dc< <B c$cie@= Returns the stride, as a base-2 exponent, required for theseģf equivalence classes.ffHE The stride is always the smallest power of 2 that is greater than orgHE equal to the alphabet length, and the `stride2` returned here is thegKH exponent applied to `2` to get the smallest power. This is done so thathKH converting between premultiplied state IDs and indices can be done withi=: shifts alone, which is much faster than integer division. Returns an iterator over all equivalence classes in this set.$n< <%%%ש%θb = classes.representatives(..).collect();xEB // Note that the specific byte values yielded are not guaranteed!Ăy3ԟy Unit::u8(b'\x00'),y Unit::u8(b'a'),y Unit::u8(b'{'),y Unit::eoi(3),4z3z assert_eq!(expected, reps);zz.Ǭ/ = classes.representatives(b'A'..=b'z').collect();~EN~3 Unit::u8(b'A'),N43N.Ǭ/</|< <%%%ש%%%nzLi This shows an example of how to get all of the elements in an equivalence class.</ŎCN"J%JFC let elements: Vec = classes.elements(Unit::u8(1)).collect();DA let expected: Vec = (b'a'..=b'z').map(Unit::u8).collect();# assert_eq!(expected, elements);.Ǭ/<ݑ/D< <%%%ש%%aMK->HE Create new storage for the offsets of all matching capturing groups.??HE This routine provides the most information for matches---namely, the?KH spans of matching capturing groups---but also requires the regex search@! routines to do the most work.@@HE It is unspecified behavior to use the returned `Captures` value in aAIF search with a `GroupInfo` other than the one that is provided to thisA constructor.BlB/BBEB This example shows that all capturing groups---but only ones thatCFC participated in a match---are available to query after a match has|C been found:C[a-z]+)|(?P[A-Z]+))(?P[0-9]+)$", This is a convenience routine for `caps.pattern().is_some()`.glg/hhC@ When using the PikeVM (for example), the lightest weight way ofhGD detecting whether a match exists is to create capturing groups thati96 only track the ID of the pattern that match (if any):i same pattern ID found in the `Match` returned by `get_match`.qlq/qqCOrKH detecting which pattern matched is to create capturing groups that onlyr41 track the ID of the pattern that match (if any):s 0` when `Captures` was created withɆ [`Captures::matches`].BODA guaranteed to return `true`, `pattern` is guaranteed to return aIF non-`None` value and `get_match` is guaranteed to return a non-`None`TΈ value.݈DA By convention, the 0th capture group will always return the sameEB span as the span returned by `get_match`. This is because the 0thEB capture group always corresponds to the entirety of the pattern'sŠHE match. (It is similarly always unnamed because it is implicit.) ThisEB isn't necessarily true of all regex engines. For example, one canًEB hand-compile a [`thompson::NFA`](crate::nfa::thompson::NFA) via aEB [`thompson::Builder`](crate::nfa::thompson::Builder), which isn'tKH technically forced to make the 0th capturing group always correspond to the entire match.׍lߍ/HE This example shows how to get the capturing groups, by index, from aTƎ match:Վ<ݎ/=/EB use regex_automata::{nfa::thompson::pikevm::PikeVM, Span, Match};A> let re = PikeVM::new(r"^(?P\pL+)\s+(?P\pL+)$")?;ÐJ/<1ۑ>1:1ݒ;8 assert_eq!(Some(Span::from(6..17)), caps.get_group(2));C@ // Looking for a non-existent capturing group will return None:(% assert_eq!(None, caps.get_group(3));52 # // literals are too big for 32-bit usize: #1039̔)& # #[cfg(target_pointer_width = "64")]:7 assert_eq!(None, caps.get_group(9944060567225171988));.Ǭ/</L= =B $wC˩;JOJG name given, only if both the overall pattern matched and the capturing%OJG This returns `None` if `name` does not correspond to a valid capturing'$ group for the pattern that matched.?ODOGOԌOBODOáIOTOl/¢GD This example shows how to get the capturing groups, by name, from aTO</=/EOŤAOJ/ڥ<1>1HE assert_eq!(Some(Span::from(0..5)), caps.get_group_by_name("first"));HǛ1CPȨ74 assert_eq!(None, caps.get_group_by_name("middle"));.Ǭ/</ҩ== = =B  $ $-JG Returns an iterator of possible spans for every capturing group in theɫ matching pattern.EB If this `Captures` value does not correspond to a match, then the)& iterator returned yields no elements.KH Note that the iterator returned yields elements of type `Option`.HE A span is present if and only if it corresponds to a capturing group! that participated in a match.l/ȮЮ;8 This example shows how to collect all capturing groups:</=/>M̱OϰB? // Matches first/last names, with an optional middle name.FC r"^(?P\pL+)\s+(?:(?P\pL+)\s+)?(?P\pL+)$",<ę1J/IJ=: re.captures(&mut cache, "Harry James Potter", &mut caps);솳<:7 let groups: Vec> = caps.iter().collect(); assert_eq!(groups, vec![  Some(Span::from(0..18)), Some(Span::from(0..5)),Ѵ  Some(Span::from(6..11)),! Some(Span::from(12..18)),<9.Ǭ/</HE This example uses the same regex as the previous example, but with aĶJG haystack that omits the middle name. This results in a capturing groupIF that is present in the elements yielded by the iterator but without aTO</=/Ƹ>M̑OBPF͒P<ę1ͺJ/74 re.captures(&mut cache, "Harry Potter", &mut caps);<:PP  Some(Span::from(0..12)),Pl6  Some(Span::from(6..12)),<9.Ǭ/</$= =&&ք&ɾ& MT Pb =B $¾,տU IF Return the total number of capturing groups for the matching pattern.FC If this `Captures` value does not correspond to a match, then this always returns `0`.>; This always returns the same number of elements yielded byJG [`Captures::iter`]. That is, the number includes capturing groups even+( if they don't participate in the match.l/HE This example shows how to count the total number of capturing groupsJG associated with a pattern. Notice that it includes groups that did not=: participate in a match (just like `Captures::iter` does).</=/6L̋OBPF͒P<ę1J/7P$! assert_eq!(4, caps.group_len());.Ǭ/</L= =B  $&C@ Returns a reference to the underlying group info on which these captures are based.HE The difference between `GroupInfo` and `Captures` is that the formerIF defines the structure of capturing groups where as the latter is whatJG stores the actual match information. So where as `Captures` only givesC@ you access to the current match, `GroupInfo` lets you query anyGD information about all capturing groups, even ones for patterns that  weren't involved in a match.IF Note that a `GroupInfo` uses reference counting internally, so it may be cloned cheaply.l/DA This example shows how to get all capturing group names from theC@ underlying `GroupInfo`. Notice that we don't even need to run a\ search.</C@ use regex_automata::{nfa::thompson::pikevm::PikeVM, PatternID}; ݹM r"(?Pa)", r"(a)(b)",t r"ab",! r"(?Pa)(?Pa)", r"(?Pz)",D1$! let caps = re.create_captures();ġ3&# (PatternID::must(0), 0, None),-* (PatternID::must(0), 1, Some("foo")),&# (PatternID::must(1), 0, None),&# (PatternID::must(1), 1, None),&# (PatternID::must(1), 2, None),&# (PatternID::must(2), 0, None),&# (PatternID::must(3), 0, None),-* (PatternID::must(3), 1, Some("bar")),.+ (PatternID::must(3), 2, Some("quux")),&# (PatternID::must(4), 0, None),-* (PatternID::must(4), 1, Some("foo")),43:7 // We could also just use 're.get_nfa().group_info()'.41 let got: Vec<(PatternID, usize, Option<&str>)> =0- caps.group_info().all_names().collect();3.Ǭ/</T= = =B $lA> Interpolates the capture references in `replacement` with theIF corresponding substrings in `haystack` matched by each reference. The$! interpolated string is returned.HE See the [`interpolate` module](interpolate) for documentation on the%" format of the replacement string.l/FC This example shows how to use interpolation, and also shows how it(% can work with multi-pattern regexes.</CP ݹMA> r"(?[0-9]{2})-(?[0-9]{2})-(?[0-9]{4})",A> r"(?[0-9]{4})-(?[0-9]{2})-(?[0-9]{2})",D1&ʛ0(0;8 let replacement = "year=$year, month=$month, day=$day";&# // This matches the first pattern.:7 let hay = "On 14-03-2010, I became a Tennessee lamb.";,) re.captures(&mut cache, hay, &mut caps);;8 let result = caps.interpolate_string(hay, replacement);63 assert_eq!("year=2010, month=03, day=14", result);+( // And this matches the second pattern.:7 let hay = "On 2010-03-14, I became a Tennessee lamb.";,P;P6P.Ǭ/</=== = = =B  $D\APIP,) interpolated string is written to `dst`.HP%ȺPl/FP(P</CP ݹMAPAPD1&ʛ0(0;P&P:P,P  let mut dst = String::new();=: caps.interpolate_string_into(hay, replacement, &mut dst);30 assert_eq!("year=2010, month=03, day=14", dst);+P:P,P P=P3P.Ǭ/</==== = = = =B  $D\Ĩd U4 UPnAPIP)& interpolated byte string is returned.HP%ȺPl/FP(P</CP ݹMAPAPD1&ʛ0(0<9 let replacement = b"year=$year, month=$month, day=$day";ۂ&P;8 let hay = b"On 14-03-2010, I became a Tennessee lamb.";΃,P:7 let result = caps.interpolate_bytes(hay, replacement);<9 assert_eq!(&b"year=2010, month=03, day=14"[..], result);+P;8 let hay = b"On 2010-03-14, I became a Tennessee lamb.";,P:P<P.Ǭ/</=== = =Ț =Ț̹B  $D\ϖۉAPIP1. interpolated byte string is written to `dst`.HP%ȺPl/ƌFP(P<ƍ/ҍCP ݹMǎAPAPDӏ1&ʛ0(0<P&P;P,P̥ let mut dst = vec![];Ò<9 caps.interpolate_bytes_into(hay, replacement, &mut dst);96 assert_eq!(&b"year=2010, month=03, day=14"[..], dst);“ʓ+P;P,PP<Pʕ9P.Ǭ/<Ö/֖==== = =Ț =Ț =̹B  $D\Ĩd ̹U4PPn?< This is a convenience routine for extracting the substringsIF corresponding to matching capture groups in the given `haystack`. TheKH `haystack` should be the same substring used to find the match spans inӜ this `Captures` value.JG This is identical to [`Captures::extract_bytes`], except it works withɝ `&str` instead of `&[u8]`.d0A> This panics if the number of explicit matching groups in thisӞJG `Captures` value is less than `N`. This also panics if this `Captures`)& value does not correspond to a match.П؟FC Note that this does *not* panic if the number of explicit matchingHE groups is bigger than `N`. In that case, only the first `N` matching groups are extracted.l/</6L?< let re = PikeVM::new(r"([0-9]{4})-([0-9]{2})-([0-9]{2})")?;â&ʛ0(0:P,P쓤<74 let (full, [year, month, day]) = caps.extract(hay);# assert_eq!("2010-03-14", full);왥 assert_eq!("2010", year);以 assert_eq!("03", month);ܥ assert_eq!("14", day);96 // We can also ask for fewer than all capture groups.+( let (full, [year]) = caps.extract(hay);#P왧Pç.Ǭ/</<= = PPBt $K57% Ӹw?PIPǬKPԗPDA This is identical to [`Captures::extract`], except it works with `&[u8]` instead of `&str`.d0îˮAPJP)PFPHP̮P̱lԱ/</6L?P&ʛ0(0ٳ;P,PҴ<=: let (full, [year, month, day]) = caps.extract_bytes(hay);$! assert_eq!(b"2010-03-14", full);ߵ assert_eq!(b"2010", year);삶 assert_eq!(b"03", month);ܤ assert_eq!(b"14", day);Ķ̶9P1. let (full, [year]) = caps.extract_bytes(hay);$PP.Ǭ/<Ǹ/lڸ= = ȚPPBPt $P/1% lNK Lower level "slot" oriented APIs. One does not typically need to use theseܼLI when executing a search. They are instead mostly intended for folks thatJG are writing their own regex engine while reusing this `Captures` type.  Clear this `Captures` value.IF After clearing, all slots inside this `Captures` value will be set toGD `None`. Similarly, any pattern ID that it was previously associatedϿ! with (for a match) is erased.JG It is not usually necessary to call this routine. Namely, a `Captures`HE value only provides high level access to the capturing groups of theHE pattern that matched, and only low level access to individual slots.FC Thus, even if slots corresponding to groups that aren't associatedFC with the matching pattern are set, then it won't impact the higherKH level APIs. Namely, higher level APIs like [`Captures::get_group`] willJG return `None` if no pattern ID is present, even if there are spans set in the underlying slots.FC Thus, to "clear" a `Captures` value of a match, it is usually only<9 necessary to call [`Captures::set_pattern`] with `None`.l/GD This example shows what happens when a `Captures` value is cleared.</=/6LAOJ/<1<# let slots: Vec> =B? caps.slots().iter().map(|s| s.map(|x| x.get())).collect();GD // Note that the following ordering is considered an API guarantee.ܒ assert_eq!(slots, vec![ Some(0), Some(17),Q Some(5), Some(6),Q<9KH // Now clear the slots. Everything is gone and it is no longer a match. caps.clear();J#QBQܾQl6l6l6l6l6l6<9.Ǭ/</,= =B  $5-* Set the pattern on this `Captures` value.FC When the pattern ID is `None`, then this `Captures` value does notIF correspond to a match (`is_match` will return `false`). Otherwise, it܌ corresponds to a match.DA This is useful in search implementations where you might want toDA initially call `set_pattern(None)` in order to avoid the cost of:7 calling `clear()` if it turns out to not be necessary.l/KH This example shows that `set_pattern` merely overwrites the pattern ID.;8 It does not actually change the underlying slot values.</=/6LAOJ/<1<&# assert!(caps.pattern().is_some());#QBQGQܶQQQQQQQ<9EB // Now set the pattern to None. Note that the slot values remain.ܴ caps.set_pattern(None);J'$ assert!(!caps.pattern().is_some());#QBQGQQQQQQQQ<9.Ǭ/</\= =B $OV-IF Returns the underlying slots, where each slot stores a single offset.JG Every matching capturing group generally corresponds to two slots: oneGD slot for the starting position and another for the ending position.GD Typically, either both are present or neither are. (The weasel wordJG "typically" is used here because it really depends on the regex engineFC implementation. Every sensible regex engine likely adheres to thisA> invariant, and every regex engine in this crate is sensible.)JG Generally speaking, callers should prefer to use higher level routines<9 like [`Captures::get_match`] or [`Captures::get_group`].JG An important note here is that a regex engine may not reset all of theHE slots to `None` values when no match occurs, or even when a match ofHE a different pattern occurs. But this depends on how the regex engine$! implementation deals with slots.l/JG This example shows how to get the underlying slots from a regex match.</̎/&J30 util::primitives::{PatternID, NonMaxUsize},4ݥ/ ݹM r"[a-z]+",1D1J/.+ re.captures(&mut cache, "123", &mut caps);9OFC // Note that the only guarantee we have here is that slots 2 and 3IF // are set to correct values. The contents of the first two slots are74 // unspecified since the 0th pattern did not match. let expected = &[l6l6 NonMaxUsize::new(0), NonMaxUsize::new(3),43'$ assert_eq!(expected, caps.slots());.Ǭ/</,= = =B  $9KH Returns the underlying slots as a mutable slice, where each slot stores a single offset.EB This tends to be most useful for regex engine implementations for;8 writing offsets for matching capturing groups to slots.=: See [`Captures::slots`] for more information about slots.L= = =B $"g@=== = =ggg cgcثq1ȡ=B  $ GF {Tt$ 2g@=== = =ggg cgcثq1ȡ=B  $ J LOřǙșəʙ˙G*R{9 BJ QB ,|Q%g@=== = =ggg cgcثq1ȡ=B  $ ԅ-QQQQمL$*$= =řǙșəʙ˙G*R{9 B  $-Lć= =>B · $χ,B $و6ވ>tDA Creates a new group info from a sequence of patterns, where eachGD sequence of patterns yields a sequence of possible group names. TheIF index of each pattern in the sequence corresponds to its `PatternID`,IF and the index of each group in each pattern's sequence corresponds to" its corresponding group index.HE While this constructor is very generic and therefore perhaps hard toFC chew on, an example of a valid concrete type that can be passed toC@ this constructor is `Vec>>`. The outer `Vec`DA corresponds to the patterns, i.e., one `Vec>` perDA pattern. The inner `Vec` corresponds to the capturing groups forEB each pattern. The `Option` corresponds to the name of the  capturing group, if present.FC It is legal to pass an empty iterator to this constructor. It willFC return an empty group info with zero slots. An empty group info isHE useful for cases where you have no patterns or for cases where slotsA> aren't being used at all (e.g., for most DFAs in this crate).d1GD This constructor returns an error if the given capturing groups areGD invalid in some way. Those reasons include, but are not necessarily| limited to:;8 * Too many patterns (i.e., `PatternID` would overflow).=: * Too many capturing groups (e.g., `u32` would overflow).IF * A pattern is given that has no capturing groups. (All patterns must<9 have at least an implicit capturing group at index `0`.)FC * The capturing group at index `0` has a name. It must be unnamed.HE * There are duplicate capturing group names within the same pattern.EB (Multiple capturing groups with the same name may exist, but they# must be in different patterns.)A> An example below shows how to trigger some of the above error| conditions.l/FC This example shows how to build a new `GroupInfo` and query it forε5</2/ use regex_automata::util::captures::GroupInfo;# let info = GroupInfo::new(vec![  vec![None, Some("foo")], vec![None],2/ vec![None, None, None, Some("bar"), None],&# vec![None, None, Some("foo")],D1,) // The number of patterns being tracked.&# assert_eq!(4, info.pattern_len());ć // 2 slots per group$! assert_eq!(22, info.slot_len());.Ǭ/</  # Example: empty `GroupInfo`FQε5</2Q" let info = GroupInfo::empty();ԣ // Everything is zero.&# assert_eq!(0, info.pattern_len());# assert_eq!(0, info.slot_len());.Ǭ/</ # Example: error conditionsHE This example shows how to provoke some of the ways in which building a `GroupInfo` can fail.</2QIF // Either the group info is empty, or all patterns must have at leastܞ // one capturing group.  assert!(GroupInfo::new(vec![$! vec![None, Some("a")], // oǩ vec![None], // ok̪ vec![], // not ok ]).is_err());41 // Note that building an empty group info is OK.GD assert!(GroupInfo::new(Vec::>>::new()).is_ok());EB // The first group in each pattern must correspond to an implicitHE // anonymous group. i.e., One that is not named. By convention, thisKH // group corresponds to the overall match of a regex. Every other group-* // in a pattern is explicit and optional.>; assert!(GroupInfo::new(vec![vec![Some("foo")]]).is_err());GD // There must not be duplicate group names within the same pattern. Q-* vec![None, Some("foo"), Some("foo")],Q:7 // But duplicate names across distinct patterns is OK. Q Q Q ]).is_ok());.Ǭ/</C@ There are other ways for building a `GroupInfo` to fail but areIF difficult to show. For example, if the number of patterns given would̰ overflow `PatternID`.B/   PPDPPT Op݀&# This creates an empty `GroupInfo`.FC This is a convenience routine for calling `GroupInfo::new` with an%" iterator that yields no elements.l/HE This example shows how to build a new empty `GroupInfo` and query it for information.</2Q"QQ&Q(% assert_eq!(0, info.all_group_len());#Q.Ǭ/<р/,B  CIF Return the capture group index corresponding to the given name in the͂DA given pattern. If no such capture group name exists in the given&# pattern, then this returns `None`.ɃA> If the given pattern ID is invalid, then this returns `None`.GD This also returns `None` for all inputs if these captures are emptyHE (e.g., built from an empty [`GroupInfo`]). To check whether capturesEB are present for a specific pattern, use [`GroupInfo::group_len`].l/JG This example shows how to find the capture index for the given pattern and group name.HE Remember that capture indices are relative to the pattern, such that؇HE the same capture index value may refer to different capturing groupsԥ for distinct patterns.Ĉ<̈/؈=/8J׉߉@= let (pid0, pid1) = (PatternID::must(0), PatternID::must(1)); let nfa = NFA::new_many(&[ϊ'$ r"a(?P\w+)z(?P\s+)", r"a(?P\d+)z",D1" let groups = nfa.group_info();΋63 assert_eq!(Some(2), groups.to_index(pid0, "foo"));FC // Recall that capture index 0 is always unnamed and refers to theԌJG // entire pattern. So the first capturing group present in the pattern'$ // itself always starts at index 1.ύ63 assert_eq!(Some(1), groups.to_index(pid1, "foo"));EB // And if a name does not exist for a particular pattern, None is܎ // returned.52 assert!(groups.to_index(pid0, "quux").is_some());52 assert!(groups.to_index(pid1, "quux").is_none());.Ǭ/</D== = =B ʐ $ː | |IIF Return the capture name for the given index and given pattern. If theӒGD corresponding group does not have a name, then this returns `None`.;8 If the pattern ID is invalid, then this returns `None`.JG If the group index is invalid for the given pattern, then this returnsKH `None`. A group `index` is valid for a pattern `pid` in an `nfa` if and30 only if `index < nfa.pattern_capture_len(pid)`.ƕΕGQHQEQl/˗ӗGD This example shows how to find the capture group name for the given䟘 pattern and group index.<Ș/Ԙ=/8Jәۙ@QQ˚%" r"a(?P\w+)z(\s+)x(\d+)", r"a(\d+)z(?P\s+)",D1"Q͛.+ assert_eq!(None, groups.to_name(pid0, 0));52 assert_eq!(Some("foo"), groups.to_name(pid0, 1));.+ assert_eq!(None, groups.to_name(pid0, 2));.+ assert_eq!(None, groups.to_name(pid0, 3));.+ assert_eq!(None, groups.to_name(pid1, 0));۝.+ assert_eq!(None, groups.to_name(pid1, 1));52 assert_eq!(Some("foo"), groups.to_name(pid1, 2));Ȟ?< // '3' is not a valid capture index for the second pattern..+ assert_eq!(None, groups.to_name(pid1, 3));ǟ.Ǭ/</<= =řǙșəʙ˙G*R{9  =B  $t~HIF Return an iterator of all capture groups and their names (if present)쳢 for a particular pattern.բݢGD If the given pattern ID is invalid or if this `GroupInfo` is empty,)& then the iterator yields no elements.ףߣFC The number of elements yielded by this iterator is always equal to@= the result of calling [`GroupInfo::group_len`] with the same5l/GJJ</8J:JGJKJĨJJ JBJ3BJKJJݫ.Ǭ/</l= =&&&'|02y=B Ǭ $ȬĽʼ0JG Return an iterator of all capture groups for all patterns supported byïJG this `GroupInfo`. Each item yielded is a triple of the group's pattern>; ID, index in the pattern and the group's name, if present.հlݰ/GD This example shows how to get a list of all capture groups found inñ41 one NFA, potentially spanning multiple patterns.</8JͲղQPl r"a",| r"(a)",D1Ƴ3&P-P&P&P&# (PatternID::must(2), 1, None),43̵4P/, nfa.group_info().all_names().collect();3ܶ.Ǭ/</GD Unlike other capturing group related routines, this routine doesn't63 panic even if captures aren't enabled on this NFA:</Ƹ<H쏹/EJ5Ԗ r"(?Pa)", r"a",˺ r"(a)",d5?< // When captures aren't enabled, there's nothing to return.85 assert_eq!(0, nfa.group_info().all_names().count());.Ǭ/</LѼ= =&&ɉ&]&&& ox2=B ۼ $ܼpC@ Returns the starting and ending slot corresponding to the givenHE capturing group for the given pattern. The ending slot is always oneп)& more than the starting slot returned.KH Note that this is like [`GroupInfo::slot`], except that it also returns*' the ending slot value for convenience.GD If either the pattern ID or the capture index is invalid, then this returns None.l/FC This example shows that the starting slots for the first capturing'$ group of each pattern are distinct.</8J*' let nfa = NFA::new_many(&["a", "b"])?;| assert_ne!(63 nfa.group_info().slots(PatternID::must(0), 0),63 nfa.group_info().slots(PatternID::must(1), 0),40@= // Also, the start and end slot values are never equivalent.KH let (start, end) = nfa.group_info().slots(PatternID::ZERO, 0).unwrap(); assert_ne!(start, end);.Ǭ/</,= =B $ȋҋ<їGHE Returns the starting slot corresponding to the given capturing groupFC for the given pattern. The ending slot is always one more than the value returned.GRRl/FR'՚R</8J*R|R52 nfa.group_info().slot(PatternID::must(0), 0),52 nfa.group_info().slot(PatternID::must(1), 0),40.Ǭ/</$= =B $"=: Returns the total number of patterns in this `GroupInfo`.C@ This may return zero if the `GroupInfo` was constructed with nol?HėJFC `GroupInfo` construction will fail if too many patterns are added.l/</+H>J2/ assert_eq!(3, nfa.group_info().pattern_len());!ߚJ2/ assert_eq!(0, nfa.group_info().pattern_len());"țJ2/ assert_eq!(1, nfa.group_info().pattern_len());.Ǭ/</\= =B $052 Return the number of capture groups in a pattern.85 If the pattern ID is invalid, then this returns `0`.l/GD This example shows how the values returned by this routine may vary2/ for different patterns and NFA configurations.</IF use regex_automata::{nfa::thompson::{NFA, WhichCaptures}, PatternID};&# let nfa = NFA::new(r"(a)(b)(c)")?;GD // There are 3 explicit groups in the pattern's concrete syntax and@= // 1 unnamed and implicit group spanning the entire pattern.?< assert_eq!(4, nfa.group_info().group_len(PatternID::ZERO));  let nfa = NFA::new(r"abc")?;0- // There is just the unnamed implicit group.?< assert_eq!(1, nfa.group_info().group_len(PatternID::ZERO));/EJĂ .build(r"abc")?;74 // We disabled capturing groups, so there are none.?< assert_eq!(0, nfa.group_info().group_len(PatternID::ZERO));/EJ .build(r"(a)(b)(c)")?;IF // We disabled capturing groups, so there are none, even if there are.+ // explicit groups in the concrete syntax.?R.Ǭ/</L= =B $=$B? Return the total number of capture groups across all patterns.FC This includes implicit groups that represent the entire match of ad/l/GR2R</IѮR&RGR@R41 assert_eq!(4, nfa.group_info().all_group_len()); ױR0R41 assert_eq!(1, nfa.group_info().all_group_len());30 let nfa = NFA::new_many(&["(a)", "b", "(c)"])?;41 // Each pattern has one implicit groups, and two-* // patterns have one explicit group each.41 assert_eq!(5, nfa.group_info().all_group_len());/EJR7ӳR41 assert_eq!(0, nfa.group_info().all_group_len());/EJRIR.R?R.Ǭ/</l= =B  $܀DA Returns the total number of slots in this `GroupInfo` across alll?KH The total number of slots is always twice the total number of capturing85 groups, including both implicit and explicit groups.l/GD This example shows the relationship between the number of capturing groups and slots.</2Q&# // There are 11 total groups here.#Q QQ2Q&QD10- // 2 slots per group gives us 11*2=22 slots.$Q.Ǭ/<€/D= =B $ʊ(DA Returns the total number of slots for implicit capturing groups.GD This is like [`GroupInfo::slot_len`], except it doesn't include theтEB explicit slots for each pattern. Since there are always exactly 2KH implicit slots for each pattern, the number of implicit slots is always*' equal to twice the number of patterns.l/GR.+ groups, implicit slots and explicit slots.<Å/υ2Q&RKH let info = GroupInfo::new(vec![vec![None, Some("foo"), Some("bar")]])?;0R# assert_eq!(6, info.slot_len());IF // 2 implicit slots per pattern gives us 2 implicit slots since there // is 1 pattern.͈,) assert_eq!(2, info.implicit_slot_len());A> // 2 explicit capturing groups gives us 2*2=4 explicit slots.ĉ,) assert_eq!(4, info.explicit_slot_len());.Ǭ/</ъ= =B $Ε(DA Returns the total number of slots for explicit capturing groups.GRKH implicit slots for each pattern. (There are always 2 implicit slots for each pattern.)IF For a non-empty `GroupInfo`, it is always the case that `slot_len` isHE strictly greater than `explicit_slot_len`. For an empty `GroupInfo`,ƎFC both the total number of slots and the number of explicit slots isD `0`.l/GR.R<ǐ/Ӑ2Q&RKR0R’#RIRRѓ,RARȔ,R.Ǭ/</Օ= =B  $#Ŗ<9 Returns the memory usage, in bytes, of this `GroupInfo`.IF This does **not** include the stack size used up by this `GroupInfo`.ܗ<9 To compute that, use `std::mem::size_of::()`.d= =B $ݘ |tšΥɩ-|̩= =B ܩ$> >ׁB  T $۰DF=> >B $)\> >B $,L> >B $&t> >ׁB ˪$\ׁU;BH|BN<<7tBN<>BN<>L> >B N< $)|>4> >řǙșəʙ˙G*R{9  >2B  $*gD>>> > >ggg cgcثq1ȡ>B  $ #&&&'|02y,,RB /QQQQL$Qʉ-$͉> >řǙșəʙ˙G*R{9 QB ҉ $׉KU-L> >>B  $,B $ċ8ɋ@+QQLΐ$ӐQA$> >řǙșəʙ˙G*R{9 RB  $t ;$ Provides convenience routines for escaping raw bytes. Since this crate tends to deal with `&[u8]` everywhere and the default `Debug` implementation just shows decimal integers, it makes debugging those representations quite difficult. This module provides types that show `&[u8]` as if it were a string, with invalid UTF-8 escaped into its byte-by-byte hex representation. 4 ;&&$$$#$g@$$>>> > >ggg cgcثq1ȡ>B $ $$ $ $"  =$: Provides a convenient `Debug` implementation for `&[u8]`. $ M$J This generally works best when the bytes are presumed to be mostly UTF-8, I$F but will work for anything. For any bytes that aren't UTF-8, they are $$! emitted as hex escape sequences.l$S ȚB MRB $d$R/$g$@$$>>> > >ggg cgcثq1ȡ>B $ $$ $ ; Provides routines for interpolating capture group references. That is, if a replacement string contains references like `$foo` or `${foo1}`, then they are replaced with the corresponding capture values for the groups named `foo` and `foo1`, respectively. Similarly, syntax like `$1` and `${1}` is supported as well, with `1` corresponding to a capture group index and not a name. This module provides the free functions [`string`] and [`bytes`], which interpolate Rust Unicode strings and byte strings, respectively. # Format These routines support two different kinds of capture references: unbraced and braced. For the unbraced format, the format supported is `$ref` where `name` can be any character in the class `[0-9A-Za-z_]`. `ref` is always the longest possible parse. So for example, `$1a` corresponds to the capture group named `1a` and not the capture group at index `1`. If `ref` matches `^[0-9]+$`, then it is treated as a capture group index itself and not a name. For the braced format, the format supported is `${ref}` where `ref` can be any sequence of bytes except for `}`. If no closing brace occurs, then it is not considered a capture reference. As with the unbraced format, if `ref` matches `^[0-9]+$`, then it is treated as a capture group index and not a name. The braced format is useful for exerting precise control over the name of the capture reference. For example, `${1}a` corresponds to the capture group reference `1` followed by the letter `a`, where as `$1a` (as mentioned above) corresponds to the capture group reference `1a`. The braced format is also useful for expressing capture group names that use characters not supported by the unbraced format. For example, `${foo[bar].baz}` refers to the capture group named `foo[bar].baz`. If a capture group reference is found and it does not refer to a valid capture group, then it will be replaced with the empty string. To write a literal `$`, use `$$`. To be clear, and as exhibited via the type signatures in the routines in this module, it is impossible for a replacement string to be invalid. A replacement string may not have the intended semantics, but the interpolation procedure itself can never fail.  ;̨ ;\ ;''4IC4 ,tHD9*OL Accepts a replacement string and interpolates capture references with their̽ corresponding values.LI `append` should be a function that appends the string value of a captureIF group at a particular index to the string given. If the capture group63 index is invalid, then nothing should be appended.LI `name_to_index` should be a function that maps a capture group name to aLI capture group index. If the given name doesn't exist, then `None` should be returned.NK Finally, `dst` is where the final interpolated contents should be written.MJ If `replacement` contains no capture group references, then `dst` will be  equivalent to `replacement`.EB See the [module documentation](self) for details about the formatt supported.l/</*' use regex_automata::util::interpolate; P interpolate::string( "foo $bar baz", |index, dst| {ܩ if index == 0 {$! dst.push_str("BAR");l3TF |name| { if name == "bar" { Some(0) } else { Nonel3TF &mut dst,40# assert_eq!("foo BAR baz", dst);</4>> >ŗ >B ŗ!># >̒>#S>#ŗ >>#ŗSl ŗ\4lĨ$/%NK Accepts a replacement byte string and interpolates capture references with& their corresponding values.&&IF `append` should be a function that appends the byte string value of a'HE capture group at a particular index to the byte string given. If the'DA capture group index is invalid, then nothing should be appended.((LS(LS)ёS))NS*MϒS* S++EܓSt+S+l+/,<,/,*S,,P, interpolate::bytes(, b"foo $bar baz",-Sܦ-S-.+ dst.extend_from_slice(b"BAR");l-3T-F.S.S.͗S.S.Sl.3T/F/S4/0/)& assert_eq!(&b"foo BAR baz"[..], dst);> >ȚDZŗ >̹B 0DZ0S0!>#DZ >̹ԟ0>#DZS>#ŗ >0>#ŗSl0 DZŗ\/40l0ĨA$3="=>$>B  >>!>!$>B  ?B=dB> >ȚřǙșəʙ˙G*R{9 ''''RT >B C\CLJL> >ȚřǙșəʙ˙G*R{9 ''''RT >B L ΡAL L$Mϗ$NϗS%SB  Td ;% Generic helpers for iteration of matches from a regex engine in a haystack. The principle type in this module is a [`Searcher`]. A `Searcher` provides its own lower level iterator-like API in addition to methods for constructing types that implement `Iterator`. The documentation for `Searcher` explains a bit more about why these different APIs exist. Currently, this module supports iteration over any regex engine that works with the [`HalfMatch`], [`Match`] or [`Captures`] types. $ ;'''''''D%&L%,,%,,%,T%-%%%%qs`bNP<>;%;%>,%;;%8 Create a new fallible non-overlapping matches iterator.<% % such as a prefilter scanner.>%B `,>%A+%?6%3 Returns the current `Input` used by this searcher.?%?D%A The `Input` returned is generally equivalent to the one given to@I%F [`Searcher::new`], but its start position may be different to reflectA0%- the start of the next search to be executed.,A%  BA% $A%Y%BJ%G Return the next half match for an infallible search if one exists, andB!% advance to the next position.C%CE%B This is like `try_advance_half`, except errors are converted into\C% panics.C%dC%0C%DK%H If the given closure returns an error, then this panics. This is usefulDI%F when you know your underlying regex engine has been configured to notE% return an error.E%lE%/E%EJ%G This example shows how to use a `Searcher` to iterate over all matchesF9%6 when using a DFA, which only provides "half" matches.F% >B Y%N Y%>># >,,,,Ŝ,,I{>Y:%>>#SY%% $Y%x%\E%B Return the next match for an infallible search if one exists, and\!%S]%]C%@ The search is advanced even in the presence of empty matches by]C%@ forbidding empty matches from overlapping with any other match.^%^H%E This is like `try_advance`, except errors are converted into panics._%d_%0_%_K%S_I%S`%۾S`%l`%/`%aJ%Sa*%' when using a regex based on lazy DFAs:a% >B x%N x%>># >,,,,Ŝ,,I{>x6%>>#Sׅ y!% $x%}%{G%D Return the next half match for a fallible search if one exists, and|!%S|%|K%H This is like `advance_half`, except it permits callers to handle errors|% during iteration.}%> >B }%N }%>># >,,,,Ŝ,,I{>~:%>>#S~%% $}%4}%%ɂJ%G Return the next match for a fallible search if one exists, and advance̘% to the next position.%F%C This is like `advance`, except it permits callers to handle errors%S\%> >ׅ B Є%N Ą%>># >,,,,Ŝ,,I{>6%>>#Sׅ Dž!% $Մ%4%%ȉJ%G Given a closure that executes a single search, return an iterator over0%- all successive non-overlapping half matches.̊%ԊG%D The iterator returned yields result values. If the underlying regexC%@ engine is configured to never return an error, consider callingE%B [`TryHalfMatchesIter::infallible`] to convert errors into panics.%l%/̌%ԌA%> This example shows how to use a `Searcher` to create a proper% iterator over half matches.%<ƍ%/ҍ%/%3쎎%S̰%34Ύ%ݥ/َ%6%S&%ʛ0Ǐ%Ϗ?%SF%C let mut it = Searcher::new(input).into_half_matches_iter(|input| {ސ,%) re.try_search_fwd(&mut cache, input)<%S%4%1 let expected = Some(Ok(HalfMatch::must(0, 10)));ܑ$%! assert_eq!(expected, it.next());%4%1 let expected = Some(Ok(HalfMatch::must(0, 21)));ƒ$%S%4%1 let expected = Some(Ok(HalfMatch::must(0, 32)));$%Sٓ%%1$%S%.%Ǭ/<%/%BN %>># >,,,,Ŝ,,I{>:%>>#S%% [f%J%S×+%( all successive non-overlapping matches.%G%SǘC%SA%> [`TryMatchesIter::infallible`] to convert errors into panics.ՙ%lݙ%/%A%SԽ% iterator over matches.ܚ%<%/%/쎛%S찛%Sқ%źE4%ݥ/%8%S&%ʛ0%?%SA%> let mut it = Searcher::new(input).into_matches_iter(|input| {(%% re.try_search(&mut cache, input)<%S%3%0 let expected = Some(Ok(Match::must(0, 0..10)));$%S%4%1 let expected = Some(Ok(Match::must(0, 11..21)));ܟ$%S%4%1 let expected = Some(Ok(Match::must(0, 22..32)));Ơ$%S%%1$%S%š.%Ǭ/<%/%BN %>># >,,,,Ŝ,,I{>6%>>#ȀTׅ !% )4%J%S5%2 all successive non-overlapping `Captures` values.%G%SC%SB%? [`TryCapturesIter::infallible`] to convert errors into panics.Φ%֦C%@ Unlike the other iterator constructors, this accepts an initialJ%G `Captures` value. This `Captures` value is reused for each search, andI%F the iterator implementation clones it before returning it. The callerF%C must provide this value because the iterator is purposely ignorantF%C of the underlying regex engine and thus doesn't know how to createѩF%C one itself. More to the point, a `Captures` value itself has a fewE%B different constructors, which change which kind of information is:%7 available to query in exchange for search performance.%l%/%ǫJ%G This example shows how to use a `Searcher` to create a proper iteratorH%E over `Captures` values, which provides access to all capturing group% spans for each match.%<%/̕%/&%Jޭ%St%?4%ݥ/%̦%OĮ;%8 r"(?P[0-9]{4})-(?P[0-9]{2})-(?P[0-9]{2})",<%ę1F%C let (mut cache, caps) = (re.create_cache(), re.create_captures());ۯ%6%3 let haystack = "2010-03-14 2016-10-08 2020-10-22";%%6Ȱ%%" let mut it = Searcher::new(input)1%. .into_captures_iter(caps, |input, caps| {/%, re.search(&mut cache, input, caps);ܱ% Ok(())\% });%.%+ let got = it.next().expect("first date")?;?%< let year = got.get_group_by_name("y").expect("must match");(%% assert_eq!("2010", &haystack[year]);%/%, let got = it.next().expect("second date")?;@%= let month = got.get_group_by_name("m").expect("must match");'%$ assert_eq!("10", &haystack[month]);ܴ%.%+ let got = it.next().expect("third date")?;>%; let day = got.get_group_by_name("d").expect("must match");ڵ%%" assert_eq!("22", &haystack[day]);%!% assert!(it.next().is_none());%.%Ǭ/<%/%%%BN %>>># >,,,,Ŝ,,I{> >:%>>>#וTո%  ɾ  %#%> >B ̼%N %>># >,,,,Ŝ,,I{>Ƚ:%>>#Tݽ%% $Ѽ% 4%%%> >ׅ B %N %>># >,,,,Ŝ,,I{>6%>>#Tׅ !% $%4%$%L%I An iterator over all non-overlapping half matches for a fallible search.%M%J The iterator yields a `Result` value until no more% matches could be found.%'%$ The type parameters are as follows:%D%A * `F` represents the type of a closure that executes the search.%9%6 The lifetime parameters come from the [`Input`] type:%6%3 * `'h` is the lifetime of the underlying haystack.%J%G When possible, prefer the iterators defined on the regex engine you'reN%K using. This tries to abstract over the regex engine and is thus a bit more% unwieldy to use.%E%B This iterator is created by [`Searcher::into_half_matches_iter`].%N %zU%(*%%L%4%%%N %%1%2%/ Return an infallible version of this iterator.%J%G Any item yielded that corresponds to an error results in a panic. ThisI%F is useful if your underlying regex engine is configured in a way that.%+ it is guaranteed to never return an error.T%B q+%6%3 Returns the current `Input` used by this iterator.%C%@ The `Input` returned is generally equivalent to the one used toG%D construct this iterator, but its start position may be different to8%5 reflect the start of the next search to be executed.,%  B% $%!#{%>># >,,,,Ŝ,,I{>%%>>#T:%N %QQ%"$L%$% ;%$%> > B % $%:%N %g%D%%>>> > >ggg cgcثq1ȡ>B % $%"%N %%+%6%T%C%TG%ɨT8%T,%  B% $%!#x%>># >,,,,Ŝ,,I{>%%>>#T:%N %QQ%"$L%$%'%$%> >B % $% %G%D An iterator over all non-overlapping matches for a fallible search.%I%F The iterator yields a `Result` value until no moreܓ%T%'%ҝT%D%T%9%T%6%T%J%TN%T%T%@%= This iterator is created by [`Searcher::into_matches_iter`].t%N %VS%(*%%L%4%!%N %%-%2%T%J%TI%ХT.%TT%B +%6%T%C%TG%ɨT8%T,%  B% $%!#s%>># >,,,,Ŝ,,I{>ׅ !%>>#ӾT6%N %QQ%"$L%$%7%$%> >B % $%6%N %g%D%%>>> > >ggg cgcثq1ȡ>B % $%E%N %%Ԇ+%6%T%C%T˅G%ɨT8%T,ۆ%  B% $%!#p%>># >,,,,Ŝ,,I{>ׅ !%>>#Tއ6%N %QQ%"$L%$%ˆ#%$ň%> >B ʈ% $ψ%!%H%E An iterator over all non-overlapping captures for a fallible search.%L%I The iterator yields a `Result` value until no more܀%T%'%ҝTȌ%̌D%T%9%Tύ%Ӎ6%T%J%TَN%T%T%A%> This iterator is created by [`Searcher::into_captures_iter`].%̃%|%N %Ja%*,Ő%Ő%tې%$ې%L%4%"%%%N %%ϓ.%2%T%J%TΒI%ХT.%TT֓%B &x%%̤%>>># >,,,,Ŝ,,I{> >%>>>#T:%N ǔ%QQÔ%"$L%$•%:%$%> >ɸB % $%<Ɨ% 7%̙%ƙ%N %g%D%%>>> > >ggg cgcثq1ȡ>B % $%0u%Т%ʢ%>>># >,,,,Ŝ,,I{> >£%>>>#T:%N %QQ%"$L%$%&%$%> >B % $%d ; A lazily initialized value for safe sharing between threads. The principal type in this module is `Lazy`, which makes it easy to construct values that are shared safely across multiple threads simultaneously. $ ;cL ?< A lazily initialized value that implements `Deref` for `T`.JG A `Lazy` takes an initialization function and permits callers from anyIF thread to access the result of that initialization function in a safeOL manner. In effect, this permits one-time initialization of global resources+( in a (possibly) multi-threaded program.OL This type and its functionality are available even when neither the `alloc`JG nor the `std` features are enabled. In exchange, a `Lazy` does **not**IF guarantee that the given `create` function is called at most once. ItKH might be called multiple times. Moreover, a call to `Lazy::get` (eitherMJ explicitly or implicitly via `Lazy`'s `Deref` impl) may block until a `T` is available.KH This is very similar to `lazy_static` or `once_cell`, except it doesn'tLI guarantee that the initialization function will be run once and it worksIF in no-alloc no-std environments. With that said, if you need stronger KH guarantees or a more flexible API, then it is recommended to use either ! `lazy_static` or `once_cell`.  " # Warning: may use a spin lock  MJ When this crate is compiled _without_ the `alloc` feature, then this type JG may used a spin lock internally. This can have subtle effects that may KH be undesirable. See [Spinlocks Considered Harmful][spinharm] for a more %" thorough treatment of this topic.  VS [spinharm]: https://matklad.github.io/2020/01/02/spinlocks-considered-harmful.html l /  KH This type is useful for creating regexes once, and then using them fromKH multiple threads simultaneously without worrying about synchronization.</EB use regex_automata::{dfa::regex::Regex, util::lazy::Lazy, Match};OL static RE: Lazy = Lazy::new(|| Regex::new("foo[0-9]+bar").unwrap());/, let expected = Some(Match::must(0, 3..14));85 assert_eq!(expected, RE.find(b"zzzfoo12345barzzz"));</$N Nlc 8TzB' hB y{~ BN N )IF Create a new `Lazy` value that is initialized via the given function.FC The `T` type is automatically inferred from the return type of the `create` function given.B I8 # N #LN   35#74 Return a reference to the lazily initialized value.C@ This routine may block if another thread is initializing a `T`.HE Note that given a `x` which has type `Lazy`, this must be called viaFC `Lazy::get(x)` and not `x.get()`. This routine is defined this way63 because `Lazy` impls `Deref` with a target of `T`.d0GD This panics if the `create` function inside this lazy value panics.IF If the panic occurred in another thread, then this routine _may_ also+( panic (but is not guaranteed to do so).> > >B   95T N TLN ""79\4,> > >B  $;T N gTTLN g@B4??? ? ?ggg cgcثq1ȡ?B  $:D$cȄ\!Ȅ! AtomicPtrLaD $~FQS@B1"$"N "N "!ԧI|ne-/24"$" L"4"Ԉ&,& +?N +N +$+ $+$+ $+RTWY+N +N +-0-B ~</ T /N /TL/N /+-11? ? ?B 1 $1<$<? ?řǙșəʙ˙G*R{9  ?B < $<?;T ?N ?TT?TL?N ?g8:@4@??? ? ?ggg cgcثq1ȡ?B @ $@CIAN AN A# "A$A? ?B A $Ad ; Types and routines for working with look-around assertions. This module principally defines two types: * [`Look`] enumerates all of the assertions supported by this crate. * [`LookSet`] provides a way to efficiently store a set of [`Look`] values. * [`LookMatcher`] provides routines for checking whether a `Look` or a `LookSet` matches at a particular position in a haystack. $ ;'(((((L&&$\FL68#6JG Flip the look-around assertion to its equivalent for reverse searches.663 For example, `StartLF` gets translated to `EndLF`.77FC Some assertions, such as `WordUnicode`, remain the same since they7GD match the same positions regardless of the direction of the search.D8B #bC!@HE Return the underlying representation of this look-around enumerationAEB as an integer. Giving the return value to the [`Look::from_repr`]BIF constructor is guaranteed to return the same look-around variant thatBFC one started with within a semver compatible release of this crate.:7 Checks that all assertions in this set can be matched.œKH Some assertions, such as Unicode word boundaries, require optional (butFC enabled by default) tables that may not be available. If there areݝKH assertions in this set that require tables that are not available, then this will return an error.О؞0- Specifically, this returns an error when theC@ `unicode-word-boundary` feature is _not_ enabled _and_ this set՟/, contains a Unicode word boundary assertion.1. It can be useful to use this on the result ofǠB? [`NFA::look_set_any`](crate::nfa::thompson::NFA::look_set_any)96 when building a matcher engine to ensure methods like̡=: [`LookMatcher::matches_set`] do not panic at search time.LÜĜŜƜǜȜ_wB $ˣ!g@??? ? ?ggg cgcثq1ȡ?B  $ 쳧QQLק$ܧ"$? ?!B  $=: Creates a new default matcher for look-around assertions.B C@= Sets the line terminator for use with `(?m:^)` and `(?m:$)`.KH Namely, instead of `^` matching after `\n` and `$` matching immediatelyٶHE before a `\n`, this will cause it to match after and before the byteTUC@ It can occasionally be useful to use this to configure the line:7 terminator to the NUL byte when searching binary data.ĸ̸DA Note that this does not apply to CRLF-aware line anchors such asFC `(?Rm:^)` and `(?Rm:$)`. CRLF-aware line anchors are hard-coded to use `\r` and `\n`.? ?UB  $$'EB Returns the line terminator that was configured for this matcher.û˻A> If no line terminator was configured, then this returns `\n`.KH Note that the line terminator should only be used for matching `(?m:^)`EB and `(?m:$)` assertions. It specifically should _not_ be used for?< matching the CRLF aware assertions `(?Rm:^)` and `(?Rm:$)`.? ?B  $EľIF Returns true when the position `at` in `haystack` satisfies the givenԒ look-around assertion.d0ʿҿHE This panics when testing any Unicode word boundary assertion in thisKH set and when the Unicode word data is not available. Specifically, thisHE only occurs when the `unicode-word-boundary` feature is not enabled.GD Since it's generally expected that this routine is called inside ofDA a matching engine, callers should check the error condition whenEB building the matching engine. If there is a Unicode word boundaryHE in the matcher and the data isn't available, then the matcher should fail to build.FC Callers can check the error condition with [`LookSet::available`].DA This also may panic when `at > haystack.len()`. Note that `at ==96 haystack.len()` is legal and guaranteed not to panic.<?? ? ?ȚB  $¥̥zt?? ? ?ȚB "$2=GrKH Returns true when _all_ of the assertions in the given set match at the# given position in the haystack.d0HUKUHUGUDUEUHUUFUDU9U\?? ? ?ȚB  $Q\f?? ? ?ȚB "$(}t?? ? ?B  $$ʀހDՎU;JG Returns true when [`Look::Start`] is satisfied `at` the given position in `haystack`.d0?< This may panic when `at > haystack.len()`. Note that `at ==9UD?? ? ?ȚB "$#8KH Returns true when [`Look::End`] is satisfied `at` the given position in|֘Ld0?Uϙ9U4?? ? ?ȚB "$~=C@ Returns true when [`Look::StartLF`] is satisfied `at` the givenƛLd0?U˜9U\?? ? ?ȚB "$S]Ġ;JG Returns true when [`Look::EndLF`] is satisfied `at` the given positionUd0?U9ULˠ?? ? ?ȚB ՠ"$֠?ҡEB Returns true when [`Look::StartCRLF`] is satisfied `at` the givenܜLdĢ0բݢ?U9Ul?? ? ?ȚB "$=C@ Returns true when [`Look::EndCRLF`] is satisfied `at` the givenܽLݦd0?U§9U\?? ? ?ȚB "$:D?EB Returns true when [`Look::WordAscii`] is satisfied `at` the given˪Ld0?UЫ9Ul?? ? ?ȚB "$Xb԰FKH Returns true when [`Look::WordAsciiNegate`] is satisfied `at` the given܃Ld0į?U9U۰?? ? ?ȚB "$˵ұGD Returns true when [`Look::WordUnicode`] is satisfied `at` the givenܞLdƲ0ײ߲?U9Ud1;8 This returns an error when Unicode word boundary tables´>; are not available. Specifically, this only occurs when the30 `unicode-word-boundary` feature is not enabled.|ҵ?? ? ?Ț"B "$GD Returns true when [`Look::WordUnicodeNegate`] is satisfied `at` theĸ! given position in `haystack`.d0?UϹ9Ud1;V>уV3V?? ? ?Ț"B "$EJG Returns true when [`Look::WordStartAscii`] is satisfied `at` the givenܨLd0?U9U?? ? ?ȚB "$GQCHE Returns true when [`Look::WordEndAscii`] is satisfied `at` the givenLd0?U9U?? ? ?ȚB "$FC Returns true when [`Look::WordStartUnicode`] is satisfied `at` the!Vd0?U9Ud1;V>уV3V?? ? ?Ț"B "$%/DA Returns true when [`Look::WordEndUnicode`] is satisfied `at` the!Vd0?U9Ud1;V>уV3V?? ? ?Ț"B "$iHE Returns true when [`Look::WordStartHalfAscii`] is satisfied `at` the!Vd0?U9U?? ? ?ȚB "$WaHFC Returns true when [`Look::WordEndHalfAscii`] is satisfied `at` the!Vd0?U9U?? ? ?ȚB "$JG Returns true when [`Look::WordStartHalfUnicode`] is satisfied `at` the!Vd0?U9Ud1;V>уV3VԞ?? ? ?Ț"B "$r|HE Returns true when [`Look::WordEndHalfUnicode`] is satisfied `at` the!Vd0?U9Ud1;V>уV3V?? ? ?Ț"B "$?I܏<B 6A> Returns an error if and only if Unicode word boundary data is unavailable.,UB 3|Ê4gD??? ? ?ggg cgcثq1ȡ?B  $ !Ă`kd$D,UB u? ?Ț"B #GQu? ?Ț"B ƥ#u&B##d ;# A thread safe memory pool. The principal type in this module is a [`Pool`]. It main use case is for holding a thread safe collection of mutable scratch spaces (usually called `Cache` in this crate) that regex engines need to execute a search. This then permits sharing the same read-only regex object across multiple threads while having a quick way of reusing scratch space in a thread safe way. This avoids needing to re-create the scratch space for every search, which could wind up being quite expensive.  ;́ ;$ ;^ '=: A thread safe pool that works in an `alloc`-only context.((KH Getting a value out comes with a guard. When that guard is dropped, the(JG value is automatically put back in the pool. The guard provides both a)LI `Deref` and a `DerefMut` implementation for easy access to an underlyingD* `T`.**NK A `Pool` impls `Sync` when `T` is `Send` (even if `T` is not `Sync`). This*NK is possible because a pool is guaranteed to provide a value to exactly one+ thread at any time.++NK Currently, a pool never contracts in size. Its size is proportional to the,GD maximum number of simultaneous uses. This may change in the future.,,KH A `Pool` is a particularly useful data structure for this crate because-KH many of the regex engines require a mutable "cache" in order to execute.NK a search. Since regexes themselves tend to be global, the problem is then:.B? how do you get a mutable cache to execute a search? You could://NK 1. Use a `thread_local!`, which requires the standard library and requires//, that the regex pattern be statically known.0 2. Use a `Pool`.0MJ 3. Make the cache an explicit dependency in your code and pass it around.1KH 4. Put the cache state in a `Mutex`, but this means only one search can1 execute at a time.1+( 5. Create a new cache for every search.22OL A `thread_local!` is perhaps the best choice if it works for your use case.2MJ Putting the cache in a mutex or creating a new cache for every search are3LI perhaps the worst choices. Of the remaining two choices, whether you use4MJ this `Pool` or thread through a cache explicitly in your code is a matter430 of taste and depends on your code architecture.55"T55KH When this crate is compiled _without_ the `std` feature, then this type5JT6KT7%T77VT8l8/88HE This example shows how to share a single hybrid regex among multiple8EB threads, while also safely getting exclusive access to a hybrid's9LI [`Cache`](crate::hybrid::regex::Cache) without preventing other searches:41 from running while your thread uses the `Cache`.:<:/:/:&# hybrid::regex::{Cache, Regex},;'$ util::{lazy::Lazy, pool::Pool},t;04;ݥ/;; static RE: Lazy =;:7 Lazy::new(|| Regex::new("foo[0-9]+bar").unwrap());<%" static CACHE: Lazy> =<63 Lazy::new(|| Pool::new(|| RE.create_cache()));==/T=JG assert_eq!(expected, RE.find(&mut CACHE.get(), b"zzzfoo12345barzzz"));<>/$>N >Nl>4E#B h#B y{~ >T>$#>N >N > ?#>DA Create a new pool. The given closure is used to create values in? the pool when necessary.?B…$BG>@DVAVAAKH When the `std` feature is enabled, a `Pool` is thread-aware and spreadsBIF its memory out across multiple cache lines. The number of cache linesBHE is determined by the `capacity` parameter passed here. By default, aCJG fixed reasonable number is used. A smaller number means less memory isCHE used, but a higher number means there may be less contention on thisDJG pool in highly threaded environments doing a lot of searches using theE same `Regex` value.EEEB When `std` is not enabled, then the capacity parameter is ignoredEC@ because the underlying pool implementation is not thread-aware.FFDA The capacity must be at least 1. If it's less than 1, then it isG forced to be 1.lGB$r | LCHDVIVIIHE This is a convenience routine for calling `Pool::with_capacity` withJJG a number equivalent to the available parallelism for this environment.JJEB If `std` is not enabled or if the query for available parallelismK;8 failed, then this is equivalent to calling `Pool::new`.L#B  M$MM1M$M$N$P&T QN Q߁U$PTLQN P  02X(Q?< Get a value from the pool. The caller is guaranteed to haveQFC exclusive access to the given value. Namely, it is guaranteed thatRGD this will never return a value that was returned by another call toR-* `get` but was not put back into the pool.SSGD When the guard goes out of scope and its destructor is called, thenTC@ it will automatically be put back into the pool. Alternatively,THE [`PoolGuard::put`] may be used to explicitly put it back in the poolU&# without relying on its destructor.UUEB Note that there is no guarantee provided about which value in theVGD pool is returned. That is, calling get, dropping the guard (causingVEB the value to go back into the pool) and then calling get again isWIF *not* guaranteed to return the same value received in the first `get`LW call.X? ? k"`?B X $XX<N XN YTXg#%(*Y@Y??? ? ?ggg cgcثq1ȡ?B Y $Y  ZJG A guard that is returned when a caller requests a value from the pool.ZZJG The purpose of the guard is to use RAII to automatically put the value['$ back in the pool once it's dropped.L[ \ \$\#L\# \˖k"`Bß B \ԟ\\3V \V \V$\VL\V \\68_%\74 Consumes this guard and puts it back into the pool.]]JG This circumvents the guard's `Drop` implementation. This can be useful^JG in circumstances where the automatic `Drop` results in poorer codegen,^*' such as calling non-inlined functions._? k"`?B_  v _HV `V `V$_VL`V _""_ "EG\`4``,`? ? ?B ` $`aKV aV aV$aVLaV a"a>@a!La? ? ?B b $bb_V bV bV$bgbVLbV bgbNPc@c??? ? ?ggg cgcثq1ȡ?B c $c  Ld|dd,d((($Td2»;le;Te AtomicUsize\eDe ee=fC,f6df$ddd/db,eTeDfsf\fhUWga+\>+ B&&4?+t?+LG+DI+F This attempts to extract prefixes from the given `Hir` expression forEF+C the given match semantics, and if possible, builds a prefilter forLF+ them.F+lF+/F+FH+E This example shows how to build a prefilter directly from an [`Hir`]GH+E expression, and use to find an occurrence of a prefix from the regexdG+/G++4Ί+@@ @( @ȚŞB Պ+ ($֊+D܊+Ŝ$+܋ +dߋ+@ @(B + ($+ԏ+<+@ @(B + ($+Ǎ2++̭+4܍+ATύ+ ̍++$+@ @2B + $+;+$+@@ @ @ȚŞB + $+T Ŝ_ =+4+@@ @ @ȚŞB + $+N ŜY ё+dԑ+@ @B + $+ג+<ڒ+@ @B + $+\+j++@ @%&B +W +W\+& % "$+&n+++D+@ @&B +A +A̶+&  "$n+++D+@ @&B +A +A̾+ $+$+*, ; , Lower level primitive types that are useful in a variety of circumstances. # Overview This list represents the principle types in this module and briefly describes when you might want to use them. * [`PatternID`] - A type that represents the identifier of a regex pattern. This is probably the most widely used type in this module (which is why it's also re-exported in the crate root). * [`StateID`] - A type the represents the identifier of a finite automaton state. This is used for both NFAs and DFAs, with the notable exception of the hybrid NFA/DFA. (The hybrid NFA/DFA uses a special purpose "lazy" state identifier.) * [`SmallIndex`] - The internal representation of both a `PatternID` and a `StateID`. Its purpose is to serve as a type that can index memory without being as big as a `usize` on 64-bit targets. The main idea behind this type is that there are many things in regex engines that will, in practice, never overflow a 32-bit integer. (For example, like the number of patterns in a regex or the number of states in an NFA.) Thus, a `SmallIndex` can be used to index memory without peppering `as` casts everywhere. Moreover, it forces callers to handle errors in the case where, somehow, the value would otherwise overflow either a 32-bit integer or a `usize` (e.g., on 16-bit targets). * [`NonMaxUsize`] - Represents a `usize` that cannot be `usize::MAX`. As a result, `Option` has the same size in memory as a `usize`. This useful, for example, when representing the offsets of submatches since it reduces memory usage by a factor of 2. It is a legal optimization since Rust guarantees that slices never have a length that exceeds `isize::MAX`. T ;))))))))))*****+++++ NonZeroUsized , ,C, ,,ݗ,˜, ,| , ,̸ , ,wyegSUAC,/,4,1 Create a new `NonMaxUsize` from the given value.,K,H This returns `None` only when the given value is equal to `usize::MAX`.,Bt ̩,I,F Return the underlying `usize` value. The returned value is guaranteed, to not equal `usize::MAX`.,B %,g@,,AAA A Aggg cgcثq1ȡAB , $, ,|3,ׁ̈4,3, The maximum index value.93,93,3:,3E,4,ׁ7,6H,E The total number of values that can be represented as a small index.,7,ԁ8,7, The zero index value.$8,ׁ9,8A,> The number of bytes that a single small index uses in memory.$9,:?,9, Create a new small index.9,9E,B If the given index exceeds [`SmallIndex::MAX`], then this returnsl:,8:,B ?6,;E,B Create a new small index without checking whether the given value< , exceeds [`SmallIndex::MAX`].<, Using this routine with an invalid index value will result in=I,F unspecified behavior, but *not* undefined behavior. In particular, an=I,F invalid index value is likely to cause panics or possibly even silent>, logical errors.>,>J,G Callers must never rely on a `SmallIndex` to be within a certain range?, for memory safety.l?,ׁB'Z A',@I,F Like [`SmallIndex::new`], but panics if the given index is not valid.$A,ׁB  C%,BE,B Return this small index as a `usize`. This is guaranteed to neverC, overflow `usize`.DC,A AׁB C,$C,E!,DC,@ Return this small index as a `u64`. This is guaranteed to neverlE, overflow.4E,A AׁB E,'$E,G!,FH,E Return the internal `u32` of this small index. This is guaranteed tőG, never overflow `u32`.4G,A AׁB G,¼'$G,I!,GJ,G Return the internal `u32` of this small index represented as an `i32`.H2,/ This is guaranteed to never overflow an `i32`.4I,A AׁB I,'$I,K,J6,3 Returns one more than this small index as a usize.J,JK,H Since a small index has constraints on its maximum value, adding `1` toK7,4 it will always fit in a `usize`, `u32` and a `i32`.DL,A AׁB L,$L,NZ,LH,E Decode this small index from the bytes given using the native endianM&,# byte order for the current target.M,MH,E If the decoded integer is not representable as a small index for theN/,, current target, then this returns an error.lN,ȫ"B' N,S<,QH,XQ&,XR,RJ,G This is analogous to [`SmallIndex::new_unchecked`] in that is does notRH,E check whether the decoded integer is representable as a small index.S,ȫ"ׁB( S,U$,TK,H Return the underlying small index integer as raw bytes in native endian\U, format.\U,A Aׁȫ"B U,($U, U,V,,N V,\V,4V,V(,,V,A Aׁ AB V, $V, W/,N W,#W4,LW,A Aׁ AB X, $X, X/,X,X,N X,\Y,4Y,Y(,,Y,A Aׁ AB Y, $Y, Z2,Z,̧Z,N Z,#[4,L[,A Aׁ AB [, $[, [,ׁ\ ,$\,ׁB ,\,\ ,ׁT],,],Є]>,D],B ,],_ ,ׁT_,,_,Є`>,D`,B ,`,b ,ׁTb,,b,Єb>,Db,B ,b,d",ׁTe,,e,Єe@,De,B ,e,l,Єm,lC,@ Returns the value that could not be converted to a small index.Lm,A AЄB m, $m,n*,|n,n,Єn+,Єgn@,n,AAA AЄ Aggg cgcثq1ȡAB o, $o, o,q ,΅QQLq,$q,ׁr(,$r,A A΅B r, $r,u,u, u, , u, v,, u,8 $u,& u,8,u,$ u,, u,8u,& u,8,u,$ u,, u,8$u,& v,8,v,$ v,, v,8withiterDv,& v,8,v,*v, v, ,8$v,, v,8 $v, v, ,< The maximum value.v,8v,8,v,8Dv,& v,, v,8 $v, v,, v,8 $v, w, w,8Tw,'w,8Dw,% w,<4 The total number of values that can be represented.w7,8w,8,w,8&,w,& w,8,w, w,8Tw,'x,8&,x,% x,< The zero value.x,8x,8,x,8$x,& x,, x,8 $x, x,, x,8 $x, x, x,8Tx,'x,8$x,% x,<8 The number of bytes that a single value uses in memory.x;,8y,8,y,8$y,& y,8,y, y,8Ty,'y,8$y,% y,<; Create a new value that is represented by a "small index."y>,<z,<@ If the given index exceeds the maximum allowed value, then thiszC,< returns an error.{,+ {, {, {,84{,8{,8 {,8 {, {, {,8,{,& {,8,{,({,84{, {,, |,8 $|,$ |,, |,8|, |, |, |, 8T|,'|,8 |, |, |,8,|, |,8 |, |, |,, |,8 $|, |,8 <|, |, |,, |,8|,<? Create a new value without checking whether the given argument|B,< exceeds the maximum.Ĺ},<},<8 Using this routine with an invalid value will result in};,<7 unspecified behavior, but *not* undefined behavior. In~:,<= particular, an invalid ID value is likely to cause panics or~@,<% possibly even silent logical errors.(,<,<< Callers must never rely on this type to be within a certain?,< range for memory safety.ۀ,+ , , ,84,8,8,,8 ,8 l, , ,8,,& ,8,,(Á,, Ɓ,8 $ǁ, ́, ,, ށ,8 $߁, , ,8T,',8 l, , ,8,,<8 Like `new`, but panics if the given value is not valid.;,+ , , ,84,8,8 ,8$, , ,8,,& ,8,,(,, ,8 $, , ل,, ,8 $,',8 , , ă,8,, Ń,84ƃ, ̃, ˄,84̓, Ӄ, ԃ, ʄ,7invalid T,$ ,8L, , , ,, ,8 $,$ ,7 valueD,<> Return the internal value as a `usize`. This is guaranteed toA,< never overflow `usize`.ܶ,+ ޅ, ߅, ,84,8,8,,8 ,8D, , , ,8$,(,8,, , ʆ,8$, ,7 , ,8D, , ,<< Return the internal value as a `u64`. This is guaranteed toن?,< never overflow.,+ Ň, Ƈ, ͇,84LJ,8ۇ,8,߇,8 ,84, , , ,8$,(,8, , ,8$, ,7 , ,84, , ,<< Return the internal value as a `u32`. This is guaranteed to?,<X̆,+ , , ,84,8‰,8,Ɖ,8 ̉,84ω, Չ, ۉ, ։,8$׉,(݉,8, , ,8$, ,7 , ,84, , ,<; Return the internal value as a i32`. This is guaranteed to>,< never overflow an `i32`.,+ , , ,84,8,8,,8 ,84, , ċ, ,8$,(Ƌ,8ɋ, ͋, ,8$ߋ, ,7 , ,84, , ,<- Returns one more than this value as a usize.0,<nj,<= Since values represented by a "small index" have constraints׌@,<> on their maximum value, adding `1` to it will always fit in aA,< `usize`, `u32` and a `i32`.,+ , , ,84,8,8 ,8D, Î, Ɏ, Ď,8$Ŏ,(ˎ,8,Ύ, Ԏ, ,8$, ,7 , ,8D, , ,<? Decode this value from the bytes given using the native endianB,<X&,<,<= If the decoded integer is not representable as a small index@,<4 for the current target, then this returns an error.7,+ , , ,84,8̑,8 Б,8lӑ, , ,8,,& , , ,8,% ,7 ,(,84, ,, ,8 $,$ ,, ,8, , , , 8T,',8l, , ,8,, ,8 , , Ē,, ,8 $, Œ,8 <ƒ, ͒, Ғ,, Β,8ϒ,<YB,<X&,<,<? This is analogous to `new_unchecked` in that is does not checkB,<? whether the decoded integer is representable as a small index.ДB,+ , , ,84,8,8 ,8, ӕ, ,8,ԕ,& ٕ, ە, ,8ܕ,% ޕ,7 ,(,, ,8 $, , ,, ,8 $, , ,8T,',8, , ,8,,<< Return the underlying integer as raw bytes in native endian̖?,<X\,+ , , ,84,8Ɨ,8 ʗ,8\͗, ؗ, ޗ, ٗ,8$ڗ,(, , ,8,% ,7 , , ,8$, ,7 , ,8\, , ,<9 Returns an iterator over all values from 0 up to and not<,< including the given length.,<,<9 If the given length exceeds this type's limit, then this<,<S\,8, , ,8,,8 ,8$, , ,8,& ,8,,(,, ,8$, , ,, ͚,8$Κ,'Қ,8 Ԛ, ך, ۚ,8ؚ,8$,8$,',8,',8q,,8 ,, ,8 $, , ԝ, 8 ,8, , ՜,  ,8$,$ ,8 ,& , ,8,8$,'Ŝ,8ǜ,'ʜ,8L̜,(ל,8$ڜ,'ޜ,8,',84, , ʝ, 8 , ,8 debug_tuple\, , ,8L, , , ,, ,8 $, ,8,, , , ,8$, ,84, , , ,84, , ,8$ߝ, ,8 , ,8$,',8 ,',8Index,, ,, ,8 $, ,8 , , ,8 , , ,8!$,84, ,8 ,% ,+ , , ,84,8 ɞ,8,̞, ў, , Ҟ,8$Ӟ,$ מ,8,ٞ,& ޞ,, ,8 $,(, ,8 , , , ,8$, , ,8,, ,8D, , ,8$, ,8 , ,8$,'ğ,8 Ɵ,'ɟ,8IndexMutD˟, ӟ,, ԟ,8 $՟, ٟ,8 ۟, ߟ, ,8 , , , + , , ,84,8 ,8L, , , ,8,8$,$ ,8,,& ,, ,8 $,(, ,8,8 , , , ɠ,8ʠ,8$Π, Ҡ, ,8,Ӡ, ؠ,8D٠, , ,+ , , ,8, , ,8<, ,7<,8$, ,8 , ,8$,',8 ,',8ͣY,, ,, ,8 $¡, ơ,8 ȡ,8̡, ϡ,8 С, ѡ, ӡ, ,8!$,84, ,8 ,% ,+ , , ,84,8 ,8,, , , ,8$,$ ,8,,& ,, ,8 $,(, ,8 , , , ˢ,8$̢, Т, ,8,Ѣ, ֢,8Dע, ߢ, ,+ , , ,8, , ,8<, ,7<,8$, ,8 , ,8$,',8 ,',8§YD, ,, £,8 $ã, ǣ,8 ɣ,8ͣ, У,8 ѣ, ң, ԣ, , + , , ,84,8 ,8L, , , ,8,8$,$ ,8,,& ,, ,8 $,(, ,8,8 , , , ,8,8$, ä, Ԥ,8,Ĥ, ɤ,8Dʤ, Ҥ, Ӥ,8$,8$, ,8, ,8 ,, ,8 $, , ,8 ,8$, , ,8,,& ,8,(,, ,8 $, , ,, ˥,8 $̥, Х, ,8Tѥ,'ۥ,8$ݥ, , ,8,,8$,8<, ,8, ,8 ,, ,8 $, , ,8!$,8,, ,, ¦,8æ,% Ʀ,8 զ,8Dئ, , ,8,,& ,8,(,84, ,, ,8 $,$ ,, ,8, , , ק, 8T,',8D, , ,8,, ,8 , , ,, ,8 $, ,8 <, ħ, ɧ,, ŧ,8Ƨ,8$,8<, ,8, ,8 ,, ,8 $, , ©,8!$,8,, ,, ,8,% ,8 ,8D, , ̨,8,¨,& Ǩ,8ɨ,(Ψ,84Ѩ, ר,, ب,8 $٨,$ ݨ,, ߨ,8, , , , 8T,',8D, , ,8,, ,8 , , ,, ,8 $, ,8 <, , ,, ,8,8$ͩ,8<ҩ, ٩,8ک, ݩ,8 ߩ,, ,8 $, , ,8!$,8,, ,, ,8,% ,8 ,8D, , ,8,,& ,8,(,84, ,, ,8 $,$ ,, ,8, Ī, ƪ, , 8Tت,',8D, , ,8,, ,8 , , ,, ,8 $, ,8 <, , ,, ,8,8$,8<, ,8,, ,8 «,, ƫ,8 $ǫ, ̫, ,8!$ګ,8,߫, ,, ,8,% ,8 ,8D, , ,8,,& ,8,,(,84, ,, ,8 $,$ ,, ,8, , , , 8T,'Ǭ,8Dɬ, Ѭ, ׬,8,Ҭ, ج,8 ٬, ܬ, ,, ݬ,8 $ެ, ,8 <, , ,, ,8,+ , , ,8, , ,8$,8$,8 quickcheckT,',8 ArbitraryL,8 í,, ǭ,8 $ȭ, ͭ, ֮,8 ۭ,8 arbitraryLޭ, , ,85,& , ,8,8YT,',8Gen,(,, ,8 $, , ̮,, ,8 $, , ,8T,',8YL, , ,85,<9 This error occurs when a value could not be constructed.<,<,<@ This occurs when given an integer exceeding the maximum allowedC,<OT,<,<? When the `std` feature is enabled, this implements the `Error`B,< trait.T,+ , , ,84, , ,8e,,$ ,8q,,$ ,8~,$ ,8L,8,84,, ,8, , ɱ,8|,% ʱ,8$ձ,, ڱ,8۱, ߱, ,<8 Returns the value that could not be converted to an ID.;,8,8 ,8EL, Ų, ˲, Ʋ,8$Dz,(Ͳ,8в, Բ, ,8$, ,7 , ,8EL, , ,+ , , ,8, , ,8<, ,7,,8$,8,'³,8@,ij,'ɳ,8,˳,8 ѳ,, ճ,8ֳ, ڳ, ۳,8$,8$,',8,',8u<,8 ,, ,8, , , 8 ,8, , ,  ,8$,$ ,8 ,& , ,8,8$,',8,',8L,(,8$Ĵ,'ȴ,8ʴ,'ʹ,84ϴ, ִ, ۶,8write,, , , Ͷ,8 ,$ ,71failed to create {} from {:?}, which exceeds {:?}3,$ ε,8L, , , ,, ,8 $,$ ,8$, ,8EL, , ,$ ,, ,8 $,',8D,$ ,+ , , ,84, , ,8e,,$ ,8q,,8, , ,8,,84,, ,8$, , ,8t,% ,8$·,, Ƿ,8$ȷ, ͷ, Ӻ,8 ۷,8 ޷, , ,8,& ,8,,(,, ,8$, , ɺ,84, , , ,8,,, ,8 $,',8&,,$ ,7Xcannot create iterator for {} when number of \ elements exceed {:?}ϸZ,$ ,8L, ȹ, ɹ, Ϲ,, ʹ,8 $˹,$ й,, ,8 $,',8&,,$ ,% ,, ,8$, , ,8t, , ,8,& ,7 ,!,8,8$޺,8D,8 ,, ,8$, , ,8!$,8$, ,, ,8 $,% ,8 ,8 $, , , ,8,8$,(,84, ,, ,8 $», ƻ, Ȼ, , 8$ڻ, ޻,7 ߻, ,8 $, , , ,8 , , ,, ,8 $,<D An iterator adapter that is like std::iter::Enumerate, but attachesG,<@ small index values instead. It requires `ExactSizeIterator`. AtC,<? construction, it ensures that the index of each element in theB,<A iterator is representable in the corresponding small index type.D,+ Ⱦ, ɾ, ޾,84ʾ, о, ݾ,8e,Ѿ,$ ־,8q,ؾ,8, , ,8,,84,, ,8XD, ,8 , , , , 8,& ,8 ,$ ,8,& ,, ,8$,$ ,8$ǿ, ˿,8 ̿,& Ϳ,8DϿ, ؿ,8ExactSizeIteratorڿ, ,, ,8XD, ,8 , , , , 8 ,8 , , ,8,& ,8 ,(,, ,8XD, ,8 , , , , 8,8, ,, ,8 $,',8$, , ,8, ,8, , ,% ,, ,8XD, , ,8,$ ,8,8$, ,8 ,& ,8D, ,8Y, ,8D,8 ,, ,8XD, ,8 , , , ,8!$,8$, , , ,, ,8 $,$ ,8 ,',8$,% ,8 ,8 $, , , ,8,8$,(,84, , , ,, ,8 $,$ ,8 ,',8$, , , ,8,8$, ,8$, ,8, ,8 $, , ,- ,% ,8,8C, ,8$, ,8, ,8 $, , , ,84, , ,% ,8$, , , , ,8C,$ ,8$,% ,+,,2,Q(D,2.Y!2:Y-g,,((B(,,Q(, (O3 c,t,((BY,,Y, (4 (,I ,ID,l ;LG Provides helpers for dealing with start state configurations in DFAs. , ;+++\k(žD-,,$,t,\ReR0uwdfRMV$FH46\"#"-* Create a new default start configuration.""KH The default is an unanchored search that starts at the beginning of thel#=#B &6$DA A convenience routine for building a start configuration from an$# [`Input`] for a forward search.%%HE This automatically sets the look-behind byte to the byte immediately%GD preceding the start of the search. If the start of the search is at&0- offset `0`, then no look-behind byte is set.&BB B,,,,Ŝ,,I{BB ' `,'( U +6)DY)# [`Input`] for a reverse search.)*HY*C@ following the end of the search. If the end of the search is at+=: offset `haystack.len()`, then no look-behind byte is set.+BB B,,,,Ŝ,,I{BB + `,+18-63 Set the look-behind byte at the start of a search.--JG Unless the search is intended to logically start at the beginning of a.KH haystack, this should _always_ be set to the byte immediately preceding/JG the start of the search. If no look-behind byte is set, then the start/IF configuration will assume it is at the beginning of the haystack. For0'$ example, the anchor `^` will match.0030 The default is that no look-behind byte is set.\1 B $1$1232&# Set the anchored mode of a search.22(% The default is an unanchored search.D2إB $2$24+3EB Return the look-behind byte in this configuration, if one exists.|4B B B 4 $45&430 Return the anchored mode in this configuration.d5B BإB 5 $5<Ő>6>B BŐB > lookm,>?K+KB BŐB K $K8 NhTNB BȚÜĜŜƜǜȜ_wŐ֕B N ,NPUeDUBB BŐ BȚNB U $UĨUY*dYB BŐB Y $YY&ŐgY@YBBB BŐ Bggg cgcثq1ȡBB Y $Y ZZLZTpq3TqřǙșəʙ˙G*R{9 B  qttB v ,vB BB v($vy&DyB BB yЩ $yt ;- Utilities for dealing with the syntax of a regular expression. This module currently only exposes a [`Config`] type that itself represents a wrapper around the configuration for a [`regex-syntax::ParserBuilder`](regex_syntax::ParserBuilder). The purpose of this wrapper is to make configuring syntax options very similar to how other configuration is done throughout this crate. Namely, instead of duplicating syntax options across every builder (of which there are many), we instead create small config objects like this one that can be passed around and composed.  ; ;4 ;+-=-CO- O$--,-l-,-D-d-z| -o-_aMO;=1-J-G A convenience routine for parsing a pattern into an HIR value with the- default configuration.-l-/-8-5 This shows how to parse a pattern into an HIR value:-<-/%-" use regex_automata::util::syntax;-3-0 let hir = syntax::parse(r"([a-z]+)|([0-9]+)")?;I-F assert_eq!(Some(1), hir.properties().static_explicit_captures_len());-.-Ǭ/<-/,-B BB - N<-K- K-H A convenience routine for parsing many patterns into HIR value with theԀ -Z -l -/ - K-H This shows how to parse many patterns into an corresponding HIR values: -< -/L -@ %-" regex_automata::util::syntax, &-# regex_syntax::hir::Properties,4 -ݥ/ - $-W - r"([a-z]+)|([0-9]+)",̮ - r"foo(A-Z]+)bar",D -1 G-D let props = Properties::union(hirs.iter().map(|h| h.properties())); >-; assert_eq!(Some(1), props.static_explicit_captures_len()); - .-Ǭ/<-/T-B B(B -/ -/T- q>  G-I-F A convenience routine for parsing a pattern into an HIR value using al- `Config`.-l-/-J-G This shows how to parse a pattern into an HIR value with a non-default- configuration:-<-/%-Z-!- let hir = syntax::parse_with(- r"^[a-z]+$",;-8 &syntax::Config::new().multi_line(true).crlf(true),<-ę1@-= assert!(hir.properties().look_set().contains_anchor_crlf());-.-Ǭ/<-/T-BB B BݒB - N<-4-l-K-H A convenience routine for parsing many patterns into HIR values using al-̡Z-l-/-J-G This shows how to parse many patterns into an corresponding HIR values%-" with a non-default configuration:-<-/L-@%-ݜZ&-Z4-ݥ/--4-Zt- r"\W",-Z4-3B-? let config = syntax::Config::new().unicode(false).utf8(false);;-8 let hirs = syntax::parse_many_with(patterns, &config)?;G-Z- assert!(!props.is_utf8());-.-Ǭ/<-/|-BB B Bݒ(B -/ -/T-(B B  "\$-ݒ%-$.-+ Return a new default syntax configuration.%-ݒB ,6-(;-8 Enable or disable the case insensitive flag by default.)-)F-C When Unicode mode is enabled, case insensitivity is Unicode-aware.*B-? Specifically, it will apply the "simple" case folding rules as*- specified by Unicode.*-*D-A By default this is disabled. It may alternatively be selectively+>-; enabled in the regular expression itself via the `i` flag.,-ݒݒB $,-,-10-,>-; Enable or disable the multi-line matching flag by default.---E-B When this is enabled, the `^` and `$` look-around assertions will.H-E match immediately after and immediately before a new line character,.H-E respectively. Note that the `\A` and `\z` look-around assertions are/G-D unaffected by this setting and always correspond to matching at the/#- beginning and end of the input.0-0D-Z0>-; enabled in the regular expression itself via the `m` flag.T1-ݒݒB $1-1-9:-2F-C Enable or disable the "dot matches any character" flag by default.2-2K-H When this is enabled, `.` will match any character. When it's disabled,3F-C then `.` will match any character except for a new line character.4-4I-F Note that `.` is impacted by whether the "unicode" setting is enabled4K-H or not. When Unicode is enabled (the default), `.` will match any UTF-85G-D encoding of any Unicode scalar value (sans a new line, depending on5H-E whether this "dot matches new line" option is enabled). When Unicode6G-D mode is disabled, `.` will match any byte instead. Because of this,7G-D when Unicode mode is disabled, `.` can only be used when the "allow7E-B invalid UTF-8" option is enabled, since `.` could otherwise match8- invalid UTF-8.8-8D-Z9>-; enabled in the regular expression itself via the `s` flag.9-ݒݒB $9-9-?*-:6-3 Enable or disable the "CRLF mode" flag by default.;-;D-Z;>-; enabled in the regular expression itself via the `R` flag.<-<5-2 When CRLF mode is enabled, the following happens:<-F-C `\r` and `\n` as line terminators. And in particular, neither will>$-! match between a `\r` and a `\n`.$?-ݒݒB $?-?-H4-@D-A Sets the line terminator for use with `(?u-s:.)` and `(?-us:.)`.@-@L-I Namely, instead of `.` (by default) matching everything except for `\n`,AF-C this will cause `.` to match everything except for the byte given.A-AK-H If `.` is used in a context where Unicode mode is enabled and this byteBE-B isn't ASCII, then an error will be returned. When Unicode mode isCK-H disabled, then any byte is permitted, but will return an error if UTF-8C/-, mode is enabled and it is a non-ASCII byte.D-DI-F In short, any ASCII value for a line terminator is always okay. But aDH-E non-ASCII byte might result in an error depending on whether UnicodeE#- mode or UTF-8 mode are enabled.E-EH-E Note that if `R` mode is enabled then it always takes precedence andFH-E the line terminator will be treated as `\r` and `\n` simultaneously.G-GC-@ Note also that this *doesn't* impact the look-around assertionsGB-? `(?m:^)` and `(?m:$)`. That's usually controlled by additionalH--* configuration in the regex engine itself.|H-ݒݒB $H-$H-L0-I7-4 Enable or disable the "swap greed" flag by default.I-JK-H When this is enabled, `.*` (for example) will become ungreedy and `.*?`J- will become greedy.J-JD-ZK>-; enabled in the regular expression itself via the `U` flag.TL-ݒݒB $L-L-P7-L2-/ Enable verbose mode in the regular expression.M-MG-D When enabled, verbose mode permits insignificant whitespace in manyMG-D places in the regular expression, as well as comments. Comments areN=-: started using `#` and continue until the end of the line.O-OF-C By default, this is disabled. It may be selectively enabled in theOH-E regular expression by using the `x` flag regardless of this setting.P-ݒݒB $P-P-W--Q8-5 Enable or disable the Unicode flag (`u`) by default.Q-QG-D By default this is **enabled**. It may alternatively be selectivelyR?-< disabled in the regular expression itself via the `u` flag.R-RG-D Note that unless "allow invalid UTF-8" is enabled (it's disabled bySH-E default), a regular expression will fail to parse if Unicode mode isTE-B disabled and a sub-expression could possibly match invalid UTF-8.T-TK-H **WARNING**: Unicode mode can greatly increase the size of the compiledUF-C DFA, which can noticeably impact both memory usage and compilationVH-E time. This is especially noticeable if your regex contains characterVH-E classes like `\w` that are impacted by whether Unicode is enabled orWG-D not. If Unicode is not necessary, you are encouraged to disable it. Set the nesting limit used for the regular expression parser._-`K-H The nesting limit controls how deep the abstract syntax tree is allowed`I-F to be. If the AST exceeds the given limit (e.g., with too many nesteda5-2 groups), then an error is returned by the parser.a-aG-D The purpose of this limit is to act as a heuristic to prevent stackbI-F overflow when building a finite automaton from a regular expression'scD-A abstract syntax tree. In particular, construction currently usescI-F recursion. In the future, the implementation may stop using recursiond0-- and this option will no longer be necessary.d-dH-E This limit is not checked until the entire AST is parsed. Therefore,eI-F if callers want to put a limit on the amount of heap space used, theneG-D they should impose a limit on the length, in bytes, of the concretefG-D pattern string. In particular, this is viable since the parser willgH-E limit itself to heap space proportional to the length of the pattern\g- string.g-gI-F Note that a nest limit of `0` will return a nest limit error for mosthJ-G patterns but not all. For example, a nest limit of `0` permits `a` butiI-F not `ab`, since `ab` requires a concatenation AST item, which resultsiJ-G in a nest depth of `1`. In general, a nest limit is not something thatjE-B manifests in an obvious way in the concrete syntax, therefore, itj)-& should not be used in a granular way.Tk-ݒݒB $k-,k-r+-l+-( Whether to support octal syntax or not.l-lH-E Octal syntax is a little-known way of uttering Unicode codepoints inm@-= a regular expression. For example, `a`, `\x61`, `\u0061` andmI-F `\141` are all equivalent regular expressions, where the last examplen- shows octal syntax.n-nK-H While supporting octal syntax isn't in and of itself a problem, it doesoJ-G make good error messages harder. That is, in PCRE based regex engines,oA-> syntax like `\1` invokes a backreference, which is explicitlypH-E unsupported in Rust's regex engine. However, many users expect it topF-C be supported. Therefore, when octal support is disabled, the errorqI-F message will explicitly mention that backreferences aren't supported.r-r(-% Octal syntax is disabled by default.,r-ݒݒB $r-r-s!-s.-+ Returns whether "unicode" mode is enabled.\s-B BݒB s- $s-t*-t7-4 Returns whether "case insensitive" mode is enabled.t-B BݒB t- $t-u$-u1-. Returns whether "multi line" mode is enabled.tu-B BݒB u- $u-v.-v;-8 Returns whether "dot matches new line" mode is enabled.v-B BݒB w- $w-w-w+-( Returns whether "CRLF" mode is enabled.Dx-B BݒB x- $x-x'-x=-: Returns the line terminator in this syntax configuration.y-B BݒB y- $y-z$-y1-. Returns whether "swap greed" mode is enabled.tz-B BݒB z- $z-{+-z8-5 Returns whether "ignore whitespace" mode is enabled.{-B BݒB {- ${-|-{*-' Returns whether UTF-8 mode is enabled.D|-B BݒB |- $|-|#-|%-" Returns the "nest limit" setting.t}-B BݒB }- $}-}-},-) Returns whether "octal" mode is enabled.L}-B BݒB ~- $~-~7-,~-BB Bݒ BB -($-<-ӃG-L-BB Bݒ BB - $-<-f-L-BB Bݒ BB - $-<-։-ݒ-<-ݒB d ; Types and routines that support the wire format of finite automata. Currently, this module just exports a few error types and some small helpers for deserializing [dense DFAs](crate::dfa::dense::DFA) using correct alignment. $ ;+,,,,< =C<L)t*<)d+$d,̒D*(\d/z|&&D&2B dz$&'*g'@'BBB B Bggg cgcثq1ȡBB ' $' '()|((4֕4<<42֕B 55F62֕B dz$678l72֕B dz$78B8֕B D8,89A|9֕B D9,:;b;֕B L;<;==t=2֕B D=>>>2֕B dz$>?g?2֕B ?dz$?@ntA2֕B Adz$AB+|BB֕C,֕gC@CBBB B֕ Bggg cgcثq1ȡBB C $C CԃDR<RB B  BB R ,RWHWB B[ BB W ,W]@]B B[ B B ] ,]cU|cB BȚÜĜŜƜǜȜ_w֕B dN c ,di9iB BȚB j ,jqFq̪qq̹BN q $qrTB BȚ2ÜĜŜƜǜȜ_w֕B  ,expected_labeltȃ$ϗb\BB B BȚNB  ,Ĩ3|B BB  ,ߙ[B BȚß[B  ,˞gٞB BȚNB N O4 NĨ!#¡3СB mdB BȚß[B  ,expected_versionɦʫplثB BȚNB N O4 N<Ĩ*,Ʈ*ԮB z|B BȚ2ÜĜŜƜǜȜ_w֕B ѱ ,ʱdz$ܱ\ ,F֕UK̑B BȚ[B  ,]B BȚB N O4 NĨ+-zB BȚ2ÜĜŜƜǜȜ_wÇ֕B  ,dz$½vlB BȚ2[B  ,dz$^] ,/֕UGB BȚϬ[B  ,YtBÇ BȚB N O4 NĨ+-|B BȚ2ÜĜŜƜǜȜ_w֕B  ,dz$L[Uڗ:֕U|B BȚ2[B  ,dz$L[Uڗ:֕UqdB BȚ2ÜĜŜƜǜȜ_wϲ[֕B  ,dz$qdB BȚ2ÜĜŜƜǜȜ_wܵ[֕B  ,dz$slB BȚ2ÜĜŜƜǜȜ_w֕B  ,dz$+DB BȚB  , +DB BȚB  , -LB BȚB  ,|B B2[B N  , at_least_lenddz$68k2ß[B   dz$k2ß[B   dz$k2ß[B   dz$[:\B non_padding_len|4222#%LB BȚB ׁ ( ʁĨҁ%LB BȚB  ( Ĩ'TB BȚB  ( Ĩvl݅lAՈ $LB BȚB   Ĩ$LB BȚB   Ĩˈ&TΈB BȚB   وĨˉ$LΉB BȚB   ؉Ĩ$LB BȚB ˊ  ĨƊ&TB BȚB   Ĩ ; ;+ ; +; 6;\ ;<C,<,<,<,|<,D< D<$<'<<(<<)ӿL<-L<-T<-,<+$<|<E\<69'*  ,v1(CB O $OS)gT@TCCC C Cggg cgcثq1ȡCB T $T TUV&DVC CB V $VV.,VޚB $VW)LXC CB X $XXblXC C[B X[Y[̔Y[v1(CB ] $] $uomr/#RB HRB uDuRuuԖyDyC CB y $y|!||C CB | $|dC CB  $dC CB  $LC CB Ɗ $NJLC CB  $䓐LC CB  $œ2lȓC CB ֓ $ד,ݓ5C C[B ӗ $ԗ,PU [?C CB N #P#P $ OQ9C CB N #t# $ OQ%C CB  $&C CB  $&g@CCC C Cggg cgcثq1ȡCB  $ ,UE < {L2>v1({L2>v1( ̹Ն\BE \Ն\B ÷|Ƿ\ڷՆ\߷ԨdC CՆ\B  $!C CՆ\B  $ҿտC CՆ\B  $C CՆ\B  $LC CՆ\B  $LC CՆ\B  $DlC CՆ\B \#\[#\[< \$TVDlC CՆ\\B \\̑\< \$8:2C CՆ\B  $%C CՆ\B  $@CC CՆ\ CÇÇB  $prev$$C CՆ\ߏ omr/#CB  $+dC C̹B  $ +\C CȚB  $/dC C̹B  $ +\C CȚܵ[B  $'LC C̹B  Ĩ  <$ <CCCC C C C CޚB < ' <T <ѲC CȚB )t t GC CȚB  )n2DvMC CȚB  )\n3D?C CȚB  )DHC CȚB  ) \ D  wJC CȚB  ) \ \ D ;4;,,,,--------, RangeBounds\$L&&L)$Lrt\hB.0''(A'=: Create a new search configuration for the given haystack.(B4(Ț\( ;w (H:,! Set the span for this search.--JG This routine does not panic if the span given is not a valid range for-HE this search's haystack. If this search is run with an invalid range,.IF then the most likely outcome is that the actual search execution willT.7//>; This routine is generic over how a span is provided. While/<9 a [`Span`] may be given directly, one may also provide a0DA `std::ops::Range`. To provide anything supported by range0,) syntax, use the [`Input::range`] method.11,) The default span is the entire haystack.11DA Note that [`Input::range`] overrides this method and vice versa.2d2022HE This panics if the given span does not correspond to valid bounds in30- the haystack or the termination of a search.3l3/33FC This example shows how the span of the search can impact whether a4KH match is reported or not. This is particularly relevant for look-around4GD operators, which might take things outside of the span into account5(% when determining whether they match.5<5/6=/6/6&J7źE47ݥ/77-* // Look for 'at', but as a distinct word.7%" let re = PikeVM::new(r"\bat\b")?;8&ʛ08(088>; // Our haystack contains 'at', but not as a distinct word.9 let haystack = "batter";9941 // A standard search finds nothing, as expected.:%6:-G:'/;;DA // But if we wanted to search starting at position '1', we might;DA // slice the haystack. If we do this, it's impossible for the \b=: assert_eq!(Some(Match::must(0, 0..2)), caps.get_match());>>FC // But if we specify the span of the search instead of slicing the?DA // haystack, then the regex engine can "see" outside of the span?)& // and resolve the anchors correctly.@0- let input = Input::new(haystack).span(1..3);@-GA'/AA.Ǭ/ 0`, no match is found.]HE 2. The regex `a` is compiled with `Anchored::Yes` and searches `aba`]GD starting at position `2`. This reports a match at `[2, 3]` since^HE the match starts where the search started. Since there is no `^`,_IF there is no requirement for the match to start at the beginning of_ the haystack._HE 3. The regex `a` is compiled with `Anchored::Yes` and searches `aba``JG starting at position `1`. Since `b` corresponds to position `1` andaGD since the search is anchored, it finds no match. While the regexaHE matches at other positions, configuring the search to be anchoredbJG requires that it only report a match that begins at the same offsetb&# as the beginning of the search.cGD 4. The regex `a` is compiled with `Anchored::No` and searches `aba`cEB starting at position `1`. Since the search is not anchored anddIF the regex does not start with `^`, the search executes as if theredIF is a `(?s:.)*?` prefix that permits it to match anywhere. Thus, ite# reports a match at `[2, 3]`.eeEB Note that the [`Anchored::Pattern`] mode is like `Anchored::Yes`,f<9 except it only reports matches for a particular pattern.glg/ggDA This demonstrates the differences between an anchored search andgEB a pattern that begins with `^` (as described in the above warninglh message).h; // it, the search will bail once it knows a match has beenlӉ // found.63 let input = Input::new("foo12345").earliest(true);-GҊ=: assert_eq!(Some(Match::must(0, 0..4)), caps.get_match());.Ǭ/<Nj/DB $z Ӓ2͌/, Set the span for this search configuration.DA This is like the [`Input::span`] method, except this mutates theҍ span in place.>\<\ `std::ops::Range`.d0H\0\l/Ԑ<ܐ/Ɂ])& let mut input = Input::new("foobar");(] input.set_span(2..4);(% assert_eq!(2..4, input.get_range());</DڒC C)B \ \T )$Ŝ} .0<?< Set the span for this search configuration given any range.EB This is like the [`Input::range`] method, except this mutates theԖ]K\×H\I\Tޘ7d0E\ؙB\E\!\JG This also panics if the given span does not correspond to valid bounds3ۀ]l/</̜Ɂ])](]ҝ input.set_range(2..=4);(]</LC C)B ] ʞ]͞ )$ٜ .0,)ޥGD Set the starting offset for the span for this search configuration.GD This is a convenience routine for only mutating the start of a span*' without having to set the entire span.d0ƧΧJG This panics if the span resulting from the new start position does notFC correspond to valid bounds in the haystack or the termination of a\Pl/</Ɂ]ɩѩ)](] input.set_start(5);Ȫ(% assert_eq!(5..6, input.get_range());</LC CB  $J %EB Set the ending offset for the span for this search configuration.ʬҬEB This is a convenience routine for only mutating the end of a span*]˭dӭ0HE This panics if the span resulting from the new end position does notF]\Pl/</¯Ɂ])](]Ȱ input.set_end(5);(% assert_eq!(0..5, input.get_range());</<C CB  $j .$! Set the anchor mode of a search.ŲB? This is like [`Input::anchored`], except it mutates the search܌ configuration in place.l/Ƴ<γ/ڳ52 use regex_automata::{Anchored, Input, PatternID};)]ʴ30 assert_eq!(Anchored::No, input.get_anchored());! let pid = PatternID::must(5);/, input.set_anchored(Anchored::Pattern(pid));=: assert_eq!(Anchored::Pattern(pid), input.get_anchored());</dǶC CإB Զ $ٶ )DA Set whether the search should execute in "earliest" mode or not.B? This is like [`Input::earliest`], except it mutates the searchܲ]Ҹlڸ/</Ɂ])]ٹ# assert!(!input.get_earliest());쁺 input.set_earliest(true);" assert!(input.get_earliest());<ʺ/dC CB  $ ν"C@ Return a borrow of the underlying haystack as a slice of bytes.l/</Ɂ]Ѽټ%4,) assert_eq!(b"foobar", input.haystack());</DսC C ȚB ޽ $߽-* Return the start position of this search.ƾξB? This is a convenience routine for `search.get_span().start()`.DA When [`Input::is_done`] is `false`, this is guaranteed to returnFC an offset that is less than or equal to [`Input::end`]. Otherwise,2/ the offset is one greater than [`Input::end`].l/</Ɂ]%4! assert_eq!(0, input.start());0- let input = Input::new("foobar").span(2..4);! assert_eq!(2, input.start());</,C CB  $+( Return the end position of this search.@= This is a convenience routine for `search.get_span().end()`.HE This is guaranteed to return an offset that is a valid exclusive end$! bound for this input's haystack.l/</Ɂ]%4 assert_eq!(6, input.end());0] assert_eq!(4, input.end());</C CB  $2/ Return the span for this search configuration.JG If one was not explicitly set, then the span corresponds to the entire range of the haystack.GD When [`Input::is_done`] is `false`, the span returned is guaranteed<9 to correspond to valid bounds for this input's haystack.l/</&# use regex_automata::{Input, Span};%4<9 assert_eq!(Span { start: 0, end: 6 }, input.get_span());</DC CŞB  $'=: Return the span as a range for this search configuration.J]Զ]HE When [`Input::is_done`] is `false`, the range returned is guaranteed<]l/</Ɂ]%4(]</LC CB  $&;8 Return the anchored mode for this search configuration.FC If no anchored mode was set, then it defaults to [`Anchored::No`].l/</5])]3]!]/]=]</dC CإB  $"A> Return whether this search should execute in "earliest" mode.l/</Ɂ]%4#]</dC CB  $EB Return true if and only if this search can never return any otherd matches.JG This occurs when the start position of this search is greater than the end position of the search.l/</Ɂ])] assert!(!input.is_done()); input.set_start(6);] input.set_start(7); assert!(input.is_done());</<C CB  $5JG Returns true if and only if the given offset in this search's haystack63 falls on a valid UTF-8 encoded codepoint boundary.IF If the haystack is not valid UTF-8, then the behavior of this routine is unspecified.l/EB This shows where codepoint boundaries do and don't exist in validTG</Ɂ]"4'$ assert!(input.is_char_boundary(0));(% assert!(!input.is_char_boundary(1));(% assert!(!input.is_char_boundary(2));'$ assert!(input.is_char_boundary(3));(% assert!(!input.is_char_boundary(4));</C CB  $  'g@CCC C Cggg cgcثq1ȡCB  $ "l;\4\\ %$B  LŞ#! Returns this span as a range.,D DŞB *$GD Returns true when this span is empty. That is, when `start >= end`.DD DŞB *$ԉ$! Returns the length of this span.KH This returns `0` in precisely the cases that `is_empty` returns `true`.D DŞB $-EB Returns true when the given offset is contained within this span.FC Note that an empty span contains no offsets and will always returnT false.DD DŞB  $ Д +KH Returns a new span with `offset` added to this span's `start` and `end`\ values.4D DŞŞB  $  Şg@DDD DŞ Dggg cgcثq1ȡDB  $ $Ț\4Ț%,D DȚŞĐ^B  $ 'Ț#1LD DȚŞȑ^B  $ #\4$,D DŞ^B  $  Ş$$ŞB ٜƙ  ʀ#$̀ŞB Ŝo %Ş*DD DŞ DB  $ٜ ׂ%!DD D DŞB  $Ŝɜ t܋Č:@= Create a new half match from a pattern ID and a byte offset.ˌBN  ) 7@ǖ^GD This is like [`HalfMatch::new`], but accepts a `usize` instead of aˎHE [`PatternID`]. This panics if the given `usize` is not representable as a `PatternID`.$ǏB N  ! "Ɛ/, Returns the ID of the pattern that matched.DA The ID of a pattern is derived from the position in which it wasˑIF originally inserted into the corresponding DFA. The first pattern hasFC identifier `0`, and each subsequent pattern is `1`, `2` and so on.<D DB  $줕 The position of the match.ړFC If this match was produced by a forward search, then the offset isGD exclusive. If this match was produced by a reverse search, then the offset is inclusive.4D DB $T?41 Create a new match from a pattern ID and a span.Ŝ͜B? This constructor is generic over how a span is provided. While<\՝]d0! This panics if `end < start`.lƞ/؞EB This shows how to create a match for the first pattern in a regex)& object using convenient range syntax.؟</+( use regex_automata::{Match, PatternID};/, let m = Match::new(PatternID::ZERO, 5..10);ؠ*' assert_eq!(0, m.pattern().as_usize());쇡 assert_eq!(5, m.start());䩡 assert_eq!(10, m.end());<ʡ/*B* *ŞT*Nb Ŝm .0ت<@= Create a new match from a pattern ID and a byte offset span.B^ʤ<\싥]C@ This is like [`Match::new`], but accepts a `usize` instead of aH͘^ʦ^d0B? This panics if `end < start` or if `pattern > PatternID::MAX`.̧lԧ/EB This shows how to create a match for the third pattern in a regex)^</ use regex_automata::Match;" let m = Match::must(3, 5..10);̩*' assert_eq!(3, m.pattern().as_usize());^䝪ť^</$ߪ*B^ Ƨ^T *N Ŝ (*"ի/^DԚ^ڬFC originally inserted into the corresponding regex engine. The firstKH pattern has identifier `0`, and each subsequent pattern is `1`, `2` andT so on.<D DB $گ׮'$ The starting position of the match.<9 This is a convenience routine for `Match::span().start`.,D DB $ԝ%" The ending position of the match.Ȱа:7 This is a convenience routine for `Match::span().end`.D DB $.ݱ&# Returns the match span as a range.>; This is a convenience routine for `Match::span().range()`.,D DB  $$! Returns the span for this match.$D DŞB *$63 Returns true when the span in this match is empty.GD An empty match can only be returned when the regex itself can match the empty string.DD DB $Լ%" Returns the length of this match.ֶ޶K^÷D DB Ƿ $ȷ|̉)DA Create a new set of pattern identifiers with the given capacity.HE The given capacity typically corresponds to (at least) the number of(% patterns in a compiled regex object.d0KH This panics if the given capacity exceeds [`PatternID::LIMIT`]. This isIF impossible if you use the `pattern_len()` method as defined on any ofJG the regex engines in this crate. Namely, a regex will fail to build byHE returning an error if the number of patterns given to it exceeds theGD limit. Therefore, the number of patterns in a valid regex is always'$ a correct capacity to provide here.B D85 Clear this set such that it contains no pattern IDs.,D DB  $.KH Return true if and only if the given pattern identifier is in this set.DD DB  $0JG Insert the given pattern identifier into this set and return `true` if85 the given pattern ID was not previously in this set.KH If the pattern identifier is already in this set, then this is a no-op.JG Use [`PatternSet::try_insert`] for a fallible version of this routine.d0@= This panics if this pattern set has insufficient capacity to store the given pattern ID.4D DB $jJ^8^K^d1JG This returns an error if this pattern set has insufficient capacity to^TD D B  $IF Return true if and only if this set has no pattern identifiers in it.DD DB  $IF Return true if and only if this set has the maximum number of patternIF identifiers in the set. This occurs precisely when `PatternSet::len() == PatternSet::capacity()`.JG This particular property is useful to test because it may allow one toJG stop a search earlier than you might otherwise. Namely, if a search isIF only reporting which patterns match a haystack and if you know all ofHE the patterns match at a given point, then there's no new informationHE that can be learned by continuing the search. (Because a pattern set/, does not keep track of offset information.)<D DB  $@= Returns the total number of pattern identifiers in this set.D DB  $FC Returns the total number of pattern identifiers that may be stored in this set.HE This is guaranteed to be less than or equal to [`PatternID::LIMIT`].KH Typically, the capacity of a pattern set matches the number of patterns30 in a regex object with which you are searching.DD DB  $(A> Returns an iterator over all pattern identifiers in this set.HE The iterator yields pattern identifiers in ascending order, startingd at zero.$D D---SE(6DB  $0|1̧g@DDD D Dggg cgcثq1ȡDB  $ (̞QQQL$'$D DB  $-LD D>B  $3Pʃ,L̓D DB ׃ $܃lإٱ!έKH Returns true if and only if this anchor mode corresponds to any kind of anchored search.l/ѮٮIF This examples shows that both `Anchored::Yes` and `Anchored::Pattern`%" are considered anchored searches.ѯ<ٯ/.+ use regex_automata::{Anchored, PatternID};)& assert!(!Anchored::No.is_anchored());ΰ)& assert!(Anchored::Yes.is_anchored());>; assert!(Anchored::Pattern(PatternID::ZERO).is_anchored());</\D DإB  $*ƲIF Returns the pattern ID associated with this configuration if it is anIF anchored search for a specific pattern. Otherwise `None` is returned.l/</.^ô˴-* assert_eq!(None, Anchored::No.pattern());.+ assert_eq!(None, Anchored::Yes.pattern());!]޵<9 assert_eq!(Some(pid), Anchored::Pattern(pid).pattern());</<D DإB ȶ $ɶt6̶D DB  $|Ąۆ.ڄ1. Create a new error value with the given kind.EB This is a more verbose version of the kind-specific constructors, e.g., `MatchError::quit`.ȨۆB $%52 Returns a reference to the underlying error kind.$ĈD Dۆ DȨB Ɉ $ʈċ2HE Create a new "quit" error. The given `byte` corresponds to the value͉KH that tripped a search's quit condition, and `offset` corresponds to the63 location in the haystack at which the search quit.؊85 This is the same as calling `MatchError::new` with a" [`MatchErrorKind::Quit`] kind.$ˋۆB $Ћ 4ڋ+ÌGD Create a new "gave up" error. The given `offset` corresponds to the96 location in the haystack at which the search gave up.͍Ս8^$! [`MatchErrorKind::GaveUp`] kind.<ŽۆB  4ʎ2JG Create a new "haystack too long" error. The given `len` corresponds to41 the length of the haystack that was problematic.8^-* [`MatchErrorKind::HaystackTooLong`] kind.ۆB Ǒڔ9JG Create a new "unsupported anchored" error. This occurs when the callerFC requests a search with an anchor mode that is not supported by theɓި>ߓ8^1. [`MatchErrorKind::UnsupportedAnchored`] kind.إۆB $%|٪Ӫۆ&ۆg«@ūDDD Dۆ Dggg cgcثq1ȡDB ɫ $ʫ Ы;;;T;----0=0C<0),0TVD04 0%| 0 00 0B D 04040D DB 0 $0 new_capacityd00,0D DB 0 $00$0D DB 0 $0*0d0D DB 0 $0t0ݪ /0 0ݪB D 0#404#0D DݪB #0 $#0^d#0'&0D(0D DݪB (0 $(0)!0)0D DݪB )0 $)0*%0D*0D DݪB *0 $*0.404/0D DݪÇB /0 $/0C/0420D40D DݪÇB 40 $40C4060,60E EݪB 60 $606.0$60E Eݪ---- _EB 60 $608*0d80E EݪB 80 $809#0ݪg9@090EEE Eݪ Eggg cgcثq1ȡEB 90 $90 90<'0QQ=0L=0$=0Ç=%0$>0E EB >0 $>0;d;;$;)1d1B#c #1L1%B+11 1$ 1% 1>141E EȚи#B 1#W C1\1E EȚи#B 1# !11B+t 91\1E EȚB 1Ü*- 6 &,1&1B+ >; The configuration used for building a [one-pass DFA](DFA).OL A one-pass DFA configuration is a simple data object that is typically used:7 with [`Builder::configure`]. It can be cheaply cloned.HE A default configuration can be created either with `Config::new`, or41 perhaps more conveniently, with [`DFA::config`].4]u܊T % d !T FFF- -B F g  ... . .ggg cgcثq1ȡ.B   B n^(% A builder for a [one-pass DFA](DFA).^^MJ This builder permits configuring options for the syntax of a pattern, the_OL NFA construction and the DFA construction. This builder is different from a_MJ general purpose regex builder in that it permits fine grain configuration`JG of the construction process. The trade off for this is complexity, andaMJ the possibility of setting a configuration that might not make sense. Fora1. example, there are two different UTF-8 modes:bbJG * [`syntax::Config::utf8`](crate::util::syntax::Config::utf8) controlsbMJ whether the pattern itself can contain sub-expressions that match invalidTcGcLI * [`thompson::Config::utf8`] controls whether empty matches that split ac*' Unicode codepoint are reported or not.ddJG Generally speaking, callers will want to either enable all of these ord disable all of these.ele/eeKH This example shows how to disable UTF-8 mode in the syntax and the NFA.eDA This is generally what you want for matching on arbitrary bytes.f; input, it's always clear when to move on from `a*` to `b`.*' # Only anchored searches are supportedNK In this crate, especially for DFAs, unanchored searches are implemented byMJ treating the pattern as if it had a `(?s-u:.)*?` prefix. While the prefixNK is one-pass on its own, adding anything after it, e.g., `(?s-u:.)*?a` willNK make the overall pattern not one-pass. Why? Because the `(?s-u:.)` matchesKH any byte, and there is therefore ambiguity as to when the prefix should;8 stop matching and something else should start matching.LI Therefore, one-pass DFAs do not support unanchored searches. In additionLI to many regexes simply not being one-pass, it implies that one-pass DFAsMJ have limited utility. With that said, when a one-pass DFA can be used, itJG can potentially provide a dramatic speed up over alternatives like theOL [`BoundedBacktracker`](crate::nfa::thompson::backtrack::BoundedBacktracker)LI and the [`PikeVM`](crate::nfa::thompson::pikevm::PikeVM). In particular,MJ a one-pass DFA is the only DFA capable of reporting the spans of matching capturing groups.LI To clarify, when we say that unanchored searches are not supported, whatܩ that actually means is:NK * The high level routines, [`DFA::is_match`] and [`DFA::captures`], always̘ do anchored searches.LI * Since iterators are most useful in the context of unanchored searches,,) there is no `DFA::captures_iter` method.IF * For lower level routines like [`DFA::try_search`], an error will beOL returned if the given [`Input`] is configured to do an unanchored search orNK search for an invalid pattern ID. (Note that an [`Input`] is configured toHE do an unanchored search by default, so just giving a `Input::new` is# guaranteed to return an error.) # Other limitationsHE In addition to the [configurable heap limit](Config::size_limit) andJG the requirement that a regex pattern be one-pass, there are some other limitations:JG * There is an internal limit on the total number of explicit capturingMJ groups that appear across all patterns. It is somewhat small and there isOL no way to configure it. If your pattern(s) exceed this limit, then building a one-pass DFA will fail.NK * If the number of patterns exceeds an internal unconfigurable limit, thenKH building a one-pass DFA will fail. This limit is quite large and you're unlikely to hit it.MJ * If the total number of states exceeds an internal unconfigurable limit,IF then building a one-pass DFA will fail. This limit is quite large and you're unlikely to hit it.41 # Other examples of regexes that aren't one-passKH One particularly unfortunate example is that enabling Unicode can causeKH regexes that were one-pass to no longer be one-pass. Consider the regexHE `(?-u)\w*\s` for example. It is one-pass because there is exactly noGD overlap between the ASCII definitions of `\w` and `\s`. But `\w*\s`LI (i.e., with Unicode enabled) is *not* one-pass because `\w` and `\s` getOL translated to UTF-8 automatons. And while the *codepoints* in `\w` and `\s`MJ do not overlap, the underlying UTF-8 encodings do. Indeed, because of theMJ overlap between UTF-8 automata, the use of Unicode character classes willIF tend to vastly increase the likelihood of a regex not being one-pass.63 # How does one know if a regex is one-pass or not?OL At the time of writing, the only way to know is to try and build a one-passEB DFA. The one-pass property is checked while constructing the DFA.NK This does mean that you might potentially waste some CPU cycles and memoryOL by optimistically trying to build a one-pass DFA. But this is currently theNK only way. In the future, building a one-pass DFA might be able to use someLI heuristics to detect common violations of the one-pass property and bail more quickly. # Resource usageLI Unlike a general DFA, a one-pass DFA has stricter bounds on its resourceFC usage. Namely, construction of a one-pass DFA has a time and spaceOL complexity of `O(n)`, where `n ~ nfa.states().len()`. (A general DFA's timeJG and space complexity is `O(2^n)`.) This smaller time bound is achievedIF because there is at most one DFA state created for each NFA state. IfMJ additional DFA states would be required, then the pattern is not one-pass and construction will fail.KH Note though that currently, this DFA uses a fully dense representation.NK This means that while its space complexity is no worse than an NFA, it mayNK in practice use more memory because of higher constant factors. The reasonMJ for this trade off is two-fold. Firstly, a dense representation makes theMJ search faster. Secondly, the bigger an NFA, the more unlikely it is to beEB one-pass. Therefore, most one-pass DFAs are usually pretty small.l/OL This example shows that the one-pass DFA implements Unicode word boundariesLI correctly while simultaneously reporting spans for capturing groups thatNK participate in a match. (This is the only DFA that implements full support! for Unicode word boundaries.)</=/91GD let re = DFA::new(r"\b(?P\w+)[[:space:]]+(?P\w+)\b")?;J/B? re.captures(&mut cache, "Шерлок Холмс", &mut caps);>; assert_eq!(Some(Match::must(0, 0..23)), caps.get_match());IF assert_eq!(Some(Span::from(0..12)), caps.get_group_by_name("first"));IF assert_eq!(Some(Span::from(13..23)), caps.get_group_by_name("last"));.Ǭ/</ij # Example: iterationGD Unlike other regex engines in this crate, this one does not provideKH iterator search functions. This is because a one-pass DFA only supportsNK anchored searches, and so iterator functions are generally not applicable.52 However, if you know that all of your matches are85 directly adjacent, then an iterator can be used. TheNK [`util::iter::Searcher`](crate::util::iter::Searcher) type can be used for this purpose:</=//0S Anchored, Input, Span,4ݥ/$! let re = DFA::new(r"\w(\d)\w")?;FT@= let input = Input::new("a1zb2yc3x").anchored(Anchored::Yes);NK let mut it = Searcher::new(input).into_captures_iter(caps, |input, caps| {΁30 Ok(re.try_search(&mut cache, input, caps)?) }).infallible();# let caps0 = it.next().unwrap();;8 assert_eq!(Some(Span::from(1..2)), caps0.get_group(1));.Ǭ/</ ΃2}<t4 D , 4 ϑdϑ Ç< d t< ܜlܜ  . .B" ( 6u5QJ< ܋<< 0{?ippp opopo2Ы! g... . .ggg cgcثq1ȡ.BS NK A cache represents mutable state that a one-pass [`DFA`] requires during a\POL For a given one-pass DFA, its corresponding cache may be created either viaNK [`DFA::create_cache`], or via [`Cache::new`]. They are equivalent in everyIF way, except the former does not require explicitly importing `Cache`.KH A particular `Cache` is coupled with the one-pass DFA from which it wasHE created. It may only be used with that one-pass DFA. A cache and itsNK allocations may be re-purposed via [`Cache::reset`], in which case, it canA> only be used with the new one-pass DFA (and not the old one).),o|^(t ą . .BT c gc c ... . .ggg cgcثq1ȡ.BU c c A +T BA 8 B        . .BW   Xs s s s s . .BY s     .. . .BZ     0| ŵ 4B 8 B  . .Bc  d 5D -[cB 8 B  . .Bmׯ  nޯ1 :, ǨB1 8 B  QQQQQQ/ /Bw Q x?L .h(=d, g/// / /ggg cgcثq1ȡ/B EB An error that occurred during the construction of a one-pass DFA.JG This error does not provide many introspection capabilities. There are1. generally only two things you can do with it:GD * Obtain a human readable message via its `std::fmt::Display` impl.JG * Access an underlying [`thompson::BuildError`] type from its `source`OL method via the `std::error::Error` trait. This error only occurs when usingLI convenience routines for building a one-pass DFA directly from a pattern\ZNK When the `std` feature is enabled, this implements the `std::error::Error`TY@TG$ ???/ /B ?g/// / /ggg cgcثq1ȡ/B At O!;נװBB A      װB`  װ A      Bך` lA T, |A T, |A T$ A d, TA  2/ /B 4g44/// / /ggg cgcثq1ȡ/B 44ԴID z-  !4!!g!!/// / /ggg cgcثq1ȡ/B !!=J\=<:t? .syntax(syntax::Config::new().unicode(false).utf8(false))  .build(r"foo[^b]ar.*")?;ӻ '0  2/ let haystack = b"\xFEfoo\xFFar\xE2\x98\xFF\n"; 0S E3 3Ƚ ̽ .Ǭ/< /k< oEUt 4  ξ Ⱦ D KKK0 0B  Kg000 0 0ggg cgcثq1ȡ0B    :7 Represents the current state of an overlapping search.  KH This is used for overlapping searches since they need to know something OL about the previous search. For example, when multiple patterns match at the OL same position, this state tracks the last reported pattern so that the next LI search knows whether to report another matching pattern or continue with MJ the search at the next position. Additionally, it also tracks which state '$ the last search call terminated in.  JG This type provides little introspection capabilities. The only thing a NK caller can do is construct it and pass it around to permit search routines JG to use it to track state, and also ask whether a match has been found.  ?< Callers should always provide a fresh state constructed via NK [`OverlappingState::start`] when starting a new search. Reusing state from 63 a previous search may result in incorrect results.m e8 !  "  ׁ   * ʼn <Љ ܺܺܺ0 0B  ̻ܺg̻̻000 0 0ggg cgcثq1ȡ0B  ̻̻־־־־־0 0B  ־00 0 0B   IGD An error that occurs when initial construction of a lazy DFA fails.MJ A build error can occur when insufficient cache capacity is configured orLI if something about the NFA is unsupported. (For example, if one attemptsNK to build a lazy DFA without heuristic Unicode support but with an NFA that&# contains a Unicode word boundary.)Jď`1`G` * Access an underlyingC@ [`nfa::thompson::BuildError`](crate::nfa::thompson::BuildError)OL type from its `source` method via the `std::error::Error` trait. This errorGD only occurs when using convenience routines for building a lazy DFA# directly from a pattern string.NՓ`TYoT(gK$0 0B gggg000 0 0ggg cgcثq1ȡ0B ggpt1*K]װB2Bt pt  t t װBaװ̏ pt < d ,  p   p    2Bad 20 0B tgtt000 0 0ggg cgcثq1ȡ0B tt!HE An error that can occur when computing the start state for a search.>; Computing a start state can fail for a few reasons, either=: based on incorrect configuration or even based on whether96 the look-behind byte triggers a quit state. Typically:7 one does not need to handle this error if you're usingNK [`DFA::start_state_forward`](crate::hybrid::dfa::DFA::start_state_forward)HE (or its reverse counterpart), as that routine automatically converts@= `StartError` to a [`MatchError`](crate::MatchError) for you.%" This error may be returned by theGD [`DFA::start_state`](crate::hybrid::dfa::DFA::start_state) routine.NK This error implements the `std::error::Error` trait when the `std` feature| is enabled.JG This error is marked as non-exhaustive. New variants may be added in a  semver compatible release.: tT!ɮT,"!FC An error that occurs when cache inefficiency has dropped below the!$! configured heuristic thresholds.t|""-* The underlying cache error that occurred."$##IF An error that occurs when a starting configuration's look-behind byte# is in this DFA's quit set.tD$$! The quit byte that was found.$$%$GD An error that occurs when the caller requests an anchored mode that% isn't supported by the DFA.tt&%0- The anchored mode given that is unsupported.$&إ0 0B! g000 0 0ggg cgcثq1ȡ0B!  6A> An error that occurs when cache usage has become inefficient.77HE One of the weaknesses of a lazy DFA is that it may need to clear its8NK cache repeatedly if it's not big enough. If this happens too much, then it8IF can slow searching down significantly. A mitigation to this is to use9LI heuristics to detect whether the cache is being used efficiently or not.963 If not, then a lazy DFA can return a `CacheError`.::<9 The default configuration of a lazy DFA in this crate is:;8 set such that a `CacheError` will never occur. Instead,;:7 callers must opt into this behavior with settings like;eb [`dfa::Config::minimum_cache_clear_count`](crate::hybrid::dfa::Config::minimum_cache_clear_count)<< andz7I6B 6B >0 0B> g000 0 0ggg cgcثq1ȡ0B> c ;8 A state identifier specifically tailored for lazy DFAs.<@OL A lazy state ID logically represents a pointer to a DFA state. In practice,IF by limiting the number of DFA states it can address, it reserves someJG bits of its representation to encode some additional information. ThatHE additional information is called a "tag." That tag is used to recordLI whether the state it points to is an unknown, dead, quit, start or matchT8GD When implementing a low level search routine with a lazy DFA, it isHE necessary to query the type of the current state to know what to do:<9 * **Unknown** - The state has not yet been computed. The=: parameters used to get this state ID must be re-passed toNK [`DFA::next_state`](crate::hybrid::dfa::DFA::next_state), which will never return an unknown state ID.OL * **Dead** - A dead state only has transitions to itself. It indicates thatNK the search cannot do anything else and should stop with whatever result itD has.KH * **Quit** - A quit state indicates that the automaton could not answerOL whether a match exists or not. Correct search implementations must return a JG [`MatchError::quit`](crate::MatchError::quit) when a DFA enters a quitT 8 GD * **Start** - A start state is a state in which a search can begin. B? Lazy DFAs usually have more than one start state. Branching on EB this isn't required for correctness, but a common optimization is DA to run a prefilter when a search enters a start state. Note that HE start states are *not* tagged automatically, and one must enable the \Y [`Config::specialize_start_states`](crate::hybrid::dfa::Config::specialize_start_states) A> setting for start states to be tagged. The reason for this is LI that a DFA search loop is usually written to execute a prefilter once itLI enters a start state. But if there is no prefilter, this handling can beOL quite disastrous as the DFA may ping-pong between the special handling codeNK and a possible optimized hot path for handling untagged states. When startKH states aren't specialized, then they are untagged and remain in the hotL path.FC * **Match** - A match state indicates that a match has been found.KH Depending on the semantics of your search implementation, it may eitherLI continue until the end of the haystack or a dead state, or it might quit%" and return the match immediately.KH As an optimization, the [`is_tagged`](LazyStateID::is_tagged) predicateLI can be used to determine if a tag exists at all. This is useful to avoid@= branching on all of the above types for every byte searched.l/KH This example shows how `LazyStateID` can be used to implement a correctMJ search routine with minimal branching. In particular, this search routineKH implements "leftmost" matching, which means that it doesn't immediatelyMJ stop once a match is found. Instead, it continues until it reaches a deadT8>; Notice also how a correct search implementation deals withB? [`CacheError`](crate::hybrid::CacheError)s returned by some ofA> the lazy DFA routines. When a `CacheError` occurs, it returns85 [`MatchError::gave_up`](crate::MatchError::gave_up).</̶/" hybrid::dfa::{Cache, DFA},%" HalfMatch, MatchError, Input,4ݥ/ܤ fn find_leftmost_first( dfa: &DFA, cache: &mut Cache, haystack: &[u8],0- ) -> Result, MatchError> {KH // The start state is determined by inspecting the position and theJG // initial bytes of the haystack. Note that start states can neverGD // be match states (since DFAs in this crate delay matches by 1JG // byte), so we don't need to check if the start state is a match..+ let mut sid = dfa.start_state_forward( cache," &Input::new(haystack),\ )?;" let mut last_match = None;JG // Walk all the bytes in the haystack. We can quit early if we seeFC // a dead or a quit state. The former means the automaton will IF // never transition to any other state. The latter means that the DA // automaton entered a condition in which its search failed.!41 for (i, &b) in haystack.iter().enumerate() {! sid = dfa!*' .next_state(cache, sid, b)"63 .map_err(|_| MatchError::gave_up(i))?;"  if sid.is_tagged() {"# if sid.is_match() {#52 last_match = Some(HalfMatch::new(#96 dfa.match_pattern(cache, sid, 0),# i,$ ));$)& } else if sid.is_dead() {$*' return Ok(last_match);%)& } else if sid.is_quit() {%FC // It is possible to enter into a quit state after%GD // observing a match has occurred. In that case, we&C@ // should return the match instead of an error.&-* if last_match.is_some() {'.+ return Ok(last_match);' }'74 return Err(MatchError::quit(b, i));(3(KH // Implementors may also want to check for start states and)MJ // handle them differently for performance reasons. But it is)MJ // not necessary for correctness. Note that in order to check*>; // for start states, you'll need to enable the*IF // 'specialize_start_states' config knob, otherwise start+-* // states will not be tagged.l+3L+3+KH // Matches are always delayed by 1 byte, so we must explicitly walk,A> // the special "EOI" transition at the end of the search.- sid = dfa-'$ .next_eoi_state(cache, sid)-?< .map_err(|_| MatchError::gave_up(haystack.len()))?;- if sid.is_match() {.-* last_match = Some(HalfMatch::new(.1. dfa.match_pattern(cache, sid, 0),. haystack.len(),|/ ));L/3/ Ok(last_match),/3//LI // We use a greedy '+' operator to show how the search doesn't just stop0HE // once a match is detected. It continues extending the match. Using0GD // '[a-z]+?' would also work as expected and stop the search early.1.+ // Greediness is built into the automaton.1#72'02072HE let mat = find_leftmost_first(&dfa, &mut cache, haystack)?.unwrap();3,) assert_eq!(mat.pattern().as_usize(), 0);3! assert_eq!(mat.offset(), 10);33DA // Here's another example that tests our handling of the special4FC // EOI transition. This will fail to find a match if we don't call5LI // 'next_eoi_state' at the end of the search since the match isn't found5,) // until the final byte in the haystack.5%" let dfa = DFA::new(r"[0-9]{4}")?;6'06076Ha7,a7! assert_eq!(mat.offset(), 15);88HE // And note that our search implementation above automatically works8KH // with multi-DFAs. Namely, `dfa.match_pattern(match_state, 0)` selects9)& // the appropriate pattern ID for us.963 let dfa = DFA::new_many(&[r"[a-z]+", r"[0-9]+"])?;:'0:07:Ha;,) assert_eq!(mat.pattern().as_usize(), 1);;  assert_eq!(mat.offset(), 3);;NK let mat = find_leftmost_first(&dfa, &mut cache, &haystack[3..])?.unwrap();<,a<  assert_eq!(mat.offset(), 7);=OL let mat = find_leftmost_first(&dfa, &mut cache, &haystack[10..])?.unwrap();=,ބb>  assert_eq!(mat.offset(), 5);>>.Ǭ/<>/|\?ΈBc 6B ?0 0B?  ?<g<<000 0 0ggg cgcثq1ȡ0B? <<iiiB 0 0B? QhQQ00 0 0ù B?ù Qiù Q ù QQQQ00 0 0B?  yyy00 0 0 B? y y>>>00 0 0 B? > >m"}m'5tmLm1 1Bm g111 1 1ggg cgcثq1ȡ1Bm 1 1Bm PPPP11 1 1Bm P PLI A regular expression that uses hybrid NFA/DFAs (also called "lazy DFAs") for searching.MJ A regular expression is comprised of two lazy DFAs, a "forward" DFA and aJG "reverse" DFA. The forward DFA is responsible for detecting the end ofHE a match while the reverse DFA is responsible for detecting the start GD of a match. Thus, in order to find the bounds of any given match, a JG forward search must first be run followed by a reverse search. A match KH found by the forward DFA guarantees that the reverse DFA will also findd  a match.   # Fallibility  JG Most of the search routines defined on this type will _panic_ when the MJ underlying search fails. This might be because the DFA gave up because it KH saw a quit byte, whether configured explicitly or via heuristic Unicode LI word boundary support, although neither are enabled by default. It might OL also fail if the underlying DFA determines it isn't making effective use ofMJ the cache (which also never happens by default). Or it might fail becauseOL an invalid `Input` configuration is given, for example, with an unsupported [`Anchored`] mode.OL If you need to handle these error cases instead of allowing them to triggerOL a panic, then the lower level [`Regex::try_search`] provides a fallible API that never panics.l/F7JG `\n` byte, and handle the error returned. This could be useful if, forHE example, you wanted to prevent a user supplied pattern from matching across a line boundary.</=/IF use regex_automata::{hybrid::{dfa, regex::Regex}, Input, MatchError};92/ .dfa(dfa::Config::new().quit(b'\n', true))#7&ʛ0'$ let input = Input::new("foo\nbar");H7G7=7.7=: let got = re.try_search(&mut cache, &input).unwrap_err();3.Ǭ/</,2d<d<g111 1 1ggg cgcثq1ȡ1B ѱ"JG An iterator over all non-overlapping matches for an infallible search.OL The iterator yields a [`Match`] value until no more matches could be found.ŮIF If the underlying regex engine returns an error, then a panic occurs.+( The lifetime parameters are as follows:ï74 * `'r` represents the lifetime of the regex object.B? * `'h` represents the lifetime of the haystack being searched.63 * `'c` represents the lifetime of the regex cache.FC This iterator can be created with the [`Regex::find_iter`] method.\ܱG3ol G, 3''ɍ'`'z飈wqG3gqq111 1 1ggg cgcثq1ȡ1Bɱ G3qqܻδDA A cache represents a partially computed forward and reverse DFA.J`M`K`K`ȷO`N` a [`Regex`].>; Caches can be created from their corresponding `Regex` viaMJ [`Regex::create_cache`]. A cache can only be used with either the `Regex`KH that created it, or the `Regex` that was most recently used to reset itպMJ with [`Cache::reset`]. Using a cache with any other `Regex` may result in  panics or incorrect results.,d0P<<8g88111 1 1ggg cgcثq1ȡ1Bͻ 88LLL1 1BԻ L41 A builder for a regex based on a hybrid NFA/DFA.M_OL NFA construction, the lazy DFA construction and finally the regex searchingJG itself. This builder is different from a general purpose regex builderLI in that it permits fine grain configuration of the construction process.JG The trade off for this is complexity, and the possibility of setting aGD configuration that might not make sense. For example, there are two different UTF-8 modes:J_M_TGLI * [`thompson::Config::utf8`] controls how the regex iterators themselvesKH advance the starting position of the next search when a match with zero length is found.J_̤ĝ_GD Internally, building a regex requires building two hybrid NFA/DFAs,LI where one is responsible for finding the end of a match and the other isLI responsible for finding the start of a match. If you only need to detectNK whether something matched, or only the end of a match, then you should useMJ a [`dfa::Builder`] to construct a single hybrid NFA/DFA, which is cheaper than building two of them.l/LI This example shows how to disable UTF-8 mode in the syntax and the regexLI itself. This is generally what you want for matching on arbitrary bytes.</=//A94ݥ/92060&0&ʛ049.9,936_8ݡ_"_@= assert_eq!(b"foo\xFFarzz", &haystack[got.unwrap().range()]);.Ǭ/</<݃AZkB݃BB1 1݃݃B B݃g111 1݃ 1ggg cgcثq1ȡ1B  W> ; An error that occurs when construction of a `Regex` fails. F C A build error is generally a result of one of two possible failureG D modes. First is a parse or syntax error in the concrete syntax of aL I pattern. Second is that the construction of the underlying regex matcherF C fails, usually because it gets too big with respect to limits likeD A [`Config::nfa_size_limit`](crate::meta::Config::nfa_size_limit). H E This error provides very little introspection capabilities. You can: K H * Ask for the [`PatternID`] of the pattern that caused an error, if oneN K is available. This is available for things like syntax errors, but not for* ' cases where build limits are exceeded.L I * Ask for the underlying syntax error, but only if the error is a syntaxT FM J * Ask for a human readable message corresponding to the underlying error.C @ * The `BuildError::source` method (from the `std::error::Error`M J trait implementation) may be used to query for an underlying error if oneF C exists. There are no API guarantees about which error is returned.  K H When the `std` feature is enabled, this implements `std::error::Error`.T 0 $ ***2 2B  **g**222 2 2ggg cgcثq1ȡ2B  ** t  _rװB4 t  Ā        װBb̤ װ+++2 2B  +.g..222 2 2ggg cgcثq1ȡ2B  ..' T' QiLJBB     Bb' R R  R R Bbt( 0g00222 2 2ggg cgcثq1ȡ2B'  00 . r 1@nnB 7B .  3g 3 3222 2 2ggg cgcثq1ȡ2B.   3 38 t8 EjNl8 48 4g44222 2 2ggg cgcثq1ȡ2B8  44OHE A regex matcher that works by composing several other regex matchers  automatically.  JG In effect, a meta regex papers over a lot of the quirks or performance OL problems in each of the regex engines in this crate. Its goal is to provide OL an infallible and simple API that "just does the right thing" in the commonL  case.  IF A meta regex is the implementation of a `Regex` in the `regex` crate. JG Indeed, the `regex` crate API is essentially just a light wrapper over @= this type. This includes the `regex` crate's `RegexSet` API!   # Composition  IF This is called a "meta" matcher precisely because it uses other regexHE matchers to provide a convenient high level regex API. Here are some63 examples of how other regex matchers are composed:>; * When calling [`Regex::captures`], instead of immediately;8 running a slower but more capable regex engine like theKH [`PikeVM`](crate::nfa::thompson::pikevm::PikeVM), the meta regex engineNK will usually first look for the bounds of a match with a higher throughputMJ regex engine like a [lazy DFA](crate::hybrid). Only when a match is foundLI is a slower engine like `PikeVM` used to find the matching span for each capture group.EB * While higher throughout engines like the lazy DFA cannot handleLI Unicode word boundaries in general, they can still be used on pure ASCIIMJ haystacks by pretending that Unicode word boundaries are just plain ASCIIOL word boundaries. However, if a haystack is not ASCII, the meta regex engineOL will automatically switch to a (possibly slower) regex engine that supports'$ Unicode word boundaries in general.MJ * In some cases where a regex pattern is just a simple literal or a smallJG set of literals, an actual regex engine won't be used at all. Instead,DA substring or multi-substring search algorithms will be employed.JG There are many other forms of composition happening too, but the aboveKH should give a general idea. In particular, it may perhaps be surprisingNK that *multiple* regex engines might get executed for a single search. ThatKH is, the decision of what regex engine to use is not _just_ based on theJG pattern, but also based on the dynamic execution of the search itself.KH The primary reason for this composition is performance. The fundamentalLI tension is that the faster engines tend to be less capable, and the more&# capable engines tend to be slower.IF Note that the forms of composition that are allowed are determined byOL compile time crate features and configuration. For example, if the `hybrid`OL feature isn't enabled, or if [`Config::hybrid`] has been disabled, then the0- meta regex engine will never use a lazy DFA.! # Synchronization and cloningHE Most of the regex engines in this crate require some kind of mutableKH "scratch" space to read and write from while performing a search. SinceIF a meta regex composes these regex engines, a meta regex also requires DA mutable scratch space. This scratch space is called a [`Cache`].!!KH Most regex engines _also_ usually have a read-only component, typically!2/ a [Thompson `NFA`](crate::nfa::thompson::NFA).""JG In order to make the `Regex` API convenient, most of the routines hide"HE the fact that a `Cache` is needed at all. To achieve this, a [memory#IF pool](crate::util::pool::Pool) is used internally to retrieve `Cache`#MJ values in a thread safe way that also permits reuse. This in turn implies$NK that every such search call requires some form of synchronization. Usually%LI this synchronization is fast enough to not notice, but in some cases, it%LI can be a bottleneck. This typically occurs when all of the following areL& true:&&HE * The same `Regex` is shared across multiple threads simultaneously,'LI usually via a [`util::lazy::Lazy`](crate::util::lazy::Lazy) or something'96 similar from the `once_cell` or `lazy_static` crates.(@= * The primary unit of work in each thread is a regex search.(/, * Searches are run on very short haystacks.((JG This particular case can lead to high contention on the pool used by a)JG `Regex` internally, which can in turn increase latency to a noticeable*DA effect. This cost can be mitigated in one of the following ways:**MJ * Use a distinct copy of a `Regex` in each thread, usually by cloning it.+KH Cloning a `Regex` _does not_ do a deep copy of its read-only component.+IF But it does lead to each `Regex` having its own memory pool, which in,PM turn eliminates the problem of contention. In general, this technique should-OL not result in any additional memory usage when compared to sharing the same-30 `Regex` across multiple threads simultaneously..MJ * Use lower level APIs, like [`Regex::search_with`], which permit passing.MJ a `Cache` explicitly. In this case, it is up to you to determine how best/NK to provide a `Cache`. For example, you might put a `Cache` in thread-local/+( storage if your use case allows for it.00IF Overall, this is an issue that happens rarely in practice, but it can\0 happen.1185 # Warning: spin-locks may be used in alloc-only mode11NK When this crate is built without the `std` feature and the high level APIs2NK on a `Regex` are used, then a spin-lock will be used to synchronize access2JG to an internal pool of `Cache` values. This may be undesirable because3IF a spin-lock is [effectively impossible to implement correctly in user3LI space][spinlocks-are-bad]. That is, more concretely, the spin-lock could4 result in a deadlock.44_\ [spinlocks-are-bad]: https://matklad.github.io/2020/01/02/spinlocks-considered-harmful.html55IF If one wants to avoid the use of spin-locks when the `std` feature is6LI disabled, then you must use APIs that accept a `Cache` value explicitly.6(% For example, [`Regex::search_with`].7l7/7<7/7$;77:7 let re = Regex::new(r"^[0-9]{4}-[0-9]{2}-[0-9]{2}$")?;8'$ assert!(re.is_match("2010-03-14"));88.Ǭ/<8/88 # Example: anchored search99HE This example shows how to use [`Input::anchored`] to run an anchored9JG search, even when the regex pattern itself isn't anchored. An anchored:LI search guarantees that if a match is found, then the start offset of the:DA match corresponds to the offset at which the search was started.;<;/;>; use regex_automata::{meta::Regex, Anchored, Input, Match};<<%" let re = Regex::new(r"\bfoo\b")?;FC // surrounding context into account, even if it means looking back?'$ // before the start of your search.̨? let hay = "xxfoo xx";?C@ let input = Input::new(hay).range(2..).anchored(Anchored::Yes);@%" assert_eq!(None, re.find(input));@A> // Indeed, you cannot achieve the above by simply slicing the@<9 // haystack itself, since the regex engine can't see theA?< // surrounding context. This is why 'Input' permits settingA // the bounds of a search!B>; let input = Input::new(&hay[2..]).anchored(Anchored::Yes);lB // WRONG!B;8 assert_eq!(Some(Match::must(0, 0..3)), re.find(input));CC.Ǭ/ԧcEE(% let re = Regex::new(r"[a-z]{3}|b")?;E1. let input = Input::new("abc").earliest(true);F;8 assert_eq!(Some(Match::must(0, 1..2)), re.find(input));FFFC // Note that "earliest" isn't really a match semantic unto itself.GDA // Instead, it is merely an instruction to whatever regex engineGC@ // gets used internally to quit as soon as it can. For example,HA> // this regex uses a different search technique, and winds upH/, // producing a different (but valid) match!I# let re = Regex::new(r"abc|b")?;I1cI;cJJ.Ǭ/Â, k"`Gˎ;''ɍ'`'z飈wGg 333 3 3ggg cgcثq1ȡ3B G"NK An iterator over all non-overlapping leftmost matches with their capturing\܎ groups.KH The iterator yields a [`Captures`] value until no more matches could beT found.ÏǏ+¯bNcƐBǰbJG This iterator can be created with the [`Regex::captures_iter`] method.|G?3l>̥,ctĒ$ĒؒؒcGg333 3 3ggg cgcثq1ȡ3B GǡB? Yields all substrings delimited by a regular expression match.85 The spans correspond to the offsets between matches.+¯bٟݟNcBǰbB? This iterator can be created with the [`Regex::split`] method.,ҡGb1mHءܡ4\$4Gg44333 3 3ggg cgcثq1ȡ3B G44ĮEB Yields at most `N` spans delimited by a regular expression match.NK The spans correspond to the offsets between matches. The last span will be%" whatever remains after splitting.+¯bլ٬NcBǰbC@ This iterator can be created with the [`Regex::splitn`] method.4ϮGZ>_c֮ڮ4d,xGgxx333 3 3ggg cgcثq1ȡ3B GxxKH Represents mutable scratch space used by regex engines during a search.@= Most of the regex engines in this crate require some kind ofEB mutable state in order to execute a search. This mutable state is>; explicitly separated from the core regex object (such as aMJ [`thompson::NFA`](crate::nfa::thompson::NFA)) so that the read-only regexʺKH object can be shared across multiple threads simultaneously without anyMJ synchronization. Conversely, a `Cache` must either be duplicated if usingNK the same `Regex` from multiple threads, or else there must be some kind ofMJ synchronization that guarantees exclusive access while it's in use by one\ thread.KH A `Regex` attempts to do this synchronization for you by using a threadݽLI pool internally. Its size scales roughly with the number of simultaneous regex searches.¾LI For cases where one does not want to rely on a `Regex`'s internal threadJG pool, lower level routines such as [`Regex::search_with`] are providedڿMJ that permit callers to pass a `Cache` into the search routine explicitly.JG General advice is that the thread pool is often more than good enough.FC However, it may be possible to observe the effects of its latency,DA especially when searching many small haystacks from many threads simultaneously.>͸bMbKbMĺb bl/</4݀<.=&ʛ0>=|0%=+=40.Ǭ/</,ˎHdyeT(47L*<(42L˞ˎg333 3ˎ 3ggg cgcثq1ȡ3B &ˎ&&3 3ˎˎB &85 An object describing the configuration of a `Regex`.41 This configuration only includes options for the@= non-syntax behavior of a `Regex`, and can be applied via theJG [`Builder::configure`] method. For configuring the syntax options, see:7 [`util::syntax::Config`](crate::util::syntax::Config).';NK In some cases, the default size limit might be too big. The size limit canGD be lowered, which will prevent large regex patterns from compiling.</=/$;!;F;I;;;.Ǭ/</4ŏ<6ɹTT< %t%t)$4%t&|<Lԣd| lŏ3 3ŏŏB )ŏg))333 3ŏ 3ggg cgcثq1ȡ3B ))ԺŏԺԺŏB 96 A builder for configuring and constructing a `Regex`.GD The builder permits configuring two different aspects of a `Regex`:IF * [`Builder::configure`] will set high-level configuration options as described by a [`Config`].IF * [`Builder::syntax`] will set the syntax level configuration optionsLI as described by a [`util::syntax::Config`](crate::util::syntax::Config).C@ This only applies when building a `Regex` from pattern strings.MJ Once configured, the builder can then be used to construct a `Regex` fromΊ one of 4 different inputs:FC * [`Builder::build`] creates a regex from a single pattern string.HE * [`Builder::build_many`] creates a regex from many pattern strings.85 * [`Builder::build_from_hir`] creates a regex from a*' [`regex-syntax::Hir`](Hir) expression.@= * [`Builder::build_many_from_hir`] creates a regex from many+( [`regex-syntax::Hir`](Hir) expressions.ҍ֍KH The latter two methods in particular provide a way to construct a fullyHE feature regular expression matcher directly from an `Hir` expressionOL without having to first convert it to a string. (This is in contrast to theMJ top-level `regex` crate which intentionally provides no such API in order85 to avoid making `regex-syntax` a public dependency.)ƐOL As a convenience, this builder may be created via [`Regex::builder`], which# may help avoid an extra import.);NK This example shows how to enable multi-line mode by default and change the$! line terminator to the NUL byte:</;;쬓9ʓ7;<;Կ;ڔ;9;.Ǭ/</(% # Example: disable UTF-8 requirementIF By default, regex patterns are required to match UTF-8. This includesMJ regex patterns that can produce matches of length zero. In the case of anNK empty match, by default, matches will not appear between the code units of a UTF-8 encoded codepoint.JG However, it can be useful to disable this requirement, particularly ifNK you're searching things like `&[u8]` that are not known to be valid UTF-8.<ř/͙;;'$ let mut builder = Regex::builder();C@ // Disables the requirement that non-empty matches match UTF-8.63 builder.syntax(syntax::Config::new().utf8(false));JG // Disables the requirement that empty matches match UTF-8 boundaries.96 builder.configure(Regex::config().utf8_empty(false));EB // We can match raw bytes via \xZZ syntax, but we need to disableGD // Unicode mode to do that. We could disable it everywhere, or justǝ" // selectively, as shown here.85 let re = builder.build(r"(?-u:\xFF)foo(?-u:\xFF)")?;죞 let hay = b"\xFFfoo\xFF";96 assert_eq!(Some(Match::must(0, 0..5)), re.find(hay));,) // We can also match between code units.! let re = builder.build(r"")?;Οÿ<?< assert_eq!(re.find_iter(hay).collect::>(), vec![죠??ߠƇ??<9.Ǭ/<֡/<ӑt4ŏǢ&Ǣӑ3 3ӑӑB ӑg333 3ӑ 3ggg cgcثq1ȡ3B % !t%!NGpQ"%!4%!̪&!&!)!!D)!wgww333 3 3ggg cgcثq1ȡ3B%! wwl<</ <jFNv "4<<<T</<4 4B< E/8g<g\_EE444 4 4ggg cgcثq1ȡ4B< EE\$ؓ욑87'y|$ɏɏ D4Č4'Lא<א4ؓg444 4ؓ 4ggg cgcثq1ȡ4B |ik[mZT$ؓ8g88444 4 4ggg cgcثq1ȡ4B 88l5#}WT$ؓtUgUU555 5 5ggg cgcثq1ȡ5B UUdY3| T$ؓD\44ם̆ g 555 5 5ggg cgcثq1ȡ5B  C 4 b49۶ BC 8 B  d      g 555 5 5ggg cgcثq1ȡ5B    d ܈ @ B 8 B  t    U  g UU666 6 6ggg cgcثq1ȡ6B   UU \ Is?o ƖB 8 ƖB      Ɩ5   556 6B   5  g 666 6 6ggg cgcثq1ȡ6B   3 #  B3 8 B  #      g 666 6 6ggg cgcثq1ȡ6B "   Ě1 cK B 8 B  1 B̾1 1!      g 666 6 6ggg cgcثq1ȡ6B 1   J *? B 8 B  J B̲J J!       6 6B I    g 666 6 6ggg cgcثq1ȡ6B I  &  Bh 9 B   +     p  g pp666 6 6ggg cgcثq1ȡ6B   pp \ cY: B 9 B   + ԭ    $   $$7 7B   $  g 777 7 7ggg cgcثq1ȡ7B      kr! B  9 B        g 777 7 7ggg cgcثq1ȡ7B   [ L %8.: B[ 8 B      " !   d  g dd777 7 7ggg cgcثq1ȡ7B   dd l םwT$ םB 9 םB  ܈     ם g 777 7ם 7ggg cgcثq1ȡ7B     Pd B 9 B  × + Ԩ    <  g <<777 7 7ggg cgcثq1ȡ7B   <<O ۪ ˞1_' ˞BO 9 ˞B  Ԏ +      ˞  7 7˞˞B    ˞ g 777 7˞ 7ggg cgcثq1ȡ7B    T , NJB 9 NJB  Ĉ    NJ  g 777 7 7ggg cgcثq1ȡ7B     ʟF]SN:D ʟB 8 ʟB      " !   P ʟ g PP777 7ʟ 7ggg cgcثq1ȡ7B   PP  > ; The configuration used for building a bounded backtracker. G D A bounded backtracker configuration is a simple data object that is/ , typically used with [`Builder::configure`].4 Ҫ                  7 7B    >   g > > 777 7 7ggg cgcثq1ȡ7B   > >       B  P ?( % A builder for a bounded backtracker.? ?M _@L I NFA construction and the `BoundedBacktracker` construction. This builderAM J is different from a general purpose regex builder in that it permits fineAN K grain configuration of the construction process. The trade off for this isBM J complexity, and the possibility of setting a configuration that might notBA > make sense. For example, there are two different UTF-8 modes:C CJ _DM _TD GDL bEK bE bF FJ _F ĝ_F lF /G GL bGL bH  assert_eq!(b"foo\xFFarzz", &haystack[got.unwrap()?.range()]);P P. Ǭ/

!! ,  !! <  !!b !!bb8 8B! ! !bc !g!cc888 8 8ggg cgcثq1ȡ8B! ! !ccT ,  *!!!!!!$  !!d   !!ÇL   !!t  !! $  !!ׁܡ 4  !!Ue !!UeUe8 8B! ! !Ueg !g!gg888 8 8ggg cgcثq1ȡ8B! ! !ggt <Ğ  çؓ!!Ʀ 4Ʀ  !!l 4  !!k !!kk8 8B! ! !kol !g!olol888 8 8ggg cgcثq1ȡ8B! ! !ololT ,  l0!!!!!!!!!!!!!!!!!!!!!!!!!  !,  !!l $  !!ÇL  !! ,  !!4  !! \  !!$  !!T $  !!l $  !!Çd  !! T  !! \  !!ׁl $  !!ÇT  !! T  !!! \!  !!ׁl" $"  !!Ç,$  !!Ľ$ T$  !!d,  !!Ġ, T,  !!$.  !! !!,2  !!2 T2  !!n !!nn8 8B! ! !nv !g!vv888 8 8ggg cgcثq1ȡ8B! ! !vvʂ !!ʂʂʂʂ8 8B! ! !ʂ3 3 !!3388 8 8B! ! !3 3s =6 3 An abstraction for building Thompson NFAs by hand.= =N K A builder is what a [`thompson::Compiler`](crate::nfa::thompson::Compiler)>B ? uses internally to translate a regex's high-level intermediate># representation into an [`NFA`].> ?I F The primary function of this builder is to abstract away the internal?K H representation of an NFA and make it difficult to produce NFAs are that@K H internally invalid or inconsistent. This builder also provides a way to@H E add "empty" states (which can be thought of as unconditional epsilonAL I transitions), despite the fact that [`thompson::State`](nfa::State) doesAK H not have any "empty" representation. The advantage of "empty" states isBN K that they make the code for constructing a Thompson NFA logically simpler.C CN K Many of the routines on this builder may panic or return errors. GenerallyCN K speaking, panics occur when an invalid sequence of method calls were made,DO L where as an error occurs if things get too big. (Where "too big" might meanEN K exhausting identifier space or using up too much heap memory in accordanceEA > with the configured [`size_limit`](Builder::set_size_limit).)F tF # OverviewF F  ## Adding multiple patternsF FA > Each pattern you add to an NFA should correspond to a pair ofGJ G [`Builder::start_pattern`] and [`Builder::finish_pattern`] calls, withGK H calls inbetween that add NFA states for that pattern. NFA states may beHM J added without first calling `start_pattern`, with the exception of addingH  capturing states.I ēI  ## Adding NFA statesI IM J Here is a very brief overview of each of the methods that add NFA states.I% " Every method adds a single state.J JB ? * [`add_empty`](Builder::add_empty): Add a state with a singleJ6 3 unconditional epsilon transition to another state.KH E * [`add_union`](Builder::add_union): Adds a state with unconditionalKG D epsilon transitions to two or more states, with earlier transitionsL  preferred over later ones.LJ G * [`add_union_reverse`](Builder::add_union_reverse): Adds a state withMG D unconditional epsilon transitions to two or more states, with laterM, ) transitions preferred over earlier ones.NN K * [`add_range`](Builder::add_range): Adds a state with a single transitionNK H to another state that can only be followed if the current input byte isܭO  within the range given.OH E * [`add_sparse`](Builder::add_sparse): Adds a state with two or morePJ G range transitions to other states, where a transition is only followedPJ G if the current input byte is within one of the ranges. All transitionsQK H in this state have equal priority, and the corresponding ranges must beQ  non-overlapping.RO L * [`add_look`](Builder::add_look): Adds a state with a single *conditional*RI F epsilon transition to another state, where the condition depends on aS!  limited look-around property.SJ G * [`add_capture_start`](Builder::add_capture_start): Adds a state withTH E a single unconditional epsilon transition that also instructs an NFATM J simulation to record the current input position to a specific location inUN K memory. This is intended to represent the starting location of a capturingTU  group.VF C * [`add_capture_end`](Builder::add_capture_end): Adds a state withVH eWM eWL I memory. This is intended to represent the ending location of a capturingTX eXM J * [`add_fail`](Builder::add_fail): Adds a state that never transitions toY  another state.YO L * [`add_match`](Builder::add_match): Add a state that indicates a match hasYL I been found for a particular pattern. A match state is a final state withZ  no outgoing transitions.Z Z- * ## Setting transitions between NFA states[ [L I The [`Builder::patch`] method creates a transition from one state to the[K H next. If the `from` state corresponds to a state that supports multiple\L I outgoing transitions (such as "union"), then this adds the corresponding\N K transition. Otherwise, it sets the single transition. (This routine panics]O L if `from` corresponds to a state added by `add_sparse`, since sparse states^$ ! need more specialized handling.)^ l^ /^ ^I F This annotated example shows how to hand construct the regex `[a-z]+`_# (without an unanchored prefix)._ <_ /_ /_= F`" Ft` 04` ݥ/` `% F`L I // Before adding NFA states for our pattern, we need to tell the buildera( % // that we are starting the pattern.a FbM J // Since we use the Pike VM below for searching, we need to add capturingbO L // states. If you're just going to build a DFA from the NFA, then capturingc& # // states do not need to be added.cC Fd. + let range = builder.add_range(Transition {dN K // We don't know the state ID of the 'next' state yet, so we just fille# // in a dummy 'ZERO' value.e4 FDe FeO L // This state will point back to 'range', but also enable us to move ahead.fO L // That is, this implements the '+' repetition operator. We add 'range' andg, ) // then 'end' below to this alternation.g) FgJ G // The final state before the match state, which serves to capture theh!  // end location of the match.h9 6 let end = builder.add_capture_end(StateID::ZERO, 0)?;i' $ // The match state for our pattern.i# let mat = builder.add_match()?;i5 2 // Now we fill in the transitions between states.j!  builder.patch(start, range)?;j  builder.patch(range, alt)?;jG D // If we added 'end' before 'range', then we'd implement non-greedyk  // matching, i.e., '+?'.k  builder.patch(alt, range)?;k  builder.patch(alt, end)?;k  builder.patch(end, mat)?;lN K // We must explicitly finish pattern and provide the starting state ID forl  // this particular pattern.m# FmM J // Finally, when we build the NFA, we provide the anchored and unanchoredmK H // starting state IDs. Since we didn't bother with an unanchored prefixnO L // here, we only support anchored searching. Thus, both starting states areo // the same.o+ ( let nfa = builder.build(start, start)?;o oM J // Now build a Pike VM from our NFA, and use it for searching. This showspH E // how we can use a regex engine without ever worrying about syntax!p( Hq& ʛ0q( 0q. 1r/ , re.captures(&mut cache, "foo0", &mut caps);r+ Ċ0r r. Ǭ/ ; explicit capture groups, are included in the Thompson NFA.!!!!D ϢD A Only capture states corresponding to implicit capture groups areH E included. Implicit capture groups appear in every pattern implicitly5 2 and correspond to the overall match of a pattern. C @ This is useful when one only cares about the overall match of aF C pattern. By excluding capture states from explicit capture groups,I F one might be able to reduce the memory usage of a multi-pattern regexK H substantially if it was otherwise written to have many explicit capture\ئ cN!!cf!!$ 9 6 No capture states are compiled into the Thompson NFA. J G This is useful when capture states are either not needed (for example,J G if one is only trying to build a DFA) or if they aren't supported (forڨ  example, a reverse NFA). l # Warning 7 4 Callers must be exceedingly careful when using this٩8 5 option. In particular, not all regex engines support> ; reporting match spans when using this option (for example,٪7 4 [`PikeVM`](crate::nfa::thompson::pikevm::PikeVM) orQ N [`BoundedBacktracker`](crate::nfa::thompson::backtrack::BoundedBacktracker)). < 9 Perhaps more confusingly, using this option with such an? < engine means that an `is_match` routine could report `true`? < when `find` reports `None`. This is generally not something? < that _should_ happen, but the low level control provided by!  this crate makes it possible. K H Similarly, any regex engines (like [`meta::Regex`](crate::meta::Regex))H E should always return `None` from `find` routines when this option is˯E B used, even if _some_ of its internal engines could find the matchE B boundaries. This is because inputs from user data could influence߰I F engine selection, and thus influence whether a match is found or not.I F Indeed, `meta::Regex::find` will always return `None` when configured  with this option.A!!VY!!  ""9 9B! ! "   r "g"rr999 9 9ggg cgcثq1ȡ9B" " "rr I F A builder for compiling an NFA from a regex's high-level intermediate̅  representation (HIR). L I This compiler provides a way to translate a parsed regex pattern into anO L NFA state graph. The NFA state graph can either be used directly to executeN K a search (e.g., with a Pike VM), or it can be further used to build a DFA. O L This compiler provides APIs both for compiling regex patterns directly from? < their concrete syntax, or via a [`regex_syntax::hir::Hir`]. @ = This compiler has various options that may be configured via!  [`thompson::Config`](Config). M J Note that a compiler is not the same as a [`thompson::Builder`](Builder).I F A `Builder` provides a lower level API that is uncoupled from a regexL I pattern's concrete syntax or even its HIR. Instead, it permits stitching7 4 together an NFA by hand. See its docs for examples. / , # Example: compilation from concrete syntax O L This shows how to compile an NFA from a pattern string while setting a sizeO L limit on how big the NFA is allowed to be (in terms of bytes of heap used). < /̏ /- * nfa::thompson::{NFA, pikevm::PikeVM},t 04 ݥ/ ; 0C H ( H& ʛ0( 0. D2 H+ Ċ0 . Ǭ/< / # # Example: compilation from HIR N K This shows how to hand assemble a regular expression via its HIR, and then$ ! compile an NFA directly from it. < /F HE ބ0 ; 0) 0) 0) 0) 0L Ї0 ; 0F 0 ( H& ʛ0( 0. D2 H+ Ċ0 . Ǭ/< /D «ݝ"""""" 4  ""t 4  ""̌ <  "" T  "" T  ""# \  ""5 ""559 9B" " "5 "g"999 9 9ggg cgcثq1ȡ9B" " "죔 \ CjD""ǔ ,Ҕ ""Ç  ""Çfff f ""ff9 9B" " "f    "g"999 9 9ggg cgcثq1ȡ9B" " " dŞ  ""aEQ"""Ҟ ܞ <ܞ  ""I ,  ""I| 4  ""Çk """g"kk999 9 9ggg cgcثq1ȡ9B" " "kkğ L˟  OZ1 j""۟ D۟  "" T  "" ""9 9B" " "N "g"NN999 9 9ggg cgcثq1ȡ9B" " "NN| D  h""Š ,Š  "" $  "" ""9 9B" " "o "g"oo999 9 9ggg cgcثq1ȡ9B" " "oo̞   U""L ,  ""<͡ ͡  ""V ""VV9 9B" " "V "g"999 9 9ggg cgcثq1ȡ9B" " ""QI"F An error that can occurred during the construction of a thompson NFA."J"ď`1"`"G"`I"F * Access an underlying [`regex_syntax::Error`] type from its `source`O"`L"I convenience routines for building an NFA directly from a pattern string."I"F Otherwise, errors typically occur when a limit has been breached. ForJ"G example, if the total heap usage of the compiled NFA exceeds the limitI"F set by [`Config::nfa_size_limit`](crate::nfa::thompson::Config), then" building the NFA will fail.T"װJ~Qqu ""$" "" װ""9 9װװB""" "? װ"g"??999 9װ 9ggg cgcثq1ȡ9B""" "??"t" Ld ce"""""""""""""" B""B""B"""""""C  " "C  "" "C C   B""f " ""    "" "   B""f " ""   "" "   B""f" ""|" ""d"," ""d"," ""l" ""d"," ""d"," """ ""d"," """ ""T"," """"Ծ" ""02 ""l ""ll9 9B""" "l?  "g"? ? 999 9 9ggg cgcثq1ȡ9B""" "? ? ! \" F l%J""$ 4$  ""L% %  "" ""9 9B"! " "k ,k  ""e%'V롳""""k k 4k  ""ɵm. \m  ""ppp opopo2Ыp ,p  ""r! 4r  ""i """g"ii9:: 9 :ggg cgcثq1ȡ:B"j " "iidà ,ʃ  2<9Ȉ""փ \փ  "" 4  "" "": :B" " " ""B"" "Դ |  ""ɵUz"""˚ ՚ \՚  ""I- 4  ""ppp opopo2Ы 4  ""I} ""ɵ"g"}}::: :ɵ :ggg cgcثq1ȡ:B" " "}} T  @E""D $  ""l $  ""Ç999 9 ""99: :B" " "9   ̊ #t #OwP o"""d##<## ""|##D## ""Ԁ%#%# ""ÿ "": :B"#" "e  #g#e e ::: : :ggg cgcثq1ȡ:B" #" #e e %#%# Q<###d'#<'# ##(#(# ##d)#)# ##Ç# ####: :B#%## ### #g###::: : :ggg cgcثq1ȡ:B#%## ###O& ##O&O&B## #@#l@#θ㾞a~###dB#exp)` or `(?exp)` - A named capturing group.(% * `(?:exp)` - A non-capturing group.96 * `(?i:exp)` - A non-capturing group that sets flags.B? Only the first two forms are said to be _capturing_. CapturingGD means that the last position at which they match is reportable. TheJG [`Captures`](crate::util::captures::Captures) type provides convenientMJ access to the match positions of capturing groups, which includes looking&# up capturing groups by their name. # Byte orientedJG This NFA is byte oriented, which means that all of its transitions areLI defined on bytes. In other words, the alphabet of an NFA consists of the 256 different byte values.GD While DFAs nearly demand that they be byte oriented for performanceNK reasons, an NFA could conceivably be *Unicode codepoint* oriented. Indeed,MJ a previous version of this NFA supported both byte and codepoint orientedOL modes. A codepoint oriented mode can work because an NFA fundamentally usesKH a sparse representation of transitions, which works well with the large'$ sparse space of Unicode codepoints.JG Nevertheless, this NFA is only byte oriented. This choice is primarilyJG driven by implementation simplicity, and also in part memory usage. InIF practice, performance between the two is roughly comparable. However,MJ building a DFA (including a hybrid DFA) really wants a byte oriented NFA.LI So if we do have a codepoint oriented NFA, then we also need to generateHE byte oriented NFA in order to build an hybrid NFA/DFA. Thus, by onlyOL generating byte oriented NFAs, we can produce one less NFA. In other words,NK if we made our NFA codepoint oriented, we'd need to *also* make it supportMJ a byte oriented mode, which is more complicated. But a byte oriented modeܬ can support everything. # Differences with DFAsMJ At the theoretical level, the precise difference between an NFA and a DFALI is that, in a DFA, for every state, an input symbol unambiguously refers JG to a single transition _and_ that an input symbol is required for each LI transition. At a practical level, this permits DFA implementations to be!NK implemented at their core with a small constant number of CPU instructions!MJ for each byte of input searched. In practice, this makes them quite a bit"OL faster than NFAs _in general_. Namely, in order to execute a search for any#KH Thompson NFA, one needs to keep track of a _set_ of states, and execute#JG the possible transitions on all of those states for each input symbol.$NK Overall, this results in much more overhead. To a first approximation, one$EB can expect DFA searches to be about an order of magnitude faster.%%KH So why use an NFA at all? The main advantage of an NFA is that it takes&NK linear time (in the size of the pattern string after repetitions have been&MJ expanded) to build and linear memory usage. A DFA, on the other hand, may'IF take exponential time and/or space to build. Even in non-pathological'OL cases, DFAs often take quite a bit more memory than their NFA counterparts,(LI _especially_ if large Unicode character classes are involved. Of course,)KH an NFA also provides additional capabilities. For example, it can match)JG Unicode word boundaries on non-ASCII text and resolve the positions of*_**OL Note that a [`hybrid::regex::Regex`](crate::hybrid::regex::Regex) strikes a+OL good balance between an NFA and a DFA. It avoids the exponential build time+MJ of a DFA while maintaining its fast search time. The downside of a hybrid,OL NFA/DFA is that in some cases it can be slower at search time than the NFA.,MJ (It also has less functionality than a pure NFA. It cannot handle Unicode-KH word boundaries on non-ASCII text and cannot resolve capturing groups.).l./..OL This shows how to build an NFA with the default configuration and execute a. search using the Pike VM./\d{4})-(?P\d{2})-(?P\d{2})")?;5&F66;8 let haystack = "2012-03-14, 2013-01-01 and 2014-07-05";6.+ let all: Vec = vm.captures_iter(6'$ &mut cache, haystack.as_bytes()7 ).collect();7,) // There should be a total of 3 matches.7 assert_eq!(3, all.len());70- // The year from the second match is '2013'.863 let span = all[1].get_group_by_name("y").unwrap();8(% assert_eq!("2013", &haystack[span]);99.Ǭ/<9/99GD This example shows that only the last match of a capturing group is:IF reported, even if it had to match multiple times for an overall matchl: to occur.:<:/:>M;;)& let re = PikeVM::new(r"([a-z]){4}")?;;&ʛ0<(0<ܰ< let haystack = b"quux";<10<<=:7 assert_eq!(Some(Span::from(3..4)), caps.get_group(1));==.Ǭ/<>/>gNpk+##B3 7 B## #TD ##5 ##55: :B#># #5, ԻZx###############4 ##t ##Ç ##Çܸl ##T ##t ##̩d ##\ ##|ދLދ ##T$ ##l< ##ڏdڏ ##ǑdǑ ## ##d ##L Ի##LLԻB## #t A state in an NFA.MJ In theory, it can help to conceptualize an `NFA` as a graph consisting ofMJ `State`s. Each `State` contains its complete set of outgoing transitions.GD In practice, it can help to conceptualize an `NFA` as a sequence ofNK instructions for a virtual machine. Each `State` says what to do and where| to go next.LI Strictly speaking, the practical interpretation is the most correct one,IF because of the [`Capture`](State::Capture) state. Namely, a `Capture`NK state always forwards execution to another state unconditionally. Its onlyIF purpose is to cause a side effect: the recording of the current inputHE position at a particular location in memory. In this sense, an `NFA`IF has more power than a theoretical non-deterministic finite automaton.MJ For most uses of this crate, it is likely that one may never even need toLI be aware of this type at all. The main use cases for looking at `State`sNK directly are if you need to write your own search implementation or if you0- need to do some kind of analysis on the NFA.,Ƚ=@`P###############ȽB##ȽB###########LJG A state with a single transition that can only be taken if the current30 input symbol is in a particular range of bytes.##Ƚ/, The transition from this state to the next.,## KH A state with possibly many transitions represented in a sparse fashion.JG Transitions are non-overlapping and ordered lexicographically by inputT range.JG In practice, this is used for encoding UTF-8 automata. Its presence isGD primarily an optimization that avoids many additional unconditionalFC epsilon transitions (via [`Union`](State::Union) states), and thusGD decreases the overhead of traversing the NFA. This can improve both,) matching time and DFA construction time. ## #  ȽB##g## @= A dense representation of a state with multiple transitions. ## #  ȽB##g##$?< A conditional epsilon transition satisfied via some sort ofC@ look-around. Look-around is limited to anchor and word boundary| assertions.IF Look-around states are meant to be evaluated while performing epsilonJG closure (computing the set of states reachable from a particular stateJG via only epsilon transitions). If the current position in the haystackHE satisfies the look-around assertion, then you're permitted to follow that epsilon transition.=##ȽTB? The look-around assertion that must be satisfied before movingt to `next`.$##l>; The state to transition to if the look-around assertion ist satisfied.$##Ç,FC An alternation such that there exists an epsilon transition to allGD states in `alternates`, where matches found via earlier transitions)& are preferred over later transitions.##ȽEB An ordered sequence of unconditional epsilon transitions to otherB? states. Transitions earlier in the sequence are preferred over&# transitions later in the sequence.T##\EB An alternation such that there exists precisely two unconditionalJG epsilon transitions, where matches found via `alt1` are preferred over matches found via `alt2`.GD This state exists as a common special case of Union where there areGD only two alternates. In this case, we don't need any allocations toEB represent the state. This saves a bit of memory and also saves an52 additional memory access when traversing the NFA.##ȽlB? An unconditional epsilon transition to another NFA state. This is preferred over `alt2`.$##ÇlEB An unconditional epsilon transition to another NFA state. MatchesFC reported via this transition should only be reported if no matches# were found by following `alt1`.$##Ç<30 An empty state that records a capture location.IF From the perspective of finite automata, this is precisely equivalentEB to an unconditional epsilon transition, but serves the purpose ofۀJG instructing NFA simulations to record additional state when the finite96 state machine passes through this epsilon transition.DA `slot` in this context refers to the specific capture group slotEB offset that is being recorded. Each capturing group has two slotsFC corresponding to the start and end of the matching portion of thatT΃e݃JG The pattern ID and capture group index are also included in this stateFC in case they are useful. But mostly, all you'll need is `next` and\ `slot`.c##Ƚlڅ0- The state to transition to, unconditionally.$څ##Ç0- The pattern ID that this capture belongs to.T##ɆGD The capture group index that this capture belongs to. Capture groupB? indices are local to each pattern. For example, when capturingB? groups are enabled, every pattern has a capture group at indexDR\##ׁڋB? The slot index for this capture. Every capturing group has two@= slots: one for the start haystack offset and one for the endC@ haystack offset. Unlike capture group indices, slot indices areFC global across all patterns in this NFA. That is, each slot belongsA> to a single pattern, but there is only one slot at index `i`.$ڋ##ׁ$HE A state that cannot be transitioned out of. This is useful for casesČKH where you want to prevent matching from occurring. For example, if yourGD regex parser permits empty character classes, then one could chooseFC a `Fail` state to represent them. (An empty character class can beJG thought of as an empty set. Since nothing is in an empty set, they can never match anything.)##Ƚ##Ƚ,JG A match state. There is at least one such occurrence of this state for2/ each regex that can match that is in this NFA.##Ƚސ乐 The matching pattern ID.Tސ##sN Ƚ##sNsN: :ȽȽB## #sNV Ƚ##VVVV: :ȽB## #VkV ȽkV Ƚ##kVkV:: :Ƚ :ȽB## #kV kV?< A sequence of transitions used to represent a sparse state.LI This is the primary representation of a [`Sparse`](State::Sparse) state.KH It corresponds to a sorted sequence of transitions with non-overlappingLI byte ranges. If the byte at the current position in the haystack matchesIF one of the byte ranges, then the finite state machine should take the corresponding transition.Gws{w#"74 The sorted sequence of non-overlapping transitions.\##h ##hh: :B## #h>i #g#>i>i::: : :ggg cgcثq1ȡ:B## #>i>ij ##jjjj: :B## #j7k 7k ##7k7k:: : :B## #7k 7kܸ>; A sequence of transitions used to represent a dense state.MJ This is the primary representation of a [`Dense`](State::Dense) state. ItLI provides constant time matching. That is, given a byte in a haystack andLI a `DenseTransitions`, one can determine if the state matches in constantL time.HE This is in contrast to `SparseTransitions`, whose time complexity isOL necessarily bigger than constant time. Also in contrast, `DenseTransitions`-* usually requires (much) more heap memory.F%}#HE A dense representation of this state's transitions on the heap. Thisԧ always has length 256.\##r ##rr: :B## #rr #g#rr::: : :ggg cgcثq1ȡ:B## #rrCt ##CtCtCtCt: :B## #Ctt t ##tt:: : :B## #t t)& A single transition to another state.LI This transition may only be followed if the current byte in the haystack41 falls in the inclusive range of bytes specified.TC$5vc###l*' The inclusive start of the byte range.,##\(% The inclusive end of the byte range.##1. The identifier of the state to transition to.$##Ç}}} } $$}}: :B## $}  k~ $$k~k~k~k~; ;B$$ $k~~ $h$~~;; ; ;ù B$$$$b~b~ $ù ~~~~( ( $$((;; ; ;B$$ $( (ԩ/, An iterator over all pattern IDs in an NFA.2/ This iterator is created by [`NFA::patterns`].LI The lifetime parameter `'a` refers to the lifetime of the NFA from which&# this pattern iterator was created.\$$ 66\$$ $$*< $$!!!Ȅo$z -  $$$g$;;; ; ;ggg cgcثq1ȡ;B$$ $52 The configuration used for building a [`PikeVM`].NK A PikeVM configuration is a simple data object that is typically used with52 [`Builder::configure`]. It can be cheaply cloned.H_74 perhaps more conveniently, with [`PikeVM::config`].4#h} $$T$$$$ E $$EE; ;B$$ $Eڄ $g$ڄڄ;;; ; ;ggg cgcثq1ȡ;B$$ $ڄڄ $$B$$ $H8 A builder for a `PikeVM`.88IF This builder permits configuring options for the syntax of a pattern,8GD the NFA construction and the `PikeVM` construction. This builder is9JG different from a general purpose regex builder in that it permits fine:Nd:Md;Ad;;GD * [`util::syntax::Config::utf8`](crate::util::syntax::Config::utf8)>J_>ĝ_>l>/??Lb?Lb@<@/̮@/@.G@0tA04Aݥ/AAGA20A60B&0B&ʛ0BC49C.9C85 let got = re.find_iter(&mut cache, haystack).next();D3D6_D8ݡ_E"_4Eŷ0E4آ_F:7 // disabling UTF-8 mode on a PikeVM Config, since thatF7eGeG@bGG.Ǭ/$$L,L$$̻L [\x00-`]t 1 => [a-z] 2 => [{-\xFF]t 3 => [EOI]</EB Where EOI is the special sentinel value that is always in its own  singleton equivalence class.$f) J%%Bi 7B%% %D%%MMM M %%MM< <B% % %M   %%< <B% % %s s %%ss<< < <B% % %s s %%<< < < B% % %  %%<< < < B% % % lDf%%%%%%B%%B  %% %  B%%i %%  %% %  B%%i"%%\\\ \ %%\\< <B% % %\   %%< <B% % %  %%<< < <B% % %  %%<< < < B% % %  %%<< < < B% % % W =:7 A representation of byte oriented equivalence classes.==NK This is used in a DFA to reduce the size of the transition table. This can>OL have a particularly large impact not only on the total size of a dense DFA,> but also on compile times.??LI The essential idea here is that the alphabet of a DFA is shrunk from the?LI usual 256 distinct byte values down to a set of equivalence classes. The@NK guarantee you get is that any byte belonging to the same equivalence classAJG can be treated as if it were any other byte in the same class, and theA'$ result of a search wouldn't change.AlA/BB63 This example shows how to get byte classes from anBNK [`NFA`](crate::nfa::thompson::NFA) and ask for the class of various bytes.CM!!AٖM"J/""5M#<#:<#:<$;<$$.Ǭ/<%/%%%" # Example: named capturing groups%%IF This example is like the one above, but leverages the ability to name&=: capturing groups in order to make the code a bit clearer:&<&/&>M''PM let re = PikeVM::new(r"^(?P[0-9]{4})-(?P[0-9]{2})-(?P[0-9]{2})$")?;'J/((5M(<)DA assert_eq!(Some(Span::from(0..4)), caps.get_group_by_name("y"));)DA assert_eq!(Some(Span::from(5..7)), caps.get_group_by_name("m"));*EB assert_eq!(Some(Span::from(8..10)), caps.get_group_by_name("d"));**.Ǭ/<+/D+Ms!—Ԏ&&&-T-&&..&&>,>&&'3 &&'3'3= =B& +& &'3ׄ"@= An iterator over all capturing groups in a `Captures` value.IF This iterator includes capturing groups that did not participate in aKH match. See the [`Captures::iter`] method documentation for more detailsʃ and examples.܃HE The lifetime parameter `'a` refers to the lifetime of the underlying `Captures` value.&&MT Pb &&$&&ЫQ7,&&܋<< 0{?iX &&&&XX= =B& Ȅ& &X+Y &&&g&?B+Y+Y=== = =ggg cgcثq1ȡ=B& τ& &+Y+Y ։FC Represents information about capturing groups in a compiled regex.LI The information encapsulated by this type consists of the following. For each pattern:LI * A map from every capture group name to its corresponding capture groupTы index.܋MJ * A map from every capture group index to its corresponding capture groupL name.LI * A map from capture group index to its corresponding slot index. A slotNK refers to one half of a capturing group. That is, a capture slot is eitherЍJG the start or end of a capturing group. A slot is usually the mechanismMJ by which a regex engine records offsets for each capturing group during a\PIF A `GroupInfo` uses reference counting internally and is thus cheap toTÏ clone.Ώҏ*' # Mapping from capture groups to slotsKH One of the main responsibilities of a `GroupInfo` is to build a mapping͐MJ from `(PatternID, u32)` (where the `u32` is a capture index) to somethingGD called a "slot." As mentioned above, a slot refers to one half of aGD capturing group. Both combined provide the start and end offsets of30 a capturing group that participated in a match.ߒMJ **The mapping between group indices and slots is an API guarantee.** ThatDA is, the mapping won't change within a semver compatible release.IF Slots exist primarily because this is a convenient mechanism by whichĔGD regex engines report group offsets at search time. For example, theKH [`nfa::thompson::State::Capture`](crate::nfa::thompson::State::Capture)ؕNK NFA state includes the slot index. When a regex engine transitions throughOL this state, it will likely use the slot index to write the current haystackKH offset to some region of memory. When a match is found, those slots are×NK then reported to the caller, typically via a convenient abstraction like a [`Captures`] value.NK Because this crate provides first class support for multi-pattern regexes,HE and because of some performance related reasons, the mapping betweenƙMJ capturing groups and slots is a little complex. However, in the case of aMJ single pattern, the mapping can be described very simply: for all captureNK group indices `i`, its corresponding slots are at `i * 2` and `i * 2 + 1`.JG Notice that the pattern ID isn't involved at all here, because it onlyB? applies to a single-pattern regex, it is therefore always `0`.ÜMJ In the multi-pattern case, the mapping is a bit more complicated. To talkEB about it, we must define what we mean by "implicit" vs "explicit"ם capturing groups:KH * An **implicit** capturing group refers to the capturing group that isKH present for every pattern automatically, and corresponds to the overallJG match of a pattern. Every pattern has precisely one implicit capturingԟNK group. It is always unnamed and it always corresponds to the capture groupt index `0`.HE * An **explicit** capturing group refers to any capturing group thatJG appears in the concrete syntax of the pattern. (Or, if an NFA was handơOL built without any concrete syntax, it refers to any capturing group with an䖢 index greater than `0`.) Some examples:ʢ΢HE * `\w+` has one implicit capturing group and zero explicit capturing\c<9 * `(\w+)` has one implicit group and one explicit group.MJ * `foo(\d+)(?:\pL+)(\d+)` has one implicit group and two explicit groups.EB Turning back to the slot mapping, we can now state it as follows:KH * Given a pattern ID `pid`, the slots for its implicit group are alwaysȥ# at `pid * 2` and `pid * 2 + 1`.EB * Given a pattern ID `0`, the slots for its explicit groups start&# at `group_info.pattern_len() * 2`.٦KH * Given a pattern ID `pid > 0`, the slots for its explicit groups startNK immediately following where the slots for the explicit groups of `pid - 1`D end.MJ In particular, while there is a concrete formula one can use to determineϨJG where the slots for the implicit group of any pattern are, there is noJG general formula for determining where the slots for explicit capturingKH groups are. This is because each pattern can contain a different numbert of groups.ĪJG The intended way of getting the slots for a particular capturing groupDA (whether implicit or explicit) is via the [`GroupInfo::slot`] orԫ  [`GroupInfo::slots`] method.JG See below for a concrete example of how capturing groups get mapped toTĬ slots.ϬlӬ/FQε5</ɭKH use regex_automata::util::{captures::GroupInfo, primitives::PatternID};#Q QޮQ2Q&QD̯1կ,Q&Q96 // We can query the number of groups for any pattern.63 assert_eq!(2, info.group_len(PatternID::must(0)));63 assert_eq!(1, info.group_len(PatternID::must(1)));ѱ63 assert_eq!(5, info.group_len(PatternID::must(2)));63 assert_eq!(3, info.group_len(PatternID::must(3)));1. // An invalid pattern always has zero groups.85 assert_eq!(0, info.group_len(PatternID::must(999)));ĪQó$QHE // We can map a group index for a particular pattern to its name, if // one exists.ȴA> assert_eq!(Some("foo"), info.to_name(PatternID::must(3), 2));:7 assert_eq!(None, info.to_name(PatternID::must(2), 4));ŵ(% // Or map a name to its group index.B? assert_eq!(Some(1), info.to_index(PatternID::must(0), "foo"));B? assert_eq!(Some(2), info.to_index(PatternID::must(3), "foo"));.Ǭ/</30 # Example: mapping from capture groups to slotsJG This example shows the specific mapping from capture group indices forLI each pattern to their corresponding slots. The slot values shown in this,) example are considered an API guarantee.</Kj#Q QѺQ2Q&QD1Ȼ̻A> // We first show the slots for each pattern's implicit group.@= assert_eq!(Some((0, 1)), info.slots(PatternID::must(0), 0));ϼ@= assert_eq!(Some((2, 3)), info.slots(PatternID::must(1), 0));@= assert_eq!(Some((4, 5)), info.slots(PatternID::must(2), 0));ѽ@= assert_eq!(Some((6, 7)), info.slots(PatternID::must(3), 0));C@ // And now we show the slots for each pattern's explicit group.ھ@= assert_eq!(Some((8, 9)), info.slots(PatternID::must(0), 1));B? assert_eq!(Some((10, 11)), info.slots(PatternID::must(2), 1));޿B? assert_eq!(Some((12, 13)), info.slots(PatternID::must(2), 2));B? assert_eq!(Some((14, 15)), info.slots(PatternID::must(2), 3));B? assert_eq!(Some((16, 17)), info.slots(PatternID::must(2), 4));B? assert_eq!(Some((18, 19)), info.slots(PatternID::must(3), 1));B? assert_eq!(Some((20, 21)), info.slots(PatternID::must(3), 2));LI // Asking for the slots for an invalid pattern ID or even for an invalidKH // group index for a specific pattern will return None. So for example,NK // you're guaranteed to not get the slots for a different pattern than the // one requested.85 assert_eq!(None, info.slots(PatternID::must(5), 0));85 assert_eq!(None, info.slots(PatternID::must(1), 1));.Ǭ/</LbYvR&&B 8B&& &&&T[ &&T[T[= =B& & &T[[ &g&[[=== = =ggg cgcثq1ȡ=B& & &[[] &&]]B&& &tAl H&&&&*\&&ߤ"lߤ&&)l&&d&&J &g&JJ=== = =ggg cgcثq1ȡ=B& & &JJb &&bbB&& &̄85 An error that may occur when building a `GroupInfo`.DA Building a `GroupInfo` does a variety of checks to make sure theNK capturing groups satisfy a number of invariants. This includes, but is notKH limited to, ensuring that the first capturing group is unnamed and thatA> there are no duplicate capture groups for a specific pattern.tLyFdM&Ĥ$&&| &&||> >B& & &| &g&>>> > >ggg cgcثq1ȡ>B& & &u0&&&&&&&&&&&&|&&&&l&&<&&t<&&l&&<&&&&<&&L&&<&&d$&&+ &&++> >B& & &+< &g&<<>>> > >ggg cgcثq1ȡ>B& & &<<$MJ An iterator over capturing groups and their names for a specific pattern.=: This iterator is created by [`GroupInfo::pattern_names`].IF The lifetime parameter `'a` refers to the lifetime of the `GroupInfo`Æ)& from which this iterator was created.&&'|02y&+&&ppp opopo2Ы &&&&> >B& & &A &&&g&14AA>>> > >ggg cgcثq1ȡ>B& & &AAՎ ŌHE An iterator over capturing groups and their names for a `GroupInfo`.96 This iterator is created by [`GroupInfo::all_names`].̍ЍIj)j&&ox2&&&&T&& $&&\&&؏?,؏&&řǙșəʙ˙G*R{9  js &&&g&ss>>> > >ggg cgcثq1ȡ>B& ͎& &ss4 <$9 Provides a convenient `Debug` implementation for a `u8`.$L$I The `Debug` impl treats the byte as an ASCII, and emits a human readableM$J representation of it. If the byte isn't ASCII, then it's emitted as a hex$ escape sequence.L$)8OhC&&B4 6B&& &4$&&  ''> >B' $' ' $ ;T;''RT ''<d<<''T<<'' ''~ ''''> >B' ;' ' ; ''473 '''g'gj33>>> > >ggg cgcثq1ȡ>B' ;' '33 ''''VY> >B' ;' ' '' ''''-0>> > >B' ;' ' d==''](!"l''''''B''B=  '' '  B''k<=''U U '' 'U U B''k,=''}}} ''AD} ''''tw}}> >B' =' '} = '' '''g'.1>>> > >ggg cgcثq1ȡ>B' =' ' '''' > >B' =' '] ''] '''']]>> > >B' =' '] ]8%K%H A searcher for creating iterators and performing lower level iteration.%L%I This searcher encapsulates the logic required for finding all successiveJ%G non-overlapping matches in a haystack. In theory, iteration would look% something like this:%)%& 1. Setting the start position to `0`.:%7 2. Execute a regex search. If no match, end iteration.K%H 3. Report the match and set the start position to the end of the match.% 4. Go back to (2).%J%G And if this were indeed the case, it's likely that `Searcher` wouldn't O%L exist. Unfortunately, because a regex may match the empty string, the above K%H logic won't work for all possible regexes. Namely, if an empty match is J%G found, then step (3) would set the start position of the search to the 8%5 position it was at. Thus, iteration would never end. % H%E Instead, a `Searcher` knows how to detect these cases and forcefully H%E advance iteration in the case of an empty match that overlaps with a % previous match. % N%K If you know that your regex cannot match any empty string, then the simple 2%/ algorithm described above will work correctly. % J%TN%T%T%O%L In particular, a `Searcher` is not itself an iterator. Instead, it providesN%K `advance` routines that permit moving the search along explicitly. It alsoI%F provides various routines, like [`Searcher::into_matches_iter`], thatL%I accept a closure (representing how a regex engine executes a search) and$%! returns a conventional iterator.%B%? The lifetime parameters come from the [`Input`] type passed to% [`Searcher::new`]:%6%T%Ԋ% # Searcher vs Iterator%M%J Why does a search type with "advance" APIs exist at all when we also haveJ%G iterators? Unfortunately, the reasoning behind this split is a complex(%% combination of the following things:%M%J 1. While many of the regex engines expose their own iterators, it is alsoO%L nice to expose this lower level iteration helper because it permits callersO%L to provide their own `Input` configuration. Moreover, a `Searcher` can workK%H with _any_ regex engine instead of only the ones defined in this crate.G%D This way, everyone benefits from a shared iteration implementation.L%I 2. There are many different regex engines that, while they have the sameI%F match semantics, they have slightly different APIs. Iteration is justM%J complex enough to want to share code, and so we need a way of abstractingN%K over those different regex engines. While we could define a new trait thatN%K describes any regex engine search API, it would wind up looking very closeM%J to a closure. While there may still be reasons for the more generic traitJ%G to exist, for now and for the purposes of iteration, we use a closure.M%J Closures also provide a lot of easy flexibility at the call site, in thatO%L they permit the caller to borrow any kind of state they want for use during% each search call.N%K 3. As a result of using closures, and because closures are anonymous typesJ%G that cannot be named, it is difficult to encapsulate them without bothJ%G costs to speed and added complexity to the public API. For example, in"% defining an iterator type like@%= [`dfa::regex::FindMatches`](crate::dfa::regex::FindMatches), N%K if we use a closure internally, it's not possible to name this type in the L%I return type of the iterator constructor. Thus, the only way around it is!N%K to erase the type by boxing it and turning it into a `Box`.!L%I This boxed closure is unlikely to be inlined _and_ it infects the public"N%K API in subtle ways. Namely, unless you declare the closure as implementing#J%G `Send` and `Sync`, then the resulting iterator type won't implement it#H%E either. But there are practical issues with requiring the closure to$J%G implement `Send` and `Sync` that result in other API complexities that$9%6 are beyond the scope of this already long exposition.%I%F 4. Some regex engines expose more complex match information than just%J%G "which pattern matched" and "at what offsets." For example, the PikeVM&I%F exposes match spans for each capturing group that participated in the'K%H match. In such cases, it can be quite beneficial to reuse the capturing'M%J group allocation on subsequent searches. A proper iterator doesn't permit(O%L this API due to its interface, so it's useful to have something a bit lower(K%H level that permits callers to amortize allocations while also reusing a)B%? shared implementation of iteration. (See the documentation for*L%I [`Searcher::advance`] for an example of using the "advance" API with thed*% PikeVM.)*%*J%G What this boils down to is that there are "advance" APIs which require+M%J handing a closure to it for every call, and there are also APIs to create+F%C iterators from a closure. The former are useful for _implementing_,L%I iterators or when you need more flexibility, while the latter are useful-9%6 for conveniently writing custom iterators on-the-fly.-%-&%# # Example: iterating with captures-%-J%G Several regex engines in this crate over convenient iterator APIs over.L%I [`Captures`] values. To do so, this requires allocating a new `Captures`/K%H value for each iteration step. This can perhaps be more costly than you/G%D might want. Instead of implementing your own iterator to avoid that0J%G cost (which can be a little subtle if you want to handle empty matches0=%: correctly), you can use this `Searcher` to do it for you:1%<1%/̷1%/1&%J1%S2% Input, Span,42%ݥ/2%24%֡M2'%Ř<3%3(%03&%ʛ03%34;%8 let mut searcher = Searcher::new(Input::new(haystack));42%/ while let Some(_) = searcher.advance(|input| {40%S5%SD5% }) {5K%<6A%> matches.push(caps.get_group_by_name("numbers").unwrap());,6%36%96%¤<ԗ7%<ܲ7%<<7%97%7.%Ǭ/<8%/D8%''z飈w''8%9%,9%'';%t;%'' ''''km> >B' 8%' '3 '''g'33>>> > >ggg cgcثq1ȡ>B' 8%' '33 O%L An iterator over all non-overlapping half matches for an infallible search.%L%I The iterator yields a [`HalfMatch`] value until no more matches could beT%c%'%ҝT%D%T%9%T%6%T%J%TN%T%T%H%E This iterator is created by [`Searcher::into_half_matches_iter`] and4%1 then calling [`TryHalfMatchesIter::infallible`].|%''''N %Oty_T''B `B'' '%{}%'', ''''Ng %'g',,>>> > >ggg cgcثq1ȡ>B' %' ',, J%b%O%b%'%ҝT%D%T%9%T%6%T%J%TN%Tł%Tڂ%ނC%@ This iterator is created by [`Searcher::into_matches_iter`] and0%- then calling [`TryMatchesIter::infallible`].\%''''N % n]^''B `B'' '%{}%''k  ''''Nk %'g'|~k k >>> > >ggg cgcثq1ȡ>B' ܃%' 'k k U K%H An iterator over all non-overlapping captures for an infallible search.%K%cT%cʝ%Ν'%ҝT%D%T%Þ9%T%6%T%J%TN%T֠%T%I%F This iterator is created by [`Searcher::into_captures_iter`] and then,%) calling [`TryCapturesIter::infallible`].%%d%''''N %5;!&_''BU `B'' '%{}%''#2 ''''Nk %'g'|~#2#2>>> > >ggg cgcثq1ȡ>B' %' '#2#2l A look-around assertion.HE An assertion matches at a position between characters in a haystack. OL Namely, it does not actually "consume" any input as most parts of a regular MJ expression do. Assertions are a way of stating that some property must be /, true at a particular point during matching.  2/ For example, `(?m)^[a-z]+$` is a pattern that:  LI * Scans the haystack for a position at which `(?m:^)` is satisfied. That LI occurs at either the beginning of the haystack, or immediately following  a `\n` character. 30 * Looks for one or more occurrences of `[a-z]`. KH * Once `[a-z]+` has matched as much as it can, an overall match is only 41 reported when `[a-z]+` stops just before a `\n`.HE So in this case, `abc` and `\nabc\n` match, but `\nabc1\n` does not.MJ Assertions are also called "look-around," "look-behind" and "look-ahead."NK Specifically, some assertions are look-behind (like `^`), other assertionsNK are look-ahead (like `$`) and yet other assertions are both look-ahead and look-behind (like `\b`).Ԃ # Assertions in an NFAIF An assertion in a [`thompson::NFA`](crate::nfa::thompson::NFA) can beNK thought of as a conditional epsilon transition. That is, a matching engineJG like the [`PikeVM`](crate::nfa::thompson::pikevm::PikeVM) only permitsGD moving through conditional epsilon transitions when their conditionIF is satisfied at whatever position the `PikeVM` is currently at in thel=KH How assertions are handled in a `DFA` is trickier, since a DFA does notMJ have epsilon transitions at all. In this case, they are compiled into theOL automaton itself, at the expense of more states than what would be required̓ without an assertion.$7 Z''''''''''''''''''''''''''(((((((((('''''''''''''''''' '' '' '' '' ((((((((((,KH Match the beginning of text. Specifically, this matches at the startingԾ position of the input.''''qKC@ Match the end of text. Specifically, this matches at the endingԹla''uw''LL<IF Match the beginning of a line or the beginning of text. Specifically,JG this matches at the starting position of the input, or at the position+( immediately following a `\n` character.'''''M,JG Match the end of a line or the end of text. Specifically, this matchesDA at the end position of the input, or at the position immediately preceding a `\n` character.''''NLI׃lJlJG immediately following either a `\r` or `\n` character, but never after a `\r` when a `\n` follows.''''N< JlDۆlKH preceding a `\r` or `\n` character, but never before a `\n` when a `\r`  precedes it.''''OL" GD Match an ASCII-only word boundary. That is, this matches a position!B? where the left adjacent character and right adjacent character!GD correspond to a word and non-word or a non-word and word character.''  ''P|#"41 Match an ASCII-only negation of a word boundary.E''Y[''nQ\%#IF Match a Unicode-aware word boundary. That is, this matches a position#BŒl$Glv''''IR%%63 Match a Unicode-aware negation of a word boundary.G''[]''$St'%KH Match the start of an ASCII-only word boundary. That is, this matches a&JG position at either the beginning of the haystack or where the previous'KH character is not a word character and the following character is a wordt' character.''14''Sd*(GD Match the end of an ASCII-only word boundary. That is, this matches(FC a position at either the end of the haystack or where the previous)KH character is a word character and the following character is not a wordt*l ''"''T,*GD Match the start of a Unicode word boundary. That is, this matches a*Jl+KǓlt,l''''Ut.,EB Match the end of a Unicode word boundary. That is, this matches a-DA position at either the end of the haystack or where the previous-Klt.l''''V0.FC Match the start half of an ASCII-only word boundary. That is, this/KH matches a position at either the beginning of the haystack or where the//, previous character is not a word character.''''kW20DA Match the end half of an ASCII-only word boundary. That is, this1EB matches a position at either the end of the haystack or where the10- following character is not a word character.''''FX42JG Match the start half of a Unicode word boundary. That is, this matches3C@ a position at either the beginning of the haystack or where the3/l''''!Y54HE Match the end half of a Unicode word boundary. That is, this matches4GD a position at either the end of the haystack or where the following5&# character is not a word character.''''YZZZ Z ((ZZ? ?B( ( (Z  3[ (g(3[3[??? ? ?ggg cgcثq1ȡ?B( ( (3[3[^ ((^^^^? ?B( ( (^^ ^ ((^^?? ? ?B( ( (^ ^[Y@= LookSet is a memory-efficient set of look-around assertions.ZZGD This is useful for efficiently tracking look-around assertions. ForZOL example, a [`thompson::NFA`](crate::nfa::thompson::NFA) provides propertiesܯ[ that return `LookSet`s.<\T6n(l`\IF The underlying representation this set is exposed to make it possible\A> to store it somewhere efficiently. The representation is that]<9 of a bitset, where each assertion occupies bit `i` where] `i = Look::as_repr()`.^^HE Note that users of this internal representation must permit the full^EB range of `u16` values to be represented. For example, even if the_KH current implementation only makes use of the 10 least significant bits,_?< it may use more bits in a future semver compatible release.$`(( x x x  x (( x x? ?B( [( ( x [ x ((xxB(( (y ((yyyy? ?B( [( (yy y ((yy?? ? ?B( [( (y yA> An iterator over all look-around assertions in a [`LookSet`].2/ This iterator is created by [`LookSet::iter`].\Y%>hC(d((œ ((œœ? ?B( ( (œ@ (g(@@??? ? ?ggg cgcثq1ȡ?B( ( (@@ҳ)& A matcher for look-around assertions.ͫѫNK This matcher permits configuring aspects of how look-around assertions ared matched.l/ìOL A `LookMatcher` can change the line terminator used for matching multi-line*' anchors such as `(?m:^)` and `(?m:$)`.<­/ʭ/.G HźE4ʮݥ/Ѯծ'H'HGȯ>H!H&ʛ0а԰9H|0#H±,H40:H|0l6ϲ(H40.Ǭ/</\ݳs*(D(( ((? ?B( ó( ( (g(??? ? ?ggg cgcثq1ȡ?B( ʳ( ( тJG An error that occurs when the Unicode-aware `\w` class is unavailable.MJ This error can occur when the data tables necessary for the Unicode awareHE Perl character class `\w` are unavailable. The `\w` class is used toLI determine whether a codepoint is considered a word character or not whenNK determining whether a Unicode aware `\b` (or `\B`) matches at a particularlӅIIF This error can only occur when the `unicode-word-boundary` feature isl disabled.hʨ((B 7B(( (((m ((mm? ?B( Ɔ( (m (g(??? ? ?ggg cgcثq1ȡ?B( ͆( ( g.aL$ &e eB$ (((( e((((((ƨ$ Oe e gg$gfgf~[l( !e((((((ڨ$ "Ne "e $  L((N Yڡ((B  UB(( (np ((  ((NT (g(  ??? ? ?ggg cgcثq1ȡ?B( ( (  i&\{&ܓn(&perf-literal-multisubstring'&/&&((%v[  ((v[ v[ @ @B( Z&( (v[ [  (g([ [ @@@ @ @ggg cgcثq1ȡ@B( a&( ([ [ _ <{'Wzm ((%B_ 7%B(( (\'((%'d  ((d d @ @B( Z'( (d le  (g(le le @@@ @ @ggg cgcثq1ȡ@B( a'( (le le  4{(KvP((B 6B(( ((((k  ((k k @ @B( Z(( (k ll  (g(ll ll @@@ @ @ggg cgcثq1ȡ@B( a(( (ll ll  < (+ q(((B ;B(( ( ((( (((q  ((q q @ @B( (( (q r  (g(r r @@@ @ @ggg cgcثq1ȡ@B( (( (r r U <(Ƣ8((((BU ?B(( ((((((((((y  ((y y @ @B( (( (y ;z  (g(;z ;z @@@ @ @ggg cgcثq1ȡ@B( (( (;z ;z i)4{)n-(')|)")5)@)4)((  & % F7/7SWW  ((W W @ @B( Z)( (W ԃ  (g(ԃ ԃ @@@ @ @ggg cgcثq1ȡ@B( a)( (ԃ ԃ i*,{*[((((*l'*/*D*((& #*l '* /*\ *((& *l '* /*\ *((ω  ((ω ω @ @B( Z*( (ω   (g(  @@@ @ @ggg cgcثq1ȡ@B( a*( (  (+0+- A prefilter for accelerating regex searches.+C+@ If you already have your literals that you want to search with,C+@ then the vanilla [`Prefilter::new`] constructor is for you. ButD+A if you have an [`Hir`] value from the `regex-syntax` crate, thenL+I [`Prefilter::from_hir_prefix`] might be more convenient. Namely, it usesL+I the [`regex-syntax::hir::literal`](regex_syntax::hir::literal) module toO+L extract literal prefixes for you, optimize them and then select and build a+ prefilter matcher.+H+E A prefilter must have **zero false negatives**. However, by its veryK+H nature, it may produce false positives. That is, a prefilter will neverK+H skip over a position in the haystack that corresponds to a match of theG+D original regex pattern, but it *may* produce a match for a positionI+F in the haystack that does *not* correspond to a match of the originalJ+G regex pattern. If you use either the [`Prefilter::from_hir_prefix`] orH+E [`Prefilter::from_hirs_prefix`] constructors, then this guarantee isL+I upheld for you automatically. This guarantee is not preserved if you useN+K [`Prefilter::new`] though, since it is up to the caller to provide correct?+< literal strings with respect to the original regex pattern.+l+ # Cloning+N+K It is an API guarantee that cloning a prefilter is cheap. That is, cloningG+D it will not duplicate whatever heap memory is used to represent the+ underlying matcher.+l+/+9+6 This example shows how to attach a `Prefilter` to theK+H [`PikeVM`](crate::nfa::thompson::pikevm::PikeVM) in order to acceleratel+ searches.+<+/̲+/&+J#+6̗+?4+ݥ/+C+@ let pre = Prefilter::new(MatchKind::LeftmostFirst, &["Bruce "]) +? +G 9+6 .configure(PikeVM::config().prefilter(Some(pre))) +?!&+ʛ0|!+0!$+! Some(Match::must(0, 6..23)),!8+5 re.find(&mut cache, "Hello Bruce Springsteen!"),4"+0".+Ǭ/<"+/"+"J+G But note that if you get your prefilter incorrect, it could lead to an#+ incorrect result!#+<#+/#+/#&+J$#+6$+?4$+ݥ/$+$+ // This prefilter is wrong!%C+@ let pre = Prefilter::new(MatchKind::LeftmostFirst, &["Patti "])%+?%+G&9+l&+?&&+ʛ0'9+6 // We find no match even though the regex does match.|'+0l'+6'8+m4(+0(.+Ǭ/<(+/L(+Et2a&((()+)+̿)+)+((KKKK 7K7K736l*+*+)+<*+((*+*+̬*+t*+((ך  ))ך ך @ @B) (+) )ך   )g)  @@@ @ @ggg cgcثq1ȡ@B) (+) )  Ɲ+4֝+O"ߥ))))))))))))))))B))B))B))B))B))B))B  )) )  B))݌m4+))    )) )    B))ҍm<+))Z Z )) )Z Z B))ǎm<+))  )) )  B))m4+))  )) )  B))m,+))M M )) )M M B))m<ў+))  )) )  B))m\+))  ))  @ @B) +) )   )g)  @@@ @ @ggg cgcثq1ȡ@B) +) )   -,* A `usize` that can never be `usize::MAX`.,O,L This is similar to `core::num::NonZeroUsize`, but instead of not permitting3,0 a zero value, this does not permit a max value.,M,J This is useful in certain contexts where one wants to optimize the memoryI,F usage of things that contain match offsets. Namely, since Rust slicesL,I are guaranteed to never have a length exceeding `isize::MAX`, we can useK,H `usize::MAX` as a sentinel to indicate that no match was found. Indeed,N,K types like `Option` have exactly the same size in memory as ad, `usize`.,6,3 This type is defined to be `repr(transparent)` for=,: `core::num::NonZeroUsize`, which is in turn defined to be$,! `repr(transparent)` for `usize`.\,i1f[ 4))$B 7$B))'d,))$     ))  @ @B) ,) ) , N  ))N N N N @ @B) ,) )N   )h)  @@ @ @ù B))) ,)b b )ù         ))  @@ @ @B) ,) )     ))  AA A A B) ,) )   4  ))4 4 AA A A B) ,) )4  4 ? +,( A type that represents a "small" index.,M,J The main idea of this type is to provide something that can index memory,J,G but uses less memory than `usize` on 64-bit systems. Specifically, itsM,J representation is always a `u32` and has `repr(transparent)` enabled. (So@,= it is safe to transmute between a `u32` and a `SmallIndex`.),N,K A small index is typically useful in cases where there is no practical wayL,I that the index will overflow a 32-bit integer. A good example of this isK,H an NFA state. If you could somehow build an NFA with `2^30` states, itsJ,G memory usage would be exorbitant and its runtime execution would be so M,J slow as to be completely worthless. Therefore, this crate generally deems!L,I it acceptable to return an error if it would otherwise build an NFA that!N,K requires a slice longer than what a 32-bit integer can index. In exchange,"J,G we can use 32-bit indices instead of 64-bit indices in various places.","O,L This type ensures this by providing a constructor that will return an error#J,G if its argument cannot fit into the type. This makes it much easier to$M,J handle these sorts of boundary cases that are otherwise extremely subtle.$,$L,I On all targets, this type guarantees that its value will fit in a `u32`,%I,F `i32`, `usize` and an `isize`. This means that on 16-bit targets, for%F,C example, this type's maximum value will never overflow an `isize`,&G,D which means it will never overflow a `i16` even though its internal'$,! representation is still a `u32`.','K,H The purpose for making the type fit into even signed integer types like'M,J `isize` is to guarantee that the difference between any two small indices(K,H is itself also a small index. This is useful in certain contexts, e.g.,), for delta encoding.),), # Other types),)M,J The following types wrap `SmallIndex` to provide a more focused use case:*,*D,A * [`PatternID`] is for representing the identifiers of patterns.*I,F * [`StateID`] is for representing the identifiers of states in finite+0,- automata. It is used for both NFAs and DFAs.+,+, # Representation+,+J,G This type is always represented internally by a `u32` and is marked as,N,K `repr(transparent)`. Thus, this type always has the same representation as-M,J a `u32`. It is thus safe to transmute between a `u32` and a `SmallIndex`.-,t-, # Indexing-,-D,A For convenience, callers may use a `SmallIndex` to index slices..,d.,Ӗ5.,.O,L While a `SmallIndex` is meant to guarantee that its value fits into `usize`/I,F without using as much space as a `usize` on all targets, callers must/L,I not rely on this property for safety. Callers may choose to rely on this0O,L property for correctness however. For example, creating a `SmallIndex` with1O,L an invalid value can be done in entirely safe code. This may in turn result1',$ in panics or silent logical errors.T2,ׁS))ׁB? 6ׁB)) )3,))   ׁ  ׁ))  A AׁׁB) 2,) ) 2, ׁF  ׁ)g)F F AAA Aׁ Aggg cgcثq1ȡAB) 2,) )F F j  ׁ))j j ׁB)) )  ׁ))    A AׁB) 2,) ) G  ׁ)h)G G AA Aׁ Aù B))) 2,)bG bG )ù G G G G   ׁ  ׁ))  AA Aׁ AׁB) 2,) )   l  ׁ))l l AA Aׁ Aׁ B) 2,) )l  l   ׁ))  AA Aׁ Aׁ B) 2,) )   Ԩl,jB,? This error occurs when a small index could not be constructed.j,jN,K This occurs when given an integer exceeding the maximum small index value.k,kI,F When the `std` feature is enabled, this implements the `Error` trait.|l,Є9Ԟ)tl,Ll,))  Є))  A AЄЄB) l,) )   Є)g)  AAA AЄ Aggg cgcثq1ȡAB) l,) )    Є))    A AЄB) l,) ) E  ЄE  Є))E E AA AЄ AЄB) l,) )E  E q ,tq,΅:)q,q,))  ΅))  A A΅΅B) p,) ) [  ΅)g)[ [ AAA A΅ Aggg cgcثq1ȡAB) q,) )[ [  G,D The identifier of a regex pattern, represented by a [`SmallIndex`].,K,H The identifier for a pattern corresponds to its relative position amongJ,G other patterns in a single finite state machine. Namely, when buildingK,H a multi-pattern regex engine, one must supply a sequence of patterns toH,E match. The position (starting at 0) of each pattern in that sequenceN,K represents its identifier. This identifier is in turn used to identify and3,0 report matches of that pattern in various APIs.,L,I See the [`SmallIndex`] type for more information about what it means for',$ a pattern ID to be a "small index.",),& Note that this type is defined in theH,E [`util::primitives`](crate::util::primitives) module, but it is also:,7 re-exported at the crate root due to how common it is.L,8L,<Q))ׁB 8ׁB))'T,))ׁ     ))  A AB) ,) ) ,   ))  B)) )  ))    A AB) ,) )   )h)  AA A Aù B))) ,)b b )ù         ))  AA A AB) ,) )   W  ))W W AA A A B) ,) )W  W q  ))q q AA A A B) ,) )q  q  @,= The identifier of a finite automaton state, represented by a, [`SmallIndex`].,N,K Most regex engines in this crate are built on top of finite automata. EachN,K state in a finite automaton defines transitions from its state to another.J,G Those transitions point to other states via their identifiers, i.e., aL,I `StateID`. Since finite automata tend to contain many transitions, it isD,A much more memory efficient to define state IDs as small indices.,L,m%," a state ID to be a "small index."<,Ç;4K))ׁÇB 8ׁÇB))(T,))ׁ   Ç  Ç))  A AÇÇB) ,) ) , Ç[  Ç))[ [ ÇB)) )  Ç))    A AÇB) ,) ) ?  Ç)h)? ? AA AÇ Aù B))) ,)b? b? )ù ? ? ? ? #  Ç#  Ç))# # AA AÇ AÇB) ,) )#  #   Ç**  AA AÇ AÇ B) ,) *     Ç**  AA AÇ AÇ B* ,* *   P v,**************** v, v,X v,** w, w7,X( w,** x, x,X x,** y, x;,X y,** {/, y>,X z, zC,X {,X {,B** 1, |B,X },X }, };,X ~:,X ~@,X (,X , ?,X ۀ,Xh ,B** * ", ;,X ,B*** %, A,܁Y ,Y@ ,A AB* ,* , ۇ!, ن?,Y ,Y0 ,A AB* ,* * , ‰!, ?,Y ,X0 ω,A AB* ։,* * ׉, !, >,Y ,Y0 ,A AB* ,* * , , 0,Y nj, ׌@,Y A,Y ,Y@ ,A AB* Ď,* * Ŏ, ̑;, B,Y &,X , @,Y 7,Yh ӑ,ȫ"B** *  , 7, B,Y &,X , B,Y ДB,ԕY ,ȫ"B** *t  , Ɨ$, ̖?,ǘYX ,XX ͗,A Aȫ"B* ٗ,* * ڗ, , ', ,B** , ,*g* @, ,AAA A Aggg cgcثq1ȡAB* ,* * , , ߝ',**N ,***!X ,0 ,** ɞ#,( ̞,A A AB* Ҟ,* * Ӟ,Q *,**N ,*#* /,H ,A A AB* ,* * , *, , ,**N ,***!X ,0 ,** #,( ,A A AB* ,* * , -, , ,**N ,*#* /,H ,A A AB* ,* * , ,** , ,B** *( , ,***P ,( ,** զ.,@ ئ,B** *( , ,***P ,( ,** .,@ ,B** *( ¨, ͩ,***P ,( ,** .,@ ,B** *( , ,***P ګ,( ߫,** 0,@ ,B** *( ,H ձ,* , ;,YH ,A AB* Ʋ,* * Dz, ,x , ,  ,*g* @, ,AAA A Aggg cgcثq1ȡAB* ,* * , ,P ·,* ۷, ޷,B** * , ޺,**QQ*H , ,** #, ,A AB* ,* * , ǿ2,**I ̿,I@ Ͽ,Q ڿ,̋*,. , ,̋B** *u ?,**I ,I@ ,ޘn ,̋**QQ*35H , ,**( ., ,A A̋ۡ(B* ,* * ,0  <,Y , C,YP ,O , B,YP ,Y t,BJ#**ЄB0 8ЄB**'x ,**Є  **  A AB* ,* *   *g*  AAA A Aggg cgcثq1ȡAB* ,* *    **    A AB* ,* * j  j  **j j AA A AB* ,* *j  j  l, 5X**΅B 9΅B** *p ,**΅  **  A AB* ,* *   *g*  AAA A Aggg cgcثq1ȡAB* ,* *  U, ,**I ,̋/e **#%( , ,**P , ,**  **I ,̋**  A A̋̋B* Ѿ,* *   **IIg ,̋*g*nq  AAA A̋ Aggg cgcثq1ȡAB* ؾ,* *  P v,Ç**************** v, v,X v,**Ç w, w7,X( w,** x, x,X x,**Ç y, x;,X y,** {/, y>,X z, zC,X {,X {,׬(B**(9 1, |B,X },X }, };,X ~:,X ~@,X (,X , ?,X ۀ,Xh ,ÇB**X ", ;,X ,ÇB** * %, A,܁Y ,Y@ ,A AÇB* ,*( , ۇ!, ن?,Y ,Y0 ,A AÇB* ,* * , ‰!, ?,Y ,X0 ω,A AÇB* ։,* * ׉, !, >,Y ,Y0 ,A AÇB* ,* * , , 0,Y nj, ׌@,Y A,Y ,Y@ ,A AÇB* Ď,* * Ŏ, ̑;, B,Y &,X , @,Y 7,Yh ӑ,ȫ"׬(B** *  , 7, B,Y &,X , B,Y ДB,ԕY ,ȫ"ÇB** *  , Ɨ$, ̖?,ǘYX ,XX ͗,A AÇȫ"B* ٗ,* * ڗ, , ', ,B**( , ,Ç*g* @, ,AAA AÇ Aggg cgcثq1ȡAB* ,* * , , ߝ',**N ,***!X ,0 ,** ɞ#,( ̞,A AÇ AB* Ҟ,* * Ӟ," *,**N ,*#* /,H ,A AÇ AB* ,* * ,# *, , ,++N ,+++!X ,0 ,++ #,( ,A AÇ AB+ ,+ + ,$ -, , ,++N ,+#+ /,H ,A AÇ AB+ ,+ + ,% ,Ç++ , ,ÇB++ +( , ,Ç+++P ,( ,++ զ.,@ ئ,׬(B++ +( , ,Ç+++P ,( ,++ .,@ ,׬(B++ +( ¨, ͩ,Ç+++P ,( ,++ .,@ ,׬(B++ +( , ,Ç+++P ګ,( ߫,++ 0,@ ,׬(B++ +( ,H ձ,+ , ;,YH ,A AB+ Ʋ,+ + Dz, ,x , ,  ,+g+ @, ,AAA A Aggg cgcثq1ȡAB+ ,+ + , ,P ·,+ ۷, ޷,B++ + , ޺,++QQ+H , ,++Ç #, ,B BB+ ,+ + , ǿ2,++I ̿,I@ Ͽ,ޘn ڿ,+$& , ,B++ +. ?,++I ,I@ ,ޘn ,++QQ+35H , ,++( ., ,B B(B+ ,+ + ,  <,Y , C,YP ,O , B,YP ,Y d,iO'++ЄB 8ЄB++(x ,++Єw&  ++w& w& A AB+ ,+ +w& &  +g+& & AAA A Aggg cgcثq1ȡAB+ ,+ +& & (  ++( ( ( ( A AB+ ,+ +( (  (  ++( ( AA A AB+ ,+ +(  ( , \,fL, ++΅B, 9΅B++ +p ,++΅S)  ++S) S) A AB+ ,+ +S) )  +g+) ) AAA A Aggg cgcثq1ȡAB+ ,+ +) ) U, |,++I ,N[-++#%( , ,++P , ,++O+  ++In ,++O+ O+ B BB+ Ѿ,+ +O+ ,  ++IAn ,+g+^a, , BBB B Bggg cgcثq1ȡBB+ ؾ,+ +, , !IF The configuration used to determine a DFA's start state for a search.OL A DFA has a single starting state in the typical textbook description. ThatOL is, it corresponds to the set of all starting states for the NFA that builtLI it, along with their epsilon closures. In this crate, however, DFAs have41 many possible start states due to a few factors:MJ * DFAs support the ability to run either anchored or unanchored searches.MJ Each type of search needs its own start state. For example, an unanchoredGD search requires starting at a state corresponding to a regex with a;8 `(?s-u:.)*?` prefix, which will match through anything.JG * DFAs also optionally support starting an anchored search for any oneEB specific pattern. Each such pattern requires its own start state.LI * If a look-behind assertion like `^` or `\b` is used in the regex, thenNK the DFA will need to inspect a single byte immediately before the start of 1. the search to choose the correct start state.  OL Indeed, this configuration precisely encapsulates all of the above factors. IF The [`Config::anchored`] method sets which kind of anchored search to JG perform while the [`Config::look_behind`] method provides a way to set DA the byte that occurs immediately before the start of the search.  NK Generally speaking, this type is only useful when you want to run searches JG without using an [`Input`]. In particular, an `Input` wants a haystack GD slice, but callers may not have a contiguous sequence of bytes as a KH haystack in all cases. This type provides a lower level of control suchMJ that callers can provide their own anchored configuration and look-behind byte explicitly.l/KH This shows basic usage that permits running a search with a DFA without" using the `Input` abstraction.</̖/  dfa::{Automaton, dense}, util::start, Anchored,4ݥ/0- let dfa = dense::DFA::new(r"(?-u)\b\w+\b")?; let haystack = "quartz";>; let config = start::Config::new().anchored(Anchored::Yes);.+ let mut state = dfa.start_state(&config)?;*' for &b in haystack.as_bytes().iter() {)& state = dfa.next_state(state, b);,3&# state = dfa.next_eoi_state(state);'$ assert!(dfa.is_match_state(state));.Ǭ/</JG This example shows how to correctly run a search that doesn't begin atKH the start of a haystack. Notice how we set the look-behind byte, and as0- a result, the `\b` assertion does not match.</̀/ nnn4ݥ/0nn%" let config = start::Config::new()  .anchored(Anchored::Yes)! .look_behind(Some(b'q'));.n2/ for &b in haystack.as_bytes().iter().skip(1) {)n,3&n // No match!(% assert!(!dfa.is_match_state(state));.Ǭ/</KH If we had instead not set a look-behind byte, then the DFA would assumeOL that it was starting at the beginning of the haystack, and thus `\b` shouldFC match. This in turn would result in erroneously reporting a match:<// nnn4ݥ/0nn-* // Whoops, forgot the look-behind byte...>n.n2n)n, 3 &n +( // And now we get a match unexpectedly. 'n!!.Ǭ/; A hack to align a smaller type `B` with a bigger type `T`.DA The usual use of this is with `B = [u8]` and `T = u32`. That is,FC it permits aligning a sequence of bytes on a 4-byte boundary. ThisFC is useful in contexts where one wants to embed a serialized [denseMJ DFA](crate::dfa::dense::DFA) into a Rust a program while guaranteeing the# alignment required for the DFA.MJ See [`dense::DFA::from_bytes`](crate::dfa::dense::DFA::from_bytes) for an$! example of how to use this type.<,,,,4V Pc>Ъ,, /185 A zero-sized field indicating the alignment we want.4++) d>; A possibly non-sized field containing a sequence of bytes.,++L  ,,,,ڢoDVCg V ,g,QTL L BBB B Bggg cgcثq1ȡBB, , ,L L ̠DA An error that occurs when serializing an object from this crate.KH Serialization, as used in this crate, universally refers to the processHE of transforming a structure (like a DFA) into a custom binary formatOL represented by `&[u8]`. To this end, serialization is generally infallible.NK However, it can fail when caller provided buffer sizes are too small. When30 that occurs, a serialization error is reported.GD A `SerializeError` provides no introspection capabilities. Its onlyHE supported operation is conversion to a human readable error message.JG This error type implements the `std::error::Error` trait only when theDA `std` feature is enabled. Otherwise, this type is defined in all configurations.t^?us,%$%,,2_N  ,g,_N _N BBB B Bggg cgcثq1ȡBB, , ,_N _N  )LI An error that occurs when deserializing an object defined in this crate.))Ko*Ho+KH represented by `&[u8]`. Deserialization, then, refers to the process of+HE cheaply converting this binary format back to the object's in-memory,DA representation as defined in this crate. To the extent possible,,GD deserialization will report this error whenever this process fails.--IF A `DeserializeError` provides no introspection capabilities. Its only.Ho..Jo/Dɬo/o0֕疫E;l,,֕B 7֕B,, ,0,,O  ֕,g,O O BBB B֕ Bggg cgcثq1ȡBB, /, ,O O 00%r&,,,,,,,,,,,,,,,,,,,,,,,,  ,,<0,,00,,2t1,,1$1,,2d1,,1$1,,2|1,,l1D1,,T2,2,,t2,,l2D2,,T2,2,,2,,2L2,,t2<2,,l3,,3D3,,23,,3$3,,2L3,,33,,3$3,,2<4,,44,,4$4,,2P  ,g,P P BBB B Bggg cgcثq1ȡBB, 0, ,P P ,,,,,МL ,- F8,,)B 8)B,, ,L-,,)^  ,,^ ^ B BB, ,, ,^ _  ,,_ _ _ _ B BB, ,, ,_ _  ,h,_ _ BB B Bù B,,, ,,b_ b_ ,ù _ _ _ _ z`  z`  ,,z` z` BB B BB, ,, ,z`  z` `  ,,` ` BB B B B, -, ,`  ` a  ,,a a BB B B B, -, ,a  a   @ޚM} ,,̹ޚB  8̹ޚB,, ,<@,,̹b  ޚ,,b b C CޚޚB, ?, ,b c  ޚ,g,c c CCC Cޚ Cggg cgcثq1ȡCB, @, ,c c q F/V, ,,̹Bq 8̹B,, ,; methods and/or superfluous parameters in the common cases.85 An `Input` permits configuring the following things:MJ * Search only a substring of a haystack, while taking the broader context63 into account for resolving look-around assertions.EB * Indicating whether to search for all patterns in a regex, or to.+ only search for one pattern in particular. :7 * Whether to perform an anchored on unanchored search. 52 * Whether to report a match as early as possible.  KH All of these parameters, except for the haystack, have sensible default MJ values. This means that the minimal search configuration is simply a call HE to [`Input::new`] with your haystack. Setting any other parameter isl  optional.  GD Moreover, for any `H` that implements `AsRef<[u8]>`, there exists a JG `From for Input` implementation. This is useful because many of the IF search APIs in this crate accept an `Into`. This means you can JG provide string or byte strings to these routines directly, and they'll85 automatically get converted into an `Input` for you.GD The lifetime parameter `'h` refers to the lifetime of the haystack. # Organization;8 The API of `Input` is split into a few different parts:FC * A builder-like API that transforms a `Input` by value. Examples:,) [`Input::span`] and [`Input::anchored`].GD * A setter API that permits mutating parameters in place. Examples:41 [`Input::set_span`] and [`Input::set_anchored`].HE * A getter API that permits retrieving any of the search parameters.>; Examples: [`Input::get_span`] and [`Input::get_anchored`].NK * A few convenience getter routines that don't conform to the above namingFC pattern due to how common they are. Examples: [`Input::haystack`],(% [`Input::start`] and [`Input::end`].HE * Miscellaneous predicates and other helper routines that are useful<9 in some contexts. Examples: [`Input::is_char_boundary`].OL A `Input` exposes so much because it is meant to be used by both callers ofOL regex engines _and_ implementors of regex engines. A constraining factor isNK that regex engines should accept a `&Input` as its lowest level API, whichKH means that implementors should only use the "getter" APIs of a `Input`.)& # Valid bounds and search termination@= An `Input` permits setting the bounds of a search via eitherIF [`Input::span`] or [`Input::range`]. The bounds set must be valid, or=: else a panic will occur. Bounds are valid if and only if:C@ * The bounds represent a valid range into the input's haystack.IF * **or** the end bound is a valid ending bound for the haystack *and*@= the start bound is exactly one greater than the start bound.MJ In the latter case, [`Input::is_done`] will return true and indicates anyKH search receiving such an input should immediately return with no match.KH Note that while `Input` is used for reverse searches in this crate, theIF `Input::is_done` predicate assumes a forward search. Because unsignedNK offsets are used internally, there is no way to tell from only the offsets,) whether a reverse search is done or not.Ԣ # Regex engine supportMJ Any regex engine accepting an `Input` must support at least the following\  things:  &# * Searching a `&[u8]` for matches. GD * Searching a substring of `&[u8]` for a match, such that any match!85 reported must appear entirely within that substring.!B? * For a forwards search, a match should never be reported when"NK [`Input::is_done`] returns true. (For reverse searches, termination should"# be handled outside of `Input`.)"#JG Supporting other aspects of an `Input` are optional, but regex engines#LI should handle aspects they don't support gracefully. How this is done is$MJ generally up to the regex engine. This crate generally treats unsupported$LI anchored modes as an error to report for example, but for simplicity, in%KH the meta regex engine, trying to search with an invalid pattern ID just&'$ results in no match being reported. ,,I{,,,,&&D&,,]T&$&,,Ş&D&,,إt'D',,u  ,,,,u u C CB, &, ,u |:7 A representation of a span reported by a regex engine.EB A span corresponds to the starting and ending _byte offsets_ of aJG contiguous region of bytes. The starting offset is inclusive while theHE ending offset is exclusive. That is, a span is a half-open interval.KH A span is used to report the offsets of a match, but it is also used toJG convey which region of a haystack should be searched via routines like [`Input::span`].KH This is basically equivalent to a `std::ops::Range`, except thisNK type implements `Copy` which makes it more ergonomic to use in the contextNK of this crate. Like a range, this implements `Index` for `[u8]` and `str`,NK and `IndexMut` for `[u8]`. For convenience, this also impls `From`,52 which means things like `Span::from(5..10)` work.$ Ş*H],,,) The start offset of the span, inclusive.,,,t*' The end offset of the span, exclusive.,,   Ş  Ş,,  D DŞŞB, , ,  Şf  Ş,,f f f f D DŞB, , ,f ݏ  Ş,h,ݏ ݏ DD DŞ Dù B,,, ,bݏ bݏ ,ù ݏ ݏ ݏ ݏ g  Şg  Ş,,g g DD DŞ DŞB, , ,g  g <9 A representation of "half" of a match reported by a DFA.OL This is called a "half" match because it only includes the end location (orLI start location for a reverse search) of a match. This corresponds to theՅLI information that a single DFA scan can report. Getting the other half of96 the match requires a second scan with a reversed DFA.܆GD A half match also includes the pattern that matched. The pattern isNK identified by an ID, which corresponds to its position (starting from `0`)OL relative to other patterns used to construct the corresponding DFA. If onlyLjOL a single pattern is provided to the DFA, then all matches are guaranteed to엉 have a pattern ID of `0`.7 ( IE,,<,,lʋ4ʋ,,     ,,  D DB, , , ʼn   ,g,  DDD D Dggg cgcثq1ȡDB, ˉ, ,  ;  ,,; ; ; ; D DB, ҉, ,;   ,h,  DD D Dù B,,, ։,b b ,ù     \  \  ,,\ \ DD D DB, ܉, ,\  \ ;8 A representation of a match reported by a regex engine.KH A match has two essential pieces of information: the [`PatternID`] that96 matches, and the [`Span`] of the match in a haystack.IF The pattern is identified by an ID, which corresponds to its positionHE (starting from `0`) relative to other patterns used to construct theNK corresponding regex engine. If only a single pattern is provided, then all74 matches are guaranteed to have a pattern ID of `0`.řəKH Every match reported by a regex engine guarantees that its span has its96 start offset as less than or equal to its end offset.J %:U"N,,<,,T$,,ŞG G G G  ,,G G D DB, ؚ, ,G ߚ   -g-  DDD D Dggg cgcثq1ȡDB- - -  i  --i i i i D DB- - -i ަ  -h-ަ ަ DD D Dù B--- -bަ bަ -ù ަ ަ ަ ަ     --  DD D DB- - -   ʿ A set of `PatternID`s.LI A set of pattern identifiers is useful for recording which patterns haveHE matched a particular haystack. A pattern set _only_ includes pattern85 identifiers. It does not include offset information.l/$! This shows basic usage of a set.</0- use regex_automata::{PatternID, PatternSet};" let pid1 = PatternID::must(5);" let pid2 = PatternID::must(8); // Create a new empty set.˻&# let mut set = PatternSet::new(10); // Insert pattern IDs. set.insert(pid1); set.insert(pid2); // Test membership.Ѽ  assert!(set.contains(pid1));  assert!(set.contains(pid2)); // Get all members.|0 vec![5, 8],ϽA> set.iter().map(|p| p.as_usize()).collect::>(),40 // Clear the set. set.clear();$! // Test that it is indeed empty. assert!(set.is_empty());</̉] ǜ *--T-- ,--*  --  D DB- - -   -g-  DDD D Dggg cgcثq1ȡDB- - -  ӳ  --ӳ ӳ ӳ ӳ D DB- - -ӳ     --  DD D DB- - -    C@ An error that occurs when a `PatternID` failed to insert into a `PatternSet`.NK An insert fails when the given `PatternID` exceeds the configured capacity of the `PatternSet`.DA This error is created by the [`PatternSet::try_insert`] routine.p OS"--L--|D--  --  D DB- - - W  -g-W W DDD D Dggg cgcثq1ȡDB- - -W W A> An iterator over all pattern identifiers in a [`PatternSet`].OL The lifetime parameter `'a` refers to the lifetime of the pattern set being iterated over.@= This iterator is created by the [`PatternSet::iter`] method.̍ --SE(6-6--܋<< 0{?ippp opopo2Ы  ----  D DB- - - n  ---g-nqn n DDD D Dggg cgcثq1ȡDB- - -n n +( The type of anchored search to perform.OL This is *almost* a boolean option. That is, you can either do an unanchoredOL search for any pattern in a regex, or you can do an anchored search for any pattern in a regex.؉܉NK A third option exists that, assuming the regex engine supports it, permits85 you to do an anchored search for a specific pattern.HE Note that there is no way to run an unanchored search for a specificMJ pattern. If you need that, you'll need to build separate regexes for eachd/d1KH If a regex engine does not support the anchored mode selected, then theIF regex engine will return an error. While any non-trivial regex engineLI should support at least one of the available anchored modes, there is noLI singular mode that is guaranteed to be universally supported. Some regexюIF engines might only support unanchored searches (DFAs compiled withoutGD anchored starting states) and some regex engines might only support.+ anchored searches (like the one-pass DFA).:7 The specific error returned is a [`MatchError`] with aѐGD [`MatchErrorKind::UnsupportedAnchored`] kind. The kind includes the/, `Anchored` value given that is unsupported.ɑ͑HE Note that regex engines should report "no match" if, for example, anJG `Anchored::Pattern` is provided with an invalid pattern ID _but_ whereOL anchored searches for a specific pattern are supported. This is smooths outLI behavior such that it's possible to guarantee that an error never occursJG based on how the regex engine is configured. All regex engines in thisɔOL crate report "no match" when searching for an invalid pattern ID, but where<9 searching for a valid pattern ID is otherwise supported.֕lڕ/GD This example shows how to use the various `Anchored` modes to run aGD search. We use the [`PikeVM`](crate::nfa::thompson::pikevm::PikeVM)KH because it supports all modes unconditionally. Some regex engines, likeȗLI the [`onepass::DFA`](crate::dfa::onepass::DFA) cannot support unanchoredll</=//&J*E4ٙݥ/ ݹM r"Mrs. \w+", r"Miss \w+", r"Mr. \w+",Ú r"Ms. \w+",Dך1&ʛ0'$ let hay = "Hello Mr. Springsteen!";1. // The default is to do an unanchored search.FC assert_eq!(Some(Match::must(2, 6..21)), re.find(&mut cache, hay));>; // Explicitly ask for an unanchored search. Same as above.74 let input = Input::new(hay).anchored(Anchored::No);FpGD // Now try an anchored search. Since the match doesn't start at the41 // beginning of the haystack, no match is found!85 let input = Input::new(hay).anchored(Anchored::Yes);1L֟ڟJG // We can try an anchored search again, but move the location of whereGD // we start the search. Note that the offsets reported are still inIF // terms of the overall haystack and not relative to where we started // the search.ʡC@ let input = Input::new(hay).anchored(Anchored::Yes).range(6..);HE assert_eq!(Some(Match::must(2, 6..21)), re.find(&mut cache, input));עۢIF // Now try an anchored search for a specific pattern. We specificallyKH // choose a pattern that we know doesn't match to prove that the search-* // only looks for the pattern we provide. let input = Input::new(hay)85 .anchored(Anchored::Pattern(PatternID::must(1))) .range(6..);1LåLI // But if we switch it to the pattern that we know matches, then we find // the match.p¦85 .anchored(Anchored::Pattern(PatternID::must(2)))pHp٧ݧ.Ǭ/</ إvW MK----------إB٨IF Run an unanchored search. This means a match may occur anywhere at or+( after the start position of the search.שߩ@= This search can return a match for any pattern in the regex.--إ--إEB Run an anchored search. This means that a match must begin at the! start position of the search.@p--إ--إ JG Run an anchored search for a specific pattern. This means that a matchIF must be for the given pattern and must begin at the start position of| the search. -- -  إB--pL--   إ  إ--  D DإإB- - -  إ  إ-g-  DDD Dإ Dggg cgcثq1ȡDB- - -    إ--    D DإB- - - V  إV  إ--V V DD Dإ DإB- - -V  V ׷;8 The kind of match semantics to use for a regex pattern.JG The default match kind is `LeftmostFirst`, and this corresponds to theDA match semantics used by most backtracking engines, such as Perl.:7 # Leftmost first or "preference order" match semanticsKH Leftmost-first semantics determine which match to report when there areNK multiple paths through a regex that match at the same position. The tie isOL essentially broken by how a backtracker would behave. For example, considerջNK running the regex `foofoofoo|foofoo|foo` on the haystack `foofoo`. In thisOL case, both the `foofoo` and `foo` branches match at position `0`. So should'$ the end of the match be `3` or `6`?KH A backtracker will conceptually work by trying `foofoofoo` and failing.GD Then it will try `foofoo`, find the match and stop there. Thus, theLI leftmost-first match position is `6`. This is called "leftmost-first" orJG "preference order" because the order of the branches as written in the̿:7 regex pattern is what determines how to break the tie.KH (Note that leftmost-longest match semantics, which break ties by alwaysKH taking the longest matching string, are not currently supported by thisJG crate. These match semantics tend to be found in POSIX regex engines.)IF This example shows how leftmost-first semantics work, and how it even%" applies to multi-pattern regexes:<//&Jt04ݥ/ ݹM r"foofoofoo", r"foofoo",| r"foo",D1&ʛ0GD let got: Vec = re.find_iter(&mut cache, "foofoo").collect();.+ let expected = vec![Match::must(1, 0..6)];3.Ǭ/</ # All matchesLI The `All` match semantics report any and all matches, and generally willNK attempt to match as much as possible. It doesn't respect any sort of matchJG priority at all, so things like non-greedy matching don't work in thisL mode.MJ The fact that non-greedy matching doesn't work generally makes most formsMJ of unanchored non-overlapping searches have unintuitive behavior. Namely,JG unanchored searches behave as if there is a `(?s-u:.)*?` prefix at theMJ beginning of the pattern, which is specifically non-greedy. Since it willLI be treated as greedy in `All` match semantics, this generally means thatNK it will first attempt to consume all of the haystack and is likely to windĄ up skipping matches.GD Generally speaking, `All` should only be used in two circumstances:OL * When running an anchored search and there is a desire to match as much asLI possible. For example, when building a reverse regex matcher to find theLI start of a match after finding the end. In this case, the reverse searchDA is anchored to the end of the match found by the forward search.IF * When running overlapping searches. Since `All` encodes all possibleNK matches, this is generally what you want for an overlapping search. If youOL try to use leftmost-first in an overlapping search, it is likely to produceMJ counter-intuitive results since leftmost-first specifically excludes some52 matches from its underlying finite state machine.OL This example demonstrates the counter-intuitive behavior of `All` semantics52 when using a standard leftmost unanchored search:</̟/&J?4ݥ/G?M .build("foo")?;)& let hay = "first foo second foo wat";&ʛ0B? let got: Vec = re.find_iter(&mut cache, hay).collect();74 // Notice that it completely skips the first 'foo'!0- let expected = vec![Match::must(0, 17..20)];3.Ǭ/</OL This second example shows how `All` semantics are useful for an overlappingIF search. Note that we use lower level lazy DFA APIs here since the NFAMJ engines only currently support a very limited form of overlapping search.<//-ĝ4$34ݥ//KH // If we didn't set 'All' semantics here, then the regex would onlyKH // match 'foo' at offset 3 and nothing else. Why? Because the stateNK // machine implements preference order and knows that the 'foofoo' andMJ // 'foofoofoo' branches can never match since 'foo' will always match-* // when they match and take priority.<ݚ0)& .build(r"foo|foofoo|foofoofoo")?;&ʛ0.4(% let input = Input::new("foofoofoo");̨ let mut got = vec![];T3GD re.try_search_overlapping_fwd(&mut cache, &input, &mut state)?;)& let m = match state.get_match() {Կ3 Some(m) => m,T }; got.push(m);,3Ě33 HalfMatch::must(0, 6), HalfMatch::must(0, 9),433.Ǭ/</: ̘ifK------  Report all possible matches.3--GI--     --  D DB- - -  j  --j j B-- -  -g-  DDD D Dggg cgcثq1ȡDB- - -    --    D DB- - -     --  DD D DB- - -   @ KH Report only the leftmost matches. When multiple leftmost matches exist,HE report the match corresponding to the part of the regex that appearsĝ first in the syntax.><T @ --@ @ -- HE An error indicating that a search stopped before reporting whether a match exists or not.LI To be very clear, this error type implies that one cannot assume that noJG matches occur, since the search stopped before completing. That is, ifJG you're looking for information about where a search determined that noOL match can occur, then this error type does *not* give you that. (Indeed, atMJ the time of writing, if you need such a thing, you have to write your own search routine.)HE Normally, when one searches for something, the response is either anKH affirmative "it was found at this location" or a negative "not found atNK all." However, in some cases, a regex engine can be configured to stop itsNK search before concluding whether a match exists or not. When this happens,OL it may be important for the caller to know why the regex engine gave up andOL where in the input it gave up at. This error type exposes the 'why' and thed 'where.'MJ For example, the DFAs provided by this library generally cannot correctlyIF implement Unicode word boundaries. Instead, they provide an option toIF eagerly support them on ASCII text (since Unicode word boundaries areLI equivalent to ASCII word boundaries when searching ASCII text), but willHE "give up" if a non-ASCII byte is seen. In such cases, one is usuallyHE required to either report the failure to the caller (unergonomic) orNK otherwise fall back to some other regex engine (ergonomic, but potentiallyd costly).OL More generally, some regex engines offer the ability for callers to specifyMJ certain bytes that will trigger the regex engine to automatically quit if they are seen.JG Still yet, there may be other reasons for a failed match. For example,LI the hybrid DFA provided by this crate can be configured to give up if itOL believes that it is not efficient. This in turn permits callers to choose a?NK (Note that DFAs are configured by default to never quit or give up in thisKH fashion. For example, by default, a DFA will fail to build if the regexNK pattern contains a Unicode word boundary. One needs to opt into the "quit" behavior via options, likegd [`hybrid::dfa::Config::unicode_word_boundary`](crate::hybrid::dfa::Config::unicode_word_boundary).)*' There are a couple other ways a search)& can fail. For example, when using theO_KH with a haystack that is too long, or trying to run an unanchored searchނ/, with a [one-pass DFA](crate::dfa::onepass). ۆ7bl--+ۆB  +ۆB-- -!փЃ--+)  ۆ--) ) D DۆۆB- - -)   ۆ-g-  DDD Dۆ Dggg cgcثq1ȡDB- - -    ۆ--    D DۆB- - - {  ۆ{  ۆ--{ { DD Dۆ DۆB- - -{  { ,) The underlying kind of a [`MatchError`].NK This is a **non-exhaustive** enum. That means new variants may be added in  a semver-compatible release.: Ȩ&A2h---------$ݗC@ The search saw a "quit" byte at which it was instructed to stopt searching.n--ȨDǘEB The "quit" byte that was observed that caused the search to stop.$--l30 The offset at which the quit byte was observed.4--4GD The search, based on heuristics, determined that it would be betterɚEB to stop, typically to provide the caller an opportunity to use an쓛 alternative regex engine.EB Currently, the only way for this to occur is via the lazy DFA andIF only when it is configured to do so (it will not return this error byl՜ default).--ȨlC@ The offset at which the search stopped. This corresponds to theĝ96 position immediately following the last byte scanned.4--|GD This error occurs if the haystack given to the regex engine was tooEB long to be searched. This occurs, for example, with regex enginesIF like the bounded backtracker that have a configurable fixed amount ofHE capacity that is tied to the length of the haystack. Anything beyondѠA> that configured limit will result in an error at search time.--ȨT74 The length of the haystack that exceeded the limit.--EB An error indicating that a particular type of anchored search wasҢ=: requested, but that the regex engine does not support it.FC When this error occurs with [`Anchored::Pattern`], then one commonGD cause is that the underlying regex engine was built without supportHE for anchored starting states for each pattern. For DFA engines, this  typically means enabling theif [`hybrid::dfa::Config::starts_for_each_pattern`](crate::hybrid::dfa::Config::starts_for_each_pattern)4 orgd [`dfa::dense::Config::starts_for_each_pattern`](crate::dfa::dense::Config::starts_for_each_pattern)IF configuration option, depending on which regex engine is being built.اHE Note that this error should not be returned by a regex engine simplyKH because the pattern ID is invalid (i.e., equal to or exceeds the numberKH of patterns in the regex). In that case, the regex engine should reportͩ a non-match.>--Ȩt0a$--إ  Ȩ--  D DȨȨB- - -   Ȩ-g-  DDD DȨ Dggg cgcثq1ȡDB- - -    Ȩ--    D DȨB- - -   Ȩ  Ȩ--  DD DȨ DȨB- - -   0T 0=՛kT--Ԗ 0$ 0--ݪԶ 0$ 0--ݪ  --  D DB- 0- - N  -g-N N DDD D Dggg cgcثq1ȡDB- 0- -N N ܦ0L0ݪg Ec---T00--0,0--040--{  ݪ--{ { D DݪݪB- 0- -{ k l<0-- _--ppp opopo2ЫÇBk qB-- -<0<0--qK  ---g-MOK K EEE E Eggg cgcثq1ȡEB- <0- -K K  3     Y  s  v G 5 ? -{ D  ~  ` '  >   < y      ! N( . <0 1 >  7H  N   _    l    m  í ޭ n  ޺  o     p mq q Er r bs s ;t t t yu v  LTw L T\x {zzc Az }  ~ W  yRyxxt ́ '  W  Lw  LϤv  Lqu ܌  Lktst~ p&p.p7mqlyl4| P    s  kk!є   ' jj"   [  0 \[[*( G ?   b     . x O  ů             E(    /4  -G  ѦcM  V  ^   b   d  ׋ p  8u  W+W3Wv Cz  | ~  [ `  VUUJ hTpT  $ &   s ڌ A    r    s iSqS :     \ ޖ  `  ԗ Q!Q)Q" } ,LfKnKM#C$$9%O&')q*+{,.(2 ԃ 2  3 ܓ 3Q>==5 6 :;<l>a877̻766@ Ó ʓ  ϓ @ڒ  9?> Ԭ 22"2g///t~<; ''%'2:p9 ++t"!!&8 @A@H<e  t6)655;544m3 20.,h,s>,V+ pLpC%! E V h6 Ј  eq V^8   T     Z h   M   B [    5 55i  5 5 5 5G  o5 o5o5  r5 r5r5`  5 55 5-  5 Ϡ5֠55 5  5 5ƿ5 ֿ5  5 55  5 55  5 55 5 5k  5 55 5 5  5 55J*CK.&        0T  ) ) LT 3  0 1 ]e4Y  ; ;   - --&  G GG G H  7 7۷  83   8  8 H   $8F   +8  28İ  38 B D 85Ī̪7+ Z     ѵFV  ÑP  LI   vB   <   ?7   =4   .  ը  *    &    p  @   R  .  v s19v  d   ^     G  +  o  S[  4 x  8{ 6   Ѝ؍)Ot cs r bq p o o 'n nm zl k j i gg f e d xd #d ~}}a  ^  ׵W   O   J F WE  !||wQD  )!C 2C B @   @  n?  >  !<  % %%T;  ; << < <4 64 3 }3  +3 2 2   01   b0   /    .    -   }||E+  H]+  j jQ* ) ) 8)  ( ( '  ρ @&    %   :$  ʉ  V#  э  {{"  !      ¹   5    k   # <   "    ~             $    ÖM|U|8  Ϯ   2   | * Q                 =|E|UB     ćˇ>  Џ o    4  y  )    ң 0   ʱѱd           #|+|          ɠ A   '       ɰа     Ƽ ټ1    R     P|X|   1  "{*{U   A      b                zyy     " xx  $ i Z  ' ' ww  3   ;  ; ;   @  A A  A  vv#v  M    Q tt'  S    U U q ss   Z   l  l l  l z  sArIr   }  qqs  ӂ         oop2    Έ L  Т    1    ܧ        J  ޲    -     Ƹ H        ooo|    d mmB           lld             Q      ŀ ̀            /l7l        jk<Y  ݘ {      !j[ici ,  °  +h3h       s " fgPV       < Ѣ   edd>   B F^]]+q  U   W  d 5  M MM|  t  r m   h Nh g ` DY   ?U   Q     @        h:  ҅      P8        6        5        4  ʾ      JJO3 rGzGW2 cCBBc80 /-   , +    ϓ ֓ A@@g?&?.?ol+ (+ *   )  Ŵ    -) ;::v]:99& & )dl=$ j & K   W  b  <  R    , Z J M   (   z  2 d~ } #} | { { z =z y ) K S r`x 9w 0r   io   ak   f   e ?b Ka  ϡ ,`   P_ ^   f] i\     [   [    [   8Z   Y   X  ͟ X  ֨ W   GW   V   V U iU U T ZT S S BS R R 4R Q   *Q P zP ,P QYkuNo>xP N ^N   &M L HL   K K /K J YJ ?:B? I H E D  *"*"B  + B RA  8 @  c Lc i!? |? > }> +> <   L >F}*< 7e;   L Ge #9 ~9  4#9  9#8 d(T\+y,41o8 8  S#7  Y#(7 0 .  I   Z  =  I H   x  r  A ¼    Q    " ƶ h   G  w  ~ U   +   (>iª    Ι֙rIP   w  : KSd      a ۏڄ t # aKj  M  Nڋ 7  H zyyQK  v Wu q  m .m l g  pd  a   T    O    !N    H    G    F    E      D      C     B    ۃ kA     Q@  ٹ'y/y\? v"vt> rqqq< 9  l9 9 ,qfpnp8 <8  7 7 onn6  Ú06 5 r5  5 mllqkji3  SH2  }c1  c0 ;0 / T/ . H. - h-  , + ihhQg,g4g'faeie+ *   * H* dcc,ccbbC`e_m_^K^S^' N&  ԝ%  o$  ͢ @??(>Z>b>= <g;o;kVSnG  Lw::.s%9-90)Y;/= ʨD  '   p  ƈ     .t3nfMdc L*b L<` L(0'8'+Y\__[?? >84*.0)>&F#m^  J     M %_g6px< +KSAsSg $L$! $L$y    0 0 0~u}3:yv3 Y%Y%L x%y% ~%~% %% %% %% %% ø% ν%ս% %%O %% %%, %%7 %% %%k  %%M %% % %ɚ%JR#2 %% %6Rc/ L{zy @L@y,43[(0(l>kii6h cza_^/]\[LV LQ@UڝRRRPK jK }I I vH F ϗE D C rB fA X@ ¬D? <= ; : 9 *8 6 5 4 63 1 r/ ..jN YLY   _  cLc [_9c L/z LL[ R & &dĕle _+ ' '\Nll { ( (\r N ( (/<D;z ! (Y "(jԃ C ) )q M * *x[ *F c+Ȼ p+ ȵ} + +9 + +Y{*{2{ tvvuuttEtMtss ,L,ueddF c/c7cvb~baaua}aݞ.nd'Yϕ`;_C_ ^#^+^.F o,Lo,]\\[ WV^VfVUU"U*UTTQPtO|ONN8N@NMMJJIInHFhE ,H ̜,DCBB988 =877>= ,H ,66 6 =433 ;000/:/.,+ ,H ̜,*)(&(& d%$ ,H ,+3) =# , !&.@5 M'K,GYGFFEeE UEUD ZLZ9 ^cCC=:7 -4 -yE   y  g  T  [ { - - -L &-_N  'L'O ~P  CLCBA \XW)|tG>j zsV]M 1L1AX 2; GNc ^ FLG12s TLTES>W61$23Q Ld [9q| om& !< !< !< < < ϝ< <Y < < I.I.H. L.L.K. N.N.MM.9ФxCqnkiZfRdb`]/[yYWVRTQ&P LU\NUNvMeLKJ LAJI*IG VG  l&%DB;\c DK: :Q9{876X6(ah ڸDK21/l.-**c('MW 3& L n %9%$  "߀ Xqq q ~poo5dncuc bQbXb ӫLa``N 4`+<@m 90L90^^K '%# ' 1nfa::thompson::backtrack::BoundedBacktracker::max_haystack_lensshybrid::regex::Builder::dfasĹs%https://www.unicode.org/reports/tr18/sss meta::Regexs#ܺsanchored searchesĹssnfa::thompson::backtracks nfa::thompson::backtrack::Configsɻs hybrid::regex::Builder::thompsonܺss1https://www.unicode.org/reports/tr44/tr44-24.htmlssshttps://docs.rs/regexɻssdfa::dense::DFAss dfa::onepasss configured visited capacitys s util::syntaxs smeta regex enginesӾssCrate featuresssuse zero-copydeserializationsƿs hybrid::regexӾs BoundedBacktracker::try_searchsshybrid::regex::Builder::syntaxss'nfa::thompson::Compiler::build_from_hirƿsssAvailable regex engines sslazyDFAssdfa::Automatonshybrid::regex::Regex::findss nfa::thompson::Builderss+hybrid::dfa::Builderss%https://www.unicode.org/reports/tr29/sShould I be using this crate?s shybrid::dfa::Configs+s dfa::sparsessInput::earliestssmeta regexengines!s(construction directly froma Thompson NFA+ss%https://www.unicode.org/reports/tr24/ssss nfa::thompsonssdfa::regex::Regexss Input::span,s9configuring heuristic support for Unicode word boundariessshybrid::regex::Builder::buildssUnicode general categoriessss Thompson NFAs sInput::anchoredssnfa::thompson::pikevm::PikeVMs$BoundedBacktracker::max_haystack_lenssnfa::thompson::Configss4Unicode’s “simple loose matches” specificationss sssssssɰss$ sssկss!sssɰs hybrid module crate::hybrid dense::DFA::from_bytes_unchecked scrate::dfa::dense crate::dfa!crate::util::prefilter::Prefilter(crate::nfa::thompson crate::nfadense::Config::minimizesdense::DFA::to_bytes_big_endian  sscrate::dfa::dense::Configss crate::nfa::thompson::Configss dense::Builders  0crate::dfa::dense::Config::unicode_word_boundaryss"crate::nfa::thompson::Config::utf8ss  onepass::DFAs  s,heuristically enable Unicode word boundariesssthompson::Configss! one-passDFAss  dense::Configssthompson::Config::utf8ssdense::DFA::from_bytesss $dense::Config::unicode_word_boundarysscrate::util::syntaxsssshttps://docs.rs/regex/1/regex/sscrate::util::syntax::Configss"dense::DFA::to_bytes_little_endians!documentation for the regex cratess!crate::util::syntax::Config::utf8ss sparse::DFAs crate::utilsssyntax::Configss+ dense::DFAsscrate::util::primitivessssyntax::Config::utf8ss regex::Regexss crate::util::primitives::StateIDsscrate::util::prefilterssssssssssssssss)ssssss Cache::reset%crate::dfa::onepass::DFA::pattern_lencrate::dfa::onepass::DFAcrate::dfa::onepass s crate::util::captures::GroupInfo&thompson::BuildErrorss3crate::nfa::thompson::backtrack::BoundedBacktracker sscrate::util::iter::Searchercrate::util::iter Captures::allžpattern_len() * 2ss*crate::util::captures::GroupInfo::slot_lens"s sss util::iterssžçCaptures::is_matchss Cache::new&ss util::iter::Searcherss'ž-Config::starts_for_each_patternsçssDFA::create_cachessConfig::size_limits!ssAnchored::Patternssçsssssconfigurable heap limitss Anchored::Nosssssss!'DFA::try_searchss Anchored::Yesss-ss DFA::capturess'ss DFA::config DFA::stride2ss-crate::util::capturess sss DFA::is_match'sBuilder::configuress, DFA::stridess-sssssss+crate::nfa::thompson::pikevmssConfig::byte_classes one-pass DFAsssssssssssMatchKind::Alls$crate::nfa::thompson::pikevm::PikeVMssssDFA::reset_cachesss slot_len()ssssMatchKind::LeftmostFirstsscrate::nfa::thompson::backtrackӿssssssssssssss-s$ӿsssssssssss s-sssӿ-Ks+sscrate::hybrid::regex::Regexcrate::hybrid::regexcrate::dfa::regex::Regexss9ss s dfa::DFAsssss9sss  dfa::Config dfa modulessssss9"dfa::Config::unicode_word_boundarys sssssssscrate::dfa::regexssss+ssssssss+ssssss start::ConfigsCache::search_updateCache::search_finishsssžDFA::next_state_untagged-s+ssssžs (crate::hybrid::regex::Regex::reset_cachessss sOverlappingState::startž-s sssss Config::prefiltersregex::Builder˴snfa::thompson::Config::reversessConfig::minimum_bytes_per_statesss˴s'ssMatchError::quitsBuilder::syntaxs˴ss'hybrid::dfa::DFAsDFA::match_patternsss0ss'ss Config::newssBuilder::buildsss0s+sssDFA::start_statess0ssss0ssss DFA::builder0sssssssDFA::start_state_forwardӿss0ssӿsDFA::next_statesssss-sӿ-starting configurationssssss !Config::minimum_cache_clear_count ss sss "DFA::next_state_untagged_uncheckedssç s sss çRegex::reset_cache ss crate::hybrid::regex::Builders!%crate::nfa::thompson::Config::reversesssCache::search_startçs sss+)sssConfig::unicode_word_boundarys sBuilder::thompsonss+sscrate::dfa::dense::DFAss-DFA::match_lenssss+sssssConfig::specialize_start_statessBuilder::build_from_nfassssss,start configurationstts(stst Builder::newtssssDFA::start_state_reversesttssssstsstss$s-ssstssHsscrate::hybrid::dfa::Config'$dfa::Config::minimum_bytes_per_state3crate::hybrid::dfa::Config::minimum_bytes_per_state,crate::hybrid::dfa::DFA::start_state_forwardcrate::hybrid::dfa::DFAcrate::hybrid::dfasss5crate::hybrid::dfa::Config::minimum_cache_clear_counttt' crate::nfa::thompson::BuildErrorttss s&dfa::Config::minimum_cache_clear_counttstnfa::thompson::BuildErrorttss s $crate::hybrid::dfa::DFA::start_statettstt"scrate::MatchErrorĈttssst"sτtڅttĈtsst'τttڅtt-sBcrate::MatchError::gave_upststڅtstLazyStateID::is_taggedcrate::hybrid::CacheErrorMatchError::gave_uptstst3crate::hybrid::dfa::Config::specialize_start_statesEt΋tçtcrate::MatchError::quittttEç#crate::hybrid::dfa::DFA::next_statettEtçԊtsttڅtttԊtssttڅtst-΋ttxsRegex::create_cacheCache::as_parts_mut dfa::BuilderžRegex::find_iteȑttsž, Regex::findt̏tssž-siter::SearcherttsssRegex::try_searchsttsss parent moduleّtst'sss!'tّtsss'ts sss'sssss+ssRegex::reversessssssssRegex::forwardsstssӿssttstss-sӿstttssӿ-< crate::Matchcrate::PatternIDPatternID::ZEROsCaptures::interpolate_stringcrate::Input::anchoredtt)ss crate::Inputtt,ssRegex::search_withsttcrate::util::captures::Capturescrate::PatternID::ZEROts3crate::util::captures::Captures::interpolate_stringtt,stՙttttt&sttՙtttcrate::meta::Config)Config::nfa_size_limit#crate::meta::Config::nfa_size_limit˛tç crate::metattç˛t̜tttç̜tsutil::lazy::Lazyregex-syntax::HirCaptures::emptyկsConfig::auto_prefilterss!scrate::util::pool::PooltBuilder::build_manyt Regex::which_overlapping_matchesرst˝tկs Regex::splitntsstsʞttsttرs&͟tss s'tcrate::nfa::thompson::NFAsʞtConfig::onepassRegex::search_capturestttsرsRegex::captures_iter͟tsConfig::line_terminatortԠtsttsСtstlazy DFAԠt#sRegex::pattern_lenttConfig::dfa_size_limitСtConfig::utf8_emptytעtststsȣtעtsFhttps://matklad.github.io/2020/01/02/spinlocks-considered-harmful.htmltsConfig::onepass_size_limitts,crate::util::syntax::Config::line_terminatorȣtsstssstsss+tssscrate::util::lazystssRegex::new_manytssWhichCaptures::Nonetssștsstsstssӿss util::lazyștBuilder::build_many_from_hirRegex::create_capturestWhichCaptures::Allst!sӿstѨttstsssӿ-s-Ӿscrate::util::pools tBuilder::build_from_hiȑtCaptures::matchesstsѨt thompson::NFAt!ssӾstԪt̏ttss tss s,Ӿssç memorypooltConfig::backtracktRegex::search_slotst̏ts Regex::splitԪtt#stConfig::pool_capacitysŬtç߬ttttstӭtConfig::hybridsçŬt Config::dfaRegex::search_halftt߬tConfig::dfa_state_limittConfig::which_capturestӭttӮtttstRegex::capturests Regex::searchӮttConfig::hybrid_cache_capacitytsConfig::match_kindttstͰt st,tss:effectively impossible to implement correctly in userspacetRegex::captures_lenͰtsyntax::Config::line_terminatortststsssڲtscrate::util::lazy::Lazys&tRegex::builders Regex::newstssWhichCaptures::Implicitڲtssttsts$ss-tstst˝tttկsttt!-hybrid NFA/DFAs ThompsonNFA7https://en.wikipedia.org/wiki/Thompson%27s_construction s Glushkov NFAAhttps://en.wikipedia.org/wiki/Glushkov%27s_construction_algorithmscrate::dfa::sparse::DFAcrate::dfa::sparsethompson::pikevm::PikeVM$thompson::pikevm ttsʶt tts stttǸttst ʶttststttǸtN#tss  regex-syntax::hirregex_syntax::hir::Hirregex_syntax::hirկsespikevm::PikeVMbacktrack::BoundedBacktrackerregex-syntax::ast::Ast̜ttregex-syntax::hir::Hirƺtܺtկses tt tregex_syntax::asttƺtse t$regex_syntax::ast::Astttsfull DFAregex-syntax::asttt sss tݽt޻ttt̜tss ܺttկsst޻ttݽt̜t!BoundedBacktracker::try_find_iter&crate::nfa::thompson::NFA::pattern_len!sssBoundedBacktracker::reset_caches BoundedBacktracker::try_capturestsssss sConfig::visited_capacityttçssssss&ss ssttss'çssԠtssss!stsç sԠtssssԠt#sss!'sss'ssǸt sss'ssssstǸt(sss+s BoundedBacktracker::create_cachesssstssǸtsss%BoundedBacktracker::try_captures_iterssss&tst$sssstttsss sssstttss ssssst׊Builder::add_emptyBuilder::add_unionBuilder::add_union_reversessBuilder::set_utf8NFA::is_reverseBuilder::set_reverse׊Builder::finish_patterntt StateID::ZEROss ttBuilder::start_patternttBuilder::clearts tόBuilder::set_size_limitttBuilder::patchttό nfa::StatettBuilder::add_matchtt‹όthompson::StatettBuilder::add_failt'ts‹crate::nfa::thompson::Compilertt##sBuilder::add_capture_endt'ts‹sӋ)thompson::CompilerttߌBuilder::add_capture_starttts' ssssӋstt"ߌBuilder::add_lookttsss+ssӋstBuilder::add_sparsettߌssss&sBuilder::add_rangettss!tttst׊tttstt{ s ss!t!̜tss çs çsç!sttthompson::BuilderHssܺtttcrate::meta::RegextHssܺttcrate::nfa::thompson::StatetttHsss$crate::nfa::thompson::State::Capturettܺtssss+sState::Capturett#ssssstConfig::reversett#ssɻssssttConfig::capturesttss ɻss!sttt!tts$s ̜tɻsss tst!t̜tssts regex_syntax::Errorçs!ttssçss ttsçs NFA::states NFA::stateNFA::start_anchoredssssPatternID::LIMITttssss sç NFA::new_manytt NFA::patternsss ssçttalphabet::Unittssç!talphabet::Unit::eoi+tt)s State::Dense+tt% State::Sparset#t+s State::Uniontt#`ssBuilder::set_look_matchertt#st`&ssConfig::look_matcher#"ssttt#tt` Config::utf8sttssttt#stt!ts$t&tstttssssss ssts$PikeVM::configutil::syntax::Config::utf8!PikeVM::which_overlapping_matchessssžsڅtsss$ssرsssttssss žss sssss,sرsst&ss sž-ssss'sԠtsرs̼sss!sPikeVM::create_cachesssԠts̼sssPikeVM::captures_itertsעtsԠt#sss!'̼-PikeVM::searchts-עtstssts'PikeVM::find_iterttעtss ssst'PikeVM::capturessttssss(sss+tPikeVM::reset_cachettsssssssss1crate::hybrid::dfa::Config::unicode_word_boundaryttssss&ssenable heuristic support foritssstӿsststss$sttڅtss-tӿssssstsssttsts-sڅtӿ-!ByteClasses::iterByteClasses::representativesByteClasses::elements%ssԠt Unit::eoitt%tss Ԡt#tttts sԠttttCaptures::extracttCaptures::get_groupsssCaptures::set_patterntCaptures::extract_bytestttttGroupInfo::all_namesss tinterpolate moduletttGroupInfo::pattern_names&ts tԠtCaptures::itertttGroupInfo::slot_lenttԠtcrate::nfa::thompson::BuilderttGroupInfo::group_lentt)tԠt#Captures::group_lenttGroupInfo::slotstt't5crate::nfa::thompson::pikevm::PikeVM::create_capturestt!GroupInfo::slottt'ttPikeVM::create_capturesttsnfa::thompson::Statett'tt%crate::nfa::thompson::NFA::group_infottnfa::thompson::State::Capturetsstt&t#thompson::NFA::group_infottCaptures::slotsttssst#ttCaptures::get_matchttsstttts$sttttss module documentationtt  E,Searcher::into_captures_itersdfa::regex::FindMatchescrate::dfa::regex::FindMatchessSearcher::advance Searcher::into_half_matches_iterĀus Searcher::newu,us ,TryCapturesIter::infallible܁uĀusSearcher::into_matches_iteruu&TryMatchesIter::infallible܂u܁uuuTryHalfMatchesIter::infallibleփu܂usɍuuuփusɍusuusɍ'ttSpinlocks Considered Harmfultuuo LookSet::iterLookSet::available Look::Start'Look::WordEndAscii'Look::WordStartUnicodeLook::WordEndUnicode(tLook::StartCRLFss Look::EndCRLFLook::WordAscii'Look::WordEndHalfUnicodeLookMatcher::matches_setuƆuLook::WordStartAsciiu(u't Look::EndLFss ߇uu'Look::WordStartHalfUnicode'crate::nfa::thompson::NFA::look_set_anÿusuuLook::WordUnicodeNegateuu' Look::StartLFtus ߇u'Look::WordEndHalfAsciiuNFA::look_set_anyüuԠtssLook::WordUnicodeŊuu'u( Look::Enduu'Look::WordStartHalfAsciiLook::from_reprNjuԠtssuLook::WordAsciiNegateuŊu'uu(݆uuu'uҌuuԠt#s$Njuuuu'u(Ɔu݆uu'(uuuusuu'Ҍu(sutscrate::hybrid::regex::CachePoolGuard::putusstuusutusu3Prefilter::from_hirs_prefixsƺttկsPrefilter::newssPrefilter::from_hir_prefixregex-syntax::hir::literalregex_syntax::hir::literalsusƺtկstss uђuu(s$suuƺttկss uђussuu$)SmallIndex::MAXSmallIndex::newSmallIndex::new_uncheckedutil::primitives)s)suɕuuus)suɕuuuss Config::look_behindç+Config::anchoreduuçuuç,regex-syntax::ParserBuilderConfig::unicodeEhttps://docs.rs/regex-syntax/*/regex_syntax/struct.ParserBuilder.htmlhttps://docs.rs/regex-syntaxuçӘuկsregex_syntax::ParserBuilderu֙uç+Әuuկsuu֙uկsçu sss dense DFAssdenseDFAs"crate::dfa::dense::DFA::from_bytes sssus ӛusu sssusӛusus sss MatchErrorKind::GaveUpMatchErrorKind::HaystackTooLong,hybrid::dfa::Config::starts_for_each_patternsssInput::set_anchoredInput::get_spanInput::get_anchoredssž-څts MatchErrorKind::QuitsutΝu-ssInput::set_spans u؞uss ž,#MatchErrorKind::UnsupportedAnchoreduu-stss Input::newuus PatternSet::iterž-ڠuu-sts̼uuPatternSet::try_insertܡuڠu-ss̼u˴s+) Match::newussܡuss˴s̼-+HalfMatch::newuuss-sss,˴s+Input::is_doneuutsѷss-ss2crate::dfa::dense::Config::starts_for_each_patternsInput::is_char_boundaryݤutus,ѷss-ssdfa::dense::Configus Input::enduݤutssѷs+dfa::dense::Config::starts_for_each_patternΦu-usss Input::startuustss3crate::hybrid::dfa::Config::starts_for_each_patternuΦussInput::haystacksuustsssuǨuusڅtsusuus$,tsssΝuuǨussڅt؞uuussP  ####!!!PQPPQP  ####!!!PQPPQP  ####!!!PQPPQP  ####!!!PQPPQP  ####!!!PQPPQP  ####!!!PQPPQP  ####!!!PQPPQP  ####!!!PQPPQP  ####!!!PQPPQP  ####!!!PQPPQP  ####!!!PQPPQP  ####!!!PQPPQP  ####!!!PQPPQP  ####!!!PQPPQP  ####!!!PQPPQP  ####!!!PQPPQP  ####!!!PQPPQP  ####!!!PQPPQP  ####!!!PQPPQP  ####!!!PQPPQP  ####!!!PQPPQP  ####!!!PQPPQP  ####!!!PQPPQP  ####!!!PQPPQgP  ####!!!PQPPQP  ####!!!PQPPQP  ####!!!PQPPQP  ####!!!PQPPQP  ####!!!PQPPQ$P  ####!!!PQPPQConfig match_kind starts_for_each_pattern byte_classes size_limit BuilderconfigthompsonInternalBuilderuncompiled_nfa_ids nfa_to_dfa_id stackseenmatchednfaclassesdfaSparseTransitionIteritcurCacheexplicit_slotsexplicit_slot_len SlotsIter slots BuildError kind NotOnePass msgExceededSizeLimitlimitUnsupportedLooklookTooManyPatterns TooManyStates WordNFARemappermapidxmap IndexMapper stride2DFA start_map quitsetcache_capacity&assertion failed: !current.is_tagged()&$no quit in start without look-behind$assertion failed: id.is_match()startsstates states_to_id sparsesscratch_state_builder state_saver memory_usage_state clear_count bytes_searchedprogresstransno in-progress search to updateno in-progress search to finishSearchProgressstartatLazycacheLazyRefSavedToSaveidstateNonepreunicode_word_boundaryspecialize_start_statesskip_cache_capacity_checkminimum_cache_clear_countminimum_bytes_per_stateOverlappingStatematnext_match_indexrev_eoi Unsupported InsufficientStateIDCapacityerrInsufficientCacheCapacityminimumgivenUnsupportedAnchoredmodeQuitbyte CacheError LazyStateID LazyStateIDError attempted Regexforwardreverse0reverse search must match if forward search does02forward and reverse search must match same pattern20assertion failed: start.offset() <= end.offset()0 FindMatches reSyntaxpidFail Quadratic RetryQuadraticErrorRetryFailErroroffsetimppoolRegexIstratinfo RegexInfo RegexInfoI props props_union CapturesMatchescapsSplitfinderlastSplitNsplitspikevm backtrack onepasshybrid revhybrid capmatches utf8_empty autoprewhich_capturesnfa_size_limitonepass_size_limithybrid_cache_capacitydfa_size_limitdfa_state_limitline_terminator pool_capacity asthirInnerPrefilterprefixliteralsPre group_info prefilter  Corenfarevshould find a matchReverseAnchoredcoreJinternal error: entered unreachable code: ReverseAnchored always has a DFAJ ReverseSuffix Hinternal error: entered unreachable code: ReverseSuffix always has a DFAHginternal error: entered unreachable code: suffix match plus reverse match implies there must be a matchg ReverseInner preinnerGinternal error: entered unreachable code: ReverseInner always has a DFAGPikeVM PikeVMEngine PikeVMCache BoundedBacktrackerBoundedBacktrackerEngineBoundedBacktrackerCacheOnePass OnePassEngine OnePassCache Hybrid HybridEngine HybridCache DFAEngine (internal error: entered unreachable code( ReverseHybrid ReverseHybridEngineReverseHybridCache ReverseDFA ReverseDFAEnginevisited_capacityTryFindMatchesTryCapturesMatchesvisitedRestoreCaptureslotStepsidVisitedbitsetstrideMatch pattern_id UnionReverse alternates Union CaptureEnd group_index next CaptureStart LookSparse transitions ByteRange Empty start_pattern captures memory_states utf8 look_matcher shrinkImplicitAllCompilerbuilder utf8_state trie_state utf8_suffix parser ThompsonRef end Utf8Compiler target Utf8State compiled uncompiled Utf8NodeUtf8LastTransitionUnsupportedCapturesInvalidCaptureIndexindexCapturesFramechunksunionsparseStateChunksIteractiveUtf8BoundedMapversioncapacityUtf8BoundedEntrykeyval Utf8SuffixMap Utf8SuffixKey fromUtf8SuffixEntrySparseTransitionsDenseTransitions PatternIter _markercurr ActiveStates set slot_table SlotTable tableslots_per_stateslots_for_capturesExploreNextDupeold_idnew_idNextIterstate_idtidx NextInsert rangeslen partitions BothNewOld(start range must be less than usize::MAX( ByteClassIter iByteClassRepresentativescur_byteend_byte last_class ByteClassElementsclassByteClassElementRangeselementsrange ByteClassSet ByteSetbits ByteSetIter bByteSetRangeItera matchtoo few matching groupsCapturesPatternIternames GroupInfo GroupInfoInner slot_ranges name_to_index index_to_name memory_extra GroupInfoError Duplicate patternnameFirstMustBeUnnamed MissingGroups TooManyGroups GroupInfoPatternNamesGroupInfoAllNamespids current_pid $)assertion failed: !replacement.is_empty()) CaptureRef capNumberNamedSearcherinputlast_match_end["unexpected regex half find error: 5 to handle find errors, use 'try' or 'search' methods[Vunexpected regex find error: 5 to handle find errors, use 'try' or 'search' methodsVassertion failed: m.is_empty()TryHalfMatchesIter  HalfMatchesIterTryMatchesIter MatchesIter TryCapturesIter CapturesIter Z!unexpected regex captures error: 5 to handle find errors, use 'try' or 'search' methodsZdataWordEndHalfUnicodeWordStartHalfUnicodeWordEndHalfAsciiWordStartHalfAsciiWordEndUnicodeWordStartUnicode WordEndAscii WordStartAsciiWordUnicodeNegate WordUnicode WordAsciiNegate WordAscii EndCRLF StartCRLF EndLFStartLFEndStart LookSetIter LookMatcher linetermUnicodeWordBoundaryErrorxsince unicode-word-boundary, syntax and unicode-perl are all enabled, it is expected that try_is_word_character succeedsxPool PoolGuard +regex: thread ID allocation space exhausted+ CacheLine stacksowner owner_val value AhoCorasick acMemchrMemchr2Memchr3MemmemTeddysearcher anchored_ac minimum_len Prefilter is_fastmax_needle_len SmallIndex invalid small indexSmallIndexErrorSmallIndexIterrnginvalid PatternID valuePatternIDError PatternIDIter WithPatternIDIteridsinvalid StateID value StateIDError StateIDIter WithStateIDIter look_behind anchoredCustomLineTerminatorLineCRLineLFTextWordByte NonWordByte multi_line dot_matches_new_linecrlf swap_greed ignore_whitespaceunicode nest_limit octalcase_insensitiveAlignAs_alignbytesSerializeErrorwhatDeserializeErrorStateID PatternID ArithmeticOverflow LabelMismatch expectedAlignmentMismatch alignment addressEndianMismatchfoundVersionMismatch InvalidUsize BufferTooSmallGenericStateBuilderEmpty* invalid span  for haystack of length * HalfMatch spaninvalid match span PatternSet whichPatternSetInsertErrorPatternSetIterPatternYesNo LeftmostFirst MatchError HaystackTooLongGaveUp SparseSets set1set2 SparseSetIter #@#$uuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuvvvvրvvvvvvvvҁvvvvvvĂvقvvvvvvɃvvvvvv˄vvvvvvv…v؅vvvvvvvÂIz]Srf)~WOTL6@b{S=+>qb:)BRB6pk < v=m0!R)i&QP9rlI.\ @7aM@b2AOahWL,0J9! _ͭf dqh"I K8z6@\?e1 qhƍįīkux_ aifi+V8YTƧ= 6",$Ͻk1?z(pF2Zo+QO ]F՗;vZ_VWGiIS$?0Y \wD{l]!o=g$!l9`WERnê4]eޱ۟)W14$!hm LmPBc vv|H栒HZag c0a϶zj10É|4Y ^D?NE;n-h\Љ 4[Ͷc*"iVԀi(GhZ7I8G8# S/ cr Wg`rM࿙'\T*ES!)-Yv>=hT&%?S9ڔ63=s62~?e|1t,eP3?GSq4r}5|X7Ak4B ^[ I|d:p+w\P(^Gӏ!s 4'ƃbZT~. ,gd".霱}}*hȌbEs"9L<9ѿ׆%\CIjhEBVN}lXRΜ`ȣ'sjq_.3iy`Ĺo 3?,+u0Yg%q <-X`%O}ȉt4 ĊG 6k^رR2?>DPg!LyJ[-<6G4GGɦi/K|AϴɃl/!)i 54F*>_u(6"rI\ R|_>{Vlt~ro8ƬqzPc XjʦDiN 2rhMM xbDݎʖ C졣q{%23ba[k[L' N\LόCÓ~h!WVf)xޛKV H-MNH)F9e(ހBuϡu>jV/ekQlٸP"mi?;ׂ,_5&8f6l7{RS"2gVf4@n-Wow:GV1oҿtT|)ab;}B23jdq!t$8wE7.,~ n|ӟ?)swR>#de*tન*|7{S-MF/}?cƖn!:;|-AE"[p`_9Vki$W T| 1OŌ~S 8]z ѧףc3{-ɎiW7rg/TϾø ugݱrr"ȆJ  {C(%\d`D pSu"(̓c9\[> Wׅā\BJ"j.O gEes6;G%a`BxOo; ෗ȣXX!?|-g8%Uew HFASQt p?:s-AmaTbzZr#z=@:cKy?,]¿:EX'̮VR7Uu2X{yZi_MsҐ0VUFAX1ͯ!\qYK]o;wkvAZ á b&H p.>ȝ!Phg⼾'oa gxĮP[ט-Ym=hδ襞 \9$@҄W7;J}NC!TED u ܅/(vX}E}톤jԗMQr=ά^ҺT &Edmb,:t-,$okKzB& 4(hS1c T$RVea֖82i -5 ge\Kh0sٮx,q隇ǚ'z!tc ƿrF3n91љy9& B{/VW%ߏɄSX@ o%<^0B~p&p$pHO6#lM<}̃Tfo30/oVx@e `ɋ xh~>Ck`;e ] k􇍑9춈e%tU {qXo}B-x2gB}Ñ?>uߎΟgM)BސƲm hK"X$3E^$FU# r+zSQ5(BV!-{'5,HƆMv/?z&5ز-"p2Wd2Dv?I4l`c|QXXxI"a1ps}\K<9l~,4; џ)l(KuLRyi讲)J ܥ@?oKIq 2b5KQLWӴJ}0 g.|1j \yEEo D[>K/T;$r`m<"# O!H`PBtK~dg-G^jy^'"B/Ge48իWuV)?24KXD-|aʘys?o"fL_+z)IB}G͠6ي=}r;']%$ C> lZ%]QH(3Ss5c E1DiЉ@;+j<@U%Ӆ Ƕ0ĕZgnBchW'HsBnR @脾"1˿Bl?LћѤʅD*i$3Fd,)E-kF;5JIQH:P`~U:m&P(լ:3w`5So{biڔ}"C+DOsOnj  Vɮ$\D#J'4G;;v+^NZJ!9He,D"b߄vv]f$lH .JzܬaR9kѫ֙[XL.`xPءNܴBsۺRd~Rا":uR{`5ί |hw0wLJ AMtc Zs3VD &ƏIiPS/z;T8ʀ4GXSP<ذ-H-6iYfO:r,=F& i7eo<]>85Iզ]VnSZ%Iocb%3xI7uK? 'P߾T"zil~ FʖNrp Sfi8e0jYz˽Ċ*'<ڥŒ7""S={QӓehjT M1 `/ەPP SE $ُ`{6q);+.+ש9Uqqɞ<ʳ pe~]cW)f9â\ rxp j?'UnJ:K0q{It|A߼o0j#4ea 5Φ]r)NM.J<w,HMaa?.^KyMf'~8cٽ2h~.~7z̽[aJ.JXyށ+ FVĒca &o; '՗ʳ 9 mlj/Qҵ-SՑ?l,r^Z;xcʃ)_hO Zi2nPlI1REp:CCN:,рin=MlG>6[O?BSqL=UOT3ޠKsCm~EK+kqP5iJړ>']:ۄWJ`:ے_a. ۲~;*[Ct1$~9%Kng5NOnJP~>~Y#)Oxz]#{ݣuCצ{SY6NTa~t֛7n fY>`C7?kXx;(%6>$I&8 ^|ˊT%UNf`kVcL ;6L$֦kT |F5 ez{=Onۆ ] :FE;ÕȊ+ܓU']^QؓIݞ<)'d?::hzRRE IU5@F=BYnt"â?L!WbPdΏ9)g-xݯGnSvT56 )-H\?Ҵg_ل@HVόI*ʩ ~x.cs"o0߮TuFCV2u8gQ(x^~\j 鯛S2m[q'"3%3($R *]UeWfU3}:*2|CI+O-Jc/Z>q|<ynQJ6(yap[x2| nxH縯wbHZUO,b+Gk;^sx7^Ⱥ~|XӟgΞOpR+[*6+43[z۳Ӱil[̽Umjt*,T "Prq>LBpwN'Na|R6x^SХ߽ty7zuȅ{WE"3̤ ='l"x5x8ˆU*0SyTW[M 7J*Y}ƈ 8L/Bx3o6>s[+GE螣Q9 _[FA~ T:m+IY(K5~//D#lЎo xݎUQ9WU*Ԫ6]F"c^j-b&֜/8p70Q+k١Tϔ\?6#/[uM?X'VE+Id*/8 @{Je yLH'3wRz>ɲѩ*׶i<R9|-!lqhK'=Io aGtm50Bα06vgF$ѳ&\',g3'g7vO b[hn7! U /e𳬸#~SYW%1Fs/O]dڭi3Q n-F@PZ$;ۀ uB3ŷ،Z:6eE[>}Fq͢Rx˿Qa_Tęu7l`L#PߑrnGъc)uɰBpX Aku ژeb |_qkP|9l5)xXPEVx/!H܍丿 K$59$c p,J1w^ݲ1d͓p~d f.|։+RTޏϿVq>v;Sٕl>H !]`kJ>'{[=$=w-Ε:soW`\GnP_*&3NBlӄhJ.@hC4]i/sq%1f+: e:ב(wɄ7W6χ:t8-ÿ_am}1޺[.fnO+ZU[syNDh~~Oޕ#>'޺٫F7^9 ޘT҄~.;ń© 4y5S o3<>fVb4^G0*rnthFUh,$p%i+N>L ;~3t,kJBn@:w)<RfYbK~fZv=C󫽲6v2qxdט -(w<ݓrW)Ymj? ^\kag[> IU{_8Ow/A@b&'Z6Q;#DǮ)AhvXMUQNzcy2dy,8+)@;25oKfA[+Gepy4s&3۔F_|+ZSJ MLCKjZs@!Z'ԬyU2߱OkN$Oaۅ3Wx"Nvq݊A| cur_%{7j*Yj[ͮPBa1~Zтv9̛P+\bUxz^_tsZf24XS,DQπÁʥ۩iaJSC>R1S7ڛ]}q_ZgZ΁~R6*jU4AZl!l42GztDbh.dJ|N?Q)wWSf1ZQƊ-rկ4 k޻ 8?(en/c3925NJM(g_Zʺ9kH eo 7f~wV{j`}_;!)pGhT 0k}HJs*:qLVPߠxScr-X"Jd1kqk r*b[Sh78f95fŘK̩!kpF!*q!q=LR[Aﴡ8p滘 É7ސՊ _X0 mV. q%sDS%$׻ںm?@K:@7_ܹq*+aVp=@f]^}KUD[$[F< yZ׬Cv@c(Q3/972ȞM |l;ì]a~τkE'F)tJj/2MauͿ"/.?߹%xu*/>zzFcmNyq\sձޘY)*1,bg6R"R&|B|OoP2VW! ;WdM*PޔtTB܎`Ng f-zQJyhjbEkPz//K8`!{LD/`"CVhJAUK^k k'SL7dҞʼn%$BzS脿7&Tk> pLT{f&|xZ}Za~ u,Q,t\?/>.8K>yto*u8kEzvڍZ|dzMTrW:]uJh̔nUYF3T&O7B/eٵSgoōxH/Ìm0|ȭ$H)>o?@G-믄`m`mҐes} ,9_',)酠jL{1lb6JLTZ\_*rTK .gY1π%7UDꓤ?^bitU B"YG7)csO|SDo__p"fHX#@" )B ->4]y|$~2wL6bB, \StsƎGIqmD;_Z|*1@Arc[*Iya>w!f[I&M7mg%C0ǏBl,*ų,w)lmQϫVdbfCDn}mj,,na'??RsC{#+Ni3\w9;_ 7Azvq2ϖKv.mfPt@sDR^On$a,p!&Lp3E̯\T,F߃E&06_diAfOryvZyA/±ay""̟( Hl뺻aW!SaԵ0ɖoZ$Uy]'-OmAU ל:R2<a:VYJ«sp鐙+)|(6sJB#濕r$?ϑwEBVDoH-yȹC(UWN^ 6wCՄvb)VZI3,o!OG BuG3 &T\ɂ+dD PIoZeF& 1NZ"˗>[Ffk/&{4k5%픇|t"N4tJ<%ל<,kz_i PÈ2TU:͖}3X%zq]S٢-迂n3,eU6H {QHnaN# ?8cm< ')P# ' ABgЎCV5c0a%]>Pk$;[t/_n֔!<~w*RLi6iP4ߍPg%\DTSD 9s@vn\y愮Ç@7r*sZ>w&3Y\h!5UkFA gvwo;(Њ.m{U$*)a(4r-!66+oW+nU'2?uII3m([`m v+ՒDZH R!r5;w8$5z'Msb2 T%؄{a+XRy] M"_#7;Bw)":M"լ綎*%:iKOooUSţn3Z~bѥ" XUlL5.ym!ћY@/DPO1Kc^?.\C@ws|u9LO8Ipx0yس?vgZ?4prڮ)ote geoh:Ny"'+9^{ 1<{ٌiMVy h Ny*8^n ,!$'^,*c2d@s"5]MBŖA绑wOq96|bPI_<<5~G?\6nhgGS`tܥKLhQ6QV`qzywk *(\=!ۙNsL-p9`NMJ%HKNczT8sfȁCzj5و{E($ F$d4r@I6TpU)4~ *Nwh#SʆC?˲wdN]@zl#64N#bĎG=9l Wі*[z[X`YEC|LJfF讴;@݂B-3pAiH&8o\p~ nګju'?5oFQ!JVw2iGqiZ>[.Y|Zt WB<` on\r꿗atGaDcNLlS+~F9_\bMA;>@'!%‚]Sv!]܉/<>[ #xJ_!.;7 1W.rQ^w~p_[& WIuB\p)l9:kqC9Z@5:z. 8 U}ƨ@IB6@7Hz#9wyݏ3I7ЮKDN-8kbN[n:fפ9N)!pJS7O3?/I,t^'}b=_J0cN>Oh0ile; =] `\|.G঩p%`@TD΢ ߩ:) 8c/D67bL- >3S+$Ppcқ$JA.8Sȵl1즐٣aƏZ [e^YNo%'y6e oFk`8%\ rQ ~v&S[WaADžT!wJ ͖K'7CafHet^WCBZ i(`,jKs$sc<( @9Cipv!~a|i>D:2@W&>yAgy V)Nң gw$̧ iSZ3va66|=>˚r̄ %N\H-yq|BoM٨ 1C,as{!1 LPEw~(EU_~zh$mcZHgivz\D` *bC0zzk)f/Xj![0"C.yK\8cF{JN'o8huUF geuOfO[-uf}lv\tR̫]4}XC(ҕ3uVSn8}gA$O)W <0ͼ0&bahc(zNO ű?kI xt,=BŽh^KHI #*͛*LآNI$"=AeU|4u~D .Dp*O8C$1\GބN;mѷlM٬0Qt兤  ϱ Z9}M(JY$`*7ZG3#@_h>6 BW`zH E. I #CP(pS瑃eYJnxfY;U=w Fʷ4:Q<)쁕ш.uIjV/ U;ЗŜtΌƒwuRƼxu.^+ݹ! 3/IK' 3VR&.~Ȓ5zL.̳PՋwKWhMÁauTA}`J$OfCsZ}Ghl9)@W''=Nk:l#O$jC +l(M^}ǒ ] V^kn=Tb?",bLe74T&ccoB7sZI,Rf%*Oћ|m/LԦL,TI7X0E(ixhTaQwpXoB^ =sX$G*]8]fEJM@NK cl$X?ybR.Nȭ&%O@a(l8x\ʸ ,4.OӰM. |+C [IFS VKvÖ \{sy]zDX`ΚqO͏ddE%6>>%ej[n&QLYOwoǭ_~0#c1o21)mBт#1Ჭ흚 Qzk#C I(ae00)fW3`/z"m݋ADUK[ ?xn*`edr7f w]ON`븏S*{'A5vqoc(_Hw66转S ä`9mU4z+)Ym#žP 9d.p aY !RV'nC*fܿc<|dEn*ãnQŋǗfߺc3iMhٵPJ=SLa1R{;AFSXs{O;ѷ@TE] åJxrBwxCR#3[v%?#+LbPO%s~kZq;55f'ڑڸ{o忌J@qT*4e{GZĿym@ZI=3_~z(S;p.,o7vIx.'+uqN?;^6Hn|XGuiL[ǹVڕ KBT)_48?ߎѹO5&ZM3UjMa^/L2'qJ<?wMw=W^Yi{AVlY S#m<``/ug"ek_WnQ %CZ>y @TO<05^gI}Xl+g@>e-Lg ^U&])Z?]n5`FAzp M}TDb,A/&& KXR$q|@#0hQb8Hq1 J~yU[(U!8noҊΊ !8+J z35- - zX 5C_+y|o7;Г/ydvڔl-&geYt+wry>X3H(A, z: f*&뼉A3$ z;/-DͰu.`BWL'i`fCq#!E8=yiΤRS\ <>" DklOƍj^0p4šq `Bbxv/E\1s*ܖħmT[:_H#0Ya"d-x}ۍZDzYO_$b}!͙ppxs;b(BUh?eٝMAQKGt\Nny`kTvj}sO9 \d2Pfj"ɧ{T2D~{2jH$.#f9@m T=\e! 4&tiD$<#DenG`'°!DfE`{{ F/;5*!b.x |SKt4|4В f,!Rb6REhM9ܧ4wZZ^O9Rk.f/q\QjMqL#+XZܛ=5xAJO\cUܯԏdS۴W728t3htl,x e vގ&c)_/O1ueguejȆt;]<}~f?Ʈј#‹=S +'F.6˒kDK }&Qis^W_J 55 jR >=wF HiAu2p`yL nޢxZ&@),36t15g S^L{ld*18kh~!yxBڈF}Ǖ1D-=0{g%Bçj$M:N rV"DٛlL:xru=LäTOIBF QBA570w^tQ=|gHDssID(4#`Lj2!GR﯂7=OX`L3oKe(gҎLQKU)'4+Ipyoʟw:eX -mziG>d#wyC4[LFRM팵t) Gͪ&3l\ȓ|9#s b T3&o]--_vS~&|3OFv:jrC/Of{a-+ UXy Kc=>_>/>W@x>rމhjx0'4ZLc*0LFiW>Eqߵ3MpHةsd5Y̐h0 1@Je+Oc9sr!qxh d@ k2}F&.az ؎Tw˫{톪14qy8MO/TIsOBG*Y<ܛг[( [2g{L%%z0Ǔv;`P2Kpn gN\Y&4oVfE Sv!⥥FVHoMh8kV(9CʌxWYu{|zHO٤-m{Y9r8PH o)q51MlOsIK=Dv?bq~aSptLxg)h2!HP)3 lz ;Mql  ᏼЍ2W3BBWw\,D2K\AŮMjnBS:rg,N]2$64l,T&@?㲆YчO74N+2sEEr%]U\Did sD>8BPvU]#z-gMv^, Ǐ⿕IP?\o8k8C IDAPz1mt˼K1I6e%|7 u5 QKF9 #!*JݘC&Z:Ue;Z}2S",^~rX꣹>jctD4ne%3,-OjL9.B[-B9iU%[]d&nɉ29Ǵ x]iAF)#k@G ywUuf_y<8K /Ef܈<|y"j_f+ H- RVӉ>ˍ?s@̰tuɞGjڼ 4uLT/ ~z~wj&WLg凣UTA@)[1ZaNg?+=Uo7K/:FW'3ONKjS1d.q*#)k4NXz*g =K*8-֏ӓ8;E !\"?EW'X͐ݑeF^q (]/?qc46Ex6l>n-FtIv Q֍YSegv!3.C4mL;2)7BvdY|9X cs*'% c?GZ S/5 ѧx"8%l)P}c!+[r|S<8ԖJFsV??s|g(Mk9Kqp\ S8\*Q;qRP{'2>kCEfF s:7@=ޠ]mYqa:.Gʮcz8A Dd&S!b+q^ʠ;RݼOK8̾MvdzmYvo'O DH84{ؙaRXGfx̸iKjW]Ls߷` Fֵ߁Ðm͆ne_qymK պ[|,l#iAMy. *3w.{UMOڅ4jvtRD!SogM V]HV1$&-1{A!F7wD˵ntw7kҹ~S2ܨS+ܿB:_ ~4M vWpLhRh 2eQdxsiؕ'E$fXQЛt4r`6PaUnqvY]D0> 8D(<~@`L ~8ƻDolP3n˒rZBbvK0ᡙXWʕy5;Gē}طft@QaC$iPgշ ަ 斲;Tq[cN';jfb-Dd|a٨n^{r>.k`V#iL9MEyϚoEwK[)'W18_= ]=@f\P)s72;w;p]J^':HBɓXBNݫfq1Ai^zHZbAޟ(MI[lL eMbsj9ԐC>%%UՅ?hϭDB/4[#-GkFpq&T[u#06Fȓ_fV mxlH3S5ʳ]GԌeLl~t8 v`> ,XUx Qu}db qcҖx`|Ftk]Z?uZ qDߛ(kEh[QPt4OKt`VK\y0k!uTbJH6'rKqlEOv^/<|8KDH*4}ђڙ~Ȝ#SiXy,vl37YDu<73o+]> œQg4y"5ۯ3H4.؜&_eij&!,p]H0\ \KWEгҽ" μ'_A6]˸v3\5ЗWZUz =iNv'KNw5ӌXV Bցc28:"(Tぁ F`dasYit ЎŦZӭ;ɵ^ia|'YSyW?*ք-r\̿Ҡβ%ٞ!_8nƺH'ϭL|܍20kx0i3v?T㝼-/M1ԏJ,r_8Q<5,,bWkեHUw(zhA?+10=(%JӞ–kUB >"ngqwֵ'mJW_Q/OKrt9*xXպϨ!RPCTOi2_pf8PMA-APh(6*\w-΀#fڄ1~qSJHr"Cmig|95_H(|`8zv%mn#Kɣ6E2c;ʺǴKUht WHןjZ0Jʿ8d /V(͡jPwg dvFHm\|Am{)gVh{^^Pl#״8l SX#DuB V5'= A|6qFIg@^r'Fr?*\)R+х>='!,5-r+pLYXkfgS"f(]Ni׮)=|!CNx#rk\F*5p0G Sad=zmuCFj }_6ȴ"wli0V%X$Wvx?$`F \%%¯&:1$䤧3Q6Kw,Ǚ>vEJ^}:rOs!+B}hquco.uCD:޳} g<ζh _zYHoLG[{ ע1 3].䱃5; c?Bۻ,aZtXq4]٣Jg'U!WnIޣzCҌem'͏U eHܵOB_ךa2 z}kO5կͦC tt6\g|FܳdH4 ڝ*-UZRKxIZ_`a);$ zA%_,бe-V<:+'##>>hעƛPJN!AP`l8~rƎg M!DC0a`@QsZ}XY΢XɬjC"p0[ ۚ,e\4\n_q#dCT {6m9d} %dY;+-FޱQF(%mn+W|r雟OAR]ά'TaLZK=9)$WWC/sH4U/YGf{3{/-dꛛ*pyy!]5 #?hR_8＇{֠"sq 8Ǯ'…:1؂) 4:O*D8 ipBK;\-Ce_kw`xnt)%vS[+QwMakGN{uV1˴]qkWz* í23 / ˼Qx~c ;HHڏd؃ )˭7q_W ވA[##N0/UxpйjqX̯X{br^gXh6|3jX8Anir$s`(S/P˲`mlK5.e&2 !rNg[\HSsnp?Hh0bG :(AHrE)J@ZysR*wlo/Pc0|&|Qef++Yp2m@kpb&v l;}ZP M{~LV݄^ u}G_xX~tHߡкhJݺYɿ5Z”=f.һ RÏN;UVN;gC!\j -){Pd_tӭ NH>?hsq hW% 7-)EzPmZs5Z-[cA]nP^Mb@?e"fǛ[3 ێw&8TKx~挎9 cxc)>',%Jh$LYECLiUe4E"RRs~CI:RRsuɣyKr`zc:MFEȋ֊.d,cрka?;ᕿN'AO1n6T ;#V 8!ƞ\L\+JFԼgLZKs@E:+$qa-E]Šx7fE7UyVan9^YPqU,b 0_PӍYK:$W>md&;26b_@rRҤrq̀4onU"L9BDVT<GTZ@HӘI|&`?ԏ'`u66no7zg 䋁xit|g/]0/T{ՈJzL3'Fu:)c6( ΁9["!*4dC|)mlF<h!{fo(eW7 C'>*|Hz/M_~5WӞ{=G^ PZrA"0(+u[ 75}b*^&J;St-4D oo@[f_!1g% V0jP ޮQ{5F `b9c+='iE Kk2Y/R0-v@c.at18LσTnS0W|U>~pv|:MRZ BF̵'l0_?nj;OSi{"mb_t܍eM *  炐9![(y\ϩiK@$ĝ]@mI pE#F65EV;۱exe"85어Vx)ܛ@{ڍ9# L0r4'uFw[?˾)pi#qQ'?Y7nq-_T{9&SX=\%l0ᣂJK{: T:Kzo9`ÊjZz?dt81 h{-[\ Gv6-|ި5$f=X*Q+Tw\;.'ZlfE?Dv!.ttvz&(=qټ'8o^QJ~syGrк}z*1 'x׊_R;[[ pE!Yg{;Uԣ Mx/r¡UIG:(*R_d @9M,-, [WµIx(.P=92#{G 8t%5e@F~rvqN#R,,D 7]MF(5Ӕ'c̘4 =#Bw+/0m d:W65r# T׵;CHϓ/ї/*qnX8}a0I} %xG0'Ř+w^ańVuSF-i񁙄H~cC57Di7"*n@Ox>u5KRpXW ײxzAGאۗ^rM3]2KL}b.R|d&+ V2y`7k'G=!X5n(#i*8c*ΆDwٜ ',Ktt/*SfZ6ֳNjۑE4%pW pM_ &$u͈Fr3!..v/BeԔ*!YsA,C>©Đk O~K2 lNbfnƈf0dt~)N;LlKMkR5|XpEBgH/ [:]5ieuZ/V~0;c!eJђ&x𽱰JOKWbYJM.*t1ڿ.p{:Yәl'#E#xqp"٦-¼w=j@.`=Ht3].ˌ4 - NH3#f/G!2BQR -d\w{ș)vzBOHbMH'Ll`nYYϻ21MnTe&̥dl6&kZgBǖ $mE` tmDNvdx$TvI(sXXgj[`A%&?޶1õs?S}A4Q֊a* KiEObF (؋^J?4kez^$FQR R+afb]Gի߸\W2}w{= UkP׭U<dp2%@=i/_>UpP}1FG1;ӄ@*2׌*sB:[wмp2>EsY`'YhDIW^ $K7M3q,fcV6O5nW„V3&Gtރ)LSz#/,œ;B2>nCJـgf#F|۝>cM sK@ELO۱ӧmawO%ɥi/Vgrtb$ q B~h[8i 8SvV[^ V`vuR(?$L dG',+"i:ucƐ?j%a95vXub3p3),(6Daz J$ŎG;t3K??iޜ뎔?gx6؜gp웞Gz!x+DJ וOZ>ZJ3j5m @s@ZpX6i5AKcj3OD$G'<IB2 ?|՘4?; %z­S ImXOM͒\`,*ܠY rDMqoCJ.Uzɏ|; >< WlL qUt=MN fY gw@Bz-H皢WڽQU#(P%ϔĖ [CA>)ւ9K&pTL牜,ӹH1bv=ִr<2bݜAMGfû59Q?qayJXr/un ,5n<zjʑU+lPOKC7LM5L ʞOA>, | fO$9j/lPQBRz#2wH [*&C*v_hH mry ^ϴAyRNPe*|I?q/l$l4_2TX_gvqtyV(pteyۡV"lI}ۇG: D_s۰ wqpjFL* Jta7]RhICҾ}s79a.azubr. l̮ 'y/Sdz=uꢶ G:T'H幋v[<`b ~5ősqV͡vC}T{rK#9کJ+{ Co>FJ@!Spd":)|J7aCorͦ*}.mt.A ѡ- D XU@H57ERY%,✻jQe,})H(Wdɵ? ҕm:?\y"%BB[!ș.{b_R^%Ulu`?!4 $%Β]VFdb!}0(A>G?Ffl*)ś)14%v%|w#h2lN HmT*gtT tD2$zmr,[Ngpzy$ւoٻn@[?Bզ'fP) z-k?23jpL0%WQO7LF *}GGl };^!Mn},?x#W !r`Xw""TRSH?[朼nzW il1GEQjf{1;K[꓎;,9VL4odÁu+zzЩ7<'E"Y~s-F7 X%`peFBS>j.֕;NZ:рG?6OBۺAßZGGݝ)6A\;cV I#jgw]_o:s!S,ȈzAw =9ndEo^bYws.P^':!DH"AFAL29)7Ǜn9c@Y$024XP.biP/_ZqF*Ǣ6^ F/M|W W+ Pɘwe_@f&0^T~T9|iaԮ@H.CZ>ԂaLd.;FSB?!贄Abk>6Kt#|ӱj̣J=hfq:U(ڪKQnLc/i钟nD O uou Q?#Q{dR^'Hd$g` *w-m`rP +qgBi W\)3=3SFOs8{`Z&pɵ Ըq &ΤZ6Erm.W/W$3X~Ar.$Tw׷8e\xƖuBoG݃@Po)E-<㙔5 ?tRK&)]6+X]18|j|)ivy"Ԡjw;AZO#櫤Tr"/\֨W~T`*v!ֈbwS&)reGh^oxtˍmI\`nZH^A3݃;Tшޕa"%K.elGpŊFkb$KA>S|򩝼Fזy璫/  ^x2C` q=;dj|c8KDS4 @[{(Gs% yi X,¨ceV-0^Nm'6f=pmZ%FwkˎG8Pقm}2|m$ZSjpM f,"!'T޵/?Ӗf6wR.l @%Mгo h)b\d oi mDD:n10(.pAe>TPușgjj{4: ! ,9a`ڪgP0oLL NbьT5 KK9ؘ 2f}vMú".:7Aqe7#uGQu{Iq2Ґ' Uo 51"M j,pv/}ˉv!Χ Ν?Ȏ r:sUv7{CxvLT!0W05|aUf1آw&VKmF* E "Xy! FB|hdp]H/'ph~r\E 9׮[#5C3 fRrp}j(iv*4>-mM8:![ێN/__&;m VC匙QwE>"@tϿRv)'0'$3Fϯb CD-\l̺a8s/3s/T<>,eo-6(eG.2?҄GIJgP< jO}J\1Y{%\HS{$emѾTn9wE }Y^oxR"Ҵ! vu2Fҝγ.ecfKS;?vWt_DAq;ټ xcg_'sl% !z$p(p&vg/ Du_@3K!ϋ" mL}>B!D3i@?:r'zz=Ʉޚ dHQ4w B{H%0H H܊ʈ# 7! 2\`fGTTΊ#J]N"h8;ײ}',`9,;c "@2K뿓@d@Kp ˀ0+;0wwaϽ/_@p_V#(fݙXI ~wNĦ0y*#+c)o{^vY i㏧Ujoъfp~2fws-Ys絎NTMz;-YAm")mZ.a X9:}#w؁qVs8Lwql=1^@R 2X+.u?":Fb(Lᝌ|9SN3%NK?RD13TNRF\fx혉G?8*lNR4NdTf.#O=&f#cKuҋlL9|^00B spSd1R]%-\Q x۷.\s8Oe?R D1PK!Zܾ=$ev&}6jxoߞ^gթZ#W6Bn5@q{9ITM(yG<6Wa|~^O>Lɹ4AC𥽿+lV܈ w;-,5DLDnP`3PH2F7h$Նi;`P6|6g7ӫd*BC1_Q,eB :\h"m6b֥nDn{jТs5&`nW̾lK/xRIyW)_$˫ X{A$+E=qSmHδ&ѧͮsj}? B߽,kŕzGj{ -W7@OK{&#j{G;aBGn70s39y&78OKɵ!󒧥 6$r+α1\n4 Cƞ/E],{){VE)&C0z4Ca"y +4sUh6*\zt]yy7jV"ğ*F11p~I\v!ٴz]ˋ6bi@8έѕ IX-rm 0Ja y+Bsl4B߅ּȫ_׆{/J6#a}N ,z| 0L-$>sTunk*w3a,jfIy{1v+>0h^Y(%1'KUXr),ecfM,S^:)&J# ? H t';VWNHodjVN$-a O.GN(jW1﹐- ~/6x*-$m$s'M #oV{t t EhՙFG\|qnʷWL8 B#XE ySt\+PU9qv!&*Fg c`u~ Tkъ Q "ƹ#_m.^[Є;fϐҏ-s\ |rdA >6OIwP]~9iЅ:q =fB%]پBr0'AH)(A~"L 9D&a/!Et6-p[g u}}K~M\q3erqh|2 s,^B91t깷TTvXcyܓ>c3/akVTQn&.bK~vbA` eh1ЎCZ$>n>s3=^.Ív;l0sdO%4{2P#"}jmňBu FP@H̯Ӵ*nvn\PyQT[G-02R77k 6*ޘMԲLR=-wlzȱVH1! hW"SL8bDs%vWzSo^-etu+bWC (7GQxE:pRU1-9RM5=FqM 1bSR+r IVbaq<8V<#~2l4 hcA1i}%Hj.LHSKn yrPF*ANVUt-oH9_=Ԡ"gP{e$YrJqwV2I\&aCȧ?Tuj\/4V8DFM8$ؘJߓpj z,k뚑oM~?% bu ##d|@:uba)LhldLo.Co1dîV>jfђ3X͜8n0u>e9Q_#բ͸poV\9C] A|5_ɩPk2R*)Y\͈F!JCf pqS{ ҬT+/c)Os3SJQo'ML/F;Y [#+^Wtlέo |7r&uLY,*p*\ĽgZTh[,۰KlC p]kp'!BZy@21fkOu tCU?L}Ho%dlAN+7yX[ 2#R6" hJ"Tg%oDl,jk}1S-@;K#B[: S8c'alH_AyrN~z] _%,M~4Y_~mgx;?op[oQ )?LvJcVc]Ʈ̩Egw:1GZ!*b(sU05iChJY dҗ} ֵȋJd.bƯݨU1l )YZP(>f86KMD s܎t ֛犮bcNQ`vq=\^S0)YD \=U\Q!9p9 anJ Icu܏SHf|` sqz #-M4[oV pM$o]z+hy)wHOpf3E"ds㗌ՆM`eMW{Ryv6r֒0DE Y9ɲh^ow/C@eXrZ8O/?ٖ49(?cW-27qLZL4t5z_+^Q8U9;j|^MV؜o"b, Na<ۛk(&xH{{ 4R''ˉQ SWgtuzc/6"~l1cywFx?W-z]($ph9DVp, 5..|T Ri~@bU'|a,uz׬7(n$5Y㺤-gVY3&b2Ib:+ev!ZtHr]n5\Ti?>z&'!|I,dr]q(߮˧\] X/t{fz\<7np,^֘C#kH`/RmS]1o䮵sq3\ŨB :5\cgEK%ka>@/MS|Ie$˸{JU#ޭrCg4eMK ~Z(g?y7F޻Lnx0t= |VsȺwO388(^ E$ k%U<-,XLSTxj2f@OO%" AV x4ii; tvMWP/r1'YPGQ ﾢy v:ڽp*<9:jPJ%75W]27FU_fU0oa[n",vNJ5k:KsUi}վ}>#WBDR=[@`ͽײ+2 Lxxcx'  LmWN=9>P剧AɁA\܏>&j \# fhb0!\G͐ ]F,'2 Qk~m)+i>V0nljM"g{&АX&VzIxzMk4T>[U)pxɳI~2t5s&V: }]z'S ~R 2\j[_#({B va\E:o?m—'Hg>DS#pGѺ`M05ahy[%{ΫzϞ)oTlgU򶫸PJUWG:1ahv߻pgbnY<;̏ ^@0~҅ݮ Xnl2r> _-ʒm*MjK aYlz+O<)7sFi GoА  ߅ZN}${۩y3餦? 3$9덻rK`>66h]@*sWKY;ϭbjyK+H:WPa(V(wV1l)&$& Pj H9,pVN `t[/b(#JR q):W-˽ֿ2>D׀W4MlW#yOr^3;_wց 򭽒'qAp;W"~pS620]--E +2:WSsh\6pwң_F7uqN^ ƍCůϬ+*/ZR x&\PLeMB;|Z .[ʼ,8Xrq-;"H#k"w> n)LTR`P?VmA78{ُcrӸAaa0)qȵ#A'y-t ՖM?5k-%G­.^/3=yt ypHmN]5s*q9 uw8!6;TGY|l6g /*k>,L(~'~ߏN]`,("5y2+}1aK5fuvDt\\ 4@*G擭uT_ww PaXLrWˆ[VoޯPƎWC4 5o &/ ̾&8SfEŝ>mׅ~$ =iHX7GO@y-"v4GUf%SLEdi[C烘zz&T-072Ӂ8-XIImúd.t 6\e uj]BB kά>䋱?,M>suxOjtre愬</w5`s84>>NJ2 Lo|.H5m.šhJ(p?  ^/JblW_ch )\BLMx'z<9(ע]~Fsn =M/$2\K3>0NP 4SiZJEUGpSkvMNM 0}Tڝ+{K!RɆ^w>xK]X _WڣL[[?ʹJe -6yЧTA Zt(IM5@YDhէRǩU4*X}  }ZN厍uszF3Z4X&<Fk8vur%:@F a 0>sP,iFN)0,>e(f`" ZL O^4>Yf'zЙ- 9PFR3ݸu9΂x j]rzʅVv[arI¢̚27CeQngdepScM\~(L2%C@8Wr:8 5ɗ+<: r_{lA{qISdZB=[yQ~“SAypcQz\NG?ǵْP܆FD:fgjMN*Nən@IW*6 yq;#v ^3 aO:tLg^Z|JUEw'h~<!W ԷXe}d>KAM5Q4]Z` ԭ04tl=n>5OTpsv3;yP lqiUm\<>{b-a,hW-[^>v^r滖"*WY, 8}NbQ(ouX yV,l3k2!缓"IBFy[)>=,[ h9nu]e'f \pnvl и`¯=pI7BhA=FTPS"k@}zpV9Ws m\0Ő gz}9V4kb%g׫O@ #Rot(I0Ω ci@ jfD Qw7} Ga|6 uREŻt=2U ?dIuU<Gk{*8ƚx;;cZ9 8*ńw]y#Z:9s,c\kٱEU$4qq4 Ot6eW^h]Aէsf3du(k)6kMEn Aei/9'XHayiYI~+j<r~/g7A j}/2V_U ]?"_W\Z 4;}g|mTLX#-/ (V̩g6`LO#c~Y2"gƴ9ef OT0^pϛGkdyhOOjpG׎K:|L(Y]FCed0ު}cҽ+pI/ARvǒ @JYbyg^*֢IzSԿ+(Q^ ^N#0[:dol94OG1so4d\RT9chlKi#e.寶 aAzO6tH쬄%2C#9D s:ާI @4?ɳ=QSGM8 E㙩w ?j%ӭPmWAUp9a 〺ۚMʫ·+(+ $,y?BV̒ZrkV pFE0InUz2V}=GWd /f-Ы2& QB@X~M%C6k7{FK N!F~b#A倗i7I0 RPnkkm2&@Ɠ-@#6n&KUŐ"e\ǎFp(:ctֲВrBj%aGoǏ5 IHEGtRΧyw[78_{pcBW#ӌf{((>b҄p*.k8sIWQ :xYVYgKbIdz׼>BTs?SnBbG"rq7 =k3B\ ]"Hݟϥ~Z|qH-PX#[_1vi(di JFg;Zְf!noWrv]ozܒ>JgXw `C%{ &`\/pp .0]tow7*s([nJZ> zwjOCM_OgHLTBES28O ~yb]4n2&B DzD.*p.y8|O_$U3`` 1W2jM. 52/T8d̚5X)rWJ\-P^w+wu] EQ,# z_39kxjIw9ڍ 8Yź&֑ GV`j+f~/<0$v,+e??QLz<8/^1H~Ip.30$>2ZnRNχܞfa| 2x\ ޻?:;],:ٛ[ބ$m> FJK *:;Kl"ڦ Dx>nbmĉ;uЕ+xi(d+O_XxNF9kαf40lsY튎| t1} _~]st7 c[C—nIIx󭪞΋ePi-AwQ;$`rϬniwqw-4F}R|7]?;; 'epS?  vG+X(>18 Jac"k;y4ĸ{*7d(buW,>?+CCuY3WJenC4jy5[쳤 [}?GKem0sOFoq?N0rS,PىLXTzqA'A.J!o2n^-N+C!;cB$aQ+ܠq§q%ѼGXfH3ΕձAy*f]tERFS}B >>^mٮ@Rwf,gXMxʜ-9QG{u\{@0$rEFg8;ਣ>1)].^<{^QV6z>*#ҊR''g^B-c![GO/yW5> (+Eɕ_ղu~p9ii`bon~ OMơIފo@`>aZz3K YOCTXhśXLQνTDI^Ws+sb m;G[-g},Fm @kN77)ߌna`ݢˍ|lt# gPoWF,>0 onu1b܍W;E_qkYRR"\zzL+/rwWϏ|f zPMpxJ,O2)78i%փ8Fs$g'Ǭcgh7Z h7?,ɉ>LN2; \eiRᣨn꼺 ()] Hb .cZ ,ފ}ԬrG\IH`-z[ʋ>LuwӕeiO?ä殇Me]m._ &sw éJnj xQcYbMkKҹG84 i10?1+"Xif/-kq}e e0"4"Scr1lU cl9iZzn,f|\2>|JatpfVڞC r/RB~1fd$sGm$BV0KstfݫHxP<=kx8{#-(6Dk|븺V"Duبs#c162`NƵ8YjQkrz1$vP*!xxn־\7QAB5;x?`PHQOFL@η'~򻲈I*ƽ|6! La&(glZOޔv`Сio+{Ԡ?(гG(-r:yG۠jOcjYqkBc\BEOJP͑¤_sK#dvy.Y9\6ĭSC Qs; ♿V_GRE#+*q >>Ij{WJƷ|)% {-gc=60I m1 ?@Lݪd\y>͛`WC{ءOIQ,29cZξ`u-P0ktevQ}shËG`?--AE;h'GDzM)_$|IWx8&i~>UpW(Kսd:HT7\g _QƫKI[PPDr7珛`ŸC"9߉),۲u4)jʐODW*1dˈ&8aWTtm"; BMB2 r?s;&SBogiX@s7yJb;Ix>!yvG :|^G=<,-*eW@ib :*_ Zg]x=@nph}C}_*X3> {lT(> r%q)9_Gy3,9hml"ҡ2U ;G~sHힲnPȣ T@w&>*,>MmߋB`8̫V[8sI5 ,v 4_x'>m?90.U"usWYݜ?sEZG_~vKp =yS4l0 M.M81TpO b iPhmr2/V'ܟ[ x0U)%=0;I}djU*reEG6^مPv'9 6>`kKv'u}u+{lqi$R*,m Zz_@:Y*qk匓}iY-nNb^RMfxKK"n`_a*zd"lϓ9?_I+ 9÷Ў E9nB>s32S"+j_lX|$ofoxF%~ mx!OMc=HV&:vq?m:cRtzt1&Mto;pR6c40 gF4Ӏ=Qj\Z^Cb;7XFBbfS}"v4+ze2f?\q>? ."Ըa&jX_㶡/o+uFF 7:P`M@V5 xM3܍41πL -NMdv?2Y拡z^;LZ&0"UҶx䎭^ /Q ] lC4GQ aGS:]TxBNݙq}rK TDyKZ]ѭScᾕ9I {P0TDžVltMd)yI4@ GőI%% 7myn˪,b0|x۸Wj xa Yaql Խu?)UӬ_ڑ #wp 9kPN౔"eU36?vg25R~h'YUY]leۜ=LzUL}=Ŵ Cswq՗3ß|xʩcH YENjNHG~iDTiM?3iU2~NݜVuqFVg+LгSE5,Rw,Cԋ;E6Sªi&&rmND#3@Xѭ *EgAuz0ii7>vsw4>%4Vs`oϘ=JCc:Q Eٖ[%.!ߙ9qvyka#(%< n[ =/kG@g=7~B3 ͦgBrmCjLOq4/5ӆ`ԧݢCحj.\ t rJ{鯇JS*e:c!ؓ׃@ mz\):`OvrY}v(ލ0wh"UHS$Q*dDj$Ū'-᜶u-OR \M>8xv^]D~QTc2HH'uYUH/SQKU'FcA봿 T0WQ!5xaas+)7H &fO }L51L=|UJ{49m{!&@ S#Fg^S+whmTc5zLxE>;ѽڢY:.mxJ$VފXu bxY͐Wٌ{YRS~}4)+D_܆R!ofnG{K@/$zkRXXcD/}8Mqq O2*;SeQ؋—C.k~W߆~cǖCE,/^"-#_rj/GdjʕE)vrnd2[5꒧DrAܓNh`i2ueNXΛDg41YҒ{ +!t!#_GhV'Dbąf[\#x9@%MUo2u, ^ms,S = c?@\svyUѪX_Q TʼPDv0s+V:^{د0İ3׎+n߀ܹj)a'WV aᗣXىaY@d1XG5VW D 9;]h֦*|]O#@mv!Ja>@9'FJIg7eAqR{qem.>w~Bw ̺~:ΕQoQ8KKjf)I3N=ҽ=4zcl{…(*N?G p3.fr[ɧTt;ShFlY;&Fxz/V3u\[)֑s M;XA.<WeR\PSl(G |Wg+Mͭ/%P z坊`1Mq=KNX|i&1l#L]4 g:& jaE%2uƭi%p_ |gN ,;wWfqfpxX9qԁjmT>E\6[}H6!/Xt N-Z%w}˥ͳi=~|z ˞8Na'{z1Jԃ :b w<, " )UN!_0ĩ"JB"Ek--G%?g Iu}g+ӼtD0vC1WFcQ(x/BgJ4x% DMiDfTV鎭UGpMHmXVz<*WR'ToG̷G *B ވR~HuD)Hjכ@3B՚ *e7?d,xl>M;tDSZx X"L5z_ߡ m34OZNq'Rc?maWf;ɉ=ph_@+}ffRl.FaC9ZaByzV7t:XEmxKr -i偢Lw >8Kȕx 8.=tvn vgs.*ԻzK"})FBu.QlC2ϮD@!Rzzdz\uGS, vKS=*VS%f 6VsaEy&ddV1IN-e/W> LCcB@WF8V"iӼ,L7Z =_5=ƨ5!6_ Kz :¯.֐d 0& GslR`Q?-}l=*"H&ߔE$l H^(e\>RR@v0@TlLf*mp=}Lz{/V(0B>\~?f5}ki5Ry5v:pqTZe2F芹߃-!|:ګvdžnSzUc}H 3V~L\h$O  _ 8}E2iHI60|, P)?QLz1f`ڲ/K!DQ]ΣY?m5NKF,6^d/7ռE̱ɰao >o-9h'5Ǎ/& 2j4tq\ş4ȅBFAw8l +T8P܈hrf qUT6",uTO< >Tc5N+\ߵ8MxXׇL!]m.mN1@QK2]wrT1Z4\g \GX"՗ÒԐ0dZ sufy?9rkɣ}&yps=kE=;~ƪȜ]5I76)9F {f)XZڿuPsԃ_b-9{osx}^L@mgsmSQ&#Bb͟w<@ \ėWj[]!4j3bj(SZ'i`8Bc@%%ۮa*,ǫBQM4iZT>,(*gIh_ڳa |[]l-HԚ".u5fra| T$S l|;n'MaԒؼؓʗ# C(DW[2Fd3#dS)_wEneQʑ9vt9P6r@_ m(6;Isdk,~E˦\-x'N\j[?yV>?>M=X򮈼6>e#rHfɬԂeWX3rN5o#eD#:zka#ڏ݄UR4񃷽'PH4yK$^ع9DƟ{HH;ǮS0Tq+m'Yp=;ik 4S hJ~"t+(E@F7U|.g+18k("4IT{׌ } ,ę @q5:?Kؐ;1a>~w)+IV,Pb16B9@5n?RWHaÙ~ѥO4p$̬I'.(5}\g cyߧr pfdiJdVa*9Bq_ 烇 ԥ4]>lIlcloi;el:]-hR%>7Sͤ%9ũ#>\W )I=dB--PGjX M0^"M=+"*L z|?)뷞5Az awXeWPke6,.<:-E )cQh\cq*E:6<#ЀdIQð$,@IIG)& UUٰ#YZ5z@;AMe=F嵄ޭz$U)Vpikv}5AC:),&8af@6)i#1\ӊ8B⳧v3B̃ ձlO {i$e?.Cn)̍Xg8\a*9 GkvOܕ#9?GMGon%Q 1E;rp*h?Ӥj򃖘?ciP,qL[+nm&V፯%?0n?;% ?f^.34d@6޴jK@v,z@ꟷ3PܢQi2 |\&+VVTM",Cy<!p,Ed\Ž?4lh&Vwy+v*)l\uי*^LQV,鲔SP$ S?L б0dҦqw{=uo-KzADb˄?p  \ Aqzַ 슣'YټGQK0K=%>}+8,=O(/3s2MJijq5yESiZo;Bh"/g1n,FM"zrݢB "o^PpCr Tӄ ud= CXx[h: J֍̊s. zYKrT囹j|]p?D{+_JBg{t٪ǛIَ[D?3JoGUq+H/>n_?O:ۍr.a%43+@Bc]lͦl/>[kw=ڸ ;,k' Qh5XKSc]^ʀoZ##K$BI'Bh; C2 .-9^Mʁktj *~YNBY]$|k\^!82EMS;T;?u%V/ ^,j%!Ʃ Ir#Tnd]0|( bҿΊ|4EiﭿkCp*B䮵Qr#9<ݐ]'Z ɯWi|3gb]EUW*rGW<{OBV!W$1 'y-47l-{ä\a%+<{=/-(^J7D҃eFl"Fx04߶&NsHF%sQtD<%UAz2ls|^KX}y>p"#LEFpjY'k c=BձG0Xm?|oS]urlJ.xlb *l0f #-i=X҂Hf-:NI܄͵'M,6oeLl9L#ʤBY:c;\_wC E6Z,@KxD4Uv3e2e97NɥO`DBT9+}ulR#׊ߡ͏L_[*y0FN[|/"oM}=0x[ lmNTyܲ'ɲDڬrsw㼃HO4Sۉms;;2Zj@|iqtfΟƮ?د{{{ׁ\1Q_!;=UsEՋ`ґl .0*u%_מi$ /tAӊ*- #+pg~7]8En] =&k)uy:M5H" dI_]V2LwvAA(;َv3a5zxOʯ]0"fa &{@k>P他nmAf3U|W=c-CPM^߱)nͥxLK=7b.M6a3s5a,QlVd$DL!^ #qЭ9;KPk]|1q[' ɫZK/I쟅۵Āmfxd5N2JX/EFK`=!?q jU2rG1\,+4H)zRc@i3m{_ˋ]1G@oO #xVch(//ecQ}岔QyLKݠOwVa_$5¢]ipI?V1>q0q% -.5AUr5ʬ/B ֙>'<`9\{p^fEaSߤ|?K$}nJV43Ga 4,q8t"iڜI.,])іX Ph*?Mv' iΣ2M}';R˛jnwmk)!D-z!.-PE!p}2Cމq{:(cj 8SM"Sx@~XMBK/ɔwvqv_oTLKƓ> ۹H {4T U~nRvgN$}TY絀rTj Sѕd " 4sѭ!*soWM׃Ӡ4٤!fR`1;x%̅}"몊+XQV .bϨ%SG5Fs|e8yqN <vA q I Yp\z}梹S0(<¦}u rqy!xoQD"(Im*4[0~ 3-FEHhWhQ%U1FO̝Aȵ|Y4FO1rvDKhNt*\VD-ϧ9?}"6 CG{`VR~̀BII#^?;faߦsjP..H`aWu k[ dW &|lt bvXpApy !?3 %'d<ΦG}*#cU Bjm` o -=V`#X<]4c#C]z$ޞ@['bXg< 7 )"h:-ćQ]^`Cjw%H6|T }I9{ោ j<m^7*#D7dR)>AK=Jω}s~uFD &Ųq ;0 )+bQMsOP|mv%Ga$Q#׵Y1.|v!K">-OS8y7:ZPHED $RWʇ]`Yς&Vt6 /}Vq,'f20Aq=,t@+5L^)4@.X ŦUp'tk3m58TO%LJ>%JJ_]urG~{+TBXn屯c>suKHmlZ/BamiEo|h=Fp!\3ǣt:b_׋/ݎInU]7I"yK'ïP41(^6kXb(0 <'4zIn 犐Zܷ} Ht6Nc[p^Sy!ؓ]ڿ *&aT?`*f '±Lqd2<QoI EϠAk2v vVĸ O,s4/'7~Ɔܧi%5=?& a̷Z48#-#POnT9 BQUShHPjS{NZ~/tl`0y Wh7P". (, 70:H oj wǩef赪b촂-fI@HD|1ޜWC[:;]sXoa ,v n&M rܓmp"77\J/N2=-Ġo^Qǒ,>f%%n0Hn)!mF "v3Mt˞F?u}.ɛ4" k{D^!Limf14+-@P䪉zd?Ӹ|YlCouߣ;58qcOF%_2y;D+6g/h-^7;f'Z7Ջ5ܻ@F] ^qo)=,FnYxs =^Iz4ⱇ_0^RO߬oqSfVg UA()#WY]st]M6җĆ#zRU -z -p_{_1bv2Gdo}Ҝ J厞y_@zW,d7pOȤ5Q)G2 Kt/=Wdzx|Iv>^\,Vxs=B}RGDfɃm8g]Xĥ'L]>(g3 'S<}L OA1i44D7GWlƉ$)o, N1a> w8,b+ p]6\x9>H:w* {@Jy7mWQqTqɘD?@q?pRH LnqZLM+ZVm4l[@ܠ $t,w;m-Ԃj2£s'l+\&L%1́(6Liwh J*25z_zX͞fcŽ@ rKXAS\.mC|1>?' uL䙰ieYNZC\K(DWIpu9:cemjndy55.2 ;yl-h۸;sFXSy;f 7̪6]"%F"~DF}]?+Z6TTO^NnxQH%ơw? @М4l()L˨-Ch[i\[on hx:ݶ9ޢ1'+^؜1ШV )xőbE Ć*Oخq'˹눪NY1$XC?\)fc4J7q:A#^(`&cQ\FBvC^rCXS- /amwפ)Y8"tŶʈ֔I,+hcq8`;+:սJ3@"OPg0#BN&Qt `";UV)@i&ޔekpɢNUz(3qȉXAƒM1ͣ< WzaH Ѷٚ6"f4%ḵD6aD Ȗ:j|X1?#qP51. зqx"]xͭ[ ;) G.41WJs18ƙ+Tԯh- ds^+|4Oq1ૄ톬\:.Fm޼\4ecxɨ-r&ZtEj®>h9uZ,jxRX\4Mg LDbp4 t"/d׮؀NF|A Q8K8l^A 2-FNrjUÔ)tȄ6L7Xygz ^m'v?b5̀N@|!'0.Xx9-iIn 2\9o':'`vkodE"+&r7+!¾@_os䃦ܻ\*ݢe;%JI֓m\ 1:aW'8pZ.*Zg2ez畊EbYlojFF.+0DC ںn0Rq.뛄W'ſX6$qU68`Ո5 7# P8V dPY4ٳ(܃hH;anq7.{K%$9u 2LDP8w_clv^c-bt&bh>n;XYx <47JxOc/HfX¹=L3I>gzV 8 ËrjQ.DRjG bͯ>#i)6u$Rb"Q'B/1g&]fRN%UYQmJuZѸifGB_]JbW[Δ`m$=ӱ4QZ d?YbWi':N!0sxwgK<3 x&>];mxlXl~ًʜm~Ϸ q΁[EJ +<\&E.QK/k* AE4O6Kv,B^6 B 5SIc|w,֮B6~`Կ$38/ΎcsՐ0?/ k x;Y"ֶhT|Qm[tbcqzzμ;Җ $*%*+ cIZ}`5 tqDy DފCUUz䂏8xhQ{Φ8@̓*dmx/p !2nk:f7dUҊɷG r0CV~PceVr\YAQJC5=%U,y9Eo`JgcA4aʈȄZ=-OjI KGFAN -=A;`0-\s:R M~sn`HlX%gfJe4PqW CJ(VYbxhJMa% L҆4FMK8 7x̔I@|X9{._=hX27T kDzϯ=Dm@0CU2 N;hnw1 P]SR=bߌ,ɼ'm6|0CD[j4(5bG/\knFx&Ʉ\q SLST$+P.۔}Gxyކ XFf+pq6DCJ4%ٲyZ W\{][Yw#|5^KhI JfƳ6 )vAf:4B oL(TV83?SQ ZI"&>Ycz@~?2jw-xc4W!ρSu-Zo3Δh.QLO -6~,ձ@}sI| aJnDwAOWA%1,~^+4!0NGjlɣ5 Ҍn2W4ȳ3npnBД$BGY)UYDs-ÂKtɗJpE19 mlCI7)#p8T_|c P}YJ~L~8 ,+I8>JQ=ZZ!^C߇Gz *1Y[ŤWUPEŧZrCLcQvFt8M%XTln;wU2(~C QyPGaFfQI~&%O^rY(F9fJ&aR,ՇCMs6r܏G Xo" 70$,Ƞ]Bx /oAVM:$R˹ 葤 \Ԃz Z>x240߆~uT<|Fz}3`EK`)\#FXvmQb3U iS:V8] 减u Y+$_WǾ-Ind?i!aB`z'Țk5PSe'٫ՑviQ&[ϧ|]qB0E!Hy =F&1S꙱\& )j^x~|<f}:ϟ>TQ?KX􊠎nzՍTP~5p "&׿ _źwNO\ 3u_#0Z. 4:b窧 4f&> wdYw]k=*+oo c0OQ1ꭤFFtÛ=\7\)a# YC>={jS\VWMXݶS3m쒯3 jh3SjFF.\x,Z=\iԩ{ ܃GSX~ y(4_{l-Q $sI=ķnz߹(T_Ai` ZH )2m]9S٧D÷*cR 9 wZmO)ilͭH<'Fl0 Hg&ԲCR&Uj^綳}V(4Kq#O8hUԱS,2 ,P)#2F1ݷ. % $~jDLeFZěgZEhB_k"CeA.0kYI]xe;bF ZmCL%*V)PsSHڹEuR5^5}-.l;U |k1̘'rlfv ~ S(ϫ0Vt4)fZ/מw ,NEQ ]%>j'Z @#!}׍h,QŦaI5Rh F5>Ub`釺HE7b|wbJ7 vk3{DeZ8z#0 ck?փ/•lw[xCb_ {vYI<5E5iVJS=#Fϣ"p |ZGTi]ÿJK\[:piJ8rs{YfV=\0-M9 Y_}fnmZ; cD,S|TJΕGbJJZrj|faգE;ר1Vfn둨,# vrSe,\lђƳ<vSybb]_ !REw|F72 m-Ti}_R*Ϗ~OBL*:H2מLRW ]Ys?אh*UK2|̄2N6^QJw{e61L\`3ʠB[}OAǯD$btnGx*4S [lS s3uim8>Cw8#_y`D&|g䄸{@>n.5^OFV#J(q#E2z#Pв/5(-2e3[\6CR0)pC -U>D:7}^" A$c8h׺Kl|w.u~>^X*rbKܿY3kme˯UxՍ]\VxMHǀBk|[]~ :/rM;. HFjFoopDCѓgHP=G. fu|o 7o0ېQղqw'nb+J.蜪>kfAt`8 f6WS3S@w@`RMx[WGíU(rls%YNRDp@!R=͐JxMh>SޫaSk+,$ ]( Ǹ_`דo <̷DAbꚶK3dDG7S4e~!擈ߞ wRm畂4#^J5l9R*jVf>#sH’_']GR4&OfB^S6}LEKA6T#4O]U?!ac:l&ZP@X7cWϻ*B9dC S6HN@ v{IEGRfuNJےS:DIbЕeVf[h\m.g4Uݚ ,>R3Đҵa3ΈyFnN>x*o_[{™v>AjcdkFr1q|Fnп< k0+f1H 1+德?1z6o#άxC3[7SexZS2v\gr9\TD_OKwsrb1bq}ᆈ#փ“]}/&4cz{biaU{%M".,o= JxB<-,;BAcuJ^j*6y]LNtf))Kyt5'1.0gjD 8("oթ,)O{^w|S&6B?w #ӇggE)?5eC$ p zY;d' ]{ľ"[x诌"a]؈[HRy^/()! ⣚13%u BjLg f>(e~d7p?׸CIûrʹ}⑺u Y \&c L8bFRԭi]He{׾ԗa_ #4,-C6nHi>qFUdD؃fp9ZWk Y xO5&B<ޠKكr1;7;Wmf =i)DOY6E@~T*h(*!fzfOj<{u?pc >YP% 5v}6sN5W+8뼭3-Nd~)ILnt^IQ7II*-#j"PwǺpIj[Jއ@EQu`ˇ+ JL3l7L?y Ap}u`0=BݯsG0Jy)xcy.Bb{yR5ipw>r.4fPKcY;ؽN({0rf+N.5FL7 /d(/xEcHQB/'䉻/4(yBee 0eZY,ICD\='AJ cӥUʑ>~r]e?5+͏PA Ik$3qw086bx8ԑ ,A"_K /l9Q?7+z#*>?ħd5jTLЇ "ZZR)= h .)pe BL,_ZV5nj$n*PRL_g8?)d`^6AP;h-zwSJ)5<+O!;Q}0vG܀Y1[`6 JLz8 7] Ta )hgw(Ofu>kQɗ$V&k! DËV'x8w6[J8+Ǹ4Iض#ӷ"wF,, 9[]%MO4'`7ve~!\lɻ]/4 =＾L|2xJ"XA )WLpN;8Xq ^ 5swFXj!_`n,E<7QA/ @NLCOWVbwog9 }+En `=rᤏ 2;lNM {3VLcߞr 9G "Yݚ1?E& ބ3RW)?0 .u.YIGB)C-Aj(?à (pӭU~8fm !؀vT@vP/& f|ŻmI-WLqxRkfPՋ* 5)-s>xd ΍<_0j 43ⴃf%G橢'c͝eT-^ABu l6əmX" \VOB_-HWh&\DVCqOR}<=GS ^,cIϠZu rqyX̹vdF]K0&rwҹ"X119LPҨF@ E_̮V:O!b`+ٜbFF'ܮX8HyF`٩L}V<Һ 8ߤp3U'N4\}D>:NTMP%$z;x-F/D9N$x.*ڬv`MJy븻G@ KZe%/l%>i}XXt1WcZ^(aDQVգJs|"ODL -[X,..>*4\ vVj`1;e_D5u + Fy礷V7Mc7D2:(^Ee DiJb? /JY3ad>VOyWKAwerXW`gyq,5Ç'[ \>u>jez%{L2Y7A[u=’Npr?4м|3Wi/n 3EyU67B#y? 0ٻDwc@|̏QN2HchzbR ݛ( И=:91 d1*9mDjYu=&ח;8(* :Zދ-Хb]D1ɮi1UmzJŋFOs(2EMz@{  .= YGw  .$Y&)I ZSw 4$_&") PR  "$&.02468BDFHJLNPRTXZ\^`bdfhjlnprtvxz|~ "$&(*,4.0268:<>@BDFHJLNTVXZ\^`bdf'   3  8 C [   > HMQP#U' 5z^ c^nsY] } @bN->zF* \%Jx?   *T-; . D h m z y j \ X m     " ( 1 4 : @ I L R X a d j p v {   # /  u*  K  .  0   f  k Y b ? # Z  Y ?#  S  W F   W'  2   :! g( ' . W0 2 2 5M2 &:? .H lO H` l m n o Yp p p q r r #s s s _t t +u u v v w w w 7x Yx ^(z }  t  ( D ` | 9 K | & B ^ " h R q ) W s ( n  _ ~ 6 [ x  ^ * I  & B Q ' n  u y ~ 1 g  ? ; T  x | u {         ! ) , 2 8 ? H N Q X ^ g j q w }   X    \"   Y, /#   3 H x    QX  ^z > B x( ?( fo4 d;G NM !W ^ b Hc e mCe p mu u ,w i z | ~  w  }  % < R  K o [ j x  i 2 P - ; 1  k m I    + B ^ ?  zl G F  xS `B N i5 2 c='#j#`$$V%l&'?()*/+,7.N2234s44!5 6"!7; ; =>>L?@zB$CCCCD"D&D+D1DPDDD'EaEE6FTFG#GhGGGHHHIIIJDJbJK(K|KKKKL.LILdLLL>MMMCNNNKOPQTS}U2WWWX<XZX Yw\{\\\\\\\\\\\\\\\#]J_bVe)fjK(k-o.u{{ K&  =()1QLt, FdF*Z_&)tcBg!]jnuw{$&+/5Zd~PvHf=Rh#gk#'+/77%cejotw|"&*.5N:yj2e7^v}sv}$'-4=@FORX^djpw4$#W aK    B'0T1@4L9x8Ao-H?NNSQWk/]$aMe";furu3y@!q?.B`I"B&1pK:v.5RW!:"?Li;%!%Abz2&9-=  v   F"  !"#b$y$$$V%% &&'()*j***|+#-00!1q&197@O@&@D+HI IIII I$I(I.I2I8I<ICIIJ*JJsK LkLLMpMNN NNNNN$NNWO%PPOQQQQQQQRQSTT7UNXQXXX[XaXgXjXpXvX|XXXXXXXXXXXXXXXXXXXXXXXXYYYYY'Y*Y0Y9Y<YBYHYNYTYZYbYZV[[\\\B]2^"_`a&bDccc3dd@eeeffIgghvhhijjj_kklmnnopqrstt|uu>vvwiww&xxxyz{|}}~zb&O@1!-7W"o_YA{. 6^N>7Y RGNRWZ`fmvy/T\4TtE06PUJP#Z8Z6 3P?,}w}%W5q5IvhH5`nfI WQ0  ")/5=AGMT]`flqz|"=k, ] a w  4[A = |"5!%# (0+ ,).9(378/8@7B@G:H#L\O(RW&[XG`gRgggAhJii jk@lfmm,nInnogooo@p` p\)ruuvvw;ww x~xoyy-zwz{{{{{{{{|| | |||||#|*|,|0|4|8|>|W||}n}}z  t e & " vYp n "+.4;DJLPXZ^d&f/,1 $;' %?&&'C(3))l**(+++++,-&..;30"6,%: >&@wCCDD.EEEEEFFSGGHHI!JJDKK!LL MMMoNNcOO?PP QbQQ-RRR]SS-TTTUViVVW2WmWW XX*YYZZZb[[?\\]{]]]Y^[^_^e^g^k^q^^~__5`z``aEaaabGbb ccddddddddddddddeLeeebff#gggdhhhi[ii^jjkkk\lll^m}m4nnno o ooooo%o+o@oUowoo p|ppjqqq"rrrr5ssvvvvvv#v)v/v5v<vRvdvyvvvvvvvvvvvvvvvvvvwwwww"wwy9|m~5!9'6 *!Fx;3,)#b;2`%z |Ji!45d  E    T   >Z]dkory<`I:?T8 {!D" " $$)%')+-"/3 57%9$<@eAA9A &GJAM OESeKSQ;Z__&`/aa/aff higjk mZnopq9qqqWrtrr0sPs%uw)x4xxx&yyy[zzz1{{{V||+}J~N~R~V~\~b~d~j~n~t~z~~~~~~q; MmBeb'%  %)1:>FNV^fnb q JOP  l7KLk$]zXu+@sXC wq d!5T Fb"5'\$% !3N&K@,T3 &#("%-&&&(*$..+.5+6@::;;7D0J0RSTTU:U`UUQV2WLWhWW[XXXlYYZ>ZeZsZodo+qy*z |1J$*Gmdk/>S"td@_b sGkjn*P*HfaQHRdWq));9   %ENk(<A! y <!!H"Q#n##&;&Y&x&&v'((+){))*++`,g-m*-67P778Z 9A<<<@==>0?2?8???A?E?K?Q??? @&@@ AhAA8BB\CD~DDFFFFFrHIJL!MMTNqOOvP%QR SSTCU-V-WWX^YZk[-\]]^,__`ga~bcggbhhhh]i ilnNssucvv]wxy {0|O}l~  `   X (?'FNF@Oi,%s8Mno %)-39=AG64AeCC w>l.1N]]#)?+qgjprv|5~P5E`9qIm_zSGJPRV\rI|M<iI 6Lawz17%C&   X t>6FF  _!!"q""# #3&&'@()) +,-t...I///X0s0081112+2F2222 3-3H3333 44445555K6vxwwAxxfyiyoyqyuy{y}yyyyyz| } ~ k"wHPo, PoD  "$(Ji&0',dSq%J{K7|e\awC-Cp8dNw1z?p3U!)0D6ghMTW]cipt|~ Pgg v _ /MkL;q1NG^M]ONn1~   _   w  P   l  zbGXiz0"$(0NjUSBZ W  !U!!!'"m"""5#u###Z$$$,%^%%%&&&'`'''#(c(((6)|))****+++X,,4-------..h.BO/O =S\B5.T\_bbeehk& mngqsavx y{^}c^&.M;+>( M  ' I%-;owBa w tIG[>\Gbv@ &Aa4Rr'|*Gdp;Xt?3O> Eb}=U6N/)]}_w#9h[ ^ z     L    6 R n      3Oo#!AA 'B^z' G  !%?%]%{%%%%%&/&L&j&&&&''($(@(`((()) *&*h*-++++,,$-m----".<.\... /22333R3p33333 4'4G444t55A5nBBBB5CUC DHHHHHI0III]J}JJK(KKO O@OOOkPP2QLQhQQQQQ2RLRlRRRSWlXXQYY)Z}ZZZ[[`+`K```van3Hh=t(2 a6Vn4 ?d 'Gu7Pm)Ee0=I1Q{j.Jf;ly ,Z_6 my g    .t &Ft=\{2Pn>^4lU,Ji!=Xx-k}6Us6V Fd)Cc~/Z  8!g!!<"""#X#x#-$$$$% &9&Y&''''*(J((x)))h**+0++_,,,-%--T.n..D///00?1Y1y1/22223&4U4u4445656U6 777789999I:i:;>;u5;A0A_AAAAPBQR5RURRR SUU V*VGVVgWdYYYYY.Z Z\^z^^^_.__%`C`a`~`````Nana%bXbvbbb c)ccndddddde6eReneeeeeef4fPfmffff g(gDgdggghh#i8iYiǍi#?\y )Tt#?\xDd9qI- =q F (Ee2R<m+^|09Vv0] @km-JeoDt j+\LjV.K|:mUj c8k4T )`Yy._y!AMm +Vv$>^ >\z (Dbo k(A n(9O b  -     w  M m    "B3=2fOdUt4Pp4##$"$x$$M@%23#3C333p 4l66666D7 8999::q:= ;= >)>F>f>>>???@"@y@@PAAAAAATBtB+CwCCCD,DIDiDDDEEEF#F?F[FwFFFG8GXGGGGH7HHHHHIsIIJJ}JJJJ.KNKL:LXLLLLM9MM#NQNmNNNOOO]PrPPQtQQQJRdRRRS0SSSSuTT UU@UUW\q\\\]2]R]]]]j^^^___=`V````awaaa b5bVbbbUcucchhhiei{i5kZkvkkflmmmmm.nnop5pQppAqqqqqrBs\s|sssttt+uKuuuuvvvw|www!xxxxyyyyy zzzz6{~{{{{||}1}b}T~2R9<J(.\/Lj=l`" >];RYue|*RgHa:bQ'[Ё%A],2R`"$R*     :ndyY ppnE&y    !-! !$$$,%L%&!&~&&K'''((())*9***b++,!,v,,J----L.l. /////C0c0111112Z2z2.3\333P4p4#5U5555 6`664M7BOC|CCC D@DDE"F;FFF G%GGGGHkHHHHIpIIFJ"N<NpNNNNOOOUPjPPPQQQ9R__`4````vaaaaabb%c:cccZdzdd&fAfafffgg h5hVhhhi/iiiZjnnnnQofooooRprpq,qMqqqNrnr ruuv1vvvvvwwwQxfxxxyyyz`zzzz{ {}||U}}[~~@$elIjGo#m+L \D-Gg)>_Ic3R[] xRX=!biFgDl j(IQ9"<\3T>Xx(G@mv$D'RrCEG{(q 8Rlg|R .@:Vs8Sn3Pl 4l118X Ea}X8TnMJ__ 0 P      * J   %  7|1 |"g9+nEo   1!^!34566*7J777788$999Z9ʇ99QQQQWRlRRRRSS.TCTdTT/U1b`bbbbccBdWdxddfffJghiWkkp1pQppp~qqr(rIrrrss>sssitttttuduFv`vv v O m  U 3   CK[  4HyMQ@UG Z[& ! z]cPnsG G }4t 2N H->lF" H !>_wx5\," :$e&() **< -3 ,PW ` d  ? PC(Q_.R$E  3Qe  z g "2 m f p u w Dx   _ 6 l C 7     ] t H  %  ( zu I  O  4>>DECFG HHI>JQJ5KW6XIX]<k{ YSBpU,_>1N fO! a 8Y.%*!J] Zc{d en t} Df #D a E Vs A @ Xm:oMpwK|}q++ .!C&W W]~ ^6bbdg~hhkvlkmbowq/wo W" I $ARSfp*r=sxhz ~ZOY>9be B'; T UzUVWuX0ZXZrZMX( U x" sS n!%#%&~()+6779<=?@@A1CTDFLgoh i5f^ @Zc6BRzli   l!.m/201122334445cwoxy]Q`EW (t] Z+  w% Z!f y"@$8%m&'*)) .pk;(  |;O K*Qb^  vl;&y Xm3aW     * 1 8 ? F _17  %&''P(()P*s++---L.. 27445eBBECqH IImJKKN0OOPPPP\RRWWWZ[_;``$CX-"qFzv7 I}#U-%9A1&vdoLhb6 N$! ho F7SC w!g""h#X$$%I&9'':(+))* +,,-.~.p/00i1[223e445E677799Y:.; AoAAQERRU~VBYZS^^_```^aObbcd%d,d3d<dGdRdYdcdhdTggh3iHi dT)4<DlU-BYU f 0  lXHChdesaDiU1]fN\fzr     ]  22av_tE`#$$2333J6(79U:=V>>?@@zAAdB^CoCYDDEFGHGG'HH IItJJ>K/LL)MN}NNOmPP<QPQdQ S SSSTU/U \\\-]B]]]z^ ___`aaa0bEbbec7hhhui%kksmnonpzqqrlsst&u;uuuvvwwNxx yyyyzzn{{|N}B}%>,t -} KGo>RWnDz? o{?&0:DNi~ tS~r  !Q$$<% (())**+,,t--\.K//S0C11j2U33`4J55p6BC0D>EREfEzEEEE IIMkNNN OOePzP QQ}_`$```aaqb5cJccjd fQffg0hEhhii>nnnaovoobp'q<qq^rxu v!vvvwwaxvxyy)zWU{W9Ns<&TRx L.Chw!n4!b !+5?v w SV 8$| \H8=Zo+ @    :   '!^)~ !333%7:777849I9,QQQgR|RRS>TST4QapbbcRdgdeeeeAppq#r8rr.ssttu}v+++                          + +                                                              +                    '     '                              '             '     '                                      +                '  '                       ''''))*)))'' )))''   '''''''''''''''''''****)))*'))* ))))'))'''''))'  '  '  ******************'   '  '''')))))))' ' ' '            ''              ''   ******  '' ''   **)**'' t ~ } n N \ l  E  y r "    X  <   5 : )   F    -( - 0 1 g> G QN 2_ l m #n .o p p q r r Є  * k Å d Ԇ t Ҋ  i ݏ F ǐ T J   b ˕ 4 )  0 w X Y © \ B * x 5 "*##$%.&')O**X,-1g223556:;<F>-?k@@B=CCCChDDD@EElF;GGG6HHIIzJKKKKKL2LML|LLMVMMN[NN ODPQS@UVqWWrX[_Nb8efjDoZt z~ނ%Vf<6֐?q}՞^Dsz?~]<6l:-|~U';b"M-SJ{8tCukm  &039@GlMS?V~\``d7ruxyՀsyb٢;[L\ͪ:k t"Sn'X5KiIBwb u@l{Qf\CE !a"K#%$g$$&'z(m))*[+N-@0g7^?DG1H[IBJJKLvMP|Q*R~S=UhYZn[[0\\\Z]J^:_)`4a>bddXeffagg3hhhjklmoopqrstuuYvv*wwyyz{|~~ }Aj[L<Hpz\Ì I:+'OyiYݗ:r˙' XGnЧt,'N_JPįh54dh;r+sO˻L-kZ>pN,N1aNy $lI Nq5v  ( e  |?4u!"(+f,i.27>88?7GMKNQV_fZh$j3k[l1nbnlooruu v"wTww#xxyFz}zo||}N"tTԏce' ]b/K&.[ j%&&w'(().***+,-.259C>?,CDGE3FF6HHI:JJK:L$MMNO|OXPP"Q{QQFRRSvSSFTTTU'VVVKWW%XXCYZ [{[[X\\(]]]A__ `M```a]aaa_b!cc+edeef;gghitiiwjjkllmMn/oDooo%ppqqq:rrrrMssy{N~{~>\_Ĝ=qbCTKy>>MKO 7 aF elA  !"#$&(+|-q/35i78<@AA\FIsLwNRdY^?`eg"h/ijk(muno!qRq\rrt=wwMxx?yyzzz{ |o||D}~~~5ׁ0 94 ~>&93H`Xl/gدh ڱӳ0\d+b]D4\#'}:mK{4s3]PbE!*%*-$59CIQS5TT!U?UUXVV4WNWWXXYYmq`y3O0%l̬W;ӱx{#-Lڻ9l̼15~.MC4Mn| S  0jSA7L< !V##%"&@&^&?'((*+,G-h66878;<<=>W??? @8AAPBtCDkFFHIJLuM4NFOOPPPQRTUUWWX3Y]Z [[\]H^^_d`a>bBc gghhitlnrishuuvhxyz{| ~)Ne"D2Wxn@gaQX Ȳ(_Ǹ$=ݹ6~\\"W56vGWC);Q3a2kae0Ta Ov  ".Qa3*g  !\"""# &&M'(()*Q,p-*.../\00Q11/2^22213`3334556O6wwwxqz | ~׀04Ʉ:F4’ǕݘO`S}Tj.ȿWr~@E[&cO,{3[*F\Q}g JLp:B]3O8+)0 8"w"GdSIT_w7f2Rg'J6#   x  0   H 'm+kZ,/ o  '!m!!!?"" #M####r$$$v%%%%&&&2'x'';({(((N)) ***4++,q,,:-.<AS\-_Nbehjl2n"q{svwyz}a+˂sYq=@fˉ1Ê̌Unחg!WݤF $ >F0wAqz1%8a astK|7zZ*yl./Liq#@]yF8Jg+?mUG:a@m7 c  )  R      : W r     8; Y+Fb~_ $&%D%b%%%%%%&4&Q&o&&6'' ()(x(())**4+++,,(-T-q-----$.t..222383W3u333334_445EBsBBBmCQHHHHHHHIIJ@KNOXOOqPPQ4QPQlQQQQQR4RRRWVXX;YYZgZZ+[__`c``IpUˆ@+Jԉ#b/ęÝ_5)U-}7i߰UPIJi V}̴q2NBpDb Cl8+P8By^4}#Ba7UsvL1On5 %A4(;Zx)nKi+{iGa$  !O!!C"""##4$~$$$%%!&q&'_'''b()Q)z))p***H++8,v,,=---.V..L///(001A117222333=445556m67\777r999 ::V;@AGAA BQQRmRRUUUUV/VVXiYYYYFZ3^a^^^F__*`H`f````aa-b]b{bbAccsdddddee:eVeseeeeeff8fUfqfffffg,g|gghqiц 'C`~ӇA'C`||Qy'8`Ң-}ʤj$3cѨH>ܫHޯXΰr)[ҲIoó߳2Nj1Kx'nt!Qo6^ź3Brqս%?olAg5c}Y./C&v%Ca-Ig$XHm*|zmWt"8#E {  8   0ZOwLZy8###:$$22 3[335q6666\7:9999::==>.>~>>???:@@XAAAABB3C~CCCCD1DDDEEE F'FCF_FFF GpGGGGOHHHH4IIRJJJJfK L?L]LLLQMM(NVNNOPP Q{QQQQ%RLRkRRRHSSTXU[1\Y\\]^^3___`?`]```7aanbbch]hhij:k_kkDmmmmmFnoop:ppIqqqrrsDss tttcuuv>ww)xtxx1yyCzz>{{{|||}z}jNQdݳT*Rŵ2ʸFdں4QoɻU̼:%Cb=]yn$Js)E4eD`0x7}m0Z. Z   X  d  3'303/R ~  E!.$v$$$d% &<&&''F((()*Q**h+++9,,P---..'/t///0{01p11112243344)5o555#66BBfCCCXDDEE$FBFsFFFFG,G]GGGGGHGHmHHHH1IIMM$NNTOOP2QQZ___L``a$bbscddf*fyffgnhhhGiindnnooppeqqrUuuuIvvNwwx/yyuzzzzl{N||}}~~L+  @ք v >шEҊ2g&Ȍ/w֐ K:sr̕iK I(=ӟ s;ΣBϥ/d$tl˫@ /XNz\+HsJu!@4a"<Vp't)3|">[w <Ws8Tp^kI8p^Ie <X7,h   b = OI$>lQF/ I!l34455666b778r9QiQQRRRS|TUUa bHbbcddeoff4ghi@kkopippqarrrsVssptttt&ukuvHvv % + . 6 > c h v u f W S i     % + 1 7 = C I O U [ a g m s y }  p F  ) , T a e S ] :  { U S , 9  M R @  Q  -   4! b( ". Q0 2 2 /2 ? ? ? xH H H N O O ` l m n o Tp p p q q yr s s s Yt t %u u u v v |w w w w 2x Tx Xz }  n   # ? [ w 4 F w ̓  ! = Y ք  b L k $ R n # h Y x 1 V r Ċ  Y $ C ! <  K َ ! h p u ڑ ߑ z Ӓ , V c ~  - : ˖ 7 O  t x ~ Ș  p ݙ i v        $ ) / 5 ; B H N U [ a g n t z Ķ ʶ Ѷ ׶ ޶  S r  } X T * . C s    J  W 9  s( ( _4 ]G M W ^ b Ac e ge p hu u w cz | ~  r ւ w 7 M х 7 > E d h T ׈ e lj e r ۋ d ƍ - J ' 5 ‘ + d g ڔ C   & = Y 9 t r Z c 7"d#Z$$P%f&'9()*)+,1.H223 4n445677;;<>>F?@gBtBCCCCDD$D(D-DKDDD"E\EE1FOFGGcGGGHHHIIIJ?J]JK$KxKKKKL*LEL_LLL9MMM>NNNFOzPQOSxU-WWWX7XUX Ys\w\{\\\\\\\\\\\\\\]E_bbQefjFkooottuz{{{{{{F  7"+ŋƍKGo֑ȚA_A$SXé$n\߮;bXfjpuy}!$(-1U_yKqCa8 Ncbg!%)-13!|`cglqty~$(,0J{5te-a3Zqxpsy} $*07=CIOU[agms0\       ''''0000N1:49qAiH:NNS Wd]aHeforuyk=[C<ɥ!+fjêߪF4bip(ӭ׭")0LRϯ֯ݯ ưʰ 4ɱбױIJ9 9@Gc5} |t37 p{@  !"#\$t$$$Q%%&&'())e***v+-0001k17??J@@D'HI I IIII"I&I*I.I4I:I>IIJ%JJnKLgLLMlMNNN NNNNNNROPPKQQQQQQQRKS}TT3UKXNXTXXX^XdXgXmXsXyX|XXXXXXXXXXXXXXXXXXXXXXXYYYYY!Y'Y-Y3Y9Y?YEYKYQYWY]YZQ[[\\\=]-^_ `a!b@cccc/dd;eeesfffDgghphhijdjZkklmnnopqrsttvuu8vv wdww!xxxyz{|}}~t\À I:+&2QxhXS;u΍( 0WG72ݘSלNCJNRW]cipv|͡)OͣW ۪/Pn@*1ޯKݲQҴDKU{и3U0,ͼ I8'vpxzQ0j /DoaA/ZgayD}RJ* &,28=DJPW]ciotz~f X ] r  0W<8w/!#(*+,.33788@0@GGG3HKKKAOHOUORRRRRWWWWWX`fMggg:hEiijk9lammnn n'nCnnoMoTo[obo~oo;pZpVrouvvw5wwxxxjyy'zsz{{{{{{{{{|| |||||!|%|*|.|2|6|:|R|||i}}t n^!pSjj %+17>DJNRX\`!   %9&&'=(-))f**#+++++,-!..536*6&:>> @rCC}DDD(EEEEEFFFNGGHHHIJJ?KKLLM|MMhNN]OO9PPQ\QQ'RRRWSS'TTTUVcVVW-WhWWWXX$YYZ}ZZ\[[9\\ ]v]]]V^Y^]^a^e^i^m^^y__0`u```@aaabBbbccddddddddddddddeGeee^ffggg`hhhhhViiXjjk~kkVllllXmwm0nnnno ooooo!o'o"B"8#?#L#h##& &&6&T&r&&&&p'((((&)u))))*++++\,c-i-67727L77778;9H9U9<<<<<<;====>,?0?4?:???C?G?M?????@!@@@@AAAcAAAA4BB=CJCWCD`DmDzDDFFFFFmHIJLMMONmOOqP QRSNT>U(V(WWXXYZe['\\]^&__`aaxbcgg]hhhhXiilnHssu]vvWwxy{*|I}f~ÂZ~ԋQ̎#9ُ!ڐAH~ߑ@~+8Jeȡ'!o&3ӭrŰҰ߰bhuHƳӳiڴj ж !%+/59?C{1ҹ.!.; _#0==r|8LYf(,HWfmzovY!%:'|ldglptx1zL 14A\4slDi~ [vNDGLPTXmEwI8 dD 2I^sw}2}>  T n~80@5B  [!!"m"" ##.&&';())+v,,--`.o....D/y///G0T0n00&131112'2A22223)3C333344444555G6vrww;xpx}xcyfykyoysywy{yyyyyz|}~āfsrDLj'|ч K]j 3@ }ʸ#Eݾd"+! '` Nl FvF2w`X\r1> '=j2^;Hcr+u:k-O o#{+>0bbIPTZ`flpw|zLb bqZ+HfG6_l-J=CYzGWJ8{H i+x   Y   r | L   h  t]BS du+"&*}Jf QO>V S   !Q!!!#"i"""1#q###V$$$(%Z%%%&&&'\'''(_(((2)x))))***+++S,,0--------.].c../=/==J=ABNB/T\__bbbe_hk mznbqs[vxyzX}ր݀ ^X ň(G5͋܏ n{ŖҖ&9ܜ"H"̥ݨC߮ '5jqº<[ĽsǾpDBV9W =C]N]r;z!=]Nn"pw %B_|k6So9z-Kx}9?]y8Q2J + %Yy Zs4cVY v     H g     1 M i      .Kk=#>Zv# C  %:%X%v%%%%% &*&G&d&&&&''((<(\((())))*"*\*`*d*(+w+~++++++,,-<-h-----.8.X.../223.3L3k333334#4C444p555iBBBB1CQCD{HHHHH I,IIIYJyJJK$KKOO`\`y`````Jaja bSbqbbbc%ccjdddddde2eNejeeeeeef0fLfifffffg$g@g`ggghhi4iUii;Wtɇ%{Pp;Wtʊ@`5lD( 9mҙȢ"Aaأݤ.Nݥצަ8ei&Yw ,3Rrɪҫ ,Y<g ?{ -iֳ)Fa~ɴk@pƶ`f 'TXGeQ(Gtx5h׼Nfͽ _4gڿ0P%\Uu*[u=Ii'}Rr :Z9Wu#?]{ j,f#<i#4J^~ )     s  I i   >.8.b:K`IPn0Ll###$t$$I%233?333j4R6Y6`6g666664787<7@7 89999999:a:e:i:m:8;=>$>B>b>>>????@u@@KAAAAAAPBpB&CsCCCC D'DEDeDDDEEEFF;FWFsFFFG4GTGGGGH3HHHHHIoIIEJxJJJJ*KJKL5LSLqLLLLM5MMNdSdtddeffEghiRkkp-pMpppzqqr$rErrrrs:sssettttt u`uuGPYajs|’˒Ӓܒ'/7@IRZclu}ē̓Փޓ"+3;CKT\dlu~Ĕ͔Քޔ %-5=ENV_hqyǕϕו $-6>GPYajs|ɖіږ (1:CKS[clt|—ʗӗܗ"+4=EMU]emu}Ř͘՘ݘ %-5=EMU]emu}ř͙ՙݙ %-5=EMU]emu}Ś͚՚ݚ %-5=EMU]emu~ɛћڛ )1:CLT]fowƜΜ֜ޜ(19BKS[cks{ɝҝ۝ )2:BJRZcks|Ȟўٞ "*2;CLU]emu}ȟП؟ (08@HPX`hpxɠѠ٠ '09AJS\emvšΡס %-5=EMU]emu}ɢѢ٢ "+4=EMU]emu}ţͣգݣ %-5=EMU]emu}Ťͤդݤ %-5=EMV^goxå˥ԥܥ )1:BKS\dmu~ȦЦئ!)19AIQYaiqyɧѧ٧ #+3;CKS[cks{è˨Өۨ #+3;DMU]emu}ǩϩשߩ'/7?GOW_gowǪϪתߪ'/7?GOW_hqyë̫ԫݫ'/8AIQYaiqy¬ʬҬڬ #+3<DLT]fnv~ƭέ֭ޭ&.6>FNV^fowîˮԮݮ #,5>GOXajs{¯˯ӯܯ #,5>GOXajs|°˰԰ݰ (08@HPX`hpy±ʱұڱ #+3;CKS[cks{ò˲Բܲ $,4<DLT]fnv~Ƴγֳ޳"*3<DLT\dlt|Ĵ̴Դܴ $,4<DLT\env~Ƶεֵ޵'/7?GOW_gowǶ϶ض "*2:BJRZbjs{ȷзٷ'/7?HQYbks|Ÿ͸ոݸ&.6>FNV^fnv~ƹιֹ޹ (08@HPX`hpxȺкغ (08@HPX`hpx»˻Իݻ $-5>GOW`iqyƼϼ׼߼ $,5>FNV_hqyɽѽٽ !)19AIQYaiqyþ˾Ӿ۾ %.6?GPXairzǿϿؿ $-5>FOW`hqy $,4<DLT\dlu~ (08@HPX`hpx (08@HPX`hpx (08@HPX`hpx #+4<DLT\dlt| $,4<DLT\dlt| $,4<DLT\dlt| "*2:BJRZbjr}&.6>FNV^fnv~ $,4<DLT\dlt| !)19AIQYaiqy #+3;CKS[cks| $,4<DLT\dlsz "*18?GOW^fnv~ %-5=EMU]emu} (08@HQZbkt|%-5=EMU]emu} #+3;CLT]dkrz %,3:BIPW_gow  (/6=EMT[bjqx "*2:BJQYaiqy( 3 ; ` o z y j I X h    " ( 4 : @ L R X d j p v {  | - j a  y V Z  ? #  .   !  j  -  k r ( - 0 1 2 N> ? ? G }H H 8N O O _ k l n o p p q r r #s s s _t t +u u v v w w w z b} ~  t ( D ` | 9 K Ă ҃ & B ^ ܄ " h q W s ( n  ~ [ x ʊ  ^ I & B Í Q ߎ ' n ݑ ~ ג 1 X  / ? T , | ̘ u k        ! , 2 8 ? Q X ^ j q w } Ƕ ζ ڶ  t J %  C A >   9 s' 3 F M V '^ b 1d cp t v y x| y~ ] %  % R < C K f o [ ވ Ή g x  ˍ P ď - ; ȑ 1  m m I    + ^ ? @ C )  _  "##~$$&x')6**?,-1N2234567:m;<->?R@@iBzB$CCCC"D&D+DPDDD'EETF#GhGGHHIIbJKKKKKL.LILdLLL>MMMCNNN,PQR(UVYWWZX[\\\\\\\\\\^6bb egfij,oooBttty{{ {{~łg  =M#Ίhij&iXdF,Za&veD#nw{&+/ɿT"df=h##'+/J ejow|"&*.5:yj2v}v'-4@FRX^djpw4[*\RT       &'''/000o38@GSMS&Ve\`Gdru_yɊZ`I"Bѥ&3ChȪgnǬhխ'.5Rԯۯ[Ȱ:αձ U²"?>Eʸ2P0)}^I \'Sb8MC*,n j!H"2# $b$$$&y'a(T))*B+5-'000N7E??DG-HIII I$I(I2I8I>?CCD.EEFFFHHHI!JJK!L MMoNNcO?PP QbQQ-RRR]SS-TTTUViVV2WmWX XX*YZZb[[?\\]]][^_^g^k^)_~__5`z``aEaaaGb ccdddddddddeLeee#gghhi[ii^jjklll}mInno ooo%o+o@owoo p|ppqq"rrrr5ssvvvv#v)v/v5vsvvvvvvvvvvvvvwwwwwy{*|6~cf&CʒFlȦpyʷ$mgXI*;2`%%|ig426 y  HB]dryMT)  k!!"#$&z((t+c-X/{35P78w<x@AtACFFFIpJtJZL+M/M^N|OOOOR#S*S1S5SKY^&`ef hiijkm\noqqqq9qBrIrPrWrtrt$ww)x4xx&yyyzz{{V||@}N~R~V~\~d~j~n~t~z~~~~~q̀ jwmވe΋%  ُ)1>FNV^f.0gH@TOP±DKkV]zQXu+sC qd!T?FboE8I,!%)y- 55590:4:CIQSTTUU:UUUSVV+W2WLWWWXXXlYY6Z^ZmnnoqGy6k SǬkخ>۰"t_b s޶@Gkֻ#dj-cpfIA+F5_Uc~ ' 9 w   +Q=:>Nk('+G,0#d h y w!{!!@"=#A#Q#n#% & &&;&Y&&&&'(((()))++++C-g-d667767778=9J9;<<<<===>2?8?A?E?K?S????? @@@AA AAAA8B?CLC\CbDoD~DgFFF.HIJzL]MN.OO8PPQRTTUVWXYDZ[[\q]/^^_K`a%b)cfghhi[lfnrPsOuuxvOxtyz{|}5L +>_ڌU'FNH-:O@ݥ(խvðǰ԰fjwijȳճ޴)-3=AG8ع#0 e%2CC ǿ>N[l01]ko|txC#?+qjrv~769uqISJRVrI|M<iI/[pz7^  t8H7O  !X"""#%&5''()*9,X-....{//I0X0s0(1811+2F222-3H333l4555K6vxwwrxxiyqyuy}yyyYz{}{"Ho.0 _5ܖŘ7Hסʦ;e<ٱRռi?Zf',Wq{K7|cw3C-Cp8d=N13W!)D6hMW]cit~ gg v _ /kL;aq1PAG^M<Nn1~   _   w   z$(0jUSB W  !U!!!'"""5#u###Z$$$^%%%!&&&'`''#(c(((6)))***+++Z,,6-----.a..2/<?=ACBS}\__5bbbpegjln qbsvw{yz}HۀZ@X$&ˈM<pUǖqN՚>Ĥ{- %%-ص^(XԻa-ɽ w˾ II[\AGdvB &ahr)u|*Gdl;XtA3zEb=UP/}$_;h2 ^    N k     8 R p      3o#A 'B^zG $!%?%]%{%%%%%&/&L&j&&''($(`(()))) *^*b*h*/+|+++++,,,&->-o-----".\..222333R3p33333 4G445@BnBBBUCLHHHHHH0IIJ(KNO@OOmPPP2QNQhQQQQQQ2RlRRWTXX9Y|YZcZZ[__`K``3nۄh=(̇2Љ u^* G$P)eۮޯ3Qǰ=LiݲQ @{mӵ.J>l|,]> Y`g &qxK =t Fx=\{2Pn^4,Ji!=x0u6UsVFd)cS/]   M!!?"w""#x#0$h$$$%%&Y&'I'''J();)x))k***0++",t,,%--.T..G///001?1y122k22233;4u44556U67F777n9999i:>;@ACAAAQQRURRPUUUUUU V*VVVVVXOYVY]YdYYYY Z$Z(Z.Z.^\^z^^.__(`C`a`````na(bXbvbb)ccqdddddde6eReqeeeeeef4fSfmfffffg(gdgghYi͆#?\y·)t#?\xd9v [͢ (eܣŤRܦgm.^|09v׫0گ@n%C1mݳ0Jh˴Gtʶ#djV\LjY.v|=mmѽ ;k޿T)cy1_yA+v$^ >\z (DbV0k(yukR~ q3 - v     B7 r4>NUt4p###"$$223C335W6^6e6l666667:7>7D759999999:c:g:k:q:== >)>f>>???"@@SAAAAAtB.CzCCCCD,DiDDEEEF#F?F[FFFGXGGGG7HHHHIIMJ}JJJNKL:LXLLL9MM#NQNNOOPQwQQQQ RJRgRRR0SST@U[\W\\q]]^___`=`Y`w``aaVbbuchGhhij.k5kZkkk?mmmmmm(n.nooop5p|ppDqqqqqqrsBs|ssttKuuv&ww$x^xxyy+zz9{w{~{{{{|||}\}b}݌RI39ÐʐNų<M޵Ÿ._պ/Ojǻ=" >];SYuKaj H[} T[%AO,[}+MQ`3{k.D+ C   V l b x /M y  -!)$`$$$L%&!&&''0(o(((())9**e+++!,,M----l.#/^////c01Z11112z21333p4&5k555 66BBbCCC@DDEE"F>FFFF G(GEGGGGGH/HkHHHHIIMM"NNx(0@JvD'rF] H_ (]8Rlpbq/f :Ys8Sq6PlHS[14lXHEa8T2P   J  % {71 :g9.  *!1!h34455666J778Z9PgQ}QQRRSdTUUaaFbbbcxdemff/ghi=kkopQppqIrrrs>sslttttuguu@vFvvvMwUw]wewmwuw}wwwwwwwwwwwwwwwwwx xxx&x.x6x>xFxNxVx^xfxnxwxxxxxxxxxxxxxxxxxy yyy'y0y9yByKySy\yeynywyyyyyyyyyyyyyyyyzzzz z(z0z8zAzJzRz[zdzlztz|zzzzzzzzzzzzzzzzz{ {{{&{/{7{?{H{Q{Y{a{j{s{{{{{{{{{{{{{{{{{{{| |||'|/|7|?|G|O|W|_|g|o|w||||||||||||||||||}}}}'}/}7}?}G}P}Y}b}j}s}|}}}}}}}}}}}}}}}~ ~~~"~+~3~<~D~M~U~^~g~o~x~~~~~~~~~~~~~~~~~ (08@HPX`hpx (08@HPXairz€ʀҀڀ "*3;DMU^fnv~ȁЁ؁#+4=EMV^fnv~Ƃ΂ւނ&.6>FNV^fnv~ƃ΃փރ&.6>FNV^fnv~DŽЄل #+3;CKS[dlt|ąͅՅޅ&.6>FNV^fnv~Æ̆Նކ $-6>GPYajs|ǡԇ݇&.6>FNV^fnv~ƈΈֈވ&.6>FNV^fnv~ƉΉ։މ&.6>FNV_gpyNJЊي '09BJS\envƋ΋֋ދ&.6>FNV^gowɌҌی #+3;CKS[cks{č̍ԍ܍ $,4<DLT\dlt|ǎЎ؎ (08@HPX`hpxȏЏ؏ (08@HPX`hpxȐАؐ (08@HPYbks|‘ˑԑݑ !)2:CLU]foxǒϒؒ #+3<ENV_hqyȓѓړ '/7?GPX`hqzɔєڔ!)19AJR[dmu~Õ˕ӕܕ )2:CLU]foxŖ͖֖ޖ $-6?GOW_hpxƗϗؗ '09AIQYaiqyɘј٘ !)19AIQYaiqyəљٙ !)19AIQYaiqyɚњٚ !)19AIQYaiqzś֛͛ߛ %-6?HPYbks|œʜҜڜ $-5>GOW_gowŝΝםߝ %.6>FNV_goxĞ͞՞ݞ&.7?HQYaiqyğ̟ԟܟ $,4<DLT\dlt|Š͠ՠޠ #,5=FOXair{ʡӡܡ!)19AIQYaiqyŢ͢բݢ '09AIQYaiqyɣѣ٣ !)19AIQYaiqyɤѤ٤ !)19AIRZckt|ǥХإ %-6>GOX`iqzĦ̦Ԧܦ %-5=EMU]emu}ŧͧէݧ'/7?GOW_gowǨϨרߨ'/7@IQYaiqyé˩ө۩ #+3;CKS[cks{ê˪Ӫ۪ #+3;CKS[dmu}ȫЫ٫ #+4=EMU]emu}Ƭά֬߬'/8@HPYbjrz­ʭҭڭ "*2:BJRZbks{ǮЮٮ(1:CKT]fowǯϯد (1:CKT]foxǰаٰ $,4<DLT\dlu}Ʊαֱޱ'/7?GOW_gowDzвز (08@HPYbjrz³ʳҳڳ &/8@HPX`hpxȴдش (08@HPXajrzµʵҵڵ #+3;CKS[cks{ö˶Զܶ&.6>FNV^fowķ̷շ޷ #+3;DMU^goxɸѸٸ "*2:BJRZbjrz¹ʹҹڹ $,4<DLT\dlt|ĺ̺Ժܺ $,4<DLT\dlt|ǻлٻ )1:CKS\emu}¼˼Ӽۼ (1:BJR[dmu}Žͽսݽ %-5=EMU]emu}ǾϾ׾߾!*2;CLT]envÿ˿Կܿ )1:BKS\dmu~ (08@HPX`hqz $,4<DLT\dlt| $,4<DLT\dlt| $,4<DLT\dlt|'08@HPX`hpx (08@HPX`hpx (08@HPX`hpx&.6>FNV^fny "*2:BJRZbjrz (08@HPX`hpx%-5=EMU]emu} '/7?GOW_gox (08@HPX`hov}&-4;CKSZbjrz !)19AIQYaiqy $,4<DMV^gpx !)19AIQYaiqy '/7?HPY`gnv} !(/6>ELS[cks{$+29AIPW^fmt{ &.6>FMU]emu}(d  Y 7     ^ L : D u $ I e , b C  6  E J 9  A ~    %! S( . A0 1 2 > ? k G 2 5 7 ~ Ŏ T ԏ U   w ` o Ք  _ 7 Ȗ  C _ 4 s  K | s N  C   2 | T   B  O   J( ( 44 2G hM V ^ b 9c d _e p =u uu v Hz | ~  ` e  3 D ̅ F 2 ) +  o x ߌ F  t ӎ 2 w x ƒ < ? % a e ٗ " 9 J ' j ٩ s W ? J "R#H$$>%T&'()v*+,.-2233P4{45567;;<q>>>?@pAqB CvCCC9D}DDERE|E F>FFGPGGGHHHvIIIJ9JLJJ0KKKKL#L>LXLLL*M}MM+NNN3OiPQ/ kL:Mʮ&,H=Eh2k~*P';Z O ygf;c!VpFy\N  T    V''0091"49PAIHNNSV;]faee_ruy cٜ+J oӣ*ܤsԦߧHת(ȫ,\ D5ɯ,}ñ13T!n ) b~`Yx Ufim.  !"r#L$p$$%%%&'())J***l+-001c17??B@@D HIIJJ_KKKLLLXMN:OOP/QR6SLTTUY<[[[k\\(]^^_`a)ccccd;deee}ff/ggg[hhi j\j4kkwlmnnop~qmrosetttu&vvvRwwxhxxyz{|}}q~TJ|݁7 ?dH8*a)[אۑߓC' ?n˘9՚ƛĞ9ע@{hgm@qЩ 7\ x֯4z۱nβ@)" Md@xھAnGOg8`u'QuI v<I8n[2_@, qL G N n  <%^ %!#("+,.37p88?@GG+HKKNRORRWWXy`fEggg2hiiijk mmm;nnn5ovoo3pHpBrSuuvw.w~ww^xEyyzYzF||| }}uPRơ9hWq:XXlp  %)&&'+())V**+j++++,-..35'6 :>>@WCCSDDD EEEpFF2GGHsHHxII{JKKKxLL`MM:NNx A!s!(""#$$&((+-/3579<@NAAAFG-J|JL7Mnno oWoqqyz\ъӏ<͕͒/WէLլJǭ'q®$ۯ> SD(H%VӶ#V˹wNvK Bkx+PlE>u(oNg. /     UiF]3aq8pE p !`!!""l"I#`##%&.&L&j&&&U''(( )m)))**++@,667'7D7v77788E9R9+<g<<<<"=f===^>?????@L@@@@ AAPAAAA%BBCGCTCC?DjDwDDFZHIJLLMENZOObPQRR?T-UVWWXGYtZJ[\\]r^__{`GafblcsggBhjhhhiilnssu2vv;wxyz|'}D~c8\~n/َ0Ϗwȑ)p5D]šn ȧg#0fݭϯϰܰ1r'гݳJKhи-fʹ&ZӺ+8g߻N޼-:޽5Pd  Vcl$B7d(w(11k?X)=)f  >M9xI}[/Xu SgS+d]8 k|P0Z*gN C 8XT"j oc?z  B!g!!f""##&&s'*(() +e,,--Q.j....'/`///%0Q0f00 101111292q22223;3s3333444455566wwxXxzxyz||~W\уa+Xm‡<9g =Lduhi4̾S| zV;[@R3zeD?c;|-A+A EIm[%I}5_z Xr^ yEoE i3XQQDq `I`7U&%)i9kAb&o0?r)i0Q[`  H   X    T  1F ?Par5V<>~oAb B    n      ]     ) E b }      &CZ,7Rn 2  $2%P%n%%%%%&#&@&]&{&&& '''(5(K(((p)))*K*+Y++++,,4-`-}----.0.G...l/223&3D3c33333342444W555LBBBB C@CCXHHHHHIIrII@JhJJJKzKNO+OOONPzPP$Q@Q\QxQQQQQ$R@RWRRRzSW`XXEYYZqZZZZ[_` `6```Ya^|Ƅ>S(fևdLlAՋQi͕z`Йq4ʝ2_0axϧ 9PƮs$C(ձ[ϲ %<kLyk >ZqK|\n<kJjf#N2xNsI1^/Nm%Ca)I]=[z0LcM} R[ )Gf *AWu7N'ap=i  (![!r!"K""""C#c#$<$$$$v%%%-&D&&'u'''(5(()g)))K*x**++++N,,,,---C.b.y.'/T////00.1M1d12?2222334I4`44455 6)6@667q777p8y99994:T:;);g;@$ASAjAAABQ R)R@RRReSUUUV;VyV6W(YuYYYY ZZ:^m^^^^___6`T`r`````9aYab6bibbbbcccddddd e*eFebeeeeee f(fDfaf}fffffg8gOgggrhhi.iCii؆3OlÇ߇j7_3OlŠي/O$b  1g|Ә gޢ9Pǣuդ(=̥z0T<oɩ+Jaتr@+N{5q#_{ϳ">ZvZz'S >zC*]{ GuѺ?cK~Ѽ=`xƽNnH{ɿ?RnDd<m ,?Xhl9a2I1Om9Us+b"\w4wa~,BMm      b  0 X   j -x&\qu HZo+f(D[~### $c$$0%223.333Q406}6666#77k9999:P: ;==>:>Q>>>v???? @d@@2AaAAAAA?B_B CmȺ"@]{ջ(M˾xԿ 1On+G| 1iH}YBjz:VRz.i?5Qu}%&Y+U)Y>!w:dv 8 d v    b   n    1dyOo:Y{[{Yy'Y    !!5$$$$%7%%&K&l&&&'''](w(((()) *$*y**E+p++++ ,a,,--X----7.W.///////.0N00'111111E2e23<333;4[4515{5555K6k67BBrCCC D+DDEEF/FMFFFFFG7GrGGGGH!H\HxHHHHI{I)JMN0NfN{NNNO|OOPNP`PuPPQmQQQa___ ``u```YaaaaLblbbc0cEccc=deddf6fLfffogg h+h@hhhiipii=j"nznnnn9o\oqooo=p]ppq"q7qqq1rYrr\uuuvvsvvvvwwwwxJx\xqxxykyyy$zzzz{{a||9}}=~~u3€Uvցʂxރ=ńDÅ"R+PQv nÉx <ŋ=tҌ(č;RɎw4Iސ6WnőԒ$FlT!|֕|^6:r0ߛRsӜǝu۞:ŸݟAO(M}Nsku 9¦2iǧ0Gl )>ӫ+Lcڬɭ;a׮ 9گU/7I]S~*<U,>q\|h.Hb|Pr4'~$kz:t.Jg,Hc 'D`|t*ew@#Ct$Uq,HdA2UjwA& ;    x   5     w  "y_^Ex$o Yy'  !!s34455666 757777r889/9D99QsQQQQ?RbRwRRR|SST9TNTTUUabTbkbbbcc-dMdbddeyff>ghiJkko%p ? H H N O _ l m m n o [p p eq q =r r Zs s 3t t t bu u u v Nw w w x 9x 8z } ~ N    / K g €  k ā   N ~ ك  - I  G ߅ ( T + ^ z ͇  M - a  8 b > ܋ , ӌ  , u . u  K Ώ s G j ܓ Z i  1 ҕ 1 u – = R  m  / v j E 6    } % o F     !  R <( z( &4 $G ZM V ~^ b c d 1e p /u ou v :z | ~  R W  - > ƅ ؅ 8   ~  i j ь 8 }  F  i z j 3 1  S Ֆ W ˗  3 D  t a Щ j N 6 A "D#:$$0%F&'')h* +r,.22y33"4u45567:;<c>>5?@VAkBCkCCC3DtDDEIEvEF8FF GGGGGHHHiIIIJ3JFJJ*KKKKKL5LOLLLMpMMNvNN&O\PQ/SXU WWWW+X>XX]&_ibb@efj1ksoottz{{{T(&sg ٌ_-'Nސl֙Ht$ܩ=A/B!{װޱB7<[%exJ!2TxFK9\y1bYLf<yKr.~;|K  j  g,''i003149BA;H NNSV-]XaeeQruy5ؒ˜D̡aţueƦ:rΪ_<x߭;̮,kҰ#oޱ̲(t߳N`#YuWPo Lx]t[_  !y"d#>$j$$%j%%&'())<*~**c+x-m000517??@c@DGIIJJUKKLLL*MxN0OOPQRSBTTTkY/[[[^\\]]^_`acXcccd5deeewff"g~ggNhhii.j&kskilrmnnoppq_rasWtttuvuvvDw}wx:xxyz{|}}h~F|<nρ) 96:*[ߌMڏɐ͑ؒѓ 9`+ǚ.ʢ3n[Z`٧3Ĩd*Vkͯ'maس3iDķW:|j ս̾ @9AY*WgKg;h.;*h-$]Qz2kcyC : A h   6lQ~!"(+,. 37b88?@hGGG~KKNLOoRRsWWXk`fgfggh i^iijkmzmm2nnnomoopBp4rEuuvv%wpwwPx7yyzSz@|||}}gBljq֎}֕D+||:Ic,JJfg x%&&'( ))H***<++++,-.. 35!69p>>?ICyC6DDDDuEESFF$GgGGVHHjIImJKXKKjLLRMM NN.OOOxPP>QQ ReRR%SSSbTTnUUCVVVWUWWWXXrYY.ZZ)[[\x\\G]}]]s^[__`Y```$ahaab+bbbcd4emee/fvffhgg:hfhhh6ii8jjj0kk-l^ll2m`mn2oGoWoooPpp/qlqqqerrrsns$wy{,|V~u|U|\4dsg1kL|VL5ky6xk Y    R  {Q>"1k %!m!""#$$&((+-y/3578<@@AAAFFJvJL1MOOR7SGSZK___`CaaffghjYklm=opp"qoqqq]rrr2sthwxjxxxlyy,z]zz{E{{&||}~~~NOOFӃbӄRly(OՇEDӉvߊ;QɌǍnRk˨ȩӫxt7ٮ&ҲIַ#3N&c!^_WR3Zx@K@h7L>hj|".!u%%A&O*-8..Z559T:;CI RSSTT$UBUbUV\V W7WQWjW&X]XX@YYYZ@ZgZnnno)oqqyyNÊŏ!Iǧ>Ϭ<!Crͯ0gJ6{BµHMŹjܻEm>her"Jb;u8h SHla ) w y   3wG@T-SO2b# j !>!}!"J"C#W##%&%&C&a&&&L''(((?)))t**++2,k667!7;7R77788?9L9<C<<<<=B===Q>\?????@(@@@@AAGAjAAABBBACNCCDdDqDDFQHIJLL}MYkZ<[\\]d^__r`9aXb^cjgg4hdhhhhiln ssu$vv wxyz{}6~Uz*Np`!ӎ*Ə qj/>Tke 9Ĩ*Y׭}ɰְlyOʳ׳=p>qbʸ'B6%2CE'4нԾBVP];9P)Vq~z#+v^*~ 7dY8G,tk-wNKo%aF^|/+~Oo"{>^2 6 $JFU  |RI9q  5!a!!]"""#&&f'(()*\,z,{--D.d.v.../K/}//0K0]000*1y111 202h2222 323j3333 4444555)6ww xCxtxyyz||~JڂOwăxTyR׆`2 a7F[l_`v'Fo lM2U:L*q\;z2Y5uq"x6%?>ghPSr*TtRDzPk7i7\&RDD(dSr<C*O q c,Xz3TR1_c`"Cm=Rx  =   M  d  &  &v[l"}3Dm,P3y5uf8\9 y  3!y!!"K"o""#W####~$$ %.%%%&'&&&>'''(E((((Z)~)))*S++0,,,..4/<A=AEBT\K__lbbe1hjlTno.SC{+N~&Ed:XvCT4Rq 'C]8wCpL >]{u!;Nl.H!vRa.c  !R!l!"E""""4#]#$6$$$$g%%%$&>&&'l'''(/(( )^)}));*r***+++E,y,,, ---:.Y.s./N////00%1D1^129222233 4@4Z444u556 6:667h777`8s9999%:N::#;^;@AJAdAAA~BQR R:RRRUSYUUUV2VLV&WXlYYYYYZ4^d^^^^___-`K`i`````)aSaa0b`b~bbbcccvddddde!e=eYeveeeeeff;fXftfffffg/gIgggchhh(i=ii҆*Fcև[(Y*Fcӊ IYz(avØaբ0Je̤"7ƥj 'A6f"A[Ҫv߫b0߯ %r?u,h߲VrƳ5QmKtM{+q0$Trٹ>bȺ6PEu˼-Zrؽ?h Brÿ9Ih5^6d~&6RY]*[ )C (Fd0Lj%YSn+}{nXu#9=g o |   R |  R    Z'hxVkeBTi]|y;Uo###$T$}$!%223(3u33B46t666667>9999 :#::==>1>K>>>f????@T@~@"A[AAAAA/BYBB6CCCCCD4DNDDDiEEEE F*FFFbF|FFF#G=GGGGHHiHHHHINIxIJUJJJJ K3KKLBL`LvLLLLMMM+NANYNrNNNOO*PNPbPwPPQ~QQQQ2RORnRRRSSbSSSHTzTTU$UU[>\\\\\\"]7]]]]>^o^^_____&`B``````aQa|aaa%b:bbb)cZcchjhhhhh2iTijij=kbk{k1lFmmmmmnnopp=pVp qMqqqqrr(sGsasss|tttu0u}uuucvvvvWwwww,xxxxxxKynyyyyy\zzzz{A{{{{z|||}6}}7P lTq!Ŵ2Uȵն˸`.gݺ7Tr̻"o=eĿ(Fez">v`|9jJ/Wq1M?gV,,Hbtc 73S8~ n1[p / [ p    Y   e   +^s@i~4JuLuIsS    !!/$$$$%1%%&E&T&&&_'''T(q((((p))**k**7+j++++,S,{,-R----).Q..)/////0H00!11111162_236333-4U44+5r5555=6e6 7BBiCCCC%DDEE F&FDFFFFFG.GiGGGGGHSHoHHHHHKIuIJM N'N`NuNNNOmOOOHPZPoPPP^QQQ[___``f```Ja{aaa=bfbbc*c?ccc.d_ddf-fFfff`ggg%h:hhhhiaii.jnqnnnn)oVokooo-pWpp qq1qqq!rSrrVuuuvvcvvvvvgwwwDxVxkxxxyyzvzzzzv{X||)}}-~~e -܀EpЁ{ h؃-ׄ4L"Jw݇ Hpۈ^hފ34_Ɍ2LÎg.Cؐ-Nhߑ=WړNs͕sU&*b*ٛBm͜xe՞*~ԟ1IGtڢEmأ[eۥ0~)T 'A\#8ͫ"C]Ԭx2LǮ3ʯO}).CWJu!6Lw#8k Mvb %?YsAl%!uet 4e%A^z#?Zv;Wsk _qu:=kLh#?[s8"OdX1 5    h   /     g iOuN?o_Ist  !!m344556667/7|777b888)9>99QjQQQQ/R\RqRRRlSS T3THTTUUabKbebbbccdGd\ddepff5ghiAkkop6pppQqqqr-rrrr s#spss=trttttt@unu!vKvevwf  ] ;   A P > H w ( M  i 0 d G   I N =  E  !   )! W( . E0 1 2 > RH N _ l m m n p cp p vq q Nr s ks s Dt t u u u v [w w w x Ax Kz } ~ a   ! = Y u Ѐ ' ~ ׁ 1 a ˃   ; W Ʉ  U 6 \  3 l ۇ  [ ; i  @ p L 4 : < ʎ  Y ֏ Z Ò  | : q d   E  d Q  " ` x S H   $ 7 Y    G  T   O( ( 94 7G mM V ^ b >c d de p Bu wu v Mz | ~  e j  5 F ΅ K 7 . q 5 ‹ } K  y ؎ 7  |  } Ȓ A D * f j ޗ $ ; L , o ީ x \ D O  "W#M$$C%Y&'!(){*+,$.22233U4}4556;;<v>>C?@EBCxCCC;DDDEWE~E%F@FFGUGGG HHH{IIIJ;JNJJ2KKKK L(LCL]LLL/MMM2NNN:OpPQCSlU!WWWX3XFXX ]8_bNefj9kotz{g;4zr@:V+Pʢ1 C1pN<OϮ+. J? Jm7m/R)@\T~lh=e&XrH~aPY  m'0;1'49UANHNNSV@]ka"eedruyhޜ0Ltأ/x٦Mܪ-ͫ1^I:˯1ű65V&s+ge^!} Zknr3 !"w#Q$r$$ %%%&'())O***q+-01h17?G@@DHIJJJaKKPLLM]MNښ˛ɞ;ܢEmlrEvթ%<^! }ۯ9sӲE´.'RiĸB}߾F sLTl=ez,SzN%{AN=p`7dE1vQ L S p  >*$c*! #('+,.37u88@@G0HKORW X~`fJggg7hiiijk%mmm@nnn7o{oo8pJpGrXuuvw3wwwcxJyyz[zH|||}}zUWˡ> m\v?]]nu  %.&&'0( ))[** +o++++,-..3 6:> @\CCjDD%EEEF7GGHH}IJJKKK}LLeMM?NNAOO PPPQQQRxRR8SSTuTTUUVVVW#WcWWWXYYYaZZ<[[&\\\Z]]]{^m__$`g```2avaab3bbbcdBe{eeAff gzggLh{hhhIiiKjj kckk@lsllEmhmn:oOo_ooobppAqtqqrwrrrss,wy|d~-(ɰhoGl*zD~_i/Th+~I~=    > e  d'F0%C} V!-""#$$&(+-/357 9<@SAAAFDJLSOROS&Z^__`avaaffghjlklnPopp0qqq'rkrr(s:st{wx}xxyyy?zezz{x{{9||}~~~`!bςYu eCΆ;WXˈ0LDn_܌ύ `y٨֩6ɪ۫E8[ɸk/AV;q6l"r(_eFb&S^S"?$ZLv|5/ A!%%t&b*-k..555:9::;CIRSTTT2UPUwU1VqVWEW_WW9XrXXSYYY-ZUZoZn\oqqy zaÄ֊؏AҒҕ4\ڧQ׬OvǮ)C°XI-J'[ն%[͹|U{PG00RnG@z%>c] M  `$bf|up P !k!'""#e##%3&Q&o&&Z'{(()r))*++E,67)7I778490<<<'==c>??@@@@WAA*BB.CCQDDFaHIJLLMJN_OOgP Q RRDT2UVWWXLYyZO[\\]w^__`LakbqcxggGhlhhhiiln ssu7vv@wxyz |,}I~h=as4ێ2ԏĐyʑ+rFbsͧlkĭK[,O˴PܵjҸ /zϹ +S :Ui%= )G<iW`63pD].?.k%O>}^`4 ]wXiX0f b= U5o/lc" H  ]Y' w  G!i!!k"" ###&&z'1(()+j,,--V.l...,/j///0k0011112>2v22223@3x33334444555;6w+xlxyz||~\aփf0Z$rLJ>KN iz mn 9ѾX[@] BT8jIDe ~/C-FKo]*N7a|Z wc ~JqJ n8ZVVzveN<W(*F!>mFg+hDt.p5V{e  J   Z    Y  3K"DU fwP:XACtFd G  A!!!"Y"w""%#e###$$%6%%%&&'L'''(S(((h)))+_++<,,-./="BT\_beDhjmgnOqsHvxyzE}ǀFmlBhpĈ8n%яZߘ.Ϝ9ՠ Ҩr6ۭl̮t*]y [8LSd~ֿ/6J-H'ZKZo/n:NruB_F$?\yQz3Pm-^Hi$Zw3O#6_u#UjUq0J}B@ s      b     . J g      +H\. <Ws 4  $7%U%s%%%%% &(&E&b&&&& '''(:(M(((u))**M*+[++++,,9-e-----.5.I...q/22 3+3I3h333334 44444\555NBBBB%CBCCZHHHHH IIwIIEJjJJJKKNO-OOOSP|PP+QEQaQ}QQQQQ+RERYRRRSWeXXJYY"ZvZZZ[[_ `%`8```^a eȄ!@U*kiQnC׋Vkϕbՙs9̝ 4 d2fzԧ >RȮx )H *ڱ`Բ*>rQ{pC_s#MasAmOlh(S4}PuK3 c4Sr *Hf.K!b B` 5QeWW`.Lk/C \z <P)fuBk  /!`!t!$"M""""H#e#$>$$$${%%&2&F&&'|'''(7(()n)))P*z** ++++U,,,,---J.g.{.,/V////0051R1f12A2222334N4b444556.6B667x777u8{99999:V:;+;l;@)AXAlAAABQR.RBRRRjSUUU"V@V{V;W*YzYYYYZZ<^r^^^^___;`Y`w`````>a[a b8bnbbbbcccddddde/eKegeeeeeef-fIfffffffg!g=gQgggwhhi0iEiiچ8Tqȇo<a8TqNJۊ4Q&g% 6i~ؘ iŢ>Rɣzڤ*?Υ5V >tΩ0Ocڪ wE-S}:x (fԳ 'C_{ƴ_|,U@$E,b LwֺDeMӼBbz˽Sp J˿$AWpIf>r.DZmq>c7K6Tr">Zx-g'c| 9 |f  1GRo      g  5 Z   o/}+^sz"\q-k-I]###$h$$5%2330333V4266666%77m9999:R:;=>!>?>S>>>{????@i@@7AcAAAAADBaBC>CCCCD$DBDVDDD~EEEEF8FTFpFFFF1GEGGGGH$H}HHHH IcII1J]JJJJK;KKLPLnL~LLL M&MMN9NINgNzNNNOO?PVPjPPPQQQQRBR]R|RRRSSwSSS]TTTU,UU[N\j\\\ ]*]?]]]]R^w^^_s___6`P`n```` aeaaab-bBbbb=cbcchzhhhhhFi\iri kKkpkkFl[mmmmmnnop-pKpkp!qbqqqqrr8sUsisssttt#u8uuuuxvvvvlwww x4xxxxxy`yvyyyyyqzzzz{V{{{{|| }+}K}~+?e"i$ )ڴ@]ֵݶӸuCoͺ 'Ebڻ*R; zٿ 6Ts2L~ 3nM^DlA["T|3kA:Vw$+l0`<@#|?ix = i x    g   s     $3f{Tq<^}`}^{,[    !!7$$$$%9%%&M&q&&&''(d((())*&*~**J+r++++,f,,2-Z----<.Y./1/////30P01)111111J2g23>333@4]4 5355555P6m67BBwCCCD-DDEEF4FRFFFFGGo^osoooBp_pp$q9qqq6rr^uuu vvxvvvvw|ww$x^xsxxypyyz&zzzz {{h||@}}D~~z5ǀZx؁ׂ}ŃBI'T0RÇVx sʼn}AB׌-ƍ#@Tˎ|6K=\pʑ)K9#ە e=Aęw2ěWu՜ԝzž?F$Q-OSup¤z >7̧"5Iq+@ի2Qeܬ֭@tܮ߯W1 <K_X/>Z1@sa~j3MgUt9P <y3Ol1Mh,Ie{!?yB(E{&Zv1MiF7WlF( =    }   7    | $~dcG} &t^{,  !!u34455666"777777w88919F99 QxQQQQDRdRyRRRSST;TPTTUUa&bYbmbbbcc2dOdddde~ffCghiOkko*p>pppfqqr r5rrrrs+sssQtztttttTuu1vYvzv/w F  z  s #     Z    >     6 ; *   G    ! .( - 0 1 h> G RN 3_ l m %n 0o p p q r r >s s t zt t Fu v v w z |} ~ +   T  f y =  C 6 y c \ $ l B    K    Y o :   c >  \ Z W  $ S ' 3 F *M V A^ %b Kd }p t v z | ~ w : ? n g   w         l  I  W  M      e  7  ,  z [ Z ] C + y 6 "+##$%/&')P**Y,-1j223556:;<G>.?l@@B@CjDDDBEEmF=GGG7HHII{J~LLMXMMN]NN OEPQSAUVrWWsX_Ob9efjEo[t z~Wg=7@r~`Gu}A`?9m;/~V(<d%P0VMuDvln  &039@GmMS@V\`ad8ruyytze=]N]l!uToY6LjJCxc vAm|Rg]DF !b"L#&$&'{(n)) *\+O-A0h7_?DG^IDJJKL?NNrOAP,RSZq[[3\\]]]M^=_,`7aAbdd[effdgg6hhhjklm oopqrstuu\vv-ww yyz{| ~~#Dm^O?Ks}_#L=.*R|l\=u* Ip v/)PaLSj86fj=t-uQN/m\@rP.P3cP{ &nKOr6w  )  }@5v!"(+g,j.27?88?8GNKNQV_f]h'j6k^lcnoruu#vWww&xxyIzr||}O#uUdf( ^c0L'1 \ k%&&x'(()/***+,-.259D>?-C DJE6FF9HHI=JJK=L'MMNOO[PP%Q~QQIRRSySSITTTU*VVVNWW(XXFYZ [~[[[\\+]]B__ `O```a_aaa`b"c-efeef=gghiwiizjjklmoo&ppqqq;rrNsy{O~|?]`>rcDWN|A?OLP 8 b fnB  !"#$&(+}-r/35j78<@AA]FItLxNReY^B`eg%h2ijk+mxnoSqrt>wwPxxByyzzz{ |r||~63#<7A':IaYm0ii 1]g,E6^%)<n|54^QcF!+%*-%59CIQS6TTU[VVWXYYmqay4P 1&m!Z>y~$.:61D5No} V  1kB8M= !#%@'(*,i668;<=Z?;AASBuCDGHIJLvM5NGOOQPPQRT UUWWX4Y^Z![[\]I^^_e`a?bCcgghiulnrksiuuvixyz{| ~*Of#E3Xyo AjdY )@9__%Z8yYE+S5c4mcg2Vc!Rw  0Sc5,h  # &&N'(()*R,q-+../0R11_22a33456wxrz|~16<HPaT~Uk/XsBF( fR.}5],H ^Si"LNr<D_5Q9-+2 ;$y$JfULWbz:i5U j*M 9&  ! {  3   J")o-m\.1 q )!o!!!A""#O###t$$%x%%%&&4'z''=(}((P))*6++,s,,.<AS\._Obehjl3n#q|svwyz}b,tZr>Ag2Voh"XG %?G1xBr{':c c uu}: ]zm0rH,nWH<B8  *    <Z` $&7''y(()*7+ ,,W-.u..2`445FBBnCRHIIIJAKNYOOtPQRRRWZ,[__d``LVA,K$c0`6*~lVjYsEEe!D9,Q9C_5~wM67)*o|!lHc%  !!E""##6$$$%%r&'b''c( )T))r**I++;,,>--0..N//)00119223344555n67_77s9 ::W;@ABQnRRVUVXGZ4^^G__aa0bbBccf}gghriB}R(9a~k6IIYu^L2M*u$7aEr&BmBh6Z/0Dw%I$F | 9   1[PM#;$$2\336]7;9:=>>?;@@[ABB6CCDDEFFqGGPHH5IIUJJgKLLRMMNOPPQQ(RRISSTYU[4\\]^^4__``8aaobbch`hijkEmGnopLqrrss ttduuv?ww,xwx2yyDzz@{ ||{}kORgU+U3 GgV; 't5hEa1y8[[    4(4140S  F!/$y$$e%?&'I(()R**j++:,,R--..)/w/0|0!1s1226344+5$66BCYDEFuFF_GGIHH2IIMNNUOOP3QQ[__M``a%bbtcddfzffgohhHiingnooppfqqrVuuJvvOwwx0yym{O||}}~~M, A ?Fh) x#tjLJ)> <CeumYO]u!w#A5b(*4alJ:qa -i   c > PJ%?RG0 J!m3456c778s9QQRRRS}TUa bbcddejppqbrrWssrt'umuvv F  z s #    [  ?   6 ; *   G    ! .( - 0 1 j> G TN 3_ l m %n 0o p p q r r >s s t zt t Gu v v w z |} ~ +   T  f ނ y = Յ  Ƈ C ڈ 6 y c \ ލ $ l B  א L Z o З : ֹ  c >  \ Z W  $ S ' 3 F *M V A^ %b Kd }p t v z | ~ w : ? ф n i ن y ؊ n K ̐ Y O  g Е 9 . z [ Z é ] C + y 6 "+##$%/&')P**Y,-1j223556:;<G>.?l@@B@CjDDDBEEmF=GGG7HHII{J~LLMXMMN]NN OEPQSAUVrWWsX_Pb9efjGo]tz~߂Zg=7אAr~מ`Gu}A`?9m;/~V(<d%P0VMuDxnp  &039@GmMS@V\`ad8ruyyրtzeۢ=]N_n#wVq[³6LjJCxc vAm|Rg]DF !b"L#&$&'{(n)) *\+O-B0h7`?DG^IDJJKL?NNrOAP,RSZr[[4\\]^]N^>_-`8aAbdd[effegg7hhhjklm oopqrstuu\vv-ww yyz{| ~~#Dm^O?Ks}_ƌ#L=.*R|l\=uΙ* Ipҧ v/)PaLSƯj86fj=t-uQͻN/m\@rP.P3cP{ &nKOr6w  )  }A5w!"(+g,j.27?88?:GPKNQV_f]h'j6k^lfnoruu#vWww&xxyIzr||}O#uUՏdf( ^c0L'1 \ k%&&x'(()/***+,-.259E>?-C DJE7FF:HHI=JJK=L'MMNOO[PP%Q~QQIRRSySSITTTU*VVVNWW)XXGYZ [[[\\\,]]B__ `O```a_aaa`b"c-efeef=gghiwiizjjklmoo&ppqqq;rrNsy{O~|?]`Ɯ>rcDWN|A?OLP 8 b fnB  !"#$&(+}-r/35j78<@AA_FIvLzN!ReY^B`eg%h2ijk+mxnoVqrt>wwPxxByyzzz{ |r||~6؁3#<7A':IaY¨m0iگi ۱Գ1]g,F6^%)=n}64^QcF!+%*-&59CIQS6TUVVWXYYmqay4P 1&m!Z>ֱy~%/;μ81E7Pq X  mD:? !#B'(*,668;<==AAUBwCDGHIJLvM5NGOOQPPQRT UUWWX4Y^Z![[\]I^^_e`a?bCcgghiulnrksiuuvixyz{| ~*Of#E3Xyo Ajd۠[ h̲,;aa'\|ZE+S5c4mcg3Vc"Rw  1Td6-h  # &&N'(()*R,q-+../0S11_22a33456wxrz|~؀16˄<HÒɕޘPaT~Uk/ɿXsBF( fR.}5],H _Si"MNr<D`6Q9-+2 ;$y%JfVLc{;j7'V k+O":'  ! {  3   L#*p-m]/1 q *!p!!!B""#O###u$$%x%%%&&5'{''=(}((Q))*6++,s,,.<AS\0_Qbehjl4n$q}svwyz}c.̂tZr>Ag̉2Ċ͌V pؗh"XޤG %@H1xBr{':c c uu~: ]z,n{H< *     <Z` &7'y((*",-.u..`445BnCIIIJAKYOOPQPRRRZ,[__d``&LV̆B,K$`6~ͯlV';j3YʹE!;;_5wM6**o|ElH%  !!i""##Z$$$%%r&;'b''c(-)T))**I+,;,,>- .0..r//)0011]223344555n697_77 ::W;ABnRRVJZ^G_aabBc}gghriB}R9~kҨIIYϰ^űղٱL2v7&mBZ/0DwhI|$F 9   1[PM ;$$\33`7:>>;@@BB`CCDDFqGPH5IIJgKLRMNOPP>QQRQ(RfQRISSTYU \4\\]^^4__`_`8aaobbc9h`hikHnprrss tduuv?wwPxwx2yyDzz ||}kS@g޳U+3 GVͼ<  @T(u6AjG}{4(140 F!S$y$$e%?&"(J()R**++:,,v--..O/w/0|0I1s12244$66CYD@EFTEuFhEF|E_GEGEIHEH2IIMNNUOOP3QQ__M``a%bbtcddzffgohHii@ngnooppfqqrzuuJvvOwwx0yym{O||}}~~M, B?҈FՊh* x#ujLJ)? <ϣCҥeרumZ]A5(*X:alJ^q:a .i   d > PK%RG0 K!36c778s9RRRS}Ta bbcddjppqbrWss'uuvv 1 n e } ^   D (  ! &  o  2  p w ( - 0 1 S> G =N _ k l n o p p q r r (s s t dt t 0u v v w z g} ~  y > P ɂ c ' m  v - s Ĉ } ϊ c N G ȍ  V , s  ے 5  C ϖ X И $ y N )  G E B x      > > x' 3 F M V ,^ b b 6d e hp t v y }| ~~ b % w * W P t ` j Ӊ }  i Ѝ 2 U ɏ 2 @ ͑ 6  r r N  c D E H .  d ! "##$%&}'');**D,-1S2234456:r;<2>?W@@B)CTDDD,EEXF'GlGG"HHIIfJhLLLBMMMGNNN0PQS,UV]WW^X^:b$ekfmj0oFty~ʂlBR(ӊmn"o+n]iJ0_fȩ+){jIgð("ͿX&hjAl'N7%9N?}n6e7^z`/aWY  &/t38@GXMS+Vj\`Ld#rudyΊ!_eNŢ'G֥8HK̬mW W`?ZD!ϸ7U5.cN a,Xg=RH/1s o!M"7#$y$$V%%&~'f(Y)) *j*G+:-,00!1S7J?@O@DGGII.JJwK LoLLM(NN[O*PPRRjSTTZZ[[\\\F]6^&_` a*bDccdDeffMggh{hhijqj_kklmnopqrstuuEvvwiww&xxxyz{|}~ iЀ-VG8(4\"vfH ٍ5&;eUEɗ&^3Zף`:xK6<T! U۴PT'^Ը_;8ۼWF,|}*\:v:{oM:euIWX5:]!b   {  h+ a!"~(*R,U.27*88?#GG9KyNQV_fgRgggFhJiijkGlfmNnnooruu v@wwxxoyy2z[||}:`@OQ|INl&7Gl rV%%&c''()*q**(++,-r.259/>?CCDD3EEFFSGG"HHI&JJDKK&LLMMMuNNhOODPPQgQQ2RRRbSS2TTTUVnVV7WrWXX/YYZZZg[[D\\]]-___9`~``aIaaaKb cePeeebff'gghi`iicjjkklm{oopppqq&rr9sy{:~gj*HϒKqͦu~Ϸ)rl]N/@7e**n!l97d; E ~  #  MQX-  !"#$&(y+h-]/35U78|<}@AyAHFI_LcN RPY^__+`/aaeghinjkmano>qqyrrt)ww9xx+yyyzz1{{{[||~!uЀ;Á % rjbˊ'Ӌ*%ޏ4kLDXSįTƱHPpz0x Hwvi&Yg I<N1!%%-&)~-$..559@:CIQS!TUVWXqYYmoqLyy|;pX p/CS'ydgxp%!ja/ 9Zh ?  Vp-#(~ !s#+'(+)),68;<=$AASs6 "   d    P   l  bGXiz04 nYWF [ !Y!!!+"""9#y##^$$$b%%%&&'d'''(g((:))* +++],,.<AS\_:buehjlnqgsvwyz}M_E])+ЈRAZ×vSښ Cɤ2*2ݵc-]ٻfͽ{Ͼ$MM _`h#FevY3&  o  s'EK &"'d((l* ,@--`..K445BYC4IIJ,KDOOPQpRRZ[_O``5߄lA,6yK!i߮U˰AmUB׵0 $$J b8!|ZgU3  !y"#|#j$$%]&K''N(=))*4+$,,)-../01}1m223y445Y6H779m:B;AAYRRV2Z^2_`rab-cfhggh]i-xh=$iVq4z4DG5ʹζ`"X-}E/zb41 $   F;8t&$$G33H7u:j>>&@@BxBCmDDF\G;H IIJRKL=MNOOPQRR4SSTDU\\u]^^_`{`#aaZbbycIhik2npqsssOuuv*ww`xyy/zz{f}V=ΐPɳ@2A& _ Q0dFF  n z  1!b$$P%(&~&&K''2((=**+%,,--p.`//g0\12~23t466CDDE_FFIGG3HHIIMN@OOPQQ_8``abb_cc~deffgZh3iiPnnopvpQqqrru5vv:wwxyyX{:|||}}~~8+Յq*1Sk׏c _U7z5(Ҡn'.Pާ`ש̪X|DHv_ a , hJW5n\JT   N ) ;5=2 5!456N778^9QRRRShTUabbc|dUppqMrBssuuv4 554666(7P8[887>B>>>? ?F@Q@AAQB\BBBBJCUC`CCCCCaDfEqEEEJFUFFFHII.J|JJP\QU$Y/Y~Y9ZZZD]8^_`:ab!cgggiuiiiCjjjJk`llmbmmmmWnbnmn1pzzzz{{o{{ |\|| }m}};~G%v3>f;FΌX#-DO_n|яߑ=Hu&q2"3-383x33445Y5d55555556)6?6x66666637h7s7E8f888k9v9;:F::::0;;;Z<e<p<<<!=,=7=C=S===,>M>>> ?+?e?p?{?????????@@*@6@\@@ AMAXAAAAAFBgBCoCCDlDDDD E|EE`FF5G@G8HCHNHHHH=ISII9JJJ4KnKKKK'LaLlLLLM%M_MMMMNRNNNO OEOOOOOP&PhPsPPgQQQ R+RnRyRSSSSSTTT!U,U7UUUUU(V3VsV~VVVV,W7WzWWWWXXY:YYY.ZDZZZZ [Y[d[[[[\#\h\s\~\\\\\\ ]O]C^Z_e_q_______&`1`<`H`X````````Eaaaaaa-b8bb,c|cccc'd2dddeLeeee"f-f|fffffffpg{gggggghh)h4h@hPh`hkhhhhhhhi%i_ijiiiNjjk?kUkkkkkkkkkl#l.l9lDlPlkllmnLnxnnnn&o1ogoro&pGpppqTq_qqqrrr'r3rCrrrrrrrVssttbuovwwwxxx*x]xhxsx~xxxxxx4yJyyIzz{{{||Q|g|||}+}b}x}}}0~~,<RÀ΀ڀˁ #IЂۂ#3>x˃ۃ /=KYg<uńф1G…х ([6p{PqȈ؈Q8r}ٌc:(43>IT_jvɐԐߐ _juԑ2S’͒ؒ3>IT_jvÓCNYe͔ؔ1` 8 ? H O u + b  9 ʖ u ~ q 7sBbou{  '00?YcfGKTORW)6>DFH4|u!)G~J9MO?Sƀtnoo)mz Pi1   H!5:r !K#&&()+71777G9T9<<==??@@ AAAAICVClDyD7Iǡ%2߭Ѱްtҳ߳ -: /<Xey@ {A./S0215w|xi?= G"k $G& ))NbO@TGYV\_cl'npq.suw-NtQ Do' 9B;q@gABE:H_IJCOSUZ^azddf{ikm6nUoEpcqxy|} ts*34KМtPbcq,KeWPO#)3:N>>?`@E2IALTWs`[dqhiiwj/tw|@מŢnc`{ wxPdWj_CV }b W!23m47d:=MMbNO.RTZg__T75678U9;|<a=>?;@@AKBmC$DDEdgk6mnUuv|wz}|߉aʑ4ӥ ])̼oi ~ / d Hcp-344s8HLiNQ6SUVWb]wy~~l)&ˑEyi:{e\  7:Gy!"$&&+.137H99:;;Y>EHI_eeqy?zzg{g|}}~1~˃͈(ˏW+Д,p5έt#jpU1C+@y f   | } ]   8  ! " 3 : : < < = @ I xQ R W X ] qf mm ks [x { a ! ڥ 3 b ߷ K   "  q C < 2 x3 7 Q< < = > e Qg 9h s -t Uv w kx ޥpdiLm=j= *g{7c p"#%&b(o*+-..0134JqNUiVKU   Z [ d je k jl Aq r (y 9z ؂ ҃ ̇   7 D  D I  h  } Y q S 9  = r + p     p         I P    \  Q ! ! # >$ >% - / >& & ' R( ) ) * , @4 >5 6 U9 9 J; ; E wE L ]N O P ] _ U_ ` ` a ^b c d d t N  #  E Q ް   e U l  T > i ) L I Īj : %x$F:s#>YV%  nqG  z8<MbtektT   z k D  \ \]  C z ? /  ! r  a P A   1   $ t   f   Y   M   A   1   # t  g  U 2  S   S oKJL%MNNOPlQGR"SSTUViWDXYY    ]   S   X   K   =    z a %  c .     t   A    * ~   o   i U t =c)A%44\-xd k / ( 7 8 ] ] ] N d |#*v+r,d o = ! ! 6 8 8 9 9 -9 A9 L )&&>dha|=v$.6l9D:?BtCHITEYT\_cl%n`q,suwyrU$mm%%)@;o@eABE8H]IJAOSUZ^axdbfyikm4nSoCpaqry|}r~يq124(tfJo`ao}*IcUNM#)38L>>?^@E0I?LTUq`Ydohiiuj-tu|>՞âl aQ l vNbU`]8L `Y U!03k47b:=MM`NOOTWe_'bR5b678S9;z<_=>?9@@AIBkC"DDEJ:h4mnFrvvwQz |}*_ȑדѥ ['ʼmXdxg | - b Fa02.44q8HLFNQ,SU~VWWwx~~'$ɑF)g8ycZ  5E ""&&+.17y89}:9;<EHImKLbsekt=zze{e| }}~/|Ƀˈ&ɏU)Δ*I̭r!hnS/A)>wS d   z { [   6  ,! " 3 : : < < = @ I vQ R W X Z d k ?q Yx &y ւ ʇ _   ˥ 1 `  I  y j C  o &  v3 >4 8 < = > E Og 7h s +t t w ix :y z z X Ç D ) ɉ i Ҋ  s Z v  Γ s i ^ R ݛ  X s ܣ C X c  Ԯ = ܰ N v = Vp|~b_  Z  S 0 !"#&(+ۄFߐ+vذȻ*cpo8AsB *+.0 3 44579st|vx (Μ'%A] :W^ #y uhAT :   '{,RZcQeg+kkl nv/~<ܥ  nִgJk ;h; (ey5a n"#%&`(m*+-}..01345oNUgVbg:imjjkr)ttSuQ~~ՃքoG݉MmYoD>HMz(!@IX#!#%&'(N)))**t+,p,Z-0~23'YZ[\`]̟C'8|=ob/%yY//8w!/3/[^^_lxx;yy<n3   [ ] he of hl km r is 7z { Ѓ ݷ 5 B  B G  f  { W o ~ Q 7 ;  p $  b m           n   N  @    ; ! ! # <$ <% <& / 2 & ' P( ) ) * , - <5 6 7 9 H; ; O< uE I [N O P \ ^ S_ ` ` a \b c d d e Sv L ӑ ! } ҡ O %   c S j R <  g ' J G J*''?eib}>9 $sw$@%.69E:?BuCHI=NaO?TFYU\_cl&noq-suwyoME9M"=XsPnn&5)A;p@fABE9H^IJBOSUZ^aydcfzikm5nToDpbqry|}sr23J1usOtabp~+JdVON#)38M>>?_@E1I@LTUr`Zdphiivj.tv|?֞Ģm bR mwOcVa^9M aZ V!13l47c:=MMaNOOTWf_4bnS6c678T9;{<`=>?:@@AJBlC#DDEJ;h5mnGrv{wRz |}+`ɑؓҥ \(˼nYqVh } . c Gb13.44r8HLhNQ5SUVWW wx~~(%ʑG< h9zd[  6F "#&&+.17 G99~::;X>EHInKeeqx>zzf{f| }}~0}ʃ̈'ʏV*ϔ+Jͭs"ioT0B*?xT  e   { |  \   7  -! " 3 : : < < = @ I wQ R W X Z d k @q Zx 'y ׂ ˇ `  ٥ 2 a  J 6  ~  ! p '  w3 ?4 8 < = > E [] ] B  Pg 8h s ,t t w jx ;y z z Y ć E * ʉ j ӊ  t [ w  ϓ ! t j _ S ޛ  Y t ݣ D Y ¬ d  ծ > ݰ M O w > Wq}c`   [  T  . ~  1!"#'(+܄G,q wٰɻ+d  qp`  9BtC *+ .0O 3 45579@ st}vx )Ϝ(&B^ :W  _0   # $s z  e  v X  i L B  @ U ;   (|-RZcReg,kll nv0=ݥ o״hKl <i  0 < )fz6b o"#%&a(n*+-~..0134 5pN " UhVcg;injjkr*ttTuR~~փׄpHމNnZs pE?IN{)"  f AJ Y T  $!#% &'(O))***F u+,q,[-023(YZ1 [\a]͟D(9}>p c0&zR  Z00 9R x! 03IL$MMNOPkQFR!SSTUVhWCXYYZ0[^^_mxx}}B~~!;c;?™0yy6$b/vb 2 l Jp!69%N%hF>2n44Oi-xq k /  w < 5 7 8 F] ] ] ] ] [ q 0 ++,>LMMNOP`Q;RSSTUV]W8XYYZ  d r Y |   l  J ! ! 6 8 8 9 &9 :9 N9 L "f 6 !pNt%:=%R%lJB6n44S m-yu k 3  { @ 9 7 8 J] ] ] ] ] _ u  4++,BLMMNOPdQ?RSSTUVaW9 R9 L    a  ?  "    D  T B L  2  W   s : K #  M R @  I  %   ,! Z( . I0 1 > `H N _ l m n p p zq q Rr s os s Ht t u u v `w *x Nz }  f   ,   4  f   Z   ;   `   @    Q      A    ^   _  %  G       i  Z  i } X M    '   <  \    R( >4 <G rM V ^ b e p Gu v Rz | ~  j o    \   ?  J    \ %      #  R  U  ;   w  {  1  t  {  a I  R  %"\#R$$H%^&')*!+,).72233556;;<y>F?@NBC}CDDE\E*FFZGGGHIIJKLL2MMM7NNN?OsPQHSqU&WW XX=_bQefjotzj>#wC?0 4SAT3OMr<4EYmBj]wM!\  |'0*49XAQH!NSVC]na'egruy5y4{^> K+xljc!& _psw8 !"|#T$&'())T*v+-07?DHIJfKKLNAOOPRSTJ[[ \y\\6]^__`b.c&d)eef=gghihhiBklmnopqurwsmttu0vvv\wxyz{|}{~\TA" P@23e /xC>HrquHy(A&<xJ3,Ul  OWq@j}Q(FS@ <iJ6{V Q V  -)h/!#(*+,."37x88@GK ORW`f"ijl*mnoLr]uuvwwhxOyz^z||}}X\C_{Bb b!x   %1&&'5(%))^**++,-.$3 6:>@aCmDEF<GHIJJKLLjMMNFOOPPTQQR{RR=SSTxTTUU[VV WhWWXYYZG[[1\\]e]]r__'`l```7a{aabbcGeeeFfgQhhNiiPjjkElPmnopgppFqqr|rssy|i~0+ k tL-Idn4 N j i25*H Y!0""#$'(+-/3579<@XAAFSJMbO S)Za_afghjqklnUopqrtwxxyyyDzz{{>||}e& g^zjP@]5 d c~J ; `t4F }3jK+XcV'Oy84F"%g*-5:CI"RST<VDX^YYZnqyf9_VRF[L2f[=;qLE4Mrl  \  3u '!6"#i')*T,83<4=p>ZA-BBDDfHIJLMONdOOjPQRRGT7U!V!WWXQY|ZT[\\]|^__`Qapbvc}gLhhiln%ssu:vvxyz|/}L~k@dv7#~.uvx?bcVbl(O|Iu 3p*"Caeb]5Bxol% M fb0(&z" L!#&&&}'4(()+m,-Y.5//011{22}3345@6w4xz|~_f k5'uCT"nrs>]$`E="oNI j)4H2'P"b<f_lOOs=[[{jSA /O&CQr6wO9@a#p  O   _  8'SCJH} O  L  J!!!"b""*#j###$$ %%%&&'U''(X(((q))+d++A,, -%/-=1BT\_beOhkmrnZqsSvxyzP}UqGus]1>w;w-b^ Xi4;O2N2qwG\2*;zG    &'(z)+,.v/4a55*CC|IJJJKOXPRSZ[`ca& pnV#[Pi}Vu(fxFT"dh3g`ikzG )"M#$%&((U*+,-1/023456z8>: ;q;ABRoSRWZ__Cabbcg|hiitA9l|JXd1Q&GX%)\NIrvC W l :  t+m$:%3[47);>?n@<AIBCDEFGHhI6J#KKMMNODPP|SbTTU]]W^^x_jabbBccKiQln,qrstu}vvqwxeyyvz!{| ~tE#zHWXi->?Ycec1!!!%%P&)*O+k,7-A. /801O23E45U6!7DDeI3JNO1PPwQR`caaVbccGddfyghhziGjCooGppq;rr}vvw-xxuyz{m||C}}I~~_KR05[xK6h@F|\HO-2Xu@+vfZ>-~ H- <K     ihyc1 !7|899IRRS#TTbc7ddpkqrrsVtYu:w?F%mԸ 6'', Y|6w $H& ) m G f  b Z 2 m Yp u w 7x  | R ) _ 6 *  ̏ g ; *   x( mu < օ B s4>C1DtE6FGHHI1JDJK(KW)X|}d++-wCWW{]]q^)bbcdgdhhk\l^mGnUojqs"wbzJ @<$AESfpq0sx[z>}~MBō,ѫL$UX5 m;ST`UQVhW[XZ>ZeZ߬y@ùԻ+HG)EE! Q?&@@hABDeFFLgbhhю(i¨Mno64A.NA)|55Em_\S _!t.I/00122 33 4445vAxxywP.DUS8JxgPMN]NZ m"#,%&'(|)**4-.c^.׬ĭo.B+t>CfT'j?QvNJ_%90 |   L  6 n   Q#) $&''B(()(*-++,$-m-->..2)44v5>BB7CJHII_JJ KN"OOkPPLQQQNRRWRX7YZZZ_-``5Jv ߇c8̋\ĕ'A)!oGۯ0I3jh;yZa;o#H:(u@Z-m}8 E~Z i!<""Z#-$$%;&'',(()h*++,--p.D//0[1/223W44576 77k99K: ;@aAAQ7RRMUIVXY+^^__%`~``Pa%bb ccndddeneePfff gFggh%i:iʆ VЊFs^sXG4å>+XϪׯ"k"ڳ-eqD -VM:ȼݼWje86 `[.#O X@Svh{nd s  y O   $ ShQfR#$z$2%335629 :=H>>?@{@PAAVB+CwCCKDDEyFF:GGHHHuIJJJ0KLLMMoNNO_PtPQtQQdRRSSSwT U!U[\\]4]]]l^^__V``ayaa"b7bbWc hhhgijxk 5ëZѬIG&TCEh} sZi~,Vn3 n1: pLa 2    ,   x~7pq !e34}567,7778&9;9PdQQQYRnRRS0TETUabbbcDdYdejfh:ko3ppqr*rr ssittdubvUVp%6?Π[}Vn4o ZP  $')k+,2^BjHNPW_É{rܝB']}xD`[g09{ ]"N$%/'!)*,-f/0Q235-79AQU:YL^`Hbd yɦN ǫeP<]ZN=  += #2B6}9=?sANCEGGHmJ(LN&Q\_-hkkmorqrtDxf{|̌u4mݾC+4pPLk G$()+j-A/91N3C5BEMs_fh4nnu֍˨gzL.R.6W3QaertuTtVc%6?N}p xI}a'bMC  $')^+,2QB]HNPW_ neϝ5~Ppk7SxN Z#,n P"A$%"')}*+-Y/0D235 7~9@QU-Y?^_;bc݆lAXC/zP}MsA0 0#256p9=?fAACEGGH`JLNQ[_ hk^moeqrt7xY{|h'`ָrо6'cC?^ :$()u+]-4/,1A365B EMf_ fh'nauɍث٭Z m?!E!)Jx3 Qaer}tu       ! % ) - 1 5 9 = A E I M Q U Y ] a e i m q u y }  - B R V ] i z   A W [ l p w ,:L\o} "=ARcgn-9\`h3K\ds'>S`p$1BO`dlp}!9Thlz  (05:J]ejoty~ $).38=BGLQV[`ejoty~ !)19AIQY^ty~(Ch~  5Jbgz6;T-HPg,<Wz 7Cbx'7<_y%>FKPX`hpx # + 8 = B G L Q Y | !!$!,!1!9!>![!q!v!{!!!!!!!!!!"""/"I"["j"y""""""""""## ### #%#*#/#4#9#>#C#H#M#R#W#\#a#f#k#s#{################$$$#$($7$F$N$S$[$c$k$s${$$$$$$$$$$$$$% %%%3%;%C%K%P%W%_%d%i%n%s%x%}%%%%%%%%%%%%%%% &&&&;&[&`&|&&&&&&&&&&&&'' '''' '%'*'/'4'9'A'F'K'P'U'Z'_'d'i'x''''''''''''''''''( ((((/(4(9(A(F(N(S([(`(o(t(y(~((((((((((((((((() )%)*)/)4)B)G)L)Q)V)[)z))))))))))*3*U*Z*k********+ +$+)+G+L+T+Y+^+c+h+m+r+w+|+++++++++++++++++++++++++++,, ,,,,!,&,+,0,5,F,\,d,w,|,,,,,,,,,,,,,,,,,- --&-.-6->-K-S-[-c-q-y---------- .%.A.Z.........../ //// /(/0/=/P/X/`/e/~////////0 000(0-050=0E0M0R0Z0_0d0l0t0y00000000000000000001 1111'1/171<1D1L1Q1Y1a1i1q1v1~11111111111111122242J2d2222222222 33)3C3K3e33333334/4L4Q4V4s4x4}44444444445 5555!575R5Z5_5d5l5t5555555555555555556$6)686=6B6X6]6b6g6l6q6v6{6666666677 773787N7S7X7h7m7r7w7|77777777777777777777777777788 8888!8&8+80858:8?8D8I8N8S8X8h8p8x888888888888888889"9'9/979?9G9O9W9_9g9l9q9y9~999999999::>:C:K:S:[:c:k:p:x:}::::::::::::::;;;; ;(;0;8;=;E;J;g;;;;;;;;;;;;;;<<<<+<M<U<Z<b<j<r<z<<<<<<<<<<<<<<<<== =====#=(=-=2=7=<=A=F=K=P=U=]=e=p=u=}===================>>#>+>3>8>@>E>J>R>Z>b>j>o>t>|>>>>>>>>>>>>>>>>>>? ????&?A?F?N?V?[?`?h?p?u?}??????????????????@@@@@&@+@3@;@@@H@P@U@]@e@j@o@w@@@@@@@@@@@@@@@@@@@@@@AA AAAA A%A*A/A4A9A>ACAHAMARAnAsA{AAAAAAAAAAAABBBB B%B-B5B=BEBMBUB]BeBmBuB}BBBBBBBBBBBBBBCC$C,C4CMCMHMMMRMWM\MaMfMkMsM{MMMMMMMMMMMMMMMN)N.N3N;N@NHNPNXN]NeNmNrNwN|NNNNNNNNNNNNNNNNNNNOOO!O*O2O7OSCSHSMSRSWS\SaSfSkSpSuSzSSSSSSSSSSSSSSSSSSSSTTTT&T.T3T;TCTKTST[TcTkTsT{TTTTTTTTTTTTTTTTTUUUU U(U0U8U@UEUMUUUZU_UwU|UUUUUUUUUUV+V0V8V@VHVPVXV]VbVjVrVzVVVVVVVVVVVVVVVVVVVWWW+W=WBWGWLWQWVW[W`WeWjWoWtWyWWWWWWWWWWWWWWX/X7XHXMXUXjXrXzXXXXXXXXXXXXXXXXXYYY$Y)Y1Y6Y;YCYUYZY_YdYiYnYsYxY}YYYYYYYYYYYYYYYYYYYZZ&Z+Z9ZMZRZZZ_ZgZlZ~ZZZZZZZZZZ[ [$[,[1[A[W[\[c[h[p[u[}[[[[[[[[[[[[[[[[[[[\\%\*\2\7\?\G\W\m\r\z\\\\\\\\\\\\\\\\\] ]]]] ]%]*]/]4]9]>]C]H]M]R]W]\]a]f]k]s]|]]]]]]]]]]]^%^*^/^H^f^k^p^^^^^^^^^^^^^^^^^ ___1_9_D_P_U_]_e_p_u_}___________________```` `(`-`<`Q`V`g`o`t```````````aa3a;a@aYa^acakataaaaaaaaaaab bbbb b(b0b8b=bEbMbRbZb_bgblbtb|bbbbbbbbbbbbbbbcc cccCclcqc~ccccccccccd dd)d1d6d;d@dEdJdOdTd\dddldtdddddddddee!e)eCeKeve~eeeeeeeeeefff%f*f2f:fBfJfOfWf_fgflftf|ffffffffffffffffgggg$g,g4gpFpNpVp^pcpkpsp{ppppppppppppppppppq qqqqq#q(q-q2q7qtFtKtStXt`tot~tttttttttttttttttttttuu uuuu$u,u4u9uAuIuRuWu_uguluquyuuuuuuuuuuuuuuuuuuuv vvvv v(v-v5v=vBvJvRv[vhvmvrvwv|vvvvvvvvvvvvvvvvvvvvvvww wwwww#w(w-w2w7wCHQglqĊɊΊӊۊ (08KS[fpy~Ƌϋ؋"+4=HQZcrȌ׌,5>CLU^gox}ɍ؍ #(08@LTairЎ(9BVe}ʏҏۏ ',49AFNS[`hqyȐѐِ"19BJOT\aiqyڑߑ %*2DINSX]es|Ò̒Ւݒ#,5FKP\ao̓ԓܓ%-19=E[ck”ʔҔ*>GOWlʕΕ֕ޕ $)159AEIQUYaw|ĖȖԖٖ *26>BJ_jowɗҗ &15=AIYaot|Ř֘ߘ&/8L[d̙ܙ #+08AIQYafnv~šʚܚ!&.3;DLW_goxƛϛכߛ 5DIQV^ckpu}ǜ'2EJRW_dlt}ŝʝҝםߝ +08=BJOT\ahmuzΞ֞۞$,19LT\dnvŸʟϟן  %-6DMV_dlqy~ ǠϠԠܠ '/4<EPY^ftšʡҡ '/8@INV^f}Ţ͢ڢ&.6DMRZbjsģɣѣڣ "*2:BJRZbjow|äˤ"+38@HMU]ir{ǥޥ&:BR[ckpxƦΦ"'/4<\ainv˧Чاݧ (-5:BGO]bjowŨʨҨרߨ %-BGOT\w|ũʩҩ#(09BKPX]ejqzªʪϪת(-5=EMgowǫЫ٫&/ENV[chpɬѬ !)=EX`rz­˭Эݭ '/8@H]fnwǮЮخ',<AINSX`ejrįׯܯ &+08LT\dlqyưΰް #+38@EMV^ckpx±ʱӱܱ -5PUZbgoIJ˲Ӳز3;DM[`hpyȳгճݳ "*/7<CX`iqv~ŴʴҴ״޴%-2:?GLS\ainvȵѵڵ&/8AFN[`hqzŶͶն޶  %*2KTYafns{ȷͷշڷ߷ $,19AFKSfnw¸ǸϸԸ۸',49AJRZbks|ù˹Թܹ %19>FKSgpͺ%*2;DLQY^fwͻһڻ '7ESX`em}żμӼۼ"*/7<DINS[mx}Ƚͽҽڽ߽ $).6;@HMUZbr{ľɾξ־۾',1FNW_dltſ׿ܿ #,19A_gpy~ "'/=BJOTYafkpw| "+3<DIQlt} 1FOT\ah~)1BJRW_dl !):?GLQY^px!&.<AINV[ckpx}$;@HPX]emu&+0;@ETY^kpu %;@EY^c{ +05:?GLQY^fkpx*/7<Ddiqv~ !)1DNS[`hqv~$,4<AINVdmrz"*8AFNW\dmrz #(05=EJOW\diq%-2:?GLTY^f| #(0?DLQV^chot|!*38AFOT\ainv~ !*27?DIQV^cksx#(05=V^grw  %.3;@HMU]ejrz #(05=BJRW_glt| /7@INV^cks| "',:?DRW\x} '05:BGLTcks )8AW`t}09BKT]fot| %*2MRZ_g~ #(-5:BJOT\mu}  %-5:?GYans{ #+08@PZ_jo~ "*/4<QVhmuz %*27?DLQV^p|%,39?EKQX_fmsy %+17=CIOU[agmsy !'-3:AHOV]dkry !(/6=DKRY`gnu|$+29@GNU\cjqx  '.5<CJQX_fmt{#*18?FMT[bipw~ &-4;BIPW^elsz ")07>ELSZahov} %,3:AHOV]dkry !(/6=DKRY`gnu|$+29@GNU\cjqx  '.5<CJQX_fmt{#*18?FMT[bipw~ &-4;BIPW^elsz ")07>ELSZahov} %,3:AHOV]dkry !(/6=DKRY`gnu|$+29@GNU\cjqx  '.5<CJQX_fmt{#*18?FMT[bipw~ &-4;BIPW^elsz ")07>ELSZahov} %,3:AHOV]dkry !(/6=DKRY`gnu|$+29@GNU\cjqx  '.5<CJQX_fmt{#*18?FMT[bipw~ &-4;BIPW^elsz ")07>ELSZahov} %,3:AHOV]dkry !(/6=DKRY`gnu|$+29@GNU\cjqx  '.5<CJQX_fmt{#*18?FMT[bipw~ &-4;BIPW^elsz ")07>ELSZahov} %,3:AHOV]dkry !(/6=DKRY`gnu|     $ + 2 9 @ G N U \ c j q x                         ' . 5 < C J Q X _ f m t {                        # * 1 8 ? F M T [ b i p w ~                        & - 4 ; B I P W ^ e l s z                        " ) 0 7 > E L S Z a h o v }                    %,3:AHOV]dkry !(/6=DKRY`gnu|$+29@GNU\cjqx  '.5<CJQX_fmt{#*18?FMT[bipw~ &-4;BIPW^elsz ")07>ELSZahov} %,3:AHOV]dkry !(/6=DKRY`gnu|$+29@GNU\cjqx  '.5<CJQX_fmt{#*18?FMT[bipw~ &-4;BIPW^elsz ")07>ELSZahov} %,3:AHOV]dkry !(/6=DKRY`gnu|$+29@GNU\cjqx  '.5<CJQX_fmt{     # * 1 8 ? F M T [ b i p w ~                   ! !!!!&!-!4!;!B!I!P!W!^!e!l!s!z!!!!!!!!!!!!!!!!!!!!" """"")"0"7">"E"L"S"Z"a"h"o"v"}"""""""""""""""""""# ####%#,#3#:#A#H#O#V#]#d#k#r#y####################$ $$$!$($/$6$=$D$K$R$Y$`$g$n$u$|$$$$$$$$$$$$$$$$$$$%%%%%$%+%2%9%@%G%N%U%\%c%j%q%x%%%%%%%%%%%%%%%%%%%%& &&& &'&.&5&<&C&J&Q&X&_&f&m&t&{&&&&&&&&&&&&&&&&&&&'''''#'*'1'8'?'F'M'T'['b'i'p'w'~'''''''''''''''''''( ((((&(-(4(;(B(I(P(W(^(e(l(s(z(((((((((((((((((((() )))")))0)7)>)E)L)S)Z)a)h)o)v)})))))))))))))))))))* ****%*,*3*:*A*H*O*V*]*d*k*r*y********************+ +++!+(+/+6+=+D+K+R+Y+`+g+n+u+|+++++++++++++++++++,,,,,$,+,2,9,@,G,N,U,\,c,j,q,x,,,,,,,,,,,,,,,,,,,,- --- -'-.-5-<-C-J-Q-X-_-f-m-t-{-------------------.....#.*.1.8.?.F.M.T.[.b.i.p.w.~.................../ ////&/-/4/;/B/I/P/W/^/e/l/s/z////////////////////0 000"0)00070>0E0L0S0Z0a0h0o0v0}00000000000000000001 1111%1,131:1A1H1O1V1]1d1k1r1y111111111111111111112 222!2(2/262=2D2K2R2Y2`2g2n2u2|22222222UVs%6?Ѡ^Yq6q \R   % , 3 : A $')n+,- -2`BlHNPPPPWWW_ʼn}uޝDï1)!_{Gc]j2;} _"P$%1'#)* ,-h/0S235/79AQU=YN^``Jbd d'd.d7dBdMdTd[dcd,4<{̦P ɫϱgS>_\PW^r  -@ #2E69=?uAVCjCEGGHoJ*LN4QHQ\Q\__/h knmouqrtFxi{|Όx6oF6J7s&0:DNm I$()+l-C/;1P3E5B6EJE^ErEEEEMu_fh6npu؍ͨi !+5|N0T08Y333$Q,Qaeeeertu $ % & ' ( ) * y z { | } ~  (2 )2 *2 +2 ,2 -2 n n sp tp up vp wp xp yp zp {p |p }p u w w Nx Ox Px Qx Rx           a H I J K L M N O P n O P Q R S T 9   ۏ e f g h z { | L M C D E F G H I J K L M N O P Q ( ( ( ( ( ( ( ( ( u u u u u u u u K # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 U V W ܙ ݙ ޙ ߙ 4444444>>FDGDHDIDEEFGGGHHIISJaKbKcKdKeKfKgKhKiKjKkKlKmKnKoKpKqKrKsKtKuKvKWKX]]]]]BkCkDk{{ ghijklmUNOPQRSW.aH1I1J1K1L1NNNNNfffffffffQ789:;<=>?@A  _`axyz{|}~*******#JsZtZuZvZwZxZyZzZ{Z|Z}Zcddffff#f(f-f2f7foCoUpVpWpXpwwwwwwO|P|K}L}M}N}O}P}Q}R}S}T}U}V}W}X}Y}Z}[}\}]}^}_}`}a}b}c}d}e}f}g}+++.......CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC*W+WWWWWWWWWWW]^^^^^^^^^^8bbe e e e eghhhhhhkzllmmlomonooopoqqqqqawbwcwdwewfwgwhwiwjwkwlwmwnwowpwqwrwswtwuwvwwwxwywY*+,-   UVWXYZ,-./012%%%%%%%%%% %!%"%AAAAAZS[S\S]Sffffffffpp.r3rEsFsGsHsxxxxtzuzvzwzxzyz~~~~~~~~~~~bcdeYZ[\]ԍ àϬЬѬҬӬԬլ֬׬ج٬ڬ۬ܬݬެ[BG=Bd{|}~D+0 !"#$%&'()*+,-.;;;; T|UW}XXXXZZZZZZZZZZZZZZZϰаѰҰӰOZŴʴϴ,1ҹW123456789:; &+ $%w|U p!)#.#&(()++799<<=@AA3CVDFFFFMMMMMMMMM M M M M MMMMMMMMMMMMMMMgshxh=i>i?i@iAiBiCiDiEiFiGiHiIiJiKiLiMiNiOiPiQiRiSiTiUiVi7ɭ`д !B\e8 LQV[`\afkp|v{k!&+  !!!!!!!!!!!!!!!..o/60<011222233334455gwhwyyyyyyyefghbklmnopqrst./0zuvwxyz{|}~\=>?@ABCDE/0123456789:;y\)*+,nsx}     """""F$G$H$>%C%H%u&v&w&x&'''',))H.I.J.K.L.M.N.O.P.Q.R.S.T.U.V.W.X.Y.Z.[.̀z{|}~ou=0123 ~   Q½M.3Sdn(!o  a39 &'R((R*+N..9445BGC"IIoJK2OO^RRZ[=``̈́Z/$sHԕx9Wͮ/Cŵxq  8P&jHU!y!"j#$K&'<()"+,-.0k12g44G679[:0;qAAGRRVZ^ _``abcVgghJifV+WΣDӥ["hߪ"2 JjuпFk3_hPt   _  4 xvb$$533*7W:X>>@@AfB[DDFJG)HIIJ@KL+MNNOP"SST1U\D]]|^ _aaGbbgchknppqnss=uuvvw yyyz{P}D'.  /qpF|  qA    !$>%(+**,,-^./U01l23b45r6C2D IINOO|P QQ&``aasbLccldSffgGh!iinxoodp>qq`r#vv wwxxyyIzJzKzLzMzNzOzPzQzRzSzTzUzVzWzXz݁ނʃYƆˆY^ʉYЎPu>FGHIJKLMNOPQRSTUڜ۝ǞVáȡV[| ǤNũEjy#6dU&"JqB   <  )#+  !<778K9Q~RRSUTrbbcidCppq:r0ssuv  p !Q6hRd  $X*..&39:?1@B'CGHJKQLMNU+V"VVTWWXqXX/Y"YYZZZ[z[[;\\\[]]^x^#^G#__`s `` q0,-n.q~\qLKNXPh^ixxyz%z z     5v&+7z4wM@B + .2 n ~p u w Sx  f Q s U >  i } N R ( u L 6 X 4>JDEJFGHHI>JXJwKW6XPX]Ek{!nZTp\3bM1NfVBaί ȱ8b*$J~ZcdFfnIu}P/(̣mѴT+/nV/@X nHoYpwQ|h}++ .C,WW]^=bb eghhklrmqoqzw^. [3#%A^Sfp8rIsxzz~f^ٍĠ߬`LGiI5/;TUWX0ZXZZ԰T[Դض6׹\< 0 !&Z q!3#&()+7:9<=@AA8C[DFMg}hWi8έaմ "Gaj9eu}l0# !.t/B0!11"22$334445iwoxyi"gEu1#aF<~a- "I$M%y&'-))\.р{B 4 !;VýR8Xis - &Xt3  f8> &'W((W*+S..>445BLC'IItJKK7OOcRRZ [B``҄C_4 )xMڋٕ}>\Ү4Hʵ}#v=U+oMZ& ~!"o#$P&'A()'+,-.0p12l44L679`:5;vAALRRVZ^%_`eab c[ggh3iPi k[0l\ӣ-Iإ`'m'7OoּezտK p8 d"mUy $   d  9a} _|g$$:33/7\:]>>@@AkB`DDFOG.HIIJEKL0MNNOmPP S'SSSTU7U\\-]I]]]^_`aaa0bMbblchhuik!nupqsss&uBuuuvvwwxyyyzzz{U}I,3 %4GwWuLvFit $!$C%(0**,,-c./Z01q23g46w6C7DIIkNNNOOePPQQ`+```aaxb5cRccqdXffg0hMh&iinnao}ooip'qDqqer v(vvvwwax~xyyYzσ^Іcω^Վ9VzCVߜ̞[͡`̤Sʩ.Ko~(;ivwZ+|(OZv + G    A   .(0 "!%7A777849Q9QQgRRRS>T[TwbbcRdodHppq#r@r5ssuv3657:9482                                               *+WVU      **r                      A=>CDB                                    (   *****++++****+++            wwwwwÇwwwXřǙșəʙ˙G*R{9  Fppp opopo2Ы 諯U W$'WׁÇ(Wׁ'WׁWŞWŞWŞWŞWŞWŞWŞWŞWŞWŞWŞWŞWŞWŞWWWWWWWWWWWWԏWWW XX&&X&  W̌X    UX&&&WX ÇX ÇX#WїX  ;:X  ;:_ۆ ٤_ۆ_ۆ_ۆ_$׈$$_σ_ٛԛ_ װ_ׁЄÇ(_ׁЄ'_ׁЄ캯_ׁЄMMMMM 60_ׁЄ_ׁЄ_ÇЄ(__Є'_ۆ _ۆ _  cI!dE <EI%  ̹)%U   *kl_%&;꾯_%)꾯_  {{5%ai%۾)%U_%&;_%)_װ_װ _ۆŞfۆf(ffff fffffׁfÇffffffŞffff06&Jh_>tffffffffff Ț  ̹j jɯd Ŝ    QUg00a0."> mg˯˯ ׁ  ׁ   Ț;)&;)٤    ٤Țgggggggg g!g#g#g%g%g'g)g)g*g+g1g7g8g:g<g>g>g@gAgBgCgDgLgMgQgQgTgVgpgvgyg}g g˯ ˯ U ˯گ  ̊̊ϊЊD^)cOppp opopo2Ы Ič ̊̊ϊЊD^)cOppp opopo2Ы  Uč  ׁ ׁ  Ț ljk#Ț&;)ȚDefaultFrequencyRank vȚ뺯캯e΃eppp opopo2Ыeppp opopo2Ыe e͊+eppp opopo2Ыeppp opopo2Ыe* ׁ ׁ  U    ׁU  ׁ     U  U   Ț ۾)&;)e iC[^2ׁ۾)&;)۾)&;)۾)&;)Jɯ?       Ş  DTakeII]ێێRepeatݎelementNJH"DÇCloned:^/RevFœrMN+DÇ+DII]ێێݎNJH"D̊̊ϊЊD^)cOFœrMNCopied;غv+iD̊̊ϊЊD^)cOܯݯUD̊̊ϊЊD^)cOۯ;UDII]ێێݎNJH"  9Ț9ˣÜĜŜƜǜȜ_w 3f*ہȚõõĵ AllocError ]YO^`U9  88ArcInner8strong787871%wxdȚU:DDÇDD;3ɯ MaybeUninituninitW췜     RawTableInner  bucket_mask K ctrl K  growth_left K items KTGפÇݪ   ljk# ljk#ݪ½ƼޚÇݪÇ  &22$2.\*="řǙșəʙ˙G*R{9 ˎ22$2.\*="CCC=C= ljk#ˎ22$2.\*="22$2.\*="ٹ22$2.\*="22$2.\*="θ22$2.\*="22$2.\*="111.1.?3 *r111.1.?3 *rٹ111.1.?3 *r111.1.?3 *rθ111.1.?3 *r111.1.?3 *r112.2.2 .뜿Er112.2.2 .뜿Erٹ112.2.2 .뜿Er112.2.2 .뜿Erθ112.2.2 .뜿Erֺ [ң Ɩ&$CCC=C=(((( Yڡ66666$666M3Tr CCC=C= ScalarRange 2s[« ½ƼٹCCC=C=ÿ ϻCCC=C=ÇÇ &  )88Weak8 787=֍B  888 787=֍B&ܑ888 787=֍Bܑ888 787=֍Bܑ888 787=֍Bܑ888 787=֍BԻܑ888 787=֍BȚܑ888 787=֍Bܑ888787871%wxdѶ]jFNv888787871%wxdѶ]jFNv888787871%wxdѶ]jFNv888787871%wxdѶ]jFNv888787871%wxdѶ]jFNv888787871%wxdѶ]jFNv888787871%wxdѶ]jFNv888787871%wxd888787871%wxd888787871%wxd888787871%wxd888787871%wxd888787871%wxdؓ888787871%wxd888787871%wxdԻ888787871%wxd888787871%wxd888787871%wxd  ljk#W췜̡ ljk#W췜 ljk#P Cˎ + ljk#InvalidInputAnchoredInvalidInputUnanchoredUnsupportedStreamUnsupportedOverlappingUnsupportedEmpty˖ļ((RawVec+,XՔ((+,XՔ((+,XՔ((+,XՔ((+,XՔދ((+,XՔ((+,XՔ ((+,XՔ((+,XՔ̻((+,XՔ((+,XՔÇ((+,XՔ((+,XՔ((+,XՔ((+,XՔ((+,XՔ((+,XՔ((+,XՔ((+,XՔ((+,XՔ((+,XՔ((+,XՔ((+,XՔ((+,XՔ((+,XՔȽ((+,XՔ((+,XՔ((+,XՔ((+,XՔ((+,XՔ((+,XՔ((+,XՔ((+,XՔ((+,XՔ((+,XՔ  ScopeGuard dropfn   ڻ>  Uܑ   TableLayout  K  ctrl_align Kk%   Լ   ڻ>   RawTable  K  K   K:1{ho  U   Լ   ڻ>   UřǙșəʙ˙G*R{9     hash_builder   jSׁ       jS   ˾  K  K   K:1{ho777Os7677Simple7677 SimpleMessage7677Custom76VN7O CustomOwner6 fDIntoIter(AzFoqf캯İ(AzFoqfİ(AzFoqfИ$@ ܋<< 0{?iŰ܋<< 0{?iư܋<< 0{?iǰ!ԧI|neƃ$!ԧI|ne@ۧދ ll CopyOnDroplsrcllĨlllnȘΉqjj MergeStatejjjjjĨjAd  DropOnPanic  |z.33 DropGuard323num_init2izQ:C33̰323̰2izQ:C33̰323̰2izQ:C33̰323̰2izQ:C33̰323̰2izQ:C33̰323̰2izQ:C33̰323̰2izQ:C33̰323̰2izQ:C33̰323̰2izQ:C33̰323̰2izQ:C33̰323̰2izQ:C33̰323̰2izQ:CDU BB SetLenOnDropBBB local_lenBDÇ\ ÇհDǑ6U հDU հD;U հDװװDIUհDÇiQְUְÇUذiDQװUװٰٰD͊ÇQÇհذհ͊UٰDݯQְְٰݯUڰ;Çذ ÇUذٰذڰٰI԰U԰IְUְIװUװ>G range_stackgP}h %Ű׈$ˎŏӑؓם˞ݪۆ݃9'4(T `  ܁T666ߏ6666 BiθԻȽװޠޚ  ދ>       yy̻[ÇÇ[[ a a6Ű6 77İ767@67 error_drop67 outer_drop6*I]@DŰUMNNNkɯlɯlɯmɯmɯmɯmɯlɯjɯjɯjɯjɯjjɯ  U ɯjɯjɯwÇwAAÇAAg˯333333333333iBBB DefaultHasherB ldaDiذDۯٰDppp opopo2Ы;USUDSDܯڰDppp opopo2Ы)UD<+Çذ;Ț; Ϩ;čٰ;;;D;;UD; ݯUčڰUD))UD)iiiiȚiI԰IְIװFذF+ٰI԰IְIװ;Çٰ<+Rm[}OD^U3̻3Ç3,DÇ+DDDDDDDÇDÇ++̻Q**¨**/e ppp opopo2ЫQۯܯQۯQppp opopo2Ы̻P+ٰP+۰S+ÇR+<͊ڰU QQQܯQܯݯQQR۰RܰRܰQְRϻQװS̊̊ϊЊD^)cORS̊̊ϊЊD^)cORRϻQְS̊̊ϊЊD^)cORS̊̊ϊЊD^)cORQiQÇSÇQհQLL==J/V܋<< 0{?i+R쇱Q쇱R+i i  i i &&&&&;; ٤ Ϩ;č Ič č ݯč;뺯캯 U  U ;  ð ;    ɍ ;   ; ۾)۾)꾯&;&;꾯))꾯 DհհDÇ\ְDְְDְְDװװDװװDװװԛ    ;:  ;: ׁ    ׁ  Ț ׁDÇiذذذDٰٰٰD͊ÇٰڰڰD;D;DݯڰڰڰD)D);Çذ۰۰jɯRSQÇհذڰQְذذQְٰڰQװٰٰI԰۰ܰIְܰܰIװܰܰ<͊݀뀱$mřǙșəʙ˙G*R{9  řǙșəʙ˙G*R{9 ˯ ˯Uگ        FՌڗ       99:$6 CCCCCދCC C̻CCÇCCCCCCCCCCCCCCCCCCC33Ç233wxwwwσw x̻w̻wwxÇxÇwÇwÇwÇwÇxxwwwwwwwwwwwȽwwwwwwwwwwwxxwW XWWXX ljk#WWWWWWˎWWWWʟWʟWWWWWÇWÇWWWWWWWWXWXWWWWWWXWWWWWWWWWXWXWWWWW W WWWXXXXXWXWW_řǙșəʙ˙G*R{9 ҩW_&%_ׁЄ_Ç___+__׈$_׈$ˎ ׁHkj ׁ hڦڦۦ Sip13Rounds I%@@+ppp opopo2Ы+ppp opopo2ЫȽ+ppp opopo2ЫDDÇD ׁ   XXׁXÇXˎ   **ppp opopohEC8Gׁ  DDÇDDDaaaaFFFFދFF F̻FÇFFFFFFFFFFFFȽFFFFFFFFFpppσp ppÇpppppppȽpppppppˎ 6##   )캯)MMMMMދMދMMM M M̻M̻MÇMÇMMMMM  +y`0 M˱MMMMMMMMMMMMMMMMMȽMȽMMMMMMMMMMMMMMMMMMCCCCCCCCCދCCCC̻C̻CCCCÇCÇCÇCÇCÇCÇCÇCÇCÇCÇCCCC  n)CXvD(C  faildepth#_v⅏>GCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCȽCȽCCCCCCCCCCCCCCCCCCCCCCCCCCC@ppÇpppp888И8888888888ؓ88Ի8888888  9 9&9999Ի9Ț999911ٹ11θ11111ٹ1ٹ111θ1θ1111   Ț ̹ȚȚȚBÇ+BÇ+BBBÇ+""""'PPP̊̊ϊЊD^)cOPۯPPܯPPPJJJJ by]PPPPPeekableFpeekedF·|&P܋<< 0{?iP܋<< 0{?iPȰPȰPɰP܋<< 0{?ippp opopo2Ы̹P쇱P܋<< 0{?iP܋<< 0{?ippp opopo2ЫP܋<< 0{?ippp opopo2ЫP܋<< 0{?iP܋<< 0{?iP܋<< 0{?iP܋<< 0{?iեPP܋<< 0{?iPPPPPP+PPPܯPPPppp opopo2ЫP*PPppp opopohEC8GÇPppp opopohEC8GPppp opopohEC8GPppp opopohEC8GP++++N[-P++++N[-ڻP++++N[-PP**¨**/e PPܰPP+PPPPPPNNNNNN 333333333333pnnnnnnnnnnnnÇnÇnÇnnnnnnnnnnnnnnnȽnnnnnnnnnnnnDiDDۯܯDۯDDDܯݯDܯDD<ppp opopo2Ы=*j********Ç*;ׁׁ++ڻ+RRRRRދRR RR̻RRÇRRRRRRRRRRRRRRȽRRRRRRRRRR   ޯޯŞۆۆŞŞ٤٤ɯɯ̹BÇ#=쇱% ңNJ [  ljk# PropertiesI  maximum_lenʒ2look_set_prefixlook_set_suffixlook_set_suffix_anyexplicit_captures_lenstatic_explicit_captures_lenalternation_literalpw)j+Ө0'm% ٛ %ؓʟׁЄÇإ%Ƚ**;;*Ç*Ƚ+Ç+++Ƚ+++Ç++++σ ̻ÇÇȽǩΩÇΩÇȽCÇ)캯))noo̻ƃ$@ˎ hhhLKppp opopo2ЫKѨX XXXXXXXXXXXXXȫ"*캯**oo̻*Moo̻oÇolׁ DDDDDσD D̻DÇDDDDDDDȽDDDDDX XXXXXXXX(DDDÇDDD ΦۧˎȨ33>ۯ: :&::::Ի:Ț: ׁYY;Y&YYÇYYYŞYYYY&YYYYɡYYYYYYYYYY&Y YߠAYYYY YYYŞYYYYɡYYYYYYߠAYÇYÇYÇYYYY˗AYM: ܑ:&ܑ:ܑ:ܑ:ܑ:Իܑ:Țܑ:ܑ:Ț:222θ2:Ț:22ٹ22θ22 [ʟ;&;;;Ի;;LBBÇBBBBBBB"")캯))p̹p̻pppppMFF+F+JѨJIII;Ç;+ÇF<<<Ű<ư<ǰ<<<ۯ<<+<ppp opopo2Ы<<ppp opopo2Ы<<ppp opopo2Ы<ppp opopo2Ы<<ppp opopo2Ы<ppp opopo2Ы<<Ѩ<<*<*<<ե<<<<jDDDD̻DÇDDDDDDDDDD*DDDDDDÇDÇDDDDӕDDDDDȽDDDDDӕDDDDDDDDÇDDDDDDDDDDDD++̻++̻$$D DD  DȽ+̻$$EȨEEEEEދEE EE̻EEÇEEEEEEEEEEEEEEȽEEEEEEEEEEEEEÇEEEȽEEE``ۆ`ۆ`ۆ``ۆ` `σ``װ`&%`ؓ```ׁ`Çۆ`Ç`Çװ``װ`````ۆ``      ё&  9    & ̒&  V-%`           ё& 9  & ̒& )%`%`%`%`װ`````װ`װ`````ۆ````װEEEE EÇEE`ۆ``ۆۆ`ۆۆ```ۆۆ``ۆ`ۆۆ` `%%%``ވ`ؓ``Ç`Çװװ`װװ````ۆۆ```%%`װװ`װװ`װװ`װװ`װװ`````ۆۆ``װװhhhh hÇhhh99 9&9999Ի9Ț9E: :&::::Ի:Ț:11ٹ11θ11 ׁQŰQưQǰQQQۯQS+Q+QQQQڻKѨQQ*QQQQQRRRRS     QÇÇÇÇQ+QեQiiQװװװװ                                                                                                                                                          N                                                                                                                                                                                                                                                           e,;}Vcore_intrinsicsderive_clone_copy_internalsÂIz]\91pc$]ÂIz]22Eڗ ҩ  fmt_internalsfmt_arguments_from_strÂIz]e1ٯq, } ۛfmt_helpers_for_deriveggÂIz]Iew%ÂIz]S8 4ÂIz]Yc?T^q,ۛŝggÂIz]*E  ÂIz]¬bÂIz]"IV9,fq, 3ۛŝggÂIz],Pl q,VkۛŝggÂIz]?߬ÂIz]ɵ% N~2,ei_ۛderive_eq_internalsÂIz]!G?M$q,ۛŝggÂIz]/}^؉c2e:,8ۛ훳ÂIz]aHiV-vOÂIz] 3nq,YۛŝggÂIz]n];;ÂIz]ΠupEAz(" hint_must_useliballoc_internalsÂIz] ѕ$crate::panic::unreachable_2021.`[ZÂIz]\_Ao$uۛ훳  ÂIz],0>DqK,%ۛŝggÂIz]`#P]  ÂIz]yn6 ÂIz];].q,A ۛŝggÂIz]< í-G[ZÂIz]29+Hn ÂIz]xo 2ÂIz]'Ba  ÂIz]&|>Q) ÂIz][yoCR.$crate::thread::local_impl::thread_local_inner hQaethread_local_internals gfÂIz]JH No$ zۛ훳  ÂIz]i'cÂIz]Obp|Ď  ÂIz]3s e,2,l ۛ훳ÂIz]caؔcrp ÂIz]v,E ÂIz]n`"`U뜳ÂIz]7U]ylQe,ۛ훳ÂIz] q, 9ۛŝggÂIz] KB|?@ ۛÂIz]&mO,{] ÂIz]0PMQ8%^ÂIz]GjY~_d!  ÂIz]QT 뜳ÂIz]ĥ?sFe, Qۛ훳ÂIz]t7E ÂIz]eȒXÂIz]_=ERÂIz]߮a`G6q,(3ۛŝggÂIz]jo!?D "`뜳ÂIz]R+&b* ÂIz]stÏ \ÂIz]+Fq, ۛŝggÂIz]񫕭~,wۛÂIz]Ɣ1O ÂIz]vp2 e,Kۛ훳ÂIz]MA}oHjÂIz]q4Bj ɽÂIz]S-'n5ÂIz]'.e,?Pۛ훳ÂIz]YFGYQ  ÂIz]p^t7zÂIz]I^0Pe,ۛ훳ÂIz]Z[g6՘íp [ZÂIz]U`Cq,{ۛŝggÂIz]zHڳ 5ÂIz]Ů0`|vo$ sۛ훳  ÂIz]JRe,,ۛ훳ÂIz]Y $ÂIz]j mG8q,@#{ۛŝggÂIz]8P~  ,ۛÂIz]j![U- ÂIz]?'w4 ÂIz]W{e0,4ۛ훳ÂIz]źq,/ۛŝggÂIz]Z\ZZc Ԥ뜳ÂIz]>QPuÂIz]DED ÂIz]mc$u=ۛiiÂIz]d'_إ ÂIz]DH{/1q, ۛŝggÂIz]"ÂIz]ި,~|?RۛÂIz]i].U wÂIz]~ffqiq,8% ۛŝggÂIz]pfq;,D!ÂIz]NCD8h  ÂIz]6\ I !ÂIz]:<q, N!ۛŝggÂIz]C,apÂIz]tIEG!ÂIz]{(Nq,a(!ۛŝggÂIz]2`8  ÂIz]ryrP: ÂIz]:NJNe,a#ۛ훳ÂIz],)`>m8#ÂIz]|@aq,q,"ۛŝggÂIz]Ǻv}S ÂIz]΀`]BL ۛÂIz] 8 $ÂIz]"׆ Xo뜳ÂIz]&<Je,$ۛ훳ÂIz]@4{ -ÂIz]շ.@r$,ۛiiÂIz]wvtė0eA,e%ۛ훳ÂIz]v@y]/ X ÂIz],njepÂIz]֎ˈxq,%ۛŝggÂIz]:'[mem, 7&ۛ훳ÂIz]SOU &ÂIz]6JyƠCq,%ۛŝggÂIz])951q, %ۛŝggÂIz].wjL[#ۛÂIz]ƏOl`3ÂIz]r#" FW 'ÂIz]dnsye, 'ۛ훳ÂIz]p׀l}'ÂIz]:]U3 ÂIz]?+ e,%#4(ۛ훳ÂIz] Q]gz Ⱦ,(ÂIz]t:2'&>(ÂIz]D0l(ÂIz]w)o$ۛ훳  ÂIz]zvHD/ ÂIz]h/=_ )ÂIz][q1oq,"-(ۛŝggÂIz]?i)ÂIz]@OA "ÂIz]ho"`뜳ÂIz]1z9Gi ÂIz] e,ؚ*ۛ훳ÂIz]}FgP qW,)ۛŝggÂIz]ne ÂIz]Ƒgm*r< 'ۛÂIz]keRe|,?g+ۛ훳ÂIz]$j@g ÂIz]!"QEq,=*ۛŝggÂIz]N<e,P ,ۛ훳ÂIz]wf;l +ÂIz].AÂIz]h&@, ÂIz]2bxe,",ۛ훳ÂIz]A䉾QT ÂIz] O->{) ,ÂIz]ѨMyq,v,ۛŝggÂIz]>aL.n~l,*ۛÂIz]7? 'j m-ÂIz]ǩue ( ,.ۛ훳ÂIz]ETK`q,X-ۛŝggÂIz]z Y΃ hf뜳ÂIz]*_e,F.ۛ훳ÂIz]b ˖ ÂIz]eQ ÂIz]Ｚ.ÂIz]Z5ۋL+ۛÂIz]֜c? E/ÂIz]\'($ÂIz]Wue,0ۛ훳ÂIz] Ge,[A0ۛ훳ÂIz]Uھ0ÂIz]8솠ÂIz]nBJ (ÂIz]"-3f1f,0ÂIz]\mu?o$ 'ۛ훳  ÂIz] ͒  1ÂIz]Wwq 뭵ÂIz]#< &,m1ÂIz]I[-ڡ1ÂIz]q³Lq,H1ۛŝggÂIz]`ҭ`ؑ2ÂIz]}M:_e+,2ۛ훳ÂIz]A|KT~f0ۛÂIz]]q,(2ۛŝggÂIz]YSEq? ÂIz]',q,ˉ2ۛŝggÂIz]u}~0ۛÂIz]-3 lА ÂIz]Q+n3ÂIz]$0q, 0[3ۛŝggÂIz]XO~;1ۛÂIz]9w\LÂIz]yÏypί4ÂIz]FpÂIz]Tmb  ķÂIz]F!֚S e, s5ۛ훳ÂIz] O 7e,5ۛ훳ÂIz]Kv>D/T2,_ۛÂIz]}&yUjq,=5ۛŝggÂIz]v^vZ?q,nt5ۛŝggÂIz]v8nϜ ,16ÂIz]TNmq,5ۛŝggÂIz]W ȅ ÂIz]0ei,+7ۛ훳ÂIz]LTe,g7ۛ훳ÂIz]ke,7ۛ훳ÂIz]bveG  ÂIz]SeCe,w 8ۛ훳ÂIz]fJdfx$crate::assertɛT]]ۛgeneric_assert_internalsÂIz]e<o$`/ۛ훳  ÂIz][/6[.8ÂIz]1$L_wR 뜳ÂIz]S>5>ÂIz]23r|_a6>ÂIz]+%MJ셔 F9ÂIz]ÂIz]D۞aT,ۛÂIz]֡y.G #9ÂIz]9[Fq,~9ۛŝggÂIz]C . 8:ÂIz]}߇3_~Ă8ۛÂIz]4 əÂIz]%BQ"`(뜳ÂIz]%h2L8ۛÂIz]"09 lݍ ÂIz]}- ÂIz]/0N~uĎ<ÂIz]+t]lUuɓ T]YۛÌÂIz]}Qoq, <ۛŝggÂIz](NVÂIz]S->}ÂIz]R[B+!=ÂIz]ذ "`d+뜳ÂIz]qR- =ÂIz]Ze,  >ۛ훳ÂIz]񭈶Mq,Ov=ۛŝggÂIz]qFܭOr<2,~:ۛÂIz] ξ뼋! b>ÂIz]>?$V~q,<>ۛŝggÂIz]B!w ̓~,]ÂIz]_iYe,_?ۛ훳ÂIz]n%#~<ۛÂIz]#,p6CLq,>ۛŝggÂIz]dZ0E+?ÂIz]˲.1q,Z?ۛŝggÂIz]F^F(q,X ?ۛŝggÂIz](D'&< ÂIz]=ތuPG6ÂIz]}O@q,%)@ۛŝggÂIz]TުÂIz]2iwL >ۛÂIz]B5 <1ÂIz]i,~(b ÂIz]_be,+Bۛ훳ÂIz]>رiN,;ÂIz]K(G[e, nBۛ훳ÂIz];slDqÂIz]xWF>tBÂIz]w$BTr<,>ۛÂIz]582BÂIz] LKUte,<hCۛ훳ÂIz]Jcie,Cۛ훳ÂIz]Ҧ ÂIz]+}?eK,$Dۛ훳ÂIz]Uf0e,JDۛ훳ÂIz]Y~6"DÂIz]Hi,e,Dۛ훳ÂIz]{:K9 ÂIz]= ˛CAÂIz] {+LAۛÂIz]YM)q, DۛŝggÂIz]^eu([EÂIz]@6$crate::thread::local_impl::thread_local_process_attrs Xa3$aղÂIz]ڿRe, _Fۛ훳ÂIz]+T>y e: ÂIz]0b_AÂIz]Sw#q,G#FۛŝggÂIz]*P(qÂIz]~9q,HyFۛŝggÂIz]!nQJ ÂIz]:"`n5뜳ÂIz]7 %o5$ޯ>ۛ훳  ÂIz]jLTIۛÂIz]v4 ÂIz]ZfGGÂIz]։SLLEۛÂIz]Apoq,τHۛŝggÂIz]a~}m~FۛÂIz]4 S|7= ÂIz]5U/ "`S7뜳ÂIz]VI_%ۛÌÂIz]0U4͑ÂIz]LmmT' IÂIz]9~z(q, IۛŝggÂIz];ژe, Jۛ훳ÂIz]0<ÂIz]|zKD3e,Z* Kۛ훳ÂIz]np\ ÂIz]KԱ;s|ÂIz]5; WKÂIz]cu ÂIz]x]׆:T,$ۛÂIz]P}!O&KÂIz]bڷU+ÂIz]w%#2LÂIz]\?"1&e ( Ѿ,Lۛ훳ÂIz] _e,Mۛ훳ÂIz]?|A ÂIz]. ÂIz]̵\(y\`F[ZÂIz]!8Vק y뜳ÂIz]ab,ke,RNۛ훳ÂIz]Y jRq,ƟgMۛŝggÂIz] Prok;ÂIz]w$;V ÂIz]X_J {\`H[ZÂIz]:H\q\qo,:NۛŝggÂIz]ˁ KTLKۛÂIz]Ly',OÂIz]弉  "ÂIz]~~Lљíp F[ZÂIz]-`aOÂIz]SOUe,ƆJPۛ훳ÂIz]Ts>ÂIz]k1~ Bq, OۛŝggÂIz]#-P$,0ۛiiÂIz]=P5ÂIz]?*~>rUÂIz]a=UmL TۛÂIz]d4o$$-#ÂIz]N;v~y+e,8%]ۛ훳ÂIz]06q, i\ۛŝggÂIz]T?" n ÂIz]( ÂIz]Ԍ9gxÂIz]b#5e,Z(^ۛ훳ÂIz]B>btÂIz]Cϯ 5`de,^ۛ훳ÂIz]H:e,p,^ۛ훳ÂIz]N):7?^ÂIz]{sA&~s\ۛÂIz]P`H̩ ^ÂIz]˷'J;ÂIz]ل͕ H ,E\ۛÂIz]."CA ÂIz]n/(+_ÂIz] Kzsq@,h_ۛŝggÂIz]e/r~,]ۛÂIz]OQ%C``ÂIz],iÂIz]D$ ÂIz]՞Rsr<<]ۛÂIz]i !fue,aۛ훳ÂIz] 4U ÂIz]OQVBOe, aۛ훳ÂIz]E]_C~[_ۛÂIz]"P  %ÂIz]ap["ב $ED\`^[ZÂIz]K$\H5AÂIz]^~ި:qV,dۛŝggÂIz]XKC2HL܉bۛÂIz]$~%o$\ۛ훳  ÂIz]m Bxo$=]ۛ훳  ÂIz]e r< bۛÂIz]RU¡q,a&eۛŝggÂIz]^Qe  ÂIz]{1y;^ÂIz].a aKmq,"fۛŝggÂIz]dJq,fۛŝggÂIz]oŠq,l,fۛŝggÂIz]U=FۛÌÂIz](sY  ÂIz]'gB  \`p[ZÂIz]' XÂIz]_/ɩqt,!wۛŝggÂIz]ky" } 뜳ÂIz]澏ug]wÂIz]HڴSe, }xۛ훳ÂIz]4qԡ 2ÂIz]2N[7ߍzxÂIz]* r0(+xÂIz]z Y Ք5jr[ZÂIz]!V_q, xۛŝggÂIz]a!l\ KyÂIz]Rbɭ  ÂIz]i+q,2,'yۛŝggÂIz]_?~"r<0vۛÂIz]-fGAe,<xzۛ훳ÂIz]YDq ( ؾ,yۛŝggÂIz]u)j<0zÂIz]2 g ÂIz][e\ o$qۛ훳  ÂIz]_qe,zۛŝggÂIz]AI4'&+e,{ۛ훳ÂIz]vv{ÂIz]ND~"Zr<xۛÂIz]#}ZGdHq,R j{ۛŝggÂIz]R[q,{ۛŝggÂIz]!ތ3Ӄ%[|ÂIz]oeP "`j뜳ÂIz] ,5ҽrs %ÂIz]a~=v~ zۛÂIz]\qєFNÂIz]1>Gq, |ۛŝggÂIz]HC  lˬÂIz]od{q,(+A}ۛŝggÂIz]ђE,}ÂIz]Mǵq,j }ۛŝggÂIz]b[  ÂIz]6 h~Qo$,uۛ훳  ÂIz]RW:*  8뜳ÂIz]!dq,!z~ۛŝggÂIz]mfQ.>>q,~ۛŝggÂIz]!}ڤf ÂIz]@\:ÂIz][WG-qJ,=?ۛŝggÂIz]ΧC "`n뜳ÂIz]R q,ۛŝggÂIz]zI2  ÂIz]tzw1aÂIz]J" ÂIz]ȱ;`~~ۛÂIz]m1Wq, ۛŝggÂIz]zWc  ÂIz]ԗe (ÂIz]S'e] ՁÂIz]lr C,QuۛÂIz]z6He,G#ۛ훳ÂIz]D]sÂIz]53i$mle,Hۛ훳ÂIz]2l6r$\`q|[ZÂIz]—p<e5,ׯ|ۛ훳ÂIz][Q)3QKSÂIz]~WC5LqۛÂIz]F:SKRÂIz]VDS~ۛÂIz]s+LJe,Ȅۛ훳ÂIz]wE}).cÂIz]2Zn q,1 ۛŝggÂIz]x믣q},mFۛŝggÂIz]4lS,l ÂIz]vYD ÂIz]1ۡձ& %~[ZÂIz]ec\ %ÂIz]Ě؈>7w ȅÂIz]%tO.Ee, Zۛ훳ÂIz]'ÂIz]\1t߭ lÂIz])oq,a)ۛŝggÂIz]g%V6pl&,ÂIz]k% { ÂIz]qdjke,! ۛ훳ÂIz]du  ÂIz]~_F<ÂIz]]vB_~qۛÂIz]&@`eo,^ۛ훳ÂIz]e|g0|;݄ÂIz]2 íp [ZÂIz]>#ZÂIz]lxC-q,ʳQۛŝggÂIz]@Uh@4?Q& ÂIz]JP4e, ۛ훳ÂIz]Ho~,&ۛÂIz]Ye"ÂIz]TFq,E#\ۛŝggÂIz]m;=ǥq,ۛŝggÂIz]uYx ÂIz]|;Z  ÂIz]+ү Ԣ5D[ZÂIz]Pb}ÂIz]/{<ɿq,ۛŝggÂIz] } ԷÂIz]xX4yÂIz]56cg|L?ۛÂIz]ot+ "`z뜳ÂIz]ߚa&i  ÂIz]Y8e, ۛ훳ÂIz]=VkX ÂIz]{n֝ETÂIz] 7AÂIz] ÂIz]1vq, (ۛŝggÂIz]QP ÂIz]0Cj  ÂIz]CT[r<(ۛÂIz]Jdo$,ۛ훳  ÂIz]KK5REÂIz]_  ÂIz]_?0s&re ( ,ۛ훳ÂIz]"}wÂIz]!3XLe,@qۛ훳ÂIz]wwwT-ZۛÂIz],OJ.~| &~ÂIz]z%2pÂIz](.N]~m ۛÂIz]L`L ۛÂIz] }ޝ e,$ۛ훳ÂIz]J|q,  ۛŝggÂIz]-h=W`d4 ÂIz]CNr< HۛÂIz]" 5뜳ÂIz]]Yc^^ÂIz]-#B/ÂIz]A%r<%#ۛÂIz]n'LY<e ( ,Rۛ훳ÂIz]"u$WsۛiiÂIz]lFY*ÂIz]Pq, ۛŝggÂIz]e1uW@q,EۛŝggÂIz][,6x ÂIz]J{}n ÂIz]j=q,ޓۛŝggÂIz]ƑrΖLۛÂIz]TSq|,?MۛŝggÂIz]"~̹q,<0ۛŝggÂIz] qZL=/ۛÂIz]WzIH v  ÂIz]\*60 ÂIz]'a+?e, 7ۛ훳ÂIz]Q3wHÂIz]e ÂIz]1tbq,a'ۛŝggÂIz]w3I"  ÂIz]! l &ՖÂIz]l))gq,ۛŝggÂIz]9)t{z,6<ÂIz]sD@Hi^e,Ηۛ훳ÂIz]&| KۛŝggÂIz]n\Q&ye,=hۛ훳ÂIz]aǠ ?ÂIz]Aq, ۛŝggÂIz]&''e,Z&ۛ훳ÂIz]QG$G&ÂIz]dRIԞ\s ÂIz]HJe,"ۛ훳ÂIz],dQOq,ۛŝggÂIz]x.E}A ÂIz]?ds je,l,Bۛ훳ÂIz]jH ÂIz]zYŤ ?ÂIz]g9U> Ⱦ,pÂIz]IŚIWe ,ۛ훳ÂIz]v-i- ÌÂIz]$,عq,ۛŝggÂIz]>´ü  ÂIz]nW6B ÂIz]ә q,ۛŝggÂIz]ثؐ%<ri<!ۛÂIz]E,η$  ÂIz]wFS *q, ۛŝggÂIz]3B  !ÂIz]M q,ͻۛŝggÂIz]d wÂIz]NÂIz]M"G ~e, oۛ훳ÂIz]{= GÂIz],Of{v ÂIz]SÂIz]Fk.AIe,7ۛ훳ÂIz]r |r-$2,;ۛiiÂIz]p =& ÂIz] Q`ir<ۛÂIz]ڮC, &,ÂIz]3﷊ ܺÂIz]po:$ۛ훳  ÂIz]IX9TuۛÂIz]D0U V ÂIz] le:eh,ۛ훳ÂIz]`ؾe,-ۛ훳ÂIz]fN~e,iۛ훳ÂIz]`  ÂIz]iG|  뜳ÂIz]:]5ÂIz]uRABε]<뜳ÂIz]JkYÂIz]:Dj "`R뜳ÂIz]01=ﶸ-q,s ۛŝggÂIz]Eo ÂIz]-OӍyÂIz]E;aI=ÂIz]f'Zrq,' ۛŝggÂIz]۩eBL!uÂIz]'`wV8 $ÂIz]U29W>SɮÂIz]%W\<$,$ۛiiÂIz]-XÂIz]g.&~@#ZÂIz]\whVÂIz]){0>e,ۛ훳ÂIz]_!  ÂIz]yأziά ٙÂIz]ֹfGÂIz]<\ǯW~)ۛÂIz]g),K^$CÂIz]X8 et,!Eۛ훳ÂIz])= g.ÂIz]bޠɏ T]ZyۛÌÂIz]oÂIz]ZFQ*ÂIz]c\[ ڪÂIz]3&; ÂIz]%pGq, ʱۛŝggÂIz]w9~8 ÂIz]0>lo$2,ۛ훳  ÂIz]~|(0e,>Eۛ훳ÂIz]Z}de ( Ѿ,ۛ훳ÂIz]YjfGq,uٲۛŝggÂIz]{?:=e,ۛ훳ÂIz]O:% ÂIz]Anq,}ۛŝggÂIz]D1UՁd7ÂIz]:"POq,I ۛŝggÂIz][ ?rXÂIz]nsB  %b[ZÂIz]H?6+UÂIz]'Dlq, ۛŝggÂIz]!,mP'ae, Եۛ훳ÂIz]vKv/   ÂIz]ڒCe,(+?ۛ훳ÂIz]GBE,ÂIz]1Pokb $ÂIz]h+l ÂIz]ERq,%!ۛŝggÂIz]fdbe,,8ۛ훳ÂIz]T" +ÂIz]rte,!ۛ훳ÂIz]%ï~ ÂIz]J;'$De,ۛ훳ÂIz]88cX ÂIz]!ԣIu<ÂIz]MRJ ٱ[ZÂIz]`"1x&qI,ۛŝggÂIz]'۫RKO@?ÂIz]q,fۛŝggÂIz]թ  ͡ÂIz]P64/صÂIz]XFtq,ۛŝggÂIz]G/QFߺqp,5ۛŝggÂIz]Pr"B_  l#ÂIz]%X;%ÂIz]W䯰X+zÂIz]<8Q(pÂIz]_ώP ÂIz]6f)T,DۛÂIz]x\LF#ۛÂIz]a8q ( ,ۛŝggÂIz]nOn 80pÂIz]j3LZtr<ۛÂIz]cۏ%!лÂIz]2${-J;HÂIz]_DX$~޹ۛÂIz] 'Ӹq,ۛŝggÂIz] CϺ5ÂIz]jۄb^q," OۛŝggÂIz] SJ= ܫÂIz]Me},mۛ훳ÂIz]%=UÂIz]sBKb'q,%ۛŝggÂIz] +s  ÂIz]~eXq, ۛŝggÂIz] | ÂIz]\} M ÂIz]Q z ÂIz]8=j@mÂIz]B,0[Ze,Z)Uۛ훳ÂIz]B|՟2S,-ÂIz]wo ÂIz](+L ÂIz]p ÂIz]"TX $,ۛiiÂIz]cf  ÂIz]/ЦmuGÂIz]F ؁ÂIz]\CjíĔ.[ZÂIz]}?fq,@]ۛŝggÂIz] D(ÂIz]fBΚ _í-[ZÂIz]n/Afj ÂIz] Kwq,/ۛŝggÂIz]r.l1ÂIz]C {  ÂIz]6'QU íp [ZÂIz]2$_e,óۛ훳ÂIz]5Q.$TÂIz]}o,iQq, nۛŝggÂIz]W4 (ÂIz]^Aݞo$,eۛ훳  ÂIz]9_-] e,E#ۛ훳ÂIz]P]1gJK"ÂIz]r,ۑ H ,ۛÂIz]RtFd o0$?ۛ훳  ÂIz]{@q,0ۛŝggÂIz]'ǎDqÂIz]GzF{#FÂIz]x&X@íK[ZÂIz]~_uL*ۛÂIz]. vSvmq,ۛŝggÂIz]lQUÂIz]-5  ÂIz]ÂIz]!&~wۛÂIz]jXtÂIz],&?o+$?ۛ훳  ÂIz][`;m?LfXۛÂIz])D-~SۛÂIz]wjí+[ZÂIz])vX0ÂIz]\灦(T~҉ۛÂIz]〜ˏu?ÂIz]T\"LۛÂIz]0hg>e,0Qۛ훳ÂIz]W'ߚ)ÂIz]jնez,>ۛ훳ÂIz]6to}FL;ۛÂIz]q*fKe, +ۛ훳ÂIz]3ݐY ÂIz]#jk OÂIz]n,iO l7ÂIz]8  ÂIz]+i)FC c]jÂIz]dUq, lۛŝggÂIz]So]l& &ÂIz]bM $ÂIz]GS5dۙzÂIz]xjmlZq,'ۛŝggÂIz]m|Ly2,/ۛÂIz]*9)ÂIz]BO?u- <ÂIz]\9أq,ʛۛŝggÂIz]S5I*ae,ۛ훳ÂIz]w:.ZÂIz]?Nt׼.ÂIz]D:lFqi,ۛŝggÂIz]XF>o$ۛ훳  ÂIz]Grc;q,,ۛŝggÂIz]{y,"T aÂIz]^˵{q,w ۛŝggÂIz]P -B|q,ɱۛŝggÂIz]Q q,ۛŝggÂIz]VstI ԰ ÂIz]n/"ÂIz]/k%5J q,8 ۛŝggÂIz]yø.?ÂIz]h4׆ ÂIz]B5+ ÂIz]-*YA"ÂIz]rcu,^ۛÂIz]ٵw~ۛÂIz]TKTK ÂIz]$ q(,0ۛŝggÂIz]\[P e,fMۛ훳ÂIz]~j)^LȂۛÂIz]:l4ÂIz]b~BN=ÂIz](m1z:XMɠT]ȨۛÌÂIz]D9#o$ۛ훳  ÂIz]KjLZoF8ÂIz]==  L        M    debug_assert_ne'b]ÂIz]l`q9 %]ÂIz]2?Y, 0Ś]ÂIz]@ , vԢ5[ۛÌÂIz]B>9 $crate::panic\`ÂIz]Sl%W debug_assert4&͜S]ÂIz]oG͹ \`4ÂIz]FeP %hÂIz]S1 Ք5ÂIz]dzi .ÂIz]yrSu\C & ÂIz]B_hp %7ÂIz]ٖZ1 wGaղÂIz]ޢ OĔ.oÂIz]VW:t ÂIz]urfU!sۛÌÂIz]lh5NJ\`QÂIz]x5~S-OÂIz]ƲGt ÂIz]L*:JZÂIz]șSih z%ÂIz]_XX\`UÂIz]>8^t RÂIz]W!˞ Z%ÂIz]"`ACZ̟-ÂIz]B#YQ\`'ÂIz]hsn\`_ÂIz]"P.łt \ÂIz] Z '-ÂIz]'2".debug_assert_eq[]ÂIz]H^(/t ÂIz]Sݎt 4ÂIz]p=.U#ÂIz]hI*x\`ÂIz]w j,]t ÂIz]_%AÂIz]yl>i#wÂIz]J,='ÂIz](9gߌvaղÂIz]MՆ Տ-,x,,,B,,k,,,6,,K,2,b, ,,,^,O,,, ,,,+,,q,,,X,,,,,j,-j,\-,U,,#,d,r,,:,(, ,A,,_,,x,9,ҿ,,,,,s,,,$,,I,",,7,#,U,,s,@,,(,м,,,,~-,-,-7,,,,",ݽ,T,J,x,,,,,,,,|,,Z,,,*,,z,, ,e,,w,`,,,,,,,+,,W,L-',-(,_,\,*-,-,,G-h,-ڼ,, -],-,,-V,f-J,,T,-,5-,U,-,l-,m,!,̾,^, ,,-,",t,,,ÿ,,,,,,,,ۯ-,-,-,-~,-,-,-,,,,Ƽ,,-,,,,5,(,,,,x,, ,Ƚ,,i,,,),M,1,,",&,,,,,W,,,7,I,=,,,G,,f,@,,1,5,,,},^,,<,,u,E,I,I,,c,,,w,,P,,p,,,P,,b,Q,, ,,0,,,,E,,o,,,h,,i,w,,%,,,g,,w,d,,,,,,d,,F,,d,,,,,,>,׿,,,,,!,,,,,,},<,,Z,,n,E,,,,,',,,,s,,,8,,,,S, ,,a,,,A,,,,,<,,,,,,,,@,D,D,,Y,E,},,,r,,K,,,k,,,K,, ,,!,,-Y,W-,U,,,,,/, ,, ,,r,e,-¾,,-,,,@,ð-,,^,Я-h,,,%-,{,&,,b,,r,_,,,,,,,9,,,y,--0,־,-n,,,7,-1,-,w,,s,4,Ϳ,, ,,0,#,|,,,n,,,ý,,,˼,,,,,,H,",,?,2,,,,,,,ӽ,,,,.,,R,6,,',+,,,,,,N,,,1,,F,d,x,O,,7,,,,N,B,,,,2,, ,,;,?,,,,@,s,,,m,,F,߼,,,,f,, ,,%,,u,,,Z,g,V,K,-,,5, ,e,,,_,],,,,,,v,!,,],,-,,,,,_,,,o,,,u,,?,Ǿ,,,Y,,,(,,J,,y, ,,m,,n,i,,,,,,,-,ռ,,,,,,R,,2,,,,:,6,i,Y,,,,,5,۾,,,s,#,,<,Z,6,,,H,,,,,M,,,D,,,,`-,,,3,,a,,,,,g,, ,N,-b,,,,,,Ȱ-,,4,,,,+,/-,į-c,,-T,',,-|,,*,ȿ,,l,,|,,,,-,Q-,C,',,,,,x,2,,K,,i,;,,#,,},,,C,ܿ,,,,:,-,,,},,,,,,,,A,-,L,,p,E,,6,:,,,,,,],,,?,,O,;,n,,,c,,A,F,,X,L,,,,,,A,,,,,,,[,,z,O,,J,N,,,U,,,,,,,F,,,,,&,,`,,,T,,X,,|,x-v,,,ؽ,,,n,,,=,,\,;,,,,0,,,,,,X,,T,<,,S,G,,,,,,7,,,,},,,Q,,,S, ,,l,S,h,,,,;-_,կ-l,[,,,,,,P,,,,-:,,j,r-,c,,Z,m,, ,-,,,,,,,>,,,,t,,z,,&,Ѿ,, ,i,,,2,O,,,~,,r,,/,-,,q,,,,,",D,,,,P,-,',-,,ͽ,J,,2,,Y,ʯ-O,A-,,|,p,,,,kv-;--R-Z-!-O,-)S-2-W--=-F--- \-"-,,:|-A-~--r-~8-`-'-w--n-,d-b,---|-B- ---b-j-Y1-f-io-=-e-.,,}-C-a-9-+-+-j-1-+,-)-,-?-k,p~-,D-),-޲-J--z-Ӷ--,-im-,-c-,6-[-S--,T,{-KA--y---ƴ--e0->,N'-^,Q-G-,Lj-O-`-,F-tG- -pw-I=-O-7n-,--,o--r-8-5,-X- -,'--+,C-\-,}-)C---,P-˟-f--- ^-$-,q-U--2-,t-M)-,- ,'-}Q--g-.-^-%-K-,b-u-*-4,ӓ-Z- -ˊ-R-`-I- -6-m,-h-/-8,-_W-U- ,F-F -*,--m,-,ɵ-,--D,E-J-v-,-@--7-B,i---_-ΰ---4X-,-O--,-F-J -e#-V-T-,@-$L--I,|-AB-,آ-xi-0-,`-'-ee-,-7-o]---9--v,z-B-us-,-nj-1-f,n-,-H-& -,x->- --o-ۭ-?t-:-Y-Y-Fk- 2-,Y-BQ--,y-6-f-.-+,--M--V,D--Nu-;-Kl-3-,?I-y-?--e-p-g-Bh-,-_-&-%W--,- -E--l-.,x-b-w*-,i-Z-!-,X-R--,MJ-o,z--v-q-|7-,-}-D,-K-g|- B-F-! -,w-=-t-Ѩ-n-j5- ,-,e-D,-&,–-]-#-,ń->H- -G>--a-,_-Q--?-Ύ-1-h-,,-YD---[-3-,'--= -i,,o-i--W,$,>-@E- -b,1-Q!-,-R-},-J-=-->-_q-C7-/-,g-_-&-,l-W--:,hO-L-BF- -,v-g<--m-i4-,I-c-+-,c-u[-"-,/-T-D-,b-!K-;-,{-yA-l,-#`-|'-,-`X-z-$-,t-;G- -,4w-w=-8--en-25-,n-EU-SL-3-, s-9-,i-0-,6-`-:(-&,-Y--m,(-`P--m, - H-e-,-,WC-(-m-s-d9-,-j-1-,Ϛ-Sa-(-?Y-s-<,lj-P-$-,->--˩-2p-5-,-bf-,-7^-$-Y,-f,Ӆ-]M-i-,}-C--N-t-d:--Ȥ-k- -,T-Q--,-I-` -9,Ty-?-l,ˠ-fg--,-aN-y-, -)-u-m;-t-ߥ-l-3-,9-b--CZ-!-OR--A,'-I--,.z-S@-h-֪-J/-f, -z_-V&-u-t -,v- <->--.m-14-,ޜ-hc-*-5,ʔ-[-!-,-S-g-r,-J--|,f{-A-z--/r-7-,p-h-/-,&-%,-W--s,y--,-F-x -F,<-ݧ-m-4-ߝ-d-+-,-j\-*#-,-T--,-K--,,-X--6,-,P-2,Ӏ-G-Y -v,8x-=-- -o-5-Y,-,-,-6]-.$-,-U--,-L--7, }-B--8-s-,=j-5,a-u(-^,-,_-F-yH- -x-W-o-,j-!f-{--]-$--+,h-%M-.--zt-9--- k-W2-Z,<-a-5,-+g-K.-,+-r^-5%-,-LV--V,l-"N--,~-D-= -u-:-;-q-l-3-V,-b-)-,b-Y- -,-R--wI- -y-?-,--p-6-5,+-zh-/-,ʘ-B_-%-,ُ-V--,-)O--;---0c-H*-,gd-L+-1,̕-;\-"-,-T-,-K--N,lx->-Co-ߞ-B-l-2-&,ћ-(b-)-,-Y-z -9,Q---,-y-N-}E- -,-|Z-2-,u-?,z-@-q-7-,ס--~-Es-8-c,2-i-0-,U}-C-a-(-,B-t,\-H-x--p-6-;,-[,̗-,-,-M-~--t->:-k-2-,{)-m,ɒ-xY--r,y-P?--6-kp-H6-,n-h-.-f,i%-Q,@-V-J-,-N--,~-E-u -9- -(1-,(-,-,- >-,d-]-b$-5-- t-,-f---,^,F-E-Z,h-`S--D,r-,v-;--p-Z-!-x,-PS-W-W--\-F--ϝ-+\-#-,,W|-A--з-r-8-`-'-w--n-,e-,---}-B-(-7-!---j-w1--o-Z-f-K,,}-C--9-I-I-j-2-J,,-=)-,-\-,~-%,j-G,ֳ--n--z---I-m- ,9-c-,S-[-T-4-,r,{-iA-:--ö----0-\,l'-|,o-i-&,-P--",d-G- -w-g=-m-Un-,э--4,-ˬ-r-8-S,-X- -,E--I,a-y-,}-GC--ܣ-,P--f-.-'^-$-,- V-(-2-,-k)-,-),D-Q--g-.-^-%-i-,-,v-8*-R,-3Z-!--R-~-I- -7-,ǡ-h-/-V,7-W-s-*,2F-d -J,5-.-,-,-O--b,i-J--,4-A-- 8-`,9i---`--Ը--PX-,-O--,-F-h -#-t-U-,_-CL-#-l,|-^B-,-i-0-,`-(-e-,-T-]-%-K-X--,-C-s-,-j-1-,-,,-H-P -,x->-G--o--jt-.:---tk-G2-%,-mQ--),Dy-^-g-;.-V,-ц-N--},E--yu--;-vl-3-,gI-y-@---q--jh-(,-2_-F&-OW- -,-6-E--m-X,- c-*-,-Z-!-?,-S-"-,tJ-,'{-j--q-7-,0--l,Ń-K-|-1B-n-I ->,(x-=---n-5-I,Ϟ-Ue-p,-R,-&]-$-,-iH- ->--a-,-2Q--@?--Y--F, ,-D-- -2--I3-,R--j -,,---,N,f-mE- -,Y-|!- ,"-R-,-=J-e--f-q-l7-/-,-_-&-,-W--c,O-u-nF- -,v-<--m-4-,q-(d-<+-!,-[-"-B,X-KT-m-,-OK-b-,{-A-,&-F`-'-,A-X--P-,-dG- -,`w-=-d-?-n-Z5-,-pU-{L-_-,5s-.9-%,i-0-%,^-a-e(-N,-/Y-2-,O-P--,6-.H-e---,C-Q--s-9---j-1-,-xa-(-hY--d,-P-L-,-?---[p-6-+,&-f-,-b^-%%-,-,-M--,, ~-D--v-t-:---k-- -,-Q--,-/I- -b,xy-?-,-g-:-,9-N--, -R-u-;---l-!4-,h-b-Ó-lZ-A!-{R--m,P-J---,Zz-|@---v/-,2-_-~&-- -,v-2<-l--Ym-Y4-, -c-+-],-5[-#"-E,-S--,#-J--,{-;A--׫-]r-7-2,- i-%0-,'-N,ѐ-$X-;-,--,β-+G- -n, =--m-4- -d-,-,'-\-U#-,F-T--,0-L--9,,-X--],-PP-],-G-| -,\x->--.-3o-5-,--,-,'-_]-R$-,3-U--,)-L--f,E}-B--]-s-,^j-V,Ca-(-,I-,-t-H- -x-x-o-,-Rf---]-$--V,-MM-Y->-t-9---6k-2-,d-b-],-Vg-y.-,R-^-Y%-A,0-wV--,-QN-;-F,~-D-e -u-:-d--l-3-,)-b- *-$,-Z- -,-?R--I- -z-?-X-ƪ-p-6-],W-h-:/-,-j_-&-,-W-E-,ч-XO-<-;-.-B-Xc-g*-%,d-l+-P,-Z\-"-,݌-T-,-K-À-f,x-V-Yo--a-;l- 3-F,-Hb-)-,-Y- -Y,R-M-1,--O-E-6 -,!-Z-H-,-_,z-@-q-37-,---es-8-,R-i-1-,t}-C-a-)-,c-,r-H- y-&-"p-86-\,-|,-,-,Å-M-0~--u-T:-k-2-,)-,-Y--,y-o?--U-p-g6-,-2h-.-,%-q,_-V-i-,-N--,~-0E- -[v-];--/,z-C@--.-Oq-,Μ-c-*-,&-e[-R"-,-U--4,-L--,V{-@-0--r-n8-,`-j-,-O--,-G-: -,$w-<--ͧ-'n-4-w,8-d-+-,V-\- -,-x-O,-Wd-+-,-[-#-q,-zT-A-,-~K--,B-e-k--M-,-u-:-+-ϥ- l-x3-,-xb-t-p-6-,-h-/-,-^-%-,ɏ-V--,i-N--W-&-\----,F-6,W<--"-, -S--4,R-K-+-D,*|-A--6-r->8-,Ȣ-hi-U0-.,-w`->'-,6-,w-9=-(--"5-,^-4,-,-\-#-u,-5U-p-,--',|-_--T9-"-I1-,*(-,-,-7>-,-]-$-L-˭-/t-,-f---,},e-F-,}-uS--Y,- ODHT "@,b0|krMEy _+/ [ } ,ΈE y~| t1Bci5tsMs+׫O@ #I5@K w@ ޞ@[pP} o 3t׬Cv@$`"G}*#cJM"l% cN j%a{!&@ hl9)@W'"Vx)ܛ y*#a[#+^N]5s*qs / /@[7e2y: +4@BA4ej IM5@YyI4@exe"85 #f9@" L9 ii7>v m1 ?@L~ym@@CZC\ PEVqIQH:KHISaJ@Bx̔I@| TW[M !Y0M,5̀N-8oQ@v ZH %]>wa7]Rl0a`@Qs aۅJbNfa ;AMe=Fԭi]z! +l(')ml Dm@Iފo@`>ˍ?s@! /tA"&$u͊ }⑺uu!BZy@2:hzRuzt\{@0},z-׃@ :]@**jZs@)J@O FL@G'R_]#@_e_qyr jכ@3Ycz@~?5AZ áIqO͏Hx^nW„ ߣPrl}2S #eX`@WVk"@2KU,# v v}\]H'ϭL( 7.{K~,ձ@<E#OZ[p(p$r@I2O@aEzPq fcŽ@ ?@KC6b) 7Ǜ[3x N.Unμ Z0JU HǀBk RVz<a:F~@`L gY1π%(bB@J%m:рG2 Ӷ^ȏ\lYUUB2 < 7+n߀%7n* I Jf,* {@J:@7_@>ċA@+ E=@b6 Erm0^~\j=7 )ݖhP6r@uN͐ NG?1e@vkDT u6 >2,q_4o &+V2'9AѴUh6EgAB  \ AqF "Dك+hnu, d  [.\Aj z'J+}'3B°) $JA.ت}5AC }XhbϠAkrl#!Aĭ Cq#!Em$AOx Xr)e ,>!C"p0 5i!֏ӓ8;9 K 84^ jw;AZBp< B~<!W; #< >{{4çAwC E,D W K/:FW0 WKJPvXMUQ׀W4MlW>auTA}` Vg UA(3VRep.V-Z`F \%ϥ [\. W^h]Ae_>U 6>`kU,b 6eE_oKfA[aYk(ekAlqv_opAe>yqM&Ysi~t֛l0sd9EvTwj&( ~I\vJyvZyAkEzvu yqK|AdxA TO~Aȥ nSZ<Tぁ  u,QpOXAܠo%dN#\sA ވA5  {ϑwEO$PzUŐB}Ñ{j`匓}}3X%i,dh˗Ab]MRZ Oޔv=uB|ZGT Q`GyR ~5x1@ArVN;gCh Yh S+f&!ː6g7eAqR)e?!4I!`gB!`A% k~Y}D9NM"P uWGíU i{AVCip@G-wH#ƽIZ8*leMWZ&f#ѷg&]ojЁKg dmM(؁l^6AP;!1S0 A4a",^ A ,(6݋ADUZzA%_ "g;7XFA~AzNRF،Qƫ3)C>H(BFAw8T#0Ya" LܙK@IB6mypB C; \ L~BU3`™v!q% -lfv ~ E B!4w B{HGJ6>.r0=4 h#L@cJ^0*|Hz >vEJ {1;!r`Csw&|g  r6"0BαL2둢pcB0z^ `ҕ"=;#‹=P %$BzO-HWh&/"*F'aC-—] :91"q՗3EJ5;6Ρ9BCc:Q$X(>1Xy?BBTs?S/A@$MAo >oMDDBT͈F!Jo@Cl ^*֢Iz,>Mmc_*&3NBׇVOB_."PlS/PC !Q TB܎AVYGZYf~U1GZ1vn\3B\ O^ccoB.@Bc]v Ph*FkTl:4lmA)mBPoDlB~p&pcQm.֜5KzB&r{IOƙI)|^({B _vS~& K:|L6bB,n (}#}WzafpxX[&Ə,X¹=8`Ո5 }? ,lz 81TpO r.oMB[%a`Bx,Bsp鐙I/EBgH 3#d!ƍI'BhpɢNTxB[?BզϧBwL]´ ,֮Bu Bo!J«Ho^b0KBvJ .䱃5 s=B}(KB6hes7;Bw)U"usWjBOsQB8>=RipBK Tϔ\:U&Bbv 8Pقm}i"8 /'ph7&TQ4(yBee!&|B|<S}B xuMBڷu ءOIQXV B 8.=xBh ~ʹŤW6ۗ^rMt Gz *ą,;BA=!uRƼQ'B/1Tԯh-&aCȧ,-Oj G  ^ 1U<Wϯb C`tܥo; '՗"h8OU2~[_#R} MLCKs ZmCL= \6CR 6@b Kmy4 ԧݢCح2*c2xۍr.t1oKl aZVE)&CAĊ*')b\d ti]ÿ s7_AP`l8 '}b=_|AbkLd.OdCCFj \Cs+'d\R͛?\o ZZ^O7 Isըv[WC4 vk!q=vn4qZ?M9÷5e" hMÁ }ȃH "(̓c] bo.uCD xCb Kكr1!GslRbp+CC_Mú"[C烘lC4)c6( x'KXDECqD@CBR4񃷽 å=iHXd J$A!R) !&_qkWz* _DK0)qj=" .^<F%Dq1=\7\%?  `6|:DC ᝌ! u,q˳tL $\D#0% ƍįī:;|h9DVzr:&ѿN!_l>~h'Y_H(|`J 燀(B:*V'D ])ò-ćQD .D r/RBg c0a=-1Đv^qo)=7+!{1.0gE!.H6?C57Dik "&>4-,E%'5]5IvL >LB--PG-[X,.Z"˦\-1Q_!%\d`D ,9a`~_cl#eD#GgD#Yәl'# 4_{l- =Onۆ*sohpD'}nv)ilͭ 1HMvՈB}ɟVvFQ' фDY fCDn}4\}DG"ArgDyKWt_D%wE$a9G)D!i񁙄Hi M^}ǒ(mĉ;B>sUH/~WOZ#W6\WjH$.! 3=^)+D_[k[LmDzIlc DB!D3AḵDVD +WµIO ?R D1r덵n"ZZR)!N@E? UwYȓ|9 Y(F9f! D!sD> vY]D0 x&Ʉ\9 }w\Z~τk*DJ%@҄WTlӄhT҄~ڞF7wDˀ F` ^[Є;f{(TӄZy;D:ۄW,5DLDWd2Dv;U-5U0]-F^af :ٛ[ބ$37DW D #re愬<{D^S脿P3䴍k7(ngŔDRS[-gg]Xĥ'bE ĆJNR3Đ!ddEI!.;7_+DOs! v\TD/!'ſ+ >Ees-E Gi2 0!@=VfE .X ŦU@oōy nggEL!L K@EL 2nlBkHy%PPo)E-9}z*1 A r+zlz+O<-, a-E —C.k0Tq+m_!1ZJ3_[jbEu#ilt8Liwlκ_o:ښGp)-r\# .mt uu;r&ZtEj?\Ž6wRm KngG^ (9Cʌ ՍuRKJUȻY͐ۑE4 P!-AE":HtS^lhä߃E&|k\tlD qEJrEN 'h`iE)m!8ŚǯD hśިe5OrJ\T*ESOrK?a gЅj`oEac!}٧D LгSE5>^X*r [Em{_ˋ !6E@!4]3'VE+I>}6jh\#E 9K T;&:vkodE"+5"oWF1 ED6;k - cgE2FdO%4^$FzFZ-\Q о*0LF !.2yY9\[ _E($ F$0Ί ,S = Ch[i\οMUo2  dҗ6,!$'|iK!r|jM"g~`]mƳ6 -SjFF.\q6DC&o6F߷` Fo ]"%FH)F9'X*511n,FMT 2-FNML/FQ%U1FO5y<5ƀ06Fȓ ZG1=Fs@#z_@:YrB(E@FN F~+V6[>F -XIBiJlxZSJ ΠL8C.yK\O_XxNF> OMơS{NZ|VyNp"TRSQtT-T WFXcZHѼQ9 _[FA~*_#0Z7U^\5`FAz|iaԮ p) bƝ9 anHc\ a?;faZhAhggBKgBh>2"gƴ~Ȗ:j|X9lF~NqYK]oFy6e oFkĒ9tFn/(ouX /cywFxwswFX"zL+6|"~D~rƎg ~ xȄ6L$g+JŋFO"ŜtΌƒw8F{w\lђƳ< ޕ#>H xFlSsƎGB}G͠6/t^{-\s| BސƲm"F89%f|쫿ƹeF^> T |F5z(pF2$җĆ,HƆM@Ɠr"ȆJ!RɆgթ7]MF(X w HFA͆nq hn7S395nSz8ƈ#/5ӆ`1<3E'F)+?GSq4Yā]F"2P܆F x240߆ܯTuFC`YE@@FT pO!e 1F 5Fs;F8HyF`C"KmFe?.CDۂw (VyzT sUIG:(J y zN'#0 gF4ꢶ G:t]( Ǹ_ Onj Ys*!b. _WڣL|6_%SGkDzt!&)鎭UG|"a1qL=| QLj2!G| Fi Go+z!G~R>>% LZ&0h'G)%Ga-8+Ǹ!V H-MN O.GNnV(0Bt3ǖzZ7IJq 8 !9Ǻ/9) y5;G 9,5;7;!ߞr 9G ""*N?G 5ɘD?BU )=|!CNx 'YPGWR'꿕TGiWU `VK *Y< )Y\L[ǹ [N كg [ƍj^ ĽgZT T7\15}b* T8d̚mj,,';jfb WERn2ToG얁JoGp o P9rlI 2ylsj9o3 BuGWvdž7j"PwǺ!6x^xyG3kŕzGj.K/ {-Ij{WJ.2?҄GI=Izj CCI 7Ջ5b#bĎG<GT"NcGOW N˅G7=ڲ4v,JvW\)(G}%=.uQG{u~U36?AeDRjG +-@P[HG{N]2 tçdDG7 /xGDJQoW8＇{ /ra׽5C zkS-a\ 'YټGQKIˇ+!-fO=G}!F~G .u5fƿrF~ȝKrӸAahEBz;CHϓ` DH84j !DHKG(} f[I&򻲈I*TLLPҨ<"^NnxQH%oE6Sª*gtT ttVH%ahWL-X`x'XHkj\ȭ%]l}Z`]Hj""7)cs,e\4 g !g0-ShHPj jR Z ܃hH;ٖ$lH`ґl .d&n sO6tH쬡06vgM=zmu h{-- {lA0|( iwOodÁu+psv3;"BRșg{%/jD!i*8~ HbM %0H HӹH1bB{De 4ⱇ_T|QmDƟ{HH,k.A ѡ- 7~ƆwWkեH1 Ňi l9iZX򮈼{S-sձ7(_Hwnj 7e,})H1hiHAtŶʈ2iH@#lH#PHFEH;TшޕP҈S!ֈbGH6|QH(3P܈W1c TtFP@H̱Lo|.H5mMBKz\ hK"'˹눪L]>vqHIHEHQ!ş4ȅS*uHD:pD0\/GoG&; i`PHQOpMH}ܻ@F] sSHڹ? ~( m=O ՞IW,  g%  " @)& "O b:i |?JYǾ-InzilƉgWIKt B ~?%x2H K YA3$ z;d' P!f)I31}|)IQ+ܠp_rj/G!1 qq4 cʳ 9 mlV5'= A N1a> wh?e oAI$osG0.bI epK퀮O>LɹmM8GQ aGlK/xRIy2_RI{\.Q VɮAZl-^7;_9a 〭pLhRh CjL/kC֔'k {.n K)qey ?:s-St\7s3v%uXXxIʽ3Wx"U{_8G{8,RI+Wֻ|?%']DfɬԴoI Eq! F%ߏɄلI1Wі*[>60I T "# ' s/9Il` 혉G?,MǧB՚ JIրK /!4\ vV\"+Gep&fO ųXRS dI_]+ )I=d|L*ʩ > rX+IVI>t R 5dɓ)'OBL I o7vIx. C>E5Rv5F É@ É7 |X(ImlO {ɨ-"I35͉0q#IkYI]; FRy!?y Ap!@G  = U PىhI5 ,f~S 8J IcIQ+3 ;#V 牜,A`ܻd!ABu)"6kXbb8I $m ʎS&PIoZ[7sZI/w1 (wɄ71>?rI\;Y hmT:NI)] H W+ P@mv!Ja&(#J9Ʒ|)% ?;% &V, kKtt/ Ƕ0ĕ/ ˎN2JXsG0Jڧ!t44V}V(4Kq H.K6Jʾd*/8 ?Oo; F< "m= P! ͣ< |EʗoIBF Qt m> FJ4 b&H JGJGzDL Y"9`NMJ%*NɥO`GEQj~qSJHF pV9WC~kZqh\J2T(Q^  0_ m^ϳxlb " hJ"T.šhJ(djʕfdiJd]urlJxhJMOnJP^On$piJޑ rCXRss+sbPth#!D5u ^"}w{ z#2wHUwg{._ DTi<OBV!X*2 xAJ> {qI Fʷ7;JUDݎʖ9F {xAݩ rʹt!ؼؓʗyUO Ї !擈ߞ  7_ӴZ U  B Ū䋥RQDMx>!E#xJ_^FJI(9 v 슣Hm 0Q% hE&֑ G"X csL ՘4?)4(jճ ?JkHB?w #K!νTp?` 2 6Vsv QE @ܠ $ZRK ,m Z''qVt6 /9@ \  3`  Z\ BW˹tXcDH:/ 5"CT {6 9"˦aT#&KU~z(%1'KUd)A'KG'~)}Dc*K?3 ȉt4 z:Ks;=U>˚r]>  #y? 0{"qkB@Dv&0E <~EK+k"%DKx-SHfKWjH0-E )]1GqZLMOK8$O =Q %CVOyi"4S [ rTK .%UYڴ/oVxW TIFS VKvk[ da?.^Ky/ a.YbK~Db˄D82i -5wysh[^hP`~)ILnt!LhldLo.[\HH ؝qX PP NňBu 2 Lx'  LmW Ln~LV] tR̫]uO%LDzL.̳ $,Ƞwp"#Lp$̬5JW%f'ڑ ݛ( Ѐ"I7){I+ iӼ,L,t@+5L>Hj.LH2e BF4̅=-9Z@5:i 7̪6._φ9 6c'|: %0;I}  KjW]Lsn ~^ 4lyaLabbL% R\We!f,mGh ӱj̣J8kh - t0ζuBs2CEo30#64N; K$59$tL4NJ74N+ XfH3ΕtS4loM6a3 _TʫM{P lmNTymN>>NJҴGgtX9o]BwNq2C=KNXJ=<;ᕿN yC4 WLa9΂f+N.!'3ONK1 J]NNJΗYgЎCuDNv GLHA3FfBbҿΊ|=Ԓ΀1Ɋ ̄2N6 0A&NUr^QJw ^!N`"x mI\L=a .D?NEDfFW8] p$pHO6^/WjOCM|Fn#!}LO#{1 2K WS YIo!OGV5,%OV]Y#)OxDzD.*p Z)o!i}_R*Ϗ~ f+z.O)j1Fs/OXrC/Of 0߳uY3`߻I4Z>5OT!V6O5  >6O!t$8w28Of}:ϟ;ϭ,Z3Of!|A߼]˿Blq#E2 KGF7GO4@*EHϥ)MC ID =Jω}%{UMOx KROS2ѾTn0^RO߬zVOYOEXO-ImXOM,<>[ ]T=\$ \ϩi 6&]O{J`˵?& ay@b%fAߎѹJxO| 1OŌ~s-Fp LTZo)q5 ;  So7z ˞8Nef OT0@i3.bϨ ä`q5zxO/rϬnNM=bPIv' iQ!9pG+P!Q,# 51. зqsj9Ԑ 5o ^PpCX8#-#PO{CP9qԁ\~h!U#(P%;~m)k)!~ y( -z -pKv.m.iFF3b 162(6;Y9r8PH 8 q8P {n;К =s;@k>P2)?-F@P[<@PX4 2LDP8SE $ONsHF%sT[G-Eh[QP  RPn4GXSP1"!'Tn_U rAV;W"~DRmTF!ћY@jIXpڀKI[PP4 Z-; AN*^p6:nPm,_@p[]$JgP<=жP'>m?hIġ֎$ \N[D&AJ癓ݓ(\=tɗJLݯ!sf3f(`&cD#lЎo.΢X ;7D҃tOWjOwoǭ_Mh P)CF}i TPRQЛ x]i ){Pdj >DPg~q|BoMѽڢU:m& v^dx'< C  Dx8f?N t,eP3XWPa0Hힲn_biP/bFFA"(>=(^JRzPQ=l;аXЎC>Ԑ0nGאs /b8XW#{2P#"UPEo0ې ߐAz2w PaPȒP,X'ECL ϋ>]B萖Ei 4RFN''PHqP5i.x / R" jOUѪx9-i0q_Zg& QB@;,k' Qhz'2 Qk y 7# P8'<IB'/eUq_ Zo+Q%SmUpW(. )\d.њK$ F/, 0z4BrG1\g.ѻDX!3t,J f4ї 3Q f3EVv 4_xg+^Q8h*eWXAyAQkfY>`C7?/K!DQG?LћF޻L' uLQ^S 9x V"$_W\G0v^jy^JW_Q/< BbfS qh2uƭiV Kk2 3,p' Dڬrs}u tevQ}$sz=U QJ~sy> :+' .뛄WdF]8"}ۇf 'P@΋eIaS /8•,x E [#6 >TQ? =]ά' ']^Q4sѭ!ȁI^ѫX_Q$z;J"*Xݶ9ޢkQ!/7ռEK,$Ͻk"l+\Rx˿QbdY|9K /Q GőIۚQ ,|͑7U?LDrcQwm # LY,#BN&Qt U-Uݑ H?bߑ@bsQA.d,cрk % aV U'6 BW%6>>%JW'X͐< zLцr[oQ+YjQkgQ4t(\7QA✻jQ#cFQJZѸJ]aʓ Q!` к@ F4o1 fj"ɧ tztlmQWC ܆R!V~RmҐJ7qIn 1 TdR^""R;ѧͮ*aJ ]l wǩKQ&$>rz+R7\ )vAf. _ >3 3($R (%J5 k%U<r,v%r)Nab.Rw K.eR䉻/!e%3 r#9<ԗv:ڽ:FE;ÕyG<6WY:c;\_tv9R8kڍ@R7Z @>@RƂIޣzCҌ kER bo쓜.IZ9JrJ{5&LwS1M ZY,IC!dUҊqkYRR[^ Iv>^\x_ aichzbR"ژebkjLg p!bFkRV 3lRDoҊ?pRHNyq\6Qr=])s72 @rRң ?tR<VUt-Oq40?d,x x66|=YNBYys: r_$FQR ޟ(M 8e\6 s ERK(D  fN9 c`u[ێN~)J=SLa,;R8D(HY/R0 J<BQ ٝM ﻸRz]鍄 ' tX"՗Ò];mxB3@ҌzkRXLK9Zesi، J+Z!^iR!?SQ2z۳ӰjS2 ߡкha 0NGjlB jW1| ) S Q $ g9 }"szaSLej` 0{jRS # Oi?ĭ%Q 1ЀdItr@:  J آw&V}]z'S 9N)!wS^:)&h{ju-#nJXr/H10S C>R1S7ܨ2Sor z1Jgow7{*7\F9':LE>;Ӏ=Q{r>. %UՅ? 7IAjoB^:գE; >gGS*7ZG3Vs8Lwr82EMS;ɳ=QSG uRESz(S;QKU'$U) $ZSjkcZ ,|[] S#Fg^u}G_x_ G7^ʪ>'<`bQ.kdyh/e 4(hSsci@Mc^j39mDjYu"{lT(W-ʒm*MEuR@ )%vS @yR""S={QI/]yٱaTSD.7B(R.qM׃Ӡ4!ρSu8SßlS7WzS'SbKKSc|T{fS-K;`0b􋙓̰Ř+we 18|j?4XS,O۱ӧ 톬h\}ߧyESiQ;. N({0r!RVӉ> ^nܽӌ;, q<8P4`뷛h- ;z$ȭd&S!c x OV[O1gÓ.T%Ӆ 4В1 pSu*b[Sh USpDCѓ tCWٓ$g!?nGpS62Esd *VS%f#ӷ!YpY4]F,f֍YSeF ;t3K31SGZ p2m@V DSZx \St)ߌncsja)ah 4S (pS ә[k:d1I6 SaԵ;`5Le74T&-F"lTuBAw =SԿM</LԦL4Ie>Bnjʓѷ@TE)7H qp" r>m O KM@ ?!TEWvy"ԠA$<',TI5T>,(*8,Lg/TL/Vw2iGLd6YVS<73 {: p =ynh_?M/#9DܣLF !&*Fg 9PFRlL q4HLT zP²,Rw+T8V+Z6TTOjtOYl nYTvb_R^%UAmaTbZ.a n<&dbp5jTL!UY]lMnTe 'qApC1?#qPsԃ_{t[76",uT[CMso>y"7وIyTN$}TYѕNc|NgG 8Y9e|܍2) :kgLT% x01 P~SpTxK"ZH^Ngr9.!؜okL4TFx* zbts)TjTKSY6NTa5vqlɧT7fEX{L0-W7@0߃-5Ot3ԢZ=\ 4[ͶF`{  UEw\ZᡙX rDMq0fTV{cKܿlҺT &_-6yЧӼtw6T3sȺd$27T nb:z߹(T BeԔ*! -~ JM. o{biڔ}&1Hlݔ;- *Pޔt@^CËG`&@i&ޔekRr]R(4%q`{p2)sG_nz1weF 4[CT-dx$T T<IT{wLJ(KrTh=_7 Q+8{T2 9mUr/±a6ĭ s: h/ZR xY/5 UaiSX@ oMNM +Y 5hU AP(լ z. 8j !]: ! } j?'UYm 'Y3QY*c,,Rm-Ԃ_2TX_b2I2Ǜn9c@):[dsL-tU 6t1a (tvcvv2qx̴Gy3[P{UjY}v(>p'A0s)?5eM!+2pU)44dkcߖ8%Ue/&& ^CbInU]sEՋ~aS /ӥUʑ!k |@<:'+uqW`l"R \M&aR,ՇuT>[U)B:[ ! U TT'u⿕IP i.Q4[Ȝ# 5Ukߤp3U'NF"kZ :ΕQo.#O8hU JΕGכ  ҕm:$>n>s19;"z;k|aUf1*yV5 xԚ":3w ojkB xݎUQ/V@U-i]9S b{yR!+oo yZ#[ ;v+ )-4p AU[z*?6OBs =3~kS'Ud55Y -VmV`#ea֖vm6b֥ ` @&[]D1ɉ"nq-! SWgts-=V`܎t ֛>餦? %65EV W,v8 =d 3] mQ#4e_Ɖ`V1;x%5̮V- ϫ0VtG [`}-3Z ɯ?o"fJ$Vi%փ9&SX# u%V/A &=I&V, $x.*N"#-G ;Q}0v!%1gOd?23j{`5ί&6;GWQO72Ӂ8D86BS: > su^#NVW)Eȋ֊Ӊ 8V"V+|V rcU!wV uj]^)4@?dzw(ע]~])Zqhkѫ֙BNݫf ײp VuqFVbvX0'4 qwֵ: ceVF}]?RG䅽V?r?fVWwod?:_ { gBǖ R]%ii_s=+aVp;Җ \I&}Θv8" O/?ٖb" ֍e¶VTC'Uަ 斲Ϲ ˒rZ ޛK`6|@ىaYΒ]VFrh?n6L$֦k&|"8 ?׌H?뿓@dV%BBN=9>P< ϚoEw n@IW  eMb tvMWPi3NU[fߍP~IP=u ,Pn?RW4Mg>W@ W㠞YW!?sEZlI[!{DI^W檝mT[:_H RL_g!aWu tu+bWp,Ed5hW-[({-ɎiW۵Āmfڈqy  t 4l\uי; vW d-x} O/yW5>jj{4|즐٣HWI g41YҒ4P,2@W&>ЗWZ ѭScj>`kvOܕ3^WvDQV]H| ͽײ+ _Xw>\6S^[uѿ׆%lQѦ!ބ3RW)";GG&]. vmRSzWװbe:ב=7b.:톤jԗM\ԗa|!=&ח;"?YbWmb_ aᗣX2 (K  4}ߙDh~E(Wd;cS Jdv1.]!-iJW i=~|d;VWNkX{LM|W :s66(|0rW쫟TZ],{){@W|$T KWJSo 3/y-Aܓ#ac X+ FHlX "XyGQ,BpXWo UXn' X#'G=!X| G@g+t9F'XG r'^4n:w)<f)XZySR+r v/ʍ 6!/Xt`5X{6|d{/J6#X 6\e'z<9̾h7Z|l;(N <v>95@FFAX1DXGfl V_GRJ'-ls|^KXGMQSciP,"IQMaY xrG\IB ^^^_{_11'+^؜1#bX!?f',gX| {hUDiX#;hwjXWtlέTBXnH@ZpX6"iSApxL~.xrK7dwDZ'e{XK/ 5|X[Kt#|;|\Σ2M/M_~5 yi Xba]؈[k!5|Xp  `=r "VSn8~ŕؗi$ !ݲybA ܛг ҽ" Ϭ+*XɷG ?bq eFl.\)3  g'ǬcV%X$W XѭRMfd׮؀N DX;*jX -- ',+"滘Z;  SX# c̘4Z k4NXz5 *XU:Ҙ*n=[@` 09"S"6 ^֘CSiXy XώL\h< X{!SpueNX< ˀ0+XpLYXk da z[?uZ q $!,qZ9 8*[ CXxb$ٕX%ɄE, LCzP9KQ]SRn Vw=Wii Z}XY I^59`ڕI`BbɁi(d+=8?)d`!΀#fڄ1E Hg h0 hkY!]^ʀoZ#}pqQtD<Q̅u/xvE J|N|xh~>~Z(ghԤ  c"_t1πLӟ jY7  =k }nG 4u$ z\<7nʈȄZ=l&ZP@ !iZڎk֕ZQ nD؃f!]/4!ӭU~"` 1WgxĮPO_} g%I7uK??&ΤZ6/hsqn Ϩ!? ;wWfqZUt=5i{IW@&Z )YZP;_ڑ aϽ/ZRE dzmYh 7P_$隇ǚ'z|un I9ڔ6T[ X`ΚGvkϚQZ;}6!8$hQB_ךa2 4XP.Z ڬvO"fZ8cF{z-H皢97A jp Ҭu[ 7 (ڪxcʃE皽&%O^rm9x'Z[[?Vڕ SdZBZ:^ydvڔ rƷ'l0 d|p_[&craI ~_ݍ* [~ * j` H+ " m?&QV Yg{F l9f Ór#rկWe[J[朼nz__p"fn",vçj$M:m %[] X#[_@%%ۮ9̛P+\b5Z-[cs :¯.֐3Vb-9{|Pk$;[tx;۱ D oo@[f 8vEgF[!Kl(GC4O6KvJN! `O[g)PrfO[-uN3iFN)Q5SPGP$ S?L?0FN[C(DW[cQ}foYۓ@NlZQ\JK\[: ]Z_am2Rg[yl-h۸;k\=9l =*wlo/Q Ɩn!ٻn@Cf pqSʅVv[arz畇#e.Sy!j}s=TƧ x~*>~r]!;NZƃIu7Ui{0|S ۂc!+[rS \zM?X=[( [2g pIj!ej[nKnDn0;PŠ2#QBRTY*𔤛%R; P[ N[numZ%Fg}梹PZr uQc[FV*2u{ɽ1iyw[:7[>DC_+\n_ *)ś)䃦ܻ\}٪ǛInFFtÛ޼\G˛jnI-U͛׮[# Eeu*. ^pϛG[ ۚ 9\[>-(6DkyP l#>ΛDy)! Na<ۛmeF& \Np p*Bh!(`9d?~8cΑ'[ \o"2[5_a. ۲{Lź M;U=?Y7 Ի[\j[EA<\*& UT}]?\qbKܿ "ʆz>*76)w\%f\j \#Fp!\3O{RS"2g"\zx8{#)a'wU2(~ؒ>)]2R*Ȋ+ܓU.g+1TLX#-/xڿ.p x۷.\s-0^d"1a1~Z12Gn70s4sq3\ŝn,6(3\"[ ;)iYfO:3Ɋ;|qt=T >>~G?\6$XC?\ɁA\6_O"BܖȉXArV"Do E?7 EhyaE%Ux/!H܍rDssIy eHܵO ӍYK 2I\)wHOpU?-GC+:սJPcR P͑ -U>D T\0c 2UU*sZ> M"_#=@f\P ihjx uj\/Jatpq\: Yaql WLq"3u\<9{CL=ps}\Kۿ4@hfjӞ6 Wʱ Ԏ2& gb]E@y-<)쁕ш( @9 I!;\-C ËV!jL̋7`hO -6;R ^\km> ߮˧\]L-~\*$_6$,QŦv 8իW.ɛdZo<\&EuEtK,бe =Ʉ6*\VDc puTU\ikX5 w&?Üm%d\lMofnG\`,.>\~ԝʮ\xBo\~ͯ!\EZܷfƀcW\y(iڜIeۜ=L"W\d6K"e(ӳ!.霱gńVg \?, g|Fܳd  v2|mjC` q[2\2GUu1b܍Wk0 wc]\DVC0"Z]ɍT]3y] `? ] IIn e:; X$lݮ XnUXy EQ ]q cKuҋc5sDb]> ] vv]f¢]iocmO%s_J X #M"eTm#as#?"լNH3#f/ ;']%$Jړ>']m")mmSZ'xu.^+ݹ!h[, % 7-)p ,-,M 4>-?--'wrT1Z4c*ݢe~IDX3ݒ6$l4^3k1 @4? ԥ4]>lk+,$ 8뼭3-!:=;ce??Q(Eo D[>LDIDe"/ߚG/Gͪ r'Fr HݟK]Xc![G/M1- fRN! =OcoQ{ ROAR] {^QV6p3Y0 78_{n*`egafb] vXcyܠFtk]Z anqB\p)ePrq> ,spi9nu]e7f}lv\ZĿym9oz,-K{]gP) (}f}]| e"Ѐ!?sANvq݊A'1:] ʇ]6@$ĝ]@m z Z*p O)W>5Iզ]V;~7z̓d>y*f]tv>sy]E.YN5ʳ]G ȕx t;S8T!w~]stD2 r@##ڏ݄•lw[ n.,%>j'Zr PiJh>RW ]Y aU{9!<55 KKn3,eluCܝ] ]Χ Ν?sh%oG݃@8pI7=n:՝* *]HZGGݝ)6]Deowedca`ݢ˥ՊT7F靏1طݜ{ `zH  c]k~ ?]n.u."05dr]eQ؋ ;[+`g9;]h$~zN2=Nk$9s@yy!] ZnRN-Bh"/gS+p%W|?K$9 ޘ$ ެjgBi '޻ 8l -\ j$ R~]Z` w^x:ےKս/^ N+C!;nr"CmG Z!^S&)I>&h(Y&$& P3"*W+9Rk.8 MF/}@f&0^ ­.^/3oY:.mxeEG6^ـ/97&V: m?^b(FIg@^ 6Z,@K@NLCO"H&-P^ҎLQ 5g S^b RTޏ}܃GSX -],Wg`rMV`VnNb^lc8sd~dg-G|)i@ &mlk%%n0H}T{rK#{t@sD AMtc)Het^ vގG is^WW SsnpI 2>EsY tރ Wz R|_>Ⱥ~|X Z|q3-7u8rSe,£ (rls $$+^nqc?m'W1 Eٖ[%[Jއ!V܈ *]>\K0 Xq ^!}YJ~LPF[ШNY1o^Qv[<`bwD XU)>>^my[xR!뷞5m 6޴j*s,^B9aTm`Ng By*8^n ^00>®[/>MqS+ޑі2!HP 8!ƞ\ ??iޜtuɞ" L ʞOOV:^˞FzX͞gΞO ] V^k*|5^Kh+5^5}A H2מL p?V`qzfVڞCxoߞf/X~z- 0?K yHq^{BVDoHPҖx`| &OfB^S!t뵯nMN 6z&: x}^L~6l7y`k ?:1U)%=|!yGS ^3"@oOĔ0?ˑ߾?L|2x! 8E" ߅!bX7^qb_ φ F̵ rXɨf/ cr L_\!#_Ghs6$%.̾&8,+'#kH`/06_ 8R ͜8n+94Qb۟{0@ >e9Q_g _2Ԃawe_ }I9{ោ _OKw0!ƚ{_`QS_c䝾9Y_ߝ_K/I쟅k["K+.yyx?mNz_27CWV MVy h s+pVN `6mF R-H8 K|.G঩A/ "u`N౔de4[ 27Z =(0 :R2E|Fz}3`E8G5r8`!{H 8 㐩2?iJb? /f"/iD`QjD F!enG`'( U6H m3H)H#L]MOkN$O 7:P`P% !)LTR`cy5S o3XUx {Ve~]cW)VȣXXWCBZ Z ]N]`,|䎭^ Vҩ_,`Q?{ija 8,br=zd7E 9h`7_Ai` H'Ll`n K"n`_aWi/n x"Is`Vwy98#_y`D u{f|^Hē}ط a;U |C rGg ^믄`m`酠2`JR@KpW,ɉ>坊`1Hk`V nw1 P ێy ͏Pv n\Ғ``Vq ` `!)fɚ H[xIZ_`a FxY  >< W3':'`4Ω L3> V~uT<d_e nd0`IeR\PSB 9 wZ X`L3 $˸{и`¯;آNI@ꟷ3P.;fB`: ;L'i`fj N@ v!H<   !}`2}P{i(`,j; B>W &R\Bנ5/`"JC{#X6$qU6B<ޠ!VPߠxSp%`* AErdˉQ rg` $ a'`WGdo}L]KlC  Je(f`" [ TXQmJuu|o 7 ) 4 h$m3S ۟52߱ Jac"ZuUF 寶 a8fm !"]_ !R v!~r-!66\ rQ z{aCi$5-C MxX_/B%-)!XYf Ta )!x/p !2JY$`n)!^/()! m!'-᜶&a/!E J0li=c2ƨ5!ۼhQ6Q @7aM!|:ګ6U?!!ϮD@!R^zVA,m$gAa7Cav /$Ba,~QD"QyPGaA.J!okPBtKn'MaԒl)P}R [WaAǜW!栒HZa<Z}Za~o8 h\a-yyS:] Q^am"3_~ _!* Pmw`a:uba)E0c!:c!ؓ9`Y7~i\y0k! iEoMkFp ;]sXoa ,KYC QaC$ O ij&!,p :!֊a* 1aqԌ,/BamLZ4X&<!ڤӔaj!_`"ěg# Ma/ħ rM`?yV>baw!̅Sv!][9Q?qayGko.!ʣ%R / -,XL Lavyka#(oza# xa R;!v!|'Na|R_㶡/oZ^(aV"lXl;aB3W:a(Ӑ qI| aJn>Ēca &D-z!.zܬaU0oa[}ᆈ3!Dv!8 wMak vTڡ> yۡV"dcD, ϴɃr_T|)ab;1aqa `I%P&1lL+1 u C졣י\HS{awO ;$!4,aZ p@/^aIw sj+JߓSB?!xB7s8!6ulqz!H O b[R[$[!^$"&Dl"' 7w$ ":7@=^ |S&6J!"k"w>aBu LKƓ> jVq ~vbA!*qyi f=1 "b,lTf.#O=$"=/&Oq 2b23ba(5bG״8l xe;bF< m ="O//x>ٞ& z|?)3@"Oq1#A",D"b7<'E"YmfFb %@7Hzn\BJ"SBL1% _O4QlٸP"mʐODW:02R7Q~“SAy$Rb"XSHM PyV"w_RC ¤_s 8`;e pgbnl90EdmbX?ybRzIxvSybb Js|"OX"Z~bѥ0$v&uTbJH xKr -bu>]IVbat"/ VNbZ['"BH ڸ{עƛP &L%1iKOoo6ȴ"w (>b҄ bupyN/lbj hg⼾M1"MHE7b|{ y}L51W)_$_?O:sָb'njԏJ,r_. tGz KMkR 4:bbVunBbG"&ԲC ϯ=هɢrsb!WϏ|fKl"ڦ6d(b]e¬"L͝'"rݢB VP7.ᢈCa"yC8Ybx. % Fy`"%" ^P^ V)Nҫ:A#^ctc7U|":9 9Y*ܠY /0 c *B ވ@#!t B!E〉a-Jc/J-#i N#R,V ~cj ># -RcQ_|c}ƹ#M.$c<#9-9h'5N5n(#} 'c&"II*-!/+c+X]>j.1d.3 t'0.WtP=92#{GQ ?6#/;8G8# SKx8|: 1;c 9cZ!E;r۝>cM S=#F {gϺAGhEBVnzqA'jEpkFcJdoHhIVLKc$LY *|]O#%7 X%>[kxe\w X<]4c#C] Ae#IM)fc4"g#dgivwgk?Oll,l#iu j׭q#"!tc }|lt# ;>xnZ$RW}%?f5}k>7! B#X}_ #4}!i#q )a# ) 8c/$ŎG~⼮#j"NK cl?~0#cN"Scrq#d kJBn9|Fgf#F| b7 \&c Lw!HKNcz+T9ch ѧףc3Pȣ``cDxʩcH@c3 z#Pв 6^dJKs$sc<<#D' 𳬸#~Vw-xc4W7Lc "Ym#žt񽣩Ll#<_ c>!oO#mEcZq*#)4 U#-v@c. [tbcqzg#W׾c[]٣Jg l#!jW#ӌ?GO  *bc@:O D/#|%j$H-P`1(e~d7pr!WLg) Nd~!f>#s!Rot(IJR -d\ RU1-9@ k2}F \ 3uj5m c/6uK5fFM8$\9$S6<K/T;$Y< N;h!3E#RGdsSK~dNd&CWbPdeQdx TPpSd1Vdb;V$M6WS KZeR"H[؜ ^ia_$5'Hd$#Tnd]v3e=g$!/i$рinܩ2idmp3\8Fs$*t1 y$W1z)!}dj~E!p}2C"dsWZ$;ۀ \UNfJ0}V1$&} +$q C—nIG頵$ @b:Hڏd؃ xd5Jђ AE;(lf6 iD$& xƖuB7?&\PLeZ}N- cdIL+ $,ؼdW!f ^7D2:c"V|jVN$-am$#sIQð$D OEU$4b䮵 ?dIuV)_$|+>d#w Jc. * Hf(ssIh_O_$b} | T$Syg -s>xd ""-{äad>h"_ʤ=^:4z+)sE>"%dY Cy6$$٤ 29g[?4l7qqɞSU|4M a}"dU$䤧  :Fb(L*H礒aj*1dˈ;+Z4d@)XEm`'o@Y 4}XC<]>86cy2dyV";g;p$b%gH5ieu Te88(^nחf%G%"{%߂ A1iev!SN3%NK4]?BS9 X~3@'!%Yh#e=hT&%?SS/__&ĭZK)Q綎*%:>,eoo^-eԭ03%iUe4ᾂ ﴡ8pj`1;e_]"L}V<ҺD"5=%J>%JE>Aj !@e b#A倗ɰBpXiR%/B%UukoGnGe?O@{Je y@ʹJe K Le&_LM5N]/N%eisKRNPe*|\t8M%XS75PSe'TZe<mlZK=\%l$ ] _%,&ocb%3x>춈e% fRr ?j%ʪ`peFr}ZbDs%vt,0Qt兤(ptecO1t8KNB3Jmw \x"]xͭ ez{N}e2B殇Me]%p_W%A>y-47l Q8K8l mDȌ]0K% ?߹%x2ܯԏd@ Zz* n=Tb+Vb?Rg%\D\a%ɥ;%[Gf%e eֵP}e L ud=a?dt+ ve~!!S%$ M?emf$!⥥F Gtm5K/}`8%YlCoѪez%{q"chWW3BB IbЕeVf!-6(eG䄸 K%kT%Ʃ%ɥi/ H幋vp\DA$Bo%dsDS%%{ پA%tfSGr? j 0e!9[]%MO!_qm+I8B2δ襞 R~9%"eRft܍ ӓehJi%5=x6>e#w)+U%H?e1"}OZ%4:Q@}zB{e61 & f"d f{fa &{1M}=mSQ&#UeWfU@z9 f2 f/9 Ey&ȱp/&`٤!fR`J~"t+L#Pe'E$fX 4yK$^ؾH&8oES'ͼvo'Oi ` *bC: f*&zn,f|QnE+f0u9 Zs3*gVY3&d:H0Sy;f9 mlfVձAuʤBfifGB_E` [Ffk^ޚ dHQFC|LJfFA\+J *LyM(-rp SfiD}̃TfËT& |S?%6DAg"|緡D44V8Di JFg>JgX/IK' suM y+w\P(a^YPq GiIS*Sw^}KUD umVgg@bU'cӗX'*yu0YgvDQVգW"& [' dvRn4^'sg_'s!` h$*hg k'SM\Vl'rnGg+pg~$Rvgwg Y -x2gxwgKFf֜=٧`~o 1ueguJ K'H@mgs_Og8("G!@E=G70 s 9' 'Co-g 烇ΟgM)V'ܟu*Jf,9hm\p*h?>h  hWo ". (,on hx1,9= h!+i>V4S+J5FL7!|M(qf`ڲF*s(Y\h!ˈ(E B :\h"o hsg8\a'(NT!Dߛ(k }}*hhgL*,hyq:), Δh.QL:=M/$}0(A>P2 16L9":MN2; ᾕ9IR @脾)Ahh_@+vAA(-/EFK`(GhI,b+G)pGhEJM@>vI(s oL(0-APh(C `'YhD EZh@z[h1%Pÿ^T!_hXe(ަg%Bl cQh\1vi(dV5nj$n!./Xm(4DJ ?op*erqh|>q0SshIGuidu(kgލ0wh"?#YZ5z@-#{{h(B|hdpB~hدIe'ѻ(ݰ#C I(aT9 | qߎ ?HhJ >)ւ?#A'k{…(4=O(M;n-h\Ek(nؽxe7#us?אh* aF7uqUC-k $RVu'D!jEp+ ;iE :]-hRAGghW 8D(< 2rhەhgw(! Y1(^atન*nph}Sﶁ2JEwy8k(reGh^JS(F Y9ɲh^^vh K1! hWýٳ(8k8 J4%'zz&TbF (؋ JyhDo;(/5(- ӢhS0(<i!a}ƨlsu +܄ <=+˨ /EA V#(]M;t+IY(K5,I'.(D-|aר1 uبsd|a٨n^ s`(B r<2bD],kh a66转o1?#gQ(xEٽ2h~.} _CPkOIV^~z]($py(V(w1%M hrg (p"xh d uKHJQF(% Dh4\bMj rW) \ʶs}( uV)zg 䋮 vY ic" )Uk" )B תo)h?9d.vVpikv @g5 i4pd)d'Nh`i2|̏}"&c)_H 1j \' "Z$)\$)n!x8&i~-p}j(iv*f))B!?,+u@6)i#95I ;)$'6f=pf|ӟ?)swa? u?)U E1DiЉ,@IIG)&5H"*lKi\Lό?GMGoO2N1 KBT)KU)'4 Ti?rW)ݐ]'b`釺z c)diAӖf6wpxg)h =i)Dڊ!HןjT KKj0k擼o)(m bEs"it)  3uim >L_+z)I-mziG N~z% DeF+Ni3\ayilBFy[)>4 mDv ))1fŘK  鯛w{ș)vz '9 ̂5M <>&`С,O2)78&@),3` Zi_M3Q nZ)I R q)::?3iJƦ'iO]dڭiY9)g-xА ̱ɰaLDAc϶zj1>AtAڒ\ c} _ ӕeiO?:(AL sjP +D)Ȥ5Q)GD*zzЩɲѩ*D=70ԩz`x̸im i&Q ٜց DiN[8i 9ک|K&)]6=iiǓ56 )-V1l)2zAr QOf 銠/ei/9j̘Ӓi]RLi6i|>@ib P[)="OCTXUS7`)\ #OINNpjYpj z5C3*'M Ґ̷G Ee De":(cjolJS7Oy[q%j jfN5E5 0jP  #!*J Wd /ڸ#9wo{U$*)r> jTL!]`''jY)*8+W ^,j%%?0n%OQ1ꭤNg4*X Yɿ5Zc i5#<5*WU9;j|i>u>jp"&?޶ Ɛ?j% Yݚ1?E"^`CjwQ;#DǮ43G옮Hj"Nch[%Oj+PyQa#lT*U*++\U*.KX[p`!\j -i C[:8z&^h~\_*W~T`*vFb wiD:fgjMN 9iU 4Ei(m* bYlojFcq*E:q\1s*ܖ +v*): w*efƘx<R3T{j! Z|*'{Pi!Cja8%-Oj'@NF'2AODzjW 2j6R &5Ljx1$'ȚkH4 ڝ*-U gexͦ*}B sqT*4'zz=Cf14 ch˼;ײ}PSz"xЊ.mUj*b*lj~;*"!*4 I¢̚ Db )*;CeA9 Umjt*^<+*yj>e|Z[j4jp)LS ]¿:E[Xc*v:"^,*c24jvty /-dꛛ @[{_M95 10(.x j, jyB +4sD!*b2q*FMP*!)R+х 7Ak\\svy |[={jS Y !~T*h(! vk3~ >6`+y6 qҽ+p`!o^=  =5+!S +Q rP +q&GA0 딩xE#+*q'$)kJe+ eT-^("=/k*;pR6c4^Z;)I3mk Bۻ (GkKk kVKN+iUO>OeYN I*Q0 R+ lS+~V4T&U akVTQmXVz~*xX> %dZ+ [+Q p]kp Yw]k=*e_kw m`WbY Tq[cN dkNb;0wwY`MJy븻P"zk)z~' F_|+p}CsZ}G!|/"o鶙+߾hA?+13 R𹔙k:lR(gywkڝ+{9k?;+- YC>܅/(Y;uЕ+x<鲔S>m<"p*.k8\J/Iw$* *: 2>kC\ *녬9+ITZhϭDB -f|kF÷*cR ?˲w7U4gzVl UXvѼkjFwнHK}gA$ Ͽ+2b$ knX8}ab ߅ּȫ_VwMwɗ+<VkwŖ+n|b:+cқȒkf-Ы2j+f$*"[' ɫZ#Bw+/\ ʑU+lLU֫dkh!Wmf!\lɻ!zZrPS"kAݫ(Y]L#+X< Wk!Sad :xq K[) O#櫤TC 3 +.A(:zka+I #k ȠUq+Hqo+ *qkg"kN;mU,J WnlJSٕl>Hy" wQ z-F( ,{\ʸ ,4B߽,--!lqhG*Ҝl׵l[_a,QlVFd,))7nA>, PJy.5c'al#G!2 ?",b,Jy$lGd (l8x9߉),7?*\ 𥽿+l',gPTՊ,,r>{K+, %M".,o:!0nl"wF,, !#h2lNX$3EʮJ'4G;sN5W+!ke6,.{9lpH:,,`9,R>D=C,_Fl9hFlY9'Fl0 6oeLl9LecfM,gƒM1 8SM"̯\T,F" XUlL\=U\F(UWNRyV,l01lU cLQV,=Ww\,D 2\j_\?3TDb,Agcl, =;dj|\`2kl6no7 o, Srf)Htv,?z YPw,vxxnB[yl }u+{lхʛ,D ,ฅj[ϧ|]֔I, C> lZb+q^d ̺~-]\ O5&*ų,w)RY%,wV l̮q[h!l,m*LI[lL ɬj ά^^6o#άxC*!E${Ьdk,!Z'ԬyU֬\0_Q,e(sU3XplS Ja RzilB&(glZm5O,usU쐐rqUY0rS,glͦl/wbߌ,aiu-O:3,&  l6*",vl3 =MlGHodl;],29_',)Pyh~8 ,^-\ j<m^!.ˌ4 - mp͒-!9mu2F-}C 4tJd"-#d2<Qp[]!4Y"-,>)p!En*ӊ*- ##h0!,5-r+ dl6& ՖM?5mOt6ed]ΣY?m5NHp?? V!b$KA>ULBpǕ1D-j /Ef HXN\H-y-OmA>^O J:[Q2ԭviQ&T8s,CUUzۧ\moQ]- Ez ^m'+7_핻d `mlD xhTaQ8_@a-g a ?8cm*xVchc\k`]l-Hm pUmZsr >,:t-pv}umbC[v%q&T[u# v-{cqw-4P{|zH k {-hQћ|m22$zmr,) z-kM~'WTtm"=O-VxoDs-ÂJ HmTL8 |ŝ>mב减߁Ðmp -F/L"G擭̄S٢-kN# oΔ`m$=Mxʜ-9}[ט-PfW@/e-L-.lB .Nȭ&%˨-:t8-Ñޠ]mY_ kkm2&i@8έMH`- #qЭ9|Am{\ LR=- -2 4@n-WSA -rPkP׭U< *n WBDR^.3(zz);$ ^Of"ҽL!j ##ς&8׬7(n*OqL[+nm#ie,.'W|-.77:e0U j1.:TZi2n/3s2NR4.y,-C6nH~!w#7n~[(U!8n!_8nƺ' qa:.` `b9c D9ni\:.F/>nrHsBnUSB.!g `\GnP{QHnanKF,IJn.5 `bon~0 on$btnG vy.D~ w~B+~/6qz6@\Ǝ^6Hn|Xd.t ҹݑo. @*他nm3ƮјO [!ș.{J\.0: ^&T.daM.i钟nDˢ9@i$} Q_m.ʈ(%< n[ )tvn ҝγ.ecqߵ3M 4 $nQJ* 5)!"u.`Bur%/\knF@H. ãnQŀt  t\Nn x(.P `Hˮb Ҍn2Dj[ͮPB*,#Ҋ7ЮKrXa#qTln;􊠎nzxخ@Yٮ@zprڮ)Mn}j.\3'ܮXB"n&.ISnB; {ޮMa.azoeYJnVTM",C3͡vCz.7SͤZFsn A\ nba|t/'0.X/7 h Tj SzX 5Z/V 'QAop)/0}oW #wp vYI 8Fp4|R7Pz//KG]!o- ]"z#/, q;# T3&o] Ô)t#p.,(//e i1t-4 Lz<8/^)z_39kxK *:;5>@9''د{/䠛 Mh>S =＾!J7aCor8ƻDo WFèpG׎eakjL/aiNv' wO3 pLRI?q/l]s/˺ow/_WVbwo"*y2GztDb{/Xm?|oSloi% DMiDzr~/go+=Uo7/ (x/BgxAwLSBogB@8X/;:b_׋/1:~//-ø w=ڸ yY^oxYYϻ21 \pnvl9GB)C-A"ZUOP2ܨS K/k/+/9JQo'/]0/T{ l՞o( {K@/$/\ԯ>x5կ c/Hfjo?9oޯPƞ/E?pnF3?/I,zu Q a8s/37 oua>@/MB{/VWU ;G~s^,/^ϣ"p |3w">c3/OKf 4u*/3T+/-Zo39KKKz Ҿy{`(i7gPoofox'/yo" 70+ p]7X0E6!͙p ZP [ ߚ l`0yoV pMRLv--07y:M)B6pkT 0kp!0WP0k#Yݜk\g \Gdز-"p2!\"?E; h,$pA"0 9K&pTL@OK{>DS#pF.+0&`\/ppV5c0avR/y1pr08!B-3pACd40@F*5p0 84pRI60|A*O8C @TO<05诌"Cw ?0 "cB@j3OD%tD0vuBձG044D7GWlIeFV#J( 1&Mt T0WQV j![0"|]p?j%<^0ņxp)_p="_p%c[ph/amw<_0j#"2Tep e"fw nƈf0 ؜gpli0 e0"4k :l#O%Gm$gBrm.f*mp=Pg0 wqpjFiTsp 1_!px0y0kx0i* &x𽱤 #|0>>~pv u~p90~EC$ p N!F0fk#SʆC6v$r˺0Z%%z0 1d͓p~z nxN0M\>p)/;zwp2H@No& `\SeX;/ U*0P0WIpu  LDBД$G <0ͼ0&#K$B~܀p&c"o0߮0p4 # mǰ б0@a> )?,/-DͰKqp\X $?0Y+.OӰ)p \ְL#ٰQ&pK{_s۰hnx0t 70fV=\0ܔ \^S0)D4)H ЎŦZ o. 08<){1 D׆WEkFFqM 1b сS@0qKo1H 1'!; qY' ;1fÌaUnqʐ 'AO1n #/W/xEc!b]q7E1dE L- >5qmUT* ^{ 1<cB$ao8E+1rCQ .Ak P01S `Д2qDOxy@3@E7ɉ29 D:nwZo;Rƛ=qOx>um <X3>CzBn5@q{ hcA1iBxe BL! pE!E >}Fqa+uFFb8HqIq+R^J? m.mN1awOq9O< \WQqTq}Vq:!noWіX񣢳\{v^)P}a:]a)ICVa1(G$jC&rq̀ i/sq%sqVyr2xlu1oi;7vqT| APz1m J)5 `ȣ'p z5>Uy b1bq2!q .(jW1o8 5 8L$p9lԱ'h^BŌֱT ugݱrFޱ 0?1+(3q<+hcqLZ1?v 2O |@#0J)>AK$.qMQFr1q"!X"Jd1k qCh/r1ir$A v6r\dš@r32S"E2>rjU"1o21O+2:WHfY g7\^o G,[ h6qk r %2Cy6a| 2x/%]ٓ7r5&!{2 V2u8yކ X##rk\ w&8Tz k1̘'rD s(2E"5X)rWH*r!+pJ*2ye@-2Zb}/2VqY$02/rw~ :/rM WX3rN. 52/w8=3n9\/9rG@;25X9 0=+T^Mb@u '_A6] -YAlQlC2ϧt7CrW^:4B/\CIjmyKr lNbf BEOJ %YNRD C1WFv on\rR$Uy]'=x j]rb2 pScx'frs\vg2kW wpX9dp2 ֑s >vr=bv2p[x2|y2+}~S|VNݙq}rR~-" 6f2c|w~r\ͣze2fkqh@~2ffXLrWˇC߇&M rܓubr.pz[ x0s5٫c9s pg#;c39V4kGNܴ!΁9[ 0M_Md"l󂠑4 k_ &swy>X3H>s[+(˸v3\5 z^;^Gӏ!s 4b#{R i$3~1fd$s|d&+x Uz(3qIm)Gkg]+sq_.3rbh.d~Ip.30$+em0sOe%.&Dv0s+2Za%43+u_5=󓉻FX@J}[u@3qBXASSLEdiYF3T{8ԖJFsU "AFAL)VZI3,UszF31%4Vs`"sFXaY2Z"X1:"Qb\ǙI|;]-nP`3as{L\`3ʠ c ds^+2e3[ $c gsjh3̧ iŮMjn ~k^f q3ěYsA Os3S;َv3a.YwsIxHJ z35-h6|3jX? }_ Q}s =7~B3,Wi|3W8~3"_s BslTZM3`ɋ ѐ›rsn Rwf{y! (e\,fVa"ݫ},}HJs*)7s[쳤 [cENj;ׂ,_`kG1so4W4ȳ3nE3o6'-dB(Gs`w&3ŞIP=G. f !..󚍌 zƷbtbc-bte`wbJ| ]mtfF n4[IqmDjq: /ms-# w-Mx)ek;y4ĸ[>Xyg*Ѥ{4*6y]@!vX}Z Ri~Kyt5C!^_tsZ?vgZ?d畂4#^ txz~2\=q$?9 E^Q4epS?Uq :;SY@М4lLg^ǣtPOKrt9= Ct1a 5Φ]`S4 ^}"v4+v혯tft# l4fCntw x4iiƶ44G/Ge4H#Ctx+94Ox*r1q"z4k P zGX~tH` *vWVt[e(tg!ry4sD(4#z sw4!dt~) yo oԴUBV0!l4hPt| \4ctD4 itw ft4O @TD΢b촂ڌ~4M PBc9JnF$N\o4s  ] S}A4Q X[u Kv'u5㤯D u X O uop_ >/w5`GoǏ5 9K5.eE $em5N[u=t"cN~!)i 54F{ +!tHH'uYc)uh^)ܷ +.u?"`/ug0)VZ S/5 P Ѻ`M05a (ҕ3ud41k5%`$K7M3 D#3@l|w.u~ xcy.B!c?@ *EgAuz03S@ %xH)HuD5SIJjbNui3OZfPSQ5(ٲTPuz@EQu`!sTun]ywUuf &V$ CJ(VYbRZ5ooz\DJ_]uF^} {s_uξ`u-";aΦb B`8dcu>Tc5N+]!DfE* RfuNJ!MiٮkUB7 U-lu!%Htm5 mu pyoʄ ( ܊pYCijq5PDl5PТs5&ovu$6g}5ha|~^t;]L h5Xß|"5ô݋oP4}t%5eS ^-m-5fo<%75W5 ~$ 㙔5 ;.֕MB?6g0ugc+: `U5dO*E5Ռc LKݠOQf̢5qXu ?>uߪjꛧ5>$|ި5$0 i:uc-fz-"5;۩^1i,!3 r5ʬjoъfpe WIudiAu2] ~2l4e @5£ dîVp G5Nic, 5}ɵ?J5U)Sʵ%6&pɵ -̝Aȵ|?u}];5- +vLu|2t5s&xuk!T׵_ y55iMhٵPBO Hl9oCJ.U1R0ud0赍" QR&k)u(OwbJwu|_,>qb:)0L-$>\#z=@>=wF[ $5۲u8XeWP5Çn"(KuLR ^Vjy5b"3S+O }"6 r(r^gX> 2v vs= 6"!~C=LmmYvc'n{y<!4ՄvbTM@ɵ^ c0/ 'EfF s] r!q 8 6sG X-$ms14%v%|)|(6K˟)w*6 y*e8#i)6ux>2;o3vv;~>RR@v혖 AulA}$QD6 5|3OFv:j ٕIvzL6v8̾Mvg 3NiRNv`S G۠jOc!jf4)j9o?m—#FXvYӺC S6H!:qLFr3 zjt6R'x8w6[J!1.|v0؀v"Bbxv/E _y< 5v}6ה!_gvq`;W$1,Cԋ;_u(63,k(%Εvh<6ރN9ؘ  izZlb6JÍ}bF\v:*\ztF>6[OS2v\-!3=s6U&6("\6<pv'm; 3ݸuYt+wr(͡jPX eW7߼ =^IzyvGFpSkvD^vʲ/ɔwvp ȶB,}8zv%mK ahv1[`6 !dvFZ <ζ Hv"T "UҶxHGԶ ;Y"ֶhndE}_;!_rIO'uvDt .FJ@5v:w'7J(w)U=)& b;- 707ܧ4w6 A57v ^ 6wCS5oH:w9:c<ݷÇ@7rWKAwj"LPEw~(EwHw3V IK DOMckN77C匙QwR9$Tw׷5FUnj^x awMf'Ր gw$̩Egw:0F& i7eo5 kwL3l7L!,$okqy|o7;rJqwVdr7f hK0&rwҹ9"jw7 ]Šx7Ә |7R=n4#w؁qq\yjmT] fZ/n )wQZ dGz!x+^!:#W$I&8ټ'8< 5)xo18L ҵa3!Q!5xm58TC>8xv~0;c @VHxT qmHx"I K8L4QjMq; >8KN]QxV:4פ)Y8"̫V[8se^AfAt`8 f h)(lQ= mxl Ƀm8?p E#p8T|\ rxpX#jgw].y8pg |8Y (/yL2'qO+Zx>rމ 1\ӊ8BUxxUW*Iurxq pg 8=_IjGjڼ# !xiDwc@|"sXb_f n7As"l~t8 3]u r&8H״)nͥx8Fm2nawbHx,q{\ߵ8^4x' dt/ S8Y (>f86<~/t5̾[6bx8!/8p6Vĸ t`ŸC"6H ѶMK8 7 SexZ,! %Vɸ_ղE#x \bcd?Ӹ|"Ը mx!8ƚxY6\x9>#ܿGի߸\ \fx<8bx! xc~x8pLlљ 䂏8x8e0E,Vxx&"x5(+Gx,E@s08VFaC9Z|Pyj_9VkaByzrqy!ͯ7 E s dQ_y0ic, 9h,9ZHOp=;iX̯; y7mvt9A?y3$9&oԟs!E" \"9)+%$9u" \," [*&CVH’_']!6(ya;j+y$+9rG~{+G5.ym6n1y8Mn5\N+7yX[|e8yqs18L<9kJ.@hC8!d@9YH_Ayr$@Ac\!H OrqRP{'[ 岔QyKA6T#!x۸Wj\VWMoV\9C0!\Gayѕd "2e97Rky%C6k7z"mYyVan9 SDo2/ k9rV @q53kme KMD s=os}ws|u9LOJ5l9 gyq,m"MpxJ]yy7jG[\#x9@% -m{ %O}y]~9iЏAMy.v ɢt X{y? 9DQղ 9jtȈy`$AFyYMTrWx,Fn@y}ُcg=[ysjqCk(Sy39'q!ߙ9q'<, j95&b2k١9a95v~rX꣹>j ,"+r: Fyg?tya3$eQʑ9֣.+ש9UR}y>kP|9ln]7I"y^xfYpxyA 2X=@f]W3`/Xbyg-yȹCQ讴;@BR˹ qyX̹v7"W! >9![(y ,ipY49(chyTDN9ik h7?-Хb"љy9c392Ay[U,y9EIUݪd\y>VԀiH{Ry[1۠ 7hy[ =w'h:Ny"'oH9_9 $yd|zDF${۩y#Lygv!G =BŽh^T~T9 :cKy?,L, 9[jl +@G&<:j@|iq25ϧK8(* :Zއ"(A, zF@ E_=".uĥPN:, |l:uR%:}p$o]z+S5 QKF :GQvF T:m+z>zzFc4 VfDaz Jjx#:+wxCR## 7J%¯&:1 J^': )=(:1|dG=Z):= $*%*#!h-zwS!b .]0"0Y0z9'4zd8y7:ZP3@;+~]< y:oϘ=J#:$W>md Foq?NfLm<[ X'y=:;ZDzY 9BDV 쩿EFoQxE:pWG:1ÂIz]ՈJz dV1IN`Lzu aO:t 9kPU iS:VT< UےS:D!̮V:O>"jYz˽F 7]!,r^h _z Gʮcz8Aa I|d:p`0m d:W] ?`*f n gz}F hz>nk:f7blW_DulpVvozܒ[Ngpz8ƬqzPđFO1rv[g u},uzt,w;Fxz/V;)x{I3}:*RS~}4n2t3U@zWz$]zub:0&q&@8:"( $z7FRM파 ABt53RsΫzϞ (^d"]JZ㿿:F3V ?X$<pI?VC [Ưݨ9Ε:K{: ' 6Wimz\):;nJZMz@"JLz8!eޱ4xpй9 ~Ȓ5n꼺 (Nz)}ffRi@?:rBDzM*^Tz,>/ ~& 䪉zЪ;_c(Q3%Ŗmhz9b!aXͺ zYgK'ï_Wr:Fu: ,>!z"'fP8h׺K $׻ںm ں݌rH'޺ٛ2TU:͖h?z# Azr#d":i^zHZ 5z_ghc(zNO-<,kz_f!b?"Z> zw0*_'…:1 4;v qUz2 4K)-r:y=4zcl3`zc:MF :&\OaZz3Z8z# He{{!F?{/WNB.q ;0( n ; |c ;H Ǔv;` IgmWӞ{= řB3w{esio+{Ԡr_%{7iշ'Dž}';Rc*"iG2*;S.z2hr^3;_@2{ R;5C |7;FpFg8;f9âWw9;pxs;b( AK>(?QݯGnS&xH{{oM{\ lEO n0RqRWLäTOs ?TV{twiUm\%;T;:DwAOWA?ՒDZKcY;ؽ!Tw\;.4 ez^ Ck`;ekbt+ cI:Ue;Z aWf;ɔBg{tm)gVh{^] ?nj;O ~ TkъGk{*XU;m45n#KL sn`%/l%S"zq]jމq{شdsִ(Ltzۉms;;s{Y ;w;p] Uw(z2 JXyށLz{/tU {qXdҦqw{AhDyڎl2F7##> S{ׇ7zuȅ{WEgD‡{* EA-! 1R{;AF)DS;A)46՗;v'q{%4l, Zܛ=5= ʺ9kHSXs{O;nޢxZ_ 2KL}v 1H*q);+Q䩢\ㄌDl };^!-P@H;;k;^ś;Kz­S +&J;S ۰;+mgx;){joE)v\*Q;Z zַG!{f T;?V˻; {'лfN_[{!<{q/?9fû5FZ@Hө ;}Wϻ* !;wGz0|y2;l " U;ЗN?;ߣW\{]);[[D S-@;KTg?fgS"f 8M3&gH x;(Vfo!{ɒUJ{4=0{k Z ُ`{6P4֣ 6;fY M xbz]#{ݣkF;5J;UG \wD{l,sԙz$Ff En& Af =[ l% |H$!hm7x|.[ʼ,8^t˼K ig|H r"/Dwмp l @%Mrk]|1q|h=Ns@E: 6<0W|U qqʠ;Rݼe e|1WJe3bп<$!KE!|`42!缓2. FtID 7ӫd@ = /d!Ns8_= ] {S=+=BvuR(?$.۔}Gx"Kc=>ƚ Qu}db !0|ƪuv=C󫽲6`uZ} 򭽒Bxʌ)!' Uc}9ZT~dy/Sdz=usrn} $RW5M }:=ԁ"F9_\Wi&&r#K=}C}1kE=;~t+B}h 8}E?WڽQ:H*4}ђ &k}޽zSХ߽ty钱}:, h̔nUzIǔUi}p,0K=%J-i=. ,eR.=Ai*}G>i}XXT"s79nվ}o}BC}_T#= DQ܉/\K3>uW,>?^~ًZE$  =;! E Ŵ ̷Z4zZ>quJ:4f&>E:͂~ph E(bPɑ!)P!K">-1%9ũ#>ȭ$HF%~ C'> C()>o?xc)>',~ η'~.,~ѿ,>ǩ&.a ,4" 0>s*4[0~ 4q31U&3^ue|9$~i>!Sx@~X>:H"w `C%i>D:|C>\i[M˃*Z?._; rK`>'G_~vKmsPa>jxeQcS 屯c>sI _&bh>n4i>k7 k>,xx6l>nB 0@TlLTnS  o~cq\p~ F` sqMQ^w~b˼Qx~ %w}bwRz>Cl*;{#|@j{~g苹Ҡ$  SC >ڙ~ c >Y! 4RpBS>j~/<%aW'Rs~C $~jD! '>q3 *>|$~2Of M\~(q898ag4U!U_~zIkp{~b_mHM̥~^_ɩ>O,ũ~u`{{+ 4ftɬ>23Խʜm~+3TiW>E +O!!f40l@7kҹ~S ZL& 0~?-.>*["ǒ,>f֔!<~w*{w ,5>i ]{ľ"Q!f>q! ->`nW̾Z>ӭ; hICҾ}mw>~!f ^S>j!>x`kJ>'{ nG' O~ >}+K!Zܾ۾_O 2\evxdT0[Z΁~R+德?(!N>x!pw>r!6~`Bs"| K%6>%ӡ `Q ﾢyAKc$Idz ~yuw~ęfnޔu>jVj3b>~9\{pefOfu>!ƙ+j*Y,8+)N\K^k L&2 !rF 96e~_ԥBB Ҝ a"%Q5p "G$k§q%r\Y& V3&G h&8j(?Ã"d*1d ,,b0 E-t-W: ,9V Gv6-/ -ϧ9?V;\ <> lӭPm>fmsڮn HRyl!NH>?m f\i?3̪JOK \(ꓤ?^baiݶ?az ذ }kn^{pǮA_&3l\ 'M #uSՑ?lA봿í,4;c[*Iyl9Q?7!?c(m' _ B[-B J!]?;;Sv/?z@tϿRvmQb3˽ֿ2<&׿E#F (RoTΊ#M?v & s2Td@s"^?.]?sA qR2?}uSF-h t"?oPf1?_>pqu -gyN9W`R->Z1i10Mo Vx5,jvd ;MDD.] $\>n|sRw9B'Q#.NIf fv_)xOAWSop/BR<PGwBIDaY+%;.T%u-pnh{(V@*E%5i&iGYx|L p/bv1w5DI'W;"D/7+hfsq4fjt]cBXl^p5V"'Qq4n{+=J"Qf\(+0 Hgbj*|OrcXEEZM \B m~mdMh(P2|` ="(Z_H0>W ;T* 9+cEz%v ;>4|2^mR({mf+X&b ^S?OBuuK[WS&r1VVK0}Q:6eIky!mOOq\JaKqNrOe Fz\T5f7'jtcn7IqL\")a[p%o@^OHfE`d|.U t {[eQ[hA,0J|a("!l;G3LO  z#Am6_ CpVDO {>c3%G $IMN]'w/X&1okzNY@ ;{t_A|l%_+KmeCS?s+D;*Y~{C/lZ7)3U' xX9;KK9zb*TOQ}&q|z=Hv5 ,/ JT/vux^2)hXI,B\:D: gfC:5EOu{Fn%dkvV)YiF.6K4PX"A.)|5G0PO9}EB .$ENk7nd\yAVLK-huQCkghK4>`6.FkBx' OiIBg, m]6Z]#B-w) E h?DN=WOi.o@iY,'F7-nh.2@Up /!+|wT IA_?U#>r0_eCKDT\0=IJT7U:zh zv9QS5lOvrV3:m ;)3@&1H/H\MnvUNEOowM WzFiJrT>q*f6WwE}" d#pYE^\O+V i1^VGLMOx,\P#?b6q^2e@{ #<~jWCC@4fk%2.kehTWj"#l-iem6c|ko+`b).2>P9SA&Rr)Qroqkcn8B`)8D*u1@~N1O6)-L| . C_~%@8%rz15h5<{>1z,dxRZM5xJe,mX8_^[HAK7r{wT0Z$+K]Y*WG[&MKo,t =$Y/u$As=TQr?yY fr!U2h ,E=~\x5g _P#@p+bU1:}E"H$rIS"M9NTj5iQY9(@Bk.G.j AH?*Tm_Gj9*9HlV5C)i|rQz*wpub#~A^Pu.^M.2vvV ;\S8+X *6m+ )J %LE>{j?T[;Obp#Bz#rN @oK geu8sBu'tV' {ed#.~VXrhu^K6:Z8AdT+y&N69cCh:dDcH xES,+qsOpL<b JUM?7#V"bPy0J&X5rWj.#BX--a#6X k%$ z:"zP6CM -giXU7j}.H(&DKpi4|6{~ $+iZ(':x[}>`i:az4^#=p4H=< #~Eu!,kZVX%Z |dkuA>RV;0wj]^OKtQvz&7faR+M#H8?5Gwo-fkB;RBui^mx">mKz7Vm]z4Sen3%Q1 xeQ}#W('9][h7!c^jbJU\F#LSy t'Xm0e7^tl r {Z+(IR[~iz*/h8jx3wrq@cXFqu$;x'1G0$/%`@8qO8H[!'(@ZRVq86BZTQ$~qlDt[WQ9Za^T`?# m tO`L1vlB4 ?P{bsxR68H_IIZ%17pqAJb>)_42R&Qm0KX'bL$ e%+VeU]7%ZN&J@| x`;sZbu ~kX 0&~: t?(e-]}'B7 k9x<<dO(4M)-vL =!q5~ }Z0O{d:W[.(2c bxQ:LWdo{,@b};'5W#xu">k#(#UOfqCd.E 5k 0WjiSkV3 }K [I+iDR1_. =?- M3YRcCMz]9;p=ys[me ]Gog-KF ,5>U-:[ppS8P[}2oo+!7I\p+l>| OnAnzxg2![OL1(-pz+R{Pw=UEaLJ-Vmybk9RUc=% sHIZx K(sXV3k -ea2P2faAo#_3FB)q^LVI*yZVZf%\%j\ &WXx9OEpoYW86}+V3']nUnR}ICGD7Bx D#%Bn{6bpN@V=.]D Jd*hw6ap-y!$S(+P&R.sz0l`hv4P\TxA $'-sq_jw*)h5>Z"!7:?o&z;qTvzm^i#yDpsE#U)b m]\} sED t:fP9cO&qPn2:Na]ZQ`d$KP]:eLHF_D,F kHUP]"9*V!)u4 $d}0h5Eh^Q'WZ3j1LsO @ 51XC`}M7| m A+(P 8n8F Mv(r,S=VR(G(_W;W=5VzAi9bPybc>Qz?Kurp=eVWn=3;.uZ1zH+=:{3RNJS:#&q`R U.vp6 }O)9J9at :*=j f,3]77[)c7HDpG`k=ng"aGMlUX 7srx"#Tm56"pwUT%g.uObN\l.? .8AeDgg3F p?]*@89@v-ZNbor8 ] in elFjgJ~'Cj8!SH"J_ @yY/C}=!H?E=$>)Knn&_5Jba@x/gZT4V_JMb;5eBj\SV3Syhh ]w PQ@Z,9O&?P1IU06bOGB@R)DNeW ADs-?ME64cR3{ k NvGTh(U/yP<'HQ Cdph`T]J[JhsdO%2Gi"t=HK(nq.'X wdw}z"i 0H PVt/[TzpY0?%8w+JS(W00-NKOLOBA-=W (3 X\>=5K cG)}"2@Tp>![TU:6) XCR~)?4v\k!,`0 q["4m(&Ugtma;IgjI>cFN?<ec/=)Uwj93SM AzG&=4^Q$MY2"w+ O&sSkT=+d3F#xY>nkAJ%:~o_v~yjX03. k`8Cz^$}I#L6@lax bhRg<1K^2lOM. Mn.S D 5!9u3G@8$^1Av !2 &Y>0]bs Z:A;O/>)Nxu]C<~9e#; RH%qVKa_pl66J?)|,pns$;ixGY6_]T a"&$L.'AaVq:tM6Uh> ]?Q_I8o;"ONQ9jjy)xh?e3% GDunY W@1HLBrn.W}4duRrLSKDVhL uF$W3x29=S pY=1:c@Jm:Q9 P"on~7 COq6ic+^< JA)cYge_A0l5djT&C &_d_x 0xy zL"K*Fo!.D7"Lu t4AO 8_$XIocCRhk`:y0_wx8z")+m_oGG%x tyraJu *EAVa0^:n^RYBqXe`9/ niV`jEq*uU4;Lov.-WuO]8;SiDjAF7@|J}S]~{;}mza} u$#B.^Fk}_M=fBP&7WfAT{<UfI1[(#Kqk0y(k[Ackv P@E4X G.u',=@ t EH'ByOoWm;N X|]7RIa+O[`WE5@(s\0NUDD;'wIpKJ kgK~}e#?pI`{5*2D^KXe><)BIl.q= sK p:CJfl Uk1x6U_M"sE:/| >R8f",:MlH!91PB\<- gWc^eptT8@M/lY3nl$Slm`5RI|~wc(=j(8;e,'KT3 QTRi]bZ ?|7oZ6P\igsC)lIVm!5)xC+T5%zglBb;;kBM]3- t53]NE .,H{R*T}SwprF~6%%$g=T4FUo7d ~12.\~&=Y!!eRpo|VdCnVd)e+Yqq+$z~tqRzvvh/<j:#Po_9~aGdmxG\l(YhLL&6eO}i")4"3 3s3w` ")d-acr7<,^/|u<6 'zTM=jri{f3u(S7@@+9dX%[^Jyi\ WJ!;J;K :PbS~s;5H^Mz'Hc#p4XBOj"|5!Sz ?<&xWJ2:"k nWaCVR ~NTVs~R:n}-L 1h%PLpQae7+1^"* ^9 )' }c7J:O=^Gff#nd]8s Q,j\re@^7>6 Hx[@ObfSg/R8Br 9X-B^1;aZIqV>yv&P%+\p>N _t;f3KqeKI_JpU:h'6X .,=n}H* 6r+JF!X]av~I t!zdvbf@Gn(8E(|W=Epcj8C5{-&P ;$FXvQT8 |f2}|P-D>~)4wh&l?]FAZnd~0y-LW=P_-diEe3b )0qU,/M Y6whD~fmlnmc-e/57P[3Fp?rNq-tcyp||0Efn[h1N02Sc[\74EhL#j.rSq%e@ a% FREBvB+/FC]"@2FX'^2"`L pG3-" \ \A.X\-/Hz:{h6 ScP8n6 [K3!W4S#U 'HQ=; 99O*}Zq'Qm&1Hh `ZJxR7h0s2G'M'#:,\[OyIRl \!JLx][4^Ll`{~3p17"Z>~WSJsAEW! Fe}C|OD m.A{Ew\7+Ba XIlkF'8o13gXTnNV8cxQD4LhtjGw. xwF('n*2(Mm #{` C)/H^ &vc7p1 /E@98] 6>lbX s\c(x,;Wz"3gKpi$ }% ~"k8gCyo oa:'wO}6:C(o #nea6o]V@HwOn11u8h<cz\ep-Q5=Z_\4w-4w6OFj_`~:.!.0y_6{.-OP@!yZEsA 5&!#|PXGyR9exm'%5 }h JrY|+7>1~a)w81U;5R`Fk*v6Q ,.p!nt;GwyZk 1TZ"*Ktm-Z/2AKp/ux5o8Sov/RI>)>|#D^61 3%f Tb>T)h(N/+IcbR>YJ+b$rf^`KFWXOK\A+-T|4L% ye}Jnc?lIAWcv(%6nlKDqp-'tQ1hlB[ <6#y.kCy[KSKyi9Pc)4W4/FAAQr}()=hq[eSFn.XB^\N2G$-d/vEy%0YFZw,.=@o,{GZC" "w# ;YK-F$Z"P/Hop};HUWWyyiY;>fKo.-%3@JdPg-vkd1Q%`JL#73E2jZ6Em*'zkzWKmx?(bqZ?UHM=)*S|Zr3F}N[N'N.}dk}VBxj.9}}?"eIpH<*ctGiop rk,|@\"WW~gEtb" {nULXwd|`Ohc0VYt :tgn8Pd,sjnc.~*. %uFh75w7&)8J} y>z NEQyD |)5Fu"L  aAd{Y/X_L`} gL"6UJj_YuK|{iR]<=m wuaG2~Y|9jmyRi0pqu -gy_/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/dfa/mod.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18_/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/dfa/mod.rs !?CC?PP"6%9+*MIJHONKNNOLLLOOK ;:>EE?FF"6%9+IB/(NLKHMNL@DGOILOM0LE PHNHIJJOKOMN8M+MPLLJN-OPLPO-P7JNNNFMLM,NO-bHFLHGI K29?MONNOILK"MLKNPO%@OON"KNHG:IMLLN/, <  G#v#p*pc/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/dfa/onepass.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18c/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/dfa/onepass.rs m8K{H5u4B;2J DM>.HHIIM"O(LOOO)MNNNN3 % $97G?P;I5!#+ '9)NKM8GM0POMLPN>NN=& JLMM#MPNMO5%JM B  D1O!BF7BJK7,3 D2 LN)NMPFOGPKIMNMLLGKKMN29' CDHL!IJK# B8B$M B O'7C3 II37'K1279#561$>/"J''1 5OD$6N(&#J!(L LJ"3#6O9B3 HMNP= HKIG KJNMPM%@LB5 <9OL-& BAK-JK) IJMOPLMJINLOPPOL& N$NOMK&KMKKK(!JNNNN&%>INO)**4'H+8B6MOKP/&' NKJOPNM3K)$DMLP;(&)JL (;6 LKON;4H5JINOD@ O 63 F1B 3NNL>@7-&: OMNNMDA5IIM"IMNMJ*9@,BK=AO;4P>CKC>=E::E4GJKML(%!L+EP:/"?LK4*AO -LNLON+7$5<9JOMOMLKLOP8 )(L@MKIMPB#563'F9/BH 'CPN0HKKM&"I6' >FLONK=-A-5. ML#MJLPL 'L*9GK @&NNLJLNJOP$'LMON/:%( M7.-.MN40C6HNOMNLL5B'E6B PJNO0EA6I NP-PP"KPOH  '1> -K HOILN?+ONOOL<MMNKPMNMOM-JPOI$IKKNPOLNJ5LLIHMPNNJ7PFOPOMMGPKJN LOONNFPMO">:HKC?JJ/HLO69O>%GAO4$</2(NPOO8IICMLKOJ2L>P6CNN.OLOMEO OOMIPPOMKJOOKK-  O/M$ 8,O>C3 ;&N= 88O6B6B3 P,LM JF   J@....@K*O3103 ?+< 8(,.-16463 71+@ /',.1,4,3 60+2N9NPOOJ0 C A!+-6KB3  DE*I B  7;+O53603 "L/NFIN#05)EFD*N&MK B8$$//,(O MN> O%(P 3 31*3$EJ)%ANO'+KHM1BMMNJLNLILIL HJKM.*OOP1JKMPO!NLLPKMNO%OLNL4NO$9JIA* 37 N>HKKNJNKLIM(HFF-L L  /,+953 0NL 8"+I3 JN# L 1+H3 -5:/ IOBPILIM(HFF-L LILLP+PMKHK% 8)+-ELOM%+-@3 )&:/ /*L1/? 13/N>@3JKO)LIM(HFF-L LF >N&I OAC?M3 -&:/ 7JKO)4KPKNMM(HFF-L+MKJNONNN/>L? B  D1O!BF7BJK7,3 5L@ BI@P-O$JKNJ3I70PMKHN703 "JJKJOL KL5PKP;HEPPKM(HFF-LFO. M" +?IL!#H3PN6'A?3 +1PC :MMP2D%  +1M KMJLMJKILNO MNN NJMLNPKOPMLP: 8 KLMNNOOH KLIKOK81F, 0- ' KNL6)("8 8+@LF:A& N/ D)-*M,B(1D** @ + IK9KKM9+-11*(<""  1KJGN9$4 LOO(4HDDDEF;6C/P "  O!L"M6M8K NOKLNENNP!A77#LK77)KMPNPL-M6/; <P,B7C9P7HN)>M P OO&)KOL$ J AOPG33$- H(G'..>@ (2  G$*!,8-&"(*)-*()()2= '+,5"6""2$-4 :B2$ >BN "B'1&97NF4%>03E =*2 O POJLIOBMLLKN;.LKK 2CIPK$PG)M'O  B8$$//,(O MN> O%(P 3 (O=4@K:*PA;;46POPM:&#@@H0OOL>2N DOLAGG#:C$LKNC ? 4/J9%1'G# 6 )2 OONMOMPN%%IL,6D64N9$-6 N- BF/?6; OOL6M<1?1NA@= ;$:LC8L ,G% /. )-!1 MNNNKO MMP4PL40 0LK .:*392 O CE8+D %G&. &!.  M&G"(9:NOKGMPILMOOOJOIMO$ 0,,-0,,.@ B!"BDNCMO"; '"5. "G"% 8M&*O=" .FK2HKPM O O+$"$$(&B6;73E5G4F9I7@(E%'( )K%7H/>(1>*0H3Q*;/ & ! 'L@+ !&G @+ &H I+OMOP" J)G(J2MLNOOJ! ))--..5.. //0 !+,. 207" ,32 ".ԫs nZ7vd/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/dfa/remapper.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18d/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/dfa/remapper.rs /A|iwG-qMM&KNNNOK9DNOPMPO!M0+"MP KLKO.ENPMJN;PN0;KO(NKO7JGL7LMIOON-:LM<9;O!MJ(! !MI;=GONNM LMLO LPPE'$5("?"* >CNLPLNLIP HN3-/&-5HOK6 B#'& %$ @2 @'  ?'! %GP @- @" B(}:>b/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/hybrid/dfa.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18b/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/hybrid/dfa.rs 8~vj?! "*6DI  5- 0H8K ,LONJKH/FPKJ0"ELNNPOOMNOP FIJJK.*J5LNM:P'OMJO,JP/>&(0-// M+M$ B-,/I 3 ;&N1M$ B9,.I 3 P,8 B(,.7+ 7. 3 71+< 7',LO3 60+4P>O! BN B!+OJ+.LM.5J3 HE*H" BP 7++B4:#3 ".EGH*N+M#OK)J!K BB%%-)A NN5 P&)B 3 3-JJL .'*3 F .(*3 H .C*3 )PJLKMMPKL*1/*3.EMNK&!HM% >NK.MPOKJ&*MLJKL  OJLJKOM&PJO;LHJ1H:L6 B*,.73 LOM&,.7. 3 +P 3 !D@,!HPL4J#O'4)>;#3 5L@ BKJE3,$NGNL4&* #PMKH&/ #3 1P?%; PMJLINMO PPNA=0 OIM&PJO;LHJ1H:L8RKJI   !=",.F KON!=,.7. 3 FIM?O8 ) !=,7+"<&>:4GKH?8 )## '3 G! ) !I,7+"<&>:4GKH?8 )#### '3 1P?%; A=0 OPLNMOHNNIICLPCM&PJO;LHJ1H:LIKKLONPNLOPP B2) !A/,34(; 1NKLN-4(; 13 '&"PB"-;!L KOHNNIICLPCM&PJO;LHJ1H:LFIM?O8 2) !A=*,7'3"M&. )### '3 G! 2) !AI*,7'3"M&. ?:,##### '3 '&"PB"-;!L KJO8L>NLMKINM&PJO;LHJ1H:LLN B* K !A$,*=M,M#3 *!"3H 4K:  MCKO&$IHBPLPKNIN3JBKMK3 7),)L*// /7 P>4!3 +::' .?M9ONKNPKPKKLNMLNONM NF$CC@NKLL0NM(L3JBKMKK 7),)L*// /$!F(MML(,$37)NJMF&*@ P>4!3  -:;MPONKNPKPKKLNMLNONM :K$CC@NKLL0NM(L3JBOOPN1-:;+MCKO&LPKPPOPPNN$IHBPLPKN N3JBKMPE 7),)L*// /7 LOO+4!3 +18' '?I M7HOK=OL8GIFDNJ"MKIN9 +..5!M8) C$! BLLPPFMNON9 +?CL+#$E/:7 LLPPFMNON9 +?CJ+*/:7 GF<MNL'ILL.PMOOLNHLOO BB!A6,*L*// /7 4!7MIII3 G CMHLKH&I:JJKJLOKN5%$ ""(1KNLLPO;MHLJL.NPMOM*MPMKKLKONOOOMN2MLNMDLN$MMN@.ONKJMLNMNMK;N3N(1L,P@IL& 3OK(% "##+D"=-# J6KO&M#OK)J!K BB%%-)A NN5 P)B 3 )+AO#FHCH0J0, @ILON1NDN1L(M HFNML.LO*KJ)@K:*968G#&)K;&*0L"7JGO0=L+#!! NJ8OA?BJLAP1+MKL'9&'# H4BP "+*6) 4%#H MLJNLMM: PN;& @- NK52J1M69N; +,CB(JL>@& 2*3PP;9=9N;"+K0 " )& )#* 6%!& N/ P0OMD9N;"4+"< IM-" @)GII 9N;4+8% MMO3 N+!N GMMIMML3/I ?/3!9N;EC)GIB :KFMJ!INLN=O'>'E5O=$OMOE" BJC2+) I>HB?G74'+!5B I>KBAG74'+!5E:H:0#E IONO' 5IPF$$/INLN=O' "##)+%'>* ;# ?NP@ONMONOL4-)+8OJ(&PM?I@ MPJPMCPAA PO+"NMNPL' HHJMNIPP866PP244GHDKKHFOKPOP97I+NM0@CI"KK2@9L;1 99 NHK'J'I2-,%)9(IB@*H 'GO(J3;3& CP7@$3 KL@FK9+,%)9(JL>/#6" %CD=C"MJPONO25P?*A2<'LLNE<'MLNE;M/2)CH;/JC$ *PM/LK$ *PO9( 96N.@>MMNA ON8.IKM&%M6A;=C MLJMPLP!6;&O 4KJL!KLNK!MNHOK#$+ )+#-64=)NKM8GK>JMPNHFM!&L$ B2) !A/,34(; 1NKLN-4(; 13 <ILI79OD  3 0"*%3A4422PNNNOMP'&P++3 =& FKLKMNHMLMFJNLM-( () M 5)+3*4 3 K () M 5)+3C4 3 C4+6 JLMN'MKLNOMOPMKLLLP0%NO 3 !DB,%I/*MOL&/5MLI:/)>M3 D2 L N'JIMLNMKKNJIPOOLLKKMN29' 6OOO0KOOKLKNJL!LNLABNNP%%ON * !B$,H*'4J#LHLO$&2I(PP,42:(942:(3 BJOO"0 +OMKOK8NMLLONN=NO2ABN!1MOPLKOF BC!8(,#MLB3&##3 ;JA6 $3 69 :NPL6HONLMIM2PNONN+GNNMLKOFKNOGMD C!D ,5OME"!3 HJ: C(,5OE#"3 D2 MPLJILLPLPMMMKF%LNO" BB&OM@05!N,N7K#3 >+ PPO)MLMMJMNN"%LNNK BB&OM@0L>!F,N7K#3 F4 LLNOPP8JJFIFDL'KMKM OJ+K: BSEIMPPOOO'%!KP5'9,<5M)+ OL*6M)+ O<6M)+ P25M)+ 3 O4 K!NOKMNJPOPN2MKLMLLPKNKLMIHKJLNEM2 ?0<H84P&86LO-*NN64ONO/9IMJK86>05D:8OMKC7OPNAA5PL<NLMONO-'%4A9:JJB&KOKP/&8NNNGM"$ FFMC'A82'!KPOP:6 M MLL/:5')3@%'11')3F)+5)+5')3 JMJ+NAON;KIOL/NJHKNMOMGO.JIJKKK87B!(31F/"F''1 1OD$2N(&#M(D"(!(OMPN  $J,= 7,4J#3 #LJM+*"KFFGP+,2 1'#  PGPMO-)>/PMOOJNJKMNMNONLLOPMK+# 52))5/-!@POOOM)ONLL2ILIM?OO8MD:PP8L/0  & O9GJHLONNL(PNOJ %!B=",42:(42:(BHHH]aݴ                                     æ Ŧ Ǧ ȼ         !%o6M d/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/meta/limited.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18d/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/meta/limited.rs R0B *OOMMLIOMOMPMNMMFJLNMLKOLKPNP;O; 4"'8-3&6" 9')9DGA=/ /O ! N?K +2LNPN=:;ALLQGNKNO;=JN G *#+-:&@" :4 @DGA=& &O ! N?K " )&65 F61 5#+*!3+:=<"> ):=5 F6' c9B 2b/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/meta/regex.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18b/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/meta/regex.rs dV r :Lab$ (3  $* )!.HO*+9=NDGIKPP JKAJI7?3 =(EP>P OON% 2$) OD",+1+/++-++5++0++,+.+ 3 @JLKOD<H! 6N= *JLL @0'3 $%.6P=,OP B)&KN"3 HE*.O- @"3 "L KNMMOM ).-)3 0LJ 2$K/=A3 JN# 9":<(3 3 OE 9*>?()=3 G11 )BIN 2+E3 L#MKP 1E-."??@3 -2IL 2+,D""#$ 3 2%4,N<NJOOO* 18,$%PD" 3 6#%+46KPOL ))'P;3  )$,IE$I#$)I?%*I;3 L2 )$ IB$I13 M )$I,3 KO )#I;C#I.3 OE1 )":$JN:N 3 OI )$ IB3 P. )% IJ523 .9LLKLP2 B).' @<3  )$,M?$M#$)M<%*M9$M*$M)$M!3 /48 L)M% 9. > E3 ?-2  )?MLJLM+ L MPMNNMP/OPMNOMOMOO =. > J3 H-2  )DIMKPM%+M) / I-!HPL3>0O'3)>/03 5L@ B9/-$JKNJ31/0PMKH6/03 L >MKPPLIL5PKP;HOKPKFO. B=$ *IL!#73PN6'A?3 +-2  )LIKJILP6NLMKINLNNJ BIK "C$*<;,M#3 &!0 )CIO0 C%)OLNMJM 9.+ > *0 3 -2  ,H%)OLNMJM =.+ > *5 3 -2  1L%)OLNMJM+M) / IO!HPL3O0O'3)>@03 5L@ B9/O$JKNJ31@0PMKH6@03 ! JI%)OLNMJMFO. B=$ +*IL!#H3PN6'A?3 +-2  9L/OLNMJM) BIK "C$+*4BLLJMMEF80F8>=OM3B6#<*-?<;3 01F NO,: 93+C*0 3 *&<LJON3 ).)0)5)3 )$6HDI )< "$(.&&%%3 %K7 )B *.6;,,/03 *%0JNO5JOPGJ3 B)C (*.4))(+3 %LN8 B)I 044BLLJMMEF80F8>=OM3B6#<*-?<;3 -$EC7*MOKINOLMONHPO*LKNNMNJMN )>&&E%'3 +(RNMLLNNDNNK*&)0N!< .!"O0DIK3 !2 :G-7;01E0LL!K9HNJP79<%CHPI9:%A@PNJLCA*JKNIKLIOMOG99MM B .0-  M*>"$ - KJML( KLB&(1 2P,OCG!#>'COA20*C=LKO)6I!#; BO L ,OCK%'>'COA24-GN%9!  >I!#; FC9,OCC!COA2*)#C%;G=% <FO&,OCDCOA2+) ' B$6I4 4=LAF?NLNON LMMKNKGE?NLN!5/'?&,/%.=0.8 7JN6&O)N-O B9&&,(< MN7 O(= 3 *'@K:*-0.-095AK;(OH>%"GJ/!MNHOK#$++/*+, !"9/; =@C<-D?@>"C$D:?.I3 92N,ONO&% 2"=G"" ":=0"""" 1 31@KJJ=% B2">#.?1 7.BJKML*KJLMJJ9 B( C$"=#.?3 GINO) B( C$"=#.:(3 ?*K!NK8NHOPOIPMPHOILOOO$ 81-%??1 KOONPB * "P(-%?-1 2LJ * "L(#(<1 O4 O,L-KLPM B)&KN"KLNMNO&'4OLNO4N!3 B7=HLPLIMKJM; B)&N!3 F;<MMNLKMPL MLP<K=PPM B)&L!3 A>HL%LLKL4ONNP'LLGNPN6 B)&6'5C:(!3 B7M-MPPOP8 B)&'GIJ#($!3 C8LKL:LMJOPN< 2"< >3 53IFNO1K3ZG# @"3 77K'MON5<9P7GN;LKB/-ONL/OKB,*NIJJJHNNB0.O*PN;PNB20@ H0<N'H+(D$H/%<H845$H8:FH8<3(H3 F$4P><H! 6#6= *JLL @"''3 &%7MA$MI$6 #&G, 5=#< @ ,< (<MNN@LN+M0N@ 2, $(,& "$!>1 K)?IMHNLN+M<JJLP-EI 2, %(,& %(,& "4$;"# #1 0%*LLM22,NI B-OPMOMJ 2"=G"" ":=0"""" 1 B5 IVJ@ @"B@1 -))  J +(79śݟ$dfMk/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/meta/reverse_suffix.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18k/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/meta/reverse_suffix.rs Q{7y+XAA6EPDM.NCK.P>F@%NE>> JOOC"= NNOPIJ'# $'07HC% 'I #,,/(J%!& !0 &H $$  @ %48! , 90#L 2 K3AP# 444 < ?44/1 :A -1. #4 '3M3/J I3E>  A:B 6C@D >?;i, ZzGe4c/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/meta/stopat.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18c/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/meta/stopat.rs 㾓BN-aMn6EENNKPNPPMNOP @NLNLOPOOO%JKLKPMMOL&L%H'88(3 9')99*.-6F102B-/*/OOPNO8 2*#+8: :4 @9*.&*&OE%2MNNN / <580!),*:>09 -*:NJ:5  5#+*!),< A>&9 -L ANJ:+  rǼÞ0*e/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/meta/strategy.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18e/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/meta/strategy.rs x{zѶp8[@G_ (-' N#1/ )2.LK?OOPML6KOOB?)(%.&%MF+"!-NM3OLKMOOOO NN KOOEG >P 33EOOAH>5 NPF >PLPK ILH8H5 1=* N @LNNKJMIM.4% 24% 14% . *JKP8D*ON#PJIMP*LKO.!%3KM" HIMLM% NKN: LMHIOOG4 FK+. NN, NMMOP-@590 D$N 6=>>=<>B KFPMP"%1LEEKNLPMGLN9JNNDN>J NMNNG**=9)&B3B53= 1'& 9O 0<< 679P9G,9+,/1 // 9"!1, -   $,HB,0'(PLPMN7GJOOP);MPPPO$IHLKOLMLPPNH7OOMOK (A,/08*J>-*L-M, 99/K&9K9 * PMOMH@AJH@?!JI'G OKNG33+7*9)9&B0620= 9/*0,*'=&!D&G*&9NJB6P(>59P;>5- 9NL/P1C:9PDC:2 9G/>!1&C79>!D&C7/ 9+OPPPA9G0+& ONNKB OOLMJM+0C >$+!>FF A?B585 &7;0 9"!/A!N"!>9A!>#!> ; #F:1B> OMLMMON52B: LJF;B9 %9%5GIN3;5F!*?F!== ?KPNLO0$**9)9&!9/&'KN& &!9N03 @G6I 908 @G;NGKLN1@ 9G05 @G8! 9+0@ @GCFPP3.)".@D 9"!MOM@BG6@4 N+M@L5 MMIMMNO> JLONM&2@= LJF;@9 >@D 8E;DB"-DE" 7DE-" @?( ?@E+ (91)I$N!)4O%(A& 955L!*?L!=; 9$15EI"=?EI"P; "*(9)9&!9/&'&;9N03 92F/-M6$%E;C# P>"&G59,< 908 92K4-M;$OHOKMNMJ8%E;C# PC"&G56 9G05 92K8-M8! 9+0@ >G0+& H2OD-KK%, 85 '&><9"!B%F6?4 IMPOM?L5 NIKNOPO3 JLONM&2?= LJF;?9 >?D'AD. I*G'& 1! HK H#"2/(0$"G7" H5); ;,"D-,> P9-)%#N$0QS<OL!)6ONKLNF!%E;K%0M$30@(A, 9#<5K!1?K!D: 9$10DI"=:DI"+&: !*'9)9&269/&-' &!+)&9N03 32E/-D6& 908 32J4-I;G 9G05 32J8-I8! 9+0@ >G0+& ;2ND-MK% 85 &7<9"!BL ON&OPM5F1#4-2+M8;N (- 34,CO:52#@=845)#8  358:<(#4  5* 3( 7.2 .+09C: 1, 86  C2@ C2. :C. =H. D26  C33: :. 91  ;4  1? CN < &  ;4 ;4  A9C E2 ;?BJA>ECN :5597; 39 6@ G: :1  56  10 99 94  :2 4/ J: J74 1/. 9A >E E= 89:  5F :DGF(!5  BGBIK A@? 91  46  01 84  93 3< 5, 00 BH >= =C<]Tcr*mVye/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/meta/wrappers.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18e/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/meta/wrappers.rs -N D z1XEa O(NKNHLOM8HLKNOP9MN/ 9";? "%( &67900 ,28,&)( !9!;9 !+>9-!!L6*7<18C8H 2NC(9-'JNINOOK KO&B K?@ ,E/  @* .N!L3--,H*7 /  9-* LO#L / L9 9 -+* LO#O / L9 9** & / L9 +@/6* * / ( C*)( 1* < /  & ,!82@/8 9L'/<  18!2-N( .LLKOJMLM&?JJ83 ( L9 1!!&# (KL' ( L9 =(*#  (  9# H (  7#)2 1# < (  * " 49I'+185+ & *OM6HC,%!LJLO,P7<(NPMN4)9*% H!OK07$ +  91& ; + L9 9'5& 'I + L9 9.<& (E + L9 9'5& 'J + L9 9/1& (;' + L9 1!&& '>' + L9 1& N + L9 >,I>>&9(''1('# -MK+8,!0@-0K2445'1% H!.+ (  9/(1# 7>3 ( L9 &;(1# % ( # G# O ( # >#)2 1# < (  8)F89P'+18$=+$& *OM9PC/%!ONP PMKNJL7,!#60@-04-4'*% H!>#( +  9/1& ;' + L9 1& " + L9  31Ȃn/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/nfa/thompson/backtrack.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18n/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/nfa/thompson/backtrack.rs <7-ny 0NNKMMM# 3 CGANKMPNPI)O)EC?H0!$%2FKLKMNHMLM( :(% M/D)+3)- 3 K :() M/D)+3?;3 C =PMNKO%JGNJOLPLIM BJLNA31P/M223 C0 H841K2:1MLL:5L )NMNONBKN MLKMM>+37''53=79#5G8B/"P''1 =O2$>&27!<PP%2CDKB5 <9OK!-& BAL'K!K) O IMONPNLN#$HMKKNKKI<MPKN9FCE.'L%>O3'J<=!/'EONPL!OC'H;;;===!/ O7M$ : ;+-F 3 J5N= : G+L???AAA%3 $2;JL A J@....@K9O3<03 N:D : 6+7GJ3 F1.H J5+CF3 E0.CNJII+L0 B /;+ =??????%3 ?E*H BB /7;+O93;03 "+EJF.*L@N5FIJ80;NHM/F B: 33,,8 MND O,9 3 3@NN J5)3 M J6)3 O JQ)3 )9*3$KP0NON5 B: =8+4&0=NMI>JNLNA31P/M223 .OP*E>HNMDKJPN0LM:K J;+>:3 0LJ : 1+N3 JN# A /1+M3 1$1OPBD.LM:K : 8+-J3 --"/*P)"))$')$C 13/L% 6% 8% 7MKPLM:K : *3 O?"??@3 1"4MOM : 8+(8-""#$ 3 :&K45N<ONMOOO* : E+( ? PD  3 >*+49MKPL7LM:K+I1 :/ 1 O!HPL3F0O'3)>703 5L@ B: %&/+%A-+%@0MN$@*% 54-+(($&#A7 E77A"1< ,1A HI,>FCP ( ;+>GM!0! P#M,>FC*6, ?.AGQ#4%# LOLI"OPPK EMAJKKN 3CJ$BK&3;O M/F B: 33,,8 MND O,9 3 7 @K:*9*N/NMKNLL#!"/CLL: I&NKKKPMFLNHMN3LKKNNNJLNNNN)A<L*1AMJ<==5'< 4 K2!HJO@!"L--#&M)NP'D/O$5 PP-*K":($6" H O $NLP,NI)')/0,/!=@D#MLMJIGNN!JM"O?O*KNH:LH>7ON#7MIO& $ 9KMBNN)GPPM4NKJ9L/LP!##PEB! -!'9JNGM0"JN 8OINLKM2B+LO6/0K7;8=3.IL@0KKLL#&B:M?$%ILLLP,#&B9(#M?$%5/@6<46G11)DP(2"3 H# B$2 L*KPD1? 00K.0&"I:46 79 C?+,/-(&)&"I:46 79 C?+,/-(&)J%%NF>:IJ-+"A#ANANANANAN3  '-DK, N3B, PJJLLK9@P5N/+ M'JKFMLKNAOMLPI)JNNMMIF'-DK, K!NKNP:@"HKOM?P:HCA4:JO2E1K4!"4JONJMN<MPN("4"/4!&?25%A<%A:8& 5& N@NBNOJMKLMPNI?NLO)LMJGOPO#,@O%KKP27M"/BP (PGCM9?N5,LJ7"! 4L4NMKJ5*I;/-D  NM>LMKNNM ,7,75|8M~ͬ@:Hm/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/nfa/thompson/compiler.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18m/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/nfa/thompson/compiler.rs l+DM%7JW+'& #=  #*8!++'%B;KNG$5MNN<?AMNPPOLMNMNIJNKMKNKPPIPLPPFK*$N& 3 #O-+2BIL2BM#;2B2B2B2,3 1 IKMONNKP*@NP!%O% $1 -$5"4@ 3 4" ONO.E7MIJMMO-+L B0D&"D *3 F+ NNOOPLNN-HKPJ7LOD BAL#1)5%4P'H3 3! 8@LP!$MJK? - #I +163 H1% BMPHM6NKLLJMJ - #I +163 5 -+ /I +6;3 O4 HNJP4P 3% ,,#C&+>(1 ?- 3 >% ?P;:, C%"P(&M8,1'%PL)+J8:54DN4. 3   MLL:(1F.FPO .PN;9OC IM:HKNP>OO!<=CJMPOP@A"NJM80PP.$K$L2)A*'388A BOMOMMC K@H-+-3703 D$IN( K@B -+-3703 &#'30 (N PLPO3 KJ@....@K-+-3703 J*M'N( KJ:42:2222 @P-+-3703 0#C 0@H*3 C5 <9OMO @BGO*3 -( GKN7P,D %9 < +DJ?@OMMF21+AC M.E >+8425F<>N-A4%G@E1;NK9 LN1K+H HP;%+ L(). '8PLLPKN<"L?E .## #/I% 5HO@LLPO!J =&*% '&% '%)%*&$0, .GM5LOK1+1<8N7I :#0)%'K$+#FGMP P&LI+1 KKO !!&!&!&! KO* !!&!&!&! G''$!)**0'% &<MLGLI+JHK8N(%-.42EKKLNLDB*#!)-/'!)+3*&<*$!).0B7&$!)1*,@ MLI+O&',#*5<+/9PNNOO5L+%@$" @3MPP1NQPL!+NP0)D"M9(IHDD&+LOK>NHMLJOOPNI$=(P'5=C I"&MMN9?E$H0 OMKOOPNNO KNOPN= NOB L PONOM H B" ILI-MJDEJ,!+LKL17')!F'-.#+'1>""H4*/) 7JN#-)1-515A9E?;C?GCKG '/CKIN=IM#O./LIM#;$/M:#/DKPLNL2?2);9.M9! !'5H$ @94A<'(5 'P8-9.#"JK@ LHKKKNKLLMOPC+VE& P! ""0+A>$)4H )+7A,(0H$7.( $'4A 915%(=E$ 2O LAC.04:D3(?7/)#  3&%9/%$#"0A#;5#<&4!92#8@*$+% P&:2 %-J %"J#$!  :"JC  9"J#$!&  C"#:#$!?&  @"#:?(!  8 J"= #M /"9/D!F &3 )I  !0C C((!!? )!!?  #? $?  $O %< &O  $2 &!!? #> #> NOPB $"9##/,%"!!"!!"!!  &"9/%!!# 8:O@@PP) 9E#1'M;8 ;I#1'M; ".9#!#!#!# &. %".>#!!!# &. !".:M &.$ωI;t,q/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/nfa/thompson/literal_trie.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18q/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/nfa/thompson/literal_trie.rs 9p{ G3:NLJ PCLMOMOLP ONKKMNMNOO$IPJOMNP?MJ?MNLN*5OIO6MPPLHDLON7 NPJM!O-%7A-%6,JL$K&,P4 'KMM'7?)3IC4N6D3< <O+G KMKLPKOONL5( =439'%#9'%PNN"-#:ML1&8@F0(N3LK>#..IIMB5 ;&ML/D  <NK912OO?M$B("($1073 (G&BA GMOKNOPJ78!NLA4JMLMDLO('JPA,),,(EHKMPNKHLF$KLGLN)CPPLL"! O'MENOOOD 504K0 $LMP.-(/ <./#L,6"G6.5%%"&% OOL#3&,"5:8 2 4'G7!    /&!#))"#*' # /$%%))##"+P( #'UW'.h/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/nfa/thompson/nfa.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18h/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/nfa/thompson/nfa.rs >Ǐɀ8+w۔۔K" % 5/,M GPJ@H,INKO'NJJ!.O P2,C):CHKN'KMHONPL(KKJNMIPONNMKMONPLKOFLONJPMLKPPNPNLP@)')/5,/*F2>'"F'P=HH F"L-03 3 13OMOP B0,/3M3 '7JKM;L-L =?LPO%G#GP3 ->?JMPO A)$$KP"$PPMNO( H2"J%3 (IMMOMJLMKKM/ @5!9K,#=1#8O4&AKOLO$"7.'2N+71I623 59BNJP4EBG'P 3% ,,#C&+>(1 ?- 3 1MLNGLM&PNNLPO D""0MJ;;J*5>;3 ,IPM:OLMKJM<O D""7MJOP*9OOP;9;**5*'< %,74P NM5<0G+9K3*"ED') (( ;3! 9MIL!##.25)3+6=@/NNOO*J ,&*C NP=OOOOK=(% ?C2# ?(B95K 4(3J 4 NNHOMJOJIJNMO1 O88POOLKL1EDHNOOM! KGKL. NK/$JO"LLJ:K&NO,8NJO>IJKOK99PKK!KILOJMPLKO O7 % LML$ 0@ 3%!)+$ %%'O &3 '$#","(- B&$!($" FAD1= MKM1-4/J2,H4(F53(C&&I& ?.!+3,%$HH+,%%.-@ @MLMJ'<(DHK=K=MHKP) >DN@>+ -%  M) H NP N L$".+1// ?NMM IP.'M%DJJ =K=MJMI >DJD>8# J!P2-'0 CEI%7.%#*M5,/-6F%>@BKP?CK3/!?,5$I%" ! 03M'MMLN0(.* 7KM<MM ,7,7 E+-0@6. -../// D+-0@6. *++,,,c], әk/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/nfa/thompson/pikevm.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18k/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/nfa/thompson/pikevm.rs ?,JFE/ 3 CL JLPN LL7 @N /GJGHNN!J6O6I8!#$3)NKM8GMKJMPNHMK*=& FKLKMNHMLM( +(% M#8)+3M3 K +() M#8)+3?63 C ?0<H84MLL::5 JHKONBHOM+KMM/37''5/979#5;8A/"D''1 1OG$2&&7!0PP%KC8HB5 <9OM-& BAL'MK) JOM6-ON!MMK$ NOLLNI'KJMLJL"OLJHLLJO8L>@''F89!/O+M$ D/+)B 3 >)N= D;+H;;;===%3 $&/MKJ@ KJ@....@K-O3703 B.8 D*+-IL3 :1"< ;)+?B3 90"7N>II+L0 L#;+ 9;;;;;;%3 IE*H 3 #7;+O93603 "L4OFIO'0;.ELM"*N0M#P BD'',(4 MN8 O%(5 3 3JOH ;))3 K ;*)3 M ;E)3 )-*3$NHKKNJNK  ;/+953 0LJ D%+I3 JN# K#1+H3 -1<PPLILLP+PMKHK% D,+-ELOM(+-@3 )"/*E)'? 13/A683MKP CFO:"??@3 -0MO D,+(L""#$ 3 6#K42N<OJOOO* C9+($-PD" 3 :'+46MKPN%+N +/ JO!HPL3A0O'3)>203 5L@ BK0O$JKNJ3H0PMKH6203  EMKPPLJL5PKP;HFPPKFO. BO% +*IL!#C3PN6'A?3 +PB' GHNL7 KNJPC B' /+HKC;/ *DP67#ELMJ+P>!7 A1. /KJJLGHNLMKINLN B+* K #D$+* -NGFD!$ MIMKMKFHOMNK$"MC%NB1JOD4NMKNKO)<=';NON=LLLKMIONK KLIKKJKLMPINMOLONPONNCIOKN#,6MJOIOHK&LPNP:OO4NNOE6) . OJIKJJ!ONLPM KPMMK  7> -FD$ I02%04,%OJMON':) .KEK&NPP9(!!+8B M"(>K KJ9(!!!8PB O""ONMLML :,K PPDN$NKL9 ()!-%!"(-09@J11*C+O@J11*A)N@J11*A= NNKLKMAKG9(0!#& 1.I,12A LGGILIJMOPPM<NNLM9 (0!LMNKL7NG')&*'+P0MN$@*  54(+&76"($&#:7 ?>7FKNNOPPNJLMO!NHK-K%LK#5+F(; JP,2:CH%8*GJK1+! P%L ,2:CL)<-GNK1+!  I NLPFIO>MKML# 'CLLG')) GM#P BD'',(4 MN8 O(5 3 +@K:* 8''N/NMKNLL;33N PLOPIMNNKOLL&PMJM*KM>*($* P''6#K<&AIM;9LGOJOJ<LKOLNMNPPN%%NLM!JOM ' JJMJB I3%= MMLDMIJO%LM2: D'I(1D?C(L%A5D&'* !6H< 2N 7KPD-A9 N?MPJJNLNL0OO7 KJOK&?" 7!C.$!$ KK UI<"2(?L-PM:K7J7 LKMD ;,NMNP %,: -$/';PLJNCP>K OD?JJK;L"MMMJLM+MKMLMILKPOL!!KLL=,767600==77F0""""""KK#'!H- 3O:8 113M=%-$=$=$=$=#M#M$M$M#M#M N)AD709AD52I38*% ?;H7 ?'&!?0$")+" ) <6. 3?!!#!!; 55 8 113<<HHHHHHHHHHHH!7 !7 !7 !7 !7 !7 !7 !7 !7 !7 !7 !7 !7 !7 LDD 5i)e/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/alphabet.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18e/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/alphabet.rs 4?~!pI LK(MNKONPMJOLMJKPO:LIKFNNIPLPP+4KLHNKNNNCKG/FOK F!77I% KMO  6NOLLMM."!3MPKCI8+K( LI8'(& OI)%7 PJ;%/4 PM-2K" GN(D!G@2 ;OPMMOK(7O,#&96 6/#O$L#)0 ONPO :>0=: HP@%:6I JPL*)* L "! A1 61+6("M590 O' L?KO *NL.)EMMPPB%N(MKN@)#F..N;MLLOPON'M- H'*EJ $3 P9 H'*NJ $3 ;(33K# 1%=9& 8 # INOMHNOOHF H'*KI(3 C<KP1JO""(K!5(8&;A&19! -K9K*)7%97" GDK*5)==0 0/- DNMILJNMN'(- ;=K#.) 9<- %- I#$%!3172*&;(@,?39 6NL?MOM JLKIOKNPLO) #N$'HC=%# K60( MPG70#$7+ P6HH/&') M-!6%D0!9B6!:LF083(M?-69,IOP<6 JLN;NPP:) * F 7!7!NB A1)#G&7  $('3&  )--8&+!E$' %  -#*'''.***.))-*'''''''') -! < -###*/J(42JB JEJ  J(12J4J)46K4 11M4K4 ,/J)46K4 -###*D #E!F!J!NH%1-+#H #M-#M=#M=#M-#M #HN#M@#«t&_cQ=e/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/captures.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18e/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/captures.rs rcVS4rGZ2NKPL(MPMLF #MOJNJGGPP7KGIIPMLKDONMI+NGAP%K(O'XMO OLNPOP#?BK6;;</&J>?QK6EEF/NOPK#1JM>MLJO&MHMNIILN"OMOMK!OPC%MMP&MNJK +& L +I6"BI;MN3 4+EL6MNML+ +& L +M6"BP;;<3 8JOFEOMNN> +& =+K5">D,;">D,3 6:MFHL> +& *+K5"3 %EMMIFHP9 +& =+K3>IO,3 1KD8GOD D=O3B3 />OP*PLDILGINIJJMJJJPM BJFOAC?@H-:.?3 <#OO;OK1 ;7:OO*O,DILGINL BJFOACMMH<3 BHOJ.PM&@ BCGK OB"?!%$%& 3 MON BCGK O<"?!%$% 3 4HA2NKCO0MOB B;GK O<)3 ') )HMNOHL%NIH H%& )+2+++++23+2 ?95#3 -FN)M*K- H%FF +-@+?1@;0?1@;3 %G FN1M*K- H%FF +-@+?1%B80?1%B83 $9$(/F FN.M*K- H%FF +-A+@1?A0@1?A3 F FN6M*K- H%FF +-A+@1A>0@1A>3 #9$(8F DNPO#FO.KM ;D+-?1"<("!>0("3 (#1G-G %DNPI#FO.KM ;D+-@1"B)#" >6)#3 .%1G-G %OMK%NL&OMMKKPO!KAL B;FOA"(GL  P#(G  3 , 2KN II?P@ B;FOA"+(GL  J #,(GL  3 <NOLLOKFOAOMM)O +8 % O3>KN<!! ,3 4PJ@B@%G6)&K M5G00O*-- %D=4566 AJLI%=013/4:BGMM N MOKN J +LNHH4NEJHLOPLOOINNOKCNFLLKOIKPI =NFL$F'LO NKKLKE!K GL$!3' -':777729%IB;)CC/4KM-L$!3' BAAAADACCCCCCMLO99/!+ILNN'MKHIIJ%KKMFLL@BNAKMJ(FK 7(%7+ 1+)3 %K 7'+(3 $M  7N %)9LJMP2CL%2?%%%3 HNP #+.!## POB4>B'I(K&-IL;GO9GFH )022,+K*M 7'+-(3 "A8NI+FLMJOMM B=E#, ';KO,;J::3 JA9NL@OP8LMJL! B=E#*$ '3:3333:D33 PG3N"L.KEL =?LPO%G#GP3 O %/' OOCL9 =# +2+++ 94#3 L; A"JD=3 77 HM.P/LK, =/;; EP 3 "MO DMKLK, =/:: 3 N0 OMKE%OK26= BHMK 0C7&7'73 ):=L7 N+LED%5D"J>MPON+098-GMIPOI(*&CFHBG0AC )8>C"F6B!FEKJ9E0K DF;=EMJL$D7BN!A8; KE*@(:@KJ M%NL3H" MMND6H-MOJJJJ9EOLBEHK*-I<NNOE@NHGMMHJ0M BMOJ >OEF E2* ,E777<< -K)-L4B,'1J*'1&302!4-4)#$ 'y՝kXDz3 ah/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/interpolate.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18h/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/interpolate.rs bS3ءSn>OLMNHA OLGMO>OMNHNINKOPO7"NOL'!PMJ7MMON!F+!%  $0:$511 #I- 0C&#1 3."7$ O JIEMMON!F+/  *1:$*:1 #>- 08& 1 3."7$ (M>B-1"-%%$(K0AONO@"* 0IMOP5-*%' PJ>M653PLL;*%' L(@ 0+'B 5K /B 02**,700/"## .101/113335597!,%0%&:1 7!,$09&:1 (S;2:1          &  &  &  &  &  & JML$ & aaaabbbbbbcccccc}a$[$xdԴa/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/lazy.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18a/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/lazy.rs 'fs.„ =NF@KJP,PKJLNLMJL"#NKL&WLLFP095NK!0&#<HMK;LN0*8>;  -*LKKLNHM#NOQN G$KOP1MN&L1GEP;=$ 'IJM').(9IKL35'"#'P<5OJ% NO*'9PN# B?H %, MP5   ,,8E!KL ###4NMEONN%#!$KOP1GIK!EJ@;718 +HLO<)MMO5JNIP5[JN,:%%&'OOKNB(LNLLFNO!*?@88>NO!LJ).MJ)L-! NN'GO B E?#E/- %:LD< NKPMM#"MMMB  !!6< $$&)NGKPOGLGC (8)!D(JI% jX'7ɯa/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/look.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18a/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/look.rs 1~)'&Im<+ELG:OOIKJOLL5,IPN03MM4L5INOOJOKHJLNP-PHNO0OI$NOO$OIPLGL9NGL; POPLKPLOP JIPKP4"IJ5 OH4$ML+" O;KL*&&**..0<4@88<<@@DD MJNK(NJM8;9=;?=?EAGDBFDHFJH EN!NP) " $"$*)/)'-+/-1/ AHP/NFAMJPD7 5?MN$.&H J297$O 0(ML,GHM5?NLN1%*.,NP5/CNH71GKN)CP51)65397N3/'43175P'"PP415I!/#PP416H!/#O72O5&G41N2#N81N6'J*0GM*0+?PKP#5H46G>BE*0 $G% ". B3 )! O0J/**O P+/!((?"':$-;)/B"3EPMH?IKJ JFPJD.NMPMLIJMKI>L00MPMLIJMKI>9"84=9A=ANN)CLH(B&@*<(:,G*E P(MPMLIJMKI>3B9&NKM'. %, )1 '/ +3 )1 +3 1: -> 3E 09 .7 2D 0B 4> 2< 6I 4G O7"7*-A1--$ &#!%#'%),MMLK@JMO<2/O5>%!"!J!L(OHIO OD>BPD>?H D>DKOD>BEJ D>F$)*DH D>D"%&;J D>FJE"P D>M*L D>@C82<;&L&D>@C8#2LPKOIONPPO/ MNHPLP NLOLPLPH MK+!:9A-59A&O D>LJE#M D>JJE#K&D>@C8"2<;'I&D>@C8 2<;'M&D>%JK&D>OEO&D>@C8'2MMK.!:9AM&D>@C8%2MKK--59A"KNIMOJ) 36%F=77KED, GG5L?N;GMPJMHIEPMMJLCK"PLPOMPGONILL-LO&N.SSW NNOLLLLO== '#=K99I*=$1"9$%B!$%*& D9907 *=$1"9%B!$%*& DG '11K99E%J8N 4$%-+-%3& 899E%JCNLFE8N 4%-+-%3& 8N 'K991*3 996*3 9-8D4. OKO '<K991*3 996*3 9,E? 0),$&&#IJB/K4994994 4M  #")++*,+. ! )+,,-+-.. # )+*,-+. !)+,-.+-.. >%&+/)**+,,?--.//A11**,,--;//00...:2222222 #$+/)**+,,M8../00N@22**,,--;./00...:2222222 >,,+/)++,--?../00A22*)++,,;..//P5...KO*222222RO+1 **+/)++,--M8--.//N@11*)++,,;/.//---:1111111 ))+/)*+,,-M8../00N@22**,,--;.//00...:2222222 ''+/)+*+-,M8../00N@22**,,--;/./00...:2222222 >+++/)*+,,-?-.//0A12**,,--;///00...:2222222 >))+/)+*+-,?.-.0/A21**,,--;///00...:2222222 .-+/)*+,,-M8--.//N@11*),+,,;././/---:1111111 ,++/)+*+-,M8--.//N@11*),+,,;/..//---:1111111 >0/+/)*+,,-?-.//0A12*),+,,;//.//...:2222221 >.-+/)+*+-,?.-.0/A21*),+,,;//.//...:2222221 (+)-+17/5#*#+!(!)%,%-#*#+'.'/%,%-)0)1/6/7'.'/-4-5,3,4*1*2.5.6,3,40708.5.6292:0708 $+#,N+:+B+E+ < ;AVVWWXXYYՋ͏̑БЕۖėȗژޘ™ޞءܡݥɩͩׯֱڱԵλһʀ΀ǂdžˌ֍ÎՏُɖȞàǠ֡ڡզާʩΩȭԮǰ˰ڱޱƴǸžпi䜊+ >Z"a/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/pool.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18a/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/pool.rs "7I>!XUD#ӾӾ ILPOMMMKN;?>>?N?O0MOKM$KGLPNPOLLNLKMOPOIPKA<=ALEKPPHINJMLNKONIKNNNM>LKM OOOHLLOCO0NL,PNMN4#LKL&WIFM5'(;&70KII!*?I!PNMOMOJHIE@ I!MOJ@J )@OD*+ %  )DKL2LHM+JLJN/ ?G6KK(M6<OO/,'KN(DG; ,/,*7M#7KM )NLL!'POMNJKHN )P>KPLPNNOKNLOPNLNNP%LNEHNNOOMLOLJKM1GJKGOKNLN,K -GL-MLILIEHJIKE3#+)32<./;7C@MH?FIA H@ C DKELH"F//G+3)@'A;(I:DF<@NG2EP#-<-I+G ?5?ONOP/ %. GKONOP/ )2 A5CJKKLG %0 CJJ0"$0-"BP=HMP@<B NHNN=@,(HPMIPLKJNP,+HKG)+NJ!ID C"+ 4DOMNN"'NP+J&&271 2.P :F OPBO-K%)?:)"POML6LPB'IOL>%'<2B <NJA1%/JA6NKN>NM?'3)M INP7A(%&H G-KNA>4'6.HKM0N26LNN+ %JJ4>!2%>IO>>2%4,FIM0J04JNL) %JHMLN>%03@JHMLN>%03@MMKH>.5,MMKH>.5,NNKH>/6.N;N"5.HN;N"5.HO<0JNM+"$$> O!>'BJ!>'BJ!>'"D"BOK=*=N EP*EP*FL,!+4+4-5+4+4-5%  !>:8 ")< %@ 3@ ''(((((((58}8l.ghn/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/determinize/state.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18n/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/determinize/state.rs 6 7̵®qM MMMMNJL<KPPPLKIBIONOKJHLMOL9JHNLO8LHNJOMBNNIMMPIE7KMJMOONNMHNPOKO<LN-"&K PG7$IPPN5, "G<O $F,0#0#0 0 . D)G(!M.G*1!4KLJ9.O/)B@$->J)00GJO:3K0+0+0)!-+D2!,EKPM3$ ,GFO-&580 !-+!-+> @-!, ENN1PNPNONOMLN LNNK"OMJJOKI6EPKPILKKGFPO;OLML!!LNKG=(!PPMP=LMKP%!NLN/%!PPN0LO%)N9JKL+%)EH#,' HNB9%7KA M6< &;DF KOL:%  ?!,-KKH F@=!1 $IPH6 N-,2 OFAIMM8-% J+A)G):19933C.IONI8%)L6!FNMJH(JHJ:%APP%P% N9% G,K<N@K<L+8K39NONPO NHF,(%J.H(KFKJM(%H% )GPIK,O, '/G0M1G:MH/G2%@! :I.#JI.%) MLML-I2-KI.NP-9 4 2*C)  M<.L )""7 M<0A --"; < !<.0A -& )"'@'<1 4"'2+ 4"'2+ =;"$ C;"$ I\{U-?Ćxc/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/memchr.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18c/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/memchr.rs /ЁҼ36T9X]NLD+9E%9N*9.9F&9O+9/09E/9N:9E9F09O;9FtWy Z*dc/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/search.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18c/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/search.rs w ԋKGNO %CHOLJPN?9N7F/;6LNIHKJK9H<G-H5I?OG)I=PPOL*AJ>DJANLLJO-N 'H9CO$KMNML(BHRMR@*:$ &OMNCAI11IM5KPL- B+ 2*+-C!9*2,IIK 12BKI.52,3 NLOOLMOLOL,A ;PMN2HJGJ&P8 #*-7- K *BMOO,;ONLKIMMNIMLMNMOLMO+LJNN(JAIJ +$ &OL2M%,%OM2PLB%OM2HM,%OL2MO2303 =! 8PNNNJO%MLMMMMK0%K K-+-B,2BDC;2B3 8 4ICA"M5 #.-- 9 ,;;! DJPMNJGJ&O8 #.- - CLIJP0&M># ,>&7 ,LL/OK #.-- 0:JJ/MK #.-- ,8)G  :.8&4B 5IG  #.("' 0H #*1 )2GIK7 #*&5& #0EM) #*$5$ !7OLA +*A %BOMA #*- . @K :.8&4B -F #*( )JO$ #.##" $4O;NJ #',--,- <3*G0 @'//>,;FKILKLOOO6,1/ &*L%)P!,JK4GP2D!G2',*8!&+#+4#*3(1;((9=PMM:HOPP3!M!EA&ELM>A4INK)#KL$<L:JIO8L:3# 9GA"&J. 04/"! F&? EGA"HMGJ. #'/"! C34IKP),A#*?!+C5)!;L%*P!MI9%1##'!!B%':MONIKOMKJLLHJ&IM-PNOML,0*8 D =/ P5<O=POE$7BO=PO$/// +   NJJN;;L5?7 ! N%NN$OONMM4$&E!KMP8&FM/=DOE#44G?0' BPA <+.9NLPN> 463>NLPN> ,PPO9IN  LJMMJH/;H0IKPMKP=HHLM>'+! '(2G?8GH592KHJDIJL. 92M 9I/-N0EJ&E ONPN* 3..C (>NN 323&A 11 <KE;LOPOP(LHMK;LLKJ&'! 'H//MOK NNKNMOHPMMEJOPN6P6'@*'C81/PJN.%LLON.=*'/) H* /6% PMJILLMLHLJNLP= IMKKPNILOOPP NJJMIIO PNKMPOLOh+*PL0'A36J"5" 5 '  :,MP;='9?L>=)2;O9=29AOK=6@F-O!'H N<LJ"JN LBLJNMF@JBKLM%n lNMPP9))G=F!3B9BMLLN2.I0$  OPOLN;NM& 9*. G?( !?K( !?K !+#(+ 3&8dQѧ{zV(.m/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/unicode_data/mod.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18m/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/unicode_data/mod.rs +Q0 H9J F' L(IGLK"3;:(BdGِd/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/hybrid/error.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18d/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/hybrid/error.rs !"'[o!v%AAHHNMO'K2HDPH$O $@;F6/P 2G JJEK,>(E7 )KGNF4I6G I?>:;OIA&HOKK) 6N# *L$99"1"G1(E8 )K0L1L/6I;EH;G..;E4$ BIOJM7=<;fcO :3))KD207Y*ja/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/hybrid/id.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18a/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/hybrid/id.rs .'frr<PJKIM HI=>O PO LPK HCFEI]BMMPOL GLM&LMALNLN ?CB9#&1LKHK/# #KGJE5+7!$6:*+*GHD./8LNN?J. LB(@.2  MIH/$(1I-"EGM-&(1I-"IL*7(1I-!O-!P-!/ GJ(=>>???$PL#88 +L&I!7J:NN'65O<=L;$C 8$@ 8$@ J9$A O9$A AM8,5KNO-BNKM*?NJNLN6*?KKL,+@K+@EJ J'%F,//GJ  9X֋1d/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/hybrid/regex.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18d/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/hybrid/regex.rs lpCBG_LLMN1KL"5  AMNKIHKL KNLMPNPPPGKI>J3$'(IH>/>/EGMNONMOO; O(M$ ;.+)6 3 =(N= ;:+H;;;===%3 $%.HE*H BF "7;++931#3 "-EJL!*N.M"OP#O B;&&,(( MN7 O%() 3 388P KNPPNM&PJO;LHJ1H:L P 2.+953 -MNL)M&PJO;LHJ1H:L P ;++)3 LNP'+L3 )7MOM&PJO;LHJ1H:L NN:P6 ;++(L""#$ 3 6#4,K< L)?FNKI$M&PJO;LHJ1H:L-IH% PPPC+', IMPI%'- LLLMJKLND LLMILJ/%1IB 7JL57%D: K IJ0$IJ0$D B2D)3 )P%KPJ,8C7G%8*C8EKNLLPO?NLN! 2JN6&55#O)M"OP#O B;&&,(( MN7 O() 3 ***1/1/9O*79O*7K;'EK/M!K:*B5NPKMKHKN MLKHMMONMM>B37''5/-79#A/C(.OF$/&%6%41=$3NHNO H6&EOLI:N1 . +!A=#=+=3 I#<9O-! B5K-K# JPNA$ ADf ȻhRb/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/meta/error.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18b/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/meta/error.rs agCC7?GHMGEILO+M NDNGL9$O OL& 6N= 1= NOJ/0> O!AA G2AG2AF6(EA7 )K4FG :HKL8NMOPK"J $))K:5 '.5MPN%+1 22KF06#ONLIGHLP=#A"--KE+1+24HFKIN4EN m&W0ːܿAyj/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/meta/reverse_inner.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18j/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/meta/reverse_inner.rs  F^3ggJHMMONNOMKALPMMKP3NP7LJNH BPFM9T$$ :J>9 IHJJ8B$ @# ! DEHM= EO!EHFFAK#1?NPG'AE5 5$O5 NL#"C""MKLN5 B-B5MMNND-@)-,*!()'* GF ;ONN@KM32/ IMOONCO-2 H%?MI7IOKLLC3 !" %6C+NLON.L25OPMLNNPN9& K(J86PL2H*F %A WhǞJXOYT_j/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/nfa/thompson/error.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18j/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/nfa/thompson/error.rs +dRH% 66&JK2HJPMJKJ OMH5!PKL@(OL&*HC1OM/L,MM).HK)LOJ/0H (C9J;L7B&N@$LDIDK9A(E':< )K'K-7)@H:6F<6COE:.';F! \ Ta_1 PBh/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/nfa/thompson/map.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18h/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/nfa/thompson/map.rs ܐRԐ<; 1NLMP%+ O JMM LKMNF8O/P=0!KL7G?M$MIHE3<J8!H9#L /7+V*09<:1NLO%+  JMM PKrd04'(vc/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/escape.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18c/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/escape.rs ˴ a7id(PFT6GMNM=MN&GIN% N#L'2 F>NJ%,2GL 7$1)-+B "<,9 sp.xՍNNca/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/iter.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18a/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/iter.rs Yl*3WgtNLKNM/K9%@LMK*;LKPLK9IIO3KOPOJM%C7NK)NPPLHMJNOONKNPOKK#AOMOMOKIK:JKJLNPLCM KNGM:'KMLHK>'5()'<31 LB/@FNP,#@LPL%31;IN52O&JPNO> " ;+D+5Q#5Q#5Q#Q#3 P " #+(+4Q#4Q#4Q#Q#3 F G. OD+4'5! M%#5'5! #5'5! #'5! #3 = C) 7H L&P / G1% 5M) *0OK+ C1% BH) '-O5LHJF$ " ;+DK1 9)9)9))3 &# G0O0LHFF "" =+DF- 8)9)9))3 J C,O:LHGHONKKKJ?OM +" @ K;**643D-4E,3C*&3 " G3KLKO // GNKIG OKKJKOMPP1MJIOPILLNI *+ CJMN(E:7KOF'(7ON38;HL=23C/B?=K-#+PM (E:7KOI5>%;HL=20C. :9K)#+KP(E:7KOD16!;HL=2,?* 7H IM(E:7KOB$%7ON350C.AK#(%-( :K*#'+LL (E:7KOJ-8-C- ;H lg`GJs/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/prefilter/aho_corasick.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18s/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/prefilter/aho_corasick.rs 'M=00 94#'=  8 LIMMKMMNL(-?;NPMN543=>%+;LOKJHL5MOKJO!"!$N!% "%B=  8 OB D=  8 ;7-B &=  8 #  =  8 JOLON@LOLMLO( vpLU$5,n/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/prefilter/byteset.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18n/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/prefilter/byteset.rs cφ!W7v >('=  8 (+.'!4 %BN(! D,$B &  T /i~IVm\m/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/prefilter/memchr.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18m/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/prefilter/memchr.rs S;8AT# b%%'8  3 $01 %B8  3 >,%$ D,B &  #'8  3 $@--" %B8  3 G,%$ D,(B &  ''8  3 $@---& %B8  3 O,%$ D,7B &  T;ک{9]lm/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/prefilter/memmem.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18m/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/prefilter/memmem.rs :BVw9\JE-'N  I $.K$ %BN  I 8,>$ DN  I /4F &N  I '  N  I  1\Qa έz)V>l/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/prefilter/teddy.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18l/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/prefilter/teddy.rs ͞8ɉ;Cj669#OIJK#4.PNMPOLO!4)8PO<4 '=  8 CIN+IIMNGB?D<M=/!@+?" G %B=  8 I,B D=  8 4;7-"F>B &=  8 4K  =  8 MNOOJLNOJPO3LNLMMO" R[^ OGOj/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/prefilter/mod.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18j/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/prefilter/mod.rs SpűPTŒu5>MMPN@MNMKNLKOPML!KILI  (',)(1DDEMMPILLHJKIMO@OH:L'$D :'%9/K'$ D :':9/#NIHHLLOP4GMKN 2 #H5P$%@ NP$$@ 3 7!M; O,'  " :2332137)= NKMM 2 8M$*%@ 3 N2OKKPLO:KL( 2 )"! O$*%@ 3 -9PNMMP 2 0M$.%@ 3 F'  " * LOPMP= 2 0M$.65B 62 %B 3 H'  " , M*'  " $ 0,'  " MLMLLMJLM.MMO2$'  "  GKJPB?+$PNMALOPCM%M@5%9B&9D(9& 9 KPJMMON'KMMOK1KMPK7GJJMNMIO$GBDO'H! N GI#;N JMPLO8/. 90/ 90/ 8/. 7.- 90/ =53 I NOO NJM-P"MNG"32.> O &:  N MG"32.> O &:  N 5f?26eg/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/primitives.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18g/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/primitives.rs Q8ig3-sK N!LM%KJL KKLMPNLP@KMJMF..P4NJMLO 7>%=&9P6BN# %ON(G&,NKNAOMLKNMOKPKNMJGH%LNLNEJ1KONE PJMPP( G!J L@!( 9M=?F@"JF$J%FNNO=J!N.=J,LH(MM(O7(N;P<&M+M4/,+F 5M+OMCHP+// 2;$2/ 5;$'6#"E9I 8#"E.I 8#"E.> 8%"G0G - ,<?+C COJ'H%..GJ #"#/, *CDH, A#;D8 =H6KP">@O%HGM5L)@8H12 'N(4"L 0 L&0 K)0 =MN,."O3MDJJO3OOFBL3%I,I6  O0*OP 22( 5>, "52( "8>, "*/ &=E &=E &=E (?E /?2 E L K/*H-#  ++OI'&   1*)D,'"6 "2) PLKM ) =,1& J*=,M53! HLKLIO4M(*I;F"AOOKMEM&F PHONO;.9 )%5 )#ɣn{.w]dc/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/syntax.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18c/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/syntax.rs m%5U+A n?:;MMLJH  K9&4J/4,LL &'% H?/N2JK&"<A/J, #LK& &'C& =LDLMJPKMML4 M1@MKEIMKL1 FPN:LNIN5MNLLMNONOJ.8! 0MENPOFMKN-2 3(<16+@5"0%B.6+=2/%**1&8>#5)=3)7) p3=}f:b/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/empty.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18b/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/empty.rs =5:Y4O[$iiJ,LOLO@IOOMMMMPFLJLLNOOMMNOJJIMJ!QJJMMKMNBNPOANLPNPP-LBLINKNKNJ%MDLPL?KM5QQNLON4KKJRMDLNHOOMPL OPMNJOMJOCL/;O=PJNPHNNLL(.% #D=% #D>#DJHJJLJHJIFLIILHIKGKHPN&LHFLL?,< IK #2EIJD=)" %2#. /2j)xNcfV{`/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/int.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18`/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/int.rs CPΉ#vX 22LLPK M2IPMLJ$PPOLLLNM;OOKOO LLJG@ ! ! !! A &   !! A &   !!! A &  "! = &  ! ? &  ! ? &  ! ? &  LLOPNMMO, !XrCgW-`g/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/sparse_set.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18g/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/sparse_set.rs `xh \ˑ>>F!3*-MEIO&IOO>OMK  PK7,, B,K;(( %$9N1<;ML.FNP86I405MLK>9JNK6K @+K;,6 89*HO-4(7,M1L#DLO9; !A M!/ ! G9%A4%57J1M&G<=3ME*9,cgikoƴrdSTa/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/utf8.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18a/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/utf8.rs h}`i}O388"FO MNK5,*L$#' ' ' +HM99MN@5A$,F:06'HL395F%/G$&;L(K 5$.+...O,H5<KN5"KLIPI!:ON5/MMOM%IMN6HFJNLOLONM(5 2P/# d;pmDwfhꪺ[/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/lib.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18[/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/lib.rs Ԇ5J x[{IKJFOONL*M M)KJ PIL MLKMNJN ONGIOMI:KPJKAMJM1-MJ/H M/KNOOMN.844; 5$;;<<*A'+*ONM,63D"A''&*/#$+PN/,$D"H'"3*/0+!ONP-/ @8+9((!!0+NLFLNOMNP7KMLMLJM-LNMMPOKOLMPNK@JPDLMOLNOJON  N-CPMNK?N,IK ILNKMJMM&PPGMILM<I.%^QSDiNINNNKHMP iLNO<LIMNMKMOJMPNMMLMNHPML)KMN /BDOOKGNOLHHMO<*NJOKOKLMLJ&OLIHPKJHOPNPK*MNLONJMDFLJ8PPNOOFLKOLD J>0OI@HLOK MK]K-JL67pkD-LIGKJRHMQJLPNJN)GGMKOOOML)4NEM4J-=CK$ MN+ *JPPM O +IIPOLOPL@LN ,17.(PI-FKJFPKN!! I#',  = ! X1sxW!x^/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/macros.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18^/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/macros.rs *d- +N,$  33u{ϣZ :Xb/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/hybrid/mod.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18b/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/hybrid/mod.rs A Dzf .F//LMIOP6I IGO'A!J235#(H++OL+:3.#H+MIJKL%MLLJLK'>PIMMOKKLPKIJLKLEIOHJ PHNMIJJMMOKMMN8H1 ng&*Ke/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/hybrid/search.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18e/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/hybrid/search.rs {*PjI4 - 6-6 )OMOHKLPC"78 "89 5 -5J0 JP%"$=A !01$ !&F %>,ILKIPONONOO?PHIL GII=K>77BIH?::::LNL"OKLPINKMOKHINKNMPNMBMKKJMJKONNNLJMLJLPPP/MHLPOQJ%$%@C>@%@*>@%LKM")G0  LHN0-'@A&?00LIKM4#MNL55:AD,&."'@IKNNNK'9-$&) &)H1< 5& -. /5-0ONONLG&9""$=A  %>,IMKJHFN:JNPMNNJM$(@(=>@%@*>@%LKM")G0  '@JJC=-$&) &)H1< ! (5 $"6 )@ A5 "5J#&) @;-DNI#O8( NNO>"#@." -B=/,776=F("*'2@E/&/&/-01< 'GJKK'*& $"#4".&, @;-DNI#LMLO2LO6&I "@." '2@I/&/&/-01< ' 'GJKK'*( 5 '6M$ 5 '6M$ 5 !)N A>&9 -@ ANJ:+  5 !3+.=<"> M=5 F6' J4ILO)KLMMM6HPPLMLB5'#!D5* A4ͻ+QtJ`/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/meta/mod.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18`/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/meta/mod.rs oQO?Wua@DJ<$INJJL MLK6JLV:IKLO>BC?LNKLNP/ L 7 7  \ Νoߐ]d/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/meta/literal.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18d/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/meta/literal.rs jaAx ǩ(iQ>GKMPG$/F8KMH275F#086-,!&B:JJ LMOMNCMIONPLL 3WTi c/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/meta/prefix.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18c/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/meta/prefix.rs OLbդeAAMIFMH@J JFJIGN:F8" CO5MNOJH8NKMG3 LPOG< MIJL, 0:O L:G$ H?4O /.1*5/2 F3#> E&< '@ @N &7?7,A**+- ;,A**+- P HED 9#G748M1BA?>', JO@C PC+ NJt4U/ZC_/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/nfa/mod.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18_/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/nfa/mod.rs w nդ7LRNPDNPNKK=MLIJN0NLPNMM FN,PN0HKFLLPNHNS8!yt]wPqگqh/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/nfa/thompson/mod.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18h/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/nfa/thompson/mod.rs c.3cjmQGENOOEPT'HPO#?5FPLO L%GPLNO JFMPJOKN@LNMMNMN="    M * 5Iiʽq@`/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/mod.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18`/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/mod.rs B^9 cf09L KI LJ"LM$J;F LKPJ.L=7ˉ x]1l/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/determinize/mod.rsP/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18l/root/.cargo/registry/src/index.crates.io-1949cf8c6b5b557f/regex-automata-0.4.18/src/util/determinize/mod.rs *G3LJ@KFLN&JLEDM GNH7OKINJHILM-D  - LONNMAMM2MMOGKPO)LOO)NPOK(&IP IKM$B)KGKHJ(%OJPNO*'L/3A2A&'), 77 .3 ; 9"/2M ""03 :",/A".1 IOON@ ENN;)* 0!'" O4FN15LI!BLJLMO1KDLOD'24 (#*2$+47IDIIKHHDA&LKNJMOP&KLNOKN":=:.%$-+5@%-+3?%-+ HK.OLOPPMNMNMOL2"G( 5O ( .:MIMMN DI8LOOO/"+OLK4NE!#210(::3?3')NP0@A&; MONNPPOOLMP'JL##3202/242A*7MLOEOJOLHFEPLMOLKMMOJOMMMJMLBNMKLLNNM3//'33)KNNMOPMOPMPMLL1OJI;MJPO'2NH2OPP'2/JJJIJD2 FD.(5L!)' =& )/:< ), 4H0/G)/:< 404N4PEJ)/:< 0P0EJ)/:< )0JNON6)203>@ TQnczxBm1p1~1!1є1)11111111K1 110111u12 2 2~2%2)2.23242=2t?2A2{D2gI2K2IN2hP2R2T2Y2\2]2_2a2c2 h2zl2o2-r2xt2v2x2|2~222"2χ222T22x86_64-unknown-linux-gnu ~W!regex_automata-914a514b68fe71beÂIz]3 (ܲo -E-HHiʄʄ----------E-EEE -$---------,---,,-?(y-O--E--EO,+-&OLL=rust-end-file