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 2013 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 cover provides support for parsing coverage profiles // generated by "go test -coverprofile=cover.out". package cover // import "golang.org/x/tools/cover" import ( "bufio" "errors" "fmt" "io" "math" "os" "sort" "strconv" "strings" ) // Profile represents the profiling data for a specific file. type Profile struct { FileName string Mode string Blocks []ProfileBlock } // ProfileBlock represents a single block of profiling data. type ProfileBlock struct { StartLine, StartCol int EndLine, EndCol int NumStmt, Count int } type byFileName []*Profile func (p byFileName) Len() int { return len(p) } func (p byFileName) Less(i, j int) bool { return p[i].FileName < p[j].FileName } func (p byFileName) Swap(i, j int) { p[i], p[j] = p[j], p[i] } // ParseProfiles parses profile data in the specified file and returns a // Profile for each source file described therein. func ParseProfiles(fileName string) ([]*Profile, error) { pf, err := os.Open(fileName) if err != nil { return nil, err } defer pf.Close() return ParseProfilesFromReader(pf) } // ParseProfilesFromReader parses profile data from the Reader and // returns a Profile for each source file described therein. func ParseProfilesFromReader(rd io.Reader) ([]*Profile, error) { // First line is "mode: foo", where foo is "set", "count", or "atomic". // Rest of file is in the format // encoding/base64/base64.go:34.44,37.40 3 1 // where the fields are: name.go:line.column,line.column numberOfStatements count files := make(map[string]*Profile) s := bufio.NewScanner(rd) mode := "" for s.Scan() { line := s.Text() if mode == "" { const p = "mode: " if !strings.HasPrefix(line, p) || line == p { return nil, fmt.Errorf("bad mode line: %v", line) } mode = line[len(p):] continue } fn, b, err := parseLine(line) if err != nil { return nil, fmt.Errorf("line %q doesn't match expected format: %v", line, err) } p := files[fn] if p == nil { p = &Profile{ FileName: fn, Mode: mode, } files[fn] = p } p.Blocks = append(p.Blocks, b) } if err := s.Err(); err != nil { return nil, err } for _, p := range files { sort.Sort(blocksByStart(p.Blocks)) // Merge samples from the same location. j := 1 for i := 1; i < len(p.Blocks); i++ { b := p.Blocks[i] last := p.Blocks[j-1] if b.StartLine == last.StartLine && b.StartCol == last.StartCol && b.EndLine == last.EndLine && b.EndCol == last.EndCol { if b.NumStmt != last.NumStmt { return nil, fmt.Errorf("inconsistent NumStmt: changed from %d to %d", last.NumStmt, b.NumStmt) } if mode == "set" { p.Blocks[j-1].Count |= b.Count } else { p.Blocks[j-1].Count += b.Count } continue } p.Blocks[j] = b j++ } p.Blocks = p.Blocks[:j] } // Generate a sorted slice. profiles := make([]*Profile, 0, len(files)) for _, profile := range files { profiles = append(profiles, profile) } sort.Sort(byFileName(profiles)) return profiles, nil } // parseLine parses a line from a coverage file. // It is equivalent to the regex // ^(.+):([0-9]+)\.([0-9]+),([0-9]+)\.([0-9]+) ([0-9]+) ([0-9]+)$ // // However, it is much faster: https://golang.org/cl/179377 func parseLine(l string) (fileName string, block ProfileBlock, err error) { end := len(l) b := ProfileBlock{} b.Count, end, err = seekBack(l, ' ', end, "Count") if err != nil { return "", b, err } b.NumStmt, end, err = seekBack(l, ' ', end, "NumStmt") if err != nil { return "", b, err } b.EndCol, end, err = seekBack(l, '.', end, "EndCol") if err != nil { return "", b, err } b.EndLine, end, err = seekBack(l, ',', end, "EndLine") if err != nil { return "", b, err } b.StartCol, end, err = seekBack(l, '.', end, "StartCol") if err != nil { return "", b, err } b.StartLine, end, err = seekBack(l, ':', end, "StartLine") if err != nil { return "", b, err } fn := l[0:end] if fn == "" { return "", b, errors.New("a FileName cannot be blank") } return fn, b, nil } // seekBack searches backwards from end to find sep in l, then returns the // value between sep and end as an integer. // If seekBack fails, the returned error will reference what. func seekBack(l string, sep byte, end int, what string) (value int, nextSep int, err error) { // Since we're seeking backwards and we know only ASCII is legal for these values, // we can ignore the possibility of non-ASCII characters. for start := end - 1; start >= 0; start-- { if l[start] == sep { i, err := strconv.Atoi(l[start+1 : end]) if err != nil { return 0, 0, fmt.Errorf("couldn't parse %q: %v", what, err) } if i < 0 { return 0, 0, fmt.Errorf("negative values are not allowed for %s, found %d", what, i) } return i, start, nil } } return 0, 0, fmt.Errorf("couldn't find a %s before %s", string(sep), what) } type blocksByStart []ProfileBlock func (b blocksByStart) Len() int { return len(b) } func (b blocksByStart) Swap(i, j int) { b[i], b[j] = b[j], b[i] } func (b blocksByStart) Less(i, j int) bool { bi, bj := b[i], b[j] return bi.StartLine < bj.StartLine || bi.StartLine == bj.StartLine && bi.StartCol < bj.StartCol } // Boundary represents the position in a source file of the beginning or end of a // block as reported by the coverage profile. In HTML mode, it will correspond to // the opening or closing of a tag and will be used to colorize the source type Boundary struct { Offset int // Location as a byte offset in the source file. Start bool // Is this the start of a block? Count int // Event count from the cover profile. Norm float64 // Count normalized to [0..1]. Index int // Order in input file. } // Boundaries returns a Profile as a set of Boundary objects within the provided src. func (p *Profile) Boundaries(src []byte) (boundaries []Boundary) { // Find maximum count. max := 0 for _, b := range p.Blocks { if b.Count > max { max = b.Count } } // Divisor for normalization. divisor := math.Log(float64(max)) // boundary returns a Boundary, populating the Norm field with a normalized Count. index := 0 boundary := func(offset int, start bool, count int) Boundary { b := Boundary{Offset: offset, Start: start, Count: count, Index: index} index++ if !start || count == 0 { return b } if max <= 1 { b.Norm = 0.8 // Profile is in"set" mode; we want a heat map. Use cov8 in the CSS. } else if count > 0 { b.Norm = math.Log(float64(count)) / divisor } return b } line, col := 1, 2 // TODO: Why is this 2? for si, bi := 0, 0; si < len(src) && bi < len(p.Blocks); { b := p.Blocks[bi] if b.StartLine == line && b.StartCol == col { boundaries = append(boundaries, boundary(si, true, b.Count)) } if b.EndLine == line && b.EndCol == col || line > b.EndLine { boundaries = append(boundaries, boundary(si, false, 0)) bi++ continue // Don't advance through src; maybe the next block starts here. } if src[si] == '\n' { line++ col = 0 } col++ si++ } sort.Sort(boundariesByPos(boundaries)) return } type boundariesByPos []Boundary func (b boundariesByPos) Len() int { return len(b) } func (b boundariesByPos) Swap(i, j int) { b[i], b[j] = b[j], b[i] } func (b boundariesByPos) Less(i, j int) bool { if b[i].Offset == b[j].Offset { // Boundaries at the same offset should be ordered according to // their original position. return b[i].Index < b[j].Index } return b[i].Offset < b[j].Offset }