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
package memberlist import ( "math" "sync/atomic" "time" ) // suspicion manages the suspect timer for a node and provides an interface // to accelerate the timeout as we get more independent confirmations that // a node is suspect. type suspicion struct { // n is the number of independent confirmations we've seen. This must // be updated using atomic instructions to prevent contention with the // timer callback. n int32 // k is the number of independent confirmations we'd like to see in // order to drive the timer to its minimum value. k int32 // min is the minimum timer value. min time.Duration // max is the maximum timer value. max time.Duration // start captures the timestamp when we began the timer. This is used // so we can calculate durations to feed the timer during updates in // a way the achieves the overall time we'd like. start time.Time // timer is the underlying timer that implements the timeout. timer *time.Timer // f is the function to call when the timer expires. We hold on to this // because there are cases where we call it directly. timeoutFn func() // confirmations is a map of "from" nodes that have confirmed a given // node is suspect. This prevents double counting. confirmations map[string]struct{} } // newSuspicion returns a timer started with the max time, and that will drive // to the min time after seeing k or more confirmations. The from node will be // excluded from confirmations since we might get our own suspicion message // gossiped back to us. The minimum time will be used if no confirmations are // called for (k <= 0). func newSuspicion(from string, k int, min time.Duration, max time.Duration, fn func(int)) *suspicion { s := &suspicion{ k: int32(k), min: min, max: max, confirmations: make(map[string]struct{}), } // Exclude the from node from any confirmations. s.confirmations[from] = struct{}{} // Pass the number of confirmations into the timeout function for // easy telemetry. s.timeoutFn = func() { fn(int(atomic.LoadInt32(&s.n))) } // If there aren't any confirmations to be made then take the min // time from the start. timeout := max if k < 1 { timeout = min } s.timer = time.AfterFunc(timeout, s.timeoutFn) // Capture the start time right after starting the timer above so // we should always err on the side of a little longer timeout if // there's any preemption that separates this and the step above. s.start = time.Now() return s } // remainingSuspicionTime takes the state variables of the suspicion timer and // calculates the remaining time to wait before considering a node dead. The // return value can be negative, so be prepared to fire the timer immediately in // that case. func remainingSuspicionTime(n, k int32, elapsed time.Duration, min, max time.Duration) time.Duration { frac := math.Log(float64(n)+1.0) / math.Log(float64(k)+1.0) raw := max.Seconds() - frac*(max.Seconds()-min.Seconds()) timeout := time.Duration(math.Floor(1000.0*raw)) * time.Millisecond if timeout < min { timeout = min } // We have to take into account the amount of time that has passed so // far, so we get the right overall timeout. return timeout - elapsed } // Confirm registers that a possibly new peer has also determined the given // node is suspect. This returns true if this was new information, and false // if it was a duplicate confirmation, or if we've got enough confirmations to // hit the minimum. func (s *suspicion) Confirm(from string) bool { // If we've got enough confirmations then stop accepting them. if atomic.LoadInt32(&s.n) >= s.k { return false } // Only allow one confirmation from each possible peer. if _, ok := s.confirmations[from]; ok { return false } s.confirmations[from] = struct{}{} // Compute the new timeout given the current number of confirmations and // adjust the timer. If the timeout becomes negative *and* we can cleanly // stop the timer then we will call the timeout function directly from // here. n := atomic.AddInt32(&s.n, 1) elapsed := time.Since(s.start) remaining := remainingSuspicionTime(n, s.k, elapsed, s.min, s.max) if s.timer.Stop() { if remaining > 0 { s.timer.Reset(remaining) } else { go s.timeoutFn() } } return true }