682 lines
265 KiB
Plaintext
682 lines
265 KiB
Plaintext
|
rust
|
|||
|
|
o #rustc 1.96.0 (ac68faa20 2026-05-25)ÁÀ뉊 ]!ÜÛê(¹Þ—šên -5be7b69c3ff7b5b8Á íàÄTËŸ ÜJîÄ)'ß\¥! -3d1337db07d0b3aeÁ ¤²XctÔ'ÐÓ©z¨É½Ó -a4945860e1c53b00Á ¤°ð ¾ä-±($²ï=©Ã -7e98a21bfd32b0edÁ–�òÖÀH•‘P IÓHã#£ -055f30b747f859b6Á rustc_std_workspace_coreÁCçß^ò½èÝ$Çÿ+Cé -c4878ee60b2242c9Á ŸÃï+Ñ]ŠqB<ÏïW# -8dd1dd90e70d0b6aÁ miniz_oxideÁ€š»J(P>àö÷g\K -1eb618da2918ab7fÁ adler2ÁÆ;+Þ®5¥ÌýÝ°¦ÛLˆ -f7919172d268e069Á hashbrownÁPäV9ÒÆèÜ�"ÊÖVŽ\ -0fc2184a5da6723aÁ rustc_std_workspace_allocÁs&ØòØy¯s•bæ!‰ýŠ -97e4bf30be240674Á
|
|||
|
|
std_detectÁhŠBîÙºÌI®Ë�Å�š -9dbbf8346ba7ac8bÁ rustc_demangleÁûë9´Ç×@Œ�’ùXFº -f33013f239bf9f14Á cfg_ifÁÜLh�ž§Œaã¯>� -0a71c8f33a838301Á addr2lineÁ׎Þ!]8V$É@@T· -e618e6be60e87ba2Á gimliÁ¸
|
|||
|
|
°µ~Î1‹Ñt ðÁ€w -1f7768a68858f670Á objectÁ
|
|||
|
|
áPÃ?À¶¼QHJ¥� -914cd6a4dbe590d1Á memchrÁ›º«8Ór2Ù $¨ûib‚ -cf21ca6f2bb15dcdÁë
|
|||
|
|
‹ás «LÖ€îâƒ×ɯŒ -ee6f3747e38367f0Á metricsÁç…ݽ¦ÞIéõ ]®TòÞ -91645d6613fbf64dÁ rapidhashÁn0Nµ®×arã»pL +é? -30449d4d163bb011Á rustversionÁTgÌüÁ é¨Cå@Ö'G -f0da710c68354185Á Ðû†l ôˆ/Æí_Ï̱ -7d7f68df13b21e9eÁ allocator_api2ÁÆÛŠfêxuìÌ@˜(}Ïu‘ -7b02f80e4eb85c1bÁ
|
|||
|
|
equivalentÁ˜úôa ,t ùƳJ8®ød -293c030140ba1879Á foldhashÁ¨%¹9ü'?ž˜ë‰4Î -307afae06628b423Á quantaÁbž®n__åýbn˜C% -9d4922eea7b84fb9Á crossbeam_utilsÁ\€v€*˜‚³aÑl®Ø{Í -580ebf62485b3066Á once_cellÁ6ÿ]�Ô¯q4c]kÂÓ‹ -a47cd60ec4e2e104Á –æ\‹±Ôcd�-»ùÀTƒ -f86f80b348d33b13Á crossbeam_epochÁ! ‹y1 âºjvK õðS -90c3f33e672820a4Á randÁ8#Cf[Ãä!�` O@. -5cebcdcbc836fca4Á rand_coreÁÌý¦î—W‹œ]TewÉ: -802030763b7da6caÁ getrandomÁ’ú§‰, iMjã¸íçG‡ -3af6da94d21ddbadÁ ®f©¾/ô)c§{õa“â‘ -a3906971a93fd1b8Á rand_chachaÁ£Ì�±«€�õ-÷}Í1 -181890ec389f91c4Á
|
|||
|
|
ppv_lite86Á<<rîd”Û Jøƒ¨x7qï -b7bc7268307ccbaaÁ zerocopyÁ{£F™8ù£´ÉÒ6ñ°i -37880aa70dfe9a6cÁ rand_xoshiroÁ
|
|||
|
|
|b½ð8C5˹‰°�å S -e2689500100a145dÁ sketches_ddsketchÁâ^ iK�ÒE!T@Y‚’Ï -8afef7c89e101d11Á debuggingÁLƒ »Ú¬® testsÁ,Œ‚ $�
|
|||
|
|
ù,§Ž‚ $œŽå
|
|||
|
|
BLOCK_SIZEÁT–û 16ÁÜòå§TØû 32ÁÜ´åù,–ˆ‚ $‹ˆ¦ù,µ‚ $ªéù,ß7‚ $Ô7—ù,•‚ $Š ù,Õ‚ $Ê°ù,�*‚ $’*ßù,•& ‚ $Š& Ó filterÁ4Å!
|
|||
|
|
» layer-filterÁĦ!
|
|||
|
|
Ó FilterÁ4ÿ!
|
|||
|
|
»ƒÄÓ!
|
|||
|
|
Ó FilterLayerÁ\‡"
|
|||
|
|
»ƒ"$œù,¼ ‚ $± Ó routerÁ4ï"
|
|||
|
|
» layer-routerÁÄÐ"
|
|||
|
|
Ó RouterÁ4©#
|
|||
|
|
»ýÄý"
|
|||
|
|
Ó
|
|||
|
|
RouterBuilderÁl±#
|
|||
|
|
»ý$& test_utilÁLò ‚ $ç À quantileÁ æ … » parse_quantilesÁ registryÁ
|
|||
|
|
storageÁ StorageÁ œ CounterÁ GaugeÁ HistogramÁ counterÁ gaugeÁ histogramÁ œ š ¨ ´ Ä Ò Þ
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
recencyÁ 5 555555555 5
|
|||
|
|
5 5 5
|
|||
|
|
555555555555555 5 S¥ Sæ S get_innerÁ S get_generationÁ S with_incrementÁ X— X§ 5[¥ [ incrementÁ ] [ absoluteÁ _ 5a¥ aÆ c a decrementÁ e a setÁ g 5i¥ i recordÁ k 5m¥ m÷ 5p¥ p÷ 5s¥ s÷ 5v¤ væ 5yœ y¤ yš y¨ y´ yÄ yÒ yÞ 5 GenerationalAtomicStorageÁ 5 ƒ atomicÁ 5
|
|||
|
|
…œ …æ … should_store_counterÁ ˆ¤ ˆ … should_store_gaugeÁ ‹¤ ‹ … should_store_histogramÁ Ž¤ Ž … should_storeÁ ‘— ‘¤
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
RegistryHasherÁ
|
|||
|
|
RegistryHashMapÁ œœ œ§
|
|||
|
|
shard_countÁ Ÿ
|
|||
|
|
¡ê ¢ ¢ ¢
|
|||
|
|
¦œ ¦¤ ¦æ © © © ¦ clearÁ ¦ visit_countersÁ ®— ¦ visit_gaugesÁ °— ¦ visit_histogramsÁ ²— ¦ retain_countersÁ ´— ´ ¦
|
|||
|
|
retain_gaugesÁ ·— · ¦ retain_histogramsÁ º— º
|
|||
|
|
½œ ½¤ ½ get_hash_and_shard_for_counterÁ ½ get_hash_and_shard_for_gaugeÁ ½ get_hash_and_shard_for_histogramÁ
|
|||
|
|
Ãœ ä à delete_counterÁ à delete_gaugeÁ à delete_histogramÁ à get_counterÁ É Ã get_gaugeÁ Ë Ã
|
|||
|
|
get_histogramÁ Í
|
|||
|
|
Ïœ Ϥ Ï get_or_create_counterÁ Ò Ò§ Ò Ï get_or_create_gaugeÁ Ö Ö§ Ö Ï get_or_create_histogramÁ Ú Ú§ Ú Ï get_counter_handlesÁ Þ Ï get_gauge_handlesÁ à Ï get_histogram_handlesÁ â Û ä bucketÁ å ååååååååå å
|
|||
|
|
å å å
|
|||
|
|
åååå§ å DEFERRED_BLOCK_BATCH_SIZEÁ å BlockÁ ù¥ ù writeÁ ù readÁ ù slotsÁ ý ùó å €¥ €æ € next_lenÁ €‘ € is_quiescedÁ € dataÁ € pushÁ 別 劥 匥 Œã å�¥ �× å’¥ ’æ ’ is_emptyÁ ’‡& ’û% — ’ data_withÁ ™— ’ß › ’
|
|||
|
|
clear_withÁ �— � � å¡¥ ¡> ä ääÞ ¦ §æ § sumÁ §ü § bucketsÁ §° § record_manyÁ 'aÁ ¤ ää reservoirÁ ± ±±±±±±±±± ±
|
|||
|
|
± ± ±
|
|||
|
|
±±±± fastrandÁ à ± ReservoirÁ ż Åü ± È
|
|||
|
|
with_capacityÁ ȇ& È drainÁ ± DrainÁ ÌË( Ìâ( Ì
|
|||
|
|
unsampled_lenÁ Ì‘ Ì idxÁ ±ÒË( Ò sample_rateÁ ±ÕË( Õ› Õó ±Ù‘ ±ÛË( Ûã ± AtomicSamplingReservoirÁ Þ primaryÁ Þ secondaryÁ Þ use_primaryÁ Þ swapÁ ±ãæ ãì& ã‡& ã consumeÁ ç— ä summaryÁ é éééé î× éðæ ð
|
|||
|
|
with_defaultsÁ ð• ðþ ð mergeÁ õ ð minÁ ð maxÁ ðì& ðü ð estimated_sizeÁ éü× éää €° ä‚° ž „ „„„„„„„ HashableÁ Œ‘ Œ hashableÁ „ �‘ �†/ „’™ ’‘ ’†/ keyÁ — —— šæ šË/ š‚ š
|
|||
|
|
into_partsÁ ‚ ¢ NONEÁ ¢ COUNTERÁ ¢ GAUGEÁ ¢ HISTOGRAMÁ ¢ ALLÁ ¢» ¢ matchesÁ ª° ª± recoverableÁ ° °°°°°°°°° °
|
|||
|
|
° ° °
|
|||
|
|
° ¿£ ¿
|
|||
|
|
into_innerÁ °Â£ Âæ  buildÁ  installÁ °Ç£ Ç from_arcÁ °Ê£ Ê describe_counterÁ Ê describe_gaugeÁ Ê describe_histogramÁ Ê register_counterÁ Ê register_gaugeÁ Ê register_histogramÁ layersÁ Ó ÓÓÓÓÓÓÓÓÓ Ó
|
|||
|
|
Ó fanoutÁ ß ßßßßßßßßß ß
|
|||
|
|
ß ß ß
|
|||
|
|
ßßß ð
|
|||
|
|
from_countersÁ ßòÆ òÚ ßõ÷ ß÷ from_gaugesÁ ßùÆ ùƒ ù— ßý÷ ßÿ from_histogramsÁ ß�° ߃÷ ß FanoutÁ … recordersÁ ß ‡× ß
|
|||
|
|
‰ò2 ‰Š3 ‰ 3 ‰º3 � ‰Ò3 � ‰è3 ‘ ß “× ß • add_recorderÁ –£ •¬2 Ó Ó Ó
|
|||
|
|
Ó prefixÁ œ œœœœœœœœœ œ
|
|||
|
|
œ ¨£ ¨
|
|||
|
|
prefix_keyÁ ¨ prefix_key_nameÁ œ¬£ ¬ò2 ¬Š3 ¬ 3 ¬º3 ¬Ò3 ¬è3 œ´æ µ¤ œ·£ ·° · layerÁ ÓÓÓÓ LayerÁ ¾£ ¾° ¾ó9 Ó Â£ Âæ ‡& Å� ÓÇ£ ǹ2 ÓÊ£ Êò2 ÊŠ3 Ê 3 ʺ3 ÊÒ3 Êè3 QuantileÁ Ò
|
|||
|
|
Òˆ Ò‰ Ö× Øƒ Û�
|
|||
|
|
AtomicStorageÁ Ý
|
|||
|
|
ß× 5
|
|||
|
|
GenerationÁ á
|
|||
|
|
ሠ5 5 åƒ 5
|
|||
|
|
5è× 5êÖ 5ì‹ 55ï� 5ñï
|
|||
|
|
5 GenerationalÁ ó¥ ó innerÁ ó5 5÷¥ ÷ƒ 5ú¥ ú× 5 GenerationalStorageÁ ý¤ ý©= 5€¤ €× 5 RecencyÁ ƒœ ƒ maskÁ ƒ©= ƒ idle_timeoutÁ 5ˆœ ˆ×
|
|||
|
|
RegistryÁ ‹œ ‹¤ ‹ countersÁ ‹ gaugesÁ ‹
|
|||
|
|
histogramsÁ ‹
|
|||
|
|
shard_maskÁ ‹Û
|
|||
|
|
“œ “¤ “× å AtomicBucketÁ —¥ — tailÁ 嚥 š× ¦´ �ü � boundsÁ �¡( �Ž( ¦¢× ¦¤ƒ ± FAST_RNGÁ ¦ __rust_std_internal_init_fnÁ ¦ ¨ © __RUST_STD_INTERNAL_VALÁ ¨ «¼A é SummaryÁ sketchÁ 鯃 é
|
|||
|
|
MergeErrorÁ ééé´ƒ é¶× „ DefaultHashableÁ ¸
|
|||
|
|
¸™ ¸ˆ „¼™ ¼× „¿™ ¿§ Áù „Ù Ã „Æ™ „È™ È� „Ë™ ËÖ „Ι Îï
|
|||
|
|
„ Ñ™ Ñ‹ — CompositeKeyÁ Ô
|
|||
|
|
Ôˆ Ô‰ —؃ —Ú× —ÜÖ —Þ§ ßù ——â� —äï
|
|||
|
|
—æ‹
|
|||
|
|
MetricKindÁ èš é
|
|||
|
|
è¨ ë
|
|||
|
|
è´ í
|
|||
|
|
ðƒ ó× õÖ ÷§ øù û�
|
|||
|
|
ýï
|
|||
|
|
ÿ‹ MetricKindMaskÁ �
|
|||
|
|
�ˆ „×
|
|||
|
|
†Ö ‰� ‹§ Œù �ƒ ’‹ ”ï
|
|||
|
|
° RecoveryHandleÁ –£ – handleÁ °™£ ™× ° RecoverableRecorderÁ œ£ œ‹H °Ÿ£ Ÿ× ° WeakRecorderÁ ¢£ ¢ recorderÁ °¥£ ¥× ß
|
|||
|
|
FanoutCounterÁ ¨”? ß
|
|||
|
|
ª× ß FanoutGaugeÁ ¬¤? ß®× ß FanoutHistogramÁ °²? ß²× ß
|
|||
|
|
FanoutBuilderÁ ´ê6 ߶> œ PrefixÁ ¸£ ¸‘8 ¸©= œ¼£ ¼× œ PrefixLayerÁ ¿
|
|||
|
|
¿ˆ œÂ× Ó StackÁ Ä£ Ä©= ÓÇ£ Ç×
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
#
|
|||
|
|
#
|
|||
|
|
$
|
|||
|
|
$
|
|||
|
|
%
|
|||
|
|
%
|
|||
|
|
V
|
|||
|
|
W
|
|||
|
|
X
|
|||
|
|
X
|
|||
|
|
]
|
|||
|
|
_
|
|||
|
|
c
|
|||
|
|
e
|
|||
|
|
g
|
|||
|
|
k
|
|||
|
|
|
|||
|
|
|
|||
|
|
€
|
|||
|
|
€
|
|||
|
|
�
|
|||
|
|
�
|
|||
|
|
ˆ
|
|||
|
|
ˆ
|
|||
|
|
ˆ
|
|||
|
|
‹
|
|||
|
|
‹
|
|||
|
|
‹
|
|||
|
|
Ž
|
|||
|
|
Ž
|
|||
|
|
Ž
|
|||
|
|
‘
|
|||
|
|
‘
|
|||
|
|
‘
|
|||
|
|
‘
|
|||
|
|
‘
|
|||
|
|
|
|||
|
|
®
|
|||
|
|
®
|
|||
|
|
®
|
|||
|
|
°
|
|||
|
|
°
|
|||
|
|
°
|
|||
|
|
²
|
|||
|
|
²
|
|||
|
|
²
|
|||
|
|
´
|
|||
|
|
´
|
|||
|
|
´
|
|||
|
|
·
|
|||
|
|
·
|
|||
|
|
·
|
|||
|
|
º
|
|||
|
|
º
|
|||
|
|
º
|
|||
|
|
À
|
|||
|
|
À
|
|||
|
|
Á
|
|||
|
|
Á
|
|||
|
|
Â
|
|||
|
|
Â
|
|||
|
|
Æ
|
|||
|
|
Æ
|
|||
|
|
Ç
|
|||
|
|
Ç
|
|||
|
|
È
|
|||
|
|
È
|
|||
|
|
É
|
|||
|
|
É
|
|||
|
|
Ë
|
|||
|
|
Ë
|
|||
|
|
Í
|
|||
|
|
Í
|
|||
|
|
Ò
|
|||
|
|
Ò
|
|||
|
|
Ò
|
|||
|
|
Ö
|
|||
|
|
Ö
|
|||
|
|
Ö
|
|||
|
|
Ú
|
|||
|
|
Ú
|
|||
|
|
Ú
|
|||
|
|
Þ
|
|||
|
|
à
|
|||
|
|
â
|
|||
|
|
ƒ
|
|||
|
|
ƒ
|
|||
|
|
„
|
|||
|
|
…
|
|||
|
|
†
|
|||
|
|
‡
|
|||
|
|
Ž
|
|||
|
|
‘
|
|||
|
|
‘
|
|||
|
|
‘
|
|||
|
|
•
|
|||
|
|
–
|
|||
|
|
—
|
|||
|
|
™
|
|||
|
|
™
|
|||
|
|
›
|
|||
|
|
›
|
|||
|
|
�
|
|||
|
|
�
|
|||
|
|
¨
|
|||
|
|
©
|
|||
|
|
ª
|
|||
|
|
«
|
|||
|
|
¬
|
|||
|
|
|
|||
|
|
Ê
|
|||
|
|
Ë
|
|||
|
|
Ô
|
|||
|
|
Ø
|
|||
|
|
Ù
|
|||
|
|
Ú
|
|||
|
|
Ý
|
|||
|
|
å
|
|||
|
|
æ
|
|||
|
|
ç
|
|||
|
|
ç
|
|||
|
|
ï
|
|||
|
|
ï
|
|||
|
|
ï
|
|||
|
|
ó
|
|||
|
|
ô
|
|||
|
|
õ
|
|||
|
|
õ
|
|||
|
|
÷
|
|||
|
|
ø
|
|||
|
|
ù
|
|||
|
|
ú
|
|||
|
|
û
|
|||
|
|
ý
|
|||
|
|
ý
|
|||
|
|
ý
|
|||
|
|
�
|
|||
|
|
ƒ
|
|||
|
|
Ž
|
|||
|
|
‘
|
|||
|
|
•
|
|||
|
|
œ
|
|||
|
|
�
|
|||
|
|
¨
|
|||
|
|
©
|
|||
|
|
É
|
|||
|
|
Ì
|
|||
|
|
Í
|
|||
|
|
Î
|
|||
|
|
Ï
|
|||
|
|
Ï
|
|||
|
|
Ï
|
|||
|
|
Ï
|
|||
|
|
Ð
|
|||
|
|
Ð
|
|||
|
|
Ð
|
|||
|
|
Ð
|
|||
|
|
Ñ
|
|||
|
|
Ñ
|
|||
|
|
Ñ
|
|||
|
|
Ñ
|
|||
|
|
ó
|
|||
|
|
ô
|
|||
|
|
ú
|
|||
|
|
û
|
|||
|
|
ü
|
|||
|
|
‚
|
|||
|
|
ˆ
|
|||
|
|
ˆ
|
|||
|
|
ˆ
|
|||
|
|
Š
|
|||
|
|
‹
|
|||
|
|
Œ
|
|||
|
|
�
|
|||
|
|
�
|
|||
|
|
�
|
|||
|
|
�
|
|||
|
|
�
|
|||
|
|
�
|
|||
|
|
�
|
|||
|
|
�
|
|||
|
|
‘
|
|||
|
|
‘
|
|||
|
|
‘
|
|||
|
|
‘
|
|||
|
|
”
|
|||
|
|
”
|
|||
|
|
”
|
|||
|
|
ª
|
|||
|
|
ª
|
|||
|
|
«
|
|||
|
|
®
|
|||
|
|
¯
|
|||
|
|
°
|
|||
|
|
±
|
|||
|
|
±
|
|||
|
|
±
|
|||
|
|
±
|
|||
|
|
²
|
|||
|
|
²
|
|||
|
|
²
|
|||
|
|
²
|
|||
|
|
³
|
|||
|
|
³
|
|||
|
|
³
|
|||
|
|
³
|
|||
|
|
º
|
|||
|
|
Á
|
|||
|
|
Ì
|
|||
|
|
Í
|
|||
|
|
Î
|
|||
|
|
Ï
|
|||
|
|
Ï
|
|||
|
|
Ï
|
|||
|
|
Ï
|
|||
|
|
Ð
|
|||
|
|
Ð
|
|||
|
|
Ð
|
|||
|
|
Ð
|
|||
|
|
Ñ
|
|||
|
|
Ñ
|
|||
|
|
Ñ
|
|||
|
|
Ñ
|
|||
|
|
×
|
|||
|
|
×
|
|||
|
|
×
|
|||
|
|
Ù
|
|||
|
|
Ü
|
|||
|
|
Ü
|
|||
|
|
à
|
|||
|
|
à
|
|||
|
|
à
|
|||
|
|
æ
|
|||
|
|
é
|
|||
|
|
é
|
|||
|
|
é
|
|||
|
|
ë
|
|||
|
|
í
|
|||
|
|
í
|
|||
|
|
ð
|
|||
|
|
ð
|
|||
|
|
ò
|
|||
|
|
ò
|
|||
|
|
ù
|
|||
|
|
ü
|
|||
|
|
ü
|
|||
|
|
ü
|
|||
|
|
‚
|
|||
|
|
‚
|
|||
|
|
‚
|
|||
|
|
Š
|
|||
|
|
Š
|
|||
|
|
Š
|
|||
|
|
–
|
|||
|
|
–
|
|||
|
|
–
|
|||
|
|
œ
|
|||
|
|
œ
|
|||
|
|
œ
|
|||
|
|
£
|
|||
|
|
£
|
|||
|
|
£
|
|||
|
|
¥
|
|||
|
|
°
|
|||
|
|
µ
|
|||
|
|
·
|
|||
|
|
·
|
|||
|
|
·
|
|||
|
|
¾
|
|||
|
|
¾
|
|||
|
|
¾
|
|||
|
|
Á
|
|||
|
|
Á
|
|||
|
|
Å
|
|||
|
|
Ê
|
|||
|
|
Ê
|
|||
|
|
Í
|
|||
|
|
Ð
|
|||
|
|
Ð
|
|||
|
|
Ó
|
|||
|
|
Ó
|
|||
|
|
Ù
|
|||
|
|
Û
|
|||
|
|
Û
|
|||
|
|
Û
|
|||
|
|
Ý
|
|||
|
|
ß
|
|||
|
|
ß
|
|||
|
|
ã
|
|||
|
|
ã
|
|||
|
|
å
|
|||
|
|
å
|
|||
|
|
ç
|
|||
|
|
ç
|
|||
|
|
ñ
|
|||
|
|
ô
|
|||
|
|
ô
|
|||
|
|
ô
|
|||
|
|
ö
|
|||
|
|
ø
|
|||
|
|
ø
|
|||
|
|
ü
|
|||
|
|
ü
|
|||
|
|
þ
|
|||
|
|
þ
|
|||
|
|
€
|
|||
|
|
€
|
|||
|
|
…
|
|||
|
|
…
|
|||
|
|
…
|
|||
|
|
‡
|
|||
|
|
Š
|
|||
|
|
Š
|
|||
|
|
Œ
|
|||
|
|
Œ
|
|||
|
|
�
|
|||
|
|
“
|
|||
|
|
“
|
|||
|
|
•
|
|||
|
|
•
|
|||
|
|
›
|
|||
|
|
›
|
|||
|
|
›
|
|||
|
|
¡
|
|||
|
|
¡
|
|||
|
|
¡
|
|||
|
|
§
|
|||
|
|
§
|
|||
|
|
§
|
|||
|
|
«
|
|||
|
|
«
|
|||
|
|
«
|
|||
|
|
¯
|
|||
|
|
¯
|
|||
|
|
¯
|
|||
|
|
³
|
|||
|
|
³
|
|||
|
|
³
|
|||
|
|
¾
|
|||
|
|
¾
|
|||
|
|
¾
|
|||
|
|
Ã
|
|||
|
|
Ã
|
|||
|
|
Ã
|
|||
|
|
É
|
|||
|
|
É
|
|||
|
|
É
|
|||
|
|
Œ¾¿c Ò Ò Óª; Ôˆ Õ‰ l
|
|||
|
|
A5"z ØÎZ ÐìÎZ µßÎZÎZ ¿c Ý Ý Þö; &�(3#
|
|||
|
|
´[ œ Û á á â›< ㈠5 w¸
|
|||
|
|
H¾þ·‘ Øð[ Š ð[ ¿cð[ ™ð[ ºð[ Ðìð[ µßð[ð[ íßð[ð[ Ø ó ó �= õ©= 5 ö5 5 §7°· p ¥ ¿c�] ì�] ï�] ó�] é …… š †©=ç óŒË.ò7p �] é ‰‰ ¨ Š©=ç }‘Ä�¶ÁÀ �] é �� ´ Ž©=ç áÓTu POH �] ¿c ý ý ä= ÿ©= 5 ‡ÙŠÒƒ$! ¤ ý ý ä= ÿ©= 5 ‡ÙŠÒƒ$!¤ã[ ¿c ƒ ƒ ¢> …¹> 5 †©= 5 ‡Í> 5 »Œi¨˜gÓbã[ ¿c ‹ ‹ ô> Ž”?
|
|||
|
|
�¤?
|
|||
|
|
�²?
|
|||
|
|
‘Ä?
|
|||
|
|
’Û
|
|||
|
|
h`×#5Îã[û_ Ìì ù ù ó$ ûˆ% å ü•% å ý¡% å ÿó å ç‹Í›Ûrȸ] � ¿a Œ"¿a ¿c¿a ¿c — — ú? ™–@ å ”’œUäl^G¸] ³ ¹b ¿c � � ´ žü ¦ ŸÇ@ ¦ ¡( ¦ ¡Ž( ¦ –Ø ‹õ#ÇF Øûb ùM Ì Ì * Îâ( ± ÏÊ* ± Б ± Ñç* ± lhŠ„ËY¿á Ë( ÃM Ì Ì * Îâ( ± ÏÊ* ± Б ± Ñç* ± lhŠ„ËY¿á 8 Œ"Þc Ø èA ®÷A é §Óbß�Ħ ¿c¥e Š ± ± ’B lð7�¯ Ûäe Øäe ¿cäe Äcäe ¾ äe ó — — ú? ™–@ å ”’œUäl^G ó Þ Þ Ñ+ ßð+ ± àÿ+ ± á�, ± â£, ± õ¤`QH(f Œ¤¤ KeyÁ ¥Ð ª ¦ labelsÁª §§ª Xšâ\ŽªÎš ¿c ¸ ¸ ¹ÈB »ˆ ¼ßqÒËe ™ še¦h ئh Ðì¦h µß¦h¦h ™¦h íߦh¦h º¦h Œ¦h Ø Ô Ô ÕœD Öˆ — ׉ — ž}´’?v† ¿c»i ™»i še»i Ðì»i µß»i»i íß»i»i º»i Û è é êš ë ì¨ í î´ Q³Y„C ØÏj Š Ïj ¿cÏj ™Ïj šeÏj ÐìÏj µßÏjÏj íßÏjÏj ºÏj ¿c � � ‚ØF ƒˆ íwV³Ä[ ™ÿk Ðìÿk µßÿkÿk šeÿk Ûÿk Øÿk Š ÿk ºÿk íßÿkÿk –úÿkÿk ¿c – – íG ˜‹H ° n~”yô£ £ ¿c œ œ ®H ž‹H ° ŒQµÅ-×m ¿c ¢ ¢ îH ¤ŠI ° ä›[×mðé×m ÿœn ¿c ¨ ¨ ¯I ©”? ß #¡.jda ìÞn é í]Þn ¿c ¬ ¬ ÙI ¤? ß IÚ½%Î[D1 ïªo é ¥^ªo ¿c ° ° �J ±²? ß «å¬ONU' óöo é Ý^öo ¿c … … Ü6 †ê6 ß ‰ªY[¶� ÿÂp ³ ´ ´ J µê6 ß H ØJ²dJÏ ¿c�q ¿c ¸ ¸ ÖJ º‘8 œ »©= œ , ŒZ¢
|
|||
|
|
×m ÿÀq ¿c ¿ ¿ À‘K Áˆ œ ç0¿"ç á ¾Žr×m ¿c Ä Ä ¾K Æ©= Ó W( ‰ŠÏ3“×m ÿÔr Ö Òß Ýè áú ó€ ýˆ ƒ“ ‹� ùš —¢ �î ¶ ±¼ ¸Ú Ôó è„ �™ –Ÿ œ¥ ¢ª ¨® ¬² °‡ …“ ´¼ ¸Â ¿Ç ÄØ Òå á÷ ó¤ �¯ ´ ±Ã ¸Ø Ôð è� �Ú Òî áÆ ¸á Ôú èˆ �Û Òï áÈ ¸â Ôû è‰ � Ýy ýä á³ ±ï èŽ �ç á² ±ò è‘ �ê áË ¸Ü Ôõ è† �ì áÑ ¸æ Ôÿ è’ �ñ áÎ ¸ä Ôý è” �[ óò ¨a óù ¬i ó€ —‚ Þ� °m…p‰s�õ…ý‰ƒ�ˆ ùŠ ùŒ ùÛ Ì¡ —¶ ´Õ ÌÙ Ìü ±þ ±�¤’ ¸¿ ¸Þ Ô÷ è‹ �ª �Ê ¢‰ …¬ ¸Ê Ä· ¿¿cúØ
|
|||
|
|
½ÐìFµß* *Û Š ™ º#íß#ì#ï
|
|||
|
|
ó
|
|||
|
|
é Ìì'� Œ"³ ùMÃMÄc¾ Œše–ú ÿ ¾ @ 64Á £z 32Á @ £z
|
|||
|
|
BLOCK_SIZEÁù:· ™e
|
|||
|
|
|
|||
|
|
é:· e
|
|||
|
|
¾î0î0
|
|||
|
|
UnsafeCellÁ ð0»Ì- ·}—KEüC£'�'� Xoshiro256StarStarÁ '‘¾'ú “½^'ZDŸ0 ù:Õ úe ¨ ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡z٠ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙƒ{ ƒ{ ‹|± T ù9�f�a ¦ ®® £ °©=¨ it§ÅLS¶ƒ{ á9¢fa X ¨‹| ‹| _Á ù:ð e
|
|||
|
|
é:ð e
|
|||
|
|
Ѓ{ / 5 ù:¦ ®e © �|£} / ‹| :¿ e ù:í Ôe ù:‚!e «“–¥ # ‹| :›!e M :À$e ù:Û ôe ¨ ‹| ©“–¥ å «“–¥ Ÿ S _Á $î ô ¼á Ô ÷ þ › üšd »i dÊ Ïj $« Ðg ½ Ïj ˆ Ðg | ‚# Ë/' Q Œô
|
|||
|
|
� ƒ üÓ
|
|||
|
|
3 £ ÿk tã
|
|||
|
|
% _Á ŒÊ � Ù ü¦6 ¤ ÿk t¹ % _Á Œœ � « üú4 ¥ ÿk t‹ % _Á Œö � … üÐ8 ¦ ÿk tå % _Á ŒÈ � × ü¨2 § ÿk t· % _Á œ» Ò Ó ( ÎZ 3 íf : úHúH ß ûHÁ‘4 Ýf‰úM÷ l s ¬• á â % ð[ 0 £z 7 > ü˜#
|
|||
|
|
¸ Õh ¹ ) ¦h 4 Õh ; B ¼± Ô Õ ( »i 3 Ïj : Ðg A H Ì€
|
|||
|
|
� ‚ % ÿk 0 7 > ´„ ¿ À % Žr 0 9 @
|
|||
|
|
ä„— °ÓÀ ¦|¶ ª;DÇ Ò œDdÎ Ô ŸETö è ®ØFt‚ � ¯®Hœº œ Òî.D¨ Œ –ÈB|£
|
|||
|
|
¸ –ÈB ¹ –ü ü ü A > Helper types and functions used within the metrics ecosystem.Á
|
|||
|
|
ä„— °ÓÀ ¦ ª; Ò œD Ô ŸE è ®ØF � ¯®H
|
|||
|
|
œ Òî. Œ –ÈB ¸ –ÈB ¹ –·º½d� D“ ÒÓlÞ ÎZ üî% üò; 8 Creates a new [`Quantile`] from a floating-point value.Á ²ú üº/ , All values are clamped between 0.0 and 1.0.Á õ ífÎZ
|
|||
|
|
þDùÜš üë
|
|||
|
|
* ' Gets the human-friendly display label.Á,¡ Ê ÊÎZ Ê §
|
|||
|
|
$¨ Ô€ üÛ Gets the raw quantile value.Á,‡ Ë ËÎZ íf �
|
|||
|
|
$Ž ü�
|
|||
|
|
: üµ K H Parses a slice of floating-point values into a vector of [`Quantile`]s.Á|ˆ
|
|||
|
|
Ì Ì
|
|||
|
|
íf ªBªB ö B bufÁ÷< ®B‘÷< 9)
|
|||
|
|
-ÜnLÎZçEçEèE GlobalÁ ¿±‡§í# £
|
|||
|
|
|
|||
|
|
quantilesÁL˜
|
|||
|
|
×
|
|||
|
|
<closure_kind>Á <closure_signature>Á <upvars>Á íf ÎZ ¥t¥ EH;>„¤ ü % " High-performance metrics storage.Á »Ì¤Ù äÓ D¬ 5›œŸ‹ BuildHasherDefaultÁ”I Êe
|
|||
|
|
' repeatÁ4g �K
|
|||
|
|
( PoisonErrorÁ\z Ñ@
|
|||
|
|
*Ò4‡ °?
|
|||
|
|
+ RawEntryMutÁ\® —
|
|||
|
|
-�<» ¨
|
|||
|
|
.Úf Ó ¤
|
|||
|
|
0 KeyHasherÁLØ
|
|||
|
|
1ö;lö Ý 3ö; Þ 3…<… 4›<T á •�=d¬ ó –Å̺ ‚ —ä=œÕ ý ˜¢><ê ƒ ™î.D‚ Œ
|
|||
|
|
š –\' <+
|
|||
|
|
ÝÞK †J AtomicU64ÁL, æ CounterFnÁL7 ì GaugeFnÁ<B ï HistogramFnÁ\K ó ú?dn — ¥t•<”#‚hjSU:<ä^/¤Ë ü}M J Defines the underlying storage for metrics as well as how to create them.Á <Õ œ Îì üËñ Íìœ Ý ™›, ™›2 Íì¡›µ› üŠ ìð› L˜ Øð› ,¤ è›) „œ ”œ Íì¡›µ› äÒ ï¿œ <Þ Ø¿œ ,è ·œ( Òœ ✠Íì¡›µ› üš$ ó�� \ª Ø�� ,¸ …�) ¡� ±� $' üŠ üæ The type used for counters.Á<� ÜÒ ì° The type used for gauges.Á,× üš# üô! The type used for histograms.ÁLŸ üæ, ìÄ Creates an empty counter.Á<é Í Î Í¡› ε› ð› ñ
|
|||
|
|
¡›µ›$òË/ øü¸( ܘ Creates an empty gauge.Á,» Ï Ð Ï¡› е› ¿œ Á
|
|||
|
|
¡›µ›$ÂË/ ÈüŠ0 üæ Creates an empty histogram.ÁL� Ñ Ò Ñ¡› Òµ› �� —
|
|||
|
|
¡›µ›$˜Ë/ žü‰$ œ Íìã[ Ž´[ !"#$% # % $ .0 d´<¹ †J†J K ‰Jµ �7 ŠJ phantomÁ�7 ‹J¤�7 ·0ØQd�è¤]¤] V ¦]Á‚] üß3ø¤”&¨“T×,Ü ö£tøLý †J†J K ‰Jµ �7 ŠJ”£�7 ‹J¤�7 ·0ØQd�è¿f¨“ü¦)<© Ó Ô Ó´[ Ôã[ ´[ã[ ±
|
|||
|
|
#ã[$² ¸ü� %,„ Õ Ö Õ´[ Öã[ ´[ã[ Š
|
|||
|
|
$ã[$‹ ‘ üØ -LÛ × Ø ×´[ Øã[ ´[ã[ å
|
|||
|
|
%ã[$æ ì 8ÄCX daF ü8?0 3 $ ' L˜¬¤ <Éûþåè<ìÝàÁÄ\¬ »ßœ–Ü� <°
|
|||
|
|
‚áâóýƒ AtomicUsizeÁ\§
|
|||
|
|
„Ä 5 7®D´
|
|||
|
|
¼À 5 8K Ï
|
|||
|
|
†J 5 :¤,Ô
|
|||
|
|
µ> 5 ;£•\Û
|
|||
|
|
Ñ@ 5 < DurationÁDø
|
|||
|
|
Ö 5 =�<™ ð 5 ? DerefMutÁD§ ö! 5 @š<Á … 5 B’˜LÊ ì 5 C¨,Õ ‰ 5 D˜<Ü ï 5 E´Lå � 5 FƘ\ð ó 5 G ClockÁ,‹ † 5 I InstantÁ<’  5 Jî.‚ Œ 5 K –ØFtÉ � 5 Mö;lè Ý 5 O 3ö; Þ 5 O 3ô>D÷ ‹ 5 P…<� 5 Q 4ET� è 5 R ®Œ“
|
|||
|
|
çêÙÜLÃ
|
|||
|
|
ÐÓÃƵ¸œí
|
|||
|
|
¤ † ¤Œ ›l¢ ‡<· {~mp`cRUEH7:4‚ ),|¡ Ž,¶ ¤Ã ü¶/ öøÎпÁ®°¼÷ ¥ T T Íì¸] ü �]UVWX ü¾# Á 5 ¸]�] S S
|
|||
|
|
U¸]©=,Å ìß ü²( % Gets a reference to the inner value.ÁLæ Ù Ù�] Ù¸] S ð S
|
|||
|
|
V¸]$ñ üÃ* üž Gets the current generation.ÁtÊ Ú Ú�] ð[ S Ù S
|
|||
|
|
W¸]$Ú ü€ O ü°K H Acquires a reference to the inner value, and increments the generation.Át‡ Ü
|
|||
|
|
¸] € ‘ €
|
|||
|
|
†¸]$’ ü½"-$Ä" ¿a ¸]Ö¿Ù¿ Ú¿« Û¿ˆ Ü¿ Ý¿Þ¿ˆ ‚†f|Â
|
|||
|
|
¥¸] € É" €
|
|||
|
|
‡¸]$Ê"»,Ð"üÃ)& ¥ ‰ ‰ ó® Ï) Ì¿$Ò)¿a üí)& ¥ ‹ ‹ ó® ù) Ü¿$ü)¿a ̘* ¥ � � ó® �*¿aŽ �" Ž ”¸*$»* ® ®¿a¥ Œ À* Œ
|
|||
|
|
Ž¸]$Å*üƒ.$ ¥ � � ó® ˆ.¿a‘ Àc ‘ ü®.B ±. ¯ ° ± ¯¿a ° c c ˆ ¢cµ
|
|||
|
|
` £cû‘ ` àB¤GS
|
|||
|
|
±Ö¿Ù¿ Ú¿« Û¿ˆ Ü¿ Ý¿Þ¿ˆ ‚†f|Â
|
|||
|
|
¥ŸÈŸÈ È ErrorÁ O˜éBL � µ. �
|
|||
|
|
‘¸]$¶.± ¼.¼É; ¥ “ “ ó® Î;¹b”•–—™›� ¤Œ< üç; Creates a new, empty bucket.Á “< ¹b ’ ’
|
|||
|
|
”¸]ô�= üÜ</ , Checks whether or not this bucket is empty.ÁD—= ² ²¹b ’ = ’
|
|||
|
|
•¸]$¡=äŽA üã@& # Pushes an element into the bucket.Á$•A ³ ³¹b ¸]¥ ’ šA ’
|
|||
|
|
–¸]$›A»,¡AüÕZ8 üðV7 4 Collects all of the elements written to the bucket.Á ¬Wú ü´WX U This operation can be slow as it involves allocating enough space to hold all of theÁ ü‘Xi f elements within the bucket. Consider [`data_with`](AtomicBucket::data_with) to incrementally iterateÁ üÿX* ' the internal blocks within the bucket.Á ®Yú ü¶YX U Elements are in partial reverse order: blocks are iterated in reverse order, but theÁ ü“Z= : elements within them will appear in their original order.Á$ÜZ ´ ´¹b ªBªB ö Bû‘÷< ®B‘÷< 9)
|
|||
|
|
-ÜnL¸]¨“ ’ áZ ’ ظ] ,‡[
|
|||
|
|
—¸]$âZ<Ð[ —”“ ˜ ¬“ ˜ É“ ˜ ˜ — ˜¸] ñÕ ¥ Øäü”^F ü”\T Q Iterates all of the elements written to the bucket, invoking `f` for each block.Á í\ú üõ\XŽâ üÒ]=ðâL›^ ¶ ¶¹b ò²¥ ’— š š ¨^ ’ ª³ ¥^ µ “"ò² µñÕ \Î^ µ ò²¾è˜" ¥
|
|||
|
|
™¸]ò²$©^± ³^]_ œÇh ´•f Clears the bucket.Á °fú ü¸f[ X Deallocation of the internal blocks happens only when all readers have finished, and soÁ ü˜gK H will not necessarily occur during or immediately preceding this method.Á ègú Tðg # NoteÁ üÿgC @ This method will not affect reads that are already in progress.Á,Îh ¸ ¸¹b ¥ ’ Ôh ’
|
|||
|
|
›¸]$ÕhLõh ›”“ œ ¬“ œ É“ œ œ › œ¸]¥æ¥ü×pG üŽiI F Clears the bucket, invoking `f` for every block that will be cleared.Á Üiú üäi[Íè üÄjK²é ”kú üœk_ \ This method is useful for accumulating values and then observing them, in a way that allowsÁ ü€lE B the caller to avoid visiting the same values again the next time.Á Êlú üÒlY V This method allows a pattern of observing values before they're cleared, with a clearÁ ü°m^ [ demarcation. A similar pattern used in the wild would be to have some data structure, likeÁ ü“n] Z a vector, which is continuously filled, and then eventually swapped out with a new, emptyÁ üõnX U vector, allowing the caller to read all of the old values while new values are beingÁ üÒo! written, over and over again.Á øoú T€p’ê ü�pC¦êTÞp º º¹b ò²¥ ’— ž ž ìp ’ ª³ ép ¹ “"ò² ¹ñÕ \’q ¹ ò²¾ô˜" ¥
|
|||
|
|
�¸]ò²$íp± ÷p]_ <ò€ �”“ Ÿ ¬“ Ÿ É“ Ÿ Ÿ � Ÿ¸]ò² ¥¥ ªBªB ö Bû‘÷< ®B‘÷< 9)
|
|||
|
|
-ÜnL � � ÒÊ „û% …ÌÐ Ê,8ܪÏý ¿a¨“<÷ƒ �”“ ¬“ É“ � ¸]ò²ñõüõü•‡# ¥ ¢ ¢ ó® š‡¹b£ ´ £ ¤¿‡<‡ ¹b ¡ ¡
|
|||
|
|
£¸]¤FKÔe=l‚ L†ä�t‡ ûb¨©ª«¬ üõ/ ôœ Creates a new `Histogram`.Á ¿ú üÇ) & If `bounds` is empty, returns `None`.Á ü » »ä’ ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡z
|
|||
|
|
Records a single sample.Á4– ¿ ¿ûbíf¥ § � §
|
|||
|
|
¬ $¢ sampleÁ4¨ ü�h ìë
|
|||
|
|
Records multiple samples.Á\” À Àûbû_¥ § Ë( ® ¤ ¯ ¯ ® § § ÛÅ ¤ ÇLû_ äÓ û_ÈL Ë(íf tà û_ Ë(ò
|
|||
|
|
Ë(û_$¬ samplesÁ<² ce ®Ô™C Œ¶ ü ! An atomic sampling reservoir.Á L¾ ÃÅÌÞ¦�zT8 î0 ± ³
|
|||
|
|
AtomicBoolÁTn ¬] ± ¶ö—Lz æ ± ·É¨\… „Ä ± ¸G<© ÁÀ ± ºG ÂÀ ± ºË<² ½À ± »Ë ¾À ± »Ì<» ¿À ± ¼Ì ÀÀ ± ¼¤,Ø µ> ± ½ OsRngÁ,û !Ö ± ¿¸„ !× ± ¿ RngÁ ‚ ø ± À SeedableRngÁ\‡ !¬ ± ÁÅz”§ '� ±  '„2vü'%ü'7cfTWDGü'9<îðÆÈ$î\õ¸ŒŽprü™ düÝ"Dà ± £z£z
|
|||
|
|
à upperÁ,é,” à ”“ Ä ¬“ Ä É“ Ä Ä Ã Ä ƒ{ £z £z „Á Lȱ Å Å Ý) Ƽ ± Çü ± Ê"¿Ëƒ¹@ Ê"¿Ëƒ¹@ ÆÇÄØ4ر Å Å �� ž BoxÁ ¡ˆˆ ¢‰ˆ l }.xÏ
|
|||
|
|
¤¨“”ö,ö± Å Å «Ït� ÒˆÉÊË ü¢)l¥ ± £zÒˆ È È
|
|||
|
|
É capacityÁD³Ôµ $¸ ± Á ÁÒˆ íf¥ È ½ È
|
|||
|
|
Ê $¾ »,Ä ä¿ , ±  ÂÒˆ Ì Ì * Îâ( ± ÏÊ* ± Б ± Ñç* ± lhŠ„ËY¿á Â È È È
|
|||
|
|
Ë $É ¤ù üÀ8 5 A draining iterator over the samples in a reservoir.Á ,„ Ë( Í Í Þc lhŠ„ËY¿á ÎÏÐÑ ÝŠÄ”L”± Ì Ì Ë(Òˆ ¤²l²± Ì Ì £zTÌ Ì± Ì Ì £zTÜ Ü± Ì Ì £z”ë Ë( Ó Ó ÞcÔ ðüÆ ü„I F Returns the sample rate of the reservoir that produced this iterator.Á Òú üÚt q The sample rate is the ratio of the number of samples pushed into the reservoir to the number of samples held inÁ üÓn k the reservoir. When the reservoir has not been filled, the sample rate is 1.0. When more samples have beenÁ üÆo l pushed into the reservoir than its overall capacity, the sample rate is `size / count`, where `size` is theÁ üºX U reservoir's capacity and `count` is the number of samples pushed into the reservoir.Á —ú üŸt q For example, if the reservoir holds 1,000 samples, and 100,000 values were pushed into the reservoir, the sampleÁ ü˜) & rate would be 0.01 (100,000 / 1,000).Á\Í Ã ÃÞc íf Ò Ù Ò
|
|||
|
|
Ô Ë($Úü� Ë( Ö Ö Þc×Ø úM ûM Ø †L§$¬ Õ Õ ífü½($À Ä ÄÞcۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙÞc úM Õ Å Õ
|
|||
|
|
Ø Ë($ÊüÈ$ 8 Å Å ½dÚ ÄM Ú ´ó ö Æ Æ½d £z Ù ú Ù
|
|||
|
|
Ú 8$ûܱ Ë( Ü Ü ÞcÝ �" Ý ¶”Ó$Ö Ç ÇÞc¥ Û Û Û
|
|||
|
|
Ý Ë($àü’!" ü¡!�‚ Ãú üÇx u [Reservoir sampling][rs] is a technique used to produce a statistically representative sample of a data stream, in aÁ üÀ } z fixed space, without knowing the length of the stream in advance. `AtomicSamplingReservoir` is a thread-safe version of aÁ ü¾ H E sampling reservoir, based on Vitter's ["Algorithm R"][vitter_paper].Á ‡ ú ü‹ o l Utilizes an A/B-based storage mechanism to avoid contention between producers and the consumer, and a fast,Á üû c ` thread-local PRNG ([Xoshiro256**][xoshiro256starstar]) to limit the per-call sampling overhead.Á ß ú üã : 7 [rs]: https://en.wikipedia.org/wiki/Reservoir_samplingÁ üž @ = [vitter_paper]: https://www.cs.umd.edu/~samir/498/vitter.pdfÁ üß 2 / [xoshiro256starstar]: https://prng.di.unimi.itÁ ¼�! ÷f õ¤`QH(f ßàáâ”»!<»!± Þ Þ Òˆ¤Ó!LÓ!± Þ Þ Òˆ¼í!\í!± Þ Þ ¤]¤] V ¦]Á‚] üß3ø¤”& |Š"$Š"± Þ Þ µ>µ> ¤ ·>©=£> ¸>•ð£> ¹>û%£> Ë»™z™g—¥äž" ÷fäåæç ü“# üÁ"M J Creates a new `AtomicSamplingReservoir` that stores up to `size` samples.Á š# £z÷f ã ã
|
|||
|
|
ä ™$ž#ôÉ% ü—%- * Returns `true` if the reservoir is empty.ÁDÐ% È È÷f ã Ù% ã
|
|||
|
|
å $Ú%ôõ' üÉ'' $ Pushes a sample into the reservoir.Á$ü' É É÷f íf¥ ã �( ã
|
|||
|
|
æ $‚(»,ˆ(ü©+I üÞ)P M Consumes all samples in the reservoir, passing them to the provided closure.Á ³*ú ü»*i f The underlying storage is swapped before the closure is called, and the previous storage is consumed.Á<°+ Ë Ë÷f —¥ ã — è è »+ ã Í줨 ¸+ Ê “"¤¨ Ì Ì * Îâ( ± ÏÊ* ± Б ± Ñç* ± lhŠ„ËY¿á Ê „á+ Ê ¤¨ñ¨˜" ¥
|
|||
|
|
礨$¼+
|
|||
|
|
` £cû‘ ` àB¤GS
|
|||
|
|
Î¦Û î � î
|
|||
|
|
ï $‚± ˆdà ¥eñòóôõ÷øùúû üþ C ôÖ Creates a new [`Summary`].Á ùú ü�` ] `alpha` represents the desired relative error for this summary. If `alpha` was 0.0001, thatÁ üæY V would represent a desired relative error of 0.01%. For example, if the true value atÁ üÄ` ] quantile q0 was 1, the estimated value at that quantile would be a value within 0.01% of theÁ ü©5 2 true value, or a value between 0.9999 and 1.0001.Á ãú üëc ` `max_buckets` controls how many subbuckets are created, which directly influences memory usage.Á üÓ^ [ Each bucket "costs" eight bytes, so a summary with 2048 buckets would consume a maximum ofÁ ü¶_ \ around 16 KiB. Depending on how many samples have been added to the summary, the number ofÁ üš ^ [ subbuckets allocated may be far below `max_buckets`, and the summary will allocate more asÁ üý 3 0 needed to fulfill the relative error guarantee.Á µ ú ü½ _ \ `min_value` controls the smallest value that will be recognized distinctly from zero. SaidÁ ü¡ X U another way, any value between `-min_value` and `min_value` will be counted as zero.Á … ífíf¥e ð ð
|
|||
|
|
ñ alphaÁ,‰ max_bucketsÁ\• min_valueÁL§ ü÷$! üÉ 2 / Creates a new [`Summary`] with default values.Á €!ú üˆ!J G `alpha` is 0.0001, `max_buckets` is 32,768, and `min_value` is 1.0e-9.Á ×!ú üß!` ] This will yield a summary that is roughly equivalent in memory usage to an HDRHistogram withÁ üÄ"N K 3 significant digits, and will support values down to a single nanosecond.Á —#ú üŸ#_ \ In practice, when using only positive values, maximum memory usage can be expected to hoverÁ üƒ$_ \ around 200KiB, while usage of negative values can lead to an average maximum size of aroundÁ \ç$ 400KiB.Álþ$ ¥e ð ð
|
|||
|
|
ò üé&! üÓ%! Adds a sample to the summary.Á ù%ú ü�&c ` If the absolute value of `value` is smaller than given `min_value`, it will be added as a zero.Á ð& Ï Ï¥eíf¥ ð ô& ð
|
|||
|
|
ó $ù&»,ÿ&üÍ*- üø'3 0 Gets the estimated value at the given quantile.Á °(ú ü¸(] Z If the sketch is empty, or if the quantile is less than 0.0 or greater than 1.0, then theÁ Ôš) result will be `None`.Á ¹)ú üÁ)_ \ If the 0.0 or 1.0 quantile is requested, this function will return self.min() or self.max()Á ü¥*# instead of the estimated value.ÁDÔ* РХe ífۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙíf ð Ý* ð
|
|||
|
|
ô $Þ*¼ ä*üù-B ü¹,( % Merge another Summary into this one.Á æ,ú dî, # ErrorsÁ ÿ,ú ü‡-Y V This function will return an error if the other Summary was not created with the sameÁ |å- parameters.Á,€. Ñ Ò Ñ¥e Ò¥e Ö¿Ù¿ Ú¿« Û¿ˆ Ü¿ Ý¿Þ¿ˆ ‚†f|Â
|
|||
|
|
¥äe ð †. ð
|
|||
|
|
õ $‹.¹
|
|||
|
|
,‘. ï. õ ”“ ö ¬“ ö É“ ö ö õ ö (O(P(Qª; (R(S MergeÁ u(ŽäREFÖ äe ¥ÄÛ/ üž/8 5 Gets the minimum value this summary has seen so far.Á â/ Ó Ó¥e íf ð æ/ ð
|
|||
|
|
÷ $ç/Äñ0 ü´08 5 Gets the maximum value this summary has seen so far.Á ø0 Ô Ô¥e íf ð ü0 ð
|
|||
|
|
ø $ý0ôü1 üÎ1) & Whether or not this summary is empty.ÁDƒ2 Õ Õ¥e ð Œ2 ð
|
|||
|
|
ù $�2äö2 üÂ2/ , Gets the number of samples in this summary.Á,ý2 Ö Ö¥e £z ð ƒ3 ð
|
|||
|
|
ú $„3üò4% ü¼36 3 Gets the estimized size of this summary, in bytes.Á ÷3ú üÿ3] Z In practice, this value should be very close to the actual size, but will not be entirelyÁ dá4 precise.Átù4 × ×¥e £z ð ˆ5 ð
|
|||
|
|
û $‰5üœ6 äeý Åc ý üÃ64 Æ6 Ø Ù Ú Øäe Ù c c ˆ ¢cµ
|
|||
|
|
` £cû‘ ` àB¤GS
|
|||
|
|
Ú¦Û ü Ê6 ü
|
|||
|
|
ý $Ë6± Ñ6ü¤7% äe ´ßBüø& ¿f� ô � ä¥4¨ Û Û¿f íf¥ € ¯ €
|
|||
|
|
� $°»,¶üç= ÷fƒ ô ƒ ä«4® Ü Ü÷f íf¥ ‚ µ ‚
|
|||
|
|
ƒ $¶»,¼T˜ 4œ Œ¸¹p,
|
|||
|
|
¿c „ …p Âc „ …Ž$%
|
|||
|
|
še „ ‡Ž e „ ‡‘4+
|
|||
|
|
¢e „ ˆÚf C
|
|||
|
|
¤ „ Š—–LH
|
|||
|
|
„ ‹|
|
|||
|
|
‹L
|
|||
|
|
ikEG<9
|
|||
|
|
8:')Äú
|
|||
|
|
üU
|
|||
|
|
A type that can hash itself.Á v
|
|||
|
|
ú üzd
|
|||
|
|
a In high-performance use cases, an object can pre-hash itself, or memoize its hash value, when itÁ üßa
|
|||
|
|
^ is anticipated that an object will be hashed multiple times. Rather than the standard libraryÁ üÁb
|
|||
|
|
_ `Hash` trait, `Hashable` exposes an interface that forces objects to hash themselves entirely,Á ü¤-
|
|||
|
|
* providing only the resulting 8-byte hash.Á Ò
|
|||
|
|
ú üÖa
|
|||
|
|
^ As a key may sometimes need to be rehashed, we need to ensure that the same hashing algorithmÁ ü¸b
|
|||
|
|
_ used to pre-generate the hash for this value is used when rehashing it. All implementors mustÁ ü›Q
|
|||
|
|
N define the hashing algorithm used by specifying the `Hasher` associated type.Á í
|
|||
|
|
ú üñ]
|
|||
|
|
Z A default implementation, [`DefaultHashable`], is provided that utilizes the same hashingÁ üÏc
|
|||
|
|
` algorithm that [`Key`][metrics::Key] uses, which is high-performance. This type can be used toÁ ü³F
|
|||
|
|
C satisfy `Hashable` so long as the type itself is already [`Hash`].Á D„
|
|||
|
|
Œ Œ ™›üú
|
|||
|
|
še¡› $Ž
|
|||
|
|
Œ ™›* ÛÚ ™›6 ÛÚ*�Ž�Ž Íì¡› � ôÌ
|
|||
|
|
¢e¤Û 4Ù
|
|||
|
|
³ ¤Û <â
|
|||
|
|
œÛ( ´Û ÄÛ Ž ìÌ
|
|||
|
|
ü™.
|
|||
|
|
+ The hasher implementation used internally.Á4Ñ
|
|||
|
|
Œ Œ Ìš
|
|||
|
|
üð%
|
|||
|
|
" Generate the hash of this object.ÁD�
|
|||
|
|
Ý Ý¡› Œ ¦
|
|||
|
|
Œ
|
|||
|
|
Ž¡›$§
|
|||
|
|
©
|
|||
|
|
|
|||
|
|
Ðg�‘ � Ž ‘ \Å
|
|||
|
|
|
|||
|
|
4Ê
|
|||
|
|
|
|||
|
|
� � ˜êÌã
|
|||
|
|
|
|||
|
|
Dæ
|
|||
|
|
|
|||
|
|
Þ ÞÐg � ï
|
|||
|
|
|
|||
|
|
�
|
|||
|
|
‘ $ð
|
|||
|
|
|
|||
|
|
üÅ-
|
|||
|
|
™ “ “ ÍìÕh Ê
|
|||
|
|
šeÕh $Í
|
|||
|
|
¦h”• � Ž • (* \ù
|
|||
|
|
4þ
|
|||
|
|
’ ’ ˜êÌ—
|
|||
|
|
Dš
|
|||
|
|
ß ß¦h ’ £
|
|||
|
|
’
|
|||
|
|
•Õh$¤
|
|||
|
|
4¬ <¸ ¼ ÔÕET è — ˜ ®Úf $ ¤ — ™Œ,dŒÜ »i›œ�ž üš< üô! Creates a new `CompositeKey`.Á § ÏjÐg»i š š
|
|||
|
|
› ‚ƒ@Ë/Œ@Ìà ü„: 7 Gets the inner key represented by this `CompositeKey`.Á Ê à à»i àÐg š Î š
|
|||
|
|
œ $Ïüº üú; 8 Gets the inner kind represented by this `CompositeKey`.Á$Á á á»i Ïj š Æ š
|
|||
|
|
� $Çü³, ü÷7 4 Takes the individual pieces of this `CompositeKey`.ÁTº »iÏjÐg š š
|
|||
|
|
ž $ÅŒÉ ÞDDÝ $á �‚è BitOrÁ, –ú ¡|œ
|
|||
|
|
ÿk£¤¥¦§¨© ôÓ
|
|||
|
|
¤º
|
|||
|
|
No metric kinds.Á$Ý
|
|||
|
|
¢ ¢ ÿkü¦! ¬Œ The counter kind.Á<° ¢ ¢ ÿküú œâ The gauge kind.Á,„ ¢ ¢ ÿküÐ# ¼´ The histogram kind.ÁLÚ ¢ ¢ ÿkì¨ ¬Ž All metric kinds.Á ² ¢ ¢ ÿk¬î,ñ â âÿk ¢ ÷ ¢
|
|||
|
|
¨ $øüå/ ü @ = Whether or not this metric kind contains the specified kind.Á<ì ã ãÿk Ïj ¢ ô ¢
|
|||
|
|
© $õ‚$ûìµ ÿk«¬ ˜ú ™ú ¬ \Ù4Þ ª ª ÿküò),õ ÿkÿkÿkÿk ˜ú ª ª
|
|||
|
|
¬ $û rhsÁ �$ï ðDðDEE|” \˜ œ–¢K †J ° ² WeakÁ$ ï7 ° ³š<0 … ° µ¨,9 ‰ ° ¶´L@ � ° ·Úf K ¤ ° ¸ KeyNameÁ<P ‘ ° ¹ MetadataÁDY ï ° º RecorderÁDc ÿ ° » SetRecorderErrorÁ„m Ñ ° ¼ì Ò ° ¼ SharedStringÁd ° ½ UnitÁ$‘ ¬ ° ¾LAD/2<!$' úüãåËͳµ“•acNPÌâ £ À À Íì×m ç©mÁ
|
|||
|
|
ü‡ TŽ ©m×m ¿ ¿
|
|||
|
|
Á×m$�üá@ £ à à üî æ ÿ×m Dé � ×m $ô Ìì×m $û ×m<‚ämÄÅÆ HJ üí ü¨@ = Creates a new `RecoverableRecorder` from the given recorder.Á ô ×mäm  Â
|
|||
|
|
Ä×mŠIDøü�@,� ° ämœn©m  Â
|
|||
|
|
Å×m$£üöF üÕM J Installs the wrapped recorder globally, returning a handle to recover it.Á §ú ü¯Y V A weakly-referenced version of the recorder is installed globally, while the originalÁ ü�` ] recorder is held within `RecoverableRecorder`, and can be recovered by calling `into_inner`.Á òú dúÌÁ ‹ú ü“^ [ If a recorder is already installed, an error is returned containing the original recorder.Á<ý ämÖ¿Ù¿ Ú¿« Û¿ˆ Ü¿ Ý¿Þ¿ˆ ‚†f|Â
|
|||
|
|
©mÑÑ Òì Ôˆ Ð$·xñªšg×m  Â
|
|||
|
|
Æ×m$…¼¦ £ È È üî « œnÉ
|
|||
|
|
üÄ &DÇ ° ä ä†J†J K ‰Jµ �7 ŠJ”£�7 ‹J¤�7 ·0ØQd�è×m¨“ œn Ç Ú Ç
|
|||
|
|
É×mŠIDÐ üª . £ Ë Ë üî ¯ ‰ðD² œnÌÍÎÏÐÑ € � ‚ ƒ „ … Ð Î Ì Ñ Í Ï QS üß W„â å åœn ‘‘ ’Úë “ˆª | £–u ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ¬® CountÁ ¯° PercentÁ ±² SecondsÁ ³´ MillisecondsÁ µ¶ MicrosecondsÁ ·¸ NanosecondsÁ ¹º TebibytesÁ »¼ GibibytesÁ ½¾ MebibytesÁ ¿À KibibytesÁ Á BytesÁ
|
|||
|
|
ÃÄ TerabitsPerSecondÁ ÅÆ GigabitsPerSecondÁ ÇÈ MegabitsPerSecondÁ
|
|||
|
|
ÉÊ KilobitsPerSecondÁ ËÌ
|
|||
|
|
BitsPerSecondÁ ÍÎ CountPerSecondÁ ¹÷< N�1Ö [[ o ^µ L _ metadataÁL ` _lifetimeÁL û©�]OR2 ¥ Ê ó Ê
|
|||
|
|
Ì×m$ô Ë/ ú ø$ˆ descriptionÁ\œ üÇ UtÊ æ æœn Áúóú›ÿ¥ Ê Ù Ê
|
|||
|
|
Í×m$Ú Ë/ à ø$î ¤ÿ\‚!ü«"Y”®" ç çœn Áúóú›ÿ¥ Ê Á" Ê
|
|||
|
|
Î×m$Â"Ë/ È"ø$Ö"¤ÿ\ê"ü—$I„š$ è é ê ë èœn éÐg êïï õë ñê¢ ò levelÁ¢ ó¹ ¢ tô{EÙ`€ ë í] Ê «$ Ê
|
|||
|
|
Ï×m$¬$Ë/ ²$´þD½$ü”&Et—& ì í î ï ìœn íÐg îïï õë ñê¢ òœ‚¢ ó¹ ¢ tô{EÙ`€ ï ¥^ Ê ¦& Ê
|
|||
|
|
Ð×m$§&Ë/ &´þD¸&ü‰(M”Œ( ð ñ ò ó ðœn ñÐg òïï õë ñê¢ òœ‚¢ ó¹ ¢ tô{EÙ`€ ó Ý^ Ê Ÿ( Ê
|