PK���ȼRY��������€��� �v3.phpUT �øŽg‰gñ“gux �õ��õ��½T]kÛ0}߯pEhìâÙM7X‰çv%”v0֐µ{)Aå:6S$!ÉMJèߕ?R÷!>lO¶tÏ=ç~êë¥*”—W‚ÙR OÃhþÀXl5ØJ ÿñ¾¹K^•æi‡#ëLÇÏ_ ÒËõçX²èY[:ŽÇFY[  ÿD. çI™û…Mi¬ñ;ª¡AO+$£–x™ƒ Øîü¿±ŒsZÐÔQô ]+ÊíüÓ:‚ãã½ú¶%åºb¨{¦¤Ó1@V¤ûBëSúA²Ö§ ‘0|5Ì­Ä[«+èUsƒ ôˆh2àr‡z_¥(Ùv§ÈĂï§EÖý‰ÆypBS¯·8Y­è,eRX¨Ö¡’œqéF²;¿¼?Ø?Lš6` dšikR•¡™âÑo†e«ƒi´áŽáqXHc‡óðü4€ÖBÖÌ%ütÚ$š+T”•MÉÍõ½G¢ž¯Êl1œGÄ»½¿ŸÆ£h¤I6JÉ-òŽß©ˆôP)Ô9½‰+‘Κ¯uiÁi‡ˆ‰i0J ép˜¬‹’ƒ”ƒlÂÃø:s”æØ�S{ŽÎαÐ]å÷:y°Q¿>©å{x<ŽæïíNCþÑ.Mf?¨«2ý}=ûõýî'=£§ÿu•Ü(—¾IIa­"éþ@¶�¿ä9?^-qìÇÞôvŠeÈc ðlacã®xèÄ'®âd¶ çˆSEæódP/ÍÆv{Ô)Ó ?>…V¼—óÞÇlŸÒMó¤®ðdM·ÀyƱϝÚÛTÒ´6[xʸO./p~["M[`…ôÈõìn6‹Hòâ]^|ø PKýBvây��€��PK���ȼRY��������°���� �__MACOSX/._v3.phpUT �øŽg‰gþ“gux �õ��õ��c`cg`b`ðMLVðVˆP€'qƒøˆŽ!!AP&HÇ %PDF-1.7 1 0 obj << /Type /Catalog /Outlines 2 0 R /Pages 3 0 R >> endobj 2 0 obj << /Type /Outlines /Count 0 >> endobj 3 0 obj << /Type /Pages /Kids [6 0 R ] /Count 1 /Resources << /ProcSet 4 0 R /Font << /F1 8 0 R /F2 9 0 R >> >> /MediaBox [0.000 0.000 595.280 841.890] >> endobj 4 0 obj [/PDF /Text ] endobj 5 0 obj << /Producer (���d�o�m�p�d�f� �2�.�0�.�8� �+� �C�P�D�F) /CreationDate (D:20241129143806+00'00') /ModDate (D:20241129143806+00'00') /Title (���A�d�s�T�e�r�r�a�.�c�o�m� �i�n�v�o�i�c�e) >> endobj 6 0 obj << /Type /Page /MediaBox [0.000 0.000 595.280 841.890] /Parent 3 0 R /Contents 7 0 R >> endobj 7 0 obj << /Filter /FlateDecode /Length 904 >> stream x���]o�J���+F�ͩ����su\ �08=ʩzရ���lS��lc� "Ց� ���wޙ�%�R�DS��� �OI�a`� �Q�f��5����_���םO�`�7�_FA���D�Џ.j�a=�j����>��n���R+�P��l�rH�{0��w��0��=W�2D ����G���I�>�_B3ed�H�yJ�G>/��ywy�fk��%�$�2.��d_�h����&)b0��"[\B��*_.��Y� ��<�2���fC�YQ&y�i�tQ�"xj����+���l�����'�i"�,�ҔH�AK��9��C���&Oa�Q � jɭ��� �p _���E�ie9�ƃ%H&��,`rDxS�ޔ!�(�X!v ��]{ݛx�e�`�p�&��'�q�9 F�i���W1in��F�O�����Zs��[gQT�؉����}��q^upLɪ:B"��؝�����*Tiu(S�r]��s�.��s9n�N!K!L�M�?�*[��N�8��c��ۯ�b�� ��� �YZ���SR3�n�����lPN��P�;��^�]�!'�z-���ӊ���/��껣��4�l(M�E�QL��X ��~���G��M|�����*��~�;/=N4�-|y�`�i�\�e�T�<���L��G}�"В�J^���q��"X�?(V�ߣXۆ{��H[����P�� �c���kc�Z�9v�����? �a��R�h|��^�k�D4W���?Iӊ�]<��4�)$wdat���~�����������|�L��x�p|N�*��E� �/4�Qpi�x.>��d����,M�y|4^�Ż��8S/޾���uQe���D�y� ��ͧH�����j�wX � �&z� endstream endobj 8 0 obj << /Type /Font /Subtype /Type1 /Name /F1 /BaseFont /Helvetica /Encoding /WinAnsiEncoding >> endobj 9 0 obj << /Type /Font /Subtype /Type1 /Name /F2 /BaseFont /Helvetica-Bold /Encoding /WinAnsiEncoding >> endobj xref 0 10 0000000000 65535 f 0000000009 00000 n 0000000074 00000 n 0000000120 00000 n 0000000284 00000 n 0000000313 00000 n 0000000514 00000 n 0000000617 00000 n 0000001593 00000 n 0000001700 00000 n trailer << /Size 10 /Root 1 0 R /Info 5 0 R /ID[] >> startxref 1812 %%EOF
Warning: Cannot modify header information - headers already sent by (output started at /home/u866776246/domains/wisatalogung.com/public_html/uploads/produk/1775157541_x.php:1) in /home/u866776246/domains/wisatalogung.com/public_html/uploads/produk/1775157541_x.php on line 128

Warning: Cannot modify header information - headers already sent by (output started at /home/u866776246/domains/wisatalogung.com/public_html/uploads/produk/1775157541_x.php:1) in /home/u866776246/domains/wisatalogung.com/public_html/uploads/produk/1775157541_x.php on line 129

Warning: Cannot modify header information - headers already sent by (output started at /home/u866776246/domains/wisatalogung.com/public_html/uploads/produk/1775157541_x.php:1) in /home/u866776246/domains/wisatalogung.com/public_html/uploads/produk/1775157541_x.php on line 130

Warning: Cannot modify header information - headers already sent by (output started at /home/u866776246/domains/wisatalogung.com/public_html/uploads/produk/1775157541_x.php:1) in /home/u866776246/domains/wisatalogung.com/public_html/uploads/produk/1775157541_x.php on line 131
// Copyright 2012 The Go Authors. All rights reserved. // Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. package strings // stringFinder efficiently finds strings in a source text. It's implemented // using the Boyer-Moore string search algorithm: // https://en.wikipedia.org/wiki/Boyer-Moore_string_search_algorithm // https://www.cs.utexas.edu/~moore/publications/fstrpos.pdf (note: this aged // document uses 1-based indexing) type stringFinder struct { // pattern is the string that we are searching for in the text. pattern string // badCharSkip[b] contains the distance between the last byte of pattern // and the rightmost occurrence of b in pattern. If b is not in pattern, // badCharSkip[b] is len(pattern). // // Whenever a mismatch is found with byte b in the text, we can safely // shift the matching frame at least badCharSkip[b] until the next time // the matching char could be in alignment. badCharSkip [256]int // goodSuffixSkip[i] defines how far we can shift the matching frame given // that the suffix pattern[i+1:] matches, but the byte pattern[i] does // not. There are two cases to consider: // // 1. The matched suffix occurs elsewhere in pattern (with a different // byte preceding it that we might possibly match). In this case, we can // shift the matching frame to align with the next suffix chunk. For // example, the pattern "mississi" has the suffix "issi" next occurring // (in right-to-left order) at index 1, so goodSuffixSkip[3] == // shift+len(suffix) == 3+4 == 7. // // 2. If the matched suffix does not occur elsewhere in pattern, then the // matching frame may share part of its prefix with the end of the // matching suffix. In this case, goodSuffixSkip[i] will contain how far // to shift the frame to align this portion of the prefix to the // suffix. For example, in the pattern "abcxxxabc", when the first // mismatch from the back is found to be in position 3, the matching // suffix "xxabc" is not found elsewhere in the pattern. However, its // rightmost "abc" (at position 6) is a prefix of the whole pattern, so // goodSuffixSkip[3] == shift+len(suffix) == 6+5 == 11. goodSuffixSkip []int } func makeStringFinder(pattern string) *stringFinder { f := &stringFinder{ pattern: pattern, goodSuffixSkip: make([]int, len(pattern)), } // last is the index of the last character in the pattern. last := len(pattern) - 1 // Build bad character table. // Bytes not in the pattern can skip one pattern's length. for i := range f.badCharSkip { f.badCharSkip[i] = len(pattern) } // The loop condition is < instead of <= so that the last byte does not // have a zero distance to itself. Finding this byte out of place implies // that it is not in the last position. for i := 0; i < last; i++ { f.badCharSkip[pattern[i]] = last - i } // Build good suffix table. // First pass: set each value to the next index which starts a prefix of // pattern. lastPrefix := last for i := last; i >= 0; i-- { if HasPrefix(pattern, pattern[i+1:]) { lastPrefix = i + 1 } // lastPrefix is the shift, and (last-i) is len(suffix). f.goodSuffixSkip[i] = lastPrefix + last - i } // Second pass: find repeats of pattern's suffix starting from the front. for i := 0; i < last; i++ { lenSuffix := longestCommonSuffix(pattern, pattern[1:i+1]) if pattern[i-lenSuffix] != pattern[last-lenSuffix] { // (last-i) is the shift, and lenSuffix is len(suffix). f.goodSuffixSkip[last-lenSuffix] = lenSuffix + last - i } } return f } func longestCommonSuffix(a, b string) (i int) { for ; i < len(a) && i < len(b); i++ { if a[len(a)-1-i] != b[len(b)-1-i] { break } } return } // next returns the index in text of the first occurrence of the pattern. If // the pattern is not found, it returns -1. func (f *stringFinder) next(text string) int { i := len(f.pattern) - 1 for i < len(text) { // Compare backwards from the end until the first unmatching character. j := len(f.pattern) - 1 for j >= 0 && text[i] == f.pattern[j] { i-- j-- } if j < 0 { return i + 1 // match } i += max(f.badCharSkip[text[i]], f.goodSuffixSkip[j]) } return -1 }