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 2023 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 http import ( "fmt" "slices" "sort" "strings" "testing" ) func TestIndex(t *testing.T) { // Generate every kind of pattern up to some number of segments, // and compare conflicts found during indexing with those found // by exhaustive comparison. patterns := generatePatterns() var idx routingIndex for i, pat := range patterns { got := indexConflicts(pat, &idx) want := trueConflicts(pat, patterns[:i]) if !slices.Equal(got, want) { t.Fatalf("%q:\ngot %q\nwant %q", pat, got, want) } idx.addPattern(pat) } } func trueConflicts(pat *pattern, pats []*pattern) []string { var s []string for _, p := range pats { if pat.conflictsWith(p) { s = append(s, p.String()) } } sort.Strings(s) return s } func indexConflicts(pat *pattern, idx *routingIndex) []string { var s []string idx.possiblyConflictingPatterns(pat, func(p *pattern) error { if pat.conflictsWith(p) { s = append(s, p.String()) } return nil }) sort.Strings(s) return slices.Compact(s) } // generatePatterns generates all possible patterns using a representative // sample of parts. func generatePatterns() []*pattern { var pats []*pattern collect := func(s string) { // Replace duplicate wildcards with unique ones. var b strings.Builder wc := 0 for { i := strings.Index(s, "{x}") if i < 0 { b.WriteString(s) break } b.WriteString(s[:i]) fmt.Fprintf(&b, "{x%d}", wc) wc++ s = s[i+3:] } pat, err := parsePattern(b.String()) if err != nil { panic(err) } pats = append(pats, pat) } var ( methods = []string{"", "GET ", "HEAD ", "POST "} hosts = []string{"", "h1", "h2"} segs = []string{"/a", "/b", "/{x}"} finalSegs = []string{"/a", "/b", "/{f}", "/{m...}", "/{$}"} ) g := genConcat( genChoice(methods), genChoice(hosts), genStar(3, genChoice(segs)), genChoice(finalSegs)) g(collect) return pats } // A generator is a function that calls its argument with the strings that it // generates. type generator func(collect func(string)) // genConst generates a single constant string. func genConst(s string) generator { return func(collect func(string)) { collect(s) } } // genChoice generates all the strings in its argument. func genChoice(choices []string) generator { return func(collect func(string)) { for _, c := range choices { collect(c) } } } // genConcat2 generates the cross product of the strings of g1 concatenated // with those of g2. func genConcat2(g1, g2 generator) generator { return func(collect func(string)) { g1(func(s1 string) { g2(func(s2 string) { collect(s1 + s2) }) }) } } // genConcat generalizes genConcat2 to any number of generators. func genConcat(gs ...generator) generator { if len(gs) == 0 { return genConst("") } return genConcat2(gs[0], genConcat(gs[1:]...)) } // genRepeat generates strings of exactly n copies of g's strings. func genRepeat(n int, g generator) generator { if n == 0 { return genConst("") } return genConcat(g, genRepeat(n-1, g)) } // genStar (named after the Kleene star) generates 0, 1, 2, ..., max // copies of the strings of g. func genStar(max int, g generator) generator { return func(collect func(string)) { for i := 0; i <= max; i++ { genRepeat(i, g)(collect) } } } func BenchmarkMultiConflicts(b *testing.B) { // How fast is indexing if the corpus is all multis? const nMultis = 1000 var pats []*pattern for i := 0; i < nMultis; i++ { pats = append(pats, mustParsePattern(b, fmt.Sprintf("/a/b/{x}/d%d/", i))) } b.ResetTimer() for i := 0; i < b.N; i++ { var idx routingIndex for _, p := range pats { got := indexConflicts(p, &idx) if len(got) != 0 { b.Fatalf("got %d conflicts, want 0", len(got)) } idx.addPattern(p) } if i == 0 { // Confirm that all the multis ended up where they belong. if g, w := len(idx.multis), nMultis; g != w { b.Fatalf("got %d multis, want %d", g, w) } } } }